smt

I'm trying out some of the examples of a Z3 tutorial that involve recursive functions. I've tried out the following example. Fibonacci (Section 8.3) IsNat (Section 8.3) Inductive (Section 10.5) Z3 times out on all of the above examples. But, the tutorial seems to imply that only Inductive is non-terminating. Can Z3 check the satisfiability of formulas that contain recursive functions or it cannot handle any inductive facts? Leonardo de Moura These examples from the Z3 tutorial are there to illustrate limitations of the technology behind Z3. Z3 fails on these examples for two reasons: The

The theorem proving tool z3 is taking a lot of time to solve a formula, which I believe it should be able to handle easily. To understand this better and possibly optimize my input to z3, I wanted to see the internal constraints that z3 generates as part of its solving process. How do I print the formula that z3 produces for its back-end solvers, when using z3 from the command line? Leonardo de Moura Z3 command line tool does not have such option. Moreover, Z3 contains several solvers and pre-processing steps. It is unclear which step would be useful for you. The Z3 source code is available at

Suppose I have 2 arrays in a formula whose satisfiability I want to check using z3. If z3 returns sat, I want to read in the first array in the z3 model and pretty print it as a key, value pair and a default value. Later I want to convert it to a map and do further analysis on it. Here's the example I run: void find_model_example_arr() { std::cout << "find_model_example_involving_array\n"; context c; sort arr_sort = c.array_sort(c.int_sort(), c.int_sort()); expr some_array_1 = c.constant("some_array_1", arr_sort); expr some_array_2 = c.constant("some_array_2", arr_sort); solver s(c); s.add

I am trying to retrieve all possible models for some first-order theory using Z3, an SMT solver developed by Microsoft Research. Here is a minimal working example: (declare-const f Bool) (assert (or (= f true) (= f false))) In this propositional case there are two satisfying assignments: f->true and f->false . Because Z3 (and SMT solvers in general) will only try to find one satisfying model, finding all solutions is not directly possible. Here I found a useful command called (next-sat) , but it seems that the latest version of Z3 no longer supports this. This is bit unfortunate for me, and in