The function doesn't look to be tail-recursive, so my guess would be a stack overflow.

Of course, if you run it and get a stack overflow, you have no way of knowing whether the number was really a counterexample or just one that took many steps to reach 1.