translation to SMTLib format + binary search tree proved

Despite that the translation is now done through SMTLib format, is there any change regarding whether a constraint can be translated to Z3? I am curious because right now I rely on these exceptions to debug the prover. Anytime I see such exception, I know that it's very likely that the prover missed to prove something.