On the Subexponential Time Complexity of CSP