Description
Satisfiability problems over bit-vectors, floating-point arithmetic, arrays, and uninterpreted functions can be solved with an SMT solver. It is useful for formal methods, verification, symbolic execution, and research.
Solver results depend on models, constraints, and theory support. Validate encodings before trusting conclusions in safety or security work.