diff --git a/.gitignore b/.gitignore
index 65a69bf51..93194fc1b 100644
--- a/.gitignore
+++ b/.gitignore
@@ -9,6 +9,7 @@ callgrind.out.*
# OCaml generated files
*.a
*.cma
+*.cmo
*.cmi
*.cmxa
ocamlz3
@@ -64,6 +65,12 @@ src/util/version.h
src/api/java/Native.cpp
src/api/java/Native.java
src/api/java/enumerations/*.java
+src/api/ml/z3native_stubs.c
+src/api/ml/z3native.ml
+src/api/ml/z3enums.ml
+src/api/ml/z3native.mli
+src/api/ml/z3enums.mli
+src/api/ml/z3.mllib
*.bak
doc/api
doc/code
diff --git a/RELEASE_NOTES b/RELEASE_NOTES
index ad2dcaf00..bfadb8f75 100644
--- a/RELEASE_NOTES
+++ b/RELEASE_NOTES
@@ -1,16 +1,25 @@
RELEASE NOTES
-Version 4.3.3
+Version 4.4
=============
-- Fixed bug in floating point models
+- New feature: Support for the theory of floating-point numbers. This comes in the form of logics (QF_FP and QF_FPBV), tactics (qffp and qffpbv), as well as a theory plugin that allows theory combinations. Z3 supports the official SMT theory definition of FP (see http://smtlib.cs.uiowa.edu/theories/FloatingPoint.smt2) in SMT2 files, as well as all APIs.
+
+- New feature: Stochastic local search engine for bit-vector formulas (see the qfbv-sls tactic).
+ See also: Froehlich, Biere, Wintersteiger, Hamadi: Stochastic Local Search
+ for Satisfiability Modulo Theories, AAAI 2015.
+
+- Upgrade: This release includes a brand new OCaml/ML API that is much better integrated with the build system, and hopefully also easier to use than the previous one.
+
+- Fixed various bugs reported by Marc Brockschmidt, Venkatesh-Prasad Ranganath, Enric Carbonell, Morgan Deters, Tom Ball, Malte Schwerhoff, and Codeplex users rsas, clockish, Heizmann.
+
Version 4.3.2
=============
- Added preliminary support for the theory of floating point numbers (tactics qffpa, qffpabv, and logics QF_FPA, QF_FPABV).
-- Added the interpolation features of iZ3, which are now integrated into the Z3.
+- Added the interpolation features of iZ3, which are now integrated into Z3.
- Fixed a multitude of bugs and inconsistencies that were reported to us either in person, by email, or on Codeplex. Of those that we do have records of, we would like to express our gratitude to:
Vladimir Klebanov, Konrad Jamrozik, Nuno Lopes, Carsten Ruetz, Esteban Pavese, Tomer Weiss, Ilya Mironov, Gabriele Paganelli, Levent Erkok, Fabian Emmes, David Cok, Etienne Kneuss, Arlen Cox, Matt Lewis, Carsten Otto, Paul Jackson, David Monniaux, Markus Rabe, Martin Pluecker, Jasmin Blanchette, Jules Villard, Andrew Gacek, George Karpenkov, Joerg Pfaehler, and Pablo Aledo
diff --git a/doc/mk_api_doc.py b/doc/mk_api_doc.py
index 633f96c6b..476f2c8c7 100644
--- a/doc/mk_api_doc.py
+++ b/doc/mk_api_doc.py
@@ -31,6 +31,7 @@ try:
cleanup_API('../src/api/z3_polynomial.h', 'tmp/z3_polynomial.h')
cleanup_API('../src/api/z3_rcf.h', 'tmp/z3_rcf.h')
cleanup_API('../src/api/z3_interp.h', 'tmp/z3_interp.h')
+ cleanup_API('../src/api/z3_fpa.h', 'tmp/z3_fpa.h')
print "Removed annotations from z3_api.h."
try:
@@ -46,6 +47,7 @@ try:
os.remove('tmp/z3_polynomial.h')
os.remove('tmp/z3_rcf.h')
os.remove('tmp/z3_interp.h')
+ os.remove('tmp/z3_fpa.h')
print "Removed temporary file z3_api.h."
os.remove('tmp/website.dox')
print "Removed temporary file website.dox"
diff --git a/doc/z3api.dox b/doc/z3api.dox
index dbaa3c8b8..cb4569dc4 100644
--- a/doc/z3api.dox
+++ b/doc/z3api.dox
@@ -713,39 +713,10 @@ FILE_PATTERNS = website.dox \
z3_polynomial.h \
z3_rcf.h \
z3_interp.h \
+ z3_fpa.h \
z3++.h \
z3py.py \
- ApplyResult.cs \
- AST.cs \
- ASTMap.cs \
- ASTVector.cs \
- Config.cs \
- Constructor.cs \
- Context.cs \
- DecRefQUeue.cs \
- Enumerations.cs \
- Expr.cs \
- FuncDecl.cs \
- FuncInterp.cs \
- Goal.cs \
- Log.cs \
- Model.cs \
- Native.cs \
- Numeral.cs \
- Params.cs \
- Pattern.cs \
- Probe.cs \
- Quantifier.cs \
- Solver.cs \
- Sort.cs \
- Statistics.cs \
- Status.cs \
- Symbol.cs \
- Tactic.cs \
- Util.cs \
- Version.cs \
- Z3Exception.cs \
- Z3Object.cs \
+ *.cs \
*.java
# The RECURSIVE tag can be used to turn specify whether or not subdirectories
diff --git a/examples/c/test_capi.c b/examples/c/test_capi.c
index 27bf6de2c..c0ea70453 100644
--- a/examples/c/test_capi.c
+++ b/examples/c/test_capi.c
@@ -2595,6 +2595,97 @@ void substitute_vars_example() {
Z3_del_context(ctx);
}
+/**
+ \brief Demonstrates some basic features of the FloatingPoint theory.
+*/
+
+void fpa_example() {
+ Z3_config cfg;
+ Z3_context ctx;
+ Z3_sort double_sort, rm_sort;
+ Z3_symbol s_rm, s_x, s_y, s_x_plus_y;
+ Z3_ast rm, x, y, n, x_plus_y, c1, c2, c3, c4, c5, c6;
+ Z3_ast args[2], args2[2], and_args[3], args3[3];
+
+ printf("\nFPA-example\n");
+ LOG_MSG("FPA-example");
+
+ cfg = Z3_mk_config();
+ ctx = Z3_mk_context(cfg);
+ Z3_del_config(cfg);
+
+ double_sort = Z3_mk_fpa_sort(ctx, 11, 53);
+ rm_sort = Z3_mk_fpa_rounding_mode_sort(ctx);
+
+ // Show that there are x, y s.t. (x + y) = 42.0 (with rounding mode).
+ s_rm = Z3_mk_string_symbol(ctx, "rm");
+ rm = Z3_mk_const(ctx, s_rm, rm_sort);
+ s_x = Z3_mk_string_symbol(ctx, "x");
+ s_y = Z3_mk_string_symbol(ctx, "y");
+ x = Z3_mk_const(ctx, s_x, double_sort);
+ y = Z3_mk_const(ctx, s_y, double_sort);
+ n = Z3_mk_fpa_numeral_double(ctx, 42.0, double_sort);
+
+ s_x_plus_y = Z3_mk_string_symbol(ctx, "x_plus_y");
+ x_plus_y = Z3_mk_const(ctx, s_x_plus_y, double_sort);
+ c1 = Z3_mk_eq(ctx, x_plus_y, Z3_mk_fpa_add(ctx, rm, x, y));
+
+ args[0] = c1;
+ args[1] = Z3_mk_eq(ctx, x_plus_y, n);
+ c2 = Z3_mk_and(ctx, 2, (Z3_ast*)&args);
+
+ args2[0] = c2;
+ args2[1] = Z3_mk_not(ctx, Z3_mk_eq(ctx, rm, Z3_mk_fpa_rtz(ctx)));
+ c3 = Z3_mk_and(ctx, 2, (Z3_ast*)&args2);
+
+ and_args[0] = Z3_mk_not(ctx, Z3_mk_fpa_is_zero(ctx, y));
+ and_args[1] = Z3_mk_not(ctx, Z3_mk_fpa_is_nan(ctx, y));
+ and_args[2] = Z3_mk_not(ctx, Z3_mk_fpa_is_infinite(ctx, y));
+ args3[0] = c3;
+ args3[1] = Z3_mk_and(ctx, 3, and_args);
+ c4 = Z3_mk_and(ctx, 2, (Z3_ast*)&args3);
+
+ printf("c4: %s\n", Z3_ast_to_string(ctx, c4));
+ Z3_push(ctx);
+ Z3_assert_cnstr(ctx, c4);
+ check(ctx, Z3_L_TRUE);
+ Z3_pop(ctx, 1);
+
+ // Show that the following are equal:
+ // (fp #b0 #b10000000001 #xc000000000000)
+ // ((_ to_fp 11 53) #x401c000000000000))
+ // ((_ to_fp 11 53) RTZ 1.75 2)))
+ // ((_ to_fp 11 53) RTZ 7.0)))
+
+ Z3_push(ctx);
+ c1 = Z3_mk_fpa_fp(ctx,
+ Z3_mk_numeral(ctx, "0", Z3_mk_bv_sort(ctx, 1)),
+ Z3_mk_numeral(ctx, "3377699720527872", Z3_mk_bv_sort(ctx, 52)),
+ Z3_mk_numeral(ctx, "1025", Z3_mk_bv_sort(ctx, 11)));
+ c2 = Z3_mk_fpa_to_fp_bv(ctx,
+ Z3_mk_numeral(ctx, "4619567317775286272", Z3_mk_bv_sort(ctx, 64)),
+ Z3_mk_fpa_sort(ctx, 11, 53));
+ c3 = Z3_mk_fpa_to_fp_int_real(ctx,
+ Z3_mk_fpa_rtz(ctx),
+ Z3_mk_numeral(ctx, "2", Z3_mk_int_sort(ctx)),
+ Z3_mk_numeral(ctx, "1.75", Z3_mk_real_sort(ctx)),
+ Z3_mk_fpa_sort(ctx, 11, 53));
+ c4 = Z3_mk_fpa_to_fp_real(ctx,
+ Z3_mk_fpa_rtz(ctx),
+ Z3_mk_numeral(ctx, "7.0", Z3_mk_real_sort(ctx)),
+ Z3_mk_fpa_sort(ctx, 11, 53));
+ args3[0] = Z3_mk_eq(ctx, c1, c2);
+ args3[1] = Z3_mk_eq(ctx, c1, c3);
+ args3[2] = Z3_mk_eq(ctx, c1, c4);
+ c5 = Z3_mk_and(ctx, 3, args3);
+
+ printf("c5: %s\n", Z3_ast_to_string(ctx, c5));
+ Z3_assert_cnstr(ctx, c5);
+ check(ctx, Z3_L_TRUE);
+ Z3_pop(ctx, 1);
+
+ Z3_del_context(ctx);
+}
/*@}*/
/*@}*/
@@ -2640,5 +2731,6 @@ int main() {
smt2parser_example();
substitute_example();
substitute_vars_example();
+ fpa_example();
return 0;
}
diff --git a/examples/dotnet/Program.cs b/examples/dotnet/Program.cs
index 4361cab96..0c33d6793 100644
--- a/examples/dotnet/Program.cs
+++ b/examples/dotnet/Program.cs
@@ -2028,6 +2028,84 @@ namespace test_mapi
// Console.WriteLine("{0}", ctx.MkEq(s1, t1));
}
+ public static void FloatingPointExample1(Context ctx)
+ {
+ Console.WriteLine("FloatingPointExample1");
+
+ FPSort s = ctx.MkFPSort(11, 53);
+ Console.WriteLine("Sort: {0}", s);
+
+ FPNum x = (FPNum)ctx.MkNumeral("-1e1", s); /* -1 * 10^1 = -10 */
+ FPNum y = (FPNum)ctx.MkNumeral("-10", s); /* -10 */
+ FPNum z = (FPNum)ctx.MkNumeral("-1.25p3", s); /* -1.25 * 2^3 = -1.25 * 8 = -10 */
+ Console.WriteLine("x={0}; y={1}; z={2}", x.ToString(), y.ToString(), z.ToString());
+
+ BoolExpr a = ctx.MkAnd(ctx.MkFPEq(x, y), ctx.MkFPEq(y, z));
+ Check(ctx, ctx.MkNot(a), Status.UNSATISFIABLE);
+
+ /* nothing is equal to NaN according to floating-point
+ * equality, so NaN == k should be unsatisfiable. */
+ FPExpr k = (FPExpr)ctx.MkConst("x", s);
+ FPExpr nan = ctx.MkFPNaN(s);
+
+ /* solver that runs the default tactic for QF_FP. */
+ Solver slvr = ctx.MkSolver("QF_FP");
+ slvr.Add(ctx.MkFPEq(nan, k));
+ if (slvr.Check() != Status.UNSATISFIABLE)
+ throw new TestFailedException();
+ Console.WriteLine("OK, unsat:" + Environment.NewLine + slvr);
+
+ /* NaN is equal to NaN according to normal equality. */
+ slvr = ctx.MkSolver("QF_FP");
+ slvr.Add(ctx.MkEq(nan, nan));
+ if (slvr.Check() != Status.SATISFIABLE)
+ throw new TestFailedException();
+ Console.WriteLine("OK, sat:" + Environment.NewLine + slvr);
+
+ /* Let's prove -1e1 * -1.25e3 == +100 */
+ x = (FPNum)ctx.MkNumeral("-1e1", s);
+ y = (FPNum)ctx.MkNumeral("-1.25p3", s);
+ FPExpr x_plus_y = (FPExpr)ctx.MkConst("x_plus_y", s);
+ FPNum r = (FPNum)ctx.MkNumeral("100", s);
+ slvr = ctx.MkSolver("QF_FP");
+
+ slvr.Add(ctx.MkEq(x_plus_y, ctx.MkFPMul(ctx.MkFPRoundNearestTiesToAway(), x, y)));
+ slvr.Add(ctx.MkNot(ctx.MkFPEq(x_plus_y, r)));
+ if (slvr.Check() != Status.UNSATISFIABLE)
+ throw new TestFailedException();
+ Console.WriteLine("OK, unsat:" + Environment.NewLine + slvr);
+ }
+
+ public static void FloatingPointExample2(Context ctx)
+ {
+ Console.WriteLine("FloatingPointExample2");
+ FPSort double_sort = ctx.MkFPSort(11, 53);
+ FPRMSort rm_sort = ctx.MkFPRoundingModeSort();
+
+ FPRMExpr rm = (FPRMExpr)ctx.MkConst(ctx.MkSymbol("rm"), rm_sort);
+ BitVecExpr x = (BitVecExpr)ctx.MkConst(ctx.MkSymbol("x"), ctx.MkBitVecSort(64));
+ FPExpr y = (FPExpr)ctx.MkConst(ctx.MkSymbol("y"), double_sort);
+ FPExpr fp_val = ctx.MkFP(42, double_sort);
+
+ BoolExpr c1 = ctx.MkEq(y, fp_val);
+ BoolExpr c2 = ctx.MkEq(x, ctx.MkFPToBV(rm, y, 64, false));
+ BoolExpr c3 = ctx.MkEq(x, ctx.MkBV(42, 64));
+ BoolExpr c4 = ctx.MkEq(ctx.MkNumeral(42, ctx.RealSort), ctx.MkFPToReal(fp_val));
+ BoolExpr c5 = ctx.MkAnd(c1, c2, c3, c4);
+ Console.WriteLine("c5 = " + c5);
+
+ /* Generic solver */
+ Solver s = ctx.MkSolver();
+ s.Assert(c5);
+
+ Console.WriteLine(s);
+
+ if (s.Check() != Status.SATISFIABLE)
+ throw new TestFailedException();
+
+ Console.WriteLine("OK, model: {0}", s.Model.ToString());
+ }
+
static void Main(string[] args)
{
try
@@ -2069,6 +2147,8 @@ namespace test_mapi
FindSmallModelExample(ctx);
SimplifierExample(ctx);
FiniteDomainExample(ctx);
+ FloatingPointExample1(ctx);
+ FloatingPointExample2(ctx);
}
// These examples need proof generation turned on.
diff --git a/examples/java/JavaExample.java b/examples/java/JavaExample.java
index 48395d8c2..af8662700 100644
--- a/examples/java/JavaExample.java
+++ b/examples/java/JavaExample.java
@@ -1095,7 +1095,7 @@ class JavaExample
// / Shows how to use Solver(logic)
- // /
+ // / @param ctx
void logicExample(Context ctx) throws Z3Exception, TestFailedException
{
System.out.println("LogicTest");
@@ -2157,6 +2157,86 @@ class JavaExample
// System.out.println(ctx.mkEq(s1, t1));
}
+ public void floatingPointExample1(Context ctx) throws Z3Exception, TestFailedException
+ {
+ System.out.println("FloatingPointExample1");
+ Log.append("FloatingPointExample1");
+
+ FPSort s = ctx.mkFPSort(11, 53);
+ System.out.println("Sort: " + s);
+
+ FPNum x = (FPNum)ctx.mkNumeral("-1e1", s); /* -1 * 10^1 = -10 */
+ FPNum y = (FPNum)ctx.mkNumeral("-10", s); /* -10 */
+ FPNum z = (FPNum)ctx.mkNumeral("-1.25p3", s); /* -1.25 * 2^3 = -1.25 * 8 = -10 */
+ System.out.println("x=" + x.toString() +
+ "; y=" + y.toString() +
+ "; z=" + z.toString());
+
+ BoolExpr a = ctx.mkAnd(ctx.mkFPEq(x, y), ctx.mkFPEq(y, z));
+ check(ctx, ctx.mkNot(a), Status.UNSATISFIABLE);
+
+ /* nothing is equal to NaN according to floating-point
+ * equality, so NaN == k should be unsatisfiable. */
+ FPExpr k = (FPExpr)ctx.mkConst("x", s);
+ FPExpr nan = ctx.mkFPNaN(s);
+
+ /* solver that runs the default tactic for QF_FP. */
+ Solver slvr = ctx.mkSolver("QF_FP");
+ slvr.add(ctx.mkFPEq(nan, k));
+ if (slvr.check() != Status.UNSATISFIABLE)
+ throw new TestFailedException();
+ System.out.println("OK, unsat:" + System.getProperty("line.separator") + slvr);
+
+ /* NaN is equal to NaN according to normal equality. */
+ slvr = ctx.mkSolver("QF_FP");
+ slvr.add(ctx.mkEq(nan, nan));
+ if (slvr.check() != Status.SATISFIABLE)
+ throw new TestFailedException();
+ System.out.println("OK, sat:" + System.getProperty("line.separator") + slvr);
+
+ /* Let's prove -1e1 * -1.25e3 == +100 */
+ x = (FPNum)ctx.mkNumeral("-1e1", s);
+ y = (FPNum)ctx.mkNumeral("-1.25p3", s);
+ FPExpr x_plus_y = (FPExpr)ctx.mkConst("x_plus_y", s);
+ FPNum r = (FPNum)ctx.mkNumeral("100", s);
+ slvr = ctx.mkSolver("QF_FP");
+
+ slvr.add(ctx.mkEq(x_plus_y, ctx.mkFPMul(ctx.mkFPRoundNearestTiesToAway(), x, y)));
+ slvr.add(ctx.mkNot(ctx.mkFPEq(x_plus_y, r)));
+ if (slvr.check() != Status.UNSATISFIABLE)
+ throw new TestFailedException();
+ System.out.println("OK, unsat:" + System.getProperty("line.separator") + slvr);
+ }
+
+ public void floatingPointExample2(Context ctx) throws Z3Exception, TestFailedException
+ {
+ System.out.println("FloatingPointExample2");
+ Log.append("FloatingPointExample2");
+ FPSort double_sort = ctx.mkFPSort(11, 53);
+ FPRMSort rm_sort = ctx.mkFPRoundingModeSort();
+
+ FPRMExpr rm = (FPRMExpr)ctx.mkConst(ctx.mkSymbol("rm"), rm_sort);
+ BitVecExpr x = (BitVecExpr)ctx.mkConst(ctx.mkSymbol("x"), ctx.mkBitVecSort(64));
+ FPExpr y = (FPExpr)ctx.mkConst(ctx.mkSymbol("y"), double_sort);
+ FPExpr fp_val = ctx.mkFP(42, double_sort);
+
+ BoolExpr c1 = ctx.mkEq(y, fp_val);
+ BoolExpr c2 = ctx.mkEq(x, ctx.mkFPToBV(rm, y, 64, false));
+ BoolExpr c3 = ctx.mkEq(x, ctx.mkBV(42, 64));
+ BoolExpr c4 = ctx.mkEq(ctx.mkNumeral(42, ctx.getRealSort()), ctx.mkFPToReal(fp_val));
+ BoolExpr c5 = ctx.mkAnd(c1, c2, c3, c4);
+ System.out.println("c5 = " + c5);
+
+ /* Generic solver */
+ Solver s = ctx.mkSolver();
+ s.add(c5);
+
+ if (s.check() != Status.SATISFIABLE)
+ throw new TestFailedException();
+
+ System.out.println("OK, model: " + s.getModel().toString());
+ }
+
public static void main(String[] args)
{
JavaExample p = new JavaExample();
@@ -2200,6 +2280,8 @@ class JavaExample
p.findSmallModelExample(ctx);
p.simplifierExample(ctx);
p.finiteDomainExample(ctx);
+ p.floatingPointExample1(ctx);
+ p.floatingPointExample2(ctx);
}
{ // These examples need proof generation turned on.
diff --git a/examples/ml/README b/examples/ml/README
new file mode 100644
index 000000000..562e9fe46
--- /dev/null
+++ b/examples/ml/README
@@ -0,0 +1,22 @@
+Small example using the Z3 ML bindings.
+To build the example execute
+ make examples
+in the build directory.
+
+It will create ml_example in the build directory,
+which can be run in the build directory via
+LD_LIBRARY_PATH=. ./ml_example
+or
+LD_LIBRARY_PATH=. ./ml_example.byte
+for the byte-code version.
+
+If Z3 was installed into the ocamlfind package repository (see src/api/ml/README),
+then we can compile this example as follows:
+
+ocamlfind ocamlc -o ml_example.byte -package Z3 -linkpkg ml_example.ml
+ocamlfind ocamlopt -o ml_example -package Z3 -linkpkg ml_example.ml
+
+Note that the resulting binaries depend on the shared z3 library, which needs to be
+in the PATH (Windows), LD_LIBRARY_PATH (Linux) or DYLD_LIBRARY_PATH (OSX). If Z3 was
+installed into ocamlfind, the path that should be added is
+`ocamlfind printconf destdir`/Z3
diff --git a/examples/ml/ml_example.ml b/examples/ml/ml_example.ml
new file mode 100644
index 000000000..df062bde4
--- /dev/null
+++ b/examples/ml/ml_example.ml
@@ -0,0 +1,350 @@
+(*
+ Copyright (C) 2012 Microsoft Corporation
+ Author: CM Wintersteiger (cwinter) 2012-12-17
+*)
+
+open Z3
+open Z3.Symbol
+open Z3.Sort
+open Z3.Expr
+open Z3.Boolean
+open Z3.FuncDecl
+open Z3.Goal
+open Z3.Tactic
+open Z3.Tactic.ApplyResult
+open Z3.Probe
+open Z3.Solver
+open Z3.Arithmetic
+open Z3.Arithmetic.Integer
+open Z3.Arithmetic.Real
+open Z3.BitVector
+
+
+exception TestFailedException of string
+
+(**
+ Model Converter test
+*)
+let model_converter_test ( ctx : context ) =
+ Printf.printf "ModelConverterTest\n";
+ let xr = (Expr.mk_const ctx (Symbol.mk_string ctx "x") (Real.mk_sort ctx)) in
+ let yr = (Expr.mk_const ctx (Symbol.mk_string ctx "y") (Real.mk_sort ctx)) in
+ let g4 = (mk_goal ctx true false false ) in
+ (Goal.add g4 [ (mk_gt ctx xr (Real.mk_numeral_nd ctx 10 1)) ]) ;
+ (Goal.add g4 [ (mk_eq ctx
+ yr
+ (Arithmetic.mk_add ctx [ xr; (Real.mk_numeral_nd ctx 1 1) ])) ]) ;
+ (Goal.add g4 [ (mk_gt ctx yr (Real.mk_numeral_nd ctx 1 1)) ]) ;
+ (
+ let ar = (Tactic.apply (mk_tactic ctx "simplify") g4 None) in
+ if ((get_num_subgoals ar) == 1 &&
+ ((is_decided_sat (get_subgoal ar 0)) ||
+ (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let ar = (Tactic.apply (and_then ctx (mk_tactic ctx ("simplify")) (mk_tactic ctx "solve-eqs") []) g4 None) in
+ if ((get_num_subgoals ar) == 1 &&
+ ((is_decided_sat (get_subgoal ar 0)) ||
+ (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ ;
+ let solver = (mk_solver ctx None) in
+ let f e = (Solver.add solver [ e ]) in
+ ignore (List.map f (get_formulas (get_subgoal ar 0))) ;
+ let q = (check solver []) in
+ if q != SATISFIABLE then
+ raise (TestFailedException "")
+ else
+ let m = (get_model solver) in
+ match m with
+ | None -> raise (TestFailedException "")
+ | Some (m) ->
+ Printf.printf "Solver says: %s\n" (string_of_status q) ;
+ Printf.printf "Model: \n%s\n" (Model.to_string m) ;
+ Printf.printf "Converted Model: \n%s\n" (Model.to_string (convert_model ar 0 m))
+ )
+
+(**
+ Some basic tests.
+*)
+let basic_tests ( ctx : context ) =
+ Printf.printf "BasicTests\n" ;
+ let fname = (mk_string ctx "f") in
+ let x = (mk_string ctx "x") in
+ let y = (mk_string ctx "y") in
+ let bs = (Boolean.mk_sort ctx) in
+ let domain = [ bs; bs ] in
+ let f = (FuncDecl.mk_func_decl ctx fname domain bs) in
+ let fapp = (mk_app ctx f
+ [ (Expr.mk_const ctx x bs); (Expr.mk_const ctx y bs) ]) in
+ let fargs2 = [ (mk_fresh_const ctx "cp" bs) ] in
+ let domain2 = [ bs ] in
+ let fapp2 = (mk_app ctx (mk_fresh_func_decl ctx "fp" domain2 bs) fargs2) in
+ let trivial_eq = (mk_eq ctx fapp fapp) in
+ let nontrivial_eq = (mk_eq ctx fapp fapp2) in
+ let g = (mk_goal ctx true false false) in
+ (Goal.add g [ trivial_eq ]) ;
+ (Goal.add g [ nontrivial_eq ]) ;
+ Printf.printf "%s\n" ("Goal: " ^ (Goal.to_string g)) ;
+ (
+ let solver = (mk_solver ctx None) in
+ (List.iter (fun a -> (Solver.add solver [ a ])) (get_formulas g)) ;
+ if (check solver []) != SATISFIABLE then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let ar = (Tactic.apply (mk_tactic ctx "simplify") g None) in
+ if ((get_num_subgoals ar) == 1 &&
+ ((is_decided_sat (get_subgoal ar 0)) ||
+ (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let ar = (Tactic.apply (mk_tactic ctx "smt") g None) in
+ if ((get_num_subgoals ar) == 1 &&
+ (not (is_decided_sat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (Goal.add g [ (mk_eq ctx
+ (mk_numeral_int ctx 1 (BitVector.mk_sort ctx 32))
+ (mk_numeral_int ctx 2 (BitVector.mk_sort ctx 32))) ] )
+ ;
+ (
+ let ar = (Tactic.apply (mk_tactic ctx "smt") g None) in
+ if ((get_num_subgoals ar) == 1 &&
+ (not (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let g2 = (mk_goal ctx true true false) in
+ let ar = (Tactic.apply (mk_tactic ctx "smt") g2 None) in
+ if ((get_num_subgoals ar) == 1 &&
+ (not (is_decided_sat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let g2 = (mk_goal ctx true true false) in
+ (Goal.add g2 [ (Boolean.mk_false ctx) ]) ;
+ let ar = (Tactic.apply (mk_tactic ctx "smt") g2 None) in
+ if ((get_num_subgoals ar) == 1 &&
+ (not (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+ (
+ let g3 = (mk_goal ctx true true false) in
+ let xc = (Expr.mk_const ctx (Symbol.mk_string ctx "x") (Integer.mk_sort ctx)) in
+ let yc = (Expr.mk_const ctx (Symbol.mk_string ctx "y") (Integer.mk_sort ctx)) in
+ (Goal.add g3 [ (mk_eq ctx xc (mk_numeral_int ctx 1 (Integer.mk_sort ctx))) ]) ;
+ (Goal.add g3 [ (mk_eq ctx yc (mk_numeral_int ctx 2 (Integer.mk_sort ctx))) ]) ;
+ let constr = (mk_eq ctx xc yc) in
+ (Goal.add g3 [ constr ] ) ;
+ let ar = (Tactic.apply (mk_tactic ctx "smt") g3 None) in
+ if ((get_num_subgoals ar) == 1 &&
+ (not (is_decided_unsat (get_subgoal ar 0)))) then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ ) ;
+ model_converter_test ctx ;
+ (* Real num/den test. *)
+ let rn = Real.mk_numeral_nd ctx 42 43 in
+ let inum = (get_numerator rn) in
+ let iden = get_denominator rn in
+ Printf.printf "Numerator: %s Denominator: %s\n" (Real.numeral_to_string inum) (Real.numeral_to_string iden) ;
+ if ((Real.numeral_to_string inum) <> "42" || (Real.numeral_to_string iden) <> "43") then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ ;
+ if ((to_decimal_string rn 3) <> "0.976?") then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ ;
+ if (to_decimal_string (Real.mk_numeral_s ctx "-1231231232/234234333") 5 <> "-5.25640?") then
+ raise (TestFailedException "")
+ else if (to_decimal_string (Real.mk_numeral_s ctx "-123123234234234234231232/234234333") 5 <> "-525641278361333.28170?") then
+ raise (TestFailedException "")
+ else if (to_decimal_string (Real.mk_numeral_s ctx "-234234333") 5 <> "-234234333") then
+ raise (TestFailedException "")
+ else if (to_decimal_string (Real.mk_numeral_s ctx "234234333/2") 5 <> "117117166.5") then
+ raise (TestFailedException "")
+ ;
+ (* Error handling test. *)
+ try (
+ let i = Integer.mk_numeral_s ctx "1/2" in
+ raise (TestFailedException (numeral_to_string i)) (* unreachable *)
+ )
+ with Z3native.Exception(_) -> (
+ Printf.printf "Exception caught, OK.\n"
+ )
+
+(**
+ A basic example of how to use quantifiers.
+**)
+let quantifier_example1 ( ctx : context ) =
+ Printf.printf "QuantifierExample\n" ;
+ let is = (Integer.mk_sort ctx) in
+ let types = [ is; is; is ] in
+ let names = [ (Symbol.mk_string ctx "x_0");
+ (Symbol.mk_string ctx "x_1");
+ (Symbol.mk_string ctx "x_2") ] in
+ let vars = [ (Quantifier.mk_bound ctx 2 (List.nth types 0));
+ (Quantifier.mk_bound ctx 2 (List.nth types 1));
+ (Quantifier.mk_bound ctx 2 (List.nth types 2)) ] in
+ let xs = [ (Integer.mk_const ctx (List.nth names 0));
+ (Integer.mk_const ctx (List.nth names 1));
+ (Integer.mk_const ctx (List.nth names 2)) ] in
+
+ let body_vars = (Boolean.mk_and ctx
+ [ (mk_eq ctx
+ (Arithmetic.mk_add ctx [ (List.nth vars 0) ; (Integer.mk_numeral_i ctx 1)])
+ (Integer.mk_numeral_i ctx 2)) ;
+ (mk_eq ctx
+ (Arithmetic.mk_add ctx [ (List.nth vars 1); (Integer.mk_numeral_i ctx 2)])
+ (Arithmetic.mk_add ctx [ (List.nth vars 2); (Integer.mk_numeral_i ctx 3)])) ]) in
+ let body_const = (Boolean.mk_and ctx
+ [ (mk_eq ctx
+ (Arithmetic.mk_add ctx [ (List.nth xs 0); (Integer.mk_numeral_i ctx 1)])
+ (Integer.mk_numeral_i ctx 2)) ;
+ (mk_eq ctx
+ (Arithmetic.mk_add ctx [ (List.nth xs 1); (Integer.mk_numeral_i ctx 2)])
+ (Arithmetic.mk_add ctx [ (List.nth xs 2); (Integer.mk_numeral_i ctx 3)])) ]) in
+
+ let x = (Quantifier.mk_forall ctx types names body_vars (Some 1) [] [] (Some (Symbol.mk_string ctx "Q1")) (Some (Symbol.mk_string ctx "skid1"))) in
+ Printf.printf "Quantifier X: %s\n" (Quantifier.to_string x) ;
+ let y = (Quantifier.mk_forall_const ctx xs body_const (Some 1) [] [] (Some (Symbol.mk_string ctx "Q2")) (Some (Symbol.mk_string ctx "skid2"))) in
+ Printf.printf "Quantifier Y: %s\n" (Quantifier.to_string y) ;
+ if (is_true (Quantifier.expr_of_quantifier x)) then
+ raise (TestFailedException "") (* unreachable *)
+ else if (is_false (Quantifier.expr_of_quantifier x)) then
+ raise (TestFailedException "") (* unreachable *)
+ else if (is_const (Quantifier.expr_of_quantifier x)) then
+ raise (TestFailedException "") (* unreachable *)
+
+
+open Z3.FloatingPoint
+
+(**
+ A basic example of floating point arithmetic
+**)
+let fpa_example ( ctx : context ) =
+ Printf.printf "FPAExample\n" ;
+ (* let str = ref "" in *)
+ (* (read_line ()) ; *)
+ let double_sort = (FloatingPoint.mk_sort_double ctx) in
+ let rm_sort = (FloatingPoint.RoundingMode.mk_sort ctx) in
+
+ (** Show that there are x, y s.t. (x + y) = 42.0 (with rounding mode). *)
+ let s_rm = (mk_string ctx "rm") in
+ let rm = (mk_const ctx s_rm rm_sort) in
+ let s_x = (mk_string ctx "x") in
+ let s_y = (mk_string ctx "y") in
+ let x = (mk_const ctx s_x double_sort) in
+ let y = (mk_const ctx s_y double_sort)in
+ let n = (FloatingPoint.mk_numeral_f ctx 42.0 double_sort) in
+ let s_x_plus_y = (mk_string ctx "x_plus_y") in
+ let x_plus_y = (mk_const ctx s_x_plus_y double_sort) in
+ let c1 = (mk_eq ctx x_plus_y (mk_add ctx rm x y)) in
+ let args = [ c1 ; (mk_eq ctx x_plus_y n) ] in
+ let c2 = (Boolean.mk_and ctx args) in
+ let args2 = [ c2 ; (Boolean.mk_not ctx (Boolean.mk_eq ctx rm (RoundingMode.mk_rtz ctx))) ] in
+ let c3 = (Boolean.mk_and ctx args2) in
+ let and_args = [ (Boolean.mk_not ctx (mk_is_zero ctx y)) ;
+ (Boolean.mk_not ctx (mk_is_nan ctx y)) ;
+ (Boolean.mk_not ctx (mk_is_infinite ctx y)) ] in
+ let args3 = [ c3 ; (Boolean.mk_and ctx and_args) ] in
+ let c4 = (Boolean.mk_and ctx args3) in
+ (Printf.printf "c4: %s\n" (Expr.to_string c4)) ;
+ (
+ let solver = (mk_solver ctx None) in
+ (Solver.add solver [ c4 ]) ;
+ if (check solver []) != SATISFIABLE then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ );
+
+ (* Show that the following are equal: *)
+ (* (fp #b0 #b10000000001 #xc000000000000) *)
+ (* ((_ to_fp 11 53) #x401c000000000000)) *)
+ (* ((_ to_fp 11 53) RTZ 1.75 2))) *)
+ (* ((_ to_fp 11 53) RTZ 7.0))) *)
+ let c1 = (mk_fp ctx
+ (mk_numeral_string ctx "0" (BitVector.mk_sort ctx 1))
+ (mk_numeral_string ctx "3377699720527872" (BitVector.mk_sort ctx 52))
+ (mk_numeral_string ctx "1025" (BitVector.mk_sort ctx 11))) in
+ let c2 = (mk_to_fp_bv ctx
+ (mk_numeral_string ctx "4619567317775286272" (BitVector.mk_sort ctx 64))
+ (mk_sort ctx 11 53)) in
+ let c3 = (mk_to_fp_int_real ctx
+ (RoundingMode.mk_rtz ctx)
+ (mk_numeral_string ctx "2" (Integer.mk_sort ctx))
+ (mk_numeral_string ctx "1.75" (Real.mk_sort ctx))
+ (FloatingPoint.mk_sort ctx 11 53)) in
+ let c4 = (mk_to_fp_real ctx (RoundingMode.mk_rtz ctx)
+ (mk_numeral_string ctx "7.0" (Real.mk_sort ctx))
+ (FloatingPoint.mk_sort ctx 11 53)) in
+ let args3 = [ (mk_eq ctx c1 c2) ;
+ (mk_eq ctx c1 c3) ;
+ (mk_eq ctx c1 c4) ] in
+ let c5 = (Boolean.mk_and ctx args3) in
+ (Printf.printf "c5: %s\n" (Expr.to_string c5)) ;
+ (
+ let solver = (mk_solver ctx None) in
+ (Solver.add solver [ c5 ]) ;
+ if (check solver []) != SATISFIABLE then
+ raise (TestFailedException "")
+ else
+ Printf.printf "Test passed.\n"
+ )
+
+let _ =
+ try (
+ if not (Log.open_ "z3.log") then
+ raise (TestFailedException "Log couldn't be opened.")
+ else
+ (
+ Printf.printf "Running Z3 version %s\n" Version.to_string ;
+ let cfg = [("model", "true"); ("proof", "false")] in
+ let ctx = (mk_context cfg) in
+ let is = (Symbol.mk_int ctx 42) in
+ let ss = (Symbol.mk_string ctx "mySymbol") in
+ let bs = (Boolean.mk_sort ctx) in
+ let ints = (Integer.mk_sort ctx) in
+ let rs = (Real.mk_sort ctx) in
+ Printf.printf "int symbol: %s\n" (Symbol.to_string is);
+ Printf.printf "string symbol: %s\n" (Symbol.to_string ss);
+ Printf.printf "bool sort: %s\n" (Sort.to_string bs);
+ Printf.printf "int sort: %s\n" (Sort.to_string ints);
+ Printf.printf "real sort: %s\n" (Sort.to_string rs);
+ basic_tests ctx ;
+ quantifier_example1 ctx ;
+ fpa_example ctx ;
+ Printf.printf "Disposing...\n";
+ Gc.full_major ()
+ );
+ Printf.printf "Exiting.\n" ;
+ exit 0
+ ) with Z3native.Exception(msg) -> (
+ Printf.printf "Z3 EXCEPTION: %s\n" msg ;
+ exit 1
+ )
+;;
diff --git a/examples/python/complex/complex.py b/examples/python/complex/complex.py
index d90c01e93..a2de4a6cc 100644
--- a/examples/python/complex/complex.py
+++ b/examples/python/complex/complex.py
@@ -65,9 +65,6 @@ class ComplexExpr:
def __neq__(self, other):
return Not(self.__eq__(other))
- def __pow__(self, k):
-
-
def simplify(self):
return ComplexExpr(simplify(self.r), simplify(self.i))
diff --git a/scripts/mk_project.py b/scripts/mk_project.py
index b30bba609..1e21ff810 100644
--- a/scripts/mk_project.py
+++ b/scripts/mk_project.py
@@ -9,7 +9,7 @@ from mk_util import *
# Z3 Project definition
def init_project_def():
- set_version(4, 3, 3, 0)
+ set_version(4, 4, 0, 0)
add_lib('util', [])
add_lib('polynomial', ['util'], 'math/polynomial')
add_lib('sat', ['util'])
@@ -53,8 +53,8 @@ def init_project_def():
add_lib('user_plugin', ['smt'], 'smt/user_plugin')
add_lib('bv_tactics', ['tactic', 'bit_blaster'], 'tactic/bv')
add_lib('fuzzing', ['ast'], 'test/fuzzing')
- add_lib('fpa_tactics', ['fpa', 'core_tactics', 'bv_tactics', 'sat_tactic'], 'tactic/fpa')
add_lib('smt_tactic', ['smt'], 'smt/tactic')
+ add_lib('fpa_tactics', ['fpa', 'core_tactics', 'bv_tactics', 'sat_tactic', 'smt_tactic'], 'tactic/fpa')
add_lib('sls_tactic', ['tactic', 'normal_forms', 'core_tactics', 'bv_tactics'], 'tactic/sls')
add_lib('qe', ['smt','sat'], 'qe')
add_lib('duality', ['smt', 'interp', 'qe'])
@@ -75,7 +75,7 @@ def init_project_def():
# dll_name='foci2',
# export_files=['foci2stub.cpp'])
# add_lib('interp', ['solver','foci2'])
- API_files = ['z3_api.h', 'z3_algebraic.h', 'z3_polynomial.h', 'z3_rcf.h', 'z3_interp.h']
+ API_files = ['z3_api.h', 'z3_algebraic.h', 'z3_polynomial.h', 'z3_rcf.h', 'z3_interp.h', 'z3_fpa.h']
add_lib('api', ['portfolio', 'user_plugin', 'smtparser', 'realclosure', 'interp'],
includes2install=['z3.h', 'z3_v1.h', 'z3_macros.h'] + API_files)
add_exe('shell', ['api', 'sat', 'extra_cmds'], exe_name='z3')
@@ -87,6 +87,7 @@ def init_project_def():
export_files=API_files)
add_dot_net_dll('dotnet', ['api_dll'], 'api/dotnet', dll_name='Microsoft.Z3', assembly_info_dir='Properties')
add_java_dll('java', ['api_dll'], 'api/java', dll_name='libz3java', package_name="com.microsoft.z3", manifest_file='manifest')
+ add_ml_lib('ml', ['api_dll'], 'api/ml', lib_name='libz3ml')
add_hlib('cpp', 'api/c++', includes2install=['z3++.h'])
set_z3py_dir('api/python')
# Examples
@@ -97,6 +98,7 @@ def init_project_def():
add_c_example('maxsat')
add_dotnet_example('dotnet_example', 'dotnet')
add_java_example('java_example', 'java')
+ add_ml_example('ml_example', 'ml')
add_z3py_example('py_example', 'python')
return API_files
diff --git a/scripts/mk_util.py b/scripts/mk_util.py
index 4641a7b1b..2ed420c20 100644
--- a/scripts/mk_util.py
+++ b/scripts/mk_util.py
@@ -32,6 +32,10 @@ CXXFLAGS=getenv("CXXFLAGS", "")
EXAMP_DEBUG_FLAG=''
LDFLAGS=getenv("LDFLAGS", "")
JNI_HOME=getenv("JNI_HOME", None)
+OCAMLC=getenv("OCAMLC", "ocamlc")
+OCAMLOPT=getenv("OCAMLOPT", "ocamlopt")
+OCAML_LIB=getenv("OCAML_LIB", None)
+OCAMLFIND=getenv("OCAMLFIND", "ocamlfind")
CXX_COMPILERS=['g++', 'clang++']
C_COMPILERS=['gcc', 'clang']
@@ -49,6 +53,7 @@ UTIL_COMPONENT='util'
API_COMPONENT='api'
DOTNET_COMPONENT='dotnet'
JAVA_COMPONENT='java'
+ML_COMPONENT='ml'
CPP_COMPONENT='cpp'
#####################
IS_WINDOWS=False
@@ -59,12 +64,14 @@ VERBOSE=True
DEBUG_MODE=False
SHOW_CPPS = True
VS_X64 = False
+LINUX_X64 = True
ONLY_MAKEFILES = False
Z3PY_SRC_DIR=None
VS_PROJ = False
TRACE = False
DOTNET_ENABLED=False
JAVA_ENABLED=False
+ML_ENABLED=False
STATIC_LIB=False
VER_MAJOR=None
VER_MINOR=None
@@ -333,8 +340,58 @@ def check_java():
if JNI_HOME == None:
raise MKException("Failed to detect jni.h. Possible solution: set JNI_HOME with the path to JDK.")
+def check_ml():
+ t = TempFile('hello.ml')
+ t.add('print_string "Hello world!\n";;')
+ t.commit()
+ if is_verbose():
+ print ('Testing %s...' % OCAMLC)
+ r = exec_cmd([OCAMLC, '-o', 'a.out', 'hello.ml'])
+ if r != 0:
+ raise MKException('Failed testing ocamlc compiler. Set environment variable OCAMLC with the path to the Ocaml compiler')
+ if is_verbose():
+ print ('Testing %s...' % OCAMLOPT)
+ r = exec_cmd([OCAMLOPT, '-o', 'a.out', 'hello.ml'])
+ if r != 0:
+ raise MKException('Failed testing ocamlopt compiler. Set environment variable OCAMLOPT with the path to the Ocaml native compiler. Note that ocamlopt may require flexlink to be in your path.')
+ rmf('hello.cmi')
+ rmf('hello.cmo')
+ rmf('hello.cmx')
+ rmf('a.out')
+ find_ml_lib()
+ find_ocaml_find()
+
+def find_ocaml_find():
+ global OCAMLFIND
+ if is_verbose():
+ print ("Testing %s..." % OCAMLFIND)
+ r = exec_cmd([OCAMLFIND, 'printconf'])
+ if r != 0:
+ OCAMLFIND=''
+
+def find_ml_lib():
+ global OCAML_LIB
+ if is_verbose():
+ print ('Finding OCAML_LIB...')
+ t = TempFile('output')
+ null = open(os.devnull, 'wb')
+ try:
+ subprocess.call([OCAMLC, '-where'], stdout=t.fname, stderr=null)
+ t.commit()
+ except:
+ raise MKException('Failed to find Ocaml library; please set OCAML_LIB')
+ t = open('output', 'r')
+ for line in t:
+ OCAML_LIB = line[:-1]
+ if is_verbose():
+ print ('OCAML_LIB=%s' % OCAML_LIB)
+ t.close()
+ rmf('output')
+ return
+
def is64():
- return sys.maxsize >= 2**32
+ global LINUX_X64
+ return LINUX_X64 and sys.maxsize >= 2**32
def check_ar():
if is_verbose():
@@ -450,13 +507,16 @@ def display_help(exit_code):
print(" -t, --trace enable tracing in release mode.")
if IS_WINDOWS:
print(" -x, --x64 create 64 binary when using Visual Studio.")
+ else:
+ print(" --x86 force 32-bit x86 build on x64 systems.")
print(" -m, --makefiles generate only makefiles.")
if IS_WINDOWS:
print(" -v, --vsproj generate Visual Studio Project Files.")
if IS_WINDOWS:
print(" -n, --nodotnet do not generate Microsoft.Z3.dll make rules.")
print(" -j, --java generate Java bindings.")
- print(" --staticlib build Z3 static library.")
+ print(" --ml generate OCaml bindings.")
+ print(" --staticlib build Z3 static library.")
if not IS_WINDOWS:
print(" -g, --gmp use GMP.")
print(" --gprof enable gprof")
@@ -471,18 +531,22 @@ def display_help(exit_code):
print(" CXXFLAGS C++ compiler flags")
print(" JDK_HOME JDK installation directory (only relevant if -j or --java option is provided)")
print(" JNI_HOME JNI bindings directory (only relevant if -j or --java option is provided)")
+ print(" OCAMLC Ocaml byte-code compiler (only relevant with --ml)")
+ print(" OCAMLOPT Ocaml native compiler (only relevant with --ml)")
+ print(" OCAML_LIB Ocaml library directory (only relevant with --ml)")
exit(exit_code)
# Parse configuration option for mk_make script
def parse_options():
global VERBOSE, DEBUG_MODE, IS_WINDOWS, VS_X64, ONLY_MAKEFILES, SHOW_CPPS, VS_PROJ, TRACE, VS_PAR, VS_PAR_NUM
- global DOTNET_ENABLED, JAVA_ENABLED, STATIC_LIB, PREFIX, GMP, FOCI2, FOCI2LIB, PYTHON_PACKAGE_DIR, GPROF, GIT_HASH
+ global DOTNET_ENABLED, JAVA_ENABLED, ML_ENABLED, STATIC_LIB, PREFIX, GMP, FOCI2, FOCI2LIB, PYTHON_PACKAGE_DIR, GPROF, GIT_HASH
+ global LINUX_X64
try:
options, remainder = getopt.gnu_getopt(sys.argv[1:],
'b:df:sxhmcvtnp:gj',
['build=', 'debug', 'silent', 'x64', 'help', 'makefiles', 'showcpp', 'vsproj',
'trace', 'nodotnet', 'staticlib', 'prefix=', 'gmp', 'foci2=', 'java', 'parallel=', 'gprof',
- 'githash='])
+ 'githash=', 'x86', 'ml'])
except:
print("ERROR: Invalid command line option")
display_help(1)
@@ -501,6 +565,8 @@ def parse_options():
if not IS_WINDOWS:
raise MKException('x64 compilation mode can only be specified when using Visual Studio')
VS_X64 = True
+ elif opt in ('--x86'):
+ LINUX_X64=False
elif opt in ('-h', '--help'):
display_help(0)
elif opt in ('-m', '--onlymakefiles'):
@@ -535,6 +601,8 @@ def parse_options():
GPROF = True
elif opt == '--githash':
GIT_HASH=arg
+ elif opt in ('', '--ml'):
+ ML_ENABLED = True
else:
print("ERROR: Invalid command line option '%s'" % opt)
display_help(1)
@@ -621,6 +689,9 @@ def is_verbose():
def is_java_enabled():
return JAVA_ENABLED
+def is_ml_enabled():
+ return ML_ENABLED
+
def is_compiler(given, expected):
"""
Return True if the 'given' compiler is the expected one.
@@ -665,6 +736,9 @@ def get_cs_files(path):
def get_java_files(path):
return filter(lambda f: f.endswith('.java'), os.listdir(path))
+def get_ml_files(path):
+ return filter(lambda f: f.endswith('.ml'), os.listdir(path))
+
def find_all_deps(name, deps):
new_deps = []
for dep in deps:
@@ -1268,6 +1342,124 @@ class JavaDLLComponent(Component):
shutil.copy(os.path.join(build_path, 'libz3java.%s' % so),
os.path.join(dist_path, 'bin', 'libz3java.%s' % so))
+class MLComponent(Component):
+ def __init__(self, name, lib_name, path, deps):
+ Component.__init__(self, name, path, deps)
+ if lib_name == None:
+ lib_name = name
+ self.lib_name = lib_name
+
+ def mk_ml_meta(self, ml_meta_in, ml_meta_out, major, minor, build, revision):
+ ver_pat = re.compile('version = "VERSION"*')
+ fin = open(ml_meta_in, 'r')
+ fout = open(ml_meta_out, 'w')
+ num_updates = 0
+ for line in fin:
+ if ver_pat.match(line):
+ fout.write('version = "%s.%s.%s.%s"\n' % (major, minor, build, revision))
+ num_updates = num_updates + 1
+ else:
+ fout.write(line)
+ assert num_updates == 1, "unexpected number of version number updates"
+ fin.close()
+ fout.close()
+ if VERBOSE:
+ print("Updated '%s'" % ml_meta_out)
+
+
+ def mk_makefile(self, out):
+ if is_ml_enabled():
+ CP_CMD = "cp"
+ if IS_WINDOWS:
+ CP_CMD = "copy"
+ src_dir = self.to_src_dir
+ sub_dir = os.path.join('api', 'ml')
+ mk_dir(os.path.join(BUILD_DIR, sub_dir))
+ api_src = get_component(API_COMPONENT).to_src_dir
+ for f in filter(lambda f: f.endswith('.ml'), os.listdir(self.src_dir)):
+ out.write('%s: %s\n' % (os.path.join(sub_dir,f),os.path.join(src_dir,f)))
+ str = '\t%s %s %s\n' % (CP_CMD,os.path.join(src_dir,f),os.path.join(sub_dir,f))
+ out.write(str)
+ for f in filter(lambda f: f.endswith('.mli'), os.listdir(self.src_dir)):
+ out.write('%s: %s\n' % (os.path.join(sub_dir,f),os.path.join(src_dir,f)))
+ str = '\t%s %s %s\n' % (CP_CMD,os.path.join(src_dir,f),os.path.join(sub_dir,f))
+ out.write(str)
+ for f in filter(lambda f: f.endswith('.c'), os.listdir(self.src_dir)):
+ out.write('%s: %s\n' % (os.path.join(sub_dir,f),os.path.join(src_dir,f)))
+ str = '\t%s %s %s\n' % (CP_CMD,os.path.join(src_dir,f),os.path.join(sub_dir,f))
+ out.write(str)
+ modules = ["z3enums", "z3native", "z3"] # dependencies in this order!
+ mls = ''
+ mlis = ''
+ cmis = ''
+ archives = ''
+
+ for m in modules:
+ fn = os.path.join(self.src_dir, ('%s.mli' % m))
+ if not os.path.exists(fn):
+ out.write('%s.mli: %s.ml%s\n' % (os.path.join(sub_dir,m),os.path.join(sub_dir,m),mlis))
+ out.write('\t%s -I %s -i -c %s.ml > %s.mli\n' % (OCAMLC,sub_dir,os.path.join(sub_dir, m),os.path.join(sub_dir, m)))
+ out.write('%s.cmi: %s.mli%s\n' % (os.path.join(sub_dir,m),os.path.join(sub_dir,m), cmis))
+ out.write('\t%s -I %s -c %s.mli\n' % (OCAMLC,sub_dir,os.path.join(sub_dir,m)))
+ out.write('%s.cma: %s.ml %s.cmi%s\n' % (os.path.join(sub_dir,m),os.path.join(sub_dir,m),os.path.join(sub_dir,m), archives))
+ out.write('\t%s -a -o %s.ml -o %s.cma\n' % (OCAMLC,os.path.join(sub_dir,m), os.path.join(sub_dir,m)))
+ mlis = mlis + ' ' + os.path.join(sub_dir, m) + '.mli'
+ cmis = cmis + ' ' + os.path.join(sub_dir,m) + '.cmi'
+ archives = archives + ' ' + os.path.join(sub_dir,m) + '.cma'
+ mls = mls + ' ' + os.path.join(sub_dir, m) + '.ml'
+
+ out.write('%s: %s %s\n' %
+ (os.path.join(sub_dir, 'z3native_stubs$(OBJ_EXT)'),
+ os.path.join(sub_dir, 'z3native_stubs.c'),
+ get_component(Z3_DLL_COMPONENT).dll_name+'$(SO_EXT)'));
+ out.write('\t$(CC) $(CXXFLAGS) -I %s -I %s %s $(CXX_OUT_FLAG)%s$(OBJ_EXT)\n' %
+ (OCAML_LIB, api_src, os.path.join(sub_dir, 'z3native_stubs.c'), os.path.join(sub_dir, 'z3native_stubs')))
+
+ out.write('%s: %s %s %s$(SO_EXT)' % (
+ os.path.join(sub_dir, "z3ml.cmxa"),
+ cmis,
+ archives,
+ get_component(Z3_DLL_COMPONENT).dll_name))
+ out.write(' %s\n' % (os.path.join(sub_dir, 'z3native_stubs$(OBJ_EXT)')))
+ out.write('\tocamlmklib -o %s -I %s -ldopt \"-L. -lz3\" ' % (os.path.join(sub_dir, 'z3ml'), sub_dir))
+ for m in modules:
+ out.write(' %s' % (os.path.join(sub_dir, m+'.ml')))
+ out.write(' %s\n' % (os.path.join(sub_dir, 'z3native_stubs$(OBJ_EXT)')))
+ out.write('ml: %s\n' % (os.path.join(sub_dir, 'z3ml.cmxa')))
+ self.mk_ml_meta(os.path.join('src/api/ml/META'), os.path.join(BUILD_DIR, sub_dir, 'META'), VER_MAJOR, VER_MINOR, VER_BUILD, VER_REVISION)
+ if OCAMLFIND != '':
+ out.write('\nocamlfind_install: %s %s %s\n' % (
+ get_component(Z3_DLL_COMPONENT).dll_name + '$(SO_EXT)',
+ os.path.join(sub_dir, 'z3ml.cmxa'),
+ os.path.join(sub_dir, 'META')))
+ out.write('\t%s remove Z3\n' % (OCAMLFIND))
+ out.write('\t%s install Z3 %s' % (OCAMLFIND, (os.path.join(sub_dir, 'META'))))
+ for m in modules:
+ out.write(' %s.cma' % (os.path.join(sub_dir, m)))
+ out.write(' %s.cmx' % (os.path.join(sub_dir, m)))
+ out.write(' %s.cmi' % (os.path.join(sub_dir, m)))
+ out.write(' %s.cmo' % (os.path.join(sub_dir, m)))
+ out.write(' %s.ml' % (os.path.join(sub_dir, m)))
+ out.write(' %s.mli' % (os.path.join(sub_dir, m)))
+ out.write(' %s$(OBJ_EXT)' % (os.path.join(sub_dir, m)))
+ out.write(' %s' % ((os.path.join(sub_dir, 'z3ml$(LIB_EXT)'))))
+ out.write(' %s' % ((os.path.join(sub_dir, 'z3ml.cma'))))
+ out.write(' %s' % ((os.path.join(sub_dir, 'z3ml.cmxa'))))
+ out.write(' %s' % ((os.path.join(sub_dir, 'libz3ml$(LIB_EXT)'))))
+ out.write(' %s' % ((os.path.join(sub_dir, 'dllz3ml'))))
+ if IS_WINDOWS:
+ out.write('.dll')
+ else:
+ out.write('.so') # .so also on OSX!
+ out.write(' ' + get_component(Z3_DLL_COMPONENT).dll_name + '$(SO_EXT)')
+ if IS_WINDOWS:
+ out.write(' ' + get_component(Z3_DLL_COMPONENT).dll_name + '$(LIB_EXT)')
+ out.write('\n\n')
+
+
+ def main_component(self):
+ return is_ml_enabled()
+
class ExampleComponent(Component):
def __init__(self, name, path):
Component.__init__(self, name, path, [])
@@ -1377,6 +1569,39 @@ class JavaExampleComponent(ExampleComponent):
out.write(' -d .\n')
out.write('_ex_%s: JavaExample.class\n\n' % (self.name))
+class MLExampleComponent(ExampleComponent):
+ def __init__(self, name, path):
+ ExampleComponent.__init__(self, name, path)
+
+ def is_example(self):
+ return ML_ENABLED
+
+ def mk_makefile(self, out):
+ if ML_ENABLED:
+ out.write('ml_example.byte: api/ml/z3ml.cmxa ')
+ for mlfile in get_ml_files(self.ex_dir):
+ out.write(' %s' % os.path.join(self.to_ex_dir, mlfile))
+ out.write('\n')
+ out.write('\t%s ' % OCAMLC)
+ if DEBUG_MODE:
+ out.write('-g ')
+ out.write('-custom -o ml_example.byte -I api/ml -cclib "-L. -lz3" nums.cma z3ml.cma')
+ for mlfile in get_ml_files(self.ex_dir):
+ out.write(' %s/%s' % (self.to_ex_dir, mlfile))
+ out.write('\n')
+ out.write('ml_example$(EXE_EXT): api/ml/z3ml.cmxa ml_example.byte')
+ for mlfile in get_ml_files(self.ex_dir):
+ out.write(' %s' % os.path.join(self.to_ex_dir, mlfile))
+ out.write('\n')
+ out.write('\t%s ' % OCAMLOPT)
+ if DEBUG_MODE:
+ out.write('-g ')
+ out.write('-o ml_example$(EXE_EXT) -I api/ml -cclib "-L. -lz3" nums.cmxa z3ml.cmxa')
+ for mlfile in get_ml_files(self.ex_dir):
+ out.write(' %s/%s' % (self.to_ex_dir, mlfile))
+ out.write('\n')
+ out.write('_ex_%s: ml_example.byte ml_example$(EXE_EXT)\n\n' % self.name)
+
class PythonExampleComponent(ExampleComponent):
def __init__(self, name, path):
ExampleComponent.__init__(self, name, path)
@@ -1430,6 +1655,10 @@ def add_java_dll(name, deps=[], path=None, dll_name=None, package_name=None, man
c = JavaDLLComponent(name, dll_name, package_name, manifest_file, path, deps)
reg_component(name, c)
+def add_ml_lib(name, deps=[], path=None, lib_name=None):
+ c = MLComponent(name, lib_name, path, deps)
+ reg_component(name, c)
+
def add_cpp_example(name, path=None):
c = CppExampleComponent(name, path)
reg_component(name, c)
@@ -1446,6 +1675,10 @@ def add_java_example(name, path=None):
c = JavaExampleComponent(name, path)
reg_component(name, c)
+def add_ml_example(name, path=None):
+ c = MLExampleComponent(name, path)
+ reg_component(name, c)
+
def add_z3py_example(name, path=None):
c = PythonExampleComponent(name, path)
reg_component(name, c)
@@ -1516,6 +1749,10 @@ def mk_config():
if is_java_enabled():
print('JNI Bindings: %s' % JNI_HOME)
print('Java Compiler: %s' % JAVAC)
+ if is_ml_enabled():
+ print('OCaml Compiler: %s' % OCAMLC)
+ print('OCaml Native: %s' % OCAMLOPT)
+ print('OCaml Library: %s' % OCAML_LIB)
else:
global CXX, CC, GMP, FOCI2, CPPFLAGS, CXXFLAGS, LDFLAGS, EXAMP_DEBUG_FLAG
OS_DEFINES = ""
@@ -1593,6 +1830,10 @@ def mk_config():
CPPFLAGS = '%s -D_AMD64_' % CPPFLAGS
if sysname == 'Linux':
CPPFLAGS = '%s -D_USE_THREAD_LOCAL' % CPPFLAGS
+ elif not LINUX_X64:
+ CXXFLAGS = '%s -m32' % CXXFLAGS
+ LDFLAGS = '%s -m32' % LDFLAGS
+ SLIBFLAGS = '%s -m32' % SLIBFLAGS
if DEBUG_MODE:
CPPFLAGS = '%s -DZ3DEBUG' % CPPFLAGS
if TRACE or DEBUG_MODE:
@@ -1630,16 +1871,22 @@ def mk_config():
print('64-bit: %s' % is64())
if GPROF:
print('gprof: enabled')
- print('Python version: %s' % distutils.sysconfig.get_python_version())
+ print('Python version: %s' % distutils.sysconfig.get_python_version())
if is_java_enabled():
print('JNI Bindings: %s' % JNI_HOME)
print('Java Compiler: %s' % JAVAC)
+ if is_ml_enabled():
+ print('OCaml Compiler: %s' % OCAMLC)
+ print('OCaml Native: %s' % OCAMLOPT)
+ print('OCaml Library: %s' % OCAML_LIB)
def mk_install(out):
out.write('install: ')
for c in get_components():
c.mk_install_deps(out)
out.write(' ')
+ if is_ml_enabled() and OCAMLFIND != '':
+ out.write('ocamlfind_install')
out.write('\n')
out.write('\t@mkdir -p %s\n' % os.path.join('$(PREFIX)', 'bin'))
out.write('\t@mkdir -p %s\n' % os.path.join('$(PREFIX)', 'include'))
@@ -2200,6 +2447,9 @@ def mk_bindings(api_files):
mk_z3consts_java(api_files)
_execfile(os.path.join('scripts', 'update_api.py'), g) # HACK
cp_z3py_to_build()
+ if is_ml_enabled():
+ check_ml()
+ mk_z3consts_ml(api_files)
# Extract enumeration types from API files, and add python definitions.
def mk_z3consts_py(api_files):
@@ -2471,6 +2721,171 @@ def mk_z3consts_java(api_files):
if VERBOSE:
print("Generated '%s'" % ('%s' % gendir))
+# Extract enumeration types from z3_api.h, and add ML definitions
+def mk_z3consts_ml(api_files):
+ blank_pat = re.compile("^ *$")
+ comment_pat = re.compile("^ *//.*$")
+ typedef_pat = re.compile("typedef enum *")
+ typedef2_pat = re.compile("typedef enum { *")
+ openbrace_pat = re.compile("{ *")
+ closebrace_pat = re.compile("}.*;")
+
+ ml = get_component(ML_COMPONENT)
+
+ DeprecatedEnums = [ 'Z3_search_failure' ]
+ gendir = ml.src_dir
+ if not os.path.exists(gendir):
+ os.mkdir(gendir)
+
+ efile = open('%s.ml' % os.path.join(gendir, "z3enums"), 'w')
+ efile.write('(* Automatically generated file *)\n\n')
+ efile.write('(** The enumeration types of Z3. *)\n\n')
+ for api_file in api_files:
+ api_file_c = ml.find_file(api_file, ml.name)
+ api_file = os.path.join(api_file_c.src_dir, api_file)
+
+ api = open(api_file, 'r')
+
+ SEARCHING = 0
+ FOUND_ENUM = 1
+ IN_ENUM = 2
+
+ mode = SEARCHING
+ decls = {}
+ idx = 0
+
+ linenum = 1
+ for line in api:
+ m1 = blank_pat.match(line)
+ m2 = comment_pat.match(line)
+ if m1 or m2:
+ # skip blank lines and comments
+ linenum = linenum + 1
+ elif mode == SEARCHING:
+ m = typedef_pat.match(line)
+ if m:
+ mode = FOUND_ENUM
+ m = typedef2_pat.match(line)
+ if m:
+ mode = IN_ENUM
+ decls = {}
+ idx = 0
+ elif mode == FOUND_ENUM:
+ m = openbrace_pat.match(line)
+ if m:
+ mode = IN_ENUM
+ decls = {}
+ idx = 0
+ else:
+ assert False, "Invalid %s, line: %s" % (api_file, linenum)
+ else:
+ assert mode == IN_ENUM
+ words = re.split('[^\-a-zA-Z0-9_]+', line)
+ m = closebrace_pat.match(line)
+ if m:
+ name = words[1]
+ if name not in DeprecatedEnums:
+ efile.write('(** %s *)\n' % name[3:])
+ efile.write('type %s =\n' % name[3:]) # strip Z3_
+ for k, i in decls.iteritems():
+ efile.write(' | %s \n' % k[3:]) # strip Z3_
+ efile.write('\n')
+ efile.write('(** Convert %s to int*)\n' % name[3:])
+ efile.write('let int_of_%s x : int =\n' % (name[3:])) # strip Z3_
+ efile.write(' match x with\n')
+ for k, i in decls.iteritems():
+ efile.write(' | %s -> %d\n' % (k[3:], i))
+ efile.write('\n')
+ efile.write('(** Convert int to %s*)\n' % name[3:])
+ efile.write('let %s_of_int x : %s =\n' % (name[3:],name[3:])) # strip Z3_
+ efile.write(' match x with\n')
+ for k, i in decls.iteritems():
+ efile.write(' | %d -> %s\n' % (i, k[3:]))
+ # use Z3.Exception?
+ efile.write(' | _ -> raise (Failure "undefined enum value")\n\n')
+ mode = SEARCHING
+ else:
+ if words[2] != '':
+ if len(words[2]) > 1 and words[2][1] == 'x':
+ idx = int(words[2], 16)
+ else:
+ idx = int(words[2])
+ decls[words[1]] = idx
+ idx = idx + 1
+ linenum = linenum + 1
+ if VERBOSE:
+ print ('Generated "%s/z3enums.ml"' % ('%s' % gendir))
+ efile = open('%s.mli' % os.path.join(gendir, "z3enums"), 'w')
+ efile.write('(* Automatically generated file *)\n\n')
+ efile.write('(** The enumeration types of Z3. *)\n\n')
+ for api_file in api_files:
+ api_file_c = ml.find_file(api_file, ml.name)
+ api_file = os.path.join(api_file_c.src_dir, api_file)
+
+ api = open(api_file, 'r')
+
+ SEARCHING = 0
+ FOUND_ENUM = 1
+ IN_ENUM = 2
+
+ mode = SEARCHING
+ decls = {}
+ idx = 0
+
+ linenum = 1
+ for line in api:
+ m1 = blank_pat.match(line)
+ m2 = comment_pat.match(line)
+ if m1 or m2:
+ # skip blank lines and comments
+ linenum = linenum + 1
+ elif mode == SEARCHING:
+ m = typedef_pat.match(line)
+ if m:
+ mode = FOUND_ENUM
+ m = typedef2_pat.match(line)
+ if m:
+ mode = IN_ENUM
+ decls = {}
+ idx = 0
+ elif mode == FOUND_ENUM:
+ m = openbrace_pat.match(line)
+ if m:
+ mode = IN_ENUM
+ decls = {}
+ idx = 0
+ else:
+ assert False, "Invalid %s, line: %s" % (api_file, linenum)
+ else:
+ assert mode == IN_ENUM
+ words = re.split('[^\-a-zA-Z0-9_]+', line)
+ m = closebrace_pat.match(line)
+ if m:
+ name = words[1]
+ if name not in DeprecatedEnums:
+ efile.write('(** %s *)\n' % name[3:])
+ efile.write('type %s =\n' % name[3:]) # strip Z3_
+ for k, i in decls.iteritems():
+ efile.write(' | %s \n' % k[3:]) # strip Z3_
+ efile.write('\n')
+ efile.write('(** Convert %s to int*)\n' % name[3:])
+ efile.write('val int_of_%s : %s -> int\n' % (name[3:], name[3:])) # strip Z3_
+ efile.write('(** Convert int to %s*)\n' % name[3:])
+ efile.write('val %s_of_int : int -> %s\n' % (name[3:],name[3:])) # strip Z3_
+ efile.write('\n')
+ mode = SEARCHING
+ else:
+ if words[2] != '':
+ if len(words[2]) > 1 and words[2][1] == 'x':
+ idx = int(words[2], 16)
+ else:
+ idx = int(words[2])
+ decls[words[1]] = idx
+ idx = idx + 1
+ linenum = linenum + 1
+ if VERBOSE:
+ print ('Generated "%s/z3enums.mli"' % ('%s' % gendir))
+
def mk_gui_str(id):
return '4D2F40D8-E5F9-473B-B548-%012d' % id
@@ -2628,3 +3043,5 @@ def mk_unix_dist(build_path, dist_path):
if __name__ == '__main__':
import doctest
doctest.testmod()
+
+
diff --git a/scripts/update_api.py b/scripts/update_api.py
index 2fbf42cca..889044d1f 100644
--- a/scripts/update_api.py
+++ b/scripts/update_api.py
@@ -1,3 +1,4 @@
+
############################################
# Copyright (c) 2012 Microsoft Corporation
#
@@ -124,6 +125,7 @@ SYMBOL = 9
PRINT_MODE = 10
ERROR_CODE = 11
DOUBLE = 12
+FLOAT = 13
FIRST_OBJ_ID = 100
@@ -131,30 +133,34 @@ def is_obj(ty):
return ty >= FIRST_OBJ_ID
Type2Str = { VOID : 'void', VOID_PTR : 'void*', INT : 'int', UINT : 'unsigned', INT64 : '__int64', UINT64 : '__uint64', DOUBLE : 'double',
- STRING : 'Z3_string', STRING_PTR : 'Z3_string_ptr', BOOL : 'Z3_bool', SYMBOL : 'Z3_symbol',
+ FLOAT : 'float', STRING : 'Z3_string', STRING_PTR : 'Z3_string_ptr', BOOL : 'Z3_bool', SYMBOL : 'Z3_symbol',
PRINT_MODE : 'Z3_ast_print_mode', ERROR_CODE : 'Z3_error_code'
}
Type2PyStr = { VOID_PTR : 'ctypes.c_void_p', INT : 'ctypes.c_int', UINT : 'ctypes.c_uint', INT64 : 'ctypes.c_longlong',
- UINT64 : 'ctypes.c_ulonglong', DOUBLE : 'ctypes.c_double',
+ UINT64 : 'ctypes.c_ulonglong', DOUBLE : 'ctypes.c_double', FLOAT : 'ctypes.c_float',
STRING : 'ctypes.c_char_p', STRING_PTR : 'ctypes.POINTER(ctypes.c_char_p)', BOOL : 'ctypes.c_bool', SYMBOL : 'Symbol',
PRINT_MODE : 'ctypes.c_uint', ERROR_CODE : 'ctypes.c_uint'
}
# Mapping to .NET types
Type2Dotnet = { VOID : 'void', VOID_PTR : 'IntPtr', INT : 'int', UINT : 'uint', INT64 : 'Int64', UINT64 : 'UInt64', DOUBLE : 'double',
- STRING : 'string', STRING_PTR : 'byte**', BOOL : 'int', SYMBOL : 'IntPtr',
+ FLOAT : 'float', STRING : 'string', STRING_PTR : 'byte**', BOOL : 'int', SYMBOL : 'IntPtr',
PRINT_MODE : 'uint', ERROR_CODE : 'uint' }
# Mapping to Java types
Type2Java = { VOID : 'void', VOID_PTR : 'long', INT : 'int', UINT : 'int', INT64 : 'long', UINT64 : 'long', DOUBLE : 'double',
- STRING : 'String', STRING_PTR : 'StringPtr',
+ FLOAT : 'float', STRING : 'String', STRING_PTR : 'StringPtr',
BOOL : 'boolean', SYMBOL : 'long', PRINT_MODE : 'int', ERROR_CODE : 'int'}
Type2JavaW = { VOID : 'void', VOID_PTR : 'jlong', INT : 'jint', UINT : 'jint', INT64 : 'jlong', UINT64 : 'jlong', DOUBLE : 'jdouble',
- STRING : 'jstring', STRING_PTR : 'jobject',
+ FLOAT : 'jfloat', STRING : 'jstring', STRING_PTR : 'jobject',
BOOL : 'jboolean', SYMBOL : 'jlong', PRINT_MODE : 'jint', ERROR_CODE : 'jint'}
+# Mapping to ML types
+Type2ML = { VOID : 'unit', VOID_PTR : 'VOIDP', INT : 'int', UINT : 'int', INT64 : 'int', UINT64 : 'int', DOUBLE : 'float',
+ FLOAT : 'float', STRING : 'string', STRING_PTR : 'char**',
+ BOOL : 'bool', SYMBOL : 'z3_symbol', PRINT_MODE : 'int', ERROR_CODE : 'int' }
next_type_id = FIRST_OBJ_ID
@@ -178,6 +184,7 @@ def def_Types():
v = Type2Str[k]
if is_obj(k):
Type2Dotnet[k] = v
+ Type2ML[k] = v.lower()
def type2str(ty):
global Type2Str
@@ -205,6 +212,10 @@ def type2javaw(ty):
else:
return Type2JavaW[ty]
+def type2ml(ty):
+ global Type2ML
+ return Type2ML[ty]
+
def _in(ty):
return (IN, ty);
@@ -266,7 +277,7 @@ def param2dotnet(p):
elif k == OUT_ARRAY:
return "[Out] %s[]" % type2dotnet(param_type(p))
elif k == OUT_MANAGED_ARRAY:
- return "[Out] out %s[]" % type2dotnet(param_type(p))
+ return "[Out] out %s[]" % type2dotnet(param_type(p))
else:
return type2dotnet(param_type(p))
@@ -313,6 +324,22 @@ def param2pystr(p):
else:
return type2pystr(param_type(p))
+def param2ml(p):
+ k = param_kind(p)
+ if k == OUT:
+ if param_type(p) == INT or param_type(p) == UINT or param_type(p) == INT64 or param_type(p) == UINT64:
+ return "int"
+ elif param_type(p) == STRING:
+ return "string"
+ else:
+ return "ptr"
+ elif k == IN_ARRAY or k == INOUT_ARRAY or k == OUT_ARRAY:
+ return "%s array" % type2ml(param_type(p))
+ elif k == OUT_MANAGED_ARRAY:
+ return "%s array" % type2ml(param_type(p));
+ else:
+ return type2ml(param_type(p))
+
# Save name, result, params to generate wrapper
_API2PY = []
@@ -927,6 +954,9 @@ def def_API(name, result, params):
elif ty == DOUBLE:
log_c.write(" D(a%s);\n" % i)
exe_c.write("in.get_double(%s)" % i)
+ elif ty == FLOAT:
+ log_c.write(" D(a%s);\n" % i)
+ exe_c.write("in.get_float(%s)" % i)
elif ty == BOOL:
log_c.write(" I(a%s);\n" % i)
exe_c.write("in.get_bool(%s)" % i)
@@ -1039,6 +1069,460 @@ def mk_bindings():
exe_c.write(" in.register_cmd(%s, exec_%s);\n" % (key, val))
exe_c.write("}\n")
+def ml_method_name(name):
+ return name[3:] # Remove Z3_
+
+def is_out_param(p):
+ if param_kind(p) == OUT or param_kind(p) == INOUT or param_kind(p) == OUT_ARRAY or param_kind(p) == INOUT_ARRAY or param_kind(p) == OUT_MANAGED_ARRAY:
+ return True
+ else:
+ return False
+
+def outparams(params):
+ op = []
+ for param in params:
+ if is_out_param(param):
+ op.append(param)
+ return op
+
+def is_in_param(p):
+ if param_kind(p) == IN or param_kind(p) == INOUT or param_kind(p) == IN_ARRAY or param_kind(p) == INOUT_ARRAY:
+ return True
+ else:
+ return False
+
+def inparams(params):
+ ip = []
+ for param in params:
+ if is_in_param(param):
+ ip.append(param)
+ return ip
+
+def is_array_param(p):
+ if param_kind(p) == IN_ARRAY or param_kind(p) == INOUT_ARRAY or param_kind(p) == OUT_ARRAY:
+ return True
+ else:
+ return False
+
+def arrayparams(params):
+ op = []
+ for param in params:
+ if is_array_param(param):
+ op.append(param)
+ return op
+
+
+def ml_unwrap(t, ts, s):
+ if t == STRING:
+ return '(' + ts + ') String_val(' + s + ')'
+ elif t == BOOL:
+ return '(' + ts + ') Bool_val(' + s + ')'
+ elif t == INT or t == PRINT_MODE or t == ERROR_CODE:
+ return '(' + ts + ') Int_val(' + s + ')'
+ elif t == UINT:
+ return '(' + ts + ') Unsigned_int_val(' + s + ')'
+ elif t == INT64:
+ return '(' + ts + ') Long_val(' + s + ')'
+ elif t == UINT64:
+ return '(' + ts + ') Unsigned_long_val(' + s + ')'
+ elif t == DOUBLE:
+ return '(' + ts + ') Double_val(' + s + ')'
+ else:
+ return '* (' + ts + '*) Data_custom_val(' + s + ')'
+
+def ml_set_wrap(t, d, n):
+ if t == VOID:
+ return d + ' = Val_unit;'
+ elif t == BOOL:
+ return d + ' = Val_bool(' + n + ');'
+ elif t == INT or t == UINT or t == PRINT_MODE or t == ERROR_CODE:
+ return d + ' = Val_int(' + n + ');'
+ elif t == INT64 or t == UINT64:
+ return d + ' = Val_long(' + n + ');'
+ elif t == DOUBLE:
+ return 'Store_double_val(' + d + ', ' + n + ');'
+ elif t == STRING:
+ return d + ' = caml_copy_string((const char*) ' + n + ');'
+ else:
+ ts = type2str(t)
+ return d + ' = caml_alloc_custom(&default_custom_ops, sizeof(' + ts + '), 0, 1); memcpy( Data_custom_val(' + d + '), &' + n + ', sizeof(' + ts + '));'
+
+def mk_ml():
+ global Type2Str
+ if not is_ml_enabled():
+ return
+ ml_dir = get_component('ml').src_dir
+ ml_nativef = os.path.join(ml_dir, 'z3native.ml')
+ ml_nativefi = os.path.join(ml_dir, 'z3native.mli')
+ ml_wrapperf = os.path.join(ml_dir, 'z3native_stubs.c')
+ ml_native = open(ml_nativef, 'w')
+ ml_i = open(ml_nativefi, 'w')
+ ml_native.write('(* Automatically generated file *)\n\n')
+ ml_native.write('(** The native (raw) interface to the dynamic Z3 library. *)\n\n')
+ ml_i.write('(* Automatically generated file *)\n\n')
+ ml_i.write('(** The native (raw) interface to the dynamic Z3 library. *)\n\n')
+ ml_i.write('(**/**)\n\n');
+ ml_native.write('open Z3enums\n\n')
+ ml_native.write('(**/**)\n')
+ ml_native.write('type ptr\n')
+ ml_i.write('type ptr\n')
+ ml_native.write('and z3_symbol = ptr\n')
+ ml_i.write('and z3_symbol = ptr\n')
+ for k, v in Type2Str.iteritems():
+ if is_obj(k):
+ ml_native.write('and %s = ptr\n' % v.lower())
+ ml_i.write('and %s = ptr\n' % v.lower())
+ ml_native.write('\n')
+ ml_i.write('\n')
+ ml_native.write('external is_null : ptr -> bool\n = "n_is_null"\n\n')
+ ml_native.write('external mk_null : unit -> ptr\n = "n_mk_null"\n\n')
+ ml_native.write('external set_internal_error_handler : ptr -> unit\n = "n_set_internal_error_handler"\n\n')
+ ml_native.write('exception Exception of string\n\n')
+ ml_i.write('val is_null : ptr -> bool\n')
+ ml_i.write('val mk_null : unit -> ptr\n')
+ ml_i.write('val set_internal_error_handler : ptr -> unit\n\n')
+ ml_i.write('exception Exception of string\n\n')
+
+ # ML declarations
+ ml_native.write('module ML2C = struct\n\n')
+ for name, result, params in _dotnet_decls:
+ ml_native.write(' external n_%s : ' % ml_method_name(name))
+ ml_i.write('val %s : ' % ml_method_name(name))
+ ip = inparams(params)
+ op = outparams(params)
+ if len(ip) == 0:
+ ml_native.write(' unit -> ')
+ ml_i.write(' unit -> ')
+ for p in ip:
+ ml_native.write('%s -> ' % param2ml(p))
+ ml_i.write('%s -> ' % param2ml(p))
+ if len(op) > 0:
+ ml_native.write('(')
+ ml_i.write('(')
+ first = True
+ if result != VOID or len(op) == 0:
+ ml_native.write('%s' % type2ml(result))
+ ml_i.write('%s' % type2ml(result))
+ first = False
+ for p in op:
+ if first:
+ first = False
+ else:
+ ml_native.write(' * ')
+ ml_i.write(' * ')
+ ml_native.write('%s' % param2ml(p))
+ ml_i.write('%s' % param2ml(p))
+ if len(op) > 0:
+ ml_native.write(')')
+ ml_i.write(')')
+ ml_native.write('\n')
+ ml_i.write('\n')
+ if len(ip) > 5:
+ ml_native.write(' = "n_%s_bytecode"\n' % ml_method_name(name))
+ ml_native.write(' "n_%s"\n' % ml_method_name(name))
+ else:
+ ml_native.write(' = "n_%s"\n' % ml_method_name(name))
+ ml_native.write('\n')
+ ml_native.write(' end\n\n')
+ ml_i.write('\n(**/**)\n');
+
+ # Exception wrappers
+ for name, result, params in _dotnet_decls:
+ ip = inparams(params)
+ op = outparams(params)
+ ml_native.write(' let %s ' % ml_method_name(name))
+
+ first = True
+ i = 0;
+ for p in params:
+ if is_in_param(p):
+ if first:
+ first = False;
+ else:
+ ml_native.write(' ')
+ ml_native.write('a%d' % i)
+ i = i + 1
+ if len(ip) == 0:
+ ml_native.write('()')
+ ml_native.write(' = \n')
+ ml_native.write(' ')
+ if result == VOID and len(op) == 0:
+ ml_native.write('let _ = ')
+ else:
+ ml_native.write('let res = ')
+ ml_native.write('(ML2C.n_%s' % (ml_method_name(name)))
+ if len(ip) == 0:
+ ml_native.write(' ()')
+ first = True
+ i = 0;
+ for p in params:
+ if is_in_param(p):
+ ml_native.write(' a%d' % i)
+ i = i + 1
+ ml_native.write(') in\n')
+ if name not in Unwrapped and len(params) > 0 and param_type(params[0]) == CONTEXT:
+ ml_native.write(' let err = (error_code_of_int (ML2C.n_get_error_code a0)) in \n')
+ ml_native.write(' if err <> OK then\n')
+ ml_native.write(' raise (Exception (ML2C.n_get_error_msg_ex a0 (int_of_error_code err)))\n')
+ ml_native.write(' else\n')
+ if result == VOID and len(op) == 0:
+ ml_native.write(' ()\n')
+ else:
+ ml_native.write(' res\n')
+ ml_native.write('\n')
+ ml_native.write('(**/**)\n')
+
+ # C interface
+ ml_wrapper = open(ml_wrapperf, 'w')
+ ml_wrapper.write('// Automatically generated file\n\n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n\n')
+ ml_wrapper.write('#ifdef __cplusplus\n')
+ ml_wrapper.write('extern "C" {\n')
+ ml_wrapper.write('#endif\n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#ifdef Custom_tag\n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#include \n')
+ ml_wrapper.write('#endif\n')
+ ml_wrapper.write('#ifdef __cplusplus\n')
+ ml_wrapper.write('}\n')
+ ml_wrapper.write('#endif\n\n')
+ ml_wrapper.write('#include \n\n')
+ ml_wrapper.write('#define CAMLlocal6(X1,X2,X3,X4,X5,X6) \\\n')
+ ml_wrapper.write(' CAMLlocal5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLlocal1(X6) \n')
+ ml_wrapper.write('#define CAMLlocal7(X1,X2,X3,X4,X5,X6,X7) \\\n')
+ ml_wrapper.write(' CAMLlocal5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLlocal2(X6,X7) \n')
+ ml_wrapper.write('#define CAMLlocal8(X1,X2,X3,X4,X5,X6,X7,X8) \\\n')
+ ml_wrapper.write(' CAMLlocal5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLlocal3(X6,X7,X8) \n')
+ ml_wrapper.write('\n')
+ ml_wrapper.write('#define CAMLparam7(X1,X2,X3,X4,X5,X6,X7) \\\n')
+ ml_wrapper.write(' CAMLparam5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLxparam2(X6,X7) \n')
+ ml_wrapper.write('#define CAMLparam8(X1,X2,X3,X4,X5,X6,X7,X8) \\\n')
+ ml_wrapper.write(' CAMLparam5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLxparam3(X6,X7,X8) \n')
+ ml_wrapper.write('#define CAMLparam9(X1,X2,X3,X4,X5,X6,X7,X8,X9) \\\n')
+ ml_wrapper.write(' CAMLparam5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLxparam4(X6,X7,X8,X9) \n')
+ ml_wrapper.write('#define CAMLparam12(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) \\\n')
+ ml_wrapper.write(' CAMLparam5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLxparam5(X6,X7,X8,X9,X10); \\\n')
+ ml_wrapper.write(' CAMLxparam2(X11,X12) \n')
+ ml_wrapper.write('#define CAMLparam13(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13) \\\n')
+ ml_wrapper.write(' CAMLparam5(X1,X2,X3,X4,X5); \\\n')
+ ml_wrapper.write(' CAMLxparam5(X6,X7,X8,X9,X10); \\\n')
+ ml_wrapper.write(' CAMLxparam3(X11,X12,X13) \n')
+ ml_wrapper.write('\n\n')
+ ml_wrapper.write('static struct custom_operations default_custom_ops = {\n')
+ ml_wrapper.write(' (char*) "default handling",\n')
+ ml_wrapper.write(' custom_finalize_default,\n')
+ ml_wrapper.write(' custom_compare_default,\n')
+ ml_wrapper.write(' custom_hash_default,\n')
+ ml_wrapper.write(' custom_serialize_default,\n')
+ ml_wrapper.write(' custom_deserialize_default\n')
+ ml_wrapper.write('};\n\n')
+ ml_wrapper.write('#ifdef __cplusplus\n')
+ ml_wrapper.write('extern "C" {\n')
+ ml_wrapper.write('#endif\n\n')
+ ml_wrapper.write('CAMLprim value n_is_null(value p) {\n')
+ ml_wrapper.write(' void * t = * (void**) Data_custom_val(p);\n')
+ ml_wrapper.write(' return Val_bool(t == 0);\n')
+ ml_wrapper.write('}\n\n')
+ ml_wrapper.write('CAMLprim value n_mk_null( void ) {\n')
+ ml_wrapper.write(' CAMLparam0();\n')
+ ml_wrapper.write(' CAMLlocal1(result);\n')
+ ml_wrapper.write(' void * z3_result = 0;\n')
+ ml_wrapper.write(' result = caml_alloc_custom(&default_custom_ops, sizeof(void*), 0, 1);\n')
+ ml_wrapper.write(' memcpy( Data_custom_val(result), &z3_result, sizeof(void*));\n')
+ ml_wrapper.write(' CAMLreturn (result);\n')
+ ml_wrapper.write('}\n\n')
+ ml_wrapper.write('void MLErrorHandler(Z3_context c, Z3_error_code e)\n')
+ ml_wrapper.write('{\n')
+ ml_wrapper.write(' // Internal do-nothing error handler. This is required to avoid that Z3 calls exit()\n')
+ ml_wrapper.write(' // upon errors, but the actual error handling is done by throwing exceptions in the\n')
+ ml_wrapper.write(' // wrappers below.\n')
+ ml_wrapper.write('}\n\n')
+ ml_wrapper.write('void n_set_internal_error_handler(value a0)\n')
+ ml_wrapper.write('{\n')
+ ml_wrapper.write(' Z3_context _a0 = * (Z3_context*) Data_custom_val(a0);\n')
+ ml_wrapper.write(' Z3_set_error_handler(_a0, MLErrorHandler);\n')
+ ml_wrapper.write('}\n\n')
+ for name, result, params in _dotnet_decls:
+ ip = inparams(params)
+ op = outparams(params)
+ ap = arrayparams(params)
+ ret_size = len(op)
+ if result != VOID:
+ ret_size = ret_size + 1
+
+ # Setup frame
+ ml_wrapper.write('CAMLprim value n_%s(' % ml_method_name(name))
+ first = True
+ i = 0
+ for p in params:
+ if is_in_param(p):
+ if first:
+ first = False
+ else:
+ ml_wrapper.write(', ')
+ ml_wrapper.write('value a%d' % i)
+ i = i + 1
+ ml_wrapper.write(') {\n')
+ ml_wrapper.write(' CAMLparam%d(' % len(ip))
+ i = 0
+ first = True
+ for p in params:
+ if is_in_param(p):
+ if first:
+ first = False
+ else:
+ ml_wrapper.write(', ')
+ ml_wrapper.write('a%d' % i)
+ i = i + 1
+ ml_wrapper.write(');\n')
+ i = 0
+ if len(op) + len(ap) == 0:
+ ml_wrapper.write(' CAMLlocal1(result);\n')
+ else:
+ c = 0
+ for p in params:
+ if is_out_param(p) or is_array_param(p):
+ c = c + 1
+ ml_wrapper.write(' CAMLlocal%s(result, res_val' % (c+2))
+ for p in params:
+ if is_out_param(p) or is_array_param(p):
+ ml_wrapper.write(', _a%s_val' % i)
+ i = i + 1
+ ml_wrapper.write(');\n')
+
+ if len(ap) != 0:
+ ml_wrapper.write(' unsigned _i;\n')
+
+ # declare locals, preprocess arrays, strings, in/out arguments
+ i = 0
+ for param in params:
+ k = param_kind(param)
+ if k == OUT_ARRAY:
+ ml_wrapper.write(' %s * _a%s = (%s*) malloc(sizeof(%s) * (_a%s));\n' % (
+ type2str(param_type(param)),
+ i,
+ type2str(param_type(param)),
+ type2str(param_type(param)),
+ param_array_capacity_pos(param)))
+ elif k == OUT_MANAGED_ARRAY:
+ ml_wrapper.write(' %s * _a%s = 0;\n' % (type2str(param_type(param)), i))
+ elif k == IN_ARRAY or k == INOUT_ARRAY:
+ t = param_type(param)
+ ts = type2str(t)
+ ml_wrapper.write(' %s * _a%s = (%s*) malloc(sizeof(%s) * _a%s);\n' % (ts, i, ts, ts, param_array_capacity_pos(param)))
+ elif k == IN:
+ t = param_type(param)
+ ml_wrapper.write(' %s _a%s = %s;\n' % (type2str(t), i, ml_unwrap(t, type2str(t), 'a' + str(i))))
+ elif k == OUT:
+ ml_wrapper.write(' %s _a%s;\n' % (type2str(param_type(param)), i))
+ elif k == INOUT:
+ ml_wrapper.write(' %s _a%s = a%s;\n' % (type2str(param_type(param)), i, i))
+ i = i + 1
+
+ if result != VOID:
+ ml_wrapper.write(' %s z3_result;\n' % type2str(result))
+
+ i = 0
+ for param in params:
+ k = param_kind(param)
+ if k == IN_ARRAY or k == INOUT_ARRAY:
+ t = param_type(param)
+ ts = type2str(t)
+ ml_wrapper.write(' for (_i = 0; _i < _a%s; _i++) { _a%s[_i] = %s; }\n' % (param_array_capacity_pos(param), i, ml_unwrap(t, ts, 'Field(a' + str(i) + ', _i)')))
+ i = i + 1
+
+ # invoke procedure
+ ml_wrapper.write(' ')
+ if result != VOID:
+ ml_wrapper.write('z3_result = ')
+ ml_wrapper.write('%s(' % name)
+ i = 0
+ first = True
+ for param in params:
+ if first:
+ first = False
+ else:
+ ml_wrapper.write(', ')
+ k = param_kind(param)
+ if k == OUT or k == INOUT or k == OUT_MANAGED_ARRAY:
+ ml_wrapper.write('&_a%s' % i)
+ else:
+ ml_wrapper.write('_a%i' % i)
+ i = i + 1
+ ml_wrapper.write(');\n')
+
+ # convert output params
+ if len(op) > 0:
+ if result != VOID:
+ ml_wrapper.write(' %s\n' % ml_set_wrap(result, "res_val", "z3_result"))
+ i = 0;
+ for p in params:
+ if param_kind(p) == OUT_ARRAY or param_kind(p) == INOUT_ARRAY:
+ ml_wrapper.write(' _a%s_val = caml_alloc(_a%s, 0);\n' % (i, param_array_capacity_pos(p)))
+ ml_wrapper.write(' for (_i = 0; _i < _a%s; _i++) { value t; %s Store_field(_a%s_val, _i, t); }\n' % (param_array_capacity_pos(p), ml_set_wrap(param_type(p), 't', '_a' + str(i) + '[_i]'), i))
+ elif param_kind(p) == OUT_MANAGED_ARRAY:
+ ml_wrapper.write(' %s\n' % ml_set_wrap(param_type(p), "_a" + str(i) + "_val", "_a" + str(i) ))
+ elif is_out_param(p):
+ ml_wrapper.write(' %s\n' % ml_set_wrap(param_type(p), "_a" + str(i) + "_val", "_a" + str(i) ))
+ i = i + 1
+
+ # return tuples
+ if len(op) == 0:
+ ml_wrapper.write(' %s\n' % ml_set_wrap(result, "result", "z3_result"))
+ else:
+ ml_wrapper.write(' result = caml_alloc(%s, 0);\n' % ret_size)
+ i = j = 0
+ if result != VOID:
+ ml_wrapper.write(' Store_field(result, 0, res_val);\n')
+ j = j + 1
+ for p in params:
+ if is_out_param(p):
+ ml_wrapper.write(' Store_field(result, %s, _a%s_val);\n' % (j, i))
+ j = j + 1;
+ i = i + 1
+
+ # local array cleanup
+ i = 0
+ for p in params:
+ k = param_kind(p)
+ if k == OUT_ARRAY or k == IN_ARRAY or k == INOUT_ARRAY:
+ ml_wrapper.write(' free(_a%s);\n' % i)
+ i = i + 1
+
+ # return
+ ml_wrapper.write(' CAMLreturn(result);\n')
+ ml_wrapper.write('}\n\n')
+ if len(ip) > 5:
+ ml_wrapper.write('CAMLprim value n_%s_bytecode(value * argv, int argn) {\n' % ml_method_name(name))
+ ml_wrapper.write(' return n_%s(' % ml_method_name(name))
+ i = 0
+ while i < len(ip):
+ if i == 0:
+ ml_wrapper.write('argv[0]')
+ else:
+ ml_wrapper.write(', argv[%s]' % i)
+ i = i + 1
+ ml_wrapper.write(');\n}\n')
+ ml_wrapper.write('\n\n')
+ ml_wrapper.write('#ifdef __cplusplus\n')
+ ml_wrapper.write('}\n')
+ ml_wrapper.write('#endif\n')
+ if is_verbose():
+ print ('Generated "%s"' % ml_nativef)
+
# Collect API(...) commands from
def def_APIs():
pat1 = re.compile(" *def_API.*")
@@ -1063,6 +1547,7 @@ mk_py_wrappers()
mk_dotnet()
mk_dotnet_wrappers()
mk_java()
+mk_ml()
log_h.close()
log_c.close()
diff --git a/src/api/api_ast.cpp b/src/api/api_ast.cpp
index c2864ca2d..b9c6230b7 100644
--- a/src/api/api_ast.cpp
+++ b/src/api/api_ast.cpp
@@ -648,6 +648,12 @@ extern "C" {
else if (fid == mk_c(c)->get_datalog_fid() && k == datalog::DL_FINITE_SORT) {
return Z3_FINITE_DOMAIN_SORT;
}
+ else if (fid == mk_c(c)->get_fpa_fid() && k == FLOATING_POINT_SORT) {
+ return Z3_FLOATING_POINT_SORT;
+ }
+ else if (fid == mk_c(c)->get_fpa_fid() && k == ROUNDING_MODE_SORT) {
+ return Z3_ROUNDING_MODE_SORT;
+ }
else {
return Z3_UNKNOWN_SORT;
}
@@ -1113,6 +1119,62 @@ extern "C" {
return Z3_OP_UNINTERPRETED;
}
}
+
+ if (mk_c(c)->get_fpa_fid() == _d->get_family_id()) {
+ switch (_d->get_decl_kind()) {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN: return Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN;
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY: return Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY;
+ case OP_FPA_RM_TOWARD_POSITIVE: return Z3_OP_FPA_RM_TOWARD_POSITIVE;
+ case OP_FPA_RM_TOWARD_NEGATIVE: return Z3_OP_FPA_RM_TOWARD_NEGATIVE;
+ case OP_FPA_RM_TOWARD_ZERO: return Z3_OP_FPA_RM_TOWARD_ZERO;
+ case OP_FPA_NUM: return Z3_OP_FPA_NUM;
+ case OP_FPA_PLUS_INF: return Z3_OP_FPA_PLUS_INF;
+ case OP_FPA_MINUS_INF: return Z3_OP_FPA_MINUS_INF;
+ case OP_FPA_NAN: return Z3_OP_FPA_NAN;
+ case OP_FPA_MINUS_ZERO: return Z3_OP_FPA_MINUS_ZERO;
+ case OP_FPA_PLUS_ZERO: return Z3_OP_FPA_PLUS_ZERO;
+ case OP_FPA_ADD: return Z3_OP_FPA_ADD;
+ case OP_FPA_SUB: return Z3_OP_FPA_SUB;
+ case OP_FPA_NEG: return Z3_OP_FPA_NEG;
+ case OP_FPA_MUL: return Z3_OP_FPA_MUL;
+ case OP_FPA_DIV: return Z3_OP_FPA_DIV;
+ case OP_FPA_REM: return Z3_OP_FPA_REM;
+ case OP_FPA_ABS: return Z3_OP_FPA_ABS;
+ case OP_FPA_MIN: return Z3_OP_FPA_MIN;
+ case OP_FPA_MAX: return Z3_OP_FPA_MAX;
+ case OP_FPA_FMA: return Z3_OP_FPA_FMA;
+ case OP_FPA_SQRT: return Z3_OP_FPA_SQRT;
+ case OP_FPA_EQ: return Z3_OP_FPA_EQ;
+ case OP_FPA_ROUND_TO_INTEGRAL: return Z3_OP_FPA_ROUND_TO_INTEGRAL;
+ case OP_FPA_LT: return Z3_OP_FPA_LT;
+ case OP_FPA_GT: return Z3_OP_FPA_GT;
+ case OP_FPA_LE: return Z3_OP_FPA_LE;
+ case OP_FPA_GE: return Z3_OP_FPA_GE;
+ case OP_FPA_IS_NAN: return Z3_OP_FPA_IS_NAN;
+ case OP_FPA_IS_INF: return Z3_OP_FPA_IS_INF;
+ case OP_FPA_IS_ZERO: return Z3_OP_FPA_IS_ZERO;
+ case OP_FPA_IS_NORMAL: return Z3_OP_FPA_IS_NORMAL;
+ case OP_FPA_IS_SUBNORMAL: return Z3_OP_FPA_IS_SUBNORMAL;
+ case OP_FPA_IS_NEGATIVE: return Z3_OP_FPA_IS_NEGATIVE;
+ case OP_FPA_IS_POSITIVE: return Z3_OP_FPA_IS_POSITIVE;
+ case OP_FPA_FP: return Z3_OP_FPA_FP;
+ case OP_FPA_TO_FP: return Z3_OP_FPA_TO_FP;
+ case OP_FPA_TO_FP_UNSIGNED: return Z3_OP_FPA_TO_FP_UNSIGNED;
+ case OP_FPA_TO_UBV: return Z3_OP_FPA_TO_UBV;
+ case OP_FPA_TO_SBV: return Z3_OP_FPA_TO_SBV;
+ case OP_FPA_TO_REAL: return Z3_OP_FPA_TO_REAL;
+ case OP_FPA_TO_IEEE_BV: return Z3_OP_FPA_TO_IEEE_BV;
+ case OP_FPA_INTERNAL_BVWRAP:
+ case OP_FPA_INTERNAL_BVUNWRAP:
+ case OP_FPA_INTERNAL_TO_UBV_UNSPECIFIED:
+ case OP_FPA_INTERNAL_TO_SBV_UNSPECIFIED:
+ case OP_FPA_INTERNAL_TO_REAL_UNSPECIFIED:
+ return Z3_OP_UNINTERPRETED;
+ default:
+ UNREACHABLE();
+ return Z3_OP_UNINTERPRETED;
+ }
+ }
if (mk_c(c)->m().get_label_family_id() == _d->get_family_id()) {
switch(_d->get_decl_kind()) {
diff --git a/src/api/api_context.cpp b/src/api/api_context.cpp
index b10621d43..3408cdf3c 100644
--- a/src/api/api_context.cpp
+++ b/src/api/api_context.cpp
@@ -88,6 +88,7 @@ namespace api {
m_arith_util(m()),
m_bv_util(m()),
m_datalog_util(m()),
+ m_fpa_util(m()),
m_last_result(m()),
m_ast_trail(m()),
m_replay_stack() {
@@ -112,6 +113,7 @@ namespace api {
m_array_fid = m().mk_family_id("array");
m_dt_fid = m().mk_family_id("datatype");
m_datalog_fid = m().mk_family_id("datalog_relation");
+ m_fpa_fid = m().mk_family_id("fpa");
m_dt_plugin = static_cast(m().get_plugin(m_dt_fid));
if (!m_user_ref_count) {
diff --git a/src/api/api_context.h b/src/api/api_context.h
index e0c95b07b..58394c028 100644
--- a/src/api/api_context.h
+++ b/src/api/api_context.h
@@ -27,6 +27,7 @@ Revision History:
#include"bv_decl_plugin.h"
#include"datatype_decl_plugin.h"
#include"dl_decl_plugin.h"
+#include"fpa_decl_plugin.h"
#include"smt_kernel.h"
#include"smt_params.h"
#include"event_handler.h"
@@ -56,6 +57,7 @@ namespace api {
arith_util m_arith_util;
bv_util m_bv_util;
datalog::dl_decl_util m_datalog_util;
+ fpa_util m_fpa_util;
// Support for old solver API
smt_params m_fparams;
@@ -75,6 +77,7 @@ namespace api {
family_id m_bv_fid;
family_id m_dt_fid;
family_id m_datalog_fid;
+ family_id m_fpa_fid;
datatype_decl_plugin * m_dt_plugin;
std::string m_string_buffer; // temporary buffer used to cache strings sent to the "external" world.
@@ -115,12 +118,14 @@ namespace api {
arith_util & autil() { return m_arith_util; }
bv_util & bvutil() { return m_bv_util; }
datalog::dl_decl_util & datalog_util() { return m_datalog_util; }
+ fpa_util & fpautil() { return m_fpa_util; }
family_id get_basic_fid() const { return m_basic_fid; }
family_id get_array_fid() const { return m_array_fid; }
family_id get_arith_fid() const { return m_arith_fid; }
family_id get_bv_fid() const { return m_bv_fid; }
family_id get_dt_fid() const { return m_dt_fid; }
family_id get_datalog_fid() const { return m_datalog_fid; }
+ family_id get_fpa_fid() const { return m_fpa_fid; }
datatype_decl_plugin * get_dt_plugin() const { return m_dt_plugin; }
Z3_error_code get_error_code() const { return m_error_code; }
diff --git a/src/api/api_fpa.cpp b/src/api/api_fpa.cpp
new file mode 100644
index 000000000..e7ae685fc
--- /dev/null
+++ b/src/api/api_fpa.cpp
@@ -0,0 +1,842 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ api_fpa.cpp
+
+Abstract:
+
+ Additional APIs for floating-point arithmetic (FP).
+
+Author:
+
+ Christoph M. Wintersteiger (cwinter) 2013-06-05
+
+Notes:
+
+--*/
+#include
+#include"z3.h"
+#include"api_log_macros.h"
+#include"api_context.h"
+#include"fpa_decl_plugin.h"
+
+extern "C" {
+
+ Z3_sort Z3_API Z3_mk_fpa_rounding_mode_sort(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rounding_mode_sort(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ sort * s = ctx->fpautil().mk_rm_sort();
+ mk_c(c)->save_ast_trail(s);
+ RETURN_Z3(of_sort(s));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_nearest_ties_to_even(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_nearest_ties_to_even(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_nearest_ties_to_even();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rne(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rne(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_nearest_ties_to_even();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_nearest_ties_to_away(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_nearest_ties_to_away(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_nearest_ties_to_away();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rna(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rna(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_nearest_ties_to_away();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_positive(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_toward_positive(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_positive();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rtp(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rtp(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_positive();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_negative(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_toward_negative(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_negative();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rtn(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rtn(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_negative();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_zero(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_toward_zero(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_zero();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rtz(Z3_context c) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rtz(c);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_toward_zero();
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+
+ Z3_sort Z3_API Z3_mk_fpa_sort(Z3_context c, unsigned ebits, unsigned sbits) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_sort(c, ebits, sbits);
+ RESET_ERROR_CODE();
+ if (ebits < 2 || sbits < 3) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ }
+ api::context * ctx = mk_c(c);
+ sort * s = ctx->fpautil().mk_float_sort(ebits, sbits);
+ ctx->save_ast_trail(s);
+ RETURN_Z3(of_sort(s));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_half(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 5, 11);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_16(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 5, 11);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_single(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 8, 24);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_32(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 8, 24);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_double(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 11, 53);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_64(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 11, 53);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_quadruple(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 15, 113);
+ }
+
+ Z3_sort Z3_API Z3_mk_fpa_sort_128(Z3_context c) {
+ return Z3_mk_fpa_sort(c, 15, 113);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_nan(Z3_context c, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_nan(c, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_nan(to_sort(s));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_inf(Z3_context c, Z3_sort s, Z3_bool negative) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_inf(c, s, negative);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = negative != 0 ? ctx->fpautil().mk_ninf(to_sort(s)) :
+ ctx->fpautil().mk_pinf(to_sort(s));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_zero(Z3_context c, Z3_sort s, Z3_bool negative) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_inf(c, s, negative);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = negative != 0 ? ctx->fpautil().mk_nzero(to_sort(s)) :
+ ctx->fpautil().mk_pzero(to_sort(s));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_fp(Z3_context c, Z3_ast sgn, Z3_ast exp, Z3_ast sig) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_fp(c, sgn, sig, exp);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_fp(to_expr(sgn), to_expr(sig), to_expr(exp));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_numeral_float(Z3_context c, float v, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_numeral_float(c, v, ty);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ scoped_mpf tmp(ctx->fpautil().fm());
+ ctx->fpautil().fm().set(tmp,
+ ctx->fpautil().get_ebits(to_sort(ty)),
+ ctx->fpautil().get_sbits(to_sort(ty)),
+ v);
+ expr * a = ctx->fpautil().mk_value(tmp);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_numeral_double(Z3_context c, double v, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_numeral_double(c, v, ty);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ scoped_mpf tmp(ctx->fpautil().fm());
+ ctx->fpautil().fm().set(tmp, ctx->fpautil().get_ebits(to_sort(ty)), ctx->fpautil().get_sbits(to_sort(ty)), v);
+ expr * a = ctx->fpautil().mk_value(tmp);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int(Z3_context c, signed v, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_numeral_int(c, v, ty);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ scoped_mpf tmp(ctx->fpautil().fm());
+ ctx->fpautil().fm().set(tmp,
+ ctx->fpautil().get_ebits(to_sort(ty)),
+ ctx->fpautil().get_sbits(to_sort(ty)),
+ v);
+ expr * a = ctx->fpautil().mk_value(tmp);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int_uint(Z3_context c, Z3_bool sgn, signed exp, unsigned sig, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_numeral_int64_uint64(c, sgn, exp, sig, ty);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ scoped_mpf tmp(ctx->fpautil().fm());
+ ctx->fpautil().fm().set(tmp,
+ ctx->fpautil().get_ebits(to_sort(ty)),
+ ctx->fpautil().get_sbits(to_sort(ty)),
+ sgn != 0, sig, exp);
+ expr * a = ctx->fpautil().mk_value(tmp);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int64_uint64(Z3_context c, Z3_bool sgn, __int64 exp, __uint64 sig, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_numeral_int64_uint64(c, sgn, exp, sig, ty);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ scoped_mpf tmp(ctx->fpautil().fm());
+ ctx->fpautil().fm().set(tmp,
+ ctx->fpautil().get_ebits(to_sort(ty)),
+ ctx->fpautil().get_sbits(to_sort(ty)),
+ sgn != 0, sig, exp);
+ expr * a = ctx->fpautil().mk_value(tmp);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_abs(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_abs(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_abs(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_neg(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_neg(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_neg(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_add(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_add(c, rm, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_add(to_expr(rm), to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_sub(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_add(c, rm, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_sub(to_expr(rm), to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_mul(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_add(c, rm, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_mul(to_expr(rm), to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_div(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_add(c, rm, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_div(to_expr(rm), to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_fma(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2, Z3_ast t3) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_fma(c, rm, t1, t2, t3);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_fma(to_expr(rm), to_expr(t1), to_expr(t2), to_expr(t3));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_sqrt(Z3_context c, Z3_ast rm, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_sqrt(c, rm, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_sqrt(to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_rem(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_rem(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_rem(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_round_to_integral(Z3_context c, Z3_ast rm, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_round_to_integral(c, rm, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_round_to_integral(to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_min(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_min(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_min(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_max(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_max(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ Z3_ast r = of_ast(ctx->fpautil().mk_max(to_expr(t1), to_expr(t2)));
+ RETURN_Z3(r);
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_leq(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_leq(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_le(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_lt(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_lt(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_lt(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_geq(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_geq(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_ge(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_gt(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_gt(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_gt(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_eq(Z3_context c, Z3_ast t1, Z3_ast t2) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_eq(c, t1, t2);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_float_eq(to_expr(t1), to_expr(t2));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_normal(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_normal(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_normal(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_subnormal(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_subnormal(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_subnormal(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_zero(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_zero(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_zero(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_infinite(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_infinite(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_inf(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_nan(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_nan(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_nan(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_negative(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_negative(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_negative(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_is_positive(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_is_positive(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_is_positive(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_bv(Z3_context c, Z3_ast bv, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_bv(c, bv, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!ctx->bvutil().is_bv(to_expr(bv)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp(to_sort(s), to_expr(bv));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_float(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_float(c, rm, t, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!fu.is_rm(to_expr(rm)) ||
+ !fu.is_float(to_expr(t)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp(to_sort(s), to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_real(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_real(c, rm, t, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!fu.is_rm(to_expr(rm)) ||
+ !ctx->autil().is_real(to_expr(t)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp(to_sort(s), to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_signed(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_signed(c, rm, t, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!fu.is_rm(to_expr(rm)) ||
+ !ctx->bvutil().is_bv(to_expr(t)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp(to_sort(s), to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_unsigned(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_unsigned(c, rm, t, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!fu.is_rm(to_expr(rm)) ||
+ !ctx->bvutil().is_bv(to_expr(t)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp_unsigned(to_sort(s), to_expr(rm), to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_ubv(Z3_context c, Z3_ast rm, Z3_ast t, unsigned sz) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_ubv(c, rm, t, sz);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_to_ubv(to_expr(rm), to_expr(t), sz);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_sbv(Z3_context c, Z3_ast rm, Z3_ast t, unsigned sz) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_sbv(c, rm, t, sz);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_to_sbv(to_expr(rm), to_expr(t), sz);
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_real(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_real(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ expr * a = ctx->fpautil().mk_to_real(to_expr(t));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+ unsigned Z3_API Z3_fpa_get_ebits(Z3_context c, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_ebits(c, s);
+ RESET_ERROR_CODE();
+ CHECK_NON_NULL(s, 0);
+ return mk_c(c)->fpautil().get_ebits(to_sort(s));
+ Z3_CATCH_RETURN(0);
+ }
+
+ unsigned Z3_API Z3_fpa_get_sbits(Z3_context c, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_ebits(c, s);
+ RESET_ERROR_CODE();
+ CHECK_NON_NULL(s, 0);
+ return mk_c(c)->fpautil().get_sbits(to_sort(s));
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_bool Z3_API Z3_fpa_get_numeral_sign(Z3_context c, Z3_ast t, int * sgn) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_numeral_sign(c, t, sgn);
+ RESET_ERROR_CODE();
+ ast_manager & m = mk_c(c)->m();
+ mpf_manager & mpfm = mk_c(c)->fpautil().fm();
+ fpa_decl_plugin * plugin = (fpa_decl_plugin*)m.get_plugin(mk_c(c)->get_fpa_fid());
+ scoped_mpf val(mpfm);
+ bool r = plugin->is_numeral(to_expr(t), val);
+ if (!r || mpfm.is_nan(val)) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ *sgn = (mpfm.is_nan(val)) ? 0 : mpfm.sgn(val);
+ return r;
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_string Z3_API Z3_fpa_get_numeral_significand_string(__in Z3_context c, __in Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_numeral_significand_string(c, t);
+ RESET_ERROR_CODE();
+ ast_manager & m = mk_c(c)->m();
+ mpf_manager & mpfm = mk_c(c)->fpautil().fm();
+ unsynch_mpz_manager & mpzm = mpfm.mpz_manager();
+ unsynch_mpq_manager & mpqm = mpfm.mpq_manager();
+ fpa_decl_plugin * plugin = (fpa_decl_plugin*)m.get_plugin(mk_c(c)->get_fpa_fid());
+ scoped_mpf val(mpfm);
+ if (!plugin->is_numeral(to_expr(t), val)) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return "";
+ }
+ else if (!mpfm.is_regular(val)) {
+ SET_ERROR_CODE(Z3_INVALID_ARG)
+ return "";
+ }
+ unsigned sbits = val.get().get_sbits();
+ scoped_mpq q(mpqm);
+ scoped_mpz sn(mpzm);
+ mpfm.sig_normalized(val, sn);
+ mpqm.set(q, sn);
+ mpqm.div(q, mpfm.m_powers2(sbits - 1), q);
+ std::stringstream ss;
+ mpqm.display_decimal(ss, q, sbits);
+ return mk_c(c)->mk_external_string(ss.str());
+ Z3_CATCH_RETURN("");
+
+ }
+
+ Z3_string Z3_API Z3_fpa_get_numeral_exponent_string(__in Z3_context c, __in Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_numeral_exponent_string(c, t);
+ RESET_ERROR_CODE();
+ ast_manager & m = mk_c(c)->m();
+ mpf_manager & mpfm = mk_c(c)->fpautil().fm();
+ fpa_decl_plugin * plugin = (fpa_decl_plugin*)m.get_plugin(mk_c(c)->get_fpa_fid());
+ scoped_mpf val(mpfm);
+ bool r = plugin->is_numeral(to_expr(t), val);
+ if (!r) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return "";
+ }
+ else if (!mpfm.is_normal(val) && !mpfm.is_denormal(val)) {
+ SET_ERROR_CODE(Z3_INVALID_ARG)
+ return "";
+ }
+ mpf_exp_t exp = mpfm.exp_normalized(val);
+ std::stringstream ss;
+ ss << exp;
+ return mk_c(c)->mk_external_string(ss.str());
+ Z3_CATCH_RETURN("");
+ }
+
+ Z3_bool Z3_API Z3_fpa_get_numeral_exponent_int64(__in Z3_context c, __in Z3_ast t, __out __int64 * n) {
+ Z3_TRY;
+ LOG_Z3_fpa_get_numeral_exponent_string(c, t);
+ RESET_ERROR_CODE();
+ ast_manager & m = mk_c(c)->m();
+ mpf_manager & mpfm = mk_c(c)->fpautil().fm();
+ fpa_decl_plugin * plugin = (fpa_decl_plugin*)m.get_plugin(mk_c(c)->get_fpa_fid());
+ scoped_mpf val(mpfm);
+ bool r = plugin->is_numeral(to_expr(t), val);
+ if (!r) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ *n = mpfm.exp(val);
+ return 1;
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_ieee_bv(Z3_context c, Z3_ast t) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_ieee_bv(c, t);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ Z3_ast r = of_ast(ctx->fpautil().mk_float_to_ieee_bv(to_expr(t)));
+ RETURN_Z3(r);
+ Z3_CATCH_RETURN(0);
+ }
+
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_int_real(Z3_context c, Z3_ast rm, Z3_ast exp, Z3_ast sig, Z3_sort s) {
+ Z3_TRY;
+ LOG_Z3_mk_fpa_to_fp_int_real(c, rm, sig, exp, s);
+ RESET_ERROR_CODE();
+ api::context * ctx = mk_c(c);
+ fpa_util & fu = ctx->fpautil();
+ if (!fu.is_rm(to_expr(rm)) ||
+ !ctx->autil().is_real(to_expr(sig)) ||
+ !ctx->autil().is_int(to_expr(exp)) ||
+ !fu.is_float(to_sort(s))) {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return 0;
+ }
+ expr * a = fu.mk_to_fp(to_sort(s), to_expr(rm), to_expr(sig), to_expr(exp));
+ ctx->save_ast_trail(a);
+ RETURN_Z3(of_expr(a));
+ Z3_CATCH_RETURN(0);
+ }
+
+};
diff --git a/src/api/api_numeral.cpp b/src/api/api_numeral.cpp
index d4a6587bc..446a66bc5 100644
--- a/src/api/api_numeral.cpp
+++ b/src/api/api_numeral.cpp
@@ -23,13 +23,15 @@ Revision History:
#include"arith_decl_plugin.h"
#include"bv_decl_plugin.h"
#include"algebraic_numbers.h"
+#include"fpa_decl_plugin.h"
bool is_numeral_sort(Z3_context c, Z3_sort ty) {
sort * _ty = to_sort(ty);
family_id fid = _ty->get_family_id();
if (fid != mk_c(c)->get_arith_fid() &&
fid != mk_c(c)->get_bv_fid() &&
- fid != mk_c(c)->get_datalog_fid()) {
+ fid != mk_c(c)->get_datalog_fid() &&
+ fid != mk_c(c)->get_fpa_fid()) {
return false;
}
return true;
@@ -48,7 +50,7 @@ extern "C" {
Z3_ast Z3_API Z3_mk_numeral(Z3_context c, const char* n, Z3_sort ty) {
Z3_TRY;
LOG_Z3_mk_numeral(c, n, ty);
- RESET_ERROR_CODE();
+ RESET_ERROR_CODE();
if (!check_numeral_sort(c, ty)) {
RETURN_Z3(0);
}
@@ -56,40 +58,42 @@ extern "C" {
SET_ERROR_CODE(Z3_INVALID_ARG);
RETURN_Z3(0);
}
+ sort * _ty = to_sort(ty);
+ bool is_float = mk_c(c)->fpautil().is_float(_ty);
std::string fixed_num;
char const* m = n;
while (*m) {
if (!(('0' <= *m && *m <= '9') ||
- ('/' == *m) || ('-' == *m) ||
- (' ' == *m) || ('\n' == *m) ||
- ('.' == *m) || ('e' == *m) ||
- ('E' == *m))) {
+ ('/' == *m) || ('-' == *m) ||
+ (' ' == *m) || ('\n' == *m) ||
+ ('.' == *m) || ('e' == *m) ||
+ ('E' == *m) ||
+ ('p' == *m && is_float) ||
+ ('P' == *m && is_float))) {
SET_ERROR_CODE(Z3_PARSER_ERROR);
return 0;
}
++m;
}
- ast * a = mk_c(c)->mk_numeral_core(rational(n), to_sort(ty));
+ ast * a = 0;
+ if (_ty->get_family_id() == mk_c(c)->get_fpa_fid()) {
+ // avoid expanding floats into huge rationals.
+ fpa_util & fu = mk_c(c)->fpautil();
+ scoped_mpf t(fu.fm());
+ fu.fm().set(t, fu.get_ebits(_ty), fu.get_sbits(_ty), MPF_ROUND_TOWARD_ZERO, n);
+ a = fu.mk_value(t);
+ mk_c(c)->save_ast_trail(a);
+ }
+ else
+ a = mk_c(c)->mk_numeral_core(rational(n), _ty);
RETURN_Z3(of_ast(a));
Z3_CATCH_RETURN(0);
}
-
+
Z3_ast Z3_API Z3_mk_int(Z3_context c, int value, Z3_sort ty) {
Z3_TRY;
LOG_Z3_mk_int(c, value, ty);
- RESET_ERROR_CODE();
- if (!check_numeral_sort(c, ty)) {
- RETURN_Z3(0);
- }
- ast * a = mk_c(c)->mk_numeral_core(rational(value), to_sort(ty));
- RETURN_Z3(of_ast(a));
- Z3_CATCH_RETURN(0);
- }
-
- Z3_ast Z3_API Z3_mk_unsigned_int(Z3_context c, unsigned value, Z3_sort ty) {
- Z3_TRY;
- LOG_Z3_mk_unsigned_int(c, value, ty);
- RESET_ERROR_CODE();
+ RESET_ERROR_CODE();
if (!check_numeral_sort(c, ty)) {
RETURN_Z3(0);
}
@@ -97,11 +101,23 @@ extern "C" {
RETURN_Z3(of_ast(a));
Z3_CATCH_RETURN(0);
}
-
+
+ Z3_ast Z3_API Z3_mk_unsigned_int(Z3_context c, unsigned value, Z3_sort ty) {
+ Z3_TRY;
+ LOG_Z3_mk_unsigned_int(c, value, ty);
+ RESET_ERROR_CODE();
+ if (!check_numeral_sort(c, ty)) {
+ RETURN_Z3(0);
+ }
+ ast * a = mk_c(c)->mk_numeral_core(rational(value), to_sort(ty));
+ RETURN_Z3(of_ast(a));
+ Z3_CATCH_RETURN(0);
+ }
+
Z3_ast Z3_API Z3_mk_int64(Z3_context c, long long value, Z3_sort ty) {
Z3_TRY;
LOG_Z3_mk_int64(c, value, ty);
- RESET_ERROR_CODE();
+ RESET_ERROR_CODE();
if (!check_numeral_sort(c, ty)) {
RETURN_Z3(0);
}
@@ -110,11 +126,11 @@ extern "C" {
RETURN_Z3(of_ast(a));
Z3_CATCH_RETURN(0);
}
-
+
Z3_ast Z3_API Z3_mk_unsigned_int64(Z3_context c, unsigned long long value, Z3_sort ty) {
Z3_TRY;
LOG_Z3_mk_unsigned_int64(c, value, ty);
- RESET_ERROR_CODE();
+ RESET_ERROR_CODE();
if (!check_numeral_sort(c, ty)) {
RETURN_Z3(0);
}
@@ -129,9 +145,11 @@ extern "C" {
LOG_Z3_is_numeral_ast(c, a);
RESET_ERROR_CODE();
expr* e = to_expr(a);
- return
+ return
mk_c(c)->autil().is_numeral(e) ||
- mk_c(c)->bvutil().is_numeral(e);
+ mk_c(c)->bvutil().is_numeral(e) ||
+ mk_c(c)->fpautil().is_numeral(e) ||
+ mk_c(c)->fpautil().is_rm_numeral(e);
Z3_CATCH_RETURN(Z3_FALSE);
}
@@ -172,8 +190,37 @@ extern "C" {
return mk_c(c)->mk_external_string(r.to_string());
}
else {
- SET_ERROR_CODE(Z3_INVALID_ARG);
- return "";
+ // floats are separated from all others to avoid huge rationals.
+ fpa_util & fu = mk_c(c)->fpautil();
+ scoped_mpf tmp(fu.fm());
+ mpf_rounding_mode rm;
+ if (mk_c(c)->fpautil().is_rm_numeral(to_expr(a), rm)) {
+ switch (rm) {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ return mk_c(c)->mk_external_string("roundNearestTiesToEven");
+ break;
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ return mk_c(c)->mk_external_string("roundNearestTiesToAway");
+ break;
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ return mk_c(c)->mk_external_string("roundTowardPositive");
+ break;
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ return mk_c(c)->mk_external_string("roundTowardNegative");
+ break;
+ case OP_FPA_RM_TOWARD_ZERO:
+ default:
+ return mk_c(c)->mk_external_string("roundTowardZero");
+ break;
+ }
+ }
+ else if (mk_c(c)->fpautil().is_numeral(to_expr(a), tmp)) {
+ return mk_c(c)->mk_external_string(fu.fm().to_string(tmp));
+ }
+ else {
+ SET_ERROR_CODE(Z3_INVALID_ARG);
+ return "";
+ }
}
Z3_CATCH_RETURN("");
}
diff --git a/src/api/dotnet/AST.cs b/src/api/dotnet/AST.cs
index 7bc4f6dfb..d3b31a325 100644
--- a/src/api/dotnet/AST.cs
+++ b/src/api/dotnet/AST.cs
@@ -227,10 +227,8 @@ namespace Microsoft.Z3
internal override void IncRef(IntPtr o)
{
// Console.WriteLine("AST IncRef()");
- if (Context == null)
- throw new Z3Exception("inc() called on null context");
- if (o == IntPtr.Zero)
- throw new Z3Exception("inc() called on null AST");
+ if (Context == null || o == IntPtr.Zero)
+ return;
Context.AST_DRQ.IncAndClear(Context, o);
base.IncRef(o);
}
@@ -238,10 +236,8 @@ namespace Microsoft.Z3
internal override void DecRef(IntPtr o)
{
// Console.WriteLine("AST DecRef()");
- if (Context == null)
- throw new Z3Exception("dec() called on null context");
- if (o == IntPtr.Zero)
- throw new Z3Exception("dec() called on null AST");
+ if (Context == null || o == IntPtr.Zero)
+ return;
Context.AST_DRQ.Add(o);
base.DecRef(o);
}
diff --git a/src/api/dotnet/ArithExpr.cs b/src/api/dotnet/ArithExpr.cs
index bdfa7a3f0..7858ff3e1 100644
--- a/src/api/dotnet/ArithExpr.cs
+++ b/src/api/dotnet/ArithExpr.cs
@@ -32,11 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for ArithExpr
- internal protected ArithExpr(Context ctx)
- : base(ctx)
- {
- Contract.Requires(ctx != null);
- }
internal ArithExpr(Context ctx, IntPtr obj)
: base(ctx, obj)
{
diff --git a/src/api/dotnet/ArrayExpr.cs b/src/api/dotnet/ArrayExpr.cs
index 915bfd0f1..e14bb1083 100644
--- a/src/api/dotnet/ArrayExpr.cs
+++ b/src/api/dotnet/ArrayExpr.cs
@@ -32,11 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for ArrayExpr
- internal protected ArrayExpr(Context ctx)
- : base(ctx)
- {
- Contract.Requires(ctx != null);
- }
internal ArrayExpr(Context ctx, IntPtr obj)
: base(ctx, obj)
{
diff --git a/src/api/dotnet/BitVecExpr.cs b/src/api/dotnet/BitVecExpr.cs
index a146e7a19..b019f8845 100644
--- a/src/api/dotnet/BitVecExpr.cs
+++ b/src/api/dotnet/BitVecExpr.cs
@@ -41,7 +41,6 @@ namespace Microsoft.Z3
#region Internal
/// Constructor for BitVecExpr
- internal protected BitVecExpr(Context ctx) : base(ctx) { Contract.Requires(ctx != null); }
internal BitVecExpr(Context ctx, IntPtr obj) : base(ctx, obj) { Contract.Requires(ctx != null); }
#endregion
}
diff --git a/src/api/dotnet/BoolExpr.cs b/src/api/dotnet/BoolExpr.cs
index cbe3b1868..a9a15e4dc 100644
--- a/src/api/dotnet/BoolExpr.cs
+++ b/src/api/dotnet/BoolExpr.cs
@@ -32,8 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for BoolExpr
- internal protected BoolExpr(Context ctx) : base(ctx) { Contract.Requires(ctx != null); }
- /// Constructor for BoolExpr
internal BoolExpr(Context ctx, IntPtr obj) : base(ctx, obj) { Contract.Requires(ctx != null); }
#endregion
}
diff --git a/src/api/dotnet/Context.cs b/src/api/dotnet/Context.cs
index 1c03d76b6..65ec87bc6 100644
--- a/src/api/dotnet/Context.cs
+++ b/src/api/dotnet/Context.cs
@@ -3438,6 +3438,805 @@ namespace Microsoft.Z3
}
#endregion
+ #region Floating-Point Arithmetic
+
+ #region Rounding Modes
+ #region RoundingMode Sort
+ ///
+ /// Create the floating-point RoundingMode sort.
+ ///
+ public FPRMSort MkFPRoundingModeSort()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMSort(this);
+ }
+ #endregion
+
+ #region Numerals
+ ///
+ /// Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+ ///
+ public FPRMExpr MkFPRoundNearestTiesToEven()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMExpr(this, Native.Z3_mk_fpa_round_nearest_ties_to_even(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+ ///
+ public FPRMNum MkFPRNE()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_rne(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+ ///
+ public FPRMNum MkFPRoundNearestTiesToAway()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_round_nearest_ties_to_away(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+ ///
+ public FPRMNum MkFPRNA()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_rna(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode.
+ ///
+ public FPRMNum MkFPRoundTowardPositive()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_round_toward_positive(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode.
+ ///
+ public FPRMNum MkFPRTP()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_rtp(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode.
+ ///
+ public FPRMNum MkFPRoundTowardNegative()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_round_toward_negative(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode.
+ ///
+ public FPRMNum MkFPRTN()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_rtn(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode.
+ ///
+ public FPRMNum MkFPRoundTowardZero()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_round_toward_zero(nCtx));
+ }
+
+ ///
+ /// Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode.
+ ///
+ public FPRMNum MkFPRTZ()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPRMNum(this, Native.Z3_mk_fpa_rtz(nCtx));
+ }
+ #endregion
+ #endregion
+
+ #region FloatingPoint Sorts
+ ///
+ /// Create a FloatingPoint sort.
+ ///
+ /// exponent bits in the FloatingPoint sort.
+ /// significand bits in the FloatingPoint sort.
+ public FPSort MkFPSort(uint ebits, uint sbits)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, ebits, sbits);
+ }
+
+ ///
+ /// Create the half-precision (16-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSortHalf()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_half(nCtx));
+ }
+
+ ///
+ /// Create the half-precision (16-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSort16()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_16(nCtx));
+ }
+
+ ///
+ /// Create the single-precision (32-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSortSingle()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_single(nCtx));
+ }
+
+ ///
+ /// Create the single-precision (32-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSort32()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_32(nCtx));
+ }
+
+ ///
+ /// Create the double-precision (64-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSortDouble()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_double(nCtx));
+ }
+
+ ///
+ /// Create the double-precision (64-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSort64()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_64(nCtx));
+ }
+
+ ///
+ /// Create the quadruple-precision (128-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSortQuadruple()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_quadruple(nCtx));
+ }
+
+ ///
+ /// Create the quadruple-precision (128-bit) FloatingPoint sort.
+ ///
+ public FPSort MkFPSort128()
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPSort(this, Native.Z3_mk_fpa_sort_128(nCtx));
+ }
+ #endregion
+
+ #region Numerals
+ ///
+ /// Create a NaN of sort s.
+ ///
+ /// FloatingPoint sort.
+ public FPNum MkFPNaN(FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_nan(nCtx, s.NativeObject));
+ }
+
+ ///
+ /// Create a floating-point infinity of sort s.
+ ///
+ /// FloatingPoint sort.
+ /// indicates whether the result should be negative.
+ public FPNum MkFPInf(FPSort s, bool negative)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_inf(nCtx, s.NativeObject, negative ? 1 : 0));
+ }
+
+ ///
+ /// Create a floating-point zero of sort s.
+ ///
+ /// FloatingPoint sort.
+ /// indicates whether the result should be negative.
+ public FPNum MkFPZero(FPSort s, bool negative)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_zero(nCtx, s.NativeObject, negative ? 1 : 0));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a float.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFPNumeral(float v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_numeral_float(nCtx, v, s.NativeObject));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a float.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFPNumeral(double v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_numeral_double(nCtx, v, s.NativeObject));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from an int.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFPNumeral(int v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_numeral_int(nCtx, v, s.NativeObject));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a sign bit and two integers.
+ ///
+ /// the sign.
+ /// the significand.
+ /// the exponent.
+ /// FloatingPoint sort.
+ public FPNum MkFPNumeral(bool sgn, uint sig, int exp, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_numeral_int_uint(nCtx, sgn ? 1 : 0, exp, sig, s.NativeObject));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers.
+ ///
+ /// the sign.
+ /// the significand.
+ /// the exponent.
+ /// FloatingPoint sort.
+ public FPNum MkFPNumeral(bool sgn, Int64 exp, UInt64 sig, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPNum(this, Native.Z3_mk_fpa_numeral_int64_uint64(nCtx, sgn ? 1 : 0, exp, sig, s.NativeObject));
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a float.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFP(float v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return MkFPNumeral(v, s);
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a float.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFP(double v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return MkFPNumeral(v, s);
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from an int.
+ ///
+ /// numeral value.
+ /// FloatingPoint sort.
+ public FPNum MkFP(int v, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return MkFPNumeral(v, s);
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a sign bit and two integers.
+ ///
+ /// the sign.
+ /// the exponent.
+ /// the significand.
+ /// FloatingPoint sort.
+ public FPNum MkFP(bool sgn, int exp, uint sig, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return MkFPNumeral(sgn, exp, sig, s);
+ }
+
+ ///
+ /// Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers.
+ ///
+ /// the sign.
+ /// the exponent.
+ /// the significand.
+ /// FloatingPoint sort.
+ public FPNum MkFP(bool sgn, Int64 exp, UInt64 sig, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return MkFPNumeral(sgn, exp, sig, s);
+ }
+
+ #endregion
+
+ #region Operators
+ ///
+ /// Floating-point absolute value
+ ///
+ /// floating-point term
+ public FPExpr MkFPAbs(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_abs(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Floating-point negation
+ ///
+ /// floating-point term
+ public FPExpr MkFPNeg(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_neg(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Floating-point addition
+ ///
+ /// rounding mode term
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPAdd(FPRMExpr rm, FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_add(this.nCtx, rm.NativeObject, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point subtraction
+ ///
+ /// rounding mode term
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPSub(FPRMExpr rm, FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_sub(this.nCtx, rm.NativeObject, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point multiplication
+ ///
+ /// rounding mode term
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPMul(FPRMExpr rm, FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_mul(this.nCtx, rm.NativeObject, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point division
+ ///
+ /// rounding mode term
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPDiv(FPRMExpr rm, FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_div(this.nCtx, rm.NativeObject, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point fused multiply-add
+ ///
+ ///
+ /// The result is round((t1 * t2) + t3)
+ ///
+ /// rounding mode term
+ /// floating-point term
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPFMA(FPRMExpr rm, FPExpr t1, FPExpr t2, FPExpr t3)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_fma(this.nCtx, rm.NativeObject, t1.NativeObject, t2.NativeObject, t3.NativeObject));
+ }
+
+ ///
+ /// Floating-point square root
+ ///
+ /// rounding mode term
+ /// floating-point term
+ public FPExpr MkFPSqrt(FPRMExpr rm, FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_sqrt(this.nCtx, rm.NativeObject, t.NativeObject));
+ }
+
+ ///
+ /// Floating-point remainder
+ ///
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPRem(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_rem(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point roundToIntegral. Rounds a floating-point number to
+ /// the closest integer, again represented as a floating-point number.
+ ///
+ /// term of RoundingMode sort
+ /// floating-point term
+ public FPExpr MkFPRoundToIntegral(FPRMExpr rm, FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_round_to_integral(this.nCtx, rm.NativeObject, t.NativeObject));
+ }
+
+ ///
+ /// Minimum of floating-point numbers.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPMin(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_min(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Maximum of floating-point numbers.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public FPExpr MkFPMax(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_max(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point less than or equal.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public BoolExpr MkFPLEq(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_leq(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point less than.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public BoolExpr MkFPLt(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_lt(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point greater than or equal.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public BoolExpr MkFPGEq(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_geq(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point greater than.
+ ///
+ /// floating-point term
+ /// floating-point term
+ public BoolExpr MkFPGt(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_gt(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Floating-point equality.
+ ///
+ ///
+ /// Note that this is IEEE 754 equality (as opposed to standard =).
+ ///
+ /// floating-point term
+ /// floating-point term
+ public BoolExpr MkFPEq(FPExpr t1, FPExpr t2)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_eq(this.nCtx, t1.NativeObject, t2.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a normal floating-point number.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsNormal(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_normal(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a subnormal floating-point number.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsSubnormal(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_subnormal(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a floating-point number with zero value, i.e., +0 or -0.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsZero(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_zero(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a floating-point number representing +oo or -oo.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsInfinite(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_infinite(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a NaN.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsNaN(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_nan(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a negative floating-point number.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsNegative(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_negative(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Predicate indicating whether t is a positive floating-point number.
+ ///
+ /// floating-point term
+ public BoolExpr MkFPIsPositive(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BoolExpr(this, Native.Z3_mk_fpa_is_positive(this.nCtx, t.NativeObject));
+ }
+ #endregion
+
+ #region Conversions to FloatingPoint terms
+ ///
+ /// Create an expression of FloatingPoint sort from three bit-vector expressions.
+ ///
+ ///
+ /// This is the operator named `fp' in the SMT FP theory definition.
+ /// Note that sgn is required to be a bit-vector of size 1. Significand and exponent
+ /// are required to be greater than 1 and 2 respectively. The FloatingPoint sort
+ /// of the resulting expression is automatically determined from the bit-vector sizes
+ /// of the arguments.
+ ///
+ /// bit-vector term (of size 1) representing the sign.
+ /// bit-vector term representing the significand.
+ /// bit-vector term representing the exponent.
+ public FPExpr MkFP(BitVecExpr sgn, BitVecExpr sig, BitVecExpr exp)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_fp(this.nCtx, sgn.NativeObject, sig.NativeObject, exp.NativeObject));
+ }
+
+ ///
+ /// Conversion of a single IEEE 754-2008 bit-vector into a floating-point number.
+ ///
+ ///
+ /// Produces a term that represents the conversion of a bit-vector term bv to a
+ /// floating-point term of sort s. The bit-vector size of bv (m) must be equal
+ /// to ebits+sbits of s. The format of the bit-vector is as defined by the
+ /// IEEE 754-2008 interchange format.
+ ///
+ /// bit-vector value (of size m).
+ /// FloatingPoint sort (ebits+sbits == m)
+ public FPExpr MkFPToFP(BitVecExpr bv, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_bv(this.nCtx, bv.NativeObject, s.NativeObject));
+ }
+
+ ///
+ /// Conversion of a FloatingPoint term into another term of different FloatingPoint sort.
+ ///
+ ///
+ /// Produces a term that represents the conversion of a floating-point term t to a
+ /// floating-point term of sort s. If necessary, the result will be rounded according
+ /// to rounding mode rm.
+ ///
+ /// RoundingMode term.
+ /// FloatingPoint term.
+ /// FloatingPoint sort.
+ public FPExpr MkFPToFP(FPRMExpr rm, FPExpr t, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_float(this.nCtx, rm.NativeObject, t.NativeObject, s.NativeObject));
+ }
+
+ ///
+ /// Conversion of a term of real sort into a term of FloatingPoint sort.
+ ///
+ ///
+ /// Produces a term that represents the conversion of term t of real sort into a
+ /// floating-point term of sort s. If necessary, the result will be rounded according
+ /// to rounding mode rm.
+ ///
+ /// RoundingMode term.
+ /// term of Real sort.
+ /// FloatingPoint sort.
+ public FPExpr MkFPToFP(FPRMExpr rm, RealExpr t, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_real(this.nCtx, rm.NativeObject, t.NativeObject, s.NativeObject));
+ }
+
+ ///
+ /// Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort.
+ ///
+ ///
+ /// Produces a term that represents the conversion of the bit-vector term t into a
+ /// floating-point term of sort s. The bit-vector t is taken to be in signed
+ /// 2's complement format (when signed==true, otherwise unsigned). If necessary, the
+ /// result will be rounded according to rounding mode rm.
+ ///
+ /// RoundingMode term.
+ /// term of bit-vector sort.
+ /// FloatingPoint sort.
+ /// flag indicating whether t is interpreted as signed or unsigned bit-vector.
+ public FPExpr MkFPToFP(FPRMExpr rm, BitVecExpr t, FPSort s, bool signed)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ if (signed)
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_signed(this.nCtx, rm.NativeObject, t.NativeObject, s.NativeObject));
+ else
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_unsigned(this.nCtx, rm.NativeObject, t.NativeObject, s.NativeObject));
+ }
+
+ ///
+ /// Conversion of a floating-point number to another FloatingPoint sort s.
+ ///
+ ///
+ /// Produces a term that represents the conversion of a floating-point term t to a different
+ /// FloatingPoint sort s. If necessary, rounding according to rm is applied.
+ ///
+ /// FloatingPoint sort
+ /// floating-point rounding mode term
+ /// floating-point term
+ public FPExpr MkFPToFP(FPSort s, FPRMExpr rm, FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new FPExpr(this, Native.Z3_mk_fpa_to_fp_float(this.nCtx, s.NativeObject, rm.NativeObject, t.NativeObject));
+ }
+ #endregion
+
+ #region Conversions from FloatingPoint terms
+ ///
+ /// Conversion of a floating-point term into a bit-vector.
+ ///
+ ///
+ /// Produces a term that represents the conversion of the floating-poiunt term t into a
+ /// bit-vector term of size sz in 2's complement format (signed when signed==true). If necessary,
+ /// the result will be rounded according to rounding mode rm.
+ ///
+ /// RoundingMode term.
+ /// FloatingPoint term
+ /// Size of the resulting bit-vector.
+ /// Indicates whether the result is a signed or unsigned bit-vector.
+ public BitVecExpr MkFPToBV(FPRMExpr rm, FPExpr t, uint sz, bool signed)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ if (signed)
+ return new BitVecExpr(this, Native.Z3_mk_fpa_to_sbv(this.nCtx, rm.NativeObject, t.NativeObject, sz));
+ else
+ return new BitVecExpr(this, Native.Z3_mk_fpa_to_ubv(this.nCtx, rm.NativeObject, t.NativeObject, sz));
+ }
+
+ ///
+ /// Conversion of a floating-point term into a real-numbered term.
+ ///
+ ///
+ /// Produces a term that represents the conversion of the floating-poiunt term t into a
+ /// real number. Note that this type of conversion will often result in non-linear
+ /// constraints over real terms.
+ ///
+ /// FloatingPoint term
+ public RealExpr MkFPToReal(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new RealExpr(this, Native.Z3_mk_fpa_to_real(this.nCtx, t.NativeObject));
+ }
+ #endregion
+
+ #region Z3-specific extensions
+ ///
+ /// Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format.
+ ///
+ ///
+ /// The size of the resulting bit-vector is automatically determined. Note that
+ /// IEEE 754-2008 allows multiple different representations of NaN. This conversion
+ /// knows only one NaN and it will always produce the same bit-vector represenatation of
+ /// that NaN.
+ ///
+ /// FloatingPoint term.
+ public BitVecExpr MkFPToIEEEBV(FPExpr t)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BitVecExpr(this, Native.Z3_mk_fpa_to_ieee_bv(this.nCtx, t.NativeObject));
+ }
+
+ ///
+ /// Conversion of a real-sorted significand and an integer-sorted exponent into a term of FloatingPoint sort.
+ ///
+ ///
+ /// Produces a term that represents the conversion of sig * 2^exp into a
+ /// floating-point term of sort s. If necessary, the result will be rounded
+ /// according to rounding mode rm.
+ ///
+ /// RoundingMode term.
+ /// Exponent term of Int sort.
+ /// Significand term of Real sort.
+ /// FloatingPoint sort.
+ public BitVecExpr MkFPToFP(FPRMExpr rm, IntExpr exp, RealExpr sig, FPSort s)
+ {
+ Contract.Ensures(Contract.Result() != null);
+ return new BitVecExpr(this, Native.Z3_mk_fpa_to_fp_int_real(this.nCtx, rm.NativeObject, exp.NativeObject, sig.NativeObject, s.NativeObject));
+ }
+ #endregion
+ #endregion // Floating-point Arithmetic
#region Miscellaneous
///
diff --git a/src/api/dotnet/DatatypeExpr.cs b/src/api/dotnet/DatatypeExpr.cs
index 93cea54f5..ba3a9d478 100644
--- a/src/api/dotnet/DatatypeExpr.cs
+++ b/src/api/dotnet/DatatypeExpr.cs
@@ -32,11 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for DatatypeExpr
- internal protected DatatypeExpr(Context ctx)
- : base(ctx)
- {
- Contract.Requires(ctx != null);
- }
internal DatatypeExpr(Context ctx, IntPtr obj)
: base(ctx, obj)
{
diff --git a/src/api/dotnet/EnumSort.cs b/src/api/dotnet/EnumSort.cs
index e62043078..f7ba98222 100644
--- a/src/api/dotnet/EnumSort.cs
+++ b/src/api/dotnet/EnumSort.cs
@@ -78,7 +78,7 @@ namespace Microsoft.Z3
#region Internal
internal EnumSort(Context ctx, Symbol name, Symbol[] enumNames)
- : base(ctx)
+ : base(ctx, IntPtr.Zero)
{
Contract.Requires(ctx != null);
Contract.Requires(name != null);
diff --git a/src/api/dotnet/Expr.cs b/src/api/dotnet/Expr.cs
index f4a63a61b..a20a25935 100644
--- a/src/api/dotnet/Expr.cs
+++ b/src/api/dotnet/Expr.cs
@@ -1311,7 +1311,7 @@ namespace Microsoft.Z3
#region Relational Terms
///
- /// Indicates whether the term is of an array sort.
+ /// Indicates whether the term is of relation sort.
///
public bool IsRelation
{
@@ -1448,6 +1448,281 @@ namespace Microsoft.Z3
/// Indicates whether the term is a less than predicate over a finite domain.
///
public bool IsFiniteDomainLT { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FD_LT; } }
+ #endregion
+
+ #region Floating-point terms
+ ///
+ /// Indicates whether the terms is of floating-point sort.
+ ///
+ public bool IsFP
+ {
+ get { return Native.Z3_get_sort_kind(Context.nCtx, Native.Z3_get_sort(Context.nCtx, NativeObject)) == (uint)Z3_sort_kind.Z3_FLOATING_POINT_SORT; }
+ }
+
+ ///
+ /// Indicates whether the terms is of floating-point rounding mode sort.
+ ///
+ public bool IsFPRM
+ {
+ get { return Native.Z3_get_sort_kind(Context.nCtx, Native.Z3_get_sort(Context.nCtx, NativeObject)) == (uint)Z3_sort_kind.Z3_ROUNDING_MODE_SORT; }
+ }
+
+ ///
+ /// Indicates whether the term is a floating-point numeral
+ ///
+ public bool IsFPNumeral { get { return IsFP && IsNumeral; } }
+
+ ///
+ /// Indicates whether the term is a floating-point rounding mode numeral
+ ///
+ public bool IsFPRMNumeral { get { return IsFPRM && IsNumeral; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ ///
+ public bool IsFPRMRoundNearestTiesToEven{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ ///
+ public bool IsFPRMRoundNearestTiesToAway{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ ///
+ public bool IsFPRMRoundTowardNegative{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ ///
+ public bool IsFPRMRoundTowardPositive{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ ///
+ public bool IsFPRMRoundTowardZero{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ ///
+ public bool IsFPRMExprRNE{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ ///
+ public bool IsFPRMExprRNA { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ ///
+ public bool IsFPRMExprRTN { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ ///
+ public bool IsFPRMExprRTP { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ ///
+ public bool IsFPRMExprRTZ { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; } }
+
+ ///
+ /// Indicates whether the term is a floating-point rounding mode numeral
+ ///
+ public bool IsFPRMExpr {
+ get {
+ return IsApp &&
+ (FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY||
+ FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN ||
+ FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE ||
+ FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE ||
+ FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO);
+ }
+ }
+
+ ///
+ /// Indicates whether the term is a floating-point +oo
+ ///
+ public bool IsFPPlusInfinity{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_PLUS_INF; } }
+
+ ///
+ /// Indicates whether the term is a floating-point -oo
+ ///
+ public bool IsFPMinusInfinity{ get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_MINUS_INF; } }
+
+ ///
+ /// Indicates whether the term is a floating-point NaN
+ ///
+ public bool IsFPNaN { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_NAN; } }
+
+ ///
+ /// Indicates whether the term is a floating-point +zero
+ ///
+ public bool IsFPPlusZero { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_PLUS_ZERO; } }
+
+ ///
+ /// Indicates whether the term is a floating-point -zero
+ ///
+ public bool IsFPMinusZero { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_MINUS_ZERO; } }
+
+ ///
+ /// Indicates whether the term is a floating-point addition term
+ ///
+ public bool IsFPAdd { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_ADD; } }
+
+
+ ///
+ /// Indicates whether the term is a floating-point subtraction term
+ ///
+ public bool IsFPSub { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_SUB; } }
+
+ ///
+ /// Indicates whether the term is a floating-point negation term
+ ///
+ public bool IsFPNeg { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_NEG; } }
+
+ ///
+ /// Indicates whether the term is a floating-point multiplication term
+ ///
+ public bool IsFPMul { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_MUL; } }
+
+ ///
+ /// Indicates whether the term is a floating-point divison term
+ ///
+ public bool IsFPDiv { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_DIV; } }
+
+ ///
+ /// Indicates whether the term is a floating-point remainder term
+ ///
+ public bool IsFPRem { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_REM; } }
+
+ ///
+ /// Indicates whether the term is a floating-point term absolute value term
+ ///
+ public bool IsFPAbs { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_ABS; } }
+
+ ///
+ /// Indicates whether the term is a floating-point minimum term
+ ///
+ public bool IsFPMin { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_MIN; } }
+
+ ///
+ /// Indicates whether the term is a floating-point maximum term
+ ///
+ public bool IsFPMax { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_MAX; } }
+
+ ///
+ /// Indicates whether the term is a floating-point fused multiply-add term
+ ///
+ public bool IsFPFMA { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_FMA; } }
+
+ ///
+ /// Indicates whether the term is a floating-point square root term
+ ///
+ public bool IsFPSqrt { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_SQRT; } }
+
+ ///
+ /// Indicates whether the term is a floating-point roundToIntegral term
+ ///
+ public bool IsFPRoundToIntegral { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_ROUND_TO_INTEGRAL; } }
+
+ ///
+ /// Indicates whether the term is a floating-point equality term
+ ///
+ public bool IsFPEq { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_EQ; } }
+
+ ///
+ /// Indicates whether the term is a floating-point less-than term
+ ///
+ public bool IsFPLt { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_LT; } }
+
+ ///
+ /// Indicates whether the term is a floating-point greater-than term
+ ///
+ public bool IsFPGt { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_GT; } }
+
+ ///
+ /// Indicates whether the term is a floating-point less-than or equal term
+ ///
+ public bool IsFPLe { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_LE; } }
+
+ ///
+ /// Indicates whether the term is a floating-point greater-than or erqual term
+ ///
+ public bool IsFPGe { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_GE; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isNaN predicate term
+ ///
+ public bool IsFPisNaN { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_NAN; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isInf predicate term
+ ///
+ public bool IsFPisInf { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_INF; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isZero predicate term
+ ///
+ public bool IsFPisZero { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_ZERO; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isNormal term
+ ///
+ public bool IsFPisNormal { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_NORMAL; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isSubnormal predicate term
+ ///
+ public bool IsFPisSubnormal { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_SUBNORMAL; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isNegative predicate term
+ ///
+ public bool IsFPisNegative { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_NEGATIVE; } }
+
+ ///
+ /// Indicates whether the term is a floating-point isPositive predicate term
+ ///
+ public bool IsFPisPositive { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_IS_POSITIVE; } }
+
+ ///
+ /// Indicates whether the term is a floating-point constructor term
+ ///
+ public bool IsFPFP { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_FP; } }
+
+ ///
+ /// Indicates whether the term is a floating-point conversion term
+ ///
+ public bool IsFPToFp { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_FP; } }
+
+ ///
+ /// Indicates whether the term is a floating-point conversion from unsigned bit-vector term
+ ///
+ public bool IsFPToFpUnsigned { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_FP_UNSIGNED; } }
+
+ ///
+ /// Indicates whether the term is a floating-point conversion to unsigned bit-vector term
+ ///
+ public bool IsFPToUBV { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_UBV; } }
+
+ ///
+ /// Indicates whether the term is a floating-point conversion to signed bit-vector term
+ ///
+ public bool IsFPToSBV { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_SBV; } }
+
+ ///
+ /// Indicates whether the term is a floating-point conversion to real term
+ ///
+ public bool IsFPToReal { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_REAL; } }
+
+
+ ///
+ /// Indicates whether the term is a floating-point conversion to IEEE-754 bit-vector term
+ ///
+ public bool IsFPToIEEEBV { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_TO_IEEE_BV; } }
+
#endregion
#endregion
@@ -1489,10 +1764,6 @@ namespace Microsoft.Z3
///
/// Constructor for Expr
///
- internal protected Expr(Context ctx) : base(ctx) { Contract.Requires(ctx != null); }
- ///
- /// Constructor for Expr
- ///
internal protected Expr(Context ctx, IntPtr obj) : base(ctx, obj) { Contract.Requires(ctx != null); }
#if DEBUG
@@ -1541,7 +1812,9 @@ namespace Microsoft.Z3
{
case Z3_sort_kind.Z3_INT_SORT: return new IntNum(ctx, obj);
case Z3_sort_kind.Z3_REAL_SORT: return new RatNum(ctx, obj);
- case Z3_sort_kind.Z3_BV_SORT: return new BitVecNum(ctx, obj);
+ case Z3_sort_kind.Z3_BV_SORT: return new BitVecNum(ctx, obj);
+ case Z3_sort_kind.Z3_FLOATING_POINT_SORT: return new FPNum(ctx, obj);
+ case Z3_sort_kind.Z3_ROUNDING_MODE_SORT: return new FPRMNum(ctx, obj);
}
}
@@ -1552,7 +1825,9 @@ namespace Microsoft.Z3
case Z3_sort_kind.Z3_REAL_SORT: return new RealExpr(ctx, obj);
case Z3_sort_kind.Z3_BV_SORT: return new BitVecExpr(ctx, obj);
case Z3_sort_kind.Z3_ARRAY_SORT: return new ArrayExpr(ctx, obj);
- case Z3_sort_kind.Z3_DATATYPE_SORT: return new DatatypeExpr(ctx, obj);
+ case Z3_sort_kind.Z3_DATATYPE_SORT: return new DatatypeExpr(ctx, obj);
+ case Z3_sort_kind.Z3_FLOATING_POINT_SORT: return new FPExpr(ctx, obj);
+ case Z3_sort_kind.Z3_ROUNDING_MODE_SORT: return new FPRMExpr(ctx, obj);
}
return new Expr(ctx, obj);
diff --git a/src/api/dotnet/FPExpr.cs b/src/api/dotnet/FPExpr.cs
new file mode 100644
index 000000000..85fdf2603
--- /dev/null
+++ b/src/api/dotnet/FPExpr.cs
@@ -0,0 +1,52 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPExpr.cs
+
+Abstract:
+
+ Z3 Managed API: Floating Point Expressions
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// FloatingPoint Expressions
+ ///
+ public class FPExpr : Expr
+ {
+ ///
+ /// The number of exponent bits.
+ ///
+ public uint EBits { get { return ((FPSort)Sort).EBits; } }
+
+ ///
+ /// The number of significand bits.
+ ///
+ public uint SBits { get { return ((FPSort)Sort).EBits; } }
+
+ #region Internal
+ /// Constructor for FPExpr
+ internal FPExpr(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+ }
+}
diff --git a/src/api/dotnet/FPNum.cs b/src/api/dotnet/FPNum.cs
new file mode 100644
index 000000000..e85687ccf
--- /dev/null
+++ b/src/api/dotnet/FPNum.cs
@@ -0,0 +1,103 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPNum.cs
+
+Abstract:
+
+ Z3 Managed API: Floating Point Numerals
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+using System;
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// FloatiungPoint Numerals
+ ///
+ [ContractVerification(true)]
+ public class FPNum : FPExpr
+ {
+ ///
+ /// Retrieves the sign of a floating-point literal
+ ///
+ ///
+ /// Remarks: returns true if the numeral is negative
+ ///
+ public bool Sign
+ {
+ get
+ {
+ int res = 0;
+ if (Native.Z3_fpa_get_numeral_sign(Context.nCtx, NativeObject, ref res) == 0)
+ throw new Z3Exception("Sign is not a Boolean value");
+ return res != 0;
+ }
+ }
+
+ ///
+ /// The significand value of a floating-point numeral as a string
+ ///
+ ///
+ /// The significand s is always 0 < s < 2.0; the resulting string is long
+ /// enough to represent the real significand precisely.
+ ///
+ public string Significand
+ {
+ get
+ {
+ return Native.Z3_fpa_get_numeral_significand_string(Context.nCtx, NativeObject);
+ }
+ }
+
+ ///
+ /// Return the exponent value of a floating-point numeral as a string
+ ///
+ public string Exponent
+ {
+ get
+ {
+ return Native.Z3_fpa_get_numeral_exponent_string(Context.nCtx, NativeObject);
+ }
+ }
+
+ ///
+ /// Return the exponent value of a floating-point numeral as a signed 64-bit integer
+ ///
+ public Int64 ExponentInt64
+ {
+ get
+ {
+ Int64 result = 0;
+ if (Native.Z3_fpa_get_numeral_exponent_int64(Context.nCtx, NativeObject, ref result) == 0)
+ throw new Z3Exception("Exponent is not a 64 bit integer");
+ return result;
+ }
+ }
+
+ #region Internal
+ internal FPNum(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+
+ ///
+ /// Returns a string representation of the numeral.
+ ///
+ public override string ToString()
+ {
+ return Native.Z3_get_numeral_string(Context.nCtx, NativeObject);
+ }
+ }
+}
diff --git a/src/api/dotnet/FPRMExpr.cs b/src/api/dotnet/FPRMExpr.cs
new file mode 100644
index 000000000..896c3e6b9
--- /dev/null
+++ b/src/api/dotnet/FPRMExpr.cs
@@ -0,0 +1,42 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMExpr.cs
+
+Abstract:
+
+ Z3 Managed API: Floating Point Expressions over Rounding Modes
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// FloatingPoint RoundingMode Expressions
+ ///
+ public class FPRMExpr : Expr
+ {
+ #region Internal
+ /// Constructor for FPRMExpr
+ internal FPRMExpr(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+ }
+}
diff --git a/src/api/dotnet/FPRMNum.cs b/src/api/dotnet/FPRMNum.cs
new file mode 100644
index 000000000..81cff167e
--- /dev/null
+++ b/src/api/dotnet/FPRMNum.cs
@@ -0,0 +1,100 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMExpr.cs
+
+Abstract:
+
+ Z3 Managed API: Floating Point Rounding Mode Numerals
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// Floating-point rounding mode numerals
+ ///
+ public class FPRMNum : FPRMExpr
+ {
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ ///
+ public bool isRoundNearestTiesToEven { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ ///
+ public bool isRNE { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ ///
+ public bool isRoundNearestTiesToAway { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ ///
+ public bool isRNA { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ ///
+ public bool isRoundTowardPositive { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ ///
+ public bool isRTP { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ ///
+ public bool isRoundTowardNegative { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ ///
+ public bool isRTN { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ ///
+ public bool isRoundTowardZero { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; } }
+
+ ///
+ /// Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ ///
+ public bool isRTZ { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; } }
+
+ ///
+ /// Returns a string representation of the numeral.
+ ///
+ public override string ToString()
+ {
+ return Native.Z3_get_numeral_string(Context.nCtx, NativeObject);
+ }
+
+ #region Internal
+ /// Constructor for FPRMNum
+ internal FPRMNum(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+ }
+}
diff --git a/src/api/dotnet/FPRMSort.cs b/src/api/dotnet/FPRMSort.cs
new file mode 100644
index 000000000..1d8334eb5
--- /dev/null
+++ b/src/api/dotnet/FPRMSort.cs
@@ -0,0 +1,43 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMSort.cs
+
+Abstract:
+
+ Z3 Managed API: Rounding Mode Sort
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+
+using System;
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// The FloatingPoint RoundingMode sort
+ ///
+ public class FPRMSort : Sort
+ {
+ #region Internal
+ internal FPRMSort(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ internal FPRMSort(Context ctx)
+ : base(ctx, Native.Z3_mk_fpa_rounding_mode_sort(ctx.nCtx))
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+ }
+}
\ No newline at end of file
diff --git a/src/api/dotnet/FPSort.cs b/src/api/dotnet/FPSort.cs
new file mode 100644
index 000000000..e1ad62d49
--- /dev/null
+++ b/src/api/dotnet/FPSort.cs
@@ -0,0 +1,52 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPSort.cs
+
+Abstract:
+
+ Z3 Managed API: Floating Point Sorts
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+using System;
+using System.Diagnostics.Contracts;
+
+namespace Microsoft.Z3
+{
+ ///
+ /// FloatingPoint sort
+ ///
+ public class FPSort : Sort
+ {
+ ///
+ /// The number of exponent bits.
+ ///
+ public uint EBits { get { return Native.Z3_fpa_get_ebits(Context.nCtx, NativeObject); } }
+
+ ///
+ /// The number of significand bits.
+ ///
+ public uint SBits { get { return Native.Z3_fpa_get_sbits(Context.nCtx, NativeObject); } }
+
+ #region Internal
+ internal FPSort(Context ctx, IntPtr obj)
+ : base(ctx, obj)
+ {
+ Contract.Requires(ctx != null);
+ }
+ internal FPSort(Context ctx, uint ebits, uint sbits)
+ : base(ctx, Native.Z3_mk_fpa_sort(ctx.nCtx, ebits, sbits))
+ {
+ Contract.Requires(ctx != null);
+ }
+ #endregion
+ }
+}
diff --git a/src/api/dotnet/IntExpr.cs b/src/api/dotnet/IntExpr.cs
index 4c52ec79f..622be7bd5 100644
--- a/src/api/dotnet/IntExpr.cs
+++ b/src/api/dotnet/IntExpr.cs
@@ -1,5 +1,5 @@
/*++
-Copyright () 2012 Microsoft Corporation
+Copyright (c) 2012 Microsoft Corporation
Module Name:
@@ -32,11 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for IntExpr
- internal protected IntExpr(Context ctx)
- : base(ctx)
- {
- Contract.Requires(ctx != null);
- }
internal IntExpr(Context ctx, IntPtr obj)
: base(ctx, obj)
{
diff --git a/src/api/dotnet/ListSort.cs b/src/api/dotnet/ListSort.cs
index 7dbafb385..e860e4d4b 100644
--- a/src/api/dotnet/ListSort.cs
+++ b/src/api/dotnet/ListSort.cs
@@ -113,9 +113,9 @@ namespace Microsoft.Z3
}
}
- #region Internal
+ #region Internal
internal ListSort(Context ctx, Symbol name, Sort elemSort)
- : base(ctx)
+ : base(ctx, IntPtr.Zero)
{
Contract.Requires(ctx != null);
Contract.Requires(name != null);
diff --git a/src/api/dotnet/Microsoft.Z3.csproj b/src/api/dotnet/Microsoft.Z3.csproj
index 36bd6ad02..2b5e08173 100644
--- a/src/api/dotnet/Microsoft.Z3.csproj
+++ b/src/api/dotnet/Microsoft.Z3.csproj
@@ -342,6 +342,12 @@
+
+
+
+
+
+
diff --git a/src/api/dotnet/Params.cs b/src/api/dotnet/Params.cs
index c33728491..9a814b2ec 100644
--- a/src/api/dotnet/Params.cs
+++ b/src/api/dotnet/Params.cs
@@ -23,7 +23,7 @@ using System.Diagnostics.Contracts;
namespace Microsoft.Z3
{
///
- /// A ParameterSet represents a configuration in the form of Symbol/value pairs.
+ /// A Params objects represents a configuration in the form of Symbol/value pairs.
///
[ContractVerification(true)]
public class Params : Z3Object
diff --git a/src/api/dotnet/Quantifier.cs b/src/api/dotnet/Quantifier.cs
index f59d0bda2..38e435309 100644
--- a/src/api/dotnet/Quantifier.cs
+++ b/src/api/dotnet/Quantifier.cs
@@ -160,7 +160,7 @@ namespace Microsoft.Z3
#region Internal
[ContractVerification(false)] // F: Clousot ForAll decompilation gets confused below. Setting verification off until I fixed the bug
internal Quantifier(Context ctx, bool isForall, Sort[] sorts, Symbol[] names, Expr body, uint weight = 1, Pattern[] patterns = null, Expr[] noPatterns = null, Symbol quantifierID = null, Symbol skolemID = null)
- : base(ctx)
+ : base(ctx, IntPtr.Zero)
{
Contract.Requires(ctx != null);
Contract.Requires(sorts != null);
@@ -203,7 +203,7 @@ namespace Microsoft.Z3
[ContractVerification(false)] // F: Clousot ForAll decompilation gets confused below. Setting verification off until I fixed the bug
internal Quantifier(Context ctx, bool isForall, Expr[] bound, Expr body, uint weight = 1, Pattern[] patterns = null, Expr[] noPatterns = null, Symbol quantifierID = null, Symbol skolemID = null)
- : base(ctx)
+ : base(ctx, IntPtr.Zero)
{
Contract.Requires(ctx != null);
Contract.Requires(body != null);
diff --git a/src/api/dotnet/RealExpr.cs b/src/api/dotnet/RealExpr.cs
index 26adc1fc6..8ee8c8e76 100644
--- a/src/api/dotnet/RealExpr.cs
+++ b/src/api/dotnet/RealExpr.cs
@@ -32,11 +32,6 @@ namespace Microsoft.Z3
{
#region Internal
/// Constructor for RealExpr
- internal protected RealExpr(Context ctx)
- : base(ctx)
- {
- Contract.Requires(ctx != null);
- }
internal RealExpr(Context ctx, IntPtr obj)
: base(ctx, obj)
{
diff --git a/src/api/dotnet/Sort.cs b/src/api/dotnet/Sort.cs
index 9dc23ea09..412398ddd 100644
--- a/src/api/dotnet/Sort.cs
+++ b/src/api/dotnet/Sort.cs
@@ -116,8 +116,7 @@ namespace Microsoft.Z3
#region Internal
///
/// Sort constructor
- ///
- internal protected Sort(Context ctx) : base(ctx) { Contract.Requires(ctx != null); }
+ ///
internal Sort(Context ctx, IntPtr obj) : base(ctx, obj) { Contract.Requires(ctx != null); }
#if DEBUG
@@ -146,6 +145,8 @@ namespace Microsoft.Z3
case Z3_sort_kind.Z3_UNINTERPRETED_SORT: return new UninterpretedSort(ctx, obj);
case Z3_sort_kind.Z3_FINITE_DOMAIN_SORT: return new FiniteDomainSort(ctx, obj);
case Z3_sort_kind.Z3_RELATION_SORT: return new RelationSort(ctx, obj);
+ case Z3_sort_kind.Z3_FLOATING_POINT_SORT: return new FPSort(ctx, obj);
+ case Z3_sort_kind.Z3_ROUNDING_MODE_SORT: return new FPRMSort(ctx, obj);
default:
throw new Z3Exception("Unknown sort kind");
}
diff --git a/src/api/dotnet/TupleSort.cs b/src/api/dotnet/TupleSort.cs
index 81a0eaf60..ea99f3855 100644
--- a/src/api/dotnet/TupleSort.cs
+++ b/src/api/dotnet/TupleSort.cs
@@ -68,7 +68,7 @@ namespace Microsoft.Z3
#region Internal
internal TupleSort(Context ctx, Symbol name, uint numFields, Symbol[] fieldNames, Sort[] fieldSorts)
- : base(ctx)
+ : base(ctx, IntPtr.Zero)
{
Contract.Requires(ctx != null);
Contract.Requires(name != null);
diff --git a/src/api/java/AST.java b/src/api/java/AST.java
index a201d5697..0cdfd025c 100644
--- a/src/api/java/AST.java
+++ b/src/api/java/AST.java
@@ -28,7 +28,8 @@ public class AST extends Z3Object
/**
* Object comparison.
- * another AST
+ *
+ * @param o another AST
**/
public boolean equals(Object o)
{
@@ -46,10 +47,12 @@ public class AST extends Z3Object
}
/**
- * Object Comparison. Another AST
+ * Object Comparison.
+ * @param other Another AST
*
- * @return Negative if the object should be sorted before , positive if after else zero.
+ * @return Negative if the object should be sorted before {@code other},
+ * positive if after else zero.
+ * @throws Z3Exception on error
**/
public int compareTo(Object other) throws Z3Exception
{
@@ -90,6 +93,7 @@ public class AST extends Z3Object
/**
* A unique identifier for the AST (unique among all ASTs).
+ * @throws Z3Exception on error
**/
public int getId() throws Z3Exception
{
@@ -97,10 +101,11 @@ public class AST extends Z3Object
}
/**
- * Translates (copies) the AST to the Context . A context
+ * Translates (copies) the AST to the Context {@code ctx}.
+ * @param ctx A context
*
- * @return A copy of the AST which is associated with
+ * @return A copy of the AST which is associated with {@code ctx}
+ * @throws Z3Exception on error
**/
public AST translate(Context ctx) throws Z3Exception
{
@@ -114,6 +119,7 @@ public class AST extends Z3Object
/**
* The kind of the AST.
+ * @throws Z3Exception on error
**/
public Z3_ast_kind getASTKind() throws Z3Exception
{
@@ -123,6 +129,8 @@ public class AST extends Z3Object
/**
* Indicates whether the AST is an Expr
+ * @throws Z3Exception on error
+ * @throws Z3Exception on error
**/
public boolean isExpr() throws Z3Exception
{
@@ -140,6 +148,8 @@ public class AST extends Z3Object
/**
* Indicates whether the AST is an application
+ * @return a boolean
+ * @throws Z3Exception on error
**/
public boolean isApp() throws Z3Exception
{
@@ -147,7 +157,9 @@ public class AST extends Z3Object
}
/**
- * Indicates whether the AST is a BoundVariable
+ * Indicates whether the AST is a BoundVariable.
+ * @return a boolean
+ * @throws Z3Exception on error
**/
public boolean isVar() throws Z3Exception
{
@@ -156,6 +168,8 @@ public class AST extends Z3Object
/**
* Indicates whether the AST is a Quantifier
+ * @return a boolean
+ * @throws Z3Exception on error
**/
public boolean isQuantifier() throws Z3Exception
{
@@ -213,10 +227,8 @@ public class AST extends Z3Object
void incRef(long o) throws Z3Exception
{
// Console.WriteLine("AST IncRef()");
- if (getContext() == null)
- throw new Z3Exception("inc() called on null context");
- if (o == 0)
- throw new Z3Exception("inc() called on null AST");
+ if (getContext() == null || o == 0)
+ return;
getContext().ast_DRQ().incAndClear(getContext(), o);
super.incRef(o);
}
@@ -224,10 +236,8 @@ public class AST extends Z3Object
void decRef(long o) throws Z3Exception
{
// Console.WriteLine("AST DecRef()");
- if (getContext() == null)
- throw new Z3Exception("dec() called on null context");
- if (o == 0)
- throw new Z3Exception("dec() called on null AST");
+ if (getContext() == null || o == 0)
+ return;
getContext().ast_DRQ().add(o);
super.decRef(o);
}
diff --git a/src/api/java/ASTMap.java b/src/api/java/ASTMap.java
index 6a4e6d56f..3d63939ca 100644
--- a/src/api/java/ASTMap.java
+++ b/src/api/java/ASTMap.java
@@ -23,10 +23,10 @@ package com.microsoft.z3;
class ASTMap extends Z3Object
{
/**
- * Checks whether the map contains the key . An AST
+ * Checks whether the map contains the key {@code k}.
+ * @param k An AST
*
- * @return True if is a key in the map, false
+ * @return True if {@code k} is a key in the map, false
* otherwise.
**/
public boolean contains(AST k) throws Z3Exception
@@ -37,9 +37,10 @@ class ASTMap extends Z3Object
}
/**
- * Finds the value associated with the key .
- * This function signs an error when is not a key in
- * the map. An AST
+ * Finds the value associated with the key {@code k}.
+ * Remarks: This function signs an error when {@code k} is not a key in
+ * the map.
+ * @param k An AST
*
* @throws Z3Exception
**/
@@ -50,8 +51,9 @@ class ASTMap extends Z3Object
}
/**
- * Stores or replaces a new key/value pair in the map. The
- * key AST The value AST
+ * Stores or replaces a new key/value pair in the map.
+ * @param k The key AST
+ * @param v The value AST
**/
public void insert(AST k, AST v) throws Z3Exception
{
@@ -61,12 +63,11 @@ class ASTMap extends Z3Object
}
/**
- * Erases the key from the map. An
- * AST
+ * Erases the key {@code k} from the map.
+ * @param k An AST
**/
public void erase(AST k) throws Z3Exception
{
-
Native.astMapErase(getContext().nCtx(), getNativeObject(), k.getNativeObject());
}
diff --git a/src/api/java/ASTVector.java b/src/api/java/ASTVector.java
index 07b7dbf56..d4df02244 100644
--- a/src/api/java/ASTVector.java
+++ b/src/api/java/ASTVector.java
@@ -31,9 +31,10 @@ class ASTVector extends Z3Object
}
/**
- * Retrieves the i-th object in the vector. May throw an
- * IndexOutOfBoundsException when is out of
- * range. Index
+ * Retrieves the i-th object in the vector.
+ * Remarks: May throw an {@code IndexOutOfBoundsException} when
+ * {@code i} is out of range.
+ * @param i Index
*
* @return An AST
* @throws Z3Exception
@@ -52,8 +53,8 @@ class ASTVector extends Z3Object
}
/**
- * Resize the vector to . The new size of the vector.
+ * Resize the vector to {@code newSize}.
+ * @param newSize The new size of the vector.
**/
public void resize(int newSize) throws Z3Exception
{
@@ -61,8 +62,9 @@ class ASTVector extends Z3Object
}
/**
- * Add the AST to the back of the vector. The size is
- * increased by 1. An AST
+ * Add the AST {@code a} to the back of the vector. The size is
+ * increased by 1.
+ * @param a An AST
**/
public void push(AST a) throws Z3Exception
{
@@ -70,8 +72,8 @@ class ASTVector extends Z3Object
}
/**
- * Translates all ASTs in the vector to . A context
+ * Translates all ASTs in the vector to {@code ctx}.
+ * @param ctx A context
*
* @return A new ASTVector
* @throws Z3Exception
diff --git a/src/api/java/AlgebraicNum.java b/src/api/java/AlgebraicNum.java
index 340f37f80..322b24d39 100644
--- a/src/api/java/AlgebraicNum.java
+++ b/src/api/java/AlgebraicNum.java
@@ -24,11 +24,13 @@ public class AlgebraicNum extends ArithExpr
{
/**
* Return a upper bound for a given real algebraic number. The interval
- * isolating the number is smaller than 1/10^.
- * the
- * precision of the result
+ * isolating the number is smaller than 1/10^{@code precision}.
+ *
+ * @see Expr#isAlgebraicNumber
+ * @param precision the precision of the result
*
* @return A numeral Expr of sort Real
+ * @throws Z3Exception on error
**/
public RatNum toUpper(int precision) throws Z3Exception
{
@@ -39,10 +41,13 @@ public class AlgebraicNum extends ArithExpr
/**
* Return a lower bound for the given real algebraic number. The interval
- * isolating the number is smaller than 1/10^.
- *
+ * isolating the number is smaller than 1/10^{@code precision}.
+ *
+ * @see Expr#isAlgebraicNumber
+ * @param precision precision
*
* @return A numeral Expr of sort Real
+ * @throws Z3Exception on error
**/
public RatNum toLower(int precision) throws Z3Exception
{
@@ -52,8 +57,11 @@ public class AlgebraicNum extends ArithExpr
}
/**
- * Returns a string representation in decimal notation. The result
- * has at most decimal places.
+ * Returns a string representation in decimal notation.
+ * Remarks: The result has at most {@code precision} decimal places.
+ * @param precision precision
+ * @return String
+ * @throws Z3Exception on error
**/
public String toDecimal(int precision) throws Z3Exception
{
diff --git a/src/api/java/ApplyResult.java b/src/api/java/ApplyResult.java
index c550c05ae..d21a78a9c 100644
--- a/src/api/java/ApplyResult.java
+++ b/src/api/java/ApplyResult.java
@@ -48,10 +48,10 @@ public class ApplyResult extends Z3Object
}
/**
- * Convert a model for the subgoal into a model for the
- * original goal g, that the ApplyResult was obtained from.
+ * Convert a model for the subgoal {@code i} into a model for the
+ * original goal {@code g}, that the ApplyResult was obtained from.
*
- * @return A model for g
+ * @return A model for {@code g}
* @throws Z3Exception
**/
public Model convertModel(int i, Model m) throws Z3Exception
diff --git a/src/api/java/ArithExpr.java b/src/api/java/ArithExpr.java
index 83ec35d01..996b98afc 100644
--- a/src/api/java/ArithExpr.java
+++ b/src/api/java/ArithExpr.java
@@ -23,13 +23,8 @@ package com.microsoft.z3;
public class ArithExpr extends Expr
{
/**
- * Constructor for ArithExpr
+ * Constructor for ArithExpr
**/
- protected ArithExpr(Context ctx)
- {
- super(ctx);
- }
-
ArithExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/ArrayExpr.java b/src/api/java/ArrayExpr.java
index 2d5a5a273..154a56af4 100644
--- a/src/api/java/ArrayExpr.java
+++ b/src/api/java/ArrayExpr.java
@@ -24,13 +24,8 @@ package com.microsoft.z3;
public class ArrayExpr extends Expr
{
/**
- * Constructor for ArrayExpr
+ * Constructor for ArrayExpr
**/
- protected ArrayExpr(Context ctx)
- {
- super(ctx);
- }
-
ArrayExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/ArraySort.java b/src/api/java/ArraySort.java
index a371fa3cb..ab545b7c1 100644
--- a/src/api/java/ArraySort.java
+++ b/src/api/java/ArraySort.java
@@ -25,6 +25,8 @@ public class ArraySort extends Sort
/**
* The domain of the array sort.
* @throws Z3Exception
+ * @throws Z3Exception on error
+ * @return a sort
**/
public Sort getDomain() throws Z3Exception
{
@@ -35,6 +37,8 @@ public class ArraySort extends Sort
/**
* The range of the array sort.
* @throws Z3Exception
+ * @throws Z3Exception on error
+ * @return a sort
**/
public Sort getRange() throws Z3Exception
{
diff --git a/src/api/java/BitVecExpr.java b/src/api/java/BitVecExpr.java
index 24b1cfdf3..69a97de40 100644
--- a/src/api/java/BitVecExpr.java
+++ b/src/api/java/BitVecExpr.java
@@ -26,6 +26,8 @@ public class BitVecExpr extends Expr
/**
* The size of the sort of a bit-vector term.
* @throws Z3Exception
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getSortSize() throws Z3Exception
{
@@ -33,13 +35,8 @@ public class BitVecExpr extends Expr
}
/**
- * Constructor for BitVecExpr
+ * Constructor for BitVecExpr
**/
- BitVecExpr(Context ctx)
- {
- super(ctx);
- }
-
BitVecExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/BitVecSort.java b/src/api/java/BitVecSort.java
index be406c806..69d74151c 100644
--- a/src/api/java/BitVecSort.java
+++ b/src/api/java/BitVecSort.java
@@ -24,6 +24,8 @@ public class BitVecSort extends Sort
{
/**
* The size of the bit-vector sort.
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getSize() throws Z3Exception
{
diff --git a/src/api/java/BoolExpr.java b/src/api/java/BoolExpr.java
index 99453496a..ea3cdbfb4 100644
--- a/src/api/java/BoolExpr.java
+++ b/src/api/java/BoolExpr.java
@@ -23,7 +23,7 @@ package com.microsoft.z3;
public class BoolExpr extends Expr
{
/**
- * Constructor for BoolExpr
+ * Constructor for BoolExpr
**/
protected BoolExpr(Context ctx)
{
@@ -31,8 +31,9 @@ public class BoolExpr extends Expr
}
/**
- * Constructor for BoolExpr
+ * Constructor for BoolExpr
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
BoolExpr(Context ctx, long obj) throws Z3Exception
{
diff --git a/src/api/java/Constructor.java b/src/api/java/Constructor.java
index 4813c2b0a..a5440092c 100644
--- a/src/api/java/Constructor.java
+++ b/src/api/java/Constructor.java
@@ -25,6 +25,8 @@ public class Constructor extends Z3Object
/**
* The number of fields of the constructor.
* @throws Z3Exception
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getNumFields() throws Z3Exception
{
@@ -34,6 +36,7 @@ public class Constructor extends Z3Object
/**
* The function declaration of the constructor.
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl ConstructorDecl() throws Z3Exception
{
@@ -47,6 +50,7 @@ public class Constructor extends Z3Object
/**
* The function declaration of the tester.
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl getTesterDecl() throws Z3Exception
{
@@ -60,6 +64,7 @@ public class Constructor extends Z3Object
/**
* The function declarations of the accessors
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl[] getAccessorDecls() throws Z3Exception
{
@@ -75,6 +80,7 @@ public class Constructor extends Z3Object
/**
* Destructor.
+ * @throws Z3Exception on error
**/
protected void finalize() throws Z3Exception
{
diff --git a/src/api/java/ConstructorList.java b/src/api/java/ConstructorList.java
index 315a2e535..b38678b8a 100644
--- a/src/api/java/ConstructorList.java
+++ b/src/api/java/ConstructorList.java
@@ -24,6 +24,7 @@ public class ConstructorList extends Z3Object
{
/**
* Destructor.
+ * @throws Z3Exception on error
**/
protected void finalize() throws Z3Exception
{
diff --git a/src/api/java/Context.java b/src/api/java/Context.java
index 4fbd79be2..294826f55 100644
--- a/src/api/java/Context.java
+++ b/src/api/java/Context.java
@@ -38,7 +38,7 @@ public class Context extends IDisposable
/**
* Constructor.
- *
+ * Remarks:
* The following parameters can be set:
* - proof (Boolean) Enable proof generation
* - debug_ref_count (Boolean) Enable debug support for Z3_ast reference counting
@@ -51,8 +51,7 @@ public class Context extends IDisposable
* - model_validate validate models produced by solvers
* - unsat_core unsat-core generation for solvers, this parameter can be overwritten when creating a solver
* Note that in previous versions of Z3, this constructor was also used to set global and
- * module parameters. For this purpose we should now use
- *
+ * module parameters. For this purpose we should now use {@code Global.setParameter}
**/
public Context(Map settings) throws Z3Exception
{
@@ -66,9 +65,9 @@ public class Context extends IDisposable
}
/**
- * Creates a new symbol using an integer. Not all integers can be
- * passed to this function. The legal range of unsigned integers is 0 to
- * 2^30-1.
+ * Creates a new symbol using an integer.
+ * Remarks: Not all integers can be passed to this function.
+ * The legal range of unsigned integers is 0 to 2^30-1.
**/
public IntSymbol mkSymbol(int i) throws Z3Exception
{
@@ -86,7 +85,7 @@ public class Context extends IDisposable
/**
* Create an array of symbols.
**/
- Symbol[] MkSymbols(String[] names) throws Z3Exception
+ Symbol[] mkSymbols(String[] names) throws Z3Exception
{
if (names == null)
return null;
@@ -135,7 +134,6 @@ public class Context extends IDisposable
**/
public BoolSort mkBoolSort() throws Z3Exception
{
-
return new BoolSort(this);
}
@@ -144,7 +142,6 @@ public class Context extends IDisposable
**/
public UninterpretedSort mkUninterpretedSort(Symbol s) throws Z3Exception
{
-
checkContextMatch(s);
return new UninterpretedSort(this, s);
}
@@ -154,7 +151,6 @@ public class Context extends IDisposable
**/
public UninterpretedSort mkUninterpretedSort(String str) throws Z3Exception
{
-
return mkUninterpretedSort(mkSymbol(str));
}
@@ -163,7 +159,6 @@ public class Context extends IDisposable
**/
public IntSort mkIntSort() throws Z3Exception
{
-
return new IntSort(this);
}
@@ -172,7 +167,6 @@ public class Context extends IDisposable
**/
public RealSort mkRealSort() throws Z3Exception
{
-
return new RealSort(this);
}
@@ -181,7 +175,6 @@ public class Context extends IDisposable
**/
public BitVecSort mkBitVecSort(int size) throws Z3Exception
{
-
return new BitVecSort(this, Native.mkBvSort(nCtx(), size));
}
@@ -190,7 +183,6 @@ public class Context extends IDisposable
**/
public ArraySort mkArraySort(Sort domain, Sort range) throws Z3Exception
{
-
checkContextMatch(domain);
checkContextMatch(range);
return new ArraySort(this, domain, range);
@@ -202,7 +194,6 @@ public class Context extends IDisposable
public TupleSort mkTupleSort(Symbol name, Symbol[] fieldNames,
Sort[] fieldSorts) throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(fieldNames);
checkContextMatch(fieldSorts);
@@ -216,7 +207,6 @@ public class Context extends IDisposable
public EnumSort mkEnumSort(Symbol name, Symbol... enumNames)
throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(enumNames);
return new EnumSort(this, name, enumNames);
@@ -228,7 +218,7 @@ public class Context extends IDisposable
public EnumSort mkEnumSort(String name, String... enumNames)
throws Z3Exception
{
- return new EnumSort(this, mkSymbol(name), MkSymbols(enumNames));
+ return new EnumSort(this, mkSymbol(name), mkSymbols(enumNames));
}
/**
@@ -236,7 +226,6 @@ public class Context extends IDisposable
**/
public ListSort mkListSort(Symbol name, Sort elemSort) throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(elemSort);
return new ListSort(this, name, elemSort);
@@ -247,7 +236,6 @@ public class Context extends IDisposable
**/
public ListSort mkListSort(String name, Sort elemSort) throws Z3Exception
{
-
checkContextMatch(elemSort);
return new ListSort(this, mkSymbol(name), elemSort);
}
@@ -258,7 +246,6 @@ public class Context extends IDisposable
public FiniteDomainSort mkFiniteDomainSort(Symbol name, long size)
throws Z3Exception
{
-
checkContextMatch(name);
return new FiniteDomainSort(this, name, size);
}
@@ -269,20 +256,19 @@ public class Context extends IDisposable
public FiniteDomainSort mkFiniteDomainSort(String name, long size)
throws Z3Exception
{
-
return new FiniteDomainSort(this, mkSymbol(name), size);
}
/**
- * Create a datatype constructor. constructor
- * name name of recognizer
- * function. names of the constructor
- * fields. field sorts, 0 if the field sort
- * refers to a recursive sort. reference to
- * datatype sort that is an argument to the constructor; if the
- * corresponding sort reference is 0, then the value in sort_refs should be
+ * Create a datatype constructor.
+ * @param name constructor name
+ * @param recognizer name of recognizer function.
+ * @param fieldNames names of the constructor fields.
+ * @param sorts field sorts, 0 if the field sort refers to a recursive sort.
+ * @param sortRefs reference to datatype sort that is an argument to the
+ * constructor; if the corresponding sort reference is 0, then the value in sort_refs should be
* an index referring to one of the recursive datatypes that is
- * declared.
+ * declared.
**/
public Constructor mkConstructor(Symbol name, Symbol recognizer,
Symbol[] fieldNames, Sort[] sorts, int[] sortRefs)
@@ -294,9 +280,12 @@ public class Context extends IDisposable
}
/**
- * Create a datatype constructor.
+ * Create a datatype constructor.
+ * @param name
+ * @param recognizer
+ * @param fieldNames
+ * @param sorts
+ * @param sortRefs
*
* @return
**/
@@ -306,7 +295,7 @@ public class Context extends IDisposable
{
return new Constructor(this, mkSymbol(name), mkSymbol(recognizer),
- MkSymbols(fieldNames), sorts, sortRefs);
+ mkSymbols(fieldNames), sorts, sortRefs);
}
/**
@@ -315,7 +304,6 @@ public class Context extends IDisposable
public DatatypeSort mkDatatypeSort(Symbol name, Constructor[] constructors)
throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(constructors);
return new DatatypeSort(this, name, constructors);
@@ -327,20 +315,18 @@ public class Context extends IDisposable
public DatatypeSort mkDatatypeSort(String name, Constructor[] constructors)
throws Z3Exception
{
-
checkContextMatch(constructors);
return new DatatypeSort(this, mkSymbol(name), constructors);
}
/**
- * Create mutually recursive datatypes. names of
- * datatype sorts list of constructors, one list per
- * sort.
+ * Create mutually recursive datatypes.
+ * @param names names of datatype sorts
+ * @param c list of constructors, one list per sort.
**/
public DatatypeSort[] mkDatatypeSorts(Symbol[] names, Constructor[][] c)
throws Z3Exception
{
-
checkContextMatch(names);
int n = (int) names.length;
ConstructorList[] cla = new ConstructorList[n];
@@ -363,16 +349,16 @@ public class Context extends IDisposable
}
/**
- * Create mutually recursive data-types.
+ * Create mutually recursive data-types.
+ * @param names
+ * @param c
*
* @return
**/
public DatatypeSort[] mkDatatypeSorts(String[] names, Constructor[][] c)
throws Z3Exception
{
-
- return mkDatatypeSorts(MkSymbols(names), c);
+ return mkDatatypeSorts(mkSymbols(names), c);
}
/**
@@ -381,7 +367,6 @@ public class Context extends IDisposable
public FuncDecl mkFuncDecl(Symbol name, Sort[] domain, Sort range)
throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(domain);
checkContextMatch(range);
@@ -394,7 +379,6 @@ public class Context extends IDisposable
public FuncDecl mkFuncDecl(Symbol name, Sort domain, Sort range)
throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(domain);
checkContextMatch(range);
@@ -408,7 +392,6 @@ public class Context extends IDisposable
public FuncDecl mkFuncDecl(String name, Sort[] domain, Sort range)
throws Z3Exception
{
-
checkContextMatch(domain);
checkContextMatch(range);
return new FuncDecl(this, mkSymbol(name), domain, range);
@@ -420,7 +403,6 @@ public class Context extends IDisposable
public FuncDecl mkFuncDecl(String name, Sort domain, Sort range)
throws Z3Exception
{
-
checkContextMatch(domain);
checkContextMatch(range);
Sort[] q = new Sort[] { domain };
@@ -428,14 +410,14 @@ public class Context extends IDisposable
}
/**
- * Creates a fresh function declaration with a name prefixed with .
+ * Creates a fresh function declaration with a name prefixed with
+ * {@code prefix}.
+ * @see mkFuncDecl(String,Sort,Sort)
+ * @see mkFuncDecl(String,Sort[],Sort)
**/
public FuncDecl mkFreshFuncDecl(String prefix, Sort[] domain, Sort range)
throws Z3Exception
{
-
checkContextMatch(domain);
checkContextMatch(range);
return new FuncDecl(this, prefix, domain, range);
@@ -446,7 +428,6 @@ public class Context extends IDisposable
**/
public FuncDecl mkConstDecl(Symbol name, Sort range) throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(range);
return new FuncDecl(this, name, null, range);
@@ -457,27 +438,27 @@ public class Context extends IDisposable
**/
public FuncDecl mkConstDecl(String name, Sort range) throws Z3Exception
{
-
checkContextMatch(range);
return new FuncDecl(this, mkSymbol(name), null, range);
}
/**
* Creates a fresh constant function declaration with a name prefixed with
- * .
- *
+ * {@code prefix"}.
+ * @see mkFuncDecl(String,Sort,Sort)
+ * @see mkFuncDecl(String,Sort[],Sort)
**/
public FuncDecl mkFreshConstDecl(String prefix, Sort range)
throws Z3Exception
{
-
checkContextMatch(range);
return new FuncDecl(this, prefix, null, range);
}
/**
- * Creates a new bound variable. The de-Bruijn index of
- * the variable The sort of the variable
+ * Creates a new bound variable.
+ * @param index The de-Bruijn index of the variable
+ * @param ty The sort of the variable
**/
public Expr mkBound(int index, Sort ty) throws Z3Exception
{
@@ -499,12 +480,11 @@ public class Context extends IDisposable
}
/**
- * Creates a new Constant of sort and named
- * .
+ * Creates a new Constant of sort {@code range} and named
+ * {@code name}.
**/
public Expr mkConst(Symbol name, Sort range) throws Z3Exception
{
-
checkContextMatch(name);
checkContextMatch(range);
@@ -515,34 +495,31 @@ public class Context extends IDisposable
}
/**
- * Creates a new Constant of sort and named
- * .
+ * Creates a new Constant of sort {@code range} and named
+ * {@code name}.
**/
public Expr mkConst(String name, Sort range) throws Z3Exception
{
-
return mkConst(mkSymbol(name), range);
}
/**
- * Creates a fresh Constant of sort and a name
- * prefixed with .
+ * Creates a fresh Constant of sort {@code range} and a name
+ * prefixed with {@code prefix}.
**/
public Expr mkFreshConst(String prefix, Sort range) throws Z3Exception
{
-
checkContextMatch(range);
return Expr.create(this,
Native.mkFreshConst(nCtx(), prefix, range.getNativeObject()));
}
/**
- * Creates a fresh constant from the FuncDecl . A decl of a 0-arity function
+ * Creates a fresh constant from the FuncDecl {@code f}.
+ * @param f A decl of a 0-arity function
**/
public Expr mkConst(FuncDecl f) throws Z3Exception
{
-
return mkApp(f, (Expr[]) null);
}
@@ -551,7 +528,6 @@ public class Context extends IDisposable
**/
public BoolExpr mkBoolConst(Symbol name) throws Z3Exception
{
-
return (BoolExpr) mkConst(name, getBoolSort());
}
@@ -560,7 +536,6 @@ public class Context extends IDisposable
**/
public BoolExpr mkBoolConst(String name) throws Z3Exception
{
-
return (BoolExpr) mkConst(mkSymbol(name), getBoolSort());
}
@@ -569,7 +544,6 @@ public class Context extends IDisposable
**/
public IntExpr mkIntConst(Symbol name) throws Z3Exception
{
-
return (IntExpr) mkConst(name, getIntSort());
}
@@ -578,7 +552,6 @@ public class Context extends IDisposable
**/
public IntExpr mkIntConst(String name) throws Z3Exception
{
-
return (IntExpr) mkConst(name, getIntSort());
}
@@ -587,7 +560,6 @@ public class Context extends IDisposable
**/
public RealExpr mkRealConst(Symbol name) throws Z3Exception
{
-
return (RealExpr) mkConst(name, getRealSort());
}
@@ -596,7 +568,6 @@ public class Context extends IDisposable
**/
public RealExpr mkRealConst(String name) throws Z3Exception
{
-
return (RealExpr) mkConst(name, getRealSort());
}
@@ -605,7 +576,6 @@ public class Context extends IDisposable
**/
public BitVecExpr mkBVConst(Symbol name, int size) throws Z3Exception
{
-
return (BitVecExpr) mkConst(name, mkBitVecSort(size));
}
@@ -614,7 +584,6 @@ public class Context extends IDisposable
**/
public BitVecExpr mkBVConst(String name, int size) throws Z3Exception
{
-
return (BitVecExpr) mkConst(name, mkBitVecSort(size));
}
@@ -653,7 +622,7 @@ public class Context extends IDisposable
}
/**
- * Creates the equality = .
+ * Creates the equality {@code x"/> = An expression with Boolean
- * sort An expression An
- * expression with the same sort as
+ * {@code ite(t1, t2, t3)}.
+ * @param t1 An expression with Boolean sort
+ * @param t2 An expression
+ * @param t3 An expression with the same sort as {@code t2}
**/
public Expr mkITE(BoolExpr t1, Expr t2, Expr t3) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
checkContextMatch(t3);
@@ -700,11 +668,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 iff t2.
+ * Create an expression representing {@code t1 iff t2}.
**/
public BoolExpr mkIff(BoolExpr t1, BoolExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkIff(nCtx(), t1.getNativeObject(),
@@ -712,11 +679,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 -> t2.
+ * Create an expression representing {@code t1 -> t2}.
**/
public BoolExpr mkImplies(BoolExpr t1, BoolExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkImplies(nCtx(),
@@ -724,11 +690,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 xor t2.
+ * Create an expression representing {@code t1 xor t2}.
**/
public BoolExpr mkXor(BoolExpr t1, BoolExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkXor(nCtx(), t1.getNativeObject(),
@@ -736,77 +701,70 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t[0] and t[1] and ....
+ * Create an expression representing {@code t[0] and t[1] and ...}.
**/
public BoolExpr mkAnd(BoolExpr... t) throws Z3Exception
{
-
checkContextMatch(t);
return new BoolExpr(this, Native.mkAnd(nCtx(), (int) t.length,
AST.arrayToNative(t)));
}
/**
- * Create an expression representing t[0] or t[1] or ....
+ * Create an expression representing {@code t[0] or t[1] or ...}.
**/
public BoolExpr mkOr(BoolExpr... t) throws Z3Exception
{
-
checkContextMatch(t);
return new BoolExpr(this, Native.mkOr(nCtx(), (int) t.length,
AST.arrayToNative(t)));
}
/**
- * Create an expression representing t[0] + t[1] + ....
+ * Create an expression representing {@code t[0] + t[1] + ...}.
**/
public ArithExpr mkAdd(ArithExpr... t) throws Z3Exception
{
-
checkContextMatch(t);
return (ArithExpr) Expr.create(this,
Native.mkAdd(nCtx(), (int) t.length, AST.arrayToNative(t)));
}
/**
- * Create an expression representing t[0] * t[1] * ....
+ * Create an expression representing {@code t[0] * t[1] * ...}.
**/
public ArithExpr mkMul(ArithExpr... t) throws Z3Exception
{
-
checkContextMatch(t);
return (ArithExpr) Expr.create(this,
Native.mkMul(nCtx(), (int) t.length, AST.arrayToNative(t)));
}
/**
- * Create an expression representing t[0] - t[1] - ....
+ * Create an expression representing {@code t[0] - t[1] - ...}.
**/
public ArithExpr mkSub(ArithExpr... t) throws Z3Exception
{
-
checkContextMatch(t);
return (ArithExpr) Expr.create(this,
Native.mkSub(nCtx(), (int) t.length, AST.arrayToNative(t)));
}
/**
- * Create an expression representing -t.
+ * Create an expression representing {@code -t}.
**/
public ArithExpr mkUnaryMinus(ArithExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return (ArithExpr) Expr.create(this,
Native.mkUnaryMinus(nCtx(), t.getNativeObject()));
}
/**
- * Create an expression representing t1 / t2.
+ * Create an expression representing {@code t1 / t2}.
**/
public ArithExpr mkDiv(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return (ArithExpr) Expr.create(this, Native.mkDiv(nCtx(),
@@ -814,12 +772,12 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 mod t2. The
- * arguments must have int type.
+ * Create an expression representing {@code t1 mod t2}.
+ * Remarks: The
+ * arguments must have int type.
**/
public IntExpr mkMod(IntExpr t1, IntExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new IntExpr(this, Native.mkMod(nCtx(), t1.getNativeObject(),
@@ -827,12 +785,12 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 rem t2. The
- * arguments must have int type.
+ * Create an expression representing {@code t1 rem t2}.
+ * Remarks: The
+ * arguments must have int type.
**/
public IntExpr mkRem(IntExpr t1, IntExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new IntExpr(this, Native.mkRem(nCtx(), t1.getNativeObject(),
@@ -840,11 +798,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 ^ t2.
+ * Create an expression representing {@code t1 ^ t2}.
**/
public ArithExpr mkPower(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return (ArithExpr) Expr.create(
@@ -854,11 +811,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 < t2
+ * Create an expression representing {@code t1 < t2}
**/
public BoolExpr mkLt(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkLt(nCtx(), t1.getNativeObject(),
@@ -866,11 +822,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 <= t2
+ * Create an expression representing {@code t1 <= t2}
**/
public BoolExpr mkLe(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkLe(nCtx(), t1.getNativeObject(),
@@ -878,11 +833,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 > t2
+ * Create an expression representing {@code t1 > t2}
**/
public BoolExpr mkGt(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkGt(nCtx(), t1.getNativeObject(),
@@ -890,11 +844,10 @@ public class Context extends IDisposable
}
/**
- * Create an expression representing t1 >= t2
+ * Create an expression representing {@code t1 >= t2}
**/
public BoolExpr mkGe(ArithExpr t1, ArithExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkGe(nCtx(), t1.getNativeObject(),
@@ -902,30 +855,30 @@ public class Context extends IDisposable
}
/**
- * Coerce an integer to a real. There is also a converse operation
+ * Coerce an integer to a real.
+ * Remarks: There is also a converse operation
* exposed. It follows the semantics prescribed by the SMT-LIB standard.
*
* You can take the floor of a real by creating an auxiliary integer Term
- * k and and asserting
- * MakeInt2Real(k) <= t1 < MkInt2Real(k)+1. The argument
- * must be of integer sort.
+ * {@code k} and and asserting
+ * {@code MakeInt2Real(k) <= t1 < MkInt2Real(k)+1}. The argument
+ * must be of integer sort.
**/
public RealExpr mkInt2Real(IntExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new RealExpr(this,
Native.mkInt2real(nCtx(), t.getNativeObject()));
}
/**
- * Coerce a real to an integer. The semantics of this function
+ * Coerce a real to an integer.
+ * Remarks: The semantics of this function
* follows the SMT-LIB standard for the function to_int. The argument must
- * be of real sort.
+ * be of real sort.
**/
public IntExpr mkReal2Int(RealExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new IntExpr(this, Native.mkReal2int(nCtx(), t.getNativeObject()));
}
@@ -935,29 +888,28 @@ public class Context extends IDisposable
**/
public BoolExpr mkIsInteger(RealExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BoolExpr(this, Native.mkIsInt(nCtx(), t.getNativeObject()));
}
/**
- * Bitwise negation. The argument must have a bit-vector
- * sort.
+ * Bitwise negation.
+ * Remarks: The argument must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVNot(BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkBvnot(nCtx(), t.getNativeObject()));
}
/**
* Take conjunction of bits in a vector, return vector of length 1.
- * The argument must have a bit-vector sort.
+ *
+ * Remarks: The argument must have a bit-vector sort.
**/
public BitVecExpr mkBVRedAND(BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkBvredand(nCtx(),
t.getNativeObject()));
@@ -965,23 +917,23 @@ public class Context extends IDisposable
/**
* Take disjunction of bits in a vector, return vector of length 1.
- * The argument must have a bit-vector sort.
+ *
+ * Remarks: The argument must have a bit-vector sort.
**/
public BitVecExpr mkBVRedOR(BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkBvredor(nCtx(),
t.getNativeObject()));
}
/**
- * Bitwise conjunction. The arguments must have a bit-vector
- * sort.
+ * Bitwise conjunction.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVAND(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvand(nCtx(),
@@ -989,12 +941,12 @@ public class Context extends IDisposable
}
/**
- * Bitwise disjunction. The arguments must have a bit-vector
- * sort.
+ * Bitwise disjunction.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVOR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvor(nCtx(), t1.getNativeObject(),
@@ -1002,12 +954,12 @@ public class Context extends IDisposable
}
/**
- * Bitwise XOR. The arguments must have a bit-vector
- * sort.
+ * Bitwise XOR.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVXOR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvxor(nCtx(),
@@ -1015,12 +967,12 @@ public class Context extends IDisposable
}
/**
- * Bitwise NAND. The arguments must have a bit-vector
- * sort.
+ * Bitwise NAND.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVNAND(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvnand(nCtx(),
@@ -1028,12 +980,12 @@ public class Context extends IDisposable
}
/**
- * Bitwise NOR. The arguments must have a bit-vector
- * sort.
+ * Bitwise NOR.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVNOR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvnor(nCtx(),
@@ -1041,12 +993,12 @@ public class Context extends IDisposable
}
/**
- * Bitwise XNOR. The arguments must have a bit-vector
- * sort.
+ * Bitwise XNOR.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
**/
public BitVecExpr mkBVXNOR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvxnor(nCtx(),
@@ -1054,23 +1006,23 @@ public class Context extends IDisposable
}
/**
- * Standard two's complement unary minus. The arguments must have a
- * bit-vector sort.
+ * Standard two's complement unary minus.
+ * Remarks: The arguments must have a
+ * bit-vector sort.
**/
public BitVecExpr mkBVNeg(BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkBvneg(nCtx(), t.getNativeObject()));
}
/**
- * Two's complement addition. The arguments must have the same
- * bit-vector sort.
+ * Two's complement addition.
+ * Remarks: The arguments must have the same
+ * bit-vector sort.
**/
public BitVecExpr mkBVAdd(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvadd(nCtx(),
@@ -1078,12 +1030,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement subtraction. The arguments must have the same
- * bit-vector sort.
+ * Two's complement subtraction.
+ * Remarks: The arguments must have the same
+ * bit-vector sort.
**/
public BitVecExpr mkBVSub(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvsub(nCtx(),
@@ -1091,12 +1043,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement multiplication. The arguments must have the
- * same bit-vector sort.
+ * Two's complement multiplication.
+ * Remarks: The arguments must have the
+ * same bit-vector sort.
**/
public BitVecExpr mkBVMul(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvmul(nCtx(),
@@ -1104,14 +1056,14 @@ public class Context extends IDisposable
}
/**
- * Unsigned division. It is defined as the floor of
- * t1/t2 if \c t2 is different from zero. If t2 is
+ * Unsigned division.
+ * Remarks: It is defined as the floor of
+ * {@code t1/t2} if \c t2 is different from zero. If {@code t2} is
* zero, then the result is undefined. The arguments must have the same
- * bit-vector sort.
+ * bit-vector sort.
**/
public BitVecExpr mkBVUDiv(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvudiv(nCtx(),
@@ -1119,20 +1071,20 @@ public class Context extends IDisposable
}
/**
- * Signed division. It is defined in the following way:
+ * Signed division.
+ * Remarks: It is defined in the following way:
*
- * - The \c floor of t1/t2 if \c t2 is different from zero, and
- * t1*t2 >= 0.
+ * - The \c floor of {@code t1/t2} if \c t2 is different from zero, and
+ * {@code t1*t2 >= 0}.
*
- * - The \c ceiling of t1/t2 if \c t2 is different from zero,
- * and t1*t2 < 0.
+ * - The \c ceiling of {@code t1/t2} if \c t2 is different from zero,
+ * and {@code t1*t2 < 0}.
*
- * If t2 is zero, then the result is undefined. The arguments
- * must have the same bit-vector sort.
+ * If {@code t2} is zero, then the result is undefined. The arguments
+ * must have the same bit-vector sort.
**/
public BitVecExpr mkBVSDiv(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvsdiv(nCtx(),
@@ -1140,14 +1092,14 @@ public class Context extends IDisposable
}
/**
- * Unsigned remainder. It is defined as
- * t1 - (t1 /u t2) * t2, where /u represents
- * unsigned division. If t2 is zero, then the result is
- * undefined. The arguments must have the same bit-vector sort.
+ * Unsigned remainder.
+ * Remarks: It is defined as
+ * {@code t1 - (t1 /u t2) * t2}, where {@code /u} represents
+ * unsigned division. If {@code t2} is zero, then the result is
+ * undefined. The arguments must have the same bit-vector sort.
**/
public BitVecExpr mkBVURem(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvurem(nCtx(),
@@ -1155,17 +1107,17 @@ public class Context extends IDisposable
}
/**
- * Signed remainder. It is defined as
- * t1 - (t1 /s t2) * t2, where /s represents
+ * Signed remainder.
+ * Remarks: It is defined as
+ * {@code t1 - (t1 /s t2) * t2}, where {@code /s} represents
* signed division. The most significant bit (sign) of the result is equal
* to the most significant bit of \c t1.
*
- * If t2 is zero, then the result is undefined. The arguments
- * must have the same bit-vector sort.
+ * If {@code t2} is zero, then the result is undefined. The arguments
+ * must have the same bit-vector sort.
**/
public BitVecExpr mkBVSRem(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvsrem(nCtx(),
@@ -1173,13 +1125,13 @@ public class Context extends IDisposable
}
/**
- * Two's complement signed remainder (sign follows divisor). If
- * t2 is zero, then the result is undefined. The arguments must
- * have the same bit-vector sort.
+ * Two's complement signed remainder (sign follows divisor).
+ * Remarks: If
+ * {@code t2} is zero, then the result is undefined. The arguments must
+ * have the same bit-vector sort.
**/
public BitVecExpr mkBVSMod(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvsmod(nCtx(),
@@ -1187,12 +1139,12 @@ public class Context extends IDisposable
}
/**
- * Unsigned less-than The arguments must have the same bit-vector
- * sort.
+ * Unsigned less-than
+ * Remarks: The arguments must have the same bit-vector
+ * sort.
**/
public BoolExpr mkBVULT(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvult(nCtx(), t1.getNativeObject(),
@@ -1200,12 +1152,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement signed less-than The arguments must have the
- * same bit-vector sort.
+ * Two's complement signed less-than
+ * Remarks: The arguments must have the
+ * same bit-vector sort.
**/
public BoolExpr mkBVSLT(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvslt(nCtx(), t1.getNativeObject(),
@@ -1213,12 +1165,12 @@ public class Context extends IDisposable
}
/**
- * Unsigned less-than or equal to. The arguments must have the
- * same bit-vector sort.
+ * Unsigned less-than or equal to.
+ * Remarks: The arguments must have the
+ * same bit-vector sort.
**/
public BoolExpr mkBVULE(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvule(nCtx(), t1.getNativeObject(),
@@ -1226,12 +1178,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement signed less-than or equal to. The arguments
- * must have the same bit-vector sort.
+ * Two's complement signed less-than or equal to.
+ * Remarks: The arguments
+ * must have the same bit-vector sort.
**/
public BoolExpr mkBVSLE(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsle(nCtx(), t1.getNativeObject(),
@@ -1239,12 +1191,12 @@ public class Context extends IDisposable
}
/**
- * Unsigned greater than or equal to. The arguments must have the
- * same bit-vector sort.
+ * Unsigned greater than or equal to.
+ * Remarks: The arguments must have the
+ * same bit-vector sort.
**/
public BoolExpr mkBVUGE(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvuge(nCtx(), t1.getNativeObject(),
@@ -1252,12 +1204,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement signed greater than or equal to. The arguments
- * must have the same bit-vector sort.
+ * Two's complement signed greater than or equal to.
+ * Remarks: The arguments
+ * must have the same bit-vector sort.
**/
public BoolExpr mkBVSGE(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsge(nCtx(), t1.getNativeObject(),
@@ -1265,12 +1217,12 @@ public class Context extends IDisposable
}
/**
- * Unsigned greater-than. The arguments must have the same
- * bit-vector sort.
+ * Unsigned greater-than.
+ * Remarks: The arguments must have the same
+ * bit-vector sort.
**/
public BoolExpr mkBVUGT(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvugt(nCtx(), t1.getNativeObject(),
@@ -1278,12 +1230,12 @@ public class Context extends IDisposable
}
/**
- * Two's complement signed greater-than. The arguments must have
- * the same bit-vector sort.
+ * Two's complement signed greater-than.
+ * Remarks: The arguments must have
+ * the same bit-vector sort.
**/
public BoolExpr mkBVSGT(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsgt(nCtx(), t1.getNativeObject(),
@@ -1291,17 +1243,17 @@ public class Context extends IDisposable
}
/**
- * Bit-vector concatenation. The arguments must have a bit-vector
- * sort.
+ * Bit-vector concatenation.
+ * Remarks: The arguments must have a bit-vector
+ * sort.
*
- * @return The result is a bit-vector of size n1+n2, where
- * n1 (n2) is the size of t1
- * (t2).
+ * @return The result is a bit-vector of size {@code n1+n2}, where
+ * {@code n1} ({@code n2}) is the size of {@code t1}
+ * ({@code t2}).
*
**/
public BitVecExpr mkConcat(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkConcat(nCtx(),
@@ -1309,74 +1261,74 @@ public class Context extends IDisposable
}
/**
- * Bit-vector extraction. Extract the bits
- * down to from a bitvector of size m to
- * yield a new bitvector of size n, where
- * n = high - low + 1. The argument must
- * have a bit-vector sort.
+ * Bit-vector extraction.
+ * Remarks: Extract the bits {@code high}
+ * down to {@code low} from a bitvector of size {@code m} to
+ * yield a new bitvector of size {@code n}, where
+ * {@code n = high - low + 1}. The argument {@code t} must
+ * have a bit-vector sort.
**/
public BitVecExpr mkExtract(int high, int low, BitVecExpr t)
throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkExtract(nCtx(), high, low,
t.getNativeObject()));
}
/**
- * Bit-vector sign extension. Sign-extends the given bit-vector to
- * the (signed) equivalent bitvector of size m+i, where \c m is
- * the size of the given bit-vector. The argument must
- * have a bit-vector sort.
+ * Bit-vector sign extension.
+ * Remarks: Sign-extends the given bit-vector to
+ * the (signed) equivalent bitvector of size {@code m+i}, where \c m is
+ * the size of the given bit-vector. The argument {@code t} must
+ * have a bit-vector sort.
**/
public BitVecExpr mkSignExt(int i, BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkSignExt(nCtx(), i,
t.getNativeObject()));
}
/**
- * Bit-vector zero extension. Extend the given bit-vector with
- * zeros to the (unsigned) equivalent bitvector of size m+i,
- * where \c m is the size of the given bit-vector. The argument must have a bit-vector sort.
+ * Bit-vector zero extension.
+ * Remarks: Extend the given bit-vector with
+ * zeros to the (unsigned) equivalent bitvector of size {@code m+i},
+ * where \c m is the size of the given bit-vector. The argument {@code t}
+ * must have a bit-vector sort.
**/
public BitVecExpr mkZeroExt(int i, BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkZeroExt(nCtx(), i,
t.getNativeObject()));
}
/**
- * Bit-vector repetition. The argument must
- * have a bit-vector sort.
+ * Bit-vector repetition.
+ * Remarks: The argument {@code t} must
+ * have a bit-vector sort.
**/
public BitVecExpr mkRepeat(int i, BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkRepeat(nCtx(), i,
t.getNativeObject()));
}
/**
- * Shift left. It is equivalent to multiplication by
- * 2^x where \c x is the value of .
+ * Shift left.
+ * Remarks: It is equivalent to multiplication by
+ * {@code 2^x} where \c x is the value of {@code t2}.
*
* NB. The semantics of shift operations varies between environments. This
* definition does not necessarily capture directly the semantics of the
* programming language or assembly architecture you are modeling.
*
- * The arguments must have a bit-vector sort.
+ * The arguments must have a bit-vector sort.
**/
public BitVecExpr mkBVSHL(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvshl(nCtx(),
@@ -1384,18 +1336,18 @@ public class Context extends IDisposable
}
/**
- * Logical shift right It is equivalent to unsigned division by
- * 2^x where \c x is the value of .
+ * Logical shift right
+ * Remarks: It is equivalent to unsigned division by
+ * {@code 2^x} where \c x is the value of {@code t2}.
*
* NB. The semantics of shift operations varies between environments. This
* definition does not necessarily capture directly the semantics of the
* programming language or assembly architecture you are modeling.
*
- * The arguments must have a bit-vector sort.
+ * The arguments must have a bit-vector sort.
**/
public BitVecExpr mkBVLSHR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvlshr(nCtx(),
@@ -1403,7 +1355,8 @@ public class Context extends IDisposable
}
/**
- * Arithmetic shift right It is like logical shift right except
+ * Arithmetic shift right
+ * Remarks: It is like logical shift right except
* that the most significant bits of the result always copy the most
* significant bit of the second argument.
*
@@ -1411,11 +1364,10 @@ public class Context extends IDisposable
* definition does not necessarily capture directly the semantics of the
* programming language or assembly architecture you are modeling.
*
- * The arguments must have a bit-vector sort.
+ * The arguments must have a bit-vector sort.
**/
public BitVecExpr mkBVASHR(BitVecExpr t1, BitVecExpr t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkBvashr(nCtx(),
@@ -1423,38 +1375,38 @@ public class Context extends IDisposable
}
/**
- * Rotate Left. Rotate bits of \c t to the left \c i times. The
- * argument must have a bit-vector sort.
+ * Rotate Left.
+ * Remarks: Rotate bits of \c t to the left \c i times. The
+ * argument {@code t} must have a bit-vector sort.
**/
public BitVecExpr mkBVRotateLeft(int i, BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkRotateLeft(nCtx(), i,
t.getNativeObject()));
}
/**
- * Rotate Right. Rotate bits of \c t to the right \c i times. The
- * argument must have a bit-vector sort.
+ * Rotate Right.
+ * Remarks: Rotate bits of \c t to the right \c i times. The
+ * argument {@code t} must have a bit-vector sort.
**/
public BitVecExpr mkBVRotateRight(int i, BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkRotateRight(nCtx(), i,
t.getNativeObject()));
}
/**
- * Rotate Left. Rotate bits of to the left
- * times. The arguments must have the same bit-vector
- * sort.
+ * Rotate Left.
+ * Remarks: Rotate bits of {@code t1} to the left
+ * {@code t2} times. The arguments must have the same bit-vector
+ * sort.
**/
public BitVecExpr mkBVRotateLeft(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkExtRotateLeft(nCtx(),
@@ -1462,14 +1414,14 @@ public class Context extends IDisposable
}
/**
- * Rotate Right. Rotate bits of to the
- * right times. The arguments must have the same
- * bit-vector sort.
+ * Rotate Right.
+ * Remarks: Rotate bits of {@code t1} to the
+ * right{@code t2} times. The arguments must have the same
+ * bit-vector sort.
**/
public BitVecExpr mkBVRotateRight(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BitVecExpr(this, Native.mkExtRotateRight(nCtx(),
@@ -1477,38 +1429,37 @@ public class Context extends IDisposable
}
/**
- * Create an bit bit-vector from the integer argument
- * . NB. This function is essentially treated
+ * Create an {@code n} bit bit-vector from the integer argument
+ * {@code t}.
+ * Remarks: NB. This function is essentially treated
* as uninterpreted. So you cannot expect Z3 to precisely reflect the
* semantics of this function when solving constraints with this function.
*
- * The argument must be of integer sort.
+ * The argument must be of integer sort.
**/
public BitVecExpr mkInt2BV(int n, IntExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BitVecExpr(this, Native.mkInt2bv(nCtx(), n,
t.getNativeObject()));
}
/**
- * Create an integer from the bit-vector argument .
- * If \c is_signed is false, then the bit-vector \c t1 is treated
+ * Create an integer from the bit-vector argument {@code t}.
+ * Remarks: If \c is_signed is false, then the bit-vector \c t1 is treated
* as unsigned. So the result is non-negative and in the range
- * [0..2^N-1], where N are the number of bits in . If \c is_signed is true, \c t1 is treated as a signed
+ * {@code [0..2^N-1]}, where N are the number of bits in {@code t}.
+ * If \c is_signed is true, \c t1 is treated as a signed
* bit-vector.
*
* NB. This function is essentially treated as uninterpreted. So you cannot
* expect Z3 to precisely reflect the semantics of this function when
* solving constraints with this function.
*
- * The argument must be of bit-vector sort.
+ * The argument must be of bit-vector sort.
**/
public IntExpr mkBV2Int(BitVecExpr t, boolean signed) throws Z3Exception
{
-
checkContextMatch(t);
return new IntExpr(this, Native.mkBv2int(nCtx(), t.getNativeObject(),
(signed) ? true : false));
@@ -1516,12 +1467,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise addition does not
- * overflow. The arguments must be of bit-vector sort.
+ * overflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVAddNoOverflow(BitVecExpr t1, BitVecExpr t2,
boolean isSigned) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvaddNoOverflow(nCtx(), t1
@@ -1531,12 +1482,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise addition does not
- * underflow. The arguments must be of bit-vector sort.
+ * underflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVAddNoUnderflow(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvaddNoUnderflow(nCtx(),
@@ -1545,12 +1496,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise subtraction does not
- * overflow. The arguments must be of bit-vector sort.
+ * overflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVSubNoOverflow(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsubNoOverflow(nCtx(),
@@ -1559,12 +1510,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise subtraction does not
- * underflow. The arguments must be of bit-vector sort.
+ * underflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVSubNoUnderflow(BitVecExpr t1, BitVecExpr t2,
boolean isSigned) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsubNoUnderflow(nCtx(), t1
@@ -1574,12 +1525,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise signed division does not
- * overflow. The arguments must be of bit-vector sort.
+ * overflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVSDivNoOverflow(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvsdivNoOverflow(nCtx(),
@@ -1588,11 +1539,11 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise negation does not
- * overflow. The arguments must be of bit-vector sort.
+ * overflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVNegNoOverflow(BitVecExpr t) throws Z3Exception
{
-
checkContextMatch(t);
return new BoolExpr(this, Native.mkBvnegNoOverflow(nCtx(),
t.getNativeObject()));
@@ -1600,12 +1551,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise multiplication does not
- * overflow. The arguments must be of bit-vector sort.
+ * overflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVMulNoOverflow(BitVecExpr t1, BitVecExpr t2,
boolean isSigned) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvmulNoOverflow(nCtx(), t1
@@ -1615,12 +1566,12 @@ public class Context extends IDisposable
/**
* Create a predicate that checks that the bit-wise multiplication does not
- * underflow. The arguments must be of bit-vector sort.
+ * underflow.
+ * Remarks: The arguments must be of bit-vector sort.
**/
public BoolExpr mkBVMulNoUnderflow(BitVecExpr t1, BitVecExpr t2)
throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new BoolExpr(this, Native.mkBvmulNoUnderflow(nCtx(),
@@ -1633,7 +1584,6 @@ public class Context extends IDisposable
public ArrayExpr mkArrayConst(Symbol name, Sort domain, Sort range)
throws Z3Exception
{
-
return (ArrayExpr) mkConst(name, mkArraySort(domain, range));
}
@@ -1643,22 +1593,24 @@ public class Context extends IDisposable
public ArrayExpr mkArrayConst(String name, Sort domain, Sort range)
throws Z3Exception
{
-
return (ArrayExpr) mkConst(mkSymbol(name), mkArraySort(domain, range));
}
/**
- * Array read. The argument a is the array and
- * i is the index of the array that gets read.
+ * Array read.
+ * Remarks: The argument {@code a} is the array and
+ * {@code i} is the index of the array that gets read.
*
- * The node a must have an array sort
- * [domain -> range], and i must have the sort
- * domain. The sort of the result is range.
- *
+ * The node {@code a} must have an array sort
+ * {@code [domain -> range]}, and {@code i} must have the sort
+ * {@code domain}. The sort of the result is {@code range}.
+ *
+ * @see mkArraySort
+ * @see mkStore
+
**/
public Expr mkSelect(ArrayExpr a, Expr i) throws Z3Exception
{
-
checkContextMatch(a);
checkContextMatch(i);
return Expr.create(
@@ -1668,21 +1620,23 @@ public class Context extends IDisposable
}
/**
- * Array update. The node a must have an array sort
- * [domain -> range], i must have sort
- * domain, v must have sort range. The sort of the
- * result is [domain -> range]. The semantics of this function
+ * Array update.
+ * Remarks: The node {@code a} must have an array sort
+ * {@code [domain -> range]}, {@code i} must have sort
+ * {@code domain}, {@code v} must have sort range. The sort of the
+ * result is {@code [domain -> range]}. The semantics of this function
* is given by the theory of arrays described in the SMT-LIB standard. See
* http://smtlib.org for more details. The result of this function is an
- * array that is equal to a (with respect to
- * select) on all indices except for i, where it
- * maps to v (and the select of a
- * with respect to i may be a different value).
+ * array that is equal to {@code a} (with respect to
+ * {@code select}) on all indices except for {@code i}, where it
+ * maps to {@code v} (and the {@code select} of {@code a}
+ * with respect to {@code i} may be a different value).
+ * @see mkArraySort
+ * @see mkSelect
+
**/
public ArrayExpr mkStore(ArrayExpr a, Expr i, Expr v) throws Z3Exception
{
-
checkContextMatch(a);
checkContextMatch(i);
checkContextMatch(v);
@@ -1691,14 +1645,16 @@ public class Context extends IDisposable
}
/**
- * Create a constant array. The resulting term is an array, such
- * that a selecton an arbitrary index produces the value
- * v.
- *
+ * Create a constant array.
+ * Remarks: The resulting term is an array, such
+ * that a {@code select} on an arbitrary index produces the value
+ * {@code v}.
+ * @see mkArraySort
+ * @see mkSelect
+ *
**/
public ArrayExpr mkConstArray(Sort domain, Expr v) throws Z3Exception
{
-
checkContextMatch(domain);
checkContextMatch(v);
return new ArrayExpr(this, Native.mkConstArray(nCtx(),
@@ -1706,17 +1662,20 @@ public class Context extends IDisposable
}
/**
- * Maps f on the argument arrays. Eeach element of
- * args must be of an array sort
- * [domain_i -> range_i]. The function declaration
- * f must have type range_1 .. range_n -> range.
- * v must have sort range. The sort of the result is
- * [domain_i -> range].
+ * Maps f on the argument arrays.
+ * Remarks: Eeach element of
+ * {@code args} must be of an array sort
+ * {@code [domain_i -> range_i]}. The function declaration
+ * {@code f} must have type {@code range_1 .. range_n -> range}.
+ * {@code v} must have sort range. The sort of the result is
+ * {@code [domain_i -> range]}.
+ * @see mkArraySort
+ * @see mkSelect
+ * @see mkStore
+
**/
public ArrayExpr mkMap(FuncDecl f, ArrayExpr... args) throws Z3Exception
{
-
checkContextMatch(f);
checkContextMatch(args);
return (ArrayExpr) Expr.create(this, Native.mkMap(nCtx(),
@@ -1725,13 +1684,13 @@ public class Context extends IDisposable
}
/**
- * Access the array default value. Produces the default range
+ * Access the array default value.
+ * Remarks: Produces the default range
* value, for arrays that can be represented as finite maps with a default
- * range value.
+ * range value.
**/
public Expr mkTermArray(ArrayExpr array) throws Z3Exception
{
-
checkContextMatch(array);
return Expr.create(this,
Native.mkArrayDefault(nCtx(), array.getNativeObject()));
@@ -1742,7 +1701,6 @@ public class Context extends IDisposable
**/
public SetSort mkSetSort(Sort ty) throws Z3Exception
{
-
checkContextMatch(ty);
return new SetSort(this, ty);
}
@@ -1752,7 +1710,6 @@ public class Context extends IDisposable
**/
public Expr mkEmptySet(Sort domain) throws Z3Exception
{
-
checkContextMatch(domain);
return Expr.create(this,
Native.mkEmptySet(nCtx(), domain.getNativeObject()));
@@ -1763,7 +1720,6 @@ public class Context extends IDisposable
**/
public Expr mkFullSet(Sort domain) throws Z3Exception
{
-
checkContextMatch(domain);
return Expr.create(this,
Native.mkFullSet(nCtx(), domain.getNativeObject()));
@@ -1774,7 +1730,6 @@ public class Context extends IDisposable
**/
public Expr mkSetAdd(Expr set, Expr element) throws Z3Exception
{
-
checkContextMatch(set);
checkContextMatch(element);
return Expr.create(
@@ -1788,7 +1743,6 @@ public class Context extends IDisposable
**/
public Expr mkSetDel(Expr set, Expr element) throws Z3Exception
{
-
checkContextMatch(set);
checkContextMatch(element);
return Expr.create(
@@ -1802,7 +1756,6 @@ public class Context extends IDisposable
**/
public Expr mkSetUnion(Expr... args) throws Z3Exception
{
-
checkContextMatch(args);
return Expr.create(
this,
@@ -1815,7 +1768,6 @@ public class Context extends IDisposable
**/
public Expr mkSetIntersection(Expr... args) throws Z3Exception
{
-
checkContextMatch(args);
return Expr.create(
this,
@@ -1828,7 +1780,6 @@ public class Context extends IDisposable
**/
public Expr mkSetDifference(Expr arg1, Expr arg2) throws Z3Exception
{
-
checkContextMatch(arg1);
checkContextMatch(arg2);
return Expr.create(
@@ -1842,7 +1793,6 @@ public class Context extends IDisposable
**/
public Expr mkSetComplement(Expr arg) throws Z3Exception
{
-
checkContextMatch(arg);
return Expr.create(this,
Native.mkSetComplement(nCtx(), arg.getNativeObject()));
@@ -1853,7 +1803,6 @@ public class Context extends IDisposable
**/
public Expr mkSetMembership(Expr elem, Expr set) throws Z3Exception
{
-
checkContextMatch(elem);
checkContextMatch(set);
return Expr.create(
@@ -1867,7 +1816,6 @@ public class Context extends IDisposable
**/
public Expr mkSetSubset(Expr arg1, Expr arg2) throws Z3Exception
{
-
checkContextMatch(arg1);
checkContextMatch(arg2);
return Expr.create(
@@ -1877,19 +1825,18 @@ public class Context extends IDisposable
}
/**
- * Create a Term of a given sort. A string representing the
- * Term value in decimal notation. If the given sort is a real, then the
+ * Create a Term of a given sort.
+ * @param v A string representing the term value in decimal notation. If the given sort is a real, then the
* Term can be a rational, that is, a string of the form
- * [num]* / [num]*. The sort of the
+ * {@code [num]* / [num]*}.
+ * @param ty The sort of the
* numeral. In the current implementation, the given sort can be an int,
- * real, or bit-vectors of arbitrary size.
+ * real, or bit-vectors of arbitrary size.
*
- * @return A Term with value and sort
+ * @return A Term with value {@code v} and sort {@code ty}
**/
public Expr mkNumeral(String v, Sort ty) throws Z3Exception
{
-
checkContextMatch(ty);
return Expr.create(this,
Native.mkNumeral(nCtx(), v, ty.getNativeObject()));
@@ -1898,16 +1845,15 @@ public class Context extends IDisposable
/**
* Create a Term of a given sort. This function can be use to create
* numerals that fit in a machine integer. It is slightly faster than
- * MakeNumeral since it is not necessary to parse a string.
- * Value of the numeral Sort of the
- * numeral
+ * {@code MakeNumeral} since it is not necessary to parse a string.
*
- * @return A Term with value and type
+ * @param v Value of the numeral
+ * @param ty Sort of the numeral
+ *
+ * @return A Term with value {@code v} and type {@code ty}
**/
public Expr mkNumeral(int v, Sort ty) throws Z3Exception
{
-
checkContextMatch(ty);
return Expr.create(this, Native.mkInt(nCtx(), v, ty.getNativeObject()));
}
@@ -1915,27 +1861,28 @@ public class Context extends IDisposable
/**
* Create a Term of a given sort. This function can be use to create
* numerals that fit in a machine integer. It is slightly faster than
- * MakeNumeral since it is not necessary to parse a string.
- * Value of the numeral Sort of the
- * numeral
+ * {@code MakeNumeral} since it is not necessary to parse a string.
*
- * @return A Term with value and type
+ * @param v Value of the numeral
+ * @param ty Sort of the numeral
+ *
+ * @return A Term with value {@code v} and type {@code ty}
**/
public Expr mkNumeral(long v, Sort ty) throws Z3Exception
{
-
checkContextMatch(ty);
return Expr.create(this,
Native.mkInt64(nCtx(), v, ty.getNativeObject()));
}
/**
- * Create a real from a fraction. numerator of
- * rational. denominator of rational.
+ * Create a real from a fraction.
+ * @param num numerator of rational.
+ * @param den denominator of rational.
*
- * @return A Term with value /
- * and sort Real
+ * @return A Term with value {@code num}/{@code den}
+ * and sort Real
+ * @see mkNumeral(String,Sort)
**/
public RatNum mkReal(int num, int den) throws Z3Exception
{
@@ -1946,10 +1893,10 @@ public class Context extends IDisposable
}
/**
- * Create a real numeral. A string representing the Term
- * value in decimal notation.
+ * Create a real numeral.
+ * @param v A string representing the Term value in decimal notation.
*
- * @return A Term with value and sort Real
+ * @return A Term with value {@code v} and sort Real
**/
public RatNum mkReal(String v) throws Z3Exception
{
@@ -1959,9 +1906,10 @@ public class Context extends IDisposable
}
/**
- * Create a real numeral. value of the numeral.
+ * Create a real numeral.
+ * @param v value of the numeral.
*
- * @return A Term with value and sort Real
+ * @return A Term with value {@code v} and sort Real
**/
public RatNum mkReal(int v) throws Z3Exception
{
@@ -1971,9 +1919,10 @@ public class Context extends IDisposable
}
/**
- * Create a real numeral. value of the numeral.
+ * Create a real numeral.
+ * @param v value of the numeral.
*
- * @return A Term with value and sort Real
+ * @return A Term with value {@code v} and sort Real
**/
public RatNum mkReal(long v) throws Z3Exception
{
@@ -1983,8 +1932,8 @@ public class Context extends IDisposable
}
/**
- * Create an integer numeral. A string representing the Term
- * value in decimal notation.
+ * Create an integer numeral.
+ * @param v A string representing the Term value in decimal notation.
**/
public IntNum mkInt(String v) throws Z3Exception
{
@@ -1994,9 +1943,10 @@ public class Context extends IDisposable
}
/**
- * Create an integer numeral. value of the numeral.
+ * Create an integer numeral.
+ * @param v value of the numeral.
*
- * @return A Term with value and sort Integer
+ * @return A Term with value {@code v} and sort Integer
**/
public IntNum mkInt(int v) throws Z3Exception
{
@@ -2006,9 +1956,10 @@ public class Context extends IDisposable
}
/**
- * Create an integer numeral. value of the numeral.
+ * Create an integer numeral.
+ * @param v value of the numeral.
*
- * @return A Term with value and sort Integer
+ * @return A Term with value {@code v} and sort Integer
**/
public IntNum mkInt(long v) throws Z3Exception
{
@@ -2018,54 +1969,53 @@ public class Context extends IDisposable
}
/**
- * Create a bit-vector numeral. A string representing the
- * value in decimal notation. the size of the
- * bit-vector
+ * Create a bit-vector numeral.
+ * @param v A string representing the value in decimal notation.
+ * @param size the size of the bit-vector
**/
public BitVecNum mkBV(String v, int size) throws Z3Exception
{
-
return (BitVecNum) mkNumeral(v, mkBitVecSort(size));
}
/**
- * Create a bit-vector numeral. value of the
- * numeral. the size of the bit-vector
+ * Create a bit-vector numeral.
+ * @param v value of the numeral.
+ * @param size the size of the bit-vector
**/
public BitVecNum mkBV(int v, int size) throws Z3Exception
{
-
return (BitVecNum) mkNumeral(v, mkBitVecSort(size));
}
/**
- * Create a bit-vector numeral. value of the
- * numeral. * the size of the bit-vector
+ * Create a bit-vector numeral.
+ * @param v value of the numeral. *
+ * @param size the size of the bit-vector
**/
public BitVecNum mkBV(long v, int size) throws Z3Exception
{
-
return (BitVecNum) mkNumeral(v, mkBitVecSort(size));
}
/**
- * Create a universal Quantifier. Creates a forall formula, where
- * is the weight, is
- * an array of patterns, is an array with the sorts
- * of the bound variables, is an array with the
- * 'names' of the bound variables, and is the body
+ * Create a universal Quantifier.
+ * @param sorts the sorts of the bound variables.
+ * @param names names of the bound variables
+ * @param body the body of the quantifier.
+ * @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
+ * @param patterns array containing the patterns created using {@code MkPattern}.
+ * @param noPatterns array containing the anti-patterns created using {@code MkPattern}.
+ * @param quantifierID optional symbol to track quantifier.
+ * @param skolemID optional symbol to track skolem constants.
+ *
+ * Remarks: Creates a forall formula, where
+ * {@code weight"/> is the weight, the sorts of the bound variables. names of the bound variables the
- * body of the quantifier. quantifiers are
- * associated with weights indicating the importance of using the quantifier
- * during instantiation. By default, pass the weight 0. array containing the patterns created using
- * MkPattern. array containing
- * the anti-patterns created using MkPattern. optional symbol to track quantifier. optional symbol to track skolem constants.
+ * importance of using the quantifier during instantiation.
**/
public Quantifier mkForall(Sort[] sorts, Symbol[] names, Expr body,
int weight, Pattern[] patterns, Expr[] noPatterns,
@@ -2089,8 +2039,8 @@ public class Context extends IDisposable
}
/**
- * Create an existential Quantifier.
+ * Create an existential Quantifier.
+ * @see mkForall(Sort[],Symbol[],Expr,int,Pattern[],Expr[],Symbol,Symbol)
**/
public Quantifier mkExists(Sort[] sorts, Symbol[] names, Expr body,
int weight, Pattern[] patterns, Expr[] noPatterns,
@@ -2147,15 +2097,18 @@ public class Context extends IDisposable
}
/**
- * Selects the format used for pretty-printing expressions. The
+ * Selects the format used for pretty-printing expressions.
+ * Remarks: The
* default mode for pretty printing expressions is to produce SMT-LIB style
* output where common subexpressions are printed at each occurrence. The
* mode is called Z3_PRINT_SMTLIB_FULL. To print shared common
* subexpressions only once, use the Z3_PRINT_LOW_LEVEL mode. To print in
* way that conforms to SMT-LIB standards and uses let expressions to share
- * common sub-expressions use Z3_PRINT_SMTLIB_COMPLIANT.
+ * common sub-expressions use Z3_PRINT_SMTLIB_COMPLIANT.
+ * @see AST#toString
+ * @see Pattern#toString
+ * @see FuncDecl#toString
+ * @see Sort#toString
**/
public void setPrintMode(Z3_ast_print_mode value) throws Z3Exception
{
@@ -2163,14 +2116,15 @@ public class Context extends IDisposable
}
/**
- * Convert a benchmark into an SMT-LIB formatted string. Name of the benchmark. The argument is optional.
- * The benchmark logic. The status string (sat, unsat, or unknown) Other attributes, such as source, difficulty or
- * category. Auxiliary
- * assumptions. Formula to be checked for
- * consistency in conjunction with assumptions.
+ * Convert a benchmark into an SMT-LIB formatted string.
+ * @param name Name of the benchmark. The argument is optional.
+ *
+ * @param logic The benchmark logic.
+ * @param status The status string (sat, unsat, or unknown)
+ * @param attributes Other attributes, such as source, difficulty or
+ * category.
+ * @param assumptions Auxiliary assumptions.
+ * @param formula Formula to be checked for consistency in conjunction with assumptions.
*
* @return A string representation of the benchmark.
**/
@@ -2185,13 +2139,13 @@ public class Context extends IDisposable
}
/**
- * Parse the given string using the SMT-LIB parser. The symbol
+ * Parse the given string using the SMT-LIB parser.
+ * Remarks: The symbol
* table of the parser can be initialized using the given sorts and
- * declarations. The symbols in the arrays and
- * don't need to match the names of the sorts
- * and declarations in the arrays and . This is a useful feature since we can use arbitrary names
- * to reference sorts and declarations.
+ * declarations. The symbols in the arrays {@code sortNames} and
+ * {@code declNames} don't need to match the names of the sorts
+ * and declarations in the arrays {@code sorts} and {@code decls}. This is a useful feature since we can use arbitrary names
+ * to reference sorts and declarations.
**/
public void parseSMTLIBString(String str, Symbol[] sortNames, Sort[] sorts,
Symbol[] declNames, FuncDecl[] decls) throws Z3Exception
@@ -2209,8 +2163,8 @@ public class Context extends IDisposable
}
/**
- * Parse the given file using the SMT-LIB parser.
+ * Parse the given file using the SMT-LIB parser.
+ * @see parseSMTLIBString
**/
public void parseSMTLIBFile(String fileName, Symbol[] sortNames,
Sort[] sorts, Symbol[] declNames, FuncDecl[] decls)
@@ -2230,7 +2184,7 @@ public class Context extends IDisposable
/**
* The number of SMTLIB formulas parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public int getNumSMTLIBFormulas() throws Z3Exception
{
@@ -2238,8 +2192,8 @@ public class Context extends IDisposable
}
/**
- * The formulas parsed by the last call to ParseSMTLIBString or
- * ParseSMTLIBFile.
+ * The formulas parsed by the last call to {@code ParseSMTLIBString} or
+ * {@code ParseSMTLIBFile}.
**/
public BoolExpr[] getSMTLIBFormulas() throws Z3Exception
{
@@ -2254,7 +2208,7 @@ public class Context extends IDisposable
/**
* The number of SMTLIB assumptions parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public int getNumSMTLIBAssumptions() throws Z3Exception
{
@@ -2262,8 +2216,8 @@ public class Context extends IDisposable
}
/**
- * The assumptions parsed by the last call to ParseSMTLIBString
- * or ParseSMTLIBFile.
+ * The assumptions parsed by the last call to {@code ParseSMTLIBString}
+ * or {@code ParseSMTLIBFile}.
**/
public BoolExpr[] getSMTLIBAssumptions() throws Z3Exception
{
@@ -2278,7 +2232,7 @@ public class Context extends IDisposable
/**
* The number of SMTLIB declarations parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public int getNumSMTLIBDecls() throws Z3Exception
{
@@ -2287,7 +2241,7 @@ public class Context extends IDisposable
/**
* The declarations parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public FuncDecl[] getSMTLIBDecls() throws Z3Exception
{
@@ -2301,7 +2255,7 @@ public class Context extends IDisposable
/**
* The number of SMTLIB sorts parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public int getNumSMTLIBSorts() throws Z3Exception
{
@@ -2310,7 +2264,7 @@ public class Context extends IDisposable
/**
* The declarations parsed by the last call to
- * ParseSMTLIBString or ParseSMTLIBFile.
+ * {@code ParseSMTLIBString} or {@code ParseSMTLIBFile}.
**/
public Sort[] getSMTLIBSorts() throws Z3Exception
{
@@ -2323,8 +2277,8 @@ public class Context extends IDisposable
}
/**
- * Parse the given string using the SMT-LIB2 parser.
+ * Parse the given string using the SMT-LIB2 parser.
+ * @see parseSMTLIBString
*
* @return A conjunction of assertions in the scope (up to push/pop) at the
* end of the string.
@@ -2347,8 +2301,8 @@ public class Context extends IDisposable
}
/**
- * Parse the given file using the SMT-LIB2 parser.
+ * Parse the given file using the SMT-LIB2 parser.
+ * @see parseSMTLIB2String
**/
public BoolExpr parseSMTLIB2File(String fileName, Symbol[] sortNames,
Sort[] sorts, Symbol[] declNames, FuncDecl[] decls)
@@ -2369,18 +2323,18 @@ public class Context extends IDisposable
}
/**
- * Creates a new Goal. Note that the Context must have been
- * created with proof generation support if is set
- * to true here. Indicates whether model
- * generation should be enabled. Indicates
- * whether unsat core generation should be enabled. Indicates whether proof generation should be
- * enabled.
+ * Creates a new Goal.
+ * Remarks: Note that the Context must have been
+ * created with proof generation support if {@code proofs} is set
+ * to true here.
+ * @param models Indicates whether model generation should be enabled.
+ * @param unsatCores Indicates whether unsat core generation should be enabled.
+ * @param proofs Indicates whether proof generation should be
+ * enabled.
**/
public Goal mkGoal(boolean models, boolean unsatCores, boolean proofs)
throws Z3Exception
{
-
return new Goal(this, models, unsatCores, proofs);
}
@@ -2389,7 +2343,6 @@ public class Context extends IDisposable
**/
public Params mkParams() throws Z3Exception
{
-
return new Params(this);
}
@@ -2420,7 +2373,6 @@ public class Context extends IDisposable
**/
public String getTacticDescription(String name) throws Z3Exception
{
-
return Native.tacticGetDescr(nCtx(), name);
}
@@ -2429,13 +2381,12 @@ public class Context extends IDisposable
**/
public Tactic mkTactic(String name) throws Z3Exception
{
-
return new Tactic(this, name);
}
/**
- * Create a tactic that applies to a Goal and then
- * to every subgoal produced by .
+ * Create a tactic that applies {@code t1} to a Goal and then
+ * {@code t2"/> to every subgoal produced by to a Goal and then
- * to every subgoal produced by .
- * Shorthand for AndThen.
+ * Create a tactic that applies {@code t1} to a Goal and then
+ * {@code t2"/> to every subgoal produced by to a Goal and if
- * it fails then returns the result of applied to the
+ * Create a tactic that first applies {@code t1} to a Goal and if
+ * it fails then returns the result of {@code t2} applied to the
* Goal.
**/
public Tactic orElse(Tactic t1, Tactic t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new Tactic(this, Native.tacticOrElse(nCtx(),
@@ -2487,28 +2438,26 @@ public class Context extends IDisposable
}
/**
- * Create a tactic that applies to a goal for milliseconds. If does not
- * terminate within milliseconds, then it fails.
- *
+ * Create a tactic that applies {@code t} to a goal for {@code ms} milliseconds.
+ * Remarks: If {@code t} does not
+ * terminate within {@code ms} milliseconds, then it fails.
+ *
**/
public Tactic tryFor(Tactic t, int ms) throws Z3Exception
{
-
checkContextMatch(t);
return new Tactic(this, Native.tacticTryFor(nCtx(),
t.getNativeObject(), ms));
}
/**
- * Create a tactic that applies to a given goal if the
- * probe evaluates to true. If evaluates to false, then the new tactic behaves like the
- * skip tactic.
+ * Create a tactic that applies {@code t} to a given goal if the
+ * probe {@code p} evaluates to true.
+ * Remarks: If {@code p} evaluates to false, then the new tactic behaves like the
+ * {@code skip} tactic.
**/
public Tactic when(Probe p, Tactic t) throws Z3Exception
{
-
checkContextMatch(t);
checkContextMatch(p);
return new Tactic(this, Native.tacticWhen(nCtx(), p.getNativeObject(),
@@ -2516,13 +2465,12 @@ public class Context extends IDisposable
}
/**
- * Create a tactic that applies to a given goal if the
- * probe evaluates to true and
+ * Create a tactic that applies {@code t1} to a given goal if the
+ * probe {@code p"/> evaluates to true and until the goal
- * is not modified anymore or the maximum number of iterations is reached.
+ * Create a tactic that keeps applying {@code t} until the goal
+ * is not modified anymore or the maximum number of iterations {@code max} is reached.
**/
public Tactic repeat(Tactic t, int max) throws Z3Exception
{
-
checkContextMatch(t);
return new Tactic(this, Native.tacticRepeat(nCtx(),
t.getNativeObject(), max));
@@ -2548,7 +2494,6 @@ public class Context extends IDisposable
**/
public Tactic skip() throws Z3Exception
{
-
return new Tactic(this, Native.tacticSkip(nCtx()));
}
@@ -2557,17 +2502,15 @@ public class Context extends IDisposable
**/
public Tactic fail() throws Z3Exception
{
-
return new Tactic(this, Native.tacticFail(nCtx()));
}
/**
- * Create a tactic that fails if the probe evaluates to
+ * Create a tactic that fails if the probe {@code p} evaluates to
* false.
**/
public Tactic failIf(Probe p) throws Z3Exception
{
-
checkContextMatch(p);
return new Tactic(this,
Native.tacticFailIf(nCtx(), p.getNativeObject()));
@@ -2583,8 +2526,8 @@ public class Context extends IDisposable
}
/**
- * Create a tactic that applies using the given set of
- * parameters .
+ * Create a tactic that applies {@code t} using the given set of
+ * parameters {@code p}.
**/
public Tactic usingParams(Tactic t, Params p) throws Z3Exception
{
@@ -2595,9 +2538,10 @@ public class Context extends IDisposable
}
/**
- * Create a tactic that applies using the given set of
- * parameters . Alias for
- * UsingParams
+ * Create a tactic that applies {@code t} using the given set of
+ * parameters {@code p}.
+ * Remarks: Alias for
+ * {@code UsingParams}
**/
public Tactic with(Tactic t, Params p) throws Z3Exception
{
@@ -2615,13 +2559,11 @@ public class Context extends IDisposable
}
/**
- * Create a tactic that applies to a given goal and
- * then to every subgoal produced by . The subgoals are processed in parallel.
+ * Create a tactic that applies {@code t1} to a given goal and
+ * then {@code t2} to every subgoal produced by {@code t1}. The subgoals are processed in parallel.
**/
public Tactic parAndThen(Tactic t1, Tactic t2) throws Z3Exception
{
-
checkContextMatch(t1);
checkContextMatch(t2);
return new Tactic(this, Native.tacticParAndThen(nCtx(),
@@ -2629,8 +2571,9 @@ public class Context extends IDisposable
}
/**
- * Interrupt the execution of a Z3 procedure. This procedure can be
- * used to interrupt: solvers, simplifiers and tactics.
+ * Interrupt the execution of a Z3 procedure.
+ * Remarks: This procedure can be
+ * used to interrupt: solvers, simplifiers and tactics.
**/
public void interrupt() throws Z3Exception
{
@@ -2676,7 +2619,7 @@ public class Context extends IDisposable
}
/**
- * Create a probe that always evaluates to .
+ * Create a probe that always evaluates to {@code val}.
**/
public Probe constProbe(double val) throws Z3Exception
{
@@ -2685,12 +2628,10 @@ public class Context extends IDisposable
/**
* Create a probe that evaluates to "true" when the value returned by
- * is less than the value returned by
+ * {@code p1} is less than the value returned by {@code p2}
**/
public Probe lt(Probe p1, Probe p2) throws Z3Exception
{
-
checkContextMatch(p1);
checkContextMatch(p2);
return new Probe(this, Native.probeLt(nCtx(), p1.getNativeObject(),
@@ -2699,12 +2640,10 @@ public class Context extends IDisposable
/**
* Create a probe that evaluates to "true" when the value returned by
- * is greater than the value returned by
+ * {@code p1} is greater than the value returned by {@code p2}
**/
public Probe gt(Probe p1, Probe p2) throws Z3Exception
{
-
checkContextMatch(p1);
checkContextMatch(p2);
return new Probe(this, Native.probeGt(nCtx(), p1.getNativeObject(),
@@ -2713,12 +2652,11 @@ public class Context extends IDisposable
/**
* Create a probe that evaluates to "true" when the value returned by
- * is less than or equal the value returned by
- *
+ * {@code p1} is less than or equal the value returned by
+ * {@code p2}
**/
public Probe le(Probe p1, Probe p2) throws Z3Exception
{
-
checkContextMatch(p1);
checkContextMatch(p2);
return new Probe(this, Native.probeLe(nCtx(), p1.getNativeObject(),
@@ -2727,8 +2665,8 @@ public class Context extends IDisposable
/**
* Create a probe that evaluates to "true" when the value returned by
- * is greater than or equal the value returned by
- *
+ * {@code p1} is greater than or equal the value returned by
+ * {@code p2}
**/
public Probe ge(Probe p1, Probe p2) throws Z3Exception
{
@@ -2740,8 +2678,7 @@ public class Context extends IDisposable
/**
* Create a probe that evaluates to "true" when the value returned by
- * is equal to the value returned by
+ * {@code p1} is equal to the value returned by {@code p2}
**/
public Probe eq(Probe p1, Probe p2) throws Z3Exception
{
@@ -2752,8 +2689,7 @@ public class Context extends IDisposable
}
/**
- * Create a probe that evaluates to "true" when the value and evaluate to "true".
+ * Create a probe that evaluates to "true" when the value {@code p1} and {@code p2} evaluate to "true".
**/
public Probe and(Probe p1, Probe p2) throws Z3Exception
{
@@ -2764,8 +2700,7 @@ public class Context extends IDisposable
}
/**
- * Create a probe that evaluates to "true" when the value or evaluate to "true".
+ * Create a probe that evaluates to "true" when the value {@code p1} or {@code p2} evaluate to "true".
**/
public Probe or(Probe p1, Probe p2) throws Z3Exception
{
@@ -2776,21 +2711,20 @@ public class Context extends IDisposable
}
/**
- * Create a probe that evaluates to "true" when the value does not evaluate to "true".
+ * Create a probe that evaluates to "true" when the value {@code p} does not evaluate to "true".
**/
public Probe not(Probe p) throws Z3Exception
{
-
checkContextMatch(p);
return new Probe(this, Native.probeNot(nCtx(), p.getNativeObject()));
}
/**
- * Creates a new (incremental) solver. This solver also uses a set
+ * Creates a new (incremental) solver.
+ * Remarks: This solver also uses a set
* of builtin tactics for handling the first check-sat command, and
* check-sat commands that take more than a given number of milliseconds to
- * be solved.
+ * be solved.
**/
public Solver mkSolver() throws Z3Exception
{
@@ -2798,10 +2732,11 @@ public class Context extends IDisposable
}
/**
- * Creates a new (incremental) solver. This solver also uses a set
+ * Creates a new (incremental) solver.
+ * Remarks: This solver also uses a set
* of builtin tactics for handling the first check-sat command, and
* check-sat commands that take more than a given number of milliseconds to
- * be solved.
+ * be solved.
**/
public Solver mkSolver(Symbol logic) throws Z3Exception
{
@@ -2814,11 +2749,11 @@ public class Context extends IDisposable
}
/**
- * Creates a new (incremental) solver.
+ * Creates a new (incremental) solver.
+ * @see mkSolver(Symbol)
**/
public Solver mkSolver(String logic) throws Z3Exception
{
-
return mkSolver(mkSymbol(logic));
}
@@ -2827,14 +2762,14 @@ public class Context extends IDisposable
**/
public Solver mkSimpleSolver() throws Z3Exception
{
-
return new Solver(this, Native.mkSimpleSolver(nCtx()));
}
/**
- * Creates a solver that is implemented using the given tactic.
- * The solver supports the commands Push and Pop,
- * but it will always solve each check from scratch.
+ * Creates a solver that is implemented using the given tactic.
+ * Remarks:
+ * The solver supports the commands {@code Push} and {@code Pop},
+ * but it will always solve each check from scratch.
**/
public Solver mkSolver(Tactic t) throws Z3Exception
{
@@ -2848,33 +2783,807 @@ public class Context extends IDisposable
**/
public Fixedpoint mkFixedpoint() throws Z3Exception
{
-
return new Fixedpoint(this);
}
+
/**
- * Wraps an AST. This function is used for transitions between
- * native and managed objects. Note that
- * must be a native object obtained from Z3 (e.g., through ) and that it must have a correct reference count (see
- * e.g., . The native pointer to
- * wrap.
+ * Create the floating-point RoundingMode sort.
+ * @throws Z3Exception
+ **/
+ public FPRMSort mkFPRoundingModeSort() throws Z3Exception
+ {
+ return new FPRMSort(this);
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMExpr mkFPRoundNearestTiesToEven() throws Z3Exception
+ {
+ return new FPRMExpr(this, Native.mkFpaRoundNearestTiesToEven(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRNE() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRne(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRoundNearestTiesToAway() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRoundNearestTiesToAway(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRNA() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRna(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRoundTowardPositive() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRoundTowardPositive(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRTP() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRtp(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRoundTowardNegative() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRoundTowardNegative(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRTN() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRtn(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRoundTowardZero() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRoundTowardZero(nCtx()));
+ }
+
+ /**
+ * Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode.
+ * @throws Z3Exception
+ **/
+ public FPRMNum mkFPRTZ() throws Z3Exception
+ {
+ return new FPRMNum(this, Native.mkFpaRtz(nCtx()));
+ }
+
+ /**
+ * Create a FloatingPoint sort.
+ * @param ebits exponent bits in the FloatingPoint sort.
+ * @param sbits significand bits in the FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSort(int ebits, int sbits) throws Z3Exception
+ {
+ return new FPSort(this, ebits, sbits);
+ }
+
+ /**
+ * Create the half-precision (16-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSortHalf() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSortHalf(nCtx()));
+ }
+
+ /**
+ * Create the half-precision (16-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSort16() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSort16(nCtx()));
+ }
+
+ /**
+ * Create the single-precision (32-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSortSingle() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSortSingle(nCtx()));
+ }
+
+ /**
+ * Create the single-precision (32-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSort32() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSort32(nCtx()));
+ }
+
+ /**
+ * Create the double-precision (64-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSortDouble() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSortDouble(nCtx()));
+ }
+
+ /**
+ * Create the double-precision (64-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSort64() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSort64(nCtx()));
+ }
+
+ /**
+ * Create the quadruple-precision (128-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSortQuadruple() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSortQuadruple(nCtx()));
+ }
+
+ /**
+ * Create the quadruple-precision (128-bit) FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPSort mkFPSort128() throws Z3Exception
+ {
+ return new FPSort(this, Native.mkFpaSort128(nCtx()));
+ }
+
+
+ /**
+ * Create a NaN of sort s.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNaN(FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNan(nCtx(), s.getNativeObject()));
+ }
+
+ /**
+ * Create a floating-point infinity of sort s.
+ * @param s FloatingPoint sort.
+ * @param negative indicates whether the result should be negative.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPInf(FPSort s, boolean negative) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaInf(nCtx(), s.getNativeObject(), negative));
+ }
+
+ /**
+ * Create a floating-point zero of sort s.
+ * @param s FloatingPoint sort.
+ * @param negative indicates whether the result should be negative.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPZero(FPSort s, boolean negative) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaZero(nCtx(), s.getNativeObject(), negative));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a float.
+ * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNumeral(float v, FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNumeralFloat(nCtx(), v, s.getNativeObject()));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a float.
+ * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNumeral(double v, FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNumeralDouble(nCtx(), v, s.getNativeObject()));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from an int.
+ * * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNumeral(int v, FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNumeralInt(nCtx(), v, s.getNativeObject()));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a sign bit and two integers.
+ * @param sgn the sign.
+ * @param sig the significand.
+ * @param exp the exponent.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNumeral(boolean sgn, int exp, int sig, FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNumeralIntUint(nCtx(), sgn, exp, sig, s.getNativeObject()));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers.
+ * @param sgn the sign.
+ * @param sig the significand.
+ * @param exp the exponent.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFPNumeral(boolean sgn, long exp, long sig, FPSort s) throws Z3Exception
+ {
+ return new FPNum(this, Native.mkFpaNumeralInt64Uint64(nCtx(), sgn, exp, sig, s.getNativeObject()));
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a float.
+ * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFP(float v, FPSort s) throws Z3Exception
+ {
+ return mkFPNumeral(v, s);
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a float.
+ * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFP(double v, FPSort s) throws Z3Exception
+ {
+ return mkFPNumeral(v, s);
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from an int.
+ * @param v numeral value.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+
+ public FPNum mkFP(int v, FPSort s) throws Z3Exception
+ {
+ return mkFPNumeral(v, s);
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a sign bit and two integers.
+ * @param sgn the sign.
+ * @param exp the exponent.
+ * @param sig the significand.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFP(boolean sgn, int exp, int sig, FPSort s) throws Z3Exception
+ {
+ return mkFPNumeral(sgn, sig, exp, s);
+ }
+
+ /**
+ * Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers.
+ * @param sgn the sign.
+ * @param exp the exponent.
+ * @param sig the significand.
+ * @param s FloatingPoint sort.
+ * @throws Z3Exception
+ **/
+ public FPNum mkFP(boolean sgn, long exp, long sig, FPSort s) throws Z3Exception
+ {
+ return mkFPNumeral(sgn, sig, exp, s);
+ }
+
+
+ /**
+ * Floating-point absolute value
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPAbs(FPExpr t) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaAbs(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Floating-point negation
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPNeg(FPExpr t) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaNeg(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Floating-point addition
+ * @param rm rounding mode term
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPAdd(FPRMExpr rm, FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaAdd(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point subtraction
+ * @param rm rounding mode term
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPSub(FPRMExpr rm, FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaSub(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point multiplication
+ * @param rm rounding mode term
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPMul(FPRMExpr rm, FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaMul(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point division
+ * @param rm rounding mode term
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPDiv(FPRMExpr rm, FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaDiv(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point fused multiply-add
+ * @param rm rounding mode term
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @param t3">floating-point term
+ * Remarks:
+ * The result is round((t1 * t2) + t3)
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPFMA(FPRMExpr rm, FPExpr t1, FPExpr t2, FPExpr t3) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaFma(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject(), t3.getNativeObject()));
+ }
+
+ /**
+ * Floating-point square root
+ * @param rm rounding mode term
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPSqrt(FPRMExpr rm, FPExpr t) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaSqrt(nCtx(), rm.getNativeObject(), t.getNativeObject()));
+ }
+
+ /**
+ * Floating-point remainder
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPRem(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaRem(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point roundToIntegral. Rounds a floating-point number to
+ * the closest integer, again represented as a floating-point number.
+ * @param rm">term of RoundingMode sort
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPRoundToIntegral(FPRMExpr rm, FPExpr t) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaRoundToIntegral(nCtx(), rm.getNativeObject(), t.getNativeObject()));
+ }
+
+ /**
+ * Minimum of floating-point numbers.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPMin(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaMin(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Maximum of floating-point numbers.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPMax(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaMax(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point less than or equal.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPLEq(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaLeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point less than.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPLt(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaLt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point greater than or equal.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPGEq(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaGeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point greater than.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPGt(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaGt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Floating-point equality.
+ * @param t1 floating-point term
+ * @param t2 floating-point term
+ * Remarks:
+ * Note that this is IEEE 754 equality (as opposed to standard =).
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPEq(FPExpr t1, FPExpr t2) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaEq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a normal floating-point number.\
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsNormal(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsNormal(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a subnormal floating-point number.\
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsSubnormal(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsSubnormal(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a floating-point number with zero value, i.e., +0 or -0.
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsZero(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsZero(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a floating-point number representing +oo or -oo.
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsInfinite(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsInfinite(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a NaN.
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsNaN(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsNan(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a negative floating-point number.
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsNegative(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsNegative(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Predicate indicating whether t is a positive floating-point number.
+ * @param t floating-point term
+ * @throws Z3Exception
+ **/
+ public BoolExpr mkFPIsPositive(FPExpr t) throws Z3Exception
+ {
+ return new BoolExpr(this, Native.mkFpaIsPositive(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Create an expression of FloatingPoint sort from three bit-vector expressions.
+ * @param sgn bit-vector term (of size 1) representing the sign.
+ * @param sig bit-vector term representing the significand.
+ * @param exp bit-vector term representing the exponent.
+ * Remarks:
+ * This is the operator named `fp' in the SMT FP theory definition.
+ * Note that sgn is required to be a bit-vector of size 1. Significand and exponent
+ * are required to be greater than 1 and 2 respectively. The FloatingPoint sort
+ * of the resulting expression is automatically determined from the bit-vector sizes
+ * of the arguments.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFP(BitVecExpr sgn, BitVecExpr sig, BitVecExpr exp) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaFp(nCtx(), sgn.getNativeObject(), sig.getNativeObject(), exp.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a single IEEE 754-2008 bit-vector into a floating-point number.
+ * @param bv">bit-vector value (of size m).
+ * @param s FloatingPoint sort (ebits+sbits == m)
+ * Remarks:
+ * Produces a term that represents the conversion of a bit-vector term bv to a
+ * floating-point term of sort s. The bit-vector size of bv (m) must be equal
+ * to ebits+sbits of s. The format of the bit-vector is as defined by the
+ * IEEE 754-2008 interchange format.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPToFP(BitVecExpr bv, FPSort s) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaToFpBv(nCtx(), bv.getNativeObject(), s.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a FloatingPoint term into another term of different FloatingPoint sort.
+ * @param rm RoundingMode term.
+ * @param t FloatingPoint term.
+ * @param s FloatingPoint sort.
+ * Remarks:
+ * Produces a term that represents the conversion of a floating-point term t to a
+ * floating-point term of sort s. If necessary, the result will be rounded according
+ * to rounding mode rm.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPToFP(FPRMExpr rm, FPExpr t, FPSort s) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaToFpFloat(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a term of real sort into a term of FloatingPoint sort.
+ * @param rm RoundingMode term.
+ * @param t term of Real sort.
+ * @param s FloatingPoint sort.
+ * Remarks:
+ * Produces a term that represents the conversion of term t of real sort into a
+ * floating-point term of sort s. If necessary, the result will be rounded according
+ * to rounding mode rm.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPToFP(FPRMExpr rm, RealExpr t, FPSort s) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaToFpReal(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort.
+ * @param rm RoundingMode term.
+ * @param t term of bit-vector sort.
+ * @param s FloatingPoint sort.
+ * @param signed flag indicating whether t is interpreted as signed or unsigned bit-vector.
+ * Remarks:
+ * Produces a term that represents the conversion of the bit-vector term t into a
+ * floating-point term of sort s. The bit-vector t is taken to be in signed
+ * 2's complement format (when signed==true, otherwise unsigned). If necessary, the
+ * result will be rounded according to rounding mode rm.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPToFP(FPRMExpr rm, BitVecExpr t, FPSort s, boolean signed) throws Z3Exception
+ {
+ if (signed)
+ return new FPExpr(this, Native.mkFpaToFpSigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
+ else
+ return new FPExpr(this, Native.mkFpaToFpUnsigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a floating-point number to another FloatingPoint sort s.
+ * @param s FloatingPoint sort
+ * @param rm floating-point rounding mode term
+ * @param t floating-point term
+ * Remarks:
+ * Produces a term that represents the conversion of a floating-point term t to a different
+ * FloatingPoint sort s. If necessary, rounding according to rm is applied.
+ * @throws Z3Exception
+ **/
+ public FPExpr mkFPToFP(FPSort s, FPRMExpr rm, FPExpr t) throws Z3Exception
+ {
+ return new FPExpr(this, Native.mkFpaToFpFloat(nCtx(), s.getNativeObject(), rm.getNativeObject(), t.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a floating-point term into a bit-vector.
+ * @param rm RoundingMode term.
+ * @param t FloatingPoint term
+ * @param sz Size of the resulting bit-vector.
+ * @param signed Indicates whether the result is a signed or unsigned bit-vector.
+ * Remarks:
+ * Produces a term that represents the conversion of the floating-poiunt term t into a
+ * bit-vector term of size sz in 2's complement format (signed when signed==true). If necessary,
+ * the result will be rounded according to rounding mode rm.
+ * @throws Z3Exception
+ **/
+ public BitVecExpr mkFPToBV(FPRMExpr rm, FPExpr t, int sz, boolean signed) throws Z3Exception
+ {
+ if (signed)
+ return new BitVecExpr(this, Native.mkFpaToSbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
+ else
+ return new BitVecExpr(this, Native.mkFpaToUbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
+ }
+
+ /**
+ * Conversion of a floating-point term into a real-numbered term.
+ * @param t FloatingPoint term
+ * Remarks:
+ * Produces a term that represents the conversion of the floating-poiunt term t into a
+ * real number. Note that this type of conversion will often result in non-linear
+ * constraints over real terms.
+ * @throws Z3Exception
+ **/
+ public RealExpr mkFPToReal(FPExpr t) throws Z3Exception
+ {
+ return new RealExpr(this, Native.mkFpaToReal(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format.
+ * @param t FloatingPoint term.
+ * Remarks:
+ * The size of the resulting bit-vector is automatically determined. Note that
+ * IEEE 754-2008 allows multiple different representations of NaN. This conversion
+ * knows only one NaN and it will always produce the same bit-vector represenatation of
+ * that NaN.
+ * @throws Z3Exception
+ **/
+ public BitVecExpr mkFPToIEEEBV(FPExpr t) throws Z3Exception
+ {
+ return new BitVecExpr(this, Native.mkFpaToIeeeBv(nCtx(), t.getNativeObject()));
+ }
+
+ /**
+ * Conversion of a real-sorted significand and an integer-sorted exponent into a term of FloatingPoint sort.
+ * @param rm RoundingMode term.
+ * @param exp Exponent term of Int sort.
+ * @param sig Significand term of Real sort.
+ * @param s FloatingPoint sort.
+ * Remarks:
+ * Produces a term that represents the conversion of sig * 2^exp into a
+ * floating-point term of sort s. If necessary, the result will be rounded
+ * according to rounding mode rm.
+ * @throws Z3Exception
+ **/
+
+ public BitVecExpr mkFPToFP(FPRMExpr rm, IntExpr exp, RealExpr sig, FPSort s) throws Z3Exception
+ {
+ return new BitVecExpr(this, Native.mkFpaToFpIntReal(nCtx(), rm.getNativeObject(), exp.getNativeObject(), sig.getNativeObject(), s.getNativeObject()));
+ }
+
+
+ /**
+ * Wraps an AST.
+ * Remarks: This function is used for transitions between
+ * native and managed objects. Note that {@code nativeObject}
+ * must be a native object obtained from Z3 (e.g., through
+ * {@code UnwrapAST}) and that it must have a correct reference count.
+ * @see Native#incRef
+ * @see unwrapAST
+ * @param nativeObject The native pointer to wrap.
**/
public AST wrapAST(long nativeObject) throws Z3Exception
{
-
return AST.create(this, nativeObject);
}
/**
- * Unwraps an AST. This function is used for transitions between
+ * Unwraps an AST.
+ * Remarks: This function is used for transitions between
* native and managed objects. It returns the native pointer to the AST.
* Note that AST objects are reference counted and unwrapping an AST
* disables automatic reference counting, i.e., all references to the IntPtr
* that is returned must be handled externally and through native calls (see
- * e.g., ). The AST to unwrap.
+ * e.g.,
+ * @see Native#incRef
+ * @see wrapAST
+ * @param a The AST to unwrap.
**/
public long unwrapAST(AST a)
{
@@ -2883,11 +3592,10 @@ public class Context extends IDisposable
/**
* Return a string describing all available parameters to
- * Expr.Simplify.
+ * {@code Expr.Simplify}.
**/
public String SimplifyHelp() throws Z3Exception
{
-
return Native.simplifyGetHelp(nCtx());
}
@@ -2900,9 +3608,10 @@ public class Context extends IDisposable
}
/**
- * Enable/disable printing of warning messages to the console. Note
+ * Enable/disable printing of warning messages to the console.
+ * Remarks: Note
* that this function is static and effects the behaviour of all contexts
- * globally.
+ * globally.
**/
public static void ToggleWarningMessages(boolean enabled)
throws Z3Exception
@@ -2911,11 +3620,12 @@ public class Context extends IDisposable
}
/**
- * Update a mutable configuration parameter. The list of all
+ * Update a mutable configuration parameter.
+ * Remarks: The list of all
* configuration parameters can be obtained using the Z3 executable:
- * z3.exe -ini? Only a few configuration parameters are mutable
+ * {@code z3.exe -ini?} Only a few configuration parameters are mutable
* once the context is created. An exception is thrown when trying to modify
- * an immutable parameter.
+ * an immutable parameter.
**/
public void updateParamValue(String id, String value) throws Z3Exception
{
diff --git a/src/api/java/DatatypeExpr.java b/src/api/java/DatatypeExpr.java
index 806ceacab..c0f247b7a 100644
--- a/src/api/java/DatatypeExpr.java
+++ b/src/api/java/DatatypeExpr.java
@@ -23,13 +23,8 @@ package com.microsoft.z3;
public class DatatypeExpr extends Expr
{
/**
- * Constructor for DatatypeExpr
+ * Constructor for DatatypeExpr
**/
- protected DatatypeExpr(Context ctx)
- {
- super(ctx);
- }
-
DatatypeExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/DatatypeSort.java b/src/api/java/DatatypeSort.java
index 9c339d932..4a31b6c38 100644
--- a/src/api/java/DatatypeSort.java
+++ b/src/api/java/DatatypeSort.java
@@ -24,6 +24,8 @@ public class DatatypeSort extends Sort
{
/**
* The number of constructors of the datatype sort.
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getNumConstructors() throws Z3Exception
{
@@ -35,6 +37,7 @@ public class DatatypeSort extends Sort
* The constructors.
*
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl[] getConstructors() throws Z3Exception
{
@@ -50,6 +53,7 @@ public class DatatypeSort extends Sort
* The recognizers.
*
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl[] getRecognizers() throws Z3Exception
{
@@ -65,6 +69,7 @@ public class DatatypeSort extends Sort
* The constructor accessors.
*
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public FuncDecl[][] getAccessors() throws Z3Exception
{
diff --git a/src/api/java/EnumSort.java b/src/api/java/EnumSort.java
index 9715b9a97..06e1ade73 100644
--- a/src/api/java/EnumSort.java
+++ b/src/api/java/EnumSort.java
@@ -24,6 +24,7 @@ public class EnumSort extends Sort
{
/**
* The function declarations of the constants in the enumeration.
+ * @throws Z3Exception on error
**/
public FuncDecl[] getConstDecls() throws Z3Exception
{
@@ -36,6 +37,8 @@ public class EnumSort extends Sort
/**
* The constants in the enumeration.
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr[] getConsts() throws Z3Exception
{
@@ -48,6 +51,7 @@ public class EnumSort extends Sort
/**
* The test predicates for the constants in the enumeration.
+ * @throws Z3Exception on error
**/
public FuncDecl[] getTesterDecls() throws Z3Exception
{
@@ -60,7 +64,7 @@ public class EnumSort extends Sort
EnumSort(Context ctx, Symbol name, Symbol[] enumNames) throws Z3Exception
{
- super(ctx);
+ super(ctx, 0);
int n = enumNames.length;
long[] n_constdecls = new long[n];
diff --git a/src/api/java/Expr.java b/src/api/java/Expr.java
index a4c669dad..762a4b672 100644
--- a/src/api/java/Expr.java
+++ b/src/api/java/Expr.java
@@ -31,6 +31,9 @@ public class Expr extends AST
{
/**
* Returns a simplified version of the expression
+ * @return Expr
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr simplify() throws Z3Exception
{
@@ -40,8 +43,12 @@ public class Expr extends AST
/**
* Returns a simplified version of the expression
* A set of
- * parameters a Params object to configure the simplifier
- *
+ * parameters
+ * @param p a Params object to configure the simplifier
+ * @see Context#SimplifyHelp
+ * @return an Expr
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr simplify(Params p) throws Z3Exception
{
@@ -59,6 +66,8 @@ public class Expr extends AST
/**
* The function declaration of the function that is applied in this
* expression.
+ * @return a FuncDecl
+ * @throws Z3Exception on error
**/
public FuncDecl getFuncDecl() throws Z3Exception
{
@@ -69,6 +78,8 @@ public class Expr extends AST
/**
* Indicates whether the expression is the true or false expression or
* something else (Z3_L_UNDEF).
+ * @throws Z3Exception on error
+ * @return a Z3_lbool
**/
public Z3_lbool getBoolValue() throws Z3Exception
{
@@ -78,6 +89,8 @@ public class Expr extends AST
/**
* The number of arguments of the expression.
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getNumArgs() throws Z3Exception
{
@@ -86,6 +99,8 @@ public class Expr extends AST
/**
* The arguments of the expression.
+ * @throws Z3Exception on error
+ * @return an Expr[]
**/
public Expr[] getArgs() throws Z3Exception
{
@@ -98,9 +113,11 @@ public class Expr extends AST
}
/**
- * Update the arguments of the expression using the arguments The number of new arguments should coincide with the
+ * Update the arguments of the expression using the arguments {@code args}
+ * The number of new arguments should coincide with the
* current number of arguments.
+ * @param args arguments
+ * @throws Z3Exception on error
**/
public void update(Expr[] args) throws Z3Exception
{
@@ -112,13 +129,16 @@ public class Expr extends AST
}
/**
- * Substitute every occurrence of from[i] in the expression
- * with to[i], for i smaller than
- * num_exprs. The result is the new expression. The
- * arrays from and to must have size
- * num_exprs. For every i smaller than
- * num_exprs, we must have that sort of from[i]
- * must be equal to sort of to[i].
+ * Substitute every occurrence of {@code from[i]} in the expression
+ * with {@code to[i]}, for {@code i} smaller than
+ * {@code num_exprs}.
+ * Remarks: The result is the new expression. The
+ * arrays {@code from} and {@code to} must have size
+ * {@code num_exprs}. For every {@code i} smaller than
+ * {@code num_exprs}, we must have that sort of {@code from[i]}
+ * must be equal to sort of {@code to[i]}.
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr substitute(Expr[] from, Expr[] to) throws Z3Exception
{
@@ -132,8 +152,11 @@ public class Expr extends AST
}
/**
- * Substitute every occurrence of from in the expression with
- * to.
+ * Substitute every occurrence of {@code from} in the expression with
+ * {@code to}.
+ * @see Expr#substitute(Expr[],Expr[])
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr substitute(Expr from, Expr to) throws Z3Exception
{
@@ -143,9 +166,13 @@ public class Expr extends AST
/**
* Substitute the free variables in the expression with the expressions in
- * For every i smaller than
- * num_exprs, the variable with de-Bruijn index i
- * is replaced with term to[i].
+ * {@code to}
+ * Remarks: For every {@code i} smaller than * {@code num_exprs}, the
+ * variable with de-Bruijn index {@code i} * is replaced with term
+ * {@code to[i]}.
+ * @throws Z3Exception on error
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr substituteVars(Expr[] to) throws Z3Exception
{
@@ -156,11 +183,13 @@ public class Expr extends AST
}
/**
- * Translates (copies) the term to the Context .
- * A context
+ * Translates (copies) the term to the Context {@code ctx}.
*
- * @return A copy of the term which is associated with
+ * @param ctx A context
+ *
+ * @return A copy of the term which is associated with {@code ctx}
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr translate(Context ctx) throws Z3Exception
{
@@ -184,6 +213,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a numeral
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isNumeral() throws Z3Exception
{
@@ -194,6 +225,8 @@ public class Expr extends AST
* Indicates whether the term is well-sorted.
*
* @return True if the term is well-sorted, false otherwise.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isWellSorted() throws Z3Exception
{
@@ -202,6 +235,8 @@ public class Expr extends AST
/**
* The Sort of the term.
+ * @throws Z3Exception on error
+ * @return a sort
**/
public Sort getSort() throws Z3Exception
{
@@ -211,6 +246,8 @@ public class Expr extends AST
/**
* Indicates whether the term represents a constant.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isConst() throws Z3Exception
{
@@ -219,6 +256,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an integer numeral.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIntNum() throws Z3Exception
{
@@ -227,6 +266,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a real numeral.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRatNum() throws Z3Exception
{
@@ -235,6 +276,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an algebraic number
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isAlgebraicNumber() throws Z3Exception
{
@@ -243,6 +286,8 @@ public class Expr extends AST
/**
* Indicates whether the term has Boolean sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBool() throws Z3Exception
{
@@ -253,6 +298,8 @@ public class Expr extends AST
/**
* Indicates whether the term is the constant true.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isTrue() throws Z3Exception
{
@@ -261,6 +308,8 @@ public class Expr extends AST
/**
* Indicates whether the term is the constant false.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isFalse() throws Z3Exception
{
@@ -269,6 +318,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an equality predicate.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isEq() throws Z3Exception
{
@@ -278,6 +329,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an n-ary distinct predicate (every argument
* is mutually distinct).
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isDistinct() throws Z3Exception
{
@@ -286,6 +339,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a ternary if-then-else term
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isITE() throws Z3Exception
{
@@ -294,6 +349,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an n-ary conjunction
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isAnd() throws Z3Exception
{
@@ -302,6 +359,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an n-ary disjunction
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isOr() throws Z3Exception
{
@@ -311,6 +370,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an if-and-only-if (Boolean equivalence,
* binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIff() throws Z3Exception
{
@@ -319,6 +380,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an exclusive or
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isXor() throws Z3Exception
{
@@ -327,6 +390,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a negation
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isNot() throws Z3Exception
{
@@ -335,6 +400,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an implication
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isImplies() throws Z3Exception
{
@@ -343,6 +410,8 @@ public class Expr extends AST
/**
* Indicates whether the term is of integer sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isInt() throws Z3Exception
{
@@ -354,6 +423,8 @@ public class Expr extends AST
/**
* Indicates whether the term is of sort real.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isReal() throws Z3Exception
{
@@ -364,6 +435,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an arithmetic numeral.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isArithmeticNumeral() throws Z3Exception
{
@@ -372,6 +445,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a less-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isLE() throws Z3Exception
{
@@ -380,6 +455,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a greater-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isGE() throws Z3Exception
{
@@ -388,6 +465,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a less-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isLT() throws Z3Exception
{
@@ -396,6 +475,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a greater-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isGT() throws Z3Exception
{
@@ -404,6 +485,8 @@ public class Expr extends AST
/**
* Indicates whether the term is addition (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isAdd() throws Z3Exception
{
@@ -412,6 +495,8 @@ public class Expr extends AST
/**
* Indicates whether the term is subtraction (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSub() throws Z3Exception
{
@@ -420,6 +505,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a unary minus
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isUMinus() throws Z3Exception
{
@@ -428,6 +515,8 @@ public class Expr extends AST
/**
* Indicates whether the term is multiplication (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isMul() throws Z3Exception
{
@@ -436,6 +525,8 @@ public class Expr extends AST
/**
* Indicates whether the term is division (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isDiv() throws Z3Exception
{
@@ -444,6 +535,8 @@ public class Expr extends AST
/**
* Indicates whether the term is integer division (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIDiv() throws Z3Exception
{
@@ -452,6 +545,8 @@ public class Expr extends AST
/**
* Indicates whether the term is remainder (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRemainder() throws Z3Exception
{
@@ -460,6 +555,8 @@ public class Expr extends AST
/**
* Indicates whether the term is modulus (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isModulus() throws Z3Exception
{
@@ -468,6 +565,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a coercion of integer to real (unary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIntToReal() throws Z3Exception
{
@@ -476,6 +575,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a coercion of real to integer (unary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRealToInt() throws Z3Exception
{
@@ -485,6 +586,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a check that tests whether a real is
* integral (unary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRealIsInt() throws Z3Exception
{
@@ -493,6 +596,8 @@ public class Expr extends AST
/**
* Indicates whether the term is of an array sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isArray() throws Z3Exception
{
@@ -502,9 +607,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is an array store. It satisfies
- * select(store(a,i,v),j) = if i = j then v else select(a,j). Array store
- * takes at least 3 arguments.
+ * Indicates whether the term is an array store.
+ * Remarks: It satisfies * select(store(a,i,v),j) = if i = j then v else select(a,j). Array store * takes at least 3 arguments.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isStore() throws Z3Exception
{
@@ -513,6 +619,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an array select.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSelect() throws Z3Exception
{
@@ -520,9 +628,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a constant array. For example,
- * select(const(v),i) = v holds for every v and i. The function is
- * unary.
+ * Indicates whether the term is a constant array.
+ * Remarks: For example, * select(const(v),i) = v holds for every v and i. The function is * unary.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isConstantArray() throws Z3Exception
{
@@ -530,8 +639,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a default array. For example
- * default(const(v)) = v. The function is unary.
+ * Indicates whether the term is a default array.
+ * Remarks: For example default(const(v)) = v. The function is unary.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isDefaultArray() throws Z3Exception
{
@@ -539,8 +650,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is an array map. It satisfies
- * map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i.
+ * Indicates whether the term is an array map.
+ * Remarks: It satisfies
+ * map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isArrayMap() throws Z3Exception
{
@@ -548,9 +662,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is an as-array term. An as-array term
- * is n array value that behaves as the function graph of the function
- * passed as parameter.
+ * Indicates whether the term is an as-array term.
+ * Remarks: An as-array term * is n array value that behaves as the function graph of the function * passed as parameter.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isAsArray() throws Z3Exception
{
@@ -559,6 +674,8 @@ public class Expr extends AST
/**
* Indicates whether the term is set union
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSetUnion() throws Z3Exception
{
@@ -567,6 +684,8 @@ public class Expr extends AST
/**
* Indicates whether the term is set intersection
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSetIntersect() throws Z3Exception
{
@@ -575,6 +694,8 @@ public class Expr extends AST
/**
* Indicates whether the term is set difference
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSetDifference() throws Z3Exception
{
@@ -583,6 +704,8 @@ public class Expr extends AST
/**
* Indicates whether the term is set complement
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSetComplement() throws Z3Exception
{
@@ -591,6 +714,8 @@ public class Expr extends AST
/**
* Indicates whether the term is set subset
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isSetSubset() throws Z3Exception
{
@@ -599,6 +724,8 @@ public class Expr extends AST
/**
* Indicates whether the terms is of bit-vector sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBV() throws Z3Exception
{
@@ -609,6 +736,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector numeral
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVNumeral() throws Z3Exception
{
@@ -617,6 +746,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a one-bit bit-vector with value one
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVBitOne() throws Z3Exception
{
@@ -625,6 +756,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a one-bit bit-vector with value zero
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVBitZero() throws Z3Exception
{
@@ -633,6 +766,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector unary minus
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVUMinus() throws Z3Exception
{
@@ -641,6 +776,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector addition (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVAdd() throws Z3Exception
{
@@ -649,6 +786,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector subtraction (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSub() throws Z3Exception
{
@@ -657,6 +796,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector multiplication (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVMul() throws Z3Exception
{
@@ -665,6 +806,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector signed division (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSDiv() throws Z3Exception
{
@@ -673,6 +816,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector unsigned division (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVUDiv() throws Z3Exception
{
@@ -681,6 +826,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector signed remainder (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSRem() throws Z3Exception
{
@@ -689,6 +836,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector unsigned remainder (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVURem() throws Z3Exception
{
@@ -697,6 +846,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector signed modulus
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSMod() throws Z3Exception
{
@@ -705,46 +856,58 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector signed division by zero
+ * @return a boolean
+ * @throws Z3Exception on error
**/
- boolean IsBVSDiv0() throws Z3Exception
+ boolean isBVSDiv0() throws Z3Exception
{
return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_BSDIV0;
}
/**
* Indicates whether the term is a bit-vector unsigned division by zero
+ * @return a boolean
+ * @throws Z3Exception on error
**/
- boolean IsBVUDiv0() throws Z3Exception
+ boolean isBVUDiv0() throws Z3Exception
{
return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_BUDIV0;
}
/**
* Indicates whether the term is a bit-vector signed remainder by zero
+ * @return a boolean
+ * @throws Z3Exception on error
**/
- boolean IsBVSRem0() throws Z3Exception
+ boolean isBVSRem0() throws Z3Exception
{
return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_BSREM0;
}
/**
* Indicates whether the term is a bit-vector unsigned remainder by zero
+ * @return a boolean
+ * @throws Z3Exception on error
**/
- boolean IsBVURem0() throws Z3Exception
+ boolean isBVURem0() throws Z3Exception
{
return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_BUREM0;
}
/**
* Indicates whether the term is a bit-vector signed modulus by zero
+ * @return a boolean
+ * @throws Z3Exception on error
**/
- boolean IsBVSMod0() throws Z3Exception
+ boolean isBVSMod0() throws Z3Exception
{
return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_BSMOD0;
}
/**
* Indicates whether the term is an unsigned bit-vector less-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVULE() throws Z3Exception
{
@@ -753,6 +916,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a signed bit-vector less-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSLE() throws Z3Exception
{
@@ -762,6 +927,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an unsigned bit-vector
* greater-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVUGE() throws Z3Exception
{
@@ -770,6 +937,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a signed bit-vector greater-than-or-equal
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSGE() throws Z3Exception
{
@@ -778,6 +947,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an unsigned bit-vector less-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVULT() throws Z3Exception
{
@@ -786,6 +957,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a signed bit-vector less-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSLT() throws Z3Exception
{
@@ -794,6 +967,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an unsigned bit-vector greater-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVUGT() throws Z3Exception
{
@@ -802,6 +977,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a signed bit-vector greater-than
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSGT() throws Z3Exception
{
@@ -810,6 +987,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise AND
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVAND() throws Z3Exception
{
@@ -818,6 +997,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise OR
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVOR() throws Z3Exception
{
@@ -826,6 +1007,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise NOT
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVNOT() throws Z3Exception
{
@@ -834,6 +1017,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise XOR
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVXOR() throws Z3Exception
{
@@ -842,6 +1027,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise NAND
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVNAND() throws Z3Exception
{
@@ -850,6 +1037,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise NOR
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVNOR() throws Z3Exception
{
@@ -858,6 +1047,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-wise XNOR
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVXNOR() throws Z3Exception
{
@@ -866,6 +1057,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector concatenation (binary)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVConcat() throws Z3Exception
{
@@ -874,6 +1067,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector sign extension
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVSignExtension() throws Z3Exception
{
@@ -882,6 +1077,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector zero extension
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVZeroExtension() throws Z3Exception
{
@@ -890,6 +1087,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector extraction
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVExtract() throws Z3Exception
{
@@ -898,6 +1097,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector repetition
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVRepeat() throws Z3Exception
{
@@ -906,6 +1107,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector reduce OR
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVReduceOR() throws Z3Exception
{
@@ -914,6 +1117,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector reduce AND
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVReduceAND() throws Z3Exception
{
@@ -922,6 +1127,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector comparison
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVComp() throws Z3Exception
{
@@ -930,6 +1137,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector shift left
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVShiftLeft() throws Z3Exception
{
@@ -938,6 +1147,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector logical shift right
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVShiftRightLogical() throws Z3Exception
{
@@ -946,6 +1157,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector arithmetic shift left
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVShiftRightArithmetic() throws Z3Exception
{
@@ -954,6 +1167,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector rotate left
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVRotateLeft() throws Z3Exception
{
@@ -962,6 +1177,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector rotate right
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVRotateRight() throws Z3Exception
{
@@ -970,8 +1187,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector rotate left (extended)
- * Similar to Z3_OP_ROTATE_LEFT, but it is a binary operator
- * instead of a parametric one.
+ * Remarks: Similar to Z3_OP_ROTATE_LEFT, but it is a binary operator
+ * instead of a parametric one.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVRotateLeftExtended() throws Z3Exception
{
@@ -980,8 +1199,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a bit-vector rotate right (extended)
- * Similar to Z3_OP_ROTATE_RIGHT, but it is a binary operator
- * instead of a parametric one.
+ * Remarks: Similar to Z3_OP_ROTATE_RIGHT, but it is a binary operator
+ * instead of a parametric one.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVRotateRightExtended() throws Z3Exception
{
@@ -990,9 +1211,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a coercion from integer to bit-vector
- * This function is not supported by the decision procedures. Only
- * the most rudimentary simplification rules are applied to this
- * function.
+ *
+ * Remarks: This function is not supported by the decision procedures. Only * the most rudimentary simplification rules are applied to this * function.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIntToBV() throws Z3Exception
{
@@ -1001,9 +1223,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a coercion from bit-vector to integer
- * This function is not supported by the decision procedures. Only
- * the most rudimentary simplification rules are applied to this
- * function.
+ *
+ * Remarks: This function is not supported by the decision procedures. Only * the most rudimentary simplification rules are applied to this * function.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVToInt() throws Z3Exception
{
@@ -1011,9 +1234,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a bit-vector carry Compute the
- * carry bit in a full-adder. The meaning is given by the equivalence (carry
- * l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3)))
+ * Indicates whether the term is a bit-vector carry
+ * Remarks: Compute the * carry bit in a full-adder. The meaning is given by the equivalence (carry * l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3)))
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVCarry() throws Z3Exception
{
@@ -1021,9 +1245,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a bit-vector ternary XOR The
- * meaning is given by the equivalence (xor3 l1 l2 l3) <=> (xor (xor
- * l1 l2) l3)
+ * Indicates whether the term is a bit-vector ternary XOR
+ * Remarks: The * meaning is given by the equivalence (xor3 l1 l2 l3) <=> (xor (xor * l1 l2) l3)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isBVXOR3() throws Z3Exception
{
@@ -1032,8 +1257,11 @@ public class Expr extends AST
/**
* Indicates whether the term is a label (used by the Boogie Verification
- * condition generator). The label has two parameters, a string and
- * a Boolean polarity. It takes one argument, a formula.
+ * condition generator).
+ * Remarks: The label has two parameters, a string and
+ * a Boolean polarity. It takes one argument, a formula.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isLabel() throws Z3Exception
{
@@ -1042,8 +1270,11 @@ public class Expr extends AST
/**
* Indicates whether the term is a label literal (used by the Boogie
- * Verification condition generator). A label literal has a set of
- * string parameters. It takes no arguments.
+ * Verification condition generator).
+ * Remarks: A label literal has a set of
+ * string parameters. It takes no arguments.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isLabelLit() throws Z3Exception
{
@@ -1052,8 +1283,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a binary equivalence modulo namings.
- * This binary predicate is used in proof terms. It captures
- * equisatisfiability and equivalence modulo renamings.
+ * Remarks: This binary predicate is used in proof terms. It captures
+ * equisatisfiability and equivalence modulo renamings.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isOEQ() throws Z3Exception
{
@@ -1062,6 +1295,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a Proof for the expression 'true'.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofTrue() throws Z3Exception
{
@@ -1070,6 +1305,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for a fact asserted by the user.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofAsserted() throws Z3Exception
{
@@ -1079,6 +1316,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for a fact (tagged as goal)
* asserted by the user.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofGoal() throws Z3Exception
{
@@ -1086,10 +1325,13 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is proof via modus ponens Given a
+ * Indicates whether the term is proof via modus ponens
+ * Remarks: Given a
* proof for p and a proof for (implies p q), produces a proof for q. T1: p
* T2: (implies p q) [mp T1 T2]: q The second antecedents may also be a
- * proof for (iff p q).
+ * proof for (iff p q).
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofModusPonens() throws Z3Exception
{
@@ -1098,10 +1340,13 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for (R t t), where R is a reflexive
- * relation. This proof object has no antecedents. The only
+ * relation.
+ * Remarks: This proof object has no antecedents. The only
* reflexive relations that are used are equivalence modulo namings,
* equality and equivalence. That is, R is either '~', '=' or
- * 'iff'.
+ * 'iff'.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofReflexivity() throws Z3Exception
{
@@ -1110,9 +1355,10 @@ public class Expr extends AST
/**
* Indicates whether the term is proof by symmetricity of a relation
- * Given an symmetric relation R and a proof for (R t s), produces
- * a proof for (R s t). T1: (R t s) [symmetry T1]: (R s t) T1 is the
- * antecedent of this proof object.
+ *
+ * Remarks: Given an symmetric relation R and a proof for (R t s), produces * a proof for (R s t). T1: (R t s) [symmetry T1]: (R s t) T1 is the * antecedent of this proof object.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofSymmetry() throws Z3Exception
{
@@ -1121,9 +1367,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof by transitivity of a relation
- * Given a transitive relation R, and proofs for (R t s) and (R s
- * u), produces a proof for (R t u). T1: (R t s) T2: (R s u) [trans T1 T2]:
- * (R t u)
+ *
+ * Remarks: Given a transitive relation R, and proofs for (R t s) and (R s * u), produces a proof for (R t u). T1: (R t s) T2: (R s u) [trans T1 T2]: * (R t u)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofTransitivity() throws Z3Exception
{
@@ -1132,7 +1379,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof by condensed transitivity of a
- * relation Condensed transitivity proof. This proof object is
+ * relation
+ * Remarks: Condensed transitivity proof. This proof object is
* only used if the parameter PROOF_MODE is 1. It combines several symmetry
* and transitivity proofs. Example: T1: (R a b) T2: (R c b) T3: (R c d)
* [trans* T1 T2 T3]: (R a d) R must be a symmetric and transitive relation.
@@ -1141,7 +1389,9 @@ public class Expr extends AST
* checker must check if it is possible to prove (R s t) using the
* antecedents, symmetry and transitivity. That is, if there is a path from
* s to t, if we view every antecedent (R a b) as an edge between a and b.
- *
+ *
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofTransitivityStar() throws Z3Exception
{
@@ -1149,11 +1399,14 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a monotonicity proof object. T1:
+ * Indicates whether the term is a monotonicity proof object.
+ * Remarks: T1:
* (R t_1 s_1) ... Tn: (R t_n s_n) [monotonicity T1 ... Tn]: (R (f t_1 ...
* t_n) (f s_1 ... s_n)) Remark: if t_i == s_i, then the antecedent Ti is
* suppressed. That is, reflexivity proofs are supressed to save space.
- *
+ *
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofMonotonicity() throws Z3Exception
{
@@ -1161,9 +1414,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a quant-intro proof Given a proof
- * for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)). T1:
- * (~ p q) [quant-intro T1]: (~ (forall (x) p) (forall (x) q))
+ * Indicates whether the term is a quant-intro proof
+ * Remarks: Given a proof * for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)). T1: * (~ p q) [quant-intro T1]: (~ (forall (x) p) (forall (x) q))
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofQuantIntro() throws Z3Exception
{
@@ -1171,7 +1425,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a distributivity proof object.
+ * Indicates whether the term is a distributivity proof object.
+ * Remarks:
* Given that f (= or) distributes over g (= and), produces a proof for (=
* (f a (g c d)) (g (f a c) (f a d))) If f and g are associative, this proof
* also justifies the following equality: (= (f (g a b) (g c d)) (g (f a c)
@@ -1179,7 +1434,9 @@ public class Expr extends AST
* arguments.
*
* This proof object has no antecedents. Remark. This rule is used by the
- * CNF conversion pass and instantiated by f = or, and g = and.
+ * CNF conversion pass and instantiated by f = or, and g = and.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofDistributivity() throws Z3Exception
{
@@ -1187,9 +1444,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by elimination of AND
- * Given a proof for (and l_1 ... l_n), produces a proof for l_i T1: (and
- * l_1 ... l_n) [and-elim T1]: l_i
+ * Indicates whether the term is a proof by elimination of AND
+ * Remarks: * Given a proof for (and l_1 ... l_n), produces a proof for l_i T1: (and * l_1 ... l_n) [and-elim T1]: l_i
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofAndElimination() throws Z3Exception
{
@@ -1197,9 +1455,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by eliminiation of not-or
- * Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i).
- * T1: (not (or l_1 ... l_n)) [not-or-elim T1]: (not l_i)
+ * Indicates whether the term is a proof by eliminiation of not-or
+ * Remarks: * Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i). * T1: (not (or l_1 ... l_n)) [not-or-elim T1]: (not l_i)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofOrElimination() throws Z3Exception
{
@@ -1207,7 +1466,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by rewriting A proof for
+ * Indicates whether the term is a proof by rewriting
+ * Remarks: A proof for
* a local rewriting step (= t s). The head function symbol of t is
* interpreted.
*
@@ -1216,7 +1476,9 @@ public class Expr extends AST
* equi-satisfiability (~ t s). Remark: if f is bool, then = is iff.
*
* Examples: (= (+ x 0) x) (= (+ x 1 2) (+ 3 x)) (iff (or x false) x)
- *
+ *
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofRewrite() throws Z3Exception
{
@@ -1224,7 +1486,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by rewriting A proof for
+ * Indicates whether the term is a proof by rewriting
+ * Remarks: A proof for
* rewriting an expression t into an expression s. This proof object is used
* if the parameter PROOF_MODE is 1. This proof object can have n
* antecedents. The antecedents are proofs for equalities used as
@@ -1232,7 +1495,9 @@ public class Expr extends AST
* parameter PROOF_MODE is 2. The cases are: - When applying contextual
* simplification (CONTEXT_SIMPLIFIER=true) - When converting bit-vectors to
* Booleans (BIT2BOOL=true) - When pulling ite expression up
- * (PULL_CHEAP_ITE_TREES=true)
+ * (PULL_CHEAP_ITE_TREES=true)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofRewriteStar() throws Z3Exception
{
@@ -1241,8 +1506,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for pulling quantifiers out.
- * A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x)
- * r))). This proof object has no antecedents.
+ * Remarks: A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x)
+ * r))). This proof object has no antecedents.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofPullQuant() throws Z3Exception
{
@@ -1251,9 +1518,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for pulling quantifiers out.
- * A proof for (iff P Q) where Q is in prenex normal form. This
- * proof object is only used if the parameter PROOF_MODE is 1. This proof
- * object has no antecedents
+ *
+ * Remarks: A proof for (iff P Q) where Q is in prenex normal form. This * proof object is only used if the parameter PROOF_MODE is 1. This proof * object has no antecedents
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofPullQuantStar() throws Z3Exception
{
@@ -1262,10 +1530,12 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for pushing quantifiers in.
- * A proof for: (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m]
+ * Remarks: A proof for: (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m]
* ... p_n[x_1 ... x_m])) (and (forall (x_1 ... x_m) p_1[x_1 ... x_m]) ...
* (forall (x_1 ... x_m) p_n[x_1 ... x_m]))) This proof object has no
- * antecedents
+ * antecedents
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofPushQuant() throws Z3Exception
{
@@ -1274,11 +1544,14 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for elimination of unused
- * variables. A proof for (iff (forall (x_1 ... x_n y_1 ... y_m)
+ * variables.
+ * Remarks: A proof for (iff (forall (x_1 ... x_n y_1 ... y_m)
* p[x_1 ... x_n]) (forall (x_1 ... x_n) p[x_1 ... x_n]))
*
* It is used to justify the elimination of unused variables. This proof
- * object has no antecedents.
+ * object has no antecedents.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofElimUnusedVars() throws Z3Exception
{
@@ -1287,12 +1560,14 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for destructive equality resolution
- * A proof for destructive equality resolution: (iff (forall (x)
+ * Remarks: A proof for destructive equality resolution: (iff (forall (x)
* (or (not (= x t)) P[x])) P[t]) if x does not occur in t.
*
* This proof object has no antecedents.
*
- * Several variables can be eliminated simultaneously.
+ * Several variables can be eliminated simultaneously.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofDER() throws Z3Exception
{
@@ -1301,7 +1576,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for quantifier instantiation
- * A proof of (or (not (forall (x) (P x))) (P a))
+ *
+ * Remarks: A proof of (or (not (forall (x) (P x))) (P a))
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofQuantInst() throws Z3Exception
{
@@ -1309,8 +1587,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a hypthesis marker. Mark a
- * hypothesis in a natural deduction style proof.
+ * Indicates whether the term is a hypthesis marker.
+ * Remarks: Mark a
+ * hypothesis in a natural deduction style proof.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofHypothesis() throws Z3Exception
{
@@ -1318,12 +1599,15 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by lemma T1: false [lemma
+ * Indicates whether the term is a proof by lemma
+ * Remarks: T1: false [lemma
* T1]: (or (not l_1) ... (not l_n))
*
* This proof object has one antecedent: a hypothetical proof for false. It
* converts the proof in a proof for (or (not l_1) ... (not l_n)), when T1
- * contains the hypotheses: l_1, ..., l_n.
+ * contains the hypotheses: l_1, ..., l_n.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofLemma() throws Z3Exception
{
@@ -1331,9 +1615,10 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by unit resolution T1:
- * (or l_1 ... l_n l_1' ... l_m') T2: (not l_1) ... T(n+1): (not l_n)
- * [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m')
+ * Indicates whether the term is a proof by unit resolution
+ * Remarks: T1: * (or l_1 ... l_n l_1' ... l_m') T2: (not l_1) ... T(n+1): (not l_n) * [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m')
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofUnitResolution() throws Z3Exception
{
@@ -1341,8 +1626,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by iff-true T1: p
- * [iff-true T1]: (iff p true)
+ * Indicates whether the term is a proof by iff-true
+ * Remarks: T1: p
+ * [iff-true T1]: (iff p true)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofIFFTrue() throws Z3Exception
{
@@ -1350,8 +1638,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by iff-false T1: (not p)
- * [iff-false T1]: (iff p false)
+ * Indicates whether the term is a proof by iff-false
+ * Remarks: T1: (not p)
+ * [iff-false T1]: (iff p false)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofIFFFalse() throws Z3Exception
{
@@ -1359,13 +1650,16 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof by commutativity [comm]:
+ * Indicates whether the term is a proof by commutativity
+ * Remarks: [comm]:
* (= (f a b) (f b a))
*
* f is a commutative operator.
*
* This proof object has no antecedents. Remark: if f is bool, then = is
- * iff.
+ * iff.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofCommutativity() throws Z3Exception
{
@@ -1373,7 +1667,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof for Tseitin-like axioms
+ * Indicates whether the term is a proof for Tseitin-like axioms
+ * Remarks:
* Proof object used to justify Tseitin's like axioms:
*
* (or (not (and p q)) p) (or (not (and p q)) q) (or (not (and p q r)) p)
@@ -1388,7 +1683,9 @@ public class Expr extends AST
* tautologies. Note also that 'and' and 'or' can take multiple arguments.
* You can recover the propositional tautologies by unfolding the Boolean
* connectives in the axioms a small bounded number of steps (=3).
- *
+ *
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofDefAxiom() throws Z3Exception
{
@@ -1397,7 +1694,7 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for introduction of a name
- * Introduces a name for a formula/term. Suppose e is an
+ * Remarks: Introduces a name for a formula/term. Suppose e is an
* expression with free variables x, and def-intro introduces the name n(x).
* The possible cases are:
*
@@ -1409,7 +1706,9 @@ public class Expr extends AST
* When e is of the form (ite cond th el): [def-intro]: (and (or (not cond)
* (= n th)) (or cond (= n el)))
*
- * Otherwise: [def-intro]: (= n e)
+ * Otherwise: [def-intro]: (= n e)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofDefIntro() throws Z3Exception
{
@@ -1418,8 +1717,10 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for application of a definition
- * [apply-def T1]: F ~ n F is 'equivalent' to n, given that T1 is
- * a proof that n is a name for F.
+ * Remarks: [apply-def T1]: F ~ n F is 'equivalent' to n, given that T1 is
+ * a proof that n is a name for F.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofApplyDef() throws Z3Exception
{
@@ -1427,8 +1728,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof iff-oeq T1: (iff p q)
- * [iff~ T1]: (~ p q)
+ * Indicates whether the term is a proof iff-oeq
+ * Remarks: T1: (iff p q)
+ * [iff~ T1]: (~ p q)
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofIFFOEQ() throws Z3Exception
{
@@ -1436,7 +1740,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof for a positive NNF step
+ * Indicates whether the term is a proof for a positive NNF step
+ * Remarks:
* Proof for a (positive) NNF step. Example:
*
* T1: (not s_1) ~ r_1 T2: (not s_2) ~ r_2 T3: s_1 ~ r_1' T4: s_2 ~ r_2'
@@ -1453,7 +1758,9 @@ public class Expr extends AST
* top-level connective is changed during NNF conversion. The relevant
* Boolean connectives for NNF_POS are 'implies', 'iff', 'xor', 'ite'.
* NNF_NEG furthermore handles the case where negation is pushed over
- * Boolean connectives 'and' and 'or'.
+ * Boolean connectives 'and' and 'or'.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofNNFPos() throws Z3Exception
{
@@ -1461,7 +1768,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof for a negative NNF step
+ * Indicates whether the term is a proof for a negative NNF step
+ * Remarks:
* Proof for a (negative) NNF step. Examples:
*
* T1: (not s_1) ~ r_1 ... Tn: (not s_n) ~ r_n [nnf-neg T1 ... Tn]: (not
@@ -1469,7 +1777,9 @@ public class Expr extends AST
* (not s_n) ~ r_n [nnf-neg T1 ... Tn]: (not (or s_1 ... s_n)) ~ (and r_1
* ... r_n) and T1: (not s_1) ~ r_1 T2: (not s_2) ~ r_2 T3: s_1 ~ r_1' T4:
* s_2 ~ r_2' [nnf-neg T1 T2 T3 T4]: (~ (not (iff s_1 s_2)) (and (or r_1
- * r_2) (or r_1' r_2')))
+ * r_2) (or r_1' r_2')))
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofNNFNeg() throws Z3Exception
{
@@ -1478,13 +1788,16 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for (~ P Q) here Q is in negation
- * normal form. A proof for (~ P Q) where Q is in negation normal
+ * normal form.
+ * Remarks: A proof for (~ P Q) where Q is in negation normal
* form.
*
* This proof object is only used if the parameter PROOF_MODE is 1.
*
* This proof object may have n antecedents. Each antecedent is a
- * PR_DEF_INTRO.
+ * PR_DEF_INTRO.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofNNFStar() throws Z3Exception
{
@@ -1493,10 +1806,13 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof for (~ P Q) where Q is in
- * conjunctive normal form. A proof for (~ P Q) where Q is in
+ * conjunctive normal form.
+ * Remarks: A proof for (~ P Q) where Q is in
* conjunctive normal form. This proof object is only used if the parameter
* PROOF_MODE is 1. This proof object may have n antecedents. Each
- * antecedent is a PR_DEF_INTRO.
+ * antecedent is a PR_DEF_INTRO.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofCNFStar() throws Z3Exception
{
@@ -1504,13 +1820,16 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof for a Skolemization step
+ * Indicates whether the term is a proof for a Skolemization step
+ * Remarks:
* Proof for:
*
* [sk]: (~ (not (forall x (p x y))) (not (p (sk y) y))) [sk]: (~ (exists x
* (p x y)) (p (sk y) y))
*
- * This proof object has no antecedents.
+ * This proof object has no antecedents.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofSkolemize() throws Z3Exception
{
@@ -1519,8 +1838,11 @@ public class Expr extends AST
/**
* Indicates whether the term is a proof by modus ponens for
- * equi-satisfiability. Modus ponens style rule for
- * equi-satisfiability. T1: p T2: (~ p q) [mp~ T1 T2]: q
+ * equi-satisfiability.
+ * Remarks: Modus ponens style rule for
+ * equi-satisfiability. T1: p T2: (~ p q) [mp~ T1 T2]: q
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofModusPonensOEQ() throws Z3Exception
{
@@ -1528,7 +1850,8 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a proof for theory lemma Generic
+ * Indicates whether the term is a proof for theory lemma
+ * Remarks: Generic
* proof for theory lemmas.
*
* The theory lemma function comes with one or more parameters. The first
@@ -1539,7 +1862,9 @@ public class Expr extends AST
* (negated) inequalities and obtain a contradiction. - triangle-eq -
* Indicates a lemma related to the equivalence: (iff (= t1 t2) (and (<=
* t1 t2) (<= t2 t1))) - gcd-test - Indicates an integer linear
- * arithmetic lemma that uses a gcd test.
+ * arithmetic lemma that uses a gcd test.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isProofTheoryLemma() throws Z3Exception
{
@@ -1548,6 +1873,8 @@ public class Expr extends AST
/**
* Indicates whether the term is of an array sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelation() throws Z3Exception
{
@@ -1558,10 +1885,13 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is an relation store Insert a record
- * into a relation. The function takes n+1 arguments, where the
- * first argument is the relation and the remaining n elements
- * correspond to the n columns of the relation.
+ * Indicates whether the term is an relation store
+ * Remarks: Insert a record
+ * into a relation. The function takes {@code n+1} arguments, where the
+ * first argument is the relation and the remaining {@code n} elements
+ * correspond to the {@code n} columns of the relation.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationStore() throws Z3Exception
{
@@ -1570,6 +1900,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an empty relation
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isEmptyRelation() throws Z3Exception
{
@@ -1578,6 +1910,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a test for the emptiness of a relation
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isIsEmptyRelation() throws Z3Exception
{
@@ -1586,6 +1920,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a relational join
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationalJoin() throws Z3Exception
{
@@ -1594,7 +1930,10 @@ public class Expr extends AST
/**
* Indicates whether the term is the union or convex hull of two relations.
- * The function takes two arguments.
+ *
+ * Remarks: The function takes two arguments.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationUnion() throws Z3Exception
{
@@ -1602,8 +1941,11 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is the widening of two relations The
- * function takes two arguments.
+ * Indicates whether the term is the widening of two relations
+ * Remarks: The
+ * function takes two arguments.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationWiden() throws Z3Exception
{
@@ -1612,8 +1954,11 @@ public class Expr extends AST
/**
* Indicates whether the term is a projection of columns (provided as
- * numbers in the parameters). The function takes one
- * argument.
+ * numbers in the parameters).
+ * Remarks: The function takes one
+ * argument.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationProject() throws Z3Exception
{
@@ -1621,11 +1966,14 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a relation filter Filter
+ * Indicates whether the term is a relation filter
+ * Remarks: Filter
* (restrict) a relation with respect to a predicate. The first argument is
* a relation. The second argument is a predicate with free de-Brujin
* indices corresponding to the columns of the relation. So the first column
- * in the relation has index 0.
+ * in the relation has index 0.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationFilter() throws Z3Exception
{
@@ -1634,7 +1982,8 @@ public class Expr extends AST
/**
* Indicates whether the term is an intersection of a relation with the
- * negation of another. Intersect the first relation with respect
+ * negation of another.
+ * Remarks: Intersect the first relation with respect
* to negation of the second relation (the function takes two arguments).
* Logically, the specification can be described by a function
*
@@ -1642,7 +1991,9 @@ public class Expr extends AST
*
* where columns are pairs c1, d1, .., cN, dN of columns from pos and neg,
* such that target are elements in x in pos, such that there is no y in neg
- * that agrees with x on the columns c1, d1, .., cN, dN.
+ * that agrees with x on the columns c1, d1, .., cN, dN.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationNegationFilter() throws Z3Exception
{
@@ -1651,8 +2002,10 @@ public class Expr extends AST
/**
* Indicates whether the term is the renaming of a column in a relation
- * The function takes one argument. The parameters contain the
- * renaming as a cycle.
+ * Remarks: The function takes one argument. The parameters contain the
+ * renaming as a cycle.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationRename() throws Z3Exception
{
@@ -1661,6 +2014,8 @@ public class Expr extends AST
/**
* Indicates whether the term is the complement of a relation
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationComplement() throws Z3Exception
{
@@ -1668,10 +2023,13 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a relational select Check if a
- * record is an element of the relation. The function takes n+1
+ * Indicates whether the term is a relational select
+ * Remarks: Check if a
+ * record is an element of the relation. The function takes {@code n+1}
* arguments, where the first argument is a relation, and the remaining
- * n arguments correspond to a record.
+ * {@code n} arguments correspond to a record.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationSelect() throws Z3Exception
{
@@ -1679,11 +2037,15 @@ public class Expr extends AST
}
/**
- * Indicates whether the term is a relational clone (copy) Create
+ * Indicates whether the term is a relational clone (copy)
+ * Remarks: Create
* a fresh copy (clone) of a relation. The function is logically the
* identity, but in the context of a register machine allows for terms of
- * kind to perform destructive updates to
- * the first argument.
+ * kind {@code isRelationUnion} to perform destructive updates to
+ * the first argument.
+ * @see isRelationUnion
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isRelationClone() throws Z3Exception
{
@@ -1692,6 +2054,8 @@ public class Expr extends AST
/**
* Indicates whether the term is of an array sort.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isFiniteDomain() throws Z3Exception
{
@@ -1703,6 +2067,8 @@ public class Expr extends AST
/**
* Indicates whether the term is a less than predicate over a finite domain.
+ * @throws Z3Exception on error
+ * @return a boolean
**/
public boolean isFiniteDomainLT() throws Z3Exception
{
@@ -1710,19 +2076,22 @@ public class Expr extends AST
}
/**
- * The de-Burijn index of a bound variable. Bound variables are
+ * The de-Burijn index of a bound variable.
+ * Remarks: Bound variables are
* indexed by de-Bruijn indices. It is perhaps easiest to explain the
* meaning of de-Bruijn indices by indicating the compilation process from
- * non-de-Bruijn formulas to de-Bruijn format.
+ * non-de-Bruijn formulas to de-Bruijn format. {@code
* abs(forall (x1) phi) = forall (x1) abs1(phi, x1, 0)
* abs(forall (x1, x2) phi) = abs(forall (x1) abs(forall (x2) phi))
* abs1(x, x, n) = b_n
* abs1(y, x, n) = y
* abs1(f(t1,...,tn), x, n) = f(abs1(t1,x,n), ..., abs1(tn,x,n))
* abs1(forall (x1) phi, x, n) = forall (x1) (abs1(phi, x, n+1))
- * The last line is significant: the index of a bound variable is
+ * } The last line is significant: the index of a bound variable is
* different depending on the scope in which it appears. The deeper x
- * appears, the higher is its index.
+ * appears, the higher is its index.
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getIndex() throws Z3Exception
{
@@ -1744,6 +2113,7 @@ public class Expr extends AST
/**
* Constructor for Expr
+ * @throws Z3Exception on error
**/
protected Expr(Context ctx, long obj) throws Z3Exception
{
@@ -1791,6 +2161,10 @@ public class Expr extends AST
return new RatNum(ctx, obj);
case Z3_BV_SORT:
return new BitVecNum(ctx, obj);
+ case Z3_FLOATING_POINT_SORT:
+ return new FPNum(ctx, obj);
+ case Z3_ROUNDING_MODE_SORT:
+ return new FPRMNum(ctx, obj);
default: ;
}
}
@@ -1809,6 +2183,10 @@ public class Expr extends AST
return new ArrayExpr(ctx, obj);
case Z3_DATATYPE_SORT:
return new DatatypeExpr(ctx, obj);
+ case Z3_FLOATING_POINT_SORT:
+ return new FPExpr(ctx, obj);
+ case Z3_ROUNDING_MODE_SORT:
+ return new FPRMExpr(ctx, obj);
default: ;
}
diff --git a/src/api/java/FPExpr.java b/src/api/java/FPExpr.java
new file mode 100644
index 000000000..e5193a042
--- /dev/null
+++ b/src/api/java/FPExpr.java
@@ -0,0 +1,41 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPExpr.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+/**
+ * FloatingPoint Expressions
+ */
+public class FPExpr extends Expr
+{
+ /**
+ * The number of exponent bits.
+ * @throws Z3Exception
+ */
+ public int getEBits() throws Z3Exception { return ((FPSort)getSort()).getEBits(); }
+
+ /**
+ * The number of significand bits.
+ * @throws Z3Exception
+ */
+ public int getSBits() throws Z3Exception { return ((FPSort)getSort()).getSBits(); }
+
+ public FPExpr(Context ctx, long obj) throws Z3Exception
+ {
+ super(ctx, obj);
+ }
+
+}
diff --git a/src/api/java/FPNum.java b/src/api/java/FPNum.java
new file mode 100644
index 000000000..037fe63a4
--- /dev/null
+++ b/src/api/java/FPNum.java
@@ -0,0 +1,84 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPNum.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+/**
+ * FloatingPoint Numerals
+ */
+public class FPNum extends FPExpr
+{
+ /**
+ * Retrieves the sign of a floating-point literal
+ * Remarks: returns true if the numeral is negative
+ * @throws Z3Exception
+ */
+ public boolean getSign() throws Z3Exception {
+ Native.IntPtr res = new Native.IntPtr();
+ if (Native.fpaGetNumeralSign(getContext().nCtx(), getNativeObject(), res) ^ true)
+ throw new Z3Exception("Sign is not a Boolean value");
+ return res.value != 0;
+ }
+
+ /**
+ * The significand value of a floating-point numeral as a string
+ * Remarks: The significand s is always 0 < s < 2.0; the resulting string is long
+ * enough to represent the real significand precisely.
+ * @throws Z3Exception
+ **/
+ public String getSignificand() throws Z3Exception {
+ return Native.fpaGetNumeralSignificandString(getContext().nCtx(), getNativeObject());
+ }
+
+ /**
+ * Return the exponent value of a floating-point numeral as a string
+ * @throws Z3Exception
+ */
+ public String getExponent() throws Z3Exception {
+ return Native.fpaGetNumeralExponentString(getContext().nCtx(), getNativeObject());
+ }
+
+ /**
+ * Return the exponent value of a floating-point numeral as a signed 64-bit integer
+ * @throws Z3Exception
+ */
+ public long getExponentInt64() throws Z3Exception {
+ Native.LongPtr res = new Native.LongPtr();
+ if (Native.fpaGetNumeralExponentInt64(getContext().nCtx(), getNativeObject(), res) ^ true)
+ throw new Z3Exception("Exponent is not a 64 bit integer");
+ return res.value;
+ }
+
+ public FPNum(Context ctx, long obj) throws Z3Exception
+ {
+ super(ctx, obj);
+ }
+
+ /**
+ * Returns a string representation of the numeral.
+ */
+ public String toString()
+ {
+ try
+ {
+ return Native.getNumeralString(getContext().nCtx(), getNativeObject());
+ } catch (Z3Exception e)
+ {
+ return "Z3Exception: " + e.getMessage();
+ }
+ }
+
+}
diff --git a/src/api/java/FPRMExpr.java b/src/api/java/FPRMExpr.java
new file mode 100644
index 000000000..482c3b899
--- /dev/null
+++ b/src/api/java/FPRMExpr.java
@@ -0,0 +1,29 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMExpr.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+/**
+ * FloatingPoint RoundingMode Expressions
+ */
+public class FPRMExpr extends Expr
+{
+ public FPRMExpr(Context ctx, long obj) throws Z3Exception
+ {
+ super(ctx, obj);
+ }
+
+}
diff --git a/src/api/java/FPRMNum.java b/src/api/java/FPRMNum.java
new file mode 100644
index 000000000..04e7727e2
--- /dev/null
+++ b/src/api/java/FPRMNum.java
@@ -0,0 +1,90 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMNum.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+import com.microsoft.z3.enumerations.Z3_decl_kind;
+
+/**
+ * FloatingPoint RoundingMode Numerals
+ */
+public class FPRMNum extends FPRMExpr {
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ * @throws Z3Exception
+ * **/
+ public boolean isRoundNearestTiesToEven() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven
+ * @throws Z3Exception
+ */
+ public boolean isRNE() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ * @throws Z3Exception
+ */
+ public boolean isRoundNearestTiesToAway() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway
+ * @throws Z3Exception
+ */
+ public boolean isRNA() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ * @throws Z3Exception
+ */
+ public boolean isRoundTowardPositive() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardPositive
+ * @throws Z3Exception
+ */
+ public boolean isRTP() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_POSITIVE; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ * @throws Z3Exception
+ */
+ public boolean isRoundTowardNegative() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardNegative
+ * @throws Z3Exception
+ */
+ public boolean isRTN() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_NEGATIVE; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ * @throws Z3Exception
+ */
+ public boolean isRoundTowardZero() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; }
+
+ /**
+ * Indicates whether the term is the floating-point rounding numeral roundTowardZero
+ * @throws Z3Exception
+ */
+ public boolean isRTZ() throws Z3Exception { return isApp() && getFuncDecl().getDeclKind() == Z3_decl_kind.Z3_OP_FPA_RM_TOWARD_ZERO; }
+
+ public FPRMNum(Context ctx, long obj) throws Z3Exception {
+ super(ctx, obj);
+ }
+
+}
diff --git a/src/api/java/FPRMSort.java b/src/api/java/FPRMSort.java
new file mode 100644
index 000000000..ff6422ef6
--- /dev/null
+++ b/src/api/java/FPRMSort.java
@@ -0,0 +1,35 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPRMExpr.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+/**
+ * The FloatingPoint RoundingMode sort
+ **/
+public class FPRMSort extends Sort
+{
+
+ public FPRMSort(Context ctx) throws Z3Exception
+ {
+ super(ctx, Native.mkFpaRoundingModeSort(ctx.nCtx()));
+ }
+
+ public FPRMSort(Context ctx, long obj) throws Z3Exception
+ {
+ super(ctx, obj);
+ }
+
+}
\ No newline at end of file
diff --git a/src/api/java/FPSort.java b/src/api/java/FPSort.java
new file mode 100644
index 000000000..284979524
--- /dev/null
+++ b/src/api/java/FPSort.java
@@ -0,0 +1,49 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ FPSort.java
+
+Abstract:
+
+Author:
+
+ Christoph Wintersteiger (cwinter) 2013-06-10
+
+Notes:
+
+--*/
+package com.microsoft.z3;
+
+/**
+ * A FloatingPoint sort
+ **/
+public class FPSort extends Sort
+{
+
+ public FPSort(Context ctx, long obj) throws Z3Exception
+ {
+ super(ctx, obj);
+ }
+
+ public FPSort(Context ctx, int ebits, int sbits) throws Z3Exception
+ {
+ super(ctx, Native.mkFpaSort(ctx.nCtx(), ebits, sbits));
+ }
+
+ /**
+ * The number of exponent bits.
+ */
+ public int getEBits() throws Z3Exception {
+ return Native.fpaGetEbits(getContext().nCtx(), getNativeObject());
+ }
+
+ /**
+ * The number of significand bits.
+ */
+ public int getSBits() throws Z3Exception {
+ return Native.fpaGetEbits(getContext().nCtx(), getNativeObject());
+ }
+
+}
diff --git a/src/api/java/FiniteDomainSort.java b/src/api/java/FiniteDomainSort.java
index 4cb2ab917..cece06f1a 100644
--- a/src/api/java/FiniteDomainSort.java
+++ b/src/api/java/FiniteDomainSort.java
@@ -24,6 +24,7 @@ public class FiniteDomainSort extends Sort
{
/**
* The size of the finite domain sort.
+ * @throws Z3Exception on error
**/
public long getSize() throws Z3Exception
{
diff --git a/src/api/java/Fixedpoint.java b/src/api/java/Fixedpoint.java
index 57e1e105a..8504392bf 100644
--- a/src/api/java/Fixedpoint.java
+++ b/src/api/java/Fixedpoint.java
@@ -163,7 +163,8 @@ public class Fixedpoint extends Z3Object
}
/**
- * Creates a backtracking point.
+ * Creates a backtracking point.
+ * @see pop
**/
public void push() throws Z3Exception
{
@@ -171,9 +172,11 @@ public class Fixedpoint extends Z3Object
}
/**
- * Backtrack one backtracking point. Note that an exception is
- * thrown if Pop is called without a corresponding Push
- *
+ * Backtrack one backtracking point.
+ * Remarks: Note that an exception is thrown if {@code pop}
+ * is called without a corresponding {@code push}
+ *
+ * @see push
**/
public void pop() throws Z3Exception
{
diff --git a/src/api/java/FuncDecl.java b/src/api/java/FuncDecl.java
index 573ebd102..5307951e5 100644
--- a/src/api/java/FuncDecl.java
+++ b/src/api/java/FuncDecl.java
@@ -29,7 +29,7 @@ public class FuncDecl extends AST
/**
* Comparison operator.
*
- * @return True if and share the
+ * @return True if {@code a"/> and and do not
+ * @return True if {@code a"/> and
+ * The size of the domain of the function declaration
+ * @see getArity
**/
public int getDomainSize() throws Z3Exception
{
@@ -221,7 +221,7 @@ public class FuncDecl extends AST
private String r;
/**
- * The int value of the parameter.
+ * The int value of the parameter.
**/
public int getInt() throws Z3Exception
{
@@ -231,7 +231,7 @@ public class FuncDecl extends AST
}
/**
- * The double value of the parameter.
+ * The double value of the parameter.
**/
public double getDouble() throws Z3Exception
{
@@ -241,7 +241,7 @@ public class FuncDecl extends AST
}
/**
- * The Symbol value of the parameter.
+ * The Symbol value of the parameter.
**/
public Symbol getSymbol() throws Z3Exception
{
@@ -251,7 +251,7 @@ public class FuncDecl extends AST
}
/**
- * The Sort value of the parameter.
+ * The Sort value of the parameter.
**/
public Sort getSort() throws Z3Exception
{
@@ -261,7 +261,7 @@ public class FuncDecl extends AST
}
/**
- * The AST value of the parameter.
+ * The AST value of the parameter.
**/
public AST getAST() throws Z3Exception
{
@@ -271,7 +271,7 @@ public class FuncDecl extends AST
}
/**
- * The FunctionDeclaration value of the parameter.
+ * The FunctionDeclaration value of the parameter.
**/
public FuncDecl getFuncDecl() throws Z3Exception
{
@@ -281,7 +281,7 @@ public class FuncDecl extends AST
}
/**
- * The rational string value of the parameter.
+ * The rational string value of the parameter.
**/
public String getRational() throws Z3Exception
{
@@ -375,8 +375,8 @@ public class FuncDecl extends AST
}
/**
- * Create expression that applies function to arguments.
+ * Create expression that applies function to arguments.
+ * @param args
*
* @return
**/
diff --git a/src/api/java/FuncInterp.java b/src/api/java/FuncInterp.java
index 243ade71f..fd0c10d2e 100644
--- a/src/api/java/FuncInterp.java
+++ b/src/api/java/FuncInterp.java
@@ -34,7 +34,8 @@ public class FuncInterp extends Z3Object
* Return the (symbolic) value of this entry.
*
* @throws Z3Exception
- **/
+ * @throws Z3Exception on error
+ **/
public Expr getValue() throws Z3Exception
{
return Expr.create(getContext(),
@@ -43,7 +44,8 @@ public class FuncInterp extends Z3Object
/**
* The number of arguments of the entry.
- **/
+ * @throws Z3Exception on error
+ **/
public int getNumArgs() throws Z3Exception
{
return Native.funcEntryGetNumArgs(getContext().nCtx(), getNativeObject());
@@ -53,7 +55,8 @@ public class FuncInterp extends Z3Object
* The arguments of the function entry.
*
* @throws Z3Exception
- **/
+ * @throws Z3Exception on error
+ **/
public Expr[] getArgs() throws Z3Exception
{
int n = getNumArgs();
@@ -103,6 +106,8 @@ public class FuncInterp extends Z3Object
/**
* The number of entries in the function interpretation.
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getNumEntries() throws Z3Exception
{
@@ -113,6 +118,7 @@ public class FuncInterp extends Z3Object
* The entries in the function interpretation
*
* @throws Z3Exception
+ * @throws Z3Exception on error
**/
public Entry[] getEntries() throws Z3Exception
{
@@ -128,6 +134,8 @@ public class FuncInterp extends Z3Object
* The (symbolic) `else' value of the function interpretation.
*
* @throws Z3Exception
+ * @throws Z3Exception on error
+ * @return an Expr
**/
public Expr getElse() throws Z3Exception
{
@@ -137,6 +145,8 @@ public class FuncInterp extends Z3Object
/**
* The arity of the function interpretation
+ * @throws Z3Exception on error
+ * @return an int
**/
public int getArity() throws Z3Exception
{
diff --git a/src/api/java/Global.java b/src/api/java/Global.java
index c93f46c88..b31c4a7ae 100644
--- a/src/api/java/Global.java
+++ b/src/api/java/Global.java
@@ -19,16 +19,16 @@ package com.microsoft.z3;
/**
* Global functions for Z3.
- *
+ * Remarks:
* This (static) class contains functions that effect the behaviour of Z3
* globally across contexts, etc.
- *
+ *
**/
public final class Global
{
/**
* Set a global (or module) parameter, which is shared by all Z3 contexts.
- *
+ * Remarks:
* When a Z3 module is initialized it will use the value of these parameters
* when Z3_params objects are not provided.
* The name of parameter can be composed of characters [a-z][A-Z], digits [0-9], '-' and '_'.
@@ -36,11 +36,11 @@ public final class Global
* The parameter names are case-insensitive. The character '-' should be viewed as an "alias" for '_'.
* Thus, the following parameter names are considered equivalent: "pp.decimal-precision" and "PP.DECIMAL_PRECISION".
* This function can be used to set parameters for a specific Z3 module.
- * This can be done by using ..
+ * This can be done by using <module-name>.<parameter-name>.
* For example:
* Z3_global_param_set('pp.decimal', 'true')
* will set the parameter "decimal" in the module "pp" to true.
- *
+ *
**/
public static void setParameter(String id, String value)
{
@@ -49,11 +49,10 @@ public final class Global
/**
* Get a global (or module) parameter.
- *
- * Returns null if the parameter parameter id does not exist.
+ * Remarks:
* This function cannot be invoked simultaneously from different threads without synchronization.
* The result string stored in param_value is stored in a shared location.
- *
+ * @return null if the parameter {@code id} does not exist.
**/
public static String getParameter(String id)
{
@@ -66,10 +65,9 @@ public final class Global
/**
* Restore the value of all global (and module) parameters.
- *
+ * Remarks:
* This command will not affect already created objects (such as tactics and solvers)
- *
- *
+ * @see setParameter
**/
public static void resetParameters()
{
diff --git a/src/api/java/Goal.java b/src/api/java/Goal.java
index aba8b0149..5a9221b63 100644
--- a/src/api/java/Goal.java
+++ b/src/api/java/Goal.java
@@ -26,11 +26,12 @@ import com.microsoft.z3.enumerations.Z3_goal_prec;
public class Goal extends Z3Object
{
/**
- * The precision of the goal. Goals can be transformed using over
+ * The precision of the goal.
+ * Remarks: Goals can be transformed using over
* and under approximations. An under approximation is applied when the
* objective is to find a model for a given goal. An over approximation is
* applied when the objective is to find a proof for a given goal.
- *
+ *
**/
public Z3_goal_prec getPrecision() throws Z3Exception
{
@@ -72,7 +73,7 @@ public class Goal extends Z3Object
}
/**
- * Adds the to the given goal.
+ * Adds the {@code constraints} to the given goal.
*
* @throws Z3Exception
**/
@@ -95,8 +96,9 @@ public class Goal extends Z3Object
}
/**
- * The depth of the goal. This tracks how many transformations
- * were applied to it.
+ * The depth of the goal.
+ * Remarks: This tracks how many transformations
+ * were applied to it.
**/
public int getDepth() throws Z3Exception
{
@@ -162,8 +164,7 @@ public class Goal extends Z3Object
}
/**
- * Translates (copies) the Goal to the target Context .
+ * Translates (copies) the Goal to the target Context {@code ctx}.
*
* @throws Z3Exception
**/
@@ -174,8 +175,9 @@ public class Goal extends Z3Object
}
/**
- * Simplifies the goal. Essentially invokes the `simplify' tactic
- * on the goal.
+ * Simplifies the goal.
+ * Remarks: Essentially invokes the `simplify' tactic
+ * on the goal.
**/
public Goal simplify() throws Z3Exception
{
@@ -189,8 +191,9 @@ public class Goal extends Z3Object
}
/**
- * Simplifies the goal. Essentially invokes the `simplify' tactic
- * on the goal.
+ * Simplifies the goal.
+ * Remarks: Essentially invokes the `simplify' tactic
+ * on the goal.
**/
public Goal simplify(Params p) throws Z3Exception
{
diff --git a/src/api/java/IntExpr.java b/src/api/java/IntExpr.java
index 2e90c3cbf..642a58a54 100644
--- a/src/api/java/IntExpr.java
+++ b/src/api/java/IntExpr.java
@@ -23,13 +23,9 @@ package com.microsoft.z3;
public class IntExpr extends ArithExpr
{
/**
- * Constructor for IntExpr
+ * Constructor for IntExpr
+ * @throws Z3Exception on error
**/
- protected IntExpr(Context ctx) throws Z3Exception
- {
- super(ctx);
- }
-
IntExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/IntSymbol.java b/src/api/java/IntSymbol.java
index b0f1af685..a677c9102 100644
--- a/src/api/java/IntSymbol.java
+++ b/src/api/java/IntSymbol.java
@@ -25,8 +25,9 @@ import com.microsoft.z3.enumerations.Z3_symbol_kind;
public class IntSymbol extends Symbol
{
/**
- * The int value of the symbol. Throws an exception if the symbol
- * is not of int kind.
+ * The int value of the symbol.
+ * Remarks: Throws an exception if the symbol
+ * is not of int kind.
**/
public int getInt() throws Z3Exception
{
diff --git a/src/api/java/InterpolationContext.java b/src/api/java/InterpolationContext.java
index 3e9996b3e..c1590e07f 100644
--- a/src/api/java/InterpolationContext.java
+++ b/src/api/java/InterpolationContext.java
@@ -20,15 +20,13 @@ package com.microsoft.z3;
import java.util.Map;
import java.lang.String;
-import com.microsoft.z3.Native.IntPtr;
-import com.microsoft.z3.Native.UIntArrayPtr;
import com.microsoft.z3.enumerations.Z3_lbool;
-/**
+/**
* The InterpolationContext is suitable for generation of interpolants.
- *
- * For more information on interpolation please refer
- * too the C/C++ API, which is well documented.
+ *
+ * Remarks: For more information on interpolation please refer
+ * too the C/C++ API, which is well documented.
**/
public class InterpolationContext extends Context
{
@@ -44,7 +42,9 @@ public class InterpolationContext extends Context
/**
* Constructor.
*
- *
+ *
+ * Remarks:
+ * @see Context#Context
**/
public InterpolationContext(Map settings) throws Z3Exception
{
@@ -58,7 +58,7 @@ public class InterpolationContext extends Context
/**
* Create an expression that marks a formula position for interpolation.
- * @throws Z3Exception
+ * @throws Z3Exception
**/
public BoolExpr MkInterpolant(BoolExpr a) throws Z3Exception
{
@@ -68,9 +68,9 @@ public class InterpolationContext extends Context
/**
* Computes an interpolant.
- * For more information on interpolation please refer
+ * Remarks: For more information on interpolation please refer
* too the function Z3_get_interpolant in the C/C++ API, which is
- * well documented.
+ * well documented.
* @throws Z3Exception
**/
Expr[] GetInterpolant(Expr pf, Expr pat, Params p) throws Z3Exception
@@ -89,9 +89,9 @@ public class InterpolationContext extends Context
/**
* Computes an interpolant.
- * For more information on interpolation please refer
+ * Remarks: For more information on interpolation please refer
* too the function Z3_compute_interpolant in the C/C++ API, which is
- * well documented.
+ * well documented.
* @throws Z3Exception
**/
Z3_lbool ComputeInterpolant(Expr pat, Params p, ASTVector interp, Model model) throws Z3Exception
@@ -107,23 +107,23 @@ public class InterpolationContext extends Context
return Z3_lbool.fromInt(r);
}
- ///
+ ///
/// Return a string summarizing cumulative time used for interpolation.
- ///
- /// For more information on interpolation please refer
+ ///
+ /// Remarks: For more information on interpolation please refer
/// too the function Z3_interpolation_profile in the C/C++ API, which is
- /// well documented.
+ /// well documented.
public String InterpolationProfile() throws Z3Exception
{
return Native.interpolationProfile(nCtx());
}
- ///
+ ///
/// Checks the correctness of an interpolant.
- ///
- /// For more information on interpolation please refer
+ ///
+ /// Remarks: For more information on interpolation please refer
/// too the function Z3_check_interpolant in the C/C++ API, which is
- /// well documented.
+ /// well documented.
public int CheckInterpolant(Expr[] cnsts, int[] parents, Expr[] interps, String error, Expr[] theory) throws Z3Exception
{
Native.StringPtr n_err_str = new Native.StringPtr();
@@ -139,12 +139,12 @@ public class InterpolationContext extends Context
return r;
}
- ///
+ ///
/// Reads an interpolation problem from a file.
- ///
- /// For more information on interpolation please refer
+ ///
+ /// Remarks: For more information on interpolation please refer
/// too the function Z3_read_interpolation_problem in the C/C++ API, which is
- /// well documented.
+ /// well documented.
public int ReadInterpolationProblem(String filename, Expr[] cnsts, int[] parents, String error, Expr[] theory) throws Z3Exception
{
Native.IntPtr n_num = new Native.IntPtr();
@@ -170,12 +170,12 @@ public class InterpolationContext extends Context
return r;
}
- ///
+ ///
/// Writes an interpolation problem to a file.
- ///
- /// For more information on interpolation please refer
+ ///
+ /// Remarks: For more information on interpolation please refer
/// too the function Z3_write_interpolation_problem in the C/C++ API, which is
- /// well documented.
+ /// well documented.
public void WriteInterpolationProblem(String filename, Expr[] cnsts, int[] parents, String error, Expr[] theory) throws Z3Exception
{
Native.writeInterpolationProblem(nCtx(), cnsts.length, Expr.arrayToNative(cnsts), parents, filename, theory.length, Expr.arrayToNative(theory));
diff --git a/src/api/java/ListSort.java b/src/api/java/ListSort.java
index 52cb1a179..a7ad0403b 100644
--- a/src/api/java/ListSort.java
+++ b/src/api/java/ListSort.java
@@ -88,7 +88,7 @@ public class ListSort extends Sort
ListSort(Context ctx, Symbol name, Sort elemSort) throws Z3Exception
{
- super(ctx);
+ super(ctx, 0);
Native.LongPtr inil = new Native.LongPtr(), iisnil = new Native.LongPtr();
Native.LongPtr icons = new Native.LongPtr(), iiscons = new Native.LongPtr();
diff --git a/src/api/java/Log.java b/src/api/java/Log.java
index 254da1bc6..3e8f0050b 100644
--- a/src/api/java/Log.java
+++ b/src/api/java/Log.java
@@ -18,17 +18,18 @@ Notes:
package com.microsoft.z3;
/**
- * Interaction logging for Z3. Note that this is a global, static log
+ * Interaction logging for Z3.
+ * Remarks: Note that this is a global, static log
* and if multiple Context objects are created, it logs the interaction with all
- * of them.
+ * of them.
**/
public final class Log
{
private static boolean m_is_open = false;
/**
- * Open an interaction log file. the name of the file
- * to open
+ * Open an interaction log file.
+ * @param filename the name of the file to open
*
* @return True if opening the log file succeeds, false otherwise.
**/
@@ -48,7 +49,7 @@ public final class Log
}
/**
- * Appends the user-provided string to the interaction
+ * Appends the user-provided string {@code s} to the interaction
* log.
* @throws Z3Exception
**/
diff --git a/src/api/java/Model.java b/src/api/java/Model.java
index 11eed201e..70f0e91c5 100644
--- a/src/api/java/Model.java
+++ b/src/api/java/Model.java
@@ -25,8 +25,9 @@ import com.microsoft.z3.enumerations.Z3_sort_kind;
public class Model extends Z3Object
{
/**
- * Retrieves the interpretation (the assignment) of in
- * the model. A Constant
+ * Retrieves the interpretation (the assignment) of {@code a} in
+ * the model.
+ * @param a A Constant
*
* @return An expression if the constant has an interpretation in the model,
* null otherwise.
@@ -39,8 +40,9 @@ public class Model extends Z3Object
}
/**
- * Retrieves the interpretation (the assignment) of in
- * the model. A function declaration of zero arity
+ * Retrieves the interpretation (the assignment) of {@code f} in
+ * the model.
+ * @param f A function declaration of zero arity
*
* @return An expression if the function has an interpretation in the model,
* null otherwise.
@@ -65,9 +67,8 @@ public class Model extends Z3Object
}
/**
- * Retrieves the interpretation (the assignment) of a non-constant in the model. A function declaration of
- * non-zero arity
+ * Retrieves the interpretation (the assignment) of a non-constant {@code f} in the model.
+ * @param f A function declaration of non-zero arity
*
* @return A FunctionInterpretation if the function has an interpretation in
* the model, null otherwise.
@@ -196,16 +197,15 @@ public class Model extends Z3Object
}
/**
- * Evaluates the expression in the current model.
- * This function may fail if contains
- * quantifiers, is partial (MODEL_PARTIAL enabled), or if is not well-sorted. In this case a
- * ModelEvaluationFailedException is thrown. An expression When this flag
+ * Evaluates the expression {@code t} in the current model.
+ * Remarks: This function may fail if {@code t} contains
+ * quantifiers, is partial (MODEL_PARTIAL enabled), or if {@code t} is not well-sorted. In this case a
+ * {@code ModelEvaluationFailedException} is thrown.
+ * @param t An expression {@code completion} When this flag
* is enabled, a model value will be assigned to any constant or function
- * that does not have an interpretation in the model.
+ * that does not have an interpretation in the model.
*
- * @return The evaluation of in the model.
+ * @return The evaluation of {@code t} in the model.
* @throws Z3Exception
**/
public Expr eval(Expr t, boolean completion) throws Z3Exception
@@ -219,7 +219,7 @@ public class Model extends Z3Object
}
/**
- * Alias for Eval.
+ * Alias for {@code Eval}.
*
* @throws Z3Exception
**/
@@ -239,10 +239,12 @@ public class Model extends Z3Object
/**
* The uninterpreted sorts that the model has an interpretation for.
- * Z3 also provides an intepretation for uninterpreted sorts used
+ * Remarks: Z3 also provides an intepretation for uninterpreted sorts used
* in a formula. The interpretation for a sort is a finite set of distinct
- * values. We say this finite set is the "universe" of the sort.
- *
+ * values. We say this finite set is the "universe" of the sort.
+ *
+ * @see getNumSorts
+ * @see getSortUniverse
*
* @throws Z3Exception
**/
@@ -259,11 +261,11 @@ public class Model extends Z3Object
/**
* The finite set of distinct values that represent the interpretation for
- * sort . An
- * uninterpreted sort
+ * sort {@code s}.
+ * @param s An uninterpreted sort
*
* @return An array of expressions, where each is an element of the universe
- * of
+ * of {@code s}
* @throws Z3Exception
**/
public Expr[] getSortUniverse(Sort s) throws Z3Exception
diff --git a/src/api/java/Probe.java b/src/api/java/Probe.java
index 17ad81b5c..335bd038c 100644
--- a/src/api/java/Probe.java
+++ b/src/api/java/Probe.java
@@ -21,8 +21,8 @@ package com.microsoft.z3;
* Probes are used to inspect a goal (aka problem) and collect information that
* may be used to decide which solver and/or preprocessing step will be used.
* The complete list of probes may be obtained using the procedures
- * Context.NumProbes and Context.ProbeNames. It may
- * also be obtained using the command (help-tactics) in the SMT 2.0
+ * {@code Context.NumProbes} and {@code Context.ProbeNames}. It may
+ * also be obtained using the command {@code (help-tactics)} in the SMT 2.0
* front-end.
**/
public class Probe extends Z3Object
diff --git a/src/api/java/Quantifier.java b/src/api/java/Quantifier.java
index e9aeefcca..58245d723 100644
--- a/src/api/java/Quantifier.java
+++ b/src/api/java/Quantifier.java
@@ -149,7 +149,7 @@ public class Quantifier extends BoolExpr
Expr body, int weight, Pattern[] patterns, Expr[] noPatterns,
Symbol quantifierID, Symbol skolemID) throws Z3Exception
{
- super(ctx);
+ super(ctx, 0);
getContext().checkContextMatch(patterns);
getContext().checkContextMatch(noPatterns);
@@ -185,7 +185,7 @@ public class Quantifier extends BoolExpr
int weight, Pattern[] patterns, Expr[] noPatterns,
Symbol quantifierID, Symbol skolemID) throws Z3Exception
{
- super(ctx);
+ super(ctx, 0);
getContext().checkContextMatch(noPatterns);
getContext().checkContextMatch(patterns);
diff --git a/src/api/java/RatNum.java b/src/api/java/RatNum.java
index f937ea593..2e92a9429 100644
--- a/src/api/java/RatNum.java
+++ b/src/api/java/RatNum.java
@@ -61,8 +61,9 @@ public class RatNum extends RealExpr
}
/**
- * Returns a string representation in decimal notation. The result
- * has at most decimal places.
+ * Returns a string representation in decimal notation.
+ * Remarks: The result
+ * has at most {@code precision} decimal places.
**/
public String toDecimalString(int precision) throws Z3Exception
{
diff --git a/src/api/java/RealExpr.java b/src/api/java/RealExpr.java
index 6188e2999..579d344e1 100644
--- a/src/api/java/RealExpr.java
+++ b/src/api/java/RealExpr.java
@@ -23,13 +23,8 @@ package com.microsoft.z3;
public class RealExpr extends ArithExpr
{
/**
- * Constructor for RealExpr
+ * Constructor for RealExpr
**/
- protected RealExpr(Context ctx)
- {
- super(ctx);
- }
-
RealExpr(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
diff --git a/src/api/java/Solver.java b/src/api/java/Solver.java
index e129189f9..b9c9ebca6 100644
--- a/src/api/java/Solver.java
+++ b/src/api/java/Solver.java
@@ -56,8 +56,9 @@ public class Solver extends Z3Object
}
/**
- * The current number of backtracking points (scopes).
- *
+ * The current number of backtracking points (scopes).
+ * @see pop
+ * @see push
**/
public int getNumScopes() throws Z3Exception
{
@@ -66,7 +67,8 @@ public class Solver extends Z3Object
}
/**
- * Creates a backtracking point.
+ * Creates a backtracking point.
+ * @see pop
**/
public void push() throws Z3Exception
{
@@ -74,7 +76,8 @@ public class Solver extends Z3Object
}
/**
- * Backtracks one backtracking point. .
+ * Backtracks one backtracking point.
+ * Remarks: .
**/
public void pop() throws Z3Exception
{
@@ -82,9 +85,11 @@ public class Solver extends Z3Object
}
/**
- * Backtracks backtracking points. Note that
- * an exception is thrown if is not smaller than
- * NumScopes
+ * Backtracks {@code n} backtracking points.
+ * Remarks: Note that
+ * an exception is thrown if {@code n} is not smaller than
+ * {@code NumScopes}
+ * @see push
**/
public void pop(int n) throws Z3Exception
{
@@ -92,8 +97,9 @@ public class Solver extends Z3Object
}
/**
- * Resets the Solver. This removes all assertions from the
- * solver.
+ * Resets the Solver.
+ * Remarks: This removes all assertions from the
+ * solver.
**/
public void reset() throws Z3Exception
{
@@ -115,12 +121,12 @@ public class Solver extends Z3Object
}
}
- // /
+ // /
// / Assert multiple constraints into the solver, and track them (in the
// unsat) core
// / using the Boolean constants in ps.
- // /
- // /
+ // /
+ // / Remarks:
// / This API is an alternative to with assumptions for
// extracting unsat cores.
// / Both APIs can be used in the same solver. The unsat core will contain a
@@ -128,7 +134,7 @@ public class Solver extends Z3Object
// / of the Boolean variables provided using
// and the Boolean literals
// / provided using with assumptions.
- // /
+ // /
public void assertAndTrack(BoolExpr[] constraints, BoolExpr[] ps) throws Z3Exception
{
getContext().checkContextMatch(constraints);
@@ -141,11 +147,11 @@ public class Solver extends Z3Object
constraints[i].getNativeObject(), ps[i].getNativeObject());
}
- // /
+ // /
// / Assert a constraint into the solver, and track it (in the unsat) core
// / using the Boolean constant p.
- // /
- // /
+ // /
+ // / Remarks:
// / This API is an alternative to with assumptions for
// extracting unsat cores.
// / Both APIs can be used in the same solver. The unsat core will contain a
@@ -153,7 +159,7 @@ public class Solver extends Z3Object
// / of the Boolean variables provided using
// and the Boolean literals
// / provided using with assumptions.
- // /
+ // /
public void assertAndTrack(BoolExpr constraint, BoolExpr p) throws Z3Exception
{
getContext().checkContextMatch(constraint);
@@ -193,8 +199,10 @@ public class Solver extends Z3Object
/**
* Checks whether the assertions in the solver are consistent or not.
- *
+ * Remarks:
+ * @see getModel
+ * @see getUnsatCore
+ * @see getProof
**/
public Status check(Expr... assumptions) throws Z3Exception
{
@@ -219,8 +227,10 @@ public class Solver extends Z3Object
/**
* Checks whether the assertions in the solver are consistent or not.
- *
+ * Remarks:
+ * @see getModel
+ * @see getUnsatCore
+ * @see getProof
**/
public Status check() throws Z3Exception
{
@@ -228,10 +238,11 @@ public class Solver extends Z3Object
}
/**
- * The model of the last Check. The result is
- * null if Check was not invoked before, if its
- * results was not SATISFIABLE, or if model production is not
- * enabled.
+ * The model of the last {@code Check}.
+ * Remarks: The result is
+ * {@code null} if {@code Check} was not invoked before, if its
+ * results was not {@code SATISFIABLE}, or if model production is not
+ * enabled.
*
* @throws Z3Exception
**/
@@ -245,10 +256,11 @@ public class Solver extends Z3Object
}
/**
- * The proof of the last Check. The result is
- * null if Check was not invoked before, if its
- * results was not UNSATISFIABLE, or if proof production is
- * disabled.
+ * The proof of the last {@code Check}.
+ * Remarks: The result is
+ * {@code null} if {@code Check} was not invoked before, if its
+ * results was not {@code UNSATISFIABLE}, or if proof production is
+ * disabled.
*
* @throws Z3Exception
**/
@@ -262,10 +274,11 @@ public class Solver extends Z3Object
}
/**
- * The unsat core of the last Check. The unsat core
- * is a subset of Assertions The result is empty if
- * Check was not invoked before, if its results was not
- * UNSATISFIABLE, or if core production is disabled.
+ * The unsat core of the last {@code Check}.
+ * Remarks: The unsat core
+ * is a subset of {@code Assertions} The result is empty if
+ * {@code Check} was not invoked before, if its results was not
+ * {@code UNSATISFIABLE}, or if core production is disabled.
*
* @throws Z3Exception
**/
@@ -282,8 +295,8 @@ public class Solver extends Z3Object
}
/**
- * A brief justification of why the last call to Check returned
- * UNKNOWN.
+ * A brief justification of why the last call to {@code Check} returned
+ * {@code UNKNOWN}.
**/
public String getReasonUnknown() throws Z3Exception
{
diff --git a/src/api/java/Sort.java b/src/api/java/Sort.java
index 7d89428c6..270abd43f 100644
--- a/src/api/java/Sort.java
+++ b/src/api/java/Sort.java
@@ -28,8 +28,8 @@ public class Sort extends AST
/* Overloaded operators are not translated. */
/**
- * Equality operator for objects of type Sort.
- *
+ * Equality operator for objects of type Sort.
+ * @param o
* @return
**/
public boolean equals(Object o)
@@ -98,18 +98,9 @@ public class Sort extends AST
/**
* Sort constructor
**/
- protected Sort(Context ctx) throws Z3Exception
- {
- super(ctx);
- {
- }
- }
-
Sort(Context ctx, long obj) throws Z3Exception
{
super(ctx, obj);
- {
- }
}
void checkNativeObject(long obj) throws Z3Exception
@@ -143,6 +134,10 @@ public class Sort extends AST
return new FiniteDomainSort(ctx, obj);
case Z3_RELATION_SORT:
return new RelationSort(ctx, obj);
+ case Z3_FLOATING_POINT_SORT:
+ return new FPSort(ctx, obj);
+ case Z3_ROUNDING_MODE_SORT:
+ return new FPRMSort(ctx, obj);
default:
throw new Z3Exception("Unknown sort kind");
}
diff --git a/src/api/java/Statistics.java b/src/api/java/Statistics.java
index 315feeaa2..88a897d15 100644
--- a/src/api/java/Statistics.java
+++ b/src/api/java/Statistics.java
@@ -24,7 +24,7 @@ public class Statistics extends Z3Object
{
/**
* Statistical data is organized into pairs of [Key, Entry], where every
- * Entry is either a DoubleEntry or a UIntEntry
+ * Entry is either a {@code DoubleEntry} or a {@code UIntEntry}
**/
public class Entry
{
@@ -176,8 +176,9 @@ public class Statistics extends Z3Object
}
/**
- * The value of a particular statistical counter. Returns null if
- * the key is unknown.
+ * The value of a particular statistical counter.
+ * Remarks: Returns null if
+ * the key is unknown.
*
* @throws Z3Exception
**/
diff --git a/src/api/java/StringSymbol.java b/src/api/java/StringSymbol.java
index 09273c946..4692b0fb9 100644
--- a/src/api/java/StringSymbol.java
+++ b/src/api/java/StringSymbol.java
@@ -25,8 +25,9 @@ import com.microsoft.z3.enumerations.Z3_symbol_kind;
public class StringSymbol extends Symbol
{
/**
- * The string value of the symbol. Throws an exception if the
- * symbol is not of string kind.
+ * The string value of the symbol.
+ * Remarks: Throws an exception if the
+ * symbol is not of string kind.
**/
public String getString() throws Z3Exception
{
diff --git a/src/api/java/Tactic.java b/src/api/java/Tactic.java
index 6573a1407..0286e786d 100644
--- a/src/api/java/Tactic.java
+++ b/src/api/java/Tactic.java
@@ -20,8 +20,8 @@ package com.microsoft.z3;
/**
* Tactics are the basic building block for creating custom solvers for specific
* problem domains. The complete list of tactics may be obtained using
- * Context.NumTactics and Context.TacticNames. It may
- * also be obtained using the command (help-tactics) in the SMT 2.0
+ * {@code Context.NumTactics} and {@code Context.TacticNames}. It may
+ * also be obtained using the command {@code (help-tactics)} in the SMT 2.0
* front-end.
**/
public class Tactic extends Z3Object
@@ -73,8 +73,8 @@ public class Tactic extends Z3Object
}
/**
- * Creates a solver that is implemented using the given tactic.
+ * Creates a solver that is implemented using the given tactic.
+ * @see Context#mkSolver(Tactic)
* @throws Z3Exception
**/
public Solver getSolver() throws Z3Exception
diff --git a/src/api/java/TupleSort.java b/src/api/java/TupleSort.java
index 523f8d676..87572b9ee 100644
--- a/src/api/java/TupleSort.java
+++ b/src/api/java/TupleSort.java
@@ -59,7 +59,7 @@ public class TupleSort extends Sort
TupleSort(Context ctx, Symbol name, int numFields, Symbol[] fieldNames,
Sort[] fieldSorts) throws Z3Exception
{
- super(ctx);
+ super(ctx, 0);
Native.LongPtr t = new Native.LongPtr();
setNativeObject(Native.mkTupleSort(ctx.nCtx(), name.getNativeObject(),
diff --git a/src/api/java/Version.java b/src/api/java/Version.java
index 3f019390b..6e2fe5084 100644
--- a/src/api/java/Version.java
+++ b/src/api/java/Version.java
@@ -18,7 +18,8 @@ Notes:
package com.microsoft.z3;
/**
- * Version information. Note that this class is static.
+ * Version information.
+ * Remarks: Note that this class is static.
**/
public class Version
{
diff --git a/src/api/ml/META b/src/api/ml/META
new file mode 100644
index 000000000..635de613c
--- /dev/null
+++ b/src/api/ml/META
@@ -0,0 +1,11 @@
+# META file for the "z3" package:
+version = "VERSION"
+description = "Z3 Theorem Prover (OCaml API)"
+requires = "num"
+archive(byte) = "z3ml.cma"
+archive(native) = "z3ml.cmxa"
+archive(byte,plugin) = "z3ml.cma"
+archive(native,plugin) = "z3ml.cmxa"
+archive(byte,toploop) = "z3ml.cma"
+archive(native,toploop) = "z3ml.cmxa"
+linkopts = "-cclib -lz3"
diff --git a/src/api/ml/Makefile b/src/api/ml/Makefile
index 55f89fe1c..96fd0a55d 100644
--- a/src/api/ml/Makefile
+++ b/src/api/ml/Makefile
@@ -1,14 +1,10 @@
-# to set ARGS, invoke as e.g.: $ make ARGS='-DUNSAFE_ERRORS -DLEAK_CONTEXTS'
-ARGS=
+# This is a temporary support file for emacs annotations.
+# It does not compile the Z3 ML API; this will be built
+# in the top-level build directory.
+all:
+ ocamlbuild -cflag -annot z3.cmxa
-default: z3.ml z3.mli z3_stubs.c
-
-
-%.ml %.mli %_stubs.c: ../%_api.h %.0.idl x3.ml x3V3.ml x3V3.mli \
- error_handling.idl mlx_get_app_args.idl mlx_get_array_sort.idl mlx_get_datatype_sort.idl mlx_get_domains.idl mlx_get_error_msg.idl mlx_get_pattern_terms.idl mlx_get_tuple_sort.idl mlx_mk_context_x.idl mlx_mk_datatypes.idl mlx_mk_numeral.idl mlx_mk_sort.idl mlx_mk_symbol.idl mlx_model.idl mlx_numeral_refine.idl mlx_parse_smtlib.idl mlx_sort_refine.idl mlx_statistics.idl mlx_symbol_refine.idl mlx_term_refine.idl \
- generate_mlapi.sh add_error_checking.V3.sed add_error_checking.sed preprocess.sed postprocess.sed reverse.sed
- ./generate_mlapi.sh $(ARGS)
-
-clean:
- rm -f z3.ml z3.mli z3_stubs.c
+doc: *.ml
+ mkdir -p doc
+ ocamldoc -html -d doc -I _build -sort *.mli -hide Z3
diff --git a/src/api/ml/Makefile.build b/src/api/ml/Makefile.build
deleted file mode 100644
index 0a737e356..000000000
--- a/src/api/ml/Makefile.build
+++ /dev/null
@@ -1,69 +0,0 @@
-# Makefile to compile OCaml interface to Z3
-#
-# Parameters: ARGS and DEPS environment variables
-# ARGS is passed through to the Makefile that generates the OCaml interface
-# DEPS is a sequence of files that are deleted when the OCaml interface changes
-
-SRC_ML=../../../src/api/ml
-ifeq (${OS}, Windows_NT)
-# the BLD_ML path ends up stored in z3.cm{,x}a, so it must be in windows format
-BLD_ML=$(shell cygpath -m $(CURDIR))
-CFLAGS=-ccopt -wd4090 -ccopt -I$(SRC_ML)/..
-XCDBG=-g $(CFLAGS)
-XCOPT=-ccopt -Ox -ccopt -Oy- $(CFLAGS)
-# ole32 is needed by camlidl (COM support)
-XLIB=-cclib ole32.lib
-AR=lib /nologo /LIBPATH:../../build ../../libz3.lib /out:
-O=obj
-A=lib
-else
-BLD_ML=$(CURDIR)
-CFLAGS=-ccopt -Wno-discard-qual -ccopt -Wno-unused-variable -ccopt -I$(SRC_ML)/..
-XCDBG=-g -ccopt -g $(CFLAGS)
-XCOPT=-ccopt -O3 -ccopt -fomit-frame-pointer $(CFLAGS)
-XLIB=
-AR=ar rcs # note trailing space is significant
-O=o
-A=a
-endif
-
-
-all: z3.cma z3.cmxa ocamlz3
-
-
-# keep these files to avoid repeatedly rebuilding them
-.PRECIOUS: $(SRC_ML)/z3.ml $(SRC_ML)/z3.mli $(SRC_ML)/z3_stubs.c z3.ml z3.mli z3_stubs.c z3_theory_stubs.c
-
-# regenerate OCaml API if needed
-$(SRC_ML)/%.mli $(SRC_ML)/%.ml $(SRC_ML)/%_stubs.c: $(SRC_ML)/Makefile
- make -C $(SRC_ML) z3.mli z3.ml z3_stubs.c
-
-# copy OCaml API from src to build directories
-%.mli %.ml %_stubs.c %_theory_stubs.c: $(SRC_ML)/%.mli $(SRC_ML)/%.ml $(SRC_ML)/%_stubs.c Makefile
- cp $(SRC_ML)/z3.mli $(SRC_ML)/z3.ml $(SRC_ML)/z3_stubs.c $(SRC_ML)/z3_theory_stubs.c .
-
-# OCaml library module for native code clients
-%.cmxa %.cmi lib%stubs.a %.a: %.mli %.ml %_stubs.c %_theory_stubs.c Makefile
- rm -f $(DEPS)
- ocamlopt.opt -c $(XCOPT) z3.mli z3.ml z3_stubs.c z3_theory_stubs.c
- $(AR)libz3stubs.$(A) z3.$(O) z3_stubs.$(O) z3_theory_stubs.$(O)
- ocamlopt.opt -a -cclib -L$(BLD_ML)/../.. $(XLIB) -cclib -lcamlidl -cclib -lz3 -cclib -lz3stubs z3.cmx -o z3.cmxa
- rm -f z3_theory_stubs.$(O) z3_stubs.$(O) z3.$(O) z3.cmx
-
-# OCaml library module for byte code clients
-%.cma %.cmi lib%stubs_dbg.a: %.mli %.ml %_stubs.c %_theory_stubs.c Makefile
- rm -f $(DEPS)
- ocamlc.opt -c $(XCDBG) z3.mli z3.ml z3_stubs.c z3_theory_stubs.c
- $(AR)libz3stubs_dbg.$(A) z3_stubs.$(O) z3_theory_stubs.$(O)
- ocamlc.opt -custom -a $(CXDBG) -cclib -L$(BLD_ML)/../.. $(XLIB) -cclib -lcamlidl -cclib -lz3 -cclib -lz3stubs_dbg z3.cmo -o z3.cma
- rm -f z3_theory_stubs.$(O) z3_stubs.$(O) z3.cmo
-
-
-# OCaml custom toplevel system pre-linked with Z3
-ocamlz3: z3.cma Makefile
- ocamlmktop -o ocamlz3 z3.cma -cclib -L.
-
-
-clean: Makefile
- make -C $(SRC_ML) clean
- rm -rf Makefile libz3stubs.$(A) libz3stubs_dbg.$(A) ocamlz3 ocamlz3.dSYM z3.$(O) z3.$(A) z3.cma z3.cmi z3.cmo z3.cmx z3.cmxa z3.ml z3.mli z3_stubs.$(O) z3_stubs.c z3_theory_stubs.$(O) z3_theory_stubs.c
diff --git a/src/api/ml/README b/src/api/ml/README
new file mode 100644
index 000000000..ffdd3e709
--- /dev/null
+++ b/src/api/ml/README
@@ -0,0 +1,11 @@
+This is the new ML API introduced with Z3 4.4. For the legacy bindings, please
+refer to previous releases of Z3.
+
+On Windows, there are no less than four different ports of OCaml. The Z3 build
+system assumes that either the win32 or the win64 port is installed. This means
+that OCaml will use `cl' as the underlying C compiler and not the cygwin or
+mingw compilers.
+
+By default, a make target called `ocamlfind_install' is added. This installs Z3
+into the ocamlfind package repository such that programs can be compiled via
+ocamlfind.
\ No newline at end of file
diff --git a/src/api/ml/README-linux b/src/api/ml/README-linux
deleted file mode 100644
index 5ee20bb27..000000000
--- a/src/api/ml/README-linux
+++ /dev/null
@@ -1,22 +0,0 @@
-The OCaml API for Z3 was tested using OCaml 3.12.1.
-You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- To build the OCaml API for Z3:
- ./build-lib.sh
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-
-Remark: Building the OCaml API copies some pathnames into files,
-so the OCaml API must be recompiled if the Z3 library files are moved.
-
-See ../examples/ocaml/build-test.sh for an example of how to compile and link with Z3.
-
-Acknowledgements:
-The OCaml interface for Z3 was written by Josh Berdine and Jakob Lichtenberg.
-Many thanks to them!
diff --git a/src/api/ml/README-osx b/src/api/ml/README-osx
deleted file mode 100644
index 5ee20bb27..000000000
--- a/src/api/ml/README-osx
+++ /dev/null
@@ -1,22 +0,0 @@
-The OCaml API for Z3 was tested using OCaml 3.12.1.
-You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- To build the OCaml API for Z3:
- ./build-lib.sh
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-
-Remark: Building the OCaml API copies some pathnames into files,
-so the OCaml API must be recompiled if the Z3 library files are moved.
-
-See ../examples/ocaml/build-test.sh for an example of how to compile and link with Z3.
-
-Acknowledgements:
-The OCaml interface for Z3 was written by Josh Berdine and Jakob Lichtenberg.
-Many thanks to them!
diff --git a/src/api/ml/README-test-linux b/src/api/ml/README-test-linux
deleted file mode 100644
index fc15fb2a2..000000000
--- a/src/api/ml/README-test-linux
+++ /dev/null
@@ -1,17 +0,0 @@
-This directory contains scripts to build the test application using
-OCaml. You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- One must build the OCaml library before compiling the example.
- Go to directory ../ocaml
-
-- Use 'build-test.sh' to build the test application using the OCaml compiler.
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-
-- Use 'exec.sh' to execute test_mlapi. The script sets LD_LIBRARY_PATH, and invokes test_mlapi.
diff --git a/src/api/ml/README-test-osx b/src/api/ml/README-test-osx
deleted file mode 100644
index 3a20d1f1d..000000000
--- a/src/api/ml/README-test-osx
+++ /dev/null
@@ -1,17 +0,0 @@
-This directory contains scripts to build the test application using
-OCaml. You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- One must build the OCaml library before compiling the example.
- Go to directory ../ocaml
-
-- Use 'build-test.sh' to build the test application using the OCaml compiler.
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-
-- Use 'exec.sh' to execute test_mlapi. The script sets DYLD_LIBRARY_PATH, and invokes test_mlapi.
diff --git a/src/api/ml/README-test-win b/src/api/ml/README-test-win
deleted file mode 100644
index 0e8b73ccd..000000000
--- a/src/api/ml/README-test-win
+++ /dev/null
@@ -1,23 +0,0 @@
-This directory contains scripts to build the test application using
-OCaml. You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- One must build the OCaml library before compiling the example.
- Go to directory ../ocaml
-
-- Use 'build-test.cmd' to build the test application using the OCaml compiler.
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-Running from the Visual Studio Command Prompt configures the Microsoft C compiler.
-
-- The script 'exec.cmd' adds the bin directory to the path. So,
- test_mlapi.exe can find z3.dll.
-
-
-
-
diff --git a/src/api/ml/README-win b/src/api/ml/README-win
deleted file mode 100644
index 82ddc2652..000000000
--- a/src/api/ml/README-win
+++ /dev/null
@@ -1,23 +0,0 @@
-The OCaml API for Z3 was tested using OCaml 3.12.1.
-You also need CamlIDL to be able to generate the OCaml API.
-
-- To download OCaml:
- http://caml.inria.fr/ocaml/
-
-- To download CamlIDL:
- http://forge.ocamlcore.org/projects/camlidl/
-
-- To build the OCaml API for Z3:
- .\build-lib.cmd
-
-Remark: The OCaml and C compiler tool chains must be configured in your environment.
-Running from the Visual Studio Command Prompt configures the Microsoft C compiler.
-
-Remark: Building the OCaml API copies some pathnames into files,
-so the OCaml API must be recompiled if the Z3 library files are moved.
-
-See ..\examples\ocaml\build-test.cmd for an example of how to compile and link with Z3.
-
-Acknowledgements:
-The OCaml interface for Z3 was written by Josh Berdine and Jakob Lichtenberg.
-Many thanks to them!
diff --git a/src/api/ml/add_error_checking.V3.sed b/src/api/ml/add_error_checking.V3.sed
deleted file mode 100644
index 7df291520..000000000
--- a/src/api/ml/add_error_checking.V3.sed
+++ /dev/null
@@ -1,2 +0,0 @@
-# Customize error handling for contexts created in ML:
-s/Z3_API Z3_mk_context(\(.*\))/Z3_API Z3_mk_context(\1) quote(dealloc,\"Z3_set_error_handler(_res, (void*)caml_z3_error_handler);\")/g
diff --git a/src/api/ml/add_error_checking.sed b/src/api/ml/add_error_checking.sed
deleted file mode 100644
index 71c06b9e4..000000000
--- a/src/api/ml/add_error_checking.sed
+++ /dev/null
@@ -1,113 +0,0 @@
-# Do not add epilogue to Z3_del_context
-/Z3_API .*Z3_del_context.*/b endt
-
-# Add error checking epilogue for all Z3_API functions that accept two Z3_contexts
-:begincc
-# add epilogue for two Z3_context parameters and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5\6) quote(dealloc,\"check_error_code(\3);\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5) quote(dealloc,\"check_error_code(\3);\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\))[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5\6) quote(dealloc,\"check_error_code(\3);\")/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5) quote(dealloc,\"check_error_code(\3);\")/g
-t endt
-
-# if complete prototype, done with two Z3_contexts
-/Z3_API .*(.*);[ ]*$/b endcc
-/Z3_API .*(.*)[ ]*$/b endcc
-
-# if incomplete prototype
-/Z3_API .*(.*/{
-
- # read another line
- N
-
- # add epilogue for two Z3_context parameters and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5\6) quote(dealloc,\"check_error_code(\3); check_error_code(\5);\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5) quote(dealloc,\"check_error_code(\3); check_error_code(\5);\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\))[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5\6) quote(dealloc,\"check_error_code(\3); check_error_code(\5);\")/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\(.*\)Z3_context \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_context \3\4Z3_context \5) quote(dealloc,\"check_error_code(\3); check_error_code(\5);\")/g
- t endt
-
- # else keep looking for two Z3_contexts
- b begincc
-}
-:endcc
-
-# Add error checking epilogue for all Z3_API functions that accept one Z3_context
-:beginc
-# add epilogue for one Z3_context parameter and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_context \3\4) quote(dealloc,\"check_error_code(\3);\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_context \3) quote(dealloc,\"check_error_code(\3);\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\)[ ]*$/Z3_API \1(\2Z3_context \3\4) quote(dealloc,\"check_error_code(\3);\")/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_context \3) quote(dealloc,\"check_error_code(\3);\")/g
-t endt
-
-# if complete prototype, done with all Z3_contexts
-/Z3_API .*(.*);[ ]*$/b endc
-/Z3_API .*(.*)[ ]*$/b endc
-
-# if incomplete prototype
-/Z3_API .*(.*/{
-
- # read another line
- N
-
- # add epilogue for one Z3_context parameter and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_context \3\4) quote(dealloc,\"check_error_code(\3);\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_context \3) quote(dealloc,\"check_error_code(\3);\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\)\([^a-zA-Z].*\))[ ]*$/Z3_API \1(\2Z3_context \3\4) quote(dealloc,\"check_error_code(\3);\")/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_context \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_context \3) quote(dealloc,\"check_error_code(\3);\")/g
- t endt
-
- # else keep looking for one Z3_context
- b beginc
-}
-:endc
-
-
-# Add error checking epilogue for all Z3_API functions that accept a Z3_theory
-:begint
-# add epilogue for one Z3_theory parameter and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
-s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_theory \3\4) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_theory \3) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\");/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\)\([^a-zA-Z].*\))[ ]*$/Z3_API \1(\2Z3_theory \3\4) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\")/g
-t endt
-s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_theory \3) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\")/g
-t endt
-
-# if complete prototype, done with all Z3_theorys
-/Z3_API .*(.*);[ ]*$/b endt
-/Z3_API .*(.*)[ ]*$/b endt
-
-/Z3_API .*(.*/{
-
- # read another line
- N
-
- # add epilogue for one Z3_theory parameter and if a match was found, done with all Z3_contexts and Z3_theorys so jump to endt
- s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\)\([^a-zA-Z].*\));[ ]*$/Z3_API \1(\2Z3_theory \3\4) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\));[ ]*$/Z3_API \1(\2Z3_theory \3) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\");/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\)\([^a-zA-Z].*\))[ ]*$/Z3_API \1(\2Z3_theory \3\4) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\")/g
- t endt
- s/Z3_API \(.*\)(\(.*\)Z3_theory \([a-zA-Z]*\))[ ]*$/Z3_API \1(\2Z3_theory \3) quote(dealloc,\"check_error_code(Z3_theory_get_context(\3));\")/g
- t endt
-
- # else keep looking for one Z3_theory
- b begint
-}
-:endt
diff --git a/src/api/ml/build-lib.cmd b/src/api/ml/build-lib.cmd
deleted file mode 100755
index 7cf1bbcbd..000000000
--- a/src/api/ml/build-lib.cmd
+++ /dev/null
@@ -1,3 +0,0 @@
-@echo off
-
-call .\compile_mlapi.cmd ..\include ..\bin ..\bin
diff --git a/src/api/ml/build-lib.sh b/src/api/ml/build-lib.sh
deleted file mode 100644
index 93c7262b1..000000000
--- a/src/api/ml/build-lib.sh
+++ /dev/null
@@ -1,31 +0,0 @@
-#!/bin/bash
-
-# Script to compile the Z3 OCaml API
-# Expects to find ../lib/libz3{,_dbg}.{a,so,dylib}
-
-CFLAGS="-ccopt -Wno-discard-qual -ccopt -I../include"
-XCDBG="-g -ccopt -g $CFLAGS"
-XCOPT="-ccopt -O3 -ccopt -fomit-frame-pointer $CFLAGS"
-
-
-ocamlc -c $XCDBG z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-
-ocamlopt -c $XCDBG z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-
-ar rcs libz3stubs_dbg.a z3.o z3_stubs.o z3_theory_stubs.o
-
-ocamlopt -c $XCOPT z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-
-ar rcs libz3stubs.a z3.o z3_stubs.o z3_theory_stubs.o
-
-ocamlc -custom -a $XCDBG -cclib -L$PWD/../lib -cclib -lz3_dbg -cclib -lcamlidl -cclib -lz3stubs_dbg z3.cmo -o z3_dbg.cma
-
-ocamlc -custom -a $XCDBG -cclib -L$PWD/../lib -cclib -lz3 -cclib -lcamlidl -cclib -lz3stubs z3.cmo -o z3.cma
-
-ocamlopt -a $XCDBG -cclib -L$PWD/../lib -cclib -lz3_dbg -cclib -lcamlidl -cclib -lz3stubs_dbg z3.cmx -o z3_dbg.cmxa
-
-ocamlopt -a $XCOPT -cclib -L$PWD/../lib -cclib -lz3 -cclib -lcamlidl -cclib -lz3stubs z3.cmx -o z3.cmxa
-
-ocamlmktop -o ocamlz3 z3.cma -cclib -L.
-
-rm z3.cm{o,x} *.o
diff --git a/src/api/ml/build-test.cmd b/src/api/ml/build-test.cmd
deleted file mode 100755
index 13a752dbb..000000000
--- a/src/api/ml/build-test.cmd
+++ /dev/null
@@ -1,19 +0,0 @@
-@echo off
-
-if not exist ..\..\ocaml\z3.cmxa (
- echo "YOU MUST BUILD OCAML API! Go to directory ..\ocaml"
- goto :EOF
-)
-
-REM ocaml (>= 3.11) calls the linker through flexlink
-ocamlc -version >> ocaml_version
-set /p OCAML_VERSION= NUL z3_stubs.c z3.mli z3.ml z3V3_stubs.*.c z3V3.*.mli z3V3.*.ml
-
-REM files produced by update-ml-doc.cmd
-rd 2>NUL /s /q doc
-
-exit /B 0
diff --git a/src/api/ml/cleantmp.cmd b/src/api/ml/cleantmp.cmd
deleted file mode 100755
index 257e26a96..000000000
--- a/src/api/ml/cleantmp.cmd
+++ /dev/null
@@ -1,15 +0,0 @@
-@echo off
-
-REM Script to delete intermediate temporary files from generating Z3 OCaml API
-
-REM files produced by generate_mlapi.cmd
-del /q 2>NUL z3_api.idl
-
-REM files produced by compile_mlapi.cmd
-del /q 2>NUL *.cmi *.cmo *.cmx *.cma *.cmxa *.obj *.lib *.pdb ocamlz3.exe
-
-REM files produced by test_mlapi.cmd
-del /q 2>NUL test*.exe queen*.exe test_*api.out test_*apiV3.out test_*api.err test_*apiV3.err queen.out queen.err z3.log ml.log test_mlapi.log .z3-trace
-
-REM backup files
-del /q 2>NUL *~
diff --git a/src/api/ml/compile_mlapi.cmd b/src/api/ml/compile_mlapi.cmd
deleted file mode 100755
index 17776b6b8..000000000
--- a/src/api/ml/compile_mlapi.cmd
+++ /dev/null
@@ -1,98 +0,0 @@
-@echo off
-SETLOCAL
-
-REM Script to compile the Z3 OCaml API
-REM
-REM Compiles byte and debug native code versions with debug info, optimized native code versions without
-REM
-REM Assumes that environment variables are set to provide access to the C and OCaml compilers
-
-REM directory containing z3_api.h
-set Z3SRC=%1
-
-REM directory containing z3.dll
-set Z3BIN=%2
-
-REM directory containing debug z3.dll
-set Z3BINDBG=%3
-
-REM link Z3 statically or dynamically
-set STATIC=false
-REM set STATIC=true
-
-if %STATIC% == true (
- set Z3LIB=z3lib.lib
- set Z3DBGLIB=z3lib.lib
-) else (
- set Z3LIB=z3.lib
- set Z3DBGLIB=z3.lib
-)
-
-REM ocaml 3.11 and later calls the linker through flexlink
-ocamlc -version >> ocaml_version
-set /p OCAML_VERSION= DBG z3_stubs.obj z3.{cmi,cmo,obj}
-ocamlc -c %XCDBG% z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-if errorlevel 1 goto :EOF
-
-REM z3_stubs.c z3_theory_stubs.c z3.mli z3.ml -> DBG z3_stubs.obj z3.{cmi,cmx,obj}
-ocamlopt -c %XCDBG% z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-if errorlevel 1 goto :EOF
-
-REM %Z3DBGLIB% z3.obj z3_stubs.obj z3_theory_stubs.obj -> libz3_dbg.lib:
-lib /nologo %XLIBPATH% /out:libz3_dbg.lib %Z3BINDBG%\%Z3DBGLIB% z3.obj z3_stubs.obj z3_theory_stubs.obj
-if errorlevel 1 goto :EOF
-
-REM z3_stubs.c z3_theory_stubs.c z3.mli z3.ml -> OPT z3_stubs.obj z3.{cmi,cmx,obj}
-ocamlopt -c %XCOPT% z3_stubs.c z3_theory_stubs.c z3.mli z3.ml
-if errorlevel 1 goto :EOF
-
-REM %Z3LIB% z3.obj z3_stubs.obj z3_theory_stubs.obj -> libz3.lib:
-lib /nologo %XLIBPATH% /out:libz3.lib %Z3BIN%\%Z3LIB% z3.obj z3_stubs.obj z3_theory_stubs.obj
-if errorlevel 1 goto :EOF
-
-
-REM ole32.lib is needed by camlidl
-REM camlidl.lib is the runtime library for camlidl
-REM psapi.lib is needed when statically linking Z3 for process statistics functions
-
-REM libz3_dbg.lib ole32.lib camlidl.lib z3.cmo -> z3_dbg.cma
-ocamlc -custom -a %XCDBG% -cclib -L"%CD%\..\bin" -cclib -lz3_dbg -cclib ole32.lib -cclib -lcamlidl -cclib psapi.lib z3.cmo -o z3_dbg.cma
-if errorlevel 1 goto :EOF
-
-REM libz3.lib ole32.lib camlidl.lib z3.cmo -> z3.cma
-ocamlc -custom -a -cclib -L"%CD%\..\bin" -cclib -lz3 -cclib ole32.lib -cclib -lcamlidl -cclib psapi.lib z3.cmo -o z3.cma
-if errorlevel 1 goto :EOF
-
-
-REM libz3_dbg.lib ole32.lib camlidl.lib z3.cmx -> z3_dbg.cmxa
-ocamlopt -a -cclib -L"%CD%\..\bin" -cclib -lz3_dbg -cclib ole32.lib -cclib -lcamlidl -cclib psapi.lib z3.cmx -o z3_dbg.cmxa
-if errorlevel 1 goto :EOF
-
-REM libz3.lib ole32.lib camlidl.lib z3.cmx -> z3.cmxa
-ocamlopt -a -cclib -L"%CD%\..\bin" -cclib -lz3 -cclib ole32.lib -cclib -lcamlidl -cclib psapi.lib z3.cmx -o z3.cmxa
-if errorlevel 1 goto :EOF
-
-
-REM build OCaml toplevel 'ocamlz3' pre-linked with Z3
-ocamlmktop -o ocamlz3 z3.cma
-if errorlevel 1 goto :EOF
-
-
-del /q 2>NUL z3.cmo z3.cmx *.obj
-
-ENDLOCAL
diff --git a/src/api/ml/error_handling.idl b/src/api/ml/error_handling.idl
deleted file mode 100644
index 5a2ec9915..000000000
--- a/src/api/ml/error_handling.idl
+++ /dev/null
@@ -1,165 +0,0 @@
-/*++
-Copyright (c) Microsoft Corporation
-
-Module Name:
-
- error_handling
-
-Abstract:
-
- Error handling in the OCaml API for Z3.
-
- The wrapper of each Z3 API routine that takes a Z3_context or a Z3_theory
- argument calls check_error_code before returning. (These calls are added
- in generate_mlapi.cmd using the build.sed script.)
-
- There are two error handling schemes implemented, depending on whether
- (UN)SAFE_ERRORS is set.
-
- - SAFE_ERRORS checks Z3_error_code after each call and raises an OCaml
- exception in error conditions. Z3_set_error_handler is not exposed by
- the SAFE_ERRORS version.
-
- - UNSAFE_ERRORS sets a Z3 error handler routine that either calls a
- globally registered OCaml function or, by default, raises an OCaml
- exception. This avoids overhead of repeatedly checking
- Z3_get_error_code, but leaves Z3 in a broken state.
-
-Notes:
-
- The current SAFE_ERRORS implementation interacts badly with theory plugin
- callbacks. Z3 errors are converted into OCaml exceptions, which the
- wrappers of theory plugin callbacks are not expecting. Therefore, if a
- theory plugin calls a Z3 API routine that triggers an error, an OCaml
- exception will be raised and bypass any C++ destructors pushed onto the
- stack by Z3 before the call to the plugin and after the preceding OCaml
- exception handler. One solution to this would be to modify the theory
- plugin callback registration functions to wrap callbacks in an OCaml
- exception handler. Since OCaml exceptions are cheap to raise at the
- expense of some cost to install a handler, this may not be desirable.
- Another solution would be to modify check_error_code to detect if it is
- executing in a plugin callback and simply maintain the Z3_error_code, or
- raise a C++ exception, instead of raising an OCaml exception.
-
-Author:
-
- Josh Berdine (jjb) 2012-03-21
-
---*/
-
-
-#if !defined(UNSAFE_ERRORS) && !defined(SAFE_ERRORS)
-#define SAFE_ERRORS
-#endif
-
-
-// The V3 API uses a single handler irregardless of UNSAFE_ERRORS
-quote(c,"
-/* All contexts share the same handler */
-static value caml_z3_error_handler = 0;
-");
-
-#ifdef SAFE_ERRORS
-
-quote(mlmli,"
-(** Exceptions raised by Z3. It is safe to continue interacting with Z3 after
- catching [Error] exceptions.
-
- - {b See also}: {!get_error_msg}
-*)
-exception Error of context * error_code
-");
-quote(ml,"
-(* Register dynamically-generated exception tag for use from C *)
-let _ = Callback.register_exception \"Z3.Error\" (Error (Obj.magic None, OK))
-");
-
-quote(c,"
-value camlidl_c2ml_z3_Z3_error_code(Z3_error_code * _c2, camlidl_ctx _ctx);
-
-/* Error checking routine that raises OCaml Error exceptions */
-void check_error_code (Z3_context c)
-{
- static struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- value* exn_tag = NULL;
- value ctx_err[2];
- Z3_error_code e;
- e = Z3_get_error_code(c);
- if (e != Z3_OK) {
- ctx_err[0] = c2ml_Z3_context(&c);
- ctx_err[1] = camlidl_c2ml_z3_Z3_error_code(&e, &_ctxs);
- exn_tag = caml_named_value(\"Z3.Error\");
- if (*exn_tag == 0) {
- fprintf(stderr, \"Z3.Error not found\");
- exit(1);
- }
- caml_raise_with_args(*exn_tag, 2, ctx_err);
- }
-}
-
-/* Disable default error handler, all error checking is done by check_error_code */
-void* error_handler_static = NULL;
-");
-
-#else
-
-quote(mlmli,"
-(** Exceptions raised by Z3. {b Warning}: It is unsafe to continue
- interacting with Z3 after catching [Error] exceptions. To recover from
- error conditions, use {!set_error_handler} to set an error handler that
- does nothing, and then test {!get_error_code} after every call to Z3.
-
- - {b See also}: {!get_error_msg}
-*)
-exception Error of context * error_code
-");
-quote(ml,"
-(* Register dynamically-generated exception tag for use from C *)
-let _ = Callback.register_exception \"Z3.Error\" (Error (Obj.magic None, OK))
-");
-
-quote(c,"
-/* Error checking routine that does nothing */
-void check_error_code(Z3_context c) {}
-
-static void error_handler_static (Z3_context c, Z3_error_code e)
-{
- static struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- value* exn_tag = NULL;
- value ctx_err[2];
- ctx_err[0] = c2ml_Z3_context(&c);
- ctx_err[1] = camlidl_c2ml_z3_Z3_error_code(&e, &_ctxs);
- if (caml_z3_error_handler) {
- caml_callback2(caml_z3_error_handler, ctx_err[0], ctx_err[1]);
- } else {
- /* if no handler set, raise OCaml Error exception */
- exn_tag = caml_named_value(\"Z3.Error\");
- if (*exn_tag == 0) {
- fprintf(stderr, \"Z3.Error not found\");
- exit(1);
- }
- caml_raise_with_args(*exn_tag, 2, ctx_err);
- }
-}
-
-void ml2c_Z3_error_handler (value ml_handler, void* c_handler)
-{
- caml_z3_error_handler = ml_handler;
- c_handler = (void*)error_handler_static;
-}
-
-/* Never called */
-value c2ml_Z3_error_handler (void* _)
-{
- return 0;
-}
-");
-
-typedef [mltype("context -> error_code -> unit"),
- ml2c(ml2c_Z3_error_handler),
- c2ml(c2ml_Z3_error_handler)
- ] void Z3_error_handler;
-
-quote(c,"#define Z3_error_handler void*");
-
-#endif
diff --git a/src/api/ml/exec.cmd b/src/api/ml/exec.cmd
deleted file mode 100755
index 2bb632ef6..000000000
--- a/src/api/ml/exec.cmd
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-SETLOCAL
-set PATH=..\..\bin;%PATH%
-test_mlapi.exe
-ENDLOCAL
diff --git a/src/api/ml/exec.sh b/src/api/ml/exec.sh
deleted file mode 100644
index 573ec6ddf..000000000
--- a/src/api/ml/exec.sh
+++ /dev/null
@@ -1,4 +0,0 @@
-#!/bin/sh
-export LD_LIBRARY_PATH=../../lib:$LD_LIBRARY_PATH # for linux
-export DYLD_LIBRARY_PATH=../../lib:$DYLD_LIBRARY_PATH # for osx
-./test_mlapi
diff --git a/src/api/ml/generate_mlapi.cmd b/src/api/ml/generate_mlapi.cmd
deleted file mode 100755
index 6a796a401..000000000
--- a/src/api/ml/generate_mlapi.cmd
+++ /dev/null
@@ -1,72 +0,0 @@
-@echo off
-
-REM Script to generate the Z3 OCaml API
-REM
-REM Assumes that environment variables are set to provide access to the following commands: camlidl, dos2unix, grep, sed, unix2dos
-REM
-REM Invoke with "-D UNSAFE_ERRORS" to build version that does not support recoverable errors, but avoids some error-checking overhead.
-REM Invoke with "-D LEAK_CONTEXTS" to build version that leaks Z3_context objects, but avoids some garbage-collection overhead.
-
-REM ../lib/z3_api.h -> z3V3_api.idl using add_error_checking.V3.sed and build.sed
-sed -f add_error_checking.V3.sed ../lib/z3_api.h | sed -f build.sed >z3V3_api.idl
-if errorlevel 1 goto :EOF
-
-REM z3.idl -> z3V3_stubs.c, z3V3.mli, z3V3.ml
-camlidl -D MLAPIV3 %* z3.idl
-move >NUL z3_stubs.c z3V3_stubs.c
-move >NUL z3.ml z3V3.ml
-move >NUL z3.mli z3V3.mli
-if errorlevel 1 goto :EOF
-
-REM ../lib/z3_api.h -> z3_api.idl
-REM add calls to error checking routine
-REM convert from doxygen to ocamldoc markup and other syntactic munging
-sed <../lib/z3_api.h -f add_error_checking.sed | ^
-sed -f build.sed >z3_api.idl
-if errorlevel 1 goto :EOF
-
-REM z3.idl -> z3_stubs.c, z3.mli, z3.ml
-camlidl %* z3.idl
-if errorlevel 1 goto :EOF
-
-REM sometimes z3_stubs.c can be generated with mixed line endings, which can confuse sed and grep
-dos2unix 2>NUL z3V3_stubs.c ; unix2dos 2>NUL z3V3_stubs.c
-dos2unix 2>NUL z3_stubs.c ; unix2dos 2>NUL z3_stubs.c
-
-REM modify generated z3.ml{,i} to remove "Z3_" prefix from names
-move >NUL z3V3.mli z3V3.1.mli && sed "s/{\!Z3\./{!/g;s/\<[zZ]3_//g" z3V3.1.mli >z3V3.mli && del z3V3.1.mli
-move >NUL z3V3.ml z3V3.1.ml && sed "s/{\!Z3\./{!/g;s/\<[zZ]3_//g" z3V3.1.ml >z3V3.ml && del z3V3.1.ml
-move >NUL z3.mli z3.1.mli && sed "s/{\!Z3\./{!/g;s/\<[zZ]3_//g" z3.1.mli >z3.mli && del z3.1.mli
-move >NUL z3.ml z3.1.ml && sed "s/{\!Z3\./{!/g;s/\<[zZ]3_//g" z3.1.ml >z3.ml && del z3.1.ml
-
-REM modify generated z3V3 files to rename z3_ to z3V3_
-move >NUL z3V3.mli z3V3.2.mli && sed "s/camlidl\(.*\)_z3_/camlidl\1_z3V3_/g" z3V3.2.mli >z3V3.mli && del z3V3.2.mli
-move >NUL z3V3.ml z3V3.2.ml && sed "s/camlidl\(.*\)_z3_/camlidl\1_z3V3_/g" z3V3.2.ml >z3V3.ml && del z3V3.2.ml
-move >NUL z3V3_stubs.c z3V3_stubs.2.c && sed "s/camlidl\(.*\)_z3_/camlidl\1_z3V3_/g" z3V3_stubs.2.c >z3V3_stubs.c && del z3V3_stubs.2.c
-
-
-REM substitute out type equations for enums and options
-REM reverse order of substitution of enums to avoid matching prefixes such as enum_1 of enum_10
-grep "^and \([a-z][a-zA-Z_]*\) = \([a-z][a-zA-Z_]*[0-9]*\)$" z3.mli | sed "s|and \([a-zA-Z_]*\) = \([ a-zA-Z_0-9]*\)|s/\2/\1/g|g" | sed "1!G;h;$!d" >rename.sed
-grep "^and \([a-z][a-zA-Z_]*\) = \([a-z][a-zA-Z_]* option*\)$" z3.mli | sed "s|and \([a-zA-Z_]*\) = \([ a-zA-Z_0-9]*\)|s/\1/\2/g|g" >>rename.sed
-move >NUL z3.mli z3.3.mli && sed -f rename.sed z3.3.mli >z3.mli && del z3.3.mli
-move >NUL z3.ml z3.3.ml && sed -f rename.sed z3.3.ml >z3.ml && del z3.3.ml
-del rename.sed
-
-grep "^and \([a-z][a-zA-Z_]*\) = \([a-z][a-zA-Z_]*[0-9]*\)$" z3V3.mli | sed "s|and \([a-zA-Z_]*\) = \([ a-zA-Z_0-9]*\)|s/\2/\1/g|g" | sed "1!G;h;$!d" >rename.sed
-grep "^and \([a-z][a-zA-Z_]*\) = \([a-z][a-zA-Z_]* option*\)$" z3V3.mli | sed "s|and \([a-zA-Z_]*\) = \([ a-zA-Z_0-9]*\)|s/\1/\2/g|g" >>rename.sed
-move >NUL z3V3.mli z3V3.3.mli && sed -f rename.sed z3V3.3.mli >z3V3.mli && del z3V3.3.mli
-move >NUL z3V3.ml z3V3.3.ml && sed -f rename.sed z3V3.3.ml >z3V3.ml && del z3V3.3.ml
-del rename.sed
-
-REM remove cyclic definitions introduced by substituting type equations
-move >NUL z3V3.mli z3V3.4.mli && sed "s/^and \([a-z][a-zA-Z_ ]*\) = \1$//g" z3V3.4.mli >z3V3.mli && del z3V3.4.mli
-move >NUL z3V3.ml z3V3.4.ml && sed "s/^and \([a-z][a-zA-Z_ ]*\) = \1$//g" z3V3.4.ml >z3V3.ml && del z3V3.4.ml
-move >NUL z3.mli z3.4.mli && sed "s/^and \([a-z][a-zA-Z_ ]*\) = \1$//g" z3.4.mli >z3.mli && del z3.4.mli
-move >NUL z3.ml z3.4.ml && sed "s/^and \([a-z][a-zA-Z_ ]*\) = \1$//g" z3.4.ml >z3.ml && del z3.4.ml
-
-REM append Z3.V3 module onto Z3 module
-type z3V3.ml >> z3.ml
-type z3V3.mli >> z3.mli
-sed "1,22d" z3V3_stubs.c >> z3_stubs.c
-del /q 2>NUL z3V3_api.idl z3V3.ml z3V3.mli z3V3_stubs.c
diff --git a/src/api/ml/generate_mlapi.sh b/src/api/ml/generate_mlapi.sh
deleted file mode 100755
index dd8692833..000000000
--- a/src/api/ml/generate_mlapi.sh
+++ /dev/null
@@ -1,53 +0,0 @@
-#!/bin/bash
-
-# Script to generate the Z3 OCaml API
-#
-# Assumes that environment variables are set to provide access to the following commands: camlidl, gcc, grep, sed
-#
-# This script uses 'gcc -E' as the C preprocessor, other C preprocessors may work but have not been tested.
-#
-# Invoke with "-DUNSAFE_ERRORS" to build version that does not support recoverable errors, but avoids some error-checking overhead.
-# Invoke with "-DLEAK_CONTEXTS" to build version that leaks Z3_context objects, but avoids some garbage-collection overhead.
-
-
-# add calls to error checking routine
-# convert from doxygen to ocamldoc markup and other syntactic munging
-# ../z3_api.h -> z3V3_api.idl
-sed -f add_error_checking.V3.sed -f preprocess.sed ../z3_api.h > z3V3_api.idl
-
-# z3.idl (z3V3_api.idl x3V3.mli x3V3.ml) -> z3V3_stubs.c, z3V3.mli, z3V3.ml
-gcc -E -w -P -CC -xc -DCAMLIDL -DMLAPIV3 $@ z3.0.idl > z3V3.idl
-camlidl -nocpp z3V3.idl
-
-# reverse.sed to reverse order of substitution of enums to avoid matching prefixes such as enum_1 of enum_10
-grep "^and z3_[a-zA-Z0-9_]* = [a-z][a-zA-Z0-9_]*$" z3V3.mli | sed -e "s|and z3_\([a-zA-Z0-9_]*\) = \([a-zA-Z0-9_]*\)|s/\2/\1/g|g" -f reverse.sed > /tmp/renameV3.sed
-grep "^and z3_[a-zA-Z0-9_]* = [a-z][a-zA-Z0-9_ ]* option$" z3V3.mli | sed -e "s|and \(z3_[a-zA-Z0-9_]*\) = \([a-zA-Z0-9_ ]*\)|s/\1/\2/g|g" >> /tmp/renameV3.sed
-
-# rename.sed to substitute out type equations for enums and options, then postprocess
-cp -f z3V3.mli z3V3.ml /tmp
-sed -f /tmp/renameV3.sed -f postprocess.sed /tmp/z3V3.mli > z3V3.mli
-sed -f /tmp/renameV3.sed -f postprocess.sed /tmp/z3V3.ml > z3V3.ml
-
-# ../z3_api.h -> z3_api.idl
-sed -f add_error_checking.sed -f preprocess.sed ../z3_api.h > z3_api.idl
-
-# z3.idl (z3_api.idl x3.ml) -> z3_stubs.c, z3.mli, z3.ml
-gcc -E -w -P -CC -xc -I. -DCAMLIDL $@ z3.0.idl > z3.idl
-camlidl -nocpp z3.idl
-
-# reverse.sed to reverse order of substitution of enums to avoid matching prefixes such as enum_1 of enum_10
-grep "^and z3_[a-zA-Z0-9_]* = [a-z][a-zA-Z0-9_]*$" z3.mli | sed -e "s|and z3_\([a-zA-Z0-9_]*\) = \([a-zA-Z0-9_]*\)|s/\2/\1/g|g" -f reverse.sed > /tmp/rename.sed
-grep "^and z3_[a-zA-Z0-9_]* = [a-z][a-zA-Z0-9_ ]* option$" z3.mli | sed -e "s|and \(z3_[a-zA-Z0-9_]*\) = \([a-zA-Z0-9_ ]*\)|s/\1/\2/g|g" >> /tmp/rename.sed
-
-# rename.sed to substitute out type equations for enums and options, then postprocess
-cp z3.mli z3.ml /tmp
-sed -f /tmp/rename.sed -f postprocess.sed /tmp/z3.mli > z3.mli
-sed -f /tmp/rename.sed -f postprocess.sed /tmp/z3.ml > z3.ml
-
-
-# append Z3.V3 module onto Z3 module
-cat z3V3.mli >> z3.mli
-cat z3V3.ml >> z3.ml
-sed "1,22d" z3V3_stubs.c >> z3_stubs.c
-
-rm -f z3V3_api.idl z3V3.idl z3V3.ml z3V3.mli z3V3_stubs.c z3_api.idl z3.idl
diff --git a/src/api/ml/import.cmd b/src/api/ml/import.cmd
deleted file mode 100755
index b5239e011..000000000
--- a/src/api/ml/import.cmd
+++ /dev/null
@@ -1,55 +0,0 @@
-@echo off
-SETLOCAL
-
-:CHECKARG1
-if not "%1"=="" (
- set SDTROOT=%1
- goto :CHECKARG2
-)
-
-goto :FAIL
-
-
-:CHECKARG2
-if "%2"=="" (
- goto :IMPORT
-)
-
-goto :FAIL
-
-
-:IMPORT
-cd import
-sd edit ...
-del z3.h z3_api.h z3_macros.h z3lib.lib msbig_rational.lib z3.exe test_capi.c test_mlapi_header.html z3_mlapi_header.html mldoc_footer.html tabs.css z3.png z3_ml.css
-copy %SDTROOT%\lib\z3.h
-copy %SDTROOT%\lib\z3_api.h
-copy %SDTROOT%\lib\z3_macros.h
-copy %SDTROOT%\release_mt\z3lib.lib
-copy %SDTROOT%\release_mt\msbig_rational.lib
-copy %SDTROOT%\release_mt\z3.exe
-copy %SDTROOT%\test_capi\test_capi.c
-copy %SDTROOT%\doc\test_mlapi_header.html
-copy %SDTROOT%\doc\z3_mlapi_header.html
-copy %SDTROOT%\doc\mldoc_footer.html
-copy %SDTROOT%\doc\html\tabs.css
-copy %SDTROOT%\doc\z3.png
-copy %SDTROOT%\doc\z3_ml.css
-sd add ...
-sd revert -a ...
-cd ..
-goto :END
-
-:FAIL
-echo "Usage:"
-echo " %0 SDTROOT"
-echo ""
-echo "Examples:"
-echo " %0 \\risebuild\drops\z32\2.0.51220.7"
-echo " %0 \\risebuild\drops\z32\latest"
-echo " %0 J:\SD\other\sdt1\src\z3_2"
-echo ""
-goto :END
-
-:END
-ENDLOCAL
diff --git a/src/api/ml/mlx_get_app_args.idl b/src/api/ml/mlx_get_app_args.idl
deleted file mode 100644
index fe3407af8..000000000
--- a/src/api/ml/mlx_get_app_args.idl
+++ /dev/null
@@ -1,11 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_app_args c a ] \] is the array of arguments of an application. If [t] is a constant, then the array is empty.
-
- - {b See also}: {!get_app_num_args}
- - {b See also}: {!get_app_arg}
-*)
-val get_app_args: context -> app -> ast array
-");
diff --git a/src/api/ml/mlx_get_array_sort.idl b/src/api/ml/mlx_get_array_sort.idl
deleted file mode 100644
index 81bf6e00f..000000000
--- a/src/api/ml/mlx_get_array_sort.idl
+++ /dev/null
@@ -1,11 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_array_sort c t ] \] is the domain and the range of [t].
-
- - {b See also}: {!get_array_sort_domain}
- - {b See also}: {!get_array_sort_range}
-*)
-val get_array_sort: context -> sort -> sort * sort
-");
diff --git a/src/api/ml/mlx_get_datatype_sort.idl b/src/api/ml/mlx_get_datatype_sort.idl
deleted file mode 100644
index 3466a9050..000000000
--- a/src/api/ml/mlx_get_datatype_sort.idl
+++ /dev/null
@@ -1,13 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_datatype_sort c ty ] \] is the array of triples [(constructor, recognizer, fields)] where [constructor] is the constructor declaration of [ty], [recognizer] is the recognizer for the [constructor], and [fields] is the array of fields in [ty].
-
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
-*)
-val get_datatype_sort: context -> sort -> datatype_constructor array
-");
diff --git a/src/api/ml/mlx_get_domains.idl b/src/api/ml/mlx_get_domains.idl
deleted file mode 100644
index ebc6d8556..000000000
--- a/src/api/ml/mlx_get_domains.idl
+++ /dev/null
@@ -1,11 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_domains c d ] \] is the array of parameters of [d].
-
- - {b See also}: {!get_domain_size}
- - {b See also}: {!get_domain}
-*)
-val get_domains: context -> func_decl -> sort array
-");
diff --git a/src/api/ml/mlx_get_error_msg.idl b/src/api/ml/mlx_get_error_msg.idl
deleted file mode 100644
index b8ea97e03..000000000
--- a/src/api/ml/mlx_get_error_msg.idl
+++ /dev/null
@@ -1,6 +0,0 @@
-quote(mli,"
-(**
- Summary: Return a string describing the given error code.
-*)
-val get_error_msg: context -> error_code -> string
-");
diff --git a/src/api/ml/mlx_get_pattern_terms.idl b/src/api/ml/mlx_get_pattern_terms.idl
deleted file mode 100644
index 749a90f3a..000000000
--- a/src/api/ml/mlx_get_pattern_terms.idl
+++ /dev/null
@@ -1,11 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_pattern_terms c p ] \] is the ast's in pattern.
-
- - {b See also}: {!get_pattern_num_terms}
- - {b See also}: {!get_pattern}
-*)
-val get_pattern_terms: context -> pattern -> ast array;;
-");
diff --git a/src/api/ml/mlx_get_tuple_sort.idl b/src/api/ml/mlx_get_tuple_sort.idl
deleted file mode 100644
index 1555f6c8a..000000000
--- a/src/api/ml/mlx_get_tuple_sort.idl
+++ /dev/null
@@ -1,12 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ get_tuple_sort c ty ] \] is the pair [(mk_decl, fields)] where [mk_decl] is the constructor declaration of [ty], and [fields] is the array of fields in [ty].
-
- - {b See also}: {!get_tuple_sort_mk_decl}
- - {b See also}: {!get_tuple_sort_num_fields}
- - {b See also}: {!get_tuple_sort_field_decl}
-*)
-val get_tuple_sort: context -> sort -> (func_decl * func_decl array)
-");
diff --git a/src/api/ml/mlx_mk_context_x.idl b/src/api/ml/mlx_mk_context_x.idl
deleted file mode 100644
index 7e4fd25c9..000000000
--- a/src/api/ml/mlx_mk_context_x.idl
+++ /dev/null
@@ -1,36 +0,0 @@
-quote(mlmli,"external mk_context: (string * string) list -> context = \"caml_z3_mk_context\"
-");
-// Note: lack of whitespace and comments in the previous 2 lines is important for the documentation generation
-quote(c,"
-value caml_z3_mk_context(value key_val_list)
-{
- CAMLparam1( key_val_list );
- CAMLlocal4( item, vkey, vval, _vres );
- char * ckey;
- char * cval;
- Z3_config cfg;
- Z3_context _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
-
- cfg = Z3_mk_config();
-
- while (key_val_list != Val_emptylist)
- {
- item = Field(key_val_list, 0);
- vkey = Field(item, 0);
- vval = Field(item, 1);
- ckey = camlidl_malloc_string(vkey, _ctx);
- cval = camlidl_malloc_string(vval, _ctx);
- Z3_set_param_value(cfg, ckey, cval);
- key_val_list = Field(key_val_list, 1);
- }
-
- _res = Z3_mk_context_rc(cfg);
- Z3_del_config(cfg);
- _vres = camlidl_c2ml_z3_Z3_context(&_res, _ctx);
- camlidl_free(_ctx);
- Z3_set_error_handler(_res, error_handler_static);
- CAMLreturn(_vres);
-}
-");
diff --git a/src/api/ml/mlx_mk_datatypes.idl b/src/api/ml/mlx_mk_datatypes.idl
deleted file mode 100644
index 21bdcdbc7..000000000
--- a/src/api/ml/mlx_mk_datatypes.idl
+++ /dev/null
@@ -1,28 +0,0 @@
-quote(mlmli,"
-(** A constructor of a datatype is described by: *)
-type datatype_constructor_desc = {
- constructor_desc : symbol; (** name of the constructor function *)
- recognizer_desc : symbol; (** name of the recognizer function *)
- accessor_descs : (symbol * sort) array; (** names and sorts of the fields *)
-}
-
-(** A datatype is described by a name and constructor descriptors. *)
-type datatype_desc = symbol * datatype_constructor_desc array
-
-(** A constructor of a datatype is represented by: *)
-type datatype_constructor = {
- constructor : func_decl; (** constructor function *)
- recognizer : func_decl; (** recognizer function *)
- accessors : func_decl array; (** field accessor functions *)
-}
-
-(** A datatype is represented by a sort and constructors. *)
-type datatype = sort * datatype_constructor array
-");
-
-quote(mli,"
-(** [mk_datatypes ctx sorts_to_descriptors] creates mutually recursive datatypes described by
- [sorts_to_descriptors], which is a function from the sorts of the datatypes to be created to
- descriptors of the datatypes' constructors. {b See also}: {!Test_mlapi.forest_example} *)
-val mk_datatypes: context -> (sort array -> (datatype_desc array) option) -> datatype array
-");
diff --git a/src/api/ml/mlx_mk_numeral.idl b/src/api/ml/mlx_mk_numeral.idl
deleted file mode 100644
index 0fa9caf39..000000000
--- a/src/api/ml/mlx_mk_numeral.idl
+++ /dev/null
@@ -1,21 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mlmli,"
-(**
- Summary: \[ [ numeral_refined ] \] is the refined view of a numeral .
-*)
-type numeral_refined =
- | Numeral_int of int * sort
- | Numeral_int64 of int64 * sort
- | Numeral_large of string * sort
- | Numeral_rational of numeral_refined * numeral_refined
-");
-
-quote(mli,"
-(**
- Summary: \[ [ embed_numeral c nr ] \] constructs the numeral described by [nr].
-
- - {b See also}: {!numeral_refine}
-*)
-val embed_numeral: context -> numeral_refined -> ast
-");
diff --git a/src/api/ml/mlx_mk_sort.idl b/src/api/ml/mlx_mk_sort.idl
deleted file mode 100644
index dd4222f81..000000000
--- a/src/api/ml/mlx_mk_sort.idl
+++ /dev/null
@@ -1,69 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mlmli,"
-(**
- A datatype constructor descriptor.
-*)
-type datatype_constructor_desc = {
- constructor_desc : symbol; (** name of the constructor function *)
- recognizer_desc : symbol; (** name of the recognizer function *)
- accessor_descs : (symbol * sort) array; (** names and sorts of the fields *)
-}
-
-(**
- A datatype is described by a name and constructor descriptors.
-*)
-type datatype_desc = symbol * datatype_constructor_desc array
-
-(**
- A datatype constructor representation.
-*)
-type datatype_constructor = {
- constructor : func_decl; (** constructor function *)
- recognizer : func_decl; (** recognizer function *)
- accessors : func_decl array; (** field accessor functions *)
-}
-
-(**
- A datatype is represented by a sort and constructors.
-*)
-type datatype = sort * datatype_constructor array
-
-(**
- Refined view of a {!sort}.
-
- - {b See also}: {!mk_sort}
- - {b See also}: {!sort_refine}
-*)
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_bv of int
- | Sort_finite_domain of symbol * int64
- | Sort_real
- | Sort_array of sort * sort
- | Sort_datatype of datatype_constructor array
- | Sort_relation of sort array
- | Sort_unknown
-");
-
-quote(mli,"
-(**
- Summary: \[ [ mk_sort c sr ] \] constructs the sort described by [sr].
-
- - {b Precondition}: [sr] is not of form [Sort_relation] or [Sort_unknown], which cannot be directly constructed
- - {b See also}: {!mk_datatypes}
- - {b See also}: {!sort_refine}
-*)
-val mk_sort: context -> sort_refined -> sort
-
-(**
- \[ [mk_datatypes ctx sorts_to_descriptors] \] creates mutually recursive datatypes described by
- [sorts_to_descriptors], which is a function from the sorts of the datatypes to be created to
- descriptors of the datatypes' constructors.
-
- - {b See also}: {!Test_mlapi.forest_example}
-*)
-val mk_datatypes: context -> (sort array -> (datatype_desc array) option) -> datatype array
-");
diff --git a/src/api/ml/mlx_mk_symbol.idl b/src/api/ml/mlx_mk_symbol.idl
deleted file mode 100644
index 6969c7380..000000000
--- a/src/api/ml/mlx_mk_symbol.idl
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mlmli,"
-(**
- Refined view of a {!symbol}.
-
- - {b See also}: {!mk_symbol}
- - {b See also}: {!symbol_refine}
-*)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
-");
-
-quote(mli,"
-(**
- Summary: \[ [ mk_symbol c sr ] \] constructs the symbol described by [sr].
-
- - {b See also}: {!symbol_refine}
-*)
-val mk_symbol: context -> symbol_refined -> symbol
-");
diff --git a/src/api/ml/mlx_model.idl b/src/api/ml/mlx_model.idl
deleted file mode 100644
index 192a982b3..000000000
--- a/src/api/ml/mlx_model.idl
+++ /dev/null
@@ -1,19 +0,0 @@
-quote(mlmli,"
-(**
- A model assigns uninterpreted sorts to finite universes of distinct values, constants to values,
- and arrays and functions to finite maps from argument values to result values plus a default
- value for all other arguments.
-*)
-type model_refined = {
- sorts : (sort, ast_vector) Hashtbl.t;
- consts : (func_decl, ast) Hashtbl.t;
- arrays : (func_decl, (ast, ast) Hashtbl.t * ast) Hashtbl.t;
- funcs : (func_decl, (ast array, ast) Hashtbl.t * ast) Hashtbl.t;
-}
-");
-quote(mli,"
-(**
- Summary: [model_refine c m] is the refined model of [m].
-*)
-val model_refine : context -> model -> model_refined
-");
diff --git a/src/api/ml/mlx_numeral_refine.idl b/src/api/ml/mlx_numeral_refine.idl
deleted file mode 100644
index 8b2f0a07f..000000000
--- a/src/api/ml/mlx_numeral_refine.idl
+++ /dev/null
@@ -1,10 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ numeral_refine c a ] \] is the refined view of [a].
-
- - {b Precondition}: [get_ast_kind c a = NUMERAL_AST]
-*)
-val numeral_refine : context -> ast -> numeral_refined
-");
diff --git a/src/api/ml/mlx_parse_smtlib.idl b/src/api/ml/mlx_parse_smtlib.idl
deleted file mode 100644
index dbc2e42da..000000000
--- a/src/api/ml/mlx_parse_smtlib.idl
+++ /dev/null
@@ -1,40 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ parse_smtlib_string_x c str sort_names sorts decl_names decls ] \]
-
- Parse the given string using the SMT-LIB parser.
-
- The symbol table of the parser can be initialized using the given sorts and declarations.
- The symbols in the arrays [sort_names] and [decl_names] don't need to match the names
- of the sorts and declarations in the arrays [sorts] and [decls]. This is an useful feature
- since we can use arbitrary names to reference sorts and declarations defined using the API.
-
- - {b See also}: {!parse_smtlib_file_x}
-*)
-val parse_smtlib_string_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-
-(**
- Summary: Similar to {!parse_smtlib_string_x}, but reads the benchmark from a file.
-
- - {b See also}: {!parse_smtlib_string_x}
-*)
-val parse_smtlib_file_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-
-(**
- Summary: \[ [ parse_smtlib_string_formula c ... ] \] calls [(parse_smtlib_string c ...)] and returns the single formula produced.
-
- - {b See also}: {!parse_smtlib_file_formula}
- - {b See also}: {!parse_smtlib_string_x}
-*)
-val parse_smtlib_string_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-
-(**
- Summary: \[ [ parse_smtlib_file_formula c ... ] \] calls [(parse_smtlib_file c ...)] and returns the single formula produced.
-
- - {b See also}: {!parse_smtlib_string_formula}
- - {b See also}: {!parse_smtlib_file_x}
-*)
-val parse_smtlib_file_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-");
diff --git a/src/api/ml/mlx_sort_refine.idl b/src/api/ml/mlx_sort_refine.idl
deleted file mode 100644
index 1f2ba8eab..000000000
--- a/src/api/ml/mlx_sort_refine.idl
+++ /dev/null
@@ -1,8 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ sort_refine c s ] \] is the refined view of [s].
-*)
-val sort_refine: context -> sort -> sort_refined
-");
diff --git a/src/api/ml/mlx_statistics.idl b/src/api/ml/mlx_statistics.idl
deleted file mode 100644
index 47028f012..000000000
--- a/src/api/ml/mlx_statistics.idl
+++ /dev/null
@@ -1,10 +0,0 @@
-quote(mlmli,"
-type stat_datum = Stat_int of int | Stat_float of float
-type stats_refined = (string, stat_datum) Hashtbl.t
-");
-quote(mli,"
-(**
- Summary: [stats_refine c s] is the refined stats of [s].
-*)
-val stats_refine : context -> stats -> stats_refined
-");
diff --git a/src/api/ml/mlx_symbol_refine.idl b/src/api/ml/mlx_symbol_refine.idl
deleted file mode 100644
index 0d74e9cd9..000000000
--- a/src/api/ml/mlx_symbol_refine.idl
+++ /dev/null
@@ -1,8 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mli,"
-(**
- Summary: \[ [ symbol_refine c s ] \] is the refined view of [s].
-*)
-val symbol_refine: context -> symbol -> symbol_refined
-");
diff --git a/src/api/ml/mlx_term_refine.idl b/src/api/ml/mlx_term_refine.idl
deleted file mode 100644
index 2fa8fd36f..000000000
--- a/src/api/ml/mlx_term_refine.idl
+++ /dev/null
@@ -1,37 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote(mlmli,"
-(**
- Summary: \[ [ binder_type ] \] is a universal or existential quantifier.
-
- - {b See also}: {!term_refined}
-*)
-type binder_type = Forall | Exists
-
-(**
- Summary: \[ [ term_refined ] \] is the refinement of a {!ast} .
-
- - {b See also}: {!term_refine}
-*)
-type term_refined =
- | Term_numeral of numeral_refined
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol * sort) array * ast
- | Term_var of int * sort
-");
-
-quote(mli,"
-(**
- Summary: \[ [ mk_term c tr ] \] constructs the term described by [tr].
-
- - {b Precondition}: [tr] is not of form
- - {b See also}: {!term_refine}
-*)
-(* val mk_term: context -> term_refined -> ast *)
-
-
-(**
- Summary: \[ [ term_refine c a ] \] is the refined view of [a].
-*)
-val term_refine : context -> ast -> term_refined
-");
diff --git a/src/api/ml/postprocess.sed b/src/api/ml/postprocess.sed
deleted file mode 100644
index f25f70cb7..000000000
--- a/src/api/ml/postprocess.sed
+++ /dev/null
@@ -1,8 +0,0 @@
-# remove 'z3_' and 'Z3_' prefixes on names
-
-s/{\!Z3\./{\!/g
-s/\([^_]\)[zZ]3_/\1/g
-
-# remove cyclic definitions introduced by substituting type equations
-
-s/^and \([a-z][a-zA-Z_ ]*\) = \1$//g
diff --git a/src/api/ml/preprocess.sed b/src/api/ml/preprocess.sed
deleted file mode 100644
index c7d1fc804..000000000
--- a/src/api/ml/preprocess.sed
+++ /dev/null
@@ -1,82 +0,0 @@
-# attempt to clean up the mess with 'unsigned'
-s/ unsigned/ unsigned int/g
-s/unsigned int long/unsigned long/g
-s/unsigned int __/unsigned __/g
-
-
-# '@name ' -> 'Section: '
-# '\sa ' -> 'See also: '
-# '\brief ' -> 'Summary: '
-# '\remark ' -> 'Remark: '
-# '\pre ' -> 'Precondition: '
-# '\param ' -> '@param'
-# '\warning ' -> 'Warning: '
-# '\code' -> 'C Example:'
-# '\endcode' -> ''
-/\\pre/s/(/ /g;/\\pre/s/,//g;/\\pre/s/)//g;s/\\pre /- {b Precondition}: /g
-/\\ccode/s/(/ /g;/\\ccode/s/\\,//g;/\\ccode/s/)//g;s/\\ccode{\(.*\)}/\[\1\]/g
-s/\\defgroup .*//g
-s/@name \(.*\)/{2 {L \1}}/g
-s/\\sa \(.*\)/- {b See also}: {!Z3.\1}/g
-s/\\see \(.*\)/- {b See}: {!Z3.\1}/g
-s//{e /g
-s|| }|g
-s/\\nicebox{/{e/g
-s/\\brief /Summary: /g
-s/\\remark /- {b Remarks}: /g
-s/\\pre /- {b Precondition}: /g
-s/\\param /@param /g
-s/\\conly .*//g
-s/\\warning /- {b Warning}: /g
-s/\\code/{v /g
-s/\\endcode/ v}/g
-s/\\verbatim/{v /g
-s/\\endverbatim/ v}/g
-s/\\mlonly//g
-s/\\endmlonly//g
-s/\\mlh/\\\[ \[/g
-s/\\endmlh/\] \\\]/g
-s/\\deprecated/@deprecated/g
-s/\\ / /g
-
-# '\c code ' -> '[code]'
-s/\\c \([^ .,:]*\)/[\1]/g
-
-# '#Z3_' -> 'Z3.'
-s/#Z3_\([^ \.,) ]*\)/{!Z3.\1}/g
-
-# '/*@}*/' -> ''
-s/\/\*@{\*\///g
-
-# '/*@{*/' -> ''
-s/\/\*@}\*\///g
-
-# '/*...*/' -> ''
-s/\/\*.*\*\///g
-
-s|(\*\*/\*\*)|(\*\*%\*\*)|g
-
-# '/**' -> 'quote(mli,"(**'
-s|/\*\*|quote(mli,\"(**|g
-
-# '...*/' -> '*)");'
-s|[ ]*\*/|*)\");|g
-
-s|(\*\*%\*\*)|(\*\*/\*\*)|g
-
-# 'extern "C"' -> 'extern ~~C~~'
-# 'quote(foo,"bar")' -> quote(foo,~~bar~~)
-# mltype("foo") -> mltype(~~foo~~)
-s/extern \"C\"/extern ~~C~~/g
-s/quote(\(.*\),\"\(.*\)\")/quote(\1,~~\2~~)/g
-s/quote(\(.*\),\"/quote(\1,~~/g
-s/\")\;/~~);/g
-s/\;\"/;~~/g
-s/mltype(\"\(.*\)\")/mltype(~~\1~~)/g
-
-# '"' -> '\"'
-s/\\\"/\"/g
-s/\"/\\\"/g
-
-# '~~' -> '"'
-s/~~/\"/g
diff --git a/src/api/ml/queen.ml b/src/api/ml/queen.ml
deleted file mode 100644
index e22db9cfb..000000000
--- a/src/api/ml/queen.ml
+++ /dev/null
@@ -1,112 +0,0 @@
-(*
- queen.exe - JakobL@2007-09-22
-
- Demonstration of how Z3 can be used to find solutions to the
- N-Queens problem.
-
- See: http://en.wikipedia.org/wiki/Eight_queens_puzzle
-
- Problem specification: Is the following constraint system satisfiable,
- for increasing n>=1, what are the models?
-
- constant
- n: 8;
-
- variable
- row: array n of [0..n-1];
-
- rule
- forall i in [0..n-2]:
- (forall j in [i+1..n-1]:
- ((row[i] <> row[j]) and
- (i+row[i]) <> (j+row[j]) and
- (i+row[j]) <> (j+row[i])));
-
- The answer is yes for n different from 2 and 3. The number of solutions are:
- * n=1: 1
- * n=2: 0
- * n=3: 0
- * n=4: 2
- * n=5: 10
- * n=6: 4
- * n=7: 40
- * n=8: 92
- * n=9: 352
- * n=10: 724
- ...
-*)
-
-module Z3 = Z3.V3
-
-(* Auxillary functions *)
-let ( |> ) x f = f x;;
-let printf = Printf.printf;;
-let mk_var ctx name ty = Z3.mk_const ctx (Z3.mk_int_symbol ctx name) ty;;
-let mk_int_var ctx name = Z3.mk_int_sort ctx |> mk_var ctx name;;
-let mk_int ctx v = Z3.mk_int ctx v (Z3.mk_int_sort ctx);;
-let checkreturn v = match v with | (true,r) -> r | _ -> failwith "checkreturn";;
-let get_numeral_value_int a1 a2 = Z3.get_numeral_int a1 a2 |> checkreturn;;
-let iterate_x lower upper f = for i = lower to upper do f i done;;
-let forall_x ctx lower upper f = Z3.mk_and ctx (Array.init (1+upper-lower) (fun i->f (i+lower)))
-let exist_x ctx lower upper f = Z3.mk_or ctx (Array.init (1+upper-lower) (fun i->f (i+lower)))
-let get_value ctx model f = let (ok, v) = Z3.eval_func_decl ctx model f in (assert ok; v)
-
-let queen_n n =
- let ctx = Z3.mk_context_x
- [|("MODEL","true");
- ("RELEVANCY","0")|] in
- let ( &&& ) x y = Z3.mk_and ctx [|x;y|] in
- let ( <~> ) x y = Z3.mk_not ctx (Z3.mk_eq ctx x y) in
- let ( <<= ) x y = Z3.mk_le ctx x y in
- let ( +++ ) x y = Z3.mk_add ctx [|x;y|] in
- let row = Array.init n (fun i->mk_int_var ctx i) in
- let c x = mk_int ctx x in (* make constant *)
- let v x = row.(x) in (* make variable *)
- let constraint_domain=forall_x ctx (0) (n-1) (fun x-> ((c 0) <<= (v x)) &&& ((v x) <<= (c (n-1)))) in
- let constraint_queen=
- forall_x ctx (0) (n-2) (fun i->
- forall_x ctx (i+1) (n-1) (fun j->
- ((v i) <~> (v j)) &&&
- (((c i)+++(v i)) <~> ((c j)+++(v j))) &&&
- (((c i)+++(v j)) <~> ((c j)+++(v i)))
- )
- ) in
- let res = constraint_domain &&& constraint_queen in
- Z3.assert_cnstr ctx res;
- let rec f i =
- (match Z3.check_and_get_model ctx with
- | (Z3.L_FALSE,_) ->
- printf "queen %d, total models: %d\n" n i;
- flush stdout;
- | (Z3.L_UNDEF,_) -> failwith "Z3.L_UNDEF"
- | (Z3.L_TRUE,model) ->
- begin
- let model_constants=Z3.get_model_constants ctx model in
- let vars=Array.map (fun mc->Z3.mk_app ctx mc [||]) model_constants in
- let vals=Array.map (fun mc->get_value ctx model mc |> get_numeral_value_int ctx) model_constants in
- Z3.del_model ctx model;
-
- let line = String.make n '-' in
- let q_line i = let r = String.make n ' ' in String.set r i 'Q'; r in
- printf "queen %d, model #%d:\n" n (i+1);
- printf "\n";
- printf " /%s\\\n" line;
- iterate_x 0 (n-1) (fun x->printf " |%s|\n" (q_line (vals.(x))));
- printf " \\%s/\n" line;
- printf "\n";
- flush stdout;
- let negated_model = exist_x ctx 0 (n-1) (fun x->(vars.(x)) <~> (c (vals.(x)))) in
- Z3.assert_cnstr ctx negated_model;
- f (i+1);
- end
- ) in
- f 0;
- Z3.del_context ctx;
- ();;
-
-let queen() =
- for n = 1 to 8 do
- queen_n n
- done;;
-
-let _ = queen();;
diff --git a/src/api/ml/queen.regress.err b/src/api/ml/queen.regress.err
deleted file mode 100644
index e69de29bb..000000000
diff --git a/src/api/ml/queen.regress.out b/src/api/ml/queen.regress.out
deleted file mode 100644
index 30e713386..000000000
--- a/src/api/ml/queen.regress.out
+++ /dev/null
@@ -1,1852 +0,0 @@
-queen 1, model #1:
-
- /-\
- |Q|
- \-/
-
-queen 1, total models: 1
-queen 2, total models: 0
-queen 3, total models: 0
-queen 4, model #1:
-
- /----\
- | Q |
- | Q|
- |Q |
- | Q |
- \----/
-
-queen 4, model #2:
-
- /----\
- | Q |
- |Q |
- | Q|
- | Q |
- \----/
-
-queen 4, total models: 2
-queen 5, model #1:
-
- /-----\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- \-----/
-
-queen 5, model #2:
-
- /-----\
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- \-----/
-
-queen 5, model #3:
-
- /-----\
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \-----/
-
-queen 5, model #4:
-
- /-----\
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-----/
-
-queen 5, model #5:
-
- /-----\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- \-----/
-
-queen 5, model #6:
-
- /-----\
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- \-----/
-
-queen 5, model #7:
-
- /-----\
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \-----/
-
-queen 5, model #8:
-
- /-----\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- \-----/
-
-queen 5, model #9:
-
- /-----\
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \-----/
-
-queen 5, model #10:
-
- /-----\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- \-----/
-
-queen 5, total models: 10
-queen 6, model #1:
-
- /------\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \------/
-
-queen 6, model #2:
-
- /------\
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- \------/
-
-queen 6, model #3:
-
- /------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \------/
-
-queen 6, model #4:
-
- /------\
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- \------/
-
-queen 6, total models: 4
-queen 7, model #1:
-
- /-------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- \-------/
-
-queen 7, model #2:
-
- /-------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #3:
-
- /-------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- \-------/
-
-queen 7, model #4:
-
- /-------\
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #5:
-
- /-------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #6:
-
- /-------\
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #7:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #8:
-
- /-------\
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #9:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #10:
-
- /-------\
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #11:
-
- /-------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #12:
-
- /-------\
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \-------/
-
-queen 7, model #13:
-
- /-------\
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #14:
-
- /-------\
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #15:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- \-------/
-
-queen 7, model #16:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #17:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #18:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #19:
-
- /-------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #20:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #21:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \-------/
-
-queen 7, model #22:
-
- /-------\
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #23:
-
- /-------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- \-------/
-
-queen 7, model #24:
-
- /-------\
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #25:
-
- /-------\
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #26:
-
- /-------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #27:
-
- /-------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \-------/
-
-queen 7, model #28:
-
- /-------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- \-------/
-
-queen 7, model #29:
-
- /-------\
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #30:
-
- /-------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #31:
-
- /-------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \-------/
-
-queen 7, model #32:
-
- /-------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- \-------/
-
-queen 7, model #33:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #34:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #35:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- \-------/
-
-queen 7, model #36:
-
- /-------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- \-------/
-
-queen 7, model #37:
-
- /-------\
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- \-------/
-
-queen 7, model #38:
-
- /-------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \-------/
-
-queen 7, model #39:
-
- /-------\
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \-------/
-
-queen 7, model #40:
-
- /-------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- \-------/
-
-queen 7, total models: 40
-queen 8, model #1:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #2:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- \--------/
-
-queen 8, model #3:
-
- /--------\
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #4:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #5:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #6:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- \--------/
-
-queen 8, model #7:
-
- /--------\
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #8:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #9:
-
- /--------\
- |Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #10:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #11:
-
- /--------\
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #12:
-
- /--------\
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #13:
-
- /--------\
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #14:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #15:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #16:
-
- /--------\
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #17:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #18:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #19:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- \--------/
-
-queen 8, model #20:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #21:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- \--------/
-
-queen 8, model #22:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #23:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- \--------/
-
-queen 8, model #24:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #25:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #26:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #27:
-
- /--------\
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #28:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #29:
-
- /--------\
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #30:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #31:
-
- /--------\
- | Q|
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #32:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #33:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #34:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- \--------/
-
-queen 8, model #35:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- \--------/
-
-queen 8, model #36:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #37:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #38:
-
- /--------\
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #39:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #40:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #41:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #42:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #43:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #44:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #45:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #46:
-
- /--------\
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #47:
-
- /--------\
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #48:
-
- /--------\
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #49:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- \--------/
-
-queen 8, model #50:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #51:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #52:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #53:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #54:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #55:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #56:
-
- /--------\
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #57:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #58:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #59:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #60:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #61:
-
- /--------\
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #62:
-
- /--------\
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #63:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #64:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #65:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #66:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #67:
-
- /--------\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #68:
-
- /--------\
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #69:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #70:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #71:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #72:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #73:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #74:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #75:
-
- /--------\
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- \--------/
-
-queen 8, model #76:
-
- /--------\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #77:
-
- /--------\
- |Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #78:
-
- /--------\
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #79:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #80:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- \--------/
-
-queen 8, model #81:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #82:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #83:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #84:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #85:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- \--------/
-
-queen 8, model #86:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #87:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q|
- | Q |
- \--------/
-
-queen 8, model #88:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #89:
-
- /--------\
- | Q |
- | Q|
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #90:
-
- /--------\
- | Q |
- | Q |
- | Q|
- | Q |
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, model #91:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q |
- |Q |
- | Q |
- | Q |
- | Q|
- \--------/
-
-queen 8, model #92:
-
- /--------\
- | Q |
- | Q |
- | Q |
- | Q|
- |Q |
- | Q |
- | Q |
- | Q |
- \--------/
-
-queen 8, total models: 92
diff --git a/src/api/ml/reverse.sed b/src/api/ml/reverse.sed
deleted file mode 100644
index 31ac563d2..000000000
--- a/src/api/ml/reverse.sed
+++ /dev/null
@@ -1,3 +0,0 @@
-# output lines of input in reverse order
-
-1!G;h;$!d
diff --git a/src/api/ml/test_capi.regress.err b/src/api/ml/test_capi.regress.err
deleted file mode 100644
index 0c383b409..000000000
--- a/src/api/ml/test_capi.regress.err
+++ /dev/null
@@ -1,5 +0,0 @@
-WARNING: invalid function application, sort mismatch on argument at position 1
-WARNING: (define iff Bool Bool Bool) applied to:
-x of sort Int
-y of sort Bool
-
diff --git a/src/api/ml/test_capi.regress.out b/src/api/ml/test_capi.regress.out
deleted file mode 100644
index 48870057c..000000000
--- a/src/api/ml/test_capi.regress.out
+++ /dev/null
@@ -1,386 +0,0 @@
-Z3 4.2.0.0
-
-simple_example
-CONTEXT:
-(solver)END OF CONTEXT
-
-DeMorgan
-DeMorgan is valid
-
-find_model_example1
-model for: x xor y
-sat
-y -> false
-x -> true
-
-
-find_model_example2
-model for: x < y + 1, x > 2
-sat
-y -> 3
-x -> 3
-
-model for: x < y + 1, x > 2, not(x = y)
-sat
-y -> 4
-x -> 3
-
-
-prove_example1
-prove: x = y implies g(x) = g(y)
-valid
-disprove: x = y implies g(g(x)) = g(y)
-invalid
-counterexample:
-y -> U!val!0
-x -> U!val!0
-g -> {
- U!val!0 -> U!val!1
- U!val!1 -> U!val!2
- else -> U!val!1
-}
-
-
-prove_example2
-prove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < 0
-valid
-disprove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < -1
-invalid
-counterexample:
-z -> (- 1)
-y -> (- 7719)
-x -> (- 7719)
-g -> {
- (- 7719) -> 0
- 0 -> 2
- (- 1) -> 3
- else -> 0
-}
-
-
-push_pop_example1
-assert: x >= 'big number'
-push
-number of scopes: 1
-assert: x <= 3
-unsat
-pop
-number of scopes: 0
-sat
-x = 1000000000000000000000000000000000000000000000000000000:int
-function interpretations:
-assert: y > x
-sat
-y = 1000000000000000000000000000000000000000000000000000001:int
-x = 1000000000000000000000000000000000000000000000000000000:int
-function interpretations:
-
-quantifier_example1
-pattern: {(f #0 #1)}
-
-assert axiom:
-(forall (k!0 Int) (k!1 Int) (= (inv!0 (f k!1 k!0)) k!0) :pat {(f k!1 k!0)})
-prove: f(x, y) = f(w, v) implies y = v
-valid
-disprove: f(x, y) = f(w, v) implies x = w
-that is: not(f(x, y) = f(w, v) implies x = w) is satisfiable
-unknown
-potential model:
-w = 2:int
-v = 1:int
-y = 1:int
-x = 0:int
-function interpretations:
-f = {(else|->(define f!52 Int Int Int)[(define k!50 Int Int)[#unknown], (define k!51 Int Int)[#unknown]])}
-#51 = {(2:int|->2:int), (1:int|->1:int), (15:int|->15:int), (11:int|->11:int), (0:int|->0:int), (19:int|->19:int), (else|->2:int)}
-f!52 = {(0:int, 1:int|->3:int), (2:int, 1:int|->3:int), (0:int, 0:int|->4:int), (2:int, 0:int|->5:int), (6:int, 2:int|->7:int), (2:int, 2:int|->8:int), (0:int, 2:int|->9:int), (6:int, 0:int|->10:int), (0:int, 11:int|->12:int), (2:int, 11:int|->13:int), (6:int, 11:int|->14:int), (0:int, 15:int|->16:int), (2:int, 15:int|->17:int), (6:int, 15:int|->18:int), (0:int, 19:int|->20:int), (6:int, 19:int|->21:int), (2:int, 19:int|->22:int), (else|->3:int)}
-inv!0 = {(3:int|->1:int), (4:int|->0:int), (5:int|->0:int), (7:int|->2:int), (8:int|->2:int), (9:int|->2:int), (10:int|->0:int), (12:int|->11:int), (13:int|->11:int), (14:int|->11:int), (16:int|->15:int), (17:int|->15:int), (18:int|->15:int), (20:int|->19:int), (21:int|->19:int), (22:int|->19:int), (else|->2:int)}
-#50 = {(2:int|->2:int), (6:int|->6:int), (0:int|->0:int), (else|->2:int)}
-reason for last failure: 7 (7 = quantifiers)
-
-array_example1
-prove: store(a1, i1, v1) = store(a2, i2, v2) implies (i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3))
-(=> (= (store a1 i1 v1) (store a2 i2 v2))
- (or (= i1 i3) (= i2 i3) (= (select a1 i3) (select a2 i3))))
-valid
-
-array_example2
-n = 2
-(distinct k!0 k!1)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-function interpretations:
-#0 = {((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#1 = {((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 3
-(distinct k!0 k!1 k!2)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-#2 = (define as-array[k!2] (Array Bool Bool))
-function interpretations:
-#0 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define false Bool)), (else|->(define true Bool))}
-#1 = {((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#2 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 4
-(distinct k!0 k!1 k!2 k!3)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-#2 = (define as-array[k!2] (Array Bool Bool))
-#3 = (define as-array[k!3] (Array Bool Bool))
-function interpretations:
-#0 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define true Bool)), (else|->(define false Bool))}
-#1 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define false Bool)), (else|->(define true Bool))}
-#2 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#3 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 5
-(distinct k!0 k!1 k!2 k!3 k!4)
-unsat
-
-array_example3
-domain: int
-range: bool
-
-tuple_example1
-tuple_sort: (real, real)
-prove: get_x(mk_pair(x, y)) = 1 implies x = 1
-valid
-disprove: get_x(mk_pair(x, y)) = 1 implies y = 1
-invalid
-counterexample:
-y -> 0
-x -> 1
-
-prove: get_x(p1) = get_x(p2) and get_y(p1) = get_y(p2) implies p1 = p2
-valid
-disprove: get_x(p1) = get_x(p2) implies p1 = p2
-invalid
-counterexample:
-p1 -> (mk_pair 1 0)
-p2 -> (mk_pair 1 2)
-
-prove: p2 = update(p1, 0, 10) implies get_x(p2) = 10
-valid
-disprove: p2 = update(p1, 0, 10) implies get_y(p2) = 10
-invalid
-counterexample:
-p2 -> (mk_pair 10 1)
-p1 -> (mk_pair 0 1)
-
-
-bitvector_example1
-disprove: x - 10 <= 0 IFF x <= 10 for (32-bit) machine integers
-invalid
-counterexample:
-x -> bv2147483656[32]
-
-
-bitvector_example2
-find values of x and y, such that x ^ y - 103 == x * y
-sat
-y -> bv3905735879[32]
-x -> bv3787456528[32]
-
-
-eval_example1
-MODEL:
-y -> 4
-x -> 3
-
-evaluating x+y
-result = 7:int
-
-two_contexts_example1
-k!0
-
-error_code_example1
-last call succeeded.
-last call failed.
-
-error_code_example2
-before Z3_mk_iff
-Z3 error: type error.
-
-parser_example1
-formula 0: (> x y)
-formula 1: (> x 0)
-sat
-y -> 0
-x -> 1
-
-
-parser_example2
-formula: (> x y)
-sat
-y -> (- 1)
-x -> 0
-
-
-parser_example3
-assert axiom:
-(forall (x Int) (y Int) (= (g x y) (g y x)) :qid {k!1})
-formula: (forall (x Int) (y Int) (=> (= x y) (= (g x 0) (g 0 y))) :qid {k!1})
-valid
-
-parser_example4
-declaration 0: (define y Int)
-declaration 1: (define sk_hack Bool Bool)
-declaration 2: (define x Int)
-assumption 0: (= x 20)
-formula 0: (> x y)
-formula 1: (> x 0)
-
-parser_example5
-Z3 error: parser error.
-Error message: 'ERROR: line 1 column 41: could not find sort symbol 'y'.
-'.
-
-numeral_example
-Numerals n1:1/2 n2:1/2
-valid
-Numerals n1:(- 1/3) n2:(- 33333333333333333333333333333333333333333333333333/100000000000000000000000000000000000000000000000000)
-valid
-
-ite_example
-term: (if false 1 0)
-
-list_example
-valid
-valid
-valid
-valid
-valid
-valid
-valid
-Formula (=> (is_cons u) (= u (cons (head u) (tail u))))
-valid
-invalid
-counterexample:
-u -> nil
-
-
-tree_example
-valid
-valid
-valid
-valid
-valid
-Formula (=> (is_cons u) (= u (cons (car u) (cdr u))))
-valid
-invalid
-counterexample:
-u -> nil
-
-
-forest_example
-valid
-valid
-valid
-valid
-valid
-valid
-
-binary_tree_example
-valid
-valid
-valid
-valid
-valid
-
-enum_example
-(define apple[fruit:0] fruit)
-(define banana[fruit:1] fruit)
-(define orange[fruit:2] fruit)
-(define is_apple[fruit:0] fruit Bool)
-(define is_banana[fruit:1] fruit Bool)
-(define is_orange[fruit:2] fruit Bool)
-valid
-valid
-invalid
-counterexample:
-
-valid
-valid
-
-unsat_core_and_proof_example
-unsat
-proof: [unit-resolution
- [def-axiom (or (or (not PredA) PredB (not PredC)) (not PredB))]
- [unit-resolution
- [def-axiom (or (or (not PredA) (not PredB) (not PredC)) PredB)]
- [unit-resolution
- [mp
- [asserted (or (and PredA PredB PredC) P1)]
- [monotonicity
- [rewrite
- (iff (and PredA PredB PredC)
- (not (or (not PredA) (not PredB) (not PredC))))]
- (iff (or (and PredA PredB PredC) P1)
- (or (not (or (not PredA) (not PredB) (not PredC))) P1))]
- (or (not (or (not PredA) (not PredB) (not PredC))) P1)]
- [asserted (not P1)]
- (not (or (not PredA) (not PredB) (not PredC)))]
- PredB]
- [unit-resolution
- [mp
- [asserted (or (and PredA (not PredB) PredC) P2)]
- [monotonicity
- [rewrite
- (iff (and PredA (not PredB) PredC)
- (not (or (not PredA) PredB (not PredC))))]
- (iff (or (and PredA (not PredB) PredC) P2)
- (or (not (or (not PredA) PredB (not PredC))) P2))]
- (or (not (or (not PredA) PredB (not PredC))) P2)]
- [asserted (not P2)]
- (not (or (not PredA) PredB (not PredC)))]
- false]
-
-core:
-(not P1)
-(not P2)
-
-
-get_implied_equalities example
-Class a |-> 0
-Class b |-> 0
-Class c |-> 0
-Class d |-> 3
-Class (f a) |-> 0
-Class (f b) |-> 0
-Class (f c) |-> 0
-asserting f(a) <= b
-Class a |-> 0
-Class b |-> 0
-Class c |-> 0
-Class d |-> 3
-Class (f a) |-> 0
-Class (f b) |-> 0
-Class (f c) |-> 0
-
-incremental_example1
-unsat core: 0 2 3
-unsat
-sat
-unsat core: 0 2 3
-unsat
-unsat core: 0 2 3
-unsat
-sat
-
-reference_counter_example
-model for: x xor y
-sat
-y -> false
-x -> true
-
-
-smt2parser_example
-formulas: (and (bvuge a bv16[8]) (bvule a bv240[8]))
-
-substitute_example
-substitution result: (f (f a 0) 1)
-
-substitute_vars_example
-substitution result: (f (f a (g b)) a)
diff --git a/src/api/ml/test_mlapi.cmd b/src/api/ml/test_mlapi.cmd
deleted file mode 100755
index 64315e3f7..000000000
--- a/src/api/ml/test_mlapi.cmd
+++ /dev/null
@@ -1,61 +0,0 @@
-@echo off
-SETLOCAL
-
-REM Script to test the Z3 OCaml API
-REM
-REM Assumes that environment variables are set to provide access to the C and OCaml compilers, as well as the following commands: diff, dos2unix, sed
-
-REM directory containing z3_api.h
-set Z3SRC=%1
-
-REM directory containing z3.dll and z3.lib
-set Z3BIN=%2
-
-REM directory containing debug z3.dll
-set Z3BINDBG=%3
-
-set PATH=.;%2;%3;%PATH%
-
-echo Build test_capi
-cl /nologo /I %Z3SRC% %Z3BIN%\z3.lib ..\test_capi\test_capi.c
-
-echo Build test_mlapi
-ocamlc -w -a -o test_mlapi.byte.exe z3.cma test_mlapi.ml
-ocamlopt -w -a -o test_mlapi.exe z3.cmxa test_mlapi.ml
-ocamlc -g -w -a -o test_mlapi.byte.dbg.exe z3_dbg.cma test_mlapi.ml
-ocamlopt -g -w -a -o test_mlapi.dbg.exe z3_dbg.cmxa test_mlapi.ml
-
-echo Build test_mlapiV3
-ocamlopt -g -w -a -o test_mlapiV3.dbg.exe z3_dbg.cmxa test_mlapiV3.ml
-
-echo Build test_theory
-ocamlopt -g -w -a -o test_theory.dbg.exe z3_dbg.cmxa test_theory.ml
-
-echo Build queen
-ocamlopt -g -w -a -o queen.exe z3_dbg.cmxa queen.ml
-
-echo Execute test_capi, test_mlapi, test_mlapiV3 and queen
-test_capi.exe >test_capi.out 2>test_capi.orig.err
-test_mlapi.dbg.exe >test_mlapi.out 2>test_mlapi.orig.err
-test_mlapiV3.dbg.exe >test_mlapiV3.out 2>test_mlapiV3.orig.err
-queen.exe >queen.out 2>queen.orig.err
-
-REM Strip pointers as they will always differ
-sed test_capi.err "s/ \[.*\]/ [...]/g"
-sed test_mlapi.err "s/ \[.*\]/ [...]/g"
-sed test_mlapiV3.err "s/ \[.*\]/ [...]/g"
-sed queen.err "s/ \[.*\]/ [...]/g"
-del test_capi.orig.err test_mlapi.orig.err test_mlapiV3.orig.err queen.orig.err
-
-REM Compare with regressions
-dos2unix *.out *.err 2>NUL
-diff test_capi.regress.out test_capi.out >NUL || echo Regression failed, see: diff test_capi.regress.out test_capi.out
-diff test_mlapi.regress.out test_mlapi.out >NUL || echo Regression failed, see: diff test_mlapi.regress.out test_mlapi.out
-diff test_mlapiV3.regress.out test_mlapiV3.out >NUL || echo Regression failed, see: diff test_mlapiV3.regress.out test_mlapiV3.out
-diff test_capi.regress.err test_capi.err >NUL || echo Regression failed, see: diff test_capi.regress.err test_capi.err
-diff test_mlapi.regress.err test_mlapi.err >NUL || echo Regression failed, see: diff test_mlapi.regress.err test_mlapi.err
-diff test_mlapiV3.regress.err test_mlapiV3.err >NUL || echo Regression failed, see: diff test_mlapiV3.regress.err test_mlapiV3.err
-diff queen.regress.out queen.out >NUL || echo Regression failed, see: diff queen.regress.out queen.out
-diff queen.regress.err queen.err >NUL || echo Regression failed, see: diff queen.regress.err queen.err
-
-ENDLOCAL
diff --git a/src/api/ml/test_mlapi.ml b/src/api/ml/test_mlapi.ml
deleted file mode 100644
index 149ae27f8..000000000
--- a/src/api/ml/test_mlapi.ml
+++ /dev/null
@@ -1,209 +0,0 @@
-(** Examples of using the OCaml API for Z3. *)
-
-(**/**)
-(* pause documentation *)
-
-(*
- @name Auxiliary Functions
-*)
-
-(**
- printf
-*)
-let printf = Printf.printf
-;;
-
-(**
- fprintf
-*)
-let fprintf = Printf.fprintf
-;;
-
-(**
- Exit gracefully in case of error.
-*)
-let exitf message = fprintf stderr "BUG: %s.\n" message ; exit 1
-;;
-
-(**
- Create and print datatypes
-*)
-let mk_datatypes ctx generator =
- let datatypes = Z3.mk_datatypes ctx generator in
- printf "datatype created:\n%!" ;
- Array.iter (fun (sort, ctors) ->
- printf "sort: %s\n%!" (Z3.sort_to_string ctx sort) ;
- Array.iter (fun {Z3.constructor; recognizer; accessors} ->
- printf "constructor: %s%! recognizer: %s%! accessors:"
- (Z3.func_decl_to_string ctx constructor)
- (Z3.func_decl_to_string ctx recognizer) ;
- Array.iter (fun accessor ->
- printf " %s%!" (Z3.func_decl_to_string ctx accessor)
- ) accessors ;
- printf "\n"
- ) ctors
- ) datatypes ;
- printf "\n" ;
- datatypes
-;;
-
-
-(**
- Create a variable using the given name and type.
-*)
-let mk_var ctx name ty = Z3.mk_const ctx (Z3.mk_string_symbol ctx name) ty
-;;
-
-(* resume documentation *)
-(**/**)
-
-
-(**
- Prove that the constraints already asserted into the logical
- context implies the given formula. The result of the proof is
- displayed.
- Z3 is a satisfiability checker. So, one can prove {e f } by showing
- that {e (not f) } is unsatisfiable.
- The context {e ctx } is not modified by this function.
-*)
-let prove ctx slv f is_valid =
- (* save the current state of the context *)
- Z3.solver_push ctx slv ;
-
- let not_f = Z3.mk_not ctx f in
- Z3.solver_assert ctx slv not_f ;
-
- (match Z3.solver_check ctx slv with
- | Z3.L_FALSE ->
- (* proved *)
- printf "valid\n" ;
- if not is_valid then exitf "unexpected result"
- | Z3.L_UNDEF ->
- (* Z3 failed to prove/disprove f. *)
- printf "unknown\n" ;
- let m = Z3.solver_get_model ctx slv in
- (* m should be viewed as a potential counterexample. *)
- printf "potential counterexample:\n%s\n" (Z3.model_to_string ctx m) ;
- if is_valid then exitf "unexpected result"
- | Z3.L_TRUE ->
- (* disproved *)
- printf "invalid\n" ;
- let m = Z3.solver_get_model ctx slv in
- (* the model returned by Z3 is a counterexample *)
- printf "counterexample:\n%s\n" (Z3.model_to_string ctx m) ;
- if is_valid then exitf "unexpected result"
- );
- (* restore context *)
- Z3.solver_pop ctx slv 1
-;;
-
-
-(* n-ary trees and forests in OCaml *)
-type tree = Leaf of int | Node of forest
-and forest = tree list
-
-(**
- Demonstrates the usage of {!Z3.mk_datatypes} with an example of forests of trees.
-*)
-let forest_example () =
- let ctx = Z3.mk_context [] in
- let slv = Z3.mk_solver ctx
- in
- let int_sort = Z3.mk_int_sort ctx in
- let sym name = Z3.mk_string_symbol ctx name
- in
- (* n-ary trees and forests in Z3 *)
- match
- mk_datatypes ctx
- (function [|tree; forest|] -> Some
- [|(sym"tree",
- [|{Z3.constructor_desc= sym"leaf"; recognizer_desc= sym"is_leaf"; accessor_descs= [|(sym"data", int_sort)|]};
- {Z3.constructor_desc= sym"node"; recognizer_desc= sym"is_node"; accessor_descs= [|(sym"children", forest)|]}|]);
- (sym"forest",
- [|{Z3.constructor_desc= sym"nil" ; recognizer_desc= sym"is_nil" ; accessor_descs= [||]};
- {Z3.constructor_desc= sym"cons"; recognizer_desc= sym"is_cons"; accessor_descs= [|(sym"hd", tree); (sym"tl", forest)|]}|])|]
- | _ -> None
- )
- with
- [|(tree,
- [|{Z3.constructor= leaf; recognizer= is_leaf; accessors= [|data|]};
- {Z3.constructor= node; recognizer= is_node; accessors= [|children|]}|]);
- (forest,
- [|{Z3.constructor= nil ; recognizer= is_nil ; accessors= [||]};
- {Z3.constructor= cons; recognizer= is_cons; accessors= [|hd; tl|]}|])|]
- ->
- (* translate from OCaml to Z3 *)
- let rec ml2z3_tree = function
- | Leaf(i) -> Z3.mk_app ctx leaf [|Z3.mk_int ctx i (Z3.mk_int_sort ctx)|]
- | Node(f) -> Z3.mk_app ctx node [|ml2z3_forest f|]
-
- and ml2z3_forest = function
- | [] -> Z3.mk_app ctx nil [||]
- | t :: f -> Z3.mk_app ctx cons [|ml2z3_tree t; ml2z3_forest f|]
- in
-
- (* construct some OCaml trees *)
- let t0 = Leaf 0 in
- let t12 = Node [Leaf 1; Leaf 2] in
- let t123 = Node [t12; Leaf 3] in
- let t1212 = Node [t12; t12] in
- let t412 = Node [Leaf 4; t12] in
-
- (* construct some Z3 trees using the translation from OCaml *)
- let t1 = ml2z3_tree t12 in printf "t1: %s\n%!" (Z3.ast_to_string ctx t1) ;
- let t2 = ml2z3_tree t123 in printf "t2: %s\n%!" (Z3.ast_to_string ctx t2) ;
- let t3 = ml2z3_tree t1212 in printf "t3: %s\n%!" (Z3.ast_to_string ctx t3) ;
- let t4 = ml2z3_tree t412 in printf "t4: %s\n%!" (Z3.ast_to_string ctx t4) ;
- let f1 = ml2z3_forest [t0] in printf "f1: %s\n%!" (Z3.ast_to_string ctx f1) ;
- let f2 = ml2z3_forest [t12] in printf "f2: %s\n%!" (Z3.ast_to_string ctx f2) ;
- let f3 = ml2z3_forest [t12; t0] in printf "f3: %s\n%!" (Z3.ast_to_string ctx f3) ;
-
- (* or using the Z3 API *)
- let nil = Z3.mk_app ctx nil [||] in
- let cons t f = Z3.mk_app ctx cons [|t; f|] in
- let leaf i = Z3.mk_app ctx leaf [|Z3.mk_int ctx i (Z3.mk_int_sort ctx)|] in
- let node f = Z3.mk_app ctx node [|f|] in
-
- let t0 = leaf 0 in
- let t12 = node (cons (leaf 1) (cons (leaf 2) nil)) in
- let t123 = node (cons t12 (cons (leaf 3) nil)) in
- let t1212 = node (cons t12 (cons t12 nil)) in
- let t412 = node (cons (leaf 4) (cons t12 nil)) in
-
- let t1 = t12 in printf "t1: %s\n%!" (Z3.ast_to_string ctx t1) ;
- let t2 = t123 in printf "t2: %s\n%!" (Z3.ast_to_string ctx t2) ;
- let t3 = t1212 in printf "t3: %s\n%!" (Z3.ast_to_string ctx t3) ;
- let t4 = t412 in printf "t4: %s\n%!" (Z3.ast_to_string ctx t4) ;
- let f1 = cons t0 nil in printf "f1: %s\n%!" (Z3.ast_to_string ctx f1) ;
- let f2 = cons t12 nil in printf "f2: %s\n%!" (Z3.ast_to_string ctx f2) ;
- let f3 = cons t12 f1 in printf "f3: %s\n%!" (Z3.ast_to_string ctx f3) ;
-
- (* nil != cons(nil,nil) *)
- prove ctx slv (Z3.mk_not ctx (Z3.mk_eq ctx nil f1)) true ;
- prove ctx slv (Z3.mk_not ctx (Z3.mk_eq ctx (leaf 5) t1)) true ;
-
- (* cons(x,u) = cons(x, v) => u = v *)
- let u = mk_var ctx "u" forest in
- let v = mk_var ctx "v" forest in
- let x = mk_var ctx "x" tree in
- let y = mk_var ctx "y" tree in
- let l1 = cons x u in printf "l1: %s\n%!" (Z3.ast_to_string ctx l1) ;
- let l2 = cons y v in printf "l2: %s\n%!" (Z3.ast_to_string ctx l2) ;
-
- prove ctx slv (Z3.mk_implies ctx (Z3.mk_eq ctx l1 l2) (Z3.mk_eq ctx u v)) true ;
- prove ctx slv (Z3.mk_implies ctx (Z3.mk_eq ctx l1 l2) (Z3.mk_eq ctx x y)) true ;
-
- (* is_nil(u) or is_cons(u) *)
- prove ctx slv (Z3.mk_or ctx [|Z3.mk_app ctx is_nil [|u|]; Z3.mk_app ctx is_cons [|u|]|]) true ;
-
- (* occurs check u != cons(x,u) *)
- prove ctx slv (Z3.mk_not ctx (Z3.mk_eq ctx u l1)) true ;
-
- | _ ->
- exitf "unexpected datatype signature"
-;;
-
-let _ =
- ignore( Z3.open_log "test_mlapi.log" );
- forest_example () ;
-;;
diff --git a/src/api/ml/test_mlapi.regress.err b/src/api/ml/test_mlapi.regress.err
deleted file mode 100644
index e69de29bb..000000000
diff --git a/src/api/ml/test_mlapi.regress.out b/src/api/ml/test_mlapi.regress.out
deleted file mode 100644
index 1fb6289c7..000000000
--- a/src/api/ml/test_mlapi.regress.out
+++ /dev/null
@@ -1,32 +0,0 @@
-datatype created:
-sort: tree
-constructor: (define leaf[tree:0] Int tree) recognizer: (define is_leaf[tree:0] tree Bool) accessors: (define data[tree:0:0] tree Int)
-constructor: (define node[tree:1] forest tree) recognizer: (define is_node[tree:1] tree Bool) accessors: (define children[tree:1:0] tree forest)
-sort: forest
-constructor: (define nil[forest:0] forest) recognizer: (define is_nil[forest:0] forest Bool) accessors:
-constructor: (define cons[forest:1] tree forest forest) recognizer: (define is_cons[forest:1] forest Bool) accessors: (define hd[forest:1:0] forest tree) (define tl[forest:1:1] forest forest)
-
-t1: (node (cons (leaf 1) (cons (leaf 2) nil)))
-t2: (node (cons (node (cons (leaf 1) (cons (leaf 2) nil))) (cons (leaf 3) nil)))
-t3: (node (cons (node (cons (leaf 1) (cons (leaf 2) nil)))
- (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)))
-t4: (node (cons (leaf 4) (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)))
-f1: (cons (leaf 0) nil)
-f2: (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)
-f3: (cons (node (cons (leaf 1) (cons (leaf 2) nil))) (cons (leaf 0) nil))
-t1: (node (cons (leaf 1) (cons (leaf 2) nil)))
-t2: (node (cons (node (cons (leaf 1) (cons (leaf 2) nil))) (cons (leaf 3) nil)))
-t3: (node (cons (node (cons (leaf 1) (cons (leaf 2) nil)))
- (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)))
-t4: (node (cons (leaf 4) (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)))
-f1: (cons (leaf 0) nil)
-f2: (cons (node (cons (leaf 1) (cons (leaf 2) nil))) nil)
-f3: (cons (node (cons (leaf 1) (cons (leaf 2) nil))) (cons (leaf 0) nil))
-valid
-valid
-l1: (cons x u)
-l2: (cons y v)
-valid
-valid
-valid
-valid
diff --git a/src/api/ml/test_mlapiV3.ml b/src/api/ml/test_mlapiV3.ml
deleted file mode 100644
index a88d13000..000000000
--- a/src/api/ml/test_mlapiV3.ml
+++ /dev/null
@@ -1,1418 +0,0 @@
-(** Module test_mlapi - ML test and demo program for Z3. Matches test_capi.ml - JakobL@2007-09-08 *)
-
-module Z3 = Z3.V3
-
-(*
- @name Auxiliary Functions
-*)
-
-(**
- printf
-*)
-let printf = Printf.printf;;
-
-(**
- fprintf
-*)
-let fprintf = Printf.fprintf;;
-
-(**
- Exit gracefully in case of error.
-*)
-let exitf message = fprintf stderr "BUG: %s.\n" message; exit 1;;
-
-(**
- Create a logical context. Enable model construction.
- Also enable tracing to stderr.
-*)
-let mk_context ctx =
- let ctx = Z3.mk_context_x (Array.append [|("MODEL", "true")|] ctx) in
- (* You may comment out the following line to disable tracing: *)
- (* Z3.trace_to_stderr ctx; *)
- ctx;;
-
-(**
- Create a variable using the given name and type.
-*)
-let mk_var ctx name ty = Z3.mk_const ctx (Z3.mk_string_symbol ctx name) ty;;
-
-(**
- Create a boolean variable using the given name.
-*)
-let mk_bool_var ctx name = mk_var ctx name (Z3.mk_bool_sort ctx);;
-
-(**
- Create an integer variable using the given name.
-*)
-let mk_int_var ctx name = mk_var ctx name (Z3.mk_int_sort ctx);;
-
-(**
- Create a Z3 integer node using a C int.
-*)
-let mk_int ctx v = Z3.mk_int ctx v (Z3.mk_int_sort ctx);;
-
-(**
- Create a real variable using the given name.
-*)
-let mk_real_var ctx name = mk_var ctx name (Z3.mk_real_sort ctx);;
-
-(**
- Create the unary function application: {e (f x) }.
-*)
-let mk_unary_app ctx f x = Z3.mk_app ctx f [|x|];;
-
-(**
- Create the binary function application: {e (f x y) }.
-*)
-let mk_binary_app ctx f x y = Z3.mk_app ctx f [|x;y|];;
-
-(**
- Auxiliary function to check whether two Z3 types are equal or not.
-*)
-let equal_sorts ctx t1 t2 = Z3.is_eq_sort ctx t1 t2;;
-
-(**
- Check whether the logical context is satisfiable, and compare the result with the expected result.
- If the context is satisfiable, then display the model.
-*)
-let check ctx expected_result =
- begin
- let (result, m) = Z3.check_and_get_model ctx in
- (match result with
- | Z3.L_FALSE -> printf "unsat\n";
- | Z3.L_UNDEF ->
- printf "unknown\n";
- printf "potential model:\n%s\n" (Z3.model_to_string ctx m);
- (Z3.del_model ctx m);
- | Z3.L_TRUE -> printf "sat\n%s\n" (Z3.model_to_string ctx m);
- (Z3.del_model ctx m);
- );
- if result != expected_result then exitf "unexpected result";
- end;;
-
-(**
- Prove that the constraints already asserted into the logical
- context implies the given formula. The result of the proof is
- displayed.
- Z3 is a satisfiability checker. So, one can prove {e f } by showing
- that {e (not f) } is unsatisfiable.
- The context {e ctx } is not modified by this function.
-*)
-let prove ctx f is_valid =
- begin
- (* save the current state of the context *)
- Z3.push ctx;
-
- let not_f = Z3.mk_not ctx f in
- Z3.assert_cnstr ctx not_f;
-
- (match Z3.check_and_get_model ctx with
- | (Z3.L_FALSE,_) ->
- (* proved *)
- printf "valid\n";
- if not is_valid then exitf "unexpected result";
- | (Z3.L_UNDEF,m) ->
- (* Z3 failed to prove/disprove f. *)
- printf "unknown\n";
- (* m should be viewed as a potential counterexample. *)
- printf "potential counterexample:\n%s\n" (Z3.model_to_string ctx m);
- if is_valid then exitf "unexpected result";
- (Z3.del_model ctx m);
- | (Z3.L_TRUE,m) ->
- (* disproved *)
- printf "invalid\n";
- (* the model returned by Z3 is a counterexample *)
- printf "counterexample:\n%s\n" (Z3.model_to_string ctx m);
- if is_valid then exitf "unexpected result";
- (Z3.del_model ctx m);
- );
- (* restore context *)
- Z3.pop ctx 1;
- end;;
-
-(**
- Assert the axiom: function f is injective in the i-th argument.
-
- The following axiom is asserted into the logical context:
-
- forall (x_1, ..., x_n) finv(f(x_1, ..., x_i, ..., x_n)) = x_i
-
- Where, {e finv } is a fresh function declaration.
-*)
-let assert_inj_axiom ctx f i =
- begin
- let sz = Z3.get_domain_size ctx f in
- if i >= sz then exitf "failed to create inj axiom";
-
- (* declare the i-th inverse of f: finv *)
- let finv_domain = Z3.get_range ctx f in
- let finv_range = Z3.get_domain ctx f i in
- let finv = Z3.mk_fresh_func_decl ctx "inv" [|finv_domain|] finv_range in
-
- (* allocate temporary arrays *)
- (* fill types, names and xs *)
- let types = Z3.get_domains ctx f in
- let names = Array.init sz (Z3.mk_int_symbol ctx) in
- let xs = Array.init sz (fun j->Z3.mk_bound ctx j (types.(j))) in
-
- (* create f(x_0, ..., x_i, ..., x_{n-1}) *)
- let fxs = Z3.mk_app ctx f xs in
-
- (* create f_inv(f(x_0, ..., x_i, ..., x_{n-1})) *)
- let finv_fxs = mk_unary_app ctx finv fxs in
-
- (* create finv(f(x_0, ..., x_i, ..., x_{n-1})) = x_i *)
- let eq = Z3.mk_eq ctx finv_fxs (xs.(i)) in
-
- (* use f(x_0, ..., x_i, ..., x_{n-1}) as the pattern for the quantifier *)
- let p = Z3.mk_pattern ctx [|fxs|] in
- printf "pattern: %s\n" (Z3.pattern_to_string ctx p);
- printf "\n";
-
- (* create & assert quantifier *)
- let q = Z3.mk_forall ctx
- 0 (* using default weight *)
- [|p|] (* the "array" of patterns *)
- types
- names
- eq
- in
- printf "assert axiom:\n%s\n" (Z3.ast_to_string ctx q);
- Z3.assert_cnstr ctx q;
- end;;
-
-(**
- Assert the axiom: function f is commutative.
-
- This example uses the SMT-LIB parser to simplify the axiom construction.
-*)
-let assert_comm_axiom ctx f =
- begin
- let t = Z3.get_range ctx f in
- if Z3.get_domain_size ctx f != 2 || not (equal_sorts ctx (Z3.get_domain ctx f 0) t) || not (equal_sorts ctx (Z3.get_domain ctx f 1) t) then
- exitf "function must be binary, and argument types must be equal to return type";
- (* Inside the parser, function f will be referenced using the symbol 'f'. *)
- let f_name = Z3.mk_string_symbol ctx "f" in
- (* Inside the parser, type t will be referenced using the symbol 'T'. *)
- let t_name = Z3.mk_string_symbol ctx "T" in
- let str = "(benchmark comm :formula (forall (x T) (y T) (= (f x y) (f y x))))" in
- let q = Z3.parse_smtlib_string_formula ctx str [|t_name|] [|t|] [|f_name|] [|f|] in
- printf "assert axiom:\n%s\n" (Z3.ast_to_string ctx q);
- Z3.assert_cnstr ctx q;
- end;;
-
-(**
- Z3 does not support explicitly tuple updates. They can be easily implemented
- as macros. The argument {e t } must have tuple type.
- A tuple update is a new tuple where field {e i } has value {e new_val }, and all
- other fields have the value of the respective field of {e t }.
-
- {e update(t, i, new_val) } is equivalent to
- {e mk_tuple(proj_0(t), ..., new_val, ..., proj_n(t)) }
-*)
-let mk_tuple_update c t i new_val =
- begin
- let ty = Z3.get_sort c t in
- let (mk_tuple_decl,fields)=Z3.get_tuple_sort c ty in
- if i>=Array.length fields then exitf "invalid tuple update, index is too big";
- let f j =
- if i = j then (* use new_val at position i: *) new_val
- else (* use field j of t: *) (mk_unary_app c (fields.(j)) t)
- in let new_fields = Array.init (Array.length fields) f in
- Z3.mk_app c (Z3.get_tuple_sort_mk_decl c ty) new_fields;
- end;;
-
-(**
- Display a symbol in the given output stream.
-*)
-let display_symbol c out s =
- match Z3.symbol_refine c s with
- | Z3.Symbol_int i -> fprintf out "#%d" i;
- | Z3.Symbol_string r ->fprintf out "%s" r;
- | Z3.Symbol_unknown -> ();;
-
-(**
- Display the given type.
-*)
-let rec display_sort c out ty =
- begin
- match Z3.sort_refine c ty with
- | Z3.Sort_uninterpreted s -> display_symbol c out s;
- | Z3.Sort_bool -> fprintf out "bool";
- | Z3.Sort_int -> fprintf out "int";
- | Z3.Sort_real -> fprintf out "real";
- | Z3.Sort_relation -> fprintf out "relation";
- | Z3.Sort_finite_domain -> fprintf out "finite-domain";
- | Z3.Sort_bv sz -> fprintf out "bv%d" sz;
- | Z3.Sort_array (domain, range) ->
- fprintf out "[";
- display_sort c out domain;
- fprintf out "->";
- display_sort c out range;
- fprintf out "]";
- | Z3.Sort_datatype cons ->
- Array.iter (fun (dt_con : Z3.datatype_constructor_refined) ->
- let fields = dt_con.Z3.accessors in
- fprintf out "(";
- let f i v =
- if i>0 then fprintf out ", ";
- display_sort c out (Z3.get_range c v);
- in Array.iteri f fields;
- fprintf out ")") cons
- | Z3.Sort_unknown s ->
- fprintf out "unknown[";
- display_symbol c out s;
- fprintf out "unknown]";
- end;;
-
-(**
- Custom ast pretty printer.
-
- This function demonstrates how to use the API to navigate terms.
-*)
-
-let rec display_numeral c out nm =
- match nm with
- | Z3.Numeral_small(n,1L) ->
- Printf.fprintf out "%Ld" n
- | Z3.Numeral_small(n,d) ->
- Printf.fprintf out "%Ld/%Ld" n d
- | Z3.Numeral_large s ->
- Printf.fprintf out "%s" s
-
-let rec display_ast c out v =
- begin
- match Z3.term_refine c v with
- | Z3.Term_app(k, f, args) ->
- let num_fields = Array.length args in
- let a = Z3.to_app c v in
- let d = Z3.get_app_decl c a in
- Printf.fprintf out "%s" (Z3.func_decl_to_string c d);
- if num_fields > 0 then
- begin
- Printf.fprintf out "[";
- for i = 0 to num_fields - 1 do
- if i > 0 then Printf.fprintf out ", ";
- display_ast c out (Z3.get_app_arg c a i)
- done;
- Printf.fprintf out "]"
- end
- | Z3.Term_numeral(nm, s) ->
- display_numeral c out nm;
- Printf.fprintf out ":";
- display_sort c out s
- | Z3.Term_var(idx, s) ->
- printf "#unknown"
- | Z3.Term_quantifier(b, w, pats, bound, body) ->
- printf "quantifier"
- end;;
-
-(**
- Custom function for traversing a term and replacing the constant
- 'x' by the bound variable having index 'idx'.
- This function illustrates how to walk Z3 terms and
- reconstruct them.
-**)
-
-let rec abstract c x idx term =
- if Z3.is_eq_ast c term x then Z3.mk_bound c idx (Z3.get_sort c x) else
- match Z3.term_refine c term with
- | Z3.Term_app(k, f, args) -> Z3.mk_app c f (Array.map (abstract c x idx) args)
- | Z3.Term_numeral(nm, s) -> term
- | Z3.Term_var(idx, s) -> term
- | Z3.Term_quantifier(b, w, pats, bound, body) ->
- let idx = (idx + Array.length bound) in
- let body = abstract c x idx body in
- let is_forall = b = Z3.Forall in
- let mk_pattern terms = Z3.mk_pattern c (Array.map (abstract c x idx) terms) in
- let patterns = Array.map mk_pattern pats in
- Z3.mk_quantifier c is_forall w patterns
- (Array.map snd bound) (Array.map fst bound) body
-
-(**
- Example abstraction function.
-**)
-
-
-let abstract_example() =
- begin
- printf "\nabstract_example\n";
- let ctx = mk_context [||] in
- let x = mk_int_var ctx "x" in
- let x_decl = Z3.get_app_decl ctx (Z3.to_app ctx x) in
- let y = mk_int_var ctx "y" in
- let y_decl = Z3.get_app_decl ctx (Z3.to_app ctx y) in
- let decls = [| x_decl; y_decl |] in
- let a = Z3.mk_string_symbol ctx "a" in
- let b = Z3.mk_string_symbol ctx "b" in
- let names = [| a; b |] in
- let str = "(benchmark tst :formula (> a b))" in
- let f = Z3.parse_smtlib_string_formula ctx str [||] [||] names decls in
- printf "formula: %s\n" (Z3.ast_to_string ctx f);
-
- let f2 = abstract ctx x 0 f in
-
- printf "abstracted formula: %s\n" (Z3.ast_to_string ctx f2);
- (* delete logical context *)
- Z3.del_context ctx;
-
- end;;
-
-(**
- Custom function interpretations pretty printer.
-*)
-let display_function_interpretations c out m =
- begin
- fprintf out "function interpretations:\n";
- let display_function (name, entries, func_else) =
- begin
- display_symbol c out name;
- fprintf out " = {";
- let display_entry j (args,valu) =
- if j > 0 then fprintf out ", ";
- fprintf out "(";
- let f k arg =
- if k > 0 then fprintf out ", ";
- display_ast c out arg
- in Array.iteri f args;
- fprintf out "|->";
- display_ast c out valu;
- fprintf out ")";
- in Array.iteri display_entry entries;
- if Array.length entries > 0 then fprintf out ", ";
- fprintf out "(else|->";
- display_ast c out func_else;
- fprintf out ")}\n";
- end;
- in
- Array.iter display_function (Z3.get_model_funcs c m);
- end;;
-
-(**
- Custom model pretty printer.
-*)
-let display_model c out m =
- begin
- let constants=Z3.get_model_constants c m in
- let f i e =
- let name = Z3.get_decl_name c e in
- let (ok, v) = Z3.eval_func_decl c m e in
- display_symbol c out name;
- fprintf out " = ";
- display_ast c out v;
- fprintf out "\n"
- in Array.iteri f constants;
- display_function_interpretations c out m;
- end;;
-
-(**
- Similar to #check, but uses #display_model instead of #Z3_model_to_string.
-*)
-let check2 ctx expected_result =
- begin
- let (result,m) = Z3.check_and_get_model ctx in
- (match result with
- | Z3.L_FALSE ->
- printf "unsat\n";
- | Z3.L_UNDEF ->
- printf "unknown\n";
- printf "potential model:\n";
- display_model ctx stdout m;
- (Z3.del_model ctx m);
- | Z3.L_TRUE ->
- printf "sat\n";
- display_model ctx stdout m;
- (Z3.del_model ctx m);
- );
- if result != expected_result then exitf "unexpected result";
- end;;
-
-(**
- Display Z3 version in the standard output.
-*)
-let display_version() =
- begin
- let (major, minor, build, revision)=Z3.get_version() in
- printf "Z3 %d.%d.%d.%d\n" major minor build revision;
- end;;
-
-(*
- @name Examples
-*)
-
-(**
- "Hello world" example: create a Z3 logical context, and delete it.
-*)
-let simple_example() =
- begin
- printf "\nsimple_example\n";
- let ctx = mk_context [||] in
- (* do something with the context *)
- printf "CONTEXT:\n%sEND OF CONTEXT\n" (Z3.context_to_string ctx);
- (* delete logical context *)
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstration of how Z3 can be used to prove validity of
- De Morgan's Duality Law: {e not(x and y) <-> (not x) or ( not y) }
-*)
-let demorgan() =
- begin
- printf "\nDeMorgan\n";
- let ctx = mk_context [||] in
- let bool_sort = Z3.mk_bool_sort ctx in
- let symbol_x = Z3.mk_int_symbol ctx 0 in
- let symbol_y = Z3.mk_int_symbol ctx 1 in
- let x = Z3.mk_const ctx symbol_x bool_sort in
- let y = Z3.mk_const ctx symbol_y bool_sort in
-
- (* De Morgan - with a negation around: *)
- (* !(!(x && y) <-> (!x || !y)) *)
- let not_x = Z3.mk_not ctx x in
- let not_y = Z3.mk_not ctx y in
- let x_and_y = Z3.mk_and ctx [|x;y|] in
- let ls = Z3.mk_not ctx x_and_y in
- let rs = Z3.mk_or ctx [|not_x;not_y|] in
- let conjecture = Z3.mk_iff ctx ls rs in
- let negated_conjecture = Z3.mk_not ctx conjecture in
-
- Z3.assert_cnstr ctx negated_conjecture;
- (match Z3.check ctx with
- | Z3.L_FALSE ->
- (* The negated conjecture was unsatisfiable, hence the conjecture is valid *)
- printf "DeMorgan is valid\n"
- | Z3.L_UNDEF ->
- (* Check returned undef *)
- printf "Undef\n"
- | Z3.L_TRUE ->
- (* The negated conjecture was satisfiable, hence the conjecture is not valid *)
- Printf.printf "DeMorgan is not valid\n");
- Z3.del_context ctx;
- end;;
-
-(**
- Find a model for {e x xor y }.
-*)
-let find_model_example1() =
- begin
- printf "\nfind_model_example1\n";
- let ctx = mk_context [||] in
- let x = mk_bool_var ctx "x" in
- let y = mk_bool_var ctx "y" in
- let x_xor_y = Z3.mk_xor ctx x y in
- Z3.assert_cnstr ctx x_xor_y;
- printf "model for: x xor y\n";
- check ctx Z3.L_TRUE;
- Z3.del_context ctx;
- end;;
-
-(**
- Find a model for {e x < y + 1, x > 2 }.
- Then, assert {e not(x = y) }, and find another model.
-*)
-let find_model_example2() =
- begin
- printf "\nfind_model_example2\n";
- let ctx = mk_context [||] in
- let x = mk_int_var ctx "x" in
- let y = mk_int_var ctx "y" in
- let one = mk_int ctx 1 in
- let two = mk_int ctx 2 in
- let y_plus_one = Z3.mk_add ctx [|y;one|] in
- let c1 = Z3.mk_lt ctx x y_plus_one in
- let c2 = Z3.mk_gt ctx x two in
- Z3.assert_cnstr ctx c1;
- Z3.assert_cnstr ctx c2;
- printf "model for: x < y + 1, x > 2\n";
- check ctx Z3.L_TRUE;
-
- (* assert not(x = y) *)
- let x_eq_y = Z3.mk_eq ctx x y in
- let c3 = Z3.mk_not ctx x_eq_y in
- Z3.assert_cnstr ctx c3;
- printf "model for: x < y + 1, x > 2, not(x = y)\n";
- check ctx Z3.L_TRUE;
- Z3.del_context ctx;
- end;;
-
-(**
- Prove {e x = y implies g(x) = g(y) }, and
- disprove {e x = y implies g(g(x)) = g(y) }.
-
- This function demonstrates how to create uninterpreted types and
- functions.
-*)
-let prove_example1() =
- begin
- printf "\nprove_example1\n";
-
- let ctx = mk_context [||] in
-
- (* create uninterpreted type. *)
- let u_name = Z3.mk_string_symbol ctx "U" in
- let u = Z3.mk_uninterpreted_sort ctx u_name in
-
- (* declare function g *)
- let g_name = Z3.mk_string_symbol ctx "g" in
- let g = Z3.mk_func_decl ctx g_name [|u|] u in
-
- (* create x and y *)
- let x_name = Z3.mk_string_symbol ctx "x" in
- let y_name = Z3.mk_string_symbol ctx "y" in
- let x = Z3.mk_const ctx x_name u in
- let y = Z3.mk_const ctx y_name u in
- (* create g(x), g(y) *)
- let gx = mk_unary_app ctx g x in
- let gy = mk_unary_app ctx g y in
-
- (* assert x = y *)
- let eq = Z3.mk_eq ctx x y in
- Z3.assert_cnstr ctx eq;
-
- (* prove g(x) = g(y) *)
- let f = Z3.mk_eq ctx gx gy in
- printf "prove: x = y implies g(x) = g(y)\n";
- prove ctx f true;
-
- (* create g(g(x)) *)
- let ggx = mk_unary_app ctx g gx in
-
- (* disprove g(g(x)) = g(y) *)
- let f = Z3.mk_eq ctx ggx gy in
- printf "disprove: x = y implies g(g(x)) = g(y)\n";
- prove ctx f false;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Prove {e not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < 0 }.
- Then, show that {e z < -1 } is not implied.
-
- This example demonstrates how to combine uninterpreted functions and arithmetic.
-*)
-let prove_example2() =
- begin
- printf "\nprove_example2\n";
-
- let ctx = mk_context [||] in
-
- (* declare function g *)
- let int_sort = Z3.mk_int_sort ctx in
- let g_name = Z3.mk_string_symbol ctx "g" in
- let g = Z3.mk_func_decl ctx g_name [|int_sort|] int_sort in
-
- (* create x, y, and z *)
- let x = mk_int_var ctx "x" in
- let y = mk_int_var ctx "y" in
- let z = mk_int_var ctx "z" in
-
- (* create gx, gy, gz *)
- let gx = mk_unary_app ctx g x in
- let gy = mk_unary_app ctx g y in
- let gz = mk_unary_app ctx g z in
-
- (* create zero *)
- let zero = mk_int ctx 0 in
-
- (* assert not(g(g(x) - g(y)) = g(z)) *)
- let gx_gy = Z3.mk_sub ctx [|gx;gy|] in
- let ggx_gy = mk_unary_app ctx g gx_gy in
- let eq = Z3.mk_eq ctx ggx_gy gz in
- let c1 = Z3.mk_not ctx eq in
- Z3.assert_cnstr ctx c1;
-
- (* assert x + z <= y *)
- let x_plus_z = Z3.mk_add ctx [|x;z|] in
- let c2 = Z3.mk_le ctx x_plus_z y in
- Z3.assert_cnstr ctx c2;
-
- (* assert y <= x *)
- let c3 = Z3.mk_le ctx y x in
- Z3.assert_cnstr ctx c3;
-
- (* prove z < 0 *)
- let f = Z3.mk_lt ctx z zero in
- printf "prove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < 0\n";
- prove ctx f true;
-
- (* disprove z < -1 *)
- let minus_one = mk_int ctx (-1) in
- let f = Z3.mk_lt ctx z minus_one in
- printf "disprove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < -1\n";
- prove ctx f false;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Show how push & pop can be used to create "backtracking"
- points.
-
- This example also demonstrates how big numbers can be created in Z3.
-*)
-let push_pop_example1() =
- begin
- printf "\npush_pop_example1\n";
- let ctx = mk_context [||] in
-
- (* create a big number *)
- let int_sort = Z3.mk_int_sort ctx in
- let big_number = Z3.mk_numeral ctx "1000000000000000000000000000000000000000000000000000000" int_sort in
-
- (* create number 3 *)
- let three = Z3.mk_numeral ctx "3" int_sort in
-
- (* create x *)
- let x_sym = Z3.mk_string_symbol ctx "x" in
- let x = Z3.mk_const ctx x_sym int_sort in
-
- (* assert x >= "big number" *)
- let c1 = Z3.mk_ge ctx x big_number in
- printf "assert: x >= 'big number'\n";
- Z3.assert_cnstr ctx c1;
-
- (* create a backtracking point *)
- printf "push\n";
- Z3.push ctx;
-
- printf "number of scopes: %d\n" (Z3.get_num_scopes ctx);
-
- (* assert x <= 3 *)
- let c2 = Z3.mk_le ctx x three in
- printf "assert: x <= 3\n";
- Z3.assert_cnstr ctx c2;
-
- (* context is inconsistent at this point *)
- check2 ctx Z3.L_FALSE;
-
- (* backtrack: the constraint x <= 3 will be removed, since it was
- asserted after the last push. *)
- printf "pop\n";
- Z3.pop ctx 1;
-
- printf "number of scopes: %d\n" (Z3.get_num_scopes ctx);
-
- (* the context is consistent again. *)
- check2 ctx Z3.L_TRUE;
-
- (* new constraints can be asserted... *)
-
- (* create y *)
- let y_sym = Z3.mk_string_symbol ctx "y" in
- let y = Z3.mk_const ctx y_sym int_sort in
-
- (* assert y > x *)
- let c3 = Z3.mk_gt ctx y x in
- printf "assert: y > x\n";
- Z3.assert_cnstr ctx c3;
-
- (* the context is still consistent. *)
- check2 ctx Z3.L_TRUE;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Prove that {e f(x, y) = f(w, v) implies y = v } when
- {e f } is injective in the second argument.
-*)
-let quantifier_example1() =
- begin
- printf "\nquantifier_example1\n";
-
- (* If quantified formulas are asserted in a logical context, then
- Z3 may return L_UNDEF. In this case, the model produced by Z3 should be viewed as a potential/candidate model.
- Limiting the number of iterations of the model finder for quantified formulas.
- *)
- let ctx = mk_context [|("MBQI_MAX_ITERATIONS", "10")|] in
-
- (* declare function f *)
- let int_sort = Z3.mk_int_sort ctx in
- let f_name = Z3.mk_string_symbol ctx "f" in
- let f = Z3.mk_func_decl ctx f_name [|int_sort; int_sort|] int_sort in
-
- (* assert that f is injective in the second argument. *)
- assert_inj_axiom ctx f 1;
-
- (* create x, y, v, w, fxy, fwv *)
- let x = mk_int_var ctx "x" in
- let y = mk_int_var ctx "y" in
- let v = mk_int_var ctx "v" in
- let w = mk_int_var ctx "w" in
- let fxy = mk_binary_app ctx f x y in
- let fwv = mk_binary_app ctx f w v in
-
- (* assert f(x, y) = f(w, v) *)
- let p1 = Z3.mk_eq ctx fxy fwv in
- Z3.assert_cnstr ctx p1;
-
- (* prove f(x, y) = f(w, v) implies y = v *)
- let p2 = Z3.mk_eq ctx y v in
- printf "prove: f(x, y) = f(w, v) implies y = v\n";
- prove ctx p2 true;
-
- (* disprove f(x, y) = f(w, v) implies x = w *)
- (* using check2 instead of prove *)
- let p3 = Z3.mk_eq ctx x w in
- let not_p3 = Z3.mk_not ctx p3 in
- Z3.assert_cnstr ctx not_p3;
- printf "disprove: f(x, y) = f(w, v) implies x = w\n";
- printf "that is: not(f(x, y) = f(w, v) implies x = w) is satisfiable\n";
- check2 ctx Z3.L_UNDEF;
- Printf.printf
- "reason for last failure: %d (7 = quantifiers)\n"
- (if Z3.get_search_failure(ctx) = Z3.QUANTIFIERS then 7 else -1);
-
-
- Z3.del_context ctx;
- end;;
-
-(**
- Prove {e store(a1, i1, v1) = store(a2, i2, v2) implies (i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3)) }.
-
- This example demonstrates how to use the array theory.
-*)
-let array_example1() =
- begin
- printf "\narray_example1\n";
-
- let ctx = mk_context [||] in
-
- let int_sort = Z3.mk_int_sort ctx in
- let array_sort = Z3.mk_array_sort ctx int_sort int_sort in
-
- let a1 = mk_var ctx "a1" array_sort in
- let a2 = mk_var ctx "a2" array_sort in
- let i1 = mk_var ctx "i1" int_sort in
- let i2 = mk_var ctx "i2" int_sort in
- let i3 = mk_var ctx "i3" int_sort in
- let v1 = mk_var ctx "v1" int_sort in
- let v2 = mk_var ctx "v2" int_sort in
-
- let st1 = Z3.mk_store ctx a1 i1 v1 in
- let st2 = Z3.mk_store ctx a2 i2 v2 in
-
- let sel1 = Z3.mk_select ctx a1 i3 in
- let sel2 = Z3.mk_select ctx a2 i3 in
-
- (* create antecedent *)
- let antecedent = Z3.mk_eq ctx st1 st2 in
-
- (* create consequent: i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3) *)
- let ds = [|
- Z3.mk_eq ctx i1 i3;
- Z3.mk_eq ctx i2 i3;
- Z3.mk_eq ctx sel1 sel2;
- |] in
-
- let consequent = Z3.mk_or ctx ds in
-
- (* prove store(a1, i1, v1) = store(a2, i2, v2) implies (i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3)) *)
- let thm = Z3.mk_implies ctx antecedent consequent in
- printf "prove: store(a1, i1, v1) = store(a2, i2, v2) implies (i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3))\n";
- printf "%s\n" (Z3.ast_to_string ctx thm);
- prove ctx thm true;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Show that {e distinct(a_0, ... , a_n) } is
- unsatisfiable when {e a_i's } are arrays from boolean to
- boolean and n > 4.
-
- This example also shows how to use the {e distinct } construct.
-*)
-let array_example2() =
- begin
- printf "\narray_example2\n";
-
- for n = 2 to 5 do
- printf "n = %d\n" n;
- let ctx = mk_context [||] in
-
- let bool_sort = Z3.mk_bool_sort ctx in
- let array_sort = Z3.mk_array_sort ctx bool_sort bool_sort in
-
- (* create arrays *)
- let a = Array.init n
- (fun i->Z3.mk_const ctx (Z3.mk_int_symbol ctx i) array_sort) in
-
- (* assert distinct(a[0], ..., a[n]) *)
- let d = Z3.mk_distinct ctx a in
- printf "%s\n" (Z3.ast_to_string ctx d);
- Z3.assert_cnstr ctx d;
-
- (* context is satisfiable if n < 5 *)
- check2 ctx (if n < 5 then Z3.L_TRUE else Z3.L_FALSE);
-
- Z3.del_context ctx;
- done
- end;;
-
-(**
- Simple array type construction/deconstruction example.
-*)
-let array_example3() =
- begin
- printf "\narray_example3\n";
-
- let ctx = mk_context [||] in
-
- let bool_sort = Z3.mk_bool_sort ctx in
- let int_sort = Z3.mk_int_sort ctx in
- let array_sort = Z3.mk_array_sort ctx int_sort bool_sort in
-
- let (domain,range) = Z3.get_array_sort ctx array_sort in
- printf "domain: ";
- display_sort ctx stdout domain;
- printf "\n";
- printf "range: ";
- display_sort ctx stdout range;
- printf "\n";
-
- if (not (Z3.is_eq_sort ctx int_sort domain)) ||
- (not (Z3.is_eq_sort ctx bool_sort range)) then
- exitf "invalid array type";
- Z3.del_context ctx;
- end;;
-
-(**
- Simple tuple type example. It creates a tuple that is a pair of real numbers.
-*)
-let tuple_example1() =
- begin
- printf "\ntuple_example1\n";
- let ctx = mk_context [||] in
-
- let real_sort = Z3.mk_real_sort ctx in
-
- (* Create pair (tuple) type *)
- let mk_tuple_name = Z3.mk_string_symbol ctx "mk_pair" in
- let proj_names_0 = Z3.mk_string_symbol ctx "get_x" in
- let proj_names_1 = Z3.mk_string_symbol ctx "get_y" in
- let proj_names = [|proj_names_0; proj_names_1|] in
- let proj_sorts = [|real_sort;real_sort|] in
- (* Z3_mk_tuple_sort will set mk_tuple_decl and proj_decls *)
- let (pair_sort,mk_tuple_decl,proj_decls) = Z3.mk_tuple_sort ctx mk_tuple_name proj_names proj_sorts in
- let get_x_decl = proj_decls.(0) in (* function that extracts the first element of a tuple. *)
- let get_y_decl = proj_decls.(1) in (* function that extracts the second element of a tuple. *)
-
- printf "tuple_sort: ";
- display_sort ctx stdout pair_sort;
- printf "\n";
-
- begin
- (* prove that get_x(mk_pair(x,y)) == 1 implies x = 1*)
- let x = mk_real_var ctx "x" in
- let y = mk_real_var ctx "y" in
- let app1 = mk_binary_app ctx mk_tuple_decl x y in
- let app2 = mk_unary_app ctx get_x_decl app1 in
- let one = Z3.mk_numeral ctx "1" real_sort in
- let eq1 = Z3.mk_eq ctx app2 one in
- let eq2 = Z3.mk_eq ctx x one in
- let thm = Z3.mk_implies ctx eq1 eq2 in
- printf "prove: get_x(mk_pair(x, y)) = 1 implies x = 1\n";
- prove ctx thm true;
-
- (* disprove that get_x(mk_pair(x,y)) == 1 implies y = 1*)
- let eq3 = Z3.mk_eq ctx y one in
- let thm = Z3.mk_implies ctx eq1 eq3 in
- printf "disprove: get_x(mk_pair(x, y)) = 1 implies y = 1\n";
- prove ctx thm false;
- end;
-
- begin
- (* prove that get_x(p1) = get_x(p2) and get_y(p1) = get_y(p2) implies p1 = p2 *)
- let p1 = mk_var ctx "p1" pair_sort in
- let p2 = mk_var ctx "p2" pair_sort in
- let x1 = mk_unary_app ctx get_x_decl p1 in
- let y1 = mk_unary_app ctx get_y_decl p1 in
- let x2 = mk_unary_app ctx get_x_decl p2 in
- let y2 = mk_unary_app ctx get_y_decl p2 in
- let antecedents_0 = Z3.mk_eq ctx x1 x2 in
- let antecedents_1 = Z3.mk_eq ctx y1 y2 in
- let antecedents = [|antecedents_0; antecedents_1|] in
- let antecedent = Z3.mk_and ctx antecedents in
- let consequent = Z3.mk_eq ctx p1 p2 in
- let thm = Z3.mk_implies ctx antecedent consequent in
- printf "prove: get_x(p1) = get_x(p2) and get_y(p1) = get_y(p2) implies p1 = p2\n";
- prove ctx thm true;
-
- (* disprove that get_x(p1) = get_x(p2) implies p1 = p2 *)
- let thm = Z3.mk_implies ctx (antecedents.(0)) consequent in
- printf "disprove: get_x(p1) = get_x(p2) implies p1 = p2\n";
- prove ctx thm false;
- end;
-
- begin
- (* demonstrate how to use the mk_tuple_update function *)
- (* prove that p2 = update(p1, 0, 10) implies get_x(p2) = 10 *)
- let p1 = mk_var ctx "p1" pair_sort in
- let p2 = mk_var ctx "p2" pair_sort in
- let one = Z3.mk_numeral ctx "1" real_sort in
- let ten = Z3.mk_numeral ctx "10" real_sort in
- let updt = mk_tuple_update ctx p1 0 ten in
- let antecedent = Z3.mk_eq ctx p2 updt in
- let x = mk_unary_app ctx get_x_decl p2 in
- let consequent = Z3.mk_eq ctx x ten in
- let thm = Z3.mk_implies ctx antecedent consequent in
- printf "prove: p2 = update(p1, 0, 10) implies get_x(p2) = 10\n";
- prove ctx thm true;
-
- (* disprove that p2 = update(p1, 0, 10) implies get_y(p2) = 10 *)
- let y = mk_unary_app ctx get_y_decl p2 in
- let consequent = Z3.mk_eq ctx y ten in
- let thm = Z3.mk_implies ctx antecedent consequent in
- printf "disprove: p2 = update(p1, 0, 10) implies get_y(p2) = 10\n";
- prove ctx thm false;
- end;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Simple bit-vector example. This example disproves that x - 10 <= 0 IFF x <= 10 for (32-bit) machine integers
- *)
-let bitvector_example1() =
- begin
- printf "\nbitvector_example1\n";
-
- let ctx = mk_context [||] in
-
- let bv_sort = Z3.mk_bv_sort ctx 32 in
-
- let x = mk_var ctx "x" bv_sort in
- let zero = Z3.mk_numeral ctx "0" bv_sort in
- let ten = Z3.mk_numeral ctx "10" bv_sort in
- let x_minus_ten = Z3.mk_bvsub ctx x ten in
- (* bvsle is signed less than or equal to *)
- let c1 = Z3.mk_bvsle ctx x ten in
- let c2 = Z3.mk_bvsle ctx x_minus_ten zero in
- let thm = Z3.mk_iff ctx c1 c2 in
- printf "disprove: x - 10 <= 0 IFF x <= 10 for (32-bit) machine integers\n";
- prove ctx thm false;
-
- Z3.del_context ctx;
- end;;
-
-(**
- Find x and y such that: x ^ y - 103 == x * y
- *)
-let bitvector_example2() =
- begin
- printf "\nbitvector_example2\n";
- let ctx = mk_context [||] in
- (* construct x ^ y - 103 == x * y *)
- let bv_sort = Z3.mk_bv_sort ctx 32 in
- let x = mk_var ctx "x" bv_sort in
- let y = mk_var ctx "y" bv_sort in
- let x_xor_y = Z3.mk_bvxor ctx x y in
- let c103 = Z3.mk_numeral ctx "103" bv_sort in
- let lhs = Z3.mk_bvsub ctx x_xor_y c103 in
- let rhs = Z3.mk_bvmul ctx x y in
- let ctr = Z3.mk_eq ctx lhs rhs in
- printf "find values of x and y, such that x ^ y - 103 == x * y\n";
- Z3.assert_cnstr ctx ctr;
- check ctx Z3.L_TRUE;
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstrate how to use #Z3_eval.
-*)
-let eval_example1() =
- begin
- printf "\neval_example1\n";
-
- let ctx = mk_context [||] in
- let x = mk_int_var ctx "x" in
- let y = mk_int_var ctx "y" in
- let two = mk_int ctx 2 in
-
- (* assert x < y *)
- let c1 = Z3.mk_lt ctx x y in
- Z3.assert_cnstr ctx c1;
-
- (* assert x > 2 *)
- let c2 = Z3.mk_gt ctx x two in
- Z3.assert_cnstr ctx c2;
-
- (* find model for the constraints above *)
- (match Z3.check_and_get_model ctx with
- | (Z3.L_TRUE, m) ->
- begin
- let args = [|x; y|] in
- printf "MODEL:\n%s" (Z3.model_to_string ctx m);
- let x_plus_y = Z3.mk_add ctx args in
- printf "\nevaluating x+y\n";
- (match Z3.eval ctx m x_plus_y with
- | (true,v) ->
- printf "result = ";
- display_ast ctx stdout v;
- printf "\n";
- | _ ->
- exitf "failed to evaluate: x+y";
- );
- (Z3.del_model ctx m);
- end;
- | (_,_) ->
- exitf "the constraints are satisfiable";
- );
- Z3.del_context ctx;
- end;;
-
-(**
- Several logical context can be used simultaneously.
-*)
-let two_contexts_example1() =
- begin
- printf "\ntwo_contexts_example1\n";
- (* using the same (default) configuration to initialized both logical contexts. *)
- let ctx1 = mk_context [||] in
- let ctx2 = mk_context [||] in
- let x1 = Z3.mk_const ctx1 (Z3.mk_int_symbol ctx1 0) (Z3.mk_bool_sort ctx1) in
- let x2 = Z3.mk_const ctx2 (Z3.mk_int_symbol ctx2 0) (Z3.mk_bool_sort ctx2) in
- Z3.del_context ctx1;
- (* ctx2 can still be used. *)
- printf "%s\n" (Z3.ast_to_string ctx2 x2);
- Z3.del_context ctx2;
- end;;
-
-(**
- Demonstrates how error codes can be read insted of registering an error handler.
- *)
-let error_code_example1() =
- begin
- printf "\nerror_code_example1\n";
-
- let ctx = mk_context [||] in
- let x = mk_bool_var ctx "x" in
- let x_decl = Z3.get_app_decl ctx (Z3.to_app ctx x) in
- Z3.assert_cnstr ctx x;
-
- match Z3.check_and_get_model ctx with
- | (Z3.L_TRUE,m) ->
- begin
- let (ok, v) = Z3.eval_func_decl ctx m x_decl in
- printf "last call succeeded.\n";
-
- (* The following call will fail since the value of x is a boolean *)
- (try ignore(Z3.get_numeral_string ctx v)
- with | _ -> printf "last call failed.\n");
- (Z3.del_model ctx m);
- Z3.del_context ctx;
- end
- | (_,_) -> exitf "unexpected result";
- end;;
-
-(**
- Demonstrates how Z3 exceptions can be used.
-*)
-let error_code_example2() =
- begin
- printf "\nerror_code_example2\n%!";
-
- let ctx = mk_context [||] in
- try
- let x = mk_int_var ctx "x" in
- let y = mk_bool_var ctx "y" in
- printf "before Z3_mk_iff\n";
- let app = Z3.mk_iff ctx x y in
- printf "unreachable";
- with | _ -> printf "Z3 error: type error.\n";
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstrates how to use the SMTLIB parser.
- *)
-let parser_example1() =
- begin
- printf "\nparser_example1\n";
-
- let ctx = mk_context [||] in
- let str = "(benchmark tst :extrafuns ((x Int) (y Int)) :formula (> x y) :formula (> x 0))" in
- let (formulas,_,_) = Z3.parse_smtlib_string_x ctx str [||] [||] [||] [||] in
- let f i c =
- printf "formula %d: %s\n" i (Z3.ast_to_string ctx c);
- Z3.assert_cnstr ctx c;
- in Array.iteri f formulas;
- check ctx Z3.L_TRUE;
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstrates how to initialize the parser symbol table.
- *)
-let parser_example2() =
- begin
- printf "\nparser_example2\n%!";
-
- let ctx = mk_context [||] in
- let x = mk_int_var ctx "x" in
- let x_decl = Z3.get_app_decl ctx (Z3.to_app ctx x) in
- let y = mk_int_var ctx "y" in
- let y_decl = Z3.get_app_decl ctx (Z3.to_app ctx y) in
- let decls = [| x_decl; y_decl |] in
- let a = Z3.mk_string_symbol ctx "a" in
- let b = Z3.mk_string_symbol ctx "b" in
- let names = [| a; b |] in
- let str = "(benchmark tst :formula (> a b))" in
- let f = Z3.parse_smtlib_string_formula ctx str [||] [||] names decls in
- printf "formula: %s\n" (Z3.ast_to_string ctx f);
- Z3.assert_cnstr ctx f;
- check ctx Z3.L_TRUE;
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstrates how to initialize the parser symbol table.
- *)
-let parser_example3() =
- begin
- printf "\nparser_example3\n%!";
-
- let ctx = mk_context [| |] in
- let int_sort = Z3.mk_int_sort ctx in
- let g_name = Z3.mk_string_symbol ctx "g" in
- let g = Z3.mk_func_decl ctx g_name [| int_sort; int_sort |] int_sort in
- let str = "(benchmark tst :formula (forall (x Int) (y Int) (implies (= x y) (= (g x 0) (g 0 y)))))" in
- assert_comm_axiom ctx g;
- let thm = Z3.parse_smtlib_string_formula ctx str [||] [||] [|g_name|] [|g|] in
- printf "formula: %s\n" (Z3.ast_to_string ctx thm);
- prove ctx thm true;
- Z3.del_context ctx;
- end;;
-
-(**
- Display the declarations, assumptions and formulas in a SMT-LIB string.
- *)
-let parser_example4() =
- begin
- printf "\nparser_example4\n%!";
-
- let ctx = mk_context [||] in
- let str = "(benchmark tst :extrafuns ((x Int) (y Int)) :assumption (= x 20) :formula (> x y) :formula (> x 0))" in
- (* arithmetic theory is automatically initialized, when an
- int/real variable or arith operation is created using the API.
- Since no such function is invoked in this example, we should do
- that manually.
- *)
- let (formulas, assumptions, decls) = Z3.parse_smtlib_string_x ctx str [||] [||] [||] [||] in
- let f prefix i n = printf "%s %d: %s\n" prefix i (Z3.ast_to_string ctx n) in
- Array.iteri (fun i n -> printf "declaration %d: %s\n" i (Z3.func_decl_to_string ctx n)) decls;
- Array.iteri (f "assumption") assumptions;
- Array.iteri (f "formula") formulas;
- Z3.del_context ctx;
- end;;
-
-(**
- Demonstrates how to handle parser errors using Z3 exceptions.
- *)
-let parser_example5() =
- begin
- printf "\nparser_example5\n";
- let ctx = mk_context [||] in
- try
- (* the following string has a parsing error: missing parenthesis *)
- let str = "(benchmark tst :extrafuns ((x Int (y Int)) :formula (> x y) :formula (> x 0))" in
- ignore(Z3.parse_smtlib_string_x ctx str [||] [||] [||] [||]);
- with | _ -> (printf "Z3 error: parser error.\n";
- printf "Error message: '%s'.\n" (Z3.get_smtlib_error ctx)
- );
- Z3.del_context ctx;
- end;;
-
-(**
- Example for creating an if-then-else expression.
- *)
-let ite_example() =
- begin
- printf "\nite_example\n%!";
- let ctx = mk_context [||] in
- let f = Z3.mk_false ctx in
- let one = mk_int ctx 1 in
- let zero = mk_int ctx 0 in
- let ite = Z3.mk_ite ctx f one zero in
- printf "term: %s\n" (Z3.ast_to_string ctx ite);
- Z3.del_context ctx;
- end;;
-
-
-(**
- Create an enumeration data type.
-
- Several more examples of creating and using data-types (lists, trees, records)
- are provided for the C-based API.
- The translation from the examples in C to use the OCaml API follow the same pattern
- that is used here.
-*)
-let enum_example() =
- begin
- printf "\nenum_example\n";
- let ctx = mk_context [||] in
- let name = Z3.mk_string_symbol ctx "fruit" in
- let enum_names = [| Z3.mk_string_symbol ctx "apple";
- Z3.mk_string_symbol ctx "banana";
- Z3.mk_string_symbol ctx "orange" |] in
- let (fruit, enum_consts, enum_testers) = Z3.mk_enumeration_sort ctx name enum_names in
-
- printf "%s\n" (Z3.func_decl_to_string ctx enum_consts.(0));
- printf "%s\n" (Z3.func_decl_to_string ctx enum_consts.(1));
- printf "%s\n" (Z3.func_decl_to_string ctx enum_consts.(2));
- printf "%s\n" (Z3.func_decl_to_string ctx enum_testers.(0));
- printf "%s\n" (Z3.func_decl_to_string ctx enum_testers.(1));
- printf "%s\n" (Z3.func_decl_to_string ctx enum_testers.(2));
-
- let apple = Z3.mk_app ctx (enum_consts.(0)) [||] in
- let banana = Z3.mk_app ctx (enum_consts.(1)) [||] in
- let orange = Z3.mk_app ctx (enum_consts.(2)) [||] in
-
- (* Apples are different from oranges *)
- prove ctx (Z3.mk_not ctx (Z3.mk_eq ctx apple orange)) true;
-
- (* Apples pass the apple test *)
- prove ctx (Z3.mk_app ctx enum_testers.(0) [| apple |]) true;
-
- (* Oranges fail the apple test *)
- prove ctx (Z3.mk_app ctx enum_testers.(0) [| orange |]) false;
- prove ctx (Z3.mk_not ctx (Z3.mk_app ctx enum_testers.(0) [| orange |])) true;
-
- let fruity = mk_var ctx "fruity" fruit in
-
- (* If something is fruity, then it is an apple, banana, or orange *)
- let ors = [| Z3.mk_eq ctx fruity apple;
- Z3.mk_eq ctx fruity banana;
- Z3.mk_eq ctx fruity orange |] in
-
- prove ctx (Z3.mk_or ctx ors) true;
- Z3.del_context ctx;
- end;;
-
-(**
- Example for extracting unsatisfiable core and proof.
- The example uses the function check_assumptions which allows passing in additional
- hypotheses. The unsatisfiable core is a subset of these additional hypotheses.
- *)
-let unsat_core_and_proof_example() =
- begin
- printf "\nunsat_core_and_proof_example\n%!";
- let ctx = mk_context [| ("PROOF_MODE","2") |] in
- let pa = mk_bool_var ctx "PredA" in
- let pb = mk_bool_var ctx "PredB" in
- let pc = mk_bool_var ctx "PredC" in
- let pd = mk_bool_var ctx "PredD" in
- let p1 = mk_bool_var ctx "P1" in
- let p2 = mk_bool_var ctx "P2" in
- let p3 = mk_bool_var ctx "P3" in
- let p4 = mk_bool_var ctx "P4" in
- let assumptions = [| Z3.mk_not ctx p1; Z3.mk_not ctx p2; Z3.mk_not ctx p3; Z3.mk_not ctx p4 |] in
- let f1 = Z3.mk_and ctx [| pa; pb; pc |] in
- let f2 = Z3.mk_and ctx [| pa; Z3.mk_not ctx pc; pb |] in
- let f3 = Z3.mk_or ctx [| Z3.mk_not ctx pa; Z3.mk_not ctx pc |] in
- let f4 = pd in
- let core_dummy = [| pa; pa; pa; pa |] in
- Z3.assert_cnstr ctx (Z3.mk_or ctx [| f1; p1 |]);
- Z3.assert_cnstr ctx (Z3.mk_or ctx [| f2; p2 |]);
- Z3.assert_cnstr ctx (Z3.mk_or ctx [| f3; p3 |]);
- Z3.assert_cnstr ctx (Z3.mk_or ctx [| f4; p4 |]);
- let result = Z3.check_assumptions ctx assumptions 4 core_dummy in
- (match result with
- | (Z3.L_FALSE, _, proof, core_size, core) ->
- printf "unsat\n";
- printf "proof: %s\n" (Z3.ast_to_string ctx proof);
- printf("\ncore:\n");
- for i = 0 to core_size - 1 do
- printf "%s\n" (Z3.ast_to_string ctx (core.(i)));
- done;
- printf("\n")
- | (_,_,_,_,_)-> assert false;
- );
- (* delete logical context *)
- Z3.del_context(ctx);
- end
-
-(**
-
-*)
-
-let get_implied_equalities_example() =
- begin
- printf "\nget_implied_equalities example\n%!";
- let ctx = mk_context [| |] in
- let int_ty = Z3.mk_int_sort ctx in
- let a = mk_int_var ctx "a" in
- let b = mk_int_var ctx "b" in
- let c = mk_int_var ctx "c" in
- let d = mk_int_var ctx "d" in
- let f = Z3.mk_func_decl ctx (Z3.mk_string_symbol ctx "f") [| int_ty |] int_ty in
- let fa = Z3.mk_app ctx f [| a |] in
- let fb = Z3.mk_app ctx f [| b |] in
- let fc = Z3.mk_app ctx f [| c |] in
- let terms = [| a; b; c; d; fa; fb; fc |] in
- Z3.assert_cnstr ctx (Z3.mk_eq ctx a b);
- Z3.assert_cnstr ctx (Z3.mk_eq ctx b c);
- Z3.assert_cnstr ctx (Z3.mk_le ctx fc b);
- Z3.assert_cnstr ctx (Z3.mk_le ctx b fa);
- let is_sat, class_ids = Z3.get_implied_equalities ctx terms in
- for i = 0 to 6 do
- printf "Class %s |-> %d\n" (Z3.ast_to_string ctx (terms.(i))) (class_ids.(i));
- done;
- printf "asserting f(a) <= b\n";
- Z3.assert_cnstr ctx (Z3.mk_le ctx fa b);
- let is_sat, class_ids = Z3.get_implied_equalities ctx terms in
- for i = 0 to 6 do
- printf "Class %s |-> %d\n" (Z3.ast_to_string ctx (terms.(i))) (class_ids.(i));
- done;
- (* delete logical context *)
- Z3.del_context(ctx)
- end;;
-
-let main() =
- begin
- ignore (Z3.open_log("ml.log"));
- display_version();
- simple_example();
- demorgan();
- find_model_example1();
- find_model_example2();
- prove_example1();
- prove_example2();
- push_pop_example1();
- quantifier_example1();
- array_example1();
- array_example2();
- array_example3();
- tuple_example1();
- bitvector_example1();
- bitvector_example2();
- eval_example1();
- two_contexts_example1();
- error_code_example1();
- error_code_example2();
- parser_example1();
- parser_example2();
- parser_example3();
- parser_example4();
- parser_example5();
-(* numeral_example(); *)
- ite_example();
-(* list_example(); *)
-(* tree_example(); *)
-(* forest_example(); *)
-(* binary_tree_example(); *)
- enum_example();
- unsat_core_and_proof_example();
- abstract_example();
- get_implied_equalities_example();
-(* incremental_example1(); *)
-(* reference_counter_example(); *)
-(* smt2parser_example(); *)
-(* substitute_example(); *)
-(* substitute_vars_example(); *)
- end;;
-
-let _ = main();;
diff --git a/src/api/ml/test_mlapiV3.regress.err b/src/api/ml/test_mlapiV3.regress.err
deleted file mode 100644
index 0c383b409..000000000
--- a/src/api/ml/test_mlapiV3.regress.err
+++ /dev/null
@@ -1,5 +0,0 @@
-WARNING: invalid function application, sort mismatch on argument at position 1
-WARNING: (define iff Bool Bool Bool) applied to:
-x of sort Int
-y of sort Bool
-
diff --git a/src/api/ml/test_mlapiV3.regress.out b/src/api/ml/test_mlapiV3.regress.out
deleted file mode 100644
index efcc4388d..000000000
--- a/src/api/ml/test_mlapiV3.regress.out
+++ /dev/null
@@ -1,315 +0,0 @@
-Z3 4.2.0.0
-
-simple_example
-CONTEXT:
-(solver)END OF CONTEXT
-
-DeMorgan
-DeMorgan is valid
-
-find_model_example1
-model for: x xor y
-sat
-y -> false
-x -> true
-
-
-find_model_example2
-model for: x < y + 1, x > 2
-sat
-y -> 3
-x -> 3
-
-model for: x < y + 1, x > 2, not(x = y)
-sat
-y -> 4
-x -> 3
-
-
-prove_example1
-prove: x = y implies g(x) = g(y)
-valid
-disprove: x = y implies g(g(x)) = g(y)
-invalid
-counterexample:
-y -> U!val!0
-x -> U!val!0
-g -> {
- U!val!0 -> U!val!1
- U!val!1 -> U!val!2
- else -> U!val!1
-}
-
-
-prove_example2
-prove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < 0
-valid
-disprove: not(g(g(x) - g(y)) = g(z)), x + z <= y <= x implies z < -1
-invalid
-counterexample:
-z -> (- 1)
-y -> (- 7719)
-x -> (- 7719)
-g -> {
- (- 7719) -> 0
- 0 -> 2
- (- 1) -> 3
- else -> 0
-}
-
-
-push_pop_example1
-assert: x >= 'big number'
-push
-number of scopes: 1
-assert: x <= 3
-unsat
-pop
-number of scopes: 0
-sat
-x = 1000000000000000000000000000000000000000000000000000000:int
-function interpretations:
-assert: y > x
-sat
-y = 1000000000000000000000000000000000000000000000000000001:int
-x = 1000000000000000000000000000000000000000000000000000000:int
-function interpretations:
-
-quantifier_example1
-pattern: {(f #0 #1)}
-
-assert axiom:
-(forall (k!0 Int) (k!1 Int) (= (inv!0 (f k!1 k!0)) k!0) :pat {(f k!1 k!0)})
-prove: f(x, y) = f(w, v) implies y = v
-valid
-disprove: f(x, y) = f(w, v) implies x = w
-that is: not(f(x, y) = f(w, v) implies x = w) is satisfiable
-unknown
-potential model:
-w = 2:int
-v = 1:int
-y = 1:int
-x = 0:int
-function interpretations:
-f = {(else|->(define f!52 Int Int Int)[(define k!50 Int Int)[#unknown], (define k!51 Int Int)[#unknown]])}
-#51 = {(2:int|->2:int), (1:int|->1:int), (15:int|->15:int), (11:int|->11:int), (0:int|->0:int), (19:int|->19:int), (else|->2:int)}
-f!52 = {(0:int, 1:int|->3:int), (2:int, 1:int|->3:int), (0:int, 0:int|->4:int), (2:int, 0:int|->5:int), (6:int, 2:int|->7:int), (2:int, 2:int|->8:int), (0:int, 2:int|->9:int), (6:int, 0:int|->10:int), (0:int, 11:int|->12:int), (2:int, 11:int|->13:int), (6:int, 11:int|->14:int), (0:int, 15:int|->16:int), (2:int, 15:int|->17:int), (6:int, 15:int|->18:int), (0:int, 19:int|->20:int), (6:int, 19:int|->21:int), (2:int, 19:int|->22:int), (else|->3:int)}
-inv!0 = {(3:int|->1:int), (4:int|->0:int), (5:int|->0:int), (7:int|->2:int), (8:int|->2:int), (9:int|->2:int), (10:int|->0:int), (12:int|->11:int), (13:int|->11:int), (14:int|->11:int), (16:int|->15:int), (17:int|->15:int), (18:int|->15:int), (20:int|->19:int), (21:int|->19:int), (22:int|->19:int), (else|->2:int)}
-#50 = {(2:int|->2:int), (6:int|->6:int), (0:int|->0:int), (else|->2:int)}
-reason for last failure: 7 (7 = quantifiers)
-
-array_example1
-prove: store(a1, i1, v1) = store(a2, i2, v2) implies (i1 = i3 or i2 = i3 or select(a1, i3) = select(a2, i3))
-(=> (= (store a1 i1 v1) (store a2 i2 v2))
- (or (= i1 i3) (= i2 i3) (= (select a1 i3) (select a2 i3))))
-valid
-
-array_example2
-n = 2
-(distinct k!0 k!1)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-function interpretations:
-#0 = {((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#1 = {((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 3
-(distinct k!0 k!1 k!2)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-#2 = (define as-array[k!2] (Array Bool Bool))
-function interpretations:
-#0 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define false Bool)), (else|->(define true Bool))}
-#1 = {((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#2 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 4
-(distinct k!0 k!1 k!2 k!3)
-sat
-#0 = (define as-array[k!0] (Array Bool Bool))
-#1 = (define as-array[k!1] (Array Bool Bool))
-#2 = (define as-array[k!2] (Array Bool Bool))
-#3 = (define as-array[k!3] (Array Bool Bool))
-function interpretations:
-#0 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define true Bool)), (else|->(define false Bool))}
-#1 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define false Bool)), (else|->(define true Bool))}
-#2 = {((define true Bool)|->(define true Bool)), ((define false Bool)|->(define true Bool)), (else|->(define true Bool))}
-#3 = {((define true Bool)|->(define false Bool)), ((define false Bool)|->(define false Bool)), (else|->(define false Bool))}
-n = 5
-(distinct k!0 k!1 k!2 k!3 k!4)
-unsat
-
-array_example3
-domain: int
-range: bool
-
-tuple_example1
-tuple_sort: (real, real)
-prove: get_x(mk_pair(x, y)) = 1 implies x = 1
-valid
-disprove: get_x(mk_pair(x, y)) = 1 implies y = 1
-invalid
-counterexample:
-y -> 0
-x -> 1
-
-prove: get_x(p1) = get_x(p2) and get_y(p1) = get_y(p2) implies p1 = p2
-valid
-disprove: get_x(p1) = get_x(p2) implies p1 = p2
-invalid
-counterexample:
-p1 -> (mk_pair 1 0)
-p2 -> (mk_pair 1 2)
-
-prove: p2 = update(p1, 0, 10) implies get_x(p2) = 10
-valid
-disprove: p2 = update(p1, 0, 10) implies get_y(p2) = 10
-invalid
-counterexample:
-p2 -> (mk_pair 10 1)
-p1 -> (mk_pair 0 1)
-
-
-bitvector_example1
-disprove: x - 10 <= 0 IFF x <= 10 for (32-bit) machine integers
-invalid
-counterexample:
-x -> bv2147483656[32]
-
-
-bitvector_example2
-find values of x and y, such that x ^ y - 103 == x * y
-sat
-y -> bv3905735879[32]
-x -> bv3787456528[32]
-
-
-eval_example1
-MODEL:
-y -> 4
-x -> 3
-
-evaluating x+y
-result = 7:int
-
-two_contexts_example1
-k!0
-
-error_code_example1
-last call succeeded.
-last call failed.
-
-error_code_example2
-before Z3_mk_iff
-Z3 error: type error.
-
-parser_example1
-formula 0: (> x y)
-formula 1: (> x 0)
-sat
-y -> 0
-x -> 1
-
-
-parser_example2
-formula: (> x y)
-sat
-y -> (- 1)
-x -> 0
-
-
-parser_example3
-assert axiom:
-(forall (x Int) (y Int) (= (g x y) (g y x)) :qid {k!1})
-formula: (forall (x Int) (y Int) (=> (= x y) (= (g x 0) (g 0 y))) :qid {k!1})
-valid
-
-parser_example4
-declaration 0: (define y Int)
-declaration 1: (define sk_hack Bool Bool)
-declaration 2: (define x Int)
-assumption 0: (= x 20)
-formula 0: (> x y)
-formula 1: (> x 0)
-
-parser_example5
-Z3 error: parser error.
-Error message: 'ERROR: line 1 column 41: could not find sort symbol 'y'.
-'.
-
-ite_example
-term: (if false 1 0)
-
-enum_example
-(define apple[fruit:0] fruit)
-(define banana[fruit:1] fruit)
-(define orange[fruit:2] fruit)
-(define is_apple[fruit:0] fruit Bool)
-(define is_banana[fruit:1] fruit Bool)
-(define is_orange[fruit:2] fruit Bool)
-valid
-valid
-invalid
-counterexample:
-
-valid
-valid
-
-unsat_core_and_proof_example
-unsat
-proof: [unit-resolution
- [def-axiom (or (or (not PredA) PredC (not PredB)) (not PredC))]
- [unit-resolution
- [def-axiom (or (or (not PredA) (not PredB) (not PredC)) PredC)]
- [unit-resolution
- [mp
- [asserted (or (and PredA PredB PredC) P1)]
- [monotonicity
- [rewrite
- (iff (and PredA PredB PredC)
- (not (or (not PredA) (not PredB) (not PredC))))]
- (iff (or (and PredA PredB PredC) P1)
- (or (not (or (not PredA) (not PredB) (not PredC))) P1))]
- (or (not (or (not PredA) (not PredB) (not PredC))) P1)]
- [asserted (not P1)]
- (not (or (not PredA) (not PredB) (not PredC)))]
- PredC]
- [unit-resolution
- [mp
- [asserted (or (and PredA (not PredC) PredB) P2)]
- [monotonicity
- [rewrite
- (iff (and PredA (not PredC) PredB)
- (not (or (not PredA) PredC (not PredB))))]
- (iff (or (and PredA (not PredC) PredB) P2)
- (or (not (or (not PredA) PredC (not PredB))) P2))]
- (or (not (or (not PredA) PredC (not PredB))) P2)]
- [asserted (not P2)]
- (not (or (not PredA) PredC (not PredB)))]
- false]
-
-core:
-(not P2)
-(not P1)
-
-
-abstract_example
-formula: (> x y)
-abstracted formula: (> #0 y)
-
-get_implied_equalities example
-Class a |-> 0
-Class b |-> 0
-Class c |-> 0
-Class d |-> 3
-Class (f a) |-> 0
-Class (f b) |-> 0
-Class (f c) |-> 0
-asserting f(a) <= b
-Class a |-> 0
-Class b |-> 0
-Class c |-> 0
-Class d |-> 3
-Class (f a) |-> 0
-Class (f b) |-> 0
-Class (f c) |-> 0
diff --git a/src/api/ml/test_theory.ml b/src/api/ml/test_theory.ml
deleted file mode 100644
index 8732bf220..000000000
--- a/src/api/ml/test_theory.ml
+++ /dev/null
@@ -1,42 +0,0 @@
-module Z3 = Z3.V3
-
-let print_lbool lb =
- match lb with
- | Z3.L_FALSE -> Printf.printf "false\n"
- | Z3.L_TRUE -> Printf.printf "true\n"
- | Z3.L_UNDEF -> Printf.printf "undef\n"
-
-(* simple sanity test of theory plugin *)
-let test_theory() =
- let ctx = Z3.mk_context_x [| |] in
- let th = Z3.mk_theory ctx "test-theory" in
- let _ = Z3.set_push_callback th (fun () -> Printf.printf "push\n") in
- let _ = Z3.set_pop_callback th (fun () -> Printf.printf "pop\n") in
- let _ = Z3.set_delete_callback th (fun () -> Printf.printf "delete\n") in
- let _ = Z3.set_final_check_callback th (fun () -> (Printf.printf "final\n"; true)) in
- let _ = Z3.set_delete_callback th (fun () -> Printf.printf "deleted\n") in
- let f_sym = Z3.mk_string_symbol ctx "f" in
- let a_sym = Z3.mk_string_symbol ctx "a" in
- let b_sym = Z3.mk_string_symbol ctx "b" in
- let int_sort = Z3.mk_int_sort ctx in
- let f = Z3.theory_mk_func_decl ctx th f_sym [|int_sort |] int_sort in
- let a = Z3.theory_mk_constant ctx th a_sym int_sort in
- let b = Z3.theory_mk_constant ctx th b_sym int_sort in
- let reduce_f g args =
- Printf.printf "reduce %s\n" (Z3.func_decl_to_string ctx g);
- match g, args with
- | _, [| a' |] when Z3.is_eq_func_decl ctx g f && Z3.is_eq_ast ctx a' a -> Some b
- | _, _ -> None
- in
- let _ = Z3.set_reduce_app_callback th reduce_f in
- (* b != f(b) is consistent *)
- let _ = Z3.assert_cnstr ctx (Z3.mk_not ctx (Z3.mk_eq ctx b (Z3.mk_app ctx f [| b |]))) in
- let res = Z3.check ctx in
- print_lbool res;
- (* b != f(a) is not consistent *)
- let _ = Z3.assert_cnstr ctx (Z3.mk_not ctx (Z3.mk_eq ctx b (Z3.mk_app ctx f [| a |]))) in
- let res = Z3.check ctx in
- print_lbool res;
- Z3.del_context ctx
-
-let _ = test_theory()
diff --git a/src/api/ml/update-ml-doc.cmd b/src/api/ml/update-ml-doc.cmd
deleted file mode 100755
index 32c39109e..000000000
--- a/src/api/ml/update-ml-doc.cmd
+++ /dev/null
@@ -1,38 +0,0 @@
-@echo off
-SETLOCAL
-
-REM Script to generate Z3 OCaml API documentation
-REM
-REM Assumes that environment variables are set to provide access to the OCaml compilers, as well as the following commands: sed
-
-rd 2>NUL /s /q doc
-md doc
-cd doc
-set MLDIR=..
-set DOCDIR=..\%1
-
-ocamldoc.opt -hide Z3,Z3.V3,Test_mlapi -html -css-style z3_ml.css -I %MLDIR% %MLDIR%\test_mlapi.ml %MLDIR%\z3.mli
-
-sed "s|val\(.*\)
|val\1
|g;s|type\(.*\)
|type\1
|g;s|type\(.*\) = |type\1 =
|g" Z3.html > Z3.new.html
-move >NUL Z3.new.html Z3.html
-
-sed "s|val\(.*\)
|val\1
|g" Test_mlapi.html > Test_mlapi.new.html
-move >NUL Test_mlapi.new.html Test_mlapi.html
-
-sed "s|Index of values
|OCaml: Index
|" Index_values.html > Index_values.new.html
-move >NUL Index_values.new.html Index_values.html
-
-copy >NUL %DOCDIR%\tabs.css
-copy >NUL %DOCDIR%\z3.png
-copy >NUL %DOCDIR%\z3_ml.css
-
-sed "1,23d" Test_mlapi.html | sed "$d" > Test_mlapi.new.html
-
-type 2>NUL %DOCDIR%\test_mlapi_header.html Test_mlapi.new.html %DOCDIR%\mldoc_footer.html >Test_mlapi.html
-
-sed "1,37d" Z3.html > Z3.new.html
-
-type 2>NUL %DOCDIR%\z3_mlapi_header.html Z3.new.html >Z3.html
-
-exit /B 0
-ENDLOCAL
diff --git a/src/api/ml/x3.ml b/src/api/ml/x3.ml
deleted file mode 100644
index 6ca5d49eb..000000000
--- a/src/api/ml/x3.ml
+++ /dev/null
@@ -1,366 +0,0 @@
-/* Copyright (c) Microsoft Corporation */
-
-quote (ml,"
-
-(* Internal auxiliary functions: *)
-(*
-(* Transform a pair of arrays into an array of pairs *)
-let array_combine a b =
- if Array.length a <> Array.length b then raise (Invalid_argument \"array_combine\");
- Array.init (Array.length a) (fun i -> (a.(i), b.(i)))
-
-(* [a |> b] is the pipeline operator for [b(a)] *)
-let ( |> ) x f = f x
-*)
-
-(* Find the index of an element in an array, raises Not_found is missing *)
-let find equal x a =
- let len = Array.length a in
- let rec find_ i =
- if i >= len then
- raise Not_found
- else
- if equal x a.(i) then
- i
- else
- find_ (i+1)
- in
- find_ 0
-
-
-(* Symbols *)
-
-let symbol_refine c s =
- match get_symbol_kind c s with
- | INT_SYMBOL -> Symbol_int (get_symbol_int c s)
- | STRING_SYMBOL -> Symbol_string (get_symbol_string c s)
-
-let mk_symbol c = function
- | Symbol_int(i) -> mk_int_symbol c i
- | Symbol_string(s) -> mk_string_symbol c s
-
-
-(* Sorts *)
-
-let get_datatype_sort c s =
- Array.init (get_datatype_sort_num_constructors c s) (fun i ->
- let constructor = get_datatype_sort_constructor c s i in
- let recognizer = get_datatype_sort_recognizer c s i in
- let accessors =
- Array.init (get_domain_size c constructor) (fun j ->
- get_datatype_sort_constructor_accessor c s i j
- ) in
- {constructor; recognizer; accessors}
- )
-
-let sort_refine c s =
- match get_sort_kind c s with
- | UNINTERPRETED_SORT -> Sort_uninterpreted (get_sort_name c s)
- | BOOL_SORT -> Sort_bool
- | INT_SORT -> Sort_int
- | BV_SORT -> Sort_bv (get_bv_sort_size c s)
- | FINITE_DOMAIN_SORT ->
- (match get_finite_domain_sort_size c s with
- | Some(sz) -> Sort_finite_domain (get_sort_name c s, sz)
- | None -> failwith \"Z3.sort_refine: failed to get size of finite-domain sort\"
- )
- | REAL_SORT -> Sort_real
- | ARRAY_SORT -> Sort_array (get_array_sort_domain c s, get_array_sort_range c s)
- | DATATYPE_SORT -> Sort_datatype (get_datatype_sort c s)
- | RELATION_SORT -> Sort_relation (Array.init (get_relation_arity c s) (fun i -> get_relation_column c s i))
- | UNKNOWN_SORT -> Sort_unknown
-
-let mk_sort c = function
- | Sort_uninterpreted(s) -> mk_uninterpreted_sort c s
- | Sort_bool -> mk_bool_sort c
- | Sort_int -> mk_int_sort c
- | Sort_bv(size) -> mk_bv_sort c size
- | Sort_finite_domain(name,size) -> mk_finite_domain_sort c name size
- | Sort_real -> mk_real_sort c
- | Sort_array(domain,range) -> mk_array_sort c domain range
- | Sort_datatype(constructors) -> get_range c constructors.(0).constructor
- | Sort_relation(_) -> invalid_arg \"Z3.mk_sort: cannot construct relation sorts\"
- | Sort_unknown(_) -> invalid_arg \"Z3.mk_sort: cannot construct unknown sorts\"
-
-
-(* Replacement datatypes creation API *)
-
-let mk_datatypes ctx generator =
- let usort0 = mk_uninterpreted_sort ctx (mk_int_symbol ctx 0)
- in
- let rec find_num_sorts i =
- if i = max_int then invalid_arg \"mk_datatypes: too many sorts\"
- else
- match generator (Array.make i usort0) with
- | None -> find_num_sorts (i+1)
- | Some(a) when Array.length a = i -> i
- | Some _ -> invalid_arg \"mk_datatypes: number of sorts and datatype descriptors must be equal\"
- in
- let num_sorts = find_num_sorts 0
- in
- let sorts0 = Array.init num_sorts (fun i -> mk_uninterpreted_sort ctx (mk_int_symbol ctx i))
- in
- let ctorss_descriptors =
- match generator sorts0 with
- | Some(ctorss_descriptors) -> ctorss_descriptors
- | None -> invalid_arg \"mk_datatypes: generator failed\"
- in
- let names = Array.map fst ctorss_descriptors
- in
- let ctorss =
- Array.map (fun (_, ctors_descriptor) ->
- Array.map (fun {constructor_desc; recognizer_desc; accessor_descs} ->
- let field_names = Array.map fst accessor_descs
- in
- let sort_refs = Array.make (Array.length accessor_descs) 0
- in
- let field_sorts =
- Array.mapi (fun i (_, sort) ->
- try
- let j = find (fun s t -> is_eq_sort ctx s t) sort sorts0 in
- sort_refs.(i) <- j ;
- None
- with Not_found ->
- Some(sort)
- ) accessor_descs
- in
- mk_constructor ctx constructor_desc recognizer_desc field_names field_sorts sort_refs
- ) ctors_descriptor
- ) ctorss_descriptors
- in
- let constructor_lists = Array.map (mk_constructor_list ctx) ctorss
- in
- let sorts,_ = mk_datatypes ctx names constructor_lists
- in
- let datatypes =
- Array.mapi (fun i sort ->
- (sort,
- Array.mapi (fun j ctor ->
- let num_fields = Array.length (snd ctorss_descriptors.(i)).(j).accessor_descs in
- let constructor, recognizer, accessors = query_constructor ctx ctor num_fields in
- {constructor; recognizer; accessors}
- ) ctorss.(i))
- ) sorts
- in
- Array.iter (fun ctor_list ->
- del_constructor_list ctx ctor_list
- ) constructor_lists
- ;
- Array.iter (fun ctors ->
- Array.iter (fun ctor ->
- del_constructor ctx ctor
- ) ctors
- ) ctorss
- ;
- datatypes
-
-
-(* Numerals *)
-
-let rec numeral_refine c t =
- assert( get_ast_kind c t = NUMERAL_AST );
- let sort = get_sort c t in
- let is_int, i = get_numeral_int c t in
- if is_int then
- Numeral_int (i, sort)
- else
- let is_int64, i = get_numeral_int64 c t in
- if is_int64 then
- Numeral_int64 (i, sort)
- else
- if get_sort_kind c sort <> REAL_SORT then
- Numeral_large (get_numeral_string c t, sort)
- else
- let n = numeral_refine c (get_numerator c t) in
- let d = numeral_refine c (get_denominator c t) in
- Numeral_rational (n, d)
-
-
-let to_real c x =
- if get_sort_kind c (get_sort c x) = REAL_SORT then
- x
- else
- mk_int2real c x
-
-let rec embed_numeral c = function
- | Numeral_int (i, s) -> mk_int c i s
- | Numeral_int64 (i, s) -> mk_int64 c i s
- | Numeral_large (l, s) -> mk_numeral c l s
- | Numeral_rational (Numeral_int(n,_), Numeral_int(d,_)) -> mk_real c n d
- | Numeral_rational (n, d) ->
- mk_div c (to_real c (embed_numeral c n)) (to_real c (embed_numeral c d))
- (* Or should the following be used instead?
- let n_str = get_numeral_string c (embed_numeral c n) in
- let d_str = get_numeral_string c (embed_numeral c d) in
- mk_numeral c (n_str ^ \" / \" ^ d_str) (mk_real_sort c)
- *)
-
-(* Terms *)
-
-let get_app_args c a =
- Array.init (get_app_num_args c a) (get_app_arg c a);;
-
-let get_domains c d =
- Array.init (get_domain_size c d) (get_domain c d);;
-
-
-let get_pattern_terms c p =
- Array.init (get_pattern_num_terms c p) (get_pattern c p)
-
-
-let term_refine c t =
- match get_ast_kind c t with
- | NUMERAL_AST ->
- Term_numeral (numeral_refine c t)
- | APP_AST ->
- let t' = to_app c t in
- let f = get_app_decl c t' in
- let num_args = get_app_num_args c t' in
- let args = Array.init num_args (get_app_arg c t') in
- let k = get_decl_kind c f in
- Term_app (k, f, args)
- | QUANTIFIER_AST ->
- let bt = if is_quantifier_forall c t then Forall else Exists in
- let w = get_quantifier_weight c t in
- let np = get_quantifier_num_patterns c t in
- let pats = Array.init np (get_quantifier_pattern_ast c t) in
- let pats = Array.map (get_pattern_terms c) pats in
- let nb = get_quantifier_num_bound c t in
- let bound =
- Array.init nb (fun i ->
- (get_quantifier_bound_name c t i, get_quantifier_bound_sort c t i)
- ) in
- let body = get_quantifier_body c t in
- Term_quantifier (bt, w, pats, bound, body)
- | VAR_AST ->
- Term_var (get_index_value c t, get_sort c t)
- | _ ->
- assert false
-
-
-(* let mk_term c = function *)
-(* | Term_numeral (numeral, sort) -> mk_numeral c numeral sort *)
-(* | Term_app (kind, decl, args) -> *)
-(* | Term_quantifier (strength, weight, pats, bound, body) -> *)
-(* | Term_var (index, sort) -> *)
-
-
-
-(* Refined model API *)
-
-let model_refine c m =
- let num_sorts = model_get_num_sorts c m in
- let sorts = Hashtbl.create num_sorts in
- for i = 0 to num_sorts - 1 do
- let sort = model_get_sort c m i in
- let universe = model_get_sort_universe c m sort in
- Hashtbl.add sorts sort universe
- done;
- let num_consts = model_get_num_consts c m in
- let consts = Hashtbl.create num_consts in
- let arrays = Hashtbl.create 0 in
- for i = 0 to num_consts - 1 do
- let const_decl = model_get_const_decl c m i in
- match model_get_const_interp c m const_decl with
- | Some(const_interp) ->
- if is_as_array c const_interp then
- let array_decl = get_as_array_func_decl c const_interp in
- match model_get_func_interp c m array_decl with
- | Some(array_interp) ->
- let num_entries = func_interp_get_num_entries c array_interp in
- let tbl = Hashtbl.create num_entries in
- for i = 0 to num_entries - 1 do
- let entry = func_interp_get_entry c array_interp i in
- assert( func_entry_get_num_args c entry = 1 );
- let arg = func_entry_get_arg c entry 0 in
- let value = func_entry_get_value c entry in
- Hashtbl.add tbl arg value
- done;
- let default = func_interp_get_else c array_interp in
- Hashtbl.add arrays const_decl (tbl, default)
- | None ->
- ()
- else
- Hashtbl.add consts const_decl const_interp
- | None ->
- ()
- done;
- let num_funcs = model_get_num_funcs c m in
- let funcs = Hashtbl.create num_funcs in
- for i = 0 to num_funcs - 1 do
- let func_decl = model_get_func_decl c m i in
- if not (Hashtbl.mem arrays func_decl) then
- match model_get_func_interp c m func_decl with
- | Some(func_interp) ->
- let num_entries = func_interp_get_num_entries c func_interp in
- let tbl = Hashtbl.create num_entries in
- for i = 0 to num_entries - 1 do
- let entry = func_interp_get_entry c func_interp i in
- let num_args = func_entry_get_num_args c entry in
- let args = Array.init num_args (fun i -> func_entry_get_arg c entry i) in
- let value = func_entry_get_value c entry in
- Hashtbl.add tbl args value
- done;
- let default = func_interp_get_else c func_interp in
- Hashtbl.add funcs func_decl (tbl, default)
- | None ->
- ()
- done;
- {sorts; consts; arrays; funcs}
-
-
-(* Extended parser API *)
-
-let get_smtlib_formulas c =
- Array.init (get_smtlib_num_formulas c) (get_smtlib_formula c)
-
-let get_smtlib_assumptions c =
- Array.init (get_smtlib_num_assumptions c) (get_smtlib_assumption c)
-
-let get_smtlib_decls c =
- Array.init (get_smtlib_num_decls c) (get_smtlib_decl c)
-
-let get_smtlib_parse_results c =
- (get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c)
-
-let parse_smtlib_string_x c a1 a2 a3 a4 a5 =
- parse_smtlib_string c a1 a2 a3 a4 a5 ;
- get_smtlib_parse_results c
-
-let parse_smtlib_file_x c a1 a2 a3 a4 a5 =
- parse_smtlib_file c a1 a2 a3 a4 a5 ;
- get_smtlib_parse_results c
-
-let parse_smtlib_string_formula c a1 a2 a3 a4 a5 =
- parse_smtlib_string c a1 a2 a3 a4 a5 ;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith \"Z3: parse_smtlib_string_formula\"
-
-let parse_smtlib_file_formula c a1 a2 a3 a4 a5 =
- parse_smtlib_file c a1 a2 a3 a4 a5 ;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith \"Z3: parse_smtlib_file_formula\"
-
-
-(* Error handling *)
-
-let get_error_msg c e =
- match e with
- | PARSER_ERROR -> (get_error_msg_ex c e) ^ \": \" ^ (get_smtlib_error c)
- | _ -> get_error_msg_ex c e
-
-
-(* Refined stats API *)
-
-let stats_refine c s =
- let num_stats = stats_size c s in
- let tbl = Hashtbl.create num_stats in
- for i = 0 to num_stats - 1 do
- let key = stats_get_key c s i in
- let datum =
- if stats_is_uint c s i then
- Stat_int(stats_get_uint_value c s i)
- else
- Stat_float(stats_get_double_value c s i) in
- Hashtbl.add tbl key datum
- done;
- tbl
-");
diff --git a/src/api/ml/x3V3.ml b/src/api/ml/x3V3.ml
deleted file mode 100644
index 96156f0a8..000000000
--- a/src/api/ml/x3V3.ml
+++ /dev/null
@@ -1,378 +0,0 @@
-quote (ml,"
-
-
-(* Internal auxillary functions: *)
-
-(* Transform a pair of arrays into an array of pairs *)
-let array_combine a b =
- if Array.length a <> Array.length b then raise (Invalid_argument \"array_combine\");
- Array.init (Array.length a) (fun i->(a.(i),b.(i)));;
-
-(* [a |> b] is the pipeline operator for [b(a)] *)
-let ( |> ) x f = f x;;
-
-
-(* Extensions, except for refinement: *)
-let mk_context_x configs =
- let config = mk_config() in
- let f(param_id,param_value) = set_param_value config param_id param_value in
- Array.iter f configs;
- let context = mk_context config in
- del_config config;
- context;;
-
-let get_app_args c a =
- Array.init (get_app_num_args c a) (get_app_arg c a);;
-
-let get_domains c d =
- Array.init (get_domain_size c d) (get_domain c d);;
-
-let get_array_sort c t = (get_array_sort_domain c t, get_array_sort_range c t);;
-
-let get_tuple_sort c ty =
- (get_tuple_sort_mk_decl c ty,
- Array.init (get_tuple_sort_num_fields c ty) (get_tuple_sort_field_decl c ty));;
-
-type datatype_constructor_refined = {
- constructor : func_decl;
- recognizer : func_decl;
- accessors : func_decl array
-}
-
-let get_datatype_sort c ty =
- Array.init (get_datatype_sort_num_constructors c ty)
- (fun idx_c ->
- let constr = get_datatype_sort_constructor c ty idx_c in
- let recog = get_datatype_sort_recognizer c ty idx_c in
- let num_acc = get_domain_size c constr in
- { constructor = constr;
- recognizer = recog;
- accessors = Array.init num_acc (get_datatype_sort_constructor_accessor c ty idx_c);
- })
-
-let get_model_constants c m =
- Array.init (get_model_num_constants c m) (get_model_constant c m);;
-
-
-let get_model_func_entry c m i j =
- (Array.init
- (get_model_func_entry_num_args c m i j)
- (get_model_func_entry_arg c m i j),
- get_model_func_entry_value c m i j);;
-
-let get_model_func_entries c m i =
- Array.init (get_model_func_num_entries c m i) (get_model_func_entry c m i);;
-
-let get_model_funcs c m =
- Array.init (get_model_num_funcs c m)
- (fun i->(get_model_func_decl c m i |> get_decl_name c,
- get_model_func_entries c m i,
- get_model_func_else c m i));;
-
-let get_smtlib_formulas c =
- Array.init (get_smtlib_num_formulas c) (get_smtlib_formula c);;
-
-let get_smtlib_assumptions c =
- Array.init (get_smtlib_num_assumptions c) (get_smtlib_assumption c);;
-
-let get_smtlib_decls c =
- Array.init (get_smtlib_num_decls c) (get_smtlib_decl c);;
-
-let get_smtlib_parse_results c =
- (get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c);;
-
-let parse_smtlib_string_formula c a1 a2 a3 a4 a5 =
- (parse_smtlib_string c a1 a2 a3 a4 a5;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith \"Z3: parse_smtlib_string_formula\");;
-
-let parse_smtlib_file_formula c a1 a2 a3 a4 a5 =
- (parse_smtlib_file c a1 a2 a3 a4 a5;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith \"Z3: parse_smtlib_file_formula\");;
-
-let parse_smtlib_string_x c a1 a2 a3 a4 a5 =
- (parse_smtlib_string c a1 a2 a3 a4 a5; get_smtlib_parse_results c);;
-
-let parse_smtlib_file_x c a1 a2 a3 a4 a5 =
- (parse_smtlib_file c a1 a2 a3 a4 a5; get_smtlib_parse_results c);;
-
-(* Refinement: *)
-
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
- | Symbol_unknown;;
-
-let symbol_refine c s =
- match get_symbol_kind c s with
- | INT_SYMBOL -> Symbol_int (get_symbol_int c s)
- | STRING_SYMBOL -> Symbol_string (get_symbol_string c s);;
-
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_real
- | Sort_bv of int
- | Sort_array of (sort * sort)
- | Sort_datatype of datatype_constructor_refined array
- | Sort_relation
- | Sort_finite_domain
- | Sort_unknown of symbol;;
-
-let sort_refine c ty =
- match get_sort_kind c ty with
- | UNINTERPRETED_SORT -> Sort_uninterpreted (get_sort_name c ty)
- | BOOL_SORT -> Sort_bool
- | INT_SORT -> Sort_int
- | REAL_SORT -> Sort_real
- | BV_SORT -> Sort_bv (get_bv_sort_size c ty)
- | ARRAY_SORT -> Sort_array (get_array_sort_domain c ty, get_array_sort_range c ty)
- | DATATYPE_SORT -> Sort_datatype (get_datatype_sort c ty)
- | RELATION_SORT -> Sort_relation
- | FINITE_DOMAIN_SORT -> Sort_finite_domain
- | UNKNOWN_SORT -> Sort_unknown (get_sort_name c ty);;
-
-let get_pattern_terms c p =
- Array.init (get_pattern_num_terms c p) (get_pattern c p)
-
-type binder_type = | Forall | Exists
-
-type numeral_refined =
- | Numeral_small of int64 * int64
- | Numeral_large of string
-
-type term_refined =
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol *sort) array * ast
- | Term_numeral of numeral_refined * sort
- | Term_var of int * sort
-
-let term_refine c t =
- match get_ast_kind c t with
- | NUMERAL_AST ->
- let (is_small, n, d) = get_numeral_small c t in
- if is_small then
- Term_numeral(Numeral_small(n,d), get_sort c t)
- else
- Term_numeral(Numeral_large(get_numeral_string c t), get_sort c t)
- | APP_AST ->
- let t' = to_app c t in
- let f = get_app_decl c t' in
- let num_args = get_app_num_args c t' in
- let args = Array.init num_args (get_app_arg c t') in
- let k = get_decl_kind c f in
- Term_app (k, f, args)
- | QUANTIFIER_AST ->
- let bt = if is_quantifier_forall c t then Forall else Exists in
- let w = get_quantifier_weight c t in
- let np = get_quantifier_num_patterns c t in
- let pats = Array.init np (get_quantifier_pattern_ast c t) in
- let pats = Array.map (get_pattern_terms c) pats in
- let nb = get_quantifier_num_bound c t in
- let bound = Array.init nb
- (fun i -> (get_quantifier_bound_name c t i, get_quantifier_bound_sort c t i)) in
- let body = get_quantifier_body c t in
- Term_quantifier(bt, w, pats, bound, body)
- | VAR_AST ->
- Term_var(get_index_value c t, get_sort c t)
- | _ -> assert false
-
-type theory_callbacks =
- {
- mutable delete_theory : unit -> unit;
- mutable reduce_eq : ast -> ast -> ast option;
- mutable reduce_app : func_decl -> ast array -> ast option;
- mutable reduce_distinct : ast array -> ast option;
- mutable final_check : unit -> bool;
- mutable new_app : ast -> unit;
- mutable new_elem : ast -> unit;
- mutable init_search: unit -> unit;
- mutable push: unit -> unit;
- mutable pop: unit -> unit;
- mutable restart : unit -> unit;
- mutable reset: unit -> unit;
- mutable new_eq : ast -> ast -> unit;
- mutable new_diseq : ast -> ast -> unit;
- mutable new_assignment: ast -> bool -> unit;
- mutable new_relevant : ast -> unit;
- }
-
-let mk_theory_callbacks() =
- {
- delete_theory = (fun () -> ());
- reduce_eq = (fun _ _ -> None);
- reduce_app = (fun _ _ -> None);
- reduce_distinct = (fun _ -> None);
- final_check = (fun _ -> true);
- new_app = (fun _ -> ());
- new_elem = (fun _ -> ());
- init_search= (fun () -> ());
- push= (fun () -> ());
- pop= (fun () -> ());
- restart = (fun () -> ());
- reset= (fun () -> ());
- new_eq = (fun _ _ -> ());
- new_diseq = (fun _ _ -> ());
- new_assignment = (fun _ _ -> ());
- new_relevant = (fun _ -> ());
- }
-
-
-external get_theory_callbacks : theory -> theory_callbacks = \"get_theory_callbacks\"
-external mk_theory_register : context -> string -> theory_callbacks -> theory = \"mk_theory_register\"
-external set_delete_callback_register : theory -> unit = \"set_delete_callback_register\"
-external set_reduce_app_callback_register : theory -> unit = \"set_reduce_app_callback_register\"
-external set_reduce_eq_callback_register : theory -> unit = \"set_reduce_eq_callback_register\"
-external set_reduce_distinct_callback_register : theory -> unit = \"set_reduce_distinct_callback_register\"
-external set_new_app_callback_register : theory -> unit = \"set_new_app_callback_register\"
-external set_new_elem_callback_register : theory -> unit = \"set_new_elem_callback_register\"
-external set_init_search_callback_register : theory -> unit = \"set_init_search_callback_register\"
-external set_push_callback_register : theory -> unit = \"set_push_callback_register\"
-external set_pop_callback_register : theory -> unit = \"set_pop_callback_register\"
-external set_restart_callback_register : theory -> unit = \"set_restart_callback_register\"
-external set_reset_callback_register : theory -> unit = \"set_reset_callback_register\"
-external set_final_check_callback_register : theory -> unit = \"set_final_check_callback_register\"
-external set_new_eq_callback_register : theory -> unit = \"set_new_eq_callback_register\"
-external set_new_diseq_callback_register : theory -> unit = \"set_new_diseq_callback_register\"
-external set_new_assignment_callback_register : theory -> unit = \"set_new_assignment_callback_register\"
-external set_new_relevant_callback_register : theory -> unit = \"set_new_relevant_callback_register\"
-
-let is_some opt =
- match opt with
- | Some v -> true
- | None -> false
-
-let get_some opt =
- match opt with
- | Some v -> v
- | None -> failwith \"None unexpected\"
-
-
-
-
-let apply_delete (th:theory_callbacks) = th.delete_theory ()
-let set_delete_callback th cb =
- let cbs = get_theory_callbacks th in
- cbs.delete_theory <- cb;
- set_delete_callback_register th
-
-let mk_theory context name =
- Callback.register \"is_some\" is_some;
- Callback.register \"get_some\" get_some;
- Callback.register \"apply_delete\" apply_delete;
- let cbs = mk_theory_callbacks() in
- mk_theory_register context name cbs
-
-
-let apply_reduce_app (th:theory_callbacks) f args = th.reduce_app f args
-let set_reduce_app_callback th cb =
- Callback.register \"apply_reduce_app\" apply_reduce_app;
- let cbs = get_theory_callbacks th in
- cbs.reduce_app <- cb;
- set_reduce_app_callback_register th
-
-let apply_reduce_eq (th:theory_callbacks) a b = th.reduce_eq a b
-let set_reduce_eq_callback th cb =
- Callback.register \"apply_reduce_eq\" apply_reduce_eq;
- let cbs = get_theory_callbacks th in
- cbs.reduce_eq <- cb;
- set_reduce_eq_callback_register th
-
-let apply_reduce_distinct (th:theory_callbacks) args = th.reduce_distinct args
-let set_reduce_distinct_callback th cb =
- Callback.register \"apply_reduce_distinct\" apply_reduce_distinct;
- let cbs = get_theory_callbacks th in
- cbs.reduce_distinct <- cb;
- set_reduce_distinct_callback_register th
-
-
-let apply_new_app (th:theory_callbacks) a = th.new_app a
-let set_new_app_callback th cb =
- Callback.register \"apply_new_app\" apply_new_app;
- let cbs = get_theory_callbacks th in
- cbs.new_app <- cb;
- set_new_app_callback_register th
-
-let apply_new_elem (th:theory_callbacks) a = th.new_elem a
-let set_new_elem_callback th cb =
- Callback.register \"apply_new_elem\" apply_new_elem;
- let cbs = get_theory_callbacks th in
- cbs.new_elem <- cb;
- set_new_elem_callback_register th
-
-
-let apply_init_search (th:theory_callbacks) = th.init_search()
-let set_init_search_callback th cb =
- Callback.register \"apply_init_search\" apply_init_search;
- let cbs = get_theory_callbacks th in
- cbs.init_search <- cb;
- set_init_search_callback_register th
-
-
-let apply_push (th:theory_callbacks) = th.push()
-let set_push_callback th cb =
- Callback.register \"apply_push\" apply_push;
- let cbs = get_theory_callbacks th in
- cbs.push <- cb;
- set_push_callback_register th
-
-let apply_pop (th:theory_callbacks) = th.pop()
-let set_pop_callback th cb =
- Callback.register \"apply_pop\" apply_pop;
- let cbs = get_theory_callbacks th in
- cbs.pop <- cb;
- set_pop_callback_register th
-
-
-let apply_restart (th:theory_callbacks) = th.restart()
-let set_restart_callback th cb =
- Callback.register \"apply_restart\" apply_restart;
- let cbs = get_theory_callbacks th in
- cbs.restart <- cb;
- set_restart_callback_register th
-
-
-let apply_reset (th:theory_callbacks) = th.reset()
-let set_reset_callback th cb =
- Callback.register \"apply_reset\" apply_reset;
- let cbs = get_theory_callbacks th in
- cbs.reset <- cb;
- set_reset_callback_register th
-
-let apply_final_check (th:theory_callbacks) = th.final_check()
-let set_final_check_callback th cb =
- Callback.register \"apply_final_check\" apply_final_check;
- let cbs = get_theory_callbacks th in
- cbs.final_check <- cb;
- set_final_check_callback_register th
-
-let apply_new_eq (th:theory_callbacks) a b = th.new_eq a b
-let set_new_eq_callback th cb =
- Callback.register \"apply_new_eq\" apply_new_eq;
- let cbs = get_theory_callbacks th in
- cbs.new_eq <- cb;
- set_new_eq_callback_register th
-
-
-let apply_new_diseq (th:theory_callbacks) a b = th.new_diseq a b
-let set_new_diseq_callback th cb =
- Callback.register \"apply_new_diseq\" apply_new_diseq;
- let cbs = get_theory_callbacks th in
- cbs.new_diseq <- cb;
- set_new_diseq_callback_register th
-
-let apply_new_assignment (th:theory_callbacks) a b = th.new_assignment a b
-let set_new_assignment_callback th cb =
- Callback.register \"apply_new_assignment\" apply_new_assignment;
- let cbs = get_theory_callbacks th in
- cbs.new_assignment <- cb;
- set_new_assignment_callback_register th
-
-let apply_new_relevant (th:theory_callbacks) a = th.new_relevant a
-let set_new_relevant_callback th cb =
- Callback.register \"apply_new_relevant\" apply_new_relevant;
- let cbs = get_theory_callbacks th in
- cbs.new_relevant <- cb;
- set_new_relevant_callback_register th
-
-");
diff --git a/src/api/ml/x3V3.mli b/src/api/ml/x3V3.mli
deleted file mode 100644
index 2aa2ba4e7..000000000
--- a/src/api/ml/x3V3.mli
+++ /dev/null
@@ -1,361 +0,0 @@
-
-quote (mli,"
-
-(** {2 {L ML Extensions}} *)
-
-(**
- \[ [ mk_context_x configs] \] is a shorthand for the context with configurations in [configs].
-*)
-val mk_context_x: (string * string) array -> context;;
-
-(**
- \[ [ get_app_args c a ] \] is the array of arguments of an application. If [t] is a constant, then the array is empty.
-
- - {b See also}: {!Z3.get_app_num_args}
- - {b See also}: {!Z3.get_app_arg}
-*)
-val get_app_args: context -> app -> ast array
-
-(**
- \[ [ get_app_args c d ] \] is the array of parameters of [d].
-
- - {b See also}: {!Z3.get_domain_size}
- - {b See also}: {!Z3.get_domain}
-*)
-val get_domains: context -> func_decl -> sort array
-
-(**
- \[ [ get_array_sort c t ] \] is the domain and the range of [t].
-
- - {b See also}: {!Z3.get_array_sort_domain}
- - {b See also}: {!Z3.get_array_sort_range}
-*)
-val get_array_sort: context -> sort -> sort * sort
-
-(**
- \[ [ get_tuple_sort c ty ] \] is the pair [(mk_decl, fields)] where [mk_decl] is the constructor declaration of [ty], and [fields] is the array of fields in [ty].
-
- - {b See also}: {!Z3.get_tuple_sort_mk_decl}
- - {b See also}: {!Z3.get_tuple_sort_num_fields}
- - {b See also}: {!Z3.get_tuple_sort_field_decl}
-*)
-val get_tuple_sort: context -> sort -> (func_decl * func_decl array)
-
-(**
- \[ [ datatype_constructor_refined ] \] is the refinement of a datatype constructor.
-
- It contains the constructor declaration, recognizer, and list of accessor functions.
-*)
-type datatype_constructor_refined = {
- constructor : func_decl;
- recognizer : func_decl;
- accessors : func_decl array
-}
-
-(**
- \[ [ get_datatype_sort c ty ] \] is the array of triples [(constructor, recognizer, fields)] where [constructor] is the constructor declaration of [ty], [recognizer] is the recognizer for the [constructor], and [fields] is the array of fields in [ty].
-
- - {b See also}: {!Z3.get_datatype_sort_num_constructors}
- - {b See also}: {!Z3.get_datatype_sort_constructor}
- - {b See also}: {!Z3.get_datatype_sort_recognizer}
- - {b See also}: {!Z3.get_datatype_sort_constructor_accessor}
-*)
-
-
-val get_datatype_sort: context -> sort -> datatype_constructor_refined array
-
-(**
- \[ [ get_model_constants c m ] \] is the array of constants in the model [m].
-
- - {b See also}: {!Z3.get_model_num_constants}
- - {b See also}: {!Z3.get_model_constant}
-*)
-val get_model_constants: context -> model -> func_decl array
-
-
-(**
- \[ [ get_model_func_entry c m i j ] \] is the [j]'th entry in the [i]'th function in the model [m].
-
- - {b See also}: {!Z3.get_model_func_entry_num_args}
- - {b See also}: {!Z3.get_model_func_entry_arg}
- - {b See also}: {!Z3.get_model_func_entry_value}
-*)
-val get_model_func_entry: context -> model -> int -> int -> (ast array * ast);;
-
-(**
- \[ [ get_model_func_entries c m i ] \] is the array of entries in the [i]'th function in the model [m].
-
- - {b See also}: {!Z3.get_model_func_num_entries}
- - {b See also}: {!Z3.get_model_func_entry}
-*)
-val get_model_func_entries: context -> model -> int -> (ast array * ast) array;;
-
-(**
- \[ [ get_model_funcs c m ] \] is the array of functions in the model [m]. Each function is represented by the triple [(decl, entries, else)], where [decl] is the declaration name for the function, [entries] is the array of entries in the function, and [else] is the default (else) value for the function.
-
- - {b See also}: {!Z3.get_model_num_funcs}
- - {b See also}: {!Z3.get_model_func_decl}
- - {b See also}: {!Z3.get_model_func_entries}
- - {b See also}: {!Z3.get_model_func_else}
-*)
-val get_model_funcs: context -> model ->
- (symbol *
- (ast array * ast) array *
- ast) array
-
-(**
- \[ [ get_smtlib_formulas c ] \] is the array of formulas created by a preceding call to {!Z3.parse_smtlib_string} or {!Z3.parse_smtlib_file}.
-
- Recommend use {!Z3.parse_smtlib_string_x} or {!Z3.parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
-
- - {b See also}: {!Z3.parse_smtlib_string_x}
- - {b See also}: {!Z3.parse_smtlib_file_x}
- - {b See also}: {!Z3.parse_smtlib_string}
- - {b See also}: {!Z3.parse_smtlib_file}
- - {b See also}: {!Z3.get_smtlib_num_formulas}
- - {b See also}: {!Z3.get_smtlib_formula}
-*)
-val get_smtlib_formulas: context -> ast array
-
-(**
- \[ [get_smtlib_assumptions c] \] is the array of assumptions created by a preceding call to {!Z3.parse_smtlib_string} or {!Z3.parse_smtlib_file}.
-
- Recommend use {!Z3.parse_smtlib_string_x} or {!Z3.parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
-
-
- - {b See also}: {!Z3.parse_smtlib_string_x}
- - {b See also}: {!Z3.parse_smtlib_file_x}
- - {b See also}: {!Z3.parse_smtlib_string}
- - {b See also}: {!Z3.parse_smtlib_file}
- - {b See also}: {!Z3.get_smtlib_num_assumptions}
- - {b See also}: {!Z3.get_smtlib_assumption}
-*)
-val get_smtlib_assumptions: context -> ast array
-
-(**
- \[ [ get_smtlib_decls c ] \] is the array of declarations created by a preceding call to {!Z3.parse_smtlib_string} or {!Z3.parse_smtlib_file}.
-
- Recommend use {!Z3.parse_smtlib_string_x} or {!Z3.parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
-
-
- - {b See also}: {!Z3.parse_smtlib_string_x}
- - {b See also}: {!Z3.parse_smtlib_file_x}
- - {b See also}: {!Z3.parse_smtlib_string}
- - {b See also}: {!Z3.parse_smtlib_file}
- - {b See also}: {!Z3.get_smtlib_num_decls}
- - {b See also}: {!Z3.get_smtlib_decl}
-*)
-val get_smtlib_decls: context -> func_decl array
-
-(**
- \[ [ get_smtlib_parse_results c ] \] is the triple [(get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c)].
-
- Recommend use {!Z3.parse_smtlib_string_x} or {!Z3.parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
-
-
- - {b See also}: {!Z3.parse_smtlib_string_x}
- - {b See also}: {!Z3.parse_smtlib_file_x}
- - {b See also}: {!Z3.parse_smtlib_string}
- - {b See also}: {!Z3.parse_smtlib_file}
- - {b See also}: {!Z3.get_smtlib_formulas}
- - {b See also}: {!Z3.get_smtlib_assumptions}
- - {b See also}: {!Z3.get_smtlib_decls}
-*)
-val get_smtlib_parse_results: context -> (ast array * ast array * func_decl array)
-
-(**
- \[ [ parse_smtlib_string_formula c ... ] \] calls [(parse_smtlib_string c ...)] and returns the single formula produced.
-
- Recommended for functional style interface to the SMT-LIB parser.
-
- - {b See also}: {!Z3.parse_smtlib_file_formula}
- - {b See also}: {!Z3.parse_smtlib_string_x}
-*)
-val parse_smtlib_string_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-
-(**
- \[ [ parse_smtlib_file_formula c ... ] \] calls [(parse_smtlib_file c ...)] and returns the single formula produced.
-
- Recommended for functional style interface to the SMT-LIB parser.
-
- - {b See also}: {!Z3.parse_smtlib_file_formula}
- - {b See also}: {!Z3.parse_smtlib_file_x}
-*)
-val parse_smtlib_file_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-
-(**
- \[ [ parse_smtlib_string_x c ... ] \] is [(parse_smtlib_string c ...; get_smtlib_parse_results c)]
-
- Recommended for functional style interface to the SMT-LIB parser.
-
- - {b See also}: {!Z3.parse_smtlib_file_x}
- - {b See also}: {!Z3.parse_smtlib_string}
- - {b See also}: {!Z3.get_smtlib_parse_results}
-*)
-val parse_smtlib_string_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-
-(**
- \[ [ parse_smtlib_file_x c ... ] \] is [(parse_smtlib_file c ...; get_smtlib_parse_results c)]
-
- Recommended for functional style interface to the SMT-LIB parser.
-
- - {b See also}: {!Z3.parse_smtlib_string_x}
- - {b See also}: {!Z3.parse_smtlib_file}
- - {b See also}: {!Z3.get_smtlib_parse_results}
-*)
-val parse_smtlib_file_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-
-(**
- \[ [ symbol_refined ] \] is the refinement of a {!Z3.symbol} .
-
- - {b See also}: {!Z3.symbol_refine}
- - {b See also}: {!Z3.get_symbol_kind}
-*)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
- | Symbol_unknown;;
-
-(**
- \[ [ symbol_refine c s ] \] is the refined symbol of [s].
-
- - {b See also}: {!Z3.symbol_refined}
- - {b See also}: {!Z3.get_symbol_kind}
-*)
-val symbol_refine: context -> symbol -> symbol_refined;;
-
-(**
- \[ [ sort_refined ] \] is the refinement of a {!Z3.sort} .
-
- - {b See also}: {!Z3.sort_refine}
- - {b See also}: {!Z3.get_sort_kind}
-*)
-
-
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_real
- | Sort_bv of int
- | Sort_array of (sort * sort)
- | Sort_datatype of datatype_constructor_refined array
- | Sort_relation
- | Sort_finite_domain
- | Sort_unknown of symbol
-
-(**
- \[ [ sort_refine c t ] \] is the refined sort of [t].
-
- - {b See also}: {!Z3.sort_refined}
- - {b See also}: {!Z3.get_sort_kind}
-*)
-val sort_refine: context -> sort -> sort_refined;;
-
-(**
- \[ [ binder_type ] \] is a universal or existential quantifier.
-
- - {b See also}: {!Z3.term_refined}
-*)
-type binder_type = | Forall | Exists
-
-(**
- \[ [ numeral_refined ] \] is the refinement of a numeral .
-
- Numerals whose fractional representation can be fit with
- 64 bit integers are treated as small.
-
-*)
-type numeral_refined =
- | Numeral_small of int64 * int64
- | Numeral_large of string
-
-(**
- \[ [ term_refined ] \] is the refinement of a {!Z3.ast} .
-
- - {b See also}: {!Z3.term_refine}
-*)
-type term_refined =
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol * sort) array * ast
- | Term_numeral of numeral_refined * sort
- | Term_var of int * sort
-
-(**
- \[ [ term_refine c a ] \] is the refined term of [a].
-
- - {b See also}: {!Z3.term_refined}
-*)
-val term_refine : context -> ast -> term_refined
-
-(**
- \[ [mk_theory c name ] \] create a custom theory.
-
-*)
-val mk_theory : context -> string -> theory
-
-(**
- \[ [set_delete_callback th cb] \] set callback when theory gets deleted.
-*)
-val set_delete_callback : theory -> (unit -> unit) -> unit
-
-(**
- \[ [set_reduce_app_callback th cb] \] set callback for simplifying theory terms.
-*)
-val set_reduce_app_callback : theory -> (func_decl -> ast array -> ast option) -> unit
-
-(**
- \[ [set_reduce_eq_callback th cb] \] set callback for simplifying equalities over theory terms.
-*)
-val set_reduce_eq_callback : theory -> (ast -> ast -> ast option) -> unit
-
-(**
- \[ [set_reduce_distinct_callback th cb] \] set callback for simplifying disequalities over theory terms.
-*)
-val set_reduce_distinct_callback : theory -> (ast array -> ast option) -> unit
-
-(**
- \[ [set_new_app_callback th cb] \] set callback for registering new application.
-*)
-val set_new_app_callback : theory -> (ast -> unit) -> unit
-
-(**
- \[ [set_new_elem_callback th cb] \] set callback for registering new element.
-
- - {b See also}: the help for the corresponding C API function.
-*)
-val set_new_elem_callback : theory -> (ast -> unit) -> unit
-
-(**
- \[ [set_init_search_callback th cb] \] set callback when Z3 starts searching for a satisfying assignment.
-*)
-val set_init_search_callback : theory -> (unit -> unit) -> unit
-
-(**
- \[ [set_push_callback th cb] \] set callback for a logical context push.
-*)
-val set_push_callback : theory -> (unit -> unit) -> unit
-
-(**
- \[ [set_pop_callback th cb] \] set callback for a logical context pop.
-*)
-val set_pop_callback : theory -> (unit -> unit) -> unit
-
-(**
- \[ [set_restart_callback th cb] \] set callback for search restart.
-*)
-val set_restart_callback : theory -> (unit -> unit) -> unit
-
-val set_reset_callback : theory -> (unit -> unit) -> unit
-
-val set_final_check_callback : theory -> (unit -> bool) -> unit
-
-val set_new_eq_callback : theory -> (ast -> ast -> unit) -> unit
-
-val set_new_diseq_callback : theory -> (ast -> ast -> unit) -> unit
-
-val set_new_assignment_callback : theory -> (ast -> bool -> unit) -> unit
-
-val set_new_relevant_callback : theory -> (ast -> unit) -> unit
-
-");
diff --git a/src/api/ml/z3.0.idl b/src/api/ml/z3.0.idl
deleted file mode 100644
index 3773a28e3..000000000
--- a/src/api/ml/z3.0.idl
+++ /dev/null
@@ -1,597 +0,0 @@
-/*++
-Copyright (c) Microsoft Corporation
-
-Module Name:
-
- Z3
-
-Abstract:
-
- OCaml API for Z3.
-
- The following design is used for the treatment of reference counting:
-
- - The conversion of Z3_context from ML to C remembers the Z3 context, and
- registers a finalizer using Gc.finalize that calls Z3_del_context.
-
- - The conversion of Z3_ast and other reference counted types from C to ML:
-
- + stores the last translated context with the Z3_ast in the wrapper
- object;
-
- + registers a finalizer using Gc.finalize that decrements the reference
- counter of the Z3_ast;
-
- + increments the reference count of the Z3_ast.
-
- The finalizers are registered using (the C interface to) Gc.finalize,
- not attaching a finalizer to a custom block. The finalizers registered
- by Gc.finalize are guaranteed to be called in reverse
- registration-order, which is necessary to ensure that Z3_context's are
- finalized only after all the Z3_ast's within them.
-
- - ML Z3.ast (and subtypes) are given generic hash and comparison
- operations using Z3_get_ast_hash and Z3_get_ast_id. Other types could
- be handled similarly if analogous hash and id operations were exported
- by the C API.
-
- - The wrapper for Z3_mk_context is customized (using quote(call,...) in
- z3_api.patched.h) to call Z3_mk_context_rc, and the ML API does not
- include mk_context_rc.
-
- This scheme relies on the property that all reference counted values
- returned from C to ML are in the Z3_context that was last sent from ML to
- C. This is normally straightforward, but note that it depends on the
- argument order of e.g. the Z3_*translate functions.
-
- Non-reference counted Z3 types that have delete operations have finalizers
- that call the delete operations. The exposed delete operations are
- shadowed by nop functions. The types whose delete operation accepts a
- context use Gc.finalize while those that do not use custom block
- finalizers.
-
- Custom c2ml functions check the Z3 error code prior to allocating ML
- values or registering finalizers. Other functions check the Z3 error code
- after making a Z3 library call.
-
- Some operations return NULL pointers when operations fail, or accept NULL
- pointers. To handle these cases Z3_{ast,func_interp,sort}_opt types are
- introduced. These are synonyms of Z3_{ast,func_interp,sort} but are
- translated into OCaml option types. If the NULL pointers were passed to
- ML, even if the user does not access them, they will have finalizers
- registered, so when they die the OCaml GC will crash trying to call
- dec_ref on NULL.
-
- There is an alternate implementation, enabled by setting LEAK_CONTEXTS,
- that avoids the overhead of Gc.finalize finalizers, but at the price of
- leaking Z3_context objects.
-
-Notes:
-
- OCaml does not support unsigned types, so CamlIDL conflates signed and
- unsigned types of the same size. Therefore, functions in the C API
- operating on unsigned values that become redundant after this conflation
- are excluded from the ML API using [#ifndef CAMLIDL] in z3_api.h.
-
- CamlIDL does not support function pointers, so functions in the C API with
- function pointer arguments are handled manually.
-
-Author:
-
- Jakob Lichtenberg (JakobL) 2007-08-08
- Josh Berdine (jjb) 2012-03-21
-
---*/
-
-
-// cpp trick to include expanded macro arguments in string literals
-#define xstr(s) str(s)
-#define str(s) #s
-quote(c,"#define xstr(s) str(s)");
-quote(c,"#define str(s) #s");
-
-
-#ifndef MLAPIV3
-
-#define DEFINE_TYPE(T) typedef [abstract] void* T
-#define DEFINE_VOID(T) typedef [abstract] void* T
-
-#define BEGIN_MLAPI_EXCLUDE quote(mli,"(*");
-#define END_MLAPI_EXCLUDE quote(mli,"*)");
-
-#ifdef LEAK_CONTEXTS
-
- // Declare pointer type with custom conversion functions.
- #define DEFINE_CUST_TYPE(T) \
- typedef [abstract, ml2c(ml2c_Z3_ ## T), c2ml(c2ml_Z3_ ## T)] void* Z3_ ## T
-
-#else
-
- // Declare pointer type with custom conversion functions.
- // Register an OCaml closure that just calls a C finalization function.
- #define DEFINE_CUST_TYPE(T) \
- quote(ml,xstr(\
- external finalize_Z3_ ## T : T -> unit = xstr(finalize_Z3_ ## T);; \
- let _ = Callback.register xstr(finalize_Z3_ ## T) finalize_Z3_ ## T \
- )); \
- typedef [abstract, ml2c(ml2c_Z3_ ## T), c2ml(c2ml_Z3_ ## T)] void* Z3_ ## T
-
-#endif
-
-
-// Z3_context
-quote(c,"
-void check_error_code (Z3_context c);
-
-Z3_context last_ctx;
-");
-
-#ifdef LEAK_CONTEXTS
-
- quote(c,"
- value c2ml_Z3_context(Z3_context* c)
- {
- value v;
- v = caml_alloc_small(1, Abstract_tag);
- *((Z3_context *) Bp_val(v)) = *c;
- return v;
- }
-
- void ml2c_Z3_context(value v, Z3_context* c)
- {
- *c = *((Z3_context *) Bp_val(v));
- last_ctx = *c;
- }
- ");
-
-#else
-
- quote(c,"
- // caml_final_register is the implementation of Gc.finalize
- value caml_final_register (value f, value v);
-
- void register_finalizer(value** closure, char* name, Z3_context ctx, value v)
- {
- if (*closure == NULL) {
- *closure = caml_named_value(name);
- if (*closure == NULL) {
- Z3_set_error(ctx, Z3_INTERNAL_FATAL);
- return;
- }
- }
- caml_final_register(**closure, v);
- }
-
- value c2ml_Z3_context (Z3_context* c)
- {
- static value* finalize_Z3_context_closure = NULL;
- value v;
- v = caml_alloc_small(1, Abstract_tag);
- Field(v, 0) = (value) *c;
- register_finalizer(&finalize_Z3_context_closure, \"finalize_Z3_context\",
- (Z3_context) *c, v);
- return v;
- }
-
- void ml2c_Z3_context (value v, Z3_context* c)
- {
- *c = (Z3_context) Field(v, 0);
- last_ctx = *c;
- }
-
- value finalize_Z3_context (value v)
- {
- Z3_context c;
- c = (Z3_context) Field(v, 0);
- Z3_del_context(c);
- return Val_unit;
- }
- ");
-
-#endif
-
-DEFINE_CUST_TYPE(context);
-
-
-// Z3_symbol
-typedef [abstract] void* Z3_symbol;
-
-
-// Z3_ast: reference counted type with hashing and comparison
-quote(c,"
-typedef struct _Z3_ast_context {
- Z3_ast ast;
- Z3_context ctx;
-} Z3_ast_context;
-
-void ml2c_Z3_ast (value v, Z3_ast* c)
-{
- *c = ((Z3_ast_context*) Data_custom_val(v))->ast;
-}
-
-static int compare_Z3_ast (value v1, value v2)
-{
- Z3_ast_context* ac1;
- Z3_ast_context* ac2;
- unsigned id1, id2;
- ac1 = Data_custom_val(v1);
- ac2 = Data_custom_val(v2);
- id1 = Z3_get_ast_id(ac1->ctx, ac1->ast);
- check_error_code(ac1->ctx);
- id2 = Z3_get_ast_id(ac2->ctx, ac2->ast);
- check_error_code(ac2->ctx);
- return id2 - id1;
-}
-
-static intnat hash_Z3_ast (value v)
-{
- Z3_ast_context* ac;
- unsigned hash;
- ac = Data_custom_val(v);
- hash = Z3_get_ast_hash(ac->ctx, ac->ast);
- check_error_code(ac->ctx);
- return hash;
-}
-");
-
-#ifdef LEAK_CONTEXTS
-
- quote(c,"
- static void finalize_Z3_ast (value v)
- {
- Z3_ast_context* ac;
- ac = Data_custom_val(v);
- Z3_dec_ref(ac->ctx, ac->ast);
- check_error_code(ac->ctx);
- }
-
- static struct custom_operations cops_Z3_ast = {
- NULL,
- finalize_Z3_ast,
- compare_Z3_ast,
- hash_Z3_ast,
- custom_serialize_default,
- custom_deserialize_default
- };
-
- value c2ml_Z3_ast (Z3_ast* c)
- {
- value v;
- Z3_ast_context* ac;
- check_error_code(last_ctx);
- v = alloc_custom(&cops_Z3_ast, sizeof(Z3_ast_context), 0, 1);
- ac = Data_custom_val(v);
- ac->ctx = last_ctx;
- ac->ast = *c;
- Z3_inc_ref(ac->ctx, ac->ast);
- return v;
- }
- ");
-
-#else
-
- quote(c,"
- value finalize_Z3_ast (value v)
- {
- Z3_ast_context* ac;
- ac = Data_custom_val(v);
- Z3_dec_ref(ac->ctx, ac->ast);
- check_error_code(ac->ctx);
- return Val_unit;
- }
-
- static struct custom_operations cops_Z3_ast = {
- NULL,
- custom_finalize_default,
- compare_Z3_ast,
- hash_Z3_ast,
- custom_serialize_default,
- custom_deserialize_default
- };
-
- value c2ml_Z3_ast (Z3_ast* c)
- {
- static value* finalize_Z3_ast_closure = NULL;
- value v;
- Z3_ast_context* ac;
- check_error_code(last_ctx);
- v = caml_alloc_custom(&cops_Z3_ast, sizeof(Z3_ast_context), 0, 1);
- ac = Data_custom_val(v);
- ac->ast = *c;
- ac->ctx = last_ctx;
- register_finalizer(&finalize_Z3_ast_closure, \"finalize_Z3_ast\",
- (Z3_context) *c, v);
- Z3_inc_ref(last_ctx, *c);
- return v;
- }
- ");
-
-#endif
-
-DEFINE_CUST_TYPE(ast);
-
-
-// subtypes of Z3_ast
-quote(c,"\
-#define DEFINE_SUBAST_OPS(T) \
- void ml2c_ ## T (value v, T * a) \
- { \
- ml2c_Z3_ast(v, (Z3_ast*) a); \
- } \
- \
- value c2ml_ ## T (T * a) \
- { \
- return c2ml_Z3_ast((Z3_ast*) a); \
- } \
-");
-
-#define DEFINE_SUBAST(T) \
- typedef [mltype("private ast"), ml2c(ml2c_ ## T), c2ml(c2ml_ ## T)] Z3_ast T
-
-quote(c,"DEFINE_SUBAST_OPS(Z3_sort)"); DEFINE_SUBAST(Z3_sort);
-quote(c,"DEFINE_SUBAST_OPS(Z3_func_decl)"); DEFINE_SUBAST(Z3_func_decl);
-quote(c,"DEFINE_SUBAST_OPS(Z3_app)"); DEFINE_SUBAST(Z3_app);
-quote(c,"DEFINE_SUBAST_OPS(Z3_pattern)"); DEFINE_SUBAST(Z3_pattern);
-
-
-// reference counted types without hashing and comparison
-#ifdef LEAK_CONTEXTS
-
- quote(c,"\
- #define DEFINE_RC_OPS(T) \
- typedef struct _ ## T ## _context { \
- T dat; \
- Z3_context ctx; \
- } T ## _context; \
- \
- static void finalize_ ## T (value v) \
- { \
- T ## _context* ac; \
- ac = Data_custom_val(v); \
- T ## _dec_ref(ac->ctx, ac->dat); \
- check_error_code(ac->ctx); \
- } \
- \
- static struct custom_operations cops_ ## T = { \
- NULL, \
- finalize_ ## T, \
- custom_compare_default, \
- custom_hash_default, \
- custom_serialize_default, \
- custom_deserialize_default \
- }; \
- \
- value c2ml_ ## T (T * c) \
- { \
- value v; \
- T ## _context* ac; \
- check_error_code(last_ctx); \
- v = alloc_custom(&cops_ ## T, sizeof(T ## _context), 0, 1); \
- ac = Data_custom_val(v); \
- ac->dat = *c; \
- ac->ctx = last_ctx; \
- T ## _inc_ref(ac->ctx, ac->dat); \
- return v; \
- } \
- \
- void ml2c_ ## T (value v, T * c) \
- { \
- *c = ((T ## _context*) Data_custom_val(v))->dat; \
- } \
- ");
-
-#else
-
- quote(c,"\
- #define DEFINE_RC_OPS(T) \
- value c2ml_ ## T (T * c) \
- { \
- static value* finalize_ ## T ## _closure = NULL; \
- value v; \
- check_error_code(last_ctx); \
- v = caml_alloc_small(2, Abstract_tag); \
- Field(v, 0) = (value) *c; \
- Field(v, 1) = (value) last_ctx; \
- register_finalizer(&finalize_ ## T ## _closure, xstr(finalize_ ## T), \
- (Z3_context) *c, v); \
- T ## _inc_ref(last_ctx, *c); \
- return v; \
- } \
- \
- void ml2c_ ## T (value v, T * c) \
- { \
- *c = (T) Field(v, 0); \
- } \
- \
- value finalize_ ## T (value v) \
- { \
- Z3_context c; \
- c = (Z3_context) Field(v, 1); \
- T ## _dec_ref(c, (T) Field(v, 0)); \
- check_error_code(c); \
- return Val_unit; \
- } \
- ");
-
-#endif
-
-quote(c,"DEFINE_RC_OPS(Z3_params)"); DEFINE_CUST_TYPE(params);
-quote(c,"DEFINE_RC_OPS(Z3_param_descrs)"); DEFINE_CUST_TYPE(param_descrs);
-quote(c,"DEFINE_RC_OPS(Z3_model)"); DEFINE_CUST_TYPE(model);
-quote(c,"DEFINE_RC_OPS(Z3_func_interp)"); DEFINE_CUST_TYPE(func_interp);
-quote(c,"DEFINE_RC_OPS(Z3_func_entry)"); DEFINE_CUST_TYPE(func_entry);
-quote(c,"DEFINE_RC_OPS(Z3_fixedpoint)"); DEFINE_CUST_TYPE(fixedpoint);
-quote(c,"DEFINE_RC_OPS(Z3_ast_vector)"); DEFINE_CUST_TYPE(ast_vector);
-quote(c,"DEFINE_RC_OPS(Z3_ast_map)"); DEFINE_CUST_TYPE(ast_map);
-quote(c,"DEFINE_RC_OPS(Z3_goal)"); DEFINE_CUST_TYPE(goal);
-quote(c,"DEFINE_RC_OPS(Z3_tactic)"); DEFINE_CUST_TYPE(tactic);
-quote(c,"DEFINE_RC_OPS(Z3_probe)"); DEFINE_CUST_TYPE(probe);
-quote(c,"DEFINE_RC_OPS(Z3_apply_result)"); DEFINE_CUST_TYPE(apply_result);
-quote(c,"DEFINE_RC_OPS(Z3_solver)"); DEFINE_CUST_TYPE(solver);
-quote(c,"DEFINE_RC_OPS(Z3_stats)"); DEFINE_CUST_TYPE(stats);
-
-
-// possibly-NULL pointer types, translated to OCaml option types
-quote(c,"\
-#define DEFINE_OPT_OPS(T) \
- void ml2c_ ## T ## _opt (value v, T* c) \
- { \
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL }; \
- camlidl_ctx _ctx = &_ctxs; \
- if (v != Val_int(0)) { \
- camlidl_ml2c_z3_ ## T(Field(v, 0), c, _ctx); \
- } else { \
- *c = NULL; \
- } \
- } \
- \
- value c2ml_ ## T ## _opt (T* c) \
- { \
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL }; \
- camlidl_ctx _ctx = &_ctxs; \
- value v; \
- value a; \
- if (*c) { \
- a = camlidl_c2ml_z3_ ## T(c, _ctx); \
- Begin_root(a) \
- v = caml_alloc_small(1, 0); \
- Field(v, 0) = a; \
- End_roots(); \
- } else { \
- v = Val_int(0); \
- } \
- return v; \
- }
-");
-
-#define DEFINE_OPT_TYPE(T) \
- typedef [mltype(xstr(T option)), \
- ml2c(ml2c_Z3_ ## T ## _opt), \
- c2ml(c2ml_Z3_ ## T ## _opt) \
- ] Z3_ ## T Z3_ ## T ## _opt
-
-quote(c,"DEFINE_OPT_OPS(Z3_ast)");
-DEFINE_OPT_TYPE(ast);
-
-quote(c,"DEFINE_OPT_OPS(Z3_sort)");
-DEFINE_OPT_TYPE(sort);
-
-quote(c,"DEFINE_OPT_OPS(Z3_func_interp)");
-DEFINE_OPT_TYPE(func_interp);
-
-
-// ToDo: these unnecessarily appear in the API documentation
-DEFINE_TYPE(Z3_constructor);
-DEFINE_TYPE(Z3_constructor_list);
-
-
-// shadow delete operations with nops
-quote(ml,"
-let del_constructor _ _ = ()
-let del_constructor_list _ _ = ()
-let del_model _ _ = ()
-let del_context _ = ()
-let reset_memory () = ()
-");
-
-
-#else // MLAPIV3
-
-// Provide custom error handler:
-quote (c,"Z3_error_handler caml_z3_error_handler;");
-quote (c,"void caml_z3_error_handler(Z3_context c, Z3_error_code e) { static char buffer[128]; char * msg = Z3_get_error_msg_ex(c, e); if (strlen(msg) > 100) { failwith(\"Z3: error message is too big to fit in buffer\"); } else { sprintf(buffer, \"Z3: %s\", msg); failwith(buffer); } }");
-
-
-#define DEFINE_TYPE(T) typedef [abstract] void* T
-#define DEFINE_VOID(T) typedef [abstract] void* T
-
-#define BEGIN_MLAPI_EXCLUDE
-#define END_MLAPI_EXCLUDE
-
-#endif // MLAPIV3
-
-
-
-#ifndef __in
-#define __in [in]
-#endif
-
-#ifndef __out
-#define __out [out]
-#endif
-
-#ifndef __out_opt
-#define __out_opt [out,unique]
-#endif
-
-#ifndef __ecount
-#define __ecount(num_args) [NOT_SUPPORTED]
-#endif
-
-#ifndef __in_ecount
-#define __in_ecount(num_args) [in, size_is(num_args), length_is(num_args)]
-#endif
-
-#ifndef __out_ecount
-#define __out_ecount(num_args) [out, size_is(num_args), length_is(num_args)]
-#endif
-
-#ifndef __inout_ecount
-#define __inout_ecount(num_args) [in, out, size_is(num_args), length_is(num_args)]
-#endif
-
-#ifndef __inout
-#define __inout [in, out]
-#endif
-
-#ifndef Z3_bool_opt
-#define Z3_bool_opt void
-#endif
-
-
-#define Z3_API
-
-#ifdef MLAPIV3
-
-#include "z3V3_api.idl"
-#include "x3V3.mli"
-#include "x3V3.ml"
-
-#else
-
-#include "z3_api.idl"
-#include "x3.ml"
-
-quote(ml,"
-let _ =
- Printexc.register_printer (function
- | Error(c,e) -> Some (\"Z3 \"^(get_error_msg c e))
- | _ -> None
- )
-");
-
-
-quote(mli,"
-(**
- {2 {L Legacy V3 API}}
-*)
-
-module V3 : sig
-(**
- {2 {L Legacy V3 API}}
-*)
-");
-
-quote(ml,"
-module V3 = struct
-");
-
-#endif
-
-#ifdef MLAPIV3
-
-quote(mlmli,"
-end
-");
-
-#endif
diff --git a/src/api/ml/z3.ml b/src/api/ml/z3.ml
index 705f9a3e7..fe78b65a6 100644
--- a/src/api/ml/z3.ml
+++ b/src/api/ml/z3.ml
@@ -1,3385 +1,2947 @@
-(* File generated from z3.idl *)
-
-type context
-and symbol
-and ast
-and sort = private ast
-and func_decl = private ast
-and app = private ast
-and pattern = private ast
-and params
-and param_descrs
-and model
-and func_interp
-and func_entry
-and fixedpoint
-and ast_vector
-and ast_map
-and goal
-and tactic
-and probe
-and apply_result
-and solver
-and stats
-
-
-
-and constructor
-and constructor_list
-
-and lbool =
- | L_FALSE
- | L_UNDEF
- | L_TRUE
-
-and symbol_kind =
- | INT_SYMBOL
- | STRING_SYMBOL
-
-and parameter_kind =
- | PARAMETER_INT
- | PARAMETER_DOUBLE
- | PARAMETER_RATIONAL
- | PARAMETER_SYMBOL
- | PARAMETER_SORT
- | PARAMETER_AST
- | PARAMETER_FUNC_DECL
-
-and sort_kind =
- | UNINTERPRETED_SORT
- | BOOL_SORT
- | INT_SORT
- | REAL_SORT
- | BV_SORT
- | ARRAY_SORT
- | DATATYPE_SORT
- | RELATION_SORT
- | FINITE_DOMAIN_SORT
- | UNKNOWN_SORT
-
-and ast_kind =
- | NUMERAL_AST
- | APP_AST
- | VAR_AST
- | QUANTIFIER_AST
- | SORT_AST
- | FUNC_DECL_AST
- | UNKNOWN_AST
-
-and decl_kind =
- | OP_TRUE
- | OP_FALSE
- | OP_EQ
- | OP_DISTINCT
- | OP_ITE
- | OP_AND
- | OP_OR
- | OP_IFF
- | OP_XOR
- | OP_NOT
- | OP_IMPLIES
- | OP_OEQ
- | OP_ANUM
- | OP_AGNUM
- | OP_LE
- | OP_GE
- | OP_LT
- | OP_GT
- | OP_ADD
- | OP_SUB
- | OP_UMINUS
- | OP_MUL
- | OP_DIV
- | OP_IDIV
- | OP_REM
- | OP_MOD
- | OP_TO_REAL
- | OP_TO_INT
- | OP_IS_INT
- | OP_POWER
- | OP_STORE
- | OP_SELECT
- | OP_CONST_ARRAY
- | OP_ARRAY_MAP
- | OP_ARRAY_DEFAULT
- | OP_SET_UNION
- | OP_SET_INTERSECT
- | OP_SET_DIFFERENCE
- | OP_SET_COMPLEMENT
- | OP_SET_SUBSET
- | OP_AS_ARRAY
- | OP_BNUM
- | OP_BIT1
- | OP_BIT0
- | OP_BNEG
- | OP_BADD
- | OP_BSUB
- | OP_BMUL
- | OP_BSDIV
- | OP_BUDIV
- | OP_BSREM
- | OP_BUREM
- | OP_BSMOD
- | OP_BSDIV0
- | OP_BUDIV0
- | OP_BSREM0
- | OP_BUREM0
- | OP_BSMOD0
- | OP_ULEQ
- | OP_SLEQ
- | OP_UGEQ
- | OP_SGEQ
- | OP_ULT
- | OP_SLT
- | OP_UGT
- | OP_SGT
- | OP_BAND
- | OP_BOR
- | OP_BNOT
- | OP_BXOR
- | OP_BNAND
- | OP_BNOR
- | OP_BXNOR
- | OP_CONCAT
- | OP_SIGN_EXT
- | OP_ZERO_EXT
- | OP_EXTRACT
- | OP_REPEAT
- | OP_BREDOR
- | OP_BREDAND
- | OP_BCOMP
- | OP_BSHL
- | OP_BLSHR
- | OP_BASHR
- | OP_ROTATE_LEFT
- | OP_ROTATE_RIGHT
- | OP_EXT_ROTATE_LEFT
- | OP_EXT_ROTATE_RIGHT
- | OP_INT2BV
- | OP_BV2INT
- | OP_CARRY
- | OP_XOR3
- | OP_PR_UNDEF
- | OP_PR_TRUE
- | OP_PR_ASSERTED
- | OP_PR_GOAL
- | OP_PR_MODUS_PONENS
- | OP_PR_REFLEXIVITY
- | OP_PR_SYMMETRY
- | OP_PR_TRANSITIVITY
- | OP_PR_TRANSITIVITY_STAR
- | OP_PR_MONOTONICITY
- | OP_PR_QUANT_INTRO
- | OP_PR_DISTRIBUTIVITY
- | OP_PR_AND_ELIM
- | OP_PR_NOT_OR_ELIM
- | OP_PR_REWRITE
- | OP_PR_REWRITE_STAR
- | OP_PR_PULL_QUANT
- | OP_PR_PULL_QUANT_STAR
- | OP_PR_PUSH_QUANT
- | OP_PR_ELIM_UNUSED_VARS
- | OP_PR_DER
- | OP_PR_QUANT_INST
- | OP_PR_HYPOTHESIS
- | OP_PR_LEMMA
- | OP_PR_UNIT_RESOLUTION
- | OP_PR_IFF_TRUE
- | OP_PR_IFF_FALSE
- | OP_PR_COMMUTATIVITY
- | OP_PR_DEF_AXIOM
- | OP_PR_DEF_INTRO
- | OP_PR_APPLY_DEF
- | OP_PR_IFF_OEQ
- | OP_PR_NNF_POS
- | OP_PR_NNF_NEG
- | OP_PR_NNF_STAR
- | OP_PR_CNF_STAR
- | OP_PR_SKOLEMIZE
- | OP_PR_MODUS_PONENS_OEQ
- | OP_PR_TH_LEMMA
- | OP_PR_HYPER_RESOLVE
- | OP_RA_STORE
- | OP_RA_EMPTY
- | OP_RA_IS_EMPTY
- | OP_RA_JOIN
- | OP_RA_UNION
- | OP_RA_WIDEN
- | OP_RA_PROJECT
- | OP_RA_FILTER
- | OP_RA_NEGATION_FILTER
- | OP_RA_RENAME
- | OP_RA_COMPLEMENT
- | OP_RA_SELECT
- | OP_RA_CLONE
- | OP_FD_LT
- | OP_LABEL
- | OP_LABEL_LIT
- | OP_DT_CONSTRUCTOR
- | OP_DT_RECOGNISER
- | OP_DT_ACCESSOR
- | OP_UNINTERPRETED
-
-and param_kind =
- | PK_UINT
- | PK_BOOL
- | PK_DOUBLE
- | PK_SYMBOL
- | PK_STRING
- | PK_OTHER
- | PK_INVALID
-
-and ast_print_mode =
- | PRINT_SMTLIB_FULL
- | PRINT_LOW_LEVEL
- | PRINT_SMTLIB_COMPLIANT
- | PRINT_SMTLIB2_COMPLIANT
-
-and error_code =
- | OK
- | SORT_ERROR
- | IOB
- | INVALID_ARG
- | PARSER_ERROR
- | NO_PARSER
- | INVALID_PATTERN
- | MEMOUT_FAIL
- | FILE_ACCESS_ERROR
- | INTERNAL_FATAL
- | INVALID_USAGE
- | DEC_REF_ERROR
- | EXCEPTION
-
-and goal_prec =
- | GOAL_PRECISE
- | GOAL_UNDER
- | GOAL_OVER
- | GOAL_UNDER_OVER
-
-
-external finalize_Z3_context : context -> unit = "finalize_Z3_context";; let _ = Callback.register "finalize_Z3_context" finalize_Z3_context
-external finalize_Z3_ast : ast -> unit = "finalize_Z3_ast";; let _ = Callback.register "finalize_Z3_ast" finalize_Z3_ast
-external finalize_Z3_params : params -> unit = "finalize_Z3_params";; let _ = Callback.register "finalize_Z3_params" finalize_Z3_params
-external finalize_Z3_param_descrs : param_descrs -> unit = "finalize_Z3_param_descrs";; let _ = Callback.register "finalize_Z3_param_descrs" finalize_Z3_param_descrs
-external finalize_Z3_model : model -> unit = "finalize_Z3_model";; let _ = Callback.register "finalize_Z3_model" finalize_Z3_model
-external finalize_Z3_func_interp : func_interp -> unit = "finalize_Z3_func_interp";; let _ = Callback.register "finalize_Z3_func_interp" finalize_Z3_func_interp
-external finalize_Z3_func_entry : func_entry -> unit = "finalize_Z3_func_entry";; let _ = Callback.register "finalize_Z3_func_entry" finalize_Z3_func_entry
-external finalize_Z3_fixedpoint : fixedpoint -> unit = "finalize_Z3_fixedpoint";; let _ = Callback.register "finalize_Z3_fixedpoint" finalize_Z3_fixedpoint
-external finalize_Z3_ast_vector : ast_vector -> unit = "finalize_Z3_ast_vector";; let _ = Callback.register "finalize_Z3_ast_vector" finalize_Z3_ast_vector
-external finalize_Z3_ast_map : ast_map -> unit = "finalize_Z3_ast_map";; let _ = Callback.register "finalize_Z3_ast_map" finalize_Z3_ast_map
-external finalize_Z3_goal : goal -> unit = "finalize_Z3_goal";; let _ = Callback.register "finalize_Z3_goal" finalize_Z3_goal
-external finalize_Z3_tactic : tactic -> unit = "finalize_Z3_tactic";; let _ = Callback.register "finalize_Z3_tactic" finalize_Z3_tactic
-external finalize_Z3_probe : probe -> unit = "finalize_Z3_probe";; let _ = Callback.register "finalize_Z3_probe" finalize_Z3_probe
-external finalize_Z3_apply_result : apply_result -> unit = "finalize_Z3_apply_result";; let _ = Callback.register "finalize_Z3_apply_result" finalize_Z3_apply_result
-external finalize_Z3_solver : solver -> unit = "finalize_Z3_solver";; let _ = Callback.register "finalize_Z3_solver" finalize_Z3_solver
-external finalize_Z3_stats : stats -> unit = "finalize_Z3_stats";; let _ = Callback.register "finalize_Z3_stats" finalize_Z3_stats
-
-let del_constructor _ _ = ()
-let del_constructor_list _ _ = ()
-let del_model _ _ = ()
-let del_context _ = ()
-let reset_memory () = ()
-
-
-(** Exceptions raised by Z3. It is safe to continue interacting with Z3 after
- catching [Error] exceptions.
- - {b See also}: {!get_error_msg}
-*)
-exception Error of context * error_code
-
-
-(* Register dynamically-generated exception tag for use from C *)
-let _ = Callback.register_exception "Z3.Error" (Error (Obj.magic None, OK))
-
-external mk_context: (string * string) list -> context = "caml_z3_mk_context"
-
-external update_param_value : context -> string -> string -> unit
- = "camlidl_z3_Z3_update_param_value"
-
-external get_param_value : context -> string -> string option
- = "camlidl_z3_Z3_get_param_value"
-
-external interrupt : context -> unit
- = "camlidl_z3_Z3_interrupt"
-
-external mk_params : context -> params
- = "camlidl_z3_Z3_mk_params"
-
-external params_set_bool : context -> params -> symbol -> bool -> unit
- = "camlidl_z3_Z3_params_set_bool"
-
-external params_set_uint : context -> params -> symbol -> int -> unit
- = "camlidl_z3_Z3_params_set_uint"
-
-external params_set_double : context -> params -> symbol -> float -> unit
- = "camlidl_z3_Z3_params_set_double"
-
-external params_set_symbol : context -> params -> symbol -> symbol -> unit
- = "camlidl_z3_Z3_params_set_symbol"
-
-external params_to_string : context -> params -> string
- = "camlidl_z3_Z3_params_to_string"
-
-external params_validate : context -> params -> param_descrs -> unit
- = "camlidl_z3_Z3_params_validate"
-
-external param_descrs_get_kind : context -> param_descrs -> symbol -> param_kind
- = "camlidl_z3_Z3_param_descrs_get_kind"
-
-external param_descrs_size : context -> param_descrs -> int
- = "camlidl_z3_Z3_param_descrs_size"
-
-external param_descrs_get_name : context -> param_descrs -> int -> symbol
- = "camlidl_z3_Z3_param_descrs_get_name"
-
-external param_descrs_to_string : context -> param_descrs -> string
- = "camlidl_z3_Z3_param_descrs_to_string"
-
-
(**
- Refined view of a {!symbol}.
- - {b See also}: {!mk_symbol}
- - {b See also}: {!symbol_refine}
+ The Z3 ML/OCaml Interface.
+
+ Copyright (C) 2012 Microsoft Corporation
+ @author CM Wintersteiger (cwinter) 2012-12-17
*)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
-external mk_int_symbol : context -> int -> symbol
- = "camlidl_z3_Z3_mk_int_symbol"
-
-external mk_string_symbol : context -> string -> symbol
- = "camlidl_z3_Z3_mk_string_symbol"
-
-
-(**
- A datatype constructor descriptor.
-*)
-type datatype_constructor_desc = {
- constructor_desc : symbol; (** name of the constructor function *)
- recognizer_desc : symbol; (** name of the recognizer function *)
- accessor_descs : (symbol * sort) array; (** names and sorts of the fields *)
-}
-(**
- A datatype is described by a name and constructor descriptors.
-*)
-type datatype_desc = symbol * datatype_constructor_desc array
-(**
- A datatype constructor representation.
-*)
-type datatype_constructor = {
- constructor : func_decl; (** constructor function *)
- recognizer : func_decl; (** recognizer function *)
- accessors : func_decl array; (** field accessor functions *)
-}
-(**
- A datatype is represented by a sort and constructors.
-*)
-type datatype = sort * datatype_constructor array
-(**
- Refined view of a {!sort}.
- - {b See also}: {!mk_sort}
- - {b See also}: {!sort_refine}
-*)
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_bv of int
- | Sort_finite_domain of symbol * int64
- | Sort_real
- | Sort_array of sort * sort
- | Sort_datatype of datatype_constructor array
- | Sort_relation of sort array
- | Sort_unknown
-
-external mk_uninterpreted_sort : context -> symbol -> sort
- = "camlidl_z3_Z3_mk_uninterpreted_sort"
-
-external mk_bool_sort : context -> sort
- = "camlidl_z3_Z3_mk_bool_sort"
-
-external mk_int_sort : context -> sort
- = "camlidl_z3_Z3_mk_int_sort"
-
-external mk_real_sort : context -> sort
- = "camlidl_z3_Z3_mk_real_sort"
-
-external mk_bv_sort : context -> int -> sort
- = "camlidl_z3_Z3_mk_bv_sort"
-
-external mk_finite_domain_sort : context -> symbol -> int64 -> sort
- = "camlidl_z3_Z3_mk_finite_domain_sort"
-
-external mk_array_sort : context -> sort -> sort -> sort
- = "camlidl_z3_Z3_mk_array_sort"
-
-external mk_tuple_sort : context -> symbol -> symbol array -> sort array -> sort * func_decl * func_decl array
- = "camlidl_z3_Z3_mk_tuple_sort"
-
-external mk_enumeration_sort : context -> symbol -> symbol array -> sort * func_decl array * func_decl array
- = "camlidl_z3_Z3_mk_enumeration_sort"
-
-external mk_list_sort : context -> symbol -> sort -> sort * func_decl * func_decl * func_decl * func_decl * func_decl * func_decl
- = "camlidl_z3_Z3_mk_list_sort"
-
-external mk_constructor : context -> symbol -> symbol -> symbol array -> sort option array -> int array -> constructor
- = "camlidl_z3_Z3_mk_constructor_bytecode" "camlidl_z3_Z3_mk_constructor"
-
-external del_constructor : context -> constructor -> unit
- = "camlidl_z3_Z3_del_constructor"
-
-external mk_datatype : context -> symbol -> constructor array -> sort * constructor array
- = "camlidl_z3_Z3_mk_datatype"
-
-external mk_constructor_list : context -> constructor array -> constructor_list
- = "camlidl_z3_Z3_mk_constructor_list"
-
-external del_constructor_list : context -> constructor_list -> unit
- = "camlidl_z3_Z3_del_constructor_list"
-
-external mk_datatypes : context -> symbol array -> constructor_list array -> sort array * constructor_list array
- = "camlidl_z3_Z3_mk_datatypes"
-
-external query_constructor : context -> constructor -> int -> func_decl * func_decl * func_decl array
- = "camlidl_z3_Z3_query_constructor"
-
-external mk_func_decl : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3_Z3_mk_func_decl"
-
-external mk_app : context -> func_decl -> ast array -> ast
- = "camlidl_z3_Z3_mk_app"
-
-external mk_const : context -> symbol -> sort -> ast
- = "camlidl_z3_Z3_mk_const"
-
-external mk_fresh_func_decl : context -> string -> sort array -> sort -> func_decl
- = "camlidl_z3_Z3_mk_fresh_func_decl"
-
-external mk_fresh_const : context -> string -> sort -> ast
- = "camlidl_z3_Z3_mk_fresh_const"
-
-external mk_true : context -> ast
- = "camlidl_z3_Z3_mk_true"
-
-external mk_false : context -> ast
- = "camlidl_z3_Z3_mk_false"
-
-external mk_eq : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_eq"
-
-external mk_distinct : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_distinct"
-
-external mk_not : context -> ast -> ast
- = "camlidl_z3_Z3_mk_not"
-
-external mk_ite : context -> ast -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ite"
-
-external mk_iff : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_iff"
-
-external mk_implies : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_implies"
-
-external mk_xor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_xor"
-
-external mk_and : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_and"
-
-external mk_or : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_or"
-
-external mk_add : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_add"
-
-external mk_mul : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_mul"
-
-external mk_sub : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_sub"
-
-external mk_unary_minus : context -> ast -> ast
- = "camlidl_z3_Z3_mk_unary_minus"
-
-external mk_div : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_div"
-
-external mk_mod : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_mod"
-
-external mk_rem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_rem"
-
-external mk_power : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_power"
-
-external mk_lt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_lt"
-
-external mk_le : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_le"
-
-external mk_gt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_gt"
-
-external mk_ge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ge"
-
-external mk_int2real : context -> ast -> ast
- = "camlidl_z3_Z3_mk_int2real"
-
-external mk_real2int : context -> ast -> ast
- = "camlidl_z3_Z3_mk_real2int"
-
-external mk_is_int : context -> ast -> ast
- = "camlidl_z3_Z3_mk_is_int"
-
-external mk_bvnot : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnot"
-
-external mk_bvredand : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvredand"
-
-external mk_bvredor : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvredor"
-
-external mk_bvand : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvand"
-
-external mk_bvor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvor"
-
-external mk_bvxor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvxor"
-
-external mk_bvnand : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnand"
-
-external mk_bvnor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnor"
-
-external mk_bvxnor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvxnor"
-
-external mk_bvneg : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvneg"
-
-external mk_bvadd : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvadd"
-
-external mk_bvsub : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsub"
-
-external mk_bvmul : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvmul"
-
-external mk_bvudiv : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvudiv"
-
-external mk_bvsdiv : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsdiv"
-
-external mk_bvurem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvurem"
-
-external mk_bvsrem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsrem"
-
-external mk_bvsmod : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsmod"
-
-external mk_bvult : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvult"
-
-external mk_bvslt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvslt"
-
-external mk_bvule : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvule"
-
-external mk_bvsle : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsle"
-
-external mk_bvuge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvuge"
-
-external mk_bvsge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsge"
-
-external mk_bvugt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvugt"
-
-external mk_bvsgt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsgt"
-
-external mk_concat : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_concat"
-
-external mk_extract : context -> int -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_extract"
-
-external mk_sign_ext : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_sign_ext"
-
-external mk_zero_ext : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_zero_ext"
-
-external mk_repeat : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_repeat"
-
-external mk_bvshl : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvshl"
-
-external mk_bvlshr : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvlshr"
-
-external mk_bvashr : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvashr"
-
-external mk_rotate_left : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_rotate_left"
-
-external mk_rotate_right : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_rotate_right"
-
-external mk_ext_rotate_left : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ext_rotate_left"
-
-external mk_ext_rotate_right : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ext_rotate_right"
-
-external mk_int2bv : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_int2bv"
-
-external mk_bv2int : context -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bv2int"
-
-external mk_bvadd_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvadd_no_overflow"
-
-external mk_bvadd_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvadd_no_underflow"
-
-external mk_bvsub_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsub_no_overflow"
-
-external mk_bvsub_no_underflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvsub_no_underflow"
-
-external mk_bvsdiv_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsdiv_no_overflow"
-
-external mk_bvneg_no_overflow : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvneg_no_overflow"
-
-external mk_bvmul_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvmul_no_overflow"
-
-external mk_bvmul_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvmul_no_underflow"
-
-external mk_select : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_select"
-
-external mk_store : context -> ast -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_store"
-
-external mk_const_array : context -> sort -> ast -> ast
- = "camlidl_z3_Z3_mk_const_array"
-
-external mk_map : context -> func_decl -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_map"
-
-external mk_array_default : context -> ast -> ast
- = "camlidl_z3_Z3_mk_array_default"
-
-external mk_set_sort : context -> sort -> sort
- = "camlidl_z3_Z3_mk_set_sort"
-
-external mk_empty_set : context -> sort -> ast
- = "camlidl_z3_Z3_mk_empty_set"
-
-external mk_full_set : context -> sort -> ast
- = "camlidl_z3_Z3_mk_full_set"
-
-external mk_set_add : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_add"
-
-external mk_set_del : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_del"
-
-external mk_set_union : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_set_union"
-
-external mk_set_intersect : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_set_intersect"
-
-external mk_set_difference : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_difference"
-
-external mk_set_complement : context -> ast -> ast
- = "camlidl_z3_Z3_mk_set_complement"
-
-external mk_set_member : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_member"
-
-external mk_set_subset : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_subset"
-
-
-(**
- Summary: \[ [ numeral_refined ] \] is the refined view of a numeral .
-*)
-type numeral_refined =
- | Numeral_int of int * sort
- | Numeral_int64 of int64 * sort
- | Numeral_large of string * sort
- | Numeral_rational of numeral_refined * numeral_refined
-
-external mk_numeral : context -> string -> sort -> ast
- = "camlidl_z3_Z3_mk_numeral"
-
-external mk_real : context -> int -> int -> ast
- = "camlidl_z3_Z3_mk_real"
-
-external mk_int : context -> int -> sort -> ast
- = "camlidl_z3_Z3_mk_int"
-
-external mk_int64 : context -> int64 -> sort -> ast
- = "camlidl_z3_Z3_mk_int64"
-
-external mk_pattern : context -> ast array -> pattern
- = "camlidl_z3_Z3_mk_pattern"
-
-external mk_bound : context -> int -> sort -> ast
- = "camlidl_z3_Z3_mk_bound"
-
-external mk_forall : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_forall_bytecode" "camlidl_z3_Z3_mk_forall"
-
-external mk_exists : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_exists_bytecode" "camlidl_z3_Z3_mk_exists"
-
-external mk_quantifier : context -> bool -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_bytecode" "camlidl_z3_Z3_mk_quantifier"
-
-external mk_quantifier_ex : context -> bool -> int -> symbol -> symbol -> pattern array -> ast array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_ex_bytecode" "camlidl_z3_Z3_mk_quantifier_ex"
-
-external mk_forall_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_forall_const"
-
-external mk_exists_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_exists_const"
-
-external mk_quantifier_const : context -> bool -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_const_bytecode" "camlidl_z3_Z3_mk_quantifier_const"
-
-external mk_quantifier_const_ex : context -> bool -> int -> symbol -> symbol -> app array -> pattern array -> ast array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_const_ex_bytecode" "camlidl_z3_Z3_mk_quantifier_const_ex"
-
-external get_symbol_kind : context -> symbol -> symbol_kind
- = "camlidl_z3_Z3_get_symbol_kind"
-
-external get_symbol_int : context -> symbol -> int
- = "camlidl_z3_Z3_get_symbol_int"
-
-external get_symbol_string : context -> symbol -> string
- = "camlidl_z3_Z3_get_symbol_string"
-
-external get_sort_name : context -> sort -> symbol
- = "camlidl_z3_Z3_get_sort_name"
-
-external get_sort_id : context -> sort -> int
- = "camlidl_z3_Z3_get_sort_id"
-
-external sort_to_ast : context -> sort -> ast
- = "camlidl_z3_Z3_sort_to_ast"
-
-external is_eq_sort : context -> sort -> sort -> bool
- = "camlidl_z3_Z3_is_eq_sort"
-
-external get_sort_kind : context -> sort -> sort_kind
- = "camlidl_z3_Z3_get_sort_kind"
-
-external get_bv_sort_size : context -> sort -> int
- = "camlidl_z3_Z3_get_bv_sort_size"
-
-external get_finite_domain_sort_size : context -> sort -> int64 option
- = "camlidl_z3_Z3_get_finite_domain_sort_size"
-
-external get_array_sort_domain : context -> sort -> sort
- = "camlidl_z3_Z3_get_array_sort_domain"
-
-external get_array_sort_range : context -> sort -> sort
- = "camlidl_z3_Z3_get_array_sort_range"
-
-external get_tuple_sort_mk_decl : context -> sort -> func_decl
- = "camlidl_z3_Z3_get_tuple_sort_mk_decl"
-
-external get_tuple_sort_num_fields : context -> sort -> int
- = "camlidl_z3_Z3_get_tuple_sort_num_fields"
-
-external get_tuple_sort_field_decl : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_tuple_sort_field_decl"
-
-external get_datatype_sort_num_constructors : context -> sort -> int
- = "camlidl_z3_Z3_get_datatype_sort_num_constructors"
-
-external get_datatype_sort_constructor : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_constructor"
-
-external get_datatype_sort_recognizer : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_recognizer"
-
-external get_datatype_sort_constructor_accessor : context -> sort -> int -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_constructor_accessor"
-
-external get_relation_arity : context -> sort -> int
- = "camlidl_z3_Z3_get_relation_arity"
-
-external get_relation_column : context -> sort -> int -> sort
- = "camlidl_z3_Z3_get_relation_column"
-
-external func_decl_to_ast : context -> func_decl -> ast
- = "camlidl_z3_Z3_func_decl_to_ast"
-
-external is_eq_func_decl : context -> func_decl -> func_decl -> bool
- = "camlidl_z3_Z3_is_eq_func_decl"
-
-external get_func_decl_id : context -> func_decl -> int
- = "camlidl_z3_Z3_get_func_decl_id"
-
-external get_decl_name : context -> func_decl -> symbol
- = "camlidl_z3_Z3_get_decl_name"
-
-external get_decl_kind : context -> func_decl -> decl_kind
- = "camlidl_z3_Z3_get_decl_kind"
-
-external get_domain_size : context -> func_decl -> int
- = "camlidl_z3_Z3_get_domain_size"
-
-external get_arity : context -> func_decl -> int
- = "camlidl_z3_Z3_get_arity"
-
-external get_domain : context -> func_decl -> int -> sort
- = "camlidl_z3_Z3_get_domain"
-
-external get_range : context -> func_decl -> sort
- = "camlidl_z3_Z3_get_range"
-
-external get_decl_num_parameters : context -> func_decl -> int
- = "camlidl_z3_Z3_get_decl_num_parameters"
-
-external get_decl_parameter_kind : context -> func_decl -> int -> parameter_kind
- = "camlidl_z3_Z3_get_decl_parameter_kind"
-
-external get_decl_int_parameter : context -> func_decl -> int -> int
- = "camlidl_z3_Z3_get_decl_int_parameter"
-
-external get_decl_double_parameter : context -> func_decl -> int -> float
- = "camlidl_z3_Z3_get_decl_double_parameter"
-
-external get_decl_symbol_parameter : context -> func_decl -> int -> symbol
- = "camlidl_z3_Z3_get_decl_symbol_parameter"
-
-external get_decl_sort_parameter : context -> func_decl -> int -> sort
- = "camlidl_z3_Z3_get_decl_sort_parameter"
-
-external get_decl_ast_parameter : context -> func_decl -> int -> ast
- = "camlidl_z3_Z3_get_decl_ast_parameter"
-
-external get_decl_func_decl_parameter : context -> func_decl -> int -> func_decl
- = "camlidl_z3_Z3_get_decl_func_decl_parameter"
-
-external get_decl_rational_parameter : context -> func_decl -> int -> string
- = "camlidl_z3_Z3_get_decl_rational_parameter"
-
-external app_to_ast : context -> app -> ast
- = "camlidl_z3_Z3_app_to_ast"
-
-external get_app_decl : context -> app -> func_decl
- = "camlidl_z3_Z3_get_app_decl"
-
-external get_app_num_args : context -> app -> int
- = "camlidl_z3_Z3_get_app_num_args"
-
-external get_app_arg : context -> app -> int -> ast
- = "camlidl_z3_Z3_get_app_arg"
-
-
-(**
- Summary: \[ [ binder_type ] \] is a universal or existential quantifier.
- - {b See also}: {!term_refined}
-*)
-type binder_type = Forall | Exists
-(**
- Summary: \[ [ term_refined ] \] is the refinement of a {!ast} .
- - {b See also}: {!term_refine}
-*)
-type term_refined =
- | Term_numeral of numeral_refined
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol * sort) array * ast
- | Term_var of int * sort
-
-external is_eq_ast : context -> ast -> ast -> bool
- = "camlidl_z3_Z3_is_eq_ast"
-
-external get_ast_id : context -> ast -> int
- = "camlidl_z3_Z3_get_ast_id"
-
-external get_ast_hash : context -> ast -> int
- = "camlidl_z3_Z3_get_ast_hash"
-
-external get_sort : context -> ast -> sort
- = "camlidl_z3_Z3_get_sort"
-
-external is_well_sorted : context -> ast -> bool
- = "camlidl_z3_Z3_is_well_sorted"
-
-external get_bool_value : context -> ast -> lbool
- = "camlidl_z3_Z3_get_bool_value"
-
-external get_ast_kind : context -> ast -> ast_kind
- = "camlidl_z3_Z3_get_ast_kind"
-
-external is_app : context -> ast -> bool
- = "camlidl_z3_Z3_is_app"
-
-external is_numeral_ast : context -> ast -> bool
- = "camlidl_z3_Z3_is_numeral_ast"
-
-external is_algebraic_number : context -> ast -> bool
- = "camlidl_z3_Z3_is_algebraic_number"
-
-external to_app : context -> ast -> app
- = "camlidl_z3_Z3_to_app"
-
-external to_func_decl : context -> ast -> func_decl
- = "camlidl_z3_Z3_to_func_decl"
-
-external get_numeral_string : context -> ast -> string
- = "camlidl_z3_Z3_get_numeral_string"
-
-external get_numeral_decimal_string : context -> ast -> int -> string
- = "camlidl_z3_Z3_get_numeral_decimal_string"
-
-external get_numerator : context -> ast -> ast
- = "camlidl_z3_Z3_get_numerator"
-
-external get_denominator : context -> ast -> ast
- = "camlidl_z3_Z3_get_denominator"
-
-external get_numeral_small : context -> ast -> bool * int64 * int64
- = "camlidl_z3_Z3_get_numeral_small"
-
-external get_numeral_int : context -> ast -> bool * int
- = "camlidl_z3_Z3_get_numeral_int"
-
-external get_numeral_int64 : context -> ast -> bool * int64
- = "camlidl_z3_Z3_get_numeral_int64"
-
-external get_numeral_rational_int64 : context -> ast -> bool * int64 * int64
- = "camlidl_z3_Z3_get_numeral_rational_int64"
-
-external get_algebraic_number_lower : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_algebraic_number_lower"
-
-external get_algebraic_number_upper : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_algebraic_number_upper"
-
-external pattern_to_ast : context -> pattern -> ast
- = "camlidl_z3_Z3_pattern_to_ast"
-
-external get_pattern_num_terms : context -> pattern -> int
- = "camlidl_z3_Z3_get_pattern_num_terms"
-
-external get_pattern : context -> pattern -> int -> ast
- = "camlidl_z3_Z3_get_pattern"
-
-external get_index_value : context -> ast -> int
- = "camlidl_z3_Z3_get_index_value"
-
-external is_quantifier_forall : context -> ast -> bool
- = "camlidl_z3_Z3_is_quantifier_forall"
-
-external get_quantifier_weight : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_weight"
-
-external get_quantifier_num_patterns : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_patterns"
-
-external get_quantifier_pattern_ast : context -> ast -> int -> pattern
- = "camlidl_z3_Z3_get_quantifier_pattern_ast"
-
-external get_quantifier_num_no_patterns : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_no_patterns"
-
-external get_quantifier_no_pattern_ast : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_quantifier_no_pattern_ast"
-
-external get_quantifier_num_bound : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_bound"
-
-external get_quantifier_bound_name : context -> ast -> int -> symbol
- = "camlidl_z3_Z3_get_quantifier_bound_name"
-
-external get_quantifier_bound_sort : context -> ast -> int -> sort
- = "camlidl_z3_Z3_get_quantifier_bound_sort"
-
-external get_quantifier_body : context -> ast -> ast
- = "camlidl_z3_Z3_get_quantifier_body"
-
-external simplify : context -> ast -> ast
- = "camlidl_z3_Z3_simplify"
-
-external simplify_ex : context -> ast -> params -> ast
- = "camlidl_z3_Z3_simplify_ex"
-
-external simplify_get_help : context -> string
- = "camlidl_z3_Z3_simplify_get_help"
-
-external simplify_get_param_descrs : context -> param_descrs
- = "camlidl_z3_Z3_simplify_get_param_descrs"
-
-external update_term : context -> ast -> ast array -> ast
- = "camlidl_z3_Z3_update_term"
-
-external substitute : context -> ast -> ast array -> ast array -> ast
- = "camlidl_z3_Z3_substitute"
-
-external substitute_vars : context -> ast -> ast array -> ast
- = "camlidl_z3_Z3_substitute_vars"
-
-external translate : context -> ast -> context -> ast
- = "camlidl_z3_Z3_translate"
-
-
-(**
- A model assigns uninterpreted sorts to finite universes of distinct values, constants to values,
- and arrays and functions to finite maps from argument values to result values plus a default
- value for all other arguments.
-*)
-type model_refined = {
- sorts : (sort, ast_vector) Hashtbl.t;
- consts : (func_decl, ast) Hashtbl.t;
- arrays : (func_decl, (ast, ast) Hashtbl.t * ast) Hashtbl.t;
- funcs : (func_decl, (ast array, ast) Hashtbl.t * ast) Hashtbl.t;
-}
-
-external model_eval : context -> model -> ast -> bool -> ast option
- = "camlidl_z3_Z3_model_eval"
-
-external model_get_const_interp : context -> model -> func_decl -> ast option
- = "camlidl_z3_Z3_model_get_const_interp"
-
-external model_get_func_interp : context -> model -> func_decl -> func_interp option
- = "camlidl_z3_Z3_model_get_func_interp"
-
-external model_get_num_consts : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_consts"
-
-external model_get_const_decl : context -> model -> int -> func_decl
- = "camlidl_z3_Z3_model_get_const_decl"
-
-external model_get_num_funcs : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_funcs"
-
-external model_get_func_decl : context -> model -> int -> func_decl
- = "camlidl_z3_Z3_model_get_func_decl"
-
-external model_get_num_sorts : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_sorts"
-
-external model_get_sort : context -> model -> int -> sort
- = "camlidl_z3_Z3_model_get_sort"
-
-external model_get_sort_universe : context -> model -> sort -> ast_vector
- = "camlidl_z3_Z3_model_get_sort_universe"
-
-external is_as_array : context -> ast -> bool
- = "camlidl_z3_Z3_is_as_array"
-
-external get_as_array_func_decl : context -> ast -> func_decl
- = "camlidl_z3_Z3_get_as_array_func_decl"
-
-external func_interp_get_num_entries : context -> func_interp -> int
- = "camlidl_z3_Z3_func_interp_get_num_entries"
-
-external func_interp_get_entry : context -> func_interp -> int -> func_entry
- = "camlidl_z3_Z3_func_interp_get_entry"
-
-external func_interp_get_else : context -> func_interp -> ast
- = "camlidl_z3_Z3_func_interp_get_else"
-
-external func_interp_get_arity : context -> func_interp -> int
- = "camlidl_z3_Z3_func_interp_get_arity"
-
-external func_entry_get_value : context -> func_entry -> ast
- = "camlidl_z3_Z3_func_entry_get_value"
-
-external func_entry_get_num_args : context -> func_entry -> int
- = "camlidl_z3_Z3_func_entry_get_num_args"
-
-external func_entry_get_arg : context -> func_entry -> int -> ast
- = "camlidl_z3_Z3_func_entry_get_arg"
-
-external open_log : string -> bool
- = "camlidl_z3_Z3_open_log"
-
-external append_log : string -> unit
- = "camlidl_z3_Z3_append_log"
-
-external close_log : unit -> unit
- = "camlidl_z3_Z3_close_log"
-
-external toggle_warning_messages : bool -> unit
- = "camlidl_z3_Z3_toggle_warning_messages"
-
-external set_ast_print_mode : context -> ast_print_mode -> unit
- = "camlidl_z3_Z3_set_ast_print_mode"
-
-external ast_to_string : context -> ast -> string
- = "camlidl_z3_Z3_ast_to_string"
-
-external pattern_to_string : context -> pattern -> string
- = "camlidl_z3_Z3_pattern_to_string"
-
-external sort_to_string : context -> sort -> string
- = "camlidl_z3_Z3_sort_to_string"
-
-external func_decl_to_string : context -> func_decl -> string
- = "camlidl_z3_Z3_func_decl_to_string"
-
-external model_to_string : context -> model -> string
- = "camlidl_z3_Z3_model_to_string"
-
-external benchmark_to_smtlib_string : context -> string -> string -> string -> string -> ast array -> ast -> string
- = "camlidl_z3_Z3_benchmark_to_smtlib_string_bytecode" "camlidl_z3_Z3_benchmark_to_smtlib_string"
-
-external parse_smtlib2_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3_Z3_parse_smtlib2_string_bytecode" "camlidl_z3_Z3_parse_smtlib2_string"
-
-external parse_smtlib2_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3_Z3_parse_smtlib2_file_bytecode" "camlidl_z3_Z3_parse_smtlib2_file"
-
-external parse_smtlib_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3_Z3_parse_smtlib_string_bytecode" "camlidl_z3_Z3_parse_smtlib_string"
-
-external parse_smtlib_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3_Z3_parse_smtlib_file_bytecode" "camlidl_z3_Z3_parse_smtlib_file"
-
-external get_smtlib_num_formulas : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_formulas"
-
-external get_smtlib_formula : context -> int -> ast
- = "camlidl_z3_Z3_get_smtlib_formula"
-
-external get_smtlib_num_assumptions : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_assumptions"
-
-external get_smtlib_assumption : context -> int -> ast
- = "camlidl_z3_Z3_get_smtlib_assumption"
-
-external get_smtlib_num_decls : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_decls"
-
-external get_smtlib_decl : context -> int -> func_decl
- = "camlidl_z3_Z3_get_smtlib_decl"
-
-external get_smtlib_num_sorts : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_sorts"
-
-external get_smtlib_sort : context -> int -> sort
- = "camlidl_z3_Z3_get_smtlib_sort"
-
-external get_smtlib_error : context -> string
- = "camlidl_z3_Z3_get_smtlib_error"
-
-external set_error : context -> error_code -> unit
- = "camlidl_z3_Z3_set_error"
-
-external get_error_msg_ex : context -> error_code -> string
- = "camlidl_z3_Z3_get_error_msg_ex"
-
-external get_version : unit -> int * int * int * int
- = "camlidl_z3_Z3_get_version"
-
-external enable_trace : string -> unit
- = "camlidl_z3_Z3_enable_trace"
-
-external disable_trace : string -> unit
- = "camlidl_z3_Z3_disable_trace"
-
-external mk_fixedpoint : context -> fixedpoint
- = "camlidl_z3_Z3_mk_fixedpoint"
-
-external fixedpoint_add_rule : context -> fixedpoint -> ast -> symbol -> unit
- = "camlidl_z3_Z3_fixedpoint_add_rule"
-
-external fixedpoint_add_fact : context -> fixedpoint -> func_decl -> int array -> unit
- = "camlidl_z3_Z3_fixedpoint_add_fact"
-
-external fixedpoint_assert : context -> fixedpoint -> ast -> unit
- = "camlidl_z3_Z3_fixedpoint_assert"
-
-external fixedpoint_query : context -> fixedpoint -> ast -> lbool
- = "camlidl_z3_Z3_fixedpoint_query"
-
-external fixedpoint_query_relations : context -> fixedpoint -> func_decl array -> lbool
- = "camlidl_z3_Z3_fixedpoint_query_relations"
-
-external fixedpoint_get_answer : context -> fixedpoint -> ast
- = "camlidl_z3_Z3_fixedpoint_get_answer"
-
-external fixedpoint_get_reason_unknown : context -> fixedpoint -> string
- = "camlidl_z3_Z3_fixedpoint_get_reason_unknown"
-
-external fixedpoint_update_rule : context -> fixedpoint -> ast -> symbol -> unit
- = "camlidl_z3_Z3_fixedpoint_update_rule"
-
-external fixedpoint_get_num_levels : context -> fixedpoint -> func_decl -> int
- = "camlidl_z3_Z3_fixedpoint_get_num_levels"
-
-external fixedpoint_get_cover_delta : context -> fixedpoint -> int -> func_decl -> ast
- = "camlidl_z3_Z3_fixedpoint_get_cover_delta"
-
-external fixedpoint_add_cover : context -> fixedpoint -> int -> func_decl -> ast -> unit
- = "camlidl_z3_Z3_fixedpoint_add_cover"
-
-external fixedpoint_get_statistics : context -> fixedpoint -> stats
- = "camlidl_z3_Z3_fixedpoint_get_statistics"
-
-external fixedpoint_register_relation : context -> fixedpoint -> func_decl -> unit
- = "camlidl_z3_Z3_fixedpoint_register_relation"
-
-external fixedpoint_set_predicate_representation : context -> fixedpoint -> func_decl -> symbol array -> unit
- = "camlidl_z3_Z3_fixedpoint_set_predicate_representation"
-
-external fixedpoint_get_rules : context -> fixedpoint -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_get_rules"
-
-external fixedpoint_get_assertions : context -> fixedpoint -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_get_assertions"
-
-external fixedpoint_set_params : context -> fixedpoint -> params -> unit
- = "camlidl_z3_Z3_fixedpoint_set_params"
-
-external fixedpoint_get_help : context -> fixedpoint -> string
- = "camlidl_z3_Z3_fixedpoint_get_help"
-
-external fixedpoint_get_param_descrs : context -> fixedpoint -> param_descrs
- = "camlidl_z3_Z3_fixedpoint_get_param_descrs"
-
-external fixedpoint_to_string : context -> fixedpoint -> ast array -> string
- = "camlidl_z3_Z3_fixedpoint_to_string"
-
-external fixedpoint_from_string : context -> fixedpoint -> string -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_from_string"
-
-external fixedpoint_from_file : context -> fixedpoint -> string -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_from_file"
-
-external fixedpoint_push : context -> fixedpoint -> unit
- = "camlidl_z3_Z3_fixedpoint_push"
-
-external fixedpoint_pop : context -> fixedpoint -> unit
- = "camlidl_z3_Z3_fixedpoint_pop"
-
-external mk_ast_vector : context -> ast_vector
- = "camlidl_z3_Z3_mk_ast_vector"
-
-external ast_vector_size : context -> ast_vector -> int
- = "camlidl_z3_Z3_ast_vector_size"
-
-external ast_vector_get : context -> ast_vector -> int -> ast
- = "camlidl_z3_Z3_ast_vector_get"
-
-external ast_vector_set : context -> ast_vector -> int -> ast -> unit
- = "camlidl_z3_Z3_ast_vector_set"
-
-external ast_vector_resize : context -> ast_vector -> int -> unit
- = "camlidl_z3_Z3_ast_vector_resize"
-
-external ast_vector_push : context -> ast_vector -> ast -> unit
- = "camlidl_z3_Z3_ast_vector_push"
-
-external ast_vector_translate : context -> ast_vector -> context -> ast_vector
- = "camlidl_z3_Z3_ast_vector_translate"
-
-external ast_vector_to_string : context -> ast_vector -> string
- = "camlidl_z3_Z3_ast_vector_to_string"
-
-external mk_ast_map : context -> ast_map
- = "camlidl_z3_Z3_mk_ast_map"
-
-external ast_map_contains : context -> ast_map -> ast -> bool
- = "camlidl_z3_Z3_ast_map_contains"
-
-external ast_map_find : context -> ast_map -> ast -> ast
- = "camlidl_z3_Z3_ast_map_find"
-
-external ast_map_insert : context -> ast_map -> ast -> ast -> unit
- = "camlidl_z3_Z3_ast_map_insert"
-
-external ast_map_erase : context -> ast_map -> ast -> unit
- = "camlidl_z3_Z3_ast_map_erase"
-
-external ast_map_reset : context -> ast_map -> unit
- = "camlidl_z3_Z3_ast_map_reset"
-
-external ast_map_size : context -> ast_map -> int
- = "camlidl_z3_Z3_ast_map_size"
-
-external ast_map_keys : context -> ast_map -> ast_vector
- = "camlidl_z3_Z3_ast_map_keys"
-
-external ast_map_to_string : context -> ast_map -> string
- = "camlidl_z3_Z3_ast_map_to_string"
-
-external mk_goal : context -> bool -> bool -> bool -> goal
- = "camlidl_z3_Z3_mk_goal"
-
-external goal_precision : context -> goal -> goal_prec
- = "camlidl_z3_Z3_goal_precision"
-
-external goal_assert : context -> goal -> ast -> unit
- = "camlidl_z3_Z3_goal_assert"
-
-external goal_inconsistent : context -> goal -> bool
- = "camlidl_z3_Z3_goal_inconsistent"
-
-external goal_depth : context -> goal -> int
- = "camlidl_z3_Z3_goal_depth"
-
-external goal_reset : context -> goal -> unit
- = "camlidl_z3_Z3_goal_reset"
-
-external goal_size : context -> goal -> int
- = "camlidl_z3_Z3_goal_size"
-
-external goal_formula : context -> goal -> int -> ast
- = "camlidl_z3_Z3_goal_formula"
-
-external goal_num_exprs : context -> goal -> int
- = "camlidl_z3_Z3_goal_num_exprs"
-
-external goal_is_decided_sat : context -> goal -> bool
- = "camlidl_z3_Z3_goal_is_decided_sat"
-
-external goal_is_decided_unsat : context -> goal -> bool
- = "camlidl_z3_Z3_goal_is_decided_unsat"
-
-external goal_translate : context -> goal -> context -> goal
- = "camlidl_z3_Z3_goal_translate"
-
-external goal_to_string : context -> goal -> string
- = "camlidl_z3_Z3_goal_to_string"
-
-external mk_tactic : context -> string -> tactic
- = "camlidl_z3_Z3_mk_tactic"
-
-external mk_probe : context -> string -> probe
- = "camlidl_z3_Z3_mk_probe"
-
-external tactic_and_then : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_and_then"
-
-external tactic_or_else : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_or_else"
-
-external tactic_par_or : context -> tactic array -> tactic
- = "camlidl_z3_Z3_tactic_par_or"
-
-external tactic_par_and_then : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_par_and_then"
-
-external tactic_try_for : context -> tactic -> int -> tactic
- = "camlidl_z3_Z3_tactic_try_for"
-
-external tactic_when : context -> probe -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_when"
-
-external tactic_cond : context -> probe -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_cond"
-
-external tactic_repeat : context -> tactic -> int -> tactic
- = "camlidl_z3_Z3_tactic_repeat"
-
-external tactic_skip : context -> tactic
- = "camlidl_z3_Z3_tactic_skip"
-
-external tactic_fail : context -> tactic
- = "camlidl_z3_Z3_tactic_fail"
-
-external tactic_fail_if : context -> probe -> tactic
- = "camlidl_z3_Z3_tactic_fail_if"
-
-external tactic_fail_if_not_decided : context -> tactic
- = "camlidl_z3_Z3_tactic_fail_if_not_decided"
-
-external tactic_using_params : context -> tactic -> params -> tactic
- = "camlidl_z3_Z3_tactic_using_params"
-
-external probe_const : context -> float -> probe
- = "camlidl_z3_Z3_probe_const"
-
-external probe_lt : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_lt"
-
-external probe_gt : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_gt"
-
-external probe_le : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_le"
-
-external probe_ge : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_ge"
-
-external probe_eq : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_eq"
-
-external probe_and : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_and"
-
-external probe_or : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_or"
-
-external probe_not : context -> probe -> probe
- = "camlidl_z3_Z3_probe_not"
-
-external get_num_tactics : context -> int
- = "camlidl_z3_Z3_get_num_tactics"
-
-external get_tactic_name : context -> int -> string
- = "camlidl_z3_Z3_get_tactic_name"
-
-external get_num_probes : context -> int
- = "camlidl_z3_Z3_get_num_probes"
-
-external get_probe_name : context -> int -> string
- = "camlidl_z3_Z3_get_probe_name"
-
-external tactic_get_help : context -> tactic -> string
- = "camlidl_z3_Z3_tactic_get_help"
-
-external tactic_get_param_descrs : context -> tactic -> param_descrs
- = "camlidl_z3_Z3_tactic_get_param_descrs"
-
-external tactic_get_descr : context -> string -> string
- = "camlidl_z3_Z3_tactic_get_descr"
-
-external probe_get_descr : context -> string -> string
- = "camlidl_z3_Z3_probe_get_descr"
-
-external probe_apply : context -> probe -> goal -> float
- = "camlidl_z3_Z3_probe_apply"
-
-external tactic_apply : context -> tactic -> goal -> apply_result
- = "camlidl_z3_Z3_tactic_apply"
-
-external tactic_apply_ex : context -> tactic -> goal -> params -> apply_result
- = "camlidl_z3_Z3_tactic_apply_ex"
-
-external apply_result_to_string : context -> apply_result -> string
- = "camlidl_z3_Z3_apply_result_to_string"
-
-external apply_result_get_num_subgoals : context -> apply_result -> int
- = "camlidl_z3_Z3_apply_result_get_num_subgoals"
-
-external apply_result_get_subgoal : context -> apply_result -> int -> goal
- = "camlidl_z3_Z3_apply_result_get_subgoal"
-
-external apply_result_convert_model : context -> apply_result -> int -> model -> model
- = "camlidl_z3_Z3_apply_result_convert_model"
-
-external mk_solver : context -> solver
- = "camlidl_z3_Z3_mk_solver"
-
-external mk_simple_solver : context -> solver
- = "camlidl_z3_Z3_mk_simple_solver"
-
-external mk_solver_for_logic : context -> symbol -> solver
- = "camlidl_z3_Z3_mk_solver_for_logic"
-
-external mk_solver_from_tactic : context -> tactic -> solver
- = "camlidl_z3_Z3_mk_solver_from_tactic"
-
-external solver_get_help : context -> solver -> string
- = "camlidl_z3_Z3_solver_get_help"
-
-external solver_get_param_descrs : context -> solver -> param_descrs
- = "camlidl_z3_Z3_solver_get_param_descrs"
-
-external solver_set_params : context -> solver -> params -> unit
- = "camlidl_z3_Z3_solver_set_params"
-
-external solver_push : context -> solver -> unit
- = "camlidl_z3_Z3_solver_push"
-
-external solver_pop : context -> solver -> int -> unit
- = "camlidl_z3_Z3_solver_pop"
-
-external solver_reset : context -> solver -> unit
- = "camlidl_z3_Z3_solver_reset"
-
-external solver_get_num_scopes : context -> solver -> int
- = "camlidl_z3_Z3_solver_get_num_scopes"
-
-external solver_assert : context -> solver -> ast -> unit
- = "camlidl_z3_Z3_solver_assert"
-
-external solver_assert_and_track : context -> solver -> ast -> ast -> unit
- = "camlidl_z3_Z3_solver_assert_and_track"
-
-external solver_get_assertions : context -> solver -> ast_vector
- = "camlidl_z3_Z3_solver_get_assertions"
-
-external solver_check : context -> solver -> lbool
- = "camlidl_z3_Z3_solver_check"
-
-external solver_check_assumptions : context -> solver -> ast array -> lbool
- = "camlidl_z3_Z3_solver_check_assumptions"
-
-external solver_get_model : context -> solver -> model
- = "camlidl_z3_Z3_solver_get_model"
-
-external solver_get_proof : context -> solver -> ast
- = "camlidl_z3_Z3_solver_get_proof"
-
-external solver_get_unsat_core : context -> solver -> ast_vector
- = "camlidl_z3_Z3_solver_get_unsat_core"
-
-external solver_get_reason_unknown : context -> solver -> string
- = "camlidl_z3_Z3_solver_get_reason_unknown"
-
-external solver_get_statistics : context -> solver -> stats
- = "camlidl_z3_Z3_solver_get_statistics"
-
-external solver_to_string : context -> solver -> string
- = "camlidl_z3_Z3_solver_to_string"
-
-
-type stat_datum = Stat_int of int | Stat_float of float
-type stats_refined = (string, stat_datum) Hashtbl.t
-
-external stats_to_string : context -> stats -> string
- = "camlidl_z3_Z3_stats_to_string"
-
-external stats_size : context -> stats -> int
- = "camlidl_z3_Z3_stats_size"
-
-external stats_get_key : context -> stats -> int -> string
- = "camlidl_z3_Z3_stats_get_key"
-
-external stats_is_uint : context -> stats -> int -> bool
- = "camlidl_z3_Z3_stats_is_uint"
-
-external stats_is_double : context -> stats -> int -> bool
- = "camlidl_z3_Z3_stats_is_double"
-
-external stats_get_uint_value : context -> stats -> int -> int
- = "camlidl_z3_Z3_stats_get_uint_value"
-
-external stats_get_double_value : context -> stats -> int -> float
- = "camlidl_z3_Z3_stats_get_double_value"
-
-external get_implied_equalities : context -> solver -> ast array -> lbool * int array
- = "camlidl_z3_Z3_get_implied_equalities"
-
-
-(* Internal auxiliary functions: *)
-(*
-(* Transform a pair of arrays into an array of pairs *)
-let array_combine a b =
- if Array.length a <> Array.length b then raise (Invalid_argument "array_combine");
- Array.init (Array.length a) (fun i -> (a.(i), b.(i)))
-(* [a |> b] is the pipeline operator for [b(a)] *)
-let ( |> ) x f = f x
-*)
-(* Find the index of an element in an array, raises Not_found is missing *)
-let find equal x a =
- let len = Array.length a in
- let rec find_ i =
- if i >= len then
- raise Not_found
+open Z3enums
+
+exception Error = Z3native.Exception
+
+(* Some helpers. *)
+let null = Z3native.mk_null()
+let is_null o = (Z3native.is_null o)
+
+(* Internal types *)
+type z3_native_context = { m_n_ctx : Z3native.z3_context; m_n_obj_cnt: int; }
+type context = z3_native_context
+
+type z3_native_object = {
+ m_ctx : context ;
+ mutable m_n_obj : Z3native.ptr ;
+ inc_ref : Z3native.z3_context -> Z3native.ptr -> unit;
+ dec_ref : Z3native.z3_context -> Z3native.ptr -> unit }
+
+(** Internal stuff *)
+module Internal =
+struct
+ let dispose_context ctx =
+ if ctx.m_n_obj_cnt == 0 then (
+ (Z3native.del_context ctx.m_n_ctx)
+ ) else (
+ Printf.printf "ERROR: NOT DISPOSING CONTEXT (because it still has %d objects alive)\n" ctx.m_n_obj_cnt;
+ )
+
+ let create_context settings =
+ let cfg = Z3native.mk_config () in
+ let f e = (Z3native.set_param_value cfg (fst e) (snd e)) in
+ (List.iter f settings) ;
+ let v = Z3native.mk_context_rc cfg in
+ Z3native.del_config(cfg) ;
+ Z3native.set_ast_print_mode v (int_of_ast_print_mode PRINT_SMTLIB2_COMPLIANT) ;
+ Z3native.set_internal_error_handler v ;
+ let res = { m_n_ctx = v; m_n_obj_cnt = 0 } in
+ let f = fun o -> dispose_context o in
+ Gc.finalise f res;
+ res
+
+ let context_add1 ctx = ignore (ctx.m_n_obj_cnt = ctx.m_n_obj_cnt + 1)
+ let context_sub1 ctx = ignore (ctx.m_n_obj_cnt = ctx.m_n_obj_cnt - 1)
+ let context_gno ctx = ctx.m_n_ctx
+
+
+ let z3obj_gc o = o.m_ctx
+ let z3obj_gnc o = (context_gno o.m_ctx)
+
+ let z3obj_gno o = o.m_n_obj
+ let z3obj_sno o ctx no =
+ (context_add1 ctx) ;
+ o.inc_ref (context_gno ctx) no ;
+ (
+ if not (is_null o.m_n_obj) then
+ o.dec_ref (context_gno ctx) o.m_n_obj ;
+ (context_sub1 ctx)
+ ) ;
+ o.m_n_obj <- no
+
+ let z3obj_dispose o =
+ if not (is_null o.m_n_obj) then
+ (
+ o.dec_ref (z3obj_gnc o) o.m_n_obj ;
+ (context_sub1 (z3obj_gc o))
+ ) ;
+ o.m_n_obj <- null
+
+ let z3obj_create o =
+ let f = fun o -> (z3obj_dispose o) in
+ Gc.finalise f o
+
+ let z3obj_nil_ref x y = ()
+
+ let z3_native_object_of_ast_ptr : context -> Z3native.ptr -> z3_native_object = fun ctx no ->
+ let res : z3_native_object = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.inc_ref ;
+ dec_ref = Z3native.dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+end
+
+open Internal
+
+module Log =
+struct
+ let open_ filename = ((lbool_of_int (Z3native.open_log filename)) == L_TRUE)
+ let close = Z3native.close_log
+ let append s = Z3native.append_log s
+end
+
+
+module Version =
+struct
+ let major = let (x, _, _, _) = Z3native.get_version () in x
+ let minor = let (_, x, _, _) = Z3native.get_version () in x
+ let build = let (_, _, x, _) = Z3native.get_version () in x
+ let revision = let (_, _, _, x) = Z3native.get_version () in x
+ let to_string =
+ let (mj, mn, bld, rev) = Z3native.get_version () in
+ string_of_int mj ^ "." ^
+ string_of_int mn ^ "." ^
+ string_of_int bld ^ "." ^
+ string_of_int rev
+end
+
+
+let mk_list ( f : int -> 'a ) ( n : int ) =
+ let rec mk_list' ( f : int -> 'a ) ( i : int ) ( n : int ) ( tail : 'a list ) : 'a list =
+ if (i >= n) then
+ tail
else
- if equal x a.(i) then
- i
- else
- find_ (i+1)
+ (f i) :: (mk_list' f (i+1) n tail)
in
- find_ 0
-(* Symbols *)
-let symbol_refine c s =
- match get_symbol_kind c s with
- | INT_SYMBOL -> Symbol_int (get_symbol_int c s)
- | STRING_SYMBOL -> Symbol_string (get_symbol_string c s)
-let mk_symbol c = function
- | Symbol_int(i) -> mk_int_symbol c i
- | Symbol_string(s) -> mk_string_symbol c s
-(* Sorts *)
-let get_datatype_sort c s =
- Array.init (get_datatype_sort_num_constructors c s) (fun i ->
- let constructor = get_datatype_sort_constructor c s i in
- let recognizer = get_datatype_sort_recognizer c s i in
- let accessors =
- Array.init (get_domain_size c constructor) (fun j ->
- get_datatype_sort_constructor_accessor c s i j
- ) in
- {constructor; recognizer; accessors}
- )
-let sort_refine c s =
- match get_sort_kind c s with
- | UNINTERPRETED_SORT -> Sort_uninterpreted (get_sort_name c s)
- | BOOL_SORT -> Sort_bool
- | INT_SORT -> Sort_int
- | BV_SORT -> Sort_bv (get_bv_sort_size c s)
- | FINITE_DOMAIN_SORT ->
- (match get_finite_domain_sort_size c s with
- | Some(sz) -> Sort_finite_domain (get_sort_name c s, sz)
- | None -> failwith "Z3.sort_refine: failed to get size of finite-domain sort"
- )
- | REAL_SORT -> Sort_real
- | ARRAY_SORT -> Sort_array (get_array_sort_domain c s, get_array_sort_range c s)
- | DATATYPE_SORT -> Sort_datatype (get_datatype_sort c s)
- | RELATION_SORT -> Sort_relation (Array.init (get_relation_arity c s) (fun i -> get_relation_column c s i))
- | UNKNOWN_SORT -> Sort_unknown
-let mk_sort c = function
- | Sort_uninterpreted(s) -> mk_uninterpreted_sort c s
- | Sort_bool -> mk_bool_sort c
- | Sort_int -> mk_int_sort c
- | Sort_bv(size) -> mk_bv_sort c size
- | Sort_finite_domain(name,size) -> mk_finite_domain_sort c name size
- | Sort_real -> mk_real_sort c
- | Sort_array(domain,range) -> mk_array_sort c domain range
- | Sort_datatype(constructors) -> get_range c constructors.(0).constructor
- | Sort_relation(_) -> invalid_arg "Z3.mk_sort: cannot construct relation sorts"
- | Sort_unknown(_) -> invalid_arg "Z3.mk_sort: cannot construct unknown sorts"
-(* Replacement datatypes creation API *)
-let mk_datatypes ctx generator =
- let usort0 = mk_uninterpreted_sort ctx (mk_int_symbol ctx 0)
- in
- let rec find_num_sorts i =
- if i = max_int then invalid_arg "mk_datatypes: too many sorts"
+ mk_list' f 0 n []
+
+let list_of_array ( x : _ array ) =
+ let f i = (Array.get x i) in
+ mk_list f (Array.length x)
+
+let mk_context ( cfg : ( string * string ) list ) =
+ create_context cfg
+
+
+module Symbol =
+struct
+ type symbol = z3_native_object
+
+ let create_i ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : symbol = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = z3obj_nil_ref ;
+ dec_ref = z3obj_nil_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let create_s ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : symbol = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = z3obj_nil_ref ;
+ dec_ref = z3obj_nil_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ match (symbol_kind_of_int (Z3native.get_symbol_kind (context_gno ctx) no)) with
+ | INT_SYMBOL -> (create_i ctx no)
+ | STRING_SYMBOL -> (create_s ctx no)
+
+ let gc ( x : symbol ) = (z3obj_gc x)
+ let gnc ( x : symbol ) = (z3obj_gnc x)
+ let gno ( x : symbol ) = (z3obj_gno x)
+
+ let symbol_lton ( a : symbol list ) =
+ let f ( e : symbol ) = (gno e) in
+ Array.of_list (List.map f a)
+
+ let kind ( o : symbol ) = (symbol_kind_of_int (Z3native.get_symbol_kind (gnc o) (gno o)))
+ let is_int_symbol ( o : symbol ) = (kind o) == INT_SYMBOL
+ let is_string_symbol ( o : symbol ) = (kind o) == STRING_SYMBOL
+ let get_int (o : symbol) = Z3native.get_symbol_int (z3obj_gnc o) (z3obj_gno o)
+ let get_string (o : symbol ) = Z3native.get_symbol_string (z3obj_gnc o) (z3obj_gno o)
+ let to_string ( o : symbol ) =
+ match (kind o) with
+ | INT_SYMBOL -> (string_of_int (Z3native.get_symbol_int (gnc o) (gno o)))
+ | STRING_SYMBOL -> (Z3native.get_symbol_string (gnc o) (gno o))
+
+ let mk_int ( ctx : context ) ( i : int ) =
+ (create_i ctx (Z3native.mk_int_symbol (context_gno ctx) i))
+
+ let mk_string ( ctx : context ) ( s : string ) =
+ (create_s ctx (Z3native.mk_string_symbol (context_gno ctx) s))
+
+ let mk_ints ( ctx : context ) ( names : int list ) =
+ let f elem = mk_int ( ctx : context ) elem in
+ (List.map f names)
+
+ let mk_strings ( ctx : context ) ( names : string list ) =
+ let f elem = mk_string ( ctx : context ) elem in
+ (List.map f names)
+end
+
+
+module AST =
+struct
+ type ast = z3_native_object
+
+ let context_of_ast ( x : ast ) = (z3obj_gc x)
+ let nc_of_ast ( x : ast ) = (z3obj_gnc x)
+ let ptr_of_ast ( x : ast ) = (z3obj_gno x)
+
+ let rec ast_of_ptr : context -> Z3native.ptr -> ast = fun ctx no ->
+ match (ast_kind_of_int (Z3native.get_ast_kind (context_gno ctx) no)) with
+ | FUNC_DECL_AST
+ | SORT_AST
+ | QUANTIFIER_AST
+ | APP_AST
+ | NUMERAL_AST
+ | VAR_AST -> z3_native_object_of_ast_ptr ctx no
+ | UNKNOWN_AST -> raise (Z3native.Exception "Cannot create asts of type unknown")
+
+ module ASTVector =
+ struct
+ type ast_vector = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : ast_vector = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.ast_vector_inc_ref ;
+ dec_ref = Z3native.ast_vector_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let mk_ast_vector ( ctx : context ) = (create ctx (Z3native.mk_ast_vector (context_gno ctx)))
+
+ let get_size ( x : ast_vector ) =
+ Z3native.ast_vector_size (z3obj_gnc x) (z3obj_gno x)
+
+ let get ( x : ast_vector ) ( i : int ) =
+ ast_of_ptr (z3obj_gc x) (Z3native.ast_vector_get (z3obj_gnc x) (z3obj_gno x) i)
+
+ let set ( x : ast_vector ) ( i : int ) ( value : ast ) =
+ Z3native.ast_vector_set (z3obj_gnc x) (z3obj_gno x) i (z3obj_gno value)
+
+ let resize ( x : ast_vector ) ( new_size : int ) =
+ Z3native.ast_vector_resize (z3obj_gnc x) (z3obj_gno x) new_size
+
+ let push ( x : ast_vector ) ( a : ast ) =
+ Z3native.ast_vector_push (z3obj_gnc x) (z3obj_gno x) (z3obj_gno a)
+
+ let translate ( x : ast_vector ) ( to_ctx : context ) =
+ create to_ctx (Z3native.ast_vector_translate (z3obj_gnc x) (z3obj_gno x) (context_gno to_ctx))
+
+ let to_string ( x : ast_vector ) =
+ Z3native.ast_vector_to_string (z3obj_gnc x) (z3obj_gno x)
+ end
+
+ module ASTMap =
+ struct
+ type ast_map = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : ast_map = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.ast_map_inc_ref ;
+ dec_ref = Z3native.ast_map_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let mk_ast_map ( ctx : context ) = (create ctx (Z3native.mk_ast_map (context_gno ctx)))
+
+ let astmap_of_ptr ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : ast_map = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.ast_map_inc_ref ;
+ dec_ref = Z3native.ast_map_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let contains ( x : ast_map ) ( key : ast ) =
+ Z3native.ast_map_contains (z3obj_gnc x) (z3obj_gno x) (z3obj_gno key)
+
+ let find ( x : ast_map ) ( key : ast ) =
+ ast_of_ptr (z3obj_gc x) (Z3native.ast_map_find (z3obj_gnc x) (z3obj_gno x) (z3obj_gno key))
+
+ let insert ( x : ast_map ) ( key : ast ) ( value : ast ) =
+ Z3native.ast_map_insert (z3obj_gnc x) (z3obj_gno x) (z3obj_gno key) (z3obj_gno value)
+
+ let erase ( x : ast_map ) ( key : ast ) =
+ Z3native.ast_map_erase (z3obj_gnc x) (z3obj_gno x) (z3obj_gno key)
+
+ let reset ( x : ast_map ) =
+ Z3native.ast_map_reset (z3obj_gnc x) (z3obj_gno x)
+
+ let get_size ( x : ast_map ) =
+ Z3native.ast_map_size (z3obj_gnc x) (z3obj_gno x)
+
+ let get_keys ( x : ast_map ) =
+ let av = ASTVector.create (z3obj_gc x) (Z3native.ast_map_keys (z3obj_gnc x) (z3obj_gno x)) in
+ let f i = (ASTVector.get av i) in
+ mk_list f (ASTVector.get_size av)
+
+ let to_string ( x : ast_map ) =
+ Z3native.ast_map_to_string (z3obj_gnc x) (z3obj_gno x)
+ end
+
+ let hash ( x : ast ) = Z3native.get_ast_hash (z3obj_gnc x) (z3obj_gno x)
+ let get_id ( x : ast ) = Z3native.get_ast_id (z3obj_gnc x) (z3obj_gno x)
+ let get_ast_kind ( x : ast ) = (ast_kind_of_int (Z3native.get_ast_kind (z3obj_gnc x) (z3obj_gno x)))
+
+ let is_expr ( x : ast ) =
+ match get_ast_kind ( x : ast ) with
+ | APP_AST
+ | NUMERAL_AST
+ | QUANTIFIER_AST
+ | VAR_AST -> true
+ | _ -> false
+
+ let is_app ( x : ast ) = (get_ast_kind x) == APP_AST
+ let is_var ( x : ast ) = (get_ast_kind x) == VAR_AST
+ let is_quantifier ( x : ast ) = (get_ast_kind x) == QUANTIFIER_AST
+ let is_sort ( x : ast ) = (get_ast_kind x) == SORT_AST
+ let is_func_decl ( x : ast ) = (get_ast_kind x) == FUNC_DECL_AST
+
+ let to_string ( x : ast ) = Z3native.ast_to_string (z3obj_gnc x) (z3obj_gno x)
+ let to_sexpr ( x : ast ) = Z3native.ast_to_string (z3obj_gnc x) (z3obj_gno x)
+
+
+ let equal ( a : ast ) ( b : ast ) = (a == b) ||
+ if (z3obj_gnc a) != (z3obj_gnc b) then
+ false
+ else
+ Z3native.is_eq_ast (z3obj_gnc a) (z3obj_gno a) (z3obj_gno b)
+
+ let compare a b =
+ if (get_id a) < (get_id b) then -1 else
+ if (get_id a) > (get_id b) then 1 else
+ 0
+
+ let translate ( x : ast ) ( to_ctx : context ) =
+ if (z3obj_gnc x) == (context_gno to_ctx) then
+ x
else
- match generator (Array.make i usort0) with
- | None -> find_num_sorts (i+1)
- | Some(a) when Array.length a = i -> i
- | Some _ -> invalid_arg "mk_datatypes: number of sorts and datatype descriptors must be equal"
- in
- let num_sorts = find_num_sorts 0
- in
- let sorts0 = Array.init num_sorts (fun i -> mk_uninterpreted_sort ctx (mk_int_symbol ctx i))
- in
- let ctorss_descriptors =
- match generator sorts0 with
- | Some(ctorss_descriptors) -> ctorss_descriptors
- | None -> invalid_arg "mk_datatypes: generator failed"
- in
- let names = Array.map fst ctorss_descriptors
- in
- let ctorss =
- Array.map (fun (_, ctors_descriptor) ->
- Array.map (fun {constructor_desc; recognizer_desc; accessor_descs} ->
- let field_names = Array.map fst accessor_descs
- in
- let sort_refs = Array.make (Array.length accessor_descs) 0
- in
- let field_sorts =
- Array.mapi (fun i (_, sort) ->
- try
- let j = find (fun s t -> is_eq_sort ctx s t) sort sorts0 in
- sort_refs.(i) <- j ;
- None
- with Not_found ->
- Some(sort)
- ) accessor_descs
- in
- mk_constructor ctx constructor_desc recognizer_desc field_names field_sorts sort_refs
- ) ctors_descriptor
- ) ctorss_descriptors
- in
- let constructor_lists = Array.map (mk_constructor_list ctx) ctorss
- in
- let sorts,_ = mk_datatypes ctx names constructor_lists
- in
- let datatypes =
- Array.mapi (fun i sort ->
- (sort,
- Array.mapi (fun j ctor ->
- let num_fields = Array.length (snd ctorss_descriptors.(i)).(j).accessor_descs in
- let constructor, recognizer, accessors = query_constructor ctx ctor num_fields in
- {constructor; recognizer; accessors}
- ) ctorss.(i))
- ) sorts
- in
- Array.iter (fun ctor_list ->
- del_constructor_list ctx ctor_list
- ) constructor_lists
- ;
- Array.iter (fun ctors ->
- Array.iter (fun ctor ->
- del_constructor ctx ctor
- ) ctors
- ) ctorss
- ;
- datatypes
-(* Numerals *)
-let rec numeral_refine c t =
- assert( get_ast_kind c t = NUMERAL_AST );
- let sort = get_sort c t in
- let is_int, i = get_numeral_int c t in
- if is_int then
- Numeral_int (i, sort)
- else
- let is_int64, i = get_numeral_int64 c t in
- if is_int64 then
- Numeral_int64 (i, sort)
- else
- if get_sort_kind c sort <> REAL_SORT then
- Numeral_large (get_numeral_string c t, sort)
- else
- let n = numeral_refine c (get_numerator c t) in
- let d = numeral_refine c (get_denominator c t) in
- Numeral_rational (n, d)
-let to_real c x =
- if get_sort_kind c (get_sort c x) = REAL_SORT then
- x
- else
- mk_int2real c x
-let rec embed_numeral c = function
- | Numeral_int (i, s) -> mk_int c i s
- | Numeral_int64 (i, s) -> mk_int64 c i s
- | Numeral_large (l, s) -> mk_numeral c l s
- | Numeral_rational (Numeral_int(n,_), Numeral_int(d,_)) -> mk_real c n d
- | Numeral_rational (n, d) ->
- mk_div c (to_real c (embed_numeral c n)) (to_real c (embed_numeral c d))
- (* Or should the following be used instead?
- let n_str = get_numeral_string c (embed_numeral c n) in
- let d_str = get_numeral_string c (embed_numeral c d) in
- mk_numeral c (n_str ^ " / " ^ d_str) (mk_real_sort c)
- *)
-(* Terms *)
-let get_app_args c a =
- Array.init (get_app_num_args c a) (get_app_arg c a);;
-let get_domains c d =
- Array.init (get_domain_size c d) (get_domain c d);;
-let get_pattern_terms c p =
- Array.init (get_pattern_num_terms c p) (get_pattern c p)
-let term_refine c t =
- match get_ast_kind c t with
- | NUMERAL_AST ->
- Term_numeral (numeral_refine c t)
- | APP_AST ->
- let t' = to_app c t in
- let f = get_app_decl c t' in
- let num_args = get_app_num_args c t' in
- let args = Array.init num_args (get_app_arg c t') in
- let k = get_decl_kind c f in
- Term_app (k, f, args)
- | QUANTIFIER_AST ->
- let bt = if is_quantifier_forall c t then Forall else Exists in
- let w = get_quantifier_weight c t in
- let np = get_quantifier_num_patterns c t in
- let pats = Array.init np (get_quantifier_pattern_ast c t) in
- let pats = Array.map (get_pattern_terms c) pats in
- let nb = get_quantifier_num_bound c t in
- let bound =
- Array.init nb (fun i ->
- (get_quantifier_bound_name c t i, get_quantifier_bound_sort c t i)
- ) in
- let body = get_quantifier_body c t in
- Term_quantifier (bt, w, pats, bound, body)
- | VAR_AST ->
- Term_var (get_index_value c t, get_sort c t)
- | _ ->
- assert false
-(* let mk_term c = function *)
-(* | Term_numeral (numeral, sort) -> mk_numeral c numeral sort *)
-(* | Term_app (kind, decl, args) -> *)
-(* | Term_quantifier (strength, weight, pats, bound, body) -> *)
-(* | Term_var (index, sort) -> *)
-(* Refined model API *)
-let model_refine c m =
- let num_sorts = model_get_num_sorts c m in
- let sorts = Hashtbl.create num_sorts in
- for i = 0 to num_sorts - 1 do
- let sort = model_get_sort c m i in
- let universe = model_get_sort_universe c m sort in
- Hashtbl.add sorts sort universe
- done;
- let num_consts = model_get_num_consts c m in
- let consts = Hashtbl.create num_consts in
- let arrays = Hashtbl.create 0 in
- for i = 0 to num_consts - 1 do
- let const_decl = model_get_const_decl c m i in
- match model_get_const_interp c m const_decl with
- | Some(const_interp) ->
- if is_as_array c const_interp then
- let array_decl = get_as_array_func_decl c const_interp in
- match model_get_func_interp c m array_decl with
- | Some(array_interp) ->
- let num_entries = func_interp_get_num_entries c array_interp in
- let tbl = Hashtbl.create num_entries in
- for i = 0 to num_entries - 1 do
- let entry = func_interp_get_entry c array_interp i in
- assert( func_entry_get_num_args c entry = 1 );
- let arg = func_entry_get_arg c entry 0 in
- let value = func_entry_get_value c entry in
- Hashtbl.add tbl arg value
- done;
- let default = func_interp_get_else c array_interp in
- Hashtbl.add arrays const_decl (tbl, default)
- | None ->
- ()
- else
- Hashtbl.add consts const_decl const_interp
- | None ->
- ()
- done;
- let num_funcs = model_get_num_funcs c m in
- let funcs = Hashtbl.create num_funcs in
- for i = 0 to num_funcs - 1 do
- let func_decl = model_get_func_decl c m i in
- if not (Hashtbl.mem arrays func_decl) then
- match model_get_func_interp c m func_decl with
- | Some(func_interp) ->
- let num_entries = func_interp_get_num_entries c func_interp in
- let tbl = Hashtbl.create num_entries in
- for i = 0 to num_entries - 1 do
- let entry = func_interp_get_entry c func_interp i in
- let num_args = func_entry_get_num_args c entry in
- let args = Array.init num_args (fun i -> func_entry_get_arg c entry i) in
- let value = func_entry_get_value c entry in
- Hashtbl.add tbl args value
- done;
- let default = func_interp_get_else c func_interp in
- Hashtbl.add funcs func_decl (tbl, default)
- | None ->
- ()
- done;
- {sorts; consts; arrays; funcs}
-(* Extended parser API *)
-let get_smtlib_formulas c =
- Array.init (get_smtlib_num_formulas c) (get_smtlib_formula c)
-let get_smtlib_assumptions c =
- Array.init (get_smtlib_num_assumptions c) (get_smtlib_assumption c)
-let get_smtlib_decls c =
- Array.init (get_smtlib_num_decls c) (get_smtlib_decl c)
-let get_smtlib_parse_results c =
- (get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c)
-let parse_smtlib_string_x c a1 a2 a3 a4 a5 =
- parse_smtlib_string c a1 a2 a3 a4 a5 ;
- get_smtlib_parse_results c
-let parse_smtlib_file_x c a1 a2 a3 a4 a5 =
- parse_smtlib_file c a1 a2 a3 a4 a5 ;
- get_smtlib_parse_results c
-let parse_smtlib_string_formula c a1 a2 a3 a4 a5 =
- parse_smtlib_string c a1 a2 a3 a4 a5 ;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith "Z3: parse_smtlib_string_formula"
-let parse_smtlib_file_formula c a1 a2 a3 a4 a5 =
- parse_smtlib_file c a1 a2 a3 a4 a5 ;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith "Z3: parse_smtlib_file_formula"
-(* Error handling *)
-let get_error_msg c e =
- match e with
- | PARSER_ERROR -> (get_error_msg_ex c e) ^ ": " ^ (get_smtlib_error c)
- | _ -> get_error_msg_ex c e
-(* Refined stats API *)
-let stats_refine c s =
- let num_stats = stats_size c s in
- let tbl = Hashtbl.create num_stats in
- for i = 0 to num_stats - 1 do
- let key = stats_get_key c s i in
- let datum =
- if stats_is_uint c s i then
- Stat_int(stats_get_uint_value c s i)
+ ast_of_ptr to_ctx (Z3native.translate (z3obj_gnc x) (z3obj_gno x) (context_gno to_ctx))
+
+ let unwrap_ast ( x : ast ) = (z3obj_gno x)
+ let wrap_ast ( ctx : context ) ( ptr : Z3native.ptr ) = ast_of_ptr ctx ptr
+end
+
+open AST
+
+
+module Sort =
+struct
+ type sort = Sort of AST.ast
+
+ let sort_of_ptr : context -> Z3native.ptr -> sort = fun ctx no ->
+ let q = (z3_native_object_of_ast_ptr ctx no) in
+ if ((Z3enums.ast_kind_of_int (Z3native.get_ast_kind (context_gno ctx) no)) != Z3enums.SORT_AST) then
+ raise (Z3native.Exception "Invalid coercion")
+ else
+ match (sort_kind_of_int (Z3native.get_sort_kind (context_gno ctx) no)) with
+ | ARRAY_SORT
+ | BOOL_SORT
+ | BV_SORT
+ | DATATYPE_SORT
+ | INT_SORT
+ | REAL_SORT
+ | UNINTERPRETED_SORT
+ | FINITE_DOMAIN_SORT
+ | RELATION_SORT
+ | FLOATING_POINT_SORT
+ | ROUNDING_MODE_SORT -> Sort(q)
+ | UNKNOWN_SORT -> raise (Z3native.Exception "Unknown sort kind encountered")
+
+ let ast_of_sort s = match s with Sort(x) -> x
+
+ let gc ( x : sort ) = (match x with Sort(a) -> (z3obj_gc a))
+ let gnc ( x : sort ) = (match x with Sort(a) -> (z3obj_gnc a))
+ let gno ( x : sort ) = (match x with Sort(a) -> (z3obj_gno a))
+
+ let sort_lton ( a : sort list ) =
+ let f ( e : sort ) = match e with Sort(a) -> (AST.ptr_of_ast a) in
+ Array.of_list (List.map f a)
+
+ let sort_option_lton ( a : sort option list ) =
+ let f ( e : sort option ) = match e with None -> null | Some(Sort(a)) -> (AST.ptr_of_ast a) in
+ Array.of_list (List.map f a)
+
+ let equal : sort -> sort -> bool = fun a b ->
+ (a == b) ||
+ if (gnc a) != (gnc b) then
+ false
+ else
+ (Z3native.is_eq_sort (gnc a) (gno a) (gno b))
+
+
+ let get_id ( x : sort ) = Z3native.get_sort_id (gnc x) (gno x)
+ let get_sort_kind ( x : sort ) = (sort_kind_of_int (Z3native.get_sort_kind (gnc x) (gno x)))
+ let get_name ( x : sort ) = (Symbol.create (gc x) (Z3native.get_sort_name (gnc x) (gno x)))
+ let to_string ( x : sort ) = Z3native.sort_to_string (gnc x) (gno x)
+
+ let mk_uninterpreted ( ctx : context ) ( s : Symbol.symbol ) =
+ let res = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.inc_ref ;
+ dec_ref = Z3native.dec_ref } in
+ (z3obj_sno res ctx (Z3native.mk_uninterpreted_sort (context_gno ctx) (Symbol.gno s))) ;
+ (z3obj_create res) ;
+ Sort(res)
+
+ let mk_uninterpreted_s ( ctx : context ) ( s : string ) =
+ mk_uninterpreted ctx (Symbol.mk_string ( ctx : context ) s)
+end
+
+open Sort
+
+
+module rec FuncDecl :
+sig
+ type func_decl = FuncDecl of AST.ast
+ val ast_of_func_decl : FuncDecl.func_decl -> AST.ast
+ val func_decl_of_ptr : context -> Z3native.ptr -> func_decl
+ val gc : func_decl -> context
+ val gnc : func_decl -> Z3native.ptr
+ val gno : func_decl -> Z3native.ptr
+ module Parameter :
+ sig
+ type parameter =
+ P_Int of int
+ | P_Dbl of float
+ | P_Sym of Symbol.symbol
+ | P_Srt of Sort.sort
+ | P_Ast of AST.ast
+ | P_Fdl of func_decl
+ | P_Rat of string
+
+ val get_kind : parameter -> Z3enums.parameter_kind
+ val get_int : parameter -> int
+ val get_float : parameter -> float
+ val get_symbol : parameter -> Symbol.symbol
+ val get_sort : parameter -> Sort.sort
+ val get_ast : parameter -> AST.ast
+ val get_func_decl : parameter -> func_decl
+ val get_rational : parameter -> string
+ end
+ val mk_func_decl : context -> Symbol.symbol -> Sort.sort list -> Sort.sort -> func_decl
+ val mk_func_decl_s : context -> string -> Sort.sort list -> Sort.sort -> func_decl
+ val mk_fresh_func_decl : context -> string -> Sort.sort list -> Sort.sort -> func_decl
+ val mk_const_decl : context -> Symbol.symbol -> Sort.sort -> func_decl
+ val mk_const_decl_s : context -> string -> Sort.sort -> func_decl
+ val mk_fresh_const_decl : context -> string -> Sort.sort -> func_decl
+ val equal : func_decl -> func_decl -> bool
+ val to_string : func_decl -> string
+ val get_id : func_decl -> int
+ val get_arity : func_decl -> int
+ val get_domain_size : func_decl -> int
+ val get_domain : func_decl -> Sort.sort list
+ val get_range : func_decl -> Sort.sort
+ val get_decl_kind : func_decl -> Z3enums.decl_kind
+ val get_name : func_decl -> Symbol.symbol
+ val get_num_parameters : func_decl -> int
+ val get_parameters : func_decl -> Parameter.parameter list
+ val apply : func_decl -> Expr.expr list -> Expr.expr
+end = struct
+ type func_decl = FuncDecl of AST.ast
+
+ let func_decl_of_ptr : context -> Z3native.ptr -> func_decl = fun ctx no ->
+ if ((Z3enums.ast_kind_of_int (Z3native.get_ast_kind (context_gno ctx) no)) != Z3enums.FUNC_DECL_AST) then
+ raise (Z3native.Exception "Invalid coercion")
+ else
+ FuncDecl(z3_native_object_of_ast_ptr ctx no)
+
+ let ast_of_func_decl f = match f with FuncDecl(x) -> x
+
+ let create_ndr ( ctx : context ) ( name : Symbol.symbol ) ( domain : sort list ) ( range : sort ) =
+ let res = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.inc_ref ;
+ dec_ref = Z3native.dec_ref } in
+ (z3obj_sno res ctx (Z3native.mk_func_decl (context_gno ctx) (Symbol.gno name) (List.length domain) (sort_lton domain) (Sort.gno range))) ;
+ (z3obj_create res) ;
+ FuncDecl(res)
+
+ let create_pdr ( ctx : context) ( prefix : string ) ( domain : sort list ) ( range : sort ) =
+ let res = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.inc_ref ;
+ dec_ref = Z3native.dec_ref } in
+ (z3obj_sno res ctx (Z3native.mk_fresh_func_decl (context_gno ctx) prefix (List.length domain) (sort_lton domain) (Sort.gno range))) ;
+ (z3obj_create res) ;
+ FuncDecl(res)
+
+ let gc ( x : func_decl ) = match x with FuncDecl(a) -> (z3obj_gc a)
+ let gnc ( x : func_decl ) = match x with FuncDecl(a) -> (z3obj_gnc a)
+ let gno ( x : func_decl ) = match x with FuncDecl(a) -> (z3obj_gno a)
+
+ module Parameter =
+ struct
+ type parameter =
+ | P_Int of int
+ | P_Dbl of float
+ | P_Sym of Symbol.symbol
+ | P_Srt of Sort.sort
+ | P_Ast of AST.ast
+ | P_Fdl of func_decl
+ | P_Rat of string
+
+ let get_kind ( x : parameter ) =
+ (match x with
+ | P_Int(_) -> PARAMETER_INT
+ | P_Dbl(_) -> PARAMETER_DOUBLE
+ | P_Sym(_) -> PARAMETER_SYMBOL
+ | P_Srt(_) -> PARAMETER_SORT
+ | P_Ast(_) -> PARAMETER_AST
+ | P_Fdl(_) -> PARAMETER_FUNC_DECL
+ | P_Rat(_) -> PARAMETER_RATIONAL)
+
+ let get_int ( x : parameter ) =
+ match x with
+ | P_Int(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not an int")
+
+ let get_float ( x : parameter ) =
+ match x with
+ | P_Dbl(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not a float")
+
+ let get_symbol ( x : parameter ) =
+ match x with
+ | P_Sym(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not a symbol")
+
+ let get_sort ( x : parameter ) =
+ match x with
+ | P_Srt(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not a sort")
+
+ let get_ast ( x : parameter ) =
+ match x with
+ | P_Ast(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not an ast")
+
+ let get_func_decl ( x : parameter ) =
+ match x with
+ | P_Fdl(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not a func_decl")
+
+ let get_rational ( x : parameter ) =
+ match x with
+ | P_Rat(x) -> x
+ | _ -> raise (Z3native.Exception "parameter is not a rational string")
+ end
+
+ let mk_func_decl ( ctx : context ) ( name : Symbol.symbol ) ( domain : sort list ) ( range : sort ) =
+ create_ndr ctx name domain range
+
+ let mk_func_decl_s ( ctx : context ) ( name : string ) ( domain : sort list ) ( range : sort ) =
+ mk_func_decl ctx (Symbol.mk_string ctx name) domain range
+
+ let mk_fresh_func_decl ( ctx : context ) ( prefix : string ) ( domain : sort list ) ( range : sort ) =
+ create_pdr ctx prefix domain range
+
+ let mk_const_decl ( ctx : context ) ( name : Symbol.symbol ) ( range : sort ) =
+ create_ndr ctx name [] range
+
+ let mk_const_decl_s ( ctx : context ) ( name : string ) ( range : sort ) =
+ create_ndr ctx (Symbol.mk_string ctx name) [] range
+
+ let mk_fresh_const_decl ( ctx : context ) ( prefix : string ) ( range : sort ) =
+ create_pdr ctx prefix [] range
+
+
+ let equal ( a : func_decl ) ( b : func_decl ) = (a == b) ||
+ if (gnc a) != (gnc b) then
+ false
+ else
+ (Z3native.is_eq_func_decl (gnc a) (gno a) (gno b))
+
+ let to_string ( x : func_decl ) = Z3native.func_decl_to_string (gnc x) (gno x)
+
+ let get_id ( x : func_decl ) = Z3native.get_func_decl_id (gnc x) (gno x)
+
+ let get_arity ( x : func_decl ) = Z3native.get_arity (gnc x) (gno x)
+
+ let get_domain_size ( x : func_decl ) = Z3native.get_domain_size (gnc x) (gno x)
+
+ let get_domain ( x : func_decl ) =
+ let n = (get_domain_size x) in
+ let f i = sort_of_ptr (gc x) (Z3native.get_domain (gnc x) (gno x) i) in
+ mk_list f n
+
+ let get_range ( x : func_decl ) =
+ sort_of_ptr (gc x) (Z3native.get_range (gnc x) (gno x))
+
+ let get_decl_kind ( x : func_decl ) = (decl_kind_of_int (Z3native.get_decl_kind (gnc x) (gno x)))
+
+ let get_name ( x : func_decl ) = (Symbol.create (gc x) (Z3native.get_decl_name (gnc x) (gno x)))
+
+ let get_num_parameters ( x : func_decl ) = (Z3native.get_decl_num_parameters (gnc x) (gno x))
+
+ let get_parameters ( x : func_decl ) =
+ let n = (get_num_parameters x) in
+ let f i = (match (parameter_kind_of_int (Z3native.get_decl_parameter_kind (gnc x) (gno x) i)) with
+ | PARAMETER_INT -> Parameter.P_Int (Z3native.get_decl_int_parameter (gnc x) (gno x) i)
+ | PARAMETER_DOUBLE -> Parameter.P_Dbl (Z3native.get_decl_double_parameter (gnc x) (gno x) i)
+ | PARAMETER_SYMBOL-> Parameter.P_Sym (Symbol.create (gc x) (Z3native.get_decl_symbol_parameter (gnc x) (gno x) i))
+ | PARAMETER_SORT -> Parameter.P_Srt (sort_of_ptr (gc x) (Z3native.get_decl_sort_parameter (gnc x) (gno x) i))
+ | PARAMETER_AST -> Parameter.P_Ast (AST.ast_of_ptr (gc x) (Z3native.get_decl_ast_parameter (gnc x) (gno x) i))
+ | PARAMETER_FUNC_DECL -> Parameter.P_Fdl (func_decl_of_ptr (gc x) (Z3native.get_decl_func_decl_parameter (gnc x) (gno x) i))
+ | PARAMETER_RATIONAL -> Parameter.P_Rat (Z3native.get_decl_rational_parameter (gnc x) (gno x) i)
+ ) in
+ mk_list f n
+
+ let apply ( x : func_decl ) ( args : Expr.expr list ) = Expr.expr_of_func_app (gc x) x args
+end
+
+
+and Params :
+sig
+ type params = z3_native_object
+ module ParamDescrs :
+ sig
+ type param_descrs
+ val param_descrs_of_ptr : context -> Z3native.ptr -> param_descrs
+ val validate : param_descrs -> params -> unit
+ val get_kind : param_descrs -> Symbol.symbol -> Z3enums.param_kind
+ val get_names : param_descrs -> Symbol.symbol list
+ val get_size : param_descrs -> int
+ val to_string : param_descrs -> string
+ end
+ val add_bool : params -> Symbol.symbol -> bool -> unit
+ val add_int : params -> Symbol.symbol -> int -> unit
+ val add_float : params -> Symbol.symbol -> float -> unit
+ val add_symbol : params -> Symbol.symbol -> Symbol.symbol -> unit
+ val mk_params : context -> params
+ val to_string : params -> string
+
+ val update_param_value : context -> string -> string -> unit
+ val set_print_mode : context -> Z3enums.ast_print_mode -> unit
+end = struct
+ type params = z3_native_object
+
+ module ParamDescrs =
+ struct
+ type param_descrs = z3_native_object
+
+ let param_descrs_of_ptr ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : param_descrs = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.param_descrs_inc_ref ;
+ dec_ref = Z3native.param_descrs_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let validate ( x : param_descrs ) ( p : params ) =
+ Z3native.params_validate (z3obj_gnc x) (z3obj_gno p) (z3obj_gno x)
+
+ let get_kind ( x : param_descrs ) ( name : Symbol.symbol ) =
+ (param_kind_of_int (Z3native.param_descrs_get_kind (z3obj_gnc x) (z3obj_gno x) (Symbol.gno name)))
+
+ let get_names ( x : param_descrs ) =
+ let n = Z3native.param_descrs_size (z3obj_gnc x) (z3obj_gno x) in
+ let f i = Symbol.create (z3obj_gc x) (Z3native.param_descrs_get_name (z3obj_gnc x) (z3obj_gno x) i) in
+ mk_list f n
+
+ let get_size ( x : param_descrs ) = Z3native.param_descrs_size (z3obj_gnc x) (z3obj_gno x)
+ let to_string ( x : param_descrs ) = Z3native.param_descrs_to_string (z3obj_gnc x) (z3obj_gno x)
+ end
+
+ let add_bool ( x : params ) ( name : Symbol.symbol ) ( value : bool ) =
+ Z3native.params_set_bool (z3obj_gnc x) (z3obj_gno x) (Symbol.gno name) value
+
+ let add_int ( x : params ) (name : Symbol.symbol ) ( value : int ) =
+ Z3native.params_set_uint (z3obj_gnc x) (z3obj_gno x) (Symbol.gno name) value
+
+ let add_float ( x : params ) ( name : Symbol.symbol ) ( value : float ) =
+ Z3native.params_set_double (z3obj_gnc x) (z3obj_gno x) (Symbol.gno name) value
+
+ let add_symbol ( x : params ) ( name : Symbol.symbol ) ( value : Symbol.symbol ) =
+ Z3native.params_set_symbol (z3obj_gnc x) (z3obj_gno x) (Symbol.gno name) (Symbol.gno value)
+
+ let mk_params ( ctx : context ) =
+ let res : params = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.params_inc_ref ;
+ dec_ref = Z3native.params_dec_ref } in
+ (z3obj_sno res ctx (Z3native.mk_params (context_gno ctx))) ;
+ (z3obj_create res) ;
+ res
+
+ let to_string ( x : params ) = Z3native.params_to_string (z3obj_gnc x) (z3obj_gno x)
+
+ let update_param_value ( ctx : context ) ( id : string) ( value : string )=
+ Z3native.update_param_value (context_gno ctx) id value
+
+ let set_print_mode ( ctx : context ) ( value : ast_print_mode ) =
+ Z3native.set_ast_print_mode (context_gno ctx) (int_of_ast_print_mode value)
+end
+
+(** General expressions (terms) *)
+and Expr :
+sig
+ type expr = Expr of AST.ast
+ val expr_of_ptr : context -> Z3native.ptr -> expr
+ val gc : expr -> context
+ val gnc : expr -> Z3native.ptr
+ val gno : expr -> Z3native.ptr
+ val expr_lton : expr list -> Z3native.ptr array
+ val ast_of_expr : expr -> AST.ast
+ val expr_of_ast : AST.ast -> expr
+ val expr_of_func_app : context -> FuncDecl.func_decl -> expr list -> expr
+ val simplify : expr -> Params.params option -> expr
+ val get_simplify_help : context -> string
+ val get_simplify_parameter_descrs : context -> Params.ParamDescrs.param_descrs
+ val get_func_decl : expr -> FuncDecl.func_decl
+ val get_num_args : expr -> int
+ val get_args : expr -> expr list
+ val update : expr -> expr list -> expr
+ val substitute : expr -> expr list -> expr list -> expr
+ val substitute_one : expr -> expr -> expr -> expr
+ val substitute_vars : expr -> expr list -> expr
+ val translate : expr -> context -> expr
+ val to_string : expr -> string
+ val is_numeral : expr -> bool
+ val is_well_sorted : expr -> bool
+ val get_sort : expr -> Sort.sort
+ val is_const : expr -> bool
+ val mk_const : context -> Symbol.symbol -> Sort.sort -> expr
+ val mk_const_s : context -> string -> Sort.sort -> expr
+ val mk_const_f : context -> FuncDecl.func_decl -> expr
+ val mk_fresh_const : context -> string -> Sort.sort -> expr
+ val mk_app : context -> FuncDecl.func_decl -> expr list -> expr
+ val mk_numeral_string : context -> string -> Sort.sort -> expr
+ val mk_numeral_int : context -> int -> Sort.sort -> expr
+ val equal : expr -> expr -> bool
+ val compare : expr -> expr -> int
+end = struct
+ type expr = Expr of AST.ast
+
+ let gc e = match e with Expr(a) -> (z3obj_gc a)
+ let gnc e = match e with Expr(a) -> (z3obj_gnc a)
+ let gno e = match e with Expr(a) -> (z3obj_gno a)
+
+ let expr_of_ptr : context -> Z3native.ptr -> expr = fun ctx no ->
+ if ast_kind_of_int (Z3native.get_ast_kind (context_gno ctx) no) == QUANTIFIER_AST then
+ Expr(z3_native_object_of_ast_ptr ctx no)
+ else
+ let s = Z3native.get_sort (context_gno ctx) no in
+ let sk = (sort_kind_of_int (Z3native.get_sort_kind (context_gno ctx) s)) in
+ if (Z3native.is_algebraic_number (context_gno ctx) no) then
+ Expr(z3_native_object_of_ast_ptr ctx no)
else
- Stat_float(stats_get_double_value c s i) in
- Hashtbl.add tbl key datum
- done;
- tbl
+ if (Z3native.is_numeral_ast (context_gno ctx) no) then
+ if (sk == INT_SORT || sk == REAL_SORT || sk == BV_SORT ||
+ sk == FLOATING_POINT_SORT || sk == ROUNDING_MODE_SORT) then
+ Expr(z3_native_object_of_ast_ptr ctx no)
+ else
+ raise (Z3native.Exception "Unsupported numeral object")
+ else
+ Expr(z3_native_object_of_ast_ptr ctx no)
+
+ let expr_of_ast a =
+ let q = (Z3enums.ast_kind_of_int (Z3native.get_ast_kind (z3obj_gnc a) (z3obj_gno a))) in
+ if (q != Z3enums.APP_AST && q != VAR_AST && q != QUANTIFIER_AST && q != NUMERAL_AST) then
+ raise (Z3native.Exception "Invalid coercion")
+ else
+ Expr(a)
+
+ let ast_of_expr e = match e with Expr(a) -> a
+
+ let expr_lton ( a : expr list ) =
+ let f ( e : expr ) = match e with Expr(a) -> (AST.ptr_of_ast a) in
+ Array.of_list (List.map f a)
+
+ let expr_of_func_app : context -> FuncDecl.func_decl -> expr list -> expr = fun ctx f args ->
+ match f with FuncDecl.FuncDecl(fa) ->
+ let o = Z3native.mk_app (context_gno ctx) (AST.ptr_of_ast fa) (List.length args) (expr_lton args) in
+ expr_of_ptr ctx o
+
+ let simplify ( x : expr ) ( p : Params.params option ) = match p with
+ | None -> expr_of_ptr (Expr.gc x) (Z3native.simplify (gnc x) (gno x))
+ | Some pp -> expr_of_ptr (Expr.gc x) (Z3native.simplify_ex (gnc x) (gno x) (z3obj_gno pp))
+
+ let get_simplify_help ( ctx : context ) =
+ Z3native.simplify_get_help (context_gno ctx)
+
+ let get_simplify_parameter_descrs ( ctx : context ) =
+ Params.ParamDescrs.param_descrs_of_ptr ctx (Z3native.simplify_get_param_descrs (context_gno ctx))
+ let get_func_decl ( x : expr ) = FuncDecl.func_decl_of_ptr (Expr.gc x) (Z3native.get_app_decl (gnc x) (gno x))
+
+ let get_num_args ( x : expr ) = Z3native.get_app_num_args (gnc x) (gno x)
+
+ let get_args ( x : expr ) = let n = (get_num_args x) in
+ let f i = expr_of_ptr (Expr.gc x) (Z3native.get_app_arg (gnc x) (gno x) i) in
+ mk_list f n
+
+ let update ( x : expr ) ( args : expr list ) =
+ if ((AST.is_app (ast_of_expr x)) && (List.length args <> (get_num_args x))) then
+ raise (Z3native.Exception "Number of arguments does not match")
+ else
+ expr_of_ptr (Expr.gc x) (Z3native.update_term (gnc x) (gno x) (List.length args) (expr_lton args))
+
+ let substitute ( x : expr ) from to_ =
+ if (List.length from) <> (List.length to_) then
+ raise (Z3native.Exception "Argument sizes do not match")
+ else
+ expr_of_ptr (Expr.gc x) (Z3native.substitute (gnc x) (gno x) (List.length from) (expr_lton from) (expr_lton to_))
+
+ let substitute_one ( x : expr ) from to_ =
+ substitute ( x : expr ) [ from ] [ to_ ]
+
+ let substitute_vars ( x : expr ) to_ =
+ expr_of_ptr (Expr.gc x) (Z3native.substitute_vars (gnc x) (gno x) (List.length to_) (expr_lton to_))
+
+ let translate ( x : expr ) to_ctx =
+ if (Expr.gc x) == to_ctx then
+ x
+ else
+ expr_of_ptr to_ctx (Z3native.translate (gnc x) (gno x) (context_gno to_ctx))
+
+ let to_string ( x : expr ) = Z3native.ast_to_string (gnc x) (gno x)
+
+ let is_numeral ( x : expr ) = (Z3native.is_numeral_ast (gnc x) (gno x))
+
+ let is_well_sorted ( x : expr ) = Z3native.is_well_sorted (gnc x) (gno x)
+
+ let get_sort ( x : expr ) = sort_of_ptr (Expr.gc x) (Z3native.get_sort (gnc x) (gno x))
+
+ let is_const ( x : expr ) = (match x with Expr(a) -> (AST.is_app a)) &&
+ (get_num_args x) == 0 &&
+ (FuncDecl.get_domain_size (get_func_decl x)) == 0
+
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) ( range : sort ) =
+ expr_of_ptr ctx (Z3native.mk_const (context_gno ctx) (Symbol.gno name) (Sort.gno range))
+
+ let mk_const_s ( ctx : context ) ( name : string ) ( range : sort ) =
+ mk_const ctx (Symbol.mk_string ctx name) range
+
+ let mk_const_f ( ctx : context ) ( f : FuncDecl.func_decl ) = Expr.expr_of_func_app ctx f []
+
+ let mk_fresh_const ( ctx : context ) ( prefix : string ) ( range : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fresh_const (context_gno ctx) prefix (Sort.gno range))
+
+ let mk_app ( ctx : context ) ( f : FuncDecl.func_decl ) ( args : expr list ) = expr_of_func_app ctx f args
+
+ let mk_numeral_string ( ctx : context ) ( v : string ) ( ty : sort ) =
+ expr_of_ptr ctx (Z3native.mk_numeral (context_gno ctx) v (Sort.gno ty))
+
+ let mk_numeral_int ( ctx : context ) ( v : int ) ( ty : sort ) =
+ expr_of_ptr ctx (Z3native.mk_int (context_gno ctx) v (Sort.gno ty))
+
+ let equal ( a : expr ) ( b : expr ) = AST.equal (ast_of_expr a) (ast_of_expr b)
+
+ let compare a b = AST.compare (ast_of_expr a) (ast_of_expr b)
+end
+
+open FuncDecl
+open Expr
+
+module Boolean =
+struct
+ let mk_sort ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_bool_sort (context_gno ctx)))
+
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) =
+ (Expr.mk_const ctx name (mk_sort ctx))
+
+ let mk_const_s ( ctx : context ) ( name : string ) =
+ mk_const ctx (Symbol.mk_string ctx name)
+
+ let mk_true ( ctx : context ) =
+ expr_of_ptr ctx (Z3native.mk_true (context_gno ctx))
+
+ let mk_false ( ctx : context ) =
+ expr_of_ptr ctx (Z3native.mk_false (context_gno ctx))
+
+ let mk_val ( ctx : context ) ( value : bool ) =
+ if value then mk_true ctx else mk_false ctx
+
+ let mk_not ( ctx : context ) ( a : expr ) =
+ expr_of_ptr ctx (Z3native.mk_not (context_gno ctx) (gno a))
+
+ let mk_ite ( ctx : context ) ( t1 : expr ) ( t2 : expr ) ( t3 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_ite (context_gno ctx) (gno t1) (gno t2) (gno t3))
+
+ let mk_iff ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_iff (context_gno ctx) (gno t1) (gno t2))
+
+ let mk_implies ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_implies (context_gno ctx) (gno t1) (gno t2))
+
+ let mk_xor ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_xor (context_gno ctx) (gno t1) (gno t2))
+
+ let mk_and ( ctx : context ) ( args : expr list ) =
+ let f x = (Expr.gno (x)) in
+ expr_of_ptr ctx (Z3native.mk_and (context_gno ctx) (List.length args) (Array.of_list (List.map f args)))
+
+ let mk_or ( ctx : context ) ( args : expr list ) =
+ let f x = (Expr.gno (x)) in
+ expr_of_ptr ctx (Z3native.mk_or (context_gno ctx) (List.length args) (Array.of_list(List.map f args)))
+
+ let mk_eq ( ctx : context ) ( x : expr ) ( y : expr ) =
+ expr_of_ptr ctx (Z3native.mk_eq (context_gno ctx) (Expr.gno x) (Expr.gno y))
+
+ let mk_distinct ( ctx : context ) ( args : expr list ) =
+ expr_of_ptr ctx (Z3native.mk_distinct (context_gno ctx) (List.length args) (expr_lton args))
+
+ let get_bool_value ( x : expr ) = lbool_of_int (Z3native.get_bool_value (gnc x) (gno x))
+
+ let is_bool ( x : expr ) = (match x with Expr(a) -> (AST.is_expr a)) &&
+ (Z3native.is_eq_sort (gnc x)
+ (Z3native.mk_bool_sort (gnc x))
+ (Z3native.get_sort (gnc x) (gno x)))
+
+ let is_true ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_TRUE)
+ let is_false ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_FALSE)
+ let is_eq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_EQ)
+ let is_distinct ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_DISTINCT)
+ let is_ite ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_ITE)
+ let is_and ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_AND)
+ let is_or ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_OR)
+ let is_iff ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_IFF)
+ let is_xor ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_XOR)
+ let is_not ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_NOT)
+ let is_implies ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (get_func_decl x) == OP_IMPLIES)
+end
+
+
+module Quantifier =
+struct
+ type quantifier = Quantifier of expr
+
+ let expr_of_quantifier e = match e with Quantifier(x) -> x
-
-let _ =
- Printexc.register_printer (function
- | Error(c,e) -> Some ("Z3 "^(get_error_msg c e))
- | _ -> None
- )
-
-
-module V3 = struct
-
-(* File generated from z3V3.idl *)
-
-type symbol
-and literals
-and theory
-and config
-and context
-and sort
-and func_decl
-and ast
-and app
-and pattern
-and model
-and constructor
-and constructor_list
-
-and lbool =
- | L_FALSE
- | L_UNDEF
- | L_TRUE
-
-and symbol_kind =
- | INT_SYMBOL
- | STRING_SYMBOL
-
-and parameter_kind =
- | PARAMETER_INT
- | PARAMETER_DOUBLE
- | PARAMETER_RATIONAL
- | PARAMETER_SYMBOL
- | PARAMETER_SORT
- | PARAMETER_AST
- | PARAMETER_FUNC_DECL
-
-and sort_kind =
- | UNINTERPRETED_SORT
- | BOOL_SORT
- | INT_SORT
- | REAL_SORT
- | BV_SORT
- | ARRAY_SORT
- | DATATYPE_SORT
- | RELATION_SORT
- | FINITE_DOMAIN_SORT
- | UNKNOWN_SORT
-
-and ast_kind =
- | NUMERAL_AST
- | APP_AST
- | VAR_AST
- | QUANTIFIER_AST
- | SORT_AST
- | FUNC_DECL_AST
- | UNKNOWN_AST
-
-and decl_kind =
- | OP_TRUE
- | OP_FALSE
- | OP_EQ
- | OP_DISTINCT
- | OP_ITE
- | OP_AND
- | OP_OR
- | OP_IFF
- | OP_XOR
- | OP_NOT
- | OP_IMPLIES
- | OP_OEQ
- | OP_ANUM
- | OP_AGNUM
- | OP_LE
- | OP_GE
- | OP_LT
- | OP_GT
- | OP_ADD
- | OP_SUB
- | OP_UMINUS
- | OP_MUL
- | OP_DIV
- | OP_IDIV
- | OP_REM
- | OP_MOD
- | OP_TO_REAL
- | OP_TO_INT
- | OP_IS_INT
- | OP_POWER
- | OP_STORE
- | OP_SELECT
- | OP_CONST_ARRAY
- | OP_ARRAY_MAP
- | OP_ARRAY_DEFAULT
- | OP_SET_UNION
- | OP_SET_INTERSECT
- | OP_SET_DIFFERENCE
- | OP_SET_COMPLEMENT
- | OP_SET_SUBSET
- | OP_AS_ARRAY
- | OP_BNUM
- | OP_BIT1
- | OP_BIT0
- | OP_BNEG
- | OP_BADD
- | OP_BSUB
- | OP_BMUL
- | OP_BSDIV
- | OP_BUDIV
- | OP_BSREM
- | OP_BUREM
- | OP_BSMOD
- | OP_BSDIV0
- | OP_BUDIV0
- | OP_BSREM0
- | OP_BUREM0
- | OP_BSMOD0
- | OP_ULEQ
- | OP_SLEQ
- | OP_UGEQ
- | OP_SGEQ
- | OP_ULT
- | OP_SLT
- | OP_UGT
- | OP_SGT
- | OP_BAND
- | OP_BOR
- | OP_BNOT
- | OP_BXOR
- | OP_BNAND
- | OP_BNOR
- | OP_BXNOR
- | OP_CONCAT
- | OP_SIGN_EXT
- | OP_ZERO_EXT
- | OP_EXTRACT
- | OP_REPEAT
- | OP_BREDOR
- | OP_BREDAND
- | OP_BCOMP
- | OP_BSHL
- | OP_BLSHR
- | OP_BASHR
- | OP_ROTATE_LEFT
- | OP_ROTATE_RIGHT
- | OP_EXT_ROTATE_LEFT
- | OP_EXT_ROTATE_RIGHT
- | OP_INT2BV
- | OP_BV2INT
- | OP_CARRY
- | OP_XOR3
- | OP_PR_UNDEF
- | OP_PR_TRUE
- | OP_PR_ASSERTED
- | OP_PR_GOAL
- | OP_PR_MODUS_PONENS
- | OP_PR_REFLEXIVITY
- | OP_PR_SYMMETRY
- | OP_PR_TRANSITIVITY
- | OP_PR_TRANSITIVITY_STAR
- | OP_PR_MONOTONICITY
- | OP_PR_QUANT_INTRO
- | OP_PR_DISTRIBUTIVITY
- | OP_PR_AND_ELIM
- | OP_PR_NOT_OR_ELIM
- | OP_PR_REWRITE
- | OP_PR_REWRITE_STAR
- | OP_PR_PULL_QUANT
- | OP_PR_PULL_QUANT_STAR
- | OP_PR_PUSH_QUANT
- | OP_PR_ELIM_UNUSED_VARS
- | OP_PR_DER
- | OP_PR_QUANT_INST
- | OP_PR_HYPOTHESIS
- | OP_PR_LEMMA
- | OP_PR_UNIT_RESOLUTION
- | OP_PR_IFF_TRUE
- | OP_PR_IFF_FALSE
- | OP_PR_COMMUTATIVITY
- | OP_PR_DEF_AXIOM
- | OP_PR_DEF_INTRO
- | OP_PR_APPLY_DEF
- | OP_PR_IFF_OEQ
- | OP_PR_NNF_POS
- | OP_PR_NNF_NEG
- | OP_PR_NNF_STAR
- | OP_PR_CNF_STAR
- | OP_PR_SKOLEMIZE
- | OP_PR_MODUS_PONENS_OEQ
- | OP_PR_TH_LEMMA
- | OP_PR_HYPER_RESOLVE
- | OP_RA_STORE
- | OP_RA_EMPTY
- | OP_RA_IS_EMPTY
- | OP_RA_JOIN
- | OP_RA_UNION
- | OP_RA_WIDEN
- | OP_RA_PROJECT
- | OP_RA_FILTER
- | OP_RA_NEGATION_FILTER
- | OP_RA_RENAME
- | OP_RA_COMPLEMENT
- | OP_RA_SELECT
- | OP_RA_CLONE
- | OP_FD_LT
- | OP_LABEL
- | OP_LABEL_LIT
- | OP_DT_CONSTRUCTOR
- | OP_DT_RECOGNISER
- | OP_DT_ACCESSOR
- | OP_UNINTERPRETED
-
-and param_kind =
- | PK_UINT
- | PK_BOOL
- | PK_DOUBLE
- | PK_SYMBOL
- | PK_STRING
- | PK_OTHER
- | PK_INVALID
-
-and search_failure =
- | NO_FAILURE
- | UNKNOWN
- | TIMEOUT
- | MEMOUT_WATERMARK
- | CANCELED
- | NUM_CONFLICTS
- | THEORY
- | QUANTIFIERS
-
-and ast_print_mode =
- | PRINT_SMTLIB_FULL
- | PRINT_LOW_LEVEL
- | PRINT_SMTLIB_COMPLIANT
- | PRINT_SMTLIB2_COMPLIANT
-
-
-external global_param_set : string -> string -> unit
- = "camlidl_z3V3_Z3_global_param_set"
-
-external global_param_reset_all : unit -> unit
- = "camlidl_z3V3_Z3_global_param_reset_all"
-
-external global_param_get : string -> string option
- = "camlidl_z3V3_Z3_global_param_get"
-
-external mk_config : unit -> config
- = "camlidl_z3V3_Z3_mk_config"
-
-external del_config : config -> unit
- = "camlidl_z3V3_Z3_del_config"
-
-external set_param_value : config -> string -> string -> unit
- = "camlidl_z3V3_Z3_set_param_value"
-
-external mk_context : config -> context
- = "camlidl_z3V3_Z3_mk_context"
-
-external del_context : context -> unit
- = "camlidl_z3V3_Z3_del_context"
-
-external update_param_value : context -> string -> string -> unit
- = "camlidl_z3V3_Z3_update_param_value"
-
-external get_param_value : context -> string -> string option
- = "camlidl_z3V3_Z3_get_param_value"
-
-external mk_int_symbol : context -> int -> symbol
- = "camlidl_z3V3_Z3_mk_int_symbol"
-
-external mk_string_symbol : context -> string -> symbol
- = "camlidl_z3V3_Z3_mk_string_symbol"
-
-external mk_uninterpreted_sort : context -> symbol -> sort
- = "camlidl_z3V3_Z3_mk_uninterpreted_sort"
-
-external mk_bool_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_bool_sort"
-
-external mk_int_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_int_sort"
-
-external mk_real_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_real_sort"
-
-external mk_bv_sort : context -> int -> sort
- = "camlidl_z3V3_Z3_mk_bv_sort"
-
-external mk_finite_domain_sort : context -> symbol -> int64 -> sort
- = "camlidl_z3V3_Z3_mk_finite_domain_sort"
-
-external mk_array_sort : context -> sort -> sort -> sort
- = "camlidl_z3V3_Z3_mk_array_sort"
-
-external mk_tuple_sort : context -> symbol -> symbol array -> sort array -> sort * func_decl * func_decl array
- = "camlidl_z3V3_Z3_mk_tuple_sort"
-
-external mk_enumeration_sort : context -> symbol -> symbol array -> sort * func_decl array * func_decl array
- = "camlidl_z3V3_Z3_mk_enumeration_sort"
-
-external mk_list_sort : context -> symbol -> sort -> sort * func_decl * func_decl * func_decl * func_decl * func_decl * func_decl
- = "camlidl_z3V3_Z3_mk_list_sort"
-
-external mk_constructor : context -> symbol -> symbol -> symbol array -> sort array -> int array -> constructor
- = "camlidl_z3V3_Z3_mk_constructor_bytecode" "camlidl_z3V3_Z3_mk_constructor"
-
-external del_constructor : context -> constructor -> unit
- = "camlidl_z3V3_Z3_del_constructor"
-
-external mk_datatype : context -> symbol -> constructor array -> sort * constructor array
- = "camlidl_z3V3_Z3_mk_datatype"
-
-external mk_constructor_list : context -> constructor array -> constructor_list
- = "camlidl_z3V3_Z3_mk_constructor_list"
-
-external del_constructor_list : context -> constructor_list -> unit
- = "camlidl_z3V3_Z3_del_constructor_list"
-
-external mk_datatypes : context -> symbol array -> constructor_list array -> sort array * constructor_list array
- = "camlidl_z3V3_Z3_mk_datatypes"
-
-external query_constructor : context -> constructor -> int -> func_decl * func_decl * func_decl array
- = "camlidl_z3V3_Z3_query_constructor"
-
-external mk_func_decl : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_func_decl"
-
-external mk_app : context -> func_decl -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_app"
-
-external mk_const : context -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_mk_const"
-
-external mk_fresh_func_decl : context -> string -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_fresh_func_decl"
-
-external mk_fresh_const : context -> string -> sort -> ast
- = "camlidl_z3V3_Z3_mk_fresh_const"
-
-external mk_true : context -> ast
- = "camlidl_z3V3_Z3_mk_true"
-
-external mk_false : context -> ast
- = "camlidl_z3V3_Z3_mk_false"
-
-external mk_eq : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_eq"
-
-external mk_distinct : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_distinct"
-
-external mk_not : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_not"
-
-external mk_ite : context -> ast -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ite"
-
-external mk_iff : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_iff"
-
-external mk_implies : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_implies"
-
-external mk_xor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_xor"
-
-external mk_and : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_and"
-
-external mk_or : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_or"
-
-external mk_add : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_add"
-
-external mk_mul : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_mul"
-
-external mk_sub : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_sub"
-
-external mk_unary_minus : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_unary_minus"
-
-external mk_div : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_div"
-
-external mk_mod : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_mod"
-
-external mk_rem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rem"
-
-external mk_power : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_power"
-
-external mk_lt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_lt"
-
-external mk_le : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_le"
-
-external mk_gt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_gt"
-
-external mk_ge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ge"
-
-external mk_int2real : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_int2real"
-
-external mk_real2int : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_real2int"
-
-external mk_is_int : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_is_int"
-
-external mk_bvnot : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnot"
-
-external mk_bvredand : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvredand"
-
-external mk_bvredor : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvredor"
-
-external mk_bvand : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvand"
-
-external mk_bvor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvor"
-
-external mk_bvxor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvxor"
-
-external mk_bvnand : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnand"
-
-external mk_bvnor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnor"
-
-external mk_bvxnor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvxnor"
-
-external mk_bvneg : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvneg"
-
-external mk_bvadd : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvadd"
-
-external mk_bvsub : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsub"
-
-external mk_bvmul : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvmul"
-
-external mk_bvudiv : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvudiv"
-
-external mk_bvsdiv : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsdiv"
-
-external mk_bvurem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvurem"
-
-external mk_bvsrem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsrem"
-
-external mk_bvsmod : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsmod"
-
-external mk_bvult : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvult"
-
-external mk_bvslt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvslt"
-
-external mk_bvule : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvule"
-
-external mk_bvsle : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsle"
-
-external mk_bvuge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvuge"
-
-external mk_bvsge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsge"
-
-external mk_bvugt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvugt"
-
-external mk_bvsgt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsgt"
-
-external mk_concat : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_concat"
-
-external mk_extract : context -> int -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_extract"
-
-external mk_sign_ext : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_sign_ext"
-
-external mk_zero_ext : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_zero_ext"
-
-external mk_repeat : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_repeat"
-
-external mk_bvshl : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvshl"
-
-external mk_bvlshr : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvlshr"
-
-external mk_bvashr : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvashr"
-
-external mk_rotate_left : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rotate_left"
-
-external mk_rotate_right : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rotate_right"
-
-external mk_ext_rotate_left : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ext_rotate_left"
-
-external mk_ext_rotate_right : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ext_rotate_right"
-
-external mk_int2bv : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_int2bv"
-
-external mk_bv2int : context -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bv2int"
-
-external mk_bvadd_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvadd_no_overflow"
-
-external mk_bvadd_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvadd_no_underflow"
-
-external mk_bvsub_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsub_no_overflow"
-
-external mk_bvsub_no_underflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvsub_no_underflow"
-
-external mk_bvsdiv_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsdiv_no_overflow"
-
-external mk_bvneg_no_overflow : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvneg_no_overflow"
-
-external mk_bvmul_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvmul_no_overflow"
-
-external mk_bvmul_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvmul_no_underflow"
-
-external mk_select : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_select"
-
-external mk_store : context -> ast -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_store"
-
-external mk_const_array : context -> sort -> ast -> ast
- = "camlidl_z3V3_Z3_mk_const_array"
-
-external mk_map : context -> func_decl -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_map"
-
-external mk_array_default : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_array_default"
-
-external mk_set_sort : context -> sort -> sort
- = "camlidl_z3V3_Z3_mk_set_sort"
-
-external mk_empty_set : context -> sort -> ast
- = "camlidl_z3V3_Z3_mk_empty_set"
-
-external mk_full_set : context -> sort -> ast
- = "camlidl_z3V3_Z3_mk_full_set"
-
-external mk_set_add : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_add"
-
-external mk_set_del : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_del"
-
-external mk_set_union : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_set_union"
-
-external mk_set_intersect : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_set_intersect"
-
-external mk_set_difference : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_difference"
-
-external mk_set_complement : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_complement"
-
-external mk_set_member : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_member"
-
-external mk_set_subset : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_subset"
-
-external mk_numeral : context -> string -> sort -> ast
- = "camlidl_z3V3_Z3_mk_numeral"
-
-external mk_real : context -> int -> int -> ast
- = "camlidl_z3V3_Z3_mk_real"
-
-external mk_int : context -> int -> sort -> ast
- = "camlidl_z3V3_Z3_mk_int"
-
-external mk_int64 : context -> int64 -> sort -> ast
- = "camlidl_z3V3_Z3_mk_int64"
-
-external mk_pattern : context -> ast array -> pattern
- = "camlidl_z3V3_Z3_mk_pattern"
-
-external mk_bound : context -> int -> sort -> ast
- = "camlidl_z3V3_Z3_mk_bound"
-
-external mk_forall : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_forall_bytecode" "camlidl_z3V3_Z3_mk_forall"
-
-external mk_exists : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_exists_bytecode" "camlidl_z3V3_Z3_mk_exists"
-
-external mk_quantifier : context -> bool -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_bytecode" "camlidl_z3V3_Z3_mk_quantifier"
-
-external mk_quantifier_ex : context -> bool -> int -> symbol -> symbol -> pattern array -> ast array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_ex_bytecode" "camlidl_z3V3_Z3_mk_quantifier_ex"
-
-external mk_forall_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_forall_const"
-
-external mk_exists_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_exists_const"
-
-external mk_quantifier_const : context -> bool -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_const_bytecode" "camlidl_z3V3_Z3_mk_quantifier_const"
-
-external mk_quantifier_const_ex : context -> bool -> int -> symbol -> symbol -> app array -> pattern array -> ast array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_const_ex_bytecode" "camlidl_z3V3_Z3_mk_quantifier_const_ex"
-
-external get_symbol_kind : context -> symbol -> symbol_kind
- = "camlidl_z3V3_Z3_get_symbol_kind"
-
-external get_symbol_int : context -> symbol -> int
- = "camlidl_z3V3_Z3_get_symbol_int"
-
-external get_symbol_string : context -> symbol -> string
- = "camlidl_z3V3_Z3_get_symbol_string"
-
-external get_sort_name : context -> sort -> symbol
- = "camlidl_z3V3_Z3_get_sort_name"
-
-external get_sort_id : context -> sort -> int
- = "camlidl_z3V3_Z3_get_sort_id"
-
-external sort_to_ast : context -> sort -> ast
- = "camlidl_z3V3_Z3_sort_to_ast"
-
-external is_eq_sort : context -> sort -> sort -> bool
- = "camlidl_z3V3_Z3_is_eq_sort"
-
-external get_sort_kind : context -> sort -> sort_kind
- = "camlidl_z3V3_Z3_get_sort_kind"
-
-external get_bv_sort_size : context -> sort -> int
- = "camlidl_z3V3_Z3_get_bv_sort_size"
-
-external get_finite_domain_sort_size : context -> sort -> int64 option
- = "camlidl_z3V3_Z3_get_finite_domain_sort_size"
-
-external get_array_sort_domain : context -> sort -> sort
- = "camlidl_z3V3_Z3_get_array_sort_domain"
-
-external get_array_sort_range : context -> sort -> sort
- = "camlidl_z3V3_Z3_get_array_sort_range"
-
-external get_tuple_sort_mk_decl : context -> sort -> func_decl
- = "camlidl_z3V3_Z3_get_tuple_sort_mk_decl"
-
-external get_tuple_sort_num_fields : context -> sort -> int
- = "camlidl_z3V3_Z3_get_tuple_sort_num_fields"
-
-external get_tuple_sort_field_decl : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_tuple_sort_field_decl"
-
-external get_datatype_sort_num_constructors : context -> sort -> int
- = "camlidl_z3V3_Z3_get_datatype_sort_num_constructors"
-
-external get_datatype_sort_constructor : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_constructor"
-
-external get_datatype_sort_recognizer : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_recognizer"
-
-external get_datatype_sort_constructor_accessor : context -> sort -> int -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_constructor_accessor"
-
-external get_relation_arity : context -> sort -> int
- = "camlidl_z3V3_Z3_get_relation_arity"
-
-external get_relation_column : context -> sort -> int -> sort
- = "camlidl_z3V3_Z3_get_relation_column"
-
-external func_decl_to_ast : context -> func_decl -> ast
- = "camlidl_z3V3_Z3_func_decl_to_ast"
-
-external is_eq_func_decl : context -> func_decl -> func_decl -> bool
- = "camlidl_z3V3_Z3_is_eq_func_decl"
-
-external get_func_decl_id : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_func_decl_id"
-
-external get_decl_name : context -> func_decl -> symbol
- = "camlidl_z3V3_Z3_get_decl_name"
-
-external get_decl_kind : context -> func_decl -> decl_kind
- = "camlidl_z3V3_Z3_get_decl_kind"
-
-external get_domain_size : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_domain_size"
-
-external get_arity : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_arity"
-
-external get_domain : context -> func_decl -> int -> sort
- = "camlidl_z3V3_Z3_get_domain"
-
-external get_range : context -> func_decl -> sort
- = "camlidl_z3V3_Z3_get_range"
-
-external get_decl_num_parameters : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_decl_num_parameters"
-
-external get_decl_parameter_kind : context -> func_decl -> int -> parameter_kind
- = "camlidl_z3V3_Z3_get_decl_parameter_kind"
-
-external get_decl_int_parameter : context -> func_decl -> int -> int
- = "camlidl_z3V3_Z3_get_decl_int_parameter"
-
-external get_decl_double_parameter : context -> func_decl -> int -> float
- = "camlidl_z3V3_Z3_get_decl_double_parameter"
-
-external get_decl_symbol_parameter : context -> func_decl -> int -> symbol
- = "camlidl_z3V3_Z3_get_decl_symbol_parameter"
-
-external get_decl_sort_parameter : context -> func_decl -> int -> sort
- = "camlidl_z3V3_Z3_get_decl_sort_parameter"
-
-external get_decl_ast_parameter : context -> func_decl -> int -> ast
- = "camlidl_z3V3_Z3_get_decl_ast_parameter"
-
-external get_decl_func_decl_parameter : context -> func_decl -> int -> func_decl
- = "camlidl_z3V3_Z3_get_decl_func_decl_parameter"
-
-external get_decl_rational_parameter : context -> func_decl -> int -> string
- = "camlidl_z3V3_Z3_get_decl_rational_parameter"
-
-external app_to_ast : context -> app -> ast
- = "camlidl_z3V3_Z3_app_to_ast"
-
-external get_app_decl : context -> app -> func_decl
- = "camlidl_z3V3_Z3_get_app_decl"
-
-external get_app_num_args : context -> app -> int
- = "camlidl_z3V3_Z3_get_app_num_args"
-
-external get_app_arg : context -> app -> int -> ast
- = "camlidl_z3V3_Z3_get_app_arg"
-
-external is_eq_ast : context -> ast -> ast -> bool
- = "camlidl_z3V3_Z3_is_eq_ast"
-
-external get_ast_id : context -> ast -> int
- = "camlidl_z3V3_Z3_get_ast_id"
-
-external get_ast_hash : context -> ast -> int
- = "camlidl_z3V3_Z3_get_ast_hash"
-
-external get_sort : context -> ast -> sort
- = "camlidl_z3V3_Z3_get_sort"
-
-external is_well_sorted : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_well_sorted"
-
-external get_bool_value : context -> ast -> lbool
- = "camlidl_z3V3_Z3_get_bool_value"
-
-external get_ast_kind : context -> ast -> ast_kind
- = "camlidl_z3V3_Z3_get_ast_kind"
-
-external is_app : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_app"
-
-external is_numeral_ast : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_numeral_ast"
-
-external is_algebraic_number : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_algebraic_number"
-
-external to_app : context -> ast -> app
- = "camlidl_z3V3_Z3_to_app"
-
-external to_func_decl : context -> ast -> func_decl
- = "camlidl_z3V3_Z3_to_func_decl"
-
-external get_numeral_string : context -> ast -> string
- = "camlidl_z3V3_Z3_get_numeral_string"
-
-external get_numeral_decimal_string : context -> ast -> int -> string
- = "camlidl_z3V3_Z3_get_numeral_decimal_string"
-
-external get_numerator : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_numerator"
-
-external get_denominator : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_denominator"
-
-external get_numeral_small : context -> ast -> bool * int64 * int64
- = "camlidl_z3V3_Z3_get_numeral_small"
-
-external get_numeral_int : context -> ast -> bool * int
- = "camlidl_z3V3_Z3_get_numeral_int"
-
-external get_numeral_int64 : context -> ast -> bool * int64
- = "camlidl_z3V3_Z3_get_numeral_int64"
-
-external get_numeral_rational_int64 : context -> ast -> bool * int64 * int64
- = "camlidl_z3V3_Z3_get_numeral_rational_int64"
-
-external get_algebraic_number_lower : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_algebraic_number_lower"
-
-external get_algebraic_number_upper : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_algebraic_number_upper"
-
-external pattern_to_ast : context -> pattern -> ast
- = "camlidl_z3V3_Z3_pattern_to_ast"
-
-external get_pattern_num_terms : context -> pattern -> int
- = "camlidl_z3V3_Z3_get_pattern_num_terms"
-
-external get_pattern : context -> pattern -> int -> ast
- = "camlidl_z3V3_Z3_get_pattern"
-
-external get_index_value : context -> ast -> int
- = "camlidl_z3V3_Z3_get_index_value"
-
-external is_quantifier_forall : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_quantifier_forall"
-
-external get_quantifier_weight : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_weight"
-
-external get_quantifier_num_patterns : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_patterns"
-
-external get_quantifier_pattern_ast : context -> ast -> int -> pattern
- = "camlidl_z3V3_Z3_get_quantifier_pattern_ast"
-
-external get_quantifier_num_no_patterns : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_no_patterns"
-
-external get_quantifier_no_pattern_ast : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_quantifier_no_pattern_ast"
-
-external get_quantifier_num_bound : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_bound"
-
-external get_quantifier_bound_name : context -> ast -> int -> symbol
- = "camlidl_z3V3_Z3_get_quantifier_bound_name"
-
-external get_quantifier_bound_sort : context -> ast -> int -> sort
- = "camlidl_z3V3_Z3_get_quantifier_bound_sort"
-
-external get_quantifier_body : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_quantifier_body"
-
-external simplify : context -> ast -> ast
- = "camlidl_z3V3_Z3_simplify"
-
-external update_term : context -> ast -> ast array -> ast
- = "camlidl_z3V3_Z3_update_term"
-
-external substitute : context -> ast -> ast array -> ast array -> ast
- = "camlidl_z3V3_Z3_substitute"
-
-external substitute_vars : context -> ast -> ast array -> ast
- = "camlidl_z3V3_Z3_substitute_vars"
-
-external open_log : string -> bool
- = "camlidl_z3V3_Z3_open_log"
-
-external append_log : string -> unit
- = "camlidl_z3V3_Z3_append_log"
-
-external close_log : unit -> unit
- = "camlidl_z3V3_Z3_close_log"
-
-external toggle_warning_messages : bool -> unit
- = "camlidl_z3V3_Z3_toggle_warning_messages"
-
-external set_ast_print_mode : context -> ast_print_mode -> unit
- = "camlidl_z3V3_Z3_set_ast_print_mode"
-
-external ast_to_string : context -> ast -> string
- = "camlidl_z3V3_Z3_ast_to_string"
-
-external pattern_to_string : context -> pattern -> string
- = "camlidl_z3V3_Z3_pattern_to_string"
-
-external sort_to_string : context -> sort -> string
- = "camlidl_z3V3_Z3_sort_to_string"
-
-external func_decl_to_string : context -> func_decl -> string
- = "camlidl_z3V3_Z3_func_decl_to_string"
-
-external model_to_string : context -> model -> string
- = "camlidl_z3V3_Z3_model_to_string"
-
-external benchmark_to_smtlib_string : context -> string -> string -> string -> string -> ast array -> ast -> string
- = "camlidl_z3V3_Z3_benchmark_to_smtlib_string_bytecode" "camlidl_z3V3_Z3_benchmark_to_smtlib_string"
-
-external parse_smtlib2_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3V3_Z3_parse_smtlib2_string_bytecode" "camlidl_z3V3_Z3_parse_smtlib2_string"
-
-external parse_smtlib2_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3V3_Z3_parse_smtlib2_file_bytecode" "camlidl_z3V3_Z3_parse_smtlib2_file"
-
-external parse_smtlib_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3V3_Z3_parse_smtlib_string_bytecode" "camlidl_z3V3_Z3_parse_smtlib_string"
-
-external parse_smtlib_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3V3_Z3_parse_smtlib_file_bytecode" "camlidl_z3V3_Z3_parse_smtlib_file"
-
-external get_smtlib_num_formulas : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_formulas"
-
-external get_smtlib_formula : context -> int -> ast
- = "camlidl_z3V3_Z3_get_smtlib_formula"
-
-external get_smtlib_num_assumptions : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_assumptions"
-
-external get_smtlib_assumption : context -> int -> ast
- = "camlidl_z3V3_Z3_get_smtlib_assumption"
-
-external get_smtlib_num_decls : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_decls"
-
-external get_smtlib_decl : context -> int -> func_decl
- = "camlidl_z3V3_Z3_get_smtlib_decl"
-
-external get_smtlib_num_sorts : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_sorts"
-
-external get_smtlib_sort : context -> int -> sort
- = "camlidl_z3V3_Z3_get_smtlib_sort"
-
-external get_smtlib_error : context -> string
- = "camlidl_z3V3_Z3_get_smtlib_error"
-
-external get_version : unit -> int * int * int * int
- = "camlidl_z3V3_Z3_get_version"
-
-external enable_trace : string -> unit
- = "camlidl_z3V3_Z3_enable_trace"
-
-external disable_trace : string -> unit
- = "camlidl_z3V3_Z3_disable_trace"
-
-external reset_memory : unit -> unit
- = "camlidl_z3V3_Z3_reset_memory"
-
-external theory_mk_sort : context -> theory -> symbol -> sort
- = "camlidl_z3V3_Z3_theory_mk_sort"
-
-external theory_mk_value : context -> theory -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_theory_mk_value"
-
-external theory_mk_constant : context -> theory -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_theory_mk_constant"
-
-external theory_mk_func_decl : context -> theory -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_theory_mk_func_decl"
-
-external theory_get_context : theory -> context
- = "camlidl_z3V3_Z3_theory_get_context"
-
-external theory_assert_axiom : theory -> ast -> unit
- = "camlidl_z3V3_Z3_theory_assert_axiom"
-
-external theory_assume_eq : theory -> ast -> ast -> unit
- = "camlidl_z3V3_Z3_theory_assume_eq"
-
-external theory_enable_axiom_simplification : theory -> bool -> unit
- = "camlidl_z3V3_Z3_theory_enable_axiom_simplification"
-
-external theory_get_eqc_root : theory -> ast -> ast
- = "camlidl_z3V3_Z3_theory_get_eqc_root"
-
-external theory_get_eqc_next : theory -> ast -> ast
- = "camlidl_z3V3_Z3_theory_get_eqc_next"
-
-external theory_get_num_parents : theory -> ast -> int
- = "camlidl_z3V3_Z3_theory_get_num_parents"
-
-external theory_get_parent : theory -> ast -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_parent"
-
-external theory_is_value : theory -> ast -> bool
- = "camlidl_z3V3_Z3_theory_is_value"
-
-external theory_is_decl : theory -> func_decl -> bool
- = "camlidl_z3V3_Z3_theory_is_decl"
-
-external theory_get_num_elems : theory -> int
- = "camlidl_z3V3_Z3_theory_get_num_elems"
-
-external theory_get_elem : theory -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_elem"
-
-external theory_get_num_apps : theory -> int
- = "camlidl_z3V3_Z3_theory_get_num_apps"
-
-external theory_get_app : theory -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_app"
-
-external mk_injective_function : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_injective_function"
-
-external set_logic : context -> string -> bool
- = "camlidl_z3V3_Z3_set_logic"
-
-external push : context -> unit
- = "camlidl_z3V3_Z3_push"
-
-external pop : context -> int -> unit
- = "camlidl_z3V3_Z3_pop"
-
-external get_num_scopes : context -> int
- = "camlidl_z3V3_Z3_get_num_scopes"
-
-external persist_ast : context -> ast -> int -> unit
- = "camlidl_z3V3_Z3_persist_ast"
-
-external assert_cnstr : context -> ast -> unit
- = "camlidl_z3V3_Z3_assert_cnstr"
-
-external check_and_get_model : context -> lbool * model
- = "camlidl_z3V3_Z3_check_and_get_model"
-
-external check : context -> lbool
- = "camlidl_z3V3_Z3_check"
-
-external check_assumptions : context -> ast array -> int -> ast array -> lbool * model * ast * int * ast array
- = "camlidl_z3V3_Z3_check_assumptions"
-
-external del_model : context -> model -> unit
- = "camlidl_z3V3_Z3_del_model"
-
-external soft_check_cancel : context -> unit
- = "camlidl_z3V3_Z3_soft_check_cancel"
-
-external get_search_failure : context -> search_failure
- = "camlidl_z3V3_Z3_get_search_failure"
-
-external mk_label : context -> symbol -> bool -> ast -> ast
- = "camlidl_z3V3_Z3_mk_label"
-
-external get_relevant_labels : context -> literals
- = "camlidl_z3V3_Z3_get_relevant_labels"
-
-external get_relevant_literals : context -> literals
- = "camlidl_z3V3_Z3_get_relevant_literals"
-
-external get_guessed_literals : context -> literals
- = "camlidl_z3V3_Z3_get_guessed_literals"
-
-external del_literals : context -> literals -> unit
- = "camlidl_z3V3_Z3_del_literals"
-
-external get_num_literals : context -> literals -> int
- = "camlidl_z3V3_Z3_get_num_literals"
-
-external get_label_symbol : context -> literals -> int -> symbol
- = "camlidl_z3V3_Z3_get_label_symbol"
-
-external get_literal : context -> literals -> int -> ast
- = "camlidl_z3V3_Z3_get_literal"
-
-external disable_literal : context -> literals -> int -> unit
- = "camlidl_z3V3_Z3_disable_literal"
-
-external block_literals : context -> literals -> unit
- = "camlidl_z3V3_Z3_block_literals"
-
-external get_model_num_constants : context -> model -> int
- = "camlidl_z3V3_Z3_get_model_num_constants"
-
-external get_model_constant : context -> model -> int -> func_decl
- = "camlidl_z3V3_Z3_get_model_constant"
-
-external get_model_num_funcs : context -> model -> int
- = "camlidl_z3V3_Z3_get_model_num_funcs"
-
-external get_model_func_decl : context -> model -> int -> func_decl
- = "camlidl_z3V3_Z3_get_model_func_decl"
-
-external eval_func_decl : context -> model -> func_decl -> bool * ast
- = "camlidl_z3V3_Z3_eval_func_decl"
-
-external is_array_value : context -> model -> ast -> bool * int
- = "camlidl_z3V3_Z3_is_array_value"
-
-external get_array_value : context -> model -> ast -> ast array -> ast array -> ast array * ast array * ast
- = "camlidl_z3V3_Z3_get_array_value"
-
-external get_model_func_else : context -> model -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_else"
-
-external get_model_func_num_entries : context -> model -> int -> int
- = "camlidl_z3V3_Z3_get_model_func_num_entries"
-
-external get_model_func_entry_num_args : context -> model -> int -> int -> int
- = "camlidl_z3V3_Z3_get_model_func_entry_num_args"
-
-external get_model_func_entry_arg : context -> model -> int -> int -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_entry_arg"
-
-external get_model_func_entry_value : context -> model -> int -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_entry_value"
-
-external eval : context -> model -> ast -> bool * ast
- = "camlidl_z3V3_Z3_eval"
-
-external eval_decl : context -> model -> func_decl -> ast array -> bool * ast
- = "camlidl_z3V3_Z3_eval_decl"
-
-external context_to_string : context -> string
- = "camlidl_z3V3_Z3_context_to_string"
-
-external statistics_to_string : context -> string
- = "camlidl_z3V3_Z3_statistics_to_string"
-
-external get_context_assignment : context -> ast
- = "camlidl_z3V3_Z3_get_context_assignment"
-
-
-(* Internal auxillary functions: *)
-(* Transform a pair of arrays into an array of pairs *)
-let array_combine a b =
- if Array.length a <> Array.length b then raise (Invalid_argument "array_combine");
- Array.init (Array.length a) (fun i->(a.(i),b.(i)));;
-(* [a |> b] is the pipeline operator for [b(a)] *)
-let ( |> ) x f = f x;;
-(* Extensions, except for refinement: *)
-let mk_context_x configs =
- let config = mk_config() in
- let f(param_id,param_value) = set_param_value config param_id param_value in
- Array.iter f configs;
- let context = mk_context config in
- del_config config;
- context;;
-let get_app_args c a =
- Array.init (get_app_num_args c a) (get_app_arg c a);;
-let get_domains c d =
- Array.init (get_domain_size c d) (get_domain c d);;
-let get_array_sort c t = (get_array_sort_domain c t, get_array_sort_range c t);;
-let get_tuple_sort c ty =
- (get_tuple_sort_mk_decl c ty,
- Array.init (get_tuple_sort_num_fields c ty) (get_tuple_sort_field_decl c ty));;
-type datatype_constructor_refined = {
- constructor : func_decl;
- recognizer : func_decl;
- accessors : func_decl array
-}
-let get_datatype_sort c ty =
- Array.init (get_datatype_sort_num_constructors c ty)
- (fun idx_c ->
- let constr = get_datatype_sort_constructor c ty idx_c in
- let recog = get_datatype_sort_recognizer c ty idx_c in
- let num_acc = get_domain_size c constr in
- { constructor = constr;
- recognizer = recog;
- accessors = Array.init num_acc (get_datatype_sort_constructor_accessor c ty idx_c);
- })
-let get_model_constants c m =
- Array.init (get_model_num_constants c m) (get_model_constant c m);;
-let get_model_func_entry c m i j =
- (Array.init
- (get_model_func_entry_num_args c m i j)
- (get_model_func_entry_arg c m i j),
- get_model_func_entry_value c m i j);;
-let get_model_func_entries c m i =
- Array.init (get_model_func_num_entries c m i) (get_model_func_entry c m i);;
-let get_model_funcs c m =
- Array.init (get_model_num_funcs c m)
- (fun i->(get_model_func_decl c m i |> get_decl_name c,
- get_model_func_entries c m i,
- get_model_func_else c m i));;
-let get_smtlib_formulas c =
- Array.init (get_smtlib_num_formulas c) (get_smtlib_formula c);;
-let get_smtlib_assumptions c =
- Array.init (get_smtlib_num_assumptions c) (get_smtlib_assumption c);;
-let get_smtlib_decls c =
- Array.init (get_smtlib_num_decls c) (get_smtlib_decl c);;
-let get_smtlib_parse_results c =
- (get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c);;
-let parse_smtlib_string_formula c a1 a2 a3 a4 a5 =
- (parse_smtlib_string c a1 a2 a3 a4 a5;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith "Z3: parse_smtlib_string_formula");;
-let parse_smtlib_file_formula c a1 a2 a3 a4 a5 =
- (parse_smtlib_file c a1 a2 a3 a4 a5;
- match get_smtlib_formulas c with [|f|] -> f | _ -> failwith "Z3: parse_smtlib_file_formula");;
-let parse_smtlib_string_x c a1 a2 a3 a4 a5 =
- (parse_smtlib_string c a1 a2 a3 a4 a5; get_smtlib_parse_results c);;
-let parse_smtlib_file_x c a1 a2 a3 a4 a5 =
- (parse_smtlib_file c a1 a2 a3 a4 a5; get_smtlib_parse_results c);;
-(* Refinement: *)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
- | Symbol_unknown;;
-let symbol_refine c s =
- match get_symbol_kind c s with
- | INT_SYMBOL -> Symbol_int (get_symbol_int c s)
- | STRING_SYMBOL -> Symbol_string (get_symbol_string c s);;
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_real
- | Sort_bv of int
- | Sort_array of (sort * sort)
- | Sort_datatype of datatype_constructor_refined array
- | Sort_relation
- | Sort_finite_domain
- | Sort_unknown of symbol;;
-let sort_refine c ty =
- match get_sort_kind c ty with
- | UNINTERPRETED_SORT -> Sort_uninterpreted (get_sort_name c ty)
- | BOOL_SORT -> Sort_bool
- | INT_SORT -> Sort_int
- | REAL_SORT -> Sort_real
- | BV_SORT -> Sort_bv (get_bv_sort_size c ty)
- | ARRAY_SORT -> Sort_array (get_array_sort_domain c ty, get_array_sort_range c ty)
- | DATATYPE_SORT -> Sort_datatype (get_datatype_sort c ty)
- | RELATION_SORT -> Sort_relation
- | FINITE_DOMAIN_SORT -> Sort_finite_domain
- | UNKNOWN_SORT -> Sort_unknown (get_sort_name c ty);;
-let get_pattern_terms c p =
- Array.init (get_pattern_num_terms c p) (get_pattern c p)
-type binder_type = | Forall | Exists
-type numeral_refined =
- | Numeral_small of int64 * int64
- | Numeral_large of string
-type term_refined =
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol *sort) array * ast
- | Term_numeral of numeral_refined * sort
- | Term_var of int * sort
-let term_refine c t =
- match get_ast_kind c t with
- | NUMERAL_AST ->
- let (is_small, n, d) = get_numeral_small c t in
- if is_small then
- Term_numeral(Numeral_small(n,d), get_sort c t)
+ let quantifier_of_expr e =
+ match e with Expr.Expr(a) ->
+ let q = (Z3enums.ast_kind_of_int (Z3native.get_ast_kind (z3obj_gnc a) (z3obj_gno a))) in
+ if (q != Z3enums.QUANTIFIER_AST) then
+ raise (Z3native.Exception "Invalid coercion")
else
- Term_numeral(Numeral_large(get_numeral_string c t), get_sort c t)
- | APP_AST ->
- let t' = to_app c t in
- let f = get_app_decl c t' in
- let num_args = get_app_num_args c t' in
- let args = Array.init num_args (get_app_arg c t') in
- let k = get_decl_kind c f in
- Term_app (k, f, args)
- | QUANTIFIER_AST ->
- let bt = if is_quantifier_forall c t then Forall else Exists in
- let w = get_quantifier_weight c t in
- let np = get_quantifier_num_patterns c t in
- let pats = Array.init np (get_quantifier_pattern_ast c t) in
- let pats = Array.map (get_pattern_terms c) pats in
- let nb = get_quantifier_num_bound c t in
- let bound = Array.init nb
- (fun i -> (get_quantifier_bound_name c t i, get_quantifier_bound_sort c t i)) in
- let body = get_quantifier_body c t in
- Term_quantifier(bt, w, pats, bound, body)
- | VAR_AST ->
- Term_var(get_index_value c t, get_sort c t)
- | _ -> assert false
-type theory_callbacks =
- {
- mutable delete_theory : unit -> unit;
- mutable reduce_eq : ast -> ast -> ast option;
- mutable reduce_app : func_decl -> ast array -> ast option;
- mutable reduce_distinct : ast array -> ast option;
- mutable final_check : unit -> bool;
- mutable new_app : ast -> unit;
- mutable new_elem : ast -> unit;
- mutable init_search: unit -> unit;
- mutable push: unit -> unit;
- mutable pop: unit -> unit;
- mutable restart : unit -> unit;
- mutable reset: unit -> unit;
- mutable new_eq : ast -> ast -> unit;
- mutable new_diseq : ast -> ast -> unit;
- mutable new_assignment: ast -> bool -> unit;
- mutable new_relevant : ast -> unit;
- }
-let mk_theory_callbacks() =
- {
- delete_theory = (fun () -> ());
- reduce_eq = (fun _ _ -> None);
- reduce_app = (fun _ _ -> None);
- reduce_distinct = (fun _ -> None);
- final_check = (fun _ -> true);
- new_app = (fun _ -> ());
- new_elem = (fun _ -> ());
- init_search= (fun () -> ());
- push= (fun () -> ());
- pop= (fun () -> ());
- restart = (fun () -> ());
- reset= (fun () -> ());
- new_eq = (fun _ _ -> ());
- new_diseq = (fun _ _ -> ());
- new_assignment = (fun _ _ -> ());
- new_relevant = (fun _ -> ());
- }
-external get_theory_callbacks : theory -> theory_callbacks = "get_theory_callbacks"
-external mk_theory_register : context -> string -> theory_callbacks -> theory = "mk_theory_register"
-external set_delete_callback_register : theory -> unit = "set_delete_callback_register"
-external set_reduce_app_callback_register : theory -> unit = "set_reduce_app_callback_register"
-external set_reduce_eq_callback_register : theory -> unit = "set_reduce_eq_callback_register"
-external set_reduce_distinct_callback_register : theory -> unit = "set_reduce_distinct_callback_register"
-external set_new_app_callback_register : theory -> unit = "set_new_app_callback_register"
-external set_new_elem_callback_register : theory -> unit = "set_new_elem_callback_register"
-external set_init_search_callback_register : theory -> unit = "set_init_search_callback_register"
-external set_push_callback_register : theory -> unit = "set_push_callback_register"
-external set_pop_callback_register : theory -> unit = "set_pop_callback_register"
-external set_restart_callback_register : theory -> unit = "set_restart_callback_register"
-external set_reset_callback_register : theory -> unit = "set_reset_callback_register"
-external set_final_check_callback_register : theory -> unit = "set_final_check_callback_register"
-external set_new_eq_callback_register : theory -> unit = "set_new_eq_callback_register"
-external set_new_diseq_callback_register : theory -> unit = "set_new_diseq_callback_register"
-external set_new_assignment_callback_register : theory -> unit = "set_new_assignment_callback_register"
-external set_new_relevant_callback_register : theory -> unit = "set_new_relevant_callback_register"
-let is_some opt =
- match opt with
- | Some v -> true
- | None -> false
-let get_some opt =
- match opt with
- | Some v -> v
- | None -> failwith "None unexpected"
-let apply_delete (th:theory_callbacks) = th.delete_theory ()
-let set_delete_callback th cb =
- let cbs = get_theory_callbacks th in
- cbs.delete_theory <- cb;
- set_delete_callback_register th
-let mk_theory context name =
- Callback.register "is_some" is_some;
- Callback.register "get_some" get_some;
- Callback.register "apply_delete" apply_delete;
- let cbs = mk_theory_callbacks() in
- mk_theory_register context name cbs
-let apply_reduce_app (th:theory_callbacks) f args = th.reduce_app f args
-let set_reduce_app_callback th cb =
- Callback.register "apply_reduce_app" apply_reduce_app;
- let cbs = get_theory_callbacks th in
- cbs.reduce_app <- cb;
- set_reduce_app_callback_register th
-let apply_reduce_eq (th:theory_callbacks) a b = th.reduce_eq a b
-let set_reduce_eq_callback th cb =
- Callback.register "apply_reduce_eq" apply_reduce_eq;
- let cbs = get_theory_callbacks th in
- cbs.reduce_eq <- cb;
- set_reduce_eq_callback_register th
-let apply_reduce_distinct (th:theory_callbacks) args = th.reduce_distinct args
-let set_reduce_distinct_callback th cb =
- Callback.register "apply_reduce_distinct" apply_reduce_distinct;
- let cbs = get_theory_callbacks th in
- cbs.reduce_distinct <- cb;
- set_reduce_distinct_callback_register th
-let apply_new_app (th:theory_callbacks) a = th.new_app a
-let set_new_app_callback th cb =
- Callback.register "apply_new_app" apply_new_app;
- let cbs = get_theory_callbacks th in
- cbs.new_app <- cb;
- set_new_app_callback_register th
-let apply_new_elem (th:theory_callbacks) a = th.new_elem a
-let set_new_elem_callback th cb =
- Callback.register "apply_new_elem" apply_new_elem;
- let cbs = get_theory_callbacks th in
- cbs.new_elem <- cb;
- set_new_elem_callback_register th
-let apply_init_search (th:theory_callbacks) = th.init_search()
-let set_init_search_callback th cb =
- Callback.register "apply_init_search" apply_init_search;
- let cbs = get_theory_callbacks th in
- cbs.init_search <- cb;
- set_init_search_callback_register th
-let apply_push (th:theory_callbacks) = th.push()
-let set_push_callback th cb =
- Callback.register "apply_push" apply_push;
- let cbs = get_theory_callbacks th in
- cbs.push <- cb;
- set_push_callback_register th
-let apply_pop (th:theory_callbacks) = th.pop()
-let set_pop_callback th cb =
- Callback.register "apply_pop" apply_pop;
- let cbs = get_theory_callbacks th in
- cbs.pop <- cb;
- set_pop_callback_register th
-let apply_restart (th:theory_callbacks) = th.restart()
-let set_restart_callback th cb =
- Callback.register "apply_restart" apply_restart;
- let cbs = get_theory_callbacks th in
- cbs.restart <- cb;
- set_restart_callback_register th
-let apply_reset (th:theory_callbacks) = th.reset()
-let set_reset_callback th cb =
- Callback.register "apply_reset" apply_reset;
- let cbs = get_theory_callbacks th in
- cbs.reset <- cb;
- set_reset_callback_register th
-let apply_final_check (th:theory_callbacks) = th.final_check()
-let set_final_check_callback th cb =
- Callback.register "apply_final_check" apply_final_check;
- let cbs = get_theory_callbacks th in
- cbs.final_check <- cb;
- set_final_check_callback_register th
-let apply_new_eq (th:theory_callbacks) a b = th.new_eq a b
-let set_new_eq_callback th cb =
- Callback.register "apply_new_eq" apply_new_eq;
- let cbs = get_theory_callbacks th in
- cbs.new_eq <- cb;
- set_new_eq_callback_register th
-let apply_new_diseq (th:theory_callbacks) a b = th.new_diseq a b
-let set_new_diseq_callback th cb =
- Callback.register "apply_new_diseq" apply_new_diseq;
- let cbs = get_theory_callbacks th in
- cbs.new_diseq <- cb;
- set_new_diseq_callback_register th
-let apply_new_assignment (th:theory_callbacks) a b = th.new_assignment a b
-let set_new_assignment_callback th cb =
- Callback.register "apply_new_assignment" apply_new_assignment;
- let cbs = get_theory_callbacks th in
- cbs.new_assignment <- cb;
- set_new_assignment_callback_register th
-let apply_new_relevant (th:theory_callbacks) a = th.new_relevant a
-let set_new_relevant_callback th cb =
- Callback.register "apply_new_relevant" apply_new_relevant;
- let cbs = get_theory_callbacks th in
- cbs.new_relevant <- cb;
- set_new_relevant_callback_register th
+ Quantifier(e)
+
+ let gc ( x : quantifier ) = match (x) with Quantifier(e) -> (Expr.gc e)
+ let gnc ( x : quantifier ) = match (x) with Quantifier(e) -> (Expr.gnc e)
+ let gno ( x : quantifier ) = match (x) with Quantifier(e) -> (Expr.gno e)
+
+ module Pattern =
+ struct
+ type pattern = Pattern of ast
+
+ let ast_of_pattern e = match e with Pattern(x) -> x
+
+ let pattern_of_ast a =
+ (* CMW: Unchecked ok? *)
+ Pattern(a)
+
+ let gc ( x : pattern ) = match (x) with Pattern(a) -> (z3obj_gc a)
+ let gnc ( x : pattern ) = match (x) with Pattern(a) -> (z3obj_gnc a)
+ let gno ( x : pattern ) = match (x) with Pattern(a) -> (z3obj_gno a)
+ let get_num_terms ( x : pattern ) =
+ Z3native.get_pattern_num_terms (gnc x) (gno x)
+
+ let get_terms ( x : pattern ) =
+ let n = (get_num_terms x) in
+ let f i = (expr_of_ptr (gc x) (Z3native.get_pattern (gnc x) (gno x) i)) in
+ mk_list f n
+
+ let to_string ( x : pattern ) = Z3native.pattern_to_string (gnc x) (gno x)
+ end
+
+ let get_index ( x : expr ) =
+ if not (AST.is_var (match x with Expr.Expr(a) -> a)) then
+ raise (Z3native.Exception "Term is not a bound variable.")
+ else
+ Z3native.get_index_value (Expr.gnc x) (Expr.gno x)
+
+ let is_universal ( x : quantifier ) =
+ Z3native.is_quantifier_forall (gnc x) (gno x)
+
+ let is_existential ( x : quantifier ) = not (is_universal x)
+
+ let get_weight ( x : quantifier ) = Z3native.get_quantifier_weight (gnc x) (gno x)
+
+ let get_num_patterns ( x : quantifier ) = Z3native.get_quantifier_num_patterns (gnc x) (gno x)
+
+ let get_patterns ( x : quantifier ) =
+ let n = (get_num_patterns x) in
+ let f i = Pattern.Pattern (z3_native_object_of_ast_ptr (gc x) (Z3native.get_quantifier_pattern_ast (gnc x) (gno x) i)) in
+ mk_list f n
+
+ let get_num_no_patterns ( x : quantifier ) = Z3native.get_quantifier_num_no_patterns (gnc x) (gno x)
+
+ let get_no_patterns ( x : quantifier ) =
+ let n = (get_num_patterns x) in
+ let f i = Pattern.Pattern (z3_native_object_of_ast_ptr (gc x) (Z3native.get_quantifier_no_pattern_ast (gnc x) (gno x) i)) in
+ mk_list f n
+
+ let get_num_bound ( x : quantifier ) = Z3native.get_quantifier_num_bound (gnc x) (gno x)
+
+ let get_bound_variable_names ( x : quantifier ) =
+ let n = (get_num_bound x) in
+ let f i = (Symbol.create (gc x) (Z3native.get_quantifier_bound_name (gnc x) (gno x) i)) in
+ mk_list f n
+
+ let get_bound_variable_sorts ( x : quantifier ) =
+ let n = (get_num_bound x) in
+ let f i = (sort_of_ptr (gc x) (Z3native.get_quantifier_bound_sort (gnc x) (gno x) i)) in
+ mk_list f n
+
+ let get_body ( x : quantifier ) =
+ expr_of_ptr (gc x) (Z3native.get_quantifier_body (gnc x) (gno x))
+
+ let mk_bound ( ctx : context ) ( index : int ) ( ty : sort ) =
+ expr_of_ptr ctx (Z3native.mk_bound (context_gno ctx) index (Sort.gno ty))
+
+ let mk_pattern ( ctx : context ) ( terms : expr list ) =
+ if (List.length terms) == 0 then
+ raise (Z3native.Exception "Cannot create a pattern from zero terms")
+ else
+ Pattern.Pattern(z3_native_object_of_ast_ptr ctx (Z3native.mk_pattern (context_gno ctx) (List.length terms) (expr_lton terms)))
+
+ let mk_forall ( ctx : context ) ( sorts : sort list ) ( names : Symbol.symbol list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if (List.length sorts) != (List.length names) then
+ raise (Z3native.Exception "Number of sorts does not match number of names")
+ else if ((List.length nopatterns) == 0 && quantifier_id == None && skolem_id == None) then
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier (context_gno ctx) true
+ (match weight with | None -> 1 | Some(x) -> x)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length sorts) (sort_lton sorts)
+ (Symbol.symbol_lton names)
+ (Expr.gno body)))
+ else
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_ex (context_gno ctx) true
+ (match weight with | None -> 1 | Some(x) -> x)
+ (match quantifier_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (match skolem_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length nopatterns) (expr_lton nopatterns)
+ (List.length sorts) (sort_lton sorts)
+ (Symbol.symbol_lton names)
+ (Expr.gno body)))
+
+ let mk_forall_const ( ctx : context ) ( bound_constants : expr list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if ((List.length nopatterns) == 0 && quantifier_id == None && skolem_id == None) then
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_const (context_gno ctx) true
+ (match weight with | None -> 1 | Some(x) -> x)
+ (List.length bound_constants) (expr_lton bound_constants)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (Expr.gno body)))
+ else
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_const_ex (context_gno ctx) true
+ (match weight with | None -> 1 | Some(x) -> x)
+ (match quantifier_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (match skolem_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (List.length bound_constants) (expr_lton bound_constants)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length nopatterns) (expr_lton nopatterns)
+ (Expr.gno body)))
+
+ let mk_exists ( ctx : context ) ( sorts : sort list ) ( names : Symbol.symbol list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if (List.length sorts) != (List.length names) then
+ raise (Z3native.Exception "Number of sorts does not match number of names")
+ else if ((List.length nopatterns) == 0 && quantifier_id == None && skolem_id == None) then
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier (context_gno ctx) false
+ (match weight with | None -> 1 | Some(x) -> x)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length sorts) (sort_lton sorts)
+ (Symbol.symbol_lton names)
+ (Expr.gno body)))
+ else
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_ex (context_gno ctx) false
+ (match weight with | None -> 1 | Some(x) -> x)
+ (match quantifier_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (match skolem_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length nopatterns) (expr_lton nopatterns)
+ (List.length sorts) (sort_lton sorts)
+ (Symbol.symbol_lton names)
+ (Expr.gno body)))
+
+ let mk_exists_const ( ctx : context ) ( bound_constants : expr list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if ((List.length nopatterns) == 0 && quantifier_id == None && skolem_id == None) then
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_const (context_gno ctx) false
+ (match weight with | None -> 1 | Some(x) -> x)
+ (List.length bound_constants) (expr_lton bound_constants)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (Expr.gno body)))
+ else
+ Quantifier(expr_of_ptr ctx (Z3native.mk_quantifier_const_ex (context_gno ctx) false
+ (match weight with | None -> 1 | Some(x) -> x)
+ (match quantifier_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (match skolem_id with | None -> null | Some(x) -> (Symbol.gno x))
+ (List.length bound_constants) (expr_lton bound_constants)
+ (List.length patterns) (let f x = (AST.ptr_of_ast (Pattern.ast_of_pattern x)) in (Array.of_list (List.map f patterns)))
+ (List.length nopatterns) (expr_lton nopatterns)
+ (Expr.gno body)))
+
+ let mk_quantifier ( ctx : context ) ( universal : bool ) ( sorts : sort list ) ( names : Symbol.symbol list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if (universal) then
+ (mk_forall ctx sorts names body weight patterns nopatterns quantifier_id skolem_id)
+ else
+ (mk_exists ctx sorts names body weight patterns nopatterns quantifier_id skolem_id)
+
+ let mk_quantifier ( ctx : context ) ( universal : bool ) ( bound_constants : expr list ) ( body : expr ) ( weight : int option ) ( patterns : Pattern.pattern list ) ( nopatterns : expr list ) ( quantifier_id : Symbol.symbol option ) ( skolem_id : Symbol.symbol option ) =
+ if (universal) then
+ mk_forall_const ctx bound_constants body weight patterns nopatterns quantifier_id skolem_id
+ else
+ mk_exists_const ctx bound_constants body weight patterns nopatterns quantifier_id skolem_id
+
+ let to_string ( x : quantifier ) = (Expr.to_string (expr_of_quantifier x))
+end
+
+
+module Z3Array =
+struct
+ let mk_sort ( ctx : context ) ( domain : sort ) ( range : sort ) =
+ sort_of_ptr ctx (Z3native.mk_array_sort (context_gno ctx) (Sort.gno domain) (Sort.gno range))
+
+ let is_store ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_STORE)
+ let is_select ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SELECT)
+ let is_constant_array ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_CONST_ARRAY)
+ let is_default_array ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ARRAY_DEFAULT)
+ let is_array_map ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ARRAY_MAP)
+ let is_as_array ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_AS_ARRAY)
+ let is_array ( x : expr ) =
+ (Z3native.is_app (Expr.gnc x) (Expr.gno x)) &&
+ ((sort_kind_of_int (Z3native.get_sort_kind (Expr.gnc x) (Z3native.get_sort (Expr.gnc x) (Expr.gno x)))) == ARRAY_SORT)
+
+ let get_domain ( x : sort ) = Sort.sort_of_ptr (Sort.gc x) (Z3native.get_array_sort_domain (Sort.gnc x) (Sort.gno x))
+ let get_range ( x : sort ) = Sort.sort_of_ptr (Sort.gc x) (Z3native.get_array_sort_range (Sort.gnc x) (Sort.gno x))
+
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) ( domain : sort ) ( range : sort ) =
+ (Expr.mk_const ctx name (mk_sort ctx domain range))
+
+ let mk_const_s ( ctx : context ) ( name : string ) ( domain : sort ) ( range : sort ) =
+ mk_const ctx (Symbol.mk_string ctx name) domain range
+
+ let mk_select ( ctx : context ) ( a : expr ) ( i : expr ) =
+ expr_of_ptr ctx (Z3native.mk_select (context_gno ctx) (Expr.gno a) (Expr.gno i))
+
+ let mk_store ( ctx : context ) ( a : expr ) ( i : expr ) ( v : expr ) =
+ expr_of_ptr ctx (Z3native.mk_store (context_gno ctx) (Expr.gno a) (Expr.gno i) (Expr.gno v))
+
+ let mk_const_array ( ctx : context ) ( domain : sort ) ( v : expr ) =
+ expr_of_ptr ctx (Z3native.mk_const_array (context_gno ctx) (Sort.gno domain) (Expr.gno v))
+
+ let mk_map ( ctx : context ) ( f : func_decl ) ( args : expr list ) =
+ let m x = (Expr.gno x) in
+ expr_of_ptr ctx (Z3native.mk_map (context_gno ctx) (FuncDecl.gno f) (List.length args) (Array.of_list (List.map m args)))
+
+ let mk_term_array ( ctx : context ) ( arg : expr ) =
+ expr_of_ptr ctx (Z3native.mk_array_default (context_gno ctx) (Expr.gno arg))
+end
+
+
+module Set =
+struct
+ let mk_sort ( ctx : context ) ( ty : sort ) =
+ sort_of_ptr ctx (Z3native.mk_set_sort (context_gno ctx) (Sort.gno ty))
+
+ let is_union ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SET_UNION)
+ let is_intersect ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SET_INTERSECT)
+ let is_difference ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SET_DIFFERENCE)
+ let is_complement ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SET_COMPLEMENT)
+ let is_subset ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SET_SUBSET)
+
+
+ let mk_empty ( ctx : context ) ( domain : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_empty_set (context_gno ctx) (Sort.gno domain)))
+
+ let mk_full ( ctx : context ) ( domain : sort ) =
+ expr_of_ptr ctx (Z3native.mk_full_set (context_gno ctx) (Sort.gno domain))
+
+ let mk_set_add ( ctx : context ) ( set : expr ) ( element : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_add (context_gno ctx) (Expr.gno set) (Expr.gno element))
+
+ let mk_del ( ctx : context ) ( set : expr ) ( element : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_del (context_gno ctx) (Expr.gno set) (Expr.gno element))
+
+ let mk_union ( ctx : context ) ( args : expr list ) =
+ expr_of_ptr ctx (Z3native.mk_set_union (context_gno ctx) (List.length args) (expr_lton args))
+
+ let mk_intersection ( ctx : context ) ( args : expr list ) =
+ expr_of_ptr ctx (Z3native.mk_set_intersect (context_gno ctx) (List.length args) (expr_lton args))
+
+ let mk_difference ( ctx : context ) ( arg1 : expr ) ( arg2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_difference (context_gno ctx) (Expr.gno arg1) (Expr.gno arg2))
+
+ let mk_complement ( ctx : context ) ( arg : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_complement (context_gno ctx) (Expr.gno arg))
+
+ let mk_membership ( ctx : context ) ( elem : expr ) ( set : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_member (context_gno ctx) (Expr.gno elem) (Expr.gno set))
+
+ let mk_subset ( ctx : context ) ( arg1 : expr ) ( arg2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_set_subset (context_gno ctx) (Expr.gno arg1) (Expr.gno arg2))
end
+
+module FiniteDomain =
+struct
+ let mk_sort ( ctx : context ) ( name : Symbol.symbol ) ( size : int ) =
+ (sort_of_ptr ctx (Z3native.mk_finite_domain_sort (context_gno ctx) (Symbol.gno name) size))
+
+ let mk_sort_s ( ctx : context ) ( name : string ) ( size : int ) =
+ mk_sort ctx (Symbol.mk_string ctx name) size
+
+ let is_finite_domain ( x : expr ) =
+ let nc = (Expr.gnc x) in
+ (Z3native.is_app (Expr.gnc x) (Expr.gno x)) &&
+ (sort_kind_of_int (Z3native.get_sort_kind nc (Z3native.get_sort nc (Expr.gno x))) == FINITE_DOMAIN_SORT)
+
+ let is_lt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FD_LT)
+
+ let get_size ( x : sort ) =
+ let (r, v) = (Z3native.get_finite_domain_sort_size (Sort.gnc x) (Sort.gno x)) in
+ if r then v
+ else raise (Z3native.Exception "Conversion failed.")
+end
+
+
+module Relation =
+struct
+ let is_relation ( x : expr ) =
+ let nc = (Expr.gnc x) in
+ ((Z3native.is_app (Expr.gnc x) (Expr.gno x)) &&
+ (sort_kind_of_int (Z3native.get_sort_kind nc (Z3native.get_sort nc (Expr.gno x))) == RELATION_SORT))
+
+ let is_store ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_STORE)
+ let is_empty ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_EMPTY)
+ let is_is_empty ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_IS_EMPTY)
+ let is_join ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_JOIN)
+ let is_union ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_UNION)
+ let is_widen ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_WIDEN)
+ let is_project ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_PROJECT)
+ let is_filter ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_FILTER)
+ let is_negation_filter ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_NEGATION_FILTER)
+ let is_rename ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_RENAME)
+ let is_complement ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_COMPLEMENT)
+ let is_select ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_SELECT)
+ let is_clone ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_RA_CLONE)
+
+ let get_arity ( x : sort ) = Z3native.get_relation_arity (Sort.gnc x) (Sort.gno x)
+
+ let get_column_sorts ( x : sort ) =
+ let n = get_arity x in
+ let f i = (sort_of_ptr (Sort.gc x) (Z3native.get_relation_column (Sort.gnc x) (Sort.gno x) i)) in
+ mk_list f n
+end
+
+
+module Datatype =
+struct
+ module Constructor =
+ struct
+ type constructor = z3_native_object
+
+ module FieldNumTable = Hashtbl.Make(struct
+ type t = AST.ast
+ let equal x y = AST.compare x y = 0
+ let hash = AST.hash
+ end)
+
+ let _field_nums = FieldNumTable.create 0
+
+ let create ( ctx : context ) ( name : Symbol.symbol ) ( recognizer : Symbol.symbol ) ( field_names : Symbol.symbol list ) ( sorts : sort option list ) ( sort_refs : int list ) =
+ let n = (List.length field_names) in
+ if n != (List.length sorts) then
+ raise (Z3native.Exception "Number of field names does not match number of sorts")
+ else
+ if n != (List.length sort_refs) then
+ raise (Z3native.Exception "Number of field names does not match number of sort refs")
+ else
+ let ptr = (Z3native.mk_constructor (context_gno ctx) (Symbol.gno name)
+ (Symbol.gno recognizer)
+ n
+ (Symbol.symbol_lton field_names)
+ (sort_option_lton sorts)
+ (Array.of_list sort_refs)) in
+ let no : constructor = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = z3obj_nil_ref ;
+ dec_ref = z3obj_nil_ref} in
+ (z3obj_sno no ctx ptr) ;
+ (z3obj_create no) ;
+ let f = fun o -> Z3native.del_constructor (z3obj_gnc o) (z3obj_gno o) in
+ Gc.finalise f no ;
+ FieldNumTable.add _field_nums no n ;
+ no
+
+ let get_num_fields ( x : constructor ) = FieldNumTable.find _field_nums x
+
+ let get_constructor_decl ( x : constructor ) =
+ let (a, _, _) = (Z3native.query_constructor (z3obj_gnc x) (z3obj_gno x) (get_num_fields x)) in
+ func_decl_of_ptr (z3obj_gc x) a
+
+ let get_tester_decl ( x : constructor ) =
+ let (_, b, _) = (Z3native.query_constructor (z3obj_gnc x) (z3obj_gno x) (get_num_fields x)) in
+ func_decl_of_ptr (z3obj_gc x) b
+
+ let get_accessor_decls ( x : constructor ) =
+ let (_, _, c) = (Z3native.query_constructor (z3obj_gnc x) (z3obj_gno x) (get_num_fields x)) in
+ let f i = func_decl_of_ptr (z3obj_gc x) (Array.get c i) in
+ mk_list f (Array.length c)
+
+ end
+
+ module ConstructorList =
+ struct
+ type constructor_list = z3_native_object
+
+ let create ( ctx : context ) ( c : Constructor.constructor list ) =
+ let res : constructor_list = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = z3obj_nil_ref ;
+ dec_ref = z3obj_nil_ref} in
+ let f x =(z3obj_gno x) in
+ (z3obj_sno res ctx (Z3native.mk_constructor_list (context_gno ctx) (List.length c) (Array.of_list (List.map f c)))) ;
+ (z3obj_create res) ;
+ let f = fun o -> Z3native.del_constructor_list (z3obj_gnc o) (z3obj_gno o) in
+ Gc.finalise f res;
+ res
+ end
+
+ let mk_constructor ( ctx : context ) ( name : Symbol.symbol ) ( recognizer : Symbol.symbol ) ( field_names : Symbol.symbol list ) ( sorts : sort option list ) ( sort_refs : int list ) =
+ Constructor.create ctx name recognizer field_names sorts sort_refs
+
+
+ let mk_constructor_s ( ctx : context ) ( name : string ) ( recognizer : Symbol.symbol ) ( field_names : Symbol.symbol list ) ( sorts : sort option list ) ( sort_refs : int list ) =
+ mk_constructor ctx (Symbol.mk_string ctx name) recognizer field_names sorts sort_refs
+
+ let mk_sort ( ctx : context ) ( name : Symbol.symbol ) ( constructors : Constructor.constructor list ) =
+ let f x = (z3obj_gno x) in
+ let (x,_) = (Z3native.mk_datatype (context_gno ctx) (Symbol.gno name) (List.length constructors) (Array.of_list (List.map f constructors))) in
+ sort_of_ptr ctx x
+
+ let mk_sort_s ( ctx : context ) ( name : string ) ( constructors : Constructor.constructor list ) =
+ mk_sort ctx (Symbol.mk_string ctx name) constructors
+
+ let mk_sorts ( ctx : context ) ( names : Symbol.symbol list ) ( c : Constructor.constructor list list ) =
+ let n = (List.length names) in
+ let f e = (AST.ptr_of_ast (ConstructorList.create ctx e)) in
+ let cla = (Array.of_list (List.map f c)) in
+ let (r, a) = (Z3native.mk_datatypes (context_gno ctx) n (Symbol.symbol_lton names) cla) in
+ let g i = (sort_of_ptr ctx (Array.get r i)) in
+ mk_list g (Array.length r)
+
+ let mk_sorts_s ( ctx : context ) ( names : string list ) ( c : Constructor.constructor list list ) =
+ mk_sorts ctx
+ (
+ let f e = (Symbol.mk_string ctx e) in
+ List.map f names
+ )
+ c
+
+ let get_num_constructors ( x : sort ) = Z3native.get_datatype_sort_num_constructors (Sort.gnc x) (Sort.gno x)
+
+ let get_constructors ( x : sort ) =
+ let n = (get_num_constructors x) in
+ let f i = func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor (Sort.gnc x) (Sort.gno x) i) in
+ mk_list f n
+
+ let get_recognizers ( x : sort ) =
+ let n = (get_num_constructors x) in
+ let f i = func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_recognizer (Sort.gnc x) (Sort.gno x) i) in
+ mk_list f n
+
+ let get_accessors ( x : sort ) =
+ let n = (get_num_constructors x) in
+ let f i = (
+ let fd = func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor (Sort.gnc x) (Sort.gno x) i) in
+ let ds = Z3native.get_domain_size (FuncDecl.gnc fd) (FuncDecl.gno fd) in
+ let g j = func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor_accessor (Sort.gnc x) (Sort.gno x) i j) in
+ mk_list g ds
+ ) in
+ mk_list f n
+end
+
+
+module Enumeration =
+struct
+ let mk_sort ( ctx : context ) ( name : Symbol.symbol ) ( enum_names : Symbol.symbol list ) =
+ let (a, _, _) = (Z3native.mk_enumeration_sort (context_gno ctx) (Symbol.gno name) (List.length enum_names) (Symbol.symbol_lton enum_names)) in
+ sort_of_ptr ctx a
+
+ let mk_sort_s ( ctx : context ) ( name : string ) ( enum_names : string list ) =
+ mk_sort ctx (Symbol.mk_string ctx name) (Symbol.mk_strings ctx enum_names)
+
+ let get_const_decls ( x : sort ) =
+ let n = Z3native.get_datatype_sort_num_constructors (Sort.gnc x) (Sort.gno x) in
+ let f i = (func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor (Sort.gnc x) (Sort.gno x) i)) in
+ mk_list f n
+
+ let get_tester_decls ( x : sort ) =
+ let n = Z3native.get_datatype_sort_num_constructors (Sort.gnc x) (Sort.gno x) in
+ let f i = (func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_recognizer (Sort.gnc x) (Sort.gno x) i)) in
+ mk_list f n
+
+end
+
+
+module Z3List =
+struct
+ let mk_sort ( ctx : context ) ( name : Symbol.symbol ) ( elem_sort : sort ) =
+ let (r, _, _, _, _, _, _) = (Z3native.mk_list_sort (context_gno ctx) (Symbol.gno name) (Sort.gno elem_sort)) in
+ sort_of_ptr ctx r
+
+ let mk_list_s ( ctx : context ) (name : string) elem_sort =
+ mk_sort ctx (Symbol.mk_string ctx name) elem_sort
+
+ let get_nil_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor (Sort.gnc x) (Sort.gno x) 0)
+
+ let get_is_nil_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_recognizer (Sort.gnc x) (Sort.gno x) 0)
+
+ let get_cons_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor (Sort.gnc x) (Sort.gno x) 1)
+
+ let get_is_cons_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_recognizer (Sort.gnc x) (Sort.gno x) 1)
+
+ let get_head_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor_accessor (Sort.gnc x) (Sort.gno x) 1 0)
+
+ let get_tail_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_datatype_sort_constructor_accessor (Sort.gnc x) (Sort.gno x) 1 1)
+
+ let nil ( x : sort ) = expr_of_func_app (Sort.gc x) (get_nil_decl x) []
+end
+
+
+module Tuple =
+struct
+ let mk_sort ( ctx : context ) ( name : Symbol.symbol ) ( field_names : Symbol.symbol list ) ( field_sorts : sort list ) =
+ let (r, _, _) = (Z3native.mk_tuple_sort (context_gno ctx) (Symbol.gno name) (List.length field_names) (Symbol.symbol_lton field_names) (sort_lton field_sorts)) in
+ sort_of_ptr ctx r
+
+ let get_mk_decl ( x : sort ) =
+ func_decl_of_ptr (Sort.gc x) (Z3native.get_tuple_sort_mk_decl (Sort.gnc x) (Sort.gno x))
+
+ let get_num_fields ( x : sort ) = Z3native.get_tuple_sort_num_fields (Sort.gnc x) (Sort.gno x)
+
+ let get_field_decls ( x : sort ) =
+ let n = get_num_fields x in
+ let f i = func_decl_of_ptr (Sort.gc x) (Z3native.get_tuple_sort_field_decl (Sort.gnc x) (Sort.gno x) i) in
+ mk_list f n
+end
+
+
+module Arithmetic =
+struct
+ let is_int ( x : expr ) =
+ (Z3native.is_numeral_ast (Expr.gnc x) (Expr.gno x)) &&
+ ((sort_kind_of_int (Z3native.get_sort_kind (Expr.gnc x) (Z3native.get_sort (Expr.gnc x) (Expr.gno x)))) == INT_SORT)
+
+ let is_arithmetic_numeral ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ANUM)
+
+ let is_le ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_LE)
+
+ let is_ge ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_GE)
+
+ let is_lt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_LT)
+
+ let is_gt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_GT)
+
+ let is_add ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ADD)
+
+ let is_sub ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SUB)
+
+ let is_uminus ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_UMINUS)
+
+ let is_mul ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_MUL)
+
+ let is_div ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_DIV)
+
+ let is_idiv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_IDIV)
+
+ let is_remainder ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_REM)
+
+ let is_modulus ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_MOD)
+
+ let is_int2real ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_TO_REAL)
+
+ let is_real2int ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_TO_INT)
+
+ let is_real_is_int ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_IS_INT)
+
+ let is_real ( x : expr ) =
+ ((sort_kind_of_int (Z3native.get_sort_kind (Expr.gnc x) (Z3native.get_sort (Expr.gnc x) (Expr.gno x)))) == REAL_SORT)
+
+ let is_int_numeral ( x : expr ) = (Expr.is_numeral x) && (is_int x)
+
+ let is_rat_numeral ( x : expr ) = (Expr.is_numeral x) && (is_real x)
+
+ let is_algebraic_number ( x : expr ) = Z3native.is_algebraic_number (Expr.gnc x) (Expr.gno x)
+
+ module Integer =
+ struct
+ let mk_sort ( ctx : context ) =
+ sort_of_ptr ctx (Z3native.mk_int_sort (context_gno ctx))
+
+ let get_int ( x : expr ) =
+ let (r, v) = Z3native.get_numeral_int (Expr.gnc x) (Expr.gno x) in
+ if r then v
+ else raise (Z3native.Exception "Conversion failed.")
+
+ let get_big_int ( x : expr ) =
+ if (is_int_numeral x) then
+ let s = (Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)) in
+ (Big_int.big_int_of_string s)
+ else raise (Z3native.Exception "Conversion failed.")
+
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) =
+ Expr.mk_const ctx name (mk_sort ctx)
+
+ let mk_const_s ( ctx : context ) ( name : string ) =
+ mk_const ctx (Symbol.mk_string ctx name)
+
+ let mk_mod ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_mod (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+
+ let mk_rem ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_rem (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+
+ let mk_numeral_s ( ctx : context ) ( v : string ) =
+ expr_of_ptr ctx (Z3native.mk_numeral (context_gno ctx) v (Sort.gno (mk_sort ctx)))
+
+ let mk_numeral_i ( ctx : context ) ( v : int ) =
+ expr_of_ptr ctx (Z3native.mk_int (context_gno ctx) v (Sort.gno (mk_sort ctx)))
+
+ let mk_int2real ( ctx : context ) ( t : expr ) =
+ (Expr.expr_of_ptr ctx (Z3native.mk_int2real (context_gno ctx) (Expr.gno t)))
+
+ let mk_int2bv ( ctx : context ) ( n : int ) ( t : expr ) =
+ (Expr.expr_of_ptr ctx (Z3native.mk_int2bv (context_gno ctx) n (Expr.gno t)))
+ end
+
+ module Real =
+ struct
+ let mk_sort ( ctx : context ) =
+ sort_of_ptr ctx (Z3native.mk_real_sort (context_gno ctx))
+
+ let get_numerator ( x : expr ) =
+ expr_of_ptr (Expr.gc x) (Z3native.get_numerator (Expr.gnc x) (Expr.gno x))
+
+ let get_denominator ( x : expr ) =
+ expr_of_ptr (Expr.gc x) (Z3native.get_denominator (Expr.gnc x) (Expr.gno x))
+
+ let get_ratio ( x : expr ) =
+ if (is_rat_numeral x) then
+ let s = (Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)) in
+ (Ratio.ratio_of_string s)
+ else raise (Z3native.Exception "Conversion failed.")
+
+ let to_decimal_string ( x : expr ) ( precision : int ) =
+ Z3native.get_numeral_decimal_string (Expr.gnc x) (Expr.gno x) precision
+
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) =
+ Expr.mk_const ctx name (mk_sort ctx)
+
+ let mk_const_s ( ctx : context ) ( name : string ) =
+ mk_const ctx (Symbol.mk_string ctx name)
+
+ let mk_numeral_nd ( ctx : context ) ( num : int ) ( den : int ) =
+ if (den == 0) then
+ raise (Z3native.Exception "Denominator is zero")
+ else
+ expr_of_ptr ctx (Z3native.mk_real (context_gno ctx) num den)
+
+ let mk_numeral_s ( ctx : context ) ( v : string ) =
+ expr_of_ptr ctx (Z3native.mk_numeral (context_gno ctx) v (Sort.gno (mk_sort ctx)))
+
+ let mk_numeral_i ( ctx : context ) ( v : int ) =
+ expr_of_ptr ctx (Z3native.mk_int (context_gno ctx) v (Sort.gno (mk_sort ctx)))
+
+ let mk_is_integer ( ctx : context ) ( t : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_is_int (context_gno ctx) (Expr.gno t)))
+
+ let mk_real2int ( ctx : context ) ( t : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_real2int (context_gno ctx) (Expr.gno t)))
+
+ module AlgebraicNumber =
+ struct
+ let to_upper ( x : expr ) ( precision : int ) =
+ expr_of_ptr (Expr.gc x) (Z3native.get_algebraic_number_upper (Expr.gnc x) (Expr.gno x) precision)
+
+ let to_lower ( x : expr ) precision =
+ expr_of_ptr (Expr.gc x) (Z3native.get_algebraic_number_lower (Expr.gnc x) (Expr.gno x) precision)
+
+ let to_decimal_string ( x : expr ) ( precision : int ) =
+ Z3native.get_numeral_decimal_string (Expr.gnc x) (Expr.gno x) precision
+
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+ end
+ end
+
+ let mk_add ( ctx : context ) ( t : expr list ) =
+ let f x = (Expr.gno x) in
+ (expr_of_ptr ctx (Z3native.mk_add (context_gno ctx) (List.length t) (Array.of_list (List.map f t))))
+
+ let mk_mul ( ctx : context ) ( t : expr list ) =
+ let f x = (Expr.gno x) in
+ (expr_of_ptr ctx (Z3native.mk_mul (context_gno ctx) (List.length t) (Array.of_list (List.map f t))))
+
+ let mk_sub ( ctx : context ) ( t : expr list ) =
+ let f x = (Expr.gno x) in
+ (expr_of_ptr ctx (Z3native.mk_sub (context_gno ctx) (List.length t) (Array.of_list (List.map f t))))
+
+ let mk_unary_minus ( ctx : context ) ( t : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_unary_minus (context_gno ctx) (Expr.gno t)))
+
+ let mk_div ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_div (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+
+ let mk_power ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_power (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+
+ let mk_lt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_lt (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+
+ let mk_le ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_le (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+
+ let mk_gt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_gt (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+
+ let mk_ge ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_ge (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+end
+
+
+module BitVector =
+struct
+ let mk_sort ( ctx : context ) size =
+ sort_of_ptr ctx (Z3native.mk_bv_sort (context_gno ctx) size)
+ let is_bv ( x : expr ) =
+ ((sort_kind_of_int (Z3native.get_sort_kind (Expr.gnc x) (Z3native.get_sort (Expr.gnc x) (Expr.gno x)))) == BV_SORT)
+ let is_bv_numeral ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BNUM)
+ let is_bv_bit1 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BIT1)
+ let is_bv_bit0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BIT0)
+ let is_bv_uminus ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BNEG)
+ let is_bv_add ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BADD)
+ let is_bv_sub ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSUB)
+ let is_bv_mul ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BMUL)
+ let is_bv_sdiv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSDIV)
+ let is_bv_udiv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BUDIV)
+ let is_bv_SRem ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSREM)
+ let is_bv_urem ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BUREM)
+ let is_bv_smod ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSMOD)
+ let is_bv_sdiv0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSDIV0)
+ let is_bv_udiv0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BUDIV0)
+ let is_bv_srem0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSREM0)
+ let is_bv_urem0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BUREM0)
+ let is_bv_smod0 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSMOD0)
+ let is_bv_ule ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ULEQ)
+ let is_bv_sle ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SLEQ)
+ let is_bv_uge ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_UGEQ)
+ let is_bv_sge ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SGEQ)
+ let is_bv_ult ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ULT)
+ let is_bv_slt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SLT)
+ let is_bv_ugt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_UGT)
+ let is_bv_sgt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SGT)
+ let is_bv_and ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BAND)
+ let is_bv_or ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BOR)
+ let is_bv_not ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BNOT)
+ let is_bv_xor ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BXOR)
+ let is_bv_nand ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BNAND)
+ let is_bv_nor ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BNOR)
+ let is_bv_xnor ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BXNOR)
+ let is_bv_concat ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_CONCAT)
+ let is_bv_signextension ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_SIGN_EXT)
+ let is_bv_zeroextension ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ZERO_EXT)
+ let is_bv_extract ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_EXTRACT)
+ let is_bv_repeat ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_REPEAT)
+ let is_bv_reduceor ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BREDOR)
+ let is_bv_reduceand ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BREDAND)
+ let is_bv_comp ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BCOMP)
+ let is_bv_shiftleft ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BSHL)
+ let is_bv_shiftrightlogical ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BLSHR)
+ let is_bv_shiftrightarithmetic ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BASHR)
+ let is_bv_rotateleft ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ROTATE_LEFT)
+ let is_bv_rotateright ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_ROTATE_RIGHT)
+ let is_bv_rotateleftextended ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_EXT_ROTATE_LEFT)
+ let is_bv_rotaterightextended ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_EXT_ROTATE_RIGHT)
+ let is_int2bv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_INT2BV)
+ let is_bv2int ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_BV2INT)
+ let is_bv_carry ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_CARRY)
+ let is_bv_xor3 ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_XOR3)
+ let get_size (x : sort ) = Z3native.get_bv_sort_size (Sort.gnc x) (Sort.gno x)
+ let get_int ( x : expr ) =
+ let (r, v) = Z3native.get_numeral_int (Expr.gnc x) (Expr.gno x) in
+ if r then v
+ else raise (Z3native.Exception "Conversion failed.")
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) ( size : int ) =
+ Expr.mk_const ctx name (mk_sort ctx size)
+ let mk_const_s ( ctx : context ) ( name : string ) ( size : int ) =
+ mk_const ctx (Symbol.mk_string ctx name) size
+ let mk_not ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvnot (context_gno ctx) (Expr.gno t))
+ let mk_redand ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvredand (context_gno ctx) (Expr.gno t))
+ let mk_redor ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvredor (context_gno ctx) (Expr.gno t))
+ let mk_and ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvand (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_or ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvor (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_xor ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvxor (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_nand ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvnand (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_nor ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvnor (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_xnor ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvxnor (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_neg ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvneg (context_gno ctx) (Expr.gno t))
+ let mk_add ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvadd (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_sub ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvsub (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_mul ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvmul (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_udiv ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvudiv (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_sdiv ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvsdiv (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_urem ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvurem (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_srem ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvsrem (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_smod ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvsmod (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_ult ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvult (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_slt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvslt (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_ule ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvule (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_sle ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvsle (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_uge ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvuge (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_sge ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvsge (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_ugt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvugt (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_sgt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvsgt (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_concat ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_concat (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_extract ( ctx : context ) ( high : int ) ( low : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_extract (context_gno ctx) high low (Expr.gno t))
+ let mk_sign_ext ( ctx : context ) ( i : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_sign_ext (context_gno ctx) i (Expr.gno t))
+ let mk_zero_ext ( ctx : context ) ( i : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_zero_ext (context_gno ctx) i (Expr.gno t))
+ let mk_repeat ( ctx : context ) ( i : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_repeat (context_gno ctx) i (Expr.gno t))
+ let mk_shl ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvshl (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_lshr ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvlshr (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_ashr ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_bvashr (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_rotate_left ( ctx : context ) ( i : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_rotate_left (context_gno ctx) i (Expr.gno t))
+ let mk_rotate_right ( ctx : context ) ( i : int ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_rotate_right (context_gno ctx) i (Expr.gno t))
+ let mk_ext_rotate_left ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_ext_rotate_left (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_ext_rotate_right ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_ext_rotate_right (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_bv2int ( ctx : context ) ( t : expr ) ( signed : bool ) =
+ expr_of_ptr ctx (Z3native.mk_bv2int (context_gno ctx) (Expr.gno t) signed)
+ let mk_add_no_overflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) ( signed : bool) =
+ (expr_of_ptr ctx (Z3native.mk_bvadd_no_overflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2) signed))
+ let mk_add_no_underflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvadd_no_underflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_sub_no_overflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvsub_no_overflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_sub_no_underflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) ( signed : bool) =
+ (expr_of_ptr ctx (Z3native.mk_bvsub_no_underflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2) signed))
+ let mk_sdiv_no_overflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvsdiv_no_overflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_neg_no_overflow ( ctx : context ) ( t : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvneg_no_overflow (context_gno ctx) (Expr.gno t)))
+ let mk_mul_no_overflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) ( signed : bool) =
+ (expr_of_ptr ctx (Z3native.mk_bvmul_no_overflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2) signed))
+ let mk_mul_no_underflow ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_bvmul_no_underflow (context_gno ctx) (Expr.gno t1) (Expr.gno t2)))
+ let mk_numeral ( ctx : context ) ( v : string ) ( size : int ) =
+ expr_of_ptr ctx (Z3native.mk_numeral (context_gno ctx) v (Sort.gno (mk_sort ctx size)))
+end
+
+
+module FloatingPoint =
+struct
+ module RoundingMode =
+ struct
+ let mk_sort ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_rounding_mode_sort (context_gno ctx)))
+ let is_fprm ( x : expr ) =
+ (Sort.get_sort_kind (Expr.get_sort(x))) == ROUNDING_MODE_SORT
+ let mk_round_nearest_ties_to_even ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_round_nearest_ties_to_even (context_gno ctx)))
+ let mk_rne ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_rne (context_gno ctx)))
+ let mk_round_nearest_ties_to_away ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_round_nearest_ties_to_away (context_gno ctx)))
+ let mk_rna ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_rna (context_gno ctx)))
+ let mk_round_toward_positive ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_round_toward_positive (context_gno ctx)))
+ let mk_rtp ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_rtp (context_gno ctx)))
+ let mk_round_toward_negative ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_round_toward_negative (context_gno ctx)))
+ let mk_rtn ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_rtn (context_gno ctx)))
+ let mk_round_toward_zero ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_round_toward_zero (context_gno ctx)))
+ let mk_rtz ( ctx : context ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_rtz (context_gno ctx)))
+ end
+
+ let mk_sort ( ctx : context ) ( ebits : int ) ( sbits : int ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort (context_gno ctx) ebits sbits))
+ let mk_sort_half ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_half (context_gno ctx)))
+ let mk_sort_16 ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_16 (context_gno ctx)))
+ let mk_sort_single ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_single (context_gno ctx)))
+ let mk_sort_32 ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_32 (context_gno ctx)))
+ let mk_sort_double ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_double (context_gno ctx)))
+ let mk_sort_64 ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_64 (context_gno ctx)))
+ let mk_sort_quadruple ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_quadruple (context_gno ctx)))
+ let mk_sort_128 ( ctx : context ) =
+ (sort_of_ptr ctx (Z3native.mk_fpa_sort_128 (context_gno ctx)))
+
+ let mk_nan ( ctx : context ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_nan (context_gno ctx) (Sort.gno s)))
+ let mk_inf ( ctx : context ) ( s : sort ) ( negative : bool ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_inf (context_gno ctx) (Sort.gno s) negative))
+ let mk_zero ( ctx : context ) ( s : sort ) ( negative : bool ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_zero (context_gno ctx) (Sort.gno s) negative))
+
+ let mk_fp ( ctx : context ) ( sign : expr ) ( exponent : expr ) ( significand : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_fp (context_gno ctx) (Expr.gno sign) (Expr.gno exponent) (Expr.gno significand)))
+ let mk_numeral_f ( ctx : context ) ( value : float ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_numeral_double (context_gno ctx) value (Sort.gno s)))
+ let mk_numeral_i ( ctx : context ) ( value : int ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_numeral_int (context_gno ctx) value (Sort.gno s)))
+ let mk_numeral_i_u ( ctx : context ) ( sign : bool ) ( exponent : int ) ( significand : int ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_numeral_int64_uint64 (context_gno ctx) sign exponent significand (Sort.gno s)))
+ let mk_numeral_s ( ctx : context ) ( v : string ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_numeral (context_gno ctx) v (Sort.gno s)))
+
+ let is_fp ( x : expr ) = (Sort.get_sort_kind (Expr.get_sort x)) == FLOATING_POINT_SORT
+ let is_abs ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_ABS)
+ let is_neg ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_NEG)
+ let is_add ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_ADD)
+ let is_sub ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_SUB)
+ let is_mul ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_MUL)
+ let is_div ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_DIV)
+ let is_fma ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_FMA)
+ let is_sqrt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_SQRT)
+ let is_rem ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_REM)
+ let is_round_to_integral ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_ROUND_TO_INTEGRAL)
+ let is_min ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_MIN)
+ let is_max ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_MAX)
+ let is_leq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_LE)
+ let is_lt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_LT)
+ let is_geq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_GE)
+ let is_gt ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_GT)
+ let is_eq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_EQ)
+ let is_is_normal ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_NORMAL)
+ let is_is_subnormal ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_SUBNORMAL)
+ let is_is_zero ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_ZERO)
+ let is_is_infinite ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_INF)
+ let is_is_nan ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_NAN)
+ let is_is_negative ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_NEGATIVE)
+ let is_is_positive ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_IS_POSITIVE)
+ let is_to_fp ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_FP)
+ let is_to_fp_unsigned ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_FP_UNSIGNED)
+ let is_to_ubv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_UBV)
+ let is_to_sbv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_SBV)
+ let is_to_real ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_REAL)
+ let is_to_ieee_bv ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_FPA_TO_IEEE_BV)
+
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+ let mk_const ( ctx : context ) ( name : Symbol.symbol ) ( s : sort ) =
+ Expr.mk_const ctx name s
+ let mk_const_s ( ctx : context ) ( name : string ) ( s : sort ) =
+ mk_const ctx (Symbol.mk_string ctx name) s
+
+ let mk_abs ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_abs (context_gno ctx) (Expr.gno t))
+ let mk_neg ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_neg (context_gno ctx) (Expr.gno t))
+ let mk_add ( ctx : context ) ( rm : expr ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_add (context_gno ctx) (Expr.gno rm) (Expr.gno t1) (Expr.gno t2))
+ let mk_sub ( ctx : context ) ( rm : expr ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_sub (context_gno ctx) (Expr.gno rm) (Expr.gno t1) (Expr.gno t2))
+ let mk_mul ( ctx : context ) ( rm : expr ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_mul (context_gno ctx) (Expr.gno rm) (Expr.gno t1) (Expr.gno t2))
+ let mk_div ( ctx : context ) ( rm : expr ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_div (context_gno ctx) (Expr.gno rm) (Expr.gno t1) (Expr.gno t2))
+ let mk_fma ( ctx : context ) ( rm : expr ) ( t1 : expr ) ( t2 : expr ) ( t3 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_fma (context_gno ctx) (Expr.gno rm) (Expr.gno t1) (Expr.gno t2) (Expr.gno t3))
+ let mk_sqrt ( ctx : context ) ( rm : expr ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_sqrt (context_gno ctx) (Expr.gno rm) (Expr.gno t))
+ let mk_rem ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_rem (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_round_to_integral ( ctx : context ) ( rm : expr ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_round_to_integral (context_gno ctx) (Expr.gno rm) (Expr.gno t))
+ let mk_min ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_min (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_max ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_max (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_leq ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_leq (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_lt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_lt (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_geq ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_geq (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_gt ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_gt (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_eq ( ctx : context ) ( t1 : expr ) ( t2 : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_eq (context_gno ctx) (Expr.gno t1) (Expr.gno t2))
+ let mk_is_normal ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_normal (context_gno ctx) (Expr.gno t))
+ let mk_is_subnormal ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_subnormal (context_gno ctx) (Expr.gno t))
+ let mk_is_zero ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_zero (context_gno ctx) (Expr.gno t))
+ let mk_is_infinite ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_infinite (context_gno ctx) (Expr.gno t))
+ let mk_is_nan ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_nan (context_gno ctx) (Expr.gno t))
+ let mk_is_negative ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_negative (context_gno ctx) (Expr.gno t))
+ let mk_is_positive ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_is_positive (context_gno ctx) (Expr.gno t))
+ let mk_to_fp_bv ( ctx : context ) ( t : expr ) ( s : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_fp_bv (context_gno ctx) (Expr.gno t) (Sort.gno s))
+ let mk_to_fp_float ( ctx : context ) ( rm : expr) ( t : expr ) ( s : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_fp_float (context_gno ctx) (Expr.gno rm) (Expr.gno t) (Sort.gno s))
+ let mk_to_fp_real ( ctx : context ) ( rm : expr ) ( t : expr ) ( s : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_fp_real (context_gno ctx) (Expr.gno rm) (Expr.gno t) (Sort.gno s))
+ let mk_to_fp_signed ( ctx : context ) ( rm : expr) ( t : expr ) ( s : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_fp_signed (context_gno ctx) (Expr.gno rm) (Expr.gno t) (Sort.gno s))
+ let mk_to_fp_unsigned ( ctx : context ) ( rm : expr) ( t : expr ) ( s : sort ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_fp_unsigned (context_gno ctx) (Expr.gno rm) (Expr.gno t) (Sort.gno s))
+ let mk_to_ubv ( ctx : context ) ( rm : expr) ( t : expr ) ( size : int ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_ubv (context_gno ctx) (Expr.gno rm) (Expr.gno t) size)
+ let mk_to_sbv ( ctx : context ) ( rm : expr) ( t : expr ) ( size : int ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_sbv (context_gno ctx) (Expr.gno rm) (Expr.gno t) size)
+ let mk_to_real ( ctx : context ) ( t : expr ) =
+ expr_of_ptr ctx (Z3native.mk_fpa_to_real (context_gno ctx) (Expr.gno t))
+
+ let get_ebits ( ctx : context ) ( s : sort ) =
+ (Z3native.fpa_get_ebits (context_gno ctx) (Sort.gno s))
+ let get_sbits ( ctx : context ) ( s : sort ) =
+ (Z3native.fpa_get_sbits (context_gno ctx) (Sort.gno s))
+ let get_numeral_sign ( ctx : context ) ( t : expr ) =
+ (Z3native.fpa_get_numeral_sign (context_gno ctx) (Expr.gno t))
+ let get_numeral_significand_string ( ctx : context ) ( t : expr ) =
+ (Z3native.fpa_get_numeral_significand_string (context_gno ctx) (Expr.gno t))
+ let get_numeral_exponent_string ( ctx : context ) ( t : expr ) =
+ (Z3native.fpa_get_numeral_exponent_string (context_gno ctx) (Expr.gno t))
+ let get_numeral_exponent_int ( ctx : context ) ( t : expr ) =
+ (Z3native.fpa_get_numeral_exponent_int64 (context_gno ctx) (Expr.gno t))
+
+ let mk_to_ieee_bv ( ctx : context ) ( t : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_to_ieee_bv (context_gno ctx) (Expr.gno t)))
+ let mk_to_fp_int_real ( ctx : context ) ( rm : expr ) ( exponent : expr ) ( significand : expr ) ( s : sort ) =
+ (expr_of_ptr ctx (Z3native.mk_fpa_to_fp_int_real (context_gno ctx) (Expr.gno rm) (Expr.gno exponent) (Expr.gno significand) (Sort.gno s)))
+
+ let numeral_to_string ( x : expr ) = Z3native.get_numeral_string (Expr.gnc x) (Expr.gno x)
+end
+
+
+module Proof =
+struct
+ let is_true ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_TRUE)
+ let is_asserted ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_ASSERTED)
+ let is_goal ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_GOAL)
+ let is_oeq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_OEQ)
+ let is_modus_ponens ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_MODUS_PONENS)
+ let is_reflexivity ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_REFLEXIVITY)
+ let is_symmetry ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_SYMMETRY)
+ let is_transitivity ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_TRANSITIVITY)
+ let is_Transitivity_star ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_TRANSITIVITY_STAR)
+ let is_monotonicity ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_MONOTONICITY)
+ let is_quant_intro ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_QUANT_INTRO)
+ let is_distributivity ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_DISTRIBUTIVITY)
+ let is_and_elimination ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_AND_ELIM)
+ let is_or_elimination ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_NOT_OR_ELIM)
+ let is_rewrite ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_REWRITE)
+ let is_rewrite_star ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_REWRITE_STAR)
+ let is_pull_quant ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_PULL_QUANT)
+ let is_pull_quant_star ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_PULL_QUANT_STAR)
+ let is_push_quant ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_PUSH_QUANT)
+ let is_elim_unused_vars ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_ELIM_UNUSED_VARS)
+ let is_der ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_DER)
+ let is_quant_inst ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_QUANT_INST)
+ let is_hypothesis ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_HYPOTHESIS)
+ let is_lemma ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_LEMMA)
+ let is_unit_resolution ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_UNIT_RESOLUTION)
+ let is_iff_true ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_IFF_TRUE)
+ let is_iff_false ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_IFF_FALSE)
+ let is_commutativity ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_COMMUTATIVITY) (* *)
+ let is_def_axiom ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_DEF_AXIOM)
+ let is_def_intro ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_DEF_INTRO)
+ let is_apply_def ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_APPLY_DEF)
+ let is_iff_oeq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_IFF_OEQ)
+ let is_nnf_pos ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_NNF_POS)
+ let is_nnf_neg ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_NNF_NEG)
+ let is_nnf_star ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_NNF_STAR)
+ let is_cnf_star ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_CNF_STAR)
+ let is_skolemize ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_SKOLEMIZE)
+ let is_modus_ponens_oeq ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_MODUS_PONENS_OEQ)
+ let is_theory_lemma ( x : expr ) = (AST.is_app (Expr.ast_of_expr x)) && (FuncDecl.get_decl_kind (Expr.get_func_decl x) == OP_PR_TH_LEMMA)
+end
+
+
+module Goal =
+struct
+ type goal = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : goal = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.goal_inc_ref ;
+ dec_ref = Z3native.goal_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let get_precision ( x : goal ) =
+ goal_prec_of_int (Z3native.goal_precision (z3obj_gnc x) (z3obj_gno x))
+
+ let is_precise ( x : goal ) =
+ (get_precision x) == GOAL_PRECISE
+
+ let is_underapproximation ( x : goal ) =
+ (get_precision x) == GOAL_UNDER
+
+ let is_overapproximation ( x : goal ) =
+ (get_precision x) == GOAL_OVER
+
+ let is_garbage ( x : goal ) =
+ (get_precision x) == GOAL_UNDER_OVER
+
+ let add ( x : goal ) ( constraints : expr list ) =
+ let f e = Z3native.goal_assert (z3obj_gnc x) (z3obj_gno x) (Expr.gno e) in
+ ignore (List.map f constraints) ;
+ ()
+
+ let is_inconsistent ( x : goal ) =
+ Z3native.goal_inconsistent (z3obj_gnc x) (z3obj_gno x)
+
+ let get_depth ( x : goal ) = Z3native.goal_depth (z3obj_gnc x) (z3obj_gno x)
+
+ let reset ( x : goal ) = Z3native.goal_reset (z3obj_gnc x) (z3obj_gno x)
+
+ let get_size ( x : goal ) = Z3native.goal_size (z3obj_gnc x) (z3obj_gno x)
+
+ let get_formulas ( x : goal ) =
+ let n = get_size x in
+ let f i = ((expr_of_ptr (z3obj_gc x)
+ (Z3native.goal_formula (z3obj_gnc x) (z3obj_gno x) i))) in
+ mk_list f n
+
+ let get_num_exprs ( x : goal ) = Z3native.goal_num_exprs (z3obj_gnc x) (z3obj_gno x)
+
+ let is_decided_sat ( x : goal ) =
+ Z3native.goal_is_decided_sat (z3obj_gnc x) (z3obj_gno x)
+
+ let is_decided_unsat ( x : goal ) =
+ Z3native.goal_is_decided_unsat (z3obj_gnc x) (z3obj_gno x)
+
+ let translate ( x : goal ) ( to_ctx : context ) =
+ create to_ctx (Z3native.goal_translate (z3obj_gnc x) (z3obj_gno x) (context_gno to_ctx))
+
+ let simplify ( x : goal ) ( p : Params.params option ) =
+ let tn = Z3native.mk_tactic (z3obj_gnc x) "simplify" in
+ Z3native.tactic_inc_ref (z3obj_gnc x) tn ;
+ let arn = match p with
+ | None -> Z3native.tactic_apply (z3obj_gnc x) tn (z3obj_gno x)
+ | Some(pn) -> Z3native.tactic_apply_ex (z3obj_gnc x) tn (z3obj_gno x) (z3obj_gno pn)
+ in
+ Z3native.apply_result_inc_ref (z3obj_gnc x) arn ;
+ let sg = Z3native.apply_result_get_num_subgoals (z3obj_gnc x) arn in
+ let res = if sg == 0 then
+ raise (Z3native.Exception "No subgoals")
+ else
+ Z3native.apply_result_get_subgoal (z3obj_gnc x) arn 0 in
+ Z3native.apply_result_dec_ref (z3obj_gnc x) arn ;
+ Z3native.tactic_dec_ref (z3obj_gnc x) tn ;
+ create (z3obj_gc x) res
+
+ let mk_goal ( ctx : context ) ( models : bool ) ( unsat_cores : bool ) ( proofs : bool ) =
+ create ctx (Z3native.mk_goal (context_gno ctx) models unsat_cores proofs)
+
+ let to_string ( x : goal ) = Z3native.goal_to_string (z3obj_gnc x) (z3obj_gno x)
+end
+
+
+module Model =
+struct
+ type model = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : model = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.model_inc_ref ;
+ dec_ref = Z3native.model_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ module FuncInterp =
+ struct
+ type func_interp = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : func_interp = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.func_interp_inc_ref ;
+ dec_ref = Z3native.func_interp_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ module FuncEntry =
+ struct
+ type func_entry = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : func_entry = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.func_entry_inc_ref ;
+ dec_ref = Z3native.func_entry_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let get_value ( x : func_entry ) =
+ expr_of_ptr (z3obj_gc x) (Z3native.func_entry_get_value (z3obj_gnc x) (z3obj_gno x))
+
+ let get_num_args ( x : func_entry ) = Z3native.func_entry_get_num_args (z3obj_gnc x) (z3obj_gno x)
+
+ let get_args ( x : func_entry ) =
+ let n = (get_num_args x) in
+ let f i = (expr_of_ptr (z3obj_gc x) (Z3native.func_entry_get_arg (z3obj_gnc x) (z3obj_gno x) i)) in
+ mk_list f n
+
+ let to_string ( x : func_entry ) =
+ let a = (get_args x) in
+ let f c p = (p ^ (Expr.to_string c) ^ ", ") in
+ "[" ^ List.fold_right f a ((Expr.to_string (get_value x)) ^ "]")
+ end
+
+ let get_num_entries ( x: func_interp ) = Z3native.func_interp_get_num_entries (z3obj_gnc x) (z3obj_gno x)
+
+ let get_entries ( x : func_interp ) =
+ let n = (get_num_entries x) in
+ let f i = (FuncEntry.create (z3obj_gc x) (Z3native.func_interp_get_entry (z3obj_gnc x) (z3obj_gno x) i)) in
+ mk_list f n
+
+ let get_else ( x : func_interp ) = expr_of_ptr (z3obj_gc x) (Z3native.func_interp_get_else (z3obj_gnc x) (z3obj_gno x))
+
+ let get_arity ( x : func_interp ) = Z3native.func_interp_get_arity (z3obj_gnc x) (z3obj_gno x)
+
+ let to_string ( x : func_interp ) =
+ let f c p = (
+ let n = (FuncEntry.get_num_args c) in
+ p ^
+ let g c p = (p ^ (Expr.to_string c) ^ ", ") in
+ (if n > 1 then "[" else "") ^
+ (List.fold_right
+ g
+ (FuncEntry.get_args c)
+ ((if n > 1 then "]" else "") ^ " -> " ^ (Expr.to_string (FuncEntry.get_value c)) ^ ", "))
+ ) in
+ List.fold_right f (get_entries x) ("else -> " ^ (Expr.to_string (get_else x)) ^ "]")
+ end
+
+ let get_const_interp ( x : model ) ( f : func_decl ) =
+ if (FuncDecl.get_arity f) != 0 ||
+ (sort_kind_of_int (Z3native.get_sort_kind (FuncDecl.gnc f) (Z3native.get_range (FuncDecl.gnc f) (FuncDecl.gno f)))) == ARRAY_SORT then
+ raise (Z3native.Exception "Non-zero arity functions and arrays have FunctionInterpretations as a model. Use FuncInterp.")
+ else
+ let np = Z3native.model_get_const_interp (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno f) in
+ if (Z3native.is_null np) then
+ None
+ else
+ Some (expr_of_ptr (z3obj_gc x) np)
+
+ let get_const_interp_e ( x : model ) ( a : expr ) = get_const_interp x (Expr.get_func_decl a)
+
+
+ let rec get_func_interp ( x : model ) ( f : func_decl ) =
+ let sk = (sort_kind_of_int (Z3native.get_sort_kind (z3obj_gnc x) (Z3native.get_range (FuncDecl.gnc f) (FuncDecl.gno f)))) in
+ if (FuncDecl.get_arity f) == 0 then
+ let n = Z3native.model_get_const_interp (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno f) in
+ if (Z3native.is_null n) then
+ None
+ else
+ match sk with
+ | ARRAY_SORT ->
+ if not (Z3native.is_as_array (z3obj_gnc x) n) then
+ raise (Z3native.Exception "Argument was not an array constant")
+ else
+ let fd = Z3native.get_as_array_func_decl (z3obj_gnc x) n in
+ get_func_interp x (func_decl_of_ptr (z3obj_gc x) fd)
+ | _ -> raise (Z3native.Exception "Constant functions do not have a function interpretation; use ConstInterp");
+ else
+ let n = (Z3native.model_get_func_interp (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno f)) in
+ if (Z3native.is_null n) then None else Some (FuncInterp.create (z3obj_gc x) n)
+
+ (** The number of constants that have an interpretation in the model. *)
+ let get_num_consts ( x : model ) = Z3native.model_get_num_consts (z3obj_gnc x) (z3obj_gno x)
+
+ let get_const_decls ( x : model ) =
+ let n = (get_num_consts x) in
+ let f i = func_decl_of_ptr (z3obj_gc x) (Z3native.model_get_const_decl (z3obj_gnc x) (z3obj_gno x) i) in
+ mk_list f n
+
+ let get_num_funcs ( x : model ) = Z3native.model_get_num_funcs (z3obj_gnc x) (z3obj_gno x)
+
+ let get_func_decls ( x : model ) =
+ let n = (get_num_funcs x) in
+ let f i = func_decl_of_ptr (z3obj_gc x) (Z3native.model_get_func_decl (z3obj_gnc x) (z3obj_gno x) i) in
+ mk_list f n
+
+ let get_decls ( x : model ) =
+ let n_funcs = (get_num_funcs x) in
+ let n_consts = (get_num_consts x ) in
+ let f i = func_decl_of_ptr (z3obj_gc x) (Z3native.model_get_func_decl (z3obj_gnc x) (z3obj_gno x) i) in
+ let g i = func_decl_of_ptr (z3obj_gc x) (Z3native.model_get_const_decl (z3obj_gnc x) (z3obj_gno x) i) in
+ (mk_list f n_funcs) @ (mk_list g n_consts)
+
+ let eval ( x : model ) ( t : expr ) ( completion : bool ) =
+ let (r, v) = (Z3native.model_eval (z3obj_gnc x) (z3obj_gno x) (Expr.gno t) completion) in
+ if not r then
+ None
+ else
+ Some(expr_of_ptr (z3obj_gc x) v)
+
+ let evaluate ( x : model ) ( t : expr ) ( completion : bool ) =
+ eval x t completion
+
+ let get_num_sorts ( x : model ) = Z3native.model_get_num_sorts (z3obj_gnc x) (z3obj_gno x)
+
+ let get_sorts ( x : model ) =
+ let n = (get_num_sorts x) in
+ let f i = (sort_of_ptr (z3obj_gc x) (Z3native.model_get_sort (z3obj_gnc x) (z3obj_gno x) i)) in
+ mk_list f n
+
+ let sort_universe ( x : model ) ( s : sort ) =
+ let n_univ = AST.ASTVector.create (z3obj_gc x) (Z3native.model_get_sort_universe (z3obj_gnc x) (z3obj_gno x) (Sort.gno s)) in
+ let n = (AST.ASTVector.get_size n_univ) in
+ let f i = (AST.ASTVector.get n_univ i) in
+ mk_list f n
+
+ let to_string ( x : model ) = Z3native.model_to_string (z3obj_gnc x) (z3obj_gno x)
+end
+
+
+module Probe =
+struct
+ type probe = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : probe = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.probe_inc_ref ;
+ dec_ref = Z3native.probe_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+
+ let apply ( x : probe ) ( g : Goal.goal ) =
+ Z3native.probe_apply (z3obj_gnc x) (z3obj_gno x) (z3obj_gno g)
+
+ let get_num_probes ( ctx : context ) =
+ Z3native.get_num_probes (context_gno ctx)
+
+ let get_probe_names ( ctx : context ) =
+ let n = (get_num_probes ctx) in
+ let f i = (Z3native.get_probe_name (context_gno ctx) i) in
+ mk_list f n
+
+ let get_probe_description ( ctx : context ) ( name : string ) =
+ Z3native.probe_get_descr (context_gno ctx) name
+
+ let mk_probe ( ctx : context ) ( name : string ) =
+ (create ctx (Z3native.mk_probe (context_gno ctx) name))
+
+ let const ( ctx : context ) ( v : float ) =
+ (create ctx (Z3native.probe_const (context_gno ctx) v))
+
+ let lt ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_lt (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let gt ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_gt (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let le ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_le (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let ge ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_ge (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let eq ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_eq (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let and_ ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_and (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let or_ ( ctx : context ) ( p1 : probe ) ( p2 : probe ) =
+ (create ctx (Z3native.probe_or (context_gno ctx) (z3obj_gno p1) (z3obj_gno p2)))
+
+ let not_ ( ctx : context ) ( p : probe ) =
+ (create ctx (Z3native.probe_not (context_gno ctx) (z3obj_gno p)))
+end
+
+
+module Tactic =
+struct
+ type tactic = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : tactic = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.tactic_inc_ref ;
+ dec_ref = Z3native.tactic_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ module ApplyResult =
+ struct
+ type apply_result = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : apply_result = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.apply_result_inc_ref ;
+ dec_ref = Z3native.apply_result_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let get_num_subgoals ( x : apply_result ) =
+ Z3native.apply_result_get_num_subgoals (z3obj_gnc x) (z3obj_gno x)
+
+ let get_subgoals ( x : apply_result ) =
+ let n = (get_num_subgoals x) in
+ let f i = Goal.create (z3obj_gc x) (Z3native.apply_result_get_subgoal (z3obj_gnc x) (z3obj_gno x) i) in
+ mk_list f n
+
+ let get_subgoal ( x : apply_result ) ( i : int ) =
+ Goal.create (z3obj_gc x) (Z3native.apply_result_get_subgoal (z3obj_gnc x) (z3obj_gno x) i)
+
+ let convert_model ( x : apply_result ) ( i : int ) ( m : Model.model ) =
+ Model.create (z3obj_gc x) (Z3native.apply_result_convert_model (z3obj_gnc x) (z3obj_gno x) i (z3obj_gno m))
+
+ let to_string ( x : apply_result ) = Z3native.apply_result_to_string (z3obj_gnc x) (z3obj_gno x)
+ end
+
+ let get_help ( x : tactic ) = Z3native.tactic_get_help (z3obj_gnc x) (z3obj_gno x)
+
+ let get_param_descrs ( x : tactic ) =
+ Params.ParamDescrs.param_descrs_of_ptr (z3obj_gc x) (Z3native.tactic_get_param_descrs (z3obj_gnc x) (z3obj_gno x))
+
+ let apply ( x : tactic ) ( g : Goal.goal ) ( p : Params.params option ) =
+ match p with
+ | None -> (ApplyResult.create (z3obj_gc x) (Z3native.tactic_apply (z3obj_gnc x) (z3obj_gno x) (z3obj_gno g)))
+ | Some (pn) -> (ApplyResult.create (z3obj_gc x) (Z3native.tactic_apply_ex (z3obj_gnc x) (z3obj_gno x) (z3obj_gno g) (z3obj_gno pn)))
+
+ let get_num_tactics ( ctx : context ) = Z3native.get_num_tactics (context_gno ctx)
+
+ let get_tactic_names ( ctx : context ) =
+ let n = (get_num_tactics ctx ) in
+ let f i = (Z3native.get_tactic_name (context_gno ctx) i) in
+ mk_list f n
+
+ let get_tactic_description ( ctx : context ) ( name : string ) =
+ Z3native.tactic_get_descr (context_gno ctx) name
+
+ let mk_tactic ( ctx : context ) ( name : string ) =
+ create ctx (Z3native.mk_tactic (context_gno ctx) name)
+
+ let and_then ( ctx : context ) ( t1 : tactic ) ( t2 : tactic ) ( ts : tactic list ) =
+ let f p c = (match p with
+ | None -> (Some (z3obj_gno c))
+ | Some(x) -> (Some (Z3native.tactic_and_then (context_gno ctx) (z3obj_gno c) x))) in
+ match (List.fold_left f None ts) with
+ | None ->
+ create ctx (Z3native.tactic_and_then (context_gno ctx) (z3obj_gno t1) (z3obj_gno t2))
+ | Some(x) ->
+ let o = (Z3native.tactic_and_then (context_gno ctx) (z3obj_gno t2) x) in
+ create ctx (Z3native.tactic_and_then (context_gno ctx) (z3obj_gno t1) o)
+
+ let or_else ( ctx : context ) ( t1 : tactic ) ( t2 : tactic ) =
+ create ctx (Z3native.tactic_or_else (context_gno ctx) (z3obj_gno t1) (z3obj_gno t2))
+
+ let try_for ( ctx : context ) ( t : tactic ) ( ms : int ) =
+ create ctx (Z3native.tactic_try_for (context_gno ctx) (z3obj_gno t) ms)
+
+ let when_ ( ctx : context ) ( p : Probe.probe ) ( t : tactic ) =
+ create ctx (Z3native.tactic_when (context_gno ctx) (z3obj_gno p) (z3obj_gno t))
+
+ let cond ( ctx : context ) ( p : Probe.probe ) ( t1 : tactic ) ( t2 : tactic ) =
+ create ctx (Z3native.tactic_cond (context_gno ctx) (z3obj_gno p) (z3obj_gno t1) (z3obj_gno t2))
+
+ let repeat ( ctx : context ) ( t : tactic ) ( max : int ) =
+ create ctx (Z3native.tactic_repeat (context_gno ctx) (z3obj_gno t) max)
+
+ let skip ( ctx : context ) =
+ create ctx (Z3native.tactic_skip (context_gno ctx))
+
+ let fail ( ctx : context ) =
+ create ctx (Z3native.tactic_fail (context_gno ctx))
+
+ let fail_if ( ctx : context ) ( p : Probe.probe ) =
+ create ctx (Z3native.tactic_fail_if (context_gno ctx) (z3obj_gno p))
+
+ let fail_if_not_decided ( ctx : context ) =
+ create ctx (Z3native.tactic_fail_if_not_decided (context_gno ctx))
+
+ let using_params ( ctx : context ) ( t : tactic ) ( p : Params.params ) =
+ create ctx (Z3native.tactic_using_params (context_gno ctx) (z3obj_gno t) (z3obj_gno p))
+
+ let with_ ( ctx : context ) ( t : tactic ) ( p : Params.params ) =
+ using_params ctx t p
+
+ let par_or ( ctx : context ) ( t : tactic list ) =
+ let f e = (z3obj_gno e) in
+ create ctx (Z3native.tactic_par_or (context_gno ctx) (List.length t) (Array.of_list (List.map f t)))
+
+ let par_and_then ( ctx : context ) ( t1 : tactic ) ( t2 : tactic ) =
+ create ctx (Z3native.tactic_par_and_then (context_gno ctx) (z3obj_gno t1) (z3obj_gno t2))
+
+ let interrupt ( ctx : context ) =
+ Z3native.interrupt (context_gno ctx)
+end
+
+
+module Solver =
+struct
+ type solver = z3_native_object
+ type status = UNSATISFIABLE | UNKNOWN | SATISFIABLE
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : solver = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.solver_inc_ref ;
+ dec_ref = Z3native.solver_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+ let string_of_status ( s : status) = match s with
+ | UNSATISFIABLE -> "unsatisfiable"
+ | SATISFIABLE -> "satisfiable"
+ | _ -> "unknown"
+
+ module Statistics =
+ struct
+ type statistics = z3_native_object
+
+ let create ( ctx : context ) ( no : Z3native.ptr ) =
+ let res : statistics = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.stats_inc_ref ;
+ dec_ref = Z3native.stats_dec_ref } in
+ (z3obj_sno res ctx no) ;
+ (z3obj_create res) ;
+ res
+
+
+ module Entry =
+ struct
+ type statistics_entry = {
+ mutable m_key : string;
+ mutable m_is_int : bool ;
+ mutable m_is_float : bool ;
+ mutable m_int : int ;
+ mutable m_float : float }
+
+ let create_si k v =
+ let res : statistics_entry = {
+ m_key = k ;
+ m_is_int = true ;
+ m_is_float = false ;
+ m_int = v ;
+ m_float = 0.0
+ } in
+ res
+
+ let create_sd k v =
+ let res : statistics_entry = {
+ m_key = k ;
+ m_is_int = false ;
+ m_is_float = true ;
+ m_int = 0 ;
+ m_float = v
+ } in
+ res
+
+
+ let get_key (x : statistics_entry) = x.m_key
+ let get_int (x : statistics_entry) = x.m_int
+ let get_float (x : statistics_entry) = x.m_float
+ let is_int (x : statistics_entry) = x.m_is_int
+ let is_float (x : statistics_entry) = x.m_is_float
+ let to_string_value (x : statistics_entry) =
+ if (is_int x) then
+ string_of_int (get_int x)
+ else if (is_float x) then
+ string_of_float (get_float x)
+ else
+ raise (Z3native.Exception "Unknown statistical entry type")
+ let to_string ( x : statistics_entry ) = (get_key x) ^ ": " ^ (to_string_value x)
+ end
+
+ let to_string ( x : statistics ) = Z3native.stats_to_string (z3obj_gnc x) (z3obj_gno x)
+
+ let get_size ( x : statistics ) = Z3native.stats_size (z3obj_gnc x) (z3obj_gno x)
+
+ let get_entries ( x : statistics ) =
+ let n = (get_size x ) in
+ let f i = (
+ let k = Z3native.stats_get_key (z3obj_gnc x) (z3obj_gno x) i in
+ if (Z3native.stats_is_uint (z3obj_gnc x) (z3obj_gno x) i) then
+ (Entry.create_si k (Z3native.stats_get_uint_value (z3obj_gnc x) (z3obj_gno x) i))
+ else
+ (Entry.create_sd k (Z3native.stats_get_double_value (z3obj_gnc x) (z3obj_gno x) i))
+ ) in
+ mk_list f n
+
+ let get_keys ( x : statistics ) =
+ let n = (get_size x) in
+ let f i = (Z3native.stats_get_key (z3obj_gnc x) (z3obj_gno x) i) in
+ mk_list f n
+
+ let get ( x : statistics ) ( key : string ) =
+ let f p c = (if ((Entry.get_key c) == key) then (Some c) else p) in
+ List.fold_left f None (get_entries x)
+ end
+
+ let get_help ( x : solver ) = Z3native.solver_get_help (z3obj_gnc x) (z3obj_gno x)
+
+ let set_parameters ( x : solver ) ( p : Params.params )=
+ Z3native.solver_set_params (z3obj_gnc x) (z3obj_gno x) (z3obj_gno p)
+
+ let get_param_descrs ( x : solver ) =
+ Params.ParamDescrs.param_descrs_of_ptr (z3obj_gc x) (Z3native.solver_get_param_descrs (z3obj_gnc x) (z3obj_gno x))
+
+ let get_num_scopes ( x : solver ) = Z3native.solver_get_num_scopes (z3obj_gnc x) (z3obj_gno x)
+
+ let push ( x : solver ) = Z3native.solver_push (z3obj_gnc x) (z3obj_gno x)
+
+ let pop ( x : solver ) ( n : int ) = Z3native.solver_pop (z3obj_gnc x) (z3obj_gno x) n
+
+ let reset ( x : solver ) = Z3native.solver_reset (z3obj_gnc x) (z3obj_gno x)
+
+ let add ( x : solver ) ( constraints : expr list ) =
+ let f e = (Z3native.solver_assert (z3obj_gnc x) (z3obj_gno x) (Expr.gno e)) in
+ ignore (List.map f constraints)
+
+ let assert_and_track_l ( x : solver ) ( cs : expr list ) ( ps : expr list ) =
+ if ((List.length cs) != (List.length ps)) then
+ raise (Z3native.Exception "Argument size mismatch")
+ else
+ let f a b = (Z3native.solver_assert_and_track (z3obj_gnc x) (z3obj_gno x) (Expr.gno a) (Expr.gno b)) in
+ ignore (List.iter2 f cs ps)
+
+ let assert_and_track ( x : solver ) ( c : expr ) ( p : expr ) =
+ Z3native.solver_assert_and_track (z3obj_gnc x) (z3obj_gno x) (Expr.gno c) (Expr.gno p)
+
+ let get_num_assertions ( x : solver ) =
+ let a = AST.ASTVector.create (z3obj_gc x) (Z3native.solver_get_assertions (z3obj_gnc x) (z3obj_gno x)) in
+ (AST.ASTVector.get_size a)
+
+ let get_assertions ( x : solver ) =
+ let a = AST.ASTVector.create (z3obj_gc x) (Z3native.solver_get_assertions (z3obj_gnc x) (z3obj_gno x)) in
+ let n = (AST.ASTVector.get_size a) in
+ let f i = (expr_of_ptr (z3obj_gc x) (z3obj_gno (AST.ASTVector.get a i))) in
+ mk_list f n
+
+ let check ( x : solver ) ( assumptions : expr list ) =
+ let r =
+ if ((List.length assumptions) == 0) then
+ lbool_of_int (Z3native.solver_check (z3obj_gnc x) (z3obj_gno x))
+ else
+ let f x = (Expr.gno x) in
+ lbool_of_int (Z3native.solver_check_assumptions (z3obj_gnc x) (z3obj_gno x) (List.length assumptions) (Array.of_list (List.map f assumptions)))
+ in
+ match r with
+ | L_TRUE -> SATISFIABLE
+ | L_FALSE -> UNSATISFIABLE
+ | _ -> UNKNOWN
+
+ let get_model ( x : solver ) =
+ let q = Z3native.solver_get_model (z3obj_gnc x) (z3obj_gno x) in
+ if (Z3native.is_null q) then
+ None
+ else
+ Some (Model.create (z3obj_gc x) q)
+
+ let get_proof ( x : solver ) =
+ let q = Z3native.solver_get_proof (z3obj_gnc x) (z3obj_gno x) in
+ if (Z3native.is_null q) then
+ None
+ else
+ Some (expr_of_ptr (z3obj_gc x) q)
+
+ let get_unsat_core ( x : solver ) =
+ let cn = AST.ASTVector.create (z3obj_gc x) (Z3native.solver_get_unsat_core (z3obj_gnc x) (z3obj_gno x)) in
+ let n = (AST.ASTVector.get_size cn) in
+ let f i = (AST.ASTVector.get cn i) in
+ mk_list f n
+
+ let get_reason_unknown ( x : solver ) = Z3native.solver_get_reason_unknown (z3obj_gnc x) (z3obj_gno x)
+
+ let get_statistics ( x : solver ) =
+ (Statistics.create (z3obj_gc x) (Z3native.solver_get_statistics (z3obj_gnc x) (z3obj_gno x)))
+
+ let mk_solver ( ctx : context ) ( logic : Symbol.symbol option ) =
+ match logic with
+ | None -> (create ctx (Z3native.mk_solver (context_gno ctx)))
+ | Some (x) -> (create ctx (Z3native.mk_solver_for_logic (context_gno ctx) (Symbol.gno x)))
+
+ let mk_solver_s ( ctx : context ) ( logic : string ) =
+ mk_solver ctx (Some (Symbol.mk_string ctx logic))
+
+ let mk_simple_solver ( ctx : context ) =
+ (create ctx (Z3native.mk_simple_solver (context_gno ctx)))
+
+ let mk_solver_t ( ctx : context ) ( t : Tactic.tactic ) =
+ (create ctx (Z3native.mk_solver_from_tactic (context_gno ctx) (z3obj_gno t)))
+
+ let to_string ( x : solver ) = Z3native.solver_to_string (z3obj_gnc x) (z3obj_gno x)
+end
+
+
+module Fixedpoint =
+struct
+ type fixedpoint = z3_native_object
+
+ let create ( ctx : context ) =
+ let res : fixedpoint = { m_ctx = ctx ;
+ m_n_obj = null ;
+ inc_ref = Z3native.fixedpoint_inc_ref ;
+ dec_ref = Z3native.fixedpoint_dec_ref } in
+ (z3obj_sno res ctx (Z3native.mk_fixedpoint (context_gno ctx))) ;
+ (z3obj_create res) ;
+ res
+
+
+ let get_help ( x : fixedpoint ) =
+ Z3native.fixedpoint_get_help (z3obj_gnc x) (z3obj_gno x)
+
+ let set_params ( x : fixedpoint ) ( p : Params.params )=
+ Z3native.fixedpoint_set_params (z3obj_gnc x) (z3obj_gno x) (z3obj_gno p)
+
+ let get_param_descrs ( x : fixedpoint ) =
+ Params.ParamDescrs.param_descrs_of_ptr (z3obj_gc x) (Z3native.fixedpoint_get_param_descrs (z3obj_gnc x) (z3obj_gno x))
+
+ let add ( x : fixedpoint ) ( constraints : expr list ) =
+ let f e = (Z3native.fixedpoint_assert (z3obj_gnc x) (z3obj_gno x) (Expr.gno e)) in
+ ignore (List.map f constraints) ;
+ ()
+
+ let register_relation ( x : fixedpoint ) ( f : func_decl ) =
+ Z3native.fixedpoint_register_relation (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno f)
+
+ let add_rule ( x : fixedpoint ) ( rule : expr ) ( name : Symbol.symbol option ) =
+ match name with
+ | None -> Z3native.fixedpoint_add_rule (z3obj_gnc x) (z3obj_gno x) (Expr.gno rule) null
+ | Some(y) -> Z3native.fixedpoint_add_rule (z3obj_gnc x) (z3obj_gno x) (Expr.gno rule) (Symbol.gno y)
+
+ let add_fact ( x : fixedpoint ) ( pred : func_decl ) ( args : int list ) =
+ Z3native.fixedpoint_add_fact (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno pred) (List.length args) (Array.of_list args)
+
+ let query ( x : fixedpoint ) ( query : expr ) =
+ match (lbool_of_int (Z3native.fixedpoint_query (z3obj_gnc x) (z3obj_gno x) (Expr.gno query))) with
+ | L_TRUE -> Solver.SATISFIABLE
+ | L_FALSE -> Solver.UNSATISFIABLE
+ | _ -> Solver.UNKNOWN
+
+ let query_r ( x : fixedpoint ) ( relations : func_decl list ) =
+ let f x = ptr_of_ast (ast_of_func_decl x) in
+ match (lbool_of_int (Z3native.fixedpoint_query_relations (z3obj_gnc x) (z3obj_gno x) (List.length relations) (Array.of_list (List.map f relations)))) with
+ | L_TRUE -> Solver.SATISFIABLE
+ | L_FALSE -> Solver.UNSATISFIABLE
+ | _ -> Solver.UNKNOWN
+
+ let push ( x : fixedpoint ) =
+ Z3native.fixedpoint_push (z3obj_gnc x) (z3obj_gno x)
+
+ let pop ( x : fixedpoint ) =
+ Z3native.fixedpoint_pop (z3obj_gnc x) (z3obj_gno x)
+
+ let update_rule ( x : fixedpoint ) ( rule : expr ) ( name : Symbol.symbol ) =
+ Z3native.fixedpoint_update_rule (z3obj_gnc x) (z3obj_gno x) (Expr.gno rule) (Symbol.gno name)
+
+ let get_answer ( x : fixedpoint ) =
+ let q = (Z3native.fixedpoint_get_answer (z3obj_gnc x) (z3obj_gno x)) in
+ if (Z3native.is_null q) then
+ None
+ else
+ Some (expr_of_ptr (z3obj_gc x) q)
+
+ let get_reason_unknown ( x : fixedpoint ) =
+ Z3native.fixedpoint_get_reason_unknown (z3obj_gnc x) (z3obj_gno x)
+
+ let get_num_levels ( x : fixedpoint ) ( predicate : func_decl ) =
+ Z3native.fixedpoint_get_num_levels (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno predicate)
+
+ let get_cover_delta ( x : fixedpoint ) ( level : int ) ( predicate : func_decl ) =
+ let q = (Z3native.fixedpoint_get_cover_delta (z3obj_gnc x) (z3obj_gno x) level (FuncDecl.gno predicate)) in
+ if (Z3native.is_null q) then
+ None
+ else
+ Some (expr_of_ptr (z3obj_gc x) q)
+
+ let add_cover ( x : fixedpoint ) ( level : int ) ( predicate : func_decl ) ( property : expr ) =
+ Z3native.fixedpoint_add_cover (z3obj_gnc x) (z3obj_gno x) level (FuncDecl.gno predicate) (Expr.gno property)
+
+ let to_string ( x : fixedpoint ) = Z3native.fixedpoint_to_string (z3obj_gnc x) (z3obj_gno x) 0 [||]
+
+ let set_predicate_representation ( x : fixedpoint ) ( f : func_decl ) ( kinds : Symbol.symbol list ) =
+ Z3native.fixedpoint_set_predicate_representation (z3obj_gnc x) (z3obj_gno x) (FuncDecl.gno f) (List.length kinds) (Symbol.symbol_lton kinds)
+
+ let to_string_q ( x : fixedpoint ) ( queries : expr list ) =
+ let f x = Expr.gno x in
+ Z3native.fixedpoint_to_string (z3obj_gnc x) (z3obj_gno x) (List.length queries) (Array.of_list (List.map f queries))
+
+ let get_rules ( x : fixedpoint ) =
+ let v = (AST.ASTVector.create (z3obj_gc x) (Z3native.fixedpoint_get_rules (z3obj_gnc x) (z3obj_gno x))) in
+ let n = (AST.ASTVector.get_size v) in
+ let f i =(expr_of_ptr (z3obj_gc x) (z3obj_gno (AST.ASTVector.get v i))) in
+ mk_list f n
+
+ let get_assertions ( x : fixedpoint ) =
+ let v = (AST.ASTVector.create (z3obj_gc x) (Z3native.fixedpoint_get_assertions (z3obj_gnc x) (z3obj_gno x))) in
+ let n = (AST.ASTVector.get_size v) in
+ let f i =(expr_of_ptr (z3obj_gc x) (z3obj_gno (AST.ASTVector.get v i))) in
+ mk_list f n
+
+ let mk_fixedpoint ( ctx : context ) = create ctx
+end
+
+
+module SMT =
+struct
+ let benchmark_to_smtstring ( ctx : context ) ( name : string ) ( logic : string ) ( status : string ) ( attributes : string ) ( assumptions : expr list ) ( formula : expr ) =
+ Z3native.benchmark_to_smtlib_string (context_gno ctx) name logic status attributes
+ (List.length assumptions) (let f x = Expr.gno (x) in (Array.of_list (List.map f assumptions)))
+ (Expr.gno formula)
+
+ let parse_smtlib_string ( ctx : context ) ( str : string ) ( sort_names : Symbol.symbol list ) ( sorts : sort list ) ( decl_names : Symbol.symbol list ) ( decls : func_decl list ) =
+ let csn = (List.length sort_names) in
+ let cs = (List.length sorts) in
+ let cdn = (List.length decl_names) in
+ let cd = (List.length decls) in
+ if (csn != cs || cdn != cd) then
+ raise (Z3native.Exception "Argument size mismatch")
+ else
+ Z3native.parse_smtlib_string (context_gno ctx) str
+ cs
+ (Symbol.symbol_lton sort_names)
+ (sort_lton sorts)
+ cd
+ (Symbol.symbol_lton decl_names)
+ (let f x = FuncDecl.gno x in (Array.of_list (List.map f decls)))
+
+ let parse_smtlib_file ( ctx : context ) ( file_name : string ) ( sort_names : Symbol.symbol list ) ( sorts : sort list ) ( decl_names : Symbol.symbol list ) ( decls : func_decl list ) =
+ let csn = (List.length sort_names) in
+ let cs = (List.length sorts) in
+ let cdn = (List.length decl_names) in
+ let cd = (List.length decls) in
+ if (csn != cs || cdn != cd) then
+ raise (Z3native.Exception "Argument size mismatch")
+ else
+ Z3native.parse_smtlib_file (context_gno ctx) file_name
+ cs
+ (Symbol.symbol_lton sort_names)
+ (sort_lton sorts)
+ cd
+ (Symbol.symbol_lton decl_names)
+ (let f x = FuncDecl.gno x in (Array.of_list (List.map f decls)))
+
+ let get_num_smtlib_formulas ( ctx : context ) = Z3native.get_smtlib_num_formulas (context_gno ctx)
+
+ let get_smtlib_formulas ( ctx : context ) =
+ let n = (get_num_smtlib_formulas ctx ) in
+ let f i =(expr_of_ptr ctx (Z3native.get_smtlib_formula (context_gno ctx) i)) in
+ mk_list f n
+
+ let get_num_smtlib_assumptions ( ctx : context ) = Z3native.get_smtlib_num_assumptions (context_gno ctx)
+
+ let get_smtlib_assumptions ( ctx : context ) =
+ let n = (get_num_smtlib_assumptions ctx ) in
+ let f i = (expr_of_ptr ctx (Z3native.get_smtlib_assumption (context_gno ctx) i)) in
+ mk_list f n
+
+ let get_num_smtlib_decls ( ctx : context ) = Z3native.get_smtlib_num_decls (context_gno ctx)
+
+ let get_smtlib_decls ( ctx : context ) =
+ let n = (get_num_smtlib_decls ctx) in
+ let f i = func_decl_of_ptr ctx (Z3native.get_smtlib_decl (context_gno ctx) i) in
+ mk_list f n
+
+ let get_num_smtlib_sorts ( ctx : context ) = Z3native.get_smtlib_num_sorts (context_gno ctx)
+
+ let get_smtlib_sorts ( ctx : context ) =
+ let n = (get_num_smtlib_sorts ctx) in
+ let f i = (sort_of_ptr ctx (Z3native.get_smtlib_sort (context_gno ctx) i)) in
+ mk_list f n
+
+ let parse_smtlib2_string ( ctx : context ) ( str : string ) ( sort_names : Symbol.symbol list ) ( sorts : sort list ) ( decl_names : Symbol.symbol list ) ( decls : func_decl list ) =
+ let csn = (List.length sort_names) in
+ let cs = (List.length sorts) in
+ let cdn = (List.length decl_names) in
+ let cd = (List.length decls) in
+ if (csn != cs || cdn != cd) then
+ raise (Z3native.Exception "Argument size mismatch")
+ else
+ (expr_of_ptr ctx (Z3native.parse_smtlib2_string (context_gno ctx) str
+ cs
+ (Symbol.symbol_lton sort_names)
+ (sort_lton sorts)
+ cd
+ (Symbol.symbol_lton decl_names)
+ (let f x = FuncDecl.gno x in (Array.of_list (List.map f decls)))))
+
+ let parse_smtlib2_file ( ctx : context ) ( file_name : string ) ( sort_names : Symbol.symbol list ) ( sorts : sort list ) ( decl_names : Symbol.symbol list ) ( decls : func_decl list ) =
+ let csn = (List.length sort_names) in
+ let cs = (List.length sorts) in
+ let cdn = (List.length decl_names) in
+ let cd = (List.length decls) in
+ if (csn != cs || cdn != cd) then
+ raise (Z3native.Exception "Argument size mismatch")
+ else
+ (expr_of_ptr ctx (Z3native.parse_smtlib2_string (context_gno ctx) file_name
+ cs
+ (Symbol.symbol_lton sort_names)
+ (sort_lton sorts)
+ cd
+ (Symbol.symbol_lton decl_names)
+ (let f x = FuncDecl.gno x in (Array.of_list (List.map f decls)))))
+end
+
+module Interpolation =
+struct
+ let mk_interpolant ( ctx : context ) ( a : expr ) =
+ (expr_of_ptr ctx (Z3native.mk_interpolant (context_gno ctx) (Expr.gno a)))
+
+ let mk_interpolation_context ( settings : ( string * string ) list ) =
+ let cfg = Z3native.mk_config () in
+ let f e = (Z3native.set_param_value cfg (fst e) (snd e)) in
+ (List.iter f settings) ;
+ let v = Z3native.mk_interpolation_context cfg in
+ Z3native.del_config(cfg) ;
+ Z3native.set_ast_print_mode v (int_of_ast_print_mode PRINT_SMTLIB2_COMPLIANT) ;
+ Z3native.set_internal_error_handler v ;
+ let res = { m_n_ctx = v; m_n_obj_cnt = 0 } in
+ let f = fun o -> dispose_context o in
+ Gc.finalise f res;
+ res
+
+ let get_interpolant ( ctx : context ) ( pf : expr ) ( pat: expr ) ( p : Params.params ) =
+ (ASTVector.create ctx (Z3native.get_interpolant (context_gno ctx) (Expr.gno pf) (Expr.gno pat) (z3obj_gno p)))
+
+ let compute_interpolant ( ctx : context ) ( pat : expr ) ( p : Params.params ) =
+ let (r, interp, model) = (Z3native.compute_interpolant (context_gno ctx) (Expr.gno pat) (z3obj_gno p)) in
+ match (lbool_of_int r) with
+ | L_TRUE -> ((ASTVector.create ctx interp), (Model.create ctx model))
+ | _ -> raise (Z3native.Exception "Error computing interpolant.")
+
+ let get_interpolation_profile ( ctx : context ) =
+ (Z3native.interpolation_profile (context_gno ctx))
+
+ let read_interpolation_problem ( ctx : context ) ( filename : string ) =
+ let (r, num, cnsts, parents, error, num_theory, theory) = (Z3native.read_interpolation_problem (context_gno ctx) filename) in
+ match r with
+ | 0 -> raise (Z3native.Exception "Interpolation problem could not be read.")
+ | _ ->
+ let f1 i = (expr_of_ptr ctx (Array.get cnsts i)) in
+ let f2 i = (Array.get parents i) in
+ let f3 i = (expr_of_ptr ctx (Array.get theory i)) in
+ ((mk_list f1 num),
+ (mk_list f2 num),
+ (mk_list f3 num_theory))
+
+ let check_interpolant ( ctx : context ) ( num : int ) ( cnsts : Expr.expr list ) ( parents : int list ) ( interps : Expr.expr list ) ( num_theory : int ) ( theory : Expr.expr list ) =
+ let (r, str) = (Z3native.check_interpolant (context_gno ctx)
+ num
+ (let f x = Expr.gno x in (Array.of_list (List.map f cnsts)))
+ (Array.of_list parents)
+ (let f x = Expr.gno x in (Array.of_list (List.map f interps)))
+ num_theory
+ (let f x = Expr.gno x in (Array.of_list (List.map f theory)))) in
+ match (lbool_of_int r) with
+ | L_UNDEF -> raise (Z3native.Exception "Interpolant could not be verified.")
+ | L_FALSE -> raise (Z3native.Exception "Interpolant could not be verified.")
+ | _ -> ()
+
+ let write_interpolation_problem ( ctx : context ) ( num : int ) ( cnsts : Expr.expr list ) ( parents : int list ) ( filename : string ) ( num_theory : int ) ( theory : Expr.expr list ) =
+ (Z3native.write_interpolation_problem (context_gno ctx) num (expr_lton cnsts) (Array.of_list parents) filename num_theory (expr_lton theory)) ;
+ ()
+end
+
+let set_global_param ( id : string ) ( value : string ) =
+ (Z3native.global_param_set id value)
+
+let get_global_param ( id : string ) =
+ let (r, v) = (Z3native.global_param_get id) in
+ if not r then
+ None
+ else
+ Some v
+
+let global_param_reset_all =
+ Z3native.global_param_reset_all
+
+let toggle_warning_messages ( enabled: bool ) =
+ Z3native.toggle_warning_messages enabled
diff --git a/src/api/ml/z3.mli b/src/api/ml/z3.mli
index 2eb9eecb7..aa526417e 100644
--- a/src/api/ml/z3.mli
+++ b/src/api/ml/z3.mli
@@ -1,9588 +1,3331 @@
-(* File generated from z3.idl *)
+(**
+ The Z3 ML/OCaml Interface.
+ Copyright (C) 2012 Microsoft Corporation
+ @author CM Wintersteiger (cwinter) 2012-12-17
+*)
+
+(** General Z3 exceptions
+
+ Many functions in this API may throw an exception; if they do, it is this one.*)
+exception Error of string
+
+(** Context objects.
+
+ Most interactions with Z3 are interpreted in some context; many users will only
+ require one such object, but power users may require more than one. To start using
+ Z3, do
+
+
+ let ctx = (mk_context []) in
+ (...)
+
+
+ where a list of pairs of strings may be passed to set options on
+ the context, e.g., like so:
+
+
+ let cfg = [("model", "true"); ("...", "...")] in
+ let ctx = (mk_context cfg) in
+ (...)
+
+*)
type context
-and symbol
-and ast
-and sort = private ast
-and func_decl = private ast
-and app = private ast
-and pattern = private ast
-and params
-and param_descrs
-and model
-and func_interp
-and func_entry
-and fixedpoint
-and ast_vector
-and ast_map
-and goal
-and tactic
-and probe
-and apply_result
-and solver
-and stats
-
-
-and constructor
-and constructor_list
-
-and lbool =
- | L_FALSE
- | L_UNDEF
- | L_TRUE
-
-and symbol_kind =
- | INT_SYMBOL
- | STRING_SYMBOL
-
-and parameter_kind =
- | PARAMETER_INT
- | PARAMETER_DOUBLE
- | PARAMETER_RATIONAL
- | PARAMETER_SYMBOL
- | PARAMETER_SORT
- | PARAMETER_AST
- | PARAMETER_FUNC_DECL
-
-and sort_kind =
- | UNINTERPRETED_SORT
- | BOOL_SORT
- | INT_SORT
- | REAL_SORT
- | BV_SORT
- | ARRAY_SORT
- | DATATYPE_SORT
- | RELATION_SORT
- | FINITE_DOMAIN_SORT
- | UNKNOWN_SORT
-
-and ast_kind =
- | NUMERAL_AST
- | APP_AST
- | VAR_AST
- | QUANTIFIER_AST
- | SORT_AST
- | FUNC_DECL_AST
- | UNKNOWN_AST
-
-and decl_kind =
- | OP_TRUE
- | OP_FALSE
- | OP_EQ
- | OP_DISTINCT
- | OP_ITE
- | OP_AND
- | OP_OR
- | OP_IFF
- | OP_XOR
- | OP_NOT
- | OP_IMPLIES
- | OP_OEQ
- | OP_ANUM
- | OP_AGNUM
- | OP_LE
- | OP_GE
- | OP_LT
- | OP_GT
- | OP_ADD
- | OP_SUB
- | OP_UMINUS
- | OP_MUL
- | OP_DIV
- | OP_IDIV
- | OP_REM
- | OP_MOD
- | OP_TO_REAL
- | OP_TO_INT
- | OP_IS_INT
- | OP_POWER
- | OP_STORE
- | OP_SELECT
- | OP_CONST_ARRAY
- | OP_ARRAY_MAP
- | OP_ARRAY_DEFAULT
- | OP_SET_UNION
- | OP_SET_INTERSECT
- | OP_SET_DIFFERENCE
- | OP_SET_COMPLEMENT
- | OP_SET_SUBSET
- | OP_AS_ARRAY
- | OP_BNUM
- | OP_BIT1
- | OP_BIT0
- | OP_BNEG
- | OP_BADD
- | OP_BSUB
- | OP_BMUL
- | OP_BSDIV
- | OP_BUDIV
- | OP_BSREM
- | OP_BUREM
- | OP_BSMOD
- | OP_BSDIV0
- | OP_BUDIV0
- | OP_BSREM0
- | OP_BUREM0
- | OP_BSMOD0
- | OP_ULEQ
- | OP_SLEQ
- | OP_UGEQ
- | OP_SGEQ
- | OP_ULT
- | OP_SLT
- | OP_UGT
- | OP_SGT
- | OP_BAND
- | OP_BOR
- | OP_BNOT
- | OP_BXOR
- | OP_BNAND
- | OP_BNOR
- | OP_BXNOR
- | OP_CONCAT
- | OP_SIGN_EXT
- | OP_ZERO_EXT
- | OP_EXTRACT
- | OP_REPEAT
- | OP_BREDOR
- | OP_BREDAND
- | OP_BCOMP
- | OP_BSHL
- | OP_BLSHR
- | OP_BASHR
- | OP_ROTATE_LEFT
- | OP_ROTATE_RIGHT
- | OP_EXT_ROTATE_LEFT
- | OP_EXT_ROTATE_RIGHT
- | OP_INT2BV
- | OP_BV2INT
- | OP_CARRY
- | OP_XOR3
- | OP_PR_UNDEF
- | OP_PR_TRUE
- | OP_PR_ASSERTED
- | OP_PR_GOAL
- | OP_PR_MODUS_PONENS
- | OP_PR_REFLEXIVITY
- | OP_PR_SYMMETRY
- | OP_PR_TRANSITIVITY
- | OP_PR_TRANSITIVITY_STAR
- | OP_PR_MONOTONICITY
- | OP_PR_QUANT_INTRO
- | OP_PR_DISTRIBUTIVITY
- | OP_PR_AND_ELIM
- | OP_PR_NOT_OR_ELIM
- | OP_PR_REWRITE
- | OP_PR_REWRITE_STAR
- | OP_PR_PULL_QUANT
- | OP_PR_PULL_QUANT_STAR
- | OP_PR_PUSH_QUANT
- | OP_PR_ELIM_UNUSED_VARS
- | OP_PR_DER
- | OP_PR_QUANT_INST
- | OP_PR_HYPOTHESIS
- | OP_PR_LEMMA
- | OP_PR_UNIT_RESOLUTION
- | OP_PR_IFF_TRUE
- | OP_PR_IFF_FALSE
- | OP_PR_COMMUTATIVITY
- | OP_PR_DEF_AXIOM
- | OP_PR_DEF_INTRO
- | OP_PR_APPLY_DEF
- | OP_PR_IFF_OEQ
- | OP_PR_NNF_POS
- | OP_PR_NNF_NEG
- | OP_PR_NNF_STAR
- | OP_PR_CNF_STAR
- | OP_PR_SKOLEMIZE
- | OP_PR_MODUS_PONENS_OEQ
- | OP_PR_TH_LEMMA
- | OP_PR_HYPER_RESOLVE
- | OP_RA_STORE
- | OP_RA_EMPTY
- | OP_RA_IS_EMPTY
- | OP_RA_JOIN
- | OP_RA_UNION
- | OP_RA_WIDEN
- | OP_RA_PROJECT
- | OP_RA_FILTER
- | OP_RA_NEGATION_FILTER
- | OP_RA_RENAME
- | OP_RA_COMPLEMENT
- | OP_RA_SELECT
- | OP_RA_CLONE
- | OP_FD_LT
- | OP_LABEL
- | OP_LABEL_LIT
- | OP_DT_CONSTRUCTOR
- | OP_DT_RECOGNISER
- | OP_DT_ACCESSOR
- | OP_UNINTERPRETED
-
-and param_kind =
- | PK_UINT
- | PK_BOOL
- | PK_DOUBLE
- | PK_SYMBOL
- | PK_STRING
- | PK_OTHER
- | PK_INVALID
-
-and ast_print_mode =
- | PRINT_SMTLIB_FULL
- | PRINT_LOW_LEVEL
- | PRINT_SMTLIB_COMPLIANT
- | PRINT_SMTLIB2_COMPLIANT
-
-and error_code =
- | OK
- | SORT_ERROR
- | IOB
- | INVALID_ARG
- | PARSER_ERROR
- | NO_PARSER
- | INVALID_PATTERN
- | MEMOUT_FAIL
- | FILE_ACCESS_ERROR
- | INTERNAL_FATAL
- | INVALID_USAGE
- | DEC_REF_ERROR
- | EXCEPTION
-
-and goal_prec =
- | GOAL_PRECISE
- | GOAL_UNDER
- | GOAL_OVER
- | GOAL_UNDER_OVER
-
-
-(**
+(** Create a context object
+ The following parameters can be set:
+
+ - proof (Boolean) Enable proof generation
+ - debug_ref_count (Boolean) Enable debug support for Z3_ast reference counting
+ - trace (Boolean) Tracing support for VCC
+ - trace_file_name (String) Trace out file for VCC traces
+ - timeout (unsigned) default timeout (in milliseconds) used for solvers
+ - well_sorted_check type checker
+ - auto_config use heuristics to automatically select solver and configure it
+ - model model generation for solvers, this parameter can be overwritten when creating a solver
+ - model_validate validate models produced by solvers
+ - unsat_core unsat-core generation for solvers, this parameter can be overwritten when creating a solver
*)
-(**
- {2 {L Types}}
- Most of the types in the API are abstract.
- - [context]: manager of all other Z3 objects, global configuration options, etc.
- - [symbol]: Lisp-like symbol used to name types, constants, and functions. A symbol can be created using string or integers.
- - [ast]: abstract syntax tree node. That is, the data-structure used in Z3 to represent terms, formulas and types.
- - [sort]: kind of AST used to represent types.
- - [func_decl]: kind of AST used to represent function symbols.
- - [app]: kind of AST used to represent function applications.
- - [pattern]: kind of AST used to represent pattern and multi-patterns used to guide quantifier instantiation.
- - [params]: parameter set used to configure many components such as: simplifiers, tactics, solvers, etc.
- - [model]: model for the constraints asserted into the logical context.
- - [func_interp]: interpretation of a function in a model.
- - [func_entry]: representation of the value of a [func_interp] at a particular point.
- - [fixedpoint]: context for the recursive predicate solver.
- - [ast_vector]: vector of [ast] objects.
- - [ast_map]: mapping from [ast] to [ast] objects.
- - [goal]: set of formulas that can be solved and/or transformed using tactics and solvers.
- - [tactic]: basic building block for creating custom solvers for specific problem domains.
- - [probe]: function/predicate used to inspect a goal and collect information that may be used to decide which solver and/or preprocessing step will be used.
- - [apply_result]: collection of subgoals resulting from applying of a tactic to a goal.
- - [solver]: (incremental) solver, possibly specialized by a particular tactic or logic.
- - [stats]: statistical data for a solver.
-*)
-(**
- {!lbool}
- Lifted Boolean type: [false], [undefined], [true].
-*)
-(**
- {!symbol_kind}
- The different kinds of symbol.
- In Z3, a symbol can be represented using integers and strings (See {!get_symbol_kind}).
- - {b See also}: {!mk_int_symbol}
- - {b See also}: {!mk_string_symbol}
-*)
-(**
- {!parameter_kind}
- The different kinds of parameters that can be associated with function symbols.
- - {b See also}: {!get_decl_num_parameters}
- - {b See also}: {!get_decl_parameter_kind}
- - PARAMETER_INT is used for integer parameters.
- - PARAMETER_DOUBLE is used for double parameters.
- - PARAMETER_RATIONAL is used for parameters that are rational numbers.
- - PARAMETER_SYMBOL is used for parameters that are symbols.
- - PARAMETER_SORT is used for sort parameters.
- - PARAMETER_AST is used for expression parameters.
- - PARAMETER_FUNC_DECL is used for function declaration parameters.
-*)
-(**
- {!sort_kind}
- The different kinds of Z3 types (See {!get_sort_kind}).
-*)
-(**
- {!ast_kind}
- The different kinds of Z3 AST (abstract syntax trees). That is, terms, formulas and types.
- - APP_AST: constant and applications
- - NUMERAL_AST: numeral constants
- - VAR_AST: bound variables
- - QUANTIFIER_AST: quantifiers
- - SORT_AST: sort
- - FUNC_DECL_AST: function declaration
- - UNKNOWN_AST: internal
-*)
-(**
- {!decl_kind}
- The different kinds of interpreted function kinds.
- - OP_TRUE The constant true.
- - OP_FALSE The constant false.
- - OP_EQ The equality predicate.
- - OP_DISTINCT The n-ary distinct predicate (every argument is mutually distinct).
- - OP_ITE The ternary if-then-else term.
- - OP_AND n-ary conjunction.
- - OP_OR n-ary disjunction.
- - OP_IFF equivalence (binary).
- - OP_XOR Exclusive or.
- - OP_NOT Negation.
- - OP_IMPLIES Implication.
- - OP_OEQ Binary equivalence modulo namings. This binary predicate is used in proof terms.
- It captures equisatisfiability and equivalence modulo renamings.
- - OP_ANUM Arithmetic numeral.
- - OP_AGNUM Arithmetic algebraic numeral. Algebraic numbers are used to represent irrational numbers in Z3.
- - OP_LE <=.
- - OP_GE >=.
- - OP_LT <.
- - OP_GT >.
- - OP_ADD Addition - Binary.
- - OP_SUB Binary subtraction.
- - OP_UMINUS Unary minus.
- - OP_MUL Multiplication - Binary.
- - OP_DIV Division - Binary.
- - OP_IDIV Integer division - Binary.
- - OP_REM Remainder - Binary.
- - OP_MOD Modulus - Binary.
- - OP_TO_REAL Coercion of integer to real - Unary.
- - OP_TO_INT Coercion of real to integer - Unary.
- - OP_IS_INT Check if real is also an integer - Unary.
- - OP_POWER Power operator x^y.
- - OP_STORE Array store. It satisfies select(store(a,i,v),j) = if i = j then v else select(a,j).
- Array store takes at least 3 arguments.
- - OP_SELECT Array select.
- - OP_CONST_ARRAY The constant array. For example, select(const(v),i) = v holds for every v and i. The function is unary.
- - OP_ARRAY_DEFAULT Default value of arrays. For example default(const(v)) = v. The function is unary.
- - OP_ARRAY_MAP Array map operator.
- It satisfies map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i.
- - OP_SET_UNION Set union between two Booelan arrays (two arrays whose range type is Boolean). The function is binary.
- - OP_SET_INTERSECT Set intersection between two Boolean arrays. The function is binary.
- - OP_SET_DIFFERENCE Set difference between two Boolean arrays. The function is binary.
- - OP_SET_COMPLEMENT Set complement of a Boolean array. The function is unary.
- - OP_SET_SUBSET Subset predicate between two Boolean arrays. The relation is binary.
- - OP_AS_ARRAY An array value that behaves as the function graph of the
- function passed as parameter.
- - OP_BNUM Bit-vector numeral.
- - OP_BIT1 One bit bit-vector.
- - OP_BIT0 Zero bit bit-vector.
- - OP_BNEG Unary minus.
- - OP_BADD Binary addition.
- - OP_BSUB Binary subtraction.
- - OP_BMUL Binary multiplication.
- - OP_BSDIV Binary signed division.
- - OP_BUDIV Binary unsigned int division.
- - OP_BSREM Binary signed remainder.
- - OP_BUREM Binary unsigned int remainder.
- - OP_BSMOD Binary signed modulus.
- - OP_BSDIV0 Unary function. bsdiv(x,0) is congruent to bsdiv0(x).
- - OP_BUDIV0 Unary function. budiv(x,0) is congruent to budiv0(x).
- - OP_BSREM0 Unary function. bsrem(x,0) is congruent to bsrem0(x).
- - OP_BUREM0 Unary function. burem(x,0) is congruent to burem0(x).
- - OP_BSMOD0 Unary function. bsmod(x,0) is congruent to bsmod0(x).
- - OP_ULEQ Unsigned bit-vector <= - Binary relation.
- - OP_SLEQ Signed bit-vector <= - Binary relation.
- - OP_UGEQ Unsigned bit-vector >= - Binary relation.
- - OP_SGEQ Signed bit-vector >= - Binary relation.
- - OP_ULT Unsigned bit-vector < - Binary relation.
- - OP_SLT Signed bit-vector < - Binary relation.
- - OP_UGT Unsigned bit-vector > - Binary relation.
- - OP_SGT Signed bit-vector > - Binary relation.
- - OP_BAND Bit-wise and - Binary.
- - OP_BOR Bit-wise or - Binary.
- - OP_BNOT Bit-wise not - Unary.
- - OP_BXOR Bit-wise xor - Binary.
- - OP_BNAND Bit-wise nand - Binary.
- - OP_BNOR Bit-wise nor - Binary.
- - OP_BXNOR Bit-wise xnor - Binary.
- - OP_CONCAT Bit-vector concatenation - Binary.
- - OP_SIGN_EXT Bit-vector sign extension.
- - OP_ZERO_EXT Bit-vector zero extension.
- - OP_EXTRACT Bit-vector extraction.
- - OP_REPEAT Repeat bit-vector n times.
- - OP_BREDOR Bit-vector reduce or - Unary.
- - OP_BREDAND Bit-vector reduce and - Unary.
- - OP_BCOMP .
- - OP_BSHL Shift left.
- - OP_BLSHR Logical shift right.
- - OP_BASHR Arithmetical shift right.
- - OP_ROTATE_LEFT Left rotation.
- - OP_ROTATE_RIGHT Right rotation.
- - OP_EXT_ROTATE_LEFT (extended) Left rotation. Similar to OP_ROTATE_LEFT, but it is a binary operator instead of a parametric one.
- - OP_EXT_ROTATE_RIGHT (extended) Right rotation. Similar to OP_ROTATE_RIGHT, but it is a binary operator instead of a parametric one.
- - OP_INT2BV Coerce integer to bit-vector. NB. This function
- is not supported by the decision procedures. Only the most
- rudimentary simplification rules are applied to this function.
- - OP_BV2INT Coerce bit-vector to integer. NB. This function
- is not supported by the decision procedures. Only the most
- rudimentary simplification rules are applied to this function.
- - OP_CARRY Compute the carry bit in a full-adder.
- The meaning is given by the equivalence
- (carry l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3)))
- - OP_XOR3 Compute ternary XOR.
- The meaning is given by the equivalence
- (xor3 l1 l2 l3) <=> (xor (xor l1 l2) l3)
- - OP_PR_UNDEF: Undef/Null proof object.
- - OP_PR_TRUE: Proof for the expression 'true'.
- - OP_PR_ASSERTED: Proof for a fact asserted by the user.
- - OP_PR_GOAL: Proof for a fact (tagged as goal) asserted by the user.
- - OP_PR_MODUS_PONENS: Given a proof for p and a proof for (implies p q), produces a proof for q.
- {e
- T1: p
- T2: (implies p q)
- [mp T1 T2]: q
- }
- The second antecedents may also be a proof for (iff p q).
- - OP_PR_REFLEXIVITY: A proof for (R t t), where R is a reflexive relation. This proof object has no antecedents.
- The only reflexive relations that are used are
- equivalence modulo namings, equality and equivalence.
- That is, R is either '~', '=' or 'iff'.
- - OP_PR_SYMMETRY: Given an symmetric relation R and a proof for (R t s), produces a proof for (R s t).
- {e
- T1: (R t s)
- [symmetry T1]: (R s t)
- }
- T1 is the antecedent of this proof object.
- - OP_PR_TRANSITIVITY: Given a transitive relation R, and proofs for (R t s) and (R s u), produces a proof
- for (R t u).
- {e
- T1: (R t s)
- T2: (R s u)
- [trans T1 T2]: (R t u)
- }
- - OP_PR_TRANSITIVITY_STAR: Condensed transitivity proof. This proof object is only used if the parameter PROOF_MODE is 1.
- It combines several symmetry and transitivity proofs.
- Example:
- {e
- T1: (R a b)
- T2: (R c b)
- T3: (R c d)
- [trans* T1 T2 T3]: (R a d)
- }
- R must be a symmetric and transitive relation.
- Assuming that this proof object is a proof for (R s t), then
- a proof checker must check if it is possible to prove (R s t)
- using the antecedents, symmetry and transitivity. That is,
- if there is a path from s to t, if we view every
- antecedent (R a b) as an edge between a and b.
- - OP_PR_MONOTONICITY: Monotonicity proof object.
- {e
- T1: (R t_1 s_1)
- ...
- Tn: (R t_n s_n)
- [monotonicity T1 ... Tn]: (R (f t_1 ... t_n) (f s_1 ... s_n))
- }
- Remark: if t_i == s_i, then the antecedent Ti is suppressed.
- That is, reflexivity proofs are supressed to save space.
- - OP_PR_QUANT_INTRO: Given a proof for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)).
- T1: (~ p q)
- [quant-intro T1]: (~ (forall (x) p) (forall (x) q))
- - OP_PR_DISTRIBUTIVITY: Distributivity proof object.
- Given that f (= or) distributes over g (= and), produces a proof for
- (= (f a (g c d))
- (g (f a c) (f a d)))
- If f and g are associative, this proof also justifies the following equality:
- (= (f (g a b) (g c d))
- (g (f a c) (f a d) (f b c) (f b d)))
- where each f and g can have arbitrary number of arguments.
- This proof object has no antecedents.
- Remark. This rule is used by the CNF conversion pass and
- instantiated by f = or, and g = and.
- - OP_PR_AND_ELIM: Given a proof for (and l_1 ... l_n), produces a proof for l_i
- {e
- T1: (and l_1 ... l_n)
- [and-elim T1]: l_i
- }
- - OP_PR_NOT_OR_ELIM: Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i).
- {e
- T1: (not (or l_1 ... l_n))
- [not-or-elim T1]: (not l_i)
- }
- - OP_PR_REWRITE: A proof for a local rewriting step (= t s).
- The head function symbol of t is interpreted.
- This proof object has no antecedents.
- The conclusion of a rewrite rule is either an equality (= t s),
- an equivalence (iff t s), or equi-satisfiability (~ t s).
- Remark: if f is bool, then = is iff.
- Examples:
- {e
- (= (+ x 0) x)
- (= (+ x 1 2) (+ 3 x))
- (iff (or x false) x)
- }
- - OP_PR_REWRITE_STAR: A proof for rewriting an expression t into an expression s.
- This proof object is used if the parameter PROOF_MODE is 1.
- This proof object can have n antecedents.
- The antecedents are proofs for equalities used as substitution rules.
- The object is also used in a few cases if the parameter PROOF_MODE is 2.
- The cases are:
- - When applying contextual simplification (CONTEXT_SIMPLIFIER=true)
- - When converting bit-vectors to Booleans (BIT2BOOL=true)
- - When pulling ite expression up (PULL_CHEAP_ITE_TREES=true)
- - OP_PR_PULL_QUANT: A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x) r))). This proof object has no antecedents.
- - OP_PR_PULL_QUANT_STAR: A proof for (iff P Q) where Q is in prenex normal form.
- This proof object is only used if the parameter PROOF_MODE is 1.
- This proof object has no antecedents.
- - OP_PR_PUSH_QUANT: A proof for:
- {e
- (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m] ... p_n[x_1 ... x_m]))
- (and (forall (x_1 ... x_m) p_1[x_1 ... x_m])
- ...
- (forall (x_1 ... x_m) p_n[x_1 ... x_m])))
- }
- This proof object has no antecedents.
- - OP_PR_ELIM_UNUSED_VARS:
- A proof for (iff (forall (x_1 ... x_n y_1 ... y_m) p[x_1 ... x_n])
- (forall (x_1 ... x_n) p[x_1 ... x_n]))
- It is used to justify the elimination of unused variables.
- This proof object has no antecedents.
- - OP_PR_DER: A proof for destructive equality resolution:
- (iff (forall (x) (or (not (= x t)) P[x])) P[t])
- if x does not occur in t.
- This proof object has no antecedents.
- Several variables can be eliminated simultaneously.
- - OP_PR_QUANT_INST: A proof of (or (not (forall (x) (P x))) (P a))
- - OP_PR_HYPOTHESIS: Mark a hypothesis in a natural deduction style proof.
- - OP_PR_LEMMA:
- {e
- T1: false
- [lemma T1]: (or (not l_1) ... (not l_n))
- }
- This proof object has one antecedent: a hypothetical proof for false.
- It converts the proof in a proof for (or (not l_1) ... (not l_n)),
- when T1 contains the hypotheses: l_1, ..., l_n.
- - OP_PR_UNIT_RESOLUTION:
- {e
- T1: (or l_1 ... l_n l_1' ... l_m')
- T2: (not l_1)
- ...
- T(n+1): (not l_n)
- [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m')
- }
- - OP_PR_IFF_TRUE:
- {e
- T1: p
- [iff-true T1]: (iff p true)
- }
- - OP_PR_IFF_FALSE:
- {e
- T1: (not p)
- [iff-false T1]: (iff p false)
- }
+val mk_context : (string * string) list -> context
- - OP_PR_COMMUTATIVITY:
+(** Interaction logging for Z3
+ Note that this is a global, static log and if multiple Context
+ objects are created, it logs the interaction with all of them. *)
+module Log :
+sig
+ (** Open an interaction log file.
+ @return True if opening the log file succeeds, false otherwise. *)
+ (* CMW: "open" is a reserved keyword. *)
+ val open_ : string -> bool
- [comm]: (= (f a b) (f b a))
+ (** Closes the interaction log. *)
+ val close : unit -> unit
- f is a commutative operator.
+ (** Appends a user-provided string to the interaction log. *)
+ val append : string -> unit
+end
- This proof object has no antecedents.
- Remark: if f is bool, then = is iff.
+(** Version information *)
+module Version :
+sig
+ (** The major version. *)
+ val major : int
- - OP_PR_DEF_AXIOM: Proof object used to justify Tseitin's like axioms:
+ (** The minor version. *)
+ val minor : int
- {e
- (or (not (and p q)) p)
- (or (not (and p q)) q)
- (or (not (and p q r)) p)
- (or (not (and p q r)) q)
- (or (not (and p q r)) r)
- ...
- (or (and p q) (not p) (not q))
- (or (not (or p q)) p q)
- (or (or p q) (not p))
- (or (or p q) (not q))
- (or (not (iff p q)) (not p) q)
- (or (not (iff p q)) p (not q))
- (or (iff p q) (not p) (not q))
- (or (iff p q) p q)
- (or (not (ite a b c)) (not a) b)
- (or (not (ite a b c)) a c)
- (or (ite a b c) (not a) (not b))
- (or (ite a b c) a (not c))
- (or (not (not a)) (not a))
- (or (not a) a)
- }
- This proof object has no antecedents.
- Note: all axioms are propositional tautologies.
- Note also that 'and' and 'or' can take multiple arguments.
- You can recover the propositional tautologies by
- unfolding the Boolean connectives in the axioms a small
- bounded number of steps (=3).
+ (** The build version. *)
+ val build : int
- - OP_PR_DEF_INTRO: Introduces a name for a formula/term.
- Suppose e is an expression with free variables x, and def-intro
- introduces the name n(x). The possible cases are:
+ (** The revision. *)
+ val revision : int
- When e is of Boolean type:
- [def-intro]: (and (or n (not e)) (or (not n) e))
+ (** A string representation of the version information. *)
+ val to_string : string
+end
- or:
- [def-intro]: (or (not n) e)
- when e only occurs positively.
+(** Symbols are used to name several term and type constructors *)
+module Symbol :
+sig
+ type symbol
- When e is of the form (ite cond th el):
- [def-intro]: (and (or (not cond) (= n th)) (or cond (= n el)))
+ (** The kind of the symbol (int or string) *)
+ val kind : symbol -> Z3enums.symbol_kind
- Otherwise:
- [def-intro]: (= n e)
+ (** Indicates whether the symbol is of Int kind *)
+ val is_int_symbol : symbol -> bool
- - OP_PR_APPLY_DEF:
- [apply-def T1]: F ~ n
- F is 'equivalent' to n, given that T1 is a proof that
- n is a name for F.
+ (** Indicates whether the symbol is of string kind. *)
+ val is_string_symbol : symbol -> bool
- - OP_PR_IFF_OEQ:
- T1: (iff p q)
- [iff~ T1]: (~ p q)
+ (** The int value of the symbol. *)
+ val get_int : symbol -> int
- - OP_PR_NNF_POS: Proof for a (positive) NNF step. Example:
- {e
- T1: (not s_1) ~ r_1
- T2: (not s_2) ~ r_2
- T3: s_1 ~ r_1'
- T4: s_2 ~ r_2'
- [nnf-pos T1 T2 T3 T4]: (~ (iff s_1 s_2)
- (and (or r_1 r_2') (or r_1' r_2)))
- }
- The negation normal form steps NNF_POS and NNF_NEG are used in the following cases:
- (a) When creating the NNF of a positive force quantifier.
- The quantifier is retained (unless the bound variables are eliminated).
- Example
- {e
- T1: q ~ q_new
- [nnf-pos T1]: (~ (forall (x T) q) (forall (x T) q_new))
- }
- (b) When recursively creating NNF over Boolean formulas, where the top-level
- connective is changed during NNF conversion. The relevant Boolean connectives
- for NNF_POS are 'implies', 'iff', 'xor', 'ite'.
- NNF_NEG furthermore handles the case where negation is pushed
- over Boolean connectives 'and' and 'or'.
+ (** The string value of the symbol. *)
+ val get_string : symbol -> string
+
+ (** A string representation of the symbol. *)
+ val to_string : symbol -> string
+
+ (** Creates a new symbol using an integer.
+ Not all integers can be passed to this function.
+ The legal range of unsigned integers is 0 to 2^30-1. *)
+ val mk_int : context -> int -> symbol
+
+ (** Creates a new symbol using a string. *)
+ val mk_string : context -> string -> symbol
+
+ (** Create a list of symbols. *)
+ val mk_ints : context -> int list -> symbol list
+
+ (** Create a list of symbols. *)
+ val mk_strings : context -> string list -> symbol list
+end
+
+(** The abstract syntax tree (AST) module *)
+module AST :
+sig
+ type ast
+
+ (** Vectors of ASTs *)
+ module ASTVector :
+ sig
+ type ast_vector
+
+ (** Create an empty AST vector *)
+ val mk_ast_vector : context -> ast_vector
+
+ (** The size of the vector *)
+ val get_size : ast_vector -> int
+
+ (** Retrieves the i-th object in the vector.
+ @return An AST *)
+ val get : ast_vector -> int -> ast
+
+ (** Sets the i-th object in the vector. *)
+ val set : ast_vector -> int -> ast -> unit
+
+ (** Resize the vector to a new size. *)
+ val resize : ast_vector -> int -> unit
+
+ (** Add an ast to the back of the vector. The size
+ is increased by 1. *)
+ val push : ast_vector -> ast -> unit
+
+ (** Translates all ASTs in the vector to another context.
+ @return A new ASTVector *)
+ val translate : ast_vector -> context -> ast_vector
+
+ (** Retrieves a string representation of the vector. *)
+ val to_string : ast_vector -> string
+ end
+
+ (** Map from AST to AST *)
+ module ASTMap :
+ sig
+ type ast_map
+
+ (** Create an empty mapping from AST to AST *)
+ val mk_ast_map : context -> ast_map
+
+ (** Checks whether the map contains a key.
+ @return True if the key in the map, false otherwise. *)
+ val contains : ast_map -> ast -> bool
+
+ (** Finds the value associated with the key.
+ This function signs an error when the key is not a key in the map. *)
+ val find : ast_map -> ast -> ast
+
+ (** Stores or replaces a new key/value pair in the map. *)
+ val insert : ast_map -> ast -> ast -> unit
+
+ (** Erases the key from the map.*)
+ val erase : ast_map -> ast -> unit
+
+ (** Removes all keys from the map. *)
+ val reset : ast_map -> unit
+
+ (** The size of the map *)
+ val get_size : ast_map -> int
+
+ (** The keys stored in the map. *)
+ val get_keys : ast_map -> ast list
+
+ (** Retrieves a string representation of the map.*)
+ val to_string : ast_map -> string
+ end
+
+ (** The AST's hash code.
+ @return A hash code *)
+ val hash : ast -> int
+
+ (** A unique identifier for the AST (unique among all ASTs). *)
+ val get_id : ast -> int
+
+ (** The kind of the AST. *)
+ val get_ast_kind : ast -> Z3enums.ast_kind
+
+ (** Indicates whether the AST is an Expr *)
+ val is_expr : ast -> bool
+
+ (** Indicates whether the AST is a bound variable*)
+ val is_var : ast -> bool
+
+ (** Indicates whether the AST is a Quantifier *)
+ val is_quantifier : ast -> bool
+
+ (** Indicates whether the AST is a Sort *)
+ val is_sort : ast -> bool
+
+ (** Indicates whether the AST is a func_decl *)
+ val is_func_decl : ast -> bool
+
+ (** A string representation of the AST. *)
+ val to_string : ast -> string
+
+ (** A string representation of the AST in s-expression notation. *)
+ val to_sexpr : ast -> string
+
+ (** Comparison operator.
+ @return True if the two ast's are from the same context
+ and represent the same sort; false otherwise. *)
+ val equal : ast -> ast -> bool
+
+ (** Object Comparison.
+ @return Negative if the first ast should be sorted before the second, positive if after else zero. *)
+ val compare : ast -> ast -> int
+
+ (** Translates (copies) the AST to another context.
+ @return A copy of the AST which is associated with the other context. *)
+ val translate : ast -> context -> ast
+
+ (** Unwraps an AST.
+ This function is used for transitions between native and
+ managed objects. It returns the native pointer to the AST. Note that
+ AST objects are reference counted and unwrapping an AST disables automatic
+ reference counting, i.e., all references to the IntPtr that is returned
+ must be handled externally and through native calls (see e.g.,
+ [Z3native.inc_ref]).
+ {!wrap_ast} *)
+ val unwrap_ast : ast -> Z3native.ptr
+
+ (** Wraps an AST.
+
+ This function is used for transitions between native and
+ managed objects. Note that the native ast that is passed must be a
+ native object obtained from Z3 (e.g., through {!unwrap_ast})
+ and that it must have a correct reference count (see e.g.,
+ [Z3native.inc_ref]). *)
+ val wrap_ast : context -> Z3native.z3_ast -> ast
+end
+
+(** The Sort module implements type information for ASTs *)
+module Sort :
+sig
+ type sort = Sort of AST.ast
+
+ val ast_of_sort : sort -> AST.ast
+
+ (** Comparison operator.
+ @return True if the two sorts are from the same context
+ and represent the same sort; false otherwise. *)
+ val equal : sort -> sort -> bool
+
+ (** Returns a unique identifier for the sort. *)
+ val get_id : sort -> int
+
+ (** The kind of the sort. *)
+ val get_sort_kind : sort -> Z3enums.sort_kind
+
+ (** The name of the sort *)
+ val get_name : sort -> Symbol.symbol
+
+ (** A string representation of the sort. *)
+ val to_string : sort -> string
+
+ (** Create a new uninterpreted sort. *)
+ val mk_uninterpreted : context -> Symbol.symbol -> sort
+
+ (** Create a new uninterpreted sort. *)
+ val mk_uninterpreted_s : context -> string -> sort
+end
+
+(** Function declarations *)
+module rec FuncDecl :
+sig
+ type func_decl = FuncDecl of AST.ast
+
+ val ast_of_func_decl : FuncDecl.func_decl -> AST.ast
+
+ (** Parameters of Func_Decls *)
+ module Parameter :
+ sig
+ (** Parameters of func_decls *)
+ type parameter =
+ P_Int of int
+ | P_Dbl of float
+ | P_Sym of Symbol.symbol
+ | P_Srt of Sort.sort
+ | P_Ast of AST.ast
+ | P_Fdl of func_decl
+ | P_Rat of string
+
+ (** The kind of the parameter. *)
+ val get_kind : parameter -> Z3enums.parameter_kind
+
+ (** The int value of the parameter.*)
+ val get_int : parameter -> int
+
+ (** The float value of the parameter.*)
+ val get_float : parameter -> float
+
+ (** The Symbol.Symbol value of the parameter.*)
+ val get_symbol : parameter -> Symbol.symbol
+
+ (** The Sort value of the parameter.*)
+ val get_sort : parameter -> Sort.sort
+
+ (** The AST value of the parameter.*)
+ val get_ast : parameter -> AST.ast
+
+ (** The FunctionDeclaration value of the parameter.*)
+ val get_func_decl : parameter -> func_decl
+
+ (** The rational string value of the parameter.*)
+ val get_rational : parameter -> string
+ end
+
+ (** Creates a new function declaration. *)
+ val mk_func_decl : context -> Symbol.symbol -> Sort.sort list -> Sort.sort -> func_decl
+
+ (** Creates a new function declaration. *)
+ val mk_func_decl_s : context -> string -> Sort.sort list -> Sort.sort -> func_decl
+ (** Creates a fresh function declaration with a name prefixed with a prefix string. *)
+
+ val mk_fresh_func_decl : context -> string -> Sort.sort list -> Sort.sort -> func_decl
+
+ (** Creates a new constant function declaration. *)
+ val mk_const_decl : context -> Symbol.symbol -> Sort.sort -> func_decl
+
+ (** Creates a new constant function declaration. *)
+ val mk_const_decl_s : context -> string -> Sort.sort -> func_decl
+
+ (** Creates a fresh constant function declaration with a name prefixed with a prefix string.
+ {!mk_func_decl}
+ {!mk_func_decl} *)
+ val mk_fresh_const_decl : context -> string -> Sort.sort -> func_decl
+
+ (** Comparison operator.
+ @return True if a and b are from the same context and represent the same func_decl; false otherwise. *)
+ val equal : func_decl -> func_decl -> bool
+
+ (** A string representations of the function declaration. *)
+ val to_string : func_decl -> string
+
+ (** Returns a unique identifier for the function declaration. *)
+ val get_id : func_decl -> int
+
+ (** The arity of the function declaration *)
+ val get_arity : func_decl -> int
+
+ (** The size of the domain of the function declaration
+ {!get_arity} *)
+ val get_domain_size : func_decl -> int
+
+ (** The domain of the function declaration *)
+ val get_domain : func_decl -> Sort.sort list
+
+ (** The range of the function declaration *)
+ val get_range : func_decl -> Sort.sort
+
+ (** The kind of the function declaration. *)
+ val get_decl_kind : func_decl -> Z3enums.decl_kind
+
+ (** The name of the function declaration*)
+ val get_name : func_decl -> Symbol.symbol
+
+ (** The number of parameters of the function declaration *)
+ val get_num_parameters : func_decl -> int
+
+ (** The parameters of the function declaration *)
+ val get_parameters : func_decl -> Parameter.parameter list
+
+ (** Create expression that applies function to arguments. *)
+ val apply : func_decl -> Expr.expr list -> Expr.expr
+end
+
+(** Parameter sets (of Solvers, Tactics, ...)
+
+ A Params objects represents a configuration in the form of Symbol.symbol/value pairs. *)
+and Params :
+sig
+ type params
+
+ (** ParamDescrs describe sets of parameters (of Solvers, Tactics, ...) *)
+ module ParamDescrs :
+ sig
+ type param_descrs
+
+ (** Validate a set of parameters. *)
+ val validate : param_descrs -> params -> unit
+
+ (** Retrieve kind of parameter. *)
+ val get_kind : param_descrs -> Symbol.symbol -> Z3enums.param_kind
+
+ (** Retrieve all names of parameters. *)
+ val get_names : param_descrs -> Symbol.symbol list
+
+ (** The size of the ParamDescrs. *)
+ val get_size : param_descrs -> int
+
+ (** Retrieves a string representation of the ParamDescrs. *)
+ val to_string : param_descrs -> string
+ end
+
+ (** Adds a parameter setting. *)
+ val add_bool : params -> Symbol.symbol -> bool -> unit
+
+ (** Adds a parameter setting. *)
+ val add_int : params -> Symbol.symbol -> int -> unit
+
+ (** Adds a parameter setting. *)
+ val add_float : params -> Symbol.symbol -> float -> unit
+
+ (** Adds a parameter setting. *)
+ val add_symbol : params -> Symbol.symbol -> Symbol.symbol -> unit
+
+ (** Creates a new parameter set *)
+ val mk_params : context -> params
+
+ (** A string representation of the parameter set. *)
+ val to_string : params -> string
+
+ (** Update a mutable configuration parameter.
+
+ The list of all configuration parameters can be obtained using the Z3 executable:
+ [z3.exe -p]
+ Only a few configuration parameters are mutable once the context is created.
+ An exception is thrown when trying to modify an immutable parameter. *)
+ val update_param_value : context -> string -> string -> unit
+
+ (** Selects the format used for pretty-printing expressions.
+
+ The default mode for pretty printing expressions is to produce
+ SMT-LIB style output where common subexpressions are printed
+ at each occurrence. The mode is called PRINT_SMTLIB_FULL.
+ To print shared common subexpressions only once,
+ use the PRINT_LOW_LEVEL mode.
+ To print in way that conforms to SMT-LIB standards and uses let
+ expressions to share common sub-expressions use PRINT_SMTLIB_COMPLIANT.
+ {!AST.to_string}
+ {!Quantifier.Pattern.to_string}
+ {!FuncDecl.to_string}
+ {!Sort.to_string} *)
+ val set_print_mode : context -> Z3enums.ast_print_mode -> unit
+end
+
+(** General Expressions (terms) *)
+and Expr :
+sig
+ type expr = Expr of AST.ast
+
+ val ast_of_expr : Expr.expr -> AST.ast
+ val expr_of_ast : AST.ast -> Expr.expr
+
+ (** Returns a simplified version of the expression.
+ {!get_simplify_help} *)
+ val simplify : Expr.expr -> Params.params option -> expr
+
+ (** A string describing all available parameters to [Expr.Simplify]. *)
+ val get_simplify_help : context -> string
+
+ (** Retrieves parameter descriptions for simplifier. *)
+ val get_simplify_parameter_descrs : context -> Params.ParamDescrs.param_descrs
+
+ (** The function declaration of the function that is applied in this expression. *)
+ val get_func_decl : Expr.expr -> FuncDecl.func_decl
+
+ (** The number of arguments of the expression. *)
+ val get_num_args : Expr.expr -> int
+
+ (** The arguments of the expression. *)
+ val get_args : Expr.expr -> Expr.expr list
+
+ (** Update the arguments of the expression using an array of expressions.
+ The number of new arguments should coincide with the current number of arguments. *)
+ val update : Expr.expr -> Expr.expr list -> expr
+
+ (** Substitute every occurrence of [from[i]] in the expression with [to[i]], for [i] smaller than [num_exprs].
+
+ The result is the new expression. The arrays [from] and [to] must have size [num_exprs].
+ For every [i] smaller than [num_exprs], we must have that
+ sort of [from[i]] must be equal to sort of [to[i]]. *)
+ val substitute : Expr.expr -> Expr.expr list -> Expr.expr list -> expr
+
+ (** Substitute every occurrence of [from] in the expression with [to].
+ {!substitute} *)
+ val substitute_one : Expr.expr -> Expr.expr -> Expr.expr -> expr
+
+ (** Substitute the free variables in the expression with the expressions in the expr array
+
+ For every [i] smaller than [num_exprs], the variable with de-Bruijn index [i] is replaced with term [to[i]]. *)
+ val substitute_vars : Expr.expr -> Expr.expr list -> expr
+
+ (** Translates (copies) the term to another context.
+ @return A copy of the term which is associated with the other context *)
+ val translate : Expr.expr -> context -> expr
+
+ (** Returns a string representation of the expression. *)
+ val to_string : Expr.expr -> string
+
+ (** Indicates whether the term is a numeral *)
+ val is_numeral : Expr.expr -> bool
+
+ (** Indicates whether the term is well-sorted.
+ @return True if the term is well-sorted, false otherwise. *)
+ val is_well_sorted : Expr.expr -> bool
+
+ (** The Sort of the term. *)
+ val get_sort : Expr.expr -> Sort.sort
+
+ (** Indicates whether the term represents a constant. *)
+ val is_const : Expr.expr -> bool
+
+ (** Creates a new constant. *)
+ val mk_const : context -> Symbol.symbol -> Sort.sort -> expr
+
+ (** Creates a new constant. *)
+ val mk_const_s : context -> string -> Sort.sort -> expr
+
+ (** Creates a constant from the func_decl. *)
+ val mk_const_f : context -> FuncDecl.func_decl -> expr
+
+ (** Creates a fresh constant with a name prefixed with a string. *)
+ val mk_fresh_const : context -> string -> Sort.sort -> expr
+
+ (** Create a new function application. *)
+ val mk_app : context -> FuncDecl.func_decl -> Expr.expr list -> expr
+
+ (** Create a numeral of a given sort.
+ @return A Term with the given value and sort *)
+ val mk_numeral_string : context -> string -> Sort.sort -> expr
+
+ (** Create a numeral of a given sort. This function can be use to create numerals that fit in a machine integer.
+ It is slightly faster than [MakeNumeral] since it is not necessary to parse a string.
+ @return A Term with the given value and sort *)
+ val mk_numeral_int : context -> int -> Sort.sort -> expr
+
+ (** Comparison operator.
+ @return True if the two expr's are equal; false otherwise. *)
+ val equal : expr -> expr -> bool
+
+ (** Object Comparison.
+ @return Negative if the first expr should be sorted before the second, positive if after, else zero. *)
+ val compare : expr -> expr -> int
+end
+
+(** Boolean expressions; Propositional logic and equality *)
+module Boolean :
+sig
+ (** Create a Boolean sort *)
+ val mk_sort : context -> Sort.sort
+
+ (** Create a Boolean constant. *)
+ val mk_const : context -> Symbol.symbol -> Expr.expr
+
+ (** Create a Boolean constant. *)
+ val mk_const_s : context -> string -> Expr.expr
+
+ (** The true Term. *)
+ val mk_true : context -> Expr.expr
+
+ (** The false Term. *)
+ val mk_false : context -> Expr.expr
+
+ (** Creates a Boolean value. *)
+ val mk_val : context -> bool -> Expr.expr
+
+ (** Mk an expression representing [not(a)]. *)
+ val mk_not : context -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing an if-then-else: [ite(t1, t2, t3)]. *)
+ val mk_ite : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 iff t2]. *)
+ val mk_iff : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 -> t2]. *)
+ val mk_implies : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 xor t2]. *)
+ val mk_xor : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing the AND of args *)
+ val mk_and : context -> Expr.expr list -> Expr.expr
+
+ (** Create an expression representing the OR of args *)
+ val mk_or : context -> Expr.expr list -> Expr.expr
+
+ (** Creates the equality between two expr's. *)
+ val mk_eq : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Creates a [distinct] term. *)
+ val mk_distinct : context -> Expr.expr list -> Expr.expr
+
+ (** Indicates whether the expression is the true or false expression
+ or something else (L_UNDEF). *)
+ val get_bool_value : Expr.expr -> Z3enums.lbool
+
+ (** Indicates whether the term has Boolean sort. *)
+ val is_bool : Expr.expr -> bool
+
+ (** Indicates whether the term is the constant true. *)
+ val is_true : Expr.expr -> bool
+
+ (** Indicates whether the term is the constant false. *)
+ val is_false : Expr.expr -> bool
+
+ (** Indicates whether the term is an equality predicate. *)
+ val is_eq : Expr.expr -> bool
+
+ (** Indicates whether the term is an n-ary distinct predicate (every argument is mutually distinct). *)
+ val is_distinct : Expr.expr -> bool
+
+ (** Indicates whether the term is a ternary if-then-else term *)
+ val is_ite : Expr.expr -> bool
+
+ (** Indicates whether the term is an n-ary conjunction *)
+ val is_and : Expr.expr -> bool
+
+ (** Indicates whether the term is an n-ary disjunction *)
+ val is_or : Expr.expr -> bool
+
+ (** Indicates whether the term is an if-and-only-if (Boolean equivalence, binary) *)
+ val is_iff : Expr.expr -> bool
+
+ (** Indicates whether the term is an exclusive or *)
+ val is_xor : Expr.expr -> bool
+
+ (** Indicates whether the term is a negation *)
+ val is_not : Expr.expr -> bool
+
+ (** Indicates whether the term is an implication *)
+ val is_implies : Expr.expr -> bool
+end
+
+(** Quantifier expressions *)
+module Quantifier :
+sig
+ type quantifier = Quantifier of Expr.expr
+
+ val expr_of_quantifier : quantifier -> Expr.expr
+ val quantifier_of_expr : Expr.expr -> quantifier
+
+ (** Quantifier patterns
+
+ Patterns comprise a list of terms. The list should be
+ non-empty. If the list comprises of more than one term, it is
+ also called a multi-pattern. *)
+ module Pattern :
+ sig
+ type pattern = Pattern of AST.ast
+
+ val ast_of_pattern : pattern -> AST.ast
+ val pattern_of_ast : AST.ast -> pattern
+
+ (** The number of terms in the pattern. *)
+ val get_num_terms : pattern -> int
+
+ (** The terms in the pattern. *)
+ val get_terms : pattern -> Expr.expr list
+
+ (** A string representation of the pattern. *)
+ val to_string : pattern -> string
+ end
- - OP_PR_NFF_NEG: Proof for a (negative) NNF step. Examples:
- {e
- T1: (not s_1) ~ r_1
- ...
- Tn: (not s_n) ~ r_n
- [nnf-neg T1 ... Tn]: (not (and s_1 ... s_n)) ~ (or r_1 ... r_n)
+ (** The de-Burijn index of a bound variable.
+
+ Bound variables are indexed by de-Bruijn indices. It is perhaps easiest to explain
+ the meaning of de-Bruijn indices by indicating the compilation process from
+ non-de-Bruijn formulas to de-Bruijn format.
+
+ abs(forall (x1) phi) = forall (x1) abs1(phi, x1, 0)
+ abs(forall (x1, x2) phi) = abs(forall (x1) abs(forall (x2) phi))
+ abs1(x, x, n) = b_n
+ abs1(y, x, n) = y
+ abs1(f(t1,...,tn), x, n) = f(abs1(t1,x,n), ..., abs1(tn,x,n))
+ abs1(forall (x1) phi, x, n) = forall (x1) (abs1(phi, x, n+1))
+
+ The last line is significant: the index of a bound variable is different depending
+ on the scope in which it appears. The deeper ( x : expr ) appears, the higher is its
+ index. *)
+ val get_index : Expr.expr -> int
+
+ (** Indicates whether the quantifier is universal. *)
+ val is_universal : quantifier -> bool
+
+ (** Indicates whether the quantifier is existential. *)
+ val is_existential : quantifier -> bool
+
+ (** The weight of the quantifier. *)
+ val get_weight : quantifier -> int
+
+ (** The number of patterns. *)
+ val get_num_patterns : quantifier -> int
+
+ (** The patterns. *)
+ val get_patterns : quantifier -> Pattern.pattern list
+
+ (** The number of no-patterns. *)
+ val get_num_no_patterns : quantifier -> int
+
+ (** The no-patterns. *)
+ val get_no_patterns : quantifier -> Pattern.pattern list
+
+ (** The number of bound variables. *)
+ val get_num_bound : quantifier -> int
+
+ (** The symbols for the bound variables. *)
+ val get_bound_variable_names : quantifier -> Symbol.symbol list
+
+ (** The sorts of the bound variables. *)
+ val get_bound_variable_sorts : quantifier -> Sort.sort list
+
+ (** The body of the quantifier. *)
+ val get_body : quantifier -> Expr.expr
+
+ (** Creates a new bound variable. *)
+ val mk_bound : context -> int -> Sort.sort -> Expr.expr
+
+ (** Create a quantifier pattern. *)
+ val mk_pattern : context -> Expr.expr list -> Pattern.pattern
+
+ (** Create a universal Quantifier. *)
+ val mk_forall : context -> Sort.sort list -> Symbol.symbol list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** Create a universal Quantifier. *)
+ val mk_forall_const : context -> Expr.expr list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** Create an existential Quantifier. *)
+ val mk_exists : context -> Sort.sort list -> Symbol.symbol list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** Create an existential Quantifier. *)
+ val mk_exists_const : context -> Expr.expr list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** Create a Quantifier. *)
+ val mk_quantifier : context -> Sort.sort list -> Symbol.symbol list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** Create a Quantifier. *)
+ val mk_quantifier : context -> bool -> Expr.expr list -> Expr.expr -> int option -> Pattern.pattern list -> Expr.expr list -> Symbol.symbol option -> Symbol.symbol option -> quantifier
+
+ (** A string representation of the quantifier. *)
+ val to_string : quantifier -> string
+end
+
+(** Functions to manipulate Array expressions *)
+module Z3Array :
+sig
+ (** Create a new array sort. *)
+ val mk_sort : context -> Sort.sort -> Sort.sort -> Sort.sort
+
+ (** Indicates whether the term is an array store.
+ It satisfies select(store(a,i,v),j) = if i = j then v else select(a,j).
+ Array store takes at least 3 arguments. *)
+ val is_store : Expr.expr -> bool
+
+ (** Indicates whether the term is an array select. *)
+ val is_select : Expr.expr -> bool
+
+ (** Indicates whether the term is a constant array.
+ For example, select(const(v),i) = v holds for every v and i. The function is unary. *)
+ val is_constant_array : Expr.expr -> bool
+
+ (** Indicates whether the term is a default array.
+ For example default(const(v)) = v. The function is unary. *)
+ val is_default_array : Expr.expr -> bool
+
+ (** Indicates whether the term is an array map.
+ It satisfies map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i. *)
+ val is_array_map : Expr.expr -> bool
+
+ (** Indicates whether the term is an as-array term.
+ An as-array term is n array value that behaves as the function graph of the
+ function passed as parameter. *)
+ val is_as_array : Expr.expr -> bool
+
+ (** Indicates whether the term is of an array sort. *)
+ val is_array : Expr.expr -> bool
+
+ (** The domain of the array sort. *)
+ val get_domain : Sort.sort -> Sort.sort
+
+ (** The range of the array sort. *)
+ val get_range : Sort.sort -> Sort.sort
+
+ (** Create an array constant. *)
+ val mk_const : context -> Symbol.symbol -> Sort.sort -> Sort.sort -> Expr.expr
+
+ (** Create an array constant. *)
+ val mk_const_s : context -> string -> Sort.sort -> Sort.sort -> Expr.expr
+
+ (** Array read.
+
+ The argument [a] is the array and [i] is the index
+ of the array that gets read.
+
+ The node [a] must have an array sort [[domain -> range]],
+ and [i] must have the sort [domain].
+ The sort of the result is [range].
+ {!Z3Array.mk_sort}
+ {!mk_store} *)
+ val mk_select : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Array update.
+
+ The node [a] must have an array sort [[domain -> range]],
+ [i] must have sort [domain],
+ [v] must have sort range. The sort of the result is [[domain -> range]].
+ The semantics of this function is given by the theory of arrays described in the SMT-LIB
+ standard. See http://smtlib.org for more details.
+ The result of this function is an array that is equal to [a]
+ (with respect to [select])
+ on all indices except for [i], where it maps to [v]
+ (and the [select] of [a] with
+ respect to [i] may be a different value).
+ {!Z3Array.mk_sort}
+ {!mk_select} *)
+ val mk_store : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a constant array.
+
+ The resulting term is an array, such that a [select]on an arbitrary index
+ produces the value [v].
+ {!Z3Array.mk_sort}
+ {!mk_select} *)
+ val mk_const_array : context -> Sort.sort -> Expr.expr -> Expr.expr
+
+ (** Maps f on the argument arrays.
+
+ Eeach element of [args] must be of an array sort [[domain_i -> range_i]].
+ The function declaration [f] must have type [ range_1 .. range_n -> range].
+ [v] must have sort range. The sort of the result is [[domain_i -> range]].
+ {!Z3Array.mk_sort}
+ {!mk_select}
+ {!mk_store} *)
+ val mk_map : context -> FuncDecl.func_decl -> Expr.expr list -> Expr.expr
+
+ (** Access the array default value.
+
+ Produces the default range value, for arrays that can be represented as
+ finite maps with a default range value. *)
+ val mk_term_array : context -> Expr.expr -> Expr.expr
+end
+
+(** Functions to manipulate Set expressions *)
+module Set :
+sig
+ (** Create a set type. *)
+ val mk_sort : context -> Sort.sort -> Sort.sort
+
+ (** Indicates whether the term is set union *)
+ val is_union : Expr.expr -> bool
+
+ (** Indicates whether the term is set intersection *)
+ val is_intersect : Expr.expr -> bool
+
+ (** Indicates whether the term is set difference *)
+ val is_difference : Expr.expr -> bool
+
+ (** Indicates whether the term is set complement *)
+ val is_complement : Expr.expr -> bool
+
+ (** Indicates whether the term is set subset *)
+ val is_subset : Expr.expr -> bool
+
+ (** Create an empty set. *)
+ val mk_empty : context -> Sort.sort -> Expr.expr
+
+ (** Create the full set. *)
+ val mk_full : context -> Sort.sort -> Expr.expr
+
+ (** Add an element to the set. *)
+ val mk_set_add : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Remove an element from a set. *)
+ val mk_del : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Take the union of a list of sets. *)
+ val mk_union : context -> Expr.expr list -> Expr.expr
+
+ (** Take the intersection of a list of sets. *)
+ val mk_intersection : context -> Expr.expr list -> Expr.expr
+
+ (** Take the difference between two sets. *)
+ val mk_difference : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Take the complement of a set. *)
+ val mk_complement : context -> Expr.expr -> Expr.expr
+
+ (** Check for set membership. *)
+ val mk_membership : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Check for subsetness of sets. *)
+ val mk_subset : context -> Expr.expr -> Expr.expr -> Expr.expr
+end
+
+(** Functions to manipulate Finite Domain expressions *)
+module FiniteDomain :
+sig
+ (** Create a new finite domain sort. *)
+ val mk_sort : context -> Symbol.symbol -> int -> Sort.sort
+
+ (** Create a new finite domain sort. *)
+ val mk_sort_s : context -> string -> int -> Sort.sort
+
+ (** Indicates whether the term is of an array sort. *)
+ val is_finite_domain : Expr.expr -> bool
+
+ (** Indicates whether the term is a less than predicate over a finite domain. *)
+ val is_lt : Expr.expr -> bool
+
+ (** The size of the finite domain sort. *)
+ val get_size : Sort.sort -> int
+end
+
+
+(** Functions to manipulate Relation expressions *)
+module Relation :
+sig
+ (** Indicates whether the term is of a relation sort. *)
+ val is_relation : Expr.expr -> bool
+
+ (** Indicates whether the term is an relation store
+
+ Insert a record into a relation.
+ The function takes [n+1] arguments, where the first argument is the relation and the remaining [n] elements
+ correspond to the [n] columns of the relation. *)
+ val is_store : Expr.expr -> bool
+
+ (** Indicates whether the term is an empty relation *)
+ val is_empty : Expr.expr -> bool
+
+ (** Indicates whether the term is a test for the emptiness of a relation *)
+ val is_is_empty : Expr.expr -> bool
+
+ (** Indicates whether the term is a relational join *)
+ val is_join : Expr.expr -> bool
+
+ (** Indicates whether the term is the union or convex hull of two relations.
+ The function takes two arguments. *)
+ val is_union : Expr.expr -> bool
+
+ (** Indicates whether the term is the widening of two relations
+ The function takes two arguments. *)
+ val is_widen : Expr.expr -> bool
+
+ (** Indicates whether the term is a projection of columns (provided as numbers in the parameters).
+ The function takes one argument. *)
+ val is_project : Expr.expr -> bool
+
+ (** Indicates whether the term is a relation filter
+
+ Filter (restrict) a relation with respect to a predicate.
+ The first argument is a relation.
+ The second argument is a predicate with free de-Brujin indices
+ corresponding to the columns of the relation.
+ So the first column in the relation has index 0. *)
+ val is_filter : Expr.expr -> bool
+
+ (** Indicates whether the term is an intersection of a relation with the negation of another.
+
+ Intersect the first relation with respect to negation
+ of the second relation (the function takes two arguments).
+ Logically, the specification can be described by a function
+
+ target = filter_by_negation(pos, neg, columns)
+
+ where columns are pairs c1, d1, .., cN, dN of columns from pos and neg, such that
+ target are elements in ( x : expr ) in pos, such that there is no y in neg that agrees with
+ ( x : expr ) on the columns c1, d1, .., cN, dN. *)
+ val is_negation_filter : Expr.expr -> bool
+
+ (** Indicates whether the term is the renaming of a column in a relation
+
+ The function takes one argument.
+ The parameters contain the renaming as a cycle. *)
+ val is_rename : Expr.expr -> bool
+
+ (** Indicates whether the term is the complement of a relation *)
+ val is_complement : Expr.expr -> bool
+
+ (** Indicates whether the term is a relational select
+
+ Check if a record is an element of the relation.
+ The function takes [n+1] arguments, where the first argument is a relation,
+ and the remaining [n] arguments correspond to a record. *)
+ val is_select : Expr.expr -> bool
+
+ (** Indicates whether the term is a relational clone (copy)
+
+ Create a fresh copy (clone) of a relation.
+ The function is logically the identity, but
+ in the context of a register machine allows
+ for terms of kind {!is_union}
+ to perform destructive updates to the first argument. *)
+ val is_clone : Expr.expr -> bool
+
+ (** The arity of the relation sort. *)
+ val get_arity : Sort.sort -> int
+
+ (** The sorts of the columns of the relation sort. *)
+ val get_column_sorts : Sort.sort -> Sort.sort list
+end
+
+(** Functions to manipulate Datatype expressions *)
+module Datatype :
+sig
+ (** Datatype Constructors *)
+ module Constructor :
+ sig
+ type constructor
+
+ (** The number of fields of the constructor. *)
+ val get_num_fields : constructor -> int
+
+ (** The function declaration of the constructor. *)
+ val get_constructor_decl : constructor -> FuncDecl.func_decl
+
+ (** The function declaration of the tester. *)
+ val get_tester_decl : constructor -> FuncDecl.func_decl
+
+ (** The function declarations of the accessors *)
+ val get_accessor_decls : constructor -> FuncDecl.func_decl list
+ end
+
+ (** Create a datatype constructor.
+ if the corresponding sort reference is 0, then the value in sort_refs should be an index
+ referring to one of the recursive datatypes that is declared. *)
+ val mk_constructor : context -> Symbol.symbol -> Symbol.symbol -> Symbol.symbol list -> Sort.sort option list -> int list -> Constructor.constructor
+
+ (** Create a datatype constructor.
+ if the corresponding sort reference is 0, then the value in sort_refs should be an index
+ referring to one of the recursive datatypes that is declared. *)
+ val mk_constructor_s : context -> string -> Symbol.symbol -> Symbol.symbol list -> Sort.sort option list -> int list -> Constructor.constructor
+
+ (** Create a new datatype sort. *)
+ val mk_sort : context -> Symbol.symbol -> Constructor.constructor list -> Sort.sort
+
+ (** Create a new datatype sort. *)
+ val mk_sort_s : context -> string -> Constructor.constructor list -> Sort.sort
+
+ (** Create mutually recursive datatypes. *)
+ val mk_sorts : context -> Symbol.symbol list -> Constructor.constructor list list -> Sort.sort list
+
+ (** Create mutually recursive data-types. *)
+ val mk_sorts_s : context -> string list -> Constructor.constructor list list -> Sort.sort list
+
+
+ (** The number of constructors of the datatype sort. *)
+ val get_num_constructors : Sort.sort -> int
+
+ (** The constructors. *)
+ val get_constructors : Sort.sort -> FuncDecl.func_decl list
+
+ (** The recognizers. *)
+ val get_recognizers : Sort.sort -> FuncDecl.func_decl list
+
+ (** The constructor accessors. *)
+ val get_accessors : Sort.sort -> FuncDecl.func_decl list list
+end
+
+(** Functions to manipulate Enumeration expressions *)
+module Enumeration :
+sig
+ (** Create a new enumeration sort. *)
+ val mk_sort : context -> Symbol.symbol -> Symbol.symbol list -> Sort.sort
+
+ (** Create a new enumeration sort. *)
+ val mk_sort_s : context -> string -> string list -> Sort.sort
+
+ (** The function declarations of the constants in the enumeration. *)
+ val get_const_decls : Sort.sort -> FuncDecl.func_decl list
+
+ (** The test predicates for the constants in the enumeration. *)
+ val get_tester_decls : Sort.sort -> FuncDecl.func_decl list
+end
+
+(** Functions to manipulate List expressions *)
+module Z3List :
+sig
+ (** Create a new list sort. *)
+ val mk_sort : context -> Symbol.symbol -> Sort.sort -> Sort.sort
+
+ (** Create a new list sort. *)
+ val mk_list_s : context -> string -> Sort.sort -> Sort.sort
+
+ (** The declaration of the nil function of this list sort. *)
+ val get_nil_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The declaration of the isNil function of this list sort. *)
+ val get_is_nil_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The declaration of the cons function of this list sort. *)
+ val get_cons_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The declaration of the isCons function of this list sort. *)
+ val get_is_cons_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The declaration of the head function of this list sort. *)
+ val get_head_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The declaration of the tail function of this list sort. *)
+ val get_tail_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The empty list. *)
+ val nil : Sort.sort -> Expr.expr
+end
+
+(** Functions to manipulate Tuple expressions *)
+module Tuple :
+sig
+ (** Create a new tuple sort. *)
+ val mk_sort : context -> Symbol.symbol -> Symbol.symbol list -> Sort.sort list -> Sort.sort
+
+ (** The constructor function of the tuple. *)
+ val get_mk_decl : Sort.sort -> FuncDecl.func_decl
+
+ (** The number of fields in the tuple. *)
+ val get_num_fields : Sort.sort -> int
+
+ (** The field declarations. *)
+ val get_field_decls : Sort.sort -> FuncDecl.func_decl list
+end
+
+(** Functions to manipulate arithmetic expressions *)
+module Arithmetic :
+sig
+ (** Integer Arithmetic *)
+ module Integer :
+ sig
+ (** Create a new integer sort. *)
+ val mk_sort : context -> Sort.sort
+
+ (** Retrieve the int value. *)
+ val get_int : Expr.expr -> int
+
+ (** Get a big_int from an integer numeral *)
+ val get_big_int : Expr.expr -> Big_int.big_int
+
+ (** Returns a string representation of a numeral. *)
+ val numeral_to_string : Expr.expr -> string
+
+ (** Creates an integer constant. *)
+ val mk_const : context -> Symbol.symbol -> Expr.expr
+
+ (** Creates an integer constant. *)
+ val mk_const_s : context -> string -> Expr.expr
+
+ (** Create an expression representing [t1 mod t2].
+ The arguments must have int type. *)
+ val mk_mod : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 rem t2].
+ The arguments must have int type. *)
+ val mk_rem : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an integer numeral. *)
+ val mk_numeral_s : context -> string -> Expr.expr
+
+ (** Create an integer numeral.
+ @return A Term with the given value and sort Integer *)
+ val mk_numeral_i : context -> int -> Expr.expr
+
+ (** Coerce an integer to a real.
+
+ There is also a converse operation exposed. It follows the semantics prescribed by the SMT-LIB standard.
+
+ You can take the floor of a real by creating an auxiliary integer Term [k] and
+ and asserting [MakeInt2Real(k) <= t1 < MkInt2Real(k)+1].
+ The argument must be of integer sort. *)
+ val mk_int2real : context -> Expr.expr -> Expr.expr
+
+ (** Create an n-bit bit-vector from an integer argument.
+
+ NB. This function is essentially treated as uninterpreted.
+ So you cannot expect Z3 to precisely reflect the semantics of this function
+ when solving constraints with this function.
+
+ The argument must be of integer sort. *)
+ val mk_int2bv : context -> int -> Expr.expr -> Expr.expr
+ end
+
+ (** Real Arithmetic *)
+ module Real :
+ sig
+ (** Create a real sort. *)
+ val mk_sort : context -> Sort.sort
+
+ (** The numerator of a rational numeral. *)
+ val get_numerator : Expr.expr -> Expr.expr
+
+ (** The denominator of a rational numeral. *)
+ val get_denominator : Expr.expr -> Expr.expr
+
+ (** Get a ratio from a real numeral *)
+ val get_ratio : Expr.expr -> Ratio.ratio
+
+ (** Returns a string representation in decimal notation.
+ The result has at most as many decimal places as indicated by the int argument.*)
+ val to_decimal_string : Expr.expr-> int -> string
+
+ (** Returns a string representation of a numeral. *)
+ val numeral_to_string : Expr.expr-> string
+
+ (** Creates a real constant. *)
+ val mk_const : context -> Symbol.symbol -> Expr.expr
+
+ (** Creates a real constant. *)
+ val mk_const_s : context -> string -> Expr.expr
+
+ (** Create a real numeral from a fraction.
+ @return A Term with rational value and sort Real
+ {!mk_numeral_s} *)
+ val mk_numeral_nd : context -> int -> int -> Expr.expr
+
+ (** Create a real numeral.
+ @return A Term with the given value and sort Real *)
+ val mk_numeral_s : context -> string -> Expr.expr
+
+ (** Create a real numeral.
+ @return A Term with the given value and sort Real *)
+ val mk_numeral_i : context -> int -> Expr.expr
+
+ (** Creates an expression that checks whether a real number is an integer. *)
+ val mk_is_integer : context -> Expr.expr -> Expr.expr
+
+ (** Coerce a real to an integer.
+
+ The semantics of this function follows the SMT-LIB standard for the function to_int.
+ The argument must be of real sort. *)
+ val mk_real2int : context -> Expr.expr -> Expr.expr
+
+ (** Algebraic Numbers *)
+ module AlgebraicNumber :
+ sig
+ (** Return a upper bound for a given real algebraic number.
+ The interval isolating the number is smaller than 1/10^precision.
+ {!is_algebraic_number}
+ @return A numeral Expr of sort Real *)
+ val to_upper : Expr.expr -> int -> Expr.expr
+
+ (** Return a lower bound for the given real algebraic number.
+ The interval isolating the number is smaller than 1/10^precision.
+ {!is_algebraic_number}
+ @return A numeral Expr of sort Real *)
+ val to_lower : Expr.expr -> int -> Expr.expr
+
+ (** Returns a string representation in decimal notation.
+ The result has at most as many decimal places as the int argument provided.*)
+ val to_decimal_string : Expr.expr -> int -> string
+
+ (** Returns a string representation of a numeral. *)
+ val numeral_to_string : Expr.expr -> string
+ end
+ end
+
+ (** Indicates whether the term is of integer sort. *)
+ val is_int : Expr.expr -> bool
+
+ (** Indicates whether the term is an arithmetic numeral. *)
+ val is_arithmetic_numeral : Expr.expr -> bool
+
+ (** Indicates whether the term is a less-than-or-equal *)
+ val is_le : Expr.expr -> bool
+
+ (** Indicates whether the term is a greater-than-or-equal *)
+ val is_ge : Expr.expr -> bool
+
+ (** Indicates whether the term is a less-than *)
+ val is_lt : Expr.expr -> bool
+
+ (** Indicates whether the term is a greater-than *)
+ val is_gt : Expr.expr -> bool
+
+ (** Indicates whether the term is addition (binary) *)
+ val is_add : Expr.expr -> bool
+
+ (** Indicates whether the term is subtraction (binary) *)
+ val is_sub : Expr.expr -> bool
+
+ (** Indicates whether the term is a unary minus *)
+ val is_uminus : Expr.expr -> bool
+
+ (** Indicates whether the term is multiplication (binary) *)
+ val is_mul : Expr.expr -> bool
+
+ (** Indicates whether the term is division (binary) *)
+ val is_div : Expr.expr -> bool
+
+ (** Indicates whether the term is integer division (binary) *)
+ val is_idiv : Expr.expr -> bool
+
+ (** Indicates whether the term is remainder (binary) *)
+ val is_remainder : Expr.expr -> bool
+
+ (** Indicates whether the term is modulus (binary) *)
+ val is_modulus : Expr.expr -> bool
+
+ (** Indicates whether the term is a coercion of integer to real (unary) *)
+ val is_int2real : Expr.expr -> bool
+
+ (** Indicates whether the term is a coercion of real to integer (unary) *)
+ val is_real2int : Expr.expr -> bool
+
+ (** Indicates whether the term is a check that tests whether a real is integral (unary) *)
+ val is_real_is_int : Expr.expr -> bool
+
+ (** Indicates whether the term is of sort real. *)
+ val is_real : Expr.expr -> bool
+
+ (** Indicates whether the term is an integer numeral. *)
+ val is_int_numeral : Expr.expr -> bool
+
+ (** Indicates whether the term is a real numeral. *)
+ val is_rat_numeral : Expr.expr -> bool
+
+ (** Indicates whether the term is an algebraic number *)
+ val is_algebraic_number : Expr.expr -> bool
+
+ (** Create an expression representing [t[0] + t[1] + ...]. *)
+ val mk_add : context -> Expr.expr list -> Expr.expr
+
+ (** Create an expression representing [t[0] * t[1] * ...]. *)
+ val mk_mul : context -> Expr.expr list -> Expr.expr
+
+ (** Create an expression representing [t[0] - t[1] - ...]. *)
+ val mk_sub : context -> Expr.expr list -> Expr.expr
+
+ (** Create an expression representing [-t]. *)
+ val mk_unary_minus : context -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 / t2]. *)
+ val mk_div : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 ^ t2]. *)
+ val mk_power : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 < t2] *)
+ val mk_lt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 <= t2] *)
+ val mk_le : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 > t2] *)
+ val mk_gt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an expression representing [t1 >= t2] *)
+ val mk_ge : context -> Expr.expr -> Expr.expr -> Expr.expr
+end
+
+(** Functions to manipulate bit-vector expressions *)
+module BitVector :
+sig
+ (** Create a new bit-vector sort. *)
+ val mk_sort : context -> int -> Sort.sort
+
+ (** Indicates whether the terms is of bit-vector sort. *)
+ val is_bv : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector numeral *)
+ val is_bv_numeral : Expr.expr -> bool
+
+ (** Indicates whether the term is a one-bit bit-vector with value one *)
+ val is_bv_bit1 : Expr.expr -> bool
+
+ (** Indicates whether the term is a one-bit bit-vector with value zero *)
+ val is_bv_bit0 : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector unary minus *)
+ val is_bv_uminus : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector addition (binary) *)
+ val is_bv_add : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector subtraction (binary) *)
+ val is_bv_sub : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector multiplication (binary) *)
+ val is_bv_mul : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed division (binary) *)
+ val is_bv_sdiv : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector unsigned division (binary) *)
+ val is_bv_udiv : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed remainder (binary) *)
+ val is_bv_SRem : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector unsigned remainder (binary) *)
+ val is_bv_urem : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed modulus *)
+ val is_bv_smod : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed division by zero *)
+ val is_bv_sdiv0 : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector unsigned division by zero *)
+ val is_bv_udiv0 : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed remainder by zero *)
+ val is_bv_srem0 : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector unsigned remainder by zero *)
+ val is_bv_urem0 : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector signed modulus by zero *)
+ val is_bv_smod0 : Expr.expr -> bool
+
+ (** Indicates whether the term is an unsigned bit-vector less-than-or-equal *)
+ val is_bv_ule : Expr.expr -> bool
+
+ (** Indicates whether the term is a signed bit-vector less-than-or-equal *)
+ val is_bv_sle : Expr.expr -> bool
+
+ (** Indicates whether the term is an unsigned bit-vector greater-than-or-equal *)
+ val is_bv_uge : Expr.expr -> bool
+
+ (** Indicates whether the term is a signed bit-vector greater-than-or-equal *)
+ val is_bv_sge : Expr.expr -> bool
+
+ (** Indicates whether the term is an unsigned bit-vector less-than *)
+ val is_bv_ult : Expr.expr -> bool
+
+ (** Indicates whether the term is a signed bit-vector less-than *)
+ val is_bv_slt : Expr.expr -> bool
+
+ (** Indicates whether the term is an unsigned bit-vector greater-than *)
+ val is_bv_ugt : Expr.expr -> bool
+
+ (** Indicates whether the term is a signed bit-vector greater-than *)
+ val is_bv_sgt : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise AND *)
+ val is_bv_and : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise OR *)
+ val is_bv_or : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise NOT *)
+ val is_bv_not : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise XOR *)
+ val is_bv_xor : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise NAND *)
+ val is_bv_nand : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise NOR *)
+ val is_bv_nor : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-wise XNOR *)
+ val is_bv_xnor : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector concatenation (binary) *)
+ val is_bv_concat : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector sign extension *)
+ val is_bv_signextension : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector zero extension *)
+ val is_bv_zeroextension : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector extraction *)
+ val is_bv_extract : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector repetition *)
+ val is_bv_repeat : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector reduce OR *)
+ val is_bv_reduceor : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector reduce AND *)
+ val is_bv_reduceand : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector comparison *)
+ val is_bv_comp : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector shift left *)
+ val is_bv_shiftleft : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector logical shift right *)
+ val is_bv_shiftrightlogical : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector arithmetic shift left *)
+ val is_bv_shiftrightarithmetic : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector rotate left *)
+ val is_bv_rotateleft : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector rotate right *)
+ val is_bv_rotateright : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector rotate left (extended)
+ Similar to Z3_OP_ROTATE_LEFT, but it is a binary operator instead of a parametric one. *)
+ val is_bv_rotateleftextended : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector rotate right (extended)
+ Similar to Z3_OP_ROTATE_RIGHT, but it is a binary operator instead of a parametric one. *)
+ val is_bv_rotaterightextended : Expr.expr -> bool
+
+ (** Indicates whether the term is a coercion from bit-vector to integer
+ This function is not supported by the decision procedures. Only the most
+ rudimentary simplification rules are applied to this function. *)
+ val is_int2bv : Expr.expr -> bool
+
+ (** Indicates whether the term is a coercion from integer to bit-vector
+ This function is not supported by the decision procedures. Only the most
+ rudimentary simplification rules are applied to this function. *)
+ val is_bv2int : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector carry
+ Compute the carry bit in a full-adder. The meaning is given by the
+ equivalence (carry l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3))) *)
+ val is_bv_carry : Expr.expr -> bool
+
+ (** Indicates whether the term is a bit-vector ternary XOR
+ The meaning is given by the equivalence (xor3 l1 l2 l3) <=> (xor (xor l1 l2) l3) *)
+ val is_bv_xor3 : Expr.expr -> bool
+
+ (** The size of a bit-vector sort. *)
+ val get_size : Sort.sort -> int
+
+ (** Retrieve the int value. *)
+ val get_int : Expr.expr -> int
+
+ (** Returns a string representation of a numeral. *)
+ val numeral_to_string : Expr.expr -> string
+
+ (** Creates a bit-vector constant. *)
+ val mk_const : context -> Symbol.symbol -> int -> Expr.expr
+
+ (** Creates a bit-vector constant. *)
+ val mk_const_s : context -> string -> int -> Expr.expr
+
+ (** Bitwise negation.
+ The argument must have a bit-vector sort. *)
+ val mk_not : context -> Expr.expr -> Expr.expr
+
+ (** Take conjunction of bits in a vector,vector of length 1.
+ The argument must have a bit-vector sort. *)
+ val mk_redand : context -> Expr.expr -> Expr.expr
+
+ (** Take disjunction of bits in a vector,vector of length 1.
+ The argument must have a bit-vector sort. *)
+ val mk_redor : context -> Expr.expr -> Expr.expr
+
+ (** Bitwise conjunction.
+ The arguments must have a bit-vector sort. *)
+ val mk_and : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bitwise disjunction.
+ The arguments must have a bit-vector sort. *)
+ val mk_or : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bitwise XOR.
+ The arguments must have a bit-vector sort. *)
+ val mk_xor : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bitwise NAND.
+ The arguments must have a bit-vector sort. *)
+ val mk_nand : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bitwise NOR.
+ The arguments must have a bit-vector sort. *)
+ val mk_nor : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bitwise XNOR.
+ The arguments must have a bit-vector sort. *)
+ val mk_xnor : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Standard two's complement unary minus.
+ The arguments must have a bit-vector sort. *)
+ val mk_neg : context -> Expr.expr -> Expr.expr
+
+ (** Two's complement addition.
+ The arguments must have the same bit-vector sort. *)
+ val mk_add : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement subtraction.
+ The arguments must have the same bit-vector sort. *)
+ val mk_sub : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement multiplication.
+ The arguments must have the same bit-vector sort. *)
+ val mk_mul : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned division.
+
+ It is defined as the floor of [t1/t2] if \c t2 is
+ different from zero. If [t2] is zero, then the result
+ is undefined.
+ The arguments must have the same bit-vector sort. *)
+ val mk_udiv : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Signed division.
+
+ It is defined in the following way:
+
+ - The \c floor of [t1/t2] if \c t2 is different from zero, and [t1*t2 >= 0].
+
+ - The \c ceiling of [t1/t2] if \c t2 is different from zero, and [t1*t2 < 0].
+
+ If [t2] is zero, then the result is undefined.
+ The arguments must have the same bit-vector sort. *)
+ val mk_sdiv : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned remainder.
+
+ It is defined as [t1 - (t1 /u t2) * t2], where [/u] represents unsigned division.
+ If [t2] is zero, then the result is undefined.
+ The arguments must have the same bit-vector sort. *)
+ val mk_urem : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Signed remainder.
+
+ It is defined as [t1 - (t1 /s t2) * t2], where [/s] represents signed division.
+ The most significant bit (sign) of the result is equal to the most significant bit of \c t1.
+
+ If [t2] is zero, then the result is undefined.
+ The arguments must have the same bit-vector sort. *)
+ val mk_srem : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement signed remainder (sign follows divisor).
+
+ If [t2] is zero, then the result is undefined.
+ The arguments must have the same bit-vector sort. *)
+ val mk_smod : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned less-than
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_ult : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement signed less-than
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_slt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned less-than or equal to.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_ule : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement signed less-than or equal to.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_sle : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned greater than or equal to.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_uge : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement signed greater than or equal to.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_sge : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Unsigned greater-than.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_ugt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Two's complement signed greater-than.
+
+ The arguments must have the same bit-vector sort. *)
+ val mk_sgt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bit-vector concatenation.
+
+ The arguments must have a bit-vector sort.
+ @return
+ The result is a bit-vector of size [n1+n2], where [n1] ([n2])
+ is the size of [t1] ([t2]). *)
+ val mk_concat : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Bit-vector extraction.
+
+ Extract the bits between two limits from a bitvector of
+ size [m] to yield a new bitvector of size [n], where
+ [n = high - low + 1]. *)
+ val mk_extract : context -> int -> int -> Expr.expr -> Expr.expr
+
+ (** Bit-vector sign extension.
+
+ Sign-extends the given bit-vector to the (signed) equivalent bitvector of
+ size [m+i], where \c m is the size of the given bit-vector. *)
+ val mk_sign_ext : context -> int -> Expr.expr -> Expr.expr
+
+ (** Bit-vector zero extension.
+
+ Extend the given bit-vector with zeros to the (unsigned) equivalent
+ bitvector of size [m+i], where \c m is the size of the
+ given bit-vector. *)
+ val mk_zero_ext : context -> int -> Expr.expr -> Expr.expr
+
+ (** Bit-vector repetition. *)
+ val mk_repeat : context -> int -> Expr.expr -> Expr.expr
+
+ (** Shift left.
+
+ It is equivalent to multiplication by [2^x] where \c x is the value of third argument.
+
+ NB. The semantics of shift operations varies between environments. This
+ definition does not necessarily capture directly the semantics of the
+ programming language or assembly architecture you are modeling.*)
+ val mk_shl : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Logical shift right
+
+ It is equivalent to unsigned division by [2^x] where \c x is the value of the third argument.
+
+ NB. The semantics of shift operations varies between environments. This
+ definition does not necessarily capture directly the semantics of the
+ programming language or assembly architecture you are modeling.
+
+ The arguments must have a bit-vector sort. *)
+ val mk_lshr : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Arithmetic shift right
+
+ It is like logical shift right except that the most significant
+ bits of the result always copy the most significant bit of the
+ second argument.
+
+ NB. The semantics of shift operations varies between environments. This
+ definition does not necessarily capture directly the semantics of the
+ programming language or assembly architecture you are modeling.
+
+ The arguments must have a bit-vector sort. *)
+ val mk_ashr : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Rotate Left.
+ Rotate bits of \c t to the left \c i times. *)
+ val mk_rotate_left : context -> int -> Expr.expr -> Expr.expr
+
+ (** Rotate Right.
+ Rotate bits of \c t to the right \c i times.*)
+ val mk_rotate_right : context -> int -> Expr.expr -> Expr.expr
+
+ (** Rotate Left.
+ Rotate bits of the second argument to the left.*)
+ val mk_ext_rotate_left : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Rotate Right.
+ Rotate bits of the second argument to the right. *)
+ val mk_ext_rotate_right : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create an integer from the bit-vector argument
+
+ If \c is_signed is false, then the bit-vector \c t1 is treated as unsigned.
+ So the result is non-negative and in the range [[0..2^N-1]], where
+ N are the number of bits in the argument.
+ If \c is_signed is true, \c t1 is treated as a signed bit-vector.
+
+ NB. This function is essentially treated as uninterpreted.
+ So you cannot expect Z3 to precisely reflect the semantics of this function
+ when solving constraints with this function.*)
+ val mk_bv2int : context -> Expr.expr -> bool -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise addition does not overflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_add_no_overflow : context -> Expr.expr -> Expr.expr -> bool -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise addition does not underflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_add_no_underflow : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise subtraction does not overflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_sub_no_overflow : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise subtraction does not underflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_sub_no_underflow : context -> Expr.expr -> Expr.expr -> bool -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise signed division does not overflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_sdiv_no_overflow : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise negation does not overflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_neg_no_overflow : context -> Expr.expr -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise multiplication does not overflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_mul_no_overflow : context -> Expr.expr -> Expr.expr -> bool -> Expr.expr
+
+ (** Create a predicate that checks that the bit-wise multiplication does not underflow.
+
+ The arguments must be of bit-vector sort. *)
+ val mk_mul_no_underflow : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a bit-vector numeral. *)
+ val mk_numeral : context -> string -> int -> Expr.expr
+end
+
+(** Floating-Point Arithmetic *)
+module FloatingPoint :
+sig
+
+ (** Rounding Modes *)
+ module RoundingMode :
+ sig
+ (** Create the RoundingMode sort. *)
+ val mk_sort : context -> Sort.sort
+
+ (** Indicates whether the terms is of floating-point rounding mode sort. *)
+ val is_fprm : Expr.expr -> bool
+
+ (** Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode. *)
+ val mk_round_nearest_ties_to_even : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode. *)
+ val mk_rne : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode. *)
+ val mk_round_nearest_ties_to_away : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode. *)
+ val mk_rna : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardPositive rounding mode. *)
+ val mk_round_toward_positive : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardPositive rounding mode. *)
+ val mk_rtp : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardNegative rounding mode. *)
+ val mk_round_toward_negative : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardNegative rounding mode. *)
+ val mk_rtn : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardZero rounding mode. *)
+ val mk_round_toward_zero : context -> Expr.expr
+
+ (** Create a numeral of RoundingMode sort which represents the TowardZero rounding mode. *)
+ val mk_rtz : context -> Expr.expr
+ end
+
+ (** Create a FloatingPoint sort. *)
+ val mk_sort : context -> int -> int -> Sort.sort
+
+ (** Create the half-precision (16-bit) FloatingPoint sort.*)
+ val mk_sort_half : context -> Sort.sort
+
+ (** Create the half-precision (16-bit) FloatingPoint sort. *)
+ val mk_sort_16 : context -> Sort.sort
+
+ (** Create the single-precision (32-bit) FloatingPoint sort.*)
+ val mk_sort_single : context -> Sort.sort
+
+ (** Create the single-precision (32-bit) FloatingPoint sort. *)
+ val mk_sort_32 : context -> Sort.sort
+
+ (** Create the double-precision (64-bit) FloatingPoint sort. *)
+ val mk_sort_double : context -> Sort.sort
+
+ (** Create the double-precision (64-bit) FloatingPoint sort. *)
+ val mk_sort_64 : context -> Sort.sort
+
+ (** Create the quadruple-precision (128-bit) FloatingPoint sort. *)
+ val mk_sort_quadruple : context -> Sort.sort
+
+ (** Create the quadruple-precision (128-bit) FloatingPoint sort. *)
+ val mk_sort_128 : context -> Sort.sort
+
+ (** Create a floating-point NaN of a given FloatingPoint sort. *)
+ val mk_nan : context -> Sort.sort -> Expr.expr
+
+ (** Create a floating-point infinity of a given FloatingPoint sort. *)
+ val mk_inf : context -> Sort.sort -> bool -> Expr.expr
+
+ (** Create a floating-point zero of a given FloatingPoint sort. *)
+ val mk_zero : context -> Sort.sort -> bool -> Expr.expr
+
+ (** Create an expression of FloatingPoint sort from three bit-vector expressions.
+
+ This is the operator named `fp' in the SMT FP theory definition.
+ Note that \c sign is required to be a bit-vector of size 1. Significand and exponent
+ are required to be greater than 1 and 2 respectively. The FloatingPoint sort
+ of the resulting expression is automatically determined from the bit-vector sizes
+ of the arguments. *)
+ val mk_fp : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Create a numeral of FloatingPoint sort from a float.
+
+ This function is used to create numerals that fit in a float value.
+ It is slightly faster than #Z3_mk_numeral since it is not necessary to parse a string. *)
+ val mk_numeral_f : context -> float -> Sort.sort -> Expr.expr
+
+ (** Create a numeral of FloatingPoint sort from a signed integer. *)
+ val mk_numeral_i : context -> int -> Sort.sort -> Expr.expr
+
+ (** Create a numeral of FloatingPoint sort from a sign bit and two integers. *)
+ val mk_numeral_i_u : context -> bool -> int -> int -> Sort.sort -> Expr.expr
+
+ (** Create a numeral of FloatingPoint sort from a string *)
+ val mk_numeral_s : context -> string -> Sort.sort -> Expr.expr
+
+ (** Indicates whether the terms is of floating-point sort. *)
+ val is_fp : Expr.expr -> bool
+
+
+ (** Indicates whether an expression is a floating-point abs expression *)
+ val is_abs : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point neg expression *)
+ val is_neg : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point add expression *)
+ val is_add : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point sub expression *)
+ val is_sub : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point mul expression *)
+ val is_mul : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point div expression *)
+ val is_div : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point fma expression *)
+ val is_fma : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point sqrt expression *)
+ val is_sqrt : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point rem expression *)
+ val is_rem : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point round_to_integral expression *)
+ val is_round_to_integral : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point min expression *)
+ val is_min : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point max expression *)
+ val is_max : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point leq expression *)
+ val is_leq : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point lt expression *)
+ val is_lt : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point geqexpression *)
+ val is_geq : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point gt expression *)
+ val is_gt : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point eq expression *)
+ val is_eq : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_normal expression *)
+ val is_is_normal : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_subnormal expression *)
+ val is_is_subnormal : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_zero expression *)
+ val is_is_zero : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_infinite expression *)
+ val is_is_infinite : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_nan expression *)
+ val is_is_nan : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_negative expression *)
+ val is_is_negative : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point is_positive expression *)
+ val is_is_positive : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_fp expression *)
+ val is_to_fp : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_fp_unsigned expression *)
+ val is_to_fp_unsigned : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_ubv expression *)
+ val is_to_ubv : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_sbv expression *)
+ val is_to_sbv : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_real expression *)
+ val is_to_real : Expr.expr -> bool
+
+ (** Indicates whether an expression is a floating-point to_ieee_bv expression *)
+ val is_to_ieee_bv : Expr.expr -> bool
+
+
+ (** Returns a string representation of a numeral. *)
+ val numeral_to_string : Expr.expr -> string
+
+ (** Creates a floating-point constant. *)
+ val mk_const : context -> Symbol.symbol -> Sort.sort -> Expr.expr
+
+ (** Creates a floating-point constant. *)
+ val mk_const_s : context -> string -> Sort.sort -> Expr.expr
+
+ (** Floating-point absolute value *)
+ val mk_abs : context -> Expr.expr -> Expr.expr
+
+ (** Floating-point negation *)
+ val mk_neg : context -> Expr.expr -> Expr.expr
+
+ (** Floating-point addition *)
+ val mk_add : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point subtraction *)
+ val mk_sub : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point multiplication *)
+ val mk_mul : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point division *)
+ val mk_div : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point fused multiply-add. *)
+ val mk_fma : context -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point square root *)
+ val mk_sqrt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point remainder *)
+ val mk_rem : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point roundToIntegral.
+
+ Rounds a floating-point number to the closest integer,
+ again represented as a floating-point number. *)
+ val mk_round_to_integral : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Minimum of floating-point numbers. *)
+ val mk_min : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Maximum of floating-point numbers. *)
+ val mk_max : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point less than or equal. *)
+ val mk_leq : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point less than. *)
+ val mk_lt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point greater than or equal. *)
+ val mk_geq : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point greater than. *)
+ val mk_gt : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Floating-point equality. *)
+ val mk_eq : context -> Expr.expr -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a normal floating-point number. *)
+ val mk_is_normal : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a subnormal floating-point number. *)
+ val mk_is_subnormal : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a floating-point number with zero value, i.e., +zero or -zero. *)
+ val mk_is_zero : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a floating-point number representing +oo or -oo. *)
+ val mk_is_infinite : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a NaN. *)
+ val mk_is_nan : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a negative floating-point number. *)
+ val mk_is_negative : context -> Expr.expr -> Expr.expr
+
+ (** Predicate indicating whether t is a positive floating-point number. *)
+ val mk_is_positive : context -> Expr.expr -> Expr.expr
+
+ (** Conversion of a single IEEE 754-2008 bit-vector into a floating-point number. *)
+ val mk_to_fp_bv : context -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** Conversion of a FloatingPoint term into another term of different FloatingPoint sort. *)
+ val mk_to_fp_float : context -> Expr.expr -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** Conversion of a term of real sort into a term of FloatingPoint sort. *)
+ val mk_to_fp_real : context -> Expr.expr -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort. *)
+ val mk_to_fp_signed : context -> Expr.expr -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** Conversion of a 2's complement unsigned bit-vector term into a term of FloatingPoint sort. *)
+ val mk_to_fp_unsigned : context -> Expr.expr -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** C1onversion of a floating-point term into an unsigned bit-vector. *)
+ val mk_to_ubv : context -> Expr.expr -> Expr.expr -> int -> Expr.expr
+
+ (** Conversion of a floating-point term into a signed bit-vector. *)
+ val mk_to_sbv : context -> Expr.expr -> Expr.expr -> int -> Expr.expr
+
+ (** Conversion of a floating-point term into a real-numbered term. *)
+ val mk_to_real : context -> Expr.expr -> Expr.expr
+
+ (** Retrieves the number of bits reserved for the exponent in a FloatingPoint sort. *)
+ val get_ebits : context -> Sort.sort -> int
+
+ (** Retrieves the number of bits reserved for the significand in a FloatingPoint sort. *)
+ val get_sbits : context -> Sort.sort -> int
+
+ (** Retrieves the sign of a floating-point literal. *)
+ val get_numeral_sign : context -> Expr.expr -> bool * int
+
+ (** Return the significand value of a floating-point numeral as a string. *)
+ val get_numeral_significand_string : context -> Expr.expr -> string
+
+ (** Return the exponent value of a floating-point numeral as a string *)
+ val get_numeral_exponent_string : context -> Expr.expr -> string
+
+ (** Return the exponent value of a floating-point numeral as a signed integer *)
+ val get_numeral_exponent_int : context -> Expr.expr -> bool * int
+
+ (** Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format. *)
+ val mk_to_ieee_bv : context -> Expr.expr -> Expr.expr
+
+ (** Conversion of a real-sorted significand and an integer-sorted exponent into a term of FloatingPoint sort. *)
+ val mk_to_fp_int_real : context -> Expr.expr -> Expr.expr -> Expr.expr -> Sort.sort -> Expr.expr
+
+ (** The string representation of a numeral *)
+ val numeral_to_string : Expr.expr -> string
+end
+
+
+(** Functions to manipulate proof expressions *)
+module Proof :
+sig
+ (** Indicates whether the term is a Proof for the expression 'true'. *)
+ val is_true : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for a fact asserted by the user. *)
+ val is_asserted : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for a fact (tagged as goal) asserted by the user. *)
+ val is_goal : Expr.expr -> bool
+
+ (** Indicates whether the term is a binary equivalence modulo namings.
+ This binary predicate is used in proof terms.
+ It captures equisatisfiability and equivalence modulo renamings. *)
+ val is_oeq : Expr.expr -> bool
+
+ (** Indicates whether the term is proof via modus ponens
+
+ Given a proof for p and a proof for (implies p q), produces a proof for q.
+ T1: p
+ T2: (implies p q)
+ [mp T1 T2]: q
+ The second antecedents may also be a proof for (iff p q). *)
+ val is_modus_ponens : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for (R t t), where R is a reflexive relation.
+ This proof object has no antecedents.
+ The only reflexive relations that are used are
+ equivalence modulo namings, equality and equivalence.
+ That is, R is either '~', '=' or 'iff'. *)
+ val is_reflexivity : Expr.expr -> bool
+
+ (** Indicates whether the term is proof by symmetricity of a relation
+
+ Given an symmetric relation R and a proof for (R t s), produces a proof for (R s t).
+ T1: (R t s)
+ [symmetry T1]: (R s t)
+ T1 is the antecedent of this proof object. *)
+ val is_symmetry : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by transitivity of a relation
+
+ Given a transitive relation R, and proofs for (R t s) and (R s u), produces a proof
+ for (R t u).
+ T1: (R t s)
+ T2: (R s u)
+ [trans T1 T2]: (R t u) *)
+ val is_transitivity : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by condensed transitivity of a relation
+
+ Condensed transitivity proof. This proof object is only used if the parameter PROOF_MODE is 1.
+ It combines several symmetry and transitivity proofs.
+ Example:
+ T1: (R a b)
+ T2: (R c b)
+ T3: (R c d)
+ [trans* T1 T2 T3]: (R a d)
+ R must be a symmetric and transitive relation.
+
+ Assuming that this proof object is a proof for (R s t), then
+ a proof checker must check if it is possible to prove (R s t)
+ using the antecedents, symmetry and transitivity. That is,
+ if there is a path from s to t, if we view every
+ antecedent (R a b) as an edge between a and b. *)
+ val is_Transitivity_star : Expr.expr -> bool
+
+ (** Indicates whether the term is a monotonicity proof object.
+
+ T1: (R t_1 s_1)
+ ...
+ Tn: (R t_n s_n)
+ [monotonicity T1 ... Tn]: (R (f t_1 ... t_n) (f s_1 ... s_n))
+ Remark: if t_i == s_i, then the antecedent Ti is suppressed.
+ That is, reflexivity proofs are supressed to save space. *)
+ val is_monotonicity : Expr.expr -> bool
+
+ (** Indicates whether the term is a quant-intro proof
+
+ Given a proof for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)).
+ T1: (~ p q)
+ [quant-intro T1]: (~ (forall (x) p) (forall (x) q)) *)
+ val is_quant_intro : Expr.expr -> bool
+
+ (** Indicates whether the term is a distributivity proof object.
+
+ Given that f (= or) distributes over g (= and), produces a proof for
+ (= (f a (g c d))
+ (g (f a c) (f a d)))
+ If f and g are associative, this proof also justifies the following equality:
+ (= (f (g a b) (g c d))
+ (g (f a c) (f a d) (f b c) (f b d)))
+ where each f and g can have arbitrary number of arguments.
+
+ This proof object has no antecedents.
+ Remark. This rule is used by the CNF conversion pass and
+ instantiated by f = or, and g = and. *)
+ val is_distributivity : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by elimination of AND
+
+ Given a proof for (and l_1 ... l_n), produces a proof for l_i
+ T1: (and l_1 ... l_n)
+ [and-elim T1]: l_i *)
+ val is_and_elimination : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by eliminiation of not-or
+
+ Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i).
+ T1: (not (or l_1 ... l_n))
+ [not-or-elim T1]: (not l_i) *)
+ val is_or_elimination : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by rewriting
+
+ A proof for a local rewriting step (= t s).
+ The head function symbol of t is interpreted.
+
+ This proof object has no antecedents.
+ The conclusion of a rewrite rule is either an equality (= t s),
+ an equivalence (iff t s), or equi-satisfiability (~ t s).
+ Remark: if f is bool, then = is iff.
+
+ Examples:
+ (= (+ ( x : expr ) 0) x)
+ (= (+ ( x : expr ) 1 2) (+ 3 x))
+ (iff (or ( x : expr ) false) x) *)
+ val is_rewrite : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by rewriting
+
+ A proof for rewriting an expression t into an expression s.
+ This proof object is used if the parameter PROOF_MODE is 1.
+ This proof object can have n antecedents.
+ The antecedents are proofs for equalities used as substitution rules.
+ The object is also used in a few cases if the parameter PROOF_MODE is 2.
+ The cases are:
+ - When applying contextual simplification (CONTEXT_SIMPLIFIER=true)
+ - When converting bit-vectors to Booleans (BIT2BOOL=true)
+ - When pulling ite expression up (PULL_CHEAP_ITE_TREES=true) *)
+ val is_rewrite_star : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for pulling quantifiers out.
+
+ A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x) r))). This proof object has no antecedents. *)
+ val is_pull_quant : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for pulling quantifiers out.
+
+ A proof for (iff P Q) where Q is in prenex normal form.
+ This proof object is only used if the parameter PROOF_MODE is 1.
+ This proof object has no antecedents *)
+ val is_pull_quant_star : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for pushing quantifiers in.
+
+ A proof for:
+ (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m] ... p_n[x_1 ... x_m]))
+ (and (forall (x_1 ... x_m) p_1[x_1 ... x_m])
+ ...
+ (forall (x_1 ... x_m) p_n[x_1 ... x_m])))
+ This proof object has no antecedents *)
+ val is_push_quant : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for elimination of unused variables.
+
+ A proof for (iff (forall (x_1 ... x_n y_1 ... y_m) p[x_1 ... x_n])
+ (forall (x_1 ... x_n) p[x_1 ... x_n]))
+
+ It is used to justify the elimination of unused variables.
+ This proof object has no antecedents. *)
+ val is_elim_unused_vars : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for destructive equality resolution
+
+ A proof for destructive equality resolution:
+ (iff (forall (x) (or (not (= ( x : expr ) t)) P[x])) P[t])
+ if ( x : expr ) does not occur in t.
+
+ This proof object has no antecedents.
+
+ Several variables can be eliminated simultaneously. *)
+ val is_der : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for quantifier instantiation
+
+ A proof of (or (not (forall (x) (P x))) (P a)) *)
+ val is_quant_inst : Expr.expr -> bool
+
+ (** Indicates whether the term is a hypthesis marker.
+ Mark a hypothesis in a natural deduction style proof. *)
+ val is_hypothesis : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by lemma
+
+ T1: false
+ [lemma T1]: (or (not l_1) ... (not l_n))
+
+ This proof object has one antecedent: a hypothetical proof for false.
+ It converts the proof in a proof for (or (not l_1) ... (not l_n)),
+ when T1 contains the hypotheses: l_1, ..., l_n. *)
+ val is_lemma : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by unit resolution
+
+ T1: (or l_1 ... l_n l_1' ... l_m')
+ T2: (not l_1)
+ ...
+ T(n+1): (not l_n)
+ [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m') *)
+ val is_unit_resolution : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by iff-true
+
+ T1: p
+ [iff-true T1]: (iff p true) *)
+ val is_iff_true : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by iff-false
+
+ T1: (not p)
+ [iff-false T1]: (iff p false) *)
+ val is_iff_false : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by commutativity
+
+ [comm]: (= (f a b) (f b a))
+
+ f is a commutative operator.
+
+ This proof object has no antecedents.
+ Remark: if f is bool, then = is iff. *)
+ val is_commutativity : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for Tseitin-like axioms
+
+ Proof object used to justify Tseitin's like axioms:
+
+ (or (not (and p q)) p)
+ (or (not (and p q)) q)
+ (or (not (and p q r)) p)
+ (or (not (and p q r)) q)
+ (or (not (and p q r)) r)
+ ...
+ (or (and p q) (not p) (not q))
+ (or (not (or p q)) p q)
+ (or (or p q) (not p))
+ (or (or p q) (not q))
+ (or (not (iff p q)) (not p) q)
+ (or (not (iff p q)) p (not q))
+ (or (iff p q) (not p) (not q))
+ (or (iff p q) p q)
+ (or (not (ite a b c)) (not a) b)
+ (or (not (ite a b c)) a c)
+ (or (ite a b c) (not a) (not b))
+ (or (ite a b c) a (not c))
+ (or (not (not a)) (not a))
+ (or (not a) a)
+
+ This proof object has no antecedents.
+ Note: all axioms are propositional tautologies.
+ Note also that 'and' and 'or' can take multiple arguments.
+ You can recover the propositional tautologies by
+ unfolding the Boolean connectives in the axioms a small
+ bounded number of steps (=3). *)
+ val is_def_axiom : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for introduction of a name
+
+ Introduces a name for a formula/term.
+ Suppose e is an expression with free variables x, and def-intro
+ introduces the name n(x). The possible cases are:
+
+ When e is of Boolean type:
+ [def-intro]: (and (or n (not e)) (or (not n) e))
+
+ or:
+ [def-intro]: (or (not n) e)
+ when e only occurs positively.
+
+ When e is of the form (ite cond th el):
+ [def-intro]: (and (or (not cond) (= n th)) (or cond (= n el)))
+
+ Otherwise:
+ [def-intro]: (= n e) *)
+ val is_def_intro : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for application of a definition
+
+ [apply-def T1]: F ~ n
+ F is 'equivalent' to n, given that T1 is a proof that
+ n is a name for F. *)
+ val is_apply_def : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof iff-oeq
+
+ T1: (iff p q)
+ [iff~ T1]: (~ p q) *)
+ val is_iff_oeq : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for a positive NNF step
+
+ Proof for a (positive) NNF step. Example:
+
+ T1: (not s_1) ~ r_1
+ T2: (not s_2) ~ r_2
+ T3: s_1 ~ r_1'
+ T4: s_2 ~ r_2'
+ [nnf-pos T1 T2 T3 T4]: (~ (iff s_1 s_2)
+ (and (or r_1 r_2') (or r_1' r_2)))
+
+ The negation normal form steps NNF_POS and NNF_NEG are used in the following cases:
+ (a) When creating the NNF of a positive force quantifier.
+ The quantifier is retained (unless the bound variables are eliminated).
+ Example
+ T1: q ~ q_new
+ [nnf-pos T1]: (~ (forall (x T) q) (forall (x T) q_new))
+
+ (b) When recursively creating NNF over Boolean formulas, where the top-level
+ connective is changed during NNF conversion. The relevant Boolean connectives
+ for NNF_POS are 'implies', 'iff', 'xor', 'ite'.
+ NNF_NEG furthermore handles the case where negation is pushed
+ over Boolean connectives 'and' and 'or'. *)
+ val is_nnf_pos : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for a negative NNF step
+
+ Proof for a (negative) NNF step. Examples:
+
+ T1: (not s_1) ~ r_1
+ ...
+ Tn: (not s_n) ~ r_n
+ [nnf-neg T1 ... Tn]: (not (and s_1 ... s_n)) ~ (or r_1 ... r_n)
and
- T1: (not s_1) ~ r_1
- ...
- Tn: (not s_n) ~ r_n
- [nnf-neg T1 ... Tn]: (not (or s_1 ... s_n)) ~ (and r_1 ... r_n)
+ T1: (not s_1) ~ r_1
+ ...
+ Tn: (not s_n) ~ r_n
+ [nnf-neg T1 ... Tn]: (not (or s_1 ... s_n)) ~ (and r_1 ... r_n)
and
- T1: (not s_1) ~ r_1
- T2: (not s_2) ~ r_2
- T3: s_1 ~ r_1'
- T4: s_2 ~ r_2'
- [nnf-neg T1 T2 T3 T4]: (~ (not (iff s_1 s_2))
- (and (or r_1 r_2) (or r_1' r_2')))
- }
- - OP_PR_NNF_STAR: A proof for (~ P Q) where Q is in negation normal form.
+ T1: (not s_1) ~ r_1
+ T2: (not s_2) ~ r_2
+ T3: s_1 ~ r_1'
+ T4: s_2 ~ r_2'
+ [nnf-neg T1 T2 T3 T4]: (~ (not (iff s_1 s_2))
+ (and (or r_1 r_2) (or r_1' r_2'))) *)
+ val is_nnf_neg : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for (~ P Q) here Q is in negation normal form.
+
+ A proof for (~ P Q) where Q is in negation normal form.
+
+ This proof object is only used if the parameter PROOF_MODE is 1.
+
+ This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO. *)
+ val is_nnf_star : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for (~ P Q) where Q is in conjunctive normal form.
+
+ A proof for (~ P Q) where Q is in conjunctive normal form.
+ This proof object is only used if the parameter PROOF_MODE is 1.
+ This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO. *)
+ val is_cnf_star : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for a Skolemization step
+
+ Proof for:
+
+ [sk]: (~ (not (forall ( x : expr ) (p ( x : expr ) y))) (not (p (sk y) y)))
+ [sk]: (~ (exists ( x : expr ) (p ( x : expr ) y)) (p (sk y) y))
+
+ This proof object has no antecedents. *)
+ val is_skolemize : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof by modus ponens for equi-satisfiability.
+
+ Modus ponens style rule for equi-satisfiability.
+ T1: p
+ T2: (~ p q)
+ [mp~ T1 T2]: q *)
+ val is_modus_ponens_oeq : Expr.expr -> bool
+
+ (** Indicates whether the term is a proof for theory lemma
+
+ Generic proof for theory lemmas.
+
+ The theory lemma function comes with one or more parameters.
+ The first parameter indicates the name of the theory.
+ For the theory of arithmetic, additional parameters provide hints for
+ checking the theory lemma.
+ The hints for arithmetic are:
+ - farkas - followed by rational coefficients. Multiply the coefficients to the
+ inequalities in the lemma, add the (negated) inequalities and obtain a contradiction.
+ - triangle-eq - Indicates a lemma related to the equivalence:
+ (iff (= t1 t2) (and (<= t1 t2) (<= t2 t1)))
+ - gcd-test - Indicates an integer linear arithmetic lemma that uses a gcd test. *)
+ val is_theory_lemma : Expr.expr -> bool
+end
+
+(** Goals
+
+ A goal (aka problem). A goal is essentially a
+ of formulas, that can be solved and/or transformed using
+ tactics and solvers. *)
+module Goal :
+sig
+ type goal
+
+ (** The precision of the goal.
+
+ Goals can be transformed using over and under approximations.
+ An under approximation is applied when the objective is to find a model for a given goal.
+ An over approximation is applied when the objective is to find a proof for a given goal. *)
+ val get_precision : goal -> Z3enums.goal_prec
+
+ (** Indicates whether the goal is precise. *)
+ val is_precise : goal -> bool
+
+ (** Indicates whether the goal is an under-approximation. *)
+ val is_underapproximation : goal -> bool
+
+ (** Indicates whether the goal is an over-approximation. *)
+ val is_overapproximation : goal -> bool
+
+ (** Indicates whether the goal is garbage (i.e., the product of over- and under-approximations). *)
+ val is_garbage : goal -> bool
+
+ (** Adds the constraints to the given goal. *)
+ val add : goal -> Expr.expr list -> unit
+
+ (** Indicates whether the goal contains `false'. *)
+ val is_inconsistent : goal -> bool
+
+ (** The depth of the goal.
+ This tracks how many transformations were applied to it. *)
+ val get_depth : goal -> int
+
+ (** Erases all formulas from the given goal. *)
+ val reset : goal -> unit
+
+ (** The number of formulas in the goal. *)
+ val get_size : goal -> int
+
+ (** The formulas in the goal. *)
+ val get_formulas : goal -> Expr.expr list
+
+ (** The number of formulas, subformulas and terms in the goal. *)
+ val get_num_exprs : goal -> int
+
+ (** Indicates whether the goal is empty, and it is precise or the product of an under approximation. *)
+ val is_decided_sat : goal -> bool
+
+ (** Indicates whether the goal contains `false', and it is precise or the product of an over approximation. *)
+ val is_decided_unsat : goal -> bool
+
+ (** Translates (copies) the Goal to another context.. *)
+ val translate : goal -> context -> goal
+
+ (** Simplifies the goal. Essentially invokes the `simplify' tactic on the goal. *)
+ val simplify : goal -> Params.params option -> goal
+
+ (** Creates a new Goal.
+
+ Note that the Context must have been created with proof generation support if
+ the fourth argument is set to true here. *)
+ val mk_goal : context -> bool -> bool -> bool -> goal
+
+ (** A string representation of the Goal. *)
+ val to_string : goal -> string
+end
+
+(** Models
+
+ A Model contains interpretations (assignments) of constants and functions. *)
+module Model :
+sig
+ type model
+
+ (** Function interpretations
+
+ A function interpretation is represented as a finite map and an 'else'.
+ Each entry in the finite map represents the value of a function given a set of arguments. *)
+ module FuncInterp :
+ sig
+ type func_interp
+
+ (** Function interpretations entries
+
+ An Entry object represents an element in the finite map used to a function interpretation. *)
+ module FuncEntry :
+ sig
+ type func_entry
+
+ (** Return the (symbolic) value of this entry.
+ *)
+ val get_value : func_entry -> Expr.expr
+
+ (** The number of arguments of the entry.
+ *)
+ val get_num_args : func_entry -> int
+
+ (** The arguments of the function entry.
+ *)
+ val get_args : func_entry -> Expr.expr list
+
+ (** A string representation of the function entry.
+ *)
+ val to_string : func_entry -> string
+ end
- This proof object is only used if the parameter PROOF_MODE is 1.
+ (** The number of entries in the function interpretation. *)
+ val get_num_entries : func_interp -> int
- This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO.
+ (** The entries in the function interpretation *)
+ val get_entries : func_interp -> FuncEntry.func_entry list
- - OP_PR_CNF_STAR: A proof for (~ P Q) where Q is in conjunctive normal form.
- This proof object is only used if the parameter PROOF_MODE is 1.
- This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO.
+ (** The (symbolic) `else' value of the function interpretation. *)
+ val get_else : func_interp -> Expr.expr
- - OP_PR_SKOLEMIZE: Proof for:
+ (** The arity of the function interpretation *)
+ val get_arity : func_interp -> int
- {e
- [sk]: (~ (not (forall x (p x y))) (not (p (sk y) y)))
- [sk]: (~ (exists x (p x y)) (p (sk y) y))
- }
+ (** A string representation of the function interpretation. *)
+ val to_string : func_interp -> string
+ end
- This proof object has no antecedents.
+ (** Retrieves the interpretation (the assignment) of a func_decl in the model.
+ @return An expression if the function has an interpretation in the model, null otherwise. *)
+ val get_const_interp : model -> FuncDecl.func_decl -> Expr.expr option
- - OP_PR_MODUS_PONENS_OEQ: Modus ponens style rule for equi-satisfiability.
- {e
- T1: p
- T2: (~ p q)
- [mp~ T1 T2]: q
- }
+ (** Retrieves the interpretation (the assignment) of an expression in the model.
+ @return An expression if the constant has an interpretation in the model, null otherwise. *)
+ val get_const_interp_e : model -> Expr.expr -> Expr.expr option
- - OP_PR_TH_LEMMA: Generic proof for theory lemmas.
+ (** Retrieves the interpretation (the assignment) of a non-constant func_decl in the model.
+ @return A FunctionInterpretation if the function has an interpretation in the model, null otherwise. *)
+ val get_func_interp : model -> FuncDecl.func_decl -> FuncInterp.func_interp option
- The theory lemma function comes with one or more parameters.
- The first parameter indicates the name of the theory.
- For the theory of arithmetic, additional parameters provide hints for
- checking the theory lemma.
- The hints for arithmetic are:
+ (** The number of constant interpretations in the model. *)
+ val get_num_consts : model -> int
- - farkas - followed by rational coefficients. Multiply the coefficients to the
- inequalities in the lemma, add the (negated) inequalities and obtain a contradiction.
+ (** The function declarations of the constants in the model. *)
+ val get_const_decls : model -> FuncDecl.func_decl list
- - triangle-eq - Indicates a lemma related to the equivalence:
- {e
- (iff (= t1 t2) (and (<= t1 t2) (<= t2 t1)))
- }
+ (** The number of function interpretations in the model. *)
+ val get_num_funcs : model -> int
- - gcd-test - Indicates an integer linear arithmetic lemma that uses a gcd test.
+ (** The function declarations of the function interpretations in the model. *)
+ val get_func_decls : model -> FuncDecl.func_decl list
+ (** All symbols that have an interpretation in the model. *)
+ val get_decls : model -> FuncDecl.func_decl list
- - OP_PR_HYPER_RESOLVE: Hyper-resolution rule.
+ (** Evaluates an expression in the current model.
+
+ This function may fail if the argument contains quantifiers,
+ is partial (MODEL_PARTIAL enabled), or if it is not well-sorted.
+ In this case a [ModelEvaluationFailedException] is thrown.
+ *)
+ val eval : model -> Expr.expr -> bool -> Expr.expr option
- The premises of the rules is a sequence of clauses.
- The first clause argument is the main clause of the rule.
- One literal from the second, third, .. clause is resolved
- with a literal from the first (main) clause.
+ (** Alias for [eval]. *)
+ val evaluate : model -> Expr.expr -> bool -> Expr.expr option
- Premises of the rules are of the form
- {e
- (or l0 l1 l2 .. ln)
- }
- or
- {e
- (=> (and ln+1 ln+2 .. ln+m) l0)
- }
- or in the most general (ground) form:
- {e
- (=> (and ln+1 ln+2 .. ln+m) (or l0 l1 .. ln-1))
- }
- In other words we use the following (Prolog style) convention for Horn
- implications:
- The head of a Horn implication is position 0,
- the first conjunct in the body of an implication is position 1
- the second conjunct in the body of an implication is position 2
+ (** The number of uninterpreted sorts that the model has an interpretation for. *)
+ val get_num_sorts : model -> int
- For general implications where the head is a disjunction, the
- first n positions correspond to the n disjuncts in the head.
- The next m positions correspond to the m conjuncts in the body.
+ (** The uninterpreted sorts that the model has an interpretation for.
+
+ Z3 also provides an intepretation for uninterpreted sorts used in a formula.
+ The interpretation for a sort is a finite set of distinct values. We say this finite set is
+ the "universe" of the sort.
+ {!get_num_sorts}
+ {!sort_universe} *)
+ val get_sorts : model -> Sort.sort list
- The premises can be universally quantified so that the most
- general non-ground form is:
+ (** The finite set of distinct values that represent the interpretation of a sort.
+ {!get_sorts}
+ @return A list of expressions, where each is an element of the universe of the sort *)
+ val sort_universe : model -> Sort.sort -> AST.ast list
+
+ (** Conversion of models to strings.
+ @return A string representation of the model. *)
+ val to_string : model -> string
+end
- {e
- (forall (vars) (=> (and ln+1 ln+2 .. ln+m) (or l0 l1 .. ln-1)))
- }
+(** Probes
- The hyper-resolution rule takes a sequence of parameters.
- The parameters are substitutions of bound variables separated by pairs
- of literal positions from the main clause and side clause.
-
-
- - OP_RA_STORE: Insert a record into a relation.
- The function takes [n+1] arguments, where the first argument is the relation and the remaining [n] elements
- correspond to the [n] columns of the relation.
-
- - OP_RA_EMPTY: Creates the empty relation.
-
- - OP_RA_IS_EMPTY: Tests if the relation is empty.
-
- - OP_RA_JOIN: Create the relational join.
-
- - OP_RA_UNION: Create the union or convex hull of two relations.
- The function takes two arguments.
-
- - OP_RA_WIDEN: Widen two relations.
- The function takes two arguments.
-
- - OP_RA_PROJECT: Project the columns (provided as numbers in the parameters).
- The function takes one argument.
-
- - OP_RA_FILTER: Filter (restrict) a relation with respect to a predicate.
- The first argument is a relation.
- The second argument is a predicate with free de-Brujin indices
- corresponding to the columns of the relation.
- So the first column in the relation has index 0.
-
- - OP_RA_NEGATION_FILTER: Intersect the first relation with respect to negation
- of the second relation (the function takes two arguments).
- Logically, the specification can be described by a function
-
- target = filter_by_negation(pos, neg, columns)
-
- where columns are pairs c1, d1, .., cN, dN of columns from pos and neg, such that
- target are elements in x in pos, such that there is no y in neg that agrees with
- x on the columns c1, d1, .., cN, dN.
-
-
- - OP_RA_RENAME: rename columns in the relation.
- The function takes one argument.
- The parameters contain the renaming as a cycle.
-
- - OP_RA_COMPLEMENT: Complement the relation.
-
- - OP_RA_SELECT: Check if a record is an element of the relation.
- The function takes [n+1] arguments, where the first argument is a relation,
- and the remaining [n] arguments correspond to a record.
-
- - OP_RA_CLONE: Create a fresh copy (clone) of a relation.
- The function is logically the identity, but
- in the context of a register machine allows
- for [OP_RA_UNION]
- to perform destructive updates to the first argument.
-
-
- - OP_FD_LT: A less than predicate over the finite domain FINITE_DOMAIN_SORT.
-
- - OP_LABEL: A label (used by the Boogie Verification condition generator).
- The label has two parameters, a string and a Boolean polarity.
- It takes one argument, a formula.
-
- - OP_LABEL_LIT: A label literal (used by the Boogie Verification condition generator).
- A label literal has a set of string parameters. It takes no arguments.
-
- - OP_DT_CONSTRUCTOR: datatype constructor.
-
- - OP_DT_RECOGNISER: datatype recognizer.
-
- - OP_DT_ACCESSOR: datatype accessor.
-
- - OP_UNINTERPRETED: kind used for uninterpreted symbols.
-*)
-(**
- {!param_kind}
-
- The different kinds of parameters that can be associated with parameter sets.
- (see {!mk_params}).
-
- - PK_UINT integer parameters.
- - PK_BOOL boolean parameters.
- - PK_DOUBLE double parameters.
- - PK_SYMBOL symbol parameters.
- - PK_STRING string parameters.
- - PK_OTHER all internal parameter kinds which are not exposed in the API.
- - PK_INVALID invalid parameter.
-*)
-(**
- {!ast_print_mode}
- Z3 pretty printing modes (See {!set_ast_print_mode}).
- - PRINT_SMTLIB_FULL: Print AST nodes in SMTLIB verbose format.
- - PRINT_LOW_LEVEL: Print AST nodes using a low-level format.
- - PRINT_SMTLIB_COMPLIANT: Print AST nodes in SMTLIB 1.x compliant format.
- - PRINT_SMTLIB2_COMPLIANT: Print AST nodes in SMTLIB 2.x compliant format.
-*)
-(**
- {!error_code}
- Z3 error codes
- - OK: No error.
- - SORT_ERROR: User tried to build an invalid (type incorrect) AST.
- - IOB: Index out of bounds.
- - INVALID_ARG: Invalid argument was provided.
- - PARSER_ERROR: An error occurred when parsing a string or file.
- - NO_PARSER: Parser output is not available, that is, user didn't invoke {!parse_smtlib_string} or {!parse_smtlib_file}.
- - INVALID_PATTERN: Invalid pattern was used to build a quantifier.
- - MEMOUT_FAIL: A memory allocation failure was encountered.
- - FILE_ACCESS_ERRROR: A file could not be accessed.
- - INVALID_USAGE: API call is invalid in the current state.
- - INTERNAL_FATAL: An error internal to Z3 occurred.
- - DEC_REF_ERROR: Trying to decrement the reference counter of an AST that was deleted or the reference counter was not initialized.
- - EXCEPTION: Internal Z3 exception. Additional details can be retrieved using {!get_error_msg}.
-*)
-(**
- Definitions for update_api.py
- def_Type('CONFIG', 'config', 'Config')
- def_Type('CONTEXT', 'context', 'ContextObj')
- def_Type('AST', 'ast', 'Ast')
- def_Type('APP', 'app', 'Ast')
- def_Type('SORT', 'sort', 'Sort')
- def_Type('FUNC_DECL', 'func_decl', 'FuncDecl')
- def_Type('PATTERN', 'pattern', 'Pattern')
- def_Type('MODEL', 'model', 'Model')
- def_Type('LITERALS', 'literals', 'Literals')
- def_Type('CONSTRUCTOR', 'constructor', 'Constructor')
- def_Type('CONSTRUCTOR_LIST', 'constructor_list', 'ConstructorList')
- def_Type('THEORY', 'theory', 'ctypes.c_void_p')
- def_Type('THEORY_DATA', 'theory_data', 'ctypes.c_void_p')
- def_Type('SOLVER', 'solver', 'SolverObj')
- def_Type('GOAL', 'goal', 'GoalObj')
- def_Type('TACTIC', 'tactic', 'TacticObj')
- def_Type('PARAMS', 'params', 'Params')
- def_Type('PROBE', 'probe', 'ProbeObj')
- def_Type('STATS', 'stats', 'StatsObj')
- def_Type('AST_VECTOR', 'ast_vector', 'AstVectorObj')
- def_Type('AST_MAP', 'ast_map', 'AstMapObj')
- def_Type('APPLY_RESULT', 'apply_result', 'ApplyResultObj')
- def_Type('FUNC_INTERP', 'func_interp', 'FuncInterpObj')
- def_Type('FUNC_ENTRY', 'func_entry', 'FuncEntryObj')
- def_Type('FIXEDPOINT', 'fixedpoint', 'FixedpointObj')
- def_Type('PARAM_DESCRS', 'param_descrs', 'ParamDescrs')
-*)
-
-(** Exceptions raised by Z3. It is safe to continue interacting with Z3 after
- catching [Error] exceptions.
- - {b See also}: {!get_error_msg}
-*)
-exception Error of context * error_code
-
-(**
- {!goal_prec}
- A Goal is essentially a set of formulas. Z3 provide APIs for building strategies/tactics for solving and transforming Goals. Some of these transformations apply under/over approximations.
- - GOAL_PRECISE: Approximations/Relaxations were not applied on the goal (sat and unsat answers were preserved).
- - GOAL_UNDER: Goal is the product of a under-approximation (sat answers are preserved).
- - GOAL_OVER: Goal is the product of an over-approximation (unsat answers are preserved).
- - GOAL_UNDER_OVER: Goal is garbage (it is the product of over- and under-approximations, sat and unsat answers are not preserved).
-*)
-(**
- {2 {L Create context}}
-*)
-(**
- Summary: Create a context using the given configuration.
- After a context is created, the configuration cannot be changed,
- although some parameters can be changed using {!update_param_value}.
- All main interaction with Z3 happens in the context of a [context].
- def_API('mk_context', CONTEXT, (_in(CONFIG),))
-*)
-external mk_context: (string * string) list -> context = "caml_z3_mk_context"
-
-(**
- Summary: Set a value of a context parameter.
- - {b See also}: {!global_param_set}
- def_API('update_param_value', VOID, (_in(CONTEXT), _in(STRING), _in(STRING)))
-*)
-external update_param_value : context -> string -> string -> unit
- = "camlidl_z3_Z3_update_param_value"
-
-(**
- Summary: Return the value of a context parameter.
- - {b See also}: {!global_param_get}
- def_API('get_param_value', BOOL, (_in(CONTEXT), _in(STRING), _out(STRING)))
-*)
-external get_param_value : context -> string -> string option
- = "camlidl_z3_Z3_get_param_value"
-
-(**
- Summary: Interrupt the execution of a Z3 procedure.
- This procedure can be used to interrupt: solvers, simplifiers and tactics.
- def_API('interrupt', VOID, (_in(CONTEXT),))
-*)
-external interrupt : context -> unit
- = "camlidl_z3_Z3_interrupt"
-
-(**
- {2 {L Parameters}}
-*)
-(**
- Summary: Create a Z3 (empty) parameter set.
- Starting at Z3 4.0, parameter sets are used to configure many components such as:
- simplifiers, tactics, solvers, etc.
- def_API('mk_params', PARAMS, (_in(CONTEXT),))
-*)
-external mk_params : context -> params
- = "camlidl_z3_Z3_mk_params"
-
-(**
- Summary: Add a Boolean parameter [k] with value [v] to the parameter set [p].
- def_API('params_set_bool', VOID, (_in(CONTEXT), _in(PARAMS), _in(SYMBOL), _in(BOOL)))
-*)
-external params_set_bool : context -> params -> symbol -> bool -> unit
- = "camlidl_z3_Z3_params_set_bool"
-
-(**
- Summary: Add a unsigned int parameter [k] with value [v] to the parameter set [p].
- def_API('params_set_uint', VOID, (_in(CONTEXT), _in(PARAMS), _in(SYMBOL), _in(UINT)))
-*)
-external params_set_uint : context -> params -> symbol -> int -> unit
- = "camlidl_z3_Z3_params_set_uint"
-
-(**
- Summary: Add a double parameter [k] with value [v] to the parameter set [p].
- def_API('params_set_double', VOID, (_in(CONTEXT), _in(PARAMS), _in(SYMBOL), _in(DOUBLE)))
-*)
-external params_set_double : context -> params -> symbol -> float -> unit
- = "camlidl_z3_Z3_params_set_double"
-
-(**
- Summary: Add a symbol parameter [k] with value [v] to the parameter set [p].
- def_API('params_set_symbol', VOID, (_in(CONTEXT), _in(PARAMS), _in(SYMBOL), _in(SYMBOL)))
-*)
-external params_set_symbol : context -> params -> symbol -> symbol -> unit
- = "camlidl_z3_Z3_params_set_symbol"
-
-(**
- Summary: Convert a parameter set into a string. This function is mainly used for printing the
- contents of a parameter set.
- def_API('params_to_string', STRING, (_in(CONTEXT), _in(PARAMS)))
-*)
-external params_to_string : context -> params -> string
- = "camlidl_z3_Z3_params_to_string"
-
-(**
- Summary: Validate the parameter set [p] against the parameter description set [d].
- The procedure invokes the error handler if [p] is invalid.
- def_API('params_validate', VOID, (_in(CONTEXT), _in(PARAMS), _in(PARAM_DESCRS)))
-*)
-external params_validate : context -> params -> param_descrs -> unit
- = "camlidl_z3_Z3_params_validate"
-
-(**
- {2 {L Parameter Descriptions}}
-*)
-(**
- Summary: Return the kind associated with the given parameter name [n].
- def_API('param_descrs_get_kind', UINT, (_in(CONTEXT), _in(PARAM_DESCRS), _in(SYMBOL)))
-*)
-external param_descrs_get_kind : context -> param_descrs -> symbol -> param_kind
- = "camlidl_z3_Z3_param_descrs_get_kind"
-
-(**
- Summary: Return the number of parameters in the given parameter description set.
- def_API('param_descrs_size', UINT, (_in(CONTEXT), _in(PARAM_DESCRS)))
-*)
-external param_descrs_size : context -> param_descrs -> int
- = "camlidl_z3_Z3_param_descrs_size"
-
-(**
- Summary: Return the number of parameters in the given parameter description set.
- - {b Precondition}: i < param_descrs_size c p
- def_API('param_descrs_get_name', SYMBOL, (_in(CONTEXT), _in(PARAM_DESCRS), _in(UINT)))
-*)
-external param_descrs_get_name : context -> param_descrs -> int -> symbol
- = "camlidl_z3_Z3_param_descrs_get_name"
-
-(**
- Summary: Convert a parameter description set into a string. This function is mainly used for printing the
- contents of a parameter description set.
- def_API('param_descrs_to_string', STRING, (_in(CONTEXT), _in(PARAM_DESCRS)))
-*)
-external param_descrs_to_string : context -> param_descrs -> string
- = "camlidl_z3_Z3_param_descrs_to_string"
-
-(**
- {2 {L Symbols}}
-*)
-
-(**
- Refined view of a {!symbol}.
- - {b See also}: {!mk_symbol}
- - {b See also}: {!symbol_refine}
-*)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
-
-
-(**
- Summary: \[ [ mk_symbol c sr ] \] constructs the symbol described by [sr].
- - {b See also}: {!symbol_refine}
-*)
-val mk_symbol: context -> symbol_refined -> symbol
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a Z3 symbol using an integer.
- Symbols are used to name several term and type constructors.
- NB. Not all integers can be passed to this function.
- The legal range of unsigned int integers is 0 to 2^30-1.
- - {b See also}: {!mk_string_symbol}
- def_API('mk_int_symbol', SYMBOL, (_in(CONTEXT), _in(INT)))
-*)
-external mk_int_symbol : context -> int -> symbol
- = "camlidl_z3_Z3_mk_int_symbol"
-
-(**
- Summary: Create a Z3 symbol using a C string.
- Symbols are used to name several term and type constructors.
- - {b See also}: {!mk_int_symbol}
- def_API('mk_string_symbol', SYMBOL, (_in(CONTEXT), _in(STRING)))
-*)
-external mk_string_symbol : context -> string -> symbol
- = "camlidl_z3_Z3_mk_string_symbol"
-
-(**
- {2 {L Sorts}}
-*)
-
-(**
- A datatype constructor descriptor.
-*)
-type datatype_constructor_desc = {
- constructor_desc : symbol; (** name of the constructor function *)
- recognizer_desc : symbol; (** name of the recognizer function *)
- accessor_descs : (symbol * sort) array; (** names and sorts of the fields *)
-}
-(**
- A datatype is described by a name and constructor descriptors.
-*)
-type datatype_desc = symbol * datatype_constructor_desc array
-(**
- A datatype constructor representation.
-*)
-type datatype_constructor = {
- constructor : func_decl; (** constructor function *)
- recognizer : func_decl; (** recognizer function *)
- accessors : func_decl array; (** field accessor functions *)
-}
-(**
- A datatype is represented by a sort and constructors.
-*)
-type datatype = sort * datatype_constructor array
-(**
- Refined view of a {!sort}.
- - {b See also}: {!mk_sort}
- - {b See also}: {!sort_refine}
-*)
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_bv of int
- | Sort_finite_domain of symbol * int64
- | Sort_real
- | Sort_array of sort * sort
- | Sort_datatype of datatype_constructor array
- | Sort_relation of sort array
- | Sort_unknown
-
-
-(**
- Summary: \[ [ mk_sort c sr ] \] constructs the sort described by [sr].
- - {b Precondition}: [sr] is not of form [Sort_relation] or [Sort_unknown], which cannot be directly constructed
- - {b See also}: {!mk_datatypes}
- - {b See also}: {!sort_refine}
-*)
-val mk_sort: context -> sort_refined -> sort
-(**
- \[ [mk_datatypes ctx sorts_to_descriptors] \] creates mutually recursive datatypes described by
- [sorts_to_descriptors], which is a function from the sorts of the datatypes to be created to
- descriptors of the datatypes' constructors.
- - {b See also}: {!Test_mlapi.forest_example}
-*)
-val mk_datatypes: context -> (sort array -> (datatype_desc array) option) -> datatype array
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a free (uninterpreted) type using the given name (symbol).
- Two free types are considered the same iff the have the same name.
- def_API('mk_uninterpreted_sort', SORT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external mk_uninterpreted_sort : context -> symbol -> sort
- = "camlidl_z3_Z3_mk_uninterpreted_sort"
-
-(**
- Summary: Create the Boolean type.
- This type is used to create propositional variables and predicates.
- def_API('mk_bool_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_bool_sort : context -> sort
- = "camlidl_z3_Z3_mk_bool_sort"
-
-(**
- Summary: Create the integer type.
- This type is not the int type found in programming languages.
- A machine integer can be represented using bit-vectors. The function
- {!mk_bv_sort} creates a bit-vector type.
- - {b See also}: {!mk_bv_sort}
- def_API('mk_int_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_int_sort : context -> sort
- = "camlidl_z3_Z3_mk_int_sort"
-
-(**
- Summary: Create the real type.
- This type is not a floating point number.
- Z3 does not have support for floating point numbers yet.
- def_API('mk_real_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_real_sort : context -> sort
- = "camlidl_z3_Z3_mk_real_sort"
-
-(**
- Summary: Create a bit-vector type of the given size.
- This type can also be seen as a machine integer.
- - {b Remarks}: The size of the bitvector type must be greater than zero.
- def_API('mk_bv_sort', SORT, (_in(CONTEXT), _in(UINT)))
-*)
-external mk_bv_sort : context -> int -> sort
- = "camlidl_z3_Z3_mk_bv_sort"
-
-(**
- Summary: Create a named finite domain sort.
- To create constants that belong to the finite domain,
- use the APIs for creating numerals and pass a numeric
- constant together with the sort returned by this call.
- - {b See also}: {!get_finite_domain_sort_size}
- def_API('mk_finite_domain_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT64)))
-*)
-external mk_finite_domain_sort : context -> symbol -> int64 -> sort
- = "camlidl_z3_Z3_mk_finite_domain_sort"
-
-(**
- Summary: Create an array type.
- We usually represent the array type as: {e [domain -> range] }.
- Arrays are usually used to model the heap/memory in software verification.
- - {b See also}: {!mk_select}
- - {b See also}: {!mk_store}
- def_API('mk_array_sort', SORT, (_in(CONTEXT), _in(SORT), _in(SORT)))
-*)
-external mk_array_sort : context -> sort -> sort -> sort
- = "camlidl_z3_Z3_mk_array_sort"
-
-(**
- Summary: Create a tuple type.
- [mk_tuple_sort c name field_names field_sorts] creates a tuple with a constructor named [name],
- a [n] fields, where [n] is the size of the arrays [field_names] and [field_sorts].
- @param c logical context
- @param mk_tuple_name name of the constructor function associated with the tuple type.
- @param num_fields number of fields in the tuple type.
- @param field_names name of the projection functions.
- @param field_sorts type of the tuple fields.
- @param mk_tuple_decl output parameter that will contain the constructor declaration.
- @param proj_decl output parameter that will contain the projection function declarations. This field must be a buffer of size [num_fields] allocated by the user.
- def_API('mk_tuple_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _out(FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external mk_tuple_sort : context -> symbol -> symbol array -> sort array -> sort * func_decl * func_decl array
- = "camlidl_z3_Z3_mk_tuple_sort"
-
-(**
- Summary: Create a enumeration sort.
- [mk_enumeration_sort c enums] creates an enumeration sort with enumeration names [enums],
- it also returns [n] predicates, where [n] is the number of [enums] corresponding
- to testing whether an element is one of the enumerants.
- @param c logical context
- @param name name of the enumeration sort.
- @param n number of elemenets in enumeration sort.
- @param enum_names names of the enumerated elements.
- @param enum_consts constants corresponding to the enumerated elements.
- @param enum_testers predicates testing if terms of the enumeration sort correspond to an enumeration.
- For example, if this function is called with three symbols A, B, C and the name S, then
- [s] is a sort whose name is S, and the function returns three terms corresponding to A, B, C in
- [enum_consts]. The array [enum_testers] has three predicates of type {e (s -> Bool) }.
- The first predicate (corresponding to A) is true when applied to A, and false otherwise.
- Similarly for the other predicates.
- def_API('mk_enumeration_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SYMBOL), _out_array(2, FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external mk_enumeration_sort : context -> symbol -> symbol array -> sort * func_decl array * func_decl array
- = "camlidl_z3_Z3_mk_enumeration_sort"
-
-(**
- Summary: Create a list sort
- [mk_list_sort c name elem_sort] creates a list sort of [name], over elements of sort [elem_sort].
- @param c logical context
- @param name name of the list sort.
- @param elem_sort sort of list elements.
- @param nil_decl declaration for the empty list.
- @param is_nil_decl test for the empty list.
- @param cons_decl declaration for a cons cell.
- @param is_cons_decl cons cell test.
- @param head_decl list head.
- @param tail_decl list tail.
- def_API('mk_list_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(SORT), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL)))
-*)
-external mk_list_sort : context -> symbol -> sort -> sort * func_decl * func_decl * func_decl * func_decl * func_decl * func_decl
- = "camlidl_z3_Z3_mk_list_sort"
-
-(*
-(**
- Summary: Create a constructor.
- @param c logical context.
- @param name constructor name.
- @param recognizer name of recognizer function.
- @param num_fields number of fields in constructor.
- @param field_names names of the constructor fields.
- @param sorts field sorts, [None]
- if the field sort refers to a recursive sort.
- @param sort_refs reference to datatype sort that is an argument to the constructor; if the corresponding
- sort reference is [None],
- then the value in sort_refs should be an index referring to
- one of the recursive datatypes that is declared.
- def_API('mk_constructor', CONSTRUCTOR, (_in(CONTEXT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(3, SYMBOL), _in_array(3, SORT), _in_array(3, UINT)))
-*)
-external mk_constructor : context -> symbol -> symbol -> symbol array -> sort option array -> int array -> constructor
- = "camlidl_z3_Z3_mk_constructor_bytecode" "camlidl_z3_Z3_mk_constructor"
-
-(**
- Summary: Reclaim memory allocated to constructor.
- @param c logical context.
- @param constr constructor.
- def_API('del_constructor', VOID, (_in(CONTEXT), _in(CONSTRUCTOR)))
-*)
-external del_constructor : context -> constructor -> unit
- = "camlidl_z3_Z3_del_constructor"
-
-(**
- Summary: Create datatype, such as lists, trees, records, enumerations or unions of records.
- The datatype may be recursive. Return the datatype sort.
- @param c logical context.
- @param name name of datatype.
- @param num_constructors number of constructors passed in.
- @param constructors array of constructor containers.
- def_API('mk_datatype', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _inout_array(2, CONSTRUCTOR)))
-*)
-external mk_datatype : context -> symbol -> constructor array -> sort * constructor array
- = "camlidl_z3_Z3_mk_datatype"
-
-(**
- Summary: Create list of constructors.
- @param c logical context.
- @param num_constructors number of constructors in list.
- @param constructors list of constructors.
- def_API('mk_constructor_list', CONSTRUCTOR_LIST, (_in(CONTEXT), _in(UINT), _in_array(1, CONSTRUCTOR)))
-*)
-external mk_constructor_list : context -> constructor array -> constructor_list
- = "camlidl_z3_Z3_mk_constructor_list"
-
-(**
- Summary: Reclaim memory allocated for constructor list.
- Each constructor inside the constructor list must be independently reclaimed using {!del_constructor}.
- @param c logical context.
- @param clist constructor list container.
- def_API('del_constructor_list', VOID, (_in(CONTEXT), _in(CONSTRUCTOR_LIST)))
-*)
-external del_constructor_list : context -> constructor_list -> unit
- = "camlidl_z3_Z3_del_constructor_list"
-
-(**
- Summary: Create mutually recursive datatypes.
- @param c logical context.
- @param num_sorts number of datatype sorts.
- @param sort_names names of datatype sorts.
- @param sorts array of datatype sorts.
- @param constructor_lists list of constructors, one list per sort.
- def_API('mk_datatypes', VOID, (_in(CONTEXT), _in(UINT), _in_array(1, SYMBOL), _out_array(1, SORT), _inout_array(1, CONSTRUCTOR_LIST)))
-*)
-external mk_datatypes : context -> symbol array -> constructor_list array -> sort array * constructor_list array
- = "camlidl_z3_Z3_mk_datatypes"
-
-(**
- Summary: Query constructor for declared functions.
- @param c logical context.
- @param constr constructor container. The container must have been passed in to a {!mk_datatype} call.
- @param num_fields number of accessor fields in the constructor.
- @param constructor constructor function declaration.
- @param tester constructor test function declaration.
- @param accessors array of accessor function declarations.
- def_API('query_constructor', VOID, (_in(CONTEXT), _in(CONSTRUCTOR), _in(UINT), _out(FUNC_DECL), _out(FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external query_constructor : context -> constructor -> int -> func_decl * func_decl * func_decl array
- = "camlidl_z3_Z3_query_constructor"
-
-*)
-(**
- {2 {L Constants and Applications}}
-*)
-(**
- Summary: Declare a constant or function.
- [mk_func_decl c n d r] creates a function with name [n], domain [d], and range [r].
- The arity of the function is the size of the array [d].
- @param c logical context.
- @param s name of the constant or function.
- @param domain_size number of arguments. It is 0 when declaring a constant.
- @param domain array containing the sort of each argument. The array must contain domain_size elements. It is 0 when declaring a constant.
- @param range sort of the constant or the return sort of the function.
- After declaring a constant or function, the function
- {!mk_app} can be used to create a constant or function
- application.
- - {b See also}: {!mk_app}
- def_API('mk_func_decl', FUNC_DECL, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SORT), _in(SORT)))
-*)
-external mk_func_decl : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3_Z3_mk_func_decl"
-
-(**
- Summary: Create a constant or function application.
- - {b See also}: {!mk_func_decl}
- def_API('mk_app', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT), _in_array(2, AST)))
-*)
-external mk_app : context -> func_decl -> ast array -> ast
- = "camlidl_z3_Z3_mk_app"
-
-(**
- Summary: Declare and create a constant.
- [mk_const c s t] is a shorthand for [mk_app c (mk_func_decl c s [||] t) [||]]
- - {b See also}: {!mk_func_decl}
- - {b See also}: {!mk_app}
- def_API('mk_const', AST, (_in(CONTEXT), _in(SYMBOL), _in(SORT)))
-*)
-external mk_const : context -> symbol -> sort -> ast
- = "camlidl_z3_Z3_mk_const"
-
-(**
- Summary: Declare a fresh constant or function.
- Z3 will generate an unique name for this function declaration.
- - {b See also}: {!mk_func_decl}
- def_API('mk_fresh_func_decl', FUNC_DECL, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SORT), _in(SORT)))
-*)
-external mk_fresh_func_decl : context -> string -> sort array -> sort -> func_decl
- = "camlidl_z3_Z3_mk_fresh_func_decl"
-
-(**
- Summary: Declare and create a fresh constant.
- [mk_fresh_const c p t] is a shorthand for [mk_app c (mk_fresh_func_decl c p [||] t) [||]].
- - {b See also}: {!mk_func_decl}
- - {b See also}: {!mk_app}
- def_API('mk_fresh_const', AST, (_in(CONTEXT), _in(STRING), _in(SORT)))
-*)
-external mk_fresh_const : context -> string -> sort -> ast
- = "camlidl_z3_Z3_mk_fresh_const"
-
-(**
- {2 {L Propositional Logic and Equality}}
-*)
-(**
- Summary: Create an AST node representing [true].
- def_API('mk_true', AST, (_in(CONTEXT), ))
-*)
-external mk_true : context -> ast
- = "camlidl_z3_Z3_mk_true"
-
-(**
- Summary: Create an AST node representing [false].
- def_API('mk_false', AST, (_in(CONTEXT), ))
-*)
-external mk_false : context -> ast
- = "camlidl_z3_Z3_mk_false"
-
-(**
- Summary: \[ [ mk_eq c l r ] \]
- Create an AST node representing {e l = r }.
- The nodes [l] and [r] must have the same type.
- def_API('mk_eq', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_eq : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_eq"
-
-(**
- Summary: \[ [mk_distinct c [| t_1; ...; t_n |]] \] Create an AST
- node represeting a distinct construct. It is used for declaring
- the arguments t_i pairwise distinct.
- The [distinct] construct is used for declaring the arguments pairwise distinct.
- That is, {e Forall 0 <= i < j < num_args. not args[i] = args[j] }.
- All arguments must have the same sort.
- - {b Remarks}: The number of arguments of a distinct construct must be greater than one.
- def_API('mk_distinct', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_distinct : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_distinct"
-
-(**
- Summary: \[ [ mk_not c a ] \]
- Create an AST node representing {e not(a) }.
- The node [a] must have Boolean sort.
- def_API('mk_not', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_not : context -> ast -> ast
- = "camlidl_z3_Z3_mk_not"
-
-(**
- Summary: \[ [ mk_ite c t1 t2 t2 ] \]
- Create an AST node representing an if-then-else: {e ite(t1, t2,
- t3) }.
- The node [t1] must have Boolean sort, [t2] and [t3] must have the same sort.
- The sort of the new node is equal to the sort of [t2] and [t3].
- def_API('mk_ite', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(AST)))
-*)
-external mk_ite : context -> ast -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ite"
-
-(**
- Summary: \[ [ mk_iff c t1 t2 ] \]
- Create an AST node representing {e t1 iff t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_iff', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_iff : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_iff"
-
-(**
- Summary: \[ [ mk_implies c t1 t2 ] \]
- Create an AST node representing {e t1 implies t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_implies', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_implies : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_implies"
-
-(**
- Summary: \[ [ mk_xor c t1 t2 ] \]
- Create an AST node representing {e t1 xor t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_xor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_xor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_xor"
-
-(**
- Summary: \[ [mk_and c [| t_1; ...; t_n |]] \] Create the conjunction: {e t_1 and ... and t_n}.
- All arguments must have Boolean sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_and', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_and : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_and"
-
-(**
- Summary: \[ [mk_or c [| t_1; ...; t_n |]] \] Create the disjunction: {e t_1 or ... or t_n}.
- All arguments must have Boolean sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_or', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_or : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_or"
-
-(**
- {2 {L Arithmetic: Integers and Reals}}
-*)
-(**
- Summary: \[ [mk_add c [| t_1; ...; t_n |]] \] Create the term: {e t_1 + ... + t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_add', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_add : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_add"
-
-(**
- Summary: \[ [mk_mul c [| t_1; ...; t_n |]] \] Create the term: {e t_1 * ... * t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: Z3 has limited support for non-linear arithmetic.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_mul', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_mul : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_mul"
-
-(**
- Summary: \[ [mk_sub c [| t_1; ...; t_n |]] \] Create the term: {e t_1 - ... - t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_sub', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_sub : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_sub"
-
-(**
- Summary: \[ [mk_unary_minus c arg] \] Create the term: {e - arg}.
- The arguments must have int or real type.
- def_API('mk_unary_minus', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_unary_minus : context -> ast -> ast
- = "camlidl_z3_Z3_mk_unary_minus"
-
-(**
- Summary: \[ [mk_div c t_1 t_2] \] Create the term: {e t_1 div t_2}.
- The arguments must either both have int type or both have real type.
- If the arguments have int type, then the result type is an int type, otherwise the
- the result type is real.
- def_API('mk_div', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_div : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_div"
-
-(**
- Summary: \[ [mk_mod c t_1 t_2] \] Create the term: {e t_1 mod t_2}.
- The arguments must have int type.
- def_API('mk_mod', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_mod : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_mod"
-
-(**
- Summary: \[ [mk_rem c t_1 t_2] \] Create the term: {e t_1 rem t_2}.
- The arguments must have int type.
- def_API('mk_rem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_rem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_rem"
-
-(**
- The arguments must have int or real type.
- def_API('mk_power', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_power : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_power"
-
-(**
- Summary: \[ [ mk_lt c t1 t2 ] \]
- Create less than.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_lt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_lt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_lt"
-
-(**
- Summary: \[ [ mk_le c t1 t2 ] \]
- Create less than or equal to.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_le', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_le : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_le"
-
-(**
- Summary: \[ [ mk_gt c t1 t2 ] \]
- Create greater than.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_gt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_gt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_gt"
-
-(**
- Summary: \[ [ mk_ge c t1 t2 ] \]
- Create greater than or equal to.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_ge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ge"
-
-(**
- Summary: \[ [ mk_int2real c t1 ] \]
- Coerce an integer to a real.
- There is also a converse operation exposed.
- It follows the semantics prescribed by the SMT-LIB standard.
- You can take the floor of a real by
- creating an auxiliary integer constant [k] and
- and asserting {e mk_int2real(k) <= t1 < mk_int2real(k)+1 }.
- The node [t1] must have sort integer.
- - {b See also}: {!mk_real2int}
- - {b See also}: {!mk_is_int}
- def_API('mk_int2real', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_int2real : context -> ast -> ast
- = "camlidl_z3_Z3_mk_int2real"
-
-(**
- Summary: \[ [ mk_real2int c t1 ] \]
- Coerce a real to an integer.
- The semantics of this function follows the SMT-LIB standard
- for the function to_int
- - {b See also}: {!mk_int2real}
- - {b See also}: {!mk_is_int}
- def_API('mk_real2int', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_real2int : context -> ast -> ast
- = "camlidl_z3_Z3_mk_real2int"
-
-(**
- Summary: \[ [ mk_is_int c t1 ] \]
- Check if a real number is an integer.
- - {b See also}: {!mk_int2real}
- - {b See also}: {!mk_real2int}
- def_API('mk_is_int', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_is_int : context -> ast -> ast
- = "camlidl_z3_Z3_mk_is_int"
-
-(**
- {2 {L Bit-vectors}}
-*)
-(**
- Summary: \[ [ mk_bvnot c t1 ] \]
- Bitwise negation.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvnot', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvnot : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnot"
-
-(**
- Summary: \[ [ mk_bvredand c t1 ] \]
- Take conjunction of bits in vector, return vector of length 1.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvredand', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvredand : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvredand"
-
-(**
- Summary: \[ [ mk_bvredor c t1 ] \]
- Take disjunction of bits in vector, return vector of length 1.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvredor', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvredor : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvredor"
-
-(**
- Summary: \[ [ mk_bvand c t1 t2 ] \]
- Bitwise and.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvand', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvand : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvand"
-
-(**
- Summary: \[ [ mk_bvor c t1 t2 ] \]
- Bitwise or.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvor"
-
-(**
- Summary: \[ [ mk_bvxor c t1 t2 ] \]
- Bitwise exclusive-or.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvxor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvxor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvxor"
-
-(**
- Summary: \[ [ mk_bvnand c t1 t2 ] \]
- Bitwise nand.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvnand', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvnand : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnand"
-
-(**
- Summary: \[ [ mk_bvnor c t1 t2 ] \]
- Bitwise nor.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvnor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvnor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvnor"
-
-(**
- Summary: \[ [ mk_bvxnor c t1 t2 ] \]
- Bitwise xnor.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvxnor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvxnor : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvxnor"
-
-(**
- Summary: \[ [ mk_bvneg c t1 ] \]
- Standard two's complement unary minus.
- The node [t1] must have bit-vector sort.
- def_API('mk_bvneg', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvneg : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvneg"
-
-(**
- Summary: \[ [ mk_bvadd c t1 t2 ] \]
- Standard two's complement addition.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvadd : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvadd"
-
-(**
- Summary: \[ [ mk_bvsub c t1 t2 ] \]
- Standard two's complement subtraction.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsub : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsub"
-
-(**
- Summary: \[ [ mk_bvmul c t1 t2 ] \]
- Standard two's complement multiplication.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvmul : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvmul"
-
-(**
- Summary: \[ [ mk_bvudiv c t1 t2 ] \]
- Unsigned division.
- It is defined as the [floor] of {e t1/t2 } if [t2] is
- different from zero. If {e t2 } is zero, then the result
- is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvudiv', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvudiv : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvudiv"
-
-(**
- Summary: \[ [ mk_bvsdiv c t1 t2 ] \]
- Two's complement signed division.
- It is defined in the following way:
- - The [floor] of {e t1/t2 } if [t2] is different from zero, and {e t1*t2 >= 0 }.
- - The [ceiling] of {e t1/t2 } if [t2] is different from zero, and {e t1*t2 < 0 }.
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsdiv', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsdiv : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsdiv"
-
-(**
- Summary: \[ [ mk_bvurem c t1 t2 ] \]
- Unsigned remainder.
- It is defined as {e t1 - (t1 /u t2) * t2 }, where {e /u } represents unsigned int division.
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvurem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvurem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvurem"
-
-(**
- Summary: \[ [ mk_bvsrem c t1 t2 ] \]
- Two's complement signed remainder (sign follows dividend).
- It is defined as {e t1 - (t1 /s t2) * t2 }, where {e /s } represents signed division.
- The most significant bit (sign) of the result is equal to the most significant bit of [t1].
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- - {b See also}: {!mk_bvsmod}
- def_API('mk_bvsrem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsrem : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsrem"
-
-(**
- Summary: \[ [ mk_bvsmod c t1 t2 ] \]
- Two's complement signed remainder (sign follows divisor).
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- - {b See also}: {!mk_bvsrem}
- def_API('mk_bvsmod', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsmod : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsmod"
-
-(**
- Summary: \[ [ mk_bvult c t1 t2 ] \]
- Unsigned less than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvult', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvult : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvult"
-
-(**
- Summary: \[ [ mk_bvslt c t1 t2 ] \]
- Two's complement signed less than.
- It abbreviates:
- {v
- (or (and (= (extract[|m-1|:|m-1|] t1) bit1)
- (= (extract[|m-1|:|m-1|] t2) bit0))
- (and (= (extract[|m-1|:|m-1|] t1) (extract[|m-1|:|m-1|] t2))
- (bvult t1 t2)))
- v}
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvslt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvslt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvslt"
-
-(**
- Summary: \[ [ mk_bvule c t1 t2 ] \]
- Unsigned less than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvule', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvule : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvule"
-
-(**
- Summary: \[ [ mk_bvsle c t1 t2 ] \]
- Two's complement signed less than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsle', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsle : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsle"
-
-(**
- Summary: \[ [ mk_bvuge c t1 t2 ] \]
- Unsigned greater than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvuge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvuge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvuge"
-
-(**
- Summary: \[ [ mk_bvsge c t1 t2 ] \]
- Two's complement signed greater than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsge : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsge"
-
-(**
- Summary: \[ [ mk_bvugt c t1 t2 ] \]
- Unsigned greater than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvugt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvugt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvugt"
-
-(**
- Summary: \[ [ mk_bvsgt c t1 t2 ] \]
- Two's complement signed greater than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsgt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsgt : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsgt"
-
-(**
- Summary: \[ [ mk_concat c t1 t2 ] \]
- Concatenate the given bit-vectors.
- The nodes [t1] and [t2] must have (possibly different) bit-vector sorts
- The result is a bit-vector of size {e n1+n2 }, where [n1] ([n2)] is the size
- of [t1] ([t2)].
- def_API('mk_concat', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_concat : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_concat"
-
-(**
- Summary: \[ [ mk_extract c high low t1 ] \]
- Extract the bits [high] down to [low] from a bitvector of
- size [m] to yield a new bitvector of size [n], where {e n =
- high - low + 1 }.
- The node [t1] must have a bit-vector sort.
- def_API('mk_extract', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in(AST)))
-*)
-external mk_extract : context -> int -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_extract"
-
-(**
- Summary: \[ [ mk_sign_ext c i t1 ] \]
- Sign-extend of the given bit-vector to the (signed) equivalent bitvector of
- size {e m+i }, where [m] is the size of the given
- bit-vector.
- The node [t1] must have a bit-vector sort.
- def_API('mk_sign_ext', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_sign_ext : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_sign_ext"
-
-(**
- Summary: \[ [ mk_zero_ext c i t1 ] \]
- Extend the given bit-vector with zeros to the (unsigned) equivalent
- bitvector of size {e m+i }, where [m] is the size of the
- given bit-vector.
- The node [t1] must have a bit-vector sort.
- def_API('mk_zero_ext', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_zero_ext : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_zero_ext"
-
-(**
- Summary: \[ [ mk_repeat c i t1 ] \]
- Repeat the given bit-vector up length {e i }.
- The node [t1] must have a bit-vector sort.
- def_API('mk_repeat', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_repeat : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_repeat"
-
-(**
- Summary: \[ [ mk_bvshl c t1 t2 ] \]
- Shift left.
- It is equivalent to multiplication by {e 2^x } where [x] is the value of the
- third argument.
- NB. The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvshl', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvshl : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvshl"
-
-(**
- Summary: \[ [ mk_bvlshr c t1 t2 ] \]
- Logical shift right.
- It is equivalent to unsigned int division by {e 2^x } where [x] is the
- value of the third argument.
- NB. The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvlshr', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvlshr : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvlshr"
-
-(**
- Summary: \[ [ mk_bvashr c t1 t2 ] \]
- Arithmetic shift right.
- It is like logical shift right except that the most significant
- bits of the result always copy the most significant bit of the
- second argument.
- The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvashr', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvashr : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvashr"
-
-(**
- Summary: \[ [ mk_rotate_left c i t1 ] \]
- Rotate bits of [t1] to the left [i] times.
- The node [t1] must have a bit-vector sort.
- def_API('mk_rotate_left', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_rotate_left : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_rotate_left"
-
-(**
- Summary: \[ [ mk_rotate_right c i t1 ] \]
- Rotate bits of [t1] to the right [i] times.
- The node [t1] must have a bit-vector sort.
- def_API('mk_rotate_right', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_rotate_right : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_rotate_right"
-
-(**
- Summary: \[ [ mk_ext_rotate_left c t1 t2 ] \]
- Rotate bits of [t1] to the left [t2] times.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_ext_rotate_left', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ext_rotate_left : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ext_rotate_left"
-
-(**
- Summary: \[ [ mk_ext_rotate_right c t1 t2 ] \]
- Rotate bits of [t1] to the right [t2] times.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_ext_rotate_right', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ext_rotate_right : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_ext_rotate_right"
-
-(**
- Summary: \[ [ mk_int2bv c n t1 ] \]
- Create an [n] bit bit-vector from the integer argument [t1].
- NB. This function is essentially treated as uninterpreted.
- So you cannot expect Z3 to precisely reflect the semantics of this function
- when solving constraints with this function.
- The node [t1] must have integer sort.
- def_API('mk_int2bv', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_int2bv : context -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_int2bv"
-
-(**
- Summary: \[ [ mk_bv2int c t1 is_signed ] \]
- Create an integer from the bit-vector argument [t1].
- If [is_signed] is false, then the bit-vector [t1] is treated as unsigned int.
- So the result is non-negative
- and in the range {e [0..2^N-1] }, where N are the number of bits in [t1].
- If [is_signed] is true, [t1] is treated as a signed bit-vector.
- This function is essentially treated as uninterpreted.
- So you cannot expect Z3 to precisely reflect the semantics of this function
- when solving constraints with this function.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bv2int', AST, (_in(CONTEXT), _in(AST), _in(BOOL)))
-*)
-external mk_bv2int : context -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bv2int"
-
-(**
- Summary: \[ [ mk_bvadd_no_overflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise addition
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvadd_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvadd_no_overflow"
-
-(**
- Summary: \[ [ mk_bvadd_no_underflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed addition
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvadd_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvadd_no_underflow"
-
-(**
- Summary: \[ [ mk_bvsub_no_overflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed subtraction
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsub_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsub_no_overflow"
-
-(**
- Summary: \[ [ mk_bvsub_no_underflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise subtraction
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvsub_no_underflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvsub_no_underflow"
-
-(**
- Summary: \[ [ mk_bvsdiv_no_overflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed division
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsdiv_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsdiv_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvsdiv_no_overflow"
-
-(**
- Summary: \[ [ mk_bvneg_no_overflow c t1 ] \]
- Check that bit-wise negation does not overflow when
- [t1] is interpreted as a signed bit-vector.
- The node [t1] must have bit-vector sort.
- def_API('mk_bvneg_no_overflow', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvneg_no_overflow : context -> ast -> ast
- = "camlidl_z3_Z3_mk_bvneg_no_overflow"
-
-(**
- Summary: \[ [ mk_bvmul_no_overflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise multiplication
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvmul_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3_Z3_mk_bvmul_no_overflow"
-
-(**
- Summary: \[ [ mk_bvmul_no_underflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed multiplication
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvmul_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_bvmul_no_underflow"
-
-(**
- {2 {L Arrays}}
-*)
-(**
- Summary: \[ [ mk_select c a i ] \]
- Array read.
- The argument [a] is the array and [i] is the index of the array that gets read.
- The node [a] must have an array sort {e [domain -> range] },
- and [i] must have the sort [domain].
- The sort of the result is [range].
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_store}
- def_API('mk_select', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_select : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_select"
-
-(**
- Summary: \[ [ mk_store c a i v ] \]
- Array update.
- The node [a] must have an array sort {e [domain -> range] }, [i] must have sort [domain],
- [v] must have sort range. The sort of the result is {e [domain -> range] }.
- The semantics of this function is given by the theory of arrays described in the SMT-LIB
- standard. See http://smtlib.org for more details.
- The result of this function is an array that is equal to [a] (with respect to [select)]
- on all indices except for [i], where it maps to [v] (and the [select] of [a] with
- respect to [i] may be a different value).
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_select}
- def_API('mk_store', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(AST)))
-*)
-external mk_store : context -> ast -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_store"
-
-(**
- Summary: Create the constant array.
- The resulting term is an array, such that a [select] on an arbitrary index
- produces the value [v].
- @param c logical context.
- @param domain domain sort for the array.
- @param v value that the array maps to.
- def_API('mk_const_array', AST, (_in(CONTEXT), _in(SORT), _in(AST)))
-*)
-external mk_const_array : context -> sort -> ast -> ast
- = "camlidl_z3_Z3_mk_const_array"
-
-(**
- Summary: \[ [ mk_map f n args ] \]
- map f on the the argument arrays.
- The [n] nodes [args] must be of array sorts {e [domain_i -> range_i] }.
- The function declaration [f] must have type {e range_1 .. range_n -> range }.
- [v] must have sort range. The sort of the result is {e [domain_i -> range] }.
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_store}
- - {b See also}: {!mk_select}
- def_API('mk_map', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT), _in_array(2, AST)))
-*)
-external mk_map : context -> func_decl -> int -> ast -> ast
- = "camlidl_z3_Z3_mk_map"
-
-(**
- Summary: Access the array default value.
- Produces the default range value, for arrays that can be represented as
- finite maps with a default range value.
- @param c logical context.
- @param array array value whose default range value is accessed.
- def_API('mk_array_default', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_array_default : context -> ast -> ast
- = "camlidl_z3_Z3_mk_array_default"
-
-(**
- {2 {L Sets}}
-*)
-(**
- Summary: Create Set type.
- def_API('mk_set_sort', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_set_sort : context -> sort -> sort
- = "camlidl_z3_Z3_mk_set_sort"
-
-(**
- Summary: Create the empty set.
- def_API('mk_empty_set', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_empty_set : context -> sort -> ast
- = "camlidl_z3_Z3_mk_empty_set"
-
-(**
- Summary: Create the full set.
- def_API('mk_full_set', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_full_set : context -> sort -> ast
- = "camlidl_z3_Z3_mk_full_set"
-
-(**
- Summary: Add an element to a set.
- The first argument must be a set, the second an element.
- def_API('mk_set_add', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_add : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_add"
-
-(**
- Summary: Remove an element to a set.
- The first argument must be a set, the second an element.
- def_API('mk_set_del', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_del : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_del"
-
-(**
- Summary: Take the union of a list of sets.
- def_API('mk_set_union', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_set_union : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_set_union"
-
-(**
- Summary: Take the intersection of a list of sets.
- def_API('mk_set_intersect', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_set_intersect : context -> ast array -> ast
- = "camlidl_z3_Z3_mk_set_intersect"
-
-(**
- Summary: Take the set difference between two sets.
- def_API('mk_set_difference', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_difference : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_difference"
-
-(**
- Summary: Take the complement of a set.
- def_API('mk_set_complement', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_set_complement : context -> ast -> ast
- = "camlidl_z3_Z3_mk_set_complement"
-
-(**
- Summary: Check for set membership.
- The first argument should be an element type of the set.
- def_API('mk_set_member', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_member : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_member"
-
-(**
- Summary: Check for subsetness of sets.
- def_API('mk_set_subset', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_subset : context -> ast -> ast -> ast
- = "camlidl_z3_Z3_mk_set_subset"
-
-(**
- {2 {L Numerals}}
-*)
-
-(**
- Summary: \[ [ numeral_refined ] \] is the refined view of a numeral .
-*)
-type numeral_refined =
- | Numeral_int of int * sort
- | Numeral_int64 of int64 * sort
- | Numeral_large of string * sort
- | Numeral_rational of numeral_refined * numeral_refined
-
-
-(**
- Summary: \[ [ embed_numeral c nr ] \] constructs the numeral described by [nr].
- - {b See also}: {!numeral_refine}
-*)
-val embed_numeral: context -> numeral_refined -> ast
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a numeral of a given sort.
- @param c logical context.
- @param numeral A string representing the numeral value in decimal notation. If the given sort is a real, then the numeral can be a rational, that is, a string of the form {e [num]* / [num]* }.
- @param ty The sort of the numeral. In the current implementation, the given sort can be an int, real, finite-domain, or bit-vectors of arbitrary size.
- - {b See also}: {!mk_int}
- def_API('mk_numeral', AST, (_in(CONTEXT), _in(STRING), _in(SORT)))
-*)
-external mk_numeral : context -> string -> sort -> ast
- = "camlidl_z3_Z3_mk_numeral"
-
-(**
- Summary: Create a real from a fraction.
- @param c logical context.
- @param num numerator of rational.
- @param den denomerator of rational.
- - {b Precondition}: den != 0
- - {b See also}: {!mk_numeral}
- - {b See also}: {!mk_int}
- def_API('mk_real', AST, (_in(CONTEXT), _in(INT), _in(INT)))
-*)
-external mk_real : context -> int -> int -> ast
- = "camlidl_z3_Z3_mk_real"
-
-(**
- Summary: Create a numeral of an int, bit-vector, or finite-domain sort.
- This function can be use to create numerals that fit in a machine integer.
- It is slightly faster than {!mk_numeral} since it is not necessary to parse a string.
- - {b See also}: {!mk_numeral}
- def_API('mk_int', AST, (_in(CONTEXT), _in(INT), _in(SORT)))
-*)
-external mk_int : context -> int -> sort -> ast
- = "camlidl_z3_Z3_mk_int"
-
-(**
- Summary: Create a numeral of a int, bit-vector, or finite-domain sort.
- This function can be use to create numerals that fit in a machine long long integer.
- It is slightly faster than {!mk_numeral} since it is not necessary to parse a string.
- - {b See also}: {!mk_numeral}
- def_API('mk_int64', AST, (_in(CONTEXT), _in(INT64), _in(SORT)))
-*)
-external mk_int64 : context -> int64 -> sort -> ast
- = "camlidl_z3_Z3_mk_int64"
-
-(**
- {2 {L Quantifiers}}
-*)
-(**
- Summary: Create a pattern for quantifier instantiation.
- Z3 uses pattern matching to instantiate quantifiers. If a
- pattern is not provided for a quantifier, then Z3 will
- automatically compute a set of patterns for it. However, for
- optimal performance, the user should provide the patterns.
- Patterns comprise a list of terms. The list should be
- non-empty. If the list comprises of more than one term, it is
- a called a multi-pattern.
- In general, one can pass in a list of (multi-)patterns in the
- quantifier constructor.
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_pattern', PATTERN, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_pattern : context -> ast array -> pattern
- = "camlidl_z3_Z3_mk_pattern"
-
-(**
- Summary: Create a bound variable.
- Bound variables are indexed by de-Bruijn indices. It is perhaps easiest to explain
- the meaning of de-Bruijn indices by indicating the compilation process from
- non-de-Bruijn formulas to de-Bruijn format.
- {v
- abs(forall (x1) phi) = forall (x1) abs1(phi, x1, 0)
- abs(forall (x1, x2) phi) = abs(forall (x1) abs(forall (x2) phi))
- abs1(x, x, n) = b_n
- abs1(y, x, n) = y
- abs1(f(t1,...,tn), x, n) = f(abs1(t1,x,n), ..., abs1(tn,x,n))
- abs1(forall (x1) phi, x, n) = forall (x1) (abs1(phi, x, n+1))
- v}
- The last line is significant: the index of a bound variable is different depending
- on the scope in which it appears. The deeper x appears, the higher is its
- index.
- @param c logical context
- @param index de-Bruijn index
- @param ty sort of the bound variable
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_bound', AST, (_in(CONTEXT), _in(UINT), _in(SORT)))
-*)
-external mk_bound : context -> int -> sort -> ast
- = "camlidl_z3_Z3_mk_bound"
-
-(**
- Summary: Create a forall formula. It takes an expression [body] that contains bound variables
- of the same sorts as the sorts listed in the array [sorts]. The bound variables are de-Bruijn indices created
- using {!mk_bound}. The array [decl_names] contains the names that the quantified formula uses for the
- bound variables. Z3 applies the convention that the last element in the [decl_names] and [sorts] array
- refers to the variable with index 0, the second to last element of [decl_names] and [sorts] refers
- to the variable with index 1, etc.
- [mk_forall c w p t n b] creates a forall formula, where
- [w] is the weight, [p] is an array of patterns, [t] is an array
- with the sorts of the bound variables, [n] is an array with the
- 'names' of the bound variables, and [b] is the body of the
- quantifier. Quantifiers are associated with weights indicating
- the importance of using the quantifier during
- instantiation.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_decls number of variables to be bound.
- @param sorts the sorts of the bound variables.
- @param decl_names names of the bound variables
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_exists}
- def_API('mk_forall', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, PATTERN), _in(UINT), _in_array(4, SORT), _in_array(4, SYMBOL), _in(AST)))
-*)
-external mk_forall : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_forall_bytecode" "camlidl_z3_Z3_mk_forall"
-
-(**
- Summary: Create an exists formula. Similar to {!mk_forall}.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_quantifier}
- def_API('mk_exists', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, PATTERN), _in(UINT), _in_array(4, SORT), _in_array(4, SYMBOL), _in(AST)))
-*)
-external mk_exists : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_exists_bytecode" "camlidl_z3_Z3_mk_exists"
-
-(**
- Summary: Create a quantifier - universal or existential, with pattern hints.
- See the documentation for {!mk_forall} for an explanation of the parameters.
- @param c logical context.
- @param is_forall flag to indicate if this is a universal or existential quantifier.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_decls number of variables to be bound.
- @param sorts array of sorts of the bound variables.
- @param decl_names names of the bound variables.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_quantifier', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(UINT), _in_array(3, PATTERN), _in(UINT), _in_array(5, SORT), _in_array(5, SYMBOL), _in(AST)))
-*)
-external mk_quantifier : context -> bool -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_bytecode" "camlidl_z3_Z3_mk_quantifier"
-
-(**
- Summary: Create a quantifier - universal or existential, with pattern hints, no patterns, and attributes
- @param c logical context.
- @param is_forall flag to indicate if this is a universal or existential quantifier.
- @param quantifier_id identifier to identify quantifier
- @param skolem_id identifier to identify skolem constants introduced by quantifier.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_no_patterns number of no_patterns.
- @param no_patterns array containing subexpressions to be excluded from inferred patterns.
- @param num_decls number of variables to be bound.
- @param sorts array of sorts of the bound variables.
- @param decl_names names of the bound variables.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_quantifier_ex', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(5, PATTERN), _in(UINT), _in_array(7, AST), _in(UINT), _in_array(9, SORT), _in_array(9, SYMBOL), _in(AST)))
-*)
-external mk_quantifier_ex : context -> bool -> int -> symbol -> symbol -> pattern array -> ast array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_ex_bytecode" "camlidl_z3_Z3_mk_quantifier_ex"
-
-(**
- Summary: Create a universal quantifier using a list of constants that
- will form the set of bound variables.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using
- the quantifier during instantiation. By default, pass the weight 0.
- @param num_bound number of constants to be abstracted into bound variables.
- @param bound array of constants to be abstracted into bound variables.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_exists_const}
- def_API('mk_forall_const', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, APP), _in(UINT), _in_array(4, PATTERN), _in(AST)))
-*)
-external mk_forall_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_forall_const"
-
-(**
- Summary: Similar to {!mk_forall_const}.
- Summary: Create an existential quantifier using a list of constants that
- will form the set of bound variables.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using
- the quantifier during instantiation. By default, pass the weight 0.
- @param num_bound number of constants to be abstracted into bound variables.
- @param bound array of constants to be abstracted into bound variables.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_forall_const}
- def_API('mk_exists_const', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, APP), _in(UINT), _in_array(4, PATTERN), _in(AST)))
-*)
-external mk_exists_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_exists_const"
-
-(**
- Summary: Create a universal or existential
- quantifier using a list of constants that
- will form the set of bound variables.
- def_API('mk_quantifier_const', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(UINT), _in_array(3, APP), _in(UINT), _in_array(5, PATTERN), _in(AST)))
-*)
-external mk_quantifier_const : context -> bool -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_const_bytecode" "camlidl_z3_Z3_mk_quantifier_const"
-
-(**
- Summary: Create a universal or existential
- quantifier using a list of constants that
- will form the set of bound variables.
- def_API('mk_quantifier_const_ex', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(5, APP), _in(UINT), _in_array(7, PATTERN), _in(UINT), _in_array(9, AST), _in(AST)))
-*)
-external mk_quantifier_const_ex : context -> bool -> int -> symbol -> symbol -> app array -> pattern array -> ast array -> ast -> ast
- = "camlidl_z3_Z3_mk_quantifier_const_ex_bytecode" "camlidl_z3_Z3_mk_quantifier_const_ex"
-
-(**
- {2 {L Accessors}}
-*)
-(**
- {3 {L Symbols}}
-*)
-
-(**
- Summary: \[ [ symbol_refine c s ] \] is the refined view of [s].
-*)
-val symbol_refine: context -> symbol -> symbol_refined
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Return [INT_SYMBOL] if the symbol was constructed
- using {!mk_int_symbol}, and [STRING_SYMBOL] if the symbol
- was constructed using {!mk_string_symbol}.
- def_API('get_symbol_kind', UINT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_kind : context -> symbol -> symbol_kind
- = "camlidl_z3_Z3_get_symbol_kind"
-
-(**
- Summary: \[ [ get_symbol_int c s ] \]
- Return the symbol int value.
- - {b Precondition}: get_symbol_kind s == INT_SYMBOL
- - {b See also}: {!mk_int_symbol}
- def_API('get_symbol_int', INT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_int : context -> symbol -> int
- = "camlidl_z3_Z3_get_symbol_int"
-
-(**
- Summary: \[ [ get_symbol_string c s ] \]
- Return the symbol name.
- - {b Precondition}: get_symbol_string s == STRING_SYMBOL
- - {b See also}: {!mk_string_symbol}
- def_API('get_symbol_string', STRING, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_string : context -> symbol -> string
- = "camlidl_z3_Z3_get_symbol_string"
-
-(**
- {3 {L Sorts}}
-*)
-
-(**
- Summary: \[ [ sort_refine c s ] \] is the refined view of [s].
-*)
-val sort_refine: context -> sort -> sort_refined
-
-(**
- Summary: Return the sort name as a symbol.
- def_API('get_sort_name', SYMBOL, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_name : context -> sort -> symbol
- = "camlidl_z3_Z3_get_sort_name"
-
-(**
- Summary: Return a unique identifier for [s].
- - {b Remarks}: Implicitly used by [Pervasives.( = )] and [Pervasives.compare].
- def_API('get_sort_id', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_id : context -> sort -> int
- = "camlidl_z3_Z3_get_sort_id"
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Convert a [sort] into [ast].
- - {b Remarks}: [sort_to_ast c s] can be replaced by [(s :> ast)].
- def_API('sort_to_ast', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external sort_to_ast : context -> sort -> ast
- = "camlidl_z3_Z3_sort_to_ast"
-
-(**
- Summary: compare sorts.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_sort', BOOL, (_in(CONTEXT), _in(SORT), _in(SORT)))
-*)
-external is_eq_sort : context -> sort -> sort -> bool
- = "camlidl_z3_Z3_is_eq_sort"
-
-(**
- Summary: Return the sort kind (e.g., array, tuple, int, bool, etc).
- - {b See also}: {!sort_kind}
- def_API('get_sort_kind', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_kind : context -> sort -> sort_kind
- = "camlidl_z3_Z3_get_sort_kind"
-
-(**
- Summary: \[ [ get_bv_sort_size c t ] \]
- Return the size of the given bit-vector sort.
- - {b Precondition}: get_sort_kind c t == BV_SORT
- - {b See also}: {!mk_bv_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_bv_sort_size', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_bv_sort_size : context -> sort -> int
- = "camlidl_z3_Z3_get_bv_sort_size"
-
-(**
- Summary: Return the size of the sort in [r]. Return [None] if the call failed.
- That is, get_sort_kind(s) == FINITE_DOMAIN_SORT
- def_API('get_finite_domain_sort_size', BOOL, (_in(CONTEXT), _in(SORT), _out(UINT64)))
-*)
-external get_finite_domain_sort_size : context -> sort -> int64 option
- = "camlidl_z3_Z3_get_finite_domain_sort_size"
-
-(**
- Summary: \[ [ get_array_sort_domain c t ] \]
- Return the domain of the given array sort.
- - {b Precondition}: get_sort_kind c t == ARRAY_SORT
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_array_sort_domain', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_array_sort_domain : context -> sort -> sort
- = "camlidl_z3_Z3_get_array_sort_domain"
-
-(**
- Summary: \[ [ get_array_sort_range c t ] \]
- Return the range of the given array sort.
- - {b Precondition}: get_sort_kind c t == ARRAY_SORT
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_array_sort_range', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_array_sort_range : context -> sort -> sort
- = "camlidl_z3_Z3_get_array_sort_range"
-
-(**
- Summary: \[ [ get_tuple_sort_mk_decl c t ] \]
- Return the constructor declaration of the given tuple
- sort.
- - {b Precondition}: get_sort_kind c t == DATATYPE_SORT
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_mk_decl', FUNC_DECL, (_in(CONTEXT), _in(SORT)))
-*)
-external get_tuple_sort_mk_decl : context -> sort -> func_decl
- = "camlidl_z3_Z3_get_tuple_sort_mk_decl"
-
-(**
- Summary: \[ [ get_tuple_sort_num_fields c t ] \]
- Return the number of fields of the given tuple sort.
- - {b Precondition}: get_sort_kind c t == DATATYPE_SORT
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_num_fields', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_tuple_sort_num_fields : context -> sort -> int
- = "camlidl_z3_Z3_get_tuple_sort_num_fields"
-
-(**
- Summary: \[ [ get_tuple_sort_field_decl c t i ] \]
- Return the i-th field declaration (i.e., projection function declaration)
- of the given tuple sort.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: i < get_tuple_sort_num_fields c t
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_field_decl', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_tuple_sort_field_decl : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_tuple_sort_field_decl"
-
-(**
- Summary: Return number of constructors for datatype.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_num_constructors', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_datatype_sort_num_constructors : context -> sort -> int
- = "camlidl_z3_Z3_get_datatype_sort_num_constructors"
-
-(**
- Summary: Return idx'th constructor.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx < get_datatype_sort_num_constructors c t
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_constructor', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_datatype_sort_constructor : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_constructor"
-
-(**
- Summary: Return idx'th recognizer.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx < get_datatype_sort_num_constructors c t
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_recognizer', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_datatype_sort_recognizer : context -> sort -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_recognizer"
-
-(**
- Summary: Return idx_a'th accessor for the idx_c'th constructor.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx_c < get_datatype_sort_num_constructors c t
- - {b Precondition}: idx_a < get_domain_size c get_datatype_sort_constructor c idx_c
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- def_API('get_datatype_sort_constructor_accessor', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT), _in(UINT)))
-*)
-external get_datatype_sort_constructor_accessor : context -> sort -> int -> int -> func_decl
- = "camlidl_z3_Z3_get_datatype_sort_constructor_accessor"
-
-(**
- Summary: Return arity of relation.
- - {b Precondition}: get_sort_kind s == RELATION_SORT
- - {b See also}: {!get_relation_column}
- def_API('get_relation_arity', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_relation_arity : context -> sort -> int
- = "camlidl_z3_Z3_get_relation_arity"
-
-(**
- Summary: Return sort at i'th column of relation sort.
- - {b Precondition}: get_sort_kind c s == RELATION_SORT
- - {b Precondition}: col < get_relation_arity c s
- - {b See also}: {!get_relation_arity}
- def_API('get_relation_column', SORT, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_relation_column : context -> sort -> int -> sort
- = "camlidl_z3_Z3_get_relation_column"
-
-(**
- {3 {L Function Declarations}}
-*)
-(**
- Summary: Convert a [func_decl] into [ast].
- - {b Remarks}: [func_decl_to_ast c f] can be replaced by [(f :> ast)].
- def_API('func_decl_to_ast', AST, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external func_decl_to_ast : context -> func_decl -> ast
- = "camlidl_z3_Z3_func_decl_to_ast"
-
-(**
- Summary: compare terms.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_func_decl', BOOL, (_in(CONTEXT), _in(FUNC_DECL), _in(FUNC_DECL)))
-*)
-external is_eq_func_decl : context -> func_decl -> func_decl -> bool
- = "camlidl_z3_Z3_is_eq_func_decl"
-
-(**
- Summary: Return a unique identifier for [f].
- - {b Remarks}: Implicitly used by [Pervasives.( = )] and [Pervasives.compare].
- def_API('get_func_decl_id', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_func_decl_id : context -> func_decl -> int
- = "camlidl_z3_Z3_get_func_decl_id"
-
-(**
- Summary: Return the constant declaration name as a symbol.
- def_API('get_decl_name', SYMBOL, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_name : context -> func_decl -> symbol
- = "camlidl_z3_Z3_get_decl_name"
-
-(**
- Summary: Return declaration kind corresponding to declaration.
- def_API('get_decl_kind', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_kind : context -> func_decl -> decl_kind
- = "camlidl_z3_Z3_get_decl_kind"
-
-(**
- Summary: Return the number of parameters of the given declaration.
- - {b See also}: {!get_arity}
- def_API('get_domain_size', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_domain_size : context -> func_decl -> int
- = "camlidl_z3_Z3_get_domain_size"
-
-(**
- Summary: Alias for [get_domain_size].
- - {b See also}: {!get_domain_size}
- def_API('get_arity', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_arity : context -> func_decl -> int
- = "camlidl_z3_Z3_get_arity"
-
-(**
- Summary: \[ [ get_domain c d i ] \]
- Return the sort of the i-th parameter of the given function declaration.
- - {b Precondition}: i < get_domain_size d
- - {b See also}: {!get_domain_size}
- def_API('get_domain', SORT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_domain : context -> func_decl -> int -> sort
- = "camlidl_z3_Z3_get_domain"
-
-
-(**
- Summary: \[ [ get_domains c d ] \] is the array of parameters of [d].
- - {b See also}: {!get_domain_size}
- - {b See also}: {!get_domain}
-*)
-val get_domains: context -> func_decl -> sort array
-
-(**
- Summary: \[ [ get_range c d ] \]
- Return the range of the given declaration.
- If [d] is a constant (i.e., has zero arguments), then this
- function returns the sort of the constant.
- def_API('get_range', SORT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_range : context -> func_decl -> sort
- = "camlidl_z3_Z3_get_range"
-
-(**
- Summary: Return the number of parameters associated with a declaration.
- def_API('get_decl_num_parameters', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_num_parameters : context -> func_decl -> int
- = "camlidl_z3_Z3_get_decl_num_parameters"
-
-(**
- Summary: Return the parameter type associated with a declaration.
- @param c the context
- @param d the function declaration
- @param idx is the index of the named parameter it should be between 0 and the number of parameters.
- def_API('get_decl_parameter_kind', UINT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_parameter_kind : context -> func_decl -> int -> parameter_kind
- = "camlidl_z3_Z3_get_decl_parameter_kind"
-
-(**
- Summary: Return the integer value associated with an integer parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_INT
- def_API('get_decl_int_parameter', INT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_int_parameter : context -> func_decl -> int -> int
- = "camlidl_z3_Z3_get_decl_int_parameter"
-
-(**
- Summary: Return the double value associated with an double parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_DOUBLE
- def_API('get_decl_double_parameter', DOUBLE, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_double_parameter : context -> func_decl -> int -> float
- = "camlidl_z3_Z3_get_decl_double_parameter"
-
-(**
- Summary: Return the double value associated with an double parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_SYMBOL
- def_API('get_decl_symbol_parameter', SYMBOL, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_symbol_parameter : context -> func_decl -> int -> symbol
- = "camlidl_z3_Z3_get_decl_symbol_parameter"
-
-(**
- Summary: Return the sort value associated with a sort parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_SORT
- def_API('get_decl_sort_parameter', SORT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_sort_parameter : context -> func_decl -> int -> sort
- = "camlidl_z3_Z3_get_decl_sort_parameter"
-
-(**
- Summary: Return the expresson value associated with an expression parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_AST
- def_API('get_decl_ast_parameter', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_ast_parameter : context -> func_decl -> int -> ast
- = "camlidl_z3_Z3_get_decl_ast_parameter"
-
-(**
- Summary: Return the expresson value associated with an expression parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_FUNC_DECL
- def_API('get_decl_func_decl_parameter', FUNC_DECL, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_func_decl_parameter : context -> func_decl -> int -> func_decl
- = "camlidl_z3_Z3_get_decl_func_decl_parameter"
-
-(**
- Summary: Return the rational value, as a string, associated with a rational parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_RATIONAL
- def_API('get_decl_rational_parameter', STRING, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_rational_parameter : context -> func_decl -> int -> string
- = "camlidl_z3_Z3_get_decl_rational_parameter"
-
-(**
- {3 {L Applications}}
-*)
-(**
- Summary: Convert a [app] into [ast].
- - {b Remarks}: [app_to_ast c a] can be replaced by [(a :> ast)].
- def_API('app_to_ast', AST, (_in(CONTEXT), _in(APP)))
-*)
-external app_to_ast : context -> app -> ast
- = "camlidl_z3_Z3_app_to_ast"
-
-(**
- Summary: Return the declaration of a constant or function application.
- def_API('get_app_decl', FUNC_DECL, (_in(CONTEXT), _in(APP)))
-*)
-external get_app_decl : context -> app -> func_decl
- = "camlidl_z3_Z3_get_app_decl"
-
-(**
- Summary: \[ [ get_app_num_args c a ] \]
- Return the number of argument of an application. If [t]
- is an constant, then the number of arguments is 0.
- def_API('get_app_num_args', UINT, (_in(CONTEXT), _in(APP)))
-*)
-external get_app_num_args : context -> app -> int
- = "camlidl_z3_Z3_get_app_num_args"
-
-(**
- Summary: \[ [ get_app_arg c a i ] \]
- Return the i-th argument of the given application.
- - {b Precondition}: i < get_num_args c a
- def_API('get_app_arg', AST, (_in(CONTEXT), _in(APP), _in(UINT)))
-*)
-external get_app_arg : context -> app -> int -> ast
- = "camlidl_z3_Z3_get_app_arg"
-
-
-(**
- Summary: \[ [ get_app_args c a ] \] is the array of arguments of an application. If [t] is a constant, then the array is empty.
- - {b See also}: {!get_app_num_args}
- - {b See also}: {!get_app_arg}
-*)
-val get_app_args: context -> app -> ast array
-
-(**
- {3 {L Terms}}
-*)
-
-(**
- Summary: \[ [ binder_type ] \] is a universal or existential quantifier.
- - {b See also}: {!term_refined}
-*)
-type binder_type = Forall | Exists
-(**
- Summary: \[ [ term_refined ] \] is the refinement of a {!ast} .
- - {b See also}: {!term_refine}
-*)
-type term_refined =
- | Term_numeral of numeral_refined
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol * sort) array * ast
- | Term_var of int * sort
-
-
-(**
- Summary: \[ [ mk_term c tr ] \] constructs the term described by [tr].
- - {b Precondition}: [tr] is not of form
- - {b See also}: {!term_refine}
-*)
-(* val mk_term: context -> term_refined -> ast *)
-(**
- Summary: \[ [ term_refine c a ] \] is the refined view of [a].
-*)
-val term_refine : context -> ast -> term_refined
-
-(**
- Summary: compare terms.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_ast', BOOL, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external is_eq_ast : context -> ast -> ast -> bool
- = "camlidl_z3_Z3_is_eq_ast"
-
-(**
- Summary: Return a unique identifier for [t].
- - {b Remarks}: Implicitly used by [Pervasives.compare] for values of type [ast], [app], [sort], [func_decl], and [pattern].
- def_API('get_ast_id', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_id : context -> ast -> int
- = "camlidl_z3_Z3_get_ast_id"
-
-(**
- Summary: Return a hash code for the given AST.
- - {b Remarks}: Implicitly used by [Hashtbl.hash] for values of type [ast], [app], [sort], [func_decl], and [pattern].
- def_API('get_ast_hash', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_hash : context -> ast -> int
- = "camlidl_z3_Z3_get_ast_hash"
-
-(**
- Summary: Return the sort of an AST node.
- The AST node must be a constant, application, numeral, bound variable, or quantifier.
- def_API('get_sort', SORT, (_in(CONTEXT), _in(AST)))
-*)
-external get_sort : context -> ast -> sort
- = "camlidl_z3_Z3_get_sort"
-
-(**
- Summary: Return true if the given expression [t] is well sorted.
- def_API('is_well_sorted', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_well_sorted : context -> ast -> bool
- = "camlidl_z3_Z3_is_well_sorted"
-
-(**
- Summary: Return L_TRUE if [a] is true, L_FALSE if it is false, and L_UNDEF otherwise.
- def_API('get_bool_value', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_bool_value : context -> ast -> lbool
- = "camlidl_z3_Z3_get_bool_value"
-
-(**
- Summary: Return the kind of the given AST.
- def_API('get_ast_kind', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_kind : context -> ast -> ast_kind
- = "camlidl_z3_Z3_get_ast_kind"
-
-(**
- def_API('is_app', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_app : context -> ast -> bool
- = "camlidl_z3_Z3_is_app"
-
-(**
- def_API('is_numeral_ast', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_numeral_ast : context -> ast -> bool
- = "camlidl_z3_Z3_is_numeral_ast"
-
-(**
- Summary: Return true if the give AST is a real algebraic number.
- def_API('is_algebraic_number', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_algebraic_number : context -> ast -> bool
- = "camlidl_z3_Z3_is_algebraic_number"
-
-(**
- Summary: Convert an [ast] into an [APP_AST].
- - {b Precondition}: {v get_ast_kind c a == [APP_AST] v}
- def_API('to_app', APP, (_in(CONTEXT), _in(AST)))
-*)
-external to_app : context -> ast -> app
- = "camlidl_z3_Z3_to_app"
-
-(**
- Summary: Convert an AST into a FUNC_DECL_AST. This is just type casting.
- - {b Precondition}: {v get_ast_kind c a == FUNC_DECL_AST v}
- def_API('to_func_decl', FUNC_DECL, (_in(CONTEXT), _in(AST)))
-*)
-external to_func_decl : context -> ast -> func_decl
- = "camlidl_z3_Z3_to_func_decl"
-
-(**
- {4 {L Numerals}}
-*)
-
-(**
- Summary: \[ [ numeral_refine c a ] \] is the refined view of [a].
- - {b Precondition}: [get_ast_kind c a = NUMERAL_AST]
-*)
-val numeral_refine : context -> ast -> numeral_refined
-
-(**
- {5 {L Low-level API}}
-*)
-(**
- Summary: Return numeral value, as a string of a numeric constant term
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_numeral_string', STRING, (_in(CONTEXT), _in(AST)))
-*)
-external get_numeral_string : context -> ast -> string
- = "camlidl_z3_Z3_get_numeral_string"
-
-(**
- Summary: Return numeral as a string in decimal notation.
- The result has at most [precision] decimal places.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST || is_algebraic_number c a
- def_API('get_numeral_decimal_string', STRING, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_numeral_decimal_string : context -> ast -> int -> string
- = "camlidl_z3_Z3_get_numeral_decimal_string"
-
-(**
- Summary: Return the numerator (as a numeral AST) of a numeral AST of sort Real.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_numerator', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_numerator : context -> ast -> ast
- = "camlidl_z3_Z3_get_numerator"
-
-(**
- Summary: Return the denominator (as a numeral AST) of a numeral AST of sort Real.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_denominator', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_denominator : context -> ast -> ast
- = "camlidl_z3_Z3_get_denominator"
-
-(**
- Summary: Return numeral value, as a pair of 64 bit numbers if the representation fits.
- @param c logical context.
- @param a term.
- @param num numerator.
- @param den denominator.
- Return [TRUE] if the numeral value fits in 64 bit numerals, [FALSE] otherwise.
- - {b Precondition}: get_ast_kind a == NUMERAL_AST
- def_API('get_numeral_small', BOOL, (_in(CONTEXT), _in(AST), _out(INT64), _out(INT64)))
-*)
-external get_numeral_small : context -> ast -> bool * int64 * int64
- = "camlidl_z3_Z3_get_numeral_small"
-
-(**
- Summary: \[ [ get_numeral_int c v ] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit in a machine int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_int', BOOL, (_in(CONTEXT), _in(AST), _out(INT)))
-*)
-external get_numeral_int : context -> ast -> bool * int
- = "camlidl_z3_Z3_get_numeral_int"
-
-(**
- Summary: \[ [ get_numeral_int64 c v ] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit in a machine long long int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_int64', BOOL, (_in(CONTEXT), _in(AST), _out(INT64)))
-*)
-external get_numeral_int64 : context -> ast -> bool * int64
- = "camlidl_z3_Z3_get_numeral_int64"
-
-(**
- Summary: \[ [ get_numeral_rational_int64 c x y] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit as a rational number as machine long long int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_rational_int64', BOOL, (_in(CONTEXT), _in(AST), _out(INT64), _out(INT64)))
-*)
-external get_numeral_rational_int64 : context -> ast -> bool * int64 * int64
- = "camlidl_z3_Z3_get_numeral_rational_int64"
-
-(**
- Summary: Return a lower bound for the given real algebraic number.
- The interval isolating the number is smaller than 1/10^precision.
- The result is a numeral AST of sort Real.
- - {b Precondition}: is_algebraic_number c a
- def_API('get_algebraic_number_lower', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_algebraic_number_lower : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_algebraic_number_lower"
-
-(**
- Summary: Return a upper bound for the given real algebraic number.
- The interval isolating the number is smaller than 1/10^precision.
- The result is a numeral AST of sort Real.
- - {b Precondition}: is_algebraic_number c a
- def_API('get_algebraic_number_upper', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_algebraic_number_upper : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_algebraic_number_upper"
-
-(**
- {4 {L Patterns}}
-*)
-(**
- Summary: Convert a pattern into ast.
- - {b Remarks}: [pattern_to_ast c p] can be replaced by [(p :> ast)].
- def_API('pattern_to_ast', AST, (_in(CONTEXT), _in(PATTERN)))
-*)
-external pattern_to_ast : context -> pattern -> ast
- = "camlidl_z3_Z3_pattern_to_ast"
-
-
-(**
- Summary: \[ [ get_pattern_terms c p ] \] is the ast's in pattern.
- - {b See also}: {!get_pattern_num_terms}
- - {b See also}: {!get_pattern}
-*)
-val get_pattern_terms: context -> pattern -> ast array;;
-
-(**
- Summary: Return number of terms in pattern.
- def_API('get_pattern_num_terms', UINT, (_in(CONTEXT), _in(PATTERN)))
-*)
-external get_pattern_num_terms : context -> pattern -> int
- = "camlidl_z3_Z3_get_pattern_num_terms"
-
-(**
- Summary: Return i'th ast in pattern.
- def_API('get_pattern', AST, (_in(CONTEXT), _in(PATTERN), _in(UINT)))
-*)
-external get_pattern : context -> pattern -> int -> ast
- = "camlidl_z3_Z3_get_pattern"
-
-(**
- {4 {L Quantifiers}}
-*)
-(**
- Summary: Return index of de-Brujin bound variable.
- - {b Precondition}: get_ast_kind a == VAR_AST
- def_API('get_index_value', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_index_value : context -> ast -> int
- = "camlidl_z3_Z3_get_index_value"
-
-(**
- Summary: Determine if quantifier is universal.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('is_quantifier_forall', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_quantifier_forall : context -> ast -> bool
- = "camlidl_z3_Z3_is_quantifier_forall"
-
-(**
- Summary: Obtain weight of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_weight', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_weight : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_weight"
-
-(**
- Summary: Return number of patterns used in quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_patterns', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_patterns : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_patterns"
-
-(**
- Summary: Return i'th pattern.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_pattern_ast', PATTERN, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_pattern_ast : context -> ast -> int -> pattern
- = "camlidl_z3_Z3_get_quantifier_pattern_ast"
-
-(**
- Summary: Return number of no_patterns used in quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_no_patterns', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_no_patterns : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_no_patterns"
-
-(**
- Summary: Return i'th no_pattern.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_no_pattern_ast', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_no_pattern_ast : context -> ast -> int -> ast
- = "camlidl_z3_Z3_get_quantifier_no_pattern_ast"
-
-(**
- Summary: Return number of bound variables of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_bound', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_bound : context -> ast -> int
- = "camlidl_z3_Z3_get_quantifier_num_bound"
-
-(**
- Summary: Return symbol of the i'th bound variable.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_bound_name', SYMBOL, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_bound_name : context -> ast -> int -> symbol
- = "camlidl_z3_Z3_get_quantifier_bound_name"
-
-(**
- Summary: Return sort of the i'th bound variable.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_bound_sort', SORT, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_bound_sort : context -> ast -> int -> sort
- = "camlidl_z3_Z3_get_quantifier_bound_sort"
-
-(**
- Summary: Return body of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_body', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_body : context -> ast -> ast
- = "camlidl_z3_Z3_get_quantifier_body"
-
-(**
- {3 {L Simplification}}
-*)
-(**
- Summary: Interface to simplifier.
- Provides an interface to the AST simplifier used by Z3.
- def_API('simplify', AST, (_in(CONTEXT), _in(AST)))
-*)
-external simplify : context -> ast -> ast
- = "camlidl_z3_Z3_simplify"
-
-(**
- Summary: Interface to simplifier.
- Provides an interface to the AST simplifier used by Z3.
- This procedure is similar to {!simplify}, but the behavior of the simplifier
- can be configured using the given parameter set.
- def_API('simplify_ex', AST, (_in(CONTEXT), _in(AST), _in(PARAMS)))
-*)
-external simplify_ex : context -> ast -> params -> ast
- = "camlidl_z3_Z3_simplify_ex"
-
-(**
- Summary: Return a string describing all available parameters.
- def_API('simplify_get_help', STRING, (_in(CONTEXT),))
-*)
-external simplify_get_help : context -> string
- = "camlidl_z3_Z3_simplify_get_help"
-
-(**
- Summary: Return the parameter description set for the simplify procedure.
- def_API('simplify_get_param_descrs', PARAM_DESCRS, (_in(CONTEXT),))
-*)
-external simplify_get_param_descrs : context -> param_descrs
- = "camlidl_z3_Z3_simplify_get_param_descrs"
-
-(**
- {2 {L Modifiers}}
-*)
-(**
- Summary: Update the arguments of term [a] using the arguments [args].
- The number of arguments [num_args] should coincide
- with the number of arguments to [a].
- If [a] is a quantifier, then num_args has to be 1.
- def_API('update_term', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST)))
-*)
-external update_term : context -> ast -> ast array -> ast
- = "camlidl_z3_Z3_update_term"
-
-(**
- Summary: Substitute every occurrence of {e from[i] } in [a] with {e to[i] }, for [i] smaller than [num_exprs].
- The result is the new AST. The arrays [from] and [to] must have size [num_exprs].
- For every [i] smaller than [num_exprs], we must have that sort of {e from[i] } must be equal to sort of {e to[i] }.
- def_API('substitute', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST), _in_array(2, AST)))
-*)
-external substitute : context -> ast -> ast array -> ast array -> ast
- = "camlidl_z3_Z3_substitute"
-
-(**
- Summary: Substitute the free variables in [a] with the expressions in [to].
- For every [i] smaller than [num_exprs], the variable with de-Bruijn index [i] is replaced with term {e to[i] }.
- def_API('substitute_vars', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST)))
-*)
-external substitute_vars : context -> ast -> ast array -> ast
- = "camlidl_z3_Z3_substitute_vars"
-
-(**
- Summary: Translate/Copy the AST [a] from context [source] to context [target].
- AST [a] must have been created using context [source].
- - {b Precondition}: source != target
- def_API('translate', AST, (_in(CONTEXT), _in(AST), _in(CONTEXT)))
-*)
-external translate : context -> ast -> context -> ast
- = "camlidl_z3_Z3_translate"
-
-(**
- {2 {L Models}}
-*)
-
-(**
- A model assigns uninterpreted sorts to finite universes of distinct values, constants to values,
- and arrays and functions to finite maps from argument values to result values plus a default
- value for all other arguments.
-*)
-type model_refined = {
- sorts : (sort, ast_vector) Hashtbl.t;
- consts : (func_decl, ast) Hashtbl.t;
- arrays : (func_decl, (ast, ast) Hashtbl.t * ast) Hashtbl.t;
- funcs : (func_decl, (ast array, ast) Hashtbl.t * ast) Hashtbl.t;
-}
-
-
-(**
- Summary: [model_refine c m] is the refined model of [m].
-*)
-val model_refine : context -> model -> model_refined
-
-(**
- Summary: \[ [ model_eval c m t ] \]
- Evaluate the AST node [t] in the given model.
- Return [None] if the term was not successfully evaluated.
- If [model_completion] is TRUE, then Z3 will assign an interpretation for any constant or function that does
- not have an interpretation in [m]. These constants and functions were essentially don't cares.
- The evaluation may fail for the following reasons:
- - [t] contains a quantifier.
- - the model [m] is partial, that is, it doesn't have a complete interpretation for uninterpreted functions.
- That is, the option {e MODEL_PARTIAL=true } was used.
- - [t] is type incorrect.
- def_API('model_eval', BOOL, (_in(CONTEXT), _in(MODEL), _in(AST), _in(BOOL), _out(AST)))
-*)
-external model_eval : context -> model -> ast -> bool -> ast option
- = "camlidl_z3_Z3_model_eval"
-
-(**
- {4 {L Low-level API}}
-*)
-(**
- Summary: Return the interpretation (i.e., assignment) of constant [a] in the model [m].
- Return [None],
- if the model does not assign an interpretation for [a].
- That should be interpreted as: the value of [a] does not matter.
- - {b Precondition}: get_arity c a == 0
- def_API('model_get_const_interp', AST, (_in(CONTEXT), _in(MODEL), _in(FUNC_DECL)))
-*)
-external model_get_const_interp : context -> model -> func_decl -> ast option
- = "camlidl_z3_Z3_model_get_const_interp"
-
-(**
- Summary: Return the interpretation of the function [f] in the model [m].
- Return [None],
- if the model does not assign an interpretation for [f].
- That should be interpreted as: the [f] does not matter.
- - {b Precondition}: get_arity c f > 0
- def_API('model_get_func_interp', FUNC_INTERP, (_in(CONTEXT), _in(MODEL), _in(FUNC_DECL)))
-*)
-external model_get_func_interp : context -> model -> func_decl -> func_interp option
- = "camlidl_z3_Z3_model_get_func_interp"
-
-(**
- Summary: Return the number of constants assigned by the given model.
- - {b See also}: {!model_get_const_decl}
- def_API('model_get_num_consts', UINT, (_in(CONTEXT), _in(MODEL)))
-*)
-external model_get_num_consts : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_consts"
-
-(**
- Summary: \[ [ model_get_const_decl c m i ] \]
- Return the i-th constant in the given model.
- - {b Precondition}: i < model_get_num_consts c m
- - {b See also}: {!model_eval}
- def_API('model_get_const_decl', FUNC_DECL, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external model_get_const_decl : context -> model -> int -> func_decl
- = "camlidl_z3_Z3_model_get_const_decl"
-
-(**
- Summary: Return the number of function interpretations in the given model.
- A function interpretation is represented as a finite map and an 'else' value.
- Each entry in the finite map represents the value of a function given a set of arguments.
- def_API('model_get_num_funcs', UINT, (_in(CONTEXT), _in(MODEL)))
-*)
-external model_get_num_funcs : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_funcs"
-
-(**
- Summary: \[ [ model_get_func_decl c m i ] \]
- Return the declaration of the i-th function in the given model.
- - {b Precondition}: i < model_get_num_funcs c m
- - {b See also}: {!model_get_num_funcs}
- def_API('model_get_func_decl', FUNC_DECL, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external model_get_func_decl : context -> model -> int -> func_decl
- = "camlidl_z3_Z3_model_get_func_decl"
-
-(**
- Summary: Return the number of uninterpreted sorts that [m] assigs an interpretation to.
- Z3 also provides an intepretation for uninterpreted sorts used in a formua.
- The interpretation for a sort [s] is a finite set of distinct values. We say this finite set is
- the "universe" of [s].
- - {b See also}: {!model_get_sort}
- - {b See also}: {!model_get_sort_universe}
- def_API('model_get_num_sorts', UINT, (_in(CONTEXT), _in(MODEL)))
-*)
-external model_get_num_sorts : context -> model -> int
- = "camlidl_z3_Z3_model_get_num_sorts"
-
-(**
- Summary: Return a uninterpreted sort that [m] assigns an interpretation.
- - {b Precondition}: i < model_get_num_sorts c m
- - {b See also}: {!model_get_num_sorts}
- - {b See also}: {!model_get_sort_universe}
- def_API('model_get_sort', SORT, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external model_get_sort : context -> model -> int -> sort
- = "camlidl_z3_Z3_model_get_sort"
-
-(**
- Summary: Return the finite set of distinct values that represent the interpretation for sort [s].
- - {b See also}: {!model_get_num_sorts}
- - {b See also}: {!model_get_sort}
- def_API('model_get_sort_universe', AST_VECTOR, (_in(CONTEXT), _in(MODEL), _in(SORT)))
-*)
-external model_get_sort_universe : context -> model -> sort -> ast_vector
- = "camlidl_z3_Z3_model_get_sort_universe"
-
-(**
- Summary: The {e (_ as-array f) } AST node is a construct for assigning interpretations for arrays in Z3.
- It is the array such that forall indices [i] we have that {e (select (_ as-array f) i) } is equal to {e (f i) }.
- This procedure returns TRUE if the [a] is an [as-array] AST node.
- Z3 current solvers have minimal support for [as_array] nodes.
- - {b See also}: {!get_as_array_func_decl}
- def_API('is_as_array', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_as_array : context -> ast -> bool
- = "camlidl_z3_Z3_is_as_array"
-
-(**
- Summary: Return the function declaration [f] associated with a {e (_ as_array f) } node.
- - {b See also}: {!is_as_array}
- def_API('get_as_array_func_decl', FUNC_DECL, (_in(CONTEXT), _in(AST)))
-*)
-external get_as_array_func_decl : context -> ast -> func_decl
- = "camlidl_z3_Z3_get_as_array_func_decl"
-
-(**
- Summary: Return the number of entries in the given function interpretation.
- A function interpretation is represented as a finite map and an 'else' value.
- Each entry in the finite map represents the value of a function given a set of arguments.
- This procedure return the number of element in the finite map of [f].
- def_API('func_interp_get_num_entries', UINT, (_in(CONTEXT), _in(FUNC_INTERP)))
-*)
-external func_interp_get_num_entries : context -> func_interp -> int
- = "camlidl_z3_Z3_func_interp_get_num_entries"
-
-(**
- Summary: Return a "point" of the given function intepretation. It represents the
- value of [f] in a particular point.
- - {b Precondition}: i < func_interp_get_num_entries c f
- - {b See also}: {!func_interp_get_num_entries}
- def_API('func_interp_get_entry', FUNC_ENTRY, (_in(CONTEXT), _in(FUNC_INTERP), _in(UINT)))
-*)
-external func_interp_get_entry : context -> func_interp -> int -> func_entry
- = "camlidl_z3_Z3_func_interp_get_entry"
-
-(**
- Summary: Return the 'else' value of the given function interpretation.
- A function interpretation is represented as a finite map and an 'else' value.
- This procedure returns the 'else' value.
- def_API('func_interp_get_else', AST, (_in(CONTEXT), _in(FUNC_INTERP)))
-*)
-external func_interp_get_else : context -> func_interp -> ast
- = "camlidl_z3_Z3_func_interp_get_else"
-
-(**
- Summary: Return the arity (number of arguments) of the given function interpretation.
- def_API('func_interp_get_arity', UINT, (_in(CONTEXT), _in(FUNC_INTERP)))
-*)
-external func_interp_get_arity : context -> func_interp -> int
- = "camlidl_z3_Z3_func_interp_get_arity"
-
-(**
- Summary: Return the value of this point.
- A func_entry object represents an element in the finite map used to encode
- a function interpretation.
- - {b See also}: {!func_interp_get_entry}
- def_API('func_entry_get_value', AST, (_in(CONTEXT), _in(FUNC_ENTRY)))
-*)
-external func_entry_get_value : context -> func_entry -> ast
- = "camlidl_z3_Z3_func_entry_get_value"
-
-(**
- Summary: Return the number of arguments in a func_entry object.
- - {b See also}: {!func_interp_get_entry}
- def_API('func_entry_get_num_args', UINT, (_in(CONTEXT), _in(FUNC_ENTRY)))
-*)
-external func_entry_get_num_args : context -> func_entry -> int
- = "camlidl_z3_Z3_func_entry_get_num_args"
-
-(**
- Summary: Return an argument of a func_entry object.
- - {b Precondition}: i < func_entry_get_num_args c e
- - {b See also}: {!func_interp_get_entry}
- def_API('func_entry_get_arg', AST, (_in(CONTEXT), _in(FUNC_ENTRY), _in(UINT)))
-*)
-external func_entry_get_arg : context -> func_entry -> int -> ast
- = "camlidl_z3_Z3_func_entry_get_arg"
-
-(**
- {2 {L Interaction logging.}}
-*)
-(**
- Summary: Log interaction to a file.
- extra_API('open_log', INT, (_in(STRING),))
-*)
-external open_log : string -> bool
- = "camlidl_z3_Z3_open_log"
-
-(**
- Summary: Append user-defined string to interaction log.
- The interaction log is opened using open_log.
- It contains the formulas that are checked using Z3.
- You can use this command to append comments, for instance.
- extra_API('append_log', VOID, (_in(STRING),))
-*)
-external append_log : string -> unit
- = "camlidl_z3_Z3_append_log"
-
-(**
- Summary: Close interaction log.
- extra_API('close_log', VOID, ())
-*)
-external close_log : unit -> unit
- = "camlidl_z3_Z3_close_log"
-
-(**
- Summary: Enable/disable printing warning messages to the console.
- Warnings are printed after passing [true], warning messages are
- suppressed after calling this method with [false].
- def_API('toggle_warning_messages', VOID, (_in(BOOL),))
-*)
-external toggle_warning_messages : bool -> unit
- = "camlidl_z3_Z3_toggle_warning_messages"
-
-(**
- {2 {L String conversion}}
-*)
-(**
- Summary: Select mode for the format used for pretty-printing AST nodes.
- The default mode for pretty printing AST nodes is to produce
- SMT-LIB style output where common subexpressions are printed
- at each occurrence. The mode is called PRINT_SMTLIB_FULL.
- To print shared common subexpressions only once,
- use the PRINT_LOW_LEVEL mode.
- To print in way that conforms to SMT-LIB standards and uses let
- expressions to share common sub-expressions use PRINT_SMTLIB_COMPLIANT.
- - {b See also}: {!ast_to_string}
- - {b See also}: {!pattern_to_string}
- - {b See also}: {!func_decl_to_string}
- def_API('set_ast_print_mode', VOID, (_in(CONTEXT), _in(PRINT_MODE)))
-*)
-external set_ast_print_mode : context -> ast_print_mode -> unit
- = "camlidl_z3_Z3_set_ast_print_mode"
-
-(**
- Summary: Convert the given AST node into a string.
- - {b See also}: {!pattern_to_string}
- - {b See also}: {!sort_to_string}
- def_API('ast_to_string', STRING, (_in(CONTEXT), _in(AST)))
-*)
-external ast_to_string : context -> ast -> string
- = "camlidl_z3_Z3_ast_to_string"
-
-(**
- def_API('pattern_to_string', STRING, (_in(CONTEXT), _in(PATTERN)))
-*)
-external pattern_to_string : context -> pattern -> string
- = "camlidl_z3_Z3_pattern_to_string"
-
-(**
- def_API('sort_to_string', STRING, (_in(CONTEXT), _in(SORT)))
-*)
-external sort_to_string : context -> sort -> string
- = "camlidl_z3_Z3_sort_to_string"
-
-(**
- def_API('func_decl_to_string', STRING, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external func_decl_to_string : context -> func_decl -> string
- = "camlidl_z3_Z3_func_decl_to_string"
-
-(**
- Summary: Convert the given model into a string.
- def_API('model_to_string', STRING, (_in(CONTEXT), _in(MODEL)))
-*)
-external model_to_string : context -> model -> string
- = "camlidl_z3_Z3_model_to_string"
-
-(**
- Summary: Convert the given benchmark into SMT-LIB formatted string.
- @param c - context.
- @param name - name of benchmark. The argument is optional.
- @param logic - the benchmark logic.
- @param status - the status string (sat, unsat, or unknown)
- @param attributes - other attributes, such as source, difficulty or category.
- @param num_assumptions - number of assumptions.
- @param assumptions - auxiliary assumptions.
- @param formula - formula to be checked for consistency in conjunction with assumptions.
- def_API('benchmark_to_smtlib_string', STRING, (_in(CONTEXT), _in(STRING), _in(STRING), _in(STRING), _in(STRING), _in(UINT), _in_array(5, AST), _in(AST)))
-*)
-external benchmark_to_smtlib_string : context -> string -> string -> string -> string -> ast array -> ast -> string
- = "camlidl_z3_Z3_benchmark_to_smtlib_string_bytecode" "camlidl_z3_Z3_benchmark_to_smtlib_string"
-
-(**
- {2 {L Parser interface}}
-*)
-(**
- Summary: \[ [ parse_smtlib2_string c str ] \]
- Parse the given string using the SMT-LIB2 parser.
- It returns a formula comprising of the conjunction of assertions in the scope
- (up to push/pop) at the end of the string.
- def_API('parse_smtlib2_string', AST, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib2_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3_Z3_parse_smtlib2_string_bytecode" "camlidl_z3_Z3_parse_smtlib2_string"
-
-(**
- Summary: Similar to {!parse_smtlib2_string}, but reads the benchmark from a file.
- def_API('parse_smtlib2_file', AST, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib2_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3_Z3_parse_smtlib2_file_bytecode" "camlidl_z3_Z3_parse_smtlib2_file"
-
-
-(**
- Summary: \[ [ parse_smtlib_string_x c str sort_names sorts decl_names decls ] \]
- Parse the given string using the SMT-LIB parser.
- The symbol table of the parser can be initialized using the given sorts and declarations.
- The symbols in the arrays [sort_names] and [decl_names] don't need to match the names
- of the sorts and declarations in the arrays [sorts] and [decls]. This is an useful feature
- since we can use arbitrary names to reference sorts and declarations defined using the API.
- - {b See also}: {!parse_smtlib_file_x}
-*)
-val parse_smtlib_string_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-(**
- Summary: Similar to {!parse_smtlib_string_x}, but reads the benchmark from a file.
- - {b See also}: {!parse_smtlib_string_x}
-*)
-val parse_smtlib_file_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-(**
- Summary: \[ [ parse_smtlib_string_formula c ... ] \] calls [(parse_smtlib_string c ...)] and returns the single formula produced.
- - {b See also}: {!parse_smtlib_file_formula}
- - {b See also}: {!parse_smtlib_string_x}
-*)
-val parse_smtlib_string_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-(**
- Summary: \[ [ parse_smtlib_file_formula c ... ] \] calls [(parse_smtlib_file c ...)] and returns the single formula produced.
- - {b See also}: {!parse_smtlib_string_formula}
- - {b See also}: {!parse_smtlib_file_x}
-*)
-val parse_smtlib_file_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-
-(**
- {4 {L Low-level API}}
-*)
-(**
- Summary: \[ [ parse_smtlib_string c str sort_names sorts decl_names decls ] \]
- Parse the given string using the SMT-LIB parser.
- The symbol table of the parser can be initialized using the given sorts and declarations.
- The symbols in the arrays [sort_names] and [decl_names] don't need to match the names
- of the sorts and declarations in the arrays [sorts] and [decls]. This is an useful feature
- since we can use arbitrary names to reference sorts and declarations defined using the C API.
- The formulas, assumptions and declarations defined in [str] can be extracted using the functions:
- {!get_smtlib_num_formulas}, {!get_smtlib_formula}, {!get_smtlib_num_assumptions}, {!get_smtlib_assumption},
- {!get_smtlib_num_decls}, and {!get_smtlib_decl}.
- def_API('parse_smtlib_string', VOID, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3_Z3_parse_smtlib_string_bytecode" "camlidl_z3_Z3_parse_smtlib_string"
-
-(**
- Summary: Similar to {!parse_smtlib_string}, but reads the benchmark from a file.
- def_API('parse_smtlib_file', VOID, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3_Z3_parse_smtlib_file_bytecode" "camlidl_z3_Z3_parse_smtlib_file"
-
-(**
- Summary: Return the number of SMTLIB formulas parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_formulas', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_formulas : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_formulas"
-
-(**
- Summary: \[ [ get_smtlib_formula c i ] \]
- Return the i-th formula parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_formulas c
- def_API('get_smtlib_formula', AST, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_formula : context -> int -> ast
- = "camlidl_z3_Z3_get_smtlib_formula"
-
-(**
- Summary: Return the number of SMTLIB assumptions parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_assumptions', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_assumptions : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_assumptions"
-
-(**
- Summary: \[ [ get_smtlib_assumption c i ] \]
- Return the i-th assumption parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_assumptions c
- def_API('get_smtlib_assumption', AST, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_assumption : context -> int -> ast
- = "camlidl_z3_Z3_get_smtlib_assumption"
-
-(**
- Summary: Return the number of declarations parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_decls', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_decls : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_decls"
-
-(**
- Summary: \[ [ get_smtlib_decl c i ] \]
- Return the i-th declaration parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_decls c
- def_API('get_smtlib_decl', FUNC_DECL, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_decl : context -> int -> func_decl
- = "camlidl_z3_Z3_get_smtlib_decl"
-
-(**
- Summary: Return the number of sorts parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_sorts', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_sorts : context -> int
- = "camlidl_z3_Z3_get_smtlib_num_sorts"
-
-(**
- Summary: \[ [ get_smtlib_sort c i ] \]
- Return the i-th sort parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_sorts c
- def_API('get_smtlib_sort', SORT, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_sort : context -> int -> sort
- = "camlidl_z3_Z3_get_smtlib_sort"
-
-(*
-(**
- Summary: \[ [ get_smtlib_error c ] \]
- Retrieve that last error message information generated from parsing.
- def_API('get_smtlib_error', STRING, (_in(CONTEXT), ))
-*)
-external get_smtlib_error : context -> string
- = "camlidl_z3_Z3_get_smtlib_error"
-
-*)
-(**
- {2 {L Error Handling}}
-*)
-(**
- Summary: Set an error.
- def_API('set_error', VOID, (_in(CONTEXT), _in(ERROR_CODE)))
-*)
-external set_error : context -> error_code -> unit
- = "camlidl_z3_Z3_set_error"
-
-(*
-(**
- Summary: Return a string describing the given error code.
- def_API('get_error_msg_ex', STRING, (_in(CONTEXT), _in(ERROR_CODE)))
-*)
-external get_error_msg_ex : context -> error_code -> string
- = "camlidl_z3_Z3_get_error_msg_ex"
-
-*)
-
-(**
- Summary: Return a string describing the given error code.
-*)
-val get_error_msg: context -> error_code -> string
-
-(**
- {2 {L Miscellaneous}}
-*)
-(**
- Summary: Return Z3 version number information.
- def_API('get_version', VOID, (_out(UINT), _out(UINT), _out(UINT), _out(UINT)))
-*)
-external get_version : unit -> int * int * int * int
- = "camlidl_z3_Z3_get_version"
-
-(**
- Summary: Enable tracing messages tagged as [tag] when Z3 is compiled in debug mode.
- It is a NOOP otherwise
- def_API('enable_trace', VOID, (_in(STRING),))
-*)
-external enable_trace : string -> unit
- = "camlidl_z3_Z3_enable_trace"
-
-(**
- Summary: Disable tracing messages tagged as [tag] when Z3 is compiled in debug mode.
- It is a NOOP otherwise
- def_API('disable_trace', VOID, (_in(STRING),))
-*)
-external disable_trace : string -> unit
- = "camlidl_z3_Z3_disable_trace"
-
-(**
- {2 {L Fixedpoint facilities}}
-*)
-(**
- Summary: Create a new fixedpoint context.
- def_API('mk_fixedpoint', FIXEDPOINT, (_in(CONTEXT), ))
-*)
-external mk_fixedpoint : context -> fixedpoint
- = "camlidl_z3_Z3_mk_fixedpoint"
-
-(**
- Summary: Add a universal Horn clause as a named rule.
- The [horn_rule] should be of the form:
- {v
- horn_rule ::= (forall (bound-vars) horn_rule)
- | (=> atoms horn_rule)
- | atom
- v}
- def_API('fixedpoint_add_rule', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(AST), _in(SYMBOL)))
-*)
-external fixedpoint_add_rule : context -> fixedpoint -> ast -> symbol -> unit
- = "camlidl_z3_Z3_fixedpoint_add_rule"
-
-(**
- Summary: Add a Database fact.
- @param c - context
- @param d - fixed point context
- @param r - relation signature for the row.
- @param num_args - number of columns for the given row.
- @param args - array of the row elements.
- The number of arguments [num_args] should be equal to the number
- of sorts in the domain of [r]. Each sort in the domain should be an integral
- (bit-vector, Boolean or or finite domain sort).
- The call has the same effect as adding a rule where [r] is applied to the arguments.
- def_API('fixedpoint_add_fact', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(FUNC_DECL), _in(UINT), _in_array(3, UINT)))
-*)
-external fixedpoint_add_fact : context -> fixedpoint -> func_decl -> int array -> unit
- = "camlidl_z3_Z3_fixedpoint_add_fact"
-
-(**
- Summary: Assert a constraint to the fixedpoint context.
- The constraints are used as background axioms when the fixedpoint engine uses the PDR mode.
- They are ignored for standard Datalog mode.
- def_API('fixedpoint_assert', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(AST)))
-*)
-external fixedpoint_assert : context -> fixedpoint -> ast -> unit
- = "camlidl_z3_Z3_fixedpoint_assert"
-
-(**
- Summary: Pose a query against the asserted rules.
- {v
- query ::= (exists (bound-vars) query)
- | literals
- v}
- query returns
- - L_FALSE if the query is unsatisfiable.
- - L_TRUE if the query is satisfiable. Obtain the answer by calling {!fixedpoint_get_answer}.
- - L_UNDEF if the query was interrupted, timed out or otherwise failed.
- def_API('fixedpoint_query', INT, (_in(CONTEXT), _in(FIXEDPOINT), _in(AST)))
-*)
-external fixedpoint_query : context -> fixedpoint -> ast -> lbool
- = "camlidl_z3_Z3_fixedpoint_query"
-
-(**
- Summary: Pose multiple queries against the asserted rules.
- The queries are encoded as relations (function declarations).
- query returns
- - L_FALSE if the query is unsatisfiable.
- - L_TRUE if the query is satisfiable. Obtain the answer by calling {!fixedpoint_get_answer}.
- - L_UNDEF if the query was interrupted, timed out or otherwise failed.
- def_API('fixedpoint_query_relations', INT, (_in(CONTEXT), _in(FIXEDPOINT), _in(UINT), _in_array(2, FUNC_DECL)))
-*)
-external fixedpoint_query_relations : context -> fixedpoint -> func_decl array -> lbool
- = "camlidl_z3_Z3_fixedpoint_query_relations"
-
-(**
- Summary: Retrieve a formula that encodes satisfying answers to the query.
- When used in Datalog mode, the returned answer is a disjunction of conjuncts.
- Each conjunct encodes values of the bound variables of the query that are satisfied.
- In PDR mode, the returned answer is a single conjunction.
- The previous call to fixedpoint_query must have returned L_TRUE.
- def_API('fixedpoint_get_answer', AST, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_get_answer : context -> fixedpoint -> ast
- = "camlidl_z3_Z3_fixedpoint_get_answer"
-
-(**
- Summary: Retrieve a string that describes the last status returned by {!fixedpoint_query}.
- Use this method when {!fixedpoint_query} returns L_UNDEF.
- def_API('fixedpoint_get_reason_unknown', STRING, (_in(CONTEXT), _in(FIXEDPOINT) ))
-*)
-external fixedpoint_get_reason_unknown : context -> fixedpoint -> string
- = "camlidl_z3_Z3_fixedpoint_get_reason_unknown"
-
-(**
- Summary: Update a named rule.
- A rule with the same name must have been previously created.
- def_API('fixedpoint_update_rule', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(AST), _in(SYMBOL)))
-*)
-external fixedpoint_update_rule : context -> fixedpoint -> ast -> symbol -> unit
- = "camlidl_z3_Z3_fixedpoint_update_rule"
-
-(**
- Summary: Query the PDR engine for the maximal levels properties are known about predicate.
- This call retrieves the maximal number of relevant unfoldings
- of [pred] with respect to the current exploration state.
- Note: this functionality is PDR specific.
- def_API('fixedpoint_get_num_levels', UINT, (_in(CONTEXT), _in(FIXEDPOINT), _in(FUNC_DECL)))
-*)
-external fixedpoint_get_num_levels : context -> fixedpoint -> func_decl -> int
- = "camlidl_z3_Z3_fixedpoint_get_num_levels"
-
-(**
- Retrieve the current cover of [pred] up to [level] unfoldings.
- Return just the delta that is known at [level]. To
- obtain the full set of properties of [pred] one should query
- at [level+1] , [level+2] etc, and include [level=-1].
- Note: this functionality is PDR specific.
- def_API('fixedpoint_get_cover_delta', AST, (_in(CONTEXT), _in(FIXEDPOINT), _in(INT), _in(FUNC_DECL)))
-*)
-external fixedpoint_get_cover_delta : context -> fixedpoint -> int -> func_decl -> ast
- = "camlidl_z3_Z3_fixedpoint_get_cover_delta"
-
-(**
- Summary: Add property about the predicate [pred].
- Add a property of predicate [pred] at [level].
- It gets pushed forward when possible.
- Note: level = -1 is treated as the fixedpoint. So passing -1 for the [level]
- means that the property is true of the fixed-point unfolding with respect to [pred].
- Note: this functionality is PDR specific.
- def_API('fixedpoint_add_cover', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(INT), _in(FUNC_DECL), _in(AST)))
-*)
-external fixedpoint_add_cover : context -> fixedpoint -> int -> func_decl -> ast -> unit
- = "camlidl_z3_Z3_fixedpoint_add_cover"
-
-(**
- Summary: Retrieve statistics information from the last call to {!fixedpoint_query}.
- def_API('fixedpoint_get_statistics', STATS, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_get_statistics : context -> fixedpoint -> stats
- = "camlidl_z3_Z3_fixedpoint_get_statistics"
-
-(**
- Summary: Register relation as Fixedpoint defined.
- Fixedpoint defined relations have least-fixedpoint semantics.
- For example, the relation is empty if it does not occur
- in a head or a fact.
- def_API('fixedpoint_register_relation', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(FUNC_DECL)))
-*)
-external fixedpoint_register_relation : context -> fixedpoint -> func_decl -> unit
- = "camlidl_z3_Z3_fixedpoint_register_relation"
-
-(**
- Summary: Configure the predicate representation.
- It sets the predicate to use a set of domains given by the list of symbols.
- The domains given by the list of symbols must belong to a set
- of built-in domains.
- def_API('fixedpoint_set_predicate_representation', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(FUNC_DECL), _in(UINT), _in_array(3, SYMBOL)))
-*)
-external fixedpoint_set_predicate_representation : context -> fixedpoint -> func_decl -> symbol array -> unit
- = "camlidl_z3_Z3_fixedpoint_set_predicate_representation"
-
-(**
- Summary: Retrieve set of rules from fixedpoint context.
- def_API('fixedpoint_get_rules', AST_VECTOR, (_in(CONTEXT),_in(FIXEDPOINT)))
-*)
-external fixedpoint_get_rules : context -> fixedpoint -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_get_rules"
-
-(**
- Summary: Retrieve set of background assertions from fixedpoint context.
- def_API('fixedpoint_get_assertions', AST_VECTOR, (_in(CONTEXT),_in(FIXEDPOINT)))
-*)
-external fixedpoint_get_assertions : context -> fixedpoint -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_get_assertions"
-
-(**
- Summary: Set parameters on fixedpoint context.
- def_API('fixedpoint_set_params', VOID, (_in(CONTEXT), _in(FIXEDPOINT), _in(PARAMS)))
-*)
-external fixedpoint_set_params : context -> fixedpoint -> params -> unit
- = "camlidl_z3_Z3_fixedpoint_set_params"
-
-(**
- Summary: Return a string describing all fixedpoint available parameters.
- def_API('fixedpoint_get_help', STRING, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_get_help : context -> fixedpoint -> string
- = "camlidl_z3_Z3_fixedpoint_get_help"
-
-(**
- Summary: Return the parameter description set for the given fixedpoint object.
- def_API('fixedpoint_get_param_descrs', PARAM_DESCRS, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_get_param_descrs : context -> fixedpoint -> param_descrs
- = "camlidl_z3_Z3_fixedpoint_get_param_descrs"
-
-(**
- Summary: Print the current rules and background axioms as a string.
- @param c - context.
- @param f - fixedpoint context.
- @param num_queries - number of additional queries to print.
- @param queries - additional queries.
- def_API('fixedpoint_to_string', STRING, (_in(CONTEXT), _in(FIXEDPOINT), _in(UINT), _in_array(2, AST)))
-*)
-external fixedpoint_to_string : context -> fixedpoint -> ast array -> string
- = "camlidl_z3_Z3_fixedpoint_to_string"
-
-(**
- Summary: Parse an SMT-LIB2 string with fixedpoint rules.
- Add the rules to the current fixedpoint context.
- Return the set of queries in the file.
- @param c - context.
- @param f - fixedpoint context.
- @param s - string containing SMT2 specification.
- def_API('fixedpoint_from_string', AST_VECTOR, (_in(CONTEXT), _in(FIXEDPOINT), _in(STRING)))
-*)
-external fixedpoint_from_string : context -> fixedpoint -> string -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_from_string"
-
-(**
- Summary: Parse an SMT-LIB2 file with fixedpoint rules.
- Add the rules to the current fixedpoint context.
- Return the set of queries in the file.
- @param c - context.
- @param f - fixedpoint context.
- @param s - string containing SMT2 specification.
- def_API('fixedpoint_from_file', AST_VECTOR, (_in(CONTEXT), _in(FIXEDPOINT), _in(STRING)))
-*)
-external fixedpoint_from_file : context -> fixedpoint -> string -> ast_vector
- = "camlidl_z3_Z3_fixedpoint_from_file"
-
-(**
- Summary: Create a backtracking point.
- The fixedpoint solver contains a set of rules, added facts and assertions.
- The set of rules, facts and assertions are restored upon calling {!fixedpoint_pop}.
- - {b See also}: {!fixedpoint_pop}
- def_API('fixedpoint_push', VOID, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_push : context -> fixedpoint -> unit
- = "camlidl_z3_Z3_fixedpoint_push"
-
-(**
- Summary: Backtrack one backtracking point.
- - {b See also}: {!fixedpoint_push}
- - {b Precondition}: The number of calls to pop cannot exceed calls to push.
- def_API('fixedpoint_pop', VOID, (_in(CONTEXT), _in(FIXEDPOINT)))
-*)
-external fixedpoint_pop : context -> fixedpoint -> unit
- = "camlidl_z3_Z3_fixedpoint_pop"
-
-(**
- {2 {L AST vectors}}
-*)
-(**
- Summary: Return an empty AST vector.
- def_API('mk_ast_vector', AST_VECTOR, (_in(CONTEXT),))
-*)
-external mk_ast_vector : context -> ast_vector
- = "camlidl_z3_Z3_mk_ast_vector"
-
-(**
- Summary: Return the size of the given AST vector.
- def_API('ast_vector_size', UINT, (_in(CONTEXT), _in(AST_VECTOR)))
-*)
-external ast_vector_size : context -> ast_vector -> int
- = "camlidl_z3_Z3_ast_vector_size"
-
-(**
- Summary: Return the AST at position [i] in the AST vector [v].
- - {b Precondition}: i < ast_vector_size c v
- def_API('ast_vector_get', AST, (_in(CONTEXT), _in(AST_VECTOR), _in(UINT)))
-*)
-external ast_vector_get : context -> ast_vector -> int -> ast
- = "camlidl_z3_Z3_ast_vector_get"
-
-(**
- Summary: Update position [i] of the AST vector [v] with the AST [a].
- - {b Precondition}: i < ast_vector_size c v
- def_API('ast_vector_set', VOID, (_in(CONTEXT), _in(AST_VECTOR), _in(UINT), _in(AST)))
-*)
-external ast_vector_set : context -> ast_vector -> int -> ast -> unit
- = "camlidl_z3_Z3_ast_vector_set"
-
-(**
- Summary: Resize the AST vector [v].
- def_API('ast_vector_resize', VOID, (_in(CONTEXT), _in(AST_VECTOR), _in(UINT)))
-*)
-external ast_vector_resize : context -> ast_vector -> int -> unit
- = "camlidl_z3_Z3_ast_vector_resize"
-
-(**
- Summary: Add the AST [a] in the end of the AST vector [v]. The size of [v] is increased by one.
- def_API('ast_vector_push', VOID, (_in(CONTEXT), _in(AST_VECTOR), _in(AST)))
-*)
-external ast_vector_push : context -> ast_vector -> ast -> unit
- = "camlidl_z3_Z3_ast_vector_push"
-
-(**
- Summary: Translate the AST vector [v] from context [s] into an AST vector in context [t].
- def_API('ast_vector_translate', AST_VECTOR, (_in(CONTEXT), _in(AST_VECTOR), _in(CONTEXT)))
-*)
-external ast_vector_translate : context -> ast_vector -> context -> ast_vector
- = "camlidl_z3_Z3_ast_vector_translate"
-
-(**
- Summary: Convert AST vector into a string.
- def_API('ast_vector_to_string', STRING, (_in(CONTEXT), _in(AST_VECTOR)))
-*)
-external ast_vector_to_string : context -> ast_vector -> string
- = "camlidl_z3_Z3_ast_vector_to_string"
-
-(**
- {2 {L AST maps}}
-*)
-(**
- Summary: Return an empty mapping from AST to AST
- def_API('mk_ast_map', AST_MAP, (_in(CONTEXT),) )
-*)
-external mk_ast_map : context -> ast_map
- = "camlidl_z3_Z3_mk_ast_map"
-
-(**
- Summary: Return true if the map [m] contains the AST key [k].
- def_API('ast_map_contains', BOOL, (_in(CONTEXT), _in(AST_MAP), _in(AST)))
-*)
-external ast_map_contains : context -> ast_map -> ast -> bool
- = "camlidl_z3_Z3_ast_map_contains"
-
-(**
- Summary: Return the value associated with the key [k].
- The procedure invokes the error handler if [k] is not in the map.
- def_API('ast_map_find', AST, (_in(CONTEXT), _in(AST_MAP), _in(AST)))
-*)
-external ast_map_find : context -> ast_map -> ast -> ast
- = "camlidl_z3_Z3_ast_map_find"
-
-(**
- Summary: Store/Replace a new key, value pair in the given map.
- def_API('ast_map_insert', VOID, (_in(CONTEXT), _in(AST_MAP), _in(AST), _in(AST)))
-*)
-external ast_map_insert : context -> ast_map -> ast -> ast -> unit
- = "camlidl_z3_Z3_ast_map_insert"
-
-(**
- Summary: Erase a key from the map.
- def_API('ast_map_erase', VOID, (_in(CONTEXT), _in(AST_MAP), _in(AST)))
-*)
-external ast_map_erase : context -> ast_map -> ast -> unit
- = "camlidl_z3_Z3_ast_map_erase"
-
-(**
- Summary: Remove all keys from the given map.
- def_API('ast_map_reset', VOID, (_in(CONTEXT), _in(AST_MAP)))
-*)
-external ast_map_reset : context -> ast_map -> unit
- = "camlidl_z3_Z3_ast_map_reset"
-
-(**
- Summary: Return the size of the given map.
- def_API('ast_map_size', UINT, (_in(CONTEXT), _in(AST_MAP)))
-*)
-external ast_map_size : context -> ast_map -> int
- = "camlidl_z3_Z3_ast_map_size"
-
-(**
- Summary: Return the keys stored in the given map.
- def_API('ast_map_keys', AST_VECTOR, (_in(CONTEXT), _in(AST_MAP)))
-*)
-external ast_map_keys : context -> ast_map -> ast_vector
- = "camlidl_z3_Z3_ast_map_keys"
-
-(**
- Summary: Convert the given map into a string.
- def_API('ast_map_to_string', STRING, (_in(CONTEXT), _in(AST_MAP)))
-*)
-external ast_map_to_string : context -> ast_map -> string
- = "camlidl_z3_Z3_ast_map_to_string"
-
-(**
- {2 {L Goals}}
-*)
-(**
- Summary: Create a goal (aka problem). A goal is essentially a set
- of formulas, that can be solved and/or transformed using
- tactics and solvers.
- If models == true, then model generation is enabled for the new goal.
- If unsat_cores == true, then unsat core generation is enabled for the new goal.
- If proofs == true, then proof generation is enabled for the new goal. Remark, the
- Z3 context c must have been created with proof generation support.
- def_API('mk_goal', GOAL, (_in(CONTEXT), _in(BOOL), _in(BOOL), _in(BOOL)))
-*)
-external mk_goal : context -> bool -> bool -> bool -> goal
- = "camlidl_z3_Z3_mk_goal"
-
-(**
- Summary: Return the "precision" of the given goal. Goals can be transformed using over and under approximations.
- A under approximation is applied when the objective is to find a model for a given goal.
- An over approximation is applied when the objective is to find a proof for a given goal.
- def_API('goal_precision', UINT, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_precision : context -> goal -> goal_prec
- = "camlidl_z3_Z3_goal_precision"
-
-(**
- Summary: Add a new formula [a] to the given goal.
- def_API('goal_assert', VOID, (_in(CONTEXT), _in(GOAL), _in(AST)))
-*)
-external goal_assert : context -> goal -> ast -> unit
- = "camlidl_z3_Z3_goal_assert"
-
-(**
- Summary: Return true if the given goal contains the formula [false].
- def_API('goal_inconsistent', BOOL, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_inconsistent : context -> goal -> bool
- = "camlidl_z3_Z3_goal_inconsistent"
-
-(**
- Summary: Return the depth of the given goal. It tracks how many transformations were applied to it.
- def_API('goal_depth', UINT, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_depth : context -> goal -> int
- = "camlidl_z3_Z3_goal_depth"
-
-(**
- Summary: Erase all formulas from the given goal.
- def_API('goal_reset', VOID, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_reset : context -> goal -> unit
- = "camlidl_z3_Z3_goal_reset"
-
-(**
- Summary: Return the number of formulas in the given goal.
- def_API('goal_size', UINT, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_size : context -> goal -> int
- = "camlidl_z3_Z3_goal_size"
-
-(**
- Summary: Return a formula from the given goal.
- - {b Precondition}: idx < goal_size c g
- def_API('goal_formula', AST, (_in(CONTEXT), _in(GOAL), _in(UINT)))
-*)
-external goal_formula : context -> goal -> int -> ast
- = "camlidl_z3_Z3_goal_formula"
-
-(**
- Summary: Return the number of formulas, subformulas and terms in the given goal.
- def_API('goal_num_exprs', UINT, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_num_exprs : context -> goal -> int
- = "camlidl_z3_Z3_goal_num_exprs"
-
-(**
- Summary: Return true if the goal is empty, and it is precise or the product of a under approximation.
- def_API('goal_is_decided_sat', BOOL, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_is_decided_sat : context -> goal -> bool
- = "camlidl_z3_Z3_goal_is_decided_sat"
-
-(**
- Summary: Return true if the goal contains false, and it is precise or the product of an over approximation.
- def_API('goal_is_decided_unsat', BOOL, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_is_decided_unsat : context -> goal -> bool
- = "camlidl_z3_Z3_goal_is_decided_unsat"
-
-(**
- Summary: Copy a goal [g] from the context [source] to a the context [target].
- def_API('goal_translate', GOAL, (_in(CONTEXT), _in(GOAL), _in(CONTEXT)))
-*)
-external goal_translate : context -> goal -> context -> goal
- = "camlidl_z3_Z3_goal_translate"
-
-(**
- Summary: Convert a goal into a string.
- def_API('goal_to_string', STRING, (_in(CONTEXT), _in(GOAL)))
-*)
-external goal_to_string : context -> goal -> string
- = "camlidl_z3_Z3_goal_to_string"
-
-(**
- {2 {L Tactics and Probes}}
-*)
-(**
- Summary: Return a tactic associated with the given name.
- The complete list of tactics may be obtained using the procedures {!get_num_tactics} and {!get_tactic_name}.
- It may also be obtained using the command {e (help-tactics) } in the SMT 2.0 front-end.
- Tactics are the basic building block for creating custom solvers for specific problem domains.
- def_API('mk_tactic', TACTIC, (_in(CONTEXT), _in(STRING)))
-*)
-external mk_tactic : context -> string -> tactic
- = "camlidl_z3_Z3_mk_tactic"
-
-(**
- Summary: Return a probe associated with the given name.
- The complete list of probes may be obtained using the procedures {!get_num_probes} and {!get_probe_name}.
- It may also be obtained using the command {e (help-tactics) } in the SMT 2.0 front-end.
- Probes are used to inspect a goal (aka problem) and collect information that may be used to decide
- which solver and/or preprocessing step will be used.
- def_API('mk_probe', PROBE, (_in(CONTEXT), _in(STRING)))
-*)
-external mk_probe : context -> string -> probe
- = "camlidl_z3_Z3_mk_probe"
-
-(**
- Summary: Return a tactic that applies [t1] to a given goal and [t2]
- to every subgoal produced by t1.
- def_API('tactic_and_then', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(TACTIC)))
-*)
-external tactic_and_then : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_and_then"
-
-(**
- Summary: Return a tactic that first applies [t1] to a given goal,
- if it fails then returns the result of [t2] applied to the given goal.
- def_API('tactic_or_else', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(TACTIC)))
-*)
-external tactic_or_else : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_or_else"
-
-(**
- Summary: Return a tactic that applies the given tactics in parallel.
- def_API('tactic_par_or', TACTIC, (_in(CONTEXT), _in(UINT), _in_array(1, TACTIC)))
-*)
-external tactic_par_or : context -> tactic array -> tactic
- = "camlidl_z3_Z3_tactic_par_or"
-
-(**
- Summary: Return a tactic that applies [t1] to a given goal and then [t2]
- to every subgoal produced by t1. The subgoals are processed in parallel.
- def_API('tactic_par_and_then', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(TACTIC)))
-*)
-external tactic_par_and_then : context -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_par_and_then"
-
-(**
- Summary: Return a tactic that applies [t] to a given goal for [ms] milliseconds.
- If [t] does not terminate in [ms] milliseconds, then it fails.
- def_API('tactic_try_for', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(UINT)))
-*)
-external tactic_try_for : context -> tactic -> int -> tactic
- = "camlidl_z3_Z3_tactic_try_for"
-
-(**
- Summary: Return a tactic that applies [t] to a given goal is the probe [p] evaluates to true.
- If [p] evaluates to false, then the new tactic behaves like the skip tactic.
- def_API('tactic_when', TACTIC, (_in(CONTEXT), _in(PROBE), _in(TACTIC)))
-*)
-external tactic_when : context -> probe -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_when"
-
-(**
- Summary: Return a tactic that applies [t1] to a given goal if the probe [p] evaluates to true,
- and [t2] if [p] evaluates to false.
- def_API('tactic_cond', TACTIC, (_in(CONTEXT), _in(PROBE), _in(TACTIC), _in(TACTIC)))
-*)
-external tactic_cond : context -> probe -> tactic -> tactic -> tactic
- = "camlidl_z3_Z3_tactic_cond"
-
-(**
- Summary: Return a tactic that keeps applying [t] until the goal is not modified anymore or the maximum
- number of iterations [max] is reached.
- def_API('tactic_repeat', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(UINT)))
-*)
-external tactic_repeat : context -> tactic -> int -> tactic
- = "camlidl_z3_Z3_tactic_repeat"
-
-(**
- Summary: Return a tactic that just return the given goal.
- def_API('tactic_skip', TACTIC, (_in(CONTEXT),))
-*)
-external tactic_skip : context -> tactic
- = "camlidl_z3_Z3_tactic_skip"
-
-(**
- Summary: Return a tactic that always fails.
- def_API('tactic_fail', TACTIC, (_in(CONTEXT),))
-*)
-external tactic_fail : context -> tactic
- = "camlidl_z3_Z3_tactic_fail"
-
-(**
- Summary: Return a tactic that fails if the probe [p] evaluates to false.
- def_API('tactic_fail_if', TACTIC, (_in(CONTEXT), _in(PROBE)))
-*)
-external tactic_fail_if : context -> probe -> tactic
- = "camlidl_z3_Z3_tactic_fail_if"
-
-(**
- Summary: Return a tactic that fails if the goal is not trivially satisfiable (i.e., empty) or
- trivially unsatisfiable (i.e., contains false).
- def_API('tactic_fail_if_not_decided', TACTIC, (_in(CONTEXT),))
-*)
-external tactic_fail_if_not_decided : context -> tactic
- = "camlidl_z3_Z3_tactic_fail_if_not_decided"
-
-(**
- Summary: Return a tactic that applies [t] using the given set of parameters.
- def_API('tactic_using_params', TACTIC, (_in(CONTEXT), _in(TACTIC), _in(PARAMS)))
-*)
-external tactic_using_params : context -> tactic -> params -> tactic
- = "camlidl_z3_Z3_tactic_using_params"
-
-(**
- Summary: Return a probe that always evaluates to val.
- def_API('probe_const', PROBE, (_in(CONTEXT), _in(DOUBLE)))
-*)
-external probe_const : context -> float -> probe
- = "camlidl_z3_Z3_probe_const"
-
-(**
- Summary: Return a probe that evaluates to "true" when the value returned by [p1] is less than the value returned by [p2].
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_lt', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_lt : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_lt"
-
-(**
- Summary: Return a probe that evaluates to "true" when the value returned by [p1] is greater than the value returned by [p2].
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_gt', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_gt : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_gt"
-
-(**
- Summary: Return a probe that evaluates to "true" when the value returned by [p1] is less than or equal to the value returned by [p2].
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_le', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_le : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_le"
-
-(**
- Summary: Return a probe that evaluates to "true" when the value returned by [p1] is greater than or equal to the value returned by [p2].
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_ge', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_ge : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_ge"
-
-(**
- Summary: Return a probe that evaluates to "true" when the value returned by [p1] is equal to the value returned by [p2].
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_eq', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_eq : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_eq"
-
-(**
- Summary: Return a probe that evaluates to "true" when [p1] and [p2] evaluates to true.
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_and', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_and : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_and"
-
-(**
- Summary: Return a probe that evaluates to "true" when [p1] or [p2] evaluates to true.
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_or', PROBE, (_in(CONTEXT), _in(PROBE), _in(PROBE)))
-*)
-external probe_or : context -> probe -> probe -> probe
- = "camlidl_z3_Z3_probe_or"
-
-(**
- Summary: Return a probe that evaluates to "true" when [p] does not evaluate to true.
- - {b Remarks}: For probes, "true" is any value different from 0.0.
- def_API('probe_not', PROBE, (_in(CONTEXT), _in(PROBE)))
-*)
-external probe_not : context -> probe -> probe
- = "camlidl_z3_Z3_probe_not"
-
-(**
- Summary: Return the number of builtin tactics available in Z3.
- def_API('get_num_tactics', UINT, (_in(CONTEXT),))
-*)
-external get_num_tactics : context -> int
- = "camlidl_z3_Z3_get_num_tactics"
-
-(**
- Summary: Return the name of the idx tactic.
- - {b Precondition}: i < get_num_tactics c
- def_API('get_tactic_name', STRING, (_in(CONTEXT), _in(UINT)))
-*)
-external get_tactic_name : context -> int -> string
- = "camlidl_z3_Z3_get_tactic_name"
-
-(**
- Summary: Return the number of builtin probes available in Z3.
- def_API('get_num_probes', UINT, (_in(CONTEXT),))
-*)
-external get_num_probes : context -> int
- = "camlidl_z3_Z3_get_num_probes"
-
-(**
- Summary: Return the name of the i probe.
- - {b Precondition}: i < get_num_probes c
- def_API('get_probe_name', STRING, (_in(CONTEXT), _in(UINT)))
-*)
-external get_probe_name : context -> int -> string
- = "camlidl_z3_Z3_get_probe_name"
-
-(**
- Summary: Return a string containing a description of parameters accepted by the given tactic.
- def_API('tactic_get_help', STRING, (_in(CONTEXT), _in(TACTIC)))
-*)
-external tactic_get_help : context -> tactic -> string
- = "camlidl_z3_Z3_tactic_get_help"
-
-(**
- Summary: Return the parameter description set for the given tactic object.
- def_API('tactic_get_param_descrs', PARAM_DESCRS, (_in(CONTEXT), _in(TACTIC)))
-*)
-external tactic_get_param_descrs : context -> tactic -> param_descrs
- = "camlidl_z3_Z3_tactic_get_param_descrs"
-
-(**
- Summary: Return a string containing a description of the tactic with the given name.
- def_API('tactic_get_descr', STRING, (_in(CONTEXT), _in(STRING)))
-*)
-external tactic_get_descr : context -> string -> string
- = "camlidl_z3_Z3_tactic_get_descr"
-
-(**
- Summary: Return a string containing a description of the probe with the given name.
- def_API('probe_get_descr', STRING, (_in(CONTEXT), _in(STRING)))
-*)
-external probe_get_descr : context -> string -> string
- = "camlidl_z3_Z3_probe_get_descr"
-
-(**
- Summary: Execute the probe over the goal. The probe always produce a double value.
- "Boolean" probes return 0.0 for false, and a value different from 0.0 for true.
- def_API('probe_apply', DOUBLE, (_in(CONTEXT), _in(PROBE), _in(GOAL)))
-*)
-external probe_apply : context -> probe -> goal -> float
- = "camlidl_z3_Z3_probe_apply"
-
-(**
- Summary: Apply tactic [t] to the goal [g].
- def_API('tactic_apply', APPLY_RESULT, (_in(CONTEXT), _in(TACTIC), _in(GOAL)))
-*)
-external tactic_apply : context -> tactic -> goal -> apply_result
- = "camlidl_z3_Z3_tactic_apply"
-
-(**
- Summary: Apply tactic [t] to the goal [g] using the parameter set [p].
- def_API('tactic_apply_ex', APPLY_RESULT, (_in(CONTEXT), _in(TACTIC), _in(GOAL), _in(PARAMS)))
-*)
-external tactic_apply_ex : context -> tactic -> goal -> params -> apply_result
- = "camlidl_z3_Z3_tactic_apply_ex"
-
-(**
- Summary: Convert the [apply_result] object returned by {!tactic_apply} into a string.
- def_API('apply_result_to_string', STRING, (_in(CONTEXT), _in(APPLY_RESULT)))
-*)
-external apply_result_to_string : context -> apply_result -> string
- = "camlidl_z3_Z3_apply_result_to_string"
-
-(**
- Summary: Return the number of subgoals in the [apply_result] object returned by {!tactic_apply}.
- def_API('apply_result_get_num_subgoals', UINT, (_in(CONTEXT), _in(APPLY_RESULT)))
-*)
-external apply_result_get_num_subgoals : context -> apply_result -> int
- = "camlidl_z3_Z3_apply_result_get_num_subgoals"
-
-(**
- Summary: Return one of the subgoals in the [apply_result] object returned by {!tactic_apply}.
- - {b Precondition}: i < apply_result_get_num_subgoals c r
- def_API('apply_result_get_subgoal', GOAL, (_in(CONTEXT), _in(APPLY_RESULT), _in(UINT)))
-*)
-external apply_result_get_subgoal : context -> apply_result -> int -> goal
- = "camlidl_z3_Z3_apply_result_get_subgoal"
-
-(**
- Summary: Convert a model for the subgoal [apply_result_get_subgoal(c], r, i) into a model for the original goal [g].
- Where [g] is the goal used to create [r] using [tactic_apply(c], t, g).
- def_API('apply_result_convert_model', MODEL, (_in(CONTEXT), _in(APPLY_RESULT), _in(UINT), _in(MODEL)))
-*)
-external apply_result_convert_model : context -> apply_result -> int -> model -> model
- = "camlidl_z3_Z3_apply_result_convert_model"
-
-(**
- {2 {L Solvers}}
-*)
-(**
- Summary: Create a new (incremental) solver. This solver also uses a
- set of builtin tactics for handling the first check-sat command, and
- check-sat commands that take more than a given number of milliseconds to be solved.
- def_API('mk_solver', SOLVER, (_in(CONTEXT),))
-*)
-external mk_solver : context -> solver
- = "camlidl_z3_Z3_mk_solver"
-
-(**
- Summary: Create a new (incremental) solver.
- def_API('mk_simple_solver', SOLVER, (_in(CONTEXT),))
-*)
-external mk_simple_solver : context -> solver
- = "camlidl_z3_Z3_mk_simple_solver"
-
-(**
- Summary: Create a new solver customized for the given logic.
- It behaves like {!mk_solver} if the logic is unknown or unsupported.
- def_API('mk_solver_for_logic', SOLVER, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external mk_solver_for_logic : context -> symbol -> solver
- = "camlidl_z3_Z3_mk_solver_for_logic"
-
-(**
- Summary: Create a new solver that is implemented using the given tactic.
- The solver supports the commands {!solver_push} and {!solver_pop}, but it
- will always solve each {!solver_check} from scratch.
- def_API('mk_solver_from_tactic', SOLVER, (_in(CONTEXT), _in(TACTIC)))
-*)
-external mk_solver_from_tactic : context -> tactic -> solver
- = "camlidl_z3_Z3_mk_solver_from_tactic"
-
-(**
- Summary: Return a string describing all solver available parameters.
- def_API('solver_get_help', STRING, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_help : context -> solver -> string
- = "camlidl_z3_Z3_solver_get_help"
-
-(**
- Summary: Return the parameter description set for the given solver object.
- def_API('solver_get_param_descrs', PARAM_DESCRS, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_param_descrs : context -> solver -> param_descrs
- = "camlidl_z3_Z3_solver_get_param_descrs"
-
-(**
- Summary: Set the given solver using the given parameters.
- def_API('solver_set_params', VOID, (_in(CONTEXT), _in(SOLVER), _in(PARAMS)))
-*)
-external solver_set_params : context -> solver -> params -> unit
- = "camlidl_z3_Z3_solver_set_params"
-
-(**
- Summary: Create a backtracking point.
- The solver contains a stack of assertions.
- - {b See also}: {!solver_pop}
- def_API('solver_push', VOID, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_push : context -> solver -> unit
- = "camlidl_z3_Z3_solver_push"
-
-(**
- Summary: Backtrack [n] backtracking points.
- - {b See also}: {!solver_push}
- - {b Precondition}: n <= solver_get_num_scopes c s
- def_API('solver_pop', VOID, (_in(CONTEXT), _in(SOLVER), _in(UINT)))
-*)
-external solver_pop : context -> solver -> int -> unit
- = "camlidl_z3_Z3_solver_pop"
-
-(**
- Summary: Remove all assertions from the solver.
- def_API('solver_reset', VOID, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_reset : context -> solver -> unit
- = "camlidl_z3_Z3_solver_reset"
-
-(**
- Summary: Return the number of backtracking points.
- - {b See also}: {!solver_push}
- - {b See also}: {!solver_pop}
- def_API('solver_get_num_scopes', UINT, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_num_scopes : context -> solver -> int
- = "camlidl_z3_Z3_solver_get_num_scopes"
-
-(**
- Summary: Assert a constraint into the solver.
- The functions {!solver_check} and {!solver_check_assumptions} should be
- used to check whether the logical context is consistent or not.
- def_API('solver_assert', VOID, (_in(CONTEXT), _in(SOLVER), _in(AST)))
-*)
-external solver_assert : context -> solver -> ast -> unit
- = "camlidl_z3_Z3_solver_assert"
-
-(**
- Summary: Assert a constraint [a] into the solver, and track it (in the unsat) core using
- the Boolean constant [p].
- This API is an alternative to {!solver_check_assumptions} for extracting unsat cores.
- Both APIs can be used in the same solver. The unsat core will contain a combination
- of the Boolean variables provided using solver_assert_and_track and the Boolean literals
- provided using {!solver_check_assumptions}.
- - {b Precondition}: [a] must be a Boolean expression
- - {b Precondition}: [p] must be a Boolean constant aka variable.
- def_API('solver_assert_and_track', VOID, (_in(CONTEXT), _in(SOLVER), _in(AST), _in(AST)))
-*)
-external solver_assert_and_track : context -> solver -> ast -> ast -> unit
- = "camlidl_z3_Z3_solver_assert_and_track"
-
-(**
- Summary: Return the set of asserted formulas as a goal object.
- def_API('solver_get_assertions', AST_VECTOR, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_assertions : context -> solver -> ast_vector
- = "camlidl_z3_Z3_solver_get_assertions"
-
-(**
- Summary: Check whether the assertions in a given solver are consistent or not.
- The function {!solver_get_model} retrieves a model if the
- assertions are not unsatisfiable (i.e., the result is not \c
- L_FALSE) and model construction is enabled.
- The function {!solver_get_proof} retrieves a proof if proof
- generation was enabled when the context was created, and the
- assertions are unsatisfiable (i.e., the result is [L_FALSE)].
- def_API('solver_check', INT, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_check : context -> solver -> lbool
- = "camlidl_z3_Z3_solver_check"
-
-(**
- Summary: Check whether the assertions in the given solver and
- optional assumptions are consistent or not.
- The function {!solver_get_unsat_core} retrieves the subset of the
- assumptions used in the unsatisfiability proof produced by Z3.
- - {b See also}: {!solver_check}
- def_API('solver_check_assumptions', INT, (_in(CONTEXT), _in(SOLVER), _in(UINT), _in_array(2, AST)))
-*)
-external solver_check_assumptions : context -> solver -> ast array -> lbool
- = "camlidl_z3_Z3_solver_check_assumptions"
-
-(**
- Summary: Retrieve the model for the last {!solver_check} or {!solver_check_assumptions}
- The error handler is invoked if a model is not available because
- the commands above were not invoked for the given solver, or if the result was [L_FALSE].
- def_API('solver_get_model', MODEL, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_model : context -> solver -> model
- = "camlidl_z3_Z3_solver_get_model"
-
-(**
- Summary: Retrieve the proof for the last {!solver_check} or {!solver_check_assumptions}
- The error handler is invoked if proof generation is not enabled,
- or if the commands above were not invoked for the given solver,
- or if the result was different from [L_FALSE].
- def_API('solver_get_proof', AST, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_proof : context -> solver -> ast
- = "camlidl_z3_Z3_solver_get_proof"
-
-(**
- Summary: Retrieve the unsat core for the last {!solver_check_assumptions}
- The unsat core is a subset of the assumptions [a].
- def_API('solver_get_unsat_core', AST_VECTOR, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_unsat_core : context -> solver -> ast_vector
- = "camlidl_z3_Z3_solver_get_unsat_core"
-
-(**
- Summary: Return a brief justification for an "unknown" result (i.e., L_UNDEF) for
- the commands {!solver_check} and {!solver_check_assumptions}
- def_API('solver_get_reason_unknown', STRING, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_reason_unknown : context -> solver -> string
- = "camlidl_z3_Z3_solver_get_reason_unknown"
-
-(**
- Summary: Return statistics for the given solver.
- def_API('solver_get_statistics', STATS, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_get_statistics : context -> solver -> stats
- = "camlidl_z3_Z3_solver_get_statistics"
-
-(**
- Summary: Convert a solver into a string.
- def_API('solver_to_string', STRING, (_in(CONTEXT), _in(SOLVER)))
-*)
-external solver_to_string : context -> solver -> string
- = "camlidl_z3_Z3_solver_to_string"
-
-(**
- {2 {L Statistics}}
-*)
-
-type stat_datum = Stat_int of int | Stat_float of float
-type stats_refined = (string, stat_datum) Hashtbl.t
-
-
-(**
- Summary: [stats_refine c s] is the refined stats of [s].
-*)
-val stats_refine : context -> stats -> stats_refined
-
-(**
- Summary: Convert a statistics into a string.
- def_API('stats_to_string', STRING, (_in(CONTEXT), _in(STATS)))
-*)
-external stats_to_string : context -> stats -> string
- = "camlidl_z3_Z3_stats_to_string"
-
-(**
- {4 {L Low-level API}}
-*)
-(**
- Summary: Return the number of statistical data in [s].
- def_API('stats_size', UINT, (_in(CONTEXT), _in(STATS)))
-*)
-external stats_size : context -> stats -> int
- = "camlidl_z3_Z3_stats_size"
-
-(**
- Summary: Return the key (a string) for a particular statistical data.
- - {b Precondition}: idx < stats_size c s
- def_API('stats_get_key', STRING, (_in(CONTEXT), _in(STATS), _in(UINT)))
-*)
-external stats_get_key : context -> stats -> int -> string
- = "camlidl_z3_Z3_stats_get_key"
-
-(**
- Summary: Return TRUE if the given statistical data is a unsigned int integer.
- - {b Precondition}: idx < stats_size c s
- def_API('stats_is_uint', BOOL, (_in(CONTEXT), _in(STATS), _in(UINT)))
-*)
-external stats_is_uint : context -> stats -> int -> bool
- = "camlidl_z3_Z3_stats_is_uint"
-
-(**
- Summary: Return TRUE if the given statistical data is a double.
- - {b Precondition}: idx < stats_size c s
- def_API('stats_is_double', BOOL, (_in(CONTEXT), _in(STATS), _in(UINT)))
-*)
-external stats_is_double : context -> stats -> int -> bool
- = "camlidl_z3_Z3_stats_is_double"
-
-(**
- Summary: Return the unsigned int value of the given statistical data.
- - {b Precondition}: idx < stats_size c s && stats_is_uint c s
- def_API('stats_get_uint_value', UINT, (_in(CONTEXT), _in(STATS), _in(UINT)))
-*)
-external stats_get_uint_value : context -> stats -> int -> int
- = "camlidl_z3_Z3_stats_get_uint_value"
-
-(**
- Summary: Return the double value of the given statistical data.
- - {b Precondition}: idx < stats_size c s && stats_is_double c s
- def_API('stats_get_double_value', DOUBLE, (_in(CONTEXT), _in(STATS), _in(UINT)))
-*)
-external stats_get_double_value : context -> stats -> int -> float
- = "camlidl_z3_Z3_stats_get_double_value"
-
-(**
- {2 {L Deprecated Constraints API}}
-*)
-(**
- Summary: Retrieve congruence class representatives for terms.
- The function can be used for relying on Z3 to identify equal terms under the current
- set of assumptions. The array of terms and array of class identifiers should have
- the same length. The class identifiers are numerals that are assigned to the same
- value for their corresponding terms if the current context forces the terms to be
- equal. You cannot deduce that terms corresponding to different numerals must be all different,
- (especially when using non-convex theories).
- All implied equalities are returned by this call.
- This means that two terms map to the same class identifier if and only if
- the current context implies that they are equal.
- A side-effect of the function is a satisfiability check on the assertions on the solver that is passed in.
- The function return L_FALSE if the current assertions are not satisfiable.
- - {b See also}: {!check_and_get_model}
- - {b See also}: {!check}
- @deprecated To be moved outside of API.
- def_API('get_implied_equalities', UINT, (_in(CONTEXT), _in(SOLVER), _in(UINT), _in_array(2, AST), _out_array(2, UINT)))
-*)
-external get_implied_equalities : context -> solver -> ast array -> lbool * int array
- = "camlidl_z3_Z3_get_implied_equalities"
-
-
-(**
- {2 {L Legacy V3 API}}
-*)
-module V3 : sig
-(**
- {2 {L Legacy V3 API}}
-*)
-
-(* File generated from z3V3.idl *)
-
-type symbol
-and literals
-and theory
-and config
-and context
-and sort
-and func_decl
-and ast
-and app
-and pattern
-and model
-and constructor
-and constructor_list
-
-and lbool =
- | L_FALSE
- | L_UNDEF
- | L_TRUE
-
-and symbol_kind =
- | INT_SYMBOL
- | STRING_SYMBOL
-
-and parameter_kind =
- | PARAMETER_INT
- | PARAMETER_DOUBLE
- | PARAMETER_RATIONAL
- | PARAMETER_SYMBOL
- | PARAMETER_SORT
- | PARAMETER_AST
- | PARAMETER_FUNC_DECL
-
-and sort_kind =
- | UNINTERPRETED_SORT
- | BOOL_SORT
- | INT_SORT
- | REAL_SORT
- | BV_SORT
- | ARRAY_SORT
- | DATATYPE_SORT
- | RELATION_SORT
- | FINITE_DOMAIN_SORT
- | UNKNOWN_SORT
-
-and ast_kind =
- | NUMERAL_AST
- | APP_AST
- | VAR_AST
- | QUANTIFIER_AST
- | SORT_AST
- | FUNC_DECL_AST
- | UNKNOWN_AST
-
-and decl_kind =
- | OP_TRUE
- | OP_FALSE
- | OP_EQ
- | OP_DISTINCT
- | OP_ITE
- | OP_AND
- | OP_OR
- | OP_IFF
- | OP_XOR
- | OP_NOT
- | OP_IMPLIES
- | OP_OEQ
- | OP_ANUM
- | OP_AGNUM
- | OP_LE
- | OP_GE
- | OP_LT
- | OP_GT
- | OP_ADD
- | OP_SUB
- | OP_UMINUS
- | OP_MUL
- | OP_DIV
- | OP_IDIV
- | OP_REM
- | OP_MOD
- | OP_TO_REAL
- | OP_TO_INT
- | OP_IS_INT
- | OP_POWER
- | OP_STORE
- | OP_SELECT
- | OP_CONST_ARRAY
- | OP_ARRAY_MAP
- | OP_ARRAY_DEFAULT
- | OP_SET_UNION
- | OP_SET_INTERSECT
- | OP_SET_DIFFERENCE
- | OP_SET_COMPLEMENT
- | OP_SET_SUBSET
- | OP_AS_ARRAY
- | OP_BNUM
- | OP_BIT1
- | OP_BIT0
- | OP_BNEG
- | OP_BADD
- | OP_BSUB
- | OP_BMUL
- | OP_BSDIV
- | OP_BUDIV
- | OP_BSREM
- | OP_BUREM
- | OP_BSMOD
- | OP_BSDIV0
- | OP_BUDIV0
- | OP_BSREM0
- | OP_BUREM0
- | OP_BSMOD0
- | OP_ULEQ
- | OP_SLEQ
- | OP_UGEQ
- | OP_SGEQ
- | OP_ULT
- | OP_SLT
- | OP_UGT
- | OP_SGT
- | OP_BAND
- | OP_BOR
- | OP_BNOT
- | OP_BXOR
- | OP_BNAND
- | OP_BNOR
- | OP_BXNOR
- | OP_CONCAT
- | OP_SIGN_EXT
- | OP_ZERO_EXT
- | OP_EXTRACT
- | OP_REPEAT
- | OP_BREDOR
- | OP_BREDAND
- | OP_BCOMP
- | OP_BSHL
- | OP_BLSHR
- | OP_BASHR
- | OP_ROTATE_LEFT
- | OP_ROTATE_RIGHT
- | OP_EXT_ROTATE_LEFT
- | OP_EXT_ROTATE_RIGHT
- | OP_INT2BV
- | OP_BV2INT
- | OP_CARRY
- | OP_XOR3
- | OP_PR_UNDEF
- | OP_PR_TRUE
- | OP_PR_ASSERTED
- | OP_PR_GOAL
- | OP_PR_MODUS_PONENS
- | OP_PR_REFLEXIVITY
- | OP_PR_SYMMETRY
- | OP_PR_TRANSITIVITY
- | OP_PR_TRANSITIVITY_STAR
- | OP_PR_MONOTONICITY
- | OP_PR_QUANT_INTRO
- | OP_PR_DISTRIBUTIVITY
- | OP_PR_AND_ELIM
- | OP_PR_NOT_OR_ELIM
- | OP_PR_REWRITE
- | OP_PR_REWRITE_STAR
- | OP_PR_PULL_QUANT
- | OP_PR_PULL_QUANT_STAR
- | OP_PR_PUSH_QUANT
- | OP_PR_ELIM_UNUSED_VARS
- | OP_PR_DER
- | OP_PR_QUANT_INST
- | OP_PR_HYPOTHESIS
- | OP_PR_LEMMA
- | OP_PR_UNIT_RESOLUTION
- | OP_PR_IFF_TRUE
- | OP_PR_IFF_FALSE
- | OP_PR_COMMUTATIVITY
- | OP_PR_DEF_AXIOM
- | OP_PR_DEF_INTRO
- | OP_PR_APPLY_DEF
- | OP_PR_IFF_OEQ
- | OP_PR_NNF_POS
- | OP_PR_NNF_NEG
- | OP_PR_NNF_STAR
- | OP_PR_CNF_STAR
- | OP_PR_SKOLEMIZE
- | OP_PR_MODUS_PONENS_OEQ
- | OP_PR_TH_LEMMA
- | OP_PR_HYPER_RESOLVE
- | OP_RA_STORE
- | OP_RA_EMPTY
- | OP_RA_IS_EMPTY
- | OP_RA_JOIN
- | OP_RA_UNION
- | OP_RA_WIDEN
- | OP_RA_PROJECT
- | OP_RA_FILTER
- | OP_RA_NEGATION_FILTER
- | OP_RA_RENAME
- | OP_RA_COMPLEMENT
- | OP_RA_SELECT
- | OP_RA_CLONE
- | OP_FD_LT
- | OP_LABEL
- | OP_LABEL_LIT
- | OP_DT_CONSTRUCTOR
- | OP_DT_RECOGNISER
- | OP_DT_ACCESSOR
- | OP_UNINTERPRETED
-
-and param_kind =
- | PK_UINT
- | PK_BOOL
- | PK_DOUBLE
- | PK_SYMBOL
- | PK_STRING
- | PK_OTHER
- | PK_INVALID
-
-and search_failure =
- | NO_FAILURE
- | UNKNOWN
- | TIMEOUT
- | MEMOUT_WATERMARK
- | CANCELED
- | NUM_CONFLICTS
- | THEORY
- | QUANTIFIERS
-
-and ast_print_mode =
- | PRINT_SMTLIB_FULL
- | PRINT_LOW_LEVEL
- | PRINT_SMTLIB_COMPLIANT
- | PRINT_SMTLIB2_COMPLIANT
-
-
-(**
-*)
-(**
- {2 {L Types}}
- Most of the types in the API are abstract.
- - [context]: manager of all other Z3 objects, global configuration options, etc.
- - [symbol]: Lisp-like symbol used to name types, constants, and functions. A symbol can be created using string or integers.
- - [ast]: abstract syntax tree node. That is, the data-structure used in Z3 to represent terms, formulas and types.
- - [sort]: kind of AST used to represent types.
- - [func_decl]: kind of AST used to represent function symbols.
- - [app]: kind of AST used to represent function applications.
- - [pattern]: kind of AST used to represent pattern and multi-patterns used to guide quantifier instantiation.
- - [params]: parameter set used to configure many components such as: simplifiers, tactics, solvers, etc.
- - [model]: model for the constraints asserted into the logical context.
- - [func_interp]: interpretation of a function in a model.
- - [func_entry]: representation of the value of a [func_interp] at a particular point.
- - [fixedpoint]: context for the recursive predicate solver.
- - [ast_vector]: vector of [ast] objects.
- - [ast_map]: mapping from [ast] to [ast] objects.
- - [goal]: set of formulas that can be solved and/or transformed using tactics and solvers.
- - [tactic]: basic building block for creating custom solvers for specific problem domains.
- - [probe]: function/predicate used to inspect a goal and collect information that may be used to decide which solver and/or preprocessing step will be used.
- - [apply_result]: collection of subgoals resulting from applying of a tactic to a goal.
- - [solver]: (incremental) solver, possibly specialized by a particular tactic or logic.
- - [stats]: statistical data for a solver.
-*)
-(**
- {!lbool}
- Lifted Boolean type: [false], [undefined], [true].
-*)
-(**
- {!symbol_kind}
- The different kinds of symbol.
- In Z3, a symbol can be represented using integers and strings (See {!get_symbol_kind}).
- - {b See also}: {!mk_int_symbol}
- - {b See also}: {!mk_string_symbol}
-*)
-(**
- {!parameter_kind}
- The different kinds of parameters that can be associated with function symbols.
- - {b See also}: {!get_decl_num_parameters}
- - {b See also}: {!get_decl_parameter_kind}
- - PARAMETER_INT is used for integer parameters.
- - PARAMETER_DOUBLE is used for double parameters.
- - PARAMETER_RATIONAL is used for parameters that are rational numbers.
- - PARAMETER_SYMBOL is used for parameters that are symbols.
- - PARAMETER_SORT is used for sort parameters.
- - PARAMETER_AST is used for expression parameters.
- - PARAMETER_FUNC_DECL is used for function declaration parameters.
-*)
-(**
- {!sort_kind}
- The different kinds of Z3 types (See {!get_sort_kind}).
-*)
-(**
- {!ast_kind}
- The different kinds of Z3 AST (abstract syntax trees). That is, terms, formulas and types.
-
- - APP_AST: constant and applications
- - NUMERAL_AST: numeral constants
- - VAR_AST: bound variables
- - QUANTIFIER_AST: quantifiers
- - SORT_AST: sort
- - FUNC_DECL_AST: function declaration
- - UNKNOWN_AST: internal
-*)
-(**
- {!decl_kind}
- The different kinds of interpreted function kinds.
-
- - OP_TRUE The constant true.
-
- - OP_FALSE The constant false.
-
- - OP_EQ The equality predicate.
-
- - OP_DISTINCT The n-ary distinct predicate (every argument is mutually distinct).
-
- - OP_ITE The ternary if-then-else term.
-
- - OP_AND n-ary conjunction.
-
- - OP_OR n-ary disjunction.
-
- - OP_IFF equivalence (binary).
-
- - OP_XOR Exclusive or.
-
- - OP_NOT Negation.
-
- - OP_IMPLIES Implication.
-
- - OP_OEQ Binary equivalence modulo namings. This binary predicate is used in proof terms.
- It captures equisatisfiability and equivalence modulo renamings.
-
- - OP_ANUM Arithmetic numeral.
-
- - OP_AGNUM Arithmetic algebraic numeral. Algebraic numbers are used to represent irrational numbers in Z3.
-
- - OP_LE <=.
-
- - OP_GE >=.
-
- - OP_LT <.
-
- - OP_GT >.
-
- - OP_ADD Addition - Binary.
-
- - OP_SUB Binary subtraction.
-
- - OP_UMINUS Unary minus.
-
- - OP_MUL Multiplication - Binary.
-
- - OP_DIV Division - Binary.
-
- - OP_IDIV Integer division - Binary.
-
- - OP_REM Remainder - Binary.
-
- - OP_MOD Modulus - Binary.
-
- - OP_TO_REAL Coercion of integer to real - Unary.
-
- - OP_TO_INT Coercion of real to integer - Unary.
-
- - OP_IS_INT Check if real is also an integer - Unary.
-
- - OP_POWER Power operator x^y.
-
- - OP_STORE Array store. It satisfies select(store(a,i,v),j) = if i = j then v else select(a,j).
- Array store takes at least 3 arguments.
-
- - OP_SELECT Array select.
-
- - OP_CONST_ARRAY The constant array. For example, select(const(v),i) = v holds for every v and i. The function is unary.
-
- - OP_ARRAY_DEFAULT Default value of arrays. For example default(const(v)) = v. The function is unary.
-
- - OP_ARRAY_MAP Array map operator.
- It satisfies map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i.
-
- - OP_SET_UNION Set union between two Booelan arrays (two arrays whose range type is Boolean). The function is binary.
-
- - OP_SET_INTERSECT Set intersection between two Boolean arrays. The function is binary.
-
- - OP_SET_DIFFERENCE Set difference between two Boolean arrays. The function is binary.
-
- - OP_SET_COMPLEMENT Set complement of a Boolean array. The function is unary.
-
- - OP_SET_SUBSET Subset predicate between two Boolean arrays. The relation is binary.
-
- - OP_AS_ARRAY An array value that behaves as the function graph of the
- function passed as parameter.
-
- - OP_BNUM Bit-vector numeral.
-
- - OP_BIT1 One bit bit-vector.
-
- - OP_BIT0 Zero bit bit-vector.
-
- - OP_BNEG Unary minus.
-
- - OP_BADD Binary addition.
-
- - OP_BSUB Binary subtraction.
-
- - OP_BMUL Binary multiplication.
-
- - OP_BSDIV Binary signed division.
-
- - OP_BUDIV Binary unsigned int division.
-
- - OP_BSREM Binary signed remainder.
-
- - OP_BUREM Binary unsigned int remainder.
-
- - OP_BSMOD Binary signed modulus.
-
- - OP_BSDIV0 Unary function. bsdiv(x,0) is congruent to bsdiv0(x).
-
- - OP_BUDIV0 Unary function. budiv(x,0) is congruent to budiv0(x).
-
- - OP_BSREM0 Unary function. bsrem(x,0) is congruent to bsrem0(x).
-
- - OP_BUREM0 Unary function. burem(x,0) is congruent to burem0(x).
-
- - OP_BSMOD0 Unary function. bsmod(x,0) is congruent to bsmod0(x).
-
- - OP_ULEQ Unsigned bit-vector <= - Binary relation.
-
- - OP_SLEQ Signed bit-vector <= - Binary relation.
-
- - OP_UGEQ Unsigned bit-vector >= - Binary relation.
-
- - OP_SGEQ Signed bit-vector >= - Binary relation.
-
- - OP_ULT Unsigned bit-vector < - Binary relation.
-
- - OP_SLT Signed bit-vector < - Binary relation.
-
- - OP_UGT Unsigned bit-vector > - Binary relation.
-
- - OP_SGT Signed bit-vector > - Binary relation.
-
- - OP_BAND Bit-wise and - Binary.
-
- - OP_BOR Bit-wise or - Binary.
-
- - OP_BNOT Bit-wise not - Unary.
-
- - OP_BXOR Bit-wise xor - Binary.
-
- - OP_BNAND Bit-wise nand - Binary.
-
- - OP_BNOR Bit-wise nor - Binary.
-
- - OP_BXNOR Bit-wise xnor - Binary.
-
- - OP_CONCAT Bit-vector concatenation - Binary.
-
- - OP_SIGN_EXT Bit-vector sign extension.
-
- - OP_ZERO_EXT Bit-vector zero extension.
-
- - OP_EXTRACT Bit-vector extraction.
-
- - OP_REPEAT Repeat bit-vector n times.
-
- - OP_BREDOR Bit-vector reduce or - Unary.
-
- - OP_BREDAND Bit-vector reduce and - Unary.
-
- - OP_BCOMP .
-
- - OP_BSHL Shift left.
-
- - OP_BLSHR Logical shift right.
-
- - OP_BASHR Arithmetical shift right.
-
- - OP_ROTATE_LEFT Left rotation.
-
- - OP_ROTATE_RIGHT Right rotation.
-
- - OP_EXT_ROTATE_LEFT (extended) Left rotation. Similar to OP_ROTATE_LEFT, but it is a binary operator instead of a parametric one.
-
- - OP_EXT_ROTATE_RIGHT (extended) Right rotation. Similar to OP_ROTATE_RIGHT, but it is a binary operator instead of a parametric one.
-
- - OP_INT2BV Coerce integer to bit-vector. NB. This function
- is not supported by the decision procedures. Only the most
- rudimentary simplification rules are applied to this function.
-
- - OP_BV2INT Coerce bit-vector to integer. NB. This function
- is not supported by the decision procedures. Only the most
- rudimentary simplification rules are applied to this function.
-
- - OP_CARRY Compute the carry bit in a full-adder.
- The meaning is given by the equivalence
- (carry l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3)))
-
- - OP_XOR3 Compute ternary XOR.
- The meaning is given by the equivalence
- (xor3 l1 l2 l3) <=> (xor (xor l1 l2) l3)
-
- - OP_PR_UNDEF: Undef/Null proof object.
-
- - OP_PR_TRUE: Proof for the expression 'true'.
-
- - OP_PR_ASSERTED: Proof for a fact asserted by the user.
-
- - OP_PR_GOAL: Proof for a fact (tagged as goal) asserted by the user.
-
- - OP_PR_MODUS_PONENS: Given a proof for p and a proof for (implies p q), produces a proof for q.
- {e
- T1: p
- T2: (implies p q)
- [mp T1 T2]: q
- }
- The second antecedents may also be a proof for (iff p q).
-
- - OP_PR_REFLEXIVITY: A proof for (R t t), where R is a reflexive relation. This proof object has no antecedents.
- The only reflexive relations that are used are
- equivalence modulo namings, equality and equivalence.
- That is, R is either '~', '=' or 'iff'.
-
- - OP_PR_SYMMETRY: Given an symmetric relation R and a proof for (R t s), produces a proof for (R s t).
- {e
- T1: (R t s)
- [symmetry T1]: (R s t)
- }
- T1 is the antecedent of this proof object.
-
- - OP_PR_TRANSITIVITY: Given a transitive relation R, and proofs for (R t s) and (R s u), produces a proof
- for (R t u).
- {e
- T1: (R t s)
- T2: (R s u)
- [trans T1 T2]: (R t u)
- }
-
- - OP_PR_TRANSITIVITY_STAR: Condensed transitivity proof. This proof object is only used if the parameter PROOF_MODE is 1.
- It combines several symmetry and transitivity proofs.
-
- Example:
- {e
- T1: (R a b)
- T2: (R c b)
- T3: (R c d)
- [trans* T1 T2 T3]: (R a d)
- }
- R must be a symmetric and transitive relation.
-
- Assuming that this proof object is a proof for (R s t), then
- a proof checker must check if it is possible to prove (R s t)
- using the antecedents, symmetry and transitivity. That is,
- if there is a path from s to t, if we view every
- antecedent (R a b) as an edge between a and b.
-
- - OP_PR_MONOTONICITY: Monotonicity proof object.
- {e
- T1: (R t_1 s_1)
- ...
- Tn: (R t_n s_n)
- [monotonicity T1 ... Tn]: (R (f t_1 ... t_n) (f s_1 ... s_n))
- }
- Remark: if t_i == s_i, then the antecedent Ti is suppressed.
- That is, reflexivity proofs are supressed to save space.
-
- - OP_PR_QUANT_INTRO: Given a proof for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)).
-
- T1: (~ p q)
- [quant-intro T1]: (~ (forall (x) p) (forall (x) q))
-
- - OP_PR_DISTRIBUTIVITY: Distributivity proof object.
- Given that f (= or) distributes over g (= and), produces a proof for
-
- (= (f a (g c d))
- (g (f a c) (f a d)))
-
- If f and g are associative, this proof also justifies the following equality:
-
- (= (f (g a b) (g c d))
- (g (f a c) (f a d) (f b c) (f b d)))
-
- where each f and g can have arbitrary number of arguments.
-
- This proof object has no antecedents.
- Remark. This rule is used by the CNF conversion pass and
- instantiated by f = or, and g = and.
-
- - OP_PR_AND_ELIM: Given a proof for (and l_1 ... l_n), produces a proof for l_i
-
- {e
- T1: (and l_1 ... l_n)
- [and-elim T1]: l_i
- }
- - OP_PR_NOT_OR_ELIM: Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i).
-
- {e
- T1: (not (or l_1 ... l_n))
- [not-or-elim T1]: (not l_i)
- }
-
- - OP_PR_REWRITE: A proof for a local rewriting step (= t s).
- The head function symbol of t is interpreted.
-
- This proof object has no antecedents.
- The conclusion of a rewrite rule is either an equality (= t s),
- an equivalence (iff t s), or equi-satisfiability (~ t s).
- Remark: if f is bool, then = is iff.
-
-
- Examples:
- {e
- (= (+ x 0) x)
- (= (+ x 1 2) (+ 3 x))
- (iff (or x false) x)
- }
-
- - OP_PR_REWRITE_STAR: A proof for rewriting an expression t into an expression s.
- This proof object is used if the parameter PROOF_MODE is 1.
- This proof object can have n antecedents.
- The antecedents are proofs for equalities used as substitution rules.
- The object is also used in a few cases if the parameter PROOF_MODE is 2.
- The cases are:
- - When applying contextual simplification (CONTEXT_SIMPLIFIER=true)
- - When converting bit-vectors to Booleans (BIT2BOOL=true)
- - When pulling ite expression up (PULL_CHEAP_ITE_TREES=true)
-
- - OP_PR_PULL_QUANT: A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x) r))). This proof object has no antecedents.
-
- - OP_PR_PULL_QUANT_STAR: A proof for (iff P Q) where Q is in prenex normal form.
- This proof object is only used if the parameter PROOF_MODE is 1.
- This proof object has no antecedents.
-
- - OP_PR_PUSH_QUANT: A proof for:
-
- {e
- (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m] ... p_n[x_1 ... x_m]))
- (and (forall (x_1 ... x_m) p_1[x_1 ... x_m])
- ...
- (forall (x_1 ... x_m) p_n[x_1 ... x_m])))
- }
- This proof object has no antecedents.
-
- - OP_PR_ELIM_UNUSED_VARS:
- A proof for (iff (forall (x_1 ... x_n y_1 ... y_m) p[x_1 ... x_n])
- (forall (x_1 ... x_n) p[x_1 ... x_n]))
-
- It is used to justify the elimination of unused variables.
- This proof object has no antecedents.
-
- - OP_PR_DER: A proof for destructive equality resolution:
- (iff (forall (x) (or (not (= x t)) P[x])) P[t])
- if x does not occur in t.
-
- This proof object has no antecedents.
-
- Several variables can be eliminated simultaneously.
-
- - OP_PR_QUANT_INST: A proof of (or (not (forall (x) (P x))) (P a))
-
- - OP_PR_HYPOTHESIS: Mark a hypothesis in a natural deduction style proof.
-
- - OP_PR_LEMMA:
-
- {e
- T1: false
- [lemma T1]: (or (not l_1) ... (not l_n))
- }
- This proof object has one antecedent: a hypothetical proof for false.
- It converts the proof in a proof for (or (not l_1) ... (not l_n)),
- when T1 contains the hypotheses: l_1, ..., l_n.
-
- - OP_PR_UNIT_RESOLUTION:
- {e
- T1: (or l_1 ... l_n l_1' ... l_m')
- T2: (not l_1)
- ...
- T(n+1): (not l_n)
- [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m')
- }
-
- - OP_PR_IFF_TRUE:
- {e
- T1: p
- [iff-true T1]: (iff p true)
- }
-
- - OP_PR_IFF_FALSE:
- {e
- T1: (not p)
- [iff-false T1]: (iff p false)
- }
-
- - OP_PR_COMMUTATIVITY:
-
- [comm]: (= (f a b) (f b a))
-
- f is a commutative operator.
-
- This proof object has no antecedents.
- Remark: if f is bool, then = is iff.
-
- - OP_PR_DEF_AXIOM: Proof object used to justify Tseitin's like axioms:
-
- {e
- (or (not (and p q)) p)
- (or (not (and p q)) q)
- (or (not (and p q r)) p)
- (or (not (and p q r)) q)
- (or (not (and p q r)) r)
- ...
- (or (and p q) (not p) (not q))
- (or (not (or p q)) p q)
- (or (or p q) (not p))
- (or (or p q) (not q))
- (or (not (iff p q)) (not p) q)
- (or (not (iff p q)) p (not q))
- (or (iff p q) (not p) (not q))
- (or (iff p q) p q)
- (or (not (ite a b c)) (not a) b)
- (or (not (ite a b c)) a c)
- (or (ite a b c) (not a) (not b))
- (or (ite a b c) a (not c))
- (or (not (not a)) (not a))
- (or (not a) a)
- }
- This proof object has no antecedents.
- Note: all axioms are propositional tautologies.
- Note also that 'and' and 'or' can take multiple arguments.
- You can recover the propositional tautologies by
- unfolding the Boolean connectives in the axioms a small
- bounded number of steps (=3).
-
- - OP_PR_DEF_INTRO: Introduces a name for a formula/term.
- Suppose e is an expression with free variables x, and def-intro
- introduces the name n(x). The possible cases are:
-
- When e is of Boolean type:
- [def-intro]: (and (or n (not e)) (or (not n) e))
-
- or:
- [def-intro]: (or (not n) e)
- when e only occurs positively.
-
- When e is of the form (ite cond th el):
- [def-intro]: (and (or (not cond) (= n th)) (or cond (= n el)))
-
- Otherwise:
- [def-intro]: (= n e)
-
- - OP_PR_APPLY_DEF:
- [apply-def T1]: F ~ n
- F is 'equivalent' to n, given that T1 is a proof that
- n is a name for F.
-
- - OP_PR_IFF_OEQ:
- T1: (iff p q)
- [iff~ T1]: (~ p q)
-
- - OP_PR_NNF_POS: Proof for a (positive) NNF step. Example:
- {e
- T1: (not s_1) ~ r_1
- T2: (not s_2) ~ r_2
- T3: s_1 ~ r_1'
- T4: s_2 ~ r_2'
- [nnf-pos T1 T2 T3 T4]: (~ (iff s_1 s_2)
- (and (or r_1 r_2') (or r_1' r_2)))
- }
- The negation normal form steps NNF_POS and NNF_NEG are used in the following cases:
- (a) When creating the NNF of a positive force quantifier.
- The quantifier is retained (unless the bound variables are eliminated).
- Example
- {e
- T1: q ~ q_new
- [nnf-pos T1]: (~ (forall (x T) q) (forall (x T) q_new))
- }
- (b) When recursively creating NNF over Boolean formulas, where the top-level
- connective is changed during NNF conversion. The relevant Boolean connectives
- for NNF_POS are 'implies', 'iff', 'xor', 'ite'.
- NNF_NEG furthermore handles the case where negation is pushed
- over Boolean connectives 'and' and 'or'.
-
-
- - OP_PR_NFF_NEG: Proof for a (negative) NNF step. Examples:
- {e
- T1: (not s_1) ~ r_1
- ...
- Tn: (not s_n) ~ r_n
- [nnf-neg T1 ... Tn]: (not (and s_1 ... s_n)) ~ (or r_1 ... r_n)
- and
- T1: (not s_1) ~ r_1
- ...
- Tn: (not s_n) ~ r_n
- [nnf-neg T1 ... Tn]: (not (or s_1 ... s_n)) ~ (and r_1 ... r_n)
- and
- T1: (not s_1) ~ r_1
- T2: (not s_2) ~ r_2
- T3: s_1 ~ r_1'
- T4: s_2 ~ r_2'
- [nnf-neg T1 T2 T3 T4]: (~ (not (iff s_1 s_2))
- (and (or r_1 r_2) (or r_1' r_2')))
- }
- - OP_PR_NNF_STAR: A proof for (~ P Q) where Q is in negation normal form.
-
- This proof object is only used if the parameter PROOF_MODE is 1.
-
- This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO.
-
- - OP_PR_CNF_STAR: A proof for (~ P Q) where Q is in conjunctive normal form.
- This proof object is only used if the parameter PROOF_MODE is 1.
- This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO.
-
- - OP_PR_SKOLEMIZE: Proof for:
-
- {e
- [sk]: (~ (not (forall x (p x y))) (not (p (sk y) y)))
- [sk]: (~ (exists x (p x y)) (p (sk y) y))
- }
-
- This proof object has no antecedents.
-
- - OP_PR_MODUS_PONENS_OEQ: Modus ponens style rule for equi-satisfiability.
- {e
- T1: p
- T2: (~ p q)
- [mp~ T1 T2]: q
- }
-
- - OP_PR_TH_LEMMA: Generic proof for theory lemmas.
-
- The theory lemma function comes with one or more parameters.
- The first parameter indicates the name of the theory.
- For the theory of arithmetic, additional parameters provide hints for
- checking the theory lemma.
- The hints for arithmetic are:
-
- - farkas - followed by rational coefficients. Multiply the coefficients to the
- inequalities in the lemma, add the (negated) inequalities and obtain a contradiction.
-
- - triangle-eq - Indicates a lemma related to the equivalence:
- {e
- (iff (= t1 t2) (and (<= t1 t2) (<= t2 t1)))
- }
-
- - gcd-test - Indicates an integer linear arithmetic lemma that uses a gcd test.
-
-
- - OP_PR_HYPER_RESOLVE: Hyper-resolution rule.
-
- The premises of the rules is a sequence of clauses.
- The first clause argument is the main clause of the rule.
- One literal from the second, third, .. clause is resolved
- with a literal from the first (main) clause.
-
- Premises of the rules are of the form
- {e
- (or l0 l1 l2 .. ln)
- }
- or
- {e
- (=> (and ln+1 ln+2 .. ln+m) l0)
- }
- or in the most general (ground) form:
- {e
- (=> (and ln+1 ln+2 .. ln+m) (or l0 l1 .. ln-1))
- }
- In other words we use the following (Prolog style) convention for Horn
- implications:
- The head of a Horn implication is position 0,
- the first conjunct in the body of an implication is position 1
- the second conjunct in the body of an implication is position 2
-
- For general implications where the head is a disjunction, the
- first n positions correspond to the n disjuncts in the head.
- The next m positions correspond to the m conjuncts in the body.
-
- The premises can be universally quantified so that the most
- general non-ground form is:
-
- {e
- (forall (vars) (=> (and ln+1 ln+2 .. ln+m) (or l0 l1 .. ln-1)))
- }
-
- The hyper-resolution rule takes a sequence of parameters.
- The parameters are substitutions of bound variables separated by pairs
- of literal positions from the main clause and side clause.
-
-
- - OP_RA_STORE: Insert a record into a relation.
- The function takes [n+1] arguments, where the first argument is the relation and the remaining [n] elements
- correspond to the [n] columns of the relation.
-
- - OP_RA_EMPTY: Creates the empty relation.
-
- - OP_RA_IS_EMPTY: Tests if the relation is empty.
-
- - OP_RA_JOIN: Create the relational join.
-
- - OP_RA_UNION: Create the union or convex hull of two relations.
- The function takes two arguments.
-
- - OP_RA_WIDEN: Widen two relations.
- The function takes two arguments.
-
- - OP_RA_PROJECT: Project the columns (provided as numbers in the parameters).
- The function takes one argument.
-
- - OP_RA_FILTER: Filter (restrict) a relation with respect to a predicate.
- The first argument is a relation.
- The second argument is a predicate with free de-Brujin indices
- corresponding to the columns of the relation.
- So the first column in the relation has index 0.
-
- - OP_RA_NEGATION_FILTER: Intersect the first relation with respect to negation
- of the second relation (the function takes two arguments).
- Logically, the specification can be described by a function
-
- target = filter_by_negation(pos, neg, columns)
-
- where columns are pairs c1, d1, .., cN, dN of columns from pos and neg, such that
- target are elements in x in pos, such that there is no y in neg that agrees with
- x on the columns c1, d1, .., cN, dN.
-
-
- - OP_RA_RENAME: rename columns in the relation.
- The function takes one argument.
- The parameters contain the renaming as a cycle.
-
- - OP_RA_COMPLEMENT: Complement the relation.
-
- - OP_RA_SELECT: Check if a record is an element of the relation.
- The function takes [n+1] arguments, where the first argument is a relation,
- and the remaining [n] arguments correspond to a record.
-
- - OP_RA_CLONE: Create a fresh copy (clone) of a relation.
- The function is logically the identity, but
- in the context of a register machine allows
- for [OP_RA_UNION]
- to perform destructive updates to the first argument.
-
-
- - OP_FD_LT: A less than predicate over the finite domain FINITE_DOMAIN_SORT.
-
- - OP_LABEL: A label (used by the Boogie Verification condition generator).
- The label has two parameters, a string and a Boolean polarity.
- It takes one argument, a formula.
-
- - OP_LABEL_LIT: A label literal (used by the Boogie Verification condition generator).
- A label literal has a set of string parameters. It takes no arguments.
-
- - OP_DT_CONSTRUCTOR: datatype constructor.
-
- - OP_DT_RECOGNISER: datatype recognizer.
-
- - OP_DT_ACCESSOR: datatype accessor.
-
- - OP_UNINTERPRETED: kind used for uninterpreted symbols.
-*)
-(**
- {!param_kind}
-
- The different kinds of parameters that can be associated with parameter sets.
- (see {!mk_params}).
-
- - PK_UINT integer parameters.
- - PK_BOOL boolean parameters.
- - PK_DOUBLE double parameters.
- - PK_SYMBOL symbol parameters.
- - PK_STRING string parameters.
- - PK_OTHER all internal parameter kinds which are not exposed in the API.
- - PK_INVALID invalid parameter.
-*)
-(**
- {!search_failure}
- The different kinds of search failure types.
-
- - NO_FAILURE: The last search was successful
- - UNKNOWN: Undocumented failure reason
- - TIMEOUT: Timeout
- - MEMOUT_WATERMAK: Search hit a memory high-watermak limit
- - CANCELED: External cancel flag was set
- - NUM_CONFLICTS: Maximum number of conflicts was reached
- - THEORY: Theory is incomplete
- - QUANTIFIERS: Logical context contains universal quantifiers
-*)
-(**
- {!ast_print_mode}
- Z3 pretty printing modes (See {!set_ast_print_mode}).
-
- - PRINT_SMTLIB_FULL: Print AST nodes in SMTLIB verbose format.
- - PRINT_LOW_LEVEL: Print AST nodes using a low-level format.
- - PRINT_SMTLIB_COMPLIANT: Print AST nodes in SMTLIB 1.x compliant format.
- - PRINT_SMTLIB2_COMPLIANT: Print AST nodes in SMTLIB 2.x compliant format.
-*)
-(**
- Definitions for update_api.py
- def_Type('CONFIG', 'config', 'Config')
- def_Type('CONTEXT', 'context', 'ContextObj')
- def_Type('AST', 'ast', 'Ast')
- def_Type('APP', 'app', 'Ast')
- def_Type('SORT', 'sort', 'Sort')
- def_Type('FUNC_DECL', 'func_decl', 'FuncDecl')
- def_Type('PATTERN', 'pattern', 'Pattern')
- def_Type('MODEL', 'model', 'Model')
- def_Type('LITERALS', 'literals', 'Literals')
- def_Type('CONSTRUCTOR', 'constructor', 'Constructor')
- def_Type('CONSTRUCTOR_LIST', 'constructor_list', 'ConstructorList')
- def_Type('THEORY', 'theory', 'ctypes.c_void_p')
- def_Type('THEORY_DATA', 'theory_data', 'ctypes.c_void_p')
- def_Type('SOLVER', 'solver', 'SolverObj')
- def_Type('GOAL', 'goal', 'GoalObj')
- def_Type('TACTIC', 'tactic', 'TacticObj')
- def_Type('PARAMS', 'params', 'Params')
- def_Type('PROBE', 'probe', 'ProbeObj')
- def_Type('STATS', 'stats', 'StatsObj')
- def_Type('AST_VECTOR', 'ast_vector', 'AstVectorObj')
- def_Type('AST_MAP', 'ast_map', 'AstMapObj')
- def_Type('APPLY_RESULT', 'apply_result', 'ApplyResultObj')
- def_Type('FUNC_INTERP', 'func_interp', 'FuncInterpObj')
- def_Type('FUNC_ENTRY', 'func_entry', 'FuncEntryObj')
- def_Type('FIXEDPOINT', 'fixedpoint', 'FixedpointObj')
- def_Type('PARAM_DESCRS', 'param_descrs', 'ParamDescrs')
-*)
-(**
- {2 {L Configuration}}
-*)
-(**
- Summary: Set a global (or module) parameter.
- This setting is shared by all Z3 contexts.
- When a Z3 module is initialized it will use the value of these parameters
- when params objects are not provided.
- The name of parameter can be composed of characters [a-z][A-Z], digits [0-9], '-' and '_'.
- The character '.' is a delimiter (more later).
- The parameter names are case-insensitive. The character '-' should be viewed as an "alias" for '_'.
- Thus, the following parameter names are considered equivalent: "pp.decimal-precision" and "PP.DECIMAL_PRECISION".
- This function can be used to set parameters for a specific Z3 module.
- This can be done by using ..
- For example:
- global_param_set('pp.decimal', 'true')
- will set the parameter "decimal" in the module "pp" to true.
- def_API('global_param_set', VOID, (_in(STRING), _in(STRING)))
-*)
-external global_param_set : string -> string -> unit
- = "camlidl_z3V3_Z3_global_param_set"
-
-(**
- Summary: Restore the value of all global (and module) parameters.
- This command will not affect already created objects (such as tactics and solvers).
- - {b See also}: {!global_param_set}
- def_API('global_param_reset_all', VOID, ())
-*)
-external global_param_reset_all : unit -> unit
- = "camlidl_z3V3_Z3_global_param_reset_all"
-
-(**
- Summary: Get a global (or module) parameter.
- Returns [None]
- if the parameter value does not exist.
- - {b See also}: {!global_param_set}
- The caller must invoke {!global_param_del_value} to delete the value returned at [param_value].
- - {b Remarks}: This function cannot be invoked simultaneously from different threads without synchronization.
- The result string stored in param_value is stored in shared location.
- def_API('global_param_get', BOOL, (_in(STRING), _out(STRING)))
-*)
-external global_param_get : string -> string option
- = "camlidl_z3V3_Z3_global_param_get"
-
-(**
- {2 {L Create configuration}}
-*)
-(**
- Summary: Create a configuration object for the Z3 context object.
- Configurations are created in order to assign parameters prior to creating
- contexts for Z3 interaction. For example, if the users wishes to use proof
- generation, then call:
- [set_param_value cfg "proof" "true"]
- - {b Remarks}: Consider using {!mk_context_x} instead of using
- explicit configuration objects. The function {!mk_context_x}
- receives an array of string pairs. This array represents the
- configuration options.
- - {b Remarks}: In previous versions of Z3, the [config] was used to store
- global and module configurations. Now, we should use [global_param_set].
- The following parameters can be set:
- - proof (Boolean) Enable proof generation
- - debug_ref_count (Boolean) Enable debug support for ast reference counting
- - trace (Boolean) Tracing support for VCC
- - trace_file_name (String) Trace out file for VCC traces
- - timeout (unsigned) default timeout (in milliseconds) used for solvers
- - well_sorted_check type checker
- - auto_config use heuristics to automatically select solver and configure it
- - model model generation for solvers, this parameter can be overwritten when creating a solver
- - model_validate validate models produced by solvers
- - unsat_core unsat-core generation for solvers, this parameter can be overwritten when creating a solver
- - {b See also}: {!set_param_value}
- - {b See also}: {!del_config}
- def_API('mk_config', CONFIG, ())
-*)
-external mk_config : unit -> config
- = "camlidl_z3V3_Z3_mk_config"
-
-(**
- Summary: Delete the given configuration object.
- - {b See also}: {!mk_config}
- def_API('del_config', VOID, (_in(CONFIG),))
-*)
-external del_config : config -> unit
- = "camlidl_z3V3_Z3_del_config"
-
-(**
- Summary: Set a configuration parameter.
- The following parameters can be set for
- - {b See also}: {!mk_config}
- def_API('set_param_value', VOID, (_in(CONFIG), _in(STRING), _in(STRING)))
-*)
-external set_param_value : config -> string -> string -> unit
- = "camlidl_z3V3_Z3_set_param_value"
-
-(**
- {2 {L Create context}}
-*)
-(**
- Summary: Create a context using the given configuration.
- After a context is created, the configuration cannot be changed,
- although some parameters can be changed using {!update_param_value}.
- All main interaction with Z3 happens in the context of a [context].
- def_API('mk_context', CONTEXT, (_in(CONFIG),))
-*)
-external mk_context : config -> context
- = "camlidl_z3V3_Z3_mk_context"
-
-(**
- Summary: Delete the given logical context.
- - {b See also}: {!mk_context}
- def_API('del_context', VOID, (_in(CONTEXT),))
-*)
-external del_context : context -> unit
- = "camlidl_z3V3_Z3_del_context"
-
-(**
- Summary: Set a value of a context parameter.
- - {b See also}: {!global_param_set}
- def_API('update_param_value', VOID, (_in(CONTEXT), _in(STRING), _in(STRING)))
-*)
-external update_param_value : context -> string -> string -> unit
- = "camlidl_z3V3_Z3_update_param_value"
-
-(**
- Summary: Return the value of a context parameter.
- - {b See also}: {!global_param_get}
- def_API('get_param_value', BOOL, (_in(CONTEXT), _in(STRING), _out(STRING)))
-*)
-external get_param_value : context -> string -> string option
- = "camlidl_z3V3_Z3_get_param_value"
-
-(**
- {2 {L Symbols}}
-*)
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a Z3 symbol using an integer.
- Symbols are used to name several term and type constructors.
- NB. Not all integers can be passed to this function.
- The legal range of unsigned int integers is 0 to 2^30-1.
- - {b See also}: {!mk_string_symbol}
- def_API('mk_int_symbol', SYMBOL, (_in(CONTEXT), _in(INT)))
-*)
-external mk_int_symbol : context -> int -> symbol
- = "camlidl_z3V3_Z3_mk_int_symbol"
-
-(**
- Summary: Create a Z3 symbol using a C string.
- Symbols are used to name several term and type constructors.
- - {b See also}: {!mk_int_symbol}
- def_API('mk_string_symbol', SYMBOL, (_in(CONTEXT), _in(STRING)))
-*)
-external mk_string_symbol : context -> string -> symbol
- = "camlidl_z3V3_Z3_mk_string_symbol"
-
-(**
- {2 {L Sorts}}
-*)
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a free (uninterpreted) type using the given name (symbol).
- Two free types are considered the same iff the have the same name.
- def_API('mk_uninterpreted_sort', SORT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external mk_uninterpreted_sort : context -> symbol -> sort
- = "camlidl_z3V3_Z3_mk_uninterpreted_sort"
-
-(**
- Summary: Create the Boolean type.
- This type is used to create propositional variables and predicates.
- def_API('mk_bool_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_bool_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_bool_sort"
-
-(**
- Summary: Create the integer type.
- This type is not the int type found in programming languages.
- A machine integer can be represented using bit-vectors. The function
- {!mk_bv_sort} creates a bit-vector type.
- - {b See also}: {!mk_bv_sort}
- def_API('mk_int_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_int_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_int_sort"
-
-(**
- Summary: Create the real type.
- This type is not a floating point number.
- Z3 does not have support for floating point numbers yet.
- def_API('mk_real_sort', SORT, (_in(CONTEXT), ))
-*)
-external mk_real_sort : context -> sort
- = "camlidl_z3V3_Z3_mk_real_sort"
-
-(**
- Summary: Create a bit-vector type of the given size.
- This type can also be seen as a machine integer.
- - {b Remarks}: The size of the bitvector type must be greater than zero.
- def_API('mk_bv_sort', SORT, (_in(CONTEXT), _in(UINT)))
-*)
-external mk_bv_sort : context -> int -> sort
- = "camlidl_z3V3_Z3_mk_bv_sort"
-
-(**
- Summary: Create a named finite domain sort.
- To create constants that belong to the finite domain,
- use the APIs for creating numerals and pass a numeric
- constant together with the sort returned by this call.
- - {b See also}: {!get_finite_domain_sort_size}
- def_API('mk_finite_domain_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT64)))
-*)
-external mk_finite_domain_sort : context -> symbol -> int64 -> sort
- = "camlidl_z3V3_Z3_mk_finite_domain_sort"
-
-(**
- Summary: Create an array type.
- We usually represent the array type as: {e [domain -> range] }.
- Arrays are usually used to model the heap/memory in software verification.
- - {b See also}: {!mk_select}
- - {b See also}: {!mk_store}
- def_API('mk_array_sort', SORT, (_in(CONTEXT), _in(SORT), _in(SORT)))
-*)
-external mk_array_sort : context -> sort -> sort -> sort
- = "camlidl_z3V3_Z3_mk_array_sort"
-
-(**
- Summary: Create a tuple type.
- [mk_tuple_sort c name field_names field_sorts] creates a tuple with a constructor named [name],
- a [n] fields, where [n] is the size of the arrays [field_names] and [field_sorts].
- @param c logical context
- @param mk_tuple_name name of the constructor function associated with the tuple type.
- @param num_fields number of fields in the tuple type.
- @param field_names name of the projection functions.
- @param field_sorts type of the tuple fields.
- @param mk_tuple_decl output parameter that will contain the constructor declaration.
- @param proj_decl output parameter that will contain the projection function declarations. This field must be a buffer of size [num_fields] allocated by the user.
- def_API('mk_tuple_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _out(FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external mk_tuple_sort : context -> symbol -> symbol array -> sort array -> sort * func_decl * func_decl array
- = "camlidl_z3V3_Z3_mk_tuple_sort"
-
-(**
- Summary: Create a enumeration sort.
- [mk_enumeration_sort c enums] creates an enumeration sort with enumeration names [enums],
- it also returns [n] predicates, where [n] is the number of [enums] corresponding
- to testing whether an element is one of the enumerants.
- @param c logical context
- @param name name of the enumeration sort.
- @param n number of elemenets in enumeration sort.
- @param enum_names names of the enumerated elements.
- @param enum_consts constants corresponding to the enumerated elements.
- @param enum_testers predicates testing if terms of the enumeration sort correspond to an enumeration.
- For example, if this function is called with three symbols A, B, C and the name S, then
- [s] is a sort whose name is S, and the function returns three terms corresponding to A, B, C in
- [enum_consts]. The array [enum_testers] has three predicates of type {e (s -> Bool) }.
- The first predicate (corresponding to A) is true when applied to A, and false otherwise.
- Similarly for the other predicates.
- def_API('mk_enumeration_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SYMBOL), _out_array(2, FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external mk_enumeration_sort : context -> symbol -> symbol array -> sort * func_decl array * func_decl array
- = "camlidl_z3V3_Z3_mk_enumeration_sort"
-
-(**
- Summary: Create a list sort
- [mk_list_sort c name elem_sort] creates a list sort of [name], over elements of sort [elem_sort].
- @param c logical context
- @param name name of the list sort.
- @param elem_sort sort of list elements.
- @param nil_decl declaration for the empty list.
- @param is_nil_decl test for the empty list.
- @param cons_decl declaration for a cons cell.
- @param is_cons_decl cons cell test.
- @param head_decl list head.
- @param tail_decl list tail.
- def_API('mk_list_sort', SORT, (_in(CONTEXT), _in(SYMBOL), _in(SORT), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL), _out(FUNC_DECL)))
-*)
-external mk_list_sort : context -> symbol -> sort -> sort * func_decl * func_decl * func_decl * func_decl * func_decl * func_decl
- = "camlidl_z3V3_Z3_mk_list_sort"
-
-(**
- Summary: Create a constructor.
- @param c logical context.
- @param name constructor name.
- @param recognizer name of recognizer function.
- @param num_fields number of fields in constructor.
- @param field_names names of the constructor fields.
- @param sorts field sorts, [None]
- if the field sort refers to a recursive sort.
- @param sort_refs reference to datatype sort that is an argument to the constructor; if the corresponding
- sort reference is [None],
- then the value in sort_refs should be an index referring to
- one of the recursive datatypes that is declared.
- def_API('mk_constructor', CONSTRUCTOR, (_in(CONTEXT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(3, SYMBOL), _in_array(3, SORT), _in_array(3, UINT)))
-*)
-external mk_constructor : context -> symbol -> symbol -> symbol array -> sort array -> int array -> constructor
- = "camlidl_z3V3_Z3_mk_constructor_bytecode" "camlidl_z3V3_Z3_mk_constructor"
-
-(**
- Summary: Reclaim memory allocated to constructor.
- @param c logical context.
- @param constr constructor.
- def_API('del_constructor', VOID, (_in(CONTEXT), _in(CONSTRUCTOR)))
-*)
-external del_constructor : context -> constructor -> unit
- = "camlidl_z3V3_Z3_del_constructor"
-
-(**
- Summary: Create datatype, such as lists, trees, records, enumerations or unions of records.
- The datatype may be recursive. Return the datatype sort.
- @param c logical context.
- @param name name of datatype.
- @param num_constructors number of constructors passed in.
- @param constructors array of constructor containers.
- def_API('mk_datatype', SORT, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _inout_array(2, CONSTRUCTOR)))
-*)
-external mk_datatype : context -> symbol -> constructor array -> sort * constructor array
- = "camlidl_z3V3_Z3_mk_datatype"
-
-(**
- Summary: Create list of constructors.
- @param c logical context.
- @param num_constructors number of constructors in list.
- @param constructors list of constructors.
- def_API('mk_constructor_list', CONSTRUCTOR_LIST, (_in(CONTEXT), _in(UINT), _in_array(1, CONSTRUCTOR)))
-*)
-external mk_constructor_list : context -> constructor array -> constructor_list
- = "camlidl_z3V3_Z3_mk_constructor_list"
-
-(**
- Summary: Reclaim memory allocated for constructor list.
- Each constructor inside the constructor list must be independently reclaimed using {!del_constructor}.
- @param c logical context.
- @param clist constructor list container.
- def_API('del_constructor_list', VOID, (_in(CONTEXT), _in(CONSTRUCTOR_LIST)))
-*)
-external del_constructor_list : context -> constructor_list -> unit
- = "camlidl_z3V3_Z3_del_constructor_list"
-
-(**
- Summary: Create mutually recursive datatypes.
- @param c logical context.
- @param num_sorts number of datatype sorts.
- @param sort_names names of datatype sorts.
- @param sorts array of datatype sorts.
- @param constructor_lists list of constructors, one list per sort.
- def_API('mk_datatypes', VOID, (_in(CONTEXT), _in(UINT), _in_array(1, SYMBOL), _out_array(1, SORT), _inout_array(1, CONSTRUCTOR_LIST)))
-*)
-external mk_datatypes : context -> symbol array -> constructor_list array -> sort array * constructor_list array
- = "camlidl_z3V3_Z3_mk_datatypes"
-
-(**
- Summary: Query constructor for declared functions.
- @param c logical context.
- @param constr constructor container. The container must have been passed in to a {!mk_datatype} call.
- @param num_fields number of accessor fields in the constructor.
- @param constructor constructor function declaration.
- @param tester constructor test function declaration.
- @param accessors array of accessor function declarations.
- def_API('query_constructor', VOID, (_in(CONTEXT), _in(CONSTRUCTOR), _in(UINT), _out(FUNC_DECL), _out(FUNC_DECL), _out_array(2, FUNC_DECL)))
-*)
-external query_constructor : context -> constructor -> int -> func_decl * func_decl * func_decl array
- = "camlidl_z3V3_Z3_query_constructor"
-
-(**
- {2 {L Constants and Applications}}
-*)
-(**
- Summary: Declare a constant or function.
- [mk_func_decl c n d r] creates a function with name [n], domain [d], and range [r].
- The arity of the function is the size of the array [d].
- @param c logical context.
- @param s name of the constant or function.
- @param domain_size number of arguments. It is 0 when declaring a constant.
- @param domain array containing the sort of each argument. The array must contain domain_size elements. It is 0 when declaring a constant.
- @param range sort of the constant or the return sort of the function.
- After declaring a constant or function, the function
- {!mk_app} can be used to create a constant or function
- application.
- - {b See also}: {!mk_app}
- def_API('mk_func_decl', FUNC_DECL, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SORT), _in(SORT)))
-*)
-external mk_func_decl : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_func_decl"
-
-(**
- Summary: Create a constant or function application.
- - {b See also}: {!mk_func_decl}
- def_API('mk_app', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT), _in_array(2, AST)))
-*)
-external mk_app : context -> func_decl -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_app"
-
-(**
- Summary: Declare and create a constant.
- [mk_const c s t] is a shorthand for [mk_app c (mk_func_decl c s [||] t) [||]]
- - {b See also}: {!mk_func_decl}
- - {b See also}: {!mk_app}
- def_API('mk_const', AST, (_in(CONTEXT), _in(SYMBOL), _in(SORT)))
-*)
-external mk_const : context -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_mk_const"
-
-(**
- Summary: Declare a fresh constant or function.
- Z3 will generate an unique name for this function declaration.
- - {b See also}: {!mk_func_decl}
- def_API('mk_fresh_func_decl', FUNC_DECL, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SORT), _in(SORT)))
-*)
-external mk_fresh_func_decl : context -> string -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_fresh_func_decl"
-
-(**
- Summary: Declare and create a fresh constant.
- [mk_fresh_const c p t] is a shorthand for [mk_app c (mk_fresh_func_decl c p [||] t) [||]].
- - {b See also}: {!mk_func_decl}
- - {b See also}: {!mk_app}
- def_API('mk_fresh_const', AST, (_in(CONTEXT), _in(STRING), _in(SORT)))
-*)
-external mk_fresh_const : context -> string -> sort -> ast
- = "camlidl_z3V3_Z3_mk_fresh_const"
-
-(**
- {2 {L Propositional Logic and Equality}}
-*)
-(**
- Summary: Create an AST node representing [true].
- def_API('mk_true', AST, (_in(CONTEXT), ))
-*)
-external mk_true : context -> ast
- = "camlidl_z3V3_Z3_mk_true"
-
-(**
- Summary: Create an AST node representing [false].
- def_API('mk_false', AST, (_in(CONTEXT), ))
-*)
-external mk_false : context -> ast
- = "camlidl_z3V3_Z3_mk_false"
-
-(**
- Summary: \[ [ mk_eq c l r ] \]
- Create an AST node representing {e l = r }.
- The nodes [l] and [r] must have the same type.
- def_API('mk_eq', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_eq : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_eq"
-
-(**
- Summary: \[ [mk_distinct c [| t_1; ...; t_n |]] \] Create an AST
- node represeting a distinct construct. It is used for declaring
- the arguments t_i pairwise distinct.
- The [distinct] construct is used for declaring the arguments pairwise distinct.
- That is, {e Forall 0 <= i < j < num_args. not args[i] = args[j] }.
- All arguments must have the same sort.
- - {b Remarks}: The number of arguments of a distinct construct must be greater than one.
- def_API('mk_distinct', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_distinct : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_distinct"
-
-(**
- Summary: \[ [ mk_not c a ] \]
- Create an AST node representing {e not(a) }.
- The node [a] must have Boolean sort.
- def_API('mk_not', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_not : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_not"
-
-(**
- Summary: \[ [ mk_ite c t1 t2 t2 ] \]
- Create an AST node representing an if-then-else: {e ite(t1, t2,
- t3) }.
- The node [t1] must have Boolean sort, [t2] and [t3] must have the same sort.
- The sort of the new node is equal to the sort of [t2] and [t3].
- def_API('mk_ite', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(AST)))
-*)
-external mk_ite : context -> ast -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ite"
-
-(**
- Summary: \[ [ mk_iff c t1 t2 ] \]
- Create an AST node representing {e t1 iff t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_iff', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_iff : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_iff"
-
-(**
- Summary: \[ [ mk_implies c t1 t2 ] \]
- Create an AST node representing {e t1 implies t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_implies', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_implies : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_implies"
-
-(**
- Summary: \[ [ mk_xor c t1 t2 ] \]
- Create an AST node representing {e t1 xor t2 }.
- The nodes [t1] and [t2] must have Boolean sort.
- def_API('mk_xor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_xor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_xor"
-
-(**
- Summary: \[ [mk_and c [| t_1; ...; t_n |]] \] Create the conjunction: {e t_1 and ... and t_n}.
- All arguments must have Boolean sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_and', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_and : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_and"
-
-(**
- Summary: \[ [mk_or c [| t_1; ...; t_n |]] \] Create the disjunction: {e t_1 or ... or t_n}.
- All arguments must have Boolean sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_or', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_or : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_or"
-
-(**
- {2 {L Arithmetic: Integers and Reals}}
-*)
-(**
- Summary: \[ [mk_add c [| t_1; ...; t_n |]] \] Create the term: {e t_1 + ... + t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_add', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_add : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_add"
-
-(**
- Summary: \[ [mk_mul c [| t_1; ...; t_n |]] \] Create the term: {e t_1 * ... * t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: Z3 has limited support for non-linear arithmetic.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_mul', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_mul : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_mul"
-
-(**
- Summary: \[ [mk_sub c [| t_1; ...; t_n |]] \] Create the term: {e t_1 - ... - t_n}.
- All arguments must have int or real sort.
- - {b Remarks}: The number of arguments must be greater than zero.
- def_API('mk_sub', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_sub : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_sub"
-
-(**
- Summary: \[ [mk_unary_minus c arg] \] Create the term: {e - arg}.
- The arguments must have int or real type.
- def_API('mk_unary_minus', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_unary_minus : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_unary_minus"
-
-(**
- Summary: \[ [mk_div c t_1 t_2] \] Create the term: {e t_1 div t_2}.
- The arguments must either both have int type or both have real type.
- If the arguments have int type, then the result type is an int type, otherwise the
- the result type is real.
- def_API('mk_div', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_div : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_div"
-
-(**
- Summary: \[ [mk_mod c t_1 t_2] \] Create the term: {e t_1 mod t_2}.
- The arguments must have int type.
- def_API('mk_mod', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_mod : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_mod"
-
-(**
- Summary: \[ [mk_rem c t_1 t_2] \] Create the term: {e t_1 rem t_2}.
- The arguments must have int type.
- def_API('mk_rem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_rem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rem"
-
-(**
- The arguments must have int or real type.
- def_API('mk_power', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_power : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_power"
-
-(**
- Summary: \[ [ mk_lt c t1 t2 ] \]
- Create less than.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_lt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_lt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_lt"
-
-(**
- Summary: \[ [ mk_le c t1 t2 ] \]
- Create less than or equal to.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_le', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_le : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_le"
-
-(**
- Summary: \[ [ mk_gt c t1 t2 ] \]
- Create greater than.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_gt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_gt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_gt"
-
-(**
- Summary: \[ [ mk_ge c t1 t2 ] \]
- Create greater than or equal to.
- The nodes [t1] and [t2] must have the same sort, and must be int or real.
- def_API('mk_ge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ge"
-
-(**
- Summary: \[ [ mk_int2real c t1 ] \]
- Coerce an integer to a real.
- There is also a converse operation exposed.
- It follows the semantics prescribed by the SMT-LIB standard.
- You can take the floor of a real by
- creating an auxiliary integer constant [k] and
- and asserting {e mk_int2real(k) <= t1 < mk_int2real(k)+1 }.
- The node [t1] must have sort integer.
- - {b See also}: {!mk_real2int}
- - {b See also}: {!mk_is_int}
- def_API('mk_int2real', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_int2real : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_int2real"
-
-(**
- Summary: \[ [ mk_real2int c t1 ] \]
- Coerce a real to an integer.
- The semantics of this function follows the SMT-LIB standard
- for the function to_int
- - {b See also}: {!mk_int2real}
- - {b See also}: {!mk_is_int}
- def_API('mk_real2int', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_real2int : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_real2int"
-
-(**
- Summary: \[ [ mk_is_int c t1 ] \]
- Check if a real number is an integer.
- - {b See also}: {!mk_int2real}
- - {b See also}: {!mk_real2int}
- def_API('mk_is_int', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_is_int : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_is_int"
-
-(**
- {2 {L Bit-vectors}}
-*)
-(**
- Summary: \[ [ mk_bvnot c t1 ] \]
- Bitwise negation.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvnot', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvnot : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnot"
-
-(**
- Summary: \[ [ mk_bvredand c t1 ] \]
- Take conjunction of bits in vector, return vector of length 1.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvredand', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvredand : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvredand"
-
-(**
- Summary: \[ [ mk_bvredor c t1 ] \]
- Take disjunction of bits in vector, return vector of length 1.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bvredor', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvredor : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvredor"
-
-(**
- Summary: \[ [ mk_bvand c t1 t2 ] \]
- Bitwise and.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvand', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvand : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvand"
-
-(**
- Summary: \[ [ mk_bvor c t1 t2 ] \]
- Bitwise or.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvor"
-
-(**
- Summary: \[ [ mk_bvxor c t1 t2 ] \]
- Bitwise exclusive-or.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvxor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvxor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvxor"
-
-(**
- Summary: \[ [ mk_bvnand c t1 t2 ] \]
- Bitwise nand.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvnand', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvnand : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnand"
-
-(**
- Summary: \[ [ mk_bvnor c t1 t2 ] \]
- Bitwise nor.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvnor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvnor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvnor"
-
-(**
- Summary: \[ [ mk_bvxnor c t1 t2 ] \]
- Bitwise xnor.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvxnor', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvxnor : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvxnor"
-
-(**
- Summary: \[ [ mk_bvneg c t1 ] \]
- Standard two's complement unary minus.
- The node [t1] must have bit-vector sort.
- def_API('mk_bvneg', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvneg : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvneg"
-
-(**
- Summary: \[ [ mk_bvadd c t1 t2 ] \]
- Standard two's complement addition.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvadd : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvadd"
-
-(**
- Summary: \[ [ mk_bvsub c t1 t2 ] \]
- Standard two's complement subtraction.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsub : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsub"
-
-(**
- Summary: \[ [ mk_bvmul c t1 t2 ] \]
- Standard two's complement multiplication.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvmul : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvmul"
-
-(**
- Summary: \[ [ mk_bvudiv c t1 t2 ] \]
- Unsigned division.
- It is defined as the [floor] of {e t1/t2 } if [t2] is
- different from zero. If {e t2 } is zero, then the result
- is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvudiv', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvudiv : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvudiv"
-
-(**
- Summary: \[ [ mk_bvsdiv c t1 t2 ] \]
- Two's complement signed division.
- It is defined in the following way:
- - The [floor] of {e t1/t2 } if [t2] is different from zero, and {e t1*t2 >= 0 }.
- - The [ceiling] of {e t1/t2 } if [t2] is different from zero, and {e t1*t2 < 0 }.
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsdiv', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsdiv : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsdiv"
-
-(**
- Summary: \[ [ mk_bvurem c t1 t2 ] \]
- Unsigned remainder.
- It is defined as {e t1 - (t1 /u t2) * t2 }, where {e /u } represents unsigned int division.
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvurem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvurem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvurem"
-
-(**
- Summary: \[ [ mk_bvsrem c t1 t2 ] \]
- Two's complement signed remainder (sign follows dividend).
- It is defined as {e t1 - (t1 /s t2) * t2 }, where {e /s } represents signed division.
- The most significant bit (sign) of the result is equal to the most significant bit of [t1].
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- - {b See also}: {!mk_bvsmod}
- def_API('mk_bvsrem', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsrem : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsrem"
-
-(**
- Summary: \[ [ mk_bvsmod c t1 t2 ] \]
- Two's complement signed remainder (sign follows divisor).
- If {e t2 } is zero, then the result is undefined.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- - {b See also}: {!mk_bvsrem}
- def_API('mk_bvsmod', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsmod : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsmod"
-
-(**
- Summary: \[ [ mk_bvult c t1 t2 ] \]
- Unsigned less than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvult', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvult : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvult"
-
-(**
- Summary: \[ [ mk_bvslt c t1 t2 ] \]
- Two's complement signed less than.
- It abbreviates:
- {v
- (or (and (= (extract[|m-1|:|m-1|] t1) bit1)
- (= (extract[|m-1|:|m-1|] t2) bit0))
- (and (= (extract[|m-1|:|m-1|] t1) (extract[|m-1|:|m-1|] t2))
- (bvult t1 t2)))
- v}
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvslt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvslt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvslt"
-
-(**
- Summary: \[ [ mk_bvule c t1 t2 ] \]
- Unsigned less than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvule', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvule : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvule"
-
-(**
- Summary: \[ [ mk_bvsle c t1 t2 ] \]
- Two's complement signed less than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsle', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsle : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsle"
-
-(**
- Summary: \[ [ mk_bvuge c t1 t2 ] \]
- Unsigned greater than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvuge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvuge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvuge"
-
-(**
- Summary: \[ [ mk_bvsge c t1 t2 ] \]
- Two's complement signed greater than or equal to.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsge', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsge : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsge"
-
-(**
- Summary: \[ [ mk_bvugt c t1 t2 ] \]
- Unsigned greater than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvugt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvugt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvugt"
-
-(**
- Summary: \[ [ mk_bvsgt c t1 t2 ] \]
- Two's complement signed greater than.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsgt', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsgt : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsgt"
-
-(**
- Summary: \[ [ mk_concat c t1 t2 ] \]
- Concatenate the given bit-vectors.
- The nodes [t1] and [t2] must have (possibly different) bit-vector sorts
- The result is a bit-vector of size {e n1+n2 }, where [n1] ([n2)] is the size
- of [t1] ([t2)].
- def_API('mk_concat', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_concat : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_concat"
-
-(**
- Summary: \[ [ mk_extract c high low t1 ] \]
- Extract the bits [high] down to [low] from a bitvector of
- size [m] to yield a new bitvector of size [n], where {e n =
- high - low + 1 }.
- The node [t1] must have a bit-vector sort.
- def_API('mk_extract', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in(AST)))
-*)
-external mk_extract : context -> int -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_extract"
-
-(**
- Summary: \[ [ mk_sign_ext c i t1 ] \]
- Sign-extend of the given bit-vector to the (signed) equivalent bitvector of
- size {e m+i }, where [m] is the size of the given
- bit-vector.
- The node [t1] must have a bit-vector sort.
- def_API('mk_sign_ext', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_sign_ext : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_sign_ext"
-
-(**
- Summary: \[ [ mk_zero_ext c i t1 ] \]
- Extend the given bit-vector with zeros to the (unsigned) equivalent
- bitvector of size {e m+i }, where [m] is the size of the
- given bit-vector.
- The node [t1] must have a bit-vector sort.
- def_API('mk_zero_ext', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_zero_ext : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_zero_ext"
-
-(**
- Summary: \[ [ mk_repeat c i t1 ] \]
- Repeat the given bit-vector up length {e i }.
- The node [t1] must have a bit-vector sort.
- def_API('mk_repeat', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_repeat : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_repeat"
-
-(**
- Summary: \[ [ mk_bvshl c t1 t2 ] \]
- Shift left.
- It is equivalent to multiplication by {e 2^x } where [x] is the value of the
- third argument.
- NB. The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvshl', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvshl : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvshl"
-
-(**
- Summary: \[ [ mk_bvlshr c t1 t2 ] \]
- Logical shift right.
- It is equivalent to unsigned int division by {e 2^x } where [x] is the
- value of the third argument.
- NB. The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvlshr', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvlshr : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvlshr"
-
-(**
- Summary: \[ [ mk_bvashr c t1 t2 ] \]
- Arithmetic shift right.
- It is like logical shift right except that the most significant
- bits of the result always copy the most significant bit of the
- second argument.
- The semantics of shift operations varies between environments. This
- definition does not necessarily capture directly the semantics of the
- programming language or assembly architecture you are modeling.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvashr', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvashr : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvashr"
-
-(**
- Summary: \[ [ mk_rotate_left c i t1 ] \]
- Rotate bits of [t1] to the left [i] times.
- The node [t1] must have a bit-vector sort.
- def_API('mk_rotate_left', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_rotate_left : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rotate_left"
-
-(**
- Summary: \[ [ mk_rotate_right c i t1 ] \]
- Rotate bits of [t1] to the right [i] times.
- The node [t1] must have a bit-vector sort.
- def_API('mk_rotate_right', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_rotate_right : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_rotate_right"
-
-(**
- Summary: \[ [ mk_ext_rotate_left c t1 t2 ] \]
- Rotate bits of [t1] to the left [t2] times.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_ext_rotate_left', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ext_rotate_left : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ext_rotate_left"
-
-(**
- Summary: \[ [ mk_ext_rotate_right c t1 t2 ] \]
- Rotate bits of [t1] to the right [t2] times.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_ext_rotate_right', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_ext_rotate_right : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_ext_rotate_right"
-
-(**
- Summary: \[ [ mk_int2bv c n t1 ] \]
- Create an [n] bit bit-vector from the integer argument [t1].
- NB. This function is essentially treated as uninterpreted.
- So you cannot expect Z3 to precisely reflect the semantics of this function
- when solving constraints with this function.
- The node [t1] must have integer sort.
- def_API('mk_int2bv', AST, (_in(CONTEXT), _in(UINT), _in(AST)))
-*)
-external mk_int2bv : context -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_int2bv"
-
-(**
- Summary: \[ [ mk_bv2int c t1 is_signed ] \]
- Create an integer from the bit-vector argument [t1].
- If [is_signed] is false, then the bit-vector [t1] is treated as unsigned int.
- So the result is non-negative
- and in the range {e [0..2^N-1] }, where N are the number of bits in [t1].
- If [is_signed] is true, [t1] is treated as a signed bit-vector.
- This function is essentially treated as uninterpreted.
- So you cannot expect Z3 to precisely reflect the semantics of this function
- when solving constraints with this function.
- The node [t1] must have a bit-vector sort.
- def_API('mk_bv2int', AST, (_in(CONTEXT), _in(AST), _in(BOOL)))
-*)
-external mk_bv2int : context -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bv2int"
-
-(**
- Summary: \[ [ mk_bvadd_no_overflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise addition
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvadd_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvadd_no_overflow"
-
-(**
- Summary: \[ [ mk_bvadd_no_underflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed addition
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvadd_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvadd_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvadd_no_underflow"
-
-(**
- Summary: \[ [ mk_bvsub_no_overflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed subtraction
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsub_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsub_no_overflow"
-
-(**
- Summary: \[ [ mk_bvsub_no_underflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise subtraction
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsub_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvsub_no_underflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvsub_no_underflow"
-
-(**
- Summary: \[ [ mk_bvsdiv_no_overflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed division
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvsdiv_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvsdiv_no_overflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvsdiv_no_overflow"
-
-(**
- Summary: \[ [ mk_bvneg_no_overflow c t1 ] \]
- Check that bit-wise negation does not overflow when
- [t1] is interpreted as a signed bit-vector.
- The node [t1] must have bit-vector sort.
- def_API('mk_bvneg_no_overflow', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_bvneg_no_overflow : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvneg_no_overflow"
-
-(**
- Summary: \[ [ mk_bvmul_no_overflow c t1 t2 is_signed ] \]
- Create a predicate that checks that the bit-wise multiplication
- of [t1] and [t2] does not overflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul_no_overflow', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(BOOL)))
-*)
-external mk_bvmul_no_overflow : context -> ast -> ast -> bool -> ast
- = "camlidl_z3V3_Z3_mk_bvmul_no_overflow"
-
-(**
- Summary: \[ [ mk_bvmul_no_underflow c t1 t2 ] \]
- Create a predicate that checks that the bit-wise signed multiplication
- of [t1] and [t2] does not underflow.
- The nodes [t1] and [t2] must have the same bit-vector sort.
- def_API('mk_bvmul_no_underflow', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_bvmul_no_underflow : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_bvmul_no_underflow"
-
-(**
- {2 {L Arrays}}
-*)
-(**
- Summary: \[ [ mk_select c a i ] \]
- Array read.
- The argument [a] is the array and [i] is the index of the array that gets read.
- The node [a] must have an array sort {e [domain -> range] },
- and [i] must have the sort [domain].
- The sort of the result is [range].
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_store}
- def_API('mk_select', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_select : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_select"
-
-(**
- Summary: \[ [ mk_store c a i v ] \]
- Array update.
- The node [a] must have an array sort {e [domain -> range] }, [i] must have sort [domain],
- [v] must have sort range. The sort of the result is {e [domain -> range] }.
- The semantics of this function is given by the theory of arrays described in the SMT-LIB
- standard. See http://smtlib.org for more details.
- The result of this function is an array that is equal to [a] (with respect to [select)]
- on all indices except for [i], where it maps to [v] (and the [select] of [a] with
- respect to [i] may be a different value).
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_select}
- def_API('mk_store', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(AST)))
-*)
-external mk_store : context -> ast -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_store"
-
-(**
- Summary: Create the constant array.
- The resulting term is an array, such that a [select] on an arbitrary index
- produces the value [v].
- @param c logical context.
- @param domain domain sort for the array.
- @param v value that the array maps to.
- def_API('mk_const_array', AST, (_in(CONTEXT), _in(SORT), _in(AST)))
-*)
-external mk_const_array : context -> sort -> ast -> ast
- = "camlidl_z3V3_Z3_mk_const_array"
-
-(**
- Summary: \[ [ mk_map f n args ] \]
- map f on the the argument arrays.
- The [n] nodes [args] must be of array sorts {e [domain_i -> range_i] }.
- The function declaration [f] must have type {e range_1 .. range_n -> range }.
- [v] must have sort range. The sort of the result is {e [domain_i -> range] }.
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!mk_store}
- - {b See also}: {!mk_select}
- def_API('mk_map', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT), _in_array(2, AST)))
-*)
-external mk_map : context -> func_decl -> int -> ast -> ast
- = "camlidl_z3V3_Z3_mk_map"
-
-(**
- Summary: Access the array default value.
- Produces the default range value, for arrays that can be represented as
- finite maps with a default range value.
- @param c logical context.
- @param array array value whose default range value is accessed.
- def_API('mk_array_default', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_array_default : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_array_default"
-
-(**
- {2 {L Sets}}
-*)
-(**
- Summary: Create Set type.
- def_API('mk_set_sort', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_set_sort : context -> sort -> sort
- = "camlidl_z3V3_Z3_mk_set_sort"
-
-(**
- Summary: Create the empty set.
- def_API('mk_empty_set', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_empty_set : context -> sort -> ast
- = "camlidl_z3V3_Z3_mk_empty_set"
-
-(**
- Summary: Create the full set.
- def_API('mk_full_set', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external mk_full_set : context -> sort -> ast
- = "camlidl_z3V3_Z3_mk_full_set"
-
-(**
- Summary: Add an element to a set.
- The first argument must be a set, the second an element.
- def_API('mk_set_add', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_add : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_add"
-
-(**
- Summary: Remove an element to a set.
- The first argument must be a set, the second an element.
- def_API('mk_set_del', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_del : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_del"
-
-(**
- Summary: Take the union of a list of sets.
- def_API('mk_set_union', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_set_union : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_set_union"
-
-(**
- Summary: Take the intersection of a list of sets.
- def_API('mk_set_intersect', AST, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_set_intersect : context -> ast array -> ast
- = "camlidl_z3V3_Z3_mk_set_intersect"
-
-(**
- Summary: Take the set difference between two sets.
- def_API('mk_set_difference', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_difference : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_difference"
-
-(**
- Summary: Take the complement of a set.
- def_API('mk_set_complement', AST, (_in(CONTEXT), _in(AST)))
-*)
-external mk_set_complement : context -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_complement"
-
-(**
- Summary: Check for set membership.
- The first argument should be an element type of the set.
- def_API('mk_set_member', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_member : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_member"
-
-(**
- Summary: Check for subsetness of sets.
- def_API('mk_set_subset', AST, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external mk_set_subset : context -> ast -> ast -> ast
- = "camlidl_z3V3_Z3_mk_set_subset"
-
-(**
- {2 {L Numerals}}
-*)
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Create a numeral of a given sort.
- @param c logical context.
- @param numeral A string representing the numeral value in decimal notation. If the given sort is a real, then the numeral can be a rational, that is, a string of the form {e [num]* / [num]* }.
- @param ty The sort of the numeral. In the current implementation, the given sort can be an int, real, finite-domain, or bit-vectors of arbitrary size.
- - {b See also}: {!mk_int}
- def_API('mk_numeral', AST, (_in(CONTEXT), _in(STRING), _in(SORT)))
-*)
-external mk_numeral : context -> string -> sort -> ast
- = "camlidl_z3V3_Z3_mk_numeral"
-
-(**
- Summary: Create a real from a fraction.
- @param c logical context.
- @param num numerator of rational.
- @param den denomerator of rational.
- - {b Precondition}: den != 0
- - {b See also}: {!mk_numeral}
- - {b See also}: {!mk_int}
- def_API('mk_real', AST, (_in(CONTEXT), _in(INT), _in(INT)))
-*)
-external mk_real : context -> int -> int -> ast
- = "camlidl_z3V3_Z3_mk_real"
-
-(**
- Summary: Create a numeral of an int, bit-vector, or finite-domain sort.
- This function can be use to create numerals that fit in a machine integer.
- It is slightly faster than {!mk_numeral} since it is not necessary to parse a string.
- - {b See also}: {!mk_numeral}
- def_API('mk_int', AST, (_in(CONTEXT), _in(INT), _in(SORT)))
-*)
-external mk_int : context -> int -> sort -> ast
- = "camlidl_z3V3_Z3_mk_int"
-
-(**
- Summary: Create a numeral of a int, bit-vector, or finite-domain sort.
- This function can be use to create numerals that fit in a machine long long integer.
- It is slightly faster than {!mk_numeral} since it is not necessary to parse a string.
- - {b See also}: {!mk_numeral}
- def_API('mk_int64', AST, (_in(CONTEXT), _in(INT64), _in(SORT)))
-*)
-external mk_int64 : context -> int64 -> sort -> ast
- = "camlidl_z3V3_Z3_mk_int64"
-
-(**
- {2 {L Quantifiers}}
-*)
-(**
- Summary: Create a pattern for quantifier instantiation.
- Z3 uses pattern matching to instantiate quantifiers. If a
- pattern is not provided for a quantifier, then Z3 will
- automatically compute a set of patterns for it. However, for
- optimal performance, the user should provide the patterns.
- Patterns comprise a list of terms. The list should be
- non-empty. If the list comprises of more than one term, it is
- a called a multi-pattern.
- In general, one can pass in a list of (multi-)patterns in the
- quantifier constructor.
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_pattern', PATTERN, (_in(CONTEXT), _in(UINT), _in_array(1, AST)))
-*)
-external mk_pattern : context -> ast array -> pattern
- = "camlidl_z3V3_Z3_mk_pattern"
-
-(**
- Summary: Create a bound variable.
- Bound variables are indexed by de-Bruijn indices. It is perhaps easiest to explain
- the meaning of de-Bruijn indices by indicating the compilation process from
- non-de-Bruijn formulas to de-Bruijn format.
- {v
- abs(forall (x1) phi) = forall (x1) abs1(phi, x1, 0)
- abs(forall (x1, x2) phi) = abs(forall (x1) abs(forall (x2) phi))
- abs1(x, x, n) = b_n
- abs1(y, x, n) = y
- abs1(f(t1,...,tn), x, n) = f(abs1(t1,x,n), ..., abs1(tn,x,n))
- abs1(forall (x1) phi, x, n) = forall (x1) (abs1(phi, x, n+1))
- v}
- The last line is significant: the index of a bound variable is different depending
- on the scope in which it appears. The deeper x appears, the higher is its
- index.
- @param c logical context
- @param index de-Bruijn index
- @param ty sort of the bound variable
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_bound', AST, (_in(CONTEXT), _in(UINT), _in(SORT)))
-*)
-external mk_bound : context -> int -> sort -> ast
- = "camlidl_z3V3_Z3_mk_bound"
-
-(**
- Summary: Create a forall formula. It takes an expression [body] that contains bound variables
- of the same sorts as the sorts listed in the array [sorts]. The bound variables are de-Bruijn indices created
- using {!mk_bound}. The array [decl_names] contains the names that the quantified formula uses for the
- bound variables. Z3 applies the convention that the last element in the [decl_names] and [sorts] array
- refers to the variable with index 0, the second to last element of [decl_names] and [sorts] refers
- to the variable with index 1, etc.
- [mk_forall c w p t n b] creates a forall formula, where
- [w] is the weight, [p] is an array of patterns, [t] is an array
- with the sorts of the bound variables, [n] is an array with the
- 'names' of the bound variables, and [b] is the body of the
- quantifier. Quantifiers are associated with weights indicating
- the importance of using the quantifier during
- instantiation.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_decls number of variables to be bound.
- @param sorts the sorts of the bound variables.
- @param decl_names names of the bound variables
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_exists}
- def_API('mk_forall', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, PATTERN), _in(UINT), _in_array(4, SORT), _in_array(4, SYMBOL), _in(AST)))
-*)
-external mk_forall : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_forall_bytecode" "camlidl_z3V3_Z3_mk_forall"
-
-(**
- Summary: Create an exists formula. Similar to {!mk_forall}.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_quantifier}
- def_API('mk_exists', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, PATTERN), _in(UINT), _in_array(4, SORT), _in_array(4, SYMBOL), _in(AST)))
-*)
-external mk_exists : context -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_exists_bytecode" "camlidl_z3V3_Z3_mk_exists"
-
-(**
- Summary: Create a quantifier - universal or existential, with pattern hints.
- See the documentation for {!mk_forall} for an explanation of the parameters.
- @param c logical context.
- @param is_forall flag to indicate if this is a universal or existential quantifier.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_decls number of variables to be bound.
- @param sorts array of sorts of the bound variables.
- @param decl_names names of the bound variables.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_quantifier', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(UINT), _in_array(3, PATTERN), _in(UINT), _in_array(5, SORT), _in_array(5, SYMBOL), _in(AST)))
-*)
-external mk_quantifier : context -> bool -> int -> pattern array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_bytecode" "camlidl_z3V3_Z3_mk_quantifier"
-
-(**
- Summary: Create a quantifier - universal or existential, with pattern hints, no patterns, and attributes
- @param c logical context.
- @param is_forall flag to indicate if this is a universal or existential quantifier.
- @param quantifier_id identifier to identify quantifier
- @param skolem_id identifier to identify skolem constants introduced by quantifier.
- @param weight quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param num_no_patterns number of no_patterns.
- @param no_patterns array containing subexpressions to be excluded from inferred patterns.
- @param num_decls number of variables to be bound.
- @param sorts array of sorts of the bound variables.
- @param decl_names names of the bound variables.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_bound}
- - {b See also}: {!mk_forall}
- - {b See also}: {!mk_exists}
- def_API('mk_quantifier_ex', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(5, PATTERN), _in(UINT), _in_array(7, AST), _in(UINT), _in_array(9, SORT), _in_array(9, SYMBOL), _in(AST)))
-*)
-external mk_quantifier_ex : context -> bool -> int -> symbol -> symbol -> pattern array -> ast array -> sort array -> symbol array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_ex_bytecode" "camlidl_z3V3_Z3_mk_quantifier_ex"
-
-(**
- Summary: Create a universal quantifier using a list of constants that
- will form the set of bound variables.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using
- the quantifier during instantiation. By default, pass the weight 0.
- @param num_bound number of constants to be abstracted into bound variables.
- @param bound array of constants to be abstracted into bound variables.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_exists_const}
- def_API('mk_forall_const', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, APP), _in(UINT), _in_array(4, PATTERN), _in(AST)))
-*)
-external mk_forall_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_forall_const"
-
-(**
- Summary: Similar to {!mk_forall_const}.
- Summary: Create an existential quantifier using a list of constants that
- will form the set of bound variables.
- @param c logical context.
- @param weight quantifiers are associated with weights indicating the importance of using
- the quantifier during instantiation. By default, pass the weight 0.
- @param num_bound number of constants to be abstracted into bound variables.
- @param bound array of constants to be abstracted into bound variables.
- @param num_patterns number of patterns.
- @param patterns array containing the patterns created using {!mk_pattern}.
- @param body the body of the quantifier.
- - {b See also}: {!mk_pattern}
- - {b See also}: {!mk_forall_const}
- def_API('mk_exists_const', AST, (_in(CONTEXT), _in(UINT), _in(UINT), _in_array(2, APP), _in(UINT), _in_array(4, PATTERN), _in(AST)))
-*)
-external mk_exists_const : context -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_exists_const"
-
-(**
- Summary: Create a universal or existential
- quantifier using a list of constants that
- will form the set of bound variables.
- def_API('mk_quantifier_const', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(UINT), _in_array(3, APP), _in(UINT), _in_array(5, PATTERN), _in(AST)))
-*)
-external mk_quantifier_const : context -> bool -> int -> app array -> pattern array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_const_bytecode" "camlidl_z3V3_Z3_mk_quantifier_const"
-
-(**
- Summary: Create a universal or existential
- quantifier using a list of constants that
- will form the set of bound variables.
- def_API('mk_quantifier_const_ex', AST, (_in(CONTEXT), _in(BOOL), _in(UINT), _in(SYMBOL), _in(SYMBOL), _in(UINT), _in_array(5, APP), _in(UINT), _in_array(7, PATTERN), _in(UINT), _in_array(9, AST), _in(AST)))
-*)
-external mk_quantifier_const_ex : context -> bool -> int -> symbol -> symbol -> app array -> pattern array -> ast array -> ast -> ast
- = "camlidl_z3V3_Z3_mk_quantifier_const_ex_bytecode" "camlidl_z3V3_Z3_mk_quantifier_const_ex"
-
-(**
- {2 {L Accessors}}
-*)
-(**
- {3 {L Symbols}}
-*)
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Return [INT_SYMBOL] if the symbol was constructed
- using {!mk_int_symbol}, and [STRING_SYMBOL] if the symbol
- was constructed using {!mk_string_symbol}.
- def_API('get_symbol_kind', UINT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_kind : context -> symbol -> symbol_kind
- = "camlidl_z3V3_Z3_get_symbol_kind"
-
-(**
- Summary: \[ [ get_symbol_int c s ] \]
- Return the symbol int value.
- - {b Precondition}: get_symbol_kind s == INT_SYMBOL
- - {b See also}: {!mk_int_symbol}
- def_API('get_symbol_int', INT, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_int : context -> symbol -> int
- = "camlidl_z3V3_Z3_get_symbol_int"
-
-(**
- Summary: \[ [ get_symbol_string c s ] \]
- Return the symbol name.
- - {b Precondition}: get_symbol_string s == STRING_SYMBOL
- - {b See also}: {!mk_string_symbol}
- def_API('get_symbol_string', STRING, (_in(CONTEXT), _in(SYMBOL)))
-*)
-external get_symbol_string : context -> symbol -> string
- = "camlidl_z3V3_Z3_get_symbol_string"
-
-(**
- {3 {L Sorts}}
-*)
-(**
- Summary: Return the sort name as a symbol.
- def_API('get_sort_name', SYMBOL, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_name : context -> sort -> symbol
- = "camlidl_z3V3_Z3_get_sort_name"
-
-(**
- Summary: Return a unique identifier for [s].
- - {b Remarks}: Implicitly used by [Pervasives.( = )] and [Pervasives.compare].
- def_API('get_sort_id', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_id : context -> sort -> int
- = "camlidl_z3V3_Z3_get_sort_id"
-
-(**
- {4 {L Redundant low-level API}}
-*)
-(**
- Summary: Convert a [sort] into [ast].
- - {b Remarks}: [sort_to_ast c s] can be replaced by [(s :> ast)].
- def_API('sort_to_ast', AST, (_in(CONTEXT), _in(SORT)))
-*)
-external sort_to_ast : context -> sort -> ast
- = "camlidl_z3V3_Z3_sort_to_ast"
-
-(**
- Summary: compare sorts.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_sort', BOOL, (_in(CONTEXT), _in(SORT), _in(SORT)))
-*)
-external is_eq_sort : context -> sort -> sort -> bool
- = "camlidl_z3V3_Z3_is_eq_sort"
-
-(**
- Summary: Return the sort kind (e.g., array, tuple, int, bool, etc).
- - {b See also}: {!sort_kind}
- def_API('get_sort_kind', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_sort_kind : context -> sort -> sort_kind
- = "camlidl_z3V3_Z3_get_sort_kind"
-
-(**
- Summary: \[ [ get_bv_sort_size c t ] \]
- Return the size of the given bit-vector sort.
- - {b Precondition}: get_sort_kind c t == BV_SORT
- - {b See also}: {!mk_bv_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_bv_sort_size', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_bv_sort_size : context -> sort -> int
- = "camlidl_z3V3_Z3_get_bv_sort_size"
-
-(**
- Summary: Return the size of the sort in [r]. Return [None] if the call failed.
- That is, get_sort_kind(s) == FINITE_DOMAIN_SORT
- def_API('get_finite_domain_sort_size', BOOL, (_in(CONTEXT), _in(SORT), _out(UINT64)))
-*)
-external get_finite_domain_sort_size : context -> sort -> int64 option
- = "camlidl_z3V3_Z3_get_finite_domain_sort_size"
-
-(**
- Summary: \[ [ get_array_sort_domain c t ] \]
- Return the domain of the given array sort.
- - {b Precondition}: get_sort_kind c t == ARRAY_SORT
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_array_sort_domain', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_array_sort_domain : context -> sort -> sort
- = "camlidl_z3V3_Z3_get_array_sort_domain"
-
-(**
- Summary: \[ [ get_array_sort_range c t ] \]
- Return the range of the given array sort.
- - {b Precondition}: get_sort_kind c t == ARRAY_SORT
- - {b See also}: {!mk_array_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_array_sort_range', SORT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_array_sort_range : context -> sort -> sort
- = "camlidl_z3V3_Z3_get_array_sort_range"
-
-(**
- Summary: \[ [ get_tuple_sort_mk_decl c t ] \]
- Return the constructor declaration of the given tuple
- sort.
- - {b Precondition}: get_sort_kind c t == DATATYPE_SORT
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_mk_decl', FUNC_DECL, (_in(CONTEXT), _in(SORT)))
-*)
-external get_tuple_sort_mk_decl : context -> sort -> func_decl
- = "camlidl_z3V3_Z3_get_tuple_sort_mk_decl"
-
-(**
- Summary: \[ [ get_tuple_sort_num_fields c t ] \]
- Return the number of fields of the given tuple sort.
- - {b Precondition}: get_sort_kind c t == DATATYPE_SORT
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_num_fields', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_tuple_sort_num_fields : context -> sort -> int
- = "camlidl_z3V3_Z3_get_tuple_sort_num_fields"
-
-(**
- Summary: \[ [ get_tuple_sort_field_decl c t i ] \]
- Return the i-th field declaration (i.e., projection function declaration)
- of the given tuple sort.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: i < get_tuple_sort_num_fields c t
- - {b See also}: {!mk_tuple_sort}
- - {b See also}: {!get_sort_kind}
- def_API('get_tuple_sort_field_decl', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_tuple_sort_field_decl : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_tuple_sort_field_decl"
-
-(**
- Summary: Return number of constructors for datatype.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_num_constructors', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_datatype_sort_num_constructors : context -> sort -> int
- = "camlidl_z3V3_Z3_get_datatype_sort_num_constructors"
-
-(**
- Summary: Return idx'th constructor.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx < get_datatype_sort_num_constructors c t
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_constructor', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
+ Probes are used to inspect a goal (aka problem) and collect information that may be used to decide
+ which solver and/or preprocessing step will be used.
+ The complete list of probes may be obtained using the procedures [Context.NumProbes]
+ and [Context.ProbeNames].
+ It may also be obtained using the command [(help-tactics)] in the SMT 2.0 front-end.
*)
-external get_datatype_sort_constructor : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_constructor"
-
-(**
- Summary: Return idx'th recognizer.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx < get_datatype_sort_num_constructors c t
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
- def_API('get_datatype_sort_recognizer', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_datatype_sort_recognizer : context -> sort -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_recognizer"
-
-(**
- Summary: Return idx_a'th accessor for the idx_c'th constructor.
- - {b Precondition}: get_sort_kind t == DATATYPE_SORT
- - {b Precondition}: idx_c < get_datatype_sort_num_constructors c t
- - {b Precondition}: idx_a < get_domain_size c get_datatype_sort_constructor c idx_c
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- def_API('get_datatype_sort_constructor_accessor', FUNC_DECL, (_in(CONTEXT), _in(SORT), _in(UINT), _in(UINT)))
-*)
-external get_datatype_sort_constructor_accessor : context -> sort -> int -> int -> func_decl
- = "camlidl_z3V3_Z3_get_datatype_sort_constructor_accessor"
-
-(**
- Summary: Return arity of relation.
- - {b Precondition}: get_sort_kind s == RELATION_SORT
- - {b See also}: {!get_relation_column}
- def_API('get_relation_arity', UINT, (_in(CONTEXT), _in(SORT)))
-*)
-external get_relation_arity : context -> sort -> int
- = "camlidl_z3V3_Z3_get_relation_arity"
-
-(**
- Summary: Return sort at i'th column of relation sort.
- - {b Precondition}: get_sort_kind c s == RELATION_SORT
- - {b Precondition}: col < get_relation_arity c s
- - {b See also}: {!get_relation_arity}
- def_API('get_relation_column', SORT, (_in(CONTEXT), _in(SORT), _in(UINT)))
-*)
-external get_relation_column : context -> sort -> int -> sort
- = "camlidl_z3V3_Z3_get_relation_column"
-
-(**
- {3 {L Function Declarations}}
-*)
-(**
- Summary: Convert a [func_decl] into [ast].
- - {b Remarks}: [func_decl_to_ast c f] can be replaced by [(f :> ast)].
- def_API('func_decl_to_ast', AST, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external func_decl_to_ast : context -> func_decl -> ast
- = "camlidl_z3V3_Z3_func_decl_to_ast"
-
-(**
- Summary: compare terms.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_func_decl', BOOL, (_in(CONTEXT), _in(FUNC_DECL), _in(FUNC_DECL)))
-*)
-external is_eq_func_decl : context -> func_decl -> func_decl -> bool
- = "camlidl_z3V3_Z3_is_eq_func_decl"
-
-(**
- Summary: Return a unique identifier for [f].
- - {b Remarks}: Implicitly used by [Pervasives.( = )] and [Pervasives.compare].
- def_API('get_func_decl_id', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_func_decl_id : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_func_decl_id"
-
-(**
- Summary: Return the constant declaration name as a symbol.
- def_API('get_decl_name', SYMBOL, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_name : context -> func_decl -> symbol
- = "camlidl_z3V3_Z3_get_decl_name"
-
-(**
- Summary: Return declaration kind corresponding to declaration.
- def_API('get_decl_kind', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_kind : context -> func_decl -> decl_kind
- = "camlidl_z3V3_Z3_get_decl_kind"
-
-(**
- Summary: Return the number of parameters of the given declaration.
- - {b See also}: {!get_arity}
- def_API('get_domain_size', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_domain_size : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_domain_size"
-
-(**
- Summary: Alias for [get_domain_size].
- - {b See also}: {!get_domain_size}
- def_API('get_arity', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_arity : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_arity"
-
-(**
- Summary: \[ [ get_domain c d i ] \]
- Return the sort of the i-th parameter of the given function declaration.
- - {b Precondition}: i < get_domain_size d
- - {b See also}: {!get_domain_size}
- def_API('get_domain', SORT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_domain : context -> func_decl -> int -> sort
- = "camlidl_z3V3_Z3_get_domain"
-
-(**
- Summary: \[ [ get_range c d ] \]
- Return the range of the given declaration.
- If [d] is a constant (i.e., has zero arguments), then this
- function returns the sort of the constant.
- def_API('get_range', SORT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_range : context -> func_decl -> sort
- = "camlidl_z3V3_Z3_get_range"
-
-(**
- Summary: Return the number of parameters associated with a declaration.
- def_API('get_decl_num_parameters', UINT, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external get_decl_num_parameters : context -> func_decl -> int
- = "camlidl_z3V3_Z3_get_decl_num_parameters"
-
-(**
- Summary: Return the parameter type associated with a declaration.
- @param c the context
- @param d the function declaration
- @param idx is the index of the named parameter it should be between 0 and the number of parameters.
- def_API('get_decl_parameter_kind', UINT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_parameter_kind : context -> func_decl -> int -> parameter_kind
- = "camlidl_z3V3_Z3_get_decl_parameter_kind"
-
-(**
- Summary: Return the integer value associated with an integer parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_INT
- def_API('get_decl_int_parameter', INT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_int_parameter : context -> func_decl -> int -> int
- = "camlidl_z3V3_Z3_get_decl_int_parameter"
-
-(**
- Summary: Return the double value associated with an double parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_DOUBLE
- def_API('get_decl_double_parameter', DOUBLE, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_double_parameter : context -> func_decl -> int -> float
- = "camlidl_z3V3_Z3_get_decl_double_parameter"
-
-(**
- Summary: Return the double value associated with an double parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_SYMBOL
- def_API('get_decl_symbol_parameter', SYMBOL, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_symbol_parameter : context -> func_decl -> int -> symbol
- = "camlidl_z3V3_Z3_get_decl_symbol_parameter"
-
-(**
- Summary: Return the sort value associated with a sort parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_SORT
- def_API('get_decl_sort_parameter', SORT, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_sort_parameter : context -> func_decl -> int -> sort
- = "camlidl_z3V3_Z3_get_decl_sort_parameter"
-
-(**
- Summary: Return the expresson value associated with an expression parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_AST
- def_API('get_decl_ast_parameter', AST, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_ast_parameter : context -> func_decl -> int -> ast
- = "camlidl_z3V3_Z3_get_decl_ast_parameter"
-
-(**
- Summary: Return the expresson value associated with an expression parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_FUNC_DECL
- def_API('get_decl_func_decl_parameter', FUNC_DECL, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_func_decl_parameter : context -> func_decl -> int -> func_decl
- = "camlidl_z3V3_Z3_get_decl_func_decl_parameter"
-
-(**
- Summary: Return the rational value, as a string, associated with a rational parameter.
- - {b Precondition}: get_decl_parameter_kind c d idx == PARAMETER_RATIONAL
- def_API('get_decl_rational_parameter', STRING, (_in(CONTEXT), _in(FUNC_DECL), _in(UINT)))
-*)
-external get_decl_rational_parameter : context -> func_decl -> int -> string
- = "camlidl_z3V3_Z3_get_decl_rational_parameter"
-
-(**
- {3 {L Applications}}
-*)
-(**
- Summary: Convert a [app] into [ast].
- - {b Remarks}: [app_to_ast c a] can be replaced by [(a :> ast)].
- def_API('app_to_ast', AST, (_in(CONTEXT), _in(APP)))
-*)
-external app_to_ast : context -> app -> ast
- = "camlidl_z3V3_Z3_app_to_ast"
-
-(**
- Summary: Return the declaration of a constant or function application.
- def_API('get_app_decl', FUNC_DECL, (_in(CONTEXT), _in(APP)))
-*)
-external get_app_decl : context -> app -> func_decl
- = "camlidl_z3V3_Z3_get_app_decl"
-
-(**
- Summary: \[ [ get_app_num_args c a ] \]
- Return the number of argument of an application. If [t]
- is an constant, then the number of arguments is 0.
- def_API('get_app_num_args', UINT, (_in(CONTEXT), _in(APP)))
-*)
-external get_app_num_args : context -> app -> int
- = "camlidl_z3V3_Z3_get_app_num_args"
-
-(**
- Summary: \[ [ get_app_arg c a i ] \]
- Return the i-th argument of the given application.
- - {b Precondition}: i < get_num_args c a
- def_API('get_app_arg', AST, (_in(CONTEXT), _in(APP), _in(UINT)))
-*)
-external get_app_arg : context -> app -> int -> ast
- = "camlidl_z3V3_Z3_get_app_arg"
-
-(**
- {3 {L Terms}}
-*)
-(**
- Summary: compare terms.
- - {b Remarks}: [Pervasives.( = )] or [Pervasives.compare] can also be used.
- def_API('is_eq_ast', BOOL, (_in(CONTEXT), _in(AST), _in(AST)))
-*)
-external is_eq_ast : context -> ast -> ast -> bool
- = "camlidl_z3V3_Z3_is_eq_ast"
-
-(**
- Summary: Return a unique identifier for [t].
- - {b Remarks}: Implicitly used by [Pervasives.compare] for values of type [ast], [app], [sort], [func_decl], and [pattern].
- def_API('get_ast_id', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_id : context -> ast -> int
- = "camlidl_z3V3_Z3_get_ast_id"
-
-(**
- Summary: Return a hash code for the given AST.
- - {b Remarks}: Implicitly used by [Hashtbl.hash] for values of type [ast], [app], [sort], [func_decl], and [pattern].
- def_API('get_ast_hash', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_hash : context -> ast -> int
- = "camlidl_z3V3_Z3_get_ast_hash"
-
-(**
- Summary: Return the sort of an AST node.
- The AST node must be a constant, application, numeral, bound variable, or quantifier.
- def_API('get_sort', SORT, (_in(CONTEXT), _in(AST)))
-*)
-external get_sort : context -> ast -> sort
- = "camlidl_z3V3_Z3_get_sort"
-
-(**
- Summary: Return true if the given expression [t] is well sorted.
- def_API('is_well_sorted', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_well_sorted : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_well_sorted"
-
-(**
- Summary: Return L_TRUE if [a] is true, L_FALSE if it is false, and L_UNDEF otherwise.
- def_API('get_bool_value', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_bool_value : context -> ast -> lbool
- = "camlidl_z3V3_Z3_get_bool_value"
-
-(**
- Summary: Return the kind of the given AST.
- def_API('get_ast_kind', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_ast_kind : context -> ast -> ast_kind
- = "camlidl_z3V3_Z3_get_ast_kind"
-
-(**
- def_API('is_app', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_app : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_app"
-
-(**
- def_API('is_numeral_ast', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_numeral_ast : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_numeral_ast"
+module Probe :
+sig
+ type probe
-(**
- Summary: Return true if the give AST is a real algebraic number.
- def_API('is_algebraic_number', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_algebraic_number : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_algebraic_number"
-
-(**
- Summary: Convert an [ast] into an [APP_AST].
- - {b Precondition}: {v get_ast_kind c a == [APP_AST] v}
- def_API('to_app', APP, (_in(CONTEXT), _in(AST)))
-*)
-external to_app : context -> ast -> app
- = "camlidl_z3V3_Z3_to_app"
-
-(**
- Summary: Convert an AST into a FUNC_DECL_AST. This is just type casting.
- - {b Precondition}: {v get_ast_kind c a == FUNC_DECL_AST v}
- def_API('to_func_decl', FUNC_DECL, (_in(CONTEXT), _in(AST)))
-*)
-external to_func_decl : context -> ast -> func_decl
- = "camlidl_z3V3_Z3_to_func_decl"
-
-(**
- {4 {L Numerals}}
-*)
-(**
- {5 {L Low-level API}}
-*)
-(**
- Summary: Return numeral value, as a string of a numeric constant term
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_numeral_string', STRING, (_in(CONTEXT), _in(AST)))
-*)
-external get_numeral_string : context -> ast -> string
- = "camlidl_z3V3_Z3_get_numeral_string"
-
-(**
- Summary: Return numeral as a string in decimal notation.
- The result has at most [precision] decimal places.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST || is_algebraic_number c a
- def_API('get_numeral_decimal_string', STRING, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_numeral_decimal_string : context -> ast -> int -> string
- = "camlidl_z3V3_Z3_get_numeral_decimal_string"
-
-(**
- Summary: Return the numerator (as a numeral AST) of a numeral AST of sort Real.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_numerator', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_numerator : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_numerator"
-
-(**
- Summary: Return the denominator (as a numeral AST) of a numeral AST of sort Real.
- - {b Precondition}: get_ast_kind c a == NUMERAL_AST
- def_API('get_denominator', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_denominator : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_denominator"
-
-(**
- Summary: Return numeral value, as a pair of 64 bit numbers if the representation fits.
- @param c logical context.
- @param a term.
- @param num numerator.
- @param den denominator.
- Return [TRUE] if the numeral value fits in 64 bit numerals, [FALSE] otherwise.
- - {b Precondition}: get_ast_kind a == NUMERAL_AST
- def_API('get_numeral_small', BOOL, (_in(CONTEXT), _in(AST), _out(INT64), _out(INT64)))
-*)
-external get_numeral_small : context -> ast -> bool * int64 * int64
- = "camlidl_z3V3_Z3_get_numeral_small"
-
-(**
- Summary: \[ [ get_numeral_int c v ] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit in a machine int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_int', BOOL, (_in(CONTEXT), _in(AST), _out(INT)))
-*)
-external get_numeral_int : context -> ast -> bool * int
- = "camlidl_z3V3_Z3_get_numeral_int"
-
-(**
- Summary: \[ [ get_numeral_int64 c v ] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit in a machine long long int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_int64', BOOL, (_in(CONTEXT), _in(AST), _out(INT64)))
-*)
-external get_numeral_int64 : context -> ast -> bool * int64
- = "camlidl_z3V3_Z3_get_numeral_int64"
-
-(**
- Summary: \[ [ get_numeral_rational_int64 c x y] \]
- Similar to {!get_numeral_string}, but only succeeds if
- the value can fit as a rational number as machine long long int. Return TRUE if the call succeeded.
- - {b Precondition}: get_ast_kind c v == NUMERAL_AST
- - {b See also}: {!get_numeral_string}
- def_API('get_numeral_rational_int64', BOOL, (_in(CONTEXT), _in(AST), _out(INT64), _out(INT64)))
-*)
-external get_numeral_rational_int64 : context -> ast -> bool * int64 * int64
- = "camlidl_z3V3_Z3_get_numeral_rational_int64"
-
-(**
- Summary: Return a lower bound for the given real algebraic number.
- The interval isolating the number is smaller than 1/10^precision.
- The result is a numeral AST of sort Real.
- - {b Precondition}: is_algebraic_number c a
- def_API('get_algebraic_number_lower', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_algebraic_number_lower : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_algebraic_number_lower"
-
-(**
- Summary: Return a upper bound for the given real algebraic number.
- The interval isolating the number is smaller than 1/10^precision.
- The result is a numeral AST of sort Real.
- - {b Precondition}: is_algebraic_number c a
- def_API('get_algebraic_number_upper', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_algebraic_number_upper : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_algebraic_number_upper"
-
-(**
- {4 {L Patterns}}
-*)
-(**
- Summary: Convert a pattern into ast.
- - {b Remarks}: [pattern_to_ast c p] can be replaced by [(p :> ast)].
- def_API('pattern_to_ast', AST, (_in(CONTEXT), _in(PATTERN)))
-*)
-external pattern_to_ast : context -> pattern -> ast
- = "camlidl_z3V3_Z3_pattern_to_ast"
-
-(**
- Summary: Return number of terms in pattern.
- def_API('get_pattern_num_terms', UINT, (_in(CONTEXT), _in(PATTERN)))
-*)
-external get_pattern_num_terms : context -> pattern -> int
- = "camlidl_z3V3_Z3_get_pattern_num_terms"
-
-(**
- Summary: Return i'th ast in pattern.
- def_API('get_pattern', AST, (_in(CONTEXT), _in(PATTERN), _in(UINT)))
-*)
-external get_pattern : context -> pattern -> int -> ast
- = "camlidl_z3V3_Z3_get_pattern"
-
-(**
- {4 {L Quantifiers}}
-*)
-(**
- Summary: Return index of de-Brujin bound variable.
- - {b Precondition}: get_ast_kind a == VAR_AST
- def_API('get_index_value', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_index_value : context -> ast -> int
- = "camlidl_z3V3_Z3_get_index_value"
-
-(**
- Summary: Determine if quantifier is universal.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('is_quantifier_forall', BOOL, (_in(CONTEXT), _in(AST)))
-*)
-external is_quantifier_forall : context -> ast -> bool
- = "camlidl_z3V3_Z3_is_quantifier_forall"
+ (** Execute the probe over the goal.
+ @return A probe always produce a float value.
+ "Boolean" probes return 0.0 for false, and a value different from 0.0 for true. *)
+ val apply : probe -> Goal.goal -> float
-(**
- Summary: Obtain weight of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_weight', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_weight : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_weight"
-
-(**
- Summary: Return number of patterns used in quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_patterns', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_patterns : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_patterns"
-
-(**
- Summary: Return i'th pattern.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_pattern_ast', PATTERN, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_pattern_ast : context -> ast -> int -> pattern
- = "camlidl_z3V3_Z3_get_quantifier_pattern_ast"
-
-(**
- Summary: Return number of no_patterns used in quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_no_patterns', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_no_patterns : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_no_patterns"
-
-(**
- Summary: Return i'th no_pattern.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_no_pattern_ast', AST, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_no_pattern_ast : context -> ast -> int -> ast
- = "camlidl_z3V3_Z3_get_quantifier_no_pattern_ast"
-
-(**
- Summary: Return number of bound variables of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_num_bound', UINT, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_num_bound : context -> ast -> int
- = "camlidl_z3V3_Z3_get_quantifier_num_bound"
-
-(**
- Summary: Return symbol of the i'th bound variable.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_bound_name', SYMBOL, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_bound_name : context -> ast -> int -> symbol
- = "camlidl_z3V3_Z3_get_quantifier_bound_name"
-
-(**
- Summary: Return sort of the i'th bound variable.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_bound_sort', SORT, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external get_quantifier_bound_sort : context -> ast -> int -> sort
- = "camlidl_z3V3_Z3_get_quantifier_bound_sort"
-
-(**
- Summary: Return body of quantifier.
- - {b Precondition}: get_ast_kind a == QUANTIFIER_AST
- def_API('get_quantifier_body', AST, (_in(CONTEXT), _in(AST)))
-*)
-external get_quantifier_body : context -> ast -> ast
- = "camlidl_z3V3_Z3_get_quantifier_body"
-
-(**
- {3 {L Simplification}}
-*)
-(**
- Summary: Interface to simplifier.
- Provides an interface to the AST simplifier used by Z3.
- def_API('simplify', AST, (_in(CONTEXT), _in(AST)))
-*)
-external simplify : context -> ast -> ast
- = "camlidl_z3V3_Z3_simplify"
-
-(**
- {2 {L Modifiers}}
-*)
-(**
- Summary: Update the arguments of term [a] using the arguments [args].
- The number of arguments [num_args] should coincide
- with the number of arguments to [a].
- If [a] is a quantifier, then num_args has to be 1.
- def_API('update_term', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST)))
-*)
-external update_term : context -> ast -> ast array -> ast
- = "camlidl_z3V3_Z3_update_term"
-
-(**
- Summary: Substitute every occurrence of {e from[i] } in [a] with {e to[i] }, for [i] smaller than [num_exprs].
- The result is the new AST. The arrays [from] and [to] must have size [num_exprs].
- For every [i] smaller than [num_exprs], we must have that sort of {e from[i] } must be equal to sort of {e to[i] }.
- def_API('substitute', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST), _in_array(2, AST)))
-*)
-external substitute : context -> ast -> ast array -> ast array -> ast
- = "camlidl_z3V3_Z3_substitute"
+ (** The number of supported Probes. *)
+ val get_num_probes : context -> int
-(**
- Summary: Substitute the free variables in [a] with the expressions in [to].
- For every [i] smaller than [num_exprs], the variable with de-Bruijn index [i] is replaced with term {e to[i] }.
- def_API('substitute_vars', AST, (_in(CONTEXT), _in(AST), _in(UINT), _in_array(2, AST)))
-*)
-external substitute_vars : context -> ast -> ast array -> ast
- = "camlidl_z3V3_Z3_substitute_vars"
+ (** The names of all supported Probes. *)
+ val get_probe_names : context -> string list
-(**
- {2 {L Interaction logging.}}
-*)
-(**
- Summary: Log interaction to a file.
- extra_API('open_log', INT, (_in(STRING),))
-*)
-external open_log : string -> bool
- = "camlidl_z3V3_Z3_open_log"
-
-(**
- Summary: Append user-defined string to interaction log.
- The interaction log is opened using open_log.
- It contains the formulas that are checked using Z3.
- You can use this command to append comments, for instance.
- extra_API('append_log', VOID, (_in(STRING),))
-*)
-external append_log : string -> unit
- = "camlidl_z3V3_Z3_append_log"
+ (** Returns a string containing a description of the probe with the given name. *)
+ val get_probe_description : context -> string -> string
-(**
- Summary: Close interaction log.
- extra_API('close_log', VOID, ())
-*)
-external close_log : unit -> unit
- = "camlidl_z3V3_Z3_close_log"
-
-(**
- Summary: Enable/disable printing warning messages to the console.
- Warnings are printed after passing [true], warning messages are
- suppressed after calling this method with [false].
- def_API('toggle_warning_messages', VOID, (_in(BOOL),))
-*)
-external toggle_warning_messages : bool -> unit
- = "camlidl_z3V3_Z3_toggle_warning_messages"
+ (** Creates a new Probe. *)
+ val mk_probe : context -> string -> probe
-(**
- {2 {L String conversion}}
-*)
-(**
- Summary: Select mode for the format used for pretty-printing AST nodes.
- The default mode for pretty printing AST nodes is to produce
- SMT-LIB style output where common subexpressions are printed
- at each occurrence. The mode is called PRINT_SMTLIB_FULL.
- To print shared common subexpressions only once,
- use the PRINT_LOW_LEVEL mode.
- To print in way that conforms to SMT-LIB standards and uses let
- expressions to share common sub-expressions use PRINT_SMTLIB_COMPLIANT.
- - {b See also}: {!ast_to_string}
- - {b See also}: {!pattern_to_string}
- - {b See also}: {!func_decl_to_string}
- def_API('set_ast_print_mode', VOID, (_in(CONTEXT), _in(PRINT_MODE)))
-*)
-external set_ast_print_mode : context -> ast_print_mode -> unit
- = "camlidl_z3V3_Z3_set_ast_print_mode"
-
-(**
- Summary: Convert the given AST node into a string.
- - {b See also}: {!pattern_to_string}
- - {b See also}: {!sort_to_string}
- def_API('ast_to_string', STRING, (_in(CONTEXT), _in(AST)))
-*)
-external ast_to_string : context -> ast -> string
- = "camlidl_z3V3_Z3_ast_to_string"
+ (** Create a probe that always evaluates to a float value. *)
+ val const : context -> float -> probe
-(**
- def_API('pattern_to_string', STRING, (_in(CONTEXT), _in(PATTERN)))
-*)
-external pattern_to_string : context -> pattern -> string
- = "camlidl_z3V3_Z3_pattern_to_string"
+ (** Create a probe that evaluates to "true" when the value returned by the first argument
+ is less than the value returned by second argument *)
+ val lt : context -> probe -> probe -> probe
-(**
- def_API('sort_to_string', STRING, (_in(CONTEXT), _in(SORT)))
-*)
-external sort_to_string : context -> sort -> string
- = "camlidl_z3V3_Z3_sort_to_string"
+ (** Create a probe that evaluates to "true" when the value returned by the first argument
+ is greater than the value returned by second argument *)
+ val gt : context -> probe -> probe -> probe
-(**
- def_API('func_decl_to_string', STRING, (_in(CONTEXT), _in(FUNC_DECL)))
-*)
-external func_decl_to_string : context -> func_decl -> string
- = "camlidl_z3V3_Z3_func_decl_to_string"
+ (** Create a probe that evaluates to "true" when the value returned by the first argument
+ is less than or equal the value returned by second argument *)
+ val le : context -> probe -> probe -> probe
-(**
- Summary: Convert the given model into a string.
- def_API('model_to_string', STRING, (_in(CONTEXT), _in(MODEL)))
-*)
-external model_to_string : context -> model -> string
- = "camlidl_z3V3_Z3_model_to_string"
-
-(**
- Summary: Convert the given benchmark into SMT-LIB formatted string.
- @param c - context.
- @param name - name of benchmark. The argument is optional.
- @param logic - the benchmark logic.
- @param status - the status string (sat, unsat, or unknown)
- @param attributes - other attributes, such as source, difficulty or category.
- @param num_assumptions - number of assumptions.
- @param assumptions - auxiliary assumptions.
- @param formula - formula to be checked for consistency in conjunction with assumptions.
- def_API('benchmark_to_smtlib_string', STRING, (_in(CONTEXT), _in(STRING), _in(STRING), _in(STRING), _in(STRING), _in(UINT), _in_array(5, AST), _in(AST)))
-*)
-external benchmark_to_smtlib_string : context -> string -> string -> string -> string -> ast array -> ast -> string
- = "camlidl_z3V3_Z3_benchmark_to_smtlib_string_bytecode" "camlidl_z3V3_Z3_benchmark_to_smtlib_string"
+ (** Create a probe that evaluates to "true" when the value returned by the first argument
+ is greater than or equal the value returned by second argument *)
+ val ge : context -> probe -> probe -> probe
-(**
- {2 {L Parser interface}}
-*)
-(**
- Summary: \[ [ parse_smtlib2_string c str ] \]
- Parse the given string using the SMT-LIB2 parser.
- It returns a formula comprising of the conjunction of assertions in the scope
- (up to push/pop) at the end of the string.
- def_API('parse_smtlib2_string', AST, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib2_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3V3_Z3_parse_smtlib2_string_bytecode" "camlidl_z3V3_Z3_parse_smtlib2_string"
-(**
- Summary: Similar to {!parse_smtlib2_string}, but reads the benchmark from a file.
- def_API('parse_smtlib2_file', AST, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib2_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
- = "camlidl_z3V3_Z3_parse_smtlib2_file_bytecode" "camlidl_z3V3_Z3_parse_smtlib2_file"
+ (** Create a probe that evaluates to "true" when the value returned by the first argument
+ is equal the value returned by second argument *)
+ val eq : context -> probe -> probe -> probe
-(**
- {4 {L Low-level API}}
-*)
-(**
- Summary: \[ [ parse_smtlib_string c str sort_names sorts decl_names decls ] \]
- Parse the given string using the SMT-LIB parser.
- The symbol table of the parser can be initialized using the given sorts and declarations.
- The symbols in the arrays [sort_names] and [decl_names] don't need to match the names
- of the sorts and declarations in the arrays [sorts] and [decls]. This is an useful feature
- since we can use arbitrary names to reference sorts and declarations defined using the C API.
- The formulas, assumptions and declarations defined in [str] can be extracted using the functions:
- {!get_smtlib_num_formulas}, {!get_smtlib_formula}, {!get_smtlib_num_assumptions}, {!get_smtlib_assumption},
- {!get_smtlib_num_decls}, and {!get_smtlib_decl}.
- def_API('parse_smtlib_string', VOID, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib_string : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3V3_Z3_parse_smtlib_string_bytecode" "camlidl_z3V3_Z3_parse_smtlib_string"
+ (** Create a probe that evaluates to "true" when both of two probes evaluate to "true". *)
+ val and_ : context -> probe -> probe -> probe
-(**
- Summary: Similar to {!parse_smtlib_string}, but reads the benchmark from a file.
- def_API('parse_smtlib_file', VOID, (_in(CONTEXT), _in(STRING), _in(UINT), _in_array(2, SYMBOL), _in_array(2, SORT), _in(UINT), _in_array(5, SYMBOL), _in_array(5, FUNC_DECL)))
-*)
-external parse_smtlib_file : context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> unit
- = "camlidl_z3V3_Z3_parse_smtlib_file_bytecode" "camlidl_z3V3_Z3_parse_smtlib_file"
+ (** Create a probe that evaluates to "true" when either of two probes evaluates to "true". *)
+ val or_ : context -> probe -> probe -> probe
-(**
- Summary: Return the number of SMTLIB formulas parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_formulas', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_formulas : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_formulas"
-
-(**
- Summary: \[ [ get_smtlib_formula c i ] \]
- Return the i-th formula parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_formulas c
- def_API('get_smtlib_formula', AST, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_formula : context -> int -> ast
- = "camlidl_z3V3_Z3_get_smtlib_formula"
+ (** Create a probe that evaluates to "true" when another probe does not evaluate to "true". *)
+ val not_ : context -> probe -> probe
+end
-(**
- Summary: Return the number of SMTLIB assumptions parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_assumptions', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_assumptions : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_assumptions"
-
-(**
- Summary: \[ [ get_smtlib_assumption c i ] \]
- Return the i-th assumption parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_assumptions c
- def_API('get_smtlib_assumption', AST, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_assumption : context -> int -> ast
- = "camlidl_z3V3_Z3_get_smtlib_assumption"
+(** Tactics
-(**
- Summary: Return the number of declarations parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_decls', UINT, (_in(CONTEXT), ))
+ Tactics are the basic building block for creating custom solvers for specific problem domains.
+ The complete list of tactics may be obtained using [Context.get_num_tactics]
+ and [Context.get_tactic_names].
+ It may also be obtained using the command [(help-tactics)] in the SMT 2.0 front-end.
*)
-external get_smtlib_num_decls : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_decls"
-
-(**
- Summary: \[ [ get_smtlib_decl c i ] \]
- Return the i-th declaration parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_decls c
- def_API('get_smtlib_decl', FUNC_DECL, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_decl : context -> int -> func_decl
- = "camlidl_z3V3_Z3_get_smtlib_decl"
+module Tactic :
+sig
+ type tactic
-(**
- Summary: Return the number of sorts parsed by {!parse_smtlib_string} or {!parse_smtlib_file}.
- def_API('get_smtlib_num_sorts', UINT, (_in(CONTEXT), ))
-*)
-external get_smtlib_num_sorts : context -> int
- = "camlidl_z3V3_Z3_get_smtlib_num_sorts"
-
-(**
- Summary: \[ [ get_smtlib_sort c i ] \]
- Return the i-th sort parsed by the last call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- - {b Precondition}: i < get_smtlib_num_sorts c
- def_API('get_smtlib_sort', SORT, (_in(CONTEXT), _in(UINT)))
-*)
-external get_smtlib_sort : context -> int -> sort
- = "camlidl_z3V3_Z3_get_smtlib_sort"
+ (** Tactic application results
+
+ ApplyResult objects represent the result of an application of a
+ tactic to a goal. It contains the subgoals that were produced. *)
+ module ApplyResult :
+ sig
+ type apply_result
-(**
- Summary: \[ [ get_smtlib_error c ] \]
- Retrieve that last error message information generated from parsing.
- def_API('get_smtlib_error', STRING, (_in(CONTEXT), ))
-*)
-external get_smtlib_error : context -> string
- = "camlidl_z3V3_Z3_get_smtlib_error"
+ (** The number of Subgoals. *)
+ val get_num_subgoals : apply_result -> int
-(**
- {2 {L Miscellaneous}}
-*)
-(**
- Summary: Return Z3 version number information.
- def_API('get_version', VOID, (_out(UINT), _out(UINT), _out(UINT), _out(UINT)))
-*)
-external get_version : unit -> int * int * int * int
- = "camlidl_z3V3_Z3_get_version"
+ (** Retrieves the subgoals from the apply_result. *)
+ val get_subgoals : apply_result -> Goal.goal list
-(**
- Summary: Enable tracing messages tagged as [tag] when Z3 is compiled in debug mode.
- It is a NOOP otherwise
- def_API('enable_trace', VOID, (_in(STRING),))
-*)
-external enable_trace : string -> unit
- = "camlidl_z3V3_Z3_enable_trace"
+ (** Retrieves a subgoal from the apply_result. *)
+ val get_subgoal : apply_result -> int -> Goal.goal
-(**
- Summary: Disable tracing messages tagged as [tag] when Z3 is compiled in debug mode.
- It is a NOOP otherwise
- def_API('disable_trace', VOID, (_in(STRING),))
-*)
-external disable_trace : string -> unit
- = "camlidl_z3V3_Z3_disable_trace"
-
-(**
- Summary: Reset all allocated resources.
- Use this facility on out-of memory errors.
- It allows discharging the previous state and resuming afresh.
- Any pointers previously returned by the API
- become invalid.
- def_API('reset_memory', VOID, ())
-*)
-external reset_memory : unit -> unit
- = "camlidl_z3V3_Z3_reset_memory"
+ (** Convert a model for a subgoal into a model for the original
+ goal [g], that the ApplyResult was obtained from.
+ #return A model for [g] *)
+ val convert_model : apply_result -> int -> Model.model -> Model.model
-(**
- {2 {L External Theory Plugins}}
-*)
-(**
- Summary: Create an interpreted theory sort.
-*)
-external theory_mk_sort : context -> theory -> symbol -> sort
- = "camlidl_z3V3_Z3_theory_mk_sort"
+ (** A string representation of the ApplyResult. *)
+ val to_string : apply_result -> string
+ end
-(**
- Summary: Create an interpreted theory constant value. Values are assumed to be different from each other.
-*)
-external theory_mk_value : context -> theory -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_theory_mk_value"
+ (** A string containing a description of parameters accepted by the tactic. *)
+ val get_help : tactic -> string
-(**
- Summary: Create an interpreted constant for the given theory.
-*)
-external theory_mk_constant : context -> theory -> symbol -> sort -> ast
- = "camlidl_z3V3_Z3_theory_mk_constant"
+ (** Retrieves parameter descriptions for Tactics. *)
+ val get_param_descrs : tactic -> Params.ParamDescrs.param_descrs
-(**
- Summary: Create an interpreted function declaration for the given theory.
-*)
-external theory_mk_func_decl : context -> theory -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_theory_mk_func_decl"
+ (** Apply the tactic to the goal. *)
+ val apply : tactic -> Goal.goal -> Params.params option -> ApplyResult.apply_result
-(**
- Summary: Return the context where the given theory is installed.
-*)
-external theory_get_context : theory -> context
- = "camlidl_z3V3_Z3_theory_get_context"
-
-(**
- Summary: Assert a theory axiom/lemmas during the search.
- An axiom added at search level [n] will remain in the logical context until
- level [n] is backtracked.
- The callbacks for push ({!set_push_callback}) and pop
- ({!set_pop_callback}) can be used to track when the search
- level is increased (i.e., new case-split) and decreased (i.e.,
- case-split is backtracked).
- Z3 tracks the theory axioms asserted. So, multiple assertions of the same axiom are
- ignored.
-*)
-external theory_assert_axiom : theory -> ast -> unit
- = "camlidl_z3V3_Z3_theory_assert_axiom"
-
-(**
- Summary: Inform to the logical context that [lhs] and [rhs] have the same interpretation
- in the model being built by theory [t]. If lhs = rhs is inconsistent with other theories,
- then the logical context will backtrack.
- For more information, see the paper "Model-Based Theory Combination" in the Z3 website.
-*)
-external theory_assume_eq : theory -> ast -> ast -> unit
- = "camlidl_z3V3_Z3_theory_assume_eq"
-
-(**
- Summary: Enable/disable the simplification of theory axioms asserted using {!theory_assert_axiom}.
- By default, the simplification of theory specific operators is disabled.
- That is, the reduce theory callbacks are not invoked for theory axioms.
- The default behavior is useful when asserting axioms stating properties of theory operators.
-*)
-external theory_enable_axiom_simplification : theory -> bool -> unit
- = "camlidl_z3V3_Z3_theory_enable_axiom_simplification"
+ (** The number of supported tactics. *)
+ val get_num_tactics : context -> int
-(**
- Summary: Return the root of the equivalence class containing [n].
-*)
-external theory_get_eqc_root : theory -> ast -> ast
- = "camlidl_z3V3_Z3_theory_get_eqc_root"
-
-(**
- Summary: Return the next element in the equivalence class containing [n].
- The elements in an equivalence class are organized in a circular list.
- You can traverse the list by calling this function multiple times
- using the result from the previous call. This is illustrated in the
- code snippet below.
- {v
- ast curr = n;
- do
- curr = theory_get_eqc_next(theory, curr);
- while (curr != n);
- v}
-*)
-external theory_get_eqc_next : theory -> ast -> ast
- = "camlidl_z3V3_Z3_theory_get_eqc_next"
+ (** The names of all supported tactics. *)
+ val get_tactic_names : context -> string list
-(**
- Summary: Return the number of parents of [n] that are operators of the given theory.
-*)
-external theory_get_num_parents : theory -> ast -> int
- = "camlidl_z3V3_Z3_theory_get_num_parents"
+ (** Returns a string containing a description of the tactic with the given name. *)
+ val get_tactic_description : context -> string -> string
-(**
- Summary: Return the i-th parent of [n].
- See {!theory_get_num_parents}.
-*)
-external theory_get_parent : theory -> ast -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_parent"
+ (** Creates a new Tactic. *)
+ val mk_tactic : context -> string -> tactic
+
+ (** Create a tactic that applies one tactic to a Goal and
+ then another one to every subgoal produced by the first one. *)
+ val and_then : context -> tactic -> tactic -> tactic list -> tactic
-(**
- Summary: Return [TRUE] if [n] is an interpreted theory value.
-*)
-external theory_is_value : theory -> ast -> bool
- = "camlidl_z3V3_Z3_theory_is_value"
+ (** Create a tactic that first applies one tactic to a Goal and
+ if it fails then returns the result of another tactic applied to the Goal. *)
+ val or_else : context -> tactic -> tactic -> tactic
-(**
- Summary: Return [TRUE] if [d] is an interpreted theory declaration.
-*)
-external theory_is_decl : theory -> func_decl -> bool
- = "camlidl_z3V3_Z3_theory_is_decl"
+ (** Create a tactic that applies one tactic to a goal for some time (in milliseconds).
+
+ If the tactic does not terminate within the timeout, then it fails. *)
+ val try_for : context -> tactic -> int -> tactic
-(**
- Summary: Return the number of expressions of the given theory in
- the logical context. These are the expressions notified using the
- callback {!set_new_elem_callback}.
-*)
-external theory_get_num_elems : theory -> int
- = "camlidl_z3V3_Z3_theory_get_num_elems"
+ (** Create a tactic that applies one tactic to a given goal if the probe
+ evaluates to true.
+
+ If the probe evaluates to false, then the new tactic behaves like the [skip] tactic. *)
+ val when_ : context -> Probe.probe -> tactic -> tactic
-(**
- Summary: Return the i-th elem of the given theory in the logical context.
- - {b See}: {!theory_get_num_elems}
-*)
-external theory_get_elem : theory -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_elem"
+ (** Create a tactic that applies a tactic to a given goal if the probe
+ evaluates to true and another tactic otherwise. *)
+ val cond : context -> Probe.probe -> tactic -> tactic -> tactic
-(**
- Summary: Return the number of theory applications in the logical
- context. These are the expressions notified using the callback
- {!set_new_app_callback}.
-*)
-external theory_get_num_apps : theory -> int
- = "camlidl_z3V3_Z3_theory_get_num_apps"
+ (** Create a tactic that keeps applying one tactic until the goal is not
+ modified anymore or the maximum number of iterations is reached. *)
+ val repeat : context -> tactic -> int -> tactic
-(**
- Summary: Return the i-th application of the given theory in the logical context.
- - {b See}: {!theory_get_num_apps}
-*)
-external theory_get_app : theory -> int -> ast
- = "camlidl_z3V3_Z3_theory_get_app"
+ (** Create a tactic that just returns the given goal. *)
+ val skip : context -> tactic
+
+ (** Create a tactic always fails. *)
+ val fail : context -> tactic
+
+ (** Create a tactic that fails if the probe evaluates to false. *)
+ val fail_if : context -> Probe.probe -> tactic
+
+ (** Create a tactic that fails if the goal is not triviall satisfiable (i.e., empty)
+ or trivially unsatisfiable (i.e., contains `false'). *)
+ val fail_if_not_decided : context -> tactic
+
+ (** Create a tactic that applies a tactic using the given set of parameters. *)
+ val using_params : context -> tactic -> Params.params -> tactic
+
+ (** Create a tactic that applies a tactic using the given set of parameters.
+ Alias for [UsingParams]*)
+ val with_ : context -> tactic -> Params.params -> tactic
+
+ (** Create a tactic that applies the given tactics in parallel. *)
+ val par_or : context -> tactic list -> tactic
+
+ (** Create a tactic that applies a tactic to a given goal and then another tactic
+ to every subgoal produced by the first one. The subgoals are processed in parallel. *)
+ val par_and_then : context -> tactic -> tactic -> tactic
+
+ (** Interrupt the execution of a Z3 procedure.
+ This procedure can be used to interrupt: solvers, simplifiers and tactics. *)
+ val interrupt : context -> unit
+end
+
+(** Solvers *)
+module Solver :
+sig
+ type solver
+ type status = UNSATISFIABLE | UNKNOWN | SATISFIABLE
+
+ val string_of_status : status -> string
+
+ (** Objects that track statistical information about solvers. *)
+ module Statistics :
+ sig
+ type statistics
+
+ (** Statistical data is organized into pairs of \[Key, Entry\], where every
+ Entry is either a floating point or integer value.
+ *)
+ module Entry :
+ sig
+ type statistics_entry
+
+ (** The key of the entry. *)
+ val get_key : statistics_entry -> string
+
+ (** The int-value of the entry. *)
+ val get_int : statistics_entry -> int
+
+ (** The float-value of the entry. *)
+ val get_float : statistics_entry -> float
+
+ (** True if the entry is uint-valued. *)
+ val is_int : statistics_entry -> bool
+
+ (** True if the entry is float-valued. *)
+ val is_float : statistics_entry -> bool
+
+ (** The string representation of the the entry's value. *)
+ val to_string_value : statistics_entry -> string
+
+ (** The string representation of the entry (key and value) *)
+ val to_string : statistics_entry -> string
+ end
+
+ (** A string representation of the statistical data. *)
+ val to_string : statistics -> string
+
+ (** The number of statistical data. *)
+ val get_size : statistics -> int
+
+ (** The data entries. *)
+ val get_entries : statistics -> Entry.statistics_entry list
+
+ (** The statistical counters. *)
+ val get_keys : statistics -> string list
+
+ (** The value of a particular statistical counter. *)
+ val get : statistics -> string -> Entry.statistics_entry option
+ end
+
+ (** A string that describes all available solver parameters. *)
+ val get_help : solver -> string
+
+ (** Sets the solver parameters. *)
+ val set_parameters : solver -> Params.params -> unit
+
+ (** Retrieves parameter descriptions for solver. *)
+ val get_param_descrs : solver -> Params.ParamDescrs.param_descrs
+
+ (** The current number of backtracking points (scopes).
+ {!pop}
+ {!push} *)
+ val get_num_scopes : solver -> int
+
+ (** Creates a backtracking point.
+ {!pop} *)
+ val push : solver -> unit
+
+ (** Backtracks a number of backtracking points.
+ Note that an exception is thrown if the integer is not smaller than {!get_num_scopes}
+ {!push} *)
+ val pop : solver -> int -> unit
+
+ (** Resets the Solver.
+ This removes all assertions from the solver. *)
+ val reset : solver -> unit
+
+ (** Assert a constraint (or multiple) into the solver. *)
+ val add : solver -> Expr.expr list -> unit
+
+ (** * Assert multiple constraints (cs) into the solver, and track them (in the
+ * unsat) core
+ * using the Boolean constants in ps.
+ *
+ * This API is an alternative to {!check} with assumptions for
+ * extracting unsat cores.
+ * Both APIs can be used in the same solver. The unsat core will contain a
+ * combination
+ * of the Boolean variables provided using {!assert_and_track}
+ * and the Boolean literals
+ * provided using {!check} with assumptions. *)
+ val assert_and_track_l : solver -> Expr.expr list -> Expr.expr list -> unit
+
+ (** * Assert a constraint (c) into the solver, and track it (in the unsat) core
+ * using the Boolean constant p.
+ *
+ * This API is an alternative to {!check} with assumptions for
+ * extracting unsat cores.
+ * Both APIs can be used in the same solver. The unsat core will contain a
+ * combination
+ * of the Boolean variables provided using {!assert_and_track}
+ * and the Boolean literals
+ * provided using {!check} with assumptions. *)
+ val assert_and_track : solver -> Expr.expr -> Expr.expr -> unit
+
+ (** The number of assertions in the solver. *)
+ val get_num_assertions : solver -> int
+
+ (** The set of asserted formulas. *)
+ val get_assertions : solver -> Expr.expr list
+
+ (** Checks whether the assertions in the solver are consistent or not.
+
+ {!Model}
+ {!get_unsat_core}
+ {!Proof} *)
+ val check : solver -> Expr.expr list -> status
+
+ (** The model of the last [Check].
+
+ The result is [None] if [Check] was not invoked before,
+ if its results was not [SATISFIABLE], or if model production is not enabled. *)
+ val get_model : solver -> Model.model option
+
+ (** The proof of the last [Check].
+
+ The result is [null] if [Check] was not invoked before,
+ if its results was not [UNSATISFIABLE], or if proof production is disabled. *)
+ val get_proof : solver -> Expr.expr option
+
+ (** The unsat core of the last [Check].
+
+ The unsat core is a subset of [Assertions]
+ The result is empty if [Check] was not invoked before,
+ if its results was not [UNSATISFIABLE], or if core production is disabled. *)
+ val get_unsat_core : solver -> AST.ast list
+
+ (** A brief justification of why the last call to [Check] returned [UNKNOWN]. *)
+ val get_reason_unknown : solver -> string
+
+ (** Solver statistics. *)
+ val get_statistics : solver -> Statistics.statistics
+
+ (** Creates a new (incremental) solver.
+
+ This solver also uses a set of builtin tactics for handling the first
+ check-sat command, and check-sat commands that take more than a given
+ number of milliseconds to be solved. *)
+ val mk_solver : context -> Symbol.symbol option -> solver
+
+ (** Creates a new (incremental) solver.
+ {!mk_solver} *)
+ val mk_solver_s : context -> string -> solver
+
+ (** Creates a new (incremental) solver. *)
+ val mk_simple_solver : context -> solver
+
+ (** Creates a solver that is implemented using the given tactic.
+
+ The solver supports the commands [Push] and [Pop], but it
+ will always solve each check from scratch. *)
+ val mk_solver_t : context -> Tactic.tactic -> solver
+
+ (** A string representation of the solver. *)
+ val to_string : solver -> string
+end
+
+(** Fixedpoint solving *)
+module Fixedpoint :
+sig
+ type fixedpoint
+
+ (** A string that describes all available fixedpoint solver parameters. *)
+ val get_help : fixedpoint -> string
+
+ (** Sets the fixedpoint solver parameters. *)
+ val set_params : fixedpoint -> Params.params -> unit
+
+ (** Retrieves parameter descriptions for Fixedpoint solver. *)
+ val get_param_descrs : fixedpoint -> Params.ParamDescrs.param_descrs
+
+ (** Assert a constraints into the fixedpoint solver. *)
+ val add : fixedpoint -> Expr.expr list -> unit
+
+ (** Register predicate as recursive relation. *)
+ val register_relation : fixedpoint -> FuncDecl.func_decl -> unit
+
+ (** Add rule into the fixedpoint solver. *)
+ val add_rule : fixedpoint -> Expr.expr -> Symbol.symbol option -> unit
+
+ (** Add table fact to the fixedpoint solver. *)
+ val add_fact : fixedpoint -> FuncDecl.func_decl -> int list -> unit
+
+ (** Query the fixedpoint solver.
+ A query is a conjunction of constraints. The constraints may include the recursively defined relations.
+ The query is satisfiable if there is an instance of the query variables and a derivation for it.
+ The query is unsatisfiable if there are no derivations satisfying the query variables. *)
+ val query : fixedpoint -> Expr.expr -> Solver.status
-(**
- {2 {L Deprecated Injective functions API}}
-*)
-(**
- Summary: Create injective function declaration
- @deprecated This method just asserts a (universally quantified) formula that asserts that
- the new function is injective. It is compatible with the old interface for solving:
- {!assert_cnstr}, {!check_assumptions}, etc.
- def_API('mk_injective_function', FUNC_DECL, (_in(CONTEXT), _in(SYMBOL), _in(UINT), _in_array(2, SORT), _in(SORT)))
-*)
-external mk_injective_function : context -> symbol -> sort array -> sort -> func_decl
- = "camlidl_z3V3_Z3_mk_injective_function"
+ (** Query the fixedpoint solver.
+ A query is an array of relations.
+ The query is satisfiable if there is an instance of some relation that is non-empty.
+ The query is unsatisfiable if there are no derivations satisfying any of the relations. *)
+ val query_r : fixedpoint -> FuncDecl.func_decl list -> Solver.status
-(**
- {2 {L Deprecated Constraints API}}
-*)
-(**
- Summary: Set the SMTLIB logic to be used in the given logical context.
- It is incorrect to invoke this function after invoking
- {!check}, {!check_and_get_model}, {!check_assumptions} and {!push}.
- Return [TRUE] if the logic was changed successfully, and [FALSE] otherwise.
- @deprecated Subsumed by {!mk_solver_for_logic}
- def_API('set_logic', VOID, (_in(CONTEXT), _in(STRING)))
-*)
-external set_logic : context -> string -> bool
- = "camlidl_z3V3_Z3_set_logic"
-
-(**
- Summary: Create a backtracking point.
- The logical context can be viewed as a stack of contexts. The
- scope level is the number of elements on this stack. The stack
- of contexts is simulated using trail (undo) stacks.
- - {b See also}: {!pop}
- @deprecated Subsumed by {!solver_push}
- def_API('push', VOID, (_in(CONTEXT),))
-*)
-external push : context -> unit
- = "camlidl_z3V3_Z3_push"
-
-(**
- Summary: Backtrack.
- Restores the context from the top of the stack, and pops it off the
- stack. Any changes to the logical context (by {!assert_cnstr} or
- other functions) between the matching {!push} and [pop]
- operators are flushed, and the context is completely restored to
- what it was right before the {!push}.
- - {b See also}: {!push}
- @deprecated Subsumed by {!solver_pop}
- def_API('pop', VOID, (_in(CONTEXT), _in(UINT)))
-*)
-external pop : context -> int -> unit
- = "camlidl_z3V3_Z3_pop"
-
-(**
- Summary: Retrieve the current scope level.
- It retrieves the number of scopes that have been pushed, but not yet popped.
- - {b See also}: {!push}
- - {b See also}: {!pop}
- @deprecated Subsumed by {!solver_get_num_scopes}.
- def_API('get_num_scopes', UINT, (_in(CONTEXT),))
-*)
-external get_num_scopes : context -> int
- = "camlidl_z3V3_Z3_get_num_scopes"
+ (** Creates a backtracking point.
+ {!pop} *)
+ val push : fixedpoint -> unit
-(**
- @deprecated This function has no effect.
- def_API('persist_ast', VOID, (_in(CONTEXT), _in(AST), _in(UINT)))
-*)
-external persist_ast : context -> ast -> int -> unit
- = "camlidl_z3V3_Z3_persist_ast"
-
-(**
- Summary: Assert a constraint into the logical context.
- After one assertion, the logical context may become
- inconsistent.
- The functions {!check} or {!check_and_get_model} should be
- used to check whether the logical context is consistent or not.
- - {b See also}: {!check}
- - {b See also}: {!check_and_get_model}
- @deprecated Subsumed by {!solver_assert}
- def_API('assert_cnstr', VOID, (_in(CONTEXT), _in(AST)))
-*)
-external assert_cnstr : context -> ast -> unit
- = "camlidl_z3V3_Z3_assert_cnstr"
-
-(**
- Summary: Check whether the given logical context is consistent or not.
- If the logical context is not unsatisfiable (i.e., the return value is different from [L_FALSE)]
- and model construction is enabled (see {!mk_config}),
- then a valid model is returned. Otherwise, it is unsafe to use the returned model.
- - {b Remarks}: Model construction must be enabled using configuration
- parameters (See, {!mk_config}).
- - {b See also}: {!check}
- @deprecated Subsumed by {!solver_check}
- def_API('check_and_get_model', INT, (_in(CONTEXT), _out(MODEL)))
-*)
-external check_and_get_model : context -> lbool * model
- = "camlidl_z3V3_Z3_check_and_get_model"
-
-(**
- Summary: Check whether the given logical context is consistent or not.
- The function {!check_and_get_model} should be used when models are needed.
- - {b See also}: {!check_and_get_model}
- @deprecated Subsumed by {!solver_check}
- def_API('check', INT, (_in(CONTEXT),))
-*)
-external check : context -> lbool
- = "camlidl_z3V3_Z3_check"
-
-(**
- Summary: Check whether the given logical context and optional assumptions is consistent or not.
- If the logical context is not unsatisfiable (i.e., the return value is different from [L_FALSE)],
- and model construction is enabled (see {!mk_config}),
- then a valid model is returned. Otherwise, it is unsafe to use the returned model.
- @param c logical context.
- @param num_assumptions number of auxiliary assumptions.
- @param assumptions array of auxiliary assumptions
- @param m optional pointer to a model.
- @param proof optional pointer to a proof term.
- @param core_size size of unsatisfiable core.
- @param core pointer to an array receiving unsatisfiable core.
- The unsatisfiable core is a subset of the assumptions, so the array has the same size as the assumptions.
- The [core] array is not populated if [core_size] is set to 0.
- - {b Precondition}: assumptions comprises of propositional literals.
- In other words, you cannot use compound formulas for assumptions,
- but should use propositional variables or negations of propositional variables.
- - {b See also}: {!check}
- @deprecated Subsumed by {!solver_check_assumptions}
- def_API('check_assumptions', INT, (_in(CONTEXT), _in(UINT), _in_array(1, AST), _out(MODEL), _out(AST), _out(UINT), _out_array2(1, 5, AST)))
-*)
-external check_assumptions : context -> ast array -> int -> ast array -> lbool * model * ast * int * ast array
- = "camlidl_z3V3_Z3_check_assumptions"
-
-(**
- Summary: Delete a model object.
- - {b See also}: {!check_and_get_model}
- @deprecated Subsumed by solver API
- def_API('del_model', VOID, (_in(CONTEXT), _in(MODEL)))
-*)
-external del_model : context -> model -> unit
- = "camlidl_z3V3_Z3_del_model"
+ (** Backtrack one backtracking point.
-(**
- {2 {L Deprecated Search control API}}
-*)
-(**
- Summary: Cancel an ongoing check.
- Notifies the current check to abort and return.
- This method should be called from a different thread
- than the one performing the check.
- @deprecated Use {!interrupt} instead.
- def_API('soft_check_cancel', VOID, (_in(CONTEXT), ))
-*)
-external soft_check_cancel : context -> unit
- = "camlidl_z3V3_Z3_soft_check_cancel"
-
-(**
- Summary: Retrieve reason for search failure.
- If a call to {!check} or {!check_and_get_model} returns L_UNDEF,
- use this facility to determine the more detailed cause of search failure.
- @deprecated Subsumed by {!solver_get_reason_unknown}
- def_API('get_search_failure', UINT, (_in(CONTEXT), ))
-*)
-external get_search_failure : context -> search_failure
- = "camlidl_z3V3_Z3_get_search_failure"
+ Note that an exception is thrown if Pop is called without a corresponding [Push]
+ {!push} *)
+ val pop : fixedpoint -> unit
-(**
- {2 {L Deprecated Labels API}}
-*)
-(**
- Summary: Create a labeled formula.
- @param c logical context.
- @param s name of the label.
- @param is_pos label polarity.
- @param f formula being labeled.
- A label behaves as an identity function, so the truth value of the
- labeled formula is unchanged. Labels are used for identifying
- useful sub-formulas when generating counter-examples.
- @deprecated Labels are only supported by the old Solver API.
- This feature is not essential (it can be simulated using auxiliary Boolean variables).
- It is only available for backward compatibility.
- def_API('mk_label', AST, (_in(CONTEXT), _in(SYMBOL), _in(BOOL), _in(AST)))
-*)
-external mk_label : context -> symbol -> bool -> ast -> ast
- = "camlidl_z3V3_Z3_mk_label"
-
-(**
- Summary: Retrieve the set of labels that were relevant in
- the context of the current satisfied context.
- - {b See also}: {!del_literals}
- - {b See also}: {!get_num_literals}
- - {b See also}: {!get_label_symbol}
- - {b See also}: {!get_literal}
- @deprecated This procedure is based on the old Solver API.
- def_API('get_relevant_labels', LITERALS, (_in(CONTEXT), ))
-*)
-external get_relevant_labels : context -> literals
- = "camlidl_z3V3_Z3_get_relevant_labels"
-
-(**
- Summary: Retrieve the set of literals that satisfy the current context.
- - {b See also}: {!del_literals}
- - {b See also}: {!get_num_literals}
- - {b See also}: {!get_label_symbol}
- - {b See also}: {!get_literal}
- @deprecated This procedure is based on the old Solver API.
- def_API('get_relevant_literals', LITERALS, (_in(CONTEXT), ))
-*)
-external get_relevant_literals : context -> literals
- = "camlidl_z3V3_Z3_get_relevant_literals"
-
-(**
- Summary: Retrieve the set of literals that whose assignment were
- guess, but not propagated during the search.
- - {b See also}: {!del_literals}
- - {b See also}: {!get_num_literals}
- - {b See also}: {!get_label_symbol}
- - {b See also}: {!get_literal}
- @deprecated This procedure is based on the old Solver API.
- def_API('get_guessed_literals', LITERALS, (_in(CONTEXT), ))
-*)
-external get_guessed_literals : context -> literals
- = "camlidl_z3V3_Z3_get_guessed_literals"
-
-(**
- Summary: Delete a labels context.
- - {b See also}: {!get_relevant_labels}
- @deprecated This procedure is based on the old Solver API.
- def_API('del_literals', VOID, (_in(CONTEXT), _in(LITERALS)))
-*)
-external del_literals : context -> literals -> unit
- = "camlidl_z3V3_Z3_del_literals"
-
-(**
- Summary: Retrieve the number of label symbols that were returned.
- - {b See also}: {!get_relevant_labels}
- @deprecated This procedure is based on the old Solver API.
- def_API('get_num_literals', UINT, (_in(CONTEXT), _in(LITERALS)))
-*)
-external get_num_literals : context -> literals -> int
- = "camlidl_z3V3_Z3_get_num_literals"
+ (** Update named rule into in the fixedpoint solver. *)
+ val update_rule : fixedpoint -> Expr.expr -> Symbol.symbol -> unit
-(**
- Summary: Retrieve label symbol at idx.
- @deprecated This procedure is based on the old Solver API.
- def_API('get_label_symbol', SYMBOL, (_in(CONTEXT), _in(LITERALS), _in(UINT)))
-*)
-external get_label_symbol : context -> literals -> int -> symbol
- = "camlidl_z3V3_Z3_get_label_symbol"
+ (** Retrieve satisfying instance or instances of solver,
+ or definitions for the recursive predicates that show unsatisfiability. *)
+ val get_answer : fixedpoint -> Expr.expr option
-(**
- Summary: Retrieve literal expression at idx.
- @deprecated This procedure is based on the old Solver API.
- def_API('get_literal', AST, (_in(CONTEXT), _in(LITERALS), _in(UINT)))
-*)
-external get_literal : context -> literals -> int -> ast
- = "camlidl_z3V3_Z3_get_literal"
-
-(**
- Summary: Disable label.
- The disabled label is not going to be used when blocking the subsequent search.
- - {b See also}: {!block_literals}
- @deprecated This procedure is based on the old Solver API.
- def_API('disable_literal', VOID, (_in(CONTEXT), _in(LITERALS), _in(UINT)))
-*)
-external disable_literal : context -> literals -> int -> unit
- = "camlidl_z3V3_Z3_disable_literal"
+ (** Retrieve explanation why fixedpoint engine returned status Unknown. *)
+ val get_reason_unknown : fixedpoint -> string
-(**
- Summary: Block subsequent checks using the remaining enabled labels.
- @deprecated This procedure is based on the old Solver API.
- def_API('block_literals', VOID, (_in(CONTEXT), _in(LITERALS)))
-*)
-external block_literals : context -> literals -> unit
- = "camlidl_z3V3_Z3_block_literals"
+ (** Retrieve the number of levels explored for a given predicate. *)
+ val get_num_levels : fixedpoint -> FuncDecl.func_decl -> int
-(**
- {2 {L Deprecated Model API}}
-*)
-(**
- Summary: Return the number of constants assigned by the given model.
- - {b Remarks}: Consider using {!get_model_constants}.
- - {b See also}: {!get_model_constant}
- @deprecated use {!model_get_num_consts}
- def_API('get_model_num_constants', UINT, (_in(CONTEXT), _in(MODEL)))
-*)
-external get_model_num_constants : context -> model -> int
- = "camlidl_z3V3_Z3_get_model_num_constants"
-
-(**
- Summary: \[ [ get_model_constant c m i ] \]
- Return the i-th constant in the given model.
- - {b Remarks}: Consider using {!get_model_constants}.
- - {b Precondition}: i < get_model_num_constants c m
- @deprecated use {!model_get_const_decl}
- def_API('get_model_constant', FUNC_DECL, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external get_model_constant : context -> model -> int -> func_decl
- = "camlidl_z3V3_Z3_get_model_constant"
-
-(**
- Summary: Return the number of function interpretations in the given model.
- A function interpretation is represented as a finite map and an 'else' value.
- Each entry in the finite map represents the value of a function given a set of arguments.
- @deprecated use {!model_get_num_funcs}
- def_API('get_model_num_funcs', UINT, (_in(CONTEXT), _in(MODEL)))
-*)
-external get_model_num_funcs : context -> model -> int
- = "camlidl_z3V3_Z3_get_model_num_funcs"
-
-(**
- Summary: \[ [ get_model_func_decl c m i ] \]
- Return the declaration of the i-th function in the given model.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b See also}: {!get_model_num_funcs}
- @deprecated use {!model_get_func_decl}
- def_API('get_model_func_decl', FUNC_DECL, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external get_model_func_decl : context -> model -> int -> func_decl
- = "camlidl_z3V3_Z3_get_model_func_decl"
-
-(**
- Summary: Return the value of the given constant or function
- in the given model.
- @deprecated Consider using {!model_eval} or {!model_get_func_interp}
- def_API('eval_func_decl', BOOL, (_in(CONTEXT), _in(MODEL), _in(FUNC_DECL), _out(AST)))
-*)
-external eval_func_decl : context -> model -> func_decl -> bool * ast
- = "camlidl_z3V3_Z3_eval_func_decl"
-
-(**
- Summary: \[ [ is_array_value c v ] \]
- Determine whether the term encodes an array value.
- A term encodes an array value if it is a nested sequence of
- applications of store on top of a constant array.
- The indices to the stores have to be values (for example, integer constants)
- so that equality between the indices can be evaluated.
- Array values are useful for representing interpretations for arrays.
- Return the number of entries mapping to non-default values of the array.
- @deprecated Use {!is_as_array}
- def_API('is_array_value', BOOL, (_in(CONTEXT), _in(MODEL), _in(AST), _out(UINT)))
-*)
-external is_array_value : context -> model -> ast -> bool * int
- = "camlidl_z3V3_Z3_is_array_value"
-
-(**
- Summary: \[ [ get_array_value c v ] \]
- An array values is represented as a dictionary plus a
- default (else) value. This function returns the array graph.
- - {b Precondition}: TRUE == is_array_value c v &num_entries
- @deprecated Use func_interp objects and {!get_as_array_func_decl}
- def_API('get_array_value', VOID, (_in(CONTEXT), _in(MODEL), _in(AST), _in(UINT), _out_array(3, AST), _out_array(3, AST), _out (AST)))
-*)
-external get_array_value : context -> model -> ast -> ast array -> ast array -> ast array * ast array * ast
- = "camlidl_z3V3_Z3_get_array_value"
-
-(**
- Summary: \[ [ get_model_func_else c m i ] \]
- Return the 'else' value of the i-th function interpretation in the given model.
- A function interpretation is represented as a finite map and an 'else' value.
- - {b Remarks}: Consider using {!get_model_funcs}.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_num_entries}
- - {b See also}: {!get_model_func_entry_num_args}
- - {b See also}: {!get_model_func_entry_arg}
- @deprecated Use func_interp objects
- def_API('get_model_func_else', AST, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external get_model_func_else : context -> model -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_else"
-
-(**
- Summary: \[ [ get_model_func_num_entries c m i ] \]
- Return the number of entries of the i-th function interpretation in the given model.
- A function interpretation is represented as a finite map and an 'else' value.
- - {b Remarks}: Consider using {!get_model_funcs}.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_else}
- - {b See also}: {!get_model_func_entry_num_args}
- - {b See also}: {!get_model_func_entry_arg}
- @deprecated Use func_interp objects
- def_API('get_model_func_num_entries', UINT, (_in(CONTEXT), _in(MODEL), _in(UINT)))
-*)
-external get_model_func_num_entries : context -> model -> int -> int
- = "camlidl_z3V3_Z3_get_model_func_num_entries"
-
-(**
- Summary: \[ [ get_model_func_entry_num_args c m i j ] \]
- Return the number of arguments of the j-th entry of the i-th function interpretation in the given
- model.
- A function interpretation is represented as a finite map and an 'else' value.
- This function returns the j-th entry of this map.
- An entry represents the value of a function given a set of arguments.
- - {b Remarks}: Consider using {!get_model_funcs}.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b Precondition}: j < get_model_func_num_entries c m i
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_num_entries }
- - {b See also}: {!get_model_func_entry_arg}
- @deprecated Use func_interp objects
- def_API('get_model_func_entry_num_args', UINT, (_in(CONTEXT), _in(MODEL), _in(UINT), _in(UINT)))
-*)
-external get_model_func_entry_num_args : context -> model -> int -> int -> int
- = "camlidl_z3V3_Z3_get_model_func_entry_num_args"
-
-(**
- Summary: \[ [ get_model_func_entry_arg c m i j k ] \]
- Return the k-th argument of the j-th entry of the i-th function interpretation in the given
- model.
- A function interpretation is represented as a finite map and an 'else' value.
- This function returns the j-th entry of this map.
- An entry represents the value of a function given a set of arguments.
- - {b Remarks}: Consider using {!get_model_funcs}.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b Precondition}: j < get_model_func_num_entries c m i
- - {b Precondition}: k < get_model_func_entry_num_args c m i j
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_num_entries }
- - {b See also}: {!get_model_func_entry_num_args}
- @deprecated Use func_interp objects
- def_API('get_model_func_entry_arg', AST, (_in(CONTEXT), _in(MODEL), _in(UINT), _in(UINT), _in(UINT)))
-*)
-external get_model_func_entry_arg : context -> model -> int -> int -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_entry_arg"
-
-(**
- Summary: \[ [ get_model_func_entry_value c m i j ] \]
- Return the return value of the j-th entry of the i-th function interpretation in the given
- model.
- A function interpretation is represented as a finite map and an 'else' value.
- This function returns the j-th entry of this map.
- An entry represents the value of a function given a set of arguments.
- - {b Remarks}: Consider using {!get_model_funcs}.
- - {b Precondition}: i < get_model_num_funcs c m
- - {b Precondition}: j < get_model_func_num_entries c m i
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_num_entries }
- @deprecated Use func_interp objects
- def_API('get_model_func_entry_value', AST, (_in(CONTEXT), _in(MODEL), _in(UINT), _in(UINT)))
-*)
-external get_model_func_entry_value : context -> model -> int -> int -> ast
- = "camlidl_z3V3_Z3_get_model_func_entry_value"
-
-(**
- Summary: \[ [ eval c m t ] \]
- Evaluate the AST node [t] in the given model.
- Return a pair: Boolean and value. The Boolean is true if the term was successfully evaluated.
- The evaluation may fail for the following reasons:
- - [t] contains a quantifier.
- - the model [m] is partial, that is, it doesn't have a complete interpretation for uninterpreted functions.
- That is, the option {e MODEL_PARTIAL=true } was used.
- - [t] is type incorrect.
- @deprecated Use {!model_eval}
- def_API('eval', BOOL, (_in(CONTEXT), _in(MODEL), _in(AST), _out(AST)))
-*)
-external eval : context -> model -> ast -> bool * ast
- = "camlidl_z3V3_Z3_eval"
-
-(**
- Summary: Evaluate declaration given values.
- Provides direct way to evaluate declarations
- without going over terms.
- @deprecated Consider using {!model_eval} and {!substitute_vars}
- def_API('eval_decl', BOOL, (_in(CONTEXT), _in(MODEL), _in(FUNC_DECL), _in(UINT), _in_array(3, AST), _out(AST)))
-*)
-external eval_decl : context -> model -> func_decl -> ast array -> bool * ast
- = "camlidl_z3V3_Z3_eval_decl"
+ (** Retrieve the cover of a predicate. *)
+ val get_cover_delta : fixedpoint -> int -> FuncDecl.func_decl -> Expr.expr option
-(**
- {2 {L Deprecated String conversion API}}
-*)
-(**
- Summary: Convert the given logical context into a string.
- This function is mainly used for debugging purposes. It displays
- the internal structure of a logical context.
- @deprecated This method is obsolete. It just displays the internal representation of
- the global solver available for backward compatibility reasons.
- def_API('context_to_string', STRING, (_in(CONTEXT),))
-*)
-external context_to_string : context -> string
- = "camlidl_z3V3_Z3_context_to_string"
-
-(**
- Summary: Return runtime statistics as a string.
- This function is mainly used for debugging purposes. It displays
- statistics of the search activity.
- @deprecated This method is based on the old solver API.
- Use {!stats_to_string} when using the new solver API.
- def_API('statistics_to_string', STRING, (_in(CONTEXT),))
-*)
-external statistics_to_string : context -> string
- = "camlidl_z3V3_Z3_statistics_to_string"
-
-(**
- Summary: Extract satisfying assignment from context as a conjunction.
- This function can be used for debugging purposes. It returns a conjunction
- of formulas that are assigned to true in the current context.
- This conjunction will contain not only the assertions that are set to true
- under the current assignment, but will also include additional literals
- if there has been a call to {!check} or {!check_and_get_model}.
- @deprecated This method is based on the old solver API.
- def_API('get_context_assignment', AST, (_in(CONTEXT),))
-*)
-external get_context_assignment : context -> ast
- = "camlidl_z3V3_Z3_get_context_assignment"
+ (** Add property about the predicate.
+ The property is added at level. *)
+ val add_cover : fixedpoint -> int -> FuncDecl.func_decl -> Expr.expr -> unit
+ (** Retrieve internal string representation of fixedpoint object. *)
+ val to_string : fixedpoint -> string
-(** {2 {L ML Extensions}} *)
-(**
- \[ [ mk_context_x configs] \] is a shorthand for the context with configurations in [configs].
-*)
-val mk_context_x: (string * string) array -> context;;
-(**
- \[ [ get_app_args c a ] \] is the array of arguments of an application. If [t] is a constant, then the array is empty.
- - {b See also}: {!get_app_num_args}
- - {b See also}: {!get_app_arg}
-*)
-val get_app_args: context -> app -> ast array
-(**
- \[ [ get_app_args c d ] \] is the array of parameters of [d].
- - {b See also}: {!get_domain_size}
- - {b See also}: {!get_domain}
-*)
-val get_domains: context -> func_decl -> sort array
-(**
- \[ [ get_array_sort c t ] \] is the domain and the range of [t].
- - {b See also}: {!get_array_sort_domain}
- - {b See also}: {!get_array_sort_range}
-*)
-val get_array_sort: context -> sort -> sort * sort
-(**
- \[ [ get_tuple_sort c ty ] \] is the pair [(mk_decl, fields)] where [mk_decl] is the constructor declaration of [ty], and [fields] is the array of fields in [ty].
- - {b See also}: {!get_tuple_sort_mk_decl}
- - {b See also}: {!get_tuple_sort_num_fields}
- - {b See also}: {!get_tuple_sort_field_decl}
-*)
-val get_tuple_sort: context -> sort -> (func_decl * func_decl array)
-(**
- \[ [ datatype_constructor_refined ] \] is the refinement of a datatype constructor.
- It contains the constructor declaration, recognizer, and list of accessor functions.
-*)
-type datatype_constructor_refined = {
- constructor : func_decl;
- recognizer : func_decl;
- accessors : func_decl array
-}
-(**
- \[ [ get_datatype_sort c ty ] \] is the array of triples [(constructor, recognizer, fields)] where [constructor] is the constructor declaration of [ty], [recognizer] is the recognizer for the [constructor], and [fields] is the array of fields in [ty].
- - {b See also}: {!get_datatype_sort_num_constructors}
- - {b See also}: {!get_datatype_sort_constructor}
- - {b See also}: {!get_datatype_sort_recognizer}
- - {b See also}: {!get_datatype_sort_constructor_accessor}
-*)
-val get_datatype_sort: context -> sort -> datatype_constructor_refined array
-(**
- \[ [ get_model_constants c m ] \] is the array of constants in the model [m].
- - {b See also}: {!get_model_num_constants}
- - {b See also}: {!get_model_constant}
-*)
-val get_model_constants: context -> model -> func_decl array
-(**
- \[ [ get_model_func_entry c m i j ] \] is the [j]'th entry in the [i]'th function in the model [m].
- - {b See also}: {!get_model_func_entry_num_args}
- - {b See also}: {!get_model_func_entry_arg}
- - {b See also}: {!get_model_func_entry_value}
-*)
-val get_model_func_entry: context -> model -> int -> int -> (ast array * ast);;
-(**
- \[ [ get_model_func_entries c m i ] \] is the array of entries in the [i]'th function in the model [m].
- - {b See also}: {!get_model_func_num_entries}
- - {b See also}: {!get_model_func_entry}
-*)
-val get_model_func_entries: context -> model -> int -> (ast array * ast) array;;
-(**
- \[ [ get_model_funcs c m ] \] is the array of functions in the model [m]. Each function is represented by the triple [(decl, entries, else)], where [decl] is the declaration name for the function, [entries] is the array of entries in the function, and [else] is the default (else) value for the function.
- - {b See also}: {!get_model_num_funcs}
- - {b See also}: {!get_model_func_decl}
- - {b See also}: {!get_model_func_entries}
- - {b See also}: {!get_model_func_else}
-*)
-val get_model_funcs: context -> model ->
- (symbol *
- (ast array * ast) array *
- ast) array
-(**
- \[ [ get_smtlib_formulas c ] \] is the array of formulas created by a preceding call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- Recommend use {!parse_smtlib_string_x} or {!parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_string_x}
- - {b See also}: {!parse_smtlib_file_x}
- - {b See also}: {!parse_smtlib_string}
- - {b See also}: {!parse_smtlib_file}
- - {b See also}: {!get_smtlib_num_formulas}
- - {b See also}: {!get_smtlib_formula}
-*)
-val get_smtlib_formulas: context -> ast array
-(**
- \[ [get_smtlib_assumptions c] \] is the array of assumptions created by a preceding call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- Recommend use {!parse_smtlib_string_x} or {!parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_string_x}
- - {b See also}: {!parse_smtlib_file_x}
- - {b See also}: {!parse_smtlib_string}
- - {b See also}: {!parse_smtlib_file}
- - {b See also}: {!get_smtlib_num_assumptions}
- - {b See also}: {!get_smtlib_assumption}
-*)
-val get_smtlib_assumptions: context -> ast array
-(**
- \[ [ get_smtlib_decls c ] \] is the array of declarations created by a preceding call to {!parse_smtlib_string} or {!parse_smtlib_file}.
- Recommend use {!parse_smtlib_string_x} or {!parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_string_x}
- - {b See also}: {!parse_smtlib_file_x}
- - {b See also}: {!parse_smtlib_string}
- - {b See also}: {!parse_smtlib_file}
- - {b See also}: {!get_smtlib_num_decls}
- - {b See also}: {!get_smtlib_decl}
-*)
-val get_smtlib_decls: context -> func_decl array
-(**
- \[ [ get_smtlib_parse_results c ] \] is the triple [(get_smtlib_formulas c, get_smtlib_assumptions c, get_smtlib_decls c)].
- Recommend use {!parse_smtlib_string_x} or {!parse_smtlib_file_x} for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_string_x}
- - {b See also}: {!parse_smtlib_file_x}
- - {b See also}: {!parse_smtlib_string}
- - {b See also}: {!parse_smtlib_file}
- - {b See also}: {!get_smtlib_formulas}
- - {b See also}: {!get_smtlib_assumptions}
- - {b See also}: {!get_smtlib_decls}
-*)
-val get_smtlib_parse_results: context -> (ast array * ast array * func_decl array)
-(**
- \[ [ parse_smtlib_string_formula c ... ] \] calls [(parse_smtlib_string c ...)] and returns the single formula produced.
- Recommended for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_file_formula}
- - {b See also}: {!parse_smtlib_string_x}
-*)
-val parse_smtlib_string_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-(**
- \[ [ parse_smtlib_file_formula c ... ] \] calls [(parse_smtlib_file c ...)] and returns the single formula produced.
- Recommended for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_file_formula}
- - {b See also}: {!parse_smtlib_file_x}
-*)
-val parse_smtlib_file_formula: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> ast
-(**
- \[ [ parse_smtlib_string_x c ... ] \] is [(parse_smtlib_string c ...; get_smtlib_parse_results c)]
- Recommended for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_file_x}
- - {b See also}: {!parse_smtlib_string}
- - {b See also}: {!get_smtlib_parse_results}
-*)
-val parse_smtlib_string_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-(**
- \[ [ parse_smtlib_file_x c ... ] \] is [(parse_smtlib_file c ...; get_smtlib_parse_results c)]
- Recommended for functional style interface to the SMT-LIB parser.
- - {b See also}: {!parse_smtlib_string_x}
- - {b See also}: {!parse_smtlib_file}
- - {b See also}: {!get_smtlib_parse_results}
-*)
-val parse_smtlib_file_x: context -> string -> symbol array -> sort array -> symbol array -> func_decl array -> (ast array * ast array * func_decl array)
-(**
- \[ [ symbol_refined ] \] is the refinement of a {!symbol} .
- - {b See also}: {!symbol_refine}
- - {b See also}: {!get_symbol_kind}
-*)
-type symbol_refined =
- | Symbol_int of int
- | Symbol_string of string
- | Symbol_unknown;;
-(**
- \[ [ symbol_refine c s ] \] is the refined symbol of [s].
- - {b See also}: {!symbol_refined}
- - {b See also}: {!get_symbol_kind}
-*)
-val symbol_refine: context -> symbol -> symbol_refined;;
-(**
- \[ [ sort_refined ] \] is the refinement of a {!sort} .
- - {b See also}: {!sort_refine}
- - {b See also}: {!get_sort_kind}
-*)
-type sort_refined =
- | Sort_uninterpreted of symbol
- | Sort_bool
- | Sort_int
- | Sort_real
- | Sort_bv of int
- | Sort_array of (sort * sort)
- | Sort_datatype of datatype_constructor_refined array
- | Sort_relation
- | Sort_finite_domain
- | Sort_unknown of symbol
-(**
- \[ [ sort_refine c t ] \] is the refined sort of [t].
- - {b See also}: {!sort_refined}
- - {b See also}: {!get_sort_kind}
-*)
-val sort_refine: context -> sort -> sort_refined;;
-(**
- \[ [ binder_type ] \] is a universal or existential quantifier.
- - {b See also}: {!term_refined}
-*)
-type binder_type = | Forall | Exists
-(**
- \[ [ numeral_refined ] \] is the refinement of a numeral .
- Numerals whose fractional representation can be fit with
- 64 bit integers are treated as small.
-*)
-type numeral_refined =
- | Numeral_small of int64 * int64
- | Numeral_large of string
-(**
- \[ [ term_refined ] \] is the refinement of a {!ast} .
- - {b See also}: {!term_refine}
-*)
-type term_refined =
- | Term_app of decl_kind * func_decl * ast array
- | Term_quantifier of binder_type * int * ast array array * (symbol * sort) array * ast
- | Term_numeral of numeral_refined * sort
- | Term_var of int * sort
-(**
- \[ [ term_refine c a ] \] is the refined term of [a].
- - {b See also}: {!term_refined}
-*)
-val term_refine : context -> ast -> term_refined
-(**
- \[ [mk_theory c name ] \] create a custom theory.
-*)
-val mk_theory : context -> string -> theory
-(**
- \[ [set_delete_callback th cb] \] set callback when theory gets deleted.
-*)
-val set_delete_callback : theory -> (unit -> unit) -> unit
-(**
- \[ [set_reduce_app_callback th cb] \] set callback for simplifying theory terms.
-*)
-val set_reduce_app_callback : theory -> (func_decl -> ast array -> ast option) -> unit
-(**
- \[ [set_reduce_eq_callback th cb] \] set callback for simplifying equalities over theory terms.
-*)
-val set_reduce_eq_callback : theory -> (ast -> ast -> ast option) -> unit
-(**
- \[ [set_reduce_distinct_callback th cb] \] set callback for simplifying disequalities over theory terms.
-*)
-val set_reduce_distinct_callback : theory -> (ast array -> ast option) -> unit
-(**
- \[ [set_new_app_callback th cb] \] set callback for registering new application.
-*)
-val set_new_app_callback : theory -> (ast -> unit) -> unit
-(**
- \[ [set_new_elem_callback th cb] \] set callback for registering new element.
- - {b See also}: the help for the corresponding C API function.
-*)
-val set_new_elem_callback : theory -> (ast -> unit) -> unit
-(**
- \[ [set_init_search_callback th cb] \] set callback when Z3 starts searching for a satisfying assignment.
-*)
-val set_init_search_callback : theory -> (unit -> unit) -> unit
-(**
- \[ [set_push_callback th cb] \] set callback for a logical context push.
-*)
-val set_push_callback : theory -> (unit -> unit) -> unit
-(**
- \[ [set_pop_callback th cb] \] set callback for a logical context pop.
-*)
-val set_pop_callback : theory -> (unit -> unit) -> unit
-(**
- \[ [set_restart_callback th cb] \] set callback for search restart.
-*)
-val set_restart_callback : theory -> (unit -> unit) -> unit
-val set_reset_callback : theory -> (unit -> unit) -> unit
-val set_final_check_callback : theory -> (unit -> bool) -> unit
-val set_new_eq_callback : theory -> (ast -> ast -> unit) -> unit
-val set_new_diseq_callback : theory -> (ast -> ast -> unit) -> unit
-val set_new_assignment_callback : theory -> (ast -> bool -> unit) -> unit
-val set_new_relevant_callback : theory -> (ast -> unit) -> unit
+ (** Instrument the Datalog engine on which table representation to use for recursive predicate. *)
+ val set_predicate_representation : fixedpoint -> FuncDecl.func_decl -> Symbol.symbol list -> unit
+
+ (** Convert benchmark given as set of axioms, rules and queries to a string. *)
+ val to_string_q : fixedpoint -> Expr.expr list -> string
+
+ (** Retrieve set of rules added to fixedpoint context. *)
+ val get_rules : fixedpoint -> Expr.expr list
+
+ (** Retrieve set of assertions added to fixedpoint context. *)
+ val get_assertions : fixedpoint -> Expr.expr list
+
+ (** Create a Fixedpoint context. *)
+ val mk_fixedpoint : context -> fixedpoint
+end
+
+(** Functions for handling SMT and SMT2 expressions and files *)
+module SMT :
+sig
+ (** Convert a benchmark into an SMT-LIB formatted string.
+
+ @return A string representation of the benchmark. *)
+ val benchmark_to_smtstring : context -> string -> string -> string -> string -> Expr.expr list -> Expr.expr -> string
+
+ (** Parse the given string using the SMT-LIB parser.
+
+ The symbol table of the parser can be initialized using the given sorts and declarations.
+ The symbols in the arrays in the third and fifth argument
+ don't need to match the names of the sorts and declarations in the arrays in the fourth
+ and sixth argument. This is a useful feature since we can use arbitrary names to
+ reference sorts and declarations. *)
+ val parse_smtlib_string : context -> string -> Symbol.symbol list -> Sort.sort list -> Symbol.symbol list -> FuncDecl.func_decl list -> unit
+
+ (** Parse the given file using the SMT-LIB parser.
+ {!parse_smtlib_string} *)
+ val parse_smtlib_file : context -> string -> Symbol.symbol list -> Sort.sort list -> Symbol.symbol list -> FuncDecl.func_decl list -> unit
+ (** The number of SMTLIB formulas parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_num_smtlib_formulas : context -> int
+
+ (** The formulas parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_smtlib_formulas : context -> Expr.expr list
+
+ (** The number of SMTLIB assumptions parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_num_smtlib_assumptions : context -> int
+
+ (** The assumptions parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_smtlib_assumptions : context -> Expr.expr list
+
+ (** The number of SMTLIB declarations parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_num_smtlib_decls : context -> int
+
+ (** The declarations parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_smtlib_decls : context -> FuncDecl.func_decl list
+
+ (** The number of SMTLIB sorts parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_num_smtlib_sorts : context -> int
+
+ (** The sort declarations parsed by the last call to [ParseSMTLIBString] or [ParseSMTLIBFile]. *)
+ val get_smtlib_sorts : context -> Sort.sort list
+
+ (** Parse the given string using the SMT-LIB2 parser.
+
+ {!parse_smtlib_string}
+ @return A conjunction of assertions in the scope (up to push/pop) at the end of the string. *)
+ val parse_smtlib2_string : context -> string -> Symbol.symbol list -> Sort.sort list -> Symbol.symbol list -> FuncDecl.func_decl list -> Expr.expr
+
+ (** Parse the given file using the SMT-LIB2 parser.
+ {!parse_smtlib2_string} *)
+ val parse_smtlib2_file : context -> string -> Symbol.symbol list -> Sort.sort list -> Symbol.symbol list -> FuncDecl.func_decl list -> Expr.expr
+end
+
+(** Interpolation *)
+module Interpolation :
+sig
+
+ (** Create an AST node marking a formula position for interpolation.
+ The expression must have Boolean sort. *)
+ val mk_interpolant : context -> Expr.expr -> Expr.expr
+
+ (** The interpolation context is suitable for generation of interpolants.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val mk_interpolation_context : (string * string) list -> context
+
+ (** Gets an interpolant.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val get_interpolant : context -> Expr.expr -> Expr.expr -> Params.params -> AST.ASTVector.ast_vector
+
+ (** Computes an interpolant.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val compute_interpolant : context -> Expr.expr -> Params.params -> (AST.ASTVector.ast_vector * Model.model)
+
+ (** Retrieves an interpolation profile.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val get_interpolation_profile : context -> string
+
+ (** Read an interpolation problem from file.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val read_interpolation_problem : context -> string -> (Expr.expr list * int list * Expr.expr list)
+
+ (** Check the correctness of an interpolant.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val check_interpolant : context -> int -> Expr.expr list -> int list -> Expr.expr list -> int -> Expr.expr list -> unit
+
+ (** Write an interpolation problem to file suitable for reading with
+ Z3_read_interpolation_problem.
+ For more information on interpolation please refer
+ too the C/C++ API, which is well documented. *)
+ val write_interpolation_problem : context -> int -> Expr.expr list -> int list -> string -> int -> Expr.expr list -> unit
end
+(** Set a global (or module) parameter, which is shared by all Z3 contexts.
+
+ When a Z3 module is initialized it will use the value of these parameters
+ when Z3_params objects are not provided.
+ The name of parameter can be composed of characters [a-z][A-Z], digits [0-9], '-' and '_'.
+ The character '.' is a delimiter (more later).
+ The parameter names are case-insensitive. The character '-' should be viewed as an "alias" for '_'.
+ Thus, the following parameter names are considered equivalent: "pp.decimal-precision" and "PP.DECIMAL_PRECISION".
+ This function can be used to set parameters for a specific Z3 module.
+ This can be done by using ..
+ For example:
+ (set_global_param "pp.decimal" "true")
+ will set the parameter "decimal" in the module "pp" to true.
+*)
+val set_global_param : string -> string -> unit
+
+(** Get a global (or module) parameter.
+
+ Returns None if the parameter does not exist.
+ The caller must invoke #Z3_global_param_del_value to delete the value returned at param_value.
+ This function cannot be invoked simultaneously from different threads without synchronization.
+ The result string stored in param_value is stored in a shared location.
+*)
+val get_global_param : string -> string option
+
+(** Restore the value of all global (and module) parameters.
+
+ This command will not affect already created objects (such as tactics and solvers)
+ {!set_global_param}
+*)
+
+val global_param_reset_all : unit -> unit
+
+(** Enable/disable printing of warning messages to the console.
+
+ Note that this function is static and effects the behaviour of
+ all contexts globally. *)
+val toggle_warning_messages : bool -> unit
+
diff --git a/src/api/ml/z3_stubs.c b/src/api/ml/z3_stubs.c
deleted file mode 100644
index bad4338de..000000000
--- a/src/api/ml/z3_stubs.c
+++ /dev/null
@@ -1,19044 +0,0 @@
-/* File generated from z3.idl */
-
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-#ifdef Custom_tag
-#include
-#include
-#endif
-#include
-
-
-#include "z3.h"
-
-#define xstr(s) str(s)
-#define str(s) #s
-
-void check_error_code (Z3_context c);
-Z3_context last_ctx;
-
-
- // caml_final_register is the implementation of Gc.finalize
- value caml_final_register (value f, value v);
- void register_finalizer(value** closure, char* name, Z3_context ctx, value v)
- {
- if (*closure == NULL) {
- *closure = caml_named_value(name);
- if (*closure == NULL) {
- Z3_set_error(ctx, Z3_INTERNAL_FATAL);
- return;
- }
- }
- caml_final_register(**closure, v);
- }
- value c2ml_Z3_context (Z3_context* c)
- {
- static value* finalize_Z3_context_closure = NULL;
- value v;
- v = caml_alloc_small(1, Abstract_tag);
- Field(v, 0) = (value) *c;
- register_finalizer(&finalize_Z3_context_closure, "finalize_Z3_context",
- (Z3_context) *c, v);
- return v;
- }
- void ml2c_Z3_context (value v, Z3_context* c)
- {
- *c = (Z3_context) Field(v, 0);
- last_ctx = *c;
- }
- value finalize_Z3_context (value v)
- {
- Z3_context c;
- c = (Z3_context) Field(v, 0);
- Z3_del_context(c);
- return Val_unit;
- }
-
-#define camlidl_ml2c_z3_Z3_context(v,c,ctx) ml2c_Z3_context(v,c)
-
-#define camlidl_c2ml_z3_Z3_context(c,ctx) c2ml_Z3_context(c)
-
-void camlidl_ml2c_z3_Z3_symbol(value _v1, Z3_symbol * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_symbol *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3_Z3_symbol(Z3_symbol * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_symbol) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_symbol *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-
-typedef struct _Z3_ast_context {
- Z3_ast ast;
- Z3_context ctx;
-} Z3_ast_context;
-void ml2c_Z3_ast (value v, Z3_ast* c)
-{
- *c = ((Z3_ast_context*) Data_custom_val(v))->ast;
-}
-static int compare_Z3_ast (value v1, value v2)
-{
- Z3_ast_context* ac1;
- Z3_ast_context* ac2;
- unsigned id1, id2;
- ac1 = Data_custom_val(v1);
- ac2 = Data_custom_val(v2);
- id1 = Z3_get_ast_id(ac1->ctx, ac1->ast);
- check_error_code(ac1->ctx);
- id2 = Z3_get_ast_id(ac2->ctx, ac2->ast);
- check_error_code(ac2->ctx);
- return id2 - id1;
-}
-static intnat hash_Z3_ast (value v)
-{
- Z3_ast_context* ac;
- unsigned hash;
- ac = Data_custom_val(v);
- hash = Z3_get_ast_hash(ac->ctx, ac->ast);
- check_error_code(ac->ctx);
- return hash;
-}
-
-
- value finalize_Z3_ast (value v)
- {
- Z3_ast_context* ac;
- ac = Data_custom_val(v);
- Z3_dec_ref(ac->ctx, ac->ast);
- check_error_code(ac->ctx);
- return Val_unit;
- }
- static struct custom_operations cops_Z3_ast = {
- NULL,
- custom_finalize_default,
- compare_Z3_ast,
- hash_Z3_ast,
- custom_serialize_default,
- custom_deserialize_default
- };
- value c2ml_Z3_ast (Z3_ast* c)
- {
- static value* finalize_Z3_ast_closure = NULL;
- value v;
- Z3_ast_context* ac;
- check_error_code(last_ctx);
- v = caml_alloc_custom(&cops_Z3_ast, sizeof(Z3_ast_context), 0, 1);
- ac = Data_custom_val(v);
- ac->ast = *c;
- ac->ctx = last_ctx;
- register_finalizer(&finalize_Z3_ast_closure, "finalize_Z3_ast",
- (Z3_context) *c, v);
- Z3_inc_ref(last_ctx, *c);
- return v;
- }
-
-#define camlidl_ml2c_z3_Z3_ast(v,c,ctx) ml2c_Z3_ast(v,c)
-
-#define camlidl_c2ml_z3_Z3_ast(c,ctx) c2ml_Z3_ast(c)
-
-#define DEFINE_SUBAST_OPS(T) void ml2c_ ## T (value v, T * a) { ml2c_Z3_ast(v, (Z3_ast*) a); } value c2ml_ ## T (T * a) { return c2ml_Z3_ast((Z3_ast*) a); }
-DEFINE_SUBAST_OPS(Z3_sort)
-#define camlidl_ml2c_z3_Z3_sort(v,c,ctx) ml2c_Z3_sort(v,c)
-
-#define camlidl_c2ml_z3_Z3_sort(c,ctx) c2ml_Z3_sort(c)
-
-DEFINE_SUBAST_OPS(Z3_func_decl)
-#define camlidl_ml2c_z3_Z3_func_decl(v,c,ctx) ml2c_Z3_func_decl(v,c)
-
-#define camlidl_c2ml_z3_Z3_func_decl(c,ctx) c2ml_Z3_func_decl(c)
-
-DEFINE_SUBAST_OPS(Z3_app)
-#define camlidl_ml2c_z3_Z3_app(v,c,ctx) ml2c_Z3_app(v,c)
-
-#define camlidl_c2ml_z3_Z3_app(c,ctx) c2ml_Z3_app(c)
-
-DEFINE_SUBAST_OPS(Z3_pattern)
-#define camlidl_ml2c_z3_Z3_pattern(v,c,ctx) ml2c_Z3_pattern(v,c)
-
-#define camlidl_c2ml_z3_Z3_pattern(c,ctx) c2ml_Z3_pattern(c)
-
- #define DEFINE_RC_OPS(T) value c2ml_ ## T (T * c) { static value* finalize_ ## T ## _closure = NULL; value v; check_error_code(last_ctx); v = caml_alloc_small(2, Abstract_tag); Field(v, 0) = (value) *c; Field(v, 1) = (value) last_ctx; register_finalizer(&finalize_ ## T ## _closure, xstr(finalize_ ## T), (Z3_context) *c, v); T ## _inc_ref(last_ctx, *c); return v; } void ml2c_ ## T (value v, T * c) { *c = (T) Field(v, 0); } value finalize_ ## T (value v) { Z3_context c; c = (Z3_context) Field(v, 1); T ## _dec_ref(c, (T) Field(v, 0)); check_error_code(c); return Val_unit; }
-DEFINE_RC_OPS(Z3_params)
-#define camlidl_ml2c_z3_Z3_params(v,c,ctx) ml2c_Z3_params(v,c)
-
-#define camlidl_c2ml_z3_Z3_params(c,ctx) c2ml_Z3_params(c)
-
-DEFINE_RC_OPS(Z3_param_descrs)
-#define camlidl_ml2c_z3_Z3_param_descrs(v,c,ctx) ml2c_Z3_param_descrs(v,c)
-
-#define camlidl_c2ml_z3_Z3_param_descrs(c,ctx) c2ml_Z3_param_descrs(c)
-
-DEFINE_RC_OPS(Z3_model)
-#define camlidl_ml2c_z3_Z3_model(v,c,ctx) ml2c_Z3_model(v,c)
-
-#define camlidl_c2ml_z3_Z3_model(c,ctx) c2ml_Z3_model(c)
-
-DEFINE_RC_OPS(Z3_func_interp)
-#define camlidl_ml2c_z3_Z3_func_interp(v,c,ctx) ml2c_Z3_func_interp(v,c)
-
-#define camlidl_c2ml_z3_Z3_func_interp(c,ctx) c2ml_Z3_func_interp(c)
-
-DEFINE_RC_OPS(Z3_func_entry)
-#define camlidl_ml2c_z3_Z3_func_entry(v,c,ctx) ml2c_Z3_func_entry(v,c)
-
-#define camlidl_c2ml_z3_Z3_func_entry(c,ctx) c2ml_Z3_func_entry(c)
-
-DEFINE_RC_OPS(Z3_fixedpoint)
-#define camlidl_ml2c_z3_Z3_fixedpoint(v,c,ctx) ml2c_Z3_fixedpoint(v,c)
-
-#define camlidl_c2ml_z3_Z3_fixedpoint(c,ctx) c2ml_Z3_fixedpoint(c)
-
-DEFINE_RC_OPS(Z3_ast_vector)
-#define camlidl_ml2c_z3_Z3_ast_vector(v,c,ctx) ml2c_Z3_ast_vector(v,c)
-
-#define camlidl_c2ml_z3_Z3_ast_vector(c,ctx) c2ml_Z3_ast_vector(c)
-
-DEFINE_RC_OPS(Z3_ast_map)
-#define camlidl_ml2c_z3_Z3_ast_map(v,c,ctx) ml2c_Z3_ast_map(v,c)
-
-#define camlidl_c2ml_z3_Z3_ast_map(c,ctx) c2ml_Z3_ast_map(c)
-
-DEFINE_RC_OPS(Z3_goal)
-#define camlidl_ml2c_z3_Z3_goal(v,c,ctx) ml2c_Z3_goal(v,c)
-
-#define camlidl_c2ml_z3_Z3_goal(c,ctx) c2ml_Z3_goal(c)
-
-DEFINE_RC_OPS(Z3_tactic)
-#define camlidl_ml2c_z3_Z3_tactic(v,c,ctx) ml2c_Z3_tactic(v,c)
-
-#define camlidl_c2ml_z3_Z3_tactic(c,ctx) c2ml_Z3_tactic(c)
-
-DEFINE_RC_OPS(Z3_probe)
-#define camlidl_ml2c_z3_Z3_probe(v,c,ctx) ml2c_Z3_probe(v,c)
-
-#define camlidl_c2ml_z3_Z3_probe(c,ctx) c2ml_Z3_probe(c)
-
-DEFINE_RC_OPS(Z3_apply_result)
-#define camlidl_ml2c_z3_Z3_apply_result(v,c,ctx) ml2c_Z3_apply_result(v,c)
-
-#define camlidl_c2ml_z3_Z3_apply_result(c,ctx) c2ml_Z3_apply_result(c)
-
-DEFINE_RC_OPS(Z3_solver)
-#define camlidl_ml2c_z3_Z3_solver(v,c,ctx) ml2c_Z3_solver(v,c)
-
-#define camlidl_c2ml_z3_Z3_solver(c,ctx) c2ml_Z3_solver(c)
-
-DEFINE_RC_OPS(Z3_stats)
-#define camlidl_ml2c_z3_Z3_stats(v,c,ctx) ml2c_Z3_stats(v,c)
-
-#define camlidl_c2ml_z3_Z3_stats(c,ctx) c2ml_Z3_stats(c)
-
-#define DEFINE_OPT_OPS(T) void ml2c_ ## T ## _opt (value v, T* c) { struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL }; camlidl_ctx _ctx = &_ctxs; if (v != Val_int(0)) { camlidl_ml2c_z3_ ## T(Field(v, 0), c, _ctx); } else { *c = NULL; } } value c2ml_ ## T ## _opt (T* c) { struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL }; camlidl_ctx _ctx = &_ctxs; value v; value a; if (*c) { a = camlidl_c2ml_z3_ ## T(c, _ctx); Begin_root(a) v = caml_alloc_small(1, 0); Field(v, 0) = a; End_roots(); } else { v = Val_int(0); } return v; }
-
-DEFINE_OPT_OPS(Z3_ast)
-#define camlidl_ml2c_z3_Z3_ast_opt(v,c,ctx) ml2c_Z3_ast_opt(v,c)
-
-#define camlidl_c2ml_z3_Z3_ast_opt(c,ctx) c2ml_Z3_ast_opt(c)
-
-DEFINE_OPT_OPS(Z3_sort)
-#define camlidl_ml2c_z3_Z3_sort_opt(v,c,ctx) ml2c_Z3_sort_opt(v,c)
-
-#define camlidl_c2ml_z3_Z3_sort_opt(c,ctx) c2ml_Z3_sort_opt(c)
-
-DEFINE_OPT_OPS(Z3_func_interp)
-#define camlidl_ml2c_z3_Z3_func_interp_opt(v,c,ctx) ml2c_Z3_func_interp_opt(v,c)
-
-#define camlidl_c2ml_z3_Z3_func_interp_opt(c,ctx) c2ml_Z3_func_interp_opt(c)
-
-void camlidl_ml2c_z3_Z3_constructor(value _v1, Z3_constructor * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_constructor *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3_Z3_constructor(Z3_constructor * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_constructor) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_constructor *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3_Z3_constructor_list(value _v1, Z3_constructor_list * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_constructor_list *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3_Z3_constructor_list(Z3_constructor_list * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_constructor_list) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_constructor_list *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3_Z3_string(value _v1, Z3_string * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_malloc_string(_v1, _ctx);
-}
-
-value camlidl_c2ml_z3_Z3_string(Z3_string * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = copy_string((*_c2));
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_1[3] = {
- Z3_L_FALSE,
- Z3_L_UNDEF,
- Z3_L_TRUE,
-};
-
-void camlidl_ml2c_z3_Z3_lbool(value _v1, Z3_lbool * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_1[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_lbool(Z3_lbool * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_L_FALSE: _v1 = Val_int(0); break;
- case Z3_L_UNDEF: _v1 = Val_int(1); break;
- case Z3_L_TRUE: _v1 = Val_int(2); break;
- default: invalid_argument("typedef Z3_lbool: bad enum value");
- }
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_2[2] = {
- Z3_INT_SYMBOL,
- Z3_STRING_SYMBOL,
-};
-
-void camlidl_ml2c_z3_Z3_symbol_kind(value _v1, Z3_symbol_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_2[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_symbol_kind(Z3_symbol_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_INT_SYMBOL: _v1 = Val_int(0); break;
- case Z3_STRING_SYMBOL: _v1 = Val_int(1); break;
- default: invalid_argument("typedef Z3_symbol_kind: bad enum value");
- }
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_3[7] = {
- Z3_PARAMETER_INT,
- Z3_PARAMETER_DOUBLE,
- Z3_PARAMETER_RATIONAL,
- Z3_PARAMETER_SYMBOL,
- Z3_PARAMETER_SORT,
- Z3_PARAMETER_AST,
- Z3_PARAMETER_FUNC_DECL,
-};
-
-void camlidl_ml2c_z3_Z3_parameter_kind(value _v1, Z3_parameter_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_3[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_parameter_kind(Z3_parameter_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_3, 7, "typedef Z3_parameter_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_4[10] = {
- Z3_UNINTERPRETED_SORT,
- Z3_BOOL_SORT,
- Z3_INT_SORT,
- Z3_REAL_SORT,
- Z3_BV_SORT,
- Z3_ARRAY_SORT,
- Z3_DATATYPE_SORT,
- Z3_RELATION_SORT,
- Z3_FINITE_DOMAIN_SORT,
- Z3_UNKNOWN_SORT,
-};
-
-void camlidl_ml2c_z3_Z3_sort_kind(value _v1, Z3_sort_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_4[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_sort_kind(Z3_sort_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_4, 10, "typedef Z3_sort_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_5[7] = {
- Z3_NUMERAL_AST,
- Z3_APP_AST,
- Z3_VAR_AST,
- Z3_QUANTIFIER_AST,
- Z3_SORT_AST,
- Z3_FUNC_DECL_AST,
- Z3_UNKNOWN_AST,
-};
-
-void camlidl_ml2c_z3_Z3_ast_kind(value _v1, Z3_ast_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_5[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_ast_kind(Z3_ast_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_5, 7, "typedef Z3_ast_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_6[152] = {
- Z3_OP_TRUE,
- Z3_OP_FALSE,
- Z3_OP_EQ,
- Z3_OP_DISTINCT,
- Z3_OP_ITE,
- Z3_OP_AND,
- Z3_OP_OR,
- Z3_OP_IFF,
- Z3_OP_XOR,
- Z3_OP_NOT,
- Z3_OP_IMPLIES,
- Z3_OP_OEQ,
- Z3_OP_ANUM,
- Z3_OP_AGNUM,
- Z3_OP_LE,
- Z3_OP_GE,
- Z3_OP_LT,
- Z3_OP_GT,
- Z3_OP_ADD,
- Z3_OP_SUB,
- Z3_OP_UMINUS,
- Z3_OP_MUL,
- Z3_OP_DIV,
- Z3_OP_IDIV,
- Z3_OP_REM,
- Z3_OP_MOD,
- Z3_OP_TO_REAL,
- Z3_OP_TO_INT,
- Z3_OP_IS_INT,
- Z3_OP_POWER,
- Z3_OP_STORE,
- Z3_OP_SELECT,
- Z3_OP_CONST_ARRAY,
- Z3_OP_ARRAY_MAP,
- Z3_OP_ARRAY_DEFAULT,
- Z3_OP_SET_UNION,
- Z3_OP_SET_INTERSECT,
- Z3_OP_SET_DIFFERENCE,
- Z3_OP_SET_COMPLEMENT,
- Z3_OP_SET_SUBSET,
- Z3_OP_AS_ARRAY,
- Z3_OP_BNUM,
- Z3_OP_BIT1,
- Z3_OP_BIT0,
- Z3_OP_BNEG,
- Z3_OP_BADD,
- Z3_OP_BSUB,
- Z3_OP_BMUL,
- Z3_OP_BSDIV,
- Z3_OP_BUDIV,
- Z3_OP_BSREM,
- Z3_OP_BUREM,
- Z3_OP_BSMOD,
- Z3_OP_BSDIV0,
- Z3_OP_BUDIV0,
- Z3_OP_BSREM0,
- Z3_OP_BUREM0,
- Z3_OP_BSMOD0,
- Z3_OP_ULEQ,
- Z3_OP_SLEQ,
- Z3_OP_UGEQ,
- Z3_OP_SGEQ,
- Z3_OP_ULT,
- Z3_OP_SLT,
- Z3_OP_UGT,
- Z3_OP_SGT,
- Z3_OP_BAND,
- Z3_OP_BOR,
- Z3_OP_BNOT,
- Z3_OP_BXOR,
- Z3_OP_BNAND,
- Z3_OP_BNOR,
- Z3_OP_BXNOR,
- Z3_OP_CONCAT,
- Z3_OP_SIGN_EXT,
- Z3_OP_ZERO_EXT,
- Z3_OP_EXTRACT,
- Z3_OP_REPEAT,
- Z3_OP_BREDOR,
- Z3_OP_BREDAND,
- Z3_OP_BCOMP,
- Z3_OP_BSHL,
- Z3_OP_BLSHR,
- Z3_OP_BASHR,
- Z3_OP_ROTATE_LEFT,
- Z3_OP_ROTATE_RIGHT,
- Z3_OP_EXT_ROTATE_LEFT,
- Z3_OP_EXT_ROTATE_RIGHT,
- Z3_OP_INT2BV,
- Z3_OP_BV2INT,
- Z3_OP_CARRY,
- Z3_OP_XOR3,
- Z3_OP_PR_UNDEF,
- Z3_OP_PR_TRUE,
- Z3_OP_PR_ASSERTED,
- Z3_OP_PR_GOAL,
- Z3_OP_PR_MODUS_PONENS,
- Z3_OP_PR_REFLEXIVITY,
- Z3_OP_PR_SYMMETRY,
- Z3_OP_PR_TRANSITIVITY,
- Z3_OP_PR_TRANSITIVITY_STAR,
- Z3_OP_PR_MONOTONICITY,
- Z3_OP_PR_QUANT_INTRO,
- Z3_OP_PR_DISTRIBUTIVITY,
- Z3_OP_PR_AND_ELIM,
- Z3_OP_PR_NOT_OR_ELIM,
- Z3_OP_PR_REWRITE,
- Z3_OP_PR_REWRITE_STAR,
- Z3_OP_PR_PULL_QUANT,
- Z3_OP_PR_PULL_QUANT_STAR,
- Z3_OP_PR_PUSH_QUANT,
- Z3_OP_PR_ELIM_UNUSED_VARS,
- Z3_OP_PR_DER,
- Z3_OP_PR_QUANT_INST,
- Z3_OP_PR_HYPOTHESIS,
- Z3_OP_PR_LEMMA,
- Z3_OP_PR_UNIT_RESOLUTION,
- Z3_OP_PR_IFF_TRUE,
- Z3_OP_PR_IFF_FALSE,
- Z3_OP_PR_COMMUTATIVITY,
- Z3_OP_PR_DEF_AXIOM,
- Z3_OP_PR_DEF_INTRO,
- Z3_OP_PR_APPLY_DEF,
- Z3_OP_PR_IFF_OEQ,
- Z3_OP_PR_NNF_POS,
- Z3_OP_PR_NNF_NEG,
- Z3_OP_PR_NNF_STAR,
- Z3_OP_PR_CNF_STAR,
- Z3_OP_PR_SKOLEMIZE,
- Z3_OP_PR_MODUS_PONENS_OEQ,
- Z3_OP_PR_TH_LEMMA,
- Z3_OP_PR_HYPER_RESOLVE,
- Z3_OP_RA_STORE,
- Z3_OP_RA_EMPTY,
- Z3_OP_RA_IS_EMPTY,
- Z3_OP_RA_JOIN,
- Z3_OP_RA_UNION,
- Z3_OP_RA_WIDEN,
- Z3_OP_RA_PROJECT,
- Z3_OP_RA_FILTER,
- Z3_OP_RA_NEGATION_FILTER,
- Z3_OP_RA_RENAME,
- Z3_OP_RA_COMPLEMENT,
- Z3_OP_RA_SELECT,
- Z3_OP_RA_CLONE,
- Z3_OP_FD_LT,
- Z3_OP_LABEL,
- Z3_OP_LABEL_LIT,
- Z3_OP_DT_CONSTRUCTOR,
- Z3_OP_DT_RECOGNISER,
- Z3_OP_DT_ACCESSOR,
- Z3_OP_UNINTERPRETED,
-};
-
-void camlidl_ml2c_z3_Z3_decl_kind(value _v1, Z3_decl_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_6[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_decl_kind(Z3_decl_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_6, 152, "typedef Z3_decl_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_7[7] = {
- Z3_PK_UINT,
- Z3_PK_BOOL,
- Z3_PK_DOUBLE,
- Z3_PK_SYMBOL,
- Z3_PK_STRING,
- Z3_PK_OTHER,
- Z3_PK_INVALID,
-};
-
-void camlidl_ml2c_z3_Z3_param_kind(value _v1, Z3_param_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_7[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_param_kind(Z3_param_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_7, 7, "typedef Z3_param_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_8[4] = {
- Z3_PRINT_SMTLIB_FULL,
- Z3_PRINT_LOW_LEVEL,
- Z3_PRINT_SMTLIB_COMPLIANT,
- Z3_PRINT_SMTLIB2_COMPLIANT,
-};
-
-void camlidl_ml2c_z3_Z3_ast_print_mode(value _v1, Z3_ast_print_mode * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_8[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_ast_print_mode(Z3_ast_print_mode * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_PRINT_SMTLIB_FULL: _v1 = Val_int(0); break;
- case Z3_PRINT_LOW_LEVEL: _v1 = Val_int(1); break;
- case Z3_PRINT_SMTLIB_COMPLIANT: _v1 = Val_int(2); break;
- case Z3_PRINT_SMTLIB2_COMPLIANT: _v1 = Val_int(3); break;
- default: invalid_argument("typedef Z3_ast_print_mode: bad enum value");
- }
- return _v1;
-}
-
-int camlidl_transl_table_z3_enum_9[13] = {
- Z3_OK,
- Z3_SORT_ERROR,
- Z3_IOB,
- Z3_INVALID_ARG,
- Z3_PARSER_ERROR,
- Z3_NO_PARSER,
- Z3_INVALID_PATTERN,
- Z3_MEMOUT_FAIL,
- Z3_FILE_ACCESS_ERROR,
- Z3_INTERNAL_FATAL,
- Z3_INVALID_USAGE,
- Z3_DEC_REF_ERROR,
- Z3_EXCEPTION,
-};
-
-void camlidl_ml2c_z3_Z3_error_code(value _v1, Z3_error_code * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_9[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_error_code(Z3_error_code * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3_enum_9, 13, "typedef Z3_error_code: bad enum value");
- return _v1;
-}
-
-
-/* All contexts share the same handler */
-static value caml_z3_error_handler = 0;
-
-
-value camlidl_c2ml_z3_Z3_error_code(Z3_error_code * _c2, camlidl_ctx _ctx);
-/* Error checking routine that raises OCaml Error exceptions */
-void check_error_code (Z3_context c)
-{
- static struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- value* exn_tag = NULL;
- value ctx_err[2];
- Z3_error_code e;
- e = Z3_get_error_code(c);
- if (e != Z3_OK) {
- ctx_err[0] = c2ml_Z3_context(&c);
- ctx_err[1] = camlidl_c2ml_z3_Z3_error_code(&e, &_ctxs);
- exn_tag = caml_named_value("Z3.Error");
- if (*exn_tag == 0) {
- fprintf(stderr, "Z3.Error not found");
- exit(1);
- }
- caml_raise_with_args(*exn_tag, 2, ctx_err);
- }
-}
-/* Disable default error handler, all error checking is done by check_error_code */
-void* error_handler_static = NULL;
-
-int camlidl_transl_table_z3_enum_10[4] = {
- Z3_GOAL_PRECISE,
- Z3_GOAL_UNDER,
- Z3_GOAL_OVER,
- Z3_GOAL_UNDER_OVER,
-};
-
-void camlidl_ml2c_z3_Z3_goal_prec(value _v1, Z3_goal_prec * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3_enum_10[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3_Z3_goal_prec(Z3_goal_prec * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_GOAL_PRECISE: _v1 = Val_int(0); break;
- case Z3_GOAL_UNDER: _v1 = Val_int(1); break;
- case Z3_GOAL_OVER: _v1 = Val_int(2); break;
- case Z3_GOAL_UNDER_OVER: _v1 = Val_int(3); break;
- default: invalid_argument("typedef Z3_goal_prec: bad enum value");
- }
- return _v1;
-}
-
-
-value caml_z3_mk_context(value key_val_list)
-{
- CAMLparam1( key_val_list );
- CAMLlocal4( item, vkey, vval, _vres );
- char * ckey;
- char * cval;
- Z3_config cfg;
- Z3_context _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- cfg = Z3_mk_config();
- while (key_val_list != Val_emptylist)
- {
- item = Field(key_val_list, 0);
- vkey = Field(item, 0);
- vval = Field(item, 1);
- ckey = camlidl_malloc_string(vkey, _ctx);
- cval = camlidl_malloc_string(vval, _ctx);
- Z3_set_param_value(cfg, ckey, cval);
- key_val_list = Field(key_val_list, 1);
- }
- _res = Z3_mk_context_rc(cfg);
- Z3_del_config(cfg);
- _vres = camlidl_c2ml_z3_Z3_context(&_res, _ctx);
- camlidl_free(_ctx);
- Z3_set_error_handler(_res, error_handler_static);
- CAMLreturn(_vres);
-}
-
-value camlidl_z3_Z3_update_param_value(
- value _v_c,
- value _v_param_id,
- value _v_param_value)
-{
- Z3_context c; /*in*/
- Z3_string param_id; /*in*/
- Z3_string param_value; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_param_id, ¶m_id, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_param_value, ¶m_value, _ctx);
- Z3_update_param_value(c, param_id, param_value);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_get_param_value(
- value _v_c,
- value _v_param_id)
-{
- Z3_context c; /*in*/
- Z3_string param_id; /*in*/
- Z3_string *param_value; /*out*/
- Z3_string _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_param_id, ¶m_id, _ctx);
- param_value = &_c1;
- Z3_get_param_value(c, param_id, param_value);
- if (param_value == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = camlidl_c2ml_z3_Z3_string(&*param_value, _ctx);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_interrupt(
- value _v_c)
-{
- Z3_context c; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- Z3_interrupt(c);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_mk_params(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_params _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_params(c);
- _vres = camlidl_c2ml_z3_Z3_params(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_params_set_bool(
- value _v_c,
- value _v_p,
- value _v_k,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_symbol k; /*in*/
- int v; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_k, &k, _ctx);
- v = Int_val(_v_v);
- Z3_params_set_bool(c, p, k, v);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_params_set_uint(
- value _v_c,
- value _v_p,
- value _v_k,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_symbol k; /*in*/
- unsigned int v; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_k, &k, _ctx);
- v = Int_val(_v_v);
- Z3_params_set_uint(c, p, k, v);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_params_set_double(
- value _v_c,
- value _v_p,
- value _v_k,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_symbol k; /*in*/
- double v; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_k, &k, _ctx);
- v = Double_val(_v_v);
- Z3_params_set_double(c, p, k, v);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_params_set_symbol(
- value _v_c,
- value _v_p,
- value _v_k,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_symbol k; /*in*/
- Z3_symbol v; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_k, &k, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_v, &v, _ctx);
- Z3_params_set_symbol(c, p, k, v);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_params_to_string(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- _res = Z3_params_to_string(c, p);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_params_validate(
- value _v_c,
- value _v_p,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_params p; /*in*/
- Z3_param_descrs d; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_param_descrs(_v_d, &d, _ctx);
- Z3_params_validate(c, p, d);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_param_descrs_get_kind(
- value _v_c,
- value _v_p,
- value _v_n)
-{
- Z3_context c; /*in*/
- Z3_param_descrs p; /*in*/
- Z3_symbol n; /*in*/
- Z3_param_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_param_descrs(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_n, &n, _ctx);
- _res = Z3_param_descrs_get_kind(c, p, n);
- _vres = camlidl_c2ml_z3_Z3_param_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_param_descrs_size(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_param_descrs p; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_param_descrs(_v_p, &p, _ctx);
- _res = Z3_param_descrs_size(c, p);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_param_descrs_get_name(
- value _v_c,
- value _v_p,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_param_descrs p; /*in*/
- unsigned int i; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_param_descrs(_v_p, &p, _ctx);
- i = Int_val(_v_i);
- _res = Z3_param_descrs_get_name(c, p, i);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_param_descrs_to_string(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_param_descrs p; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_param_descrs(_v_p, &p, _ctx);
- _res = Z3_param_descrs_to_string(c, p);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int_symbol(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- int i; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_mk_int_symbol(c, i);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_string_symbol(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_string s; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_s, &s, _ctx);
- _res = Z3_mk_string_symbol(c, s);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_uninterpreted_sort(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_mk_uninterpreted_sort(c, s);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bool_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_bool_sort(c);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_int_sort(c);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_real_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_real_sort(c);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bv_sort(
- value _v_c,
- value _v_sz)
-{
- Z3_context c; /*in*/
- unsigned int sz; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- sz = Int_val(_v_sz);
- _res = Z3_mk_bv_sort(c, sz);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_finite_domain_sort(
- value _v_c,
- value _v_name,
- value _v_size)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned long long size; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- size = Int64_val(_v_size);
- _res = Z3_mk_finite_domain_sort(c, name, size);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_array_sort(
- value _v_c,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_sort range; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_domain, &domain, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_array_sort(c, domain, range);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_tuple_sort(
- value _v_c,
- value _v_mk_tuple_name,
- value _v_field_names,
- value _v_field_sorts)
-{
- Z3_context c; /*in*/
- Z3_symbol mk_tuple_name; /*in*/
- unsigned int num_fields; /*in*/
- Z3_symbol const *field_names; /*in*/
- Z3_sort const *field_sorts; /*in*/
- Z3_func_decl *mk_tuple_decl; /*out*/
- Z3_func_decl *proj_decl; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- Z3_func_decl _c7;
- mlsize_t _c8;
- value _v9;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_mk_tuple_name, &mk_tuple_name, _ctx);
- _c1 = Wosize_val(_v_field_names);
- field_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_field_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &field_names[_c2], _ctx);
- }
- num_fields = _c1;
- _c4 = Wosize_val(_v_field_sorts);
- field_sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_field_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &field_sorts[_c5], _ctx);
- }
- num_fields = _c4;
- mk_tuple_decl = &_c7;
- proj_decl = camlidl_malloc(num_fields * sizeof(Z3_func_decl ), _ctx);
- _res = Z3_mk_tuple_sort(c, mk_tuple_name, num_fields, field_names, field_sorts, mk_tuple_decl, proj_decl);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3_Z3_func_decl(&*mk_tuple_decl, _ctx);
- _vres[2] = camlidl_alloc(num_fields, 0);
- Begin_root(_vres[2])
- for (_c8 = 0; _c8 < num_fields; _c8++) {
- _v9 = camlidl_c2ml_z3_Z3_func_decl(&proj_decl[_c8], _ctx);
- modify(&Field(_vres[2], _c8), _v9);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_mk_enumeration_sort(
- value _v_c,
- value _v_name,
- value _v_enum_names)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned int n; /*in*/
- Z3_symbol const *enum_names; /*in*/
- Z3_func_decl *enum_consts; /*out*/
- Z3_func_decl *enum_testers; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- value _v5;
- mlsize_t _c6;
- value _v7;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- _c1 = Wosize_val(_v_enum_names);
- enum_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_enum_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &enum_names[_c2], _ctx);
- }
- n = _c1;
- enum_consts = camlidl_malloc(n * sizeof(Z3_func_decl ), _ctx);
- enum_testers = camlidl_malloc(n * sizeof(Z3_func_decl ), _ctx);
- _res = Z3_mk_enumeration_sort(c, name, n, enum_names, enum_consts, enum_testers);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_alloc(n, 0);
- Begin_root(_vres[1])
- for (_c4 = 0; _c4 < n; _c4++) {
- _v5 = camlidl_c2ml_z3_Z3_func_decl(&enum_consts[_c4], _ctx);
- modify(&Field(_vres[1], _c4), _v5);
- }
- End_roots()
- _vres[2] = camlidl_alloc(n, 0);
- Begin_root(_vres[2])
- for (_c6 = 0; _c6 < n; _c6++) {
- _v7 = camlidl_c2ml_z3_Z3_func_decl(&enum_testers[_c6], _ctx);
- modify(&Field(_vres[2], _c6), _v7);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_mk_list_sort(
- value _v_c,
- value _v_name,
- value _v_elem_sort)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- Z3_sort elem_sort; /*in*/
- Z3_func_decl *nil_decl; /*out*/
- Z3_func_decl *is_nil_decl; /*out*/
- Z3_func_decl *cons_decl; /*out*/
- Z3_func_decl *is_cons_decl; /*out*/
- Z3_func_decl *head_decl; /*out*/
- Z3_func_decl *tail_decl; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_func_decl _c1;
- Z3_func_decl _c2;
- Z3_func_decl _c3;
- Z3_func_decl _c4;
- Z3_func_decl _c5;
- Z3_func_decl _c6;
- value _vresult;
- value _vres[7] = { 0, 0, 0, 0, 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_elem_sort, &elem_sort, _ctx);
- nil_decl = &_c1;
- is_nil_decl = &_c2;
- cons_decl = &_c3;
- is_cons_decl = &_c4;
- head_decl = &_c5;
- tail_decl = &_c6;
- _res = Z3_mk_list_sort(c, name, elem_sort, nil_decl, is_nil_decl, cons_decl, is_cons_decl, head_decl, tail_decl);
- Begin_roots_block(_vres, 7)
- _vres[0] = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3_Z3_func_decl(&*nil_decl, _ctx);
- _vres[2] = camlidl_c2ml_z3_Z3_func_decl(&*is_nil_decl, _ctx);
- _vres[3] = camlidl_c2ml_z3_Z3_func_decl(&*cons_decl, _ctx);
- _vres[4] = camlidl_c2ml_z3_Z3_func_decl(&*is_cons_decl, _ctx);
- _vres[5] = camlidl_c2ml_z3_Z3_func_decl(&*head_decl, _ctx);
- _vres[6] = camlidl_c2ml_z3_Z3_func_decl(&*tail_decl, _ctx);
- _vresult = camlidl_alloc_small(7, 0);
- { mlsize_t _c7;
- for (_c7 = 0; _c7 < 7; _c7++) Field(_vresult, _c7) = _vres[_c7];
- }
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_mk_constructor(
- value _v_c,
- value _v_name,
- value _v_recognizer,
- value _v_field_names,
- value _v_sorts,
- value _v_sort_refs)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- Z3_symbol recognizer; /*in*/
- unsigned int num_fields; /*in*/
- Z3_symbol const *field_names; /*in*/
- Z3_sort_opt const *sorts; /*in*/
- unsigned int *sort_refs; /*in*/
- Z3_constructor _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_recognizer, &recognizer, _ctx);
- _c1 = Wosize_val(_v_field_names);
- field_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_field_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &field_names[_c2], _ctx);
- }
- num_fields = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort_opt const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort_opt(_v6, &sorts[_c5], _ctx);
- }
- num_fields = _c4;
- _c7 = Wosize_val(_v_sort_refs);
- sort_refs = camlidl_malloc(_c7 * sizeof(unsigned int ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_sort_refs, _c8);
- sort_refs[_c8] = Int_val(_v9);
- }
- num_fields = _c7;
- _res = Z3_mk_constructor(c, name, recognizer, num_fields, field_names, sorts, sort_refs);
- _vres = camlidl_c2ml_z3_Z3_constructor(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_constructor_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_constructor(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_del_constructor(
- value _v_c,
- value _v_constr)
-{
- Z3_context c; /*in*/
- Z3_constructor constr; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_constructor(_v_constr, &constr, _ctx);
- Z3_del_constructor(c, constr);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_mk_datatype(
- value _v_c,
- value _v_name,
- value _v_constructors)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned int num_constructors; /*in*/
- Z3_constructor *constructors; /*in,out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- value _v5;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- _c1 = Wosize_val(_v_constructors);
- constructors = camlidl_malloc(_c1 * sizeof(Z3_constructor ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_constructors, _c2);
- camlidl_ml2c_z3_Z3_constructor(_v3, &constructors[_c2], _ctx);
- }
- num_constructors = _c1;
- _res = Z3_mk_datatype(c, name, num_constructors, constructors);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_alloc(num_constructors, 0);
- Begin_root(_vres[1])
- for (_c4 = 0; _c4 < num_constructors; _c4++) {
- _v5 = camlidl_c2ml_z3_Z3_constructor(&constructors[_c4], _ctx);
- modify(&Field(_vres[1], _c4), _v5);
- }
- End_roots()
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_mk_constructor_list(
- value _v_c,
- value _v_constructors)
-{
- Z3_context c; /*in*/
- unsigned int num_constructors; /*in*/
- Z3_constructor const *constructors; /*in*/
- Z3_constructor_list _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_constructors);
- constructors = camlidl_malloc(_c1 * sizeof(Z3_constructor const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_constructors, _c2);
- camlidl_ml2c_z3_Z3_constructor(_v3, &constructors[_c2], _ctx);
- }
- num_constructors = _c1;
- _res = Z3_mk_constructor_list(c, num_constructors, constructors);
- _vres = camlidl_c2ml_z3_Z3_constructor_list(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_del_constructor_list(
- value _v_c,
- value _v_clist)
-{
- Z3_context c; /*in*/
- Z3_constructor_list clist; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_constructor_list(_v_clist, &clist, _ctx);
- Z3_del_constructor_list(c, clist);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_mk_datatypes(
- value _v_c,
- value _v_sort_names,
- value _v_constructor_lists)
-{
- Z3_context c; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort *sorts; /*out*/
- Z3_constructor_list *constructor_lists; /*in,out*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- value _v8;
- mlsize_t _c9;
- value _v10;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_constructor_lists);
- constructor_lists = camlidl_malloc(_c4 * sizeof(Z3_constructor_list ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_constructor_lists, _c5);
- camlidl_ml2c_z3_Z3_constructor_list(_v6, &constructor_lists[_c5], _ctx);
- }
- num_sorts = _c4;
- sorts = camlidl_malloc(num_sorts * sizeof(Z3_sort ), _ctx);
- Z3_mk_datatypes(c, num_sorts, sort_names, sorts, constructor_lists);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_alloc(num_sorts, 0);
- Begin_root(_vres[0])
- for (_c7 = 0; _c7 < num_sorts; _c7++) {
- _v8 = camlidl_c2ml_z3_Z3_sort(&sorts[_c7], _ctx);
- modify(&Field(_vres[0], _c7), _v8);
- }
- End_roots()
- _vres[1] = camlidl_alloc(num_sorts, 0);
- Begin_root(_vres[1])
- for (_c9 = 0; _c9 < num_sorts; _c9++) {
- _v10 = camlidl_c2ml_z3_Z3_constructor_list(&constructor_lists[_c9], _ctx);
- modify(&Field(_vres[1], _c9), _v10);
- }
- End_roots()
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_query_constructor(
- value _v_c,
- value _v_constr,
- value _v_num_fields)
-{
- Z3_context c; /*in*/
- Z3_constructor constr; /*in*/
- unsigned int num_fields; /*in*/
- Z3_func_decl *constructor; /*out*/
- Z3_func_decl *tester; /*out*/
- Z3_func_decl *accessors; /*out*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_func_decl _c1;
- Z3_func_decl _c2;
- mlsize_t _c3;
- value _v4;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_constructor(_v_constr, &constr, _ctx);
- num_fields = Int_val(_v_num_fields);
- constructor = &_c1;
- tester = &_c2;
- accessors = camlidl_malloc(num_fields * sizeof(Z3_func_decl ), _ctx);
- Z3_query_constructor(c, constr, num_fields, constructor, tester, accessors);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3_Z3_func_decl(&*constructor, _ctx);
- _vres[1] = camlidl_c2ml_z3_Z3_func_decl(&*tester, _ctx);
- _vres[2] = camlidl_alloc(num_fields, 0);
- Begin_root(_vres[2])
- for (_c3 = 0; _c3 < num_fields; _c3++) {
- _v4 = camlidl_c2ml_z3_Z3_func_decl(&accessors[_c3], _ctx);
- modify(&Field(_vres[2], _c3), _v4);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_mk_func_decl(
- value _v_c,
- value _v_s,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_func_decl(c, s, domain_size, domain, range);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_app(
- value _v_c,
- value _v_d,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_app(c, d, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_const(
- value _v_c,
- value _v_s,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_const(c, s, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_fresh_func_decl(
- value _v_c,
- value _v_prefix,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_string prefix; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_prefix, &prefix, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_fresh_func_decl(c, prefix, domain_size, domain, range);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_fresh_const(
- value _v_c,
- value _v_prefix,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_string prefix; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_prefix, &prefix, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_fresh_const(c, prefix, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_true(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_true(c);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_false(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_false(c);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_eq(
- value _v_c,
- value _v_l,
- value _v_r)
-{
- Z3_context c; /*in*/
- Z3_ast l; /*in*/
- Z3_ast r; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_l, &l, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_r, &r, _ctx);
- _res = Z3_mk_eq(c, l, r);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_distinct(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_distinct(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_not(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_mk_not(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_ite(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_t3)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast t3; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t3, &t3, _ctx);
- _res = Z3_mk_ite(c, t1, t2, t3);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_iff(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_iff(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_implies(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_implies(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_xor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_xor(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_and(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_and(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_or(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_or(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_add(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_add(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_mul(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_mul(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_sub(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_sub(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_unary_minus(
- value _v_c,
- value _v_arg)
-{
- Z3_context c; /*in*/
- Z3_ast arg; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg, &arg, _ctx);
- _res = Z3_mk_unary_minus(c, arg);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_div(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_div(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_mod(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_mod(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_rem(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_rem(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_power(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_power(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_lt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_lt(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_le(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_le(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_gt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_gt(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_ge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ge(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int2real(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_int2real(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_real2int(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_real2int(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_is_int(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_is_int(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvnot(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvnot(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvredand(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvredand(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvredor(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvredor(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvand(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvand(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvor(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvxor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvxor(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvnand(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvnand(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvnor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvnor(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvxnor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvxnor(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvneg(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvneg(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvadd(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvadd(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsub(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsub(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvmul(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvmul(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvudiv(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvudiv(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsdiv(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsdiv(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvurem(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvurem(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsrem(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsrem(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsmod(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsmod(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvult(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvult(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvslt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvslt(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvule(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvule(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsle(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsle(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvuge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvuge(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsge(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvugt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvugt(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsgt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsgt(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_concat(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_concat(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_extract(
- value _v_c,
- value _v_high,
- value _v_low,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int high; /*in*/
- unsigned int low; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- high = Int_val(_v_high);
- low = Int_val(_v_low);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_extract(c, high, low, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_sign_ext(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_sign_ext(c, i, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_zero_ext(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_zero_ext(c, i, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_repeat(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_repeat(c, i, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvshl(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvshl(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvlshr(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvlshr(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvashr(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvashr(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_rotate_left(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_rotate_left(c, i, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_rotate_right(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_rotate_right(c, i, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_ext_rotate_left(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ext_rotate_left(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_ext_rotate_right(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ext_rotate_right(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int2bv(
- value _v_c,
- value _v_n,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int n; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- n = Int_val(_v_n);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_int2bv(c, n, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bv2int(
- value _v_c,
- value _v_t1,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bv2int(c, t1, is_signed);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvadd_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvadd_no_overflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvadd_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvadd_no_underflow(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsub_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsub_no_overflow(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsub_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvsub_no_underflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvsdiv_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsdiv_no_overflow(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvneg_no_overflow(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvneg_no_overflow(c, t1);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvmul_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvmul_no_overflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bvmul_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvmul_no_underflow(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_select(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_i, &i, _ctx);
- _res = Z3_mk_select(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_store(
- value _v_c,
- value _v_a,
- value _v_i,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast i; /*in*/
- Z3_ast v; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_i, &i, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- _res = Z3_mk_store(c, a, i, v);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_const_array(
- value _v_c,
- value _v_domain,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast v; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_domain, &domain, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- _res = Z3_mk_const_array(c, domain, v);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_map(
- value _v_c,
- value _v_f,
- value _v_n,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- unsigned int n; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- Z3_ast _c1;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- n = Int_val(_v_n);
- args = &_c1;
- camlidl_ml2c_z3_Z3_ast(_v_args, &_c1, _ctx);
- _res = Z3_mk_map(c, f, n, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_array_default(
- value _v_c,
- value _v_array)
-{
- Z3_context c; /*in*/
- Z3_ast array; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_array, &array, _ctx);
- _res = Z3_mk_array_default(c, array);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_sort(
- value _v_c,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_sort ty; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_set_sort(c, ty);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_empty_set(
- value _v_c,
- value _v_domain)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_domain, &domain, _ctx);
- _res = Z3_mk_empty_set(c, domain);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_full_set(
- value _v_c,
- value _v_domain)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_domain, &domain, _ctx);
- _res = Z3_mk_full_set(c, domain);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_add(
- value _v_c,
- value _v_set,
- value _v_elem)
-{
- Z3_context c; /*in*/
- Z3_ast set; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_set, &set, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_elem, &elem, _ctx);
- _res = Z3_mk_set_add(c, set, elem);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_del(
- value _v_c,
- value _v_set,
- value _v_elem)
-{
- Z3_context c; /*in*/
- Z3_ast set; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_set, &set, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_elem, &elem, _ctx);
- _res = Z3_mk_set_del(c, set, elem);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_union(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_set_union(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_intersect(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_set_intersect(c, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_difference(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_set_difference(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_complement(
- value _v_c,
- value _v_arg)
-{
- Z3_context c; /*in*/
- Z3_ast arg; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg, &arg, _ctx);
- _res = Z3_mk_set_complement(c, arg);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_member(
- value _v_c,
- value _v_elem,
- value _v_set)
-{
- Z3_context c; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast set; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_elem, &elem, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_set, &set, _ctx);
- _res = Z3_mk_set_member(c, elem, set);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_set_subset(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_set_subset(c, arg1, arg2);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_numeral(
- value _v_c,
- value _v_numeral,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_string numeral; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_numeral, &numeral, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_numeral(c, numeral, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_real(
- value _v_c,
- value _v_num,
- value _v_den)
-{
- Z3_context c; /*in*/
- int num; /*in*/
- int den; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- num = Int_val(_v_num);
- den = Int_val(_v_den);
- _res = Z3_mk_real(c, num, den);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int(
- value _v_c,
- value _v_v,
- value _v_ty)
-{
- Z3_context c; /*in*/
- int v; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- v = Int_val(_v_v);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_int(c, v, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_int64(
- value _v_c,
- value _v_v,
- value _v_ty)
-{
- Z3_context c; /*in*/
- long long v; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- v = Int64_val(_v_v);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_int64(c, v, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_pattern(
- value _v_c,
- value _v_terms)
-{
- Z3_context c; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_ast const *terms; /*in*/
- Z3_pattern _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_terms);
- terms = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_terms, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &terms[_c2], _ctx);
- }
- num_patterns = _c1;
- _res = Z3_mk_pattern(c, num_patterns, terms);
- _vres = camlidl_c2ml_z3_Z3_pattern(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_bound(
- value _v_c,
- value _v_index,
- value _v_ty)
-{
- Z3_context c; /*in*/
- unsigned int index; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- index = Int_val(_v_index);
- camlidl_ml2c_z3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_bound(c, index, ty);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_forall(
- value _v_c,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_forall(c, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_forall_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_forall(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_mk_exists(
- value _v_c,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_exists(c, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_exists_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_exists(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_mk_quantifier(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier(c, is_forall, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_quantifier_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_quantifier(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6]);
-}
-
-value camlidl_z3_Z3_mk_quantifier_ex(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_quantifier_id,
- value _v_skolem_id,
- value _v_patterns,
- value _v_no_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- Z3_symbol quantifier_id; /*in*/
- Z3_symbol skolem_id; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_no_patterns; /*in*/
- Z3_ast const *no_patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- camlidl_ml2c_z3_Z3_symbol(_v_quantifier_id, &quantifier_id, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_skolem_id, &skolem_id, _ctx);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_no_patterns);
- no_patterns = camlidl_malloc(_c4 * sizeof(Z3_ast const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_no_patterns, _c5);
- camlidl_ml2c_z3_Z3_ast(_v6, &no_patterns[_c5], _ctx);
- }
- num_no_patterns = _c4;
- _c7 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c7 * sizeof(Z3_sort const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_sorts, _c8);
- camlidl_ml2c_z3_Z3_sort(_v9, &sorts[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c10 * sizeof(Z3_symbol const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decl_names, _c11);
- camlidl_ml2c_z3_Z3_symbol(_v12, &decl_names[_c11], _ctx);
- }
- num_decls = _c10;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_ex(c, is_forall, weight, quantifier_id, skolem_id, num_patterns, patterns, num_no_patterns, no_patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_quantifier_ex_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_quantifier_ex(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[9]);
-}
-
-value camlidl_z3_Z3_mk_forall_const(
- value _v_c,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_forall_const(c, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_exists_const(
- value _v_c,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_exists_const(c, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_quantifier_const(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_const(c, is_forall, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_quantifier_const_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_quantifier_const(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_mk_quantifier_const_ex(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_quantifier_id,
- value _v_skolem_id,
- value _v_bound,
- value _v_patterns,
- value _v_no_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- Z3_symbol quantifier_id; /*in*/
- Z3_symbol skolem_id; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_no_patterns; /*in*/
- Z3_ast const *no_patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- camlidl_ml2c_z3_Z3_symbol(_v_quantifier_id, &quantifier_id, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_skolem_id, &skolem_id, _ctx);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- _c7 = Wosize_val(_v_no_patterns);
- no_patterns = camlidl_malloc(_c7 * sizeof(Z3_ast const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_no_patterns, _c8);
- camlidl_ml2c_z3_Z3_ast(_v9, &no_patterns[_c8], _ctx);
- }
- num_no_patterns = _c7;
- camlidl_ml2c_z3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_const_ex(c, is_forall, weight, quantifier_id, skolem_id, num_bound, bound, num_patterns, patterns, num_no_patterns, no_patterns, body);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_quantifier_const_ex_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_mk_quantifier_const_ex(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8]);
-}
-
-value camlidl_z3_Z3_get_symbol_kind(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_symbol_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_kind(c, s);
- _vres = camlidl_c2ml_z3_Z3_symbol_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_symbol_int(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_int(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_symbol_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_string(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_sort_name(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_sort d; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_d, &d, _ctx);
- _res = Z3_get_sort_name(c, d);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_sort_id(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_get_sort_id(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_sort_to_ast(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_sort_to_ast(c, s);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_eq_sort(
- value _v_c,
- value _v_s1,
- value _v_s2)
-{
- Z3_context c; /*in*/
- Z3_sort s1; /*in*/
- Z3_sort s2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s1, &s1, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s2, &s2, _ctx);
- _res = Z3_is_eq_sort(c, s1, s2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_sort_kind(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_sort_kind(c, t);
- _vres = camlidl_c2ml_z3_Z3_sort_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_bv_sort_size(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_bv_sort_size(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_finite_domain_sort_size(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned long long *r; /*out*/
- unsigned long long _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- r = &_c1;
- Z3_get_finite_domain_sort_size(c, s, r);
- if (r == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = copy_int64(*r);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_array_sort_domain(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_array_sort_domain(c, t);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_array_sort_range(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_array_sort_range(c, t);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_tuple_sort_mk_decl(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_tuple_sort_mk_decl(c, t);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_tuple_sort_num_fields(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_tuple_sort_num_fields(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_tuple_sort_field_decl(
- value _v_c,
- value _v_t,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_tuple_sort_field_decl(c, t, i);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_datatype_sort_num_constructors(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_datatype_sort_num_constructors(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_datatype_sort_constructor(
- value _v_c,
- value _v_t,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_datatype_sort_constructor(c, t, idx);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_datatype_sort_recognizer(
- value _v_c,
- value _v_t,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_datatype_sort_recognizer(c, t, idx);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_datatype_sort_constructor_accessor(
- value _v_c,
- value _v_t,
- value _v_idx_c,
- value _v_idx_a)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx_c; /*in*/
- unsigned int idx_a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_t, &t, _ctx);
- idx_c = Int_val(_v_idx_c);
- idx_a = Int_val(_v_idx_a);
- _res = Z3_get_datatype_sort_constructor_accessor(c, t, idx_c, idx_a);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_relation_arity(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_get_relation_arity(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_relation_column(
- value _v_c,
- value _v_s,
- value _v_col)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int col; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- col = Int_val(_v_col);
- _res = Z3_get_relation_column(c, s, col);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_decl_to_ast(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- _res = Z3_func_decl_to_ast(c, f);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_eq_func_decl(
- value _v_c,
- value _v_f1,
- value _v_f2)
-{
- Z3_context c; /*in*/
- Z3_func_decl f1; /*in*/
- Z3_func_decl f2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f1, &f1, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f2, &f2, _ctx);
- _res = Z3_is_eq_func_decl(c, f1, f2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_func_decl_id(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- _res = Z3_get_func_decl_id(c, f);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_name(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_name(c, d);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_kind(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_decl_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_kind(c, d);
- _vres = camlidl_c2ml_z3_Z3_decl_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_domain_size(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_domain_size(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_arity(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_arity(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_domain(
- value _v_c,
- value _v_d,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_domain(c, d, i);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_range(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_range(c, d);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_num_parameters(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_num_parameters(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_parameter_kind(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_parameter_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_parameter_kind(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_parameter_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_int_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_int_parameter(c, d, idx);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_double_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- double _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_double_parameter(c, d, idx);
- _vres = copy_double(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_symbol_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_symbol_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_sort_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_sort_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_ast_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_ast_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_func_decl_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_func_decl_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_decl_rational_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_rational_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_app_to_ast(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_app_to_ast(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_app_decl(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_get_app_decl(c, a);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_app_num_args(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_get_app_num_args(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_app_arg(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_app(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_app_arg(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_eq_ast(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_is_eq_ast(c, t1, t2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_ast_id(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_ast t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t, &t, _ctx);
- _res = Z3_get_ast_id(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_ast_hash(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_ast_hash(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_sort(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_sort(c, a);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_well_sorted(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_ast t; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t, &t, _ctx);
- _res = Z3_is_well_sorted(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_bool_value(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_lbool _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_bool_value(c, a);
- _vres = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_ast_kind(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_ast_kind(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast_kind(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_app(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_app(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_numeral_ast(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_numeral_ast(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_algebraic_number(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_algebraic_number(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_to_app(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_app _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_to_app(c, a);
- _vres = camlidl_c2ml_z3_Z3_app(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_to_func_decl(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_to_func_decl(c, a);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_numeral_string(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_numeral_string(c, a);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_numeral_decimal_string(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_numeral_decimal_string(c, a, precision);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_numerator(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_numerator(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_denominator(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_denominator(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_numeral_small(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- long long *num; /*out*/
- long long *den; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- long long _c2;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- num = &_c1;
- den = &_c2;
- _res = Z3_get_numeral_small(c, a, num, den);
- Begin_roots_block(_vres, 3)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*num);
- _vres[2] = copy_int64(*den);
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_get_numeral_int(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- int *i; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- int _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- i = &_c1;
- _res = Z3_get_numeral_int(c, v, i);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = Val_int(*i);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_get_numeral_int64(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- long long *i; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- i = &_c1;
- _res = Z3_get_numeral_int64(c, v, i);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*i);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_get_numeral_rational_int64(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- long long *num; /*out*/
- long long *den; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- long long _c2;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- num = &_c1;
- den = &_c2;
- _res = Z3_get_numeral_rational_int64(c, v, num, den);
- Begin_roots_block(_vres, 3)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*num);
- _vres[2] = copy_int64(*den);
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-value camlidl_z3_Z3_get_algebraic_number_lower(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_algebraic_number_lower(c, a, precision);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_algebraic_number_upper(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_algebraic_number_upper(c, a, precision);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_pattern_to_ast(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_pattern_to_ast(c, p);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_pattern_num_terms(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_get_pattern_num_terms(c, p);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_pattern(
- value _v_c,
- value _v_p,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_pattern(_v_p, &p, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_pattern(c, p, idx);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_index_value(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_index_value(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_quantifier_forall(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_quantifier_forall(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_weight(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_weight(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_num_patterns(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_patterns(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_pattern_ast(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_pattern _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_pattern_ast(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_pattern(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_num_no_patterns(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_no_patterns(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_no_pattern_ast(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_no_pattern_ast(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_num_bound(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_bound(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_bound_name(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_bound_name(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_bound_sort(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_bound_sort(c, a, i);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_quantifier_body(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_body(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_simplify(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_simplify(c, a);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_simplify_ex(
- value _v_c,
- value _v_a,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_params p; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- _res = Z3_simplify_ex(c, a, p);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_simplify_get_help(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_simplify_get_help(c);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_simplify_get_param_descrs(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_param_descrs _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_simplify_get_param_descrs(c);
- _vres = camlidl_c2ml_z3_Z3_param_descrs(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_update_term(
- value _v_c,
- value _v_a,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_update_term(c, a, num_args, args);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_substitute(
- value _v_c,
- value _v_a,
- value _v_from,
- value _v_to)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_exprs; /*in*/
- Z3_ast const *from; /*in*/
- Z3_ast const *to; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_from);
- from = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_from, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &from[_c2], _ctx);
- }
- num_exprs = _c1;
- _c4 = Wosize_val(_v_to);
- to = camlidl_malloc(_c4 * sizeof(Z3_ast const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_to, _c5);
- camlidl_ml2c_z3_Z3_ast(_v6, &to[_c5], _ctx);
- }
- num_exprs = _c4;
- _res = Z3_substitute(c, a, num_exprs, from, to);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_substitute_vars(
- value _v_c,
- value _v_a,
- value _v_to)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_exprs; /*in*/
- Z3_ast const *to; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_to);
- to = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_to, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &to[_c2], _ctx);
- }
- num_exprs = _c1;
- _res = Z3_substitute_vars(c, a, num_exprs, to);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_translate(
- value _v_source,
- value _v_a,
- value _v_target)
-{
- Z3_context source; /*in*/
- Z3_ast a; /*in*/
- Z3_context target; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_source, &source, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_context(_v_target, &target, _ctx);
- _res = Z3_translate(source, a, target);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(source);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_eval(
- value _v_c,
- value _v_m,
- value _v_t,
- value _v_model_completion)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_ast t; /*in*/
- int model_completion; /*in*/
- Z3_ast *v; /*out*/
- Z3_ast _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_t, &t, _ctx);
- model_completion = Int_val(_v_model_completion);
- v = &_c1;
- Z3_model_eval(c, m, t, model_completion, v);
- if (v == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = camlidl_c2ml_z3_Z3_ast(&*v, _ctx);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_const_interp(
- value _v_c,
- value _v_m,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_func_decl a; /*in*/
- Z3_ast_opt _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_a, &a, _ctx);
- _res = Z3_model_get_const_interp(c, m, a);
- _vres = camlidl_c2ml_z3_Z3_ast_opt(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_func_interp(
- value _v_c,
- value _v_m,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_func_decl f; /*in*/
- Z3_func_interp_opt _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- _res = Z3_model_get_func_interp(c, m, f);
- _vres = camlidl_c2ml_z3_Z3_func_interp_opt(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_num_consts(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_model_get_num_consts(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_const_decl(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_model_get_const_decl(c, m, i);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_num_funcs(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_model_get_num_funcs(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_func_decl(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_model_get_func_decl(c, m, i);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_num_sorts(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_model_get_num_sorts(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_sort(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_model_get_sort(c, m, i);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_get_sort_universe(
- value _v_c,
- value _v_m,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_sort s; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_model_get_sort_universe(c, m, s);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_is_as_array(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_as_array(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_as_array_func_decl(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_as_array_func_decl(c, a);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_interp_get_num_entries(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_interp f; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_interp(_v_f, &f, _ctx);
- _res = Z3_func_interp_get_num_entries(c, f);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_interp_get_entry(
- value _v_c,
- value _v_f,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_func_interp f; /*in*/
- unsigned int i; /*in*/
- Z3_func_entry _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_interp(_v_f, &f, _ctx);
- i = Int_val(_v_i);
- _res = Z3_func_interp_get_entry(c, f, i);
- _vres = camlidl_c2ml_z3_Z3_func_entry(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_interp_get_else(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_interp f; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_interp(_v_f, &f, _ctx);
- _res = Z3_func_interp_get_else(c, f);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_interp_get_arity(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_interp f; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_interp(_v_f, &f, _ctx);
- _res = Z3_func_interp_get_arity(c, f);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_entry_get_value(
- value _v_c,
- value _v_e)
-{
- Z3_context c; /*in*/
- Z3_func_entry e; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_entry(_v_e, &e, _ctx);
- _res = Z3_func_entry_get_value(c, e);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_entry_get_num_args(
- value _v_c,
- value _v_e)
-{
- Z3_context c; /*in*/
- Z3_func_entry e; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_entry(_v_e, &e, _ctx);
- _res = Z3_func_entry_get_num_args(c, e);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_entry_get_arg(
- value _v_c,
- value _v_e,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_func_entry e; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_entry(_v_e, &e, _ctx);
- i = Int_val(_v_i);
- _res = Z3_func_entry_get_arg(c, e, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_open_log(
- value _v_filename)
-{
- Z3_string filename; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_string(_v_filename, &filename, _ctx);
- _res = Z3_open_log(filename);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3_Z3_append_log(
- value _v_string)
-{
- Z3_string string; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_string(_v_string, &string, _ctx);
- Z3_append_log(string);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3_Z3_close_log(value _unit)
-{
- Z3_close_log();
- return Val_unit;
-}
-
-value camlidl_z3_Z3_toggle_warning_messages(
- value _v_enabled)
-{
- int enabled; /*in*/
- enabled = Int_val(_v_enabled);
- Z3_toggle_warning_messages(enabled);
- return Val_unit;
-}
-
-value camlidl_z3_Z3_set_ast_print_mode(
- value _v_c,
- value _v_mode)
-{
- Z3_context c; /*in*/
- Z3_ast_print_mode mode; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_print_mode(_v_mode, &mode, _ctx);
- Z3_set_ast_print_mode(c, mode);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_to_string(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_ast_to_string(c, a);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_pattern_to_string(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_pattern_to_string(c, p);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_sort_to_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_sort_to_string(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_func_decl_to_string(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_func_decl_to_string(c, d);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_model_to_string(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_model_to_string(c, m);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_benchmark_to_smtlib_string(
- value _v_c,
- value _v_name,
- value _v_logic,
- value _v_status,
- value _v_attributes,
- value _v_assumptions,
- value _v_formula)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_string logic; /*in*/
- Z3_string status; /*in*/
- Z3_string attributes; /*in*/
- unsigned int num_assumptions; /*in*/
- Z3_ast const *assumptions; /*in*/
- Z3_ast formula; /*in*/
- Z3_string _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_name, &name, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_logic, &logic, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_status, &status, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_attributes, &attributes, _ctx);
- _c1 = Wosize_val(_v_assumptions);
- assumptions = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_assumptions, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &assumptions[_c2], _ctx);
- }
- num_assumptions = _c1;
- camlidl_ml2c_z3_Z3_ast(_v_formula, &formula, _ctx);
- _res = Z3_benchmark_to_smtlib_string(c, name, logic, status, attributes, num_assumptions, assumptions, formula);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_benchmark_to_smtlib_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_benchmark_to_smtlib_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6]);
-}
-
-value camlidl_z3_Z3_parse_smtlib2_string(
- value _v_c,
- value _v_str,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string str; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_str, &str, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- _res = Z3_parse_smtlib2_string(c, str, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_parse_smtlib2_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_parse_smtlib2_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_parse_smtlib2_file(
- value _v_c,
- value _v_file_name,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string file_name; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_file_name, &file_name, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- _res = Z3_parse_smtlib2_file(c, file_name, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_parse_smtlib2_file_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_parse_smtlib2_file(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_parse_smtlib_string(
- value _v_c,
- value _v_str,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string str; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_str, &str, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- Z3_parse_smtlib_string(c, str, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_parse_smtlib_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_parse_smtlib_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_parse_smtlib_file(
- value _v_c,
- value _v_file_name,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string file_name; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_file_name, &file_name, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- Z3_parse_smtlib_file(c, file_name, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_parse_smtlib_file_bytecode(value * argv, int argn)
-{
- return camlidl_z3_Z3_parse_smtlib_file(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3_Z3_get_smtlib_num_formulas(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_formulas(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_formula(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_formula(c, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_num_assumptions(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_assumptions(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_assumption(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_assumption(c, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_num_decls(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_decls(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_decl(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_decl(c, i);
- _vres = camlidl_c2ml_z3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_num_sorts(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_sorts(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_sort(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_sort(c, i);
- _vres = camlidl_c2ml_z3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_smtlib_error(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_error(c);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_set_error(
- value _v_c,
- value _v_e)
-{
- Z3_context c; /*in*/
- Z3_error_code e; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_error_code(_v_e, &e, _ctx);
- Z3_set_error(c, e);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_get_error_msg_ex(
- value _v_c,
- value _v_err)
-{
- Z3_context c; /*in*/
- Z3_error_code err; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_error_code(_v_err, &err, _ctx);
- _res = Z3_get_error_msg_ex(c, err);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_version(value _unit)
-{
- unsigned int *major; /*out*/
- unsigned int *minor; /*out*/
- unsigned int *build_number; /*out*/
- unsigned int *revision_number; /*out*/
- unsigned int _c1;
- unsigned int _c2;
- unsigned int _c3;
- unsigned int _c4;
- value _vresult;
- value _vres[4] = { 0, 0, 0, 0, };
-
- major = &_c1;
- minor = &_c2;
- build_number = &_c3;
- revision_number = &_c4;
- Z3_get_version(major, minor, build_number, revision_number);
- Begin_roots_block(_vres, 4)
- _vres[0] = Val_int(*major);
- _vres[1] = Val_int(*minor);
- _vres[2] = Val_int(*build_number);
- _vres[3] = Val_int(*revision_number);
- _vresult = camlidl_alloc_small(4, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- Field(_vresult, 3) = _vres[3];
- End_roots()
- return _vresult;
-}
-
-value camlidl_z3_Z3_enable_trace(
- value _v_tag)
-{
- Z3_string tag; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_string(_v_tag, &tag, _ctx);
- Z3_enable_trace(tag);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3_Z3_disable_trace(
- value _v_tag)
-{
- Z3_string tag; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_string(_v_tag, &tag, _ctx);
- Z3_disable_trace(tag);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3_Z3_mk_fixedpoint(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_fixedpoint(c);
- _vres = camlidl_c2ml_z3_Z3_fixedpoint(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_add_rule(
- value _v_c,
- value _v_d,
- value _v_rule,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_ast rule; /*in*/
- Z3_symbol name; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_rule, &rule, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- Z3_fixedpoint_add_rule(c, d, rule, name);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_add_fact(
- value _v_c,
- value _v_d,
- value _v_r,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_func_decl r; /*in*/
- unsigned int num_args; /*in*/
- unsigned int *args; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_r, &r, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(unsigned int ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- args[_c2] = Int_val(_v3);
- }
- num_args = _c1;
- Z3_fixedpoint_add_fact(c, d, r, num_args, args);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_assert(
- value _v_c,
- value _v_d,
- value _v_axiom)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_ast axiom; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_axiom, &axiom, _ctx);
- Z3_fixedpoint_assert(c, d, axiom);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_query(
- value _v_c,
- value _v_d,
- value _v_query)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_ast query; /*in*/
- Z3_lbool _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_query, &query, _ctx);
- _res = Z3_fixedpoint_query(c, d, query);
- _vres = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_query_relations(
- value _v_c,
- value _v_d,
- value _v_relations)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- unsigned int num_relations; /*in*/
- Z3_func_decl const *relations; /*in*/
- Z3_lbool _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- _c1 = Wosize_val(_v_relations);
- relations = camlidl_malloc(_c1 * sizeof(Z3_func_decl const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_relations, _c2);
- camlidl_ml2c_z3_Z3_func_decl(_v3, &relations[_c2], _ctx);
- }
- num_relations = _c1;
- _res = Z3_fixedpoint_query_relations(c, d, num_relations, relations);
- _vres = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_answer(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- _res = Z3_fixedpoint_get_answer(c, d);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_reason_unknown(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- _res = Z3_fixedpoint_get_reason_unknown(c, d);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_update_rule(
- value _v_c,
- value _v_d,
- value _v_a,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_ast a; /*in*/
- Z3_symbol name; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_name, &name, _ctx);
- Z3_fixedpoint_update_rule(c, d, a, name);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_num_levels(
- value _v_c,
- value _v_d,
- value _v_pred)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_func_decl pred; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_pred, &pred, _ctx);
- _res = Z3_fixedpoint_get_num_levels(c, d, pred);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_cover_delta(
- value _v_c,
- value _v_d,
- value _v_level,
- value _v_pred)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- int level; /*in*/
- Z3_func_decl pred; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- level = Int_val(_v_level);
- camlidl_ml2c_z3_Z3_func_decl(_v_pred, &pred, _ctx);
- _res = Z3_fixedpoint_get_cover_delta(c, d, level, pred);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_add_cover(
- value _v_c,
- value _v_d,
- value _v_level,
- value _v_pred,
- value _v_property)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- int level; /*in*/
- Z3_func_decl pred; /*in*/
- Z3_ast property; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- level = Int_val(_v_level);
- camlidl_ml2c_z3_Z3_func_decl(_v_pred, &pred, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_property, &property, _ctx);
- Z3_fixedpoint_add_cover(c, d, level, pred, property);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_statistics(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_stats _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- _res = Z3_fixedpoint_get_statistics(c, d);
- _vres = camlidl_c2ml_z3_Z3_stats(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_register_relation(
- value _v_c,
- value _v_d,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_func_decl f; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- Z3_fixedpoint_register_relation(c, d, f);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_set_predicate_representation(
- value _v_c,
- value _v_d,
- value _v_f,
- value _v_relation_kinds)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- Z3_func_decl f; /*in*/
- unsigned int num_relations; /*in*/
- Z3_symbol const *relation_kinds; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- camlidl_ml2c_z3_Z3_func_decl(_v_f, &f, _ctx);
- _c1 = Wosize_val(_v_relation_kinds);
- relation_kinds = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_relation_kinds, _c2);
- camlidl_ml2c_z3_Z3_symbol(_v3, &relation_kinds[_c2], _ctx);
- }
- num_relations = _c1;
- Z3_fixedpoint_set_predicate_representation(c, d, f, num_relations, relation_kinds);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_rules(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- _res = Z3_fixedpoint_get_rules(c, f);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_assertions(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- _res = Z3_fixedpoint_get_assertions(c, f);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_set_params(
- value _v_c,
- value _v_f,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_params p; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- Z3_fixedpoint_set_params(c, f, p);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_help(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- _res = Z3_fixedpoint_get_help(c, f);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_get_param_descrs(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_param_descrs _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- _res = Z3_fixedpoint_get_param_descrs(c, f);
- _vres = camlidl_c2ml_z3_Z3_param_descrs(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_to_string(
- value _v_c,
- value _v_f,
- value _v_queries)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- unsigned int num_queries; /*in*/
- Z3_ast *queries; /*in*/
- Z3_string _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- _c1 = Wosize_val(_v_queries);
- queries = camlidl_malloc(_c1 * sizeof(Z3_ast ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_queries, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &queries[_c2], _ctx);
- }
- num_queries = _c1;
- _res = Z3_fixedpoint_to_string(c, f, num_queries, queries);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_from_string(
- value _v_c,
- value _v_f,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_string s; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_s, &s, _ctx);
- _res = Z3_fixedpoint_from_string(c, f, s);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_from_file(
- value _v_c,
- value _v_f,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint f; /*in*/
- Z3_string s; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_f, &f, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_s, &s, _ctx);
- _res = Z3_fixedpoint_from_file(c, f, s);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_fixedpoint_push(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- Z3_fixedpoint_push(c, d);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_fixedpoint_pop(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_fixedpoint d; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_fixedpoint(_v_d, &d, _ctx);
- Z3_fixedpoint_pop(c, d);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_mk_ast_vector(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_ast_vector(c);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_vector_size(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- _res = Z3_ast_vector_size(c, v);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_vector_get(
- value _v_c,
- value _v_v,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- i = Int_val(_v_i);
- _res = Z3_ast_vector_get(c, v, i);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_vector_set(
- value _v_c,
- value _v_v,
- value _v_i,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- unsigned int i; /*in*/
- Z3_ast a; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- Z3_ast_vector_set(c, v, i, a);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_vector_resize(
- value _v_c,
- value _v_v,
- value _v_n)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- unsigned int n; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- n = Int_val(_v_n);
- Z3_ast_vector_resize(c, v, n);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_vector_push(
- value _v_c,
- value _v_v,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- Z3_ast a; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- Z3_ast_vector_push(c, v, a);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_vector_translate(
- value _v_s,
- value _v_v,
- value _v_t)
-{
- Z3_context s; /*in*/
- Z3_ast_vector v; /*in*/
- Z3_context t; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_s, &s, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- camlidl_ml2c_z3_Z3_context(_v_t, &t, _ctx);
- _res = Z3_ast_vector_translate(s, v, t);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(s);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_vector_to_string(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast_vector v; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_vector(_v_v, &v, _ctx);
- _res = Z3_ast_vector_to_string(c, v);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_ast_map(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast_map _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_ast_map(c);
- _vres = camlidl_c2ml_z3_Z3_ast_map(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_map_contains(
- value _v_c,
- value _v_m,
- value _v_k)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_ast k; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_k, &k, _ctx);
- _res = Z3_ast_map_contains(c, m, k);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_map_find(
- value _v_c,
- value _v_m,
- value _v_k)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_ast k; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_k, &k, _ctx);
- _res = Z3_ast_map_find(c, m, k);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_map_insert(
- value _v_c,
- value _v_m,
- value _v_k,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_ast k; /*in*/
- Z3_ast v; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_k, &k, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_v, &v, _ctx);
- Z3_ast_map_insert(c, m, k, v);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_map_erase(
- value _v_c,
- value _v_m,
- value _v_k)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_ast k; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_k, &k, _ctx);
- Z3_ast_map_erase(c, m, k);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_map_reset(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- Z3_ast_map_reset(c, m);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_ast_map_size(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- _res = Z3_ast_map_size(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_map_keys(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- _res = Z3_ast_map_keys(c, m);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_ast_map_to_string(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_ast_map m; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_ast_map(_v_m, &m, _ctx);
- _res = Z3_ast_map_to_string(c, m);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_goal(
- value _v_c,
- value _v_models,
- value _v_unsat_cores,
- value _v_proofs)
-{
- Z3_context c; /*in*/
- int models; /*in*/
- int unsat_cores; /*in*/
- int proofs; /*in*/
- Z3_goal _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- models = Int_val(_v_models);
- unsat_cores = Int_val(_v_unsat_cores);
- proofs = Int_val(_v_proofs);
- _res = Z3_mk_goal(c, models, unsat_cores, proofs);
- _vres = camlidl_c2ml_z3_Z3_goal(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_precision(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- Z3_goal_prec _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_precision(c, g);
- _vres = camlidl_c2ml_z3_Z3_goal_prec(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_assert(
- value _v_c,
- value _v_g,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- Z3_ast a; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- Z3_goal_assert(c, g, a);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_goal_inconsistent(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_inconsistent(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_depth(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_depth(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_reset(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- Z3_goal_reset(c, g);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_goal_size(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_size(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_formula(
- value _v_c,
- value _v_g,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_goal_formula(c, g, idx);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_num_exprs(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_num_exprs(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_is_decided_sat(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_is_decided_sat(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_is_decided_unsat(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_is_decided_unsat(c, g);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_translate(
- value _v_source,
- value _v_g,
- value _v_target)
-{
- Z3_context source; /*in*/
- Z3_goal g; /*in*/
- Z3_context target; /*in*/
- Z3_goal _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_source, &source, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- camlidl_ml2c_z3_Z3_context(_v_target, &target, _ctx);
- _res = Z3_goal_translate(source, g, target);
- _vres = camlidl_c2ml_z3_Z3_goal(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(source);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_goal_to_string(
- value _v_c,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_goal g; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_goal_to_string(c, g);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_tactic(
- value _v_c,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_name, &name, _ctx);
- _res = Z3_mk_tactic(c, name);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_probe(
- value _v_c,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_name, &name, _ctx);
- _res = Z3_mk_probe(c, name);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_and_then(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_tactic t1; /*in*/
- Z3_tactic t2; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t2, &t2, _ctx);
- _res = Z3_tactic_and_then(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_or_else(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_tactic t1; /*in*/
- Z3_tactic t2; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t2, &t2, _ctx);
- _res = Z3_tactic_or_else(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_par_or(
- value _v_c,
- value _v_ts)
-{
- Z3_context c; /*in*/
- unsigned int num; /*in*/
- Z3_tactic const *ts; /*in*/
- Z3_tactic _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_ts);
- ts = camlidl_malloc(_c1 * sizeof(Z3_tactic const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_ts, _c2);
- camlidl_ml2c_z3_Z3_tactic(_v3, &ts[_c2], _ctx);
- }
- num = _c1;
- _res = Z3_tactic_par_or(c, num, ts);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_par_and_then(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_tactic t1; /*in*/
- Z3_tactic t2; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t2, &t2, _ctx);
- _res = Z3_tactic_par_and_then(c, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_try_for(
- value _v_c,
- value _v_t,
- value _v_ms)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- unsigned int ms; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- ms = Int_val(_v_ms);
- _res = Z3_tactic_try_for(c, t, ms);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_when(
- value _v_c,
- value _v_p,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_probe p; /*in*/
- Z3_tactic t; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- _res = Z3_tactic_when(c, p, t);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_cond(
- value _v_c,
- value _v_p,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_probe p; /*in*/
- Z3_tactic t1; /*in*/
- Z3_tactic t2; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t2, &t2, _ctx);
- _res = Z3_tactic_cond(c, p, t1, t2);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_repeat(
- value _v_c,
- value _v_t,
- value _v_max)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- unsigned int max; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- max = Int_val(_v_max);
- _res = Z3_tactic_repeat(c, t, max);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_skip(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_tactic_skip(c);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_fail(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_tactic_fail(c);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_fail_if(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_probe p; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p, &p, _ctx);
- _res = Z3_tactic_fail_if(c, p);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_fail_if_not_decided(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_tactic_fail_if_not_decided(c);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_using_params(
- value _v_c,
- value _v_t,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_params p; /*in*/
- Z3_tactic _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- _res = Z3_tactic_using_params(c, t, p);
- _vres = camlidl_c2ml_z3_Z3_tactic(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_const(
- value _v_x,
- value _v_val)
-{
- Z3_context x; /*in*/
- double val; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- val = Double_val(_v_val);
- _res = Z3_probe_const(x, val);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_lt(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_lt(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_gt(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_gt(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_le(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_le(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_ge(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_ge(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_eq(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_eq(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_and(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_and(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_or(
- value _v_x,
- value _v_p1,
- value _v_p2)
-{
- Z3_context x; /*in*/
- Z3_probe p1; /*in*/
- Z3_probe p2; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p1, &p1, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p2, &p2, _ctx);
- _res = Z3_probe_or(x, p1, p2);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_not(
- value _v_x,
- value _v_p)
-{
- Z3_context x; /*in*/
- Z3_probe p; /*in*/
- Z3_probe _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_x, &x, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p, &p, _ctx);
- _res = Z3_probe_not(x, p);
- _vres = camlidl_c2ml_z3_Z3_probe(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(x);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_num_tactics(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_num_tactics(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_tactic_name(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_tactic_name(c, i);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_num_probes(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_num_probes(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_probe_name(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_probe_name(c, i);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_get_help(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- _res = Z3_tactic_get_help(c, t);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_get_param_descrs(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_param_descrs _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- _res = Z3_tactic_get_param_descrs(c, t);
- _vres = camlidl_c2ml_z3_Z3_param_descrs(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_get_descr(
- value _v_c,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_name, &name, _ctx);
- _res = Z3_tactic_get_descr(c, name);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_get_descr(
- value _v_c,
- value _v_name)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_string(_v_name, &name, _ctx);
- _res = Z3_probe_get_descr(c, name);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_probe_apply(
- value _v_c,
- value _v_p,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_probe p; /*in*/
- Z3_goal g; /*in*/
- double _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_probe(_v_p, &p, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_probe_apply(c, p, g);
- _vres = copy_double(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_apply(
- value _v_c,
- value _v_t,
- value _v_g)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_goal g; /*in*/
- Z3_apply_result _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- _res = Z3_tactic_apply(c, t, g);
- _vres = camlidl_c2ml_z3_Z3_apply_result(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_tactic_apply_ex(
- value _v_c,
- value _v_t,
- value _v_g,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_goal g; /*in*/
- Z3_params p; /*in*/
- Z3_apply_result _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- camlidl_ml2c_z3_Z3_goal(_v_g, &g, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- _res = Z3_tactic_apply_ex(c, t, g, p);
- _vres = camlidl_c2ml_z3_Z3_apply_result(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_apply_result_to_string(
- value _v_c,
- value _v_r)
-{
- Z3_context c; /*in*/
- Z3_apply_result r; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_apply_result(_v_r, &r, _ctx);
- _res = Z3_apply_result_to_string(c, r);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_apply_result_get_num_subgoals(
- value _v_c,
- value _v_r)
-{
- Z3_context c; /*in*/
- Z3_apply_result r; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_apply_result(_v_r, &r, _ctx);
- _res = Z3_apply_result_get_num_subgoals(c, r);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_apply_result_get_subgoal(
- value _v_c,
- value _v_r,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_apply_result r; /*in*/
- unsigned int i; /*in*/
- Z3_goal _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_apply_result(_v_r, &r, _ctx);
- i = Int_val(_v_i);
- _res = Z3_apply_result_get_subgoal(c, r, i);
- _vres = camlidl_c2ml_z3_Z3_goal(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_apply_result_convert_model(
- value _v_c,
- value _v_r,
- value _v_i,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_apply_result r; /*in*/
- unsigned int i; /*in*/
- Z3_model m; /*in*/
- Z3_model _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_apply_result(_v_r, &r, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_apply_result_convert_model(c, r, i, m);
- _vres = camlidl_c2ml_z3_Z3_model(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_solver(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_solver _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_solver(c);
- _vres = camlidl_c2ml_z3_Z3_solver(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_simple_solver(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_solver _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_simple_solver(c);
- _vres = camlidl_c2ml_z3_Z3_solver(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_solver_for_logic(
- value _v_c,
- value _v_logic)
-{
- Z3_context c; /*in*/
- Z3_symbol logic; /*in*/
- Z3_solver _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_symbol(_v_logic, &logic, _ctx);
- _res = Z3_mk_solver_for_logic(c, logic);
- _vres = camlidl_c2ml_z3_Z3_solver(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_mk_solver_from_tactic(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_tactic t; /*in*/
- Z3_solver _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_tactic(_v_t, &t, _ctx);
- _res = Z3_mk_solver_from_tactic(c, t);
- _vres = camlidl_c2ml_z3_Z3_solver(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_help(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_help(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_param_descrs(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_param_descrs _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_param_descrs(c, s);
- _vres = camlidl_c2ml_z3_Z3_param_descrs(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_set_params(
- value _v_c,
- value _v_s,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_params p; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- camlidl_ml2c_z3_Z3_params(_v_p, &p, _ctx);
- Z3_solver_set_params(c, s, p);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_push(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- Z3_solver_push(c, s);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_pop(
- value _v_c,
- value _v_s,
- value _v_n)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- unsigned int n; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- n = Int_val(_v_n);
- Z3_solver_pop(c, s, n);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_reset(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- Z3_solver_reset(c, s);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_get_num_scopes(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_num_scopes(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_assert(
- value _v_c,
- value _v_s,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_ast a; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- Z3_solver_assert(c, s, a);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_assert_and_track(
- value _v_c,
- value _v_s,
- value _v_a,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_ast a; /*in*/
- Z3_ast p; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3_Z3_ast(_v_p, &p, _ctx);
- Z3_solver_assert_and_track(c, s, a, p);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return Val_unit;
-}
-
-value camlidl_z3_Z3_solver_get_assertions(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_assertions(c, s);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_check(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_lbool _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_check(c, s);
- _vres = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_check_assumptions(
- value _v_c,
- value _v_s,
- value _v_assumptions)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- unsigned int num_assumptions; /*in*/
- Z3_ast const *assumptions; /*in*/
- Z3_lbool _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _c1 = Wosize_val(_v_assumptions);
- assumptions = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_assumptions, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &assumptions[_c2], _ctx);
- }
- num_assumptions = _c1;
- _res = Z3_solver_check_assumptions(c, s, num_assumptions, assumptions);
- _vres = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_model(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_model _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_model(c, s);
- _vres = camlidl_c2ml_z3_Z3_model(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_proof(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_proof(c, s);
- _vres = camlidl_c2ml_z3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_unsat_core(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_ast_vector _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_unsat_core(c, s);
- _vres = camlidl_c2ml_z3_Z3_ast_vector(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_reason_unknown(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_reason_unknown(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_get_statistics(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_stats _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_get_statistics(c, s);
- _vres = camlidl_c2ml_z3_Z3_stats(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_solver_to_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _res = Z3_solver_to_string(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_to_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- _res = Z3_stats_to_string(c, s);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_size(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- _res = Z3_stats_size(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_get_key(
- value _v_c,
- value _v_s,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int idx; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_stats_get_key(c, s, idx);
- _vres = camlidl_c2ml_z3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_is_uint(
- value _v_c,
- value _v_s,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int idx; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_stats_is_uint(c, s, idx);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_is_double(
- value _v_c,
- value _v_s,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int idx; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_stats_is_double(c, s, idx);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_get_uint_value(
- value _v_c,
- value _v_s,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int idx; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_stats_get_uint_value(c, s, idx);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_stats_get_double_value(
- value _v_c,
- value _v_s,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_stats s; /*in*/
- unsigned int idx; /*in*/
- double _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_stats(_v_s, &s, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_stats_get_double_value(c, s, idx);
- _vres = copy_double(_res);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3_Z3_get_implied_equalities(
- value _v_c,
- value _v_s,
- value _v_terms)
-{
- Z3_context c; /*in*/
- Z3_solver s; /*in*/
- unsigned int num_terms; /*in*/
- Z3_ast const *terms; /*in*/
- unsigned int *class_ids; /*out*/
- Z3_lbool _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- value _v5;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3_Z3_solver(_v_s, &s, _ctx);
- _c1 = Wosize_val(_v_terms);
- terms = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_terms, _c2);
- camlidl_ml2c_z3_Z3_ast(_v3, &terms[_c2], _ctx);
- }
- num_terms = _c1;
- class_ids = camlidl_malloc(num_terms * sizeof(unsigned int ), _ctx);
- _res = Z3_get_implied_equalities(c, s, num_terms, terms, class_ids);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_c2ml_z3_Z3_lbool(&_res, _ctx);
- _vres[1] = camlidl_alloc(num_terms, 0);
- for (_c4 = 0; _c4 < num_terms; _c4++) {
- _v5 = Val_int(class_ids[_c4]);
- modify(&Field(_vres[1], _c4), _v5);
- }
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-check_error_code(c);
- /* end user-supplied deallocation sequence */
- return _vresult;
-}
-
-void camlidl_ml2c_z3V3_Z3_symbol(value _v1, Z3_symbol * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_symbol *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_symbol(Z3_symbol * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_symbol) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_symbol *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_literals(value _v1, Z3_literals * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_literals *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_literals(Z3_literals * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_literals) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_literals *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_theory(value _v1, Z3_theory * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_theory *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_theory(Z3_theory * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_theory) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_theory *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_config(value _v1, Z3_config * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_config *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_config(Z3_config * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_config) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_config *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_context(value _v1, Z3_context * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_context *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_context(Z3_context * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_context) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_context *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_sort(value _v1, Z3_sort * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_sort *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_sort(Z3_sort * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_sort) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_sort *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_func_decl(value _v1, Z3_func_decl * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_func_decl *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_func_decl(Z3_func_decl * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_func_decl) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_func_decl *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_ast(value _v1, Z3_ast * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_ast *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_ast(Z3_ast * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_ast) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_ast *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_app(value _v1, Z3_app * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_app *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_app(Z3_app * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_app) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_app *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_pattern(value _v1, Z3_pattern * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_pattern *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_pattern(Z3_pattern * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_pattern) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_pattern *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_model(value _v1, Z3_model * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_model *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_model(Z3_model * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_model) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_model *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_constructor(value _v1, Z3_constructor * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_constructor *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_constructor(Z3_constructor * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_constructor) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_constructor *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_constructor_list(value _v1, Z3_constructor_list * _c2, camlidl_ctx _ctx)
-{
- *_c2 = *((Z3_constructor_list *) Bp_val(_v1));
-}
-
-value camlidl_c2ml_z3V3_Z3_constructor_list(Z3_constructor_list * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_alloc((sizeof(Z3_constructor_list) + sizeof(value) - 1) / sizeof(value), Abstract_tag);
- *((Z3_constructor_list *) Bp_val(_v1)) = *_c2;
- return _v1;
-}
-
-void camlidl_ml2c_z3V3_Z3_string(value _v1, Z3_string * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_malloc_string(_v1, _ctx);
-}
-
-value camlidl_c2ml_z3V3_Z3_string(Z3_string * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = copy_string((*_c2));
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_1[3] = {
- Z3_L_FALSE,
- Z3_L_UNDEF,
- Z3_L_TRUE,
-};
-
-void camlidl_ml2c_z3V3_Z3_lbool(value _v1, Z3_lbool * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_1[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_lbool(Z3_lbool * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_L_FALSE: _v1 = Val_int(0); break;
- case Z3_L_UNDEF: _v1 = Val_int(1); break;
- case Z3_L_TRUE: _v1 = Val_int(2); break;
- default: invalid_argument("typedef Z3_lbool: bad enum value");
- }
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_2[2] = {
- Z3_INT_SYMBOL,
- Z3_STRING_SYMBOL,
-};
-
-void camlidl_ml2c_z3V3_Z3_symbol_kind(value _v1, Z3_symbol_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_2[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_symbol_kind(Z3_symbol_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_INT_SYMBOL: _v1 = Val_int(0); break;
- case Z3_STRING_SYMBOL: _v1 = Val_int(1); break;
- default: invalid_argument("typedef Z3_symbol_kind: bad enum value");
- }
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_3[7] = {
- Z3_PARAMETER_INT,
- Z3_PARAMETER_DOUBLE,
- Z3_PARAMETER_RATIONAL,
- Z3_PARAMETER_SYMBOL,
- Z3_PARAMETER_SORT,
- Z3_PARAMETER_AST,
- Z3_PARAMETER_FUNC_DECL,
-};
-
-void camlidl_ml2c_z3V3_Z3_parameter_kind(value _v1, Z3_parameter_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_3[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_parameter_kind(Z3_parameter_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_3, 7, "typedef Z3_parameter_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_4[10] = {
- Z3_UNINTERPRETED_SORT,
- Z3_BOOL_SORT,
- Z3_INT_SORT,
- Z3_REAL_SORT,
- Z3_BV_SORT,
- Z3_ARRAY_SORT,
- Z3_DATATYPE_SORT,
- Z3_RELATION_SORT,
- Z3_FINITE_DOMAIN_SORT,
- Z3_UNKNOWN_SORT,
-};
-
-void camlidl_ml2c_z3V3_Z3_sort_kind(value _v1, Z3_sort_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_4[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_sort_kind(Z3_sort_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_4, 10, "typedef Z3_sort_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_5[7] = {
- Z3_NUMERAL_AST,
- Z3_APP_AST,
- Z3_VAR_AST,
- Z3_QUANTIFIER_AST,
- Z3_SORT_AST,
- Z3_FUNC_DECL_AST,
- Z3_UNKNOWN_AST,
-};
-
-void camlidl_ml2c_z3V3_Z3_ast_kind(value _v1, Z3_ast_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_5[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_ast_kind(Z3_ast_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_5, 7, "typedef Z3_ast_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_6[152] = {
- Z3_OP_TRUE,
- Z3_OP_FALSE,
- Z3_OP_EQ,
- Z3_OP_DISTINCT,
- Z3_OP_ITE,
- Z3_OP_AND,
- Z3_OP_OR,
- Z3_OP_IFF,
- Z3_OP_XOR,
- Z3_OP_NOT,
- Z3_OP_IMPLIES,
- Z3_OP_OEQ,
- Z3_OP_ANUM,
- Z3_OP_AGNUM,
- Z3_OP_LE,
- Z3_OP_GE,
- Z3_OP_LT,
- Z3_OP_GT,
- Z3_OP_ADD,
- Z3_OP_SUB,
- Z3_OP_UMINUS,
- Z3_OP_MUL,
- Z3_OP_DIV,
- Z3_OP_IDIV,
- Z3_OP_REM,
- Z3_OP_MOD,
- Z3_OP_TO_REAL,
- Z3_OP_TO_INT,
- Z3_OP_IS_INT,
- Z3_OP_POWER,
- Z3_OP_STORE,
- Z3_OP_SELECT,
- Z3_OP_CONST_ARRAY,
- Z3_OP_ARRAY_MAP,
- Z3_OP_ARRAY_DEFAULT,
- Z3_OP_SET_UNION,
- Z3_OP_SET_INTERSECT,
- Z3_OP_SET_DIFFERENCE,
- Z3_OP_SET_COMPLEMENT,
- Z3_OP_SET_SUBSET,
- Z3_OP_AS_ARRAY,
- Z3_OP_BNUM,
- Z3_OP_BIT1,
- Z3_OP_BIT0,
- Z3_OP_BNEG,
- Z3_OP_BADD,
- Z3_OP_BSUB,
- Z3_OP_BMUL,
- Z3_OP_BSDIV,
- Z3_OP_BUDIV,
- Z3_OP_BSREM,
- Z3_OP_BUREM,
- Z3_OP_BSMOD,
- Z3_OP_BSDIV0,
- Z3_OP_BUDIV0,
- Z3_OP_BSREM0,
- Z3_OP_BUREM0,
- Z3_OP_BSMOD0,
- Z3_OP_ULEQ,
- Z3_OP_SLEQ,
- Z3_OP_UGEQ,
- Z3_OP_SGEQ,
- Z3_OP_ULT,
- Z3_OP_SLT,
- Z3_OP_UGT,
- Z3_OP_SGT,
- Z3_OP_BAND,
- Z3_OP_BOR,
- Z3_OP_BNOT,
- Z3_OP_BXOR,
- Z3_OP_BNAND,
- Z3_OP_BNOR,
- Z3_OP_BXNOR,
- Z3_OP_CONCAT,
- Z3_OP_SIGN_EXT,
- Z3_OP_ZERO_EXT,
- Z3_OP_EXTRACT,
- Z3_OP_REPEAT,
- Z3_OP_BREDOR,
- Z3_OP_BREDAND,
- Z3_OP_BCOMP,
- Z3_OP_BSHL,
- Z3_OP_BLSHR,
- Z3_OP_BASHR,
- Z3_OP_ROTATE_LEFT,
- Z3_OP_ROTATE_RIGHT,
- Z3_OP_EXT_ROTATE_LEFT,
- Z3_OP_EXT_ROTATE_RIGHT,
- Z3_OP_INT2BV,
- Z3_OP_BV2INT,
- Z3_OP_CARRY,
- Z3_OP_XOR3,
- Z3_OP_PR_UNDEF,
- Z3_OP_PR_TRUE,
- Z3_OP_PR_ASSERTED,
- Z3_OP_PR_GOAL,
- Z3_OP_PR_MODUS_PONENS,
- Z3_OP_PR_REFLEXIVITY,
- Z3_OP_PR_SYMMETRY,
- Z3_OP_PR_TRANSITIVITY,
- Z3_OP_PR_TRANSITIVITY_STAR,
- Z3_OP_PR_MONOTONICITY,
- Z3_OP_PR_QUANT_INTRO,
- Z3_OP_PR_DISTRIBUTIVITY,
- Z3_OP_PR_AND_ELIM,
- Z3_OP_PR_NOT_OR_ELIM,
- Z3_OP_PR_REWRITE,
- Z3_OP_PR_REWRITE_STAR,
- Z3_OP_PR_PULL_QUANT,
- Z3_OP_PR_PULL_QUANT_STAR,
- Z3_OP_PR_PUSH_QUANT,
- Z3_OP_PR_ELIM_UNUSED_VARS,
- Z3_OP_PR_DER,
- Z3_OP_PR_QUANT_INST,
- Z3_OP_PR_HYPOTHESIS,
- Z3_OP_PR_LEMMA,
- Z3_OP_PR_UNIT_RESOLUTION,
- Z3_OP_PR_IFF_TRUE,
- Z3_OP_PR_IFF_FALSE,
- Z3_OP_PR_COMMUTATIVITY,
- Z3_OP_PR_DEF_AXIOM,
- Z3_OP_PR_DEF_INTRO,
- Z3_OP_PR_APPLY_DEF,
- Z3_OP_PR_IFF_OEQ,
- Z3_OP_PR_NNF_POS,
- Z3_OP_PR_NNF_NEG,
- Z3_OP_PR_NNF_STAR,
- Z3_OP_PR_CNF_STAR,
- Z3_OP_PR_SKOLEMIZE,
- Z3_OP_PR_MODUS_PONENS_OEQ,
- Z3_OP_PR_TH_LEMMA,
- Z3_OP_PR_HYPER_RESOLVE,
- Z3_OP_RA_STORE,
- Z3_OP_RA_EMPTY,
- Z3_OP_RA_IS_EMPTY,
- Z3_OP_RA_JOIN,
- Z3_OP_RA_UNION,
- Z3_OP_RA_WIDEN,
- Z3_OP_RA_PROJECT,
- Z3_OP_RA_FILTER,
- Z3_OP_RA_NEGATION_FILTER,
- Z3_OP_RA_RENAME,
- Z3_OP_RA_COMPLEMENT,
- Z3_OP_RA_SELECT,
- Z3_OP_RA_CLONE,
- Z3_OP_FD_LT,
- Z3_OP_LABEL,
- Z3_OP_LABEL_LIT,
- Z3_OP_DT_CONSTRUCTOR,
- Z3_OP_DT_RECOGNISER,
- Z3_OP_DT_ACCESSOR,
- Z3_OP_UNINTERPRETED,
-};
-
-void camlidl_ml2c_z3V3_Z3_decl_kind(value _v1, Z3_decl_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_6[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_decl_kind(Z3_decl_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_6, 152, "typedef Z3_decl_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_7[7] = {
- Z3_PK_UINT,
- Z3_PK_BOOL,
- Z3_PK_DOUBLE,
- Z3_PK_SYMBOL,
- Z3_PK_STRING,
- Z3_PK_OTHER,
- Z3_PK_INVALID,
-};
-
-void camlidl_ml2c_z3V3_Z3_param_kind(value _v1, Z3_param_kind * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_7[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_param_kind(Z3_param_kind * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_7, 7, "typedef Z3_param_kind: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_8[8] = {
- Z3_NO_FAILURE,
- Z3_UNKNOWN,
- Z3_TIMEOUT,
- Z3_MEMOUT_WATERMARK,
- Z3_CANCELED,
- Z3_NUM_CONFLICTS,
- Z3_THEORY,
- Z3_QUANTIFIERS,
-};
-
-void camlidl_ml2c_z3V3_Z3_search_failure(value _v1, Z3_search_failure * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_8[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_search_failure(Z3_search_failure * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- _v1 = camlidl_find_enum((*_c2), camlidl_transl_table_z3V3_enum_8, 8, "typedef Z3_search_failure: bad enum value");
- return _v1;
-}
-
-int camlidl_transl_table_z3V3_enum_9[4] = {
- Z3_PRINT_SMTLIB_FULL,
- Z3_PRINT_LOW_LEVEL,
- Z3_PRINT_SMTLIB_COMPLIANT,
- Z3_PRINT_SMTLIB2_COMPLIANT,
-};
-
-void camlidl_ml2c_z3V3_Z3_ast_print_mode(value _v1, Z3_ast_print_mode * _c2, camlidl_ctx _ctx)
-{
- (*_c2) = camlidl_transl_table_z3V3_enum_9[Int_val(_v1)];
-}
-
-value camlidl_c2ml_z3V3_Z3_ast_print_mode(Z3_ast_print_mode * _c2, camlidl_ctx _ctx)
-{
-value _v1;
- switch((*_c2)) {
- case Z3_PRINT_SMTLIB_FULL: _v1 = Val_int(0); break;
- case Z3_PRINT_LOW_LEVEL: _v1 = Val_int(1); break;
- case Z3_PRINT_SMTLIB_COMPLIANT: _v1 = Val_int(2); break;
- case Z3_PRINT_SMTLIB2_COMPLIANT: _v1 = Val_int(3); break;
- default: invalid_argument("typedef Z3_ast_print_mode: bad enum value");
- }
- return _v1;
-}
-
-value camlidl_z3V3_Z3_global_param_set(
- value _v_param_id,
- value _v_param_value)
-{
- Z3_string param_id; /*in*/
- Z3_string param_value; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_param_id, ¶m_id, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_value, ¶m_value, _ctx);
- Z3_global_param_set(param_id, param_value);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_global_param_reset_all(value _unit)
-{
- Z3_global_param_reset_all();
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_global_param_get(
- value _v_param_id)
-{
- Z3_string param_id; /*in*/
- Z3_string *param_value; /*out*/
- Z3_string _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_param_id, ¶m_id, _ctx);
- param_value = &_c1;
- Z3_global_param_get(param_id, param_value);
- if (param_value == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = camlidl_c2ml_z3V3_Z3_string(&*param_value, _ctx);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_config(value _unit)
-{
- Z3_config _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- _res = Z3_mk_config();
- _vres = camlidl_c2ml_z3V3_Z3_config(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_del_config(
- value _v_c)
-{
- Z3_config c; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_config(_v_c, &c, _ctx);
- Z3_del_config(c);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_set_param_value(
- value _v_c,
- value _v_param_id,
- value _v_param_value)
-{
- Z3_config c; /*in*/
- Z3_string param_id; /*in*/
- Z3_string param_value; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_config(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_id, ¶m_id, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_value, ¶m_value, _ctx);
- Z3_set_param_value(c, param_id, param_value);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_mk_context(
- value _v_c)
-{
- Z3_config c; /*in*/
- Z3_context _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_config(_v_c, &c, _ctx);
- _res = Z3_mk_context(c);
- _vres = camlidl_c2ml_z3V3_Z3_context(&_res, _ctx);
- camlidl_free(_ctx);
- /* begin user-supplied deallocation sequence */
-Z3_set_error_handler(_res, (void*)caml_z3_error_handler);
- /* end user-supplied deallocation sequence */
- return _vres;
-}
-
-value camlidl_z3V3_Z3_del_context(
- value _v_c)
-{
- Z3_context c; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- Z3_del_context(c);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_update_param_value(
- value _v_c,
- value _v_param_id,
- value _v_param_value)
-{
- Z3_context c; /*in*/
- Z3_string param_id; /*in*/
- Z3_string param_value; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_id, ¶m_id, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_value, ¶m_value, _ctx);
- Z3_update_param_value(c, param_id, param_value);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_get_param_value(
- value _v_c,
- value _v_param_id)
-{
- Z3_context c; /*in*/
- Z3_string param_id; /*in*/
- Z3_string *param_value; /*out*/
- Z3_string _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_param_id, ¶m_id, _ctx);
- param_value = &_c1;
- Z3_get_param_value(c, param_id, param_value);
- if (param_value == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = camlidl_c2ml_z3V3_Z3_string(&*param_value, _ctx);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int_symbol(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- int i; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_mk_int_symbol(c, i);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_string_symbol(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_string s; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_s, &s, _ctx);
- _res = Z3_mk_string_symbol(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_uninterpreted_sort(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_mk_uninterpreted_sort(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bool_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_bool_sort(c);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_int_sort(c);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_real_sort(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_real_sort(c);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bv_sort(
- value _v_c,
- value _v_sz)
-{
- Z3_context c; /*in*/
- unsigned int sz; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- sz = Int_val(_v_sz);
- _res = Z3_mk_bv_sort(c, sz);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_finite_domain_sort(
- value _v_c,
- value _v_name,
- value _v_size)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned long long size; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_name, &name, _ctx);
- size = Int64_val(_v_size);
- _res = Z3_mk_finite_domain_sort(c, name, size);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_array_sort(
- value _v_c,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_sort range; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_domain, &domain, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_array_sort(c, domain, range);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_tuple_sort(
- value _v_c,
- value _v_mk_tuple_name,
- value _v_field_names,
- value _v_field_sorts)
-{
- Z3_context c; /*in*/
- Z3_symbol mk_tuple_name; /*in*/
- unsigned int num_fields; /*in*/
- Z3_symbol const *field_names; /*in*/
- Z3_sort const *field_sorts; /*in*/
- Z3_func_decl *mk_tuple_decl; /*out*/
- Z3_func_decl *proj_decl; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- Z3_func_decl _c7;
- mlsize_t _c8;
- value _v9;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_mk_tuple_name, &mk_tuple_name, _ctx);
- _c1 = Wosize_val(_v_field_names);
- field_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_field_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &field_names[_c2], _ctx);
- }
- num_fields = _c1;
- _c4 = Wosize_val(_v_field_sorts);
- field_sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_field_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &field_sorts[_c5], _ctx);
- }
- num_fields = _c4;
- mk_tuple_decl = &_c7;
- proj_decl = camlidl_malloc(num_fields * sizeof(Z3_func_decl ), _ctx);
- _res = Z3_mk_tuple_sort(c, mk_tuple_name, num_fields, field_names, field_sorts, mk_tuple_decl, proj_decl);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3V3_Z3_func_decl(&*mk_tuple_decl, _ctx);
- _vres[2] = camlidl_alloc(num_fields, 0);
- Begin_root(_vres[2])
- for (_c8 = 0; _c8 < num_fields; _c8++) {
- _v9 = camlidl_c2ml_z3V3_Z3_func_decl(&proj_decl[_c8], _ctx);
- modify(&Field(_vres[2], _c8), _v9);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_mk_enumeration_sort(
- value _v_c,
- value _v_name,
- value _v_enum_names)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned int n; /*in*/
- Z3_symbol const *enum_names; /*in*/
- Z3_func_decl *enum_consts; /*out*/
- Z3_func_decl *enum_testers; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- value _v5;
- mlsize_t _c6;
- value _v7;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_name, &name, _ctx);
- _c1 = Wosize_val(_v_enum_names);
- enum_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_enum_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &enum_names[_c2], _ctx);
- }
- n = _c1;
- enum_consts = camlidl_malloc(n * sizeof(Z3_func_decl ), _ctx);
- enum_testers = camlidl_malloc(n * sizeof(Z3_func_decl ), _ctx);
- _res = Z3_mk_enumeration_sort(c, name, n, enum_names, enum_consts, enum_testers);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_alloc(n, 0);
- Begin_root(_vres[1])
- for (_c4 = 0; _c4 < n; _c4++) {
- _v5 = camlidl_c2ml_z3V3_Z3_func_decl(&enum_consts[_c4], _ctx);
- modify(&Field(_vres[1], _c4), _v5);
- }
- End_roots()
- _vres[2] = camlidl_alloc(n, 0);
- Begin_root(_vres[2])
- for (_c6 = 0; _c6 < n; _c6++) {
- _v7 = camlidl_c2ml_z3V3_Z3_func_decl(&enum_testers[_c6], _ctx);
- modify(&Field(_vres[2], _c6), _v7);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_mk_list_sort(
- value _v_c,
- value _v_name,
- value _v_elem_sort)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- Z3_sort elem_sort; /*in*/
- Z3_func_decl *nil_decl; /*out*/
- Z3_func_decl *is_nil_decl; /*out*/
- Z3_func_decl *cons_decl; /*out*/
- Z3_func_decl *is_cons_decl; /*out*/
- Z3_func_decl *head_decl; /*out*/
- Z3_func_decl *tail_decl; /*out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_func_decl _c1;
- Z3_func_decl _c2;
- Z3_func_decl _c3;
- Z3_func_decl _c4;
- Z3_func_decl _c5;
- Z3_func_decl _c6;
- value _vresult;
- value _vres[7] = { 0, 0, 0, 0, 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_name, &name, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_elem_sort, &elem_sort, _ctx);
- nil_decl = &_c1;
- is_nil_decl = &_c2;
- cons_decl = &_c3;
- is_cons_decl = &_c4;
- head_decl = &_c5;
- tail_decl = &_c6;
- _res = Z3_mk_list_sort(c, name, elem_sort, nil_decl, is_nil_decl, cons_decl, is_cons_decl, head_decl, tail_decl);
- Begin_roots_block(_vres, 7)
- _vres[0] = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3V3_Z3_func_decl(&*nil_decl, _ctx);
- _vres[2] = camlidl_c2ml_z3V3_Z3_func_decl(&*is_nil_decl, _ctx);
- _vres[3] = camlidl_c2ml_z3V3_Z3_func_decl(&*cons_decl, _ctx);
- _vres[4] = camlidl_c2ml_z3V3_Z3_func_decl(&*is_cons_decl, _ctx);
- _vres[5] = camlidl_c2ml_z3V3_Z3_func_decl(&*head_decl, _ctx);
- _vres[6] = camlidl_c2ml_z3V3_Z3_func_decl(&*tail_decl, _ctx);
- _vresult = camlidl_alloc_small(7, 0);
- { mlsize_t _c7;
- for (_c7 = 0; _c7 < 7; _c7++) Field(_vresult, _c7) = _vres[_c7];
- }
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_mk_constructor(
- value _v_c,
- value _v_name,
- value _v_recognizer,
- value _v_field_names,
- value _v_sorts,
- value _v_sort_refs)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- Z3_symbol recognizer; /*in*/
- unsigned int num_fields; /*in*/
- Z3_symbol const *field_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int *sort_refs; /*in*/
- Z3_constructor _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_name, &name, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_recognizer, &recognizer, _ctx);
- _c1 = Wosize_val(_v_field_names);
- field_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_field_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &field_names[_c2], _ctx);
- }
- num_fields = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_fields = _c4;
- _c7 = Wosize_val(_v_sort_refs);
- sort_refs = camlidl_malloc(_c7 * sizeof(unsigned int ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_sort_refs, _c8);
- sort_refs[_c8] = Int_val(_v9);
- }
- num_fields = _c7;
- _res = Z3_mk_constructor(c, name, recognizer, num_fields, field_names, sorts, sort_refs);
- _vres = camlidl_c2ml_z3V3_Z3_constructor(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_constructor_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_constructor(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_del_constructor(
- value _v_c,
- value _v_constr)
-{
- Z3_context c; /*in*/
- Z3_constructor constr; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_constructor(_v_constr, &constr, _ctx);
- Z3_del_constructor(c, constr);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_mk_datatype(
- value _v_c,
- value _v_name,
- value _v_constructors)
-{
- Z3_context c; /*in*/
- Z3_symbol name; /*in*/
- unsigned int num_constructors; /*in*/
- Z3_constructor *constructors; /*in,out*/
- Z3_sort _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- value _v5;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_name, &name, _ctx);
- _c1 = Wosize_val(_v_constructors);
- constructors = camlidl_malloc(_c1 * sizeof(Z3_constructor ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_constructors, _c2);
- camlidl_ml2c_z3V3_Z3_constructor(_v3, &constructors[_c2], _ctx);
- }
- num_constructors = _c1;
- _res = Z3_mk_datatype(c, name, num_constructors, constructors);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- _vres[1] = camlidl_alloc(num_constructors, 0);
- Begin_root(_vres[1])
- for (_c4 = 0; _c4 < num_constructors; _c4++) {
- _v5 = camlidl_c2ml_z3V3_Z3_constructor(&constructors[_c4], _ctx);
- modify(&Field(_vres[1], _c4), _v5);
- }
- End_roots()
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_mk_constructor_list(
- value _v_c,
- value _v_constructors)
-{
- Z3_context c; /*in*/
- unsigned int num_constructors; /*in*/
- Z3_constructor const *constructors; /*in*/
- Z3_constructor_list _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_constructors);
- constructors = camlidl_malloc(_c1 * sizeof(Z3_constructor const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_constructors, _c2);
- camlidl_ml2c_z3V3_Z3_constructor(_v3, &constructors[_c2], _ctx);
- }
- num_constructors = _c1;
- _res = Z3_mk_constructor_list(c, num_constructors, constructors);
- _vres = camlidl_c2ml_z3V3_Z3_constructor_list(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_del_constructor_list(
- value _v_c,
- value _v_clist)
-{
- Z3_context c; /*in*/
- Z3_constructor_list clist; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_constructor_list(_v_clist, &clist, _ctx);
- Z3_del_constructor_list(c, clist);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_mk_datatypes(
- value _v_c,
- value _v_sort_names,
- value _v_constructor_lists)
-{
- Z3_context c; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort *sorts; /*out*/
- Z3_constructor_list *constructor_lists; /*in,out*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- value _v8;
- mlsize_t _c9;
- value _v10;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_constructor_lists);
- constructor_lists = camlidl_malloc(_c4 * sizeof(Z3_constructor_list ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_constructor_lists, _c5);
- camlidl_ml2c_z3V3_Z3_constructor_list(_v6, &constructor_lists[_c5], _ctx);
- }
- num_sorts = _c4;
- sorts = camlidl_malloc(num_sorts * sizeof(Z3_sort ), _ctx);
- Z3_mk_datatypes(c, num_sorts, sort_names, sorts, constructor_lists);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_alloc(num_sorts, 0);
- Begin_root(_vres[0])
- for (_c7 = 0; _c7 < num_sorts; _c7++) {
- _v8 = camlidl_c2ml_z3V3_Z3_sort(&sorts[_c7], _ctx);
- modify(&Field(_vres[0], _c7), _v8);
- }
- End_roots()
- _vres[1] = camlidl_alloc(num_sorts, 0);
- Begin_root(_vres[1])
- for (_c9 = 0; _c9 < num_sorts; _c9++) {
- _v10 = camlidl_c2ml_z3V3_Z3_constructor_list(&constructor_lists[_c9], _ctx);
- modify(&Field(_vres[1], _c9), _v10);
- }
- End_roots()
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_query_constructor(
- value _v_c,
- value _v_constr,
- value _v_num_fields)
-{
- Z3_context c; /*in*/
- Z3_constructor constr; /*in*/
- unsigned int num_fields; /*in*/
- Z3_func_decl *constructor; /*out*/
- Z3_func_decl *tester; /*out*/
- Z3_func_decl *accessors; /*out*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_func_decl _c1;
- Z3_func_decl _c2;
- mlsize_t _c3;
- value _v4;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_constructor(_v_constr, &constr, _ctx);
- num_fields = Int_val(_v_num_fields);
- constructor = &_c1;
- tester = &_c2;
- accessors = camlidl_malloc(num_fields * sizeof(Z3_func_decl ), _ctx);
- Z3_query_constructor(c, constr, num_fields, constructor, tester, accessors);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_c2ml_z3V3_Z3_func_decl(&*constructor, _ctx);
- _vres[1] = camlidl_c2ml_z3V3_Z3_func_decl(&*tester, _ctx);
- _vres[2] = camlidl_alloc(num_fields, 0);
- Begin_root(_vres[2])
- for (_c3 = 0; _c3 < num_fields; _c3++) {
- _v4 = camlidl_c2ml_z3V3_Z3_func_decl(&accessors[_c3], _ctx);
- modify(&Field(_vres[2], _c3), _v4);
- }
- End_roots()
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_mk_func_decl(
- value _v_c,
- value _v_s,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3V3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3V3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_func_decl(c, s, domain_size, domain, range);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_app(
- value _v_c,
- value _v_d,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_app(c, d, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_const(
- value _v_c,
- value _v_s,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_const(c, s, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_fresh_func_decl(
- value _v_c,
- value _v_prefix,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_string prefix; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_prefix, &prefix, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3V3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3V3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_fresh_func_decl(c, prefix, domain_size, domain, range);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_fresh_const(
- value _v_c,
- value _v_prefix,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_string prefix; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_prefix, &prefix, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_fresh_const(c, prefix, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_true(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_true(c);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_false(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_mk_false(c);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_eq(
- value _v_c,
- value _v_l,
- value _v_r)
-{
- Z3_context c; /*in*/
- Z3_ast l; /*in*/
- Z3_ast r; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_l, &l, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_r, &r, _ctx);
- _res = Z3_mk_eq(c, l, r);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_distinct(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_distinct(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_not(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_mk_not(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_ite(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_t3)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast t3; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t3, &t3, _ctx);
- _res = Z3_mk_ite(c, t1, t2, t3);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_iff(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_iff(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_implies(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_implies(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_xor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_xor(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_and(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_and(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_or(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_or(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_add(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_add(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_mul(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_mul(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_sub(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_sub(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_unary_minus(
- value _v_c,
- value _v_arg)
-{
- Z3_context c; /*in*/
- Z3_ast arg; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg, &arg, _ctx);
- _res = Z3_mk_unary_minus(c, arg);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_div(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_div(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_mod(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_mod(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_rem(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_rem(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_power(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_power(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_lt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_lt(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_le(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_le(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_gt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_gt(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_ge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ge(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int2real(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_int2real(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_real2int(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_real2int(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_is_int(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_is_int(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvnot(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvnot(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvredand(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvredand(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvredor(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvredor(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvand(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvand(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvor(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvxor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvxor(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvnand(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvnand(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvnor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvnor(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvxnor(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvxnor(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvneg(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvneg(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvadd(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvadd(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsub(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsub(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvmul(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvmul(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvudiv(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvudiv(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsdiv(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsdiv(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvurem(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvurem(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsrem(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsrem(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsmod(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsmod(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvult(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvult(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvslt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvslt(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvule(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvule(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsle(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsle(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvuge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvuge(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsge(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsge(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvugt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvugt(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsgt(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsgt(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_concat(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_concat(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_extract(
- value _v_c,
- value _v_high,
- value _v_low,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int high; /*in*/
- unsigned int low; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- high = Int_val(_v_high);
- low = Int_val(_v_low);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_extract(c, high, low, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_sign_ext(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_sign_ext(c, i, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_zero_ext(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_zero_ext(c, i, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_repeat(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_repeat(c, i, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvshl(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvshl(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvlshr(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvlshr(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvashr(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvashr(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_rotate_left(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_rotate_left(c, i, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_rotate_right(
- value _v_c,
- value _v_i,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_rotate_right(c, i, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_ext_rotate_left(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ext_rotate_left(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_ext_rotate_right(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_ext_rotate_right(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int2bv(
- value _v_c,
- value _v_n,
- value _v_t1)
-{
- Z3_context c; /*in*/
- unsigned int n; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- n = Int_val(_v_n);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_int2bv(c, n, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bv2int(
- value _v_c,
- value _v_t1,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bv2int(c, t1, is_signed);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvadd_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvadd_no_overflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvadd_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvadd_no_underflow(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsub_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsub_no_overflow(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsub_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvsub_no_underflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvsdiv_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvsdiv_no_overflow(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvneg_no_overflow(
- value _v_c,
- value _v_t1)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- _res = Z3_mk_bvneg_no_overflow(c, t1);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvmul_no_overflow(
- value _v_c,
- value _v_t1,
- value _v_t2,
- value _v_is_signed)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int is_signed; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- is_signed = Int_val(_v_is_signed);
- _res = Z3_mk_bvmul_no_overflow(c, t1, t2, is_signed);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bvmul_no_underflow(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_mk_bvmul_no_underflow(c, t1, t2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_select(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_i, &i, _ctx);
- _res = Z3_mk_select(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_store(
- value _v_c,
- value _v_a,
- value _v_i,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast i; /*in*/
- Z3_ast v; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_i, &i, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- _res = Z3_mk_store(c, a, i, v);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_const_array(
- value _v_c,
- value _v_domain,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast v; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_domain, &domain, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- _res = Z3_mk_const_array(c, domain, v);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_map(
- value _v_c,
- value _v_f,
- value _v_n,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- unsigned int n; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- Z3_ast _c1;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_f, &f, _ctx);
- n = Int_val(_v_n);
- args = &_c1;
- camlidl_ml2c_z3V3_Z3_ast(_v_args, &_c1, _ctx);
- _res = Z3_mk_map(c, f, n, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_array_default(
- value _v_c,
- value _v_array)
-{
- Z3_context c; /*in*/
- Z3_ast array; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_array, &array, _ctx);
- _res = Z3_mk_array_default(c, array);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_sort(
- value _v_c,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_sort ty; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_set_sort(c, ty);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_empty_set(
- value _v_c,
- value _v_domain)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_domain, &domain, _ctx);
- _res = Z3_mk_empty_set(c, domain);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_full_set(
- value _v_c,
- value _v_domain)
-{
- Z3_context c; /*in*/
- Z3_sort domain; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_domain, &domain, _ctx);
- _res = Z3_mk_full_set(c, domain);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_add(
- value _v_c,
- value _v_set,
- value _v_elem)
-{
- Z3_context c; /*in*/
- Z3_ast set; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_set, &set, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_elem, &elem, _ctx);
- _res = Z3_mk_set_add(c, set, elem);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_del(
- value _v_c,
- value _v_set,
- value _v_elem)
-{
- Z3_context c; /*in*/
- Z3_ast set; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_set, &set, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_elem, &elem, _ctx);
- _res = Z3_mk_set_del(c, set, elem);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_union(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_set_union(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_intersect(
- value _v_c,
- value _v_args)
-{
- Z3_context c; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_mk_set_intersect(c, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_difference(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_set_difference(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_complement(
- value _v_c,
- value _v_arg)
-{
- Z3_context c; /*in*/
- Z3_ast arg; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg, &arg, _ctx);
- _res = Z3_mk_set_complement(c, arg);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_member(
- value _v_c,
- value _v_elem,
- value _v_set)
-{
- Z3_context c; /*in*/
- Z3_ast elem; /*in*/
- Z3_ast set; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_elem, &elem, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_set, &set, _ctx);
- _res = Z3_mk_set_member(c, elem, set);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_set_subset(
- value _v_c,
- value _v_arg1,
- value _v_arg2)
-{
- Z3_context c; /*in*/
- Z3_ast arg1; /*in*/
- Z3_ast arg2; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg1, &arg1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_arg2, &arg2, _ctx);
- _res = Z3_mk_set_subset(c, arg1, arg2);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_numeral(
- value _v_c,
- value _v_numeral,
- value _v_ty)
-{
- Z3_context c; /*in*/
- Z3_string numeral; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_numeral, &numeral, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_numeral(c, numeral, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_real(
- value _v_c,
- value _v_num,
- value _v_den)
-{
- Z3_context c; /*in*/
- int num; /*in*/
- int den; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- num = Int_val(_v_num);
- den = Int_val(_v_den);
- _res = Z3_mk_real(c, num, den);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int(
- value _v_c,
- value _v_v,
- value _v_ty)
-{
- Z3_context c; /*in*/
- int v; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- v = Int_val(_v_v);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_int(c, v, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_int64(
- value _v_c,
- value _v_v,
- value _v_ty)
-{
- Z3_context c; /*in*/
- long long v; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- v = Int64_val(_v_v);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_int64(c, v, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_pattern(
- value _v_c,
- value _v_terms)
-{
- Z3_context c; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_ast const *terms; /*in*/
- Z3_pattern _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_terms);
- terms = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_terms, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &terms[_c2], _ctx);
- }
- num_patterns = _c1;
- _res = Z3_mk_pattern(c, num_patterns, terms);
- _vres = camlidl_c2ml_z3V3_Z3_pattern(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_bound(
- value _v_c,
- value _v_index,
- value _v_ty)
-{
- Z3_context c; /*in*/
- unsigned int index; /*in*/
- Z3_sort ty; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- index = Int_val(_v_index);
- camlidl_ml2c_z3V3_Z3_sort(_v_ty, &ty, _ctx);
- _res = Z3_mk_bound(c, index, ty);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_forall(
- value _v_c,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3V3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_forall(c, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_forall_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_forall(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_mk_exists(
- value _v_c,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3V3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_exists(c, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_exists_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_exists(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_mk_quantifier(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3V3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_decls = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier(c, is_forall, weight, num_patterns, patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_quantifier(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6]);
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_ex(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_quantifier_id,
- value _v_skolem_id,
- value _v_patterns,
- value _v_no_patterns,
- value _v_sorts,
- value _v_decl_names,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- Z3_symbol quantifier_id; /*in*/
- Z3_symbol skolem_id; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_no_patterns; /*in*/
- Z3_ast const *no_patterns; /*in*/
- unsigned int num_decls; /*in*/
- Z3_sort const *sorts; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- camlidl_ml2c_z3V3_Z3_symbol(_v_quantifier_id, &quantifier_id, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_skolem_id, &skolem_id, _ctx);
- _c1 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c1 * sizeof(Z3_pattern const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_patterns, _c2);
- camlidl_ml2c_z3V3_Z3_pattern(_v3, &patterns[_c2], _ctx);
- }
- num_patterns = _c1;
- _c4 = Wosize_val(_v_no_patterns);
- no_patterns = camlidl_malloc(_c4 * sizeof(Z3_ast const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_no_patterns, _c5);
- camlidl_ml2c_z3V3_Z3_ast(_v6, &no_patterns[_c5], _ctx);
- }
- num_no_patterns = _c4;
- _c7 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c7 * sizeof(Z3_sort const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_sorts, _c8);
- camlidl_ml2c_z3V3_Z3_sort(_v9, &sorts[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c10 * sizeof(Z3_symbol const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decl_names, _c11);
- camlidl_ml2c_z3V3_Z3_symbol(_v12, &decl_names[_c11], _ctx);
- }
- num_decls = _c10;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_ex(c, is_forall, weight, quantifier_id, skolem_id, num_patterns, patterns, num_no_patterns, no_patterns, num_decls, sorts, decl_names, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_ex_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_quantifier_ex(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[9]);
-}
-
-value camlidl_z3V3_Z3_mk_forall_const(
- value _v_c,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3V3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3V3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_forall_const(c, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_exists_const(
- value _v_c,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3V3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3V3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_exists_const(c, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_const(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_bound,
- value _v_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3V3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3V3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_const(c, is_forall, weight, num_bound, bound, num_patterns, patterns, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_const_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_quantifier_const(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_const_ex(
- value _v_c,
- value _v_is_forall,
- value _v_weight,
- value _v_quantifier_id,
- value _v_skolem_id,
- value _v_bound,
- value _v_patterns,
- value _v_no_patterns,
- value _v_body)
-{
- Z3_context c; /*in*/
- int is_forall; /*in*/
- unsigned int weight; /*in*/
- Z3_symbol quantifier_id; /*in*/
- Z3_symbol skolem_id; /*in*/
- unsigned int num_bound; /*in*/
- Z3_app const *bound; /*in*/
- unsigned int num_patterns; /*in*/
- Z3_pattern const *patterns; /*in*/
- unsigned int num_no_patterns; /*in*/
- Z3_ast const *no_patterns; /*in*/
- Z3_ast body; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- is_forall = Int_val(_v_is_forall);
- weight = Int_val(_v_weight);
- camlidl_ml2c_z3V3_Z3_symbol(_v_quantifier_id, &quantifier_id, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_skolem_id, &skolem_id, _ctx);
- _c1 = Wosize_val(_v_bound);
- bound = camlidl_malloc(_c1 * sizeof(Z3_app const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_bound, _c2);
- camlidl_ml2c_z3V3_Z3_app(_v3, &bound[_c2], _ctx);
- }
- num_bound = _c1;
- _c4 = Wosize_val(_v_patterns);
- patterns = camlidl_malloc(_c4 * sizeof(Z3_pattern const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_patterns, _c5);
- camlidl_ml2c_z3V3_Z3_pattern(_v6, &patterns[_c5], _ctx);
- }
- num_patterns = _c4;
- _c7 = Wosize_val(_v_no_patterns);
- no_patterns = camlidl_malloc(_c7 * sizeof(Z3_ast const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_no_patterns, _c8);
- camlidl_ml2c_z3V3_Z3_ast(_v9, &no_patterns[_c8], _ctx);
- }
- num_no_patterns = _c7;
- camlidl_ml2c_z3V3_Z3_ast(_v_body, &body, _ctx);
- _res = Z3_mk_quantifier_const_ex(c, is_forall, weight, quantifier_id, skolem_id, num_bound, bound, num_patterns, patterns, num_no_patterns, no_patterns, body);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_quantifier_const_ex_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_mk_quantifier_const_ex(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8]);
-}
-
-value camlidl_z3V3_Z3_get_symbol_kind(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_symbol_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_kind(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_symbol_kind(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_symbol_int(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_int(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_symbol_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_get_symbol_string(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_sort_name(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_sort d; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_d, &d, _ctx);
- _res = Z3_get_sort_name(c, d);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_sort_id(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_get_sort_id(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_sort_to_ast(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_sort_to_ast(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_eq_sort(
- value _v_c,
- value _v_s1,
- value _v_s2)
-{
- Z3_context c; /*in*/
- Z3_sort s1; /*in*/
- Z3_sort s2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s1, &s1, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s2, &s2, _ctx);
- _res = Z3_is_eq_sort(c, s1, s2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_sort_kind(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_sort_kind(c, t);
- _vres = camlidl_c2ml_z3V3_Z3_sort_kind(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_bv_sort_size(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_bv_sort_size(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_finite_domain_sort_size(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned long long *r; /*out*/
- unsigned long long _c1;
- value _v2;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- r = &_c1;
- Z3_get_finite_domain_sort_size(c, s, r);
- if (r == NULL) {
- _vres = Val_int(0);
- } else {
- _v2 = copy_int64(*r);
- Begin_root(_v2)
- _vres = camlidl_alloc_small(1, 0);
- Field(_vres, 0) = _v2;
- End_roots();
- }
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_array_sort_domain(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_array_sort_domain(c, t);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_array_sort_range(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_array_sort_range(c, t);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_tuple_sort_mk_decl(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_tuple_sort_mk_decl(c, t);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_tuple_sort_num_fields(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_tuple_sort_num_fields(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_tuple_sort_field_decl(
- value _v_c,
- value _v_t,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_tuple_sort_field_decl(c, t, i);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_datatype_sort_num_constructors(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- _res = Z3_get_datatype_sort_num_constructors(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_datatype_sort_constructor(
- value _v_c,
- value _v_t,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_datatype_sort_constructor(c, t, idx);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_datatype_sort_recognizer(
- value _v_c,
- value _v_t,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_datatype_sort_recognizer(c, t, idx);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_datatype_sort_constructor_accessor(
- value _v_c,
- value _v_t,
- value _v_idx_c,
- value _v_idx_a)
-{
- Z3_context c; /*in*/
- Z3_sort t; /*in*/
- unsigned int idx_c; /*in*/
- unsigned int idx_a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_t, &t, _ctx);
- idx_c = Int_val(_v_idx_c);
- idx_a = Int_val(_v_idx_a);
- _res = Z3_get_datatype_sort_constructor_accessor(c, t, idx_c, idx_a);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_relation_arity(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_get_relation_arity(c, s);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_relation_column(
- value _v_c,
- value _v_s,
- value _v_col)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- unsigned int col; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- col = Int_val(_v_col);
- _res = Z3_get_relation_column(c, s, col);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_func_decl_to_ast(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_f, &f, _ctx);
- _res = Z3_func_decl_to_ast(c, f);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_eq_func_decl(
- value _v_c,
- value _v_f1,
- value _v_f2)
-{
- Z3_context c; /*in*/
- Z3_func_decl f1; /*in*/
- Z3_func_decl f2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_f1, &f1, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_f2, &f2, _ctx);
- _res = Z3_is_eq_func_decl(c, f1, f2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_func_decl_id(
- value _v_c,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_func_decl f; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_f, &f, _ctx);
- _res = Z3_get_func_decl_id(c, f);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_name(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_name(c, d);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_kind(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_decl_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_kind(c, d);
- _vres = camlidl_c2ml_z3V3_Z3_decl_kind(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_domain_size(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_domain_size(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_arity(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_arity(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_domain(
- value _v_c,
- value _v_d,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_domain(c, d, i);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_range(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_range(c, d);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_num_parameters(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_get_decl_num_parameters(c, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_parameter_kind(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_parameter_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_parameter_kind(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_parameter_kind(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_int_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_int_parameter(c, d, idx);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_double_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- double _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_double_parameter(c, d, idx);
- _vres = copy_double(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_symbol_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_symbol_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_sort_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_sort_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_ast_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_ast_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_func_decl_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_func_decl_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_decl_rational_parameter(
- value _v_c,
- value _v_d,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int idx; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_decl_rational_parameter(c, d, idx);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_app_to_ast(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_app_to_ast(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_app_decl(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_get_app_decl(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_app_num_args(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_app(_v_a, &a, _ctx);
- _res = Z3_get_app_num_args(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_app_arg(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_app a; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_app(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_app_arg(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_eq_ast(
- value _v_c,
- value _v_t1,
- value _v_t2)
-{
- Z3_context c; /*in*/
- Z3_ast t1; /*in*/
- Z3_ast t2; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t1, &t1, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t2, &t2, _ctx);
- _res = Z3_is_eq_ast(c, t1, t2);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_ast_id(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_ast t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t, &t, _ctx);
- _res = Z3_get_ast_id(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_ast_hash(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_ast_hash(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_sort(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_sort(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_well_sorted(
- value _v_c,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_ast t; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t, &t, _ctx);
- _res = Z3_is_well_sorted(c, t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_bool_value(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_lbool _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_bool_value(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_ast_kind(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast_kind _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_ast_kind(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast_kind(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_app(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_app(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_numeral_ast(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_numeral_ast(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_algebraic_number(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_algebraic_number(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_to_app(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_app _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_to_app(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_app(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_to_func_decl(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_to_func_decl(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_numeral_string(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_numeral_string(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_numeral_decimal_string(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_numeral_decimal_string(c, a, precision);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_numerator(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_numerator(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_denominator(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_denominator(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_numeral_small(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- long long *num; /*out*/
- long long *den; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- long long _c2;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- num = &_c1;
- den = &_c2;
- _res = Z3_get_numeral_small(c, a, num, den);
- Begin_roots_block(_vres, 3)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*num);
- _vres[2] = copy_int64(*den);
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_numeral_int(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- int *i; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- int _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- i = &_c1;
- _res = Z3_get_numeral_int(c, v, i);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = Val_int(*i);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_numeral_int64(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- long long *i; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- i = &_c1;
- _res = Z3_get_numeral_int64(c, v, i);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*i);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_numeral_rational_int64(
- value _v_c,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_ast v; /*in*/
- long long *num; /*out*/
- long long *den; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- long long _c1;
- long long _c2;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- num = &_c1;
- den = &_c2;
- _res = Z3_get_numeral_rational_int64(c, v, num, den);
- Begin_roots_block(_vres, 3)
- _vres[0] = Val_int(_res);
- _vres[1] = copy_int64(*num);
- _vres[2] = copy_int64(*den);
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_algebraic_number_lower(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_algebraic_number_lower(c, a, precision);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_algebraic_number_upper(
- value _v_c,
- value _v_a,
- value _v_precision)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int precision; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- precision = Int_val(_v_precision);
- _res = Z3_get_algebraic_number_upper(c, a, precision);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_pattern_to_ast(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_pattern_to_ast(c, p);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_pattern_num_terms(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_get_pattern_num_terms(c, p);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_pattern(
- value _v_c,
- value _v_p,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_pattern(_v_p, &p, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_pattern(c, p, idx);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_index_value(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_index_value(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_is_quantifier_forall(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_is_quantifier_forall(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_weight(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_weight(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_num_patterns(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_patterns(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_pattern_ast(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_pattern _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_pattern_ast(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_pattern(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_num_no_patterns(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_no_patterns(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_no_pattern_ast(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_no_pattern_ast(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_num_bound(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_num_bound(c, a);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_bound_name(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_bound_name(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_bound_sort(
- value _v_c,
- value _v_a,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_quantifier_bound_sort(c, a, i);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_quantifier_body(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_get_quantifier_body(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_simplify(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_simplify(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_update_term(
- value _v_c,
- value _v_a,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- _res = Z3_update_term(c, a, num_args, args);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_substitute(
- value _v_c,
- value _v_a,
- value _v_from,
- value _v_to)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_exprs; /*in*/
- Z3_ast const *from; /*in*/
- Z3_ast const *to; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_from);
- from = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_from, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &from[_c2], _ctx);
- }
- num_exprs = _c1;
- _c4 = Wosize_val(_v_to);
- to = camlidl_malloc(_c4 * sizeof(Z3_ast const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_to, _c5);
- camlidl_ml2c_z3V3_Z3_ast(_v6, &to[_c5], _ctx);
- }
- num_exprs = _c4;
- _res = Z3_substitute(c, a, num_exprs, from, to);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_substitute_vars(
- value _v_c,
- value _v_a,
- value _v_to)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_exprs; /*in*/
- Z3_ast const *to; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _c1 = Wosize_val(_v_to);
- to = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_to, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &to[_c2], _ctx);
- }
- num_exprs = _c1;
- _res = Z3_substitute_vars(c, a, num_exprs, to);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_open_log(
- value _v_filename)
-{
- Z3_string filename; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_filename, &filename, _ctx);
- _res = Z3_open_log(filename);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_append_log(
- value _v_string)
-{
- Z3_string string; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_string, &string, _ctx);
- Z3_append_log(string);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_close_log(value _unit)
-{
- Z3_close_log();
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_toggle_warning_messages(
- value _v_enabled)
-{
- int enabled; /*in*/
- enabled = Int_val(_v_enabled);
- Z3_toggle_warning_messages(enabled);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_set_ast_print_mode(
- value _v_c,
- value _v_mode)
-{
- Z3_context c; /*in*/
- Z3_ast_print_mode mode; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast_print_mode(_v_mode, &mode, _ctx);
- Z3_set_ast_print_mode(c, mode);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_ast_to_string(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- _res = Z3_ast_to_string(c, a);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_pattern_to_string(
- value _v_c,
- value _v_p)
-{
- Z3_context c; /*in*/
- Z3_pattern p; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_pattern(_v_p, &p, _ctx);
- _res = Z3_pattern_to_string(c, p);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_sort_to_string(
- value _v_c,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_sort s; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_sort_to_string(c, s);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_func_decl_to_string(
- value _v_c,
- value _v_d)
-{
- Z3_context c; /*in*/
- Z3_func_decl d; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_func_decl_to_string(c, d);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_model_to_string(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_model_to_string(c, m);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_benchmark_to_smtlib_string(
- value _v_c,
- value _v_name,
- value _v_logic,
- value _v_status,
- value _v_attributes,
- value _v_assumptions,
- value _v_formula)
-{
- Z3_context c; /*in*/
- Z3_string name; /*in*/
- Z3_string logic; /*in*/
- Z3_string status; /*in*/
- Z3_string attributes; /*in*/
- unsigned int num_assumptions; /*in*/
- Z3_ast const *assumptions; /*in*/
- Z3_ast formula; /*in*/
- Z3_string _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_name, &name, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_logic, &logic, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_status, &status, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_attributes, &attributes, _ctx);
- _c1 = Wosize_val(_v_assumptions);
- assumptions = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_assumptions, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &assumptions[_c2], _ctx);
- }
- num_assumptions = _c1;
- camlidl_ml2c_z3V3_Z3_ast(_v_formula, &formula, _ctx);
- _res = Z3_benchmark_to_smtlib_string(c, name, logic, status, attributes, num_assumptions, assumptions, formula);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_benchmark_to_smtlib_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_benchmark_to_smtlib_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6]);
-}
-
-value camlidl_z3V3_Z3_parse_smtlib2_string(
- value _v_c,
- value _v_str,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string str; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_str, &str, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3V3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- _res = Z3_parse_smtlib2_string(c, str, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_parse_smtlib2_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_parse_smtlib2_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_parse_smtlib2_file(
- value _v_c,
- value _v_file_name,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string file_name; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- Z3_ast _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_file_name, &file_name, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3V3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- _res = Z3_parse_smtlib2_file(c, file_name, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_parse_smtlib2_file_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_parse_smtlib2_file(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_parse_smtlib_string(
- value _v_c,
- value _v_str,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string str; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_str, &str, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3V3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- Z3_parse_smtlib_string(c, str, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_parse_smtlib_string_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_parse_smtlib_string(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_parse_smtlib_file(
- value _v_c,
- value _v_file_name,
- value _v_sort_names,
- value _v_sorts,
- value _v_decl_names,
- value _v_decls)
-{
- Z3_context c; /*in*/
- Z3_string file_name; /*in*/
- unsigned int num_sorts; /*in*/
- Z3_symbol const *sort_names; /*in*/
- Z3_sort const *sorts; /*in*/
- unsigned int num_decls; /*in*/
- Z3_symbol const *decl_names; /*in*/
- Z3_func_decl const *decls; /*in*/
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- mlsize_t _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- mlsize_t _c11;
- value _v12;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_file_name, &file_name, _ctx);
- _c1 = Wosize_val(_v_sort_names);
- sort_names = camlidl_malloc(_c1 * sizeof(Z3_symbol const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_sort_names, _c2);
- camlidl_ml2c_z3V3_Z3_symbol(_v3, &sort_names[_c2], _ctx);
- }
- num_sorts = _c1;
- _c4 = Wosize_val(_v_sorts);
- sorts = camlidl_malloc(_c4 * sizeof(Z3_sort const ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_sorts, _c5);
- camlidl_ml2c_z3V3_Z3_sort(_v6, &sorts[_c5], _ctx);
- }
- num_sorts = _c4;
- _c7 = Wosize_val(_v_decl_names);
- decl_names = camlidl_malloc(_c7 * sizeof(Z3_symbol const ), _ctx);
- for (_c8 = 0; _c8 < _c7; _c8++) {
- _v9 = Field(_v_decl_names, _c8);
- camlidl_ml2c_z3V3_Z3_symbol(_v9, &decl_names[_c8], _ctx);
- }
- num_decls = _c7;
- _c10 = Wosize_val(_v_decls);
- decls = camlidl_malloc(_c10 * sizeof(Z3_func_decl const ), _ctx);
- for (_c11 = 0; _c11 < _c10; _c11++) {
- _v12 = Field(_v_decls, _c11);
- camlidl_ml2c_z3V3_Z3_func_decl(_v12, &decls[_c11], _ctx);
- }
- num_decls = _c10;
- Z3_parse_smtlib_file(c, file_name, num_sorts, sort_names, sorts, num_decls, decl_names, decls);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_parse_smtlib_file_bytecode(value * argv, int argn)
-{
- return camlidl_z3V3_Z3_parse_smtlib_file(argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]);
-}
-
-value camlidl_z3V3_Z3_get_smtlib_num_formulas(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_formulas(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_formula(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_formula(c, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_num_assumptions(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_assumptions(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_assumption(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_assumption(c, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_num_decls(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_decls(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_decl(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_decl(c, i);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_num_sorts(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_num_sorts(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_sort(
- value _v_c,
- value _v_i)
-{
- Z3_context c; /*in*/
- unsigned int i; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_smtlib_sort(c, i);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_smtlib_error(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_smtlib_error(c);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_version(value _unit)
-{
- unsigned int *major; /*out*/
- unsigned int *minor; /*out*/
- unsigned int *build_number; /*out*/
- unsigned int *revision_number; /*out*/
- unsigned int _c1;
- unsigned int _c2;
- unsigned int _c3;
- unsigned int _c4;
- value _vresult;
- value _vres[4] = { 0, 0, 0, 0, };
-
- major = &_c1;
- minor = &_c2;
- build_number = &_c3;
- revision_number = &_c4;
- Z3_get_version(major, minor, build_number, revision_number);
- Begin_roots_block(_vres, 4)
- _vres[0] = Val_int(*major);
- _vres[1] = Val_int(*minor);
- _vres[2] = Val_int(*build_number);
- _vres[3] = Val_int(*revision_number);
- _vresult = camlidl_alloc_small(4, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- Field(_vresult, 3) = _vres[3];
- End_roots()
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_enable_trace(
- value _v_tag)
-{
- Z3_string tag; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_tag, &tag, _ctx);
- Z3_enable_trace(tag);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_disable_trace(
- value _v_tag)
-{
- Z3_string tag; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_string(_v_tag, &tag, _ctx);
- Z3_disable_trace(tag);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_reset_memory(value _unit)
-{
- Z3_reset_memory();
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_theory_mk_sort(
- value _v_c,
- value _v_t,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_theory t; /*in*/
- Z3_symbol s; /*in*/
- Z3_sort _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _res = Z3_theory_mk_sort(c, t, s);
- _vres = camlidl_c2ml_z3V3_Z3_sort(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_mk_value(
- value _v_c,
- value _v_t,
- value _v_n,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_theory t; /*in*/
- Z3_symbol n; /*in*/
- Z3_sort s; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_n, &n, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_theory_mk_value(c, t, n, s);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_mk_constant(
- value _v_c,
- value _v_t,
- value _v_n,
- value _v_s)
-{
- Z3_context c; /*in*/
- Z3_theory t; /*in*/
- Z3_symbol n; /*in*/
- Z3_sort s; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_n, &n, _ctx);
- camlidl_ml2c_z3V3_Z3_sort(_v_s, &s, _ctx);
- _res = Z3_theory_mk_constant(c, t, n, s);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_mk_func_decl(
- value _v_c,
- value _v_t,
- value _v_n,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_theory t; /*in*/
- Z3_symbol n; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_n, &n, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3V3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3V3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_theory_mk_func_decl(c, t, n, domain_size, domain, range);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_context(
- value _v_t)
-{
- Z3_theory t; /*in*/
- Z3_context _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- _res = Z3_theory_get_context(t);
- _vres = camlidl_c2ml_z3V3_Z3_context(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_assert_axiom(
- value _v_t,
- value _v_ax)
-{
- Z3_theory t; /*in*/
- Z3_ast ax; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_ax, &ax, _ctx);
- Z3_theory_assert_axiom(t, ax);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_theory_assume_eq(
- value _v_t,
- value _v_lhs,
- value _v_rhs)
-{
- Z3_theory t; /*in*/
- Z3_ast lhs; /*in*/
- Z3_ast rhs; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_lhs, &lhs, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_rhs, &rhs, _ctx);
- Z3_theory_assume_eq(t, lhs, rhs);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_theory_enable_axiom_simplification(
- value _v_t,
- value _v_flag)
-{
- Z3_theory t; /*in*/
- int flag; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- flag = Int_val(_v_flag);
- Z3_theory_enable_axiom_simplification(t, flag);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_theory_get_eqc_root(
- value _v_t,
- value _v_n)
-{
- Z3_theory t; /*in*/
- Z3_ast n; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_n, &n, _ctx);
- _res = Z3_theory_get_eqc_root(t, n);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_eqc_next(
- value _v_t,
- value _v_n)
-{
- Z3_theory t; /*in*/
- Z3_ast n; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_n, &n, _ctx);
- _res = Z3_theory_get_eqc_next(t, n);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_num_parents(
- value _v_t,
- value _v_n)
-{
- Z3_theory t; /*in*/
- Z3_ast n; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_n, &n, _ctx);
- _res = Z3_theory_get_num_parents(t, n);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_parent(
- value _v_t,
- value _v_n,
- value _v_i)
-{
- Z3_theory t; /*in*/
- Z3_ast n; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_n, &n, _ctx);
- i = Int_val(_v_i);
- _res = Z3_theory_get_parent(t, n, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_is_value(
- value _v_t,
- value _v_n)
-{
- Z3_theory t; /*in*/
- Z3_ast n; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_n, &n, _ctx);
- _res = Z3_theory_is_value(t, n);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_is_decl(
- value _v_t,
- value _v_d)
-{
- Z3_theory t; /*in*/
- Z3_func_decl d; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _res = Z3_theory_is_decl(t, d);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_num_elems(
- value _v_t)
-{
- Z3_theory t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- _res = Z3_theory_get_num_elems(t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_elem(
- value _v_t,
- value _v_i)
-{
- Z3_theory t; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- i = Int_val(_v_i);
- _res = Z3_theory_get_elem(t, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_num_apps(
- value _v_t)
-{
- Z3_theory t; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- _res = Z3_theory_get_num_apps(t);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_theory_get_app(
- value _v_t,
- value _v_i)
-{
- Z3_theory t; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_theory(_v_t, &t, _ctx);
- i = Int_val(_v_i);
- _res = Z3_theory_get_app(t, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_injective_function(
- value _v_c,
- value _v_s,
- value _v_domain,
- value _v_range)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- unsigned int domain_size; /*in*/
- Z3_sort const *domain; /*in*/
- Z3_sort range; /*in*/
- Z3_func_decl _res;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- _c1 = Wosize_val(_v_domain);
- domain = camlidl_malloc(_c1 * sizeof(Z3_sort const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_domain, _c2);
- camlidl_ml2c_z3V3_Z3_sort(_v3, &domain[_c2], _ctx);
- }
- domain_size = _c1;
- camlidl_ml2c_z3V3_Z3_sort(_v_range, &range, _ctx);
- _res = Z3_mk_injective_function(c, s, domain_size, domain, range);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_set_logic(
- value _v_c,
- value _v_logic)
-{
- Z3_context c; /*in*/
- Z3_string logic; /*in*/
- int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_string(_v_logic, &logic, _ctx);
- _res = Z3_set_logic(c, logic);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_push(
- value _v_c)
-{
- Z3_context c; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- Z3_push(c);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_pop(
- value _v_c,
- value _v_num_scopes)
-{
- Z3_context c; /*in*/
- unsigned int num_scopes; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- num_scopes = Int_val(_v_num_scopes);
- Z3_pop(c, num_scopes);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_get_num_scopes(
- value _v_c)
-{
- Z3_context c; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_num_scopes(c);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_persist_ast(
- value _v_c,
- value _v_a,
- value _v_num_scopes)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- unsigned int num_scopes; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- num_scopes = Int_val(_v_num_scopes);
- Z3_persist_ast(c, a, num_scopes);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_assert_cnstr(
- value _v_c,
- value _v_a)
-{
- Z3_context c; /*in*/
- Z3_ast a; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_a, &a, _ctx);
- Z3_assert_cnstr(c, a);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_check_and_get_model(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_model *m; /*out*/
- Z3_lbool _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_model _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- m = &_c1;
- _res = Z3_check_and_get_model(c, m);
- Begin_roots_block(_vres, 2)
- _vres[0] = camlidl_c2ml_z3V3_Z3_lbool(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3V3_Z3_model(&*m, _ctx);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_check(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_lbool _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_check(c);
- _vres = camlidl_c2ml_z3V3_Z3_lbool(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_check_assumptions(
- value _v_c,
- value _v_assumptions,
- value _v_core_size,
- value _v_core)
-{
- Z3_context c; /*in*/
- unsigned int num_assumptions; /*in*/
- Z3_ast const *assumptions; /*in*/
- Z3_model *m; /*out*/
- Z3_ast *proof; /*out*/
- unsigned int *core_size; /*in,out*/
- Z3_ast *core; /*in,out*/
- Z3_lbool _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- unsigned int _c4;
- mlsize_t _c5;
- mlsize_t _c6;
- value _v7;
- Z3_model _c8;
- Z3_ast _c9;
- mlsize_t _c10;
- value _v11;
- value _vresult;
- value _vres[5] = { 0, 0, 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _c1 = Wosize_val(_v_assumptions);
- assumptions = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_assumptions, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &assumptions[_c2], _ctx);
- }
- num_assumptions = _c1;
- core_size = &_c4;
- _c4 = Int_val(_v_core_size);
- _c5 = Wosize_val(_v_core);
- core = camlidl_malloc(_c5 * sizeof(Z3_ast ), _ctx);
- for (_c6 = 0; _c6 < _c5; _c6++) {
- _v7 = Field(_v_core, _c6);
- camlidl_ml2c_z3V3_Z3_ast(_v7, &core[_c6], _ctx);
- }
- num_assumptions = _c5;
- m = &_c8;
- proof = &_c9;
- _res = Z3_check_assumptions(c, num_assumptions, assumptions, m, proof, core_size, core);
- Begin_roots_block(_vres, 5)
- _vres[0] = camlidl_c2ml_z3V3_Z3_lbool(&_res, _ctx);
- _vres[1] = camlidl_c2ml_z3V3_Z3_model(&*m, _ctx);
- _vres[2] = camlidl_c2ml_z3V3_Z3_ast(&*proof, _ctx);
- _vres[3] = Val_int(*core_size);
- _vres[4] = camlidl_alloc(num_assumptions, 0);
- Begin_root(_vres[4])
- for (_c10 = 0; _c10 < num_assumptions; _c10++) {
- _v11 = camlidl_c2ml_z3V3_Z3_ast(&core[_c10], _ctx);
- modify(&Field(_vres[4], _c10), _v11);
- }
- End_roots()
- _vresult = camlidl_alloc_small(5, 0);
- { mlsize_t _c12;
- for (_c12 = 0; _c12 < 5; _c12++) Field(_vresult, _c12) = _vres[_c12];
- }
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_del_model(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- Z3_del_model(c, m);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_soft_check_cancel(
- value _v_c)
-{
- Z3_context c; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- Z3_soft_check_cancel(c);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_get_search_failure(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_search_failure _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_search_failure(c);
- _vres = camlidl_c2ml_z3V3_Z3_search_failure(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_mk_label(
- value _v_c,
- value _v_s,
- value _v_is_pos,
- value _v_f)
-{
- Z3_context c; /*in*/
- Z3_symbol s; /*in*/
- int is_pos; /*in*/
- Z3_ast f; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_symbol(_v_s, &s, _ctx);
- is_pos = Int_val(_v_is_pos);
- camlidl_ml2c_z3V3_Z3_ast(_v_f, &f, _ctx);
- _res = Z3_mk_label(c, s, is_pos, f);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_relevant_labels(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_literals _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_relevant_labels(c);
- _vres = camlidl_c2ml_z3V3_Z3_literals(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_relevant_literals(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_literals _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_relevant_literals(c);
- _vres = camlidl_c2ml_z3V3_Z3_literals(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_guessed_literals(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_literals _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_guessed_literals(c);
- _vres = camlidl_c2ml_z3V3_Z3_literals(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_del_literals(
- value _v_c,
- value _v_lbls)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- Z3_del_literals(c, lbls);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_get_num_literals(
- value _v_c,
- value _v_lbls)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- _res = Z3_get_num_literals(c, lbls);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_label_symbol(
- value _v_c,
- value _v_lbls,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- unsigned int idx; /*in*/
- Z3_symbol _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_label_symbol(c, lbls, idx);
- _vres = camlidl_c2ml_z3V3_Z3_symbol(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_literal(
- value _v_c,
- value _v_lbls,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- unsigned int idx; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- idx = Int_val(_v_idx);
- _res = Z3_get_literal(c, lbls, idx);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_disable_literal(
- value _v_c,
- value _v_lbls,
- value _v_idx)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- unsigned int idx; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- idx = Int_val(_v_idx);
- Z3_disable_literal(c, lbls, idx);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_block_literals(
- value _v_c,
- value _v_lbls)
-{
- Z3_context c; /*in*/
- Z3_literals lbls; /*in*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_literals(_v_lbls, &lbls, _ctx);
- Z3_block_literals(c, lbls);
- camlidl_free(_ctx);
- return Val_unit;
-}
-
-value camlidl_z3V3_Z3_get_model_num_constants(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_get_model_num_constants(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_constant(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_model_constant(c, m, i);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_num_funcs(
- value _v_c,
- value _v_m)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- _res = Z3_get_model_num_funcs(c, m);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_func_decl(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_func_decl _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_model_func_decl(c, m, i);
- _vres = camlidl_c2ml_z3V3_Z3_func_decl(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_eval_func_decl(
- value _v_c,
- value _v_m,
- value _v_decl)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_func_decl decl; /*in*/
- Z3_ast *v; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_ast _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_decl, &decl, _ctx);
- v = &_c1;
- _res = Z3_eval_func_decl(c, m, decl, v);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = camlidl_c2ml_z3V3_Z3_ast(&*v, _ctx);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_is_array_value(
- value _v_c,
- value _v_m,
- value _v_v)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_ast v; /*in*/
- unsigned int *num_entries; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- unsigned int _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- num_entries = &_c1;
- _res = Z3_is_array_value(c, m, v, num_entries);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = Val_int(*num_entries);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_array_value(
- value _v_c,
- value _v_m,
- value _v_v,
- value _v_indices,
- value _v_values)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_ast v; /*in*/
- unsigned int num_entries; /*in*/
- Z3_ast *indices; /*in,out*/
- Z3_ast *values; /*in,out*/
- Z3_ast *else_value; /*out*/
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- mlsize_t _c4;
- mlsize_t _c5;
- value _v6;
- Z3_ast _c7;
- mlsize_t _c8;
- value _v9;
- mlsize_t _c10;
- value _v11;
- value _vresult;
- value _vres[3] = { 0, 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_v, &v, _ctx);
- _c1 = Wosize_val(_v_indices);
- indices = camlidl_malloc(_c1 * sizeof(Z3_ast ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_indices, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &indices[_c2], _ctx);
- }
- num_entries = _c1;
- _c4 = Wosize_val(_v_values);
- values = camlidl_malloc(_c4 * sizeof(Z3_ast ), _ctx);
- for (_c5 = 0; _c5 < _c4; _c5++) {
- _v6 = Field(_v_values, _c5);
- camlidl_ml2c_z3V3_Z3_ast(_v6, &values[_c5], _ctx);
- }
- num_entries = _c4;
- else_value = &_c7;
- Z3_get_array_value(c, m, v, num_entries, indices, values, else_value);
- Begin_roots_block(_vres, 3)
- _vres[0] = camlidl_alloc(num_entries, 0);
- Begin_root(_vres[0])
- for (_c8 = 0; _c8 < num_entries; _c8++) {
- _v9 = camlidl_c2ml_z3V3_Z3_ast(&indices[_c8], _ctx);
- modify(&Field(_vres[0], _c8), _v9);
- }
- End_roots()
- _vres[1] = camlidl_alloc(num_entries, 0);
- Begin_root(_vres[1])
- for (_c10 = 0; _c10 < num_entries; _c10++) {
- _v11 = camlidl_c2ml_z3V3_Z3_ast(&values[_c10], _ctx);
- modify(&Field(_vres[1], _c10), _v11);
- }
- End_roots()
- _vres[2] = camlidl_c2ml_z3V3_Z3_ast(&*else_value, _ctx);
- _vresult = camlidl_alloc_small(3, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- Field(_vresult, 2) = _vres[2];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_get_model_func_else(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_model_func_else(c, m, i);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_func_num_entries(
- value _v_c,
- value _v_m,
- value _v_i)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- _res = Z3_get_model_func_num_entries(c, m, i);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_func_entry_num_args(
- value _v_c,
- value _v_m,
- value _v_i,
- value _v_j)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- unsigned int j; /*in*/
- unsigned int _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- j = Int_val(_v_j);
- _res = Z3_get_model_func_entry_num_args(c, m, i, j);
- _vres = Val_int(_res);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_func_entry_arg(
- value _v_c,
- value _v_m,
- value _v_i,
- value _v_j,
- value _v_k)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- unsigned int j; /*in*/
- unsigned int k; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- j = Int_val(_v_j);
- k = Int_val(_v_k);
- _res = Z3_get_model_func_entry_arg(c, m, i, j, k);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_model_func_entry_value(
- value _v_c,
- value _v_m,
- value _v_i,
- value _v_j)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- unsigned int i; /*in*/
- unsigned int j; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- i = Int_val(_v_i);
- j = Int_val(_v_j);
- _res = Z3_get_model_func_entry_value(c, m, i, j);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_eval(
- value _v_c,
- value _v_m,
- value _v_t)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_ast t; /*in*/
- Z3_ast *v; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- Z3_ast _c1;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3V3_Z3_ast(_v_t, &t, _ctx);
- v = &_c1;
- _res = Z3_eval(c, m, t, v);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = camlidl_c2ml_z3V3_Z3_ast(&*v, _ctx);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_eval_decl(
- value _v_c,
- value _v_m,
- value _v_d,
- value _v_args)
-{
- Z3_context c; /*in*/
- Z3_model m; /*in*/
- Z3_func_decl d; /*in*/
- unsigned int num_args; /*in*/
- Z3_ast const *args; /*in*/
- Z3_ast *v; /*out*/
- int _res;
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- mlsize_t _c1;
- mlsize_t _c2;
- value _v3;
- Z3_ast _c4;
- value _vresult;
- value _vres[2] = { 0, 0, };
-
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- camlidl_ml2c_z3V3_Z3_model(_v_m, &m, _ctx);
- camlidl_ml2c_z3V3_Z3_func_decl(_v_d, &d, _ctx);
- _c1 = Wosize_val(_v_args);
- args = camlidl_malloc(_c1 * sizeof(Z3_ast const ), _ctx);
- for (_c2 = 0; _c2 < _c1; _c2++) {
- _v3 = Field(_v_args, _c2);
- camlidl_ml2c_z3V3_Z3_ast(_v3, &args[_c2], _ctx);
- }
- num_args = _c1;
- v = &_c4;
- _res = Z3_eval_decl(c, m, d, num_args, args, v);
- Begin_roots_block(_vres, 2)
- _vres[0] = Val_int(_res);
- _vres[1] = camlidl_c2ml_z3V3_Z3_ast(&*v, _ctx);
- _vresult = camlidl_alloc_small(2, 0);
- Field(_vresult, 0) = _vres[0];
- Field(_vresult, 1) = _vres[1];
- End_roots()
- camlidl_free(_ctx);
- return _vresult;
-}
-
-value camlidl_z3V3_Z3_context_to_string(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_context_to_string(c);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_statistics_to_string(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_string _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_statistics_to_string(c);
- _vres = camlidl_c2ml_z3V3_Z3_string(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
-value camlidl_z3V3_Z3_get_context_assignment(
- value _v_c)
-{
- Z3_context c; /*in*/
- Z3_ast _res;
- value _vres;
-
- struct camlidl_ctx_struct _ctxs = { CAMLIDL_TRANSIENT, NULL };
- camlidl_ctx _ctx = &_ctxs;
- camlidl_ml2c_z3V3_Z3_context(_v_c, &c, _ctx);
- _res = Z3_get_context_assignment(c);
- _vres = camlidl_c2ml_z3V3_Z3_ast(&_res, _ctx);
- camlidl_free(_ctx);
- return _vres;
-}
-
diff --git a/src/api/ml/z3_theory_stubs.c b/src/api/ml/z3_theory_stubs.c
deleted file mode 100644
index a48b94553..000000000
--- a/src/api/ml/z3_theory_stubs.c
+++ /dev/null
@@ -1,339 +0,0 @@
-/*++
-Copyright (c) Microsoft Corporation
-
-Module Name:
-
- z3_theory_stubs.c
-
-Abstract:
-
- OCaml C bindings for callbacks between OCaml and C for
- theory plugins.
- The API for theory plugins require associating a set of
- callbacks as C function pointers.
- We use the following strategy:
-
- - store in the user_ext_data blob that theory constructors allow
- a record of callback functions.
-
- - define catch-all static callback functions that access the
- ML record with the callbacks. It then invokes these through user-registered
- application functions that apply the callback stored in the record to the
- actual parameters.
- It is tempting to avoid this user-registered callback and directly access
- the record of callback functions and apply the proper field.
- However, the layout of records appears to be opaque, or at least we assume it is
- so, from the C runtime.
-
-Author:
-
-
-Revision History:
---*/
-
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-#ifdef Custom_tag
-#include
-#include
-#endif
-
-#include "z3.h"
-
-#define ML_SIZE(_ty) ((sizeof(_ty) + sizeof(value) - 1)/ sizeof(value))
-
-static value mk_func_decl(Z3_func_decl f) {
- value _f = alloc(ML_SIZE(Z3_func_decl), Abstract_tag);
- *((Z3_func_decl*) Bp_val(_f)) = f;
- return _f;
-}
-
-static value Val_ast(Z3_ast a) {
- value _a = alloc(ML_SIZE(Z3_ast), Abstract_tag);
- *((Z3_ast*) Bp_val(_a)) = a;
- return _a;
-}
-
-
-static value Val_ast_array(unsigned int sz, Z3_ast const args[]) {
- value res;
- Z3_ast* args1;
- unsigned int i;
- args1 = malloc((sz+1)*sizeof(Z3_ast));
- for (i = 0; i < sz; ++i) {
- args1[i] = args[i];
- }
- args1[sz] = 0;
- res = alloc_array((value (*)(char const*))Val_ast, (const char**)args1);
- free(args1);
- return res;
-}
-
-// ------------------
-// get_theory_callbacks
-//
-
-value get_theory_callbacks(value th)
-{
- Z3_theory _th = *((Z3_theory*) Bp_val(th));
- return (value) Z3_theory_get_ext_data(_th);
-}
-
-// ------------------
-// delete_theory
-//
-static void delete_callback_static(Z3_theory th)
-{
- CAMLparam0();
- CAMLlocal1(f);
- value user_data = (value) Z3_theory_get_ext_data(th);
- f = *(caml_named_value("apply_delete")) ;
- callback(f, user_data);
- remove_global_root(&user_data);
- CAMLreturn0;
-}
-
-#define SET_CALLBACK(_cb_name) \
- value set_ ## _cb_name ## _callback_register(value th) \
- { \
- CAMLparam1(th); \
- Z3_theory _th = *((Z3_theory*) Bp_val(th)); \
- Z3_set_ ## _cb_name ## _callback(_th, _cb_name ## _callback_static); \
- CAMLreturn(Val_unit); \
- } \
-
-SET_CALLBACK(delete);
-
-
-// ------------------
-// mk_theory
-//
-
-value mk_theory_register(value context, value name, value user_data)
-{
- CAMLparam3(context, name, user_data);
- Z3_context _context = *((Z3_context *) Bp_val(context));
- value _th;
- Z3_theory th;
- register_global_root(&user_data);
- th = Z3_mk_theory(_context, String_val(name), (void*)user_data);
- // jjb: test th == NULL ?
- Z3_set_delete_callback(th, delete_callback_static);
- _th = alloc(ML_SIZE(Z3_context), Abstract_tag);
- *((Z3_theory*) Bp_val(_th)) = th;
- CAMLreturn(_th);
-}
-
-
-// -------------------
-// reduce_app_callback
-
-static Z3_bool reduce_app_callback_static(Z3_theory th, Z3_func_decl f, unsigned num_args, Z3_ast const args[], Z3_ast* r) {
- CAMLparam0();
- CAMLlocal4(cb, _r, _v, _args);
- value user_data;
- Z3_bool result;
-
- _args = Val_ast_array(num_args, args);
-
- user_data = (value) Z3_theory_get_ext_data(th);
-
- cb = *(caml_named_value("apply_reduce_app"));
- _r = callback3(cb, user_data, mk_func_decl(f), _args);
-
- cb = *(caml_named_value("is_some"));
- _v = callback(cb, _r);
- result = 0 != Bool_val(_v);
-
- if (result && r) {
- cb = *(caml_named_value("get_some"));
- _v = callback(cb, _r);
- *r = *((Z3_ast*) Bp_val(_v));
- }
-
- CAMLreturn (result);
-}
-
-SET_CALLBACK(reduce_app);
-
-// -------------------
-// reduce_eq_callback
-
-static Z3_bool reduce_eq_callback_static(Z3_theory th, Z3_ast a, Z3_ast b, Z3_ast * r)
-{
- CAMLparam0();
- CAMLlocal5(cb, _r, _a, _b, _v);
- value user_data;
- Z3_bool result;
-
- _a = Val_ast(a);
- _b = Val_ast(b);
-
- user_data = (value) Z3_theory_get_ext_data(th);
-
- cb = *(caml_named_value("apply_reduce_eq"));
- _r = callback3(cb, user_data, _a, _b);
-
- cb = *(caml_named_value("is_some"));
- _v = callback(cb, _r);
- result = 0 != Bool_val(_v);
-
- if (result && r) {
- cb = *(caml_named_value("get_some"));
- _v = callback(cb, _r);
- *r = *((Z3_ast*) Bp_val(_v));
- }
-
- CAMLreturn (result);
-}
-
-SET_CALLBACK(reduce_eq);
-
-
-// -------------------
-// reduce_distinct
-
-static Z3_bool reduce_distinct_callback_static(Z3_theory th, unsigned n, Z3_ast const args[], Z3_ast * r)
-{
- CAMLparam0();
- CAMLlocal4(cb, _r, _args, _v);
- value user_data;
- Z3_bool result;
-
- _args = Val_ast_array(n, args);
-
- user_data = (value) Z3_theory_get_ext_data(th);
-
- cb = *(caml_named_value("apply_reduce_distinct"));
- _r = callback2(cb, user_data, _args);
-
- cb = *(caml_named_value("is_some"));
- _v = callback(cb, _r);
- result = 0 != Bool_val(_v);
-
- if (result && r) {
- cb = *(caml_named_value("get_some"));
- _v = callback(cb, _r);
- *r = *((Z3_ast*) Bp_val(_v));
- }
-
- CAMLreturn (result);
-}
-
-SET_CALLBACK(reduce_distinct);
-
-// -------------------
-// new_app
-
-#define AST_CALLBACK(_cb_name) \
-static void _cb_name##_callback_static(Z3_theory th, Z3_ast a) \
-{ \
- CAMLparam0(); \
- CAMLlocal3(cb, _a, user_data); \
- _a = Val_ast(a); \
- user_data = (value) Z3_theory_get_ext_data(th); \
- cb = *(caml_named_value("apply_" #_cb_name)); \
- callback2(cb, user_data, _a); \
- CAMLreturn0; \
-} \
-
-AST_CALLBACK(new_app);
-SET_CALLBACK(new_app);
-
-// -------------------
-// new_elem
-
-AST_CALLBACK(new_elem);
-SET_CALLBACK(new_elem);
-
-// -------------------
-// init_search
-
-#define TH_CALLBACK(_cb_name) \
-static void _cb_name##_callback_static(Z3_theory th) \
-{ \
- CAMLparam0(); \
- CAMLlocal2(cb, user_data); \
- user_data = (value) Z3_theory_get_ext_data(th); \
- cb = *(caml_named_value("apply_" #_cb_name)); \
- callback(cb, user_data); \
- CAMLreturn0; \
-} \
-
-TH_CALLBACK(init_search);
-SET_CALLBACK(init_search);
-
-// -------------------
-// push
-
-TH_CALLBACK(push);
-SET_CALLBACK(push);
-
-TH_CALLBACK(pop);
-SET_CALLBACK(pop);
-
-TH_CALLBACK(restart);
-SET_CALLBACK(restart);
-
-TH_CALLBACK(reset);
-SET_CALLBACK(reset);
-
-
-#define FC_CALLBACK(_cb_name) \
- static Z3_bool _cb_name##_callback_static(Z3_theory th) \
- { \
- CAMLparam0(); \
- CAMLlocal3(cb, r, user_data); \
- user_data = (value) Z3_theory_get_ext_data(th); \
- cb = *(caml_named_value("apply_" #_cb_name)); \
- r = callback(cb, user_data); \
- CAMLreturn (Bool_val(r) != 0); \
- } \
-
-FC_CALLBACK(final_check);
-SET_CALLBACK(final_check);
-
-#define AST_AST_CALLBACK(_cb_name) \
- static void _cb_name##_callback_static(Z3_theory th, Z3_ast a, Z3_ast b) \
- { \
- CAMLparam0(); \
- CAMLlocal4(cb, _a, _b, user_data); \
- _a = Val_ast(a); \
- _b = Val_ast(b); \
- user_data = (value) Z3_theory_get_ext_data(th); \
- cb = *(caml_named_value("apply_" #_cb_name)); \
- callback3(cb, user_data, _a, _b); \
- CAMLreturn0; \
- } \
-
-AST_AST_CALLBACK(new_eq);
-SET_CALLBACK(new_eq);
-
-AST_AST_CALLBACK(new_diseq);
-SET_CALLBACK(new_diseq);
-
-#define AST_BOOL_CALLBACK(_cb_name) \
- static void _cb_name##_callback_static(Z3_theory th, Z3_ast a, Z3_bool b) \
- { \
- CAMLparam0(); \
- CAMLlocal4(cb, _a, _b, user_data); \
- _a = Val_ast(a); \
- _b = Val_bool(b); \
- user_data = (value) Z3_theory_get_ext_data(th); \
- cb = *(caml_named_value("apply_" #_cb_name)); \
- callback3(cb, user_data, _a, _b); \
- CAMLreturn0; \
- } \
-
-
-AST_BOOL_CALLBACK(new_assignment);
-SET_CALLBACK(new_assignment);
-
-AST_CALLBACK(new_relevant);
-SET_CALLBACK(new_relevant);
-
diff --git a/src/api/python/z3.py b/src/api/python/z3.py
index bb0212820..414aeb2af 100644
--- a/src/api/python/z3.py
+++ b/src/api/python/z3.py
@@ -555,6 +555,10 @@ def _to_sort_ref(s, ctx):
return ArraySortRef(s, ctx)
elif k == Z3_DATATYPE_SORT:
return DatatypeSortRef(s, ctx)
+ elif k == Z3_FLOATING_POINT_SORT:
+ return FPSortRef(s, ctx)
+ elif k == Z3_ROUNDING_MODE_SORT:
+ return FPRMSortRef(s, ctx)
return SortRef(s, ctx)
def _sort(ctx, a):
@@ -899,6 +903,13 @@ def _to_expr_ref(a, ctx):
return ArrayRef(a, ctx)
if sk == Z3_DATATYPE_SORT:
return DatatypeRef(a, ctx)
+ if sk == Z3_FLOATING_POINT_SORT:
+ if k == Z3_APP_AST and _is_numeral(ctx, a):
+ return FPNumRef(a, ctx)
+ else:
+ return FPRef(a, ctx)
+ if sk == Z3_ROUNDING_MODE_SORT:
+ return FPRMRef(a, ctx)
return ExprRef(a, ctx)
def _coerce_expr_merge(s, a):
@@ -6195,7 +6206,7 @@ class Fixedpoint(Z3PPObject):
"""
query = _get_args(query)
sz = len(query)
- if sz >= 1 and isinstance(query[0], FuncDecl):
+ if sz >= 1 and isinstance(query[0], FuncDeclRef):
_decls = (FuncDecl * sz)()
i = 0
for q in query:
@@ -7429,3 +7440,1011 @@ def sequence_interpolant(v,p=None,ctx=None):
f = And(Interpolant(f),v[i])
return tree_interpolant(f,p,ctx)
+#########################################
+#
+# Floating-Point Arithmetic
+#
+#########################################
+
+
+# Global default rounding mode
+_dflt_rounding_mode = Z3_OP_FPA_RM_TOWARD_ZERO
+_dflt_fpsort_ebits = 11
+_dflt_fpsort_sbits = 53
+
+def get_default_rounding_mode(ctx=None):
+ """Retrieves the global default rounding mode."""
+ global _dflt_rounding_mode
+ if _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_ZERO:
+ return RTZ(ctx)
+ elif _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_NEGATIVE:
+ return RTN(ctx)
+ elif _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_POSITIVE:
+ return RTP(ctx)
+ elif _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ return RNE(ctx)
+ elif _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ return RNA(ctx)
+
+def set_default_rounding_mode(rm, ctx=None):
+ global _dflt_rounding_mode
+ if is_fprm_value(rm):
+ _dflt_rounding_mode = rm.decl().kind()
+ else:
+ _z3_assert(_dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_ZERO or
+ _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_NEGATIVE or
+ _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_POSITIVE or
+ _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN or
+ _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY,
+ "illegal rounding mode")
+ _dflt_rounding_mode = rm
+
+def get_default_fp_sort(ctx=None):
+ return FPSort(_dflt_fpsort_ebits, _dflt_fpsort_sbits, ctx)
+
+def set_default_fp_sort(ebits, sbits, ctx=None):
+ global _dflt_fpsort_ebits
+ global _dflt_fpsort_sbits
+ _dflt_fpsort_ebits = ebits
+ _dflt_fpsort_sbits = sbits
+
+def _dflt_rm(ctx=None):
+ return get_default_rounding_mode(ctx)
+
+def _dflt_fps(ctx=None):
+ return get_default_fp_sort(ctx)
+
+### FP Sorts
+
+class FPSortRef(SortRef):
+ """Floating-point sort."""
+
+ def ebits(self):
+ """Retrieves the number of bits reserved for the exponent in the FloatingPoint sort `self`.
+ >>> b = FPSort(8, 24)
+ >>> b.ebits()
+ 8
+ """
+ return int(Z3_fpa_get_ebits(self.ctx_ref(), self.ast))
+
+ def sbits(self):
+ """Retrieves the number of bits reserved for the exponent in the FloatingPoint sort `self`.
+ >>> b = FPSort(8, 24)
+ >>> b.sbits()
+ 24
+ """
+ return int(Z3_fpa_get_sbits(self.ctx_ref(), self.ast))
+
+ def cast(self, val):
+ """Try to cast `val` as a Floating-point expression
+
+ >>> b = FPSort(8, 24)
+ >>> b.cast(1.0)
+ 1
+ >>> b.cast(1.0).sexpr()
+ '(fp #b0 #x7f #b00000000000000000000000)'
+ """
+ if is_expr(val):
+ if __debug__:
+ _z3_assert(self.ctx == val.ctx, "Context mismatch")
+ return val
+ else:
+ return FPVal(val, None, self, self.ctx)
+
+
+def Float16(ctx=None):
+ """Floating-point 16-bit (half) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_16(ctx.ref()), ctx)
+
+def FloatHalf(ctx=None):
+ """Floating-point 16-bit (half) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_half(ctx.ref()), ctx)
+
+def Float32(ctx=None):
+ """Floating-point 32-bit (single) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_32(ctx.ref()), ctx)
+
+def FloatSingle(ctx=None):
+ """Floating-point 32-bit (single) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_single(ctx.ref()), ctx)
+
+def Float64(ctx=None):
+ """Floating-point 64-bit (double) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_64(ctx.ref()), ctx)
+
+def FloatSingle(ctx=None):
+ """Floating-point 64-bit (double) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_double(ctx.ref()), ctx)
+
+def Float128(ctx=None):
+ """Floating-point 128-bit (quadruple) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_128(ctx.ref()), ctx)
+
+def FloatSingle(ctx=None):
+ """Floating-point 128-bit (quadruple) sort."""
+ ctx = _get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort_quadruple(ctx.ref()), ctx)
+
+class FPRMSortRef(SortRef):
+ """"Floating-point rounding mode sort."""
+
+
+def is_fp_sort(s):
+ """Return True if `s` is a Z3 floating-point sort.
+
+ >>> is_fp_sort(FPSort(8, 24))
+ True
+ >>> is_fp_sort(IntSort())
+ False
+ """
+ return isinstance(s, FPSortRef)
+
+def is_fprm_sort(s):
+ """Return True if `s` is a Z3 floating-point rounding mode sort.
+
+ >>> is_fprm_sort(FPSort(8, 24))
+ False
+ >>> is_fprm_sort(RNE().sort())
+ True
+ """
+ return isinstance(s, FPRMSortRef)
+
+### FP Expressions
+
+class FPRef(ExprRef):
+ """Floating-point expressions."""
+
+ def sort(self):
+ """Return the sort of the floating-point expression `self`.
+
+ >>> x = FP('1.0', FPSort(8, 24))
+ >>> x.sort()
+ FPSort(8, 24)
+ >>> x.sort() == FPSort(8, 24)
+ True
+ """
+ return FPSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx)
+
+ def ebits(self):
+ """Retrieves the number of bits reserved for the exponent in the FloatingPoint expression `self`.
+ >>> b = FPSort(8, 24)
+ >>> b.ebits()
+ 8
+ """
+ return self.sort().ebits();
+
+ def sbits(self):
+ """Retrieves the number of bits reserved for the exponent in the FloatingPoint expression `self`.
+ >>> b = FPSort(8, 24)
+ >>> b.sbits()
+ 24
+ """
+ return self.sort().sbits();
+
+ def as_string(self):
+ """Return a Z3 floating point expression as a Python string."""
+ return Z3_ast_to_string(self.ctx_ref(), self.as_ast())
+
+ def __le__(self, other):
+ return fpLEQ(self, other)
+
+ def __lt__(self, other):
+ return fpLEQ(self, other)
+
+ def __ge__(self, other):
+ return fpGEQ(self, other)
+
+ def __gt__(self, other):
+ return fpGT(self, other)
+
+ def __ne__(self, other):
+ return fpNEQ(self, other)
+
+
+ def __add__(self, other):
+ """Create the Z3 expression `self + other`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> y = FP('y', FPSort(8, 24))
+ >>> x + y
+ x + y
+ >>> (x + y).sort()
+ FPSort(8, 24)
+ """
+ a, b = z3._coerce_exprs(self, other)
+ return fpAdd(_dflt_rm(), self, other)
+
+ def __radd__(self, other):
+ """Create the Z3 expression `other + self`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> 10 + x
+ 1.25*(2**3) + x
+ """
+ a, b = _coerce_exprs(self, other)
+ return fpAdd(_dflt_rm(), other, self)
+
+ def __sub__(self, other):
+ """Create the Z3 expression `self - other`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> y = FP('y', FPSort(8, 24))
+ >>> x - y
+ x - y
+ >>> (x - y).sort()
+ FPSort(8, 24)
+ """
+ a, b = z3._coerce_exprs(self, other)
+ return fpSub(_dflt_rm(), self, other)
+
+ def __rsub__(self, other):
+ """Create the Z3 expression `other - self`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> 10 - x
+ 1.25*(2**3) - x
+ """
+ a, b = _coerce_exprs(self, other)
+ return fpSub(_dflt_rm(), other, self)
+
+ def __mul__(self, other):
+ """Create the Z3 expression `self * other`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> y = FP('y', FPSort(8, 24))
+ >>> x * y
+ x * y
+ >>> (x * y).sort()
+ FPSort(8, 24)
+ >>> 10 * y
+ 1.25*(2**3) * y
+ """
+ a, b = z3._coerce_exprs(self, other)
+ return fpMul(_dflt_rm(), self, other)
+
+ def __rmul__(self, other):
+ """Create the Z3 expression `other * self`.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> y = FP('y', FPSort(8, 24))
+ >>> x * y
+ x * y
+ >>> x * 10
+ x * 1.25*(2**3)
+ """
+ a, b = _coerce_exprs(self, other)
+ return fpMul(_dflt_rm(), other, self)
+
+ def __pos__(self):
+ """Create the Z3 expression `+self`."""
+ return self
+
+ def __neg__(self):
+ """Create the Z3 expression `-self`."""
+ return FPRef(fpNeg(self))
+
+ def __truediv__(self, other):
+ """Create the Z3 expression division `self / other`."""
+ return self.__div__(other)
+
+ def __rtruediv__(self, other):
+ """Create the Z3 expression division `other / self`."""
+ return self.__rdiv__(other)
+
+ def __mod__(self, other):
+ """Create the Z3 expression mod `self % other`."""
+ return fpRem(self, other)
+
+ def __rmod__(self, other):
+ """Create the Z3 expression mod `other % self`."""
+ return fpRem(other, self)
+
+class FPRMRef(ExprRef):
+ """Floating-point rounding mode expressions"""
+
+ def as_string(self):
+ """Return a Z3 floating point expression as a Python string."""
+ return Z3_ast_to_string(self.ctx_ref(), self.as_ast())
+
+
+def RoundNearestTiesToEven(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_even(ctx.ref()), ctx)
+
+def RNE (ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_even(ctx.ref()), ctx)
+
+def RoundNearestTiesToAway(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_away(ctx.ref()), ctx)
+
+def RNA (ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_away(ctx.ref()), ctx)
+
+def RoundTowardPositive(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_positive(ctx.ref()), ctx)
+
+def RTP(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_positive(ctx.ref()), ctx)
+
+def RoundTowardNegative(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_negative(ctx.ref()), ctx)
+
+def RTN(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_negative(ctx.ref()), ctx)
+
+def RoundTowardZero(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_zero(ctx.ref()), ctx)
+
+def RTZ(ctx=None):
+ ctx = _get_ctx(ctx)
+ return FPRMRef(Z3_mk_fpa_round_toward_zero(ctx.ref()), ctx)
+
+def is_fprm(a):
+ """Return `True` if `a` is a Z3 floating-point rounding mode expression.
+
+ >>> rm = RNE()
+ >>> is_fprm(rm)
+ True
+ >>> rm = 1.0
+ >>> is_fprm(rm)
+ False
+ """
+ return isinstance(a, FPRMRef)
+
+def is_fprm_value(a):
+ """Return `True` if `a` is a Z3 floating-point rounding mode numeral value."""
+ return is_fprm(a) and _is_numeral(a.ctx, a.ast)
+
+### FP Numerals
+
+class FPNumRef(FPRef):
+ def isNaN(self):
+ return self.decl().kind() == Z3_OP_FPA_NAN
+
+ def isInf(self):
+ return self.decl().kind() == Z3_OP_FPA_PLUS_INF or self.decl().kind() == Z3_OP_FPA_MINUS_INF
+
+ def isZero(self):
+ return self.decl().kind() == Z3_OP_FPA_PLUS_ZERO or self.decl().kind() == Z3_OP_FPA_MINUS_ZERO
+
+ def isNegative(self):
+ k = self.decl().kind()
+ return (self.num_args() == 0 and (k == Z3_OP_FPA_MINUS_INF or k == Z3_OP_FPA_MINUS_ZERO)) or (self.sign() == True)
+
+ """
+ The sign of the numeral
+
+ >>> x = FPNumRef(+1.0, FPSort(8, 24))
+ >>> x.sign()
+ False
+ >>> x = FPNumRef(-1.0, FPSort(8, 24))
+ >>> x.sign()
+ True
+ """
+ def sign(self):
+ l = (ctypes.c_int)()
+ if Z3_fpa_get_numeral_sign(self.ctx.ref(), self.as_ast(), byref(l)) == False:
+ raise Z3Exception("error retrieving the sign of a numeral.")
+ return l.value != 0
+
+ """
+ The significand of the numeral
+
+ >>> x = FPNumRef(2.5, FPSort(8, 24))
+ 1.25
+ """
+ def significand(self):
+ return Z3_fpa_get_numeral_significand_string(self.ctx.ref(), self.as_ast())
+
+ """
+ The exponent of the numeral
+
+ >>> x = FPNumRef(2.5, FPSort(8, 24))
+ >>>
+ 1
+ """
+ def exponent(self):
+ return Z3_fpa_get_numeral_exponent_string(self.ctx.ref(), self.as_ast())
+
+ """
+ The exponent of the numeral as a long
+
+ >>> x = FPNumRef(2.5, FPSort(8, 24))
+ 1
+ """
+ def exponent_as_long(self):
+ ptr = (ctypes.c_longlong * 1)()
+ if not Z3_fpa_get_numeral_exponent_int64(self.ctx.ref(), self.as_ast(), ptr):
+ raise Z3Exception("error retrieving the exponent of a numeral.")
+ return ptr[0]
+
+ """
+ The string representation of the numeral
+
+ >>> x = FPNumRef(20, FPSort(8, 24))
+ 1.25*(2**4)
+ """
+ def as_string(self):
+ s = Z3_fpa_get_numeral_string(self.ctx.ref(), self.as_ast())
+ return ("FPVal(%s, %s)" % (s, FPSortRef(self.sort()).as_string()))
+
+
+def _to_fpnum(num, ctx=None):
+ if isinstance(num, FPNum):
+ return num
+ else:
+ return FPNum(num, ctx)
+
+def is_fp(a):
+ """Return `True` if `a` is a Z3 floating-point expression.
+
+ >>> b = FP('b', FPSort(8, 24))
+ >>> is_fp(b)
+ True
+ >>> is_fp(b + 1.0)
+ True
+ >>> is_fp(Int('x'))
+ False
+ """
+ return isinstance(a, FPRef)
+
+def is_fp_value(a):
+ """Return `True` if `a` is a Z3 floating-point numeral value.
+
+ >>> b = FP('b', FPSort(8, 24))
+ >>> is_fp_value(b)
+ False
+ >>> b = FPVal(1.0, FPSort(8, 24))
+ >>> b
+ 1
+ >>> is_fp_value(b)
+ True
+ """
+ return is_fp(a) and _is_numeral(a.ctx, a.ast)
+
+def FPSort(ebits, sbits, ctx=None):
+ """Return a Z3 floating-point sort of the given sizes. If `ctx=None`, then the global context is used.
+
+ >>> Single = FPSort(8, 24)
+ >>> Double = FPSort(11, 53)
+ >>> Single
+ FPSort(8, 24)
+ >>> x = Const('x', Single)
+ >>> eq(x, FP('x', FPSort(8, 24)))
+ True
+ """
+ ctx = z3._get_ctx(ctx)
+ return FPSortRef(Z3_mk_fpa_sort(ctx.ref(), ebits, sbits), ctx)
+
+def _to_float_str(val):
+ if isinstance(val, float):
+ return str(val)
+ elif isinstance(val, bool):
+ if val:
+ return "1.0"
+ else:
+ return "0.0"
+ elif _is_int(val):
+ return str(val)
+ elif isinstance(val, str):
+ return val
+ if __debug__:
+ _z3_assert(False, "Python value cannot be used as a double")
+
+def fpNaN(s):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ return FPNumRef(Z3_mk_fpa_nan(s.ctx_ref(), s.ast), s.ctx)
+
+def fpPlusInfinity(s):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, False), s.ctx)
+
+def fpMinusInfinity(s):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, True), s.ctx)
+
+def fpInfinity(s, negative):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ _z3_assert(isinstance(negative, bool), "expected Boolean flag")
+ return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, negative), s.ctx)
+
+def fpPlusZero(s):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, False), s.ctx)
+
+def fpMinusZero(s):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, True), s.ctx)
+
+def fpZero(s, negative):
+ _z3_assert(isinstance(s, FPSortRef), "sort mismatch")
+ _z3_assert(isinstance(negative, bool), "expected Boolean flag")
+ return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, negative), s.ctx)
+
+def FPVal(sig, exp=None, fps=None, ctx=None):
+ """Return a floating-point value of value `val` and sort `fps`. If `ctx=None`, then the global context is used.
+
+ >>> v = FPVal(20.0, FPSort(8, 24))
+ >>> v
+ 1.25*(2**4)
+ >>> print("0x%.8x" % v.exponent_as_long())
+ 0x00000004
+ >>> v = FPVal(2.25, FPSort(8, 24))
+ >>> v
+ 1.125*(2**1)
+ >>> v = FPVal(-2.25, FPSort(8, 24))
+ >>> v
+ -1.125*(2**1)
+ """
+ ctx = _get_ctx(ctx)
+ if is_fp_sort(exp):
+ fps = exp
+ exp = None
+ elif fps == None:
+ fps = _dflt_fps(ctx)
+ _z3_assert(is_fp_sort(fps), "sort mismatch")
+ if exp == None:
+ exp = 0
+ val = _to_float_str(sig)
+ val = val + 'p'
+ val = val + _to_int_str(exp)
+ return FPNumRef(Z3_mk_numeral(ctx.ref(), val, fps.ast), ctx)
+
+def FP(name, fpsort, ctx=None):
+ """Return a floating-point constant named `name`.
+ `fpsort` is the floating-point sort.
+ If `ctx=None`, then the global context is used.
+
+ >>> x = FP('x', FPSort(8, 24))
+ >>> is_fp(x)
+ True
+ >>> x.ebits()
+ 8
+ >>> x.sort()
+ FPSort(8, 24)
+ >>> word = FPSort(8, 24)
+ >>> x2 = FP('x', word)
+ >>> eq(x, x2)
+ True
+ """
+ ctx = fpsort.ctx
+ return FPRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), fpsort.ast), ctx)
+
+def FPs(names, fpsort, ctx=None):
+ """Return an array of floating-point constants.
+
+ >>> x, y, z = BitVecs('x y z', 16)
+ >>> x.size()
+ 16
+ >>> x.sort()
+ BitVec(16)
+ >>> Sum(x, y, z)
+ 0 + x + y + z
+ >>> Product(x, y, z)
+ 1*x*y*z
+ >>> simplify(Product(x, y, z))
+ x*y*z
+ """
+ ctx = z3._get_ctx(ctx)
+ if isinstance(names, str):
+ names = names.split(" ")
+ return [FP(name, fpsort, ctx) for name in names]
+
+def fpAbs(a):
+ """Create a Z3 floating-point absolute value expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FPVal(1.0, s)
+ >>> fpAbs(x)
+ fpAbs(1)
+ >>> y = FPVal(-20.0, s)
+ >>> y
+ -1.25*(2**4)
+ >>> fpAbs(y)
+ fpAbs(-1.25*(2**4))
+ >>> fpAbs(-1.25*(2**4))
+ fpAbs(-1.25*(2**4))
+ >>> fpAbs(x).sort()
+ FPSort(8, 24)
+ """
+ ctx = None
+ if not is_expr(a):
+ ctx =_get_ctx(ctx)
+ s = get_default_fp_sort(ctx)
+ a = FPVal(a, s)
+ else:
+ ctx = a.ctx
+ if __debug__:
+ _z3_assert(is_fp(a), "First argument must be Z3 floating-point expression")
+ return FPRef(Z3_mk_fpa_abs(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpNeg(a):
+ """Create a Z3 floating-point addition expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> fpNeg(x)
+ -x
+ >>> fpNeg(x).sort()
+ FPSort(8, 24)
+ """
+ ctx = None
+ if not is_expr(a):
+ ctx =_get_ctx(ctx)
+ s = get_default_fp_sort(ctx)
+ a = FPVal(a, s)
+ else:
+ ctx = a.ctx
+ if __debug__:
+ _z3_assert(is_fp(a), "First argument must be Z3 floating-point expression")
+ return FPRef(Z3_mk_fpa_neg(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpAdd(rm, a, b):
+ """Create a Z3 floating-point addition expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpAdd(rm, x, y)
+ fpAdd(RNE(), x, y)
+ >>> fpAdd(rm, x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_add(rm.ctx_ref(), rm.as_ast(), a.as_ast(), b.as_ast()), rm.ctx)
+
+def fpSub(rm, a, b):
+ """Create a Z3 floating-point subtraction expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpSub(rm, x, y)
+ fpSub(RNE(), x, y)
+ >>> fpSub(rm, x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_sub(rm.ctx_ref(), rm.as_ast(), a.as_ast(), b.as_ast()), rm.ctx)
+
+def fpMul(rm, a, b):
+ """Create a Z3 floating-point multiplication expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpMul(rm, x, y)
+ fpMul(RNE(), x, y)
+ >>> fpMul(rm, x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_mul(rm.ctx_ref(), rm.as_ast(), a.as_ast(), b.as_ast()), rm.ctx)
+
+def fpDiv(rm, a, b):
+ """Create a Z3 floating-point divison expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpDiv(rm, x, y)
+ fpDiv(RNE(), x, y)
+ >>> fpDiv(rm, x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_div(rm.ctx_ref(), rm.as_ast(), a.as_ast(), b.as_ast()), rm.ctx)
+
+def fpRem(a, b):
+ """Create a Z3 floating-point remainder expression.
+
+ >>> s = FPSort(8, 24)
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpRem(x, y)
+ fpRem(x, y)
+ >>> fpRem(x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_rem(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpMin(a, b):
+ """Create a Z3 floating-point minimium expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpMin(x, y)
+ fpMin(x, y)
+ >>> fpMin(x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_min(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpMax(a, b):
+ """Create a Z3 floating-point maximum expression.
+
+ >>> s = FPSort(8, 24)
+ >>> rm = RNE()
+ >>> x = FP('x', s)
+ >>> y = FP('y', s)
+ >>> fpMax(x, y)
+ fpMax(x, y)
+ >>> fpMax(x, y).sort()
+ FPSort(8, 24)
+ """
+ if __debug__:
+ _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression")
+ a, b = _coerce_exprs(a, b)
+ return FPRef(Z3_mk_fpa_max(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpFMA(rm, a, b, c):
+ """Create a Z3 floating-point fused multiply-add expression.
+ """
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a) or is_fp(b) or is_fp(c), "Second, third, or fourth argument must be a Z3 floating-point expression")
+ a, b, c = _coerce_expr_list([a, b, c])
+ return FPRef(Z3_mk_fpa_fma(rm.ctx_ref(), rm.as_ast(), a.as_ast(), b.as_ast(), c.as_ast()), rm.ctx)
+
+def fpSqrt(rm, a):
+ """Create a Z3 floating-point square root expression.
+ """
+ ctx = None
+ if not is_expr(a):
+ ctx =_get_ctx(ctx)
+ s = get_default_fp_sort(ctx)
+ a = FPVal(a, s)
+ else:
+ ctx = a.ctx
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a), "Second argument must be a Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_sqrt(rm.ctx_ref(), rm.as_ast(), a.as_ast()), rm.ctx)
+
+def fpRoundToIntegral(rm, a):
+ """Create a Z3 floating-point roundToIntegral expression.
+ """
+ ctx = None
+ if not is_expr(a):
+ ctx =_get_ctx(ctx)
+ s = get_default_fp_sort(ctx)
+ a = FPVal(a, s)
+ else:
+ ctx = a.ctx
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(a), "Second argument must be a Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_round_to_integral(rm.ctx_ref(), rm.as_ast(), a.as_ast()), rm.ctx)
+
+def fpIsNaN(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_nan(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsInfinite(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_infinite(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsZero(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_zero(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsNormal(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_normal(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsSubnormal(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_subnormal(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsNegative(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_negative(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def fpIsPositive(a):
+ """Create a Z3 floating-point isNaN expression.
+ """
+ if __debug__:
+ _z3_assert(is_fp(a), "Argument must be Z3 floating-point expressions")
+ return FPRef(Z3_mk_fpa_is_positive(a.ctx_ref(), a.as_ast()), a.ctx)
+
+def _check_fp_args(a, b):
+ if __debug__:
+ _z3_assert(is_fp(a) or is_fp(b), "At least one of the arguments must be a Z3 floating-point expression")
+
+def fpLT(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> fpLT(x, y)
+ x < y
+ >>> (x <= y).sexpr()
+ '(fp.leq x y)'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return BoolRef(Z3_mk_fpa_lt(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpLEQ(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> fpLEQ(x, y)
+ x <= y
+ >>> (x <= y).sexpr()
+ '(fp.leq x y)'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return BoolRef(Z3_mk_fpa_leq(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpGT(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> fpGT(x, y)
+ x > y
+ >>> (x > y).sexpr()
+ '(fp.gt x y)'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return BoolRef(Z3_mk_fpa_gt(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+
+def fpGEQ(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> x + y
+ x + y
+ >>> fpGEQ(x, y)
+ x >= y
+ >>> (x >= y).sexpr()
+ '(fp.geq x y)'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return BoolRef(Z3_mk_fpa_geq(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpEQ(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> fpEQ(x, y)
+ fpEQ(x, y)
+ >>> fpEQ(x, y).sexpr()
+ '(fp.eq x y)'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return BoolRef(Z3_mk_fpa_eq(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx)
+
+def fpNEQ(a, b):
+ """Create the Z3 floating-point expression `other <= self`.
+
+ >>> x, y = FPs('x y', FPSort(8, 24))
+ >>> fpNEQ(x, y)
+ Not(fpEQ(x, y))
+ >>> (x != y).sexpr()
+ '(not (fp.eq x y))'
+ """
+ _check_fp_args(a, b)
+ a, b = _coerce_exprs(a, b)
+ return Not(BoolRef(Z3_mk_fpa_eq(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx), a.ctx)
+
+
+
+def fpFP(sgn, exp, sig):
+ """Create the Z3 floating-point value `fpFP(sgn, sig, exp)` from the three bit-vectorssgn, sig, and exp."""
+ _z3_assert(is_bv(sgn) and is_bv(exp) and is_bv(sig), "sort mismatch")
+ _z3_assert(sgn.sort().size() == 1, "sort mismatch")
+ return FPRef(Z3_mk_fpa_fp(sgn.ctx_ref(), sgn.ast, exp.ast, sig.ast), sgn.ctx)
+
+
+def fpToFP(a1, a2=None, a3=None):
+ """Create a Z3 floating-point conversion expression from other terms."""
+ if is_bv(a1) and is_fp_sort(a2):
+ return FPRef(Z3_mk_fpa_to_fp_bv(a1.ctx_ref(), a1.ast, a2.ast), a1.ctx)
+ elif is_fprm(a1) and is_fp(a2) and is_fp_sort(a3):
+ return FPRef(Z3_mk_fpa_to_fp_float(a1.ctx_ref(), a1.ast, a2.ast, a3.ast), a1.ctx)
+ elif is_fprm(a1) and is_real(a2) and is_fp_sort(a3):
+ return FPRef(Z3_mk_fpa_to_fp_real(a1.ctx_ref(), a1.ast, a2.ast, a3.ast), a1.ctx)
+ elif is_fprm(a1) and is_bv(a2) and is_fp_sort(a3):
+ return FPRef(Z3_mk_fpa_to_fp_signed(a1.ctx_ref(), a1.ast, a2.ast, a3.ast), a1.ctx)
+ else:
+ raise Z3Exception("Unsupported combination of arguments for conversion to floating-point term.")
+
+def fpToFPUnsigned(rm, x, s):
+ """Create a Z3 floating-point conversion expression, from unsigned bit-vector to floating-point expression."""
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_bv(x), "Second argument must be a Z3 bit-vector expression")
+ _z3_assert(is_fp_sort(s), "Third argument must be Z3 floating-point sort")
+ return FPRef(Z3_mk_fpa_to_fp_unsigned(rm.ctx_ref(), rm.ast, x.ast, s.ast), rm.ctx)
+
+def fpToSBV(rm, x, s):
+ """Create a Z3 floating-point conversion expression, from floating-point expression to signed bit-vector."""
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(x), "Second argument must be a Z3 floating-point expression")
+ _z3_assert(is_bv_sort(s), "Third argument must be Z3 bit-vector sort")
+ return FPRef(Z3_mk_fpa_to_sbv(rm.ctx_ref(), rm.ast, x.ast, s.size()), rm.ctx)
+
+def fpToUBV(rm, x, s):
+ """Create a Z3 floating-point conversion expression, from floating-point expression to unsigned bit-vector."""
+ if __debug__:
+ _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression")
+ _z3_assert(is_fp(x), "Second argument must be a Z3 floating-point expression")
+ _z3_assert(is_bv_sort(s), "Third argument must be Z3 bit-vector sort")
+ return FPRef(Z3_mk_fpa_to_ubv(rm.ctx_ref(), rm.ast, x.ast, s.size()), rm.ctx)
+
+def fpToReal(x):
+ """Create a Z3 floating-point conversion expression, from floating-point expression to real."""
+ if __debug__:
+ _z3_assert(is_fp(x), "First argument must be a Z3 floating-point expression")
+ return FPRef(Z3_mk_fpa_to_real(x.ctx_ref(), x.ast), x.ctx)
+
+def fpToIEEEBV(x):
+ """Create a Z3 floating-point conversion expression, from floating-point expression to IEEE bit-vector."""
+ if __debug__:
+ _z3_assert(is_fp(x), "First argument must be a Z3 floating-point expression")
+ return FPRef(Z3_mk_fpa_to_ieee_bv(x.ctx_ref(), x.ast), x.ctx)
diff --git a/src/api/python/z3printer.py b/src/api/python/z3printer.py
index d1d85d30e..2cc29bd5d 100644
--- a/src/api/python/z3printer.py
+++ b/src/api/python/z3printer.py
@@ -8,6 +8,7 @@
import sys, io, z3
from z3consts import *
from z3core import *
+from ctypes import *
##############################
#
@@ -30,7 +31,7 @@ _z3_op_to_str = {
Z3_OP_BASHR : '>>', Z3_OP_BSHL : '<<', Z3_OP_BLSHR : 'LShR',
Z3_OP_CONCAT : 'Concat', Z3_OP_EXTRACT : 'Extract', Z3_OP_BV2INT : 'BV2Int',
Z3_OP_ARRAY_MAP : 'Map', Z3_OP_SELECT : 'Select', Z3_OP_STORE : 'Store',
- Z3_OP_CONST_ARRAY : 'K'
+ Z3_OP_CONST_ARRAY : 'K'
}
# List of infix operators
@@ -45,17 +46,64 @@ _z3_unary = [ Z3_OP_UMINUS, Z3_OP_BNOT, Z3_OP_BNEG ]
# Precedence
_z3_precedence = {
Z3_OP_POWER : 0,
- Z3_OP_UMINUS : 1, Z3_OP_BNEG : 1, Z3_OP_BNOT : 1,
+ Z3_OP_UMINUS : 1, Z3_OP_BNEG : 1, Z3_OP_BNOT : 1,
Z3_OP_MUL : 2, Z3_OP_DIV : 2, Z3_OP_IDIV : 2, Z3_OP_MOD : 2, Z3_OP_BMUL : 2, Z3_OP_BSDIV : 2, Z3_OP_BSMOD : 2,
- Z3_OP_ADD : 3, Z3_OP_SUB : 3, Z3_OP_BADD : 3, Z3_OP_BSUB : 3,
+ Z3_OP_ADD : 3, Z3_OP_SUB : 3, Z3_OP_BADD : 3, Z3_OP_BSUB : 3,
Z3_OP_BASHR : 4, Z3_OP_BSHL : 4,
Z3_OP_BAND : 5,
Z3_OP_BXOR : 6,
Z3_OP_BOR : 7,
Z3_OP_LE : 8, Z3_OP_LT : 8, Z3_OP_GE : 8, Z3_OP_GT : 8, Z3_OP_EQ : 8, Z3_OP_SLEQ : 8, Z3_OP_SLT : 8, Z3_OP_SGEQ : 8, Z3_OP_SGT : 8,
- Z3_OP_IFF : 8
+ Z3_OP_IFF : 8,
+
+ Z3_OP_FPA_NEG : 1,
+ Z3_OP_FPA_MUL : 2, Z3_OP_FPA_DIV : 2, Z3_OP_FPA_REM : 2, Z3_OP_FPA_FMA : 2,
+ Z3_OP_FPA_ADD: 3, Z3_OP_FPA_SUB : 3,
+ Z3_OP_FPA_LE : 8, Z3_OP_FPA_LT : 8, Z3_OP_FPA_GE : 8, Z3_OP_FPA_GT : 8, Z3_OP_FPA_EQ : 8
}
+# FPA operators
+_z3_op_to_fpa_normal_str = {
+ Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN : 'RoundNearestTiesToEven()', Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY : 'RoundNearestTiesToAway()',
+ Z3_OP_FPA_RM_TOWARD_POSITIVE : 'RoundTowardPositive()', Z3_OP_FPA_RM_TOWARD_NEGATIVE : 'RoundTowardNegative()',
+ Z3_OP_FPA_RM_TOWARD_ZERO : 'RoundTowardZero()',
+ Z3_OP_FPA_PLUS_INF : '+oo', Z3_OP_FPA_MINUS_INF : '-oo',
+ Z3_OP_FPA_NAN : 'NaN', Z3_OP_FPA_PLUS_ZERO : 'PZero', Z3_OP_FPA_MINUS_ZERO : 'NZero',
+ Z3_OP_FPA_ADD : 'fpAdd', Z3_OP_FPA_SUB : 'fpSub', Z3_OP_FPA_NEG : 'fpNeg', Z3_OP_FPA_MUL : 'fpMul',
+ Z3_OP_FPA_DIV : 'fpDiv', Z3_OP_FPA_REM : 'fpRem', Z3_OP_FPA_ABS : 'fpAbs',
+ Z3_OP_FPA_MIN : 'fpMin', Z3_OP_FPA_MAX : 'fpMax',
+ Z3_OP_FPA_FMA : 'fpFMA', Z3_OP_FPA_SQRT : 'fpSqrt', Z3_OP_FPA_ROUND_TO_INTEGRAL : 'fpRoundToIntegral',
+
+ Z3_OP_FPA_EQ : 'fpEQ', Z3_OP_FPA_LT : 'fpLT', Z3_OP_FPA_GT : 'fpGT', Z3_OP_FPA_LE : 'fpLEQ',
+ Z3_OP_FPA_GE : 'fpGEQ',
+
+ Z3_OP_FPA_IS_NAN : 'fpIsNaN', Z3_OP_FPA_IS_INF : 'fpIsInf', Z3_OP_FPA_IS_ZERO : 'fpIsZero',
+ Z3_OP_FPA_IS_NORMAL : 'fpIsNormal', Z3_OP_FPA_IS_SUBNORMAL : 'fpIsSubnormal',
+ Z3_OP_FPA_IS_NEGATIVE : 'fpIsNegative', Z3_OP_FPA_IS_POSITIVE : 'fpIsPositive',
+
+ Z3_OP_FPA_FP : 'fpFP', Z3_OP_FPA_TO_FP : 'fpToFP', Z3_OP_FPA_TO_FP_UNSIGNED: 'fpToFPUnsigned',
+ Z3_OP_FPA_TO_UBV : 'fpToUBV', Z3_OP_FPA_TO_SBV : 'fpToSBV', Z3_OP_FPA_TO_REAL: 'fpToReal',
+ Z3_OP_FPA_TO_IEEE_BV : 'fpToIEEEBV'
+ }
+
+_z3_op_to_fpa_pretty_str = {
+ Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN : 'RNE()', Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY : 'RNA()',
+ Z3_OP_FPA_RM_TOWARD_POSITIVE : 'RTP()', Z3_OP_FPA_RM_TOWARD_NEGATIVE : 'RTN()',
+ Z3_OP_FPA_RM_TOWARD_ZERO : 'RTZ()',
+ Z3_OP_FPA_PLUS_INF : '+oo', Z3_OP_FPA_MINUS_INF : '-oo',
+ Z3_OP_FPA_NAN : 'NaN', Z3_OP_FPA_PLUS_ZERO : '+0.0', Z3_OP_FPA_MINUS_ZERO : '-0.0',
+
+ Z3_OP_FPA_ADD : '+', Z3_OP_FPA_SUB : '-', Z3_OP_FPA_MUL : '*', Z3_OP_FPA_DIV : '/',
+ Z3_OP_FPA_REM : '%', Z3_OP_FPA_NEG : '-',
+
+ Z3_OP_FPA_EQ : 'fpEQ', Z3_OP_FPA_LT : '<', Z3_OP_FPA_GT : '>', Z3_OP_FPA_LE : '<=', Z3_OP_FPA_GE : '>='
+}
+
+_z3_fpa_infix = [
+ Z3_OP_FPA_ADD, Z3_OP_FPA_SUB, Z3_OP_FPA_MUL, Z3_OP_FPA_DIV, Z3_OP_FPA_REM,
+ Z3_OP_FPA_LT, Z3_OP_FPA_GT, Z3_OP_FPA_LE, Z3_OP_FPA_GE
+]
+
def _is_assoc(k):
return k == Z3_OP_BOR or k == Z3_OP_BXOR or k == Z3_OP_BAND or k == Z3_OP_ADD or k == Z3_OP_BADD or k == Z3_OP_MUL or k == Z3_OP_BMUL
@@ -138,6 +186,7 @@ for _k in _z3_infix:
_infix_map[_k] = True
for _k in _z3_unary:
_unary_map[_k] = True
+
for _k in _z3_infix_compact:
_infix_compact_map[_k] = True
@@ -463,6 +512,7 @@ class Formatter:
self.precision = 10
self.ellipses = to_format(_ellipses)
self.max_visited = 10000
+ self.fpa_pretty = True
def pp_ellipses(self):
return self.ellipses
@@ -499,6 +549,8 @@ class Formatter:
return seq1('Array', (self.pp_sort(s.domain()), self.pp_sort(s.range())))
elif isinstance(s, z3.BitVecSortRef):
return seq1('BitVec', (to_format(s.size()), ))
+ elif isinstance(s, z3.FPSortRef):
+ return seq1('FPSort', (to_format(s.ebits()), to_format(s.sbits())))
else:
return to_format(s.name())
@@ -520,6 +572,123 @@ class Formatter:
def pp_bv(self, a):
return to_format(a.as_string())
+ def pp_fprm_value(self, a):
+ z3._z3_assert(z3.is_fprm_value(a), 'expected FPRMNumRef')
+ if self.fpa_pretty and (a.decl().kind() in _z3_op_to_fpa_pretty_str):
+ return to_format(_z3_op_to_fpa_pretty_str.get(a.decl().kind()))
+ else:
+ return to_format(_z3_op_to_fpa_normal_str.get(a.decl().kind()))
+
+ def pp_fp_value(self, a):
+ z3._z3_assert(isinstance(a, z3.FPNumRef), 'type mismatch')
+ if not self.fpa_pretty:
+ if (a.isNaN()):
+ return to_format('NaN')
+ elif (a.isInf()):
+ if (a.isNegative()):
+ return to_format('-oo')
+ else:
+ return to_format('+oo')
+ elif (a.isZero()):
+ if (a.isNegative()):
+ return to_format('-zero')
+ else:
+ return to_format('+zero')
+ else:
+ z3._z3_assert(z3.is_fp_value(a), 'expecting FP num ast')
+ r = []
+ sgn = c_int(0)
+ sgnb = Z3_fpa_get_numeral_sign(a.ctx_ref(), a.ast, byref(sgn))
+ sig = Z3_fpa_get_numeral_significand_string(a.ctx_ref(), a.ast)
+ exp = Z3_fpa_get_numeral_exponent_string(a.ctx_ref(), a.ast)
+ r.append(to_format('FPVal('))
+ if sgnb and sgn.value != 0:
+ r.append(to_format('-'))
+ r.append(to_format(sig))
+ r.append(to_format('*(2**'))
+ r.append(to_format(exp))
+ r.append(to_format(', '))
+ r.append(to_format(a.sort()))
+ r.append(to_format('))'))
+ return compose(r)
+ else:
+ if (a.isNaN()):
+ return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_NAN])
+ elif (a.isInf()):
+ if (a.isNegative()):
+ return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_MINUS_INF])
+ else:
+ return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_PLUS_INF])
+ elif (a.isZero()):
+ if (a.isNegative()):
+ return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_MINUS_ZERO])
+ else:
+ return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_PLUS_ZERO])
+ else:
+ z3._z3_assert(z3.is_fp_value(a), 'expecting FP num ast')
+ r = []
+ sgn = (ctypes.c_int)(0)
+ sgnb = Z3_fpa_get_numeral_sign(a.ctx_ref(), a.ast, byref(sgn))
+ sig = Z3_fpa_get_numeral_significand_string(a.ctx_ref(), a.ast)
+ exp = Z3_fpa_get_numeral_exponent_string(a.ctx_ref(), a.ast)
+ if sgnb and sgn.value != 0:
+ r.append(to_format('-'))
+ r.append(to_format(sig))
+ if (exp != '0'):
+ r.append(to_format('*(2**'))
+ r.append(to_format(exp))
+ r.append(to_format(')'))
+ return compose(r)
+
+
+ def pp_fp(self, a, d, xs):
+ z3._z3_assert(isinstance(a, z3.FPRef), "type mismatch")
+ k = a.decl().kind()
+ op = '?'
+ if (self.fpa_pretty and k in _z3_op_to_fpa_pretty_str):
+ op = _z3_op_to_fpa_pretty_str[k]
+ elif k in _z3_op_to_fpa_normal_str:
+ op = _z3_op_to_fpa_normal_str[k]
+ elif k in _z3_op_to_str:
+ op = _z3_op_to_str[k]
+
+ n = a.num_args()
+
+ if self.fpa_pretty:
+ if self.is_infix(k) and n >= 3:
+ rm = a.arg(0)
+ if z3.is_fprm_value(rm) and z3._dflt_rm(a.ctx).eq(rm):
+ arg1 = to_format(self.pp_expr(a.arg(1), d+1, xs))
+ arg2 = to_format(self.pp_expr(a.arg(2), d+1, xs))
+ r = []
+ r.append(arg1)
+ r.append(to_format(' '))
+ r.append(to_format(op))
+ r.append(to_format(' '))
+ r.append(arg2)
+ return compose(r)
+ elif k == Z3_OP_FPA_NEG:
+ return compose([to_format('-') , to_format(self.pp_expr(a.arg(0), d+1, xs))])
+
+ if k in _z3_op_to_fpa_normal_str:
+ op = _z3_op_to_fpa_normal_str[k]
+
+ r = []
+ r.append(to_format(op))
+ if not z3.is_const(a):
+ r.append(to_format('('))
+ first = True
+ for c in a.children():
+ if first:
+ first = False
+ else:
+ r.append(to_format(', '))
+ r.append(self.pp_expr(c, d+1, xs))
+ r.append(to_format(')'))
+ return compose(r)
+ else:
+ return to_format(a.as_string())
+
def pp_prefix(self, a, d, xs):
r = []
sz = 0
@@ -678,9 +847,15 @@ class Formatter:
elif z3.is_rational_value(a):
return self.pp_rational(a)
elif z3.is_algebraic_value(a):
- return self.pp_algebraic(a)
+ return self.pp_algebraic(a)
elif z3.is_bv_value(a):
return self.pp_bv(a)
+ elif z3.is_fprm_value(a):
+ return self.pp_fprm_value(a)
+ elif z3.is_fp_value(a):
+ return self.pp_fp_value(a)
+ elif z3.is_fp(a):
+ return self.pp_fp(a, d, xs)
elif z3.is_const(a):
return self.pp_const(a)
else:
@@ -939,6 +1114,12 @@ def set_pp_option(k, v):
else:
set_html_mode(False)
return True
+ if k == 'fpa_pretty':
+ if v:
+ set_fpa_pretty(True)
+ else:
+ set_fpa_pretty(False)
+ return True
val = getattr(_PP, k, None)
if val != None:
z3._z3_assert(type(v) == type(val), "Invalid pretty print option value")
@@ -965,6 +1146,23 @@ def set_html_mode(flag=True):
else:
_Formatter = Formatter()
+def set_fpa_pretty(flag=True):
+ global _Formatter
+ global _z3_op_to_str
+ _Formatter.fpa_pretty = flag
+ if flag:
+ for (_k,_v) in _z3_op_to_fpa_pretty_str.items():
+ _z3_op_to_str[_k] = _v
+ for _k in _z3_fpa_infix:
+ _infix_map[_k] = True
+ else:
+ for (_k,_v) in _z3_op_to_fpa_normal_str.items():
+ _z3_op_to_str[_k] = _v
+ for _k in _z3_fpa_infix:
+ _infix_map[_k] = False
+
+set_fpa_pretty(True)
+
def in_html_mode():
return isinstance(_Formatter, HTMLFormatter)
diff --git a/src/api/z3.h b/src/api/z3.h
index 2ebc20977..bb7611030 100644
--- a/src/api/z3.h
+++ b/src/api/z3.h
@@ -28,6 +28,7 @@ Notes:
#include"z3_polynomial.h"
#include"z3_rcf.h"
#include"z3_interp.h"
+#include"z3_fpa.h"
#undef __in
#undef __out
diff --git a/src/api/z3_api.h b/src/api/z3_api.h
index 71a6dde2b..844a4766c 100644
--- a/src/api/z3_api.h
+++ b/src/api/z3_api.h
@@ -194,6 +194,8 @@ typedef enum
Z3_DATATYPE_SORT,
Z3_RELATION_SORT,
Z3_FINITE_DOMAIN_SORT,
+ Z3_FLOATING_POINT_SORT,
+ Z3_ROUNDING_MODE_SORT,
Z3_UNKNOWN_SORT = 1000
} Z3_sort_kind;
@@ -767,7 +769,7 @@ typedef enum
- gcd-test - Indicates an integer linear arithmetic lemma that uses a gcd test.
- - Z3_OP_PR_HYPER_RESOLVE: Hyper-resolution rule.
+ - Z3_OP_PR_HYPER_RESOLVE: Hyper-resolution rule.
The premises of the rules is a sequence of clauses.
The first clause argument is the main clause of the rule.
@@ -875,6 +877,90 @@ typedef enum
- Z3_OP_DT_ACCESSOR: datatype accessor.
+ - Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN: Floating-point rounding mode RNE
+
+ - Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY: Floating-point rounding mode RNA
+
+ - Z3_OP_FPA_RM_TOWARD_POSITIVE: Floating-point rounding mode RTP
+
+ - Z3_OP_FPA_RM_TOWARD_NEGATIVE: Floating-point rounding mode RTN
+
+ - Z3_OP_FPA_RM_TOWARD_ZERO: Floating-point rounding mode RTZ
+
+ - Z3_OP_FPA_NUM: Floating-point value
+
+ - Z3_OP_FPA_PLUS_INF: Floating-point +oo
+
+ - Z3_OP_FPA_MINUS_INF: Floating-point -oo
+
+ - Z3_OP_FPA_NAN: Floating-point NaN
+
+ - Z3_OP_FPA_PLUS_ZERO: Floating-point +zero
+
+ - Z3_OP_FPA_MINUS_ZERO: Floating-point -zero
+
+ - Z3_OP_FPA_ADD: Floating-point addition
+
+ - Z3_OP_FPA_SUB: Floating-point subtraction
+
+ - Z3_OP_FPA_NEG: Floating-point negation
+
+ - Z3_OP_FPA_MUL: Floating-point multiplication
+
+ - Z3_OP_FPA_DIV: Floating-point division
+
+ - Z3_OP_FPA_REM: Floating-point remainder
+
+ - Z3_OP_FPA_ABS: Floating-point absolute value
+
+ - Z3_OP_FPA_MIN: Floating-point minimum
+
+ - Z3_OP_FPA_MAX: Floating-point maximum
+
+ - Z3_OP_FPA_FMA: Floating-point fused multiply-add
+
+ - Z3_OP_FPA_SQRT: Floating-point square root
+
+ - Z3_OP_FPA_ROUND_TO_INTEGRAL: Floating-point round to integral
+
+ - Z3_OP_FPA_EQ: Floating-point equality
+
+ - Z3_OP_FPA_LT: Floating-point less than
+
+ - Z3_OP_FPA_GT: Floating-point greater than
+
+ - Z3_OP_FPA_LE: Floating-point less than or equal
+
+ - Z3_OP_FPA_GE: Floating-point greater than or equal
+
+ - Z3_OP_FPA_IS_NAN: Floating-point isNaN
+
+ - Z3_OP_FPA_IS_INF: Floating-point isInfinite
+
+ - Z3_OP_FPA_IS_ZERO: Floating-point isZero
+
+ - Z3_OP_FPA_IS_NORMAL: Floating-point isNormal
+
+ - Z3_OP_FPA_IS_SUBNORMAL: Floating-point isSubnormal
+
+ - Z3_OP_FPA_IS_NEGATIVE: Floating-point isNegative
+
+ - Z3_OP_FPA_IS_POSITIVE: Floating-point isPositive
+
+ - Z3_OP_FPA_FP: Floating-point constructor from 3 bit-vectors
+
+ - Z3_OP_FPA_TO_FP: Floating-point conversion (various)
+
+ - Z3_OP_FPA_TO_FP_UNSIGNED: Floating-point conversion from unsigend bit-vector
+
+ - Z3_OP_FPA_TO_UBV: Floating-point conversion to unsigned bit-vector
+
+ - Z3_OP_FPA_TO_SBV: Floating-point conversion to signed bit-vector
+
+ - Z3_OP_FPA_TO_REAL: Floating-point conversion to real number
+
+ - Z3_OP_FPA_TO_IEEE_BV: Floating-point conversion to IEEE-754 bit-vector
+
- Z3_OP_UNINTERPRETED: kind used for uninterpreted symbols.
*/
typedef enum {
@@ -1056,6 +1142,55 @@ typedef enum {
Z3_OP_DT_RECOGNISER,
Z3_OP_DT_ACCESSOR,
+ // Floating-Point Arithmetic
+ Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN,
+ Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY,
+ Z3_OP_FPA_RM_TOWARD_POSITIVE,
+ Z3_OP_FPA_RM_TOWARD_NEGATIVE,
+ Z3_OP_FPA_RM_TOWARD_ZERO,
+
+ Z3_OP_FPA_NUM,
+ Z3_OP_FPA_PLUS_INF,
+ Z3_OP_FPA_MINUS_INF,
+ Z3_OP_FPA_NAN,
+ Z3_OP_FPA_PLUS_ZERO,
+ Z3_OP_FPA_MINUS_ZERO,
+
+ Z3_OP_FPA_ADD,
+ Z3_OP_FPA_SUB,
+ Z3_OP_FPA_NEG,
+ Z3_OP_FPA_MUL,
+ Z3_OP_FPA_DIV,
+ Z3_OP_FPA_REM,
+ Z3_OP_FPA_ABS,
+ Z3_OP_FPA_MIN,
+ Z3_OP_FPA_MAX,
+ Z3_OP_FPA_FMA,
+ Z3_OP_FPA_SQRT,
+ Z3_OP_FPA_ROUND_TO_INTEGRAL,
+
+ Z3_OP_FPA_EQ,
+ Z3_OP_FPA_LT,
+ Z3_OP_FPA_GT,
+ Z3_OP_FPA_LE,
+ Z3_OP_FPA_GE,
+ Z3_OP_FPA_IS_NAN,
+ Z3_OP_FPA_IS_INF,
+ Z3_OP_FPA_IS_ZERO,
+ Z3_OP_FPA_IS_NORMAL,
+ Z3_OP_FPA_IS_SUBNORMAL,
+ Z3_OP_FPA_IS_NEGATIVE,
+ Z3_OP_FPA_IS_POSITIVE,
+
+ Z3_OP_FPA_FP,
+ Z3_OP_FPA_TO_FP,
+ Z3_OP_FPA_TO_FP_UNSIGNED,
+ Z3_OP_FPA_TO_UBV,
+ Z3_OP_FPA_TO_SBV,
+ Z3_OP_FPA_TO_REAL,
+
+ Z3_OP_FPA_TO_IEEE_BV,
+
Z3_OP_UNINTERPRETED
} Z3_decl_kind;
@@ -1698,8 +1833,7 @@ extern "C" {
/**
\brief Create the real type.
- This type is not a floating point number.
- Z3 does not have support for floating point numbers yet.
+ Note that this type is not a floating point number.
def_API('Z3_mk_real_sort', SORT, (_in(CONTEXT), ))
*/
diff --git a/src/api/z3_fpa.h b/src/api/z3_fpa.h
new file mode 100644
index 000000000..e1bd67d66
--- /dev/null
+++ b/src/api/z3_fpa.h
@@ -0,0 +1,927 @@
+/*++
+Copyright (c) 2013 Microsoft Corporation
+
+Module Name:
+
+ z3_fpa.h
+
+Abstract:
+
+ Additional APIs for floating-point arithmetic (FP).
+
+Author:
+
+ Christoph M. Wintersteiger (cwinter) 2013-06-05
+
+Notes:
+
+--*/
+#ifndef _Z3_FPA_H_
+#define _Z3_FPA_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif // __cplusplus
+
+ /**
+ \defgroup capi C API
+
+ */
+
+ /*@{*/
+
+ /**
+ @name Floating-Point API
+ */
+ /*@{*/
+
+ /**
+ \brief Create the RoundingMode sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rounding_mode_sort', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_rounding_mode_sort(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_round_nearest_ties_to_even', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_nearest_ties_to_even(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rne', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rne(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_round_nearest_ties_to_away', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_nearest_ties_to_away(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rna', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rna(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardPositive rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_round_toward_positive', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_positive(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardPositive rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rtp', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rtp(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardNegative rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_round_toward_negative', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_negative(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardNegative rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rtn', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rtn(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardZero rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_round_toward_zero', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_toward_zero(__in Z3_context c);
+
+ /**
+ \brief Create a numeral of RoundingMode sort which represents the TowardZero rounding mode.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_rtz', AST, (_in(CONTEXT),))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rtz(__in Z3_context c);
+
+ /**
+ \brief Create a FloatingPoint sort.
+
+ \param c logical context
+ \param ebits number of exponent bits
+ \param sbits number of significand bits
+
+ \remark ebits must be larger than 1 and sbits must be larger than 2.
+
+ def_API('Z3_mk_fpa_sort', SORT, (_in(CONTEXT), _in(UINT), _in(UINT)))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort(__in Z3_context c, __in unsigned ebits, __in unsigned sbits);
+
+ /**
+ \brief Create the half-precision (16-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_half', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_half(__in Z3_context c);
+
+ /**
+ \brief Create the half-precision (16-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_16', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_16(__in Z3_context c);
+
+ /**
+ \brief Create the single-precision (32-bit) FloatingPoint sort.
+
+ \param c logical context.
+
+ def_API('Z3_mk_fpa_sort_single', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_single(__in Z3_context c);
+
+ /**
+ \brief Create the single-precision (32-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_32', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_32(__in Z3_context c);
+
+ /**
+ \brief Create the double-precision (64-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_double', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_double(__in Z3_context c);
+
+ /**
+ \brief Create the double-precision (64-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_64', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_64(__in Z3_context c);
+
+ /**
+ \brief Create the quadruple-precision (128-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_quadruple', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_quadruple(__in Z3_context c);
+
+ /**
+ \brief Create the quadruple-precision (128-bit) FloatingPoint sort.
+
+ \param c logical context
+
+ def_API('Z3_mk_fpa_sort_128', SORT, (_in(CONTEXT),))
+ */
+ Z3_sort Z3_API Z3_mk_fpa_sort_128(__in Z3_context c);
+
+ /**
+ \brief Create a floating-point NaN of sort s.
+
+ \param c logical context
+ \param s target sort
+
+ def_API('Z3_mk_fpa_nan', AST, (_in(CONTEXT),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_nan(__in Z3_context c, __in Z3_sort s);
+
+ /**
+ \brief Create a floating-point infinity of sort s.
+
+ \param c logical context
+ \param s target sort
+ \param negative indicates whether the result should be negative
+
+ When \c negative is true, -oo will be generated instead of +oo.
+
+ def_API('Z3_mk_fpa_inf', AST, (_in(CONTEXT),_in(SORT),_in(BOOL)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_inf(__in Z3_context c, __in Z3_sort s, __in Z3_bool negative);
+
+ /**
+ \brief Create a floating-point zero of sort s.
+
+ \param c logical context
+ \param s target sort
+ \param negative indicates whether the result should be negative
+
+ When \c negative is true, -zero will be generated instead of +zero.
+
+ def_API('Z3_mk_fpa_zero', AST, (_in(CONTEXT),_in(SORT),_in(BOOL)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_zero(__in Z3_context c, __in Z3_sort s, __in Z3_bool negative);
+
+ /**
+ \brief Create an expression of FloatingPoint sort from three bit-vector expressions.
+
+ This is the operator named `fp' in the SMT FP theory definition.
+ Note that \c sign is required to be a bit-vector of size 1. Significand and exponent
+ are required to be greater than 1 and 2 respectively. The FloatingPoint sort
+ of the resulting expression is automatically determined from the bit-vector sizes
+ of the arguments.
+
+ \param c logical context
+ \param sgn sign
+ \param exp exponent
+ \param sig significand
+
+ def_API('Z3_mk_fpa_fp', AST, (_in(CONTEXT), _in(AST), _in(AST), _in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_fp(__in Z3_context c, __in Z3_ast sgn, __in Z3_ast exp, __in Z3_ast sig);
+
+ /**
+ \brief Create a numeral of FloatingPoint sort from a float.
+
+ This function is used to create numerals that fit in a float value.
+ It is slightly faster than #Z3_mk_numeral since it is not necessary to parse a string.
+
+ \param c logical context
+ \param v value
+ \param ty sort
+
+ ty must be a FloatingPoint sort
+
+ \sa Z3_mk_numeral
+
+ def_API('Z3_mk_fpa_numeral_float', AST, (_in(CONTEXT), _in(FLOAT), _in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_numeral_float(__in Z3_context c, __in float v, __in Z3_sort ty);
+
+ /**
+ \brief Create a numeral of FloatingPoint sort from a double.
+
+ This function is used to create numerals that fit in a double value.
+ It is slightly faster than #Z3_mk_numeral since it is not necessary to parse a string.
+
+ \param c logical context
+ \param v value
+ \param ty sort
+
+ ty must be a FloatingPoint sort
+
+ \sa Z3_mk_numeral
+
+ def_API('Z3_mk_fpa_numeral_double', AST, (_in(CONTEXT), _in(DOUBLE), _in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_numeral_double(__in Z3_context c, __in double v, __in Z3_sort ty);
+
+ /**
+ \brief Create a numeral of FloatingPoint sort from a signed integer.
+
+ \param c logical context
+ \param v value
+ \param ty result sort
+
+ ty must be a FloatingPoint sort
+
+ \sa Z3_mk_numeral
+
+ def_API('Z3_mk_fpa_numeral_int', AST, (_in(CONTEXT), _in(INT), _in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int(__in Z3_context c, __in signed v, Z3_sort ty);
+
+ /**
+ \brief Create a numeral of FloatingPoint sort from a sign bit and two integers.
+
+ \param c logical context
+ \param sgn sign bit (true == negative)
+ \param sig significand
+ \param exp exponent
+ \param ty result sort
+
+ ty must be a FloatingPoint sort
+
+ \sa Z3_mk_numeral
+
+ def_API('Z3_mk_fpa_numeral_int_uint', AST, (_in(CONTEXT), _in(BOOL), _in(INT), _in(UINT), _in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int_uint(__in Z3_context c, __in Z3_bool sgn, __in signed exp, __in unsigned sig, Z3_sort ty);
+
+ /**
+ \brief Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers.
+
+ \param c logical context
+ \param sgn sign bit (true == negative)
+ \param sig significand
+ \param exp exponent
+ \param ty result sort
+
+ ty must be a FloatingPoint sort
+
+ \sa Z3_mk_numeral
+
+ def_API('Z3_mk_fpa_numeral_int64_uint64', AST, (_in(CONTEXT), _in(BOOL), _in(INT64), _in(UINT64), _in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_numeral_int64_uint64(__in Z3_context c, __in Z3_bool sgn, __in __int64 exp, __in __uint64 sig, Z3_sort ty);
+
+ /**
+ \brief Floating-point absolute value
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ def_API('Z3_mk_fpa_abs', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_abs(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Floating-point negation
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ def_API('Z3_mk_fpa_neg', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_neg(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Floating-point addition
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ rm must be of RoundingMode sort, t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_add', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_add(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point subtraction
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ rm must be of RoundingMode sort, t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_sub', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_sub(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point multiplication
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ rm must be of RoundingMode sort, t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_mul', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_mul(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point division
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t1 term of FloatingPoint sort.
+ \param t2 term of FloatingPoint sort
+
+ The nodes rm must be of RoundingMode sort t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_div', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_div(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point fused multiply-add.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sor
+ \param t3 term of FloatingPoint sort
+
+ The result is round((t1 * t2) + t3)
+
+ rm must be of RoundingMode sort, t1, t2, and t3 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_fma', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_fma(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t1, __in Z3_ast t2, __in Z3_ast t3);
+
+ /**
+ \brief Floating-point square root
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of FloatingPoint sort
+
+ rm must be of RoundingMode sort, t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_sqrt', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_sqrt(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t);
+
+ /**
+ \brief Floating-point remainder
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_rem', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_rem(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point roundToIntegral. Rounds a floating-point number to
+ the closest integer, again represented as a floating-point number.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of FloatingPoint sort
+
+ t must be of FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_round_to_integral', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_round_to_integral(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t);
+
+ /**
+ \brief Minimum of floating-point numbers.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1, t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_min', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_min(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Maximum of floating-point numbers.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1, t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_max', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_max(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point less than or equal.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_leq', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_leq(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point less than.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_lt', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_lt(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point greater than or equal.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_geq', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_geq(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point greater than.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_gt', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_gt(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Floating-point equality.
+
+ \param c logical context
+ \param t1 term of FloatingPoint sort
+ \param t2 term of FloatingPoint sort
+
+ Note that this is IEEE 754 equality (as opposed to SMT-LIB =).
+
+ t1 and t2 must have the same FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_eq', AST, (_in(CONTEXT),_in(AST),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_eq(__in Z3_context c, __in Z3_ast t1, __in Z3_ast t2);
+
+ /**
+ \brief Predicate indicating whether t is a normal floating-point number.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_normal', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_normal(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a subnormal floating-point number.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_subnormal', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_subnormal(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a floating-point number with zero value, i.e., +zero or -zero.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_zero', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_zero(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a floating-point number representing +oo or -oo.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_infinite', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_infinite(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a NaN.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_nan', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_nan(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a negative floating-point number.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_negative', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_negative(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Predicate indicating whether t is a positive floating-point number.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort.
+
+ def_API('Z3_mk_fpa_is_positive', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_is_positive(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Conversion of a single IEEE 754-2008 bit-vector into a floating-point number.
+
+ Produces a term that represents the conversion of a bit-vector term bv to a
+ floating-point term of sort s.
+
+ \param c logical context
+ \param bv a bit-vector term
+ \param s floating-point sort
+
+ s must be a FloatingPoint sort, t must be of bit-vector sort, and the bit-vector
+ size of bv must be equal to ebits+sbits of s. The format of the bit-vector is
+ as defined by the IEEE 754-2008 interchange format.
+
+ def_API('Z3_mk_fpa_to_fp_bv', AST, (_in(CONTEXT),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_bv(__in Z3_context c, __in Z3_ast bv, __in Z3_sort s);
+
+ /**
+ \brief Conversion of a FloatingPoint term into another term of different FloatingPoint sort.
+
+ Produces a term that represents the conversion of a floating-point term t to a
+ floating-point term of sort s. If necessary, the result will be rounded according
+ to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of FloatingPoint sort
+ \param s floating-point sort
+
+ s must be a FloatingPoint sort, rm must be of RoundingMode sort, t must be of floating-point sort.
+
+ def_API('Z3_mk_fpa_to_fp_float', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_float(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in Z3_sort s);
+
+ /**
+ \brief Conversion of a term of real sort into a term of FloatingPoint sort.
+
+ Produces a term that represents the conversion of term t of real sort into a
+ floating-point term of sort s. If necessary, the result will be rounded according
+ to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of Real sort
+ \param s floating-point sort
+
+ s must be a FloatingPoint sort, rm must be of RoundingMode sort, t must be of real sort.
+
+ def_API('Z3_mk_fpa_to_fp_real', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_real(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in Z3_sort s);
+
+ /**
+ \brief Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort.
+
+ Produces a term that represents the conversion of the bit-vector term t into a
+ floating-point term of sort s. The bit-vector t is taken to be in signed
+ 2's complement format. If necessary, the result will be rounded according
+ to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of bit-vector sort
+ \param s floating-point sort
+
+ s must be a FloatingPoint sort, rm must be of RoundingMode sort, t must be of bit-vector sort.
+
+ def_API('Z3_mk_fpa_to_fp_signed', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_signed(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in Z3_sort s);
+
+ /**
+ \brief Conversion of a 2's complement unsigned bit-vector term into a term of FloatingPoint sort.
+
+ Produces a term that represents the conversion of the bit-vector term t into a
+ floating-point term of sort s. The bit-vector t is taken to be in unsigned
+ 2's complement format. If necessary, the result will be rounded according
+ to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of bit-vector sort
+ \param s floating-point sort
+
+ s must be a FloatingPoint sort, rm must be of RoundingMode sort, t must be of bit-vector sort.
+
+ def_API('Z3_mk_fpa_to_fp_unsigned', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_unsigned(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in Z3_sort s);
+
+ /**
+ \brief Conversion of a floating-point term into an unsigned bit-vector.
+
+ Produces a term that represents the conversion of the floating-poiunt term t into a
+ bit-vector term of size sz in unsigned 2's complement format. If necessary, the result
+ will be rounded according to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of FloatingPoint sort
+ \param sz size of the resulting bit-vector
+
+ def_API('Z3_mk_fpa_to_ubv', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(UINT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_ubv(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in unsigned sz);
+
+ /**
+ \brief Conversion of a floating-point term into a signed bit-vector.
+
+ Produces a term that represents the conversion of the floating-poiunt term t into a
+ bit-vector term of size sz in signed 2's complement format. If necessary, the result
+ will be rounded according to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param t term of FloatingPoint sort
+ \param sz size of the resulting bit-vector
+
+ def_API('Z3_mk_fpa_to_sbv', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(UINT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_sbv(__in Z3_context c, __in Z3_ast rm, __in Z3_ast t, __in unsigned sz);
+
+ /**
+ \brief Conversion of a floating-point term into a real-numbered term.
+
+ Produces a term that represents the conversion of the floating-poiunt term t into a
+ real number. Note that this type of conversion will often result in non-linear
+ constraints over real terms.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ def_API('Z3_mk_fpa_to_real', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_real(__in Z3_context c, __in Z3_ast t);
+
+
+ /**
+ @name Z3-specific floating-point extensions
+ */
+ /*@{*/
+
+ /**
+ \brief Retrieves the number of bits reserved for the exponent in a FloatingPoint sort.
+
+ \param c logical context
+ \param s FloatingPoint sort
+
+ def_API('Z3_fpa_get_ebits', UINT, (_in(CONTEXT),_in(SORT)))
+ */
+ unsigned Z3_API Z3_fpa_get_ebits(__in Z3_context c, __in Z3_sort s);
+
+ /**
+ \brief Retrieves the number of bits reserved for the significand in a FloatingPoint sort.
+
+ \param c logical context
+ \param s FloatingPoint sort
+
+ def_API('Z3_fpa_get_sbits', UINT, (_in(CONTEXT),_in(SORT)))
+ */
+ unsigned Z3_API Z3_fpa_get_sbits(__in Z3_context c, __in Z3_sort s);
+
+ /**
+ \brief Retrieves the sign of a floating-point literal.
+
+ \param c logical context
+ \param t a floating-point numeral
+ \param sgn sign
+
+ Remarks: sets \c sgn to 0 if the literal is NaN or positive and to 1 otherwise.
+
+ def_API('Z3_fpa_get_numeral_sign', BOOL, (_in(CONTEXT), _in(AST), _out(INT)))
+ */
+ Z3_bool Z3_API Z3_fpa_get_numeral_sign(__in Z3_context c, __in Z3_ast t, __out int * sgn);
+
+ /**
+ \brief Return the significand value of a floating-point numeral as a string.
+
+ \param c logical context
+ \param t a floating-point numeral
+
+ Remarks: The significand s is always 0 < s < 2.0; the resulting string is long
+ enough to represent the real significand precisely.
+
+ def_API('Z3_fpa_get_numeral_significand_string', STRING, (_in(CONTEXT), _in(AST)))
+ */
+ Z3_string Z3_API Z3_fpa_get_numeral_significand_string(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Return the exponent value of a floating-point numeral as a string
+
+ \param c logical context
+ \param t a floating-point numeral
+
+ def_API('Z3_fpa_get_numeral_exponent_string', STRING, (_in(CONTEXT), _in(AST)))
+ */
+ Z3_string Z3_API Z3_fpa_get_numeral_exponent_string(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Return the exponent value of a floating-point numeral as a signed 64-bit integer
+
+ \param c logical context
+ \param t a floating-point numeral
+ \param n exponent
+
+ def_API('Z3_fpa_get_numeral_exponent_int64', BOOL, (_in(CONTEXT), _in(AST), _out(INT64)))
+ */
+ Z3_bool Z3_API Z3_fpa_get_numeral_exponent_int64(__in Z3_context c, __in Z3_ast t, __out __int64 * n);
+
+ /**
+ \brief Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format.
+
+ \param c logical context
+ \param t term of FloatingPoint sort
+
+ t must have FloatingPoint sort. The size of the resulting bit-vector is automatically
+ determined.
+
+ Note that IEEE 754-2008 allows multiple different representations of NaN. This conversion
+ knows only one NaN and it will always produce the same bit-vector represenatation of
+ that NaN.
+
+ def_API('Z3_mk_fpa_to_ieee_bv', AST, (_in(CONTEXT),_in(AST)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_ieee_bv(__in Z3_context c, __in Z3_ast t);
+
+ /**
+ \brief Conversion of a real-sorted significand and an integer-sorted exponent into a term of FloatingPoint sort.
+
+ Produces a term that represents the conversion of sig * 2^exp into a
+ floating-point term of sort s. If necessary, the result will be rounded
+ according to rounding mode rm.
+
+ \param c logical context
+ \param rm term of RoundingMode sort
+ \param exp exponent term of Int sort
+ \param sig significand term of Real sort
+ \param s FloatingPoint sort
+
+ s must be a FloatingPoint sort, rm must be of RoundingMode sort, exp must be of int sort, sig must be of real sort.
+
+ def_API('Z3_mk_fpa_to_fp_int_real', AST, (_in(CONTEXT),_in(AST),_in(AST),_in(AST),_in(SORT)))
+ */
+ Z3_ast Z3_API Z3_mk_fpa_to_fp_int_real(__in Z3_context c, __in Z3_ast rm, __in Z3_ast exp, __in Z3_ast sig, __in Z3_sort s);
+
+ /*@}*/
+
+ /*@}*/
+ /*@}*/
+
+#ifdef __cplusplus
+};
+#endif // __cplusplus
+
+#endif
diff --git a/src/api/z3_replayer.cpp b/src/api/z3_replayer.cpp
index acdb10bf6..cfd022124 100644
--- a/src/api/z3_replayer.cpp
+++ b/src/api/z3_replayer.cpp
@@ -40,11 +40,12 @@ struct z3_replayer::imp {
__int64 m_int64;
__uint64 m_uint64;
double m_double;
+ float m_float;
size_t m_ptr;
size_t_map m_heap;
svector m_cmds;
- enum value_kind { INT64, UINT64, DOUBLE, STRING, SYMBOL, OBJECT, UINT_ARRAY, SYMBOL_ARRAY, OBJECT_ARRAY };
+ enum value_kind { INT64, UINT64, DOUBLE, STRING, SYMBOL, OBJECT, UINT_ARRAY, SYMBOL_ARRAY, OBJECT_ARRAY, FLOAT };
struct value {
value_kind m_kind;
@@ -54,6 +55,7 @@ struct z3_replayer::imp {
double m_double;
char const * m_str;
void * m_obj;
+ float m_float;
};
value():m_kind(OBJECT), m_int(0) {}
value(void * obj):m_kind(OBJECT), m_obj(obj) {}
@@ -61,6 +63,7 @@ struct z3_replayer::imp {
value(value_kind k, __uint64 u):m_kind(k), m_uint(u) {}
value(value_kind k, __int64 i):m_kind(k), m_int(i) {}
value(value_kind k, double d):m_kind(k), m_double(d) {}
+ value(value_kind k, float f):m_kind(k), m_float(f) {}
};
svector m_args;
@@ -85,9 +88,12 @@ struct z3_replayer::imp {
case UINT64:
out << v.m_uint;
break;
+ case FLOAT:
+ out << v.m_float;
+ break;
case DOUBLE:
out << v.m_double;
- break;
+ break;
case STRING:
out << v.m_str;
break;
@@ -219,6 +225,26 @@ struct z3_replayer::imp {
return curr() == '-' || curr() == '.' || ('0' <= curr() && curr() <= '9') || curr() == 'e' || curr() == 'E';
}
+#if (!defined(strtof))
+ float strtof(const char * str, char ** end_ptr) {
+ // Note: This may introduce a double-rounding problem.
+ return (float)strtod(str, end_ptr);
+ }
+#endif
+
+ void read_float() {
+ m_string.reset();
+ while (is_double_char()) {
+ m_string.push_back(curr());
+ next();
+ }
+ if (m_string.empty())
+ throw z3_replayer_exception("invalid float");
+ m_string.push_back(0);
+ char * ptr;
+ m_float = strtof(m_string.begin(), &ptr);
+ }
+
void read_double() {
m_string.reset();
while (is_double_char()) {
@@ -407,12 +433,18 @@ struct z3_replayer::imp {
TRACE("z3_replayer", tout << "[" << m_line << "] " << "U " << m_uint64 << "\n";);
m_args.push_back(value(UINT64, m_uint64));
break;
+ case 'F':
+ // push float
+ next(); skip_blank(); read_float();
+ TRACE("z3_replayer", tout << "[" << m_line << "] " << "F " << m_float << "\n";);
+ m_args.push_back(value(FLOAT, m_float));
+ break;
case 'D':
// push double
next(); skip_blank(); read_double();
TRACE("z3_replayer", tout << "[" << m_line << "] " << "D " << m_double << "\n";);
m_args.push_back(value(DOUBLE, m_double));
- break;
+ break;
case 'p':
case 's':
case 'u':
@@ -516,6 +548,12 @@ struct z3_replayer::imp {
return m_args[pos].m_uint;
}
+ float get_float(unsigned pos) const {
+ if (pos >= m_args.size() || m_args[pos].m_kind != FLOAT)
+ throw_invalid_reference();
+ return m_args[pos].m_float;
+ }
+
double get_double(unsigned pos) const {
if (pos >= m_args.size() || m_args[pos].m_kind != DOUBLE)
throw_invalid_reference();
@@ -653,6 +691,10 @@ __uint64 z3_replayer::get_uint64(unsigned pos) const {
return m_imp->get_uint64(pos);
}
+float z3_replayer::get_float(unsigned pos) const {
+ return m_imp->get_float(pos);
+}
+
double z3_replayer::get_double(unsigned pos) const {
return m_imp->get_double(pos);
}
diff --git a/src/api/z3_replayer.h b/src/api/z3_replayer.h
index 6de4bdb39..6320068ad 100644
--- a/src/api/z3_replayer.h
+++ b/src/api/z3_replayer.h
@@ -42,6 +42,7 @@ public:
unsigned get_uint(unsigned pos) const;
__int64 get_int64(unsigned pos) const;
__uint64 get_uint64(unsigned pos) const;
+ float get_float(unsigned pos) const;
double get_double(unsigned pos) const;
bool get_bool(unsigned pos) const;
Z3_string get_str(unsigned pos) const;
diff --git a/src/ast/ast.cpp b/src/ast/ast.cpp
index 09965be85..b134d38cb 100644
--- a/src/ast/ast.cpp
+++ b/src/ast/ast.cpp
@@ -413,16 +413,16 @@ sort * get_sort(expr const * n) {
//
// -----------------------------------
-unsigned get_node_size(ast const * n) {
- switch(n->get_kind()) {
- case AST_SORT: return to_sort(n)->get_size();
- case AST_FUNC_DECL: return to_func_decl(n)->get_size();
- case AST_APP: return to_app(n)->get_size();
- case AST_VAR: return to_var(n)->get_size();
- case AST_QUANTIFIER: return to_quantifier(n)->get_size();
- default: UNREACHABLE();
- }
- return 0;
+unsigned get_node_size(ast const * n) {
+ switch(n->get_kind()) {
+ case AST_SORT: return to_sort(n)->get_size();
+ case AST_FUNC_DECL: return to_func_decl(n)->get_size();
+ case AST_APP: return to_app(n)->get_size();
+ case AST_VAR: return to_var(n)->get_size();
+ case AST_QUANTIFIER: return to_quantifier(n)->get_size();
+ default: UNREACHABLE();
+ }
+ return 0;
}
bool compare_nodes(ast const * n1, ast const * n2) {
@@ -737,7 +737,7 @@ func_decl * basic_decl_plugin::mk_proof_decl(
for (unsigned i = 0; i < num_parents; i++)
domain.push_back(m_proof_sort);
domain.push_back(m_bool_sort);
- func_decl_info info(m_family_id, k, num_parameters, params);
+ func_decl_info info(m_family_id, k, num_parameters, params);
return m_manager->mk_func_decl(symbol(name), num_parents+1, domain.c_ptr(), m_proof_sort, info);
}
@@ -1643,12 +1643,12 @@ ast * ast_manager::register_node_core(ast * n) {
to_func_decl(n)->m_info = alloc(func_decl_info, *(to_func_decl(n)->get_info()));
to_func_decl(n)->m_info->init_eh(*this);
}
- inc_array_ref(to_func_decl(n)->get_arity(), to_func_decl(n)->get_domain());
- inc_ref(to_func_decl(n)->get_range());
- break;
+ inc_array_ref(to_func_decl(n)->get_arity(), to_func_decl(n)->get_domain());
+ inc_ref(to_func_decl(n)->get_range());
+ break;
case AST_APP: {
app * t = to_app(n);
- inc_ref(t->get_decl());
+ inc_ref(t->get_decl());
unsigned num_args = t->get_num_args();
if (num_args > 0) {
app_flags * f = t->flags();
@@ -1696,19 +1696,19 @@ ast * ast_manager::register_node_core(ast * n) {
f->m_depth = depth;
SASSERT(t->get_depth() == depth);
}
- break;
+ break;
}
case AST_VAR:
inc_ref(to_var(n)->get_sort());
break;
case AST_QUANTIFIER:
- inc_array_ref(to_quantifier(n)->get_num_decls(), to_quantifier(n)->get_decl_sorts());
- inc_ref(to_quantifier(n)->get_expr());
+ inc_array_ref(to_quantifier(n)->get_num_decls(), to_quantifier(n)->get_decl_sorts());
+ inc_ref(to_quantifier(n)->get_expr());
inc_array_ref(to_quantifier(n)->get_num_patterns(), to_quantifier(n)->get_patterns());
inc_array_ref(to_quantifier(n)->get_num_no_patterns(), to_quantifier(n)->get_no_patterns());
- break;
+ break;
default:
- break;
+ break;
}
return n;
}
@@ -1721,7 +1721,7 @@ void ast_manager::delete_node(ast * n) {
while (!worklist.empty()) {
n = worklist.back();
worklist.pop_back();
-
+
TRACE("ast", tout << "Deleting object " << n->m_id << " " << n << "\n";);
CTRACE("del_quantifier", is_quantifier(n), tout << "deleting quantifier " << n->m_id << " " << n << "\n";);
TRACE("mk_var_bug", tout << "del_ast: " << n->m_id << "\n";);
@@ -1770,8 +1770,8 @@ void ast_manager::delete_node(ast * n) {
dec_array_ref(worklist, to_quantifier(n)->get_num_patterns(), to_quantifier(n)->get_patterns());
dec_array_ref(worklist, to_quantifier(n)->get_num_no_patterns(), to_quantifier(n)->get_no_patterns());
break;
- default:
- break;
+ default:
+ break;
}
if (m_debug_ref_count) {
m_debug_free_indices.insert(n->m_id,0);
@@ -2567,9 +2567,9 @@ proof * ast_manager::mk_transitivity(proof * p1, proof * p2) {
(is_eq(get_fact(p2)) || is_oeq(get_fact(p2)))));
CTRACE("mk_transitivity", to_app(get_fact(p1))->get_arg(1) != to_app(get_fact(p2))->get_arg(0),
tout << mk_pp(get_fact(p1), *this) << "\n\n" << mk_pp(get_fact(p2), *this) << "\n";
- tout << mk_bounded_pp(p1, *this, 5) << "\n\n";
- tout << mk_bounded_pp(p2, *this, 5) << "\n\n";
- );
+ tout << mk_bounded_pp(p1, *this, 5) << "\n\n";
+ tout << mk_bounded_pp(p2, *this, 5) << "\n\n";
+ );
SASSERT(to_app(get_fact(p1))->get_arg(1) == to_app(get_fact(p2))->get_arg(0));
if (is_reflexivity(p1))
return p2;
@@ -2848,7 +2848,7 @@ proof * ast_manager::mk_unit_resolution(unsigned num_proofs, proof * const * pro
SASSERT(is_or(f1));
app * cls = to_app(f1);
unsigned cls_sz = cls->get_num_args();
- CTRACE("cunit_bug", !(num_proofs == cls_sz || (num_proofs == cls_sz + 1 && is_false(new_fact))),
+ CTRACE("cunit_bug", !(num_proofs == cls_sz || (num_proofs == cls_sz + 1 && is_false(new_fact))),
for (unsigned i = 0; i < num_proofs; i++) tout << mk_pp(get_fact(proofs[i]), *this) << "\n";
tout << "===>\n";
tout << mk_pp(new_fact, *this) << "\n";);
diff --git a/src/ast/ast_smt2_pp.cpp b/src/ast/ast_smt2_pp.cpp
index 77c8ac58f..035e228fb 100644
--- a/src/ast/ast_smt2_pp.cpp
+++ b/src/ast/ast_smt2_pp.cpp
@@ -222,34 +222,65 @@ format * smt2_pp_environment::pp_bv_literal(app * t, bool use_bv_lits, bool bv_n
return vf;
}
-format * smt2_pp_environment::pp_float_literal(app * t) {
+format * smt2_pp_environment::pp_float_literal(app * t, bool use_bv_lits, bool use_float_real_lits) {
mpf_manager & fm = get_futil().fm();
scoped_mpf v(fm);
+ ast_manager & m = get_manager();
format * body = 0;
- VERIFY(get_futil().is_value(t, v));
+ string_buffer<> buf;
+ VERIFY(get_futil().is_numeral(t, v));
if (fm.is_nan(v)) {
- body = mk_string(get_manager(), "NaN");
+ buf << "(_ NaN " << v.get().get_ebits() << " " << v.get().get_sbits() << ")";
+ return mk_string(m, buf.c_str());
}
else if (fm.is_pinf(v)) {
- body = mk_string(get_manager(), "plusInfinity");
+ buf << "(_ +oo " << v.get().get_ebits() << " " << v.get().get_sbits() << ")";
+ return mk_string(m, buf.c_str());
}
else if (fm.is_ninf(v)) {
- body = mk_string(get_manager(), "minusInfinity");
+ buf << "(_ -oo " << v.get().get_ebits() << " " << v.get().get_sbits() << ")";
+ return mk_string(m, buf.c_str());
}
- else if (fm.is_pzero(v)) {
- // TODO: make it SMT 2.0 compatible
- body = mk_string(get_manager(), "+0.0");
+ else if (fm.is_pzero(v)) {
+ buf << "(_ +zero " << v.get().get_ebits() << " " << v.get().get_sbits() << ")";
+ return mk_string(m, buf.c_str());
}
else if (fm.is_nzero(v)) {
- // TODO: make it SMT 2.0 compatible
- body = mk_string(get_manager(), "-0.0");
+ buf << "(_ -zero " << v.get().get_ebits() << " " << v.get().get_sbits() << ")";
+ return mk_string(m, buf.c_str());
+ }
+ else if (use_float_real_lits)
+ {
+ buf << "((_ to_fp " << v.get().get_ebits() << " " <<
+ v.get().get_sbits() << ") RTZ " <<
+ fm.to_string(v).c_str() << ")";
+ return mk_string(m, buf.c_str());
}
else {
- // TODO: make it SMT 2.0 compatible
- std::string val = fm.to_string(v);
- body = mk_string(get_manager(), val.c_str());
+ if (use_bv_lits)
+ buf << "(fp #b" << (fm.sgn(v) ? 1 : 0);
+ else
+ buf << "(fp (_ bv" << (fm.sgn(v) ? 1 : 0) << " 1)";
+ body = mk_string(m, buf.c_str());
+ body = mk_compose(m, body, mk_string(m, " "));
+
+ mpf_exp_t exp = fm.exp(v);
+ const mpz & bias = fm.m_powers2.m1(v.get().get_ebits() - 1);
+ mpf_exp_t biased_exp = exp + fm.mpz_manager().get_int64(bias);
+ app_ref e_biased_exp(m);
+ e_biased_exp = get_bvutil().mk_numeral(biased_exp, v.get().get_ebits());
+ body = mk_compose(m, body, pp_bv_literal(e_biased_exp, use_bv_lits, false));
+ body = mk_compose(m, body, mk_string(m, " "));
+
+ scoped_mpz sig(fm.mpz_manager());
+ sig = fm.sig(v);
+ app_ref e_sig(m);
+ e_sig = get_bvutil().mk_numeral(rational(sig), v.get().get_sbits() - 1);
+ body = mk_compose(m, body, pp_bv_literal(e_sig, use_bv_lits, false));
+
+ body = mk_compose(m, body, mk_string(m, ")"));
+ return body;
}
- return pp_as(body, get_manager().get_sort(t));
}
// generate (- f)
@@ -365,7 +396,7 @@ format_ns::format * smt2_pp_environment::pp_sort(sort * s) {
unsigned ebits = get_futil().get_ebits(s);
unsigned sbits = get_futil().get_sbits(s);
ptr_buffer fs;
- fs.push_back(mk_string(m, "FP"));
+ fs.push_back(mk_string(m, "FloatingPoint"));
fs.push_back(mk_unsigned(m, ebits));
fs.push_back(mk_unsigned(m, sbits));
return mk_seq1(m, fs.begin(), fs.end(), f2f(), "_");
@@ -425,6 +456,7 @@ class smt2_printer {
bool m_pp_decimal;
unsigned m_pp_decimal_precision;
bool m_pp_bv_lits;
+ bool m_pp_float_real_lits;
bool m_pp_bv_neg;
unsigned m_pp_max_depth;
unsigned m_pp_min_alias_size;
@@ -543,8 +575,8 @@ class smt2_printer {
else if (m_env.get_bvutil().is_numeral(c)) {
f = m_env.pp_bv_literal(c, m_pp_bv_lits, m_pp_bv_neg);
}
- else if (m_env.get_futil().is_value(c)) {
- f = m_env.pp_float_literal(c);
+ else if (m_env.get_futil().is_numeral(c)) {
+ f = m_env.pp_float_literal(c, m_pp_bv_lits, m_pp_float_real_lits);
}
else if (m_env.get_dlutil().is_numeral(c)) {
f = m_env.pp_datalog_literal(c);
@@ -987,6 +1019,7 @@ public:
m_pp_decimal = p.decimal();
m_pp_decimal_precision = p.decimal_precision();
m_pp_bv_lits = p.bv_literals();
+ m_pp_float_real_lits = p.fp_real_literals();
m_pp_bv_neg = p.bv_neg();
m_pp_max_depth = p.max_depth();
m_pp_min_alias_size = p.min_alias_size();
diff --git a/src/ast/ast_smt2_pp.h b/src/ast/ast_smt2_pp.h
index aa84d6e03..8aac71b8c 100644
--- a/src/ast/ast_smt2_pp.h
+++ b/src/ast/ast_smt2_pp.h
@@ -27,7 +27,7 @@ Revision History:
#include"arith_decl_plugin.h"
#include"bv_decl_plugin.h"
#include"array_decl_plugin.h"
-#include"float_decl_plugin.h"
+#include"fpa_decl_plugin.h"
#include"dl_decl_plugin.h"
#include"smt2_util.h"
@@ -46,13 +46,13 @@ public:
virtual arith_util & get_autil() = 0;
virtual bv_util & get_bvutil() = 0;
virtual array_util & get_arutil() = 0;
- virtual float_util & get_futil() = 0;
+ virtual fpa_util & get_futil() = 0;
virtual datalog::dl_decl_util& get_dlutil() = 0;
virtual bool uses(symbol const & s) const = 0;
virtual format_ns::format * pp_fdecl(func_decl * f, unsigned & len);
virtual format_ns::format * pp_bv_literal(app * t, bool use_bv_lits, bool bv_neg);
virtual format_ns::format * pp_arith_literal(app * t, bool decimal, unsigned prec);
- virtual format_ns::format * pp_float_literal(app * t);
+ virtual format_ns::format * pp_float_literal(app * t, bool use_bv_lits, bool use_float_real_lits);
virtual format_ns::format * pp_datalog_literal(app * t);
virtual format_ns::format * pp_sort(sort * s);
virtual format_ns::format * pp_fdecl_ref(func_decl * f);
@@ -69,7 +69,7 @@ class smt2_pp_environment_dbg : public smt2_pp_environment {
arith_util m_autil;
bv_util m_bvutil;
array_util m_arutil;
- float_util m_futil;
+ fpa_util m_futil;
datalog::dl_decl_util m_dlutil;
public:
smt2_pp_environment_dbg(ast_manager & m):m_manager(m), m_autil(m), m_bvutil(m), m_arutil(m), m_futil(m), m_dlutil(m) {}
@@ -77,7 +77,7 @@ public:
virtual arith_util & get_autil() { return m_autil; }
virtual bv_util & get_bvutil() { return m_bvutil; }
virtual array_util & get_arutil() { return m_arutil; }
- virtual float_util & get_futil() { return m_futil; }
+ virtual fpa_util & get_futil() { return m_futil; }
virtual datalog::dl_decl_util& get_dlutil() { return m_dlutil; }
virtual bool uses(symbol const & s) const { return false; }
};
diff --git a/src/ast/ast_smt_pp.cpp b/src/ast/ast_smt_pp.cpp
index 59e5c04b9..b28b640bb 100644
--- a/src/ast/ast_smt_pp.cpp
+++ b/src/ast/ast_smt_pp.cpp
@@ -1003,7 +1003,7 @@ public:
visit_sort(d->get_domain(i), true);
}
m_out << ")";
- }
+ }
};
diff --git a/src/ast/bv_decl_plugin.cpp b/src/ast/bv_decl_plugin.cpp
index f1c61619a..b056ded36 100644
--- a/src/ast/bv_decl_plugin.cpp
+++ b/src/ast/bv_decl_plugin.cpp
@@ -136,7 +136,7 @@ void bv_decl_plugin::finalize() {
for (; it != end; ++it) {
ptr_vector & ds = *it;
DEC_REF(ds);
- }
+ }
DEC_REF(m_mkbv);
}
@@ -157,13 +157,13 @@ void bv_decl_plugin::mk_bv_sort(unsigned bv_size) {
}
inline sort * bv_decl_plugin::get_bv_sort(unsigned bv_size) {
- if (bv_size < (1 << 12)) {
- mk_bv_sort(bv_size);
+ if (bv_size < (1 << 12)) {
+ mk_bv_sort(bv_size);
return m_bv_sorts[bv_size];
- }
- parameter p(bv_size);
- sort_size sz(sort_size::mk_very_big());
- return m_manager->mk_sort(symbol("bv"), sort_info(m_family_id, BV_SORT, sz, 1, &p));
+ }
+ parameter p(bv_size);
+ sort_size sz(sort_size::mk_very_big());
+ return m_manager->mk_sort(symbol("bv"), sort_info(m_family_id, BV_SORT, sz, 1, &p));
}
sort * bv_decl_plugin::mk_sort(decl_kind k, unsigned num_parameters, parameter const * parameters) {
diff --git a/src/ast/datatype_decl_plugin.cpp b/src/ast/datatype_decl_plugin.cpp
index ee3271b9b..00f026f55 100644
--- a/src/ast/datatype_decl_plugin.cpp
+++ b/src/ast/datatype_decl_plugin.cpp
@@ -919,9 +919,9 @@ void datatype_util::display_datatype(sort *s0, std::ostream& strm) {
todo.push_back(s0);
mark.mark(s0, true);
while (!todo.empty()) {
- sort* s = todo.back();
+ sort* s = todo.back();
todo.pop_back();
- strm << s->get_name() << " =\n";
+ strm << s->get_name() << " =\n";
ptr_vector const * cnstrs = get_datatype_constructors(s);
for (unsigned i = 0; i < cnstrs->size(); ++i) {
@@ -931,14 +931,14 @@ void datatype_util::display_datatype(sort *s0, std::ostream& strm) {
ptr_vector const * accs = get_constructor_accessors(cns);
for (unsigned j = 0; j < accs->size(); ++j) {
func_decl* acc = (*accs)[j];
- sort* s1 = acc->get_range();
+ sort* s1 = acc->get_range();
strm << "(" << acc->get_name() << ": " << s1->get_name() << ") ";
if (is_datatype(s1) && are_siblings(s1, s0) && !mark.is_marked(s1)) {
mark.mark(s1, true);
todo.push_back(s1);
}
}
- strm << "\n";
+ strm << "\n";
}
}
diff --git a/src/ast/float_decl_plugin.cpp b/src/ast/float_decl_plugin.cpp
deleted file mode 100644
index f51101d79..000000000
--- a/src/ast/float_decl_plugin.cpp
+++ /dev/null
@@ -1,746 +0,0 @@
-/*++
-Copyright (c) 2012 Microsoft Corporation
-
-Module Name:
-
- float_decl_plugin.cpp
-
-Abstract:
-
- Floating point decl plugin
-
-Author:
-
- Leonardo de Moura (leonardo) 2012-01-15.
-
-Revision History:
-
---*/
-#include"float_decl_plugin.h"
-#include"arith_decl_plugin.h"
-#include"bv_decl_plugin.h"
-
-float_decl_plugin::float_decl_plugin():
- m_values(m_fm),
- m_value_table(mpf_hash_proc(m_values), mpf_eq_proc(m_values)) {
- m_real_sort = 0;
- m_int_sort = 0;
- m_bv_plugin = 0;
-}
-
-void float_decl_plugin::set_manager(ast_manager * m, family_id id) {
- decl_plugin::set_manager(m, id);
-
- family_id aid = m_manager->mk_family_id("arith");
- m_real_sort = m_manager->mk_sort(aid, REAL_SORT);
- SASSERT(m_real_sort != 0); // arith_decl_plugin must be installed before float_decl_plugin.
- m_manager->inc_ref(m_real_sort);
-
- m_int_sort = m_manager->mk_sort(aid, INT_SORT);
- SASSERT(m_int_sort != 0); // arith_decl_plugin must be installed before float_decl_plugin.
- m_manager->inc_ref(m_int_sort);
-
- // BV is not optional anymore.
- SASSERT(m_manager->has_plugin(symbol("bv")));
- m_bv_fid = m_manager->mk_family_id("bv");
- m_bv_plugin = static_cast(m_manager->get_plugin(m_bv_fid));
-}
-
-float_decl_plugin::~float_decl_plugin() {
-}
-
-unsigned float_decl_plugin::mk_id(mpf const & v) {
- unsigned new_id = m_id_gen.mk();
- m_values.reserve(new_id+1);
- m_fm.set(m_values[new_id], v);
- unsigned old_id = m_value_table.insert_if_not_there(new_id);
- if (old_id != new_id) {
- m_id_gen.recycle(new_id);
- m_fm.del(m_values[new_id]);
- }
- return old_id;
-}
-
-void float_decl_plugin::recycled_id(unsigned id) {
- SASSERT(m_value_table.contains(id));
- m_value_table.erase(id);
- m_id_gen.recycle(id);
- m_fm.del(m_values[id]);
-}
-
-func_decl * float_decl_plugin::mk_value_decl(mpf const & v) {
- parameter p(mk_id(v), true);
- SASSERT(p.is_external());
- sort * s = mk_float_sort(v.get_ebits(), v.get_sbits());
- return m_manager->mk_const_decl(symbol("float"), s, func_decl_info(m_family_id, OP_FLOAT_VALUE, 1, &p));
-}
-
-app * float_decl_plugin::mk_value(mpf const & v) {
- return m_manager->mk_const(mk_value_decl(v));
-}
-
-bool float_decl_plugin::is_value(expr * n, mpf & val) {
- if (is_app_of(n, m_family_id, OP_FLOAT_VALUE)) {
- m_fm.set(val, m_values[to_app(n)->get_decl()->get_parameter(0).get_ext_id()]);
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_FLOAT_MINUS_INF)) {
- unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
- unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
- m_fm.mk_ninf(ebits, sbits, val);
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_FLOAT_PLUS_INF)) {
- unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
- unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
- m_fm.mk_pinf(ebits, sbits, val);
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_FLOAT_NAN)) {
- unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
- unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
- m_fm.mk_nan(ebits, sbits, val);
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_FLOAT_PLUS_ZERO)) {
- unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
- unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
- m_fm.mk_pzero(ebits, sbits, val);
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_FLOAT_MINUS_ZERO)) {
- unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
- unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
- m_fm.mk_nzero(ebits, sbits, val);
- return true;
- }
- return false;
-}
-
-bool float_decl_plugin::is_rm_value(expr * n, mpf_rounding_mode & val) {
- if (is_app_of(n, m_family_id, OP_RM_NEAREST_TIES_TO_AWAY)) {
- val = MPF_ROUND_NEAREST_TAWAY;
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_RM_NEAREST_TIES_TO_EVEN)) {
- val = MPF_ROUND_NEAREST_TEVEN;
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_RM_TOWARD_NEGATIVE)) {
- val = MPF_ROUND_TOWARD_NEGATIVE;
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_RM_TOWARD_POSITIVE)) {
- val = MPF_ROUND_TOWARD_POSITIVE;
- return true;
- }
- else if (is_app_of(n, m_family_id, OP_RM_TOWARD_ZERO)) {
- val = MPF_ROUND_TOWARD_ZERO;
- return true;
- }
-
- return 0;
-}
-
-void float_decl_plugin::del(parameter const & p) {
- SASSERT(p.is_external());
- recycled_id(p.get_ext_id());
-}
-
-parameter float_decl_plugin::translate(parameter const & p, decl_plugin & target) {
- SASSERT(p.is_external());
- float_decl_plugin & _target = static_cast(target);
- return parameter(_target.mk_id(m_values[p.get_ext_id()]), true);
-}
-
-void float_decl_plugin::finalize() {
- if (m_real_sort) { m_manager->dec_ref(m_real_sort); }
- if (m_int_sort) { m_manager->dec_ref(m_int_sort); }
-}
-
-decl_plugin * float_decl_plugin::mk_fresh() {
- return alloc(float_decl_plugin);
-}
-
-sort * float_decl_plugin::mk_float_sort(unsigned ebits, unsigned sbits) {
- parameter p1(ebits), p2(sbits);
- parameter ps[2] = { p1, p2 };
- sort_size sz;
- sz = sort_size::mk_very_big(); // TODO: refine
- return m_manager->mk_sort(symbol("FloatingPoint"), sort_info(m_family_id, FLOAT_SORT, sz, 2, ps));
-}
-
-sort * float_decl_plugin::mk_rm_sort() {
- return m_manager->mk_sort(symbol("RoundingMode"), sort_info(m_family_id, ROUNDING_MODE_SORT));
-}
-
-sort * float_decl_plugin::mk_sort(decl_kind k, unsigned num_parameters, parameter const * parameters) {
- switch (k) {
- case FLOAT_SORT:
- if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int())) {
- m_manager->raise_exception("expecting two integer parameters to floating point sort");
- }
- if (parameters[0].get_int() <= 1 || parameters[1].get_int() <= 1)
- m_manager->raise_exception("floating point sorts need parameters > 1");
- if (parameters[0].get_int() > parameters[1].get_int())
- m_manager->raise_exception("floating point sorts with ebits > sbits are currently not supported");
- return mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
- case ROUNDING_MODE_SORT:
- return mk_rm_sort();
- case FLOAT16_SORT:
- return mk_float_sort(5, 11);
- case FLOAT32_SORT:
- return mk_float_sort(8, 24);
- case FLOAT64_SORT:
- return mk_float_sort(11, 53);
- case FLOAT128_SORT:
- return mk_float_sort(15, 133);
- default:
- m_manager->raise_exception("unknown floating point theory sort");
- return 0;
- }
-}
-
-func_decl * float_decl_plugin::mk_rm_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (num_parameters != 0)
- m_manager->raise_exception("rounding mode constant does not have parameters");
- if (arity != 0)
- m_manager->raise_exception("rounding mode is a constant");
- sort * s = mk_rm_sort();
- func_decl_info finfo(m_family_id, k);
- switch (k) {
- case OP_RM_NEAREST_TIES_TO_EVEN:
- return m_manager->mk_const_decl(symbol("roundNearestTiesToEven"), s, finfo);
- case OP_RM_NEAREST_TIES_TO_AWAY:
- return m_manager->mk_const_decl(symbol("roundNearestTiesToAway"), s, finfo);
- case OP_RM_TOWARD_POSITIVE:
- return m_manager->mk_const_decl(symbol("roundTowardPositive"), s, finfo);
- case OP_RM_TOWARD_NEGATIVE:
- return m_manager->mk_const_decl(symbol("roundTowardNegative"), s, finfo);
- case OP_RM_TOWARD_ZERO:
- return m_manager->mk_const_decl(symbol("roundTowardZero"), s, finfo);
- default:
- UNREACHABLE();
- return 0;
- }
-}
-
-func_decl * float_decl_plugin::mk_float_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- sort * s;
- if (num_parameters == 1 && parameters[0].is_ast() && is_sort(parameters[0].get_ast()) && is_float_sort(to_sort(parameters[0].get_ast()))) {
- s = to_sort(parameters[0].get_ast());
- }
- else if (num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()) {
- s = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
- }
- else if (range != 0 && is_float_sort(range)) {
- s = range;
- }
- else {
- m_manager->raise_exception("sort of floating point constant was not specified");
- UNREACHABLE();
- }
-
- SASSERT(is_sort_of(s, m_family_id, FLOAT_SORT));
-
- unsigned ebits = s->get_parameter(0).get_int();
- unsigned sbits = s->get_parameter(1).get_int();
- scoped_mpf val(m_fm);
-
- switch (k)
- {
- case OP_FLOAT_NAN: m_fm.mk_nan(ebits, sbits, val);
- SASSERT(m_fm.is_nan(val));
- break;
- case OP_FLOAT_MINUS_INF: m_fm.mk_ninf(ebits, sbits, val); break;
- case OP_FLOAT_PLUS_INF: m_fm.mk_pinf(ebits, sbits, val); break;
- case OP_FLOAT_MINUS_ZERO: m_fm.mk_nzero(ebits, sbits, val); break;
- case OP_FLOAT_PLUS_ZERO: m_fm.mk_pzero(ebits, sbits, val); break;
- }
-
- return mk_value_decl(val);
-}
-
-func_decl * float_decl_plugin::mk_bin_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 2)
- m_manager->raise_exception("invalid number of arguments to floating point relation");
- if (domain[0] != domain[1] || !is_float_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected equal FloatingPoint sorts as arguments");
- symbol name;
- switch (k) {
- case OP_FLOAT_EQ: name = "fp.eq"; break;
- case OP_FLOAT_LT: name = "fp.lt"; break;
- case OP_FLOAT_GT: name = "fp.gt"; break;
- case OP_FLOAT_LE: name = "fp.lte"; break;
- case OP_FLOAT_GE: name = "fp.gte"; break;
- default:
- UNREACHABLE();
- break;
- }
- func_decl_info finfo(m_family_id, k);
- finfo.set_chainable(true);
- return m_manager->mk_func_decl(name, arity, domain, m_manager->mk_bool_sort(), finfo);
-}
-
-func_decl * float_decl_plugin::mk_unary_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 1)
- m_manager->raise_exception("invalid number of arguments to floating point relation");
- if (!is_float_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
- symbol name;
- switch (k) {
- case OP_FLOAT_IS_ZERO: name = "fp.isZero"; break;
- case OP_FLOAT_IS_NZERO: name = "fp.isNZero"; break;
- case OP_FLOAT_IS_PZERO: name = "fp.isPZero"; break;
- case OP_FLOAT_IS_NEGATIVE: name = "fp.isNegative"; break;
- case OP_FLOAT_IS_POSITIVE: name = "fp.isPositive"; break;
- case OP_FLOAT_IS_NAN: name = "fp.isNaN"; break;
- case OP_FLOAT_IS_INF: name = "fp.isInfinite"; break;
- case OP_FLOAT_IS_NORMAL: name = "fp.isNormal"; break;
- case OP_FLOAT_IS_SUBNORMAL: name = "fp.isSubnormal"; break;
- default:
- UNREACHABLE();
- break;
- }
- return m_manager->mk_func_decl(name, arity, domain, m_manager->mk_bool_sort(), func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 1)
- m_manager->raise_exception("invalid number of arguments to floating point operator");
- if (!is_float_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
- symbol name;
- switch (k) {
- case OP_FLOAT_ABS: name = "fp.abs"; break;
- case OP_FLOAT_NEG: name = "fp.neg"; break;
- default:
- UNREACHABLE();
- break;
- }
- return m_manager->mk_func_decl(name, arity, domain, domain[0], func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 2)
- m_manager->raise_exception("invalid number of arguments to floating point operator");
- if (domain[0] != domain[1] || !is_float_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected arguments of equal FloatingPoint sorts");
- symbol name;
- switch (k) {
- case OP_FLOAT_REM: name = "fp.rem"; break;
- case OP_FLOAT_MIN: name = "fp.min"; break;
- case OP_FLOAT_MAX: name = "fp.max"; break;
- default:
- UNREACHABLE();
- break;
- }
- return m_manager->mk_func_decl(name, arity, domain, domain[0], func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_rm_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 3)
- m_manager->raise_exception("invalid number of arguments to floating point operator");
- if (!is_rm_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
- if (domain[1] != domain[2] || !is_float_sort(domain[1]))
- m_manager->raise_exception("sort mismatch, expected arguments 1 and 2 of equal FloatingPoint sorts");
- symbol name;
- switch (k) {
- case OP_FLOAT_ADD: name = "fp.add"; break;
- case OP_FLOAT_SUB: name = "fp.sub"; break;
- case OP_FLOAT_MUL: name = "fp.mul"; break;
- case OP_FLOAT_DIV: name = "fp.div"; break;
- default:
- UNREACHABLE();
- break;
- }
- return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_rm_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 2)
- m_manager->raise_exception("invalid number of arguments to floating point operator");
- if (!is_rm_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected RoundingMode as first argument");
- if (!is_float_sort(domain[1]))
- m_manager->raise_exception("sort mismatch, expected FloatingPoint as second argument");
- symbol name;
- switch (k) {
- case OP_FLOAT_SQRT: name = "fp.sqrt"; break;
- case OP_FLOAT_ROUND_TO_INTEGRAL: name = "fp.roundToIntegral"; break;
- default:
- UNREACHABLE();
- break;
- }
- return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_fma(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 4)
- m_manager->raise_exception("invalid number of arguments to fused_ma operator");
- if (!is_rm_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected RoundingMode as first argument");
- if (domain[1] != domain[2] || domain[1] != domain[3] || !is_float_sort(domain[1]))
- m_manager->raise_exception("sort mismatch, expected arguments 1,2,3 of equal FloatingPoint sort");
- symbol name("fp.fma");
- return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_to_float(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (m_bv_plugin && arity == 3 &&
- is_sort_of(domain[0], m_bv_fid, BV_SORT) &&
- is_sort_of(domain[1], m_bv_fid, BV_SORT) &&
- is_sort_of(domain[2], m_bv_fid, BV_SORT)) {
- // 3 BVs -> 1 FP
- sort * fp = mk_float_sort(domain[2]->get_parameter(0).get_int(), domain[1]->get_parameter(0).get_int()+1);
- symbol name("fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
- }
- else if (m_bv_plugin && arity == 1 && is_sort_of(domain[0], m_bv_fid, BV_SORT)) {
- // 1 BV -> 1 FP
- if (num_parameters != 2)
- m_manager->raise_exception("invalid number of parameters to to_fp");
- if (!parameters[0].is_int() || !parameters[1].is_int())
- m_manager->raise_exception("invalid parameter type to to_fp");
- int ebits = parameters[0].get_int();
- int sbits = parameters[1].get_int();
-
- sort * fp = mk_float_sort(ebits, sbits);
- symbol name("to_fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
- }
- else if (m_bv_plugin && arity == 2 &&
- is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
- is_sort_of(domain[1], m_bv_fid, BV_SORT)) {
- // Rounding + 1 BV -> 1 FP
- if (num_parameters != 2)
- m_manager->raise_exception("invalid number of parameters to to_fp");
- if (!parameters[0].is_int() || !parameters[1].is_int())
- m_manager->raise_exception("invalid parameter type to to_fp");
- int ebits = parameters[0].get_int();
- int sbits = parameters[1].get_int();
-
- sort * fp = mk_float_sort(ebits, sbits);
- symbol name("to_fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
- }
- else if (arity == 2 &&
- is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
- is_sort_of(domain[1], m_family_id, FLOAT_SORT)) {
- // Rounding + 1 FP -> 1 FP
- if (num_parameters != 2)
- m_manager->raise_exception("invalid number of parameters to to_fp");
- if (!parameters[0].is_int() || !parameters[1].is_int())
- m_manager->raise_exception("invalid parameter type to to_fp");
- int ebits = parameters[0].get_int();
- int sbits = parameters[1].get_int();
- if (!is_rm_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
- if (!is_sort_of(domain[1], m_family_id, FLOAT_SORT))
- m_manager->raise_exception("sort mismatch, expected second argument of FloatingPoint sort");
-
- sort * fp = mk_float_sort(ebits, sbits);
- symbol name("to_fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
- }
- else {
- // 1 Real -> 1 FP
- if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()))
- m_manager->raise_exception("expecting two integer parameters to to_fp");
- if (arity != 2 && arity != 3)
- m_manager->raise_exception("invalid number of arguments to to_fp operator");
- if (arity == 3 && domain[2] != m_int_sort)
- m_manager->raise_exception("sort mismatch, expected second argument of Int sort");
- if (domain[1] != m_real_sort)
- m_manager->raise_exception("sort mismatch, expected second argument of Real sort");
-
- sort * fp = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
- symbol name("to_fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
- }
-}
-
-func_decl * float_decl_plugin::mk_float_to_ieee_bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 1)
- m_manager->raise_exception("invalid number of arguments to asIEEEBV");
- if (!is_float_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
-
- unsigned float_sz = domain[0]->get_parameter(0).get_int() + domain[0]->get_parameter(1).get_int();
- parameter ps[] = { parameter(float_sz) };
- sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, ps);
- symbol name("asIEEEBV");
- return m_manager->mk_func_decl(name, 1, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
-}
-
-func_decl * float_decl_plugin::mk_from3bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (arity != 3)
- m_manager->raise_exception("invalid number of arguments to fp");
- if (!is_sort_of(domain[0], m_bv_fid, BV_SORT) ||
- !is_sort_of(domain[1], m_bv_fid, BV_SORT) ||
- !is_sort_of(domain[2], m_bv_fid, BV_SORT))
- m_manager->raise_exception("sort mismatch");
-
- sort * fp = mk_float_sort(domain[1]->get_parameter(0).get_int(), domain[2]->get_parameter(0).get_int() + 1);
- symbol name("fp");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_to_ubv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- if (!m_bv_plugin)
- m_manager->raise_exception("to_fp_unsigned unsupported; use a logic with BV support");
- if (arity != 2)
- m_manager->raise_exception("invalid number of arguments to to_fp_unsigned");
- if (is_rm_sort(domain[0]))
- m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
- if (!is_sort_of(domain[1], m_bv_fid, BV_SORT))
- m_manager->raise_exception("sort mismatch, expected second argument of BV sort");
-
- sort * fp = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
- symbol name("fp.t_ubv");
- return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k));
-}
-
-func_decl * float_decl_plugin::mk_to_sbv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- NOT_IMPLEMENTED_YET();
-}
-
-func_decl * float_decl_plugin::mk_to_real(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- NOT_IMPLEMENTED_YET();
-}
-
-func_decl * float_decl_plugin::mk_func_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range) {
- switch (k) {
- case OP_TO_FLOAT:
- return mk_to_float(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_MINUS_INF:
- case OP_FLOAT_PLUS_INF:
- case OP_FLOAT_NAN:
- return mk_float_const_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_RM_NEAREST_TIES_TO_EVEN:
- case OP_RM_NEAREST_TIES_TO_AWAY:
- case OP_RM_TOWARD_POSITIVE:
- case OP_RM_TOWARD_NEGATIVE:
- case OP_RM_TOWARD_ZERO:
- return mk_rm_const_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_EQ:
- case OP_FLOAT_LT:
- case OP_FLOAT_GT:
- case OP_FLOAT_LE:
- case OP_FLOAT_GE:
- return mk_bin_rel_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_IS_ZERO:
- case OP_FLOAT_IS_NZERO:
- case OP_FLOAT_IS_PZERO:
- case OP_FLOAT_IS_NEGATIVE:
- case OP_FLOAT_IS_POSITIVE:
- case OP_FLOAT_IS_NAN:
- case OP_FLOAT_IS_INF:
- case OP_FLOAT_IS_NORMAL:
- case OP_FLOAT_IS_SUBNORMAL:
- return mk_unary_rel_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_ABS:
- case OP_FLOAT_NEG:
- return mk_unary_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_REM:
- case OP_FLOAT_MIN:
- case OP_FLOAT_MAX:
- return mk_binary_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_ADD:
- case OP_FLOAT_MUL:
- case OP_FLOAT_DIV:
- return mk_rm_binary_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_SUB:
- if (arity == 1)
- return mk_unary_decl(OP_FLOAT_NEG, num_parameters, parameters, arity, domain, range);
- else
- return mk_rm_binary_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_SQRT:
- case OP_FLOAT_ROUND_TO_INTEGRAL:
- return mk_rm_unary_decl(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_FMA:
- return mk_fma(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_TO_IEEE_BV:
- return mk_float_to_ieee_bv(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_FP:
- return mk_from3bv(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_TO_UBV:
- return mk_to_ubv(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_TO_SBV:
- return mk_to_sbv(k, num_parameters, parameters, arity, domain, range);
- case OP_FLOAT_TO_REAL:
- return mk_to_real(k, num_parameters, parameters, arity, domain, range);
- default:
- m_manager->raise_exception("unsupported floating point operator");
- return 0;
- }
-}
-
-void float_decl_plugin::get_op_names(svector & op_names, symbol const & logic) {
- // These are the operators from the final draft of the SMT FloatingPoint standard
- op_names.push_back(builtin_name("+oo", OP_FLOAT_PLUS_INF));
- op_names.push_back(builtin_name("-oo", OP_FLOAT_MINUS_INF));
- op_names.push_back(builtin_name("+zero", OP_FLOAT_PLUS_ZERO));
- op_names.push_back(builtin_name("-zero", OP_FLOAT_MINUS_ZERO));
- op_names.push_back(builtin_name("NaN", OP_FLOAT_NAN));
-
- op_names.push_back(builtin_name("roundNearestTiesToEven", OP_RM_NEAREST_TIES_TO_EVEN));
- op_names.push_back(builtin_name("roundNearestTiesToAway", OP_RM_NEAREST_TIES_TO_AWAY));
- op_names.push_back(builtin_name("roundTowardPositive", OP_RM_TOWARD_POSITIVE));
- op_names.push_back(builtin_name("roundTowardNegative", OP_RM_TOWARD_NEGATIVE));
- op_names.push_back(builtin_name("roundTowardZero", OP_RM_TOWARD_ZERO));
-
- op_names.push_back(builtin_name("RNE", OP_RM_NEAREST_TIES_TO_EVEN));
- op_names.push_back(builtin_name("RNA", OP_RM_NEAREST_TIES_TO_AWAY));
- op_names.push_back(builtin_name("RTP", OP_RM_TOWARD_POSITIVE));
- op_names.push_back(builtin_name("RTN", OP_RM_TOWARD_NEGATIVE));
- op_names.push_back(builtin_name("RTZ", OP_RM_TOWARD_ZERO));
-
- op_names.push_back(builtin_name("fp.abs", OP_FLOAT_ABS));
- op_names.push_back(builtin_name("fp.neg", OP_FLOAT_NEG));
- op_names.push_back(builtin_name("fp.add", OP_FLOAT_ADD));
- op_names.push_back(builtin_name("fp.sub", OP_FLOAT_SUB));
- op_names.push_back(builtin_name("fp.mul", OP_FLOAT_MUL));
- op_names.push_back(builtin_name("fp.div", OP_FLOAT_DIV));
- op_names.push_back(builtin_name("fp.fma", OP_FLOAT_FMA));
- op_names.push_back(builtin_name("fp.sqrt", OP_FLOAT_SQRT));
- op_names.push_back(builtin_name("fp.rem", OP_FLOAT_REM));
- op_names.push_back(builtin_name("fp.roundToIntegral", OP_FLOAT_ROUND_TO_INTEGRAL));
- op_names.push_back(builtin_name("fp.min", OP_FLOAT_MIN));
- op_names.push_back(builtin_name("fp.max", OP_FLOAT_MAX));
- op_names.push_back(builtin_name("fp.leq", OP_FLOAT_LE));
- op_names.push_back(builtin_name("fp.lt", OP_FLOAT_LT));
- op_names.push_back(builtin_name("fp.geq", OP_FLOAT_GE));
- op_names.push_back(builtin_name("fp.gt", OP_FLOAT_GT));
- op_names.push_back(builtin_name("fp.eq", OP_FLOAT_EQ));
-
- op_names.push_back(builtin_name("fp.isNormal", OP_FLOAT_IS_NORMAL));
- op_names.push_back(builtin_name("fp.isSubnormal", OP_FLOAT_IS_SUBNORMAL));
- op_names.push_back(builtin_name("fp.isZero", OP_FLOAT_IS_ZERO));
- op_names.push_back(builtin_name("fp.isInfinite", OP_FLOAT_IS_INF));
- op_names.push_back(builtin_name("fp.isNaN", OP_FLOAT_IS_NAN));
- op_names.push_back(builtin_name("fp.isNegative", OP_FLOAT_IS_NEGATIVE));
- op_names.push_back(builtin_name("fp.isPositive", OP_FLOAT_IS_POSITIVE));
-
- op_names.push_back(builtin_name("fp", OP_FLOAT_FP));
- op_names.push_back(builtin_name("fp.to_ubv", OP_FLOAT_TO_UBV));
- op_names.push_back(builtin_name("fp.to_sbv", OP_FLOAT_TO_SBV));
-
- op_names.push_back(builtin_name("to_fp", OP_TO_FLOAT));
-}
-
-void float_decl_plugin::get_sort_names(svector & sort_names, symbol const & logic) {
- sort_names.push_back(builtin_name("FloatingPoint", FLOAT_SORT));
- sort_names.push_back(builtin_name("RoundingMode", ROUNDING_MODE_SORT));
-
- // The final theory supports three common FloatingPoint sorts
- sort_names.push_back(builtin_name("Float16", FLOAT16_SORT));
- sort_names.push_back(builtin_name("Float32", FLOAT32_SORT));
- sort_names.push_back(builtin_name("Float64", FLOAT64_SORT));
- sort_names.push_back(builtin_name("Float128", FLOAT128_SORT));
-}
-
-expr * float_decl_plugin::get_some_value(sort * s) {
- SASSERT(s->is_sort_of(m_family_id, FLOAT_SORT));
- mpf tmp;
- m_fm.mk_nan(s->get_parameter(0).get_int(), s->get_parameter(1).get_int(), tmp);
- expr * res = this->mk_value(tmp);
- m_fm.del(tmp);
- return res;
-}
-
-bool float_decl_plugin::is_value(app * e) const {
- if (e->get_family_id() != m_family_id)
- return false;
- switch (e->get_decl_kind()) {
- case OP_RM_NEAREST_TIES_TO_EVEN:
- case OP_RM_NEAREST_TIES_TO_AWAY:
- case OP_RM_TOWARD_POSITIVE:
- case OP_RM_TOWARD_NEGATIVE:
- case OP_RM_TOWARD_ZERO:
- case OP_FLOAT_VALUE:
- case OP_FLOAT_PLUS_INF:
- case OP_FLOAT_MINUS_INF:
- case OP_FLOAT_PLUS_ZERO:
- case OP_FLOAT_MINUS_ZERO:
- case OP_FLOAT_NAN:
- return true;
- case OP_TO_FLOAT:
- return m_manager->is_value(e->get_arg(0));
- default:
- return false;
- }
-}
-
-float_util::float_util(ast_manager & m):
- m_manager(m),
- m_fid(m.mk_family_id("float")),
- m_a_util(m) {
- m_plugin = static_cast(m.get_plugin(m_fid));
-}
-
-float_util::~float_util() {
-}
-
-sort * float_util::mk_float_sort(unsigned ebits, unsigned sbits) {
- parameter ps[2] = { parameter(ebits), parameter(sbits) };
- return m().mk_sort(m_fid, FLOAT_SORT, 2, ps);
-}
-
-unsigned float_util::get_ebits(sort * s) {
- SASSERT(is_float(s));
- return static_cast(s->get_parameter(0).get_int());
-}
-
-unsigned float_util::get_sbits(sort * s) {
- SASSERT(is_float(s));
- return static_cast(s->get_parameter(1).get_int());
-}
-
-app * float_util::mk_nan(unsigned ebits, unsigned sbits) {
- scoped_mpf v(fm());
- fm().mk_nan(ebits, sbits, v);
- return mk_value(v);
-}
-
-app * float_util::mk_plus_inf(unsigned ebits, unsigned sbits) {
- scoped_mpf v(fm());
- fm().mk_pinf(ebits, sbits, v);
- return mk_value(v);
-}
-
-app * float_util::mk_minus_inf(unsigned ebits, unsigned sbits) {
- scoped_mpf v(fm());
- fm().mk_ninf(ebits, sbits, v);
- return mk_value(v);
-}
-
-app * float_util::mk_pzero(unsigned ebits, unsigned sbits) {
- scoped_mpf v(fm());
- fm().mk_pzero(ebits, sbits, v);
- return mk_value(v);
-}
-
-app * float_util::mk_nzero(unsigned ebits, unsigned sbits) {
- scoped_mpf v(fm());
- fm().mk_nzero(ebits, sbits, v);
- return mk_value(v);
-}
-
diff --git a/src/ast/float_decl_plugin.h b/src/ast/float_decl_plugin.h
deleted file mode 100644
index c7ec04932..000000000
--- a/src/ast/float_decl_plugin.h
+++ /dev/null
@@ -1,284 +0,0 @@
-/*++
-Copyright (c) 2012 Microsoft Corporation
-
-Module Name:
-
- float_decl_plugin.h
-
-Abstract:
-
- Floating point decl plugin
-
-Author:
-
- Leonardo de Moura (leonardo) 2012-01-15.
-
-Revision History:
-
---*/
-#ifndef _FLOAT_DECL_PLUGIN_H_
-#define _FLOAT_DECL_PLUGIN_H_
-
-#include"ast.h"
-#include"id_gen.h"
-#include"arith_decl_plugin.h"
-#include"bv_decl_plugin.h"
-#include"mpf.h"
-
-enum float_sort_kind {
- FLOAT_SORT,
- ROUNDING_MODE_SORT,
- FLOAT16_SORT,
- FLOAT32_SORT,
- FLOAT64_SORT,
- FLOAT128_SORT
-};
-
-enum float_op_kind {
- OP_RM_NEAREST_TIES_TO_EVEN,
- OP_RM_NEAREST_TIES_TO_AWAY,
- OP_RM_TOWARD_POSITIVE,
- OP_RM_TOWARD_NEGATIVE,
- OP_RM_TOWARD_ZERO,
-
- OP_FLOAT_VALUE,
- OP_FLOAT_PLUS_INF,
- OP_FLOAT_MINUS_INF,
- OP_FLOAT_NAN,
- OP_FLOAT_PLUS_ZERO,
- OP_FLOAT_MINUS_ZERO,
-
- OP_FLOAT_ADD,
- OP_FLOAT_SUB,
- OP_FLOAT_NEG,
- OP_FLOAT_MUL,
- OP_FLOAT_DIV,
- OP_FLOAT_REM,
- OP_FLOAT_ABS,
- OP_FLOAT_MIN,
- OP_FLOAT_MAX,
- OP_FLOAT_FMA, // x*y + z
- OP_FLOAT_SQRT,
- OP_FLOAT_ROUND_TO_INTEGRAL,
-
- OP_FLOAT_EQ,
- OP_FLOAT_LT,
- OP_FLOAT_GT,
- OP_FLOAT_LE,
- OP_FLOAT_GE,
- OP_FLOAT_IS_NAN,
- OP_FLOAT_IS_INF,
- OP_FLOAT_IS_ZERO,
- OP_FLOAT_IS_NORMAL,
- OP_FLOAT_IS_SUBNORMAL,
- OP_FLOAT_IS_PZERO,
- OP_FLOAT_IS_NZERO,
- OP_FLOAT_IS_NEGATIVE,
- OP_FLOAT_IS_POSITIVE,
-
- OP_TO_FLOAT,
- OP_FLOAT_TO_IEEE_BV,
-
- OP_FLOAT_FP,
- OP_FLOAT_TO_FP,
- OP_FLOAT_TO_UBV,
- OP_FLOAT_TO_SBV,
- OP_FLOAT_TO_REAL,
-
- LAST_FLOAT_OP
-};
-
-class float_decl_plugin : public decl_plugin {
- struct mpf_hash_proc {
- scoped_mpf_vector const & m_values;
- mpf_hash_proc(scoped_mpf_vector const & values):m_values(values) {}
- unsigned operator()(unsigned id) const { return m_values.m().hash(m_values[id]); }
- };
-
- struct mpf_eq_proc {
- scoped_mpf_vector const & m_values;
- mpf_eq_proc(scoped_mpf_vector const & values):m_values(values) {}
- bool operator()(unsigned id1, unsigned id2) const { return m_values.m().eq_core(m_values[id1], m_values[id2]); }
- };
-
- typedef chashtable value_table;
-
-
- mpf_manager m_fm;
- id_gen m_id_gen;
- scoped_mpf_vector m_values;
- value_table m_value_table;
- sort * m_real_sort;
- sort * m_int_sort;
- family_id m_bv_fid;
- bv_decl_plugin * m_bv_plugin;
-
- sort * mk_float_sort(unsigned ebits, unsigned sbits);
- sort * mk_rm_sort();
- func_decl * mk_rm_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_float_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_bin_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_unary_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_rm_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_rm_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_fma(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_to_float(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_float_to_ieee_bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_from3bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_to_ubv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_to_sbv(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- func_decl * mk_to_real(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
-
- virtual void set_manager(ast_manager * m, family_id id);
- unsigned mk_id(mpf const & v);
- void recycled_id(unsigned id);
-public:
- float_decl_plugin();
-
- bool is_float_sort(sort * s) const { return is_sort_of(s, m_family_id, FLOAT_SORT); }
- bool is_rm_sort(sort * s) const { return is_sort_of(s, m_family_id, ROUNDING_MODE_SORT); }
-
- virtual ~float_decl_plugin();
- virtual void finalize();
-
- virtual decl_plugin * mk_fresh();
- virtual sort * mk_sort(decl_kind k, unsigned num_parameters, parameter const * parameters);
- virtual func_decl * mk_func_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
- unsigned arity, sort * const * domain, sort * range);
- virtual void get_op_names(svector & op_names, symbol const & logic);
- virtual void get_sort_names(svector & sort_names, symbol const & logic);
- virtual expr * get_some_value(sort * s);
- virtual bool is_value(app* e) const;
- virtual bool is_unique_value(app* e) const { return is_value(e); }
-
- mpf_manager & fm() { return m_fm; }
- func_decl * mk_value_decl(mpf const & v);
- app * mk_value(mpf const & v);
- bool is_value(expr * n) { return is_app_of(n, m_family_id, OP_FLOAT_VALUE); }
- bool is_value(expr * n, mpf & val);
- bool is_rm_value(expr * n, mpf_rounding_mode & val);
- bool is_rm_value(expr * n) { mpf_rounding_mode t; return is_rm_value(n, t); }
-
- mpf const & get_value(unsigned id) const {
- SASSERT(m_value_table.contains(id));
- return m_values[id];
- }
-
- virtual void del(parameter const & p);
- virtual parameter translate(parameter const & p, decl_plugin & target);
-};
-
-class float_util {
- ast_manager & m_manager;
- float_decl_plugin * m_plugin;
- family_id m_fid;
- arith_util m_a_util;
-public:
- float_util(ast_manager & m);
- ~float_util();
-
- ast_manager & m() const { return m_manager; }
- mpf_manager & fm() const { return m_plugin->fm(); }
- family_id get_fid() const { return m_fid; }
- family_id get_family_id() const { return m_fid; }
- arith_util & au() { return m_a_util; }
- float_decl_plugin & plugin() { return *m_plugin; }
-
- sort * mk_float_sort(unsigned ebits, unsigned sbits);
- sort * mk_rm_sort() { return m().mk_sort(m_fid, ROUNDING_MODE_SORT); }
- bool is_float(sort * s) { return is_sort_of(s, m_fid, FLOAT_SORT); }
- bool is_rm(sort * s) { return is_sort_of(s, m_fid, ROUNDING_MODE_SORT); }
- bool is_float(expr * e) { return is_float(m_manager.get_sort(e)); }
- bool is_rm(expr * e) { return is_rm(m_manager.get_sort(e)); }
- unsigned get_ebits(sort * s);
- unsigned get_sbits(sort * s);
-
- app * mk_round_nearest_ties_to_even() { return m().mk_const(m_fid, OP_RM_NEAREST_TIES_TO_EVEN); }
- app * mk_round_nearest_ties_to_away() { return m().mk_const(m_fid, OP_RM_NEAREST_TIES_TO_AWAY); }
- app * mk_round_toward_positive() { return m().mk_const(m_fid, OP_RM_TOWARD_POSITIVE); }
- app * mk_round_toward_negative() { return m().mk_const(m_fid, OP_RM_TOWARD_NEGATIVE); }
- app * mk_round_toward_zero() { return m().mk_const(m_fid, OP_RM_TOWARD_ZERO); }
-
- app * mk_nan(unsigned ebits, unsigned sbits);
- app * mk_plus_inf(unsigned ebits, unsigned sbits);
- app * mk_minus_inf(unsigned ebits, unsigned sbits);
- app * mk_nan(sort * s) { return mk_nan(get_ebits(s), get_sbits(s)); }
- app * mk_plus_inf(sort * s) { return mk_plus_inf(get_ebits(s), get_sbits(s)); }
- app * mk_minus_inf(sort * s) { return mk_minus_inf(get_ebits(s), get_sbits(s)); }
-
- app * mk_value(mpf const & v) { return m_plugin->mk_value(v); }
- bool is_value(expr * n) { return m_plugin->is_value(n); }
- bool is_value(expr * n, mpf & v) { return m_plugin->is_value(n, v); }
- bool is_rm_value(expr * n, mpf_rounding_mode & v) { return m_plugin->is_rm_value(n, v); }
-
- app * mk_pzero(unsigned ebits, unsigned sbits);
- app * mk_nzero(unsigned ebits, unsigned sbits);
- app * mk_pzero(sort * s) { return mk_pzero(get_ebits(s), get_sbits(s)); }
- app * mk_nzero(sort * s) { return mk_nzero(get_ebits(s), get_sbits(s)); }
-
- bool is_nan(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_nan(v); }
- bool is_plus_inf(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_pinf(v); }
- bool is_minus_inf(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_ninf(v); }
- bool is_zero(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_zero(v); }
- bool is_pzero(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_pzero(v); }
- bool is_nzero(expr * n) { scoped_mpf v(fm()); return is_value(n, v) && fm().is_nzero(v); }
-
- bool is_to_float(expr * n) { return is_app_of(n, m_fid, OP_TO_FLOAT); }
-
- app * mk_to_float(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_TO_FLOAT, arg1, arg2); }
- app * mk_add(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FLOAT_ADD, arg1, arg2, arg3); }
- app * mk_mul(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FLOAT_MUL, arg1, arg2, arg3); }
- app * mk_sub(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FLOAT_SUB, arg1, arg2, arg3); }
- app * mk_div(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FLOAT_DIV, arg1, arg2, arg3); }
- app * mk_neg(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_NEG, arg1); }
- app * mk_rem(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_REM, arg1, arg2); }
- app * mk_max(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_MAX, arg1, arg2); }
- app * mk_min(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_MIN, arg1, arg2); }
- app * mk_abs(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_ABS, arg1); }
- app * mk_sqrt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_SQRT, arg1, arg2); }
- app * mk_round(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_ROUND_TO_INTEGRAL, arg1, arg2); }
- app * mk_fma(expr * arg1, expr * arg2, expr * arg3, expr * arg4) {
- expr * args[4] = { arg1, arg2, arg3, arg4 };
- return m().mk_app(m_fid, OP_FLOAT_FMA, 4, args);
- }
-
- app * mk_float_eq(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_EQ, arg1, arg2); }
- app * mk_lt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_LT, arg1, arg2); }
- app * mk_gt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_GT, arg1, arg2); }
- app * mk_le(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_LE, arg1, arg2); }
- app * mk_ge(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FLOAT_GE, arg1, arg2); }
-
- app * mk_is_nan(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_NAN, arg1); }
- app * mk_is_inf(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_INF, arg1); }
- app * mk_is_zero(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_ZERO, arg1); }
- app * mk_is_normal(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_NORMAL, arg1); }
- app * mk_is_subnormal(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_SUBNORMAL, arg1); }
- app * mk_is_nzero(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_NZERO, arg1); }
- app * mk_is_pzero(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_PZERO, arg1); }
- app * mk_is_sign_minus(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_NEGATIVE, arg1); }
- app * mk_is_positive(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_POSITIVE, arg1); }
- app * mk_is_negative(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_IS_NEGATIVE, arg1); }
-
- bool is_neg(expr * a) { return is_app_of(a, m_fid, OP_FLOAT_NEG); }
-
- app * mk_float_to_ieee_bv(expr * arg1) { return m().mk_app(m_fid, OP_FLOAT_TO_IEEE_BV, arg1); }
-};
-
-#endif
diff --git a/src/ast/fpa/fpa2bv_converter.cpp b/src/ast/fpa/fpa2bv_converter.cpp
index c23de3bfa..bdaf2017e 100644
--- a/src/ast/fpa/fpa2bv_converter.cpp
+++ b/src/ast/fpa/fpa2bv_converter.cpp
@@ -16,8 +16,11 @@ Author:
Notes:
--*/
+#include
+
#include"ast_smt2_pp.h"
#include"well_sorted.h"
+#include"th_rewriter.h"
#include"fpa2bv_converter.h"
@@ -32,34 +35,23 @@ fpa2bv_converter::fpa2bv_converter(ast_manager & m) :
m_arith_util(m),
m_mpf_manager(m_util.fm()),
m_mpz_manager(m_mpf_manager.mpz_manager()),
- extra_assertions(m) {
- m_plugin = static_cast(m.get_plugin(m.mk_family_id("float")));
+ m_hi_fp_unspecified(true),
+ m_extra_assertions(m) {
+ m_plugin = static_cast(m.get_plugin(m.mk_family_id("fpa")));
}
fpa2bv_converter::~fpa2bv_converter() {
- dec_ref_map_key_values(m, m_const2bv);
- dec_ref_map_key_values(m, m_rm_const2bv);
- dec_ref_map_key_values(m, m_uf2bvuf);
-
- obj_map::iterator it = m_uf23bvuf.begin();
- obj_map::iterator end = m_uf23bvuf.end();
- for (; it != end; ++it) {
- m.dec_ref(it->m_key);
- m.dec_ref(it->m_value.f_sgn);
- m.dec_ref(it->m_value.f_sig);
- m.dec_ref(it->m_value.f_exp);
- }
- m_uf23bvuf.reset();
+ reset();
}
void fpa2bv_converter::mk_eq(expr * a, expr * b, expr_ref & result) {
- SASSERT(is_app_of(a, m_plugin->get_family_id(), OP_TO_FLOAT));
- SASSERT(is_app_of(b, m_plugin->get_family_id(), OP_TO_FLOAT));
+ SASSERT(is_app_of(a, m_plugin->get_family_id(), OP_FPA_FP));
+ SASSERT(is_app_of(b, m_plugin->get_family_id(), OP_FPA_FP));
expr_ref sgn(m), s(m), e(m);
m_simp.mk_eq(to_app(a)->get_arg(0), to_app(b)->get_arg(0), sgn);
- m_simp.mk_eq(to_app(a)->get_arg(1), to_app(b)->get_arg(1), s);
- m_simp.mk_eq(to_app(a)->get_arg(2), to_app(b)->get_arg(2), e);
+ m_simp.mk_eq(to_app(a)->get_arg(1), to_app(b)->get_arg(1), e);
+ m_simp.mk_eq(to_app(a)->get_arg(2), to_app(b)->get_arg(2), s);
// The SMT FPA theory asks for _one_ NaN value, but the bit-blasting
// has many, like IEEE754. This encoding of equality makes it look like
@@ -73,18 +65,23 @@ void fpa2bv_converter::mk_eq(expr * a, expr * b, expr_ref & result) {
}
void fpa2bv_converter::mk_ite(expr * c, expr * t, expr * f, expr_ref & result) {
- SASSERT(is_app_of(t, m_plugin->get_family_id(), OP_TO_FLOAT));
- SASSERT(is_app_of(f, m_plugin->get_family_id(), OP_TO_FLOAT));
+ SASSERT(is_app_of(t, m_plugin->get_family_id(), OP_FPA_FP));
+ SASSERT(is_app_of(f, m_plugin->get_family_id(), OP_FPA_FP));
+
+ expr *t_sgn, *t_sig, *t_exp;
+ expr *f_sgn, *f_sig, *f_exp;
+ split_fp(t, t_sgn, t_exp, t_sig);
+ split_fp(f, f_sgn, f_exp, f_sig);
expr_ref sgn(m), s(m), e(m);
- m_simp.mk_ite(c, to_app(t)->get_arg(0), to_app(f)->get_arg(0), sgn);
- m_simp.mk_ite(c, to_app(t)->get_arg(1), to_app(f)->get_arg(1), s);
- m_simp.mk_ite(c, to_app(t)->get_arg(2), to_app(f)->get_arg(2), e);
+ m_simp.mk_ite(c, t_sgn, f_sgn, sgn);
+ m_simp.mk_ite(c, t_sig, f_sig, s);
+ m_simp.mk_ite(c, t_exp, f_exp, e);
- mk_triple(sgn, s, e, result);
+ mk_fp(sgn, e, s, result);
}
-void fpa2bv_converter::mk_value(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+void fpa2bv_converter::mk_numeral(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
SASSERT(num == 0);
SASSERT(f->get_num_parameters() == 1);
SASSERT(f->get_parameter(0).is_external());
@@ -103,9 +100,9 @@ void fpa2bv_converter::mk_value(func_decl * f, unsigned num, expr * const * args
mk_nan(f, result);
else if (m_util.fm().is_inf(v)) {
if (m_util.fm().sgn(v))
- mk_minus_inf(f, result);
+ mk_ninf(f, result);
else
- mk_plus_inf(f, result);
+ mk_pinf(f, result);
}
else {
expr_ref bv_sgn(m), bv_sig(m), e(m), biased_exp(m);
@@ -115,13 +112,17 @@ void fpa2bv_converter::mk_value(func_decl * f, unsigned num, expr * const * args
mk_bias(e, biased_exp);
- mk_triple(bv_sgn, bv_sig, biased_exp, result);
+ mk_fp(bv_sgn, biased_exp, bv_sig, result);
TRACE("fpa2bv_dbg", tout << "value of [" << sign << " " << m_mpz_manager.to_string(sig) << " " << exp << "] is "
<< mk_ismt2_pp(result, m) << std::endl;);
}
}
+app * fpa2bv_converter::mk_fresh_const(char const * prefix, unsigned sz) {
+ return m.mk_fresh_const(prefix, m_bv_util.mk_sort(sz));
+}
+
void fpa2bv_converter::mk_const(func_decl * f, expr_ref & result) {
SASSERT(f->get_family_id() == null_family_id);
SASSERT(f->get_arity() == 0);
@@ -134,25 +135,20 @@ void fpa2bv_converter::mk_const(func_decl * f, expr_ref & result) {
SASSERT(is_float(srt));
unsigned ebits = m_util.get_ebits(srt);
unsigned sbits = m_util.get_sbits(srt);
-
- expr_ref sgn(m), s(m), e(m);
+
+ app_ref sgn(m), s(m), e(m);
#ifdef Z3DEBUG
- sort_ref s_sgn(m), s_sig(m), s_exp(m);
- s_sgn = m_bv_util.mk_sort(1);
- s_sig = m_bv_util.mk_sort(sbits - 1);
- s_exp = m_bv_util.mk_sort(ebits);
-
std::string p("fpa2bv");
std::string name = f->get_name().str();
-
- sgn = m.mk_fresh_const((p + "_sgn_" + name).c_str(), s_sgn);
- s = m.mk_fresh_const((p + "_sig_" + name).c_str(), s_sig);
- e = m.mk_fresh_const((p + "_exp_" + name).c_str(), s_exp);
+
+ sgn = mk_fresh_const((p + "_sgn_" + name).c_str(), 1);
+ s = mk_fresh_const((p + "_sig_" + name).c_str(), sbits - 1);
+ e = mk_fresh_const((p + "_exp_" + name).c_str(), ebits);
#else
- expr_ref bv(m);
+ app_ref bv(m);
unsigned bv_sz = 1 + ebits + (sbits - 1);
- bv = m.mk_fresh_const(0, m_bv_util.mk_sort(bv_sz));
+ bv = mk_fresh_const(0, bv_sz);
sgn = m_bv_util.mk_extract(bv_sz - 1, bv_sz - 1, bv);
e = m_bv_util.mk_extract(bv_sz - 2, sbits - 1, bv);
@@ -163,7 +159,7 @@ void fpa2bv_converter::mk_const(func_decl * f, expr_ref & result) {
SASSERT(m_bv_util.get_bv_size(e) == ebits);
#endif
- mk_triple(sgn, s, e, result);
+ mk_fp(sgn, e, s, result);
m_const2bv.insert(f, result);
m.inc_ref(f);
@@ -182,7 +178,7 @@ void fpa2bv_converter::mk_var(unsigned base_inx, sort * srt, expr_ref & result)
s = m.mk_var(base_inx + 1, m_bv_util.mk_sort(sbits-1));
e = m.mk_var(base_inx + 2, m_bv_util.mk_sort(ebits));
- mk_triple(sgn, s, e, result);
+ mk_fp(sgn, e, s, result);
}
void fpa2bv_converter::mk_uninterpreted_function(func_decl * f, unsigned num, expr * const * args, expr_ref & result)
@@ -196,7 +192,7 @@ void fpa2bv_converter::mk_uninterpreted_function(func_decl * f, unsigned num, ex
if (is_float(args[i]))
{
expr * sgn, * sig, * exp;
- split(args[i], sgn, sig, exp);
+ split_fp(args[i], sgn, exp, sig);
new_args.push_back(sgn);
new_args.push_back(sig);
new_args.push_back(exp);
@@ -215,7 +211,7 @@ void fpa2bv_converter::mk_uninterpreted_function(func_decl * f, unsigned num, ex
a_sgn = m.mk_app(fd3.f_sgn, new_args.size(), new_args.c_ptr());
a_sig = m.mk_app(fd3.f_sig, new_args.size(), new_args.c_ptr());
a_exp = m.mk_app(fd3.f_exp, new_args.size(), new_args.c_ptr());
- mk_triple(a_sgn, a_sig, a_exp, result);
+ mk_fp(a_sgn, a_exp, a_sig, result);
}
else {
sort_ref_buffer new_domain(m);
@@ -261,7 +257,7 @@ void fpa2bv_converter::mk_uninterpreted_function(func_decl * f, unsigned num, ex
m.inc_ref(f_sgn);
m.inc_ref(f_sig);
m.inc_ref(f_exp);
- mk_triple(a_sgn, a_sig, a_exp, result);
+ mk_fp(a_sgn, a_exp, a_sig, result);
}
}
@@ -294,34 +290,34 @@ void fpa2bv_converter::mk_rm_const(func_decl * f, expr_ref & result) {
expr_ref rcc(m);
rcc = bu().mk_ule(result, bu().mk_numeral(4, 3));
- extra_assertions.push_back(rcc);
+ m_extra_assertions.push_back(rcc);
}
}
-void fpa2bv_converter::mk_plus_inf(func_decl * f, expr_ref & result) {
+void fpa2bv_converter::mk_pinf(func_decl * f, expr_ref & result) {
sort * srt = f->get_range();
SASSERT(is_float(srt));
unsigned sbits = m_util.get_sbits(srt);
unsigned ebits = m_util.get_ebits(srt);
expr_ref top_exp(m);
mk_top_exp(ebits, top_exp);
- mk_triple(m_bv_util.mk_numeral(0, 1),
- m_bv_util.mk_numeral(0, sbits-1),
- top_exp,
- result);
+ mk_fp(m_bv_util.mk_numeral(0, 1),
+ top_exp,
+ m_bv_util.mk_numeral(0, sbits-1),
+ result);
}
-void fpa2bv_converter::mk_minus_inf(func_decl * f, expr_ref & result) {
+void fpa2bv_converter::mk_ninf(func_decl * f, expr_ref & result) {
sort * srt = f->get_range();
SASSERT(is_float(srt));
unsigned sbits = m_util.get_sbits(srt);
unsigned ebits = m_util.get_ebits(srt);
expr_ref top_exp(m);
mk_top_exp(ebits, top_exp);
- mk_triple(m_bv_util.mk_numeral(1, 1),
- m_bv_util.mk_numeral(0, sbits-1),
- top_exp,
- result);
+ mk_fp(m_bv_util.mk_numeral(1, 1),
+ top_exp,
+ m_bv_util.mk_numeral(0, sbits-1),
+ result);
}
void fpa2bv_converter::mk_nan(func_decl * f, expr_ref & result) {
@@ -331,10 +327,10 @@ void fpa2bv_converter::mk_nan(func_decl * f, expr_ref & result) {
unsigned ebits = m_util.get_ebits(srt);
expr_ref top_exp(m);
mk_top_exp(ebits, top_exp);
- mk_triple(m_bv_util.mk_numeral(0, 1),
- m_bv_util.mk_numeral(1, sbits-1),
- top_exp,
- result);
+ mk_fp(m_bv_util.mk_numeral(0, 1),
+ top_exp,
+ m_bv_util.mk_numeral(1, sbits-1),
+ result);
}
void fpa2bv_converter::mk_nzero(func_decl *f, expr_ref & result) {
@@ -344,10 +340,10 @@ void fpa2bv_converter::mk_nzero(func_decl *f, expr_ref & result) {
unsigned ebits = m_util.get_ebits(srt);
expr_ref bot_exp(m);
mk_bot_exp(ebits, bot_exp);
- mk_triple(m_bv_util.mk_numeral(1, 1),
- m_bv_util.mk_numeral(0, sbits-1),
- bot_exp,
- result);
+ mk_fp(m_bv_util.mk_numeral(1, 1),
+ bot_exp,
+ m_bv_util.mk_numeral(0, sbits - 1),
+ result);
}
void fpa2bv_converter::mk_pzero(func_decl *f, expr_ref & result) {
@@ -357,10 +353,10 @@ void fpa2bv_converter::mk_pzero(func_decl *f, expr_ref & result) {
unsigned ebits = m_util.get_ebits(srt);
expr_ref bot_exp(m);
mk_bot_exp(ebits, bot_exp);
- mk_triple(m_bv_util.mk_numeral(0, 1),
- m_bv_util.mk_numeral(0, sbits-1),
- bot_exp,
- result);
+ mk_fp(m_bv_util.mk_numeral(0, 1),
+ bot_exp,
+ m_bv_util.mk_numeral(0, sbits-1),
+ result);
}
void fpa2bv_converter::add_core(unsigned sbits, unsigned ebits, expr_ref & rm,
@@ -612,13 +608,13 @@ void fpa2bv_converter::mk_sub(func_decl * f, unsigned num, expr * const * args,
void fpa2bv_converter::mk_neg(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
SASSERT(num == 1);
expr * sgn, * s, * e;
- split(args[0], sgn, s, e);
+ split_fp(args[0], sgn, e, s);
expr_ref c(m), nsgn(m);
mk_is_nan(args[0], c);
nsgn = m_bv_util.mk_bv_not(sgn);
expr_ref r_sgn(m);
m_simp.mk_ite(c, sgn, nsgn, r_sgn);
- mk_triple(r_sgn, s, e, result);
+ mk_fp(r_sgn, e, s, result);
}
void fpa2bv_converter::mk_mul(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
@@ -633,8 +629,8 @@ void fpa2bv_converter::mk_mul(func_decl * f, unsigned num, expr * const * args,
mk_nan(f, nan);
mk_nzero(f, nzero);
mk_pzero(f, pzero);
- mk_minus_inf(f, ninf);
- mk_plus_inf(f, pinf);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
expr_ref x_is_nan(m), x_is_zero(m), x_is_pos(m), x_is_inf(m);
expr_ref y_is_nan(m), y_is_zero(m), y_is_pos(m), y_is_inf(m);
@@ -693,10 +689,8 @@ void fpa2bv_converter::mk_mul(func_decl * f, unsigned num, expr * const * args,
m_simp.mk_xor(x_is_pos, y_is_pos, sign_xor);
mk_ite(sign_xor, nzero, pzero, v6);
- // else comes the actual multiplication.
- unsigned ebits = m_util.get_ebits(f->get_range());
- unsigned sbits = m_util.get_sbits(f->get_range());
- SASSERT(ebits <= sbits);
+ // else comes the actual multiplication.
+ unsigned sbits = m_util.get_sbits(f->get_range());
expr_ref a_sgn(m), a_sig(m), a_exp(m), a_lz(m), b_sgn(m), b_sig(m), b_exp(m), b_lz(m);
unpack(x, a_sgn, a_sig, a_exp, a_lz, true);
@@ -781,8 +775,8 @@ void fpa2bv_converter::mk_div(func_decl * f, unsigned num, expr * const * args,
mk_nan(f, nan);
mk_nzero(f, nzero);
mk_pzero(f, pzero);
- mk_minus_inf(f, ninf);
- mk_plus_inf(f, pinf);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
expr_ref x_is_nan(m), x_is_zero(m), x_is_pos(m), x_is_inf(m);
expr_ref y_is_nan(m), y_is_zero(m), y_is_pos(m), y_is_inf(m);
@@ -927,8 +921,8 @@ void fpa2bv_converter::mk_rem(func_decl * f, unsigned num, expr * const * args,
mk_nan(f, nan);
mk_nzero(f, nzero);
mk_pzero(f, pzero);
- mk_minus_inf(f, ninf);
- mk_plus_inf(f, pinf);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
expr_ref x_is_nan(m), x_is_zero(m), x_is_pos(m), x_is_inf(m);
expr_ref y_is_nan(m), y_is_zero(m), y_is_pos(m), y_is_inf(m);
@@ -1033,8 +1027,8 @@ void fpa2bv_converter::mk_rem(func_decl * f, unsigned num, expr * const * args,
void fpa2bv_converter::mk_abs(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
SASSERT(num == 1);
expr * sgn, * s, * e;
- split(args[0], sgn, s, e);
- mk_triple(m_bv_util.mk_numeral(0, 1), s, e, result);
+ split_fp(args[0], sgn, e, s);
+ mk_fp(m_bv_util.mk_numeral(0, 1), e, s, result);
}
void fpa2bv_converter::mk_min(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
@@ -1044,8 +1038,8 @@ void fpa2bv_converter::mk_min(func_decl * f, unsigned num, expr * const * args,
expr * x_sgn, * x_sig, * x_exp;
expr * y_sgn, * y_sig, * y_exp;
- split(x, x_sgn, x_sig, x_exp);
- split(y, y_sgn, y_sig, y_exp);
+ split_fp(x, x_sgn, x_exp, x_sig);
+ split_fp(y, y_sgn, y_exp, y_sig);
expr_ref c1(m), c2(m), x_is_nan(m), y_is_nan(m), x_is_zero(m), y_is_zero(m), c1_and(m);
mk_is_zero(x, x_is_zero);
@@ -1077,7 +1071,7 @@ void fpa2bv_converter::mk_min(func_decl * f, unsigned num, expr * const * args,
m_simp.mk_ite(c2, x_exp, c3xy_exp, c2c3_exp);
m_simp.mk_ite(c1, y_exp, c2c3_exp, r_exp);
- mk_triple(r_sgn, r_sig, r_exp, result);
+ mk_fp(r_sgn, r_exp, r_sig, result);
}
void fpa2bv_converter::mk_max(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
@@ -1087,8 +1081,8 @@ void fpa2bv_converter::mk_max(func_decl * f, unsigned num, expr * const * args,
expr * x_sgn, * x_sig, * x_exp;
expr * y_sgn, * y_sig, * y_exp;
- split(x, x_sgn, x_sig, x_exp);
- split(y, y_sgn, y_sig, y_exp);
+ split_fp(x, x_sgn, x_exp, x_sig);
+ split_fp(y, y_sgn, y_exp, y_sig);
expr_ref c1(m), c2(m), x_is_nan(m), y_is_nan(m), y_is_zero(m), x_is_zero(m), c1_and(m);
mk_is_zero(y, y_is_zero);
@@ -1120,7 +1114,7 @@ void fpa2bv_converter::mk_max(func_decl * f, unsigned num, expr * const * args,
m_simp.mk_ite(c2, x_exp, c3xy_exp, c2c3_exp);
m_simp.mk_ite(c1, y_exp, c2c3_exp, r_exp);
- mk_triple(r_sgn, r_sig, r_exp, result);
+ mk_fp(r_sgn, r_exp, r_sig, result);
}
void fpa2bv_converter::mk_fma(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
@@ -1137,8 +1131,8 @@ void fpa2bv_converter::mk_fma(func_decl * f, unsigned num, expr * const * args,
mk_nan(f, nan);
mk_nzero(f, nzero);
mk_pzero(f, pzero);
- mk_minus_inf(f, ninf);
- mk_plus_inf(f, pinf);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
expr_ref x_is_nan(m), x_is_zero(m), x_is_pos(m), x_is_neg(m), x_is_inf(m);
expr_ref y_is_nan(m), y_is_zero(m), y_is_pos(m), y_is_neg(m), y_is_inf(m);
@@ -1225,11 +1219,9 @@ void fpa2bv_converter::mk_fma(func_decl * f, unsigned num, expr * const * args,
m_simp.mk_and(z_is_zero, m.mk_not(rm_is_to_neg), ite_c);
mk_ite(ite_c, pzero, z, v7);
-
// else comes the fused multiplication.
unsigned ebits = m_util.get_ebits(f->get_range());
unsigned sbits = m_util.get_sbits(f->get_range());
- SASSERT(ebits <= sbits);
expr_ref a_sgn(m), a_sig(m), a_exp(m), a_lz(m);
expr_ref b_sgn(m), b_sig(m), b_exp(m), b_lz(m);
@@ -1447,8 +1439,8 @@ void fpa2bv_converter::mk_sqrt(func_decl * f, unsigned num, expr * const * args,
mk_nan(f, nan);
mk_nzero(f, nzero);
mk_pzero(f, pzero);
- mk_minus_inf(f, ninf);
- mk_plus_inf(f, pinf);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
expr_ref x_is_nan(m), x_is_zero(m), x_is_pos(m), x_is_inf(m);
mk_is_nan(x, x_is_nan);
@@ -1482,7 +1474,6 @@ void fpa2bv_converter::mk_sqrt(func_decl * f, unsigned num, expr * const * args,
// else comes the actual square root.
unsigned ebits = m_util.get_ebits(f->get_range());
unsigned sbits = m_util.get_sbits(f->get_range());
- SASSERT(ebits <= sbits);
expr_ref a_sgn(m), a_sig(m), a_exp(m), a_lz(m);
unpack(x, a_sgn, a_sig, a_exp, a_lz, true);
@@ -1698,8 +1689,8 @@ void fpa2bv_converter::mk_float_eq(func_decl * f, unsigned num, expr * const * a
expr * x_sgn, * x_sig, * x_exp;
expr * y_sgn, * y_sig, * y_exp;
- split(x, x_sgn, x_sig, x_exp);
- split(y, y_sgn, y_sig, y_exp);
+ split_fp(x, x_sgn, x_exp, x_sig);
+ split_fp(y, y_sgn, y_exp, y_sig);
expr_ref x_eq_y_sgn(m), x_eq_y_exp(m), x_eq_y_sig(m);
m_simp.mk_eq(x_sgn, y_sgn, x_eq_y_sgn);
@@ -1734,8 +1725,8 @@ void fpa2bv_converter::mk_float_lt(func_decl * f, unsigned num, expr * const * a
expr * x_sgn, * x_sig, * x_exp;
expr * y_sgn, * y_sig, * y_exp;
- split(x, x_sgn, x_sig, x_exp);
- split(y, y_sgn, y_sig, y_exp);
+ split_fp(x, x_sgn, x_exp, x_sig);
+ split_fp(y, y_sgn, y_exp, y_sig);
expr_ref c3(m), t3(m), t4(m), one_1(m), nil_1(m);
one_1 = m_bv_util.mk_numeral(1, 1);
@@ -1858,68 +1849,12 @@ void fpa2bv_converter::mk_is_positive(func_decl * f, unsigned num, expr * const
result = m.mk_and(m.mk_not(t1), t2);
}
-void fpa2bv_converter::mk_to_float(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
- TRACE("fpa2bv_to_float", for (unsigned i=0; i < num; i++)
- tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl; );
+void fpa2bv_converter::mk_to_fp(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_fp", for (unsigned i=0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl; );
- if (num == 3 &&
- m_bv_util.is_bv(args[0]) &&
- m_bv_util.is_bv(args[1]) &&
- m_bv_util.is_bv(args[2])) {
- // Theoretically, the user could have thrown in it's own triple of bit-vectors.
- // Just keep it here, as there will be something else that uses it.
- mk_triple(args[0], args[1], args[2], result);
- }
- else if (num == 3 &&
- m_bv_util.is_bv(args[0]) &&
- m_arith_util.is_numeral(args[1]) &&
- m_arith_util.is_numeral(args[2]))
- {
- // Three arguments, some of them are not numerals.
- SASSERT(m_util.is_float(f->get_range()));
- unsigned ebits = m_util.get_ebits(f->get_range());
- unsigned sbits = m_util.get_sbits(f->get_range());
-
- expr * rm = args[0];
-
- rational q;
- if (!m_arith_util.is_numeral(args[1], q))
- NOT_IMPLEMENTED_YET();
-
- rational e;
- if (!m_arith_util.is_numeral(args[2], e))
- NOT_IMPLEMENTED_YET();
-
- SASSERT(e.is_int64());
- SASSERT(m_mpz_manager.eq(e.to_mpq().denominator(), 1));
-
- mpf nte, nta, tp, tn, tz;
- m_mpf_manager.set(nte, ebits, sbits, MPF_ROUND_NEAREST_TEVEN, q.to_mpq(), e.to_mpq().numerator());
- m_mpf_manager.set(nta, ebits, sbits, MPF_ROUND_NEAREST_TAWAY, q.to_mpq(), e.to_mpq().numerator());
- m_mpf_manager.set(tp, ebits, sbits, MPF_ROUND_TOWARD_POSITIVE, q.to_mpq(), e.to_mpq().numerator());
- m_mpf_manager.set(tn, ebits, sbits, MPF_ROUND_TOWARD_NEGATIVE, q.to_mpq(), e.to_mpq().numerator());
- m_mpf_manager.set(tz, ebits, sbits, MPF_ROUND_TOWARD_ZERO, q.to_mpq(), e.to_mpq().numerator());
-
- app_ref a_nte(m), a_nta(m), a_tp(m), a_tn(m), a_tz(m);
- a_nte = m_plugin->mk_value(nte);
- a_nta = m_plugin->mk_value(nta);
- a_tp = m_plugin->mk_value(tp);
- a_tn = m_plugin->mk_value(tn);
- a_tz = m_plugin->mk_value(tz);
-
- expr_ref bv_nte(m), bv_nta(m), bv_tp(m), bv_tn(m), bv_tz(m);
- mk_value(a_nte->get_decl(), 0, 0, bv_nte);
- mk_value(a_nta->get_decl(), 0, 0, bv_nta);
- mk_value(a_tp->get_decl(), 0, 0, bv_tp);
- mk_value(a_tn->get_decl(), 0, 0, bv_tn);
- mk_value(a_tz->get_decl(), 0, 0, bv_tz);
-
- mk_ite(m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3)), bv_tn, bv_tz, result);
- mk_ite(m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3)), bv_tp, result, result);
- mk_ite(m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TIES_TO_AWAY, 3)), bv_nta, result, result);
- mk_ite(m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TIES_TO_EVEN, 3)), bv_nte, result, result);
- }
- else if (num == 1 && m_bv_util.is_bv(args[0])) {
+ if (num == 1 &&
+ m_bv_util.is_bv(args[0])) {
sort * s = f->get_range();
unsigned to_sbits = m_util.get_sbits(s);
unsigned to_ebits = m_util.get_ebits(s);
@@ -1928,186 +1863,219 @@ void fpa2bv_converter::mk_to_float(func_decl * f, unsigned num, expr * const * a
int sz = m_bv_util.get_bv_size(bv);
SASSERT((unsigned)sz == to_sbits + to_ebits);
- m_bv_util.mk_extract(sz - 1, sz - 1, bv);
- mk_triple(m_bv_util.mk_extract(sz - 1, sz - 1, bv),
- m_bv_util.mk_extract(sz - to_ebits - 2, 0, bv),
- m_bv_util.mk_extract(sz - 2, sz - to_ebits - 1, bv),
- result);
+ mk_fp(m_bv_util.mk_extract(sz - 1, sz - 1, bv),
+ m_bv_util.mk_extract(sz - 2, sz - to_ebits - 1, bv),
+ m_bv_util.mk_extract(sz - to_ebits - 2, 0, bv),
+ result);
}
- else if (num == 2 &&
- is_app(args[1]) &&
- m_util.is_float(m.get_sort(args[1]))) {
- // We also support float to float conversion
- sort * s = f->get_range();
- expr_ref rm(m), x(m);
- rm = args[0];
- x = args[1];
-
- unsigned from_sbits = m_util.get_sbits(m.get_sort(x));
- unsigned from_ebits = m_util.get_ebits(m.get_sort(x));
- unsigned to_sbits = m_util.get_sbits(s);
- unsigned to_ebits = m_util.get_ebits(s);
-
- if (from_sbits == to_sbits && from_ebits == to_ebits)
- result = x;
- else {
- expr_ref c1(m), c2(m), c3(m), c4(m), c5(m);
- expr_ref v1(m), v2(m), v3(m), v4(m), v5(m), v6(m);
- expr_ref one1(m);
-
- one1 = m_bv_util.mk_numeral(1, 1);
- expr_ref ninf(m), pinf(m);
- mk_plus_inf(f, pinf);
- mk_minus_inf(f, ninf);
-
- // NaN -> NaN
- mk_is_nan(x, c1);
- mk_nan(f, v1);
-
- // +0 -> +0
- mk_is_pzero(x, c2);
- mk_pzero(f, v2);
-
- // -0 -> -0
- mk_is_nzero(x, c3);
- mk_nzero(f, v3);
-
- // +oo -> +oo
- mk_is_pinf(x, c4);
- v4 = pinf;
-
- // -oo -> -oo
- mk_is_ninf(x, c5);
- v5 = ninf;
-
- // otherwise: the actual conversion with rounding.
- expr_ref sgn(m), sig(m), exp(m), lz(m);
- unpack(x, sgn, sig, exp, lz, true);
-
- dbg_decouple("fpa2bv_to_float_x_sig", sig);
- dbg_decouple("fpa2bv_to_float_x_exp", exp);
- dbg_decouple("fpa2bv_to_float_lz", lz);
-
- expr_ref res_sgn(m), res_sig(m), res_exp(m);
-
- res_sgn = sgn;
-
- SASSERT(m_bv_util.get_bv_size(sgn) == 1);
- SASSERT(m_bv_util.get_bv_size(sig) == from_sbits);
- SASSERT(m_bv_util.get_bv_size(exp) == from_ebits);
- SASSERT(m_bv_util.get_bv_size(lz) == from_ebits);
-
- if (from_sbits < (to_sbits + 3))
- {
- // make sure that sig has at least to_sbits + 3
- res_sig = m_bv_util.mk_concat(sig, m_bv_util.mk_numeral(0, to_sbits+3-from_sbits));
- }
- else if (from_sbits > (to_sbits + 3))
- {
- // collapse the extra bits into a sticky bit.
- expr_ref sticky(m), low(m), high(m);
- low = m_bv_util.mk_extract(from_sbits - to_sbits - 3, 0, sig);
- high = m_bv_util.mk_extract(from_sbits - 1, from_sbits - to_sbits - 2, sig);
- sticky = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, low.get());
- res_sig = m_bv_util.mk_concat(high, sticky);
- }
- else
- res_sig = sig;
-
- res_sig = m_bv_util.mk_zero_extend(1, res_sig); // extra zero in the front for the rounder.
- unsigned sig_sz = m_bv_util.get_bv_size(res_sig);
- SASSERT(sig_sz == to_sbits+4);
-
- expr_ref exponent_overflow(m);
- exponent_overflow = m.mk_false();
-
- if (from_ebits < (to_ebits + 2))
- {
- res_exp = m_bv_util.mk_sign_extend(to_ebits-from_ebits+2, exp);
-
- // subtract lz for subnormal numbers.
- expr_ref lz_ext(m);
- lz_ext = m_bv_util.mk_zero_extend(to_ebits-from_ebits+2, lz);
- res_exp = m_bv_util.mk_bv_sub(res_exp, lz_ext);
- }
- else if (from_ebits > (to_ebits + 2))
- {
- expr_ref high(m), low(m), lows(m), high_red_or(m), high_red_and(m), h_or_eq(m), h_and_eq(m);
- expr_ref no_ovf(m), zero1(m), s_is_one(m), s_is_zero(m);
- high = m_bv_util.mk_extract(from_ebits - 1, to_ebits + 2, exp);
- low = m_bv_util.mk_extract(to_ebits+1, 0, exp);
- lows = m_bv_util.mk_extract(to_ebits+1, to_ebits+1, low);
-
- high_red_or = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, high.get());
- high_red_and = m.mk_app(m_bv_util.get_fid(), OP_BREDAND, high.get());
-
- zero1 = m_bv_util.mk_numeral(0, 1);
- m_simp.mk_eq(high_red_and, one1, h_and_eq);
- m_simp.mk_eq(high_red_or, zero1, h_or_eq);
- m_simp.mk_eq(lows, zero1, s_is_zero);
- m_simp.mk_eq(lows, one1, s_is_one);
-
- expr_ref c2(m);
- m_simp.mk_ite(h_or_eq, s_is_one, m.mk_false(), c2);
- m_simp.mk_ite(h_and_eq, s_is_zero, c2, exponent_overflow);
-
- // Note: Upon overflow, we _could_ try to shift the significand around...
-
- // subtract lz for subnormal numbers.
- expr_ref lz_ext(m), lz_rest(m), lz_redor(m), lz_redor_bool(m);
- lz_ext = m_bv_util.mk_extract(to_ebits+1, 0, lz);
- lz_rest = m_bv_util.mk_extract(from_ebits-1, to_ebits+2, lz);
- lz_redor = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, lz_rest.get());
- m_simp.mk_eq(lz_redor, one1, lz_redor_bool);
- m_simp.mk_or(exponent_overflow, lz_redor_bool, exponent_overflow);
-
- res_exp = m_bv_util.mk_bv_sub(low, lz_ext);
- }
- else // from_ebits == (to_ebits + 2)
- res_exp = m_bv_util.mk_bv_sub(exp, lz);
-
- SASSERT(m_bv_util.get_bv_size(res_exp) == to_ebits+2);
- SASSERT(is_well_sorted(m, res_exp));
-
- dbg_decouple("fpa2bv_to_float_res_sig", res_sig);
- dbg_decouple("fpa2bv_to_float_res_exp", res_exp);
-
- expr_ref rounded(m);
- round(s, rm, res_sgn, res_sig, res_exp, rounded);
-
- expr_ref is_neg(m), sig_inf(m);
- m_simp.mk_eq(sgn, one1, is_neg);
- mk_ite(is_neg, ninf, pinf, sig_inf);
-
- dbg_decouple("fpa2bv_to_float_exp_ovf", exponent_overflow);
- mk_ite(exponent_overflow, sig_inf, rounded, v6);
-
- // And finally, we tie them together.
- mk_ite(c5, v5, v6, result);
- mk_ite(c4, v4, result, result);
- mk_ite(c3, v3, result, result);
- mk_ite(c2, v2, result, result);
- mk_ite(c1, v1, result, result);
- }
- }
- else if (num == 2 &&
- m_util.is_rm(args[0]),
+ else if (num == 2 &&
+ m_bv_util.is_bv(args[0]) &&
+ m_bv_util.get_bv_size(args[0]) == 3 &&
+ m_util.is_float(m.get_sort(args[1]))) {
+ // float -> float conversion
+ mk_to_fp_float(f, f->get_range(), args[0], args[1], result);
+ }
+ else if (num == 2 &&
+ m_bv_util.is_bv(args[0]) &&
+ m_bv_util.get_bv_size(args[0]) == 3 &&
m_arith_util.is_real(args[1])) {
- // .. other than that, we only support rationals for asFloat
- SASSERT(m_util.is_float(f->get_range()));
- unsigned ebits = m_util.get_ebits(f->get_range());
- unsigned sbits = m_util.get_sbits(f->get_range());
+ // rm + real -> float
+ mk_to_fp_real(f, f->get_range(), args[0], args[1], result);
+ }
+ else if (num == 2 &&
+ m_bv_util.is_bv(args[0]) &&
+ m_bv_util.get_bv_size(args[0]) == 3 &&
+ m_bv_util.is_bv(args[1])) {
+ mk_to_fp_signed(f, num, args, result);
+ }
+ else if (num == 3 &&
+ m_bv_util.is_bv(args[0]) &&
+ m_bv_util.is_bv(args[1]) &&
+ m_bv_util.is_bv(args[2])) {
+ SASSERT(m_bv_util.get_bv_size(args[0]) == 1);
+ SASSERT(m_util.get_ebits(f->get_range()) == m_bv_util.get_bv_size(args[1]));
+ SASSERT(m_util.get_sbits(f->get_range()) == m_bv_util.get_bv_size(args[2])+1);
+ mk_fp(args[0], args[1], args[2], result);
+ }
+ else if (num == 3 &&
+ m_bv_util.is_bv(args[0]) &&
+ m_arith_util.is_numeral(args[1]) &&
+ m_arith_util.is_numeral(args[2]))
+ {
+ mk_to_fp_real_int(f, num, args, result);
+ }
+ else
+ UNREACHABLE();
- SASSERT(m_bv_util.is_numeral(args[0]));
+ SASSERT(is_well_sorted(m, result));
+}
+
+void fpa2bv_converter::mk_to_fp_float(func_decl * f, sort * s, expr * rm, expr * x, expr_ref & result) {
+ unsigned from_sbits = m_util.get_sbits(m.get_sort(x));
+ unsigned from_ebits = m_util.get_ebits(m.get_sort(x));
+ unsigned to_sbits = m_util.get_sbits(s);
+ unsigned to_ebits = m_util.get_ebits(s);
+
+ if (from_sbits == to_sbits && from_ebits == to_ebits)
+ result = x;
+ else {
+ expr_ref c1(m), c2(m), c3(m), c4(m), c5(m);
+ expr_ref v1(m), v2(m), v3(m), v4(m), v5(m), v6(m);
+ expr_ref one1(m);
+
+ one1 = m_bv_util.mk_numeral(1, 1);
+ expr_ref ninf(m), pinf(m);
+ mk_pinf(f, pinf);
+ mk_ninf(f, ninf);
+
+ // NaN -> NaN
+ mk_is_nan(x, c1);
+ mk_nan(f, v1);
+
+ // +0 -> +0
+ mk_is_pzero(x, c2);
+ mk_pzero(f, v2);
+
+ // -0 -> -0
+ mk_is_nzero(x, c3);
+ mk_nzero(f, v3);
+
+ // +oo -> +oo
+ mk_is_pinf(x, c4);
+ v4 = pinf;
+
+ // -oo -> -oo
+ mk_is_ninf(x, c5);
+ v5 = ninf;
+
+ // otherwise: the actual conversion with rounding.
+ expr_ref sgn(m), sig(m), exp(m), lz(m);
+ unpack(x, sgn, sig, exp, lz, true);
+
+ dbg_decouple("fpa2bv_to_float_x_sig", sig);
+ dbg_decouple("fpa2bv_to_float_x_exp", exp);
+ dbg_decouple("fpa2bv_to_float_lz", lz);
+
+ expr_ref res_sgn(m), res_sig(m), res_exp(m);
+
+ res_sgn = sgn;
+
+ SASSERT(m_bv_util.get_bv_size(sgn) == 1);
+ SASSERT(m_bv_util.get_bv_size(sig) == from_sbits);
+ SASSERT(m_bv_util.get_bv_size(exp) == from_ebits);
+ SASSERT(m_bv_util.get_bv_size(lz) == from_ebits);
+
+ if (from_sbits < (to_sbits + 3)) {
+ // make sure that sig has at least to_sbits + 3
+ res_sig = m_bv_util.mk_concat(sig, m_bv_util.mk_numeral(0, to_sbits + 3 - from_sbits));
+ }
+ else if (from_sbits >(to_sbits + 3)) {
+ // collapse the extra bits into a sticky bit.
+ expr_ref sticky(m), low(m), high(m);
+ low = m_bv_util.mk_extract(from_sbits - to_sbits - 3, 0, sig);
+ high = m_bv_util.mk_extract(from_sbits - 1, from_sbits - to_sbits - 2, sig);
+ sticky = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, low.get());
+ res_sig = m_bv_util.mk_concat(high, sticky);
+ }
+ else
+ res_sig = sig;
+
+ res_sig = m_bv_util.mk_zero_extend(1, res_sig); // extra zero in the front for the rounder.
+ unsigned sig_sz = m_bv_util.get_bv_size(res_sig);
+ SASSERT(sig_sz == to_sbits + 4);
+
+ expr_ref exponent_overflow(m);
+ exponent_overflow = m.mk_false();
+
+ if (from_ebits < (to_ebits + 2)) {
+ res_exp = m_bv_util.mk_sign_extend(to_ebits - from_ebits + 2, exp);
+
+ // subtract lz for subnormal numbers.
+ expr_ref lz_ext(m);
+ lz_ext = m_bv_util.mk_zero_extend(to_ebits - from_ebits + 2, lz);
+ res_exp = m_bv_util.mk_bv_sub(res_exp, lz_ext);
+ }
+ else if (from_ebits >(to_ebits + 2)) {
+ expr_ref high(m), low(m), lows(m), high_red_or(m), high_red_and(m), h_or_eq(m), h_and_eq(m);
+ expr_ref no_ovf(m), zero1(m), s_is_one(m), s_is_zero(m);
+ high = m_bv_util.mk_extract(from_ebits - 1, to_ebits + 2, exp);
+ low = m_bv_util.mk_extract(to_ebits + 1, 0, exp);
+ lows = m_bv_util.mk_extract(to_ebits + 1, to_ebits + 1, low);
+
+ high_red_or = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, high.get());
+ high_red_and = m.mk_app(m_bv_util.get_fid(), OP_BREDAND, high.get());
+
+ zero1 = m_bv_util.mk_numeral(0, 1);
+ m_simp.mk_eq(high_red_and, one1, h_and_eq);
+ m_simp.mk_eq(high_red_or, zero1, h_or_eq);
+ m_simp.mk_eq(lows, zero1, s_is_zero);
+ m_simp.mk_eq(lows, one1, s_is_one);
+
+ expr_ref c2(m);
+ m_simp.mk_ite(h_or_eq, s_is_one, m.mk_false(), c2);
+ m_simp.mk_ite(h_and_eq, s_is_zero, c2, exponent_overflow);
+
+ // Note: Upon overflow, we _could_ try to shift the significand around...
+
+ // subtract lz for subnormal numbers.
+ expr_ref lz_ext(m), lz_rest(m), lz_redor(m), lz_redor_bool(m);
+ lz_ext = m_bv_util.mk_extract(to_ebits + 1, 0, lz);
+ lz_rest = m_bv_util.mk_extract(from_ebits - 1, to_ebits + 2, lz);
+ lz_redor = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, lz_rest.get());
+ m_simp.mk_eq(lz_redor, one1, lz_redor_bool);
+ m_simp.mk_or(exponent_overflow, lz_redor_bool, exponent_overflow);
+
+ res_exp = m_bv_util.mk_bv_sub(low, lz_ext);
+ }
+ else // from_ebits == (to_ebits + 2)
+ res_exp = m_bv_util.mk_bv_sub(exp, lz);
+
+ SASSERT(m_bv_util.get_bv_size(res_exp) == to_ebits + 2);
+ SASSERT(is_well_sorted(m, res_exp));
+
+ dbg_decouple("fpa2bv_to_float_res_sig", res_sig);
+ dbg_decouple("fpa2bv_to_float_res_exp", res_exp);
+
+ expr_ref rounded(m);
+ expr_ref rm_e(rm, m);
+ round(s, rm_e, res_sgn, res_sig, res_exp, rounded);
+
+ expr_ref is_neg(m), sig_inf(m);
+ m_simp.mk_eq(sgn, one1, is_neg);
+ mk_ite(is_neg, ninf, pinf, sig_inf);
+
+ dbg_decouple("fpa2bv_to_float_exp_ovf", exponent_overflow);
+ mk_ite(exponent_overflow, sig_inf, rounded, v6);
+
+ // And finally, we tie them together.
+ mk_ite(c5, v5, v6, result);
+ mk_ite(c4, v4, result, result);
+ mk_ite(c3, v3, result, result);
+ mk_ite(c2, v2, result, result);
+ mk_ite(c1, v1, result, result);
+ }
+
+ SASSERT(is_well_sorted(m, result));
+}
+
+void fpa2bv_converter::mk_to_fp_real(func_decl * f, sort * s, expr * rm, expr * x, expr_ref & result) {
+ TRACE("fpa2bv_to_fp_real", tout << "rm: " << mk_ismt2_pp(rm, m) << std::endl <<
+ "x: " << mk_ismt2_pp(x, m) << std::endl;);
+ SASSERT(m_util.is_float(s));
+ SASSERT(au().is_real(x));
+
+ unsigned ebits = m_util.get_ebits(s);
+ unsigned sbits = m_util.get_sbits(s);
+
+ if (m_bv_util.is_numeral(rm) && m_util.au().is_numeral(x)) {
rational tmp_rat; unsigned sz;
- m_bv_util.is_numeral(to_expr(args[0]), tmp_rat, sz);
+ m_bv_util.is_numeral(to_expr(rm), tmp_rat, sz);
SASSERT(tmp_rat.is_int32());
SASSERT(sz == 3);
BV_RM_VAL bv_rm = (BV_RM_VAL)tmp_rat.get_unsigned();
mpf_rounding_mode rm;
- switch (bv_rm)
- {
+ switch (bv_rm) {
case BV_RM_TIES_TO_AWAY: rm = MPF_ROUND_NEAREST_TAWAY; break;
case BV_RM_TIES_TO_EVEN: rm = MPF_ROUND_NEAREST_TEVEN; break;
case BV_RM_TO_NEGATIVE: rm = MPF_ROUND_TOWARD_NEGATIVE; break;
@@ -2116,104 +2084,781 @@ void fpa2bv_converter::mk_to_float(func_decl * f, unsigned num, expr * const * a
default: UNREACHABLE();
}
- SASSERT(m_util.au().is_numeral(args[1]));
-
rational q;
- m_util.au().is_numeral(args[1], q);
+ m_util.au().is_numeral(x, q);
- mpf v;
+ scoped_mpf v(m_mpf_manager);
m_util.fm().set(v, ebits, sbits, rm, q.to_mpq());
- expr * sgn = m_bv_util.mk_numeral((m_util.fm().sgn(v)) ? 1 : 0, 1);
- expr * s = m_bv_util.mk_numeral(m_util.fm().sig(v), sbits - 1);
- expr * e = m_bv_util.mk_numeral(m_util.fm().exp(v), ebits);
+ expr_ref sgn(m), s(m), e(m), unbiased_exp(m);
+ sgn = m_bv_util.mk_numeral((m_util.fm().sgn(v)) ? 1 : 0, 1);
+ s = m_bv_util.mk_numeral(m_util.fm().sig(v), sbits - 1);
+ unbiased_exp = m_bv_util.mk_numeral(m_util.fm().exp(v), ebits);
+ mk_bias(unbiased_exp, e);
- mk_triple(sgn, s, e, result);
-
- m_util.fm().del(v);
+ mk_fp(sgn, e, s, result);
}
- else
+ else {
+ bv_util & bu = m_bv_util;
+ arith_util & au = m_arith_util;
+
+ expr_ref bv0(m), bv1(m), zero(m), two(m);
+ bv0 = bu.mk_numeral(0, 1);
+ bv1 = bu.mk_numeral(1, 1);
+ zero = au.mk_numeral(rational(0), false);
+ two = au.mk_numeral(rational(2), false);
+
+ expr_ref sgn(m), sig(m), exp(m);
+ sgn = mk_fresh_const("fpa2bv_to_fp_real_sgn", 1);
+ sig = mk_fresh_const("fpa2bv_to_fp_real_sig", sbits + 4);
+ exp = mk_fresh_const("fpa2bv_to_fp_real_exp", ebits + 2);
+
+ expr_ref rme(rm, m);
+ round(s, rme, sgn, sig, exp, result);
+
+ expr * e = m.mk_eq(m_util.mk_to_real(result), x);
+ m_extra_assertions.push_back(e);
+ }
+
+ SASSERT(is_well_sorted(m, result));
+}
+
+void fpa2bv_converter::mk_to_fp_real_int(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ // rm + real + int -> float
+ SASSERT(m_util.is_float(f->get_range()));
+ unsigned ebits = m_util.get_ebits(f->get_range());
+ unsigned sbits = m_util.get_sbits(f->get_range());
+
+ expr * rm = args[0];
+
+ rational q;
+ if (!m_arith_util.is_numeral(args[1], q))
UNREACHABLE();
- SASSERT(is_well_sorted(m, result));
+ rational e;
+ if (!m_arith_util.is_numeral(args[2], e))
+ UNREACHABLE();
+
+ SASSERT(e.is_int64());
+ SASSERT(m_mpz_manager.eq(e.to_mpq().denominator(), 1));
+
+ scoped_mpf nte(m_mpf_manager), nta(m_mpf_manager), tp(m_mpf_manager), tn(m_mpf_manager), tz(m_mpf_manager);
+ m_mpf_manager.set(nte, ebits, sbits, MPF_ROUND_NEAREST_TEVEN, q.to_mpq(), e.to_mpq().numerator());
+ m_mpf_manager.set(nta, ebits, sbits, MPF_ROUND_NEAREST_TAWAY, q.to_mpq(), e.to_mpq().numerator());
+ m_mpf_manager.set(tp, ebits, sbits, MPF_ROUND_TOWARD_POSITIVE, q.to_mpq(), e.to_mpq().numerator());
+ m_mpf_manager.set(tn, ebits, sbits, MPF_ROUND_TOWARD_NEGATIVE, q.to_mpq(), e.to_mpq().numerator());
+ m_mpf_manager.set(tz, ebits, sbits, MPF_ROUND_TOWARD_ZERO, q.to_mpq(), e.to_mpq().numerator());
+
+ app_ref a_nte(m), a_nta(m), a_tp(m), a_tn(m), a_tz(m);
+ a_nte = m_plugin->mk_numeral(nte);
+ a_nta = m_plugin->mk_numeral(nta);
+ a_tp = m_plugin->mk_numeral(tp);
+ a_tn = m_plugin->mk_numeral(tn);
+ a_tz = m_plugin->mk_numeral(tz);
+
+ expr_ref bv_nte(m), bv_nta(m), bv_tp(m), bv_tn(m), bv_tz(m);
+ mk_numeral(a_nte->get_decl(), 0, 0, bv_nte);
+ mk_numeral(a_nta->get_decl(), 0, 0, bv_nta);
+ mk_numeral(a_tp->get_decl(), 0, 0, bv_tp);
+ mk_numeral(a_tn->get_decl(), 0, 0, bv_tn);
+ mk_numeral(a_tz->get_decl(), 0, 0, bv_tz);
+
+ expr_ref c1(m), c2(m), c3(m), c4(m);
+ c1 = m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3));
+ c2 = m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3));
+ c3 = m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TIES_TO_AWAY, 3));
+ c4 = m.mk_eq(rm, m_bv_util.mk_numeral(BV_RM_TIES_TO_EVEN, 3));
+
+ mk_ite(c1, bv_tn, bv_tz, result);
+ mk_ite(c2, bv_tp, result, result);
+ mk_ite(c3, bv_nta, result, result);
+ mk_ite(c4, bv_nte, result, result);
+}
+void fpa2bv_converter::mk_to_real(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_real", for (unsigned i = 0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl;);
+ SASSERT(num == 1);
+ SASSERT(f->get_num_parameters() == 0);
+ SASSERT(is_app_of(args[0], m_plugin->get_family_id(), OP_FPA_FP));
+
+ expr * x = args[0];
+ sort * s = m.get_sort(x);
+ unsigned ebits = m_util.get_ebits(s);
+ unsigned sbits = m_util.get_sbits(s);
+
+ sort * rs = m_arith_util.mk_real();
+ expr_ref x_is_nan(m), x_is_inf(m), x_is_zero(m);
+ mk_is_nan(x, x_is_nan);
+ mk_is_inf(x, x_is_inf);
+ mk_is_zero(x, x_is_zero);
+
+ expr_ref sgn(m), sig(m), exp(m), lz(m);
+ unpack(x, sgn, sig, exp, lz, true);
+ // sig is of the form [1].[sigbits]
+
+ SASSERT(m_bv_util.get_bv_size(sgn) == 1);
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits);
+
+ expr_ref rsig(m), bit(m), zero(m), one(m), two(m), bv0(m), bv1(m);
+ zero = m_arith_util.mk_numeral(rational(0), rs);
+ one = m_arith_util.mk_numeral(rational(1), rs);
+ two = m_arith_util.mk_numeral(rational(2), rs);
+ bv0 = m_bv_util.mk_numeral(0, 1);
+ bv1 = m_bv_util.mk_numeral(1, 1);
+ rsig = one;
+ for (unsigned i = sbits - 2; i != (unsigned)-1; i--) {
+ bit = m_bv_util.mk_extract(i, i, sig);
+ rsig = m_arith_util.mk_add(m_arith_util.mk_mul(rsig, two),
+ m.mk_ite(m.mk_eq(bit, bv1), one, zero));
+ }
+
+ const mpz & p2 = fu().fm().m_powers2(sbits - 1);
+ expr_ref ep2(m);
+ ep2 = m_arith_util.mk_numeral(rational(p2), false);
+ rsig = m_arith_util.mk_div(rsig, ep2);
+ dbg_decouple("fpa2bv_to_real_ep2", ep2);
+ dbg_decouple("fpa2bv_to_real_rsig", rsig);
+
+ expr_ref exp_n(m), exp_p(m), exp_is_neg(m), exp_abs(m);
+ exp_is_neg = m.mk_eq(m_bv_util.mk_extract(ebits - 1, ebits - 1, exp), bv1);
+ dbg_decouple("fpa2bv_to_real_exp_is_neg", exp_is_neg);
+ exp_p = m_bv_util.mk_sign_extend(1, exp);
+ exp_n = m_bv_util.mk_bv_neg(exp_p);
+ exp_abs = m.mk_ite(exp_is_neg, exp_n, exp_p);
+ dbg_decouple("fpa2bv_to_real_exp_abs", exp);
+ SASSERT(m_bv_util.get_bv_size(exp_abs) == ebits + 1);
+
+ expr_ref exp2(m), prev_bit(m);
+ exp2 = zero;
+ for (unsigned i = ebits; i != (unsigned)-1; i--) {
+ bit = m_bv_util.mk_extract(i, i, exp_abs);
+ exp2 = m_arith_util.mk_add(m_arith_util.mk_mul(exp2, two),
+ m.mk_ite(m.mk_eq(bit, bv1), one, zero));
+ prev_bit = bit;
+ }
+
+ exp2 = m.mk_ite(exp_is_neg, m_arith_util.mk_div(one, exp2), exp2);
+ dbg_decouple("fpa2bv_to_real_exp2", exp2);
+
+ expr_ref res(m), two_exp2(m);
+ two_exp2 = m_arith_util.mk_power(two, exp2);
+ res = m_arith_util.mk_mul(rsig, two_exp2);
+ res = m.mk_ite(m.mk_eq(sgn, bv1), m_arith_util.mk_uminus(res), res);
+ dbg_decouple("fpa2bv_to_real_sig_times_exp2", res);
+
+ TRACE("fpa2bv_to_real", tout << "rsig = " << mk_ismt2_pp(rsig, m) << std::endl;
+ tout << "exp2 = " << mk_ismt2_pp(exp2, m) << std::endl;);
+
+ result = m.mk_ite(x_is_zero, zero, res);
+ result = m.mk_ite(x_is_inf, mk_to_real_unspecified(), result);
+ result = m.mk_ite(x_is_nan, mk_to_real_unspecified(), result);
+
+ SASSERT(is_well_sorted(m, result));
+}
+
+void fpa2bv_converter::mk_to_fp_signed(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_fp_signed", for (unsigned i = 0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl;);
+
+ // This is a conversion from signed bitvector to float:
+ // ; from signed machine integer, represented as a 2's complement bit vector
+ // ((_ to_fp eb sb) RoundingMode (_ BitVec m) (_ FloatingPoint eb sb))
+ // Semantics:
+ // Let b in[[(_ BitVec m)]] and let n be the signed integer represented by b (in 2's complement format).
+ // [[(_ to_fp eb sb)]](r, b) = +/ -infinity if n is too large / too small to be represented as a finite
+ // number of [[(_ FloatingPoint eb sb)]]; [[(_ to_fp eb sb)]](r, x) = y otherwise, where y is the finite
+ // number such that [[fp.to_real]](y) is closest to n according to rounding mode r.
+
+ SASSERT(num == 2);
+ SASSERT(m_util.is_float(f->get_range()));
+ SASSERT(m_bv_util.is_bv(args[0]));
+ SASSERT(m_bv_util.is_bv(args[1]));
+
+ expr_ref rm(m), x(m);
+ rm = args[0];
+ x = args[1];
+
+ dbg_decouple("fpa2bv_to_fp_signed_x", x);
+
+ unsigned ebits = m_util.get_ebits(f->get_range());
+ unsigned sbits = m_util.get_sbits(f->get_range());
+ unsigned bv_sz = m_bv_util.get_bv_size(x);
+ SASSERT(m_bv_util.get_bv_size(rm) == 3);
+
+ expr_ref bv0_1(m), bv1_1(m), bv0_sz(m), bv1_sz(m);
+ bv0_1 = m_bv_util.mk_numeral(0, 1);
+ bv1_1 = m_bv_util.mk_numeral(1, 1);
+ bv0_sz = m_bv_util.mk_numeral(0, bv_sz);
+ bv1_sz = m_bv_util.mk_numeral(1, bv_sz);
+
+ expr_ref is_zero(m), nzero(m), pzero(m), ninf(m), pinf(m);
+ is_zero = m.mk_eq(x, bv0_sz);
+ mk_nzero(f, nzero);
+ mk_pzero(f, pzero);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
+
+ // Special case: x == 0 -> p/n zero
+ expr_ref c1(m), v1(m), rm_is_to_neg(m);
+ c1 = is_zero;
+ mk_is_rm(rm, BV_RM_TO_NEGATIVE, rm_is_to_neg);
+ mk_ite(rm_is_to_neg, nzero, pzero, v1);
+
+ // Special case: x != 0
+ expr_ref is_neg_bit(m), exp_too_large(m), sig_4(m), exp_2(m);
+ expr_ref is_neg(m), x_abs(m);
+ is_neg_bit = m_bv_util.mk_extract(bv_sz - 1, bv_sz - 1, x);
+ is_neg = m.mk_eq(is_neg_bit, bv1_1);
+ x_abs = m.mk_ite(is_neg, m_bv_util.mk_bv_neg(x), x);
+ dbg_decouple("fpa2bv_to_fp_signed_is_neg", is_neg);
+ // x_abs has an extra bit in the front.
+ // x_abs is [bv_sz-1, bv_sz-2] . [bv_sz-3 ... 0] * 2^(bv_sz-2)
+ // bv_sz-2 is the "1.0" bit for the rounder.
+
+ expr_ref lz(m), e_bv_sz(m), e_rest_sz(m);
+ mk_leading_zeros(x_abs, bv_sz, lz);
+ e_bv_sz = m_bv_util.mk_numeral(bv_sz, bv_sz);
+ e_rest_sz = m_bv_util.mk_bv_sub(e_bv_sz, lz);
+ SASSERT(m_bv_util.get_bv_size(lz) == m_bv_util.get_bv_size(e_bv_sz));
+ dbg_decouple("fpa2bv_to_fp_signed_lz", lz);
+ expr_ref shifted_sig(m);
+ shifted_sig = m_bv_util.mk_bv_shl(x_abs, lz);
+
+ expr_ref sticky(m);
+ // shifted_sig is [bv_sz-1, bv_sz-2] . [bv_sz-3 ... 0] * 2^(bv_sz-2) * 2^(-lz)
+ unsigned sig_sz = sbits + 4; // we want extra rounding bits.
+ if (sig_sz <= bv_sz) {
+ expr_ref sig_rest(m);
+ sig_4 = m_bv_util.mk_extract(bv_sz - 1, bv_sz - sig_sz + 1, shifted_sig); // one short
+ sig_rest = m_bv_util.mk_extract(bv_sz - sig_sz, 0, shifted_sig);
+ sticky = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, sig_rest.get());
+ sig_4 = m_bv_util.mk_concat(sig_4, sticky);
+ }
+ else {
+ unsigned extra_bits = sig_sz - bv_sz;
+ expr_ref extra_zeros(m);
+ extra_zeros = m_bv_util.mk_numeral(0, extra_bits);
+ sig_4 = m_bv_util.mk_concat(shifted_sig, extra_zeros);
+ lz = m_bv_util.mk_bv_add(m_bv_util.mk_concat(extra_zeros, lz),
+ m_bv_util.mk_numeral(extra_bits, sig_sz));
+ bv_sz = bv_sz + extra_bits;
+ SASSERT(is_well_sorted(m, lz));
+ }
+ SASSERT(m_bv_util.get_bv_size(sig_4) == sig_sz);
+
+ expr_ref s_exp(m), exp_rest(m);
+ s_exp = m_bv_util.mk_bv_sub(m_bv_util.mk_numeral(bv_sz - 2, bv_sz), lz);
+ // s_exp = (bv_sz-2) + (-lz) signed
+ SASSERT(m_bv_util.get_bv_size(s_exp) == bv_sz);
+
+ unsigned exp_sz = ebits + 2; // (+2 for rounder)
+ exp_2 = m_bv_util.mk_extract(exp_sz - 1, 0, s_exp);
+ // the remaining bits are 0 if ebits is large enough.
+ exp_too_large = m.mk_false();
+
+ // The exponent is at most bv_sz, i.e., we need ld(bv_sz)+1 ebits.
+ // exp < bv_sz (+sign bit which is [0])
+ unsigned exp_worst_case_sz = (unsigned)((log((double)bv_sz) / log((double)2)) + 1.0);
+
+ TRACE("fpa2bv_to_fp_signed", tout << "exp worst case sz: " << exp_worst_case_sz << std::endl;);
+
+ if (exp_sz < exp_worst_case_sz) {
+ // exp_sz < exp_worst_case_sz and exp >= 0.
+ // Take the maximum legal exponent; this
+ // allows us to keep the most precision.
+ expr_ref max_exp(m), max_exp_bvsz(m);
+ mk_max_exp(exp_sz, max_exp);
+ max_exp_bvsz = m_bv_util.mk_zero_extend(bv_sz - exp_sz, max_exp);
+
+ exp_too_large = m_bv_util.mk_ule(m_bv_util.mk_bv_add(
+ max_exp_bvsz,
+ m_bv_util.mk_numeral(1, bv_sz)),
+ s_exp);
+ sig_4 = m.mk_ite(exp_too_large, m_bv_util.mk_numeral(0, sig_sz), sig_4);
+ exp_2 = m.mk_ite(exp_too_large, max_exp, exp_2);
+ }
+ dbg_decouple("fpa2bv_to_fp_signed_exp_too_large", exp_too_large);
+
+ expr_ref sgn(m), sig(m), exp(m);
+ sgn = is_neg_bit;
+ sig = sig_4;
+ exp = exp_2;
+
+ dbg_decouple("fpa2bv_to_fp_signed_sgn", sgn);
+ dbg_decouple("fpa2bv_to_fp_signed_sig", sig);
+ dbg_decouple("fpa2bv_to_fp_signed_exp", exp);
+
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits + 4);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits + 2);
+
+ expr_ref v2(m);
+ round(f->get_range(), rm, sgn, sig, exp, v2);
+
+ mk_ite(c1, v1, v2, result);
+}
+
+void fpa2bv_converter::mk_to_fp_unsigned(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_fp_unsigned", for (unsigned i = 0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl;);
+
+ // This is a conversion from unsigned bitvector to float:
+ // ((_ to_fp_unsigned eb sb) RoundingMode (_ BitVec m) (_ FloatingPoint eb sb))
+ // Semantics:
+ // Let b in[[(_ BitVec m)]] and let n be the unsigned integer represented by b.
+ // [[(_ to_fp_unsigned eb sb)]](r, x) = +infinity if n is too large to be
+ // represented as a finite number of[[(_ FloatingPoint eb sb)]];
+ // [[(_ to_fp_unsigned eb sb)]](r, x) = y otherwise, where y is the finite number
+ // such that[[fp.to_real]](y) is closest to n according to rounding mode r.
+
+ SASSERT(num == 2);
+ SASSERT(m_util.is_float(f->get_range()));
+ SASSERT(m_bv_util.is_bv(args[0]));
+ SASSERT(m_bv_util.is_bv(args[1]));
+
+ expr_ref rm(m), x(m);
+ rm = args[0];
+ x = args[1];
+
+ dbg_decouple("fpa2bv_to_fp_unsigned_x", x);
+
+ unsigned ebits = m_util.get_ebits(f->get_range());
+ unsigned sbits = m_util.get_sbits(f->get_range());
+ unsigned bv_sz = m_bv_util.get_bv_size(x);
+ SASSERT(m_bv_util.get_bv_size(rm) == 3);
+
+ expr_ref bv0_1(m), bv1_1(m), bv0_sz(m), bv1_sz(m);
+ bv0_1 = m_bv_util.mk_numeral(0, 1);
+ bv1_1 = m_bv_util.mk_numeral(1, 1);
+ bv0_sz = m_bv_util.mk_numeral(0, bv_sz);
+ bv1_sz = m_bv_util.mk_numeral(1, bv_sz);
+
+ expr_ref is_zero(m), nzero(m), pzero(m), ninf(m), pinf(m);
+ is_zero = m.mk_eq(x, bv0_sz);
+ mk_nzero(f, nzero);
+ mk_pzero(f, pzero);
+ mk_ninf(f, ninf);
+ mk_pinf(f, pinf);
+
+ // Special case: x == 0 -> p/n zero
+ expr_ref c1(m), v1(m), rm_is_to_neg(m);
+ c1 = is_zero;
+ mk_is_rm(rm, BV_RM_TO_NEGATIVE, rm_is_to_neg);
+ mk_ite(rm_is_to_neg, nzero, pzero, v1);
+
+ // Special case: x != 0
+ expr_ref exp_too_large(m), sig_4(m), exp_2(m);
+ // x is [bv_sz-1] . [bv_sz-2 ... 0] * 2^(bv_sz-1)
+ // bv_sz-1 is the "1.0" bit for the rounder.
+
+ expr_ref lz(m), e_bv_sz(m), e_rest_sz(m);
+ mk_leading_zeros(x, bv_sz, lz);
+ e_bv_sz = m_bv_util.mk_numeral(bv_sz, bv_sz);
+ e_rest_sz = m_bv_util.mk_bv_sub(e_bv_sz, lz);
+ SASSERT(m_bv_util.get_bv_size(lz) == m_bv_util.get_bv_size(e_bv_sz));
+ dbg_decouple("fpa2bv_to_fp_unsigned_lz", lz);
+ expr_ref shifted_sig(m);
+ shifted_sig = m_bv_util.mk_bv_shl(x, lz);
+
+ expr_ref sticky(m);
+ // shifted_sig is [bv_sz-1] . [bv_sz-2 ... 0] * 2^(bv_sz-1) * 2^(-lz)
+ unsigned sig_sz = sbits + 4; // we want extra rounding bits.
+ if (sig_sz <= bv_sz) {
+ expr_ref sig_rest(m);
+ sig_4 = m_bv_util.mk_extract(bv_sz - 1, bv_sz - sig_sz + 1, shifted_sig); // one short
+ sig_rest = m_bv_util.mk_extract(bv_sz - sig_sz, 0, shifted_sig);
+ sticky = m.mk_app(m_bv_util.get_fid(), OP_BREDOR, sig_rest.get());
+ sig_4 = m_bv_util.mk_concat(sig_4, sticky);
+ }
+ else {
+ unsigned extra_bits = sig_sz - bv_sz;
+ expr_ref extra_zeros(m);
+ extra_zeros = m_bv_util.mk_numeral(0, extra_bits);
+ sig_4 = m_bv_util.mk_concat(shifted_sig, extra_zeros);
+ lz = m_bv_util.mk_bv_add(m_bv_util.mk_concat(extra_zeros, lz),
+ m_bv_util.mk_numeral(extra_bits, sig_sz));
+ bv_sz = bv_sz + extra_bits;
+ SASSERT(is_well_sorted(m, lz));
+ }
+ SASSERT(m_bv_util.get_bv_size(sig_4) == sig_sz);
+
+ expr_ref s_exp(m), exp_rest(m);
+ s_exp = m_bv_util.mk_bv_sub(m_bv_util.mk_numeral(bv_sz - 2, bv_sz), lz);
+ // s_exp = (bv_sz-2) + (-lz) signed
+ SASSERT(m_bv_util.get_bv_size(s_exp) == bv_sz);
+
+ unsigned exp_sz = ebits + 2; // (+2 for rounder)
+ exp_2 = m_bv_util.mk_extract(exp_sz - 1, 0, s_exp);
+ // the remaining bits are 0 if ebits is large enough.
+ exp_too_large = m.mk_false(); // This is always in range.
+
+ // The exponent is at most bv_sz, i.e., we need ld(bv_sz)+1 ebits.
+ // exp < bv_sz (+sign bit which is [0])
+ unsigned exp_worst_case_sz = (unsigned)((log((double)bv_sz) / log((double)2)) + 1.0);
+
+ if (exp_sz < exp_worst_case_sz) {
+ // exp_sz < exp_worst_case_sz and exp >= 0.
+ // Take the maximum legal exponent; this
+ // allows us to keep the most precision.
+ expr_ref max_exp(m), max_exp_bvsz(m);
+ mk_max_exp(exp_sz, max_exp);
+ max_exp_bvsz = m_bv_util.mk_zero_extend(bv_sz - exp_sz, max_exp);
+
+ exp_too_large = m_bv_util.mk_ule(m_bv_util.mk_bv_add(
+ max_exp_bvsz,
+ m_bv_util.mk_numeral(1, bv_sz)),
+ s_exp);
+ sig_4 = m.mk_ite(exp_too_large, m_bv_util.mk_numeral(0, sig_sz), sig_4);
+ exp_2 = m.mk_ite(exp_too_large, max_exp, exp_2);
+ }
+ dbg_decouple("fpa2bv_to_fp_unsigned_exp_too_large", exp_too_large);
+
+ expr_ref sgn(m), sig(m), exp(m);
+ sgn = bv0_1;
+ sig = sig_4;
+ exp = exp_2;
+
+ dbg_decouple("fpa2bv_to_fp_unsigned_sgn", sgn);
+ dbg_decouple("fpa2bv_to_fp_unsigned_sig", sig);
+ dbg_decouple("fpa2bv_to_fp_unsigned_exp", exp);
+
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits + 4);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits + 2);
+
+ expr_ref v2(m);
+ round(f->get_range(), rm, sgn, sig, exp, v2);
+
+ mk_ite(c1, v1, v2, result);
}
void fpa2bv_converter::mk_to_ieee_bv(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
SASSERT(num == 1);
expr * sgn, * s, * e;
- split(args[0], sgn, s, e);
+ split_fp(args[0], sgn, e, s);
result = m_bv_util.mk_concat(m_bv_util.mk_concat(sgn, e), s);
}
+void fpa2bv_converter::mk_to_ubv(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_ubv", for (unsigned i = 0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl;);
+
+ SASSERT(f->get_num_parameters() == 1);
+ SASSERT(f->get_parameter(0).is_int());
+ SASSERT(num == 2);
+ SASSERT(m_bv_util.get_bv_size(args[0]) == 3);
+ SASSERT(m_util.is_float(args[1]));
+
+ expr * rm = args[0];
+ expr * x = args[1];
+ sort * xs = m.get_sort(x);
+ sort * bv_srt = f->get_range();
+
+ unsigned ebits = m_util.get_ebits(xs);
+ unsigned sbits = m_util.get_sbits(xs);
+ unsigned bv_sz = (unsigned)f->get_parameter(0).get_int();
+
+ expr_ref bv0(m), bv1(m);
+ bv0 = m_bv_util.mk_numeral(0, 1);
+ bv1 = m_bv_util.mk_numeral(1, 1);
+
+ expr_ref x_is_nan(m), x_is_inf(m), x_is_zero(m), x_is_neg(m), x_is_nzero(m);
+ mk_is_nan(x, x_is_nan);
+ mk_is_inf(x, x_is_inf);
+ mk_is_zero(x, x_is_zero);
+ mk_is_neg(x, x_is_neg);
+ mk_is_nzero(x, x_is_nzero);
+
+ // NaN, Inf, or negative (except -0) -> unspecified
+ expr_ref c1(m), v1(m);
+ c1 = m.mk_or(x_is_nan, x_is_inf, m.mk_and(x_is_neg, m.mk_not(x_is_nzero)));
+ v1 = mk_to_ubv_unspecified(bv_sz);
+
+ // +-Zero -> 0
+ expr_ref c2(m), v2(m);
+ c2 = x_is_zero;
+ v2 = m_bv_util.mk_numeral(rational(0), bv_srt);
+ dbg_decouple("fpa2bv_to_ubv_c2", c2);
+
+ // Otherwise...
+ expr_ref sgn(m), sig(m), exp(m), lz(m);
+ unpack(x, sgn, sig, exp, lz, true);
+
+ // sig is of the form +- [1].[sig] * 2^(exp-lz)
+ SASSERT(m_bv_util.get_bv_size(sgn) == 1);
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits);
+ SASSERT(m_bv_util.get_bv_size(lz) == ebits);
+ dbg_decouple("fpa2bv_to_ubv_sig", sig);
+ unsigned sig_sz = m_bv_util.get_bv_size(sig);
+ SASSERT(sig_sz == sbits);
+ if (sig_sz < (bv_sz + 3))
+ sig = m_bv_util.mk_concat(sig, m_bv_util.mk_numeral(0, bv_sz - sig_sz + 3));
+ sig_sz = m_bv_util.get_bv_size(sig);
+ SASSERT(sig_sz >= (bv_sz + 3));
+
+ expr_ref exp_m_lz(m), shift(m), shift_neg(m), bv0_e2(m), shift_abs(m);
+ exp_m_lz = m_bv_util.mk_bv_sub(m_bv_util.mk_sign_extend(2, exp),
+ m_bv_util.mk_zero_extend(2, lz));
+ shift = m_bv_util.mk_bv_sub(exp_m_lz,
+ m_bv_util.mk_numeral(bv_sz - 1, ebits + 2));
+ shift_neg = m_bv_util.mk_bv_neg(shift);
+ bv0_e2 = m_bv_util.mk_numeral(0, ebits + 2);
+ shift_abs = m.mk_ite(m_bv_util.mk_sle(shift, bv0_e2), shift_neg, shift);
+ SASSERT(m_bv_util.get_bv_size(shift) == ebits + 2);
+ SASSERT(m_bv_util.get_bv_size(shift_neg) == ebits + 2);
+ SASSERT(m_bv_util.get_bv_size(shift_abs) == ebits + 2);
+ dbg_decouple("fpa2bv_to_ubv_shift", shift);
+ dbg_decouple("fpa2bv_to_ubv_shift_abs", shift_abs);
+
+ // x is of the form +- [1].[sig][r][g][s] ... and at least bv_sz + 3 long
+ // [1][ ... sig ... ][r][g][ ... s ...]
+ // [ ... ubv ... ][r][g][ ... s ... ]
+ expr_ref max_shift(m);
+ max_shift = m_bv_util.mk_numeral(sig_sz, sig_sz);
+ shift_abs = m_bv_util.mk_zero_extend(sig_sz - ebits - 2, shift_abs);
+ SASSERT(m_bv_util.get_bv_size(shift_abs) == sig_sz);
+
+ expr_ref c_in_limits(m);
+ c_in_limits = m_bv_util.mk_sle(shift, m_bv_util.mk_numeral(0, ebits + 2));
+ dbg_decouple("fpa2bv_to_ubv_in_limits", c_in_limits);
+
+ expr_ref shifted_sig(m);
+ shifted_sig = m_bv_util.mk_bv_lshr(sig, shift_abs);
+ dbg_decouple("fpa2bv_to_ubv_shifted_sig", shifted_sig);
+
+ expr_ref last(m), round(m), sticky(m);
+ last = m_bv_util.mk_extract(sig_sz - bv_sz - 0, sig_sz - bv_sz - 0, shifted_sig);
+ round = m_bv_util.mk_extract(sig_sz - bv_sz - 1, sig_sz - bv_sz - 1, shifted_sig);
+ sticky = m.mk_ite(m.mk_eq(m_bv_util.mk_extract(sig_sz - bv_sz - 2, 0, shifted_sig),
+ m_bv_util.mk_numeral(0, sig_sz - (bv_sz + 3) + 2)),
+ bv0,
+ bv1);
+ dbg_decouple("fpa2bv_to_ubv_last", last);
+ dbg_decouple("fpa2bv_to_ubv_round", round);
+ dbg_decouple("fpa2bv_to_ubv_sticky", sticky);
+
+ expr_ref rounding_decision(m);
+ rounding_decision = mk_rounding_decision(rm, sgn, last, round, sticky);
+ SASSERT(m_bv_util.get_bv_size(rounding_decision) == 1);
+ dbg_decouple("fpa2bv_to_ubv_rounding_decision", rounding_decision);
+
+ expr_ref unrounded_sig(m), pre_rounded(m), inc(m);
+ unrounded_sig = m_bv_util.mk_zero_extend(1, m_bv_util.mk_extract(sig_sz - 1, sig_sz - bv_sz, shifted_sig));
+ inc = m_bv_util.mk_zero_extend(1, m_bv_util.mk_zero_extend(bv_sz - 1, rounding_decision));
+ pre_rounded = m_bv_util.mk_bv_add(unrounded_sig, inc);
+
+ expr_ref rnd_overflow(m), rnd(m), rnd_has_overflown(m);
+ rnd_overflow = m_bv_util.mk_extract(bv_sz, bv_sz, pre_rounded);
+ rnd = m_bv_util.mk_extract(bv_sz - 1, 0, pre_rounded);
+ rnd_has_overflown = m.mk_eq(rnd_overflow, bv1);
+ dbg_decouple("fpa2bv_to_ubv_rnd_has_overflown", rnd_has_overflown);
+
+ result = m.mk_ite(rnd_has_overflown, mk_to_ubv_unspecified(bv_sz), rnd);
+ result = m.mk_ite(c_in_limits, result, mk_to_ubv_unspecified(bv_sz));
+ result = m.mk_ite(c2, v2, result);
+ result = m.mk_ite(c1, v1, result);
+
+ SASSERT(is_well_sorted(m, result));
+}
+
+void fpa2bv_converter::mk_to_sbv(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
+ TRACE("fpa2bv_to_sbv", for (unsigned i = 0; i < num; i++)
+ tout << "arg" << i << " = " << mk_ismt2_pp(args[i], m) << std::endl;);
+
+ SASSERT(f->get_num_parameters() == 1);
+ SASSERT(f->get_parameter(0).is_int());
+ SASSERT(num == 2);
+ SASSERT(m_bv_util.get_bv_size(args[0]) == 3);
+ SASSERT(m_util.is_float(args[1]));
+
+ expr * rm = args[0];
+ expr * x = args[1];
+ sort * xs = m.get_sort(x);
+ sort * bv_srt = f->get_range();
+
+ unsigned ebits = m_util.get_ebits(xs);
+ unsigned sbits = m_util.get_sbits(xs);
+ unsigned bv_sz = (unsigned)f->get_parameter(0).get_int();
+
+ expr_ref bv0(m), bv1(m), bv0_2(m), bv1_2(m), bv3_2(m);
+ bv0 = m_bv_util.mk_numeral(0, 1);
+ bv1 = m_bv_util.mk_numeral(1, 1);
+ bv0_2 = m_bv_util.mk_numeral(0, 2);
+ bv1_2 = m_bv_util.mk_numeral(1, 2);
+ bv3_2 = m_bv_util.mk_numeral(3, 2);
+
+ expr_ref x_is_nan(m), x_is_inf(m), x_is_zero(m), x_is_neg(m), x_is_nzero(m);
+ mk_is_nan(x, x_is_nan);
+ mk_is_inf(x, x_is_inf);
+ mk_is_zero(x, x_is_zero);
+ mk_is_neg(x, x_is_neg);
+ mk_is_nzero(x, x_is_nzero);
+
+ // NaN, Inf -> unspecified
+ expr_ref c1(m), v1(m);
+ c1 = m.mk_or(x_is_nan, x_is_inf);
+ v1 = mk_to_sbv_unspecified(bv_sz);
+ dbg_decouple("fpa2bv_to_sbv_c1", c1);
+
+ // +-Zero -> 0
+ expr_ref c2(m), v2(m);
+ c2 = x_is_zero;
+ v2 = m_bv_util.mk_numeral(rational(0), bv_srt);
+ dbg_decouple("fpa2bv_to_sbv_c2", c2);
+
+ // Otherwise...
+ expr_ref sgn(m), sig(m), exp(m), lz(m);
+ unpack(x, sgn, sig, exp, lz, true);
+
+ dbg_decouple("fpa2bv_to_sbv_sgn", sgn);
+ dbg_decouple("fpa2bv_to_sbv_sig", sig);
+ dbg_decouple("fpa2bv_to_sbv_exp", exp);
+
+ // x is of the form +- [1].[sig] * 2^(exp-lz)
+ SASSERT(m_bv_util.get_bv_size(sgn) == 1);
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits);
+ SASSERT(m_bv_util.get_bv_size(lz) == ebits);
+ dbg_decouple("fpa2bv_to_sbv_sig", sig);
+ unsigned sig_sz = m_bv_util.get_bv_size(sig);
+ SASSERT(sig_sz == sbits);
+ if (sig_sz < (bv_sz + 3))
+ sig = m_bv_util.mk_concat(sig, m_bv_util.mk_numeral(0, bv_sz - sig_sz + 3));
+ sig_sz = m_bv_util.get_bv_size(sig);
+ SASSERT(sig_sz >= (bv_sz + 3));
+
+ expr_ref exp_m_lz(m), shift(m), shift_neg(m), bv0_e2(m), shift_abs(m);
+ exp_m_lz = m_bv_util.mk_bv_sub(m_bv_util.mk_sign_extend(2, exp),
+ m_bv_util.mk_zero_extend(2, lz));
+ shift = m_bv_util.mk_bv_sub(exp_m_lz,
+ m_bv_util.mk_numeral(bv_sz - 1, ebits + 2));
+ shift_neg = m_bv_util.mk_bv_neg(shift);
+ bv0_e2 = m_bv_util.mk_numeral(0, ebits + 2);
+ shift_abs = m.mk_ite(m_bv_util.mk_sle(shift, bv0_e2), shift_neg, shift);
+ SASSERT(m_bv_util.get_bv_size(shift) == ebits + 2);
+ SASSERT(m_bv_util.get_bv_size(shift_neg) == ebits + 2);
+ SASSERT(m_bv_util.get_bv_size(shift_abs) == ebits + 2);
+ dbg_decouple("fpa2bv_to_sbv_shift", shift);
+ dbg_decouple("fpa2bv_to_sbv_shift_abs", shift_abs);
+
+ // sig is of the form +- [1].[sig][r][g][s] ... and at least bv_sz + 3 long
+ // [1][ ... sig ... ][r][g][ ... s ...]
+ // [ ... ubv ... ][r][g][ ... s ... ]
+ expr_ref max_shift(m);
+ max_shift = m_bv_util.mk_numeral(sig_sz, sig_sz);
+ shift_abs = m_bv_util.mk_zero_extend(sig_sz - ebits - 2, shift_abs);
+ SASSERT(m_bv_util.get_bv_size(shift_abs) == sig_sz);
+
+ expr_ref c_in_limits(m);
+ c_in_limits = m_bv_util.mk_sle(shift, m_bv_util.mk_numeral(0, ebits + 2));
+ dbg_decouple("fpa2bv_to_sbv_in_limits", c_in_limits);
+
+ expr_ref shifted_sig(m);
+ shifted_sig = m_bv_util.mk_bv_lshr(sig, shift_abs);
+ dbg_decouple("fpa2bv_to_sbv_shifted_sig", shifted_sig);
+
+ expr_ref last(m), round(m), sticky(m);
+ last = m_bv_util.mk_extract(sig_sz - bv_sz - 0, sig_sz - bv_sz - 0, shifted_sig);
+ round = m_bv_util.mk_extract(sig_sz - bv_sz - 1, sig_sz - bv_sz - 1, shifted_sig);
+ sticky = m.mk_ite(m.mk_eq(m_bv_util.mk_extract(sig_sz - bv_sz - 2, 0, shifted_sig),
+ m_bv_util.mk_numeral(0, sig_sz - (bv_sz + 3) + 2)),
+ bv0,
+ bv1);
+ dbg_decouple("fpa2bv_to_sbv_last", last);
+ dbg_decouple("fpa2bv_to_sbv_round", round);
+ dbg_decouple("fpa2bv_to_sbv_sticky", sticky);
+
+ expr_ref rounding_decision(m);
+ rounding_decision = mk_rounding_decision(rm, sgn, last, round, sticky);
+ SASSERT(m_bv_util.get_bv_size(rounding_decision) == 1);
+ dbg_decouple("fpa2bv_to_sbv_rounding_decision", rounding_decision);
+
+ expr_ref unrounded_sig(m), pre_rounded(m), inc(m);
+ unrounded_sig = m_bv_util.mk_zero_extend(1, m_bv_util.mk_extract(sig_sz - 1, sig_sz - bv_sz, shifted_sig));
+ inc = m_bv_util.mk_zero_extend(1, m_bv_util.mk_zero_extend(bv_sz - 1, rounding_decision));
+ pre_rounded = m_bv_util.mk_bv_add(unrounded_sig, inc);
+ dbg_decouple("fpa2bv_to_sbv_inc", inc);
+ dbg_decouple("fpa2bv_to_sbv_unrounded_sig", unrounded_sig);
+ dbg_decouple("fpa2bv_to_sbv_pre_rounded", pre_rounded);
+
+ expr_ref rnd_overflow(m), rnd_abs(m), rnd_signed(m), rnd_has_overflown(m), extra_neg(m);
+ rnd_overflow = m_bv_util.mk_extract(bv_sz, bv_sz - 1, pre_rounded);
+ rnd_abs = m_bv_util.mk_extract(bv_sz - 1, 0, pre_rounded);
+ rnd_signed = m.mk_ite(m.mk_eq(sgn, bv1), m_bv_util.mk_bv_neg(rnd_abs), rnd_abs);
+ extra_neg = m_bv_util.mk_numeral(fu().fm().m_powers2(bv_sz-1), bv_sz+1);
+ rnd_has_overflown = m.mk_and(m.mk_not(m.mk_eq(rnd_overflow, bv0_2)),
+ m.mk_not(m.mk_and(m.mk_eq(sgn, bv1), m.mk_eq(pre_rounded, extra_neg))));
+ dbg_decouple("fpa2bv_to_sbv_extra_neg", extra_neg);
+ dbg_decouple("fpa2bv_to_sbv_rnd_overflow", rnd_overflow);
+ dbg_decouple("fpa2bv_to_sbv_rnd_abs", rnd_abs);
+ dbg_decouple("fpa2bv_to_sbv_rnd_has_overflown", rnd_has_overflown);
+
+ result = m.mk_ite(rnd_has_overflown, mk_to_sbv_unspecified(bv_sz), rnd_signed);
+ result = m.mk_ite(c_in_limits, result, mk_to_sbv_unspecified(bv_sz));
+ result = m.mk_ite(c2, v2, result);
+ result = m.mk_ite(c1, v1, result);
+
+ SASSERT(is_well_sorted(m, result));
+}
+
+expr_ref fpa2bv_converter::mk_to_ubv_unspecified(unsigned width) {
+ if (m_hi_fp_unspecified)
+ return expr_ref(m_bv_util.mk_numeral(0, width), m);
+ else
+ return expr_ref(m_util.mk_internal_to_ubv_unspecified(width), m);
+}
+
+expr_ref fpa2bv_converter::mk_to_sbv_unspecified(unsigned width) {
+ if (m_hi_fp_unspecified)
+ return expr_ref(m_bv_util.mk_numeral(0, width), m);
+ else
+ return expr_ref(m_util.mk_internal_to_sbv_unspecified(width), m);
+}
+
+expr_ref fpa2bv_converter::mk_to_real_unspecified() {
+ if (m_hi_fp_unspecified)
+ return expr_ref(m_arith_util.mk_numeral(rational(0), false), m);
+ else
+ return expr_ref(m_util.mk_internal_to_real_unspecified(), m);
+}
+
+void fpa2bv_converter::mk_fp(expr * sign, expr * exponent, expr * significand, expr_ref & result) {
+ SASSERT(m_bv_util.is_bv(sign) && m_bv_util.get_bv_size(sign) == 1);
+ SASSERT(m_bv_util.is_bv(significand));
+ SASSERT(m_bv_util.is_bv(exponent));
+ result = m.mk_app(m_util.get_family_id(), OP_FPA_FP, sign, exponent, significand);
+}
+
void fpa2bv_converter::mk_fp(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
SASSERT(num == 3);
- mk_triple(args[0], args[2], args[1], result);
+ SASSERT(m_bv_util.get_bv_size(args[0]) == 1);
+ SASSERT(m_util.get_sbits(f->get_range()) == m_bv_util.get_bv_size(args[2]) + 1);
+ SASSERT(m_util.get_ebits(f->get_range()) == m_bv_util.get_bv_size(args[1]));
+ mk_fp(args[0], args[1], args[2], result);
+ TRACE("fpa2bv_mk_fp", tout << "mk_fp result = " << mk_ismt2_pp(result, m) << std::endl;);
}
-void fpa2bv_converter::mk_to_ubv(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
- SASSERT(num == 2);
- SASSERT(f->get_num_parameters() == 1);
- SASSERT(f->get_parameter(0).is_int());
-
- //unsigned ebits = m_util.get_ebits(f->get_range());
- //unsigned sbits = m_util.get_sbits(f->get_range());
- //int width = f->get_parameter(0).get_int();
-
- //expr * rm = args[0];
- //expr * x = args[1];
-
- //expr * sgn, *s, *e;
- //split(x, sgn, s, e);
-
- NOT_IMPLEMENTED_YET();
+void fpa2bv_converter::split_fp(expr * e, expr * & sgn, expr * & exp, expr * & sig) const {
+ SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_FPA_FP));
+ SASSERT(to_app(e)->get_num_args() == 3);
+ sgn = to_app(e)->get_arg(0);
+ exp = to_app(e)->get_arg(1);
+ sig = to_app(e)->get_arg(2);
}
-void fpa2bv_converter::mk_to_sbv(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
- SASSERT(num == 2);
- SASSERT(f->get_num_parameters() == 1);
- SASSERT(f->get_parameter(0).is_int());
-
- //unsigned ebits = m_util.get_ebits(f->get_range());
- //unsigned sbits = m_util.get_sbits(f->get_range());
- //int width = f->get_parameter(0).get_int();
-
- //expr * rm = args[0];
- //expr * x = args[1];
-
- //expr * sgn, *s, *e;
- //split(x, sgn, s, e);
-
- NOT_IMPLEMENTED_YET();
-}
-
-void fpa2bv_converter::mk_to_real(func_decl * f, unsigned num, expr * const * args, expr_ref & result) {
- SASSERT(num == 1);
-
- //unsigned ebits = m_util.get_ebits(f->get_range());
- //unsigned sbits = m_util.get_sbits(f->get_range());
- //int width = f->get_parameter(0).get_int();
-
- //expr * rm = args[0];
- //expr * x = args[1];
-
- //expr * sgn, *s, *e;
- //split(x, sgn, s, e);
-
- NOT_IMPLEMENTED_YET();
-}
-
-void fpa2bv_converter::split(expr * e, expr * & sgn, expr * & sig, expr * & exp) const {
- SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_TO_FLOAT));
+void fpa2bv_converter::split_fp(expr * e, expr_ref & sgn, expr_ref & exp, expr_ref & sig) const {
+ SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_FPA_FP));
SASSERT(to_app(e)->get_num_args() == 3);
-
- sgn = to_app(e)->get_arg(0);
- sig = to_app(e)->get_arg(1);
- exp = to_app(e)->get_arg(2);
+ expr *e_sgn, *e_sig, *e_exp;
+ split_fp(e, e_sgn, e_exp, e_sig);
+ sgn = e_sgn;
+ exp = e_exp;
+ sig = e_sig;
}
void fpa2bv_converter::mk_is_nan(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
// exp == 1^n , sig != 0
expr_ref sig_is_zero(m), sig_is_not_zero(m), exp_is_top(m), top_exp(m), zero(m);
@@ -2228,7 +2873,7 @@ void fpa2bv_converter::mk_is_nan(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_inf(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref eq1(m), eq2(m), top_exp(m), zero(m);
mk_top_exp(m_bv_util.get_bv_size(exp), top_exp);
zero = m_bv_util.mk_numeral(0, m_bv_util.get_bv_size(sig));
@@ -2252,7 +2897,7 @@ void fpa2bv_converter::mk_is_ninf(expr * e, expr_ref & result) {
}
void fpa2bv_converter::mk_is_pos(expr * e, expr_ref & result) {
- SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_TO_FLOAT));
+ SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_FPA_FP));
SASSERT(to_app(e)->get_num_args() == 3);
expr * a0 = to_app(e)->get_arg(0);
expr_ref zero(m);
@@ -2261,7 +2906,7 @@ void fpa2bv_converter::mk_is_pos(expr * e, expr_ref & result) {
}
void fpa2bv_converter::mk_is_neg(expr * e, expr_ref & result) {
- SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_TO_FLOAT));
+ SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_FPA_FP));
SASSERT(to_app(e)->get_num_args() == 3);
expr * a0 = to_app(e)->get_arg(0);
expr_ref one(m);
@@ -2271,7 +2916,7 @@ void fpa2bv_converter::mk_is_neg(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_zero(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref eq1(m), eq2(m), bot_exp(m), zero(m);
mk_bot_exp(m_bv_util.get_bv_size(exp), bot_exp);
zero = m_bv_util.mk_numeral(0, m_bv_util.get_bv_size(sig));
@@ -2282,7 +2927,7 @@ void fpa2bv_converter::mk_is_zero(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_nzero(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref e_is_zero(m), eq(m), one_1(m);
mk_is_zero(e, e_is_zero);
one_1 = m_bv_util.mk_numeral(1, 1);
@@ -2292,7 +2937,7 @@ void fpa2bv_converter::mk_is_nzero(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_pzero(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref e_is_zero(m), eq(m), nil_1(m);
mk_is_zero(e, e_is_zero);
nil_1 = m_bv_util.mk_numeral(0, 1);
@@ -2302,7 +2947,7 @@ void fpa2bv_converter::mk_is_pzero(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_denormal(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref zero(m);
zero = m_bv_util.mk_numeral(0, m_bv_util.get_bv_size(exp));
m_simp.mk_eq(exp, zero, result);
@@ -2310,7 +2955,7 @@ void fpa2bv_converter::mk_is_denormal(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_is_normal(expr * e, expr_ref & result) {
expr * sgn, * sig, * exp;
- split(e, sgn, sig, exp);
+ split_fp(e, sgn, exp, sig);
expr_ref is_special(m), is_denormal(m), p(m);
mk_is_denormal(e, is_denormal);
@@ -2332,12 +2977,11 @@ void fpa2bv_converter::mk_is_rm(expr * e, BV_RM_VAL rm, expr_ref & result) {
case BV_RM_TIES_TO_AWAY:
case BV_RM_TIES_TO_EVEN:
case BV_RM_TO_NEGATIVE:
- case BV_RM_TO_POSITIVE: return m_simp.mk_eq(e, rm_num, result);
+ case BV_RM_TO_POSITIVE:
case BV_RM_TO_ZERO:
+ return m_simp.mk_eq(e, rm_num, result);
default:
- rm_num = m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3);
- expr_ref r(m); r = m_bv_util.mk_ule(e, rm_num);
- return m_simp.mk_not(r, result);
+ UNREACHABLE();
}
}
@@ -2410,7 +3054,7 @@ void fpa2bv_converter::mk_bias(expr * e, expr_ref & result) {
void fpa2bv_converter::mk_unbias(expr * e, expr_ref & result) {
unsigned ebits = m_bv_util.get_bv_size(e);
- SASSERT(ebits >= 3);
+ SASSERT(ebits >= 2);
expr_ref e_plus_one(m);
e_plus_one = m_bv_util.mk_bv_add(e, m_bv_util.mk_numeral(1, ebits));
@@ -2424,7 +3068,7 @@ void fpa2bv_converter::mk_unbias(expr * e, expr_ref & result) {
}
void fpa2bv_converter::unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref & exp, expr_ref & lz, bool normalize) {
- SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_TO_FLOAT));
+ SASSERT(is_app_of(e, m_plugin->get_family_id(), OP_FPA_FP));
SASSERT(to_app(e)->get_num_args() == 3);
sort * srt = to_app(e)->get_decl()->get_range();
@@ -2432,9 +3076,11 @@ void fpa2bv_converter::unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref
unsigned sbits = m_util.get_sbits(srt);
unsigned ebits = m_util.get_ebits(srt);
- sgn = to_app(e)->get_arg(0);
- sig = to_app(e)->get_arg(1);
- exp = to_app(e)->get_arg(2);
+ split_fp(e, sgn, exp, sig);
+
+ SASSERT(m_bv_util.get_bv_size(sgn) == 1);
+ SASSERT(m_bv_util.get_bv_size(exp) == ebits);
+ SASSERT(m_bv_util.get_bv_size(sig) == sbits-1);
expr_ref is_normal(m);
mk_is_normal(e, is_normal);
@@ -2446,7 +3092,7 @@ void fpa2bv_converter::unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref
expr_ref denormal_sig(m), denormal_exp(m);
denormal_sig = m_bv_util.mk_zero_extend(1, sig);
- SASSERT(ebits >= 3); // Note: when ebits=2 there is no 1-exponent, so mk_unbias will produce a 0.
+ // SASSERT(ebits >= 3); // Note: when ebits=2 there is no 1-exponent, so mk_unbias will produce a 0.
denormal_exp = m_bv_util.mk_numeral(1, ebits);
mk_unbias(denormal_exp, denormal_exp);
dbg_decouple("fpa2bv_unpack_denormal_exp", denormal_exp);
@@ -2467,7 +3113,7 @@ void fpa2bv_converter::unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref
expr_ref shift(m);
m_simp.mk_ite(is_sig_zero, zero_e, lz, shift);
dbg_decouple("fpa2bv_unpack_shift", shift);
- SASSERT(is_well_sorted(m, is_sig_zero));
+ SASSERT(is_well_sorted(m, is_sig_zero));
SASSERT(is_well_sorted(m, shift));
SASSERT(m_bv_util.get_bv_size(shift) == ebits);
if (ebits <= sbits) {
@@ -2518,12 +3164,12 @@ void fpa2bv_converter::unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref
void fpa2bv_converter::mk_rounding_mode(func_decl * f, expr_ref & result)
{
switch(f->get_decl_kind())
- {
- case OP_RM_NEAREST_TIES_TO_AWAY: result = m_bv_util.mk_numeral(BV_RM_TIES_TO_AWAY, 3); break;
- case OP_RM_NEAREST_TIES_TO_EVEN: result = m_bv_util.mk_numeral(BV_RM_TIES_TO_EVEN, 3); break;
- case OP_RM_TOWARD_NEGATIVE: result = m_bv_util.mk_numeral(BV_RM_TO_NEGATIVE, 3); break;
- case OP_RM_TOWARD_POSITIVE: result = m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3); break;
- case OP_RM_TOWARD_ZERO: result = m_bv_util.mk_numeral(BV_RM_TO_ZERO, 3); break;
+ {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN: result = m_bv_util.mk_numeral(BV_RM_TIES_TO_EVEN, 3); break;
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY: result = m_bv_util.mk_numeral(BV_RM_TIES_TO_AWAY, 3); break;
+ case OP_FPA_RM_TOWARD_POSITIVE: result = m_bv_util.mk_numeral(BV_RM_TO_POSITIVE, 3); break;
+ case OP_FPA_RM_TOWARD_NEGATIVE: result = m_bv_util.mk_numeral(BV_RM_TO_NEGATIVE, 3); break;
+ case OP_FPA_RM_TOWARD_ZERO: result = m_bv_util.mk_numeral(BV_RM_TO_ZERO, 3); break;
default: UNREACHABLE();
}
}
@@ -2534,11 +3180,52 @@ void fpa2bv_converter::dbg_decouple(const char * prefix, expr_ref & e) {
// CMW: This works only for quantifier-free formulas.
expr_ref new_e(m);
new_e = m.mk_fresh_const(prefix, m.get_sort(e));
- extra_assertions.push_back(m.mk_eq(new_e, e));
+ m_extra_assertions.push_back(m.mk_eq(new_e, e));
e = new_e;
#endif
}
+expr_ref fpa2bv_converter::mk_rounding_decision(expr * rm, expr * sgn, expr * last, expr * round, expr * sticky) {
+ expr_ref last_or_sticky(m), round_or_sticky(m), not_last(m), not_round(m), not_sticky(m), not_lors(m), not_rors(m), not_sgn(m);
+ expr * last_sticky[2] = { last, sticky };
+ expr * round_sticky[2] = { round, sticky };
+ last_or_sticky = m_bv_util.mk_bv_or(2, last_sticky);
+ round_or_sticky = m_bv_util.mk_bv_or(2, round_sticky);
+ not_last= m_bv_util.mk_bv_not(last);
+ not_round = m_bv_util.mk_bv_not(round);
+ not_sticky = m_bv_util.mk_bv_not(sticky);
+ not_lors = m_bv_util.mk_bv_not(last_or_sticky);
+ not_rors = m_bv_util.mk_bv_not(round_or_sticky);
+ not_sgn = m_bv_util.mk_bv_not(sgn);
+ expr * nround_lors[2] = { not_round, not_lors };
+ expr * pos_args[2] = { sgn, not_rors };
+ expr * neg_args[2] = { not_sgn, not_rors };
+ expr * nl_r[2] = { last, not_round };
+ expr * nl_nr_sn[3] = { not_last, not_round, not_sticky };
+
+ expr_ref inc_teven(m), inc_taway(m), inc_pos(m), inc_neg(m);
+ inc_teven = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, nround_lors));
+ expr *taway_args[2] = { m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, nl_r)),
+ m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(3, nl_nr_sn)) };
+ inc_taway = m_bv_util.mk_bv_or(2, taway_args);
+ inc_pos = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, pos_args));
+ inc_neg = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, neg_args));
+
+ expr_ref res(m), inc_c2(m), inc_c3(m), inc_c4(m);
+ expr_ref rm_is_to_neg(m), rm_is_to_pos(m), rm_is_away(m), rm_is_even(m), nil_1(m);
+ nil_1 = m_bv_util.mk_numeral(0, 1);
+ mk_is_rm(rm, BV_RM_TO_NEGATIVE, rm_is_to_neg);
+ mk_is_rm(rm, BV_RM_TO_POSITIVE, rm_is_to_pos);
+ mk_is_rm(rm, BV_RM_TIES_TO_AWAY, rm_is_away);
+ mk_is_rm(rm, BV_RM_TIES_TO_EVEN, rm_is_even);
+ m_simp.mk_ite(rm_is_to_neg, inc_neg, nil_1, inc_c4);
+ m_simp.mk_ite(rm_is_to_pos, inc_pos, inc_c4, inc_c3);
+ m_simp.mk_ite(rm_is_away, inc_taway, inc_c3, inc_c2);
+ m_simp.mk_ite(rm_is_even, inc_teven, inc_c2, res);
+
+ return res;
+}
+
void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref & sig, expr_ref & exp, expr_ref & result) {
unsigned ebits = m_util.get_ebits(s);
unsigned sbits = m_util.get_sbits(s);
@@ -2564,7 +3251,6 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
// i.e., it has 2 + (sbits-1) + 3 = sbits + 4 bits, where the first one is in sgn.
// Furthermore, note that sig is an unsigned bit-vector, while exp is signed.
- SASSERT(ebits <= sbits);
SASSERT(m_bv_util.is_bv(rm) && m_bv_util.get_bv_size(rm) == 3);
SASSERT(m_bv_util.is_bv(sgn) && m_bv_util.get_bv_size(sgn) == 1);
SASSERT(m_bv_util.is_bv(sig) && m_bv_util.get_bv_size(sig) >= 5);
@@ -2634,7 +3320,6 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
SASSERT(is_well_sorted(m, beta));
dbg_decouple("fpa2bv_rnd_beta", beta);
-
dbg_decouple("fpa2bv_rnd_e_min", e_min);
dbg_decouple("fpa2bv_rnd_e_max", e_max);
@@ -2715,36 +3400,8 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
sig = m_bv_util.mk_extract(sbits+1, 2, sig);
- expr_ref last_or_sticky(m), round_or_sticky(m), not_round(m), not_lors(m), not_rors(m), not_sgn(m);
- expr * last_sticky[2] = { last, sticky };
- expr * round_sticky[2] = { round, sticky };
- last_or_sticky = m_bv_util.mk_bv_or(2, last_sticky);
- round_or_sticky = m_bv_util.mk_bv_or(2, round_sticky);
- not_round = m_bv_util.mk_bv_not(round);
- not_lors = m_bv_util.mk_bv_not(last_or_sticky);
- not_rors = m_bv_util.mk_bv_not(round_or_sticky);
- not_sgn = m_bv_util.mk_bv_not(sgn);
- expr * round_lors[2] = { not_round, not_lors};
- expr * pos_args[2] = { sgn, not_rors };
- expr * neg_args[2] = { not_sgn, not_rors };
-
- expr_ref inc_teven(m), inc_taway(m), inc_pos(m), inc_neg(m);
- inc_teven = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, round_lors));
- inc_taway = round;
- inc_pos = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, pos_args));
- inc_neg = m_bv_util.mk_bv_not(m_bv_util.mk_bv_or(2, neg_args));
-
- expr_ref inc(m), inc_c2(m), inc_c3(m), inc_c4(m);
- expr_ref rm_is_to_neg(m), rm_is_to_pos(m), rm_is_away(m), rm_is_even(m), nil_1(m);
- nil_1 = m_bv_util.mk_numeral(0, 1);
- mk_is_rm(rm, BV_RM_TO_NEGATIVE, rm_is_to_neg);
- mk_is_rm(rm, BV_RM_TO_POSITIVE, rm_is_to_pos);
- mk_is_rm(rm, BV_RM_TIES_TO_AWAY, rm_is_away);
- mk_is_rm(rm, BV_RM_TIES_TO_EVEN, rm_is_even);
- m_simp.mk_ite(rm_is_to_neg, inc_neg, nil_1, inc_c4);
- m_simp.mk_ite(rm_is_to_pos, inc_pos, inc_c4, inc_c3);
- m_simp.mk_ite(rm_is_away, inc_taway, inc_c3, inc_c2);
- m_simp.mk_ite(rm_is_even, inc_teven, inc_c2, inc);
+ expr_ref inc(m);
+ inc = mk_rounding_decision(rm, sgn, last, round, sticky);
SASSERT(m_bv_util.get_bv_size(inc) == 1 && is_well_sorted(m, inc));
dbg_decouple("fpa2bv_rnd_inc", inc);
@@ -2813,13 +3470,23 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
mk_top_exp(ebits, top_exp);
mk_bot_exp(ebits, bot_exp);
- expr_ref rm_is_to_zero(m), rm_zero_or_neg(m), rm_zero_or_pos(m);
+ expr_ref nil_1(m);
+ nil_1 = m_bv_util.mk_numeral(0, 1);
+
+ expr_ref rm_is_to_zero(m), rm_is_to_neg(m), rm_is_to_pos(m), rm_zero_or_neg(m), rm_zero_or_pos(m);
mk_is_rm(rm, BV_RM_TO_ZERO, rm_is_to_zero);
+ mk_is_rm(rm, BV_RM_TO_NEGATIVE, rm_is_to_neg);
+ mk_is_rm(rm, BV_RM_TO_POSITIVE, rm_is_to_pos);
m_simp.mk_or(rm_is_to_zero, rm_is_to_neg, rm_zero_or_neg);
m_simp.mk_or(rm_is_to_zero, rm_is_to_pos, rm_zero_or_pos);
+ dbg_decouple("fpa2bv_rnd_rm_is_to_zero", rm_is_to_zero);
+ dbg_decouple("fpa2bv_rnd_rm_is_to_neg", rm_is_to_neg);
+ dbg_decouple("fpa2bv_rnd_rm_is_to_pos", rm_is_to_pos);
+
expr_ref sgn_is_zero(m);
m_simp.mk_eq(sgn, m_bv_util.mk_numeral(0, 1), sgn_is_zero);
+ dbg_decouple("fpa2bv_rnd_sgn_is_zero", sgn_is_zero);
expr_ref max_sig(m), max_exp(m), inf_sig(m), inf_exp(m);
max_sig = m_bv_util.mk_numeral(fu().fm().m_powers2.m1(sbits-1, false), sbits-1);
@@ -2829,22 +3496,30 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
inf_exp = top_exp;
dbg_decouple("fpa2bv_rnd_max_exp", max_exp);
+ dbg_decouple("fpa2bv_rnd_max_sig", max_sig);
+ dbg_decouple("fpa2bv_rnd_inf_sig", inf_sig);
+ dbg_decouple("fpa2bv_rnd_inf_exp", inf_exp);
- expr_ref ovfl_exp(m), max_inf_exp_neg(m), max_inf_exp_pos(m), n_d_check(m), n_d_exp(m);
- m_simp.mk_ite(rm_zero_or_neg, max_exp, inf_exp, max_inf_exp_neg);
- m_simp.mk_ite(rm_zero_or_pos, max_exp, inf_exp, max_inf_exp_pos);
- m_simp.mk_ite(sgn_is_zero, max_inf_exp_neg, max_inf_exp_pos, ovfl_exp);
+ expr_ref ovfl_exp(m), max_inf_exp_neg(m), max_inf_exp_pos(m), n_d_check(m), n_d_exp(m);
+ m_simp.mk_ite(rm_zero_or_pos, max_exp, inf_exp, max_inf_exp_neg);
+ m_simp.mk_ite(rm_zero_or_neg, max_exp, inf_exp, max_inf_exp_pos);
+ m_simp.mk_ite(sgn_is_zero, max_inf_exp_pos, max_inf_exp_neg, ovfl_exp);
t_sig = m_bv_util.mk_extract(sbits-1, sbits-1, sig);
m_simp.mk_eq(t_sig, nil_1, n_d_check);
m_simp.mk_ite(n_d_check, bot_exp /* denormal */, biased_exp, n_d_exp);
m_simp.mk_ite(OVF, ovfl_exp, n_d_exp, exp);
expr_ref max_inf_sig_neg(m), max_inf_sig_pos(m), ovfl_sig(m), rest_sig(m);
- m_simp.mk_ite(rm_zero_or_neg, max_sig, inf_sig, max_inf_sig_neg);
- m_simp.mk_ite(rm_zero_or_pos, max_sig, inf_sig, max_inf_sig_pos);
- m_simp.mk_ite(sgn_is_zero, max_inf_sig_neg, max_inf_sig_pos, ovfl_sig);
+ m_simp.mk_ite(rm_zero_or_pos, max_sig, inf_sig, max_inf_sig_neg);
+ m_simp.mk_ite(rm_zero_or_neg, max_sig, inf_sig, max_inf_sig_pos);
+ m_simp.mk_ite(sgn_is_zero, max_inf_sig_pos, max_inf_sig_neg, ovfl_sig);
rest_sig = m_bv_util.mk_extract(sbits-2, 0, sig);
m_simp.mk_ite(OVF, ovfl_sig, rest_sig, sig);
+
+ dbg_decouple("fpa2bv_rnd_max_inf_sig_neg", max_inf_sig_neg);
+ dbg_decouple("fpa2bv_rnd_max_inf_sig_pos", max_inf_sig_pos);
+ dbg_decouple("fpa2bv_rnd_rm_zero_or_neg", rm_zero_or_neg);
+ dbg_decouple("fpa2bv_rnd_rm_zero_or_pos", rm_zero_or_pos);
dbg_decouple("fpa2bv_rnd_sgn_final", sgn);
dbg_decouple("fpa2bv_rnd_sig_final", sig);
@@ -2862,7 +3537,26 @@ void fpa2bv_converter::round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref &
SASSERT(m_bv_util.get_bv_size(res_exp) == ebits);
SASSERT(is_well_sorted(m, res_exp));
- mk_triple(res_sgn, res_sig, res_exp, result);
+ mk_fp(res_sgn, res_exp, res_sig, result);
TRACE("fpa2bv_round", tout << "ROUND = " << mk_ismt2_pp(result, m) << std::endl; );
}
+
+
+void fpa2bv_converter::reset(void) {
+ dec_ref_map_key_values(m, m_const2bv);
+ dec_ref_map_key_values(m, m_rm_const2bv);
+ dec_ref_map_key_values(m, m_uf2bvuf);
+
+ obj_map::iterator it = m_uf23bvuf.begin();
+ obj_map::iterator end = m_uf23bvuf.end();
+ for (; it != end; ++it) {
+ m.dec_ref(it->m_key);
+ m.dec_ref(it->m_value.f_sgn);
+ m.dec_ref(it->m_value.f_sig);
+ m.dec_ref(it->m_value.f_exp);
+ }
+ m_uf23bvuf.reset();
+
+ m_extra_assertions.reset();
+}
diff --git a/src/ast/fpa/fpa2bv_converter.h b/src/ast/fpa/fpa2bv_converter.h
index eb539d8ae..fa797b610 100644
--- a/src/ast/fpa/fpa2bv_converter.h
+++ b/src/ast/fpa/fpa2bv_converter.h
@@ -22,11 +22,11 @@ Notes:
#include"ast.h"
#include"obj_hashtable.h"
#include"ref_util.h"
-#include"float_decl_plugin.h"
+#include"fpa_decl_plugin.h"
#include"bv_decl_plugin.h"
#include"basic_simplifier_plugin.h"
-typedef enum { BV_RM_TIES_TO_AWAY=0, BV_RM_TIES_TO_EVEN=1, BV_RM_TO_NEGATIVE=2, BV_RM_TO_POSITIVE=3, BV_RM_TO_ZERO=4 } BV_RM_VAL;
+typedef enum { BV_RM_TIES_TO_EVEN, BV_RM_TIES_TO_AWAY, BV_RM_TO_POSITIVE, BV_RM_TO_NEGATIVE, BV_RM_TO_ZERO = 4 } BV_RM_VAL;
struct func_decl_triple {
func_decl_triple () { f_sgn = 0; f_sig = 0; f_exp = 0; }
@@ -42,14 +42,16 @@ struct func_decl_triple {
};
class fpa2bv_converter {
+protected:
ast_manager & m;
basic_simplifier_plugin m_simp;
- float_util m_util;
+ fpa_util m_util;
bv_util m_bv_util;
arith_util m_arith_util;
mpf_manager & m_mpf_manager;
unsynch_mpz_manager & m_mpz_manager;
- float_decl_plugin * m_plugin;
+ fpa_decl_plugin * m_plugin;
+ bool m_hi_fp_unspecified;
obj_map m_const2bv;
obj_map m_rm_const2bv;
@@ -60,8 +62,9 @@ public:
fpa2bv_converter(ast_manager & m);
~fpa2bv_converter();
- float_util & fu() { return m_util; }
+ fpa_util & fu() { return m_util; }
bv_util & bu() { return m_bv_util; }
+ arith_util & au() { return m_arith_util; }
bool is_float(sort * s) { return m_util.is_float(s); }
bool is_float(expr * e) { return is_app(e) && m_util.is_float(to_app(e)->get_decl()->get_range()); }
@@ -69,25 +72,24 @@ public:
bool is_rm(sort * s) { return m_util.is_rm(s); }
bool is_float_family(func_decl * f) { return f->get_family_id() == m_util.get_family_id(); }
- void mk_triple(expr * sign, expr * significand, expr * exponent, expr_ref & result) {
- SASSERT(m_bv_util.is_bv(sign) && m_bv_util.get_bv_size(sign) == 1);
- SASSERT(m_bv_util.is_bv(significand));
- SASSERT(m_bv_util.is_bv(exponent));
- result = m.mk_app(m_util.get_family_id(), OP_TO_FLOAT, sign, significand, exponent);
- }
+ void mk_fp(expr * sign, expr * exponent, expr * significand, expr_ref & result);
+ void mk_fp(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+
+ void split_fp(expr * e, expr * & sgn, expr * & exp, expr * & sig) const;
+ void split_fp(expr * e, expr_ref & sgn, expr_ref & exp, expr_ref & sig) const;
void mk_eq(expr * a, expr * b, expr_ref & result);
void mk_ite(expr * c, expr * t, expr * f, expr_ref & result);
void mk_rounding_mode(func_decl * f, expr_ref & result);
- void mk_value(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
- void mk_const(func_decl * f, expr_ref & result);
- void mk_rm_const(func_decl * f, expr_ref & result);
+ void mk_numeral(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ virtual void mk_const(func_decl * f, expr_ref & result);
+ virtual void mk_rm_const(func_decl * f, expr_ref & result);
void mk_uninterpreted_function(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
void mk_var(unsigned base_inx, sort * srt, expr_ref & result);
- void mk_plus_inf(func_decl * f, expr_ref & result);
- void mk_minus_inf(func_decl * f, expr_ref & result);
+ void mk_pinf(func_decl * f, expr_ref & result);
+ void mk_ninf(func_decl * f, expr_ref & result);
void mk_nan(func_decl * f, expr_ref & result);
void mk_nzero(func_decl *f, expr_ref & result);
void mk_pzero(func_decl *f, expr_ref & result);
@@ -119,28 +121,36 @@ public:
void mk_is_nan(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
void mk_is_inf(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
void mk_is_normal(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
- void mk_is_subnormal(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_is_subnormal(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
- void mk_to_float(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
- void mk_to_ieee_bv(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
-
- void mk_fp(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_to_fp(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_to_fp_float(func_decl * f, sort * s, expr * rm, expr * x, expr_ref & result);
+ void mk_to_fp_signed(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
void mk_to_fp_unsigned(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_to_ieee_bv(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_to_fp_real(func_decl * f, sort * s, expr * rm, expr * x, expr_ref & result);
+ void mk_to_fp_real_int(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+
void mk_to_ubv(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
void mk_to_sbv(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
- void mk_to_real(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+ void mk_to_real(func_decl * f, unsigned num, expr * const * args, expr_ref & result);
+
+ void set_unspecified_fp_hi(bool v) { m_hi_fp_unspecified = v; }
+ expr_ref mk_to_ubv_unspecified(unsigned width);
+ expr_ref mk_to_sbv_unspecified(unsigned width);
+ expr_ref mk_to_real_unspecified();
obj_map const & const2bv() const { return m_const2bv; }
obj_map const & rm_const2bv() const { return m_rm_const2bv; }
obj_map const & uf2bvuf() const { return m_uf2bvuf; }
obj_map const & uf23bvuf() const { return m_uf23bvuf; }
+ void reset(void);
+
void dbg_decouple(const char * prefix, expr_ref & e);
- expr_ref_vector extra_assertions;
+ expr_ref_vector m_extra_assertions;
protected:
- void split(expr * e, expr * & sgn, expr * & sig, expr * & exp) const;
-
void mk_is_nan(expr * e, expr_ref & result);
void mk_is_inf(expr * e, expr_ref & result);
void mk_is_pinf(expr * e, expr_ref & result);
@@ -167,10 +177,13 @@ protected:
void unpack(expr * e, expr_ref & sgn, expr_ref & sig, expr_ref & exp, expr_ref & lz, bool normalize);
void round(sort * s, expr_ref & rm, expr_ref & sgn, expr_ref & sig, expr_ref & exp, expr_ref & result);
+ expr_ref mk_rounding_decision(expr * rm, expr * sgn, expr * last, expr * round, expr * sticky);
void add_core(unsigned sbits, unsigned ebits, expr_ref & rm,
expr_ref & c_sgn, expr_ref & c_sig, expr_ref & c_exp, expr_ref & d_sgn, expr_ref & d_sig, expr_ref & d_exp,
expr_ref & res_sgn, expr_ref & res_sig, expr_ref & res_exp);
+
+ app * mk_fresh_const(char const * prefix, unsigned sz);
};
#endif
diff --git a/src/ast/fpa/fpa2bv_rewriter.h b/src/ast/fpa/fpa2bv_rewriter.h
index 7a245b71a..ed885a4cc 100644
--- a/src/ast/fpa/fpa2bv_rewriter.h
+++ b/src/ast/fpa/fpa2bv_rewriter.h
@@ -24,6 +24,7 @@ Notes:
#include"rewriter_def.h"
#include"bv_decl_plugin.h"
#include"fpa2bv_converter.h"
+#include"fpa2bv_rewriter_params.hpp"
struct fpa2bv_rewriter_cfg : public default_rewriter_cfg {
ast_manager & m_manager;
@@ -36,7 +37,7 @@ struct fpa2bv_rewriter_cfg : public default_rewriter_cfg {
ast_manager & m() const { return m_manager; }
- fpa2bv_rewriter_cfg(ast_manager & m, fpa2bv_converter & c, params_ref const & p):
+ fpa2bv_rewriter_cfg(ast_manager & m, fpa2bv_converter & c, params_ref const & p) :
m_manager(m),
m_out(m),
m_conv(c),
@@ -58,9 +59,16 @@ struct fpa2bv_rewriter_cfg : public default_rewriter_cfg {
void reset() {
}
+ void updt_local_params(params_ref const & _p) {
+ fpa2bv_rewriter_params p(_p);
+ bool v = p.hi_fp_unspecified();
+ m_conv.set_unspecified_fp_hi(v);
+ }
+
void updt_params(params_ref const & p) {
- m_max_memory = megabytes_to_bytes(p.get_uint("max_memory", UINT_MAX));
- m_max_steps = p.get_uint("max_steps", UINT_MAX);
+ m_max_memory = megabytes_to_bytes(p.get_uint("max_memory", UINT_MAX));
+ m_max_steps = p.get_uint("max_steps", UINT_MAX);
+ updt_local_params(p);
}
bool max_steps_exceeded(unsigned num_steps) const {
@@ -107,49 +115,53 @@ struct fpa2bv_rewriter_cfg : public default_rewriter_cfg {
if (m_conv.is_float_family(f)) {
switch (f->get_decl_kind()) {
- case OP_RM_NEAREST_TIES_TO_AWAY:
- case OP_RM_NEAREST_TIES_TO_EVEN:
- case OP_RM_TOWARD_NEGATIVE:
- case OP_RM_TOWARD_POSITIVE:
- case OP_RM_TOWARD_ZERO: m_conv.mk_rounding_mode(f, result); return BR_DONE;
- case OP_FLOAT_VALUE: m_conv.mk_value(f, num, args, result); return BR_DONE;
- case OP_FLOAT_PLUS_INF: m_conv.mk_plus_inf(f, result); return BR_DONE;
- case OP_FLOAT_MINUS_INF: m_conv.mk_minus_inf(f, result); return BR_DONE;
- case OP_FLOAT_PLUS_ZERO: m_conv.mk_pzero(f, result); return BR_DONE;
- case OP_FLOAT_MINUS_ZERO: m_conv.mk_nzero(f, result); return BR_DONE;
- case OP_FLOAT_NAN: m_conv.mk_nan(f, result); return BR_DONE;
- case OP_FLOAT_ADD: m_conv.mk_add(f, num, args, result); return BR_DONE;
- case OP_FLOAT_SUB: m_conv.mk_sub(f, num, args, result); return BR_DONE;
- case OP_FLOAT_NEG: m_conv.mk_neg(f, num, args, result); return BR_DONE;
- case OP_FLOAT_MUL: m_conv.mk_mul(f, num, args, result); return BR_DONE;
- case OP_FLOAT_DIV: m_conv.mk_div(f, num, args, result); return BR_DONE;
- case OP_FLOAT_REM: m_conv.mk_rem(f, num, args, result); return BR_DONE;
- case OP_FLOAT_ABS: m_conv.mk_abs(f, num, args, result); return BR_DONE;
- case OP_FLOAT_MIN: m_conv.mk_min(f, num, args, result); return BR_DONE;
- case OP_FLOAT_MAX: m_conv.mk_max(f, num, args, result); return BR_DONE;
- case OP_FLOAT_FMA: m_conv.mk_fma(f, num, args, result); return BR_DONE;
- case OP_FLOAT_SQRT: m_conv.mk_sqrt(f, num, args, result); return BR_DONE;
- case OP_FLOAT_ROUND_TO_INTEGRAL: m_conv.mk_round_to_integral(f, num, args, result); return BR_DONE;
- case OP_FLOAT_EQ: m_conv.mk_float_eq(f, num, args, result); return BR_DONE;
- case OP_FLOAT_LT: m_conv.mk_float_lt(f, num, args, result); return BR_DONE;
- case OP_FLOAT_GT: m_conv.mk_float_gt(f, num, args, result); return BR_DONE;
- case OP_FLOAT_LE: m_conv.mk_float_le(f, num, args, result); return BR_DONE;
- case OP_FLOAT_GE: m_conv.mk_float_ge(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_ZERO: m_conv.mk_is_zero(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_NZERO: m_conv.mk_is_nzero(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_PZERO: m_conv.mk_is_pzero(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_NAN: m_conv.mk_is_nan(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_INF: m_conv.mk_is_inf(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_NORMAL: m_conv.mk_is_normal(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_SUBNORMAL: m_conv.mk_is_subnormal(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_POSITIVE: m_conv.mk_is_positive(f, num, args, result); return BR_DONE;
- case OP_FLOAT_IS_NEGATIVE: m_conv.mk_is_negative(f, num, args, result); return BR_DONE;
- case OP_TO_FLOAT: m_conv.mk_to_float(f, num, args, result); return BR_DONE;
- case OP_FLOAT_TO_IEEE_BV: m_conv.mk_to_ieee_bv(f, num, args, result); return BR_DONE;
- case OP_FLOAT_FP: m_conv.mk_fp(f, num, args, result); return BR_DONE;
- case OP_FLOAT_TO_UBV: m_conv.mk_to_ubv(f, num, args, result); return BR_DONE;
- case OP_FLOAT_TO_SBV: m_conv.mk_to_sbv(f, num, args, result); return BR_DONE;
- case OP_FLOAT_TO_REAL: m_conv.mk_to_real(f, num, args, result); return BR_DONE;
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ case OP_FPA_RM_TOWARD_ZERO: m_conv.mk_rounding_mode(f, result); return BR_DONE;
+ case OP_FPA_NUM: m_conv.mk_numeral(f, num, args, result); return BR_DONE;
+ case OP_FPA_PLUS_INF: m_conv.mk_pinf(f, result); return BR_DONE;
+ case OP_FPA_MINUS_INF: m_conv.mk_ninf(f, result); return BR_DONE;
+ case OP_FPA_PLUS_ZERO: m_conv.mk_pzero(f, result); return BR_DONE;
+ case OP_FPA_MINUS_ZERO: m_conv.mk_nzero(f, result); return BR_DONE;
+ case OP_FPA_NAN: m_conv.mk_nan(f, result); return BR_DONE;
+ case OP_FPA_ADD: m_conv.mk_add(f, num, args, result); return BR_DONE;
+ case OP_FPA_SUB: m_conv.mk_sub(f, num, args, result); return BR_DONE;
+ case OP_FPA_NEG: m_conv.mk_neg(f, num, args, result); return BR_DONE;
+ case OP_FPA_MUL: m_conv.mk_mul(f, num, args, result); return BR_DONE;
+ case OP_FPA_DIV: m_conv.mk_div(f, num, args, result); return BR_DONE;
+ case OP_FPA_REM: m_conv.mk_rem(f, num, args, result); return BR_DONE;
+ case OP_FPA_ABS: m_conv.mk_abs(f, num, args, result); return BR_DONE;
+ case OP_FPA_MIN: m_conv.mk_min(f, num, args, result); return BR_DONE;
+ case OP_FPA_MAX: m_conv.mk_max(f, num, args, result); return BR_DONE;
+ case OP_FPA_FMA: m_conv.mk_fma(f, num, args, result); return BR_DONE;
+ case OP_FPA_SQRT: m_conv.mk_sqrt(f, num, args, result); return BR_DONE;
+ case OP_FPA_ROUND_TO_INTEGRAL: m_conv.mk_round_to_integral(f, num, args, result); return BR_DONE;
+ case OP_FPA_EQ: m_conv.mk_float_eq(f, num, args, result); return BR_DONE;
+ case OP_FPA_LT: m_conv.mk_float_lt(f, num, args, result); return BR_DONE;
+ case OP_FPA_GT: m_conv.mk_float_gt(f, num, args, result); return BR_DONE;
+ case OP_FPA_LE: m_conv.mk_float_le(f, num, args, result); return BR_DONE;
+ case OP_FPA_GE: m_conv.mk_float_ge(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_ZERO: m_conv.mk_is_zero(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_NAN: m_conv.mk_is_nan(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_INF: m_conv.mk_is_inf(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_NORMAL: m_conv.mk_is_normal(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_SUBNORMAL: m_conv.mk_is_subnormal(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_POSITIVE: m_conv.mk_is_positive(f, num, args, result); return BR_DONE;
+ case OP_FPA_IS_NEGATIVE: m_conv.mk_is_negative(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_FP: m_conv.mk_to_fp(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_FP_UNSIGNED: m_conv.mk_to_fp_unsigned(f, num, args, result); return BR_DONE;
+ case OP_FPA_FP: m_conv.mk_fp(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_UBV: m_conv.mk_to_ubv(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_SBV: m_conv.mk_to_sbv(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_REAL: m_conv.mk_to_real(f, num, args, result); return BR_DONE;
+ case OP_FPA_TO_IEEE_BV: m_conv.mk_to_ieee_bv(f, num, args, result); return BR_DONE;
+ case OP_FPA_INTERNAL_BVWRAP:
+ case OP_FPA_INTERNAL_BVUNWRAP:
+ case OP_FPA_INTERNAL_TO_REAL_UNSPECIFIED:
+ case OP_FPA_INTERNAL_TO_UBV_UNSPECIFIED:
+ case OP_FPA_INTERNAL_TO_SBV_UNSPECIFIED: return BR_FAILED;
default:
TRACE("fpa2bv", tout << "unsupported operator: " << f->get_name() << "\n";
for (unsigned i = 0; i < num; i++) tout << mk_ismt2_pp(args[i], m()) << std::endl;);
@@ -247,13 +259,13 @@ struct fpa2bv_rewriter_cfg : public default_rewriter_cfg {
unsigned ebits = m_conv.fu().get_ebits(s);
unsigned sbits = m_conv.fu().get_sbits(s);
new_var = m().mk_var(t->get_idx(), m_conv.bu().mk_sort(sbits+ebits));
- m_conv.mk_triple(m_conv.bu().mk_extract(sbits+ebits-1, sbits+ebits-1, new_var),
- m_conv.bu().mk_extract(sbits+ebits-2, ebits, new_var),
- m_conv.bu().mk_extract(ebits-1, 0, new_var),
- new_exp);
+ m_conv.mk_fp(m_conv.bu().mk_extract(sbits+ebits-1, sbits+ebits-1, new_var),
+ m_conv.bu().mk_extract(ebits - 1, 0, new_var),
+ m_conv.bu().mk_extract(sbits+ebits-2, ebits, new_var),
+ new_exp);
}
else
- new_exp = m().mk_var(t->get_idx(), s);
+ new_exp = m().mk_var(t->get_idx(), s);
result = new_exp;
result_pr = 0;
diff --git a/src/ast/fpa/fpa2bv_rewriter_params.pyg b/src/ast/fpa/fpa2bv_rewriter_params.pyg
new file mode 100644
index 000000000..42df0fa0e
--- /dev/null
+++ b/src/ast/fpa/fpa2bv_rewriter_params.pyg
@@ -0,0 +1,5 @@
+def_module_params(module_name='rewriter',
+ class_name='fpa2bv_rewriter_params',
+ export=True,
+ params=(("hi_fp_unspecified", BOOL, True, "use the 'hardware interpretation' for unspecified values in fp.to_ubv, fp.to_sbv, and fp.to_real)"),
+ ))
diff --git a/src/ast/fpa_decl_plugin.cpp b/src/ast/fpa_decl_plugin.cpp
new file mode 100644
index 000000000..8cf158604
--- /dev/null
+++ b/src/ast/fpa_decl_plugin.cpp
@@ -0,0 +1,1000 @@
+/*++
+Copyright (c) 2012 Microsoft Corporation
+
+Module Name:
+
+ fpa_decl_plugin.cpp
+
+Abstract:
+
+ Floating point decl plugin
+
+Author:
+
+ Leonardo de Moura (leonardo) 2012-01-15.
+
+Revision History:
+
+--*/
+#include"fpa_decl_plugin.h"
+#include"arith_decl_plugin.h"
+#include"bv_decl_plugin.h"
+
+fpa_decl_plugin::fpa_decl_plugin():
+ m_values(m_fm),
+ m_value_table(mpf_hash_proc(m_values), mpf_eq_proc(m_values)) {
+ m_real_sort = 0;
+ m_int_sort = 0;
+ m_bv_plugin = 0;
+}
+
+void fpa_decl_plugin::set_manager(ast_manager * m, family_id id) {
+ decl_plugin::set_manager(m, id);
+
+ m_arith_fid = m_manager->mk_family_id("arith");
+ m_real_sort = m_manager->mk_sort(m_arith_fid, REAL_SORT);
+ SASSERT(m_real_sort != 0); // arith_decl_plugin must be installed before fpa_decl_plugin.
+ m_manager->inc_ref(m_real_sort);
+
+ m_int_sort = m_manager->mk_sort(m_arith_fid, INT_SORT);
+ SASSERT(m_int_sort != 0); // arith_decl_plugin must be installed before fpa_decl_plugin.
+ m_manager->inc_ref(m_int_sort);
+
+ // BV is not optional anymore.
+ SASSERT(m_manager->has_plugin(symbol("bv")));
+ m_bv_fid = m_manager->mk_family_id("bv");
+ m_bv_plugin = static_cast(m_manager->get_plugin(m_bv_fid));
+}
+
+fpa_decl_plugin::~fpa_decl_plugin() {
+}
+
+unsigned fpa_decl_plugin::mk_id(mpf const & v) {
+ unsigned new_id = m_id_gen.mk();
+ m_values.reserve(new_id+1);
+ m_fm.set(m_values[new_id], v);
+ unsigned old_id = m_value_table.insert_if_not_there(new_id);
+ if (old_id != new_id) {
+ m_id_gen.recycle(new_id);
+ m_fm.del(m_values[new_id]);
+ }
+ return old_id;
+}
+
+void fpa_decl_plugin::recycled_id(unsigned id) {
+ SASSERT(m_value_table.contains(id));
+ m_value_table.erase(id);
+ m_id_gen.recycle(id);
+ m_fm.del(m_values[id]);
+}
+
+func_decl * fpa_decl_plugin::mk_numeral_decl(mpf const & v) {
+ parameter p(mk_id(v), true);
+ SASSERT(p.is_external());
+ sort * s = mk_float_sort(v.get_ebits(), v.get_sbits());
+ return m_manager->mk_const_decl(symbol("fp.numeral"), s, func_decl_info(m_family_id, OP_FPA_NUM, 1, &p));
+}
+
+app * fpa_decl_plugin::mk_numeral(mpf const & v) {
+ sort * s = mk_float_sort(v.get_ebits(), v.get_sbits());
+ func_decl * d;
+ if (m_fm.is_nan(v))
+ d = m_manager->mk_const_decl(symbol("NaN"), s, func_decl_info(m_family_id, OP_FPA_NAN));
+ else if (m_fm.is_pinf(v))
+ d = m_manager->mk_const_decl(symbol("+oo"), s, func_decl_info(m_family_id, OP_FPA_PLUS_INF));
+ else if (m_fm.is_ninf(v))
+ d = m_manager->mk_const_decl(symbol("-oo"), s, func_decl_info(m_family_id, OP_FPA_MINUS_INF));
+ else if (m_fm.is_pzero(v))
+ d = m_manager->mk_const_decl(symbol("+zero"), s, func_decl_info(m_family_id, OP_FPA_PLUS_ZERO));
+ else if (m_fm.is_nzero(v))
+ d = m_manager->mk_const_decl(symbol("-zero"), s, func_decl_info(m_family_id, OP_FPA_MINUS_ZERO));
+ else
+ d = mk_numeral_decl(v);
+ return m_manager->mk_const(d);
+}
+
+bool fpa_decl_plugin::is_numeral(expr * n, mpf & val) {
+ if (is_app_of(n, m_family_id, OP_FPA_NUM)) {
+ m_fm.set(val, m_values[to_app(n)->get_decl()->get_parameter(0).get_ext_id()]);
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_MINUS_INF)) {
+ unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
+ unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
+ m_fm.mk_ninf(ebits, sbits, val);
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_PLUS_INF)) {
+ unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
+ unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
+ m_fm.mk_pinf(ebits, sbits, val);
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_NAN)) {
+ unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
+ unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
+ m_fm.mk_nan(ebits, sbits, val);
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_PLUS_ZERO)) {
+ unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
+ unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
+ m_fm.mk_pzero(ebits, sbits, val);
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_MINUS_ZERO)) {
+ unsigned ebits = to_app(n)->get_decl()->get_range()->get_parameter(0).get_int();
+ unsigned sbits = to_app(n)->get_decl()->get_range()->get_parameter(1).get_int();
+ m_fm.mk_nzero(ebits, sbits, val);
+ return true;
+ }
+ return false;
+}
+
+bool fpa_decl_plugin::is_numeral(expr * n) {
+ scoped_mpf v(m_fm);
+ return is_numeral(n, v);
+}
+
+bool fpa_decl_plugin::is_rm_numeral(expr * n, mpf_rounding_mode & val) {
+ if (is_app_of(n, m_family_id, OP_FPA_RM_NEAREST_TIES_TO_AWAY)) {
+ val = MPF_ROUND_NEAREST_TAWAY;
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_RM_NEAREST_TIES_TO_EVEN)) {
+ val = MPF_ROUND_NEAREST_TEVEN;
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_RM_TOWARD_NEGATIVE)) {
+ val = MPF_ROUND_TOWARD_NEGATIVE;
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_RM_TOWARD_POSITIVE)) {
+ val = MPF_ROUND_TOWARD_POSITIVE;
+ return true;
+ }
+ else if (is_app_of(n, m_family_id, OP_FPA_RM_TOWARD_ZERO)) {
+ val = MPF_ROUND_TOWARD_ZERO;
+ return true;
+ }
+
+ return 0;
+}
+
+bool fpa_decl_plugin::is_rm_numeral(expr * n) {
+ mpf_rounding_mode t;
+ return is_rm_numeral(n, t);
+}
+
+void fpa_decl_plugin::del(parameter const & p) {
+ SASSERT(p.is_external());
+ recycled_id(p.get_ext_id());
+}
+
+parameter fpa_decl_plugin::translate(parameter const & p, decl_plugin & target) {
+ SASSERT(p.is_external());
+ fpa_decl_plugin & _target = static_cast(target);
+ return parameter(_target.mk_id(m_values[p.get_ext_id()]), true);
+}
+
+void fpa_decl_plugin::finalize() {
+ if (m_real_sort) { m_manager->dec_ref(m_real_sort); }
+ if (m_int_sort) { m_manager->dec_ref(m_int_sort); }
+}
+
+decl_plugin * fpa_decl_plugin::mk_fresh() {
+ return alloc(fpa_decl_plugin);
+}
+
+sort * fpa_decl_plugin::mk_float_sort(unsigned ebits, unsigned sbits) {
+ if (sbits < 2)
+ m_manager->raise_exception("minimum number of significand bits is 1");
+ if (ebits < 2)
+ m_manager->raise_exception("minimum number of exponent bits is 2");
+
+ parameter p1(ebits), p2(sbits);
+ parameter ps[2] = { p1, p2 };
+ sort_size sz;
+ sz = sort_size::mk_very_big(); // TODO: refine
+ return m_manager->mk_sort(symbol("FloatingPoint"), sort_info(m_family_id, FLOATING_POINT_SORT, sz, 2, ps));
+}
+
+sort * fpa_decl_plugin::mk_rm_sort() {
+ return m_manager->mk_sort(symbol("RoundingMode"), sort_info(m_family_id, ROUNDING_MODE_SORT));
+}
+
+sort * fpa_decl_plugin::mk_sort(decl_kind k, unsigned num_parameters, parameter const * parameters) {
+ switch (k) {
+ case FLOATING_POINT_SORT:
+ if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()))
+ m_manager->raise_exception("expecting two integer parameters to floating point sort (ebits, sbits)");
+ return mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
+ case ROUNDING_MODE_SORT:
+ return mk_rm_sort();
+ case FLOAT16_SORT:
+ return mk_float_sort(5, 11);
+ case FLOAT32_SORT:
+ return mk_float_sort(8, 24);
+ case FLOAT64_SORT:
+ return mk_float_sort(11, 53);
+ case FLOAT128_SORT:
+ return mk_float_sort(15, 113);
+ default:
+ m_manager->raise_exception("unknown floating point theory sort");
+ return 0;
+ }
+}
+
+func_decl * fpa_decl_plugin::mk_rm_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (num_parameters != 0)
+ m_manager->raise_exception("rounding mode constant does not have parameters");
+ if (arity != 0)
+ m_manager->raise_exception("rounding mode is a constant");
+ sort * s = mk_rm_sort();
+ func_decl_info finfo(m_family_id, k);
+ switch (k) {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ return m_manager->mk_const_decl(symbol("roundNearestTiesToEven"), s, finfo);
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ return m_manager->mk_const_decl(symbol("roundNearestTiesToAway"), s, finfo);
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ return m_manager->mk_const_decl(symbol("roundTowardPositive"), s, finfo);
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ return m_manager->mk_const_decl(symbol("roundTowardNegative"), s, finfo);
+ case OP_FPA_RM_TOWARD_ZERO:
+ return m_manager->mk_const_decl(symbol("roundTowardZero"), s, finfo);
+ default:
+ UNREACHABLE();
+ return 0;
+ }
+}
+
+func_decl * fpa_decl_plugin::mk_float_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ sort * s;
+ if (num_parameters == 1 && parameters[0].is_ast() && is_sort(parameters[0].get_ast()) && is_float_sort(to_sort(parameters[0].get_ast()))) {
+ s = to_sort(parameters[0].get_ast());
+ }
+ else if (num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()) {
+ s = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
+ }
+ else if (range != 0 && is_float_sort(range)) {
+ s = range;
+ }
+ else {
+ m_manager->raise_exception("sort of floating point constant was not specified");
+ UNREACHABLE();
+ }
+
+ SASSERT(is_sort_of(s, m_family_id, FLOATING_POINT_SORT));
+
+ unsigned ebits = s->get_parameter(0).get_int();
+ unsigned sbits = s->get_parameter(1).get_int();
+ scoped_mpf val(m_fm);
+
+ switch (k)
+ {
+ case OP_FPA_NAN: m_fm.mk_nan(ebits, sbits, val);
+ SASSERT(m_fm.is_nan(val));
+ break;
+ case OP_FPA_MINUS_INF: m_fm.mk_ninf(ebits, sbits, val); break;
+ case OP_FPA_PLUS_INF: m_fm.mk_pinf(ebits, sbits, val); break;
+ case OP_FPA_MINUS_ZERO: m_fm.mk_nzero(ebits, sbits, val); break;
+ case OP_FPA_PLUS_ZERO: m_fm.mk_pzero(ebits, sbits, val); break;
+ }
+
+ return mk_numeral_decl(val);
+}
+
+func_decl * fpa_decl_plugin::mk_bin_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to floating point relation");
+ if (domain[0] != domain[1] || !is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected equal FloatingPoint sorts as arguments");
+ symbol name;
+ switch (k) {
+ case OP_FPA_EQ: name = "fp.eq"; break;
+ case OP_FPA_LT: name = "fp.lt"; break;
+ case OP_FPA_GT: name = "fp.gt"; break;
+ case OP_FPA_LE: name = "fp.leq"; break;
+ case OP_FPA_GE: name = "fp.geq"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ func_decl_info finfo(m_family_id, k);
+ finfo.set_chainable(true);
+ return m_manager->mk_func_decl(name, arity, domain, m_manager->mk_bool_sort(), finfo);
+}
+
+func_decl * fpa_decl_plugin::mk_unary_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to floating point relation");
+ if (!is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
+ symbol name;
+ switch (k) {
+ case OP_FPA_IS_ZERO: name = "fp.isZero"; break;
+ case OP_FPA_IS_NEGATIVE: name = "fp.isNegative"; break;
+ case OP_FPA_IS_POSITIVE: name = "fp.isPositive"; break;
+ case OP_FPA_IS_NAN: name = "fp.isNaN"; break;
+ case OP_FPA_IS_INF: name = "fp.isInfinite"; break;
+ case OP_FPA_IS_NORMAL: name = "fp.isNormal"; break;
+ case OP_FPA_IS_SUBNORMAL: name = "fp.isSubnormal"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ return m_manager->mk_func_decl(name, arity, domain, m_manager->mk_bool_sort(), func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to floating point operator");
+ if (!is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
+ symbol name;
+ switch (k) {
+ case OP_FPA_ABS: name = "fp.abs"; break;
+ case OP_FPA_NEG: name = "fp.neg"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ return m_manager->mk_func_decl(name, arity, domain, domain[0], func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to floating point operator");
+ if (domain[0] != domain[1] || !is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected arguments of equal FloatingPoint sorts");
+ symbol name;
+ switch (k) {
+ case OP_FPA_REM: name = "fp.rem"; break;
+ case OP_FPA_MIN: name = "fp.min"; break;
+ case OP_FPA_MAX: name = "fp.max"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ return m_manager->mk_func_decl(name, arity, domain, domain[0], func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_rm_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 3)
+ m_manager->raise_exception("invalid number of arguments to floating point operator");
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
+ if (domain[1] != domain[2] || !is_float_sort(domain[1]))
+ m_manager->raise_exception("sort mismatch, expected arguments 1 and 2 of equal FloatingPoint sorts");
+ symbol name;
+ switch (k) {
+ case OP_FPA_ADD: name = "fp.add"; break;
+ case OP_FPA_SUB: name = "fp.sub"; break;
+ case OP_FPA_MUL: name = "fp.mul"; break;
+ case OP_FPA_DIV: name = "fp.div"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_rm_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to floating point operator");
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected RoundingMode as first argument");
+ if (!is_float_sort(domain[1]))
+ m_manager->raise_exception("sort mismatch, expected FloatingPoint as second argument");
+ symbol name;
+ switch (k) {
+ case OP_FPA_SQRT: name = "fp.sqrt"; break;
+ case OP_FPA_ROUND_TO_INTEGRAL: name = "fp.roundToIntegral"; break;
+ default:
+ UNREACHABLE();
+ break;
+ }
+ return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_fma(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 4)
+ m_manager->raise_exception("invalid number of arguments to fused_ma operator");
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected RoundingMode as first argument");
+ if (domain[1] != domain[2] || domain[1] != domain[3] || !is_float_sort(domain[1]))
+ m_manager->raise_exception("sort mismatch, expected arguments 1,2,3 of equal FloatingPoint sort");
+ symbol name("fp.fma");
+ return m_manager->mk_func_decl(name, arity, domain, domain[1], func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_to_fp(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (m_bv_plugin && arity == 3 &&
+ is_sort_of(domain[0], m_bv_fid, BV_SORT) &&
+ is_sort_of(domain[1], m_bv_fid, BV_SORT) &&
+ is_sort_of(domain[2], m_bv_fid, BV_SORT)) {
+ // 3 BVs -> 1 FP
+ unsigned ebits = domain[1]->get_parameter(0).get_int();
+ unsigned sbits = domain[2]->get_parameter(0).get_int() + 1;
+ parameter ps[] = { parameter(ebits), parameter(sbits) };
+ sort * fp = mk_float_sort(ebits, sbits);
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, 2, ps));
+ }
+ else if (m_bv_plugin && arity == 1 && is_sort_of(domain[0], m_bv_fid, BV_SORT)) {
+ // 1 BV -> 1 FP
+ if (num_parameters != 2)
+ m_manager->raise_exception("invalid number of parameters to to_fp");
+ if (!parameters[0].is_int() || !parameters[1].is_int())
+ m_manager->raise_exception("invalid parameter type to to_fp");
+
+ int ebits = parameters[0].get_int();
+ int sbits = parameters[1].get_int();
+
+ if (domain[0]->get_parameter(0).get_int() != (ebits + sbits))
+ m_manager->raise_exception("sort mismatch; invalid bit-vector size, expected bitvector of size (ebits+sbits)");
+
+ sort * fp = mk_float_sort(ebits, sbits);
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else if (m_bv_plugin && arity == 2 &&
+ is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
+ is_sort_of(domain[1], m_bv_fid, BV_SORT)) {
+ // RoundingMode + 1 BV -> 1 FP
+ if (num_parameters != 2)
+ m_manager->raise_exception("invalid number of parameters to to_fp");
+ if (!parameters[0].is_int() || !parameters[1].is_int())
+ m_manager->raise_exception("invalid parameter type to to_fp");
+ int ebits = parameters[0].get_int();
+ int sbits = parameters[1].get_int();
+
+ sort * fp = mk_float_sort(ebits, sbits);
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else if (arity == 2 &&
+ is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
+ is_sort_of(domain[1], m_family_id, FLOATING_POINT_SORT)) {
+ // Rounding + 1 FP -> 1 FP
+ if (num_parameters != 2)
+ m_manager->raise_exception("invalid number of parameters to to_fp");
+ if (!parameters[0].is_int() || !parameters[1].is_int())
+ m_manager->raise_exception("invalid parameter type to to_fp");
+ int ebits = parameters[0].get_int();
+ int sbits = parameters[1].get_int();
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
+ if (!is_sort_of(domain[1], m_family_id, FLOATING_POINT_SORT))
+ m_manager->raise_exception("sort mismatch, expected second argument of FloatingPoint sort");
+
+ sort * fp = mk_float_sort(ebits, sbits);
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else if (arity == 3 &&
+ is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
+ is_sort_of(domain[1], m_arith_fid, REAL_SORT) &&
+ is_sort_of(domain[2], m_arith_fid, INT_SORT))
+ {
+ // Rounding + 1 Real + 1 Int -> 1 FP
+ if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()))
+ m_manager->raise_exception("expecting two integer parameters to to_fp");
+
+ sort * fp = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else if (arity == 1 &&
+ is_sort_of(domain[0], m_arith_fid, REAL_SORT))
+ {
+ // 1 Real -> 1 FP
+ if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()))
+ m_manager->raise_exception("expecting two integer parameters to to_fp");
+ if (domain[1] != m_real_sort)
+ m_manager->raise_exception("sort mismatch, expected one argument of Real sort");
+
+ sort * fp = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else if (arity == 2 &&
+ is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT) &&
+ is_sort_of(domain[1], m_arith_fid, REAL_SORT))
+ {
+ // Rounding + 1 Real -> 1 FP
+ if (!(num_parameters == 2 && parameters[0].is_int() && parameters[1].is_int()))
+ m_manager->raise_exception("expecting two integer parameters to to_fp");
+
+ sort * fp = mk_float_sort(parameters[0].get_int(), parameters[1].get_int());
+ symbol name("to_fp");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else {
+ m_manager->raise_exception("Unexpected argument combination for (_ to_fp eb sb). Supported argument combinations are: "
+ "((_ BitVec 1) (_ BitVec eb) (_ BitVec sb-1)),"
+ "(_ BitVec (eb+sb)),"
+ "(Real),"
+ "(RoundingMode (_ BitVec (eb+sb))),"
+ "(RoundingMode (_ FloatingPoint eb' sb')),"
+ "(RoundingMode Real Int), and"
+ "(RoundingMode Real)."
+ );
+ }
+
+ return 0;
+}
+
+func_decl * fpa_decl_plugin::mk_to_fp_unsigned(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ SASSERT(m_bv_plugin);
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to to_fp_unsigned");
+ if (!is_sort_of(domain[0], m_family_id, ROUNDING_MODE_SORT))
+ m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
+ if (!is_sort_of(domain[1], m_bv_fid, BV_SORT))
+ m_manager->raise_exception("sort mismatch, expected second argument of bit-vector sort");
+
+ // RoundingMode + 1 BV -> 1 FP
+ if (num_parameters != 2)
+ m_manager->raise_exception("invalid number of parameters to to_fp_unsigned");
+ if (!parameters[0].is_int() || !parameters[1].is_int())
+ m_manager->raise_exception("invalid parameter type to to_fp_unsigned");
+
+ int ebits = parameters[0].get_int();
+ int sbits = parameters[1].get_int();
+
+ sort * fp = mk_float_sort(ebits, sbits);
+ symbol name("to_fp_unsigned");
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_fp(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 3)
+ m_manager->raise_exception("invalid number of arguments to fp");
+ if (!is_sort_of(domain[0], m_bv_fid, BV_SORT) ||
+ (domain[0]->get_parameter(0).get_int() != 1) ||
+ !is_sort_of(domain[1], m_bv_fid, BV_SORT) ||
+ !is_sort_of(domain[2], m_bv_fid, BV_SORT))
+ m_manager->raise_exception("sort mismatch, expected three bit-vectors, the first one of size 1.");
+
+ int eb = (domain[1])->get_parameter(0).get_int();
+ int sb = (domain[2])->get_parameter(0).get_int() + 1;
+ symbol name("fp");
+ sort * fp = mk_float_sort(eb, sb);
+ return m_manager->mk_func_decl(name, arity, domain, fp, func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_to_ubv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ SASSERT(m_bv_plugin);
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to fp.to_ubv");
+ if (num_parameters != 1)
+ m_manager->raise_exception("invalid number of parameters to fp.to_ubv");
+ if (!parameters[0].is_int())
+ m_manager->raise_exception("invalid parameter type; fp.to_ubv expects an int parameter");
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
+ if (!is_sort_of(domain[1], m_family_id, FLOATING_POINT_SORT))
+ m_manager->raise_exception("sort mismatch, expected second argument of FloatingPoint sort");
+ if (parameters[0].get_int() <= 0)
+ m_manager->raise_exception("invalid parameter value; fp.to_ubv expects a parameter larger than 0");
+
+ symbol name("fp.to_ubv");
+ sort * bvs = m_bv_plugin->mk_sort(BV_SORT, 1, parameters);
+ return m_manager->mk_func_decl(name, arity, domain, bvs, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_to_sbv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ SASSERT(m_bv_plugin);
+ if (arity != 2)
+ m_manager->raise_exception("invalid number of arguments to fp.to_sbv");
+ if (num_parameters != 1)
+ m_manager->raise_exception("invalid number of parameters to fp.to_sbv");
+ if (!parameters[0].is_int())
+ m_manager->raise_exception("invalid parameter type; fp.to_sbv expects an int parameter");
+ if (!is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected first argument of RoundingMode sort");
+ if (!is_sort_of(domain[1], m_family_id, FLOATING_POINT_SORT))
+ m_manager->raise_exception("sort mismatch, expected second argument of FloatingPoint sort");
+ if (parameters[0].get_int() <= 0)
+ m_manager->raise_exception("invalid parameter value; fp.to_sbv expects a parameter larger than 0");
+
+ symbol name("fp.to_sbv");
+ sort * bvs = m_bv_plugin->mk_sort(BV_SORT, 1, parameters);
+ return m_manager->mk_func_decl(name, arity, domain, bvs, func_decl_info(m_family_id, k, num_parameters, parameters));
+
+}
+
+func_decl * fpa_decl_plugin::mk_to_real(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to fp.to_real");
+ if (!is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
+
+ symbol name("fp.to_real");
+ return m_manager->mk_func_decl(name, 1, domain, m_real_sort, func_decl_info(m_family_id, k));
+}
+
+func_decl * fpa_decl_plugin::mk_float_to_ieee_bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to asIEEEBV");
+ if (!is_float_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint sort");
+
+ unsigned float_sz = domain[0]->get_parameter(0).get_int() + domain[0]->get_parameter(1).get_int();
+ parameter ps[] = { parameter(float_sz) };
+ sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, ps);
+ symbol name("to_ieee_bv");
+ return m_manager->mk_func_decl(name, 1, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_internal_bv_wrap(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to internal_bv_wrap");
+ if (!is_float_sort(domain[0]) && !is_rm_sort(domain[0]))
+ m_manager->raise_exception("sort mismatch, expected argument of FloatingPoint or RoundingMode sort");
+
+ if (is_float_sort(domain[0]))
+ {
+ unsigned float_sz = domain[0]->get_parameter(0).get_int() + domain[0]->get_parameter(1).get_int();
+ parameter ps[] = { parameter(float_sz) };
+ sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, ps);
+ return m_manager->mk_func_decl(symbol("bv_wrap"), 1, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+ else {
+ parameter ps[] = { parameter(3) };
+ sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, ps);
+ return m_manager->mk_func_decl(symbol("bv_wrap"), 1, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
+ }
+}
+
+func_decl * fpa_decl_plugin::mk_internal_bv_unwrap(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 1)
+ m_manager->raise_exception("invalid number of arguments to internal_bv_unwrap");
+ if (!is_sort_of(domain[0], m_bv_fid, BV_SORT))
+ m_manager->raise_exception("sort mismatch, expected argument of bitvector sort");
+ if (!is_float_sort(range) && !is_rm_sort(range))
+ m_manager->raise_exception("sort mismatch, expected range of FloatingPoint sort");
+
+ return m_manager->mk_func_decl(symbol("bv_unwrap"), 1, domain, range, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_internal_to_ubv_unspecified(
+ decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 0)
+ m_manager->raise_exception("invalid number of arguments to fp.to_ubv_unspecified");
+ if (num_parameters != 1)
+ m_manager->raise_exception("invalid number of parameters to fp.to_ubv_unspecified; expecting 1");
+ if (!parameters[0].is_int())
+ m_manager->raise_exception("invalid parameters type provided to fp.to_ubv_unspecified; expecting an integer");
+
+ sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, parameters);
+ return m_manager->mk_func_decl(symbol("fp.to_ubv_unspecified"), 0, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_internal_to_sbv_unspecified(
+ decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 0)
+ m_manager->raise_exception("invalid number of arguments to internal_to_sbv_unspecified");
+ if (num_parameters != 1)
+ m_manager->raise_exception("invalid number of parameters to fp.to_sbv_unspecified; expecting 1");
+ if (!parameters[0].is_int())
+ m_manager->raise_exception("invalid parameters type provided to fp.to_sbv_unspecified; expecting an integer");
+ sort * bv_srt = m_bv_plugin->mk_sort(m_bv_fid, 1, parameters);
+ return m_manager->mk_func_decl(symbol("fp.to_sbv_unspecified"), 0, domain, bv_srt, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+func_decl * fpa_decl_plugin::mk_internal_to_real_unspecified(
+ decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ if (arity != 0)
+ m_manager->raise_exception("invalid number of arguments to internal_to_real_unspecified");
+ if (!is_sort_of(range, m_arith_fid, REAL_SORT))
+ m_manager->raise_exception("sort mismatch, expected range of FloatingPoint sort");
+
+ return m_manager->mk_func_decl(symbol("fp.to_real_unspecified"), 0, domain, m_real_sort, func_decl_info(m_family_id, k, num_parameters, parameters));
+}
+
+
+func_decl * fpa_decl_plugin::mk_func_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range) {
+ switch (k) {
+ case OP_FPA_MINUS_INF:
+ case OP_FPA_PLUS_INF:
+ case OP_FPA_NAN:
+ case OP_FPA_MINUS_ZERO:
+ case OP_FPA_PLUS_ZERO:
+ return mk_float_const_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ case OP_FPA_RM_TOWARD_ZERO:
+ return mk_rm_const_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_EQ:
+ case OP_FPA_LT:
+ case OP_FPA_GT:
+ case OP_FPA_LE:
+ case OP_FPA_GE:
+ return mk_bin_rel_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_IS_ZERO:
+ case OP_FPA_IS_NEGATIVE:
+ case OP_FPA_IS_POSITIVE:
+ case OP_FPA_IS_NAN:
+ case OP_FPA_IS_INF:
+ case OP_FPA_IS_NORMAL:
+ case OP_FPA_IS_SUBNORMAL:
+ return mk_unary_rel_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_ABS:
+ case OP_FPA_NEG:
+ return mk_unary_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_REM:
+ case OP_FPA_MIN:
+ case OP_FPA_MAX:
+ return mk_binary_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_ADD:
+ case OP_FPA_MUL:
+ case OP_FPA_DIV:
+ return mk_rm_binary_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_SUB:
+ if (arity == 1)
+ return mk_unary_decl(OP_FPA_NEG, num_parameters, parameters, arity, domain, range);
+ else
+ return mk_rm_binary_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_SQRT:
+ case OP_FPA_ROUND_TO_INTEGRAL:
+ return mk_rm_unary_decl(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_FMA:
+ return mk_fma(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_FP:
+ return mk_fp(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_UBV:
+ return mk_to_ubv(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_SBV:
+ return mk_to_sbv(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_REAL:
+ return mk_to_real(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_FP:
+ return mk_to_fp(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_FP_UNSIGNED:
+ return mk_to_fp_unsigned(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_TO_IEEE_BV:
+ return mk_float_to_ieee_bv(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_INTERNAL_BVWRAP:
+ return mk_internal_bv_wrap(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_INTERNAL_BVUNWRAP:
+ return mk_internal_bv_unwrap(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_INTERNAL_TO_UBV_UNSPECIFIED:
+ return mk_internal_to_ubv_unspecified(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_INTERNAL_TO_SBV_UNSPECIFIED:
+ return mk_internal_to_sbv_unspecified(k, num_parameters, parameters, arity, domain, range);
+ case OP_FPA_INTERNAL_TO_REAL_UNSPECIFIED:
+ return mk_internal_to_real_unspecified(k, num_parameters, parameters, arity, domain, range);
+ default:
+ m_manager->raise_exception("unsupported floating point operator");
+ return 0;
+ }
+}
+
+void fpa_decl_plugin::get_op_names(svector & op_names, symbol const & logic) {
+ // These are the operators from the final draft of the SMT FloatingPoint standard
+ op_names.push_back(builtin_name("+oo", OP_FPA_PLUS_INF));
+ op_names.push_back(builtin_name("-oo", OP_FPA_MINUS_INF));
+ op_names.push_back(builtin_name("+zero", OP_FPA_PLUS_ZERO));
+ op_names.push_back(builtin_name("-zero", OP_FPA_MINUS_ZERO));
+ op_names.push_back(builtin_name("NaN", OP_FPA_NAN));
+
+ op_names.push_back(builtin_name("roundNearestTiesToEven", OP_FPA_RM_NEAREST_TIES_TO_EVEN));
+ op_names.push_back(builtin_name("roundNearestTiesToAway", OP_FPA_RM_NEAREST_TIES_TO_AWAY));
+ op_names.push_back(builtin_name("roundTowardPositive", OP_FPA_RM_TOWARD_POSITIVE));
+ op_names.push_back(builtin_name("roundTowardNegative", OP_FPA_RM_TOWARD_NEGATIVE));
+ op_names.push_back(builtin_name("roundTowardZero", OP_FPA_RM_TOWARD_ZERO));
+
+ op_names.push_back(builtin_name("RNE", OP_FPA_RM_NEAREST_TIES_TO_EVEN));
+ op_names.push_back(builtin_name("RNA", OP_FPA_RM_NEAREST_TIES_TO_AWAY));
+ op_names.push_back(builtin_name("RTP", OP_FPA_RM_TOWARD_POSITIVE));
+ op_names.push_back(builtin_name("RTN", OP_FPA_RM_TOWARD_NEGATIVE));
+ op_names.push_back(builtin_name("RTZ", OP_FPA_RM_TOWARD_ZERO));
+
+ op_names.push_back(builtin_name("fp.abs", OP_FPA_ABS));
+ op_names.push_back(builtin_name("fp.neg", OP_FPA_NEG));
+ op_names.push_back(builtin_name("fp.add", OP_FPA_ADD));
+ op_names.push_back(builtin_name("fp.sub", OP_FPA_SUB));
+ op_names.push_back(builtin_name("fp.mul", OP_FPA_MUL));
+ op_names.push_back(builtin_name("fp.div", OP_FPA_DIV));
+ op_names.push_back(builtin_name("fp.fma", OP_FPA_FMA));
+ op_names.push_back(builtin_name("fp.sqrt", OP_FPA_SQRT));
+ op_names.push_back(builtin_name("fp.rem", OP_FPA_REM));
+ op_names.push_back(builtin_name("fp.roundToIntegral", OP_FPA_ROUND_TO_INTEGRAL));
+ op_names.push_back(builtin_name("fp.min", OP_FPA_MIN));
+ op_names.push_back(builtin_name("fp.max", OP_FPA_MAX));
+ op_names.push_back(builtin_name("fp.leq", OP_FPA_LE));
+ op_names.push_back(builtin_name("fp.lt", OP_FPA_LT));
+ op_names.push_back(builtin_name("fp.geq", OP_FPA_GE));
+ op_names.push_back(builtin_name("fp.gt", OP_FPA_GT));
+ op_names.push_back(builtin_name("fp.eq", OP_FPA_EQ));
+
+ op_names.push_back(builtin_name("fp.isNormal", OP_FPA_IS_NORMAL));
+ op_names.push_back(builtin_name("fp.isSubnormal", OP_FPA_IS_SUBNORMAL));
+ op_names.push_back(builtin_name("fp.isZero", OP_FPA_IS_ZERO));
+ op_names.push_back(builtin_name("fp.isInfinite", OP_FPA_IS_INF));
+ op_names.push_back(builtin_name("fp.isNaN", OP_FPA_IS_NAN));
+ op_names.push_back(builtin_name("fp.isNegative", OP_FPA_IS_NEGATIVE));
+ op_names.push_back(builtin_name("fp.isPositive", OP_FPA_IS_POSITIVE));
+
+ op_names.push_back(builtin_name("fp", OP_FPA_FP));
+ op_names.push_back(builtin_name("fp.to_ubv", OP_FPA_TO_UBV));
+ op_names.push_back(builtin_name("fp.to_sbv", OP_FPA_TO_SBV));
+ op_names.push_back(builtin_name("fp.to_real", OP_FPA_TO_REAL));
+
+ op_names.push_back(builtin_name("to_fp", OP_FPA_TO_FP));
+ op_names.push_back(builtin_name("to_fp_unsigned", OP_FPA_TO_FP_UNSIGNED));
+
+ /* Extensions */
+ op_names.push_back(builtin_name("to_ieee_bv", OP_FPA_TO_IEEE_BV));
+}
+
+void fpa_decl_plugin::get_sort_names(svector & sort_names, symbol const & logic) {
+ sort_names.push_back(builtin_name("FloatingPoint", FLOATING_POINT_SORT));
+ sort_names.push_back(builtin_name("RoundingMode", ROUNDING_MODE_SORT));
+
+ // The final theory supports three common FloatingPoint sorts
+ sort_names.push_back(builtin_name("Float16", FLOAT16_SORT));
+ sort_names.push_back(builtin_name("Float32", FLOAT32_SORT));
+ sort_names.push_back(builtin_name("Float64", FLOAT64_SORT));
+ sort_names.push_back(builtin_name("Float128", FLOAT128_SORT));
+}
+
+expr * fpa_decl_plugin::get_some_value(sort * s) {
+ SASSERT(s->is_sort_of(m_family_id, FLOATING_POINT_SORT));
+ mpf tmp;
+ m_fm.mk_nan(s->get_parameter(0).get_int(), s->get_parameter(1).get_int(), tmp);
+ expr * res = this->mk_numeral(tmp);
+ m_fm.del(tmp);
+ return res;
+}
+
+bool fpa_decl_plugin::is_value(app * e) const {
+ if (e->get_family_id() != m_family_id)
+ return false;
+ switch (e->get_decl_kind()) {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ case OP_FPA_RM_TOWARD_ZERO:
+ case OP_FPA_NUM:
+ case OP_FPA_PLUS_INF:
+ case OP_FPA_MINUS_INF:
+ case OP_FPA_PLUS_ZERO:
+ case OP_FPA_MINUS_ZERO:
+ case OP_FPA_NAN:
+ return true;
+ case OP_FPA_FP:
+ return m_manager->is_value(e->get_arg(0)) &&
+ m_manager->is_value(e->get_arg(1)) &&
+ m_manager->is_value(e->get_arg(2));
+ default:
+ return false;
+ }
+}
+
+bool fpa_decl_plugin::is_unique_value(app* e) const {
+ if (e->get_family_id() != m_family_id)
+ return false;
+ switch (e->get_decl_kind()) {
+ case OP_FPA_RM_NEAREST_TIES_TO_EVEN:
+ case OP_FPA_RM_NEAREST_TIES_TO_AWAY:
+ case OP_FPA_RM_TOWARD_POSITIVE:
+ case OP_FPA_RM_TOWARD_NEGATIVE:
+ case OP_FPA_RM_TOWARD_ZERO:
+ return true;
+ case OP_FPA_PLUS_INF: /* No; +oo == fp(#b0 #b11 #b00) */
+ case OP_FPA_MINUS_INF: /* No; -oo == fp #b1 #b11 #b00) */
+ case OP_FPA_PLUS_ZERO: /* No; +zero == fp #b0 #b00 #b000) */
+ case OP_FPA_MINUS_ZERO: /* No; -zero == fp #b1 #b00 #b000) */
+ case OP_FPA_NAN: /* No; NaN == (fp #b0 #b111111 #b0000001) */
+ case OP_FPA_NUM: /* see NaN */
+ return false;
+ case OP_FPA_FP:
+ return m_manager->is_unique_value(e->get_arg(0)) &&
+ m_manager->is_unique_value(e->get_arg(1)) &&
+ m_manager->is_unique_value(e->get_arg(2));
+ default:
+ return false;
+ }
+}
+
+fpa_util::fpa_util(ast_manager & m):
+ m_manager(m),
+ m_fid(m.mk_family_id("fpa")),
+ m_a_util(m),
+ m_bv_util(m) {
+ m_plugin = static_cast(m.get_plugin(m_fid));
+}
+
+fpa_util::~fpa_util() {
+}
+
+sort * fpa_util::mk_float_sort(unsigned ebits, unsigned sbits) {
+ parameter ps[2] = { parameter(ebits), parameter(sbits) };
+ return m().mk_sort(m_fid, FLOATING_POINT_SORT, 2, ps);
+}
+
+unsigned fpa_util::get_ebits(sort * s) {
+ SASSERT(is_float(s));
+ return static_cast(s->get_parameter(0).get_int());
+}
+
+unsigned fpa_util::get_sbits(sort * s) {
+ SASSERT(is_float(s));
+ return static_cast(s->get_parameter(1).get_int());
+}
+
+app * fpa_util::mk_nan(unsigned ebits, unsigned sbits) {
+ scoped_mpf v(fm());
+ fm().mk_nan(ebits, sbits, v);
+ return mk_value(v);
+}
+
+app * fpa_util::mk_pinf(unsigned ebits, unsigned sbits) {
+ scoped_mpf v(fm());
+ fm().mk_pinf(ebits, sbits, v);
+ return mk_value(v);
+}
+
+app * fpa_util::mk_ninf(unsigned ebits, unsigned sbits) {
+ scoped_mpf v(fm());
+ fm().mk_ninf(ebits, sbits, v);
+ return mk_value(v);
+}
+
+app * fpa_util::mk_pzero(unsigned ebits, unsigned sbits) {
+ scoped_mpf v(fm());
+ fm().mk_pzero(ebits, sbits, v);
+ return mk_value(v);
+}
+
+app * fpa_util::mk_nzero(unsigned ebits, unsigned sbits) {
+ scoped_mpf v(fm());
+ fm().mk_nzero(ebits, sbits, v);
+ return mk_value(v);
+}
+
+app * fpa_util::mk_internal_to_ubv_unspecified(unsigned width) {
+ parameter ps[] = { parameter(width) };
+ sort * range = m_bv_util.mk_sort(width);
+ return m().mk_app(get_family_id(), OP_FPA_INTERNAL_TO_UBV_UNSPECIFIED, 1, ps, 0, 0, range);
+}
+
+app * fpa_util::mk_internal_to_sbv_unspecified(unsigned width) {
+ parameter ps[] = { parameter(width) };
+ sort * range = m_bv_util.mk_sort(width);
+ return m().mk_app(get_family_id(), OP_FPA_INTERNAL_TO_SBV_UNSPECIFIED, 1, ps, 0, 0, range);
+}
+
+app * fpa_util::mk_internal_to_real_unspecified() {
+ sort * range = m_a_util.mk_real();
+ return m().mk_app(get_family_id(), OP_FPA_INTERNAL_TO_REAL_UNSPECIFIED, 0, 0, 0, 0, range);
+}
\ No newline at end of file
diff --git a/src/ast/fpa_decl_plugin.h b/src/ast/fpa_decl_plugin.h
new file mode 100644
index 000000000..fc1521456
--- /dev/null
+++ b/src/ast/fpa_decl_plugin.h
@@ -0,0 +1,341 @@
+/*++
+Copyright (c) 2012 Microsoft Corporation
+
+Module Name:
+
+ fpa_decl_plugin.h
+
+Abstract:
+
+ Floating point decl plugin
+
+Author:
+
+ Leonardo de Moura (leonardo) 2012-01-15.
+
+Revision History:
+
+--*/
+#ifndef _fpa_decl_plugin_H_
+#define _fpa_decl_plugin_H_
+
+#include"ast.h"
+#include"id_gen.h"
+#include"arith_decl_plugin.h"
+#include"bv_decl_plugin.h"
+#include"mpf.h"
+
+enum fpa_sort_kind {
+ FLOATING_POINT_SORT,
+ ROUNDING_MODE_SORT,
+ FLOAT16_SORT,
+ FLOAT32_SORT,
+ FLOAT64_SORT,
+ FLOAT128_SORT
+};
+
+enum fpa_op_kind {
+ OP_FPA_RM_NEAREST_TIES_TO_EVEN,
+ OP_FPA_RM_NEAREST_TIES_TO_AWAY,
+ OP_FPA_RM_TOWARD_POSITIVE,
+ OP_FPA_RM_TOWARD_NEGATIVE,
+ OP_FPA_RM_TOWARD_ZERO,
+
+ OP_FPA_NUM,
+ OP_FPA_PLUS_INF,
+ OP_FPA_MINUS_INF,
+ OP_FPA_NAN,
+ OP_FPA_PLUS_ZERO,
+ OP_FPA_MINUS_ZERO,
+
+ OP_FPA_ADD,
+ OP_FPA_SUB,
+ OP_FPA_NEG,
+ OP_FPA_MUL,
+ OP_FPA_DIV,
+ OP_FPA_REM,
+ OP_FPA_ABS,
+ OP_FPA_MIN,
+ OP_FPA_MAX,
+ OP_FPA_FMA, // x*y + z
+ OP_FPA_SQRT,
+ OP_FPA_ROUND_TO_INTEGRAL,
+
+ OP_FPA_EQ,
+ OP_FPA_LT,
+ OP_FPA_GT,
+ OP_FPA_LE,
+ OP_FPA_GE,
+ OP_FPA_IS_NAN,
+ OP_FPA_IS_INF,
+ OP_FPA_IS_ZERO,
+ OP_FPA_IS_NORMAL,
+ OP_FPA_IS_SUBNORMAL,
+ OP_FPA_IS_NEGATIVE,
+ OP_FPA_IS_POSITIVE,
+
+ OP_FPA_FP,
+ OP_FPA_TO_FP,
+ OP_FPA_TO_FP_UNSIGNED,
+ OP_FPA_TO_UBV,
+ OP_FPA_TO_SBV,
+ OP_FPA_TO_REAL,
+
+ /* Extensions */
+ OP_FPA_TO_IEEE_BV,
+
+ /* Internal use only */
+ OP_FPA_INTERNAL_BVWRAP,
+ OP_FPA_INTERNAL_BVUNWRAP,
+ OP_FPA_INTERNAL_TO_UBV_UNSPECIFIED,
+ OP_FPA_INTERNAL_TO_SBV_UNSPECIFIED,
+ OP_FPA_INTERNAL_TO_REAL_UNSPECIFIED,
+
+ LAST_FLOAT_OP
+};
+
+class fpa_decl_plugin : public decl_plugin {
+ struct mpf_hash_proc {
+ scoped_mpf_vector const & m_values;
+ mpf_hash_proc(scoped_mpf_vector const & values):m_values(values) {}
+ unsigned operator()(unsigned id) const { return m_values.m().hash(m_values[id]); }
+ };
+
+ struct mpf_eq_proc {
+ scoped_mpf_vector const & m_values;
+ mpf_eq_proc(scoped_mpf_vector const & values):m_values(values) {}
+ bool operator()(unsigned id1, unsigned id2) const { return m_values.m().eq_core(m_values[id1], m_values[id2]); }
+ };
+
+ typedef chashtable value_table;
+
+
+ mpf_manager m_fm;
+ id_gen m_id_gen;
+ scoped_mpf_vector m_values;
+ value_table m_value_table;
+ sort * m_real_sort;
+ sort * m_int_sort;
+ family_id m_arith_fid;
+ family_id m_bv_fid;
+ bv_decl_plugin * m_bv_plugin;
+
+ sort * mk_float_sort(unsigned ebits, unsigned sbits);
+ sort * mk_rm_sort();
+ func_decl * mk_rm_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_float_const_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_bin_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_unary_rel_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_rm_binary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_rm_unary_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_fma(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_fp(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_to_fp(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_to_fp_unsigned(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_to_ubv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_to_sbv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_to_real(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_float_to_ieee_bv(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+
+ func_decl * mk_internal_bv_wrap(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_internal_bv_unwrap(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_internal_to_ubv_unspecified(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_internal_to_sbv_unspecified(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ func_decl * mk_internal_to_real_unspecified(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+
+ virtual void set_manager(ast_manager * m, family_id id);
+ unsigned mk_id(mpf const & v);
+ void recycled_id(unsigned id);
+public:
+ fpa_decl_plugin();
+
+ bool is_float_sort(sort * s) const { return is_sort_of(s, m_family_id, FLOATING_POINT_SORT); }
+ bool is_rm_sort(sort * s) const { return is_sort_of(s, m_family_id, ROUNDING_MODE_SORT); }
+
+ virtual ~fpa_decl_plugin();
+ virtual void finalize();
+
+ virtual decl_plugin * mk_fresh();
+ virtual sort * mk_sort(decl_kind k, unsigned num_parameters, parameter const * parameters);
+ virtual func_decl * mk_func_decl(decl_kind k, unsigned num_parameters, parameter const * parameters,
+ unsigned arity, sort * const * domain, sort * range);
+ virtual void get_op_names(svector & op_names, symbol const & logic);
+ virtual void get_sort_names(svector & sort_names, symbol const & logic);
+ virtual expr * get_some_value(sort * s);
+ virtual bool is_value(app* e) const;
+ virtual bool is_unique_value(app* e) const;
+
+ mpf_manager & fm() { return m_fm; }
+ func_decl * mk_numeral_decl(mpf const & v);
+ app * mk_numeral(mpf const & v);
+ bool is_numeral(expr * n);
+ bool is_numeral(expr * n, mpf & val);
+ bool is_rm_numeral(expr * n, mpf_rounding_mode & val);
+ bool is_rm_numeral(expr * n);
+
+ mpf const & get_value(unsigned id) const {
+ SASSERT(m_value_table.contains(id));
+ return m_values[id];
+ }
+
+ virtual void del(parameter const & p);
+ virtual parameter translate(parameter const & p, decl_plugin & target);
+};
+
+class fpa_util {
+ ast_manager & m_manager;
+ fpa_decl_plugin * m_plugin;
+ family_id m_fid;
+ arith_util m_a_util;
+ bv_util m_bv_util;
+public:
+ fpa_util(ast_manager & m);
+ ~fpa_util();
+
+ ast_manager & m() const { return m_manager; }
+ mpf_manager & fm() const { return m_plugin->fm(); }
+ family_id get_fid() const { return m_fid; }
+ family_id get_family_id() const { return m_fid; }
+ arith_util & au() { return m_a_util; }
+ fpa_decl_plugin & plugin() { return *m_plugin; }
+
+ sort * mk_float_sort(unsigned ebits, unsigned sbits);
+ sort * mk_rm_sort() { return m().mk_sort(m_fid, ROUNDING_MODE_SORT); }
+ bool is_float(sort * s) { return is_sort_of(s, m_fid, FLOATING_POINT_SORT); }
+ bool is_rm(sort * s) { return is_sort_of(s, m_fid, ROUNDING_MODE_SORT); }
+ bool is_float(expr * e) { return is_float(m_manager.get_sort(e)); }
+ bool is_rm(expr * e) { return is_rm(m_manager.get_sort(e)); }
+ unsigned get_ebits(sort * s);
+ unsigned get_sbits(sort * s);
+
+ app * mk_round_nearest_ties_to_even() { return m().mk_const(m_fid, OP_FPA_RM_NEAREST_TIES_TO_EVEN); }
+ app * mk_round_nearest_ties_to_away() { return m().mk_const(m_fid, OP_FPA_RM_NEAREST_TIES_TO_AWAY); }
+ app * mk_round_toward_positive() { return m().mk_const(m_fid, OP_FPA_RM_TOWARD_POSITIVE); }
+ app * mk_round_toward_negative() { return m().mk_const(m_fid, OP_FPA_RM_TOWARD_NEGATIVE); }
+ app * mk_round_toward_zero() { return m().mk_const(m_fid, OP_FPA_RM_TOWARD_ZERO); }
+
+ app * mk_nan(unsigned ebits, unsigned sbits);
+ app * mk_pinf(unsigned ebits, unsigned sbits);
+ app * mk_ninf(unsigned ebits, unsigned sbits);
+ app * mk_nan(sort * s) { return mk_nan(get_ebits(s), get_sbits(s)); }
+ app * mk_pinf(sort * s) { return mk_pinf(get_ebits(s), get_sbits(s)); }
+ app * mk_ninf(sort * s) { return mk_ninf(get_ebits(s), get_sbits(s)); }
+
+ app * mk_value(mpf const & v) { return m_plugin->mk_numeral(v); }
+ bool is_numeral(expr * n) { return m_plugin->is_numeral(n); }
+ bool is_numeral(expr * n, mpf & v) { return m_plugin->is_numeral(n, v); }
+ bool is_rm_numeral(expr * n) { return m_plugin->is_rm_numeral(n); }
+ bool is_rm_numeral(expr * n, mpf_rounding_mode & v) { return m_plugin->is_rm_numeral(n, v); }
+
+ app * mk_pzero(unsigned ebits, unsigned sbits);
+ app * mk_nzero(unsigned ebits, unsigned sbits);
+ app * mk_pzero(sort * s) { return mk_pzero(get_ebits(s), get_sbits(s)); }
+ app * mk_nzero(sort * s) { return mk_nzero(get_ebits(s), get_sbits(s)); }
+
+ bool is_nan(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_nan(v); }
+ bool is_pinf(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_pinf(v); }
+ bool is_ninf(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_ninf(v); }
+ bool is_zero(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_zero(v); }
+ bool is_pzero(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_pzero(v); }
+ bool is_nzero(expr * n) { scoped_mpf v(fm()); return is_numeral(n, v) && fm().is_nzero(v); }
+
+ app * mk_fp(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FPA_FP, arg1, arg2, arg3); }
+ app * mk_to_fp(sort * s, expr * bv_t) {
+ SASSERT(is_float(s) && s->get_num_parameters() == 2);
+ return m().mk_app(m_fid, OP_FPA_TO_FP, 2, s->get_parameters(), 1, &bv_t);
+ }
+ app * mk_to_fp(sort * s, expr * rm, expr * t) {
+ SASSERT(is_float(s) && s->get_num_parameters() == 2);
+ expr * args[] = { rm, t };
+ return m().mk_app(m_fid, OP_FPA_TO_FP, 2, s->get_parameters(), 2, args);
+ }
+ app * mk_to_fp(sort * s, expr * rm, expr * sig, expr * exp) {
+ SASSERT(is_float(s) && s->get_num_parameters() == 2);
+ expr * args[] = { rm, sig, exp };
+ return m().mk_app(m_fid, OP_FPA_TO_FP, 2, s->get_parameters(), 3, args);
+ }
+ app * mk_to_fp_unsigned(sort * s, expr * rm, expr * t) {
+ SASSERT(is_float(s) && s->get_num_parameters() == 2);
+ expr * args[] = { rm, t };
+ return m().mk_app(m_fid, OP_FPA_TO_FP_UNSIGNED, 2, s->get_parameters(), 2, args);
+ }
+
+ bool is_to_fp(expr * n) { return is_app_of(n, m_fid, OP_FPA_TO_FP); }
+
+ app * mk_to_ubv(expr * rm, expr * t, unsigned sz) {
+ parameter ps[] = { parameter(sz) };
+ expr * args[] = { rm, t };
+ return m().mk_app(m_fid, OP_FPA_TO_UBV, 1, ps, 2, args); }
+ app * mk_to_sbv(expr * rm, expr * t, unsigned sz) {
+ parameter ps[] = { parameter(sz) };
+ expr * args[] = { rm, t };
+ return m().mk_app(m_fid, OP_FPA_TO_SBV, 1, ps, 2, args);
+ }
+ app * mk_to_real(expr * t) { return m().mk_app(m_fid, OP_FPA_TO_REAL, t); }
+
+ app * mk_add(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FPA_ADD, arg1, arg2, arg3); }
+ app * mk_mul(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FPA_MUL, arg1, arg2, arg3); }
+ app * mk_sub(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FPA_SUB, arg1, arg2, arg3); }
+ app * mk_div(expr * arg1, expr * arg2, expr * arg3) { return m().mk_app(m_fid, OP_FPA_DIV, arg1, arg2, arg3); }
+ app * mk_neg(expr * arg1) { return m().mk_app(m_fid, OP_FPA_NEG, arg1); }
+ app * mk_rem(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_REM, arg1, arg2); }
+ app * mk_max(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_MAX, arg1, arg2); }
+ app * mk_min(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_MIN, arg1, arg2); }
+ app * mk_abs(expr * arg1) { return m().mk_app(m_fid, OP_FPA_ABS, arg1); }
+ app * mk_sqrt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_SQRT, arg1, arg2); }
+ app * mk_round_to_integral(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_ROUND_TO_INTEGRAL, arg1, arg2); }
+ app * mk_fma(expr * arg1, expr * arg2, expr * arg3, expr * arg4) {
+ expr * args[4] = { arg1, arg2, arg3, arg4 };
+ return m().mk_app(m_fid, OP_FPA_FMA, 4, args);
+ }
+
+ app * mk_float_eq(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_EQ, arg1, arg2); }
+ app * mk_lt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_LT, arg1, arg2); }
+ app * mk_gt(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_GT, arg1, arg2); }
+ app * mk_le(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_LE, arg1, arg2); }
+ app * mk_ge(expr * arg1, expr * arg2) { return m().mk_app(m_fid, OP_FPA_GE, arg1, arg2); }
+
+ app * mk_is_nan(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_NAN, arg1); }
+ app * mk_is_inf(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_INF, arg1); }
+ app * mk_is_zero(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_ZERO, arg1); }
+ app * mk_is_normal(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_NORMAL, arg1); }
+ app * mk_is_subnormal(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_SUBNORMAL, arg1); }
+ app * mk_is_positive(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_POSITIVE, arg1); }
+ app * mk_is_negative(expr * arg1) { return m().mk_app(m_fid, OP_FPA_IS_NEGATIVE, arg1); }
+
+ bool is_neg(expr * a) { return is_app_of(a, m_fid, OP_FPA_NEG); }
+
+ app * mk_float_to_ieee_bv(expr * arg1) { return m().mk_app(m_fid, OP_FPA_TO_IEEE_BV, arg1); }
+
+ app * mk_internal_to_ubv_unspecified(unsigned width);
+ app * mk_internal_to_sbv_unspecified(unsigned width);
+ app * mk_internal_to_real_unspecified();
+
+ bool is_wrap(expr * e) const { return is_app_of(e, get_family_id(), OP_FPA_INTERNAL_BVWRAP); }
+ bool is_unwrap(expr * e) const { return is_app_of(e, get_family_id(), OP_FPA_INTERNAL_BVUNWRAP); }
+};
+
+#endif
diff --git a/src/ast/pp_params.pyg b/src/ast/pp_params.pyg
index 75b2baddd..7424b516f 100644
--- a/src/ast/pp_params.pyg
+++ b/src/ast/pp_params.pyg
@@ -10,6 +10,7 @@ def_module_params('pp',
('decimal', BOOL, False, 'pretty print real numbers using decimal notation (the output may be truncated). Z3 adds a ? if the value is not precise'),
('decimal_precision', UINT, 10, 'maximum number of decimal places to be used when pp.decimal=true'),
('bv_literals', BOOL, True, 'use Bit-Vector literals (e.g, #x0F and #b0101) during pretty printing'),
+ ('fp_real_literals', BOOL, False, 'use real-numbered floating point literals (e.g, +1.0p-1) during pretty printing'),
('bv_neg', BOOL, False, 'use bvneg when displaying Bit-Vector literals where the most significant bit is 1'),
('flat_assoc', BOOL, True, 'flat associative operators (when pretty printing SMT2 terms/formulas)'),
('fixed_indent', BOOL, False, 'use a fixed indentation for applications'),
diff --git a/src/ast/reg_decl_plugins.cpp b/src/ast/reg_decl_plugins.cpp
index ab1844e07..f46dd76d4 100644
--- a/src/ast/reg_decl_plugins.cpp
+++ b/src/ast/reg_decl_plugins.cpp
@@ -24,7 +24,7 @@ Revision History:
#include"datatype_decl_plugin.h"
#include"dl_decl_plugin.h"
#include"seq_decl_plugin.h"
-#include"float_decl_plugin.h"
+#include"fpa_decl_plugin.h"
void reg_decl_plugins(ast_manager & m) {
if (!m.get_plugin(m.mk_family_id(symbol("arith")))) {
@@ -45,7 +45,7 @@ void reg_decl_plugins(ast_manager & m) {
if (!m.get_plugin(m.mk_family_id(symbol("seq")))) {
m.register_plugin(symbol("seq"), alloc(seq_decl_plugin));
}
- if (!m.get_plugin(m.mk_family_id(symbol("float")))) {
- m.register_plugin(symbol("float"), alloc(float_decl_plugin));
+ if (!m.get_plugin(m.mk_family_id(symbol("fpa")))) {
+ m.register_plugin(symbol("fpa"), alloc(fpa_decl_plugin));
}
}
diff --git a/src/ast/rewriter/dl_rewriter.cpp b/src/ast/rewriter/dl_rewriter.cpp
index 9b79775d5..ddae6c9eb 100644
--- a/src/ast/rewriter/dl_rewriter.cpp
+++ b/src/ast/rewriter/dl_rewriter.cpp
@@ -24,31 +24,31 @@ Revision History:
ast_manager& m = result.get_manager();
uint64 v1, v2;
switch(f->get_decl_kind()) {
- case datalog::OP_DL_LT:
- if (m_util.is_numeral_ext(args[0], v1) &&
- m_util.is_numeral_ext(args[1], v2)) {
- result = (v1 < v2)?m.mk_true():m.mk_false();
- return BR_DONE;
- }
- // x < x <=> false
- if (args[0] == args[1]) {
- result = m.mk_false();
- return BR_DONE;
- }
- // x < 0 <=> false
- if (m_util.is_numeral_ext(args[1], v2) && v2 == 0) {
- result = m.mk_false();
- return BR_DONE;
- }
- // 0 < x <=> 0 != x
- if (m_util.is_numeral_ext(args[1], v1) && v1 == 0) {
- result = m.mk_not(m.mk_eq(args[0], args[1]));
- return BR_DONE;
- }
- break;
+ case datalog::OP_DL_LT:
+ if (m_util.is_numeral_ext(args[0], v1) &&
+ m_util.is_numeral_ext(args[1], v2)) {
+ result = (v1 < v2)?m.mk_true():m.mk_false();
+ return BR_DONE;
+ }
+ // x < x <=> false
+ if (args[0] == args[1]) {
+ result = m.mk_false();
+ return BR_DONE;
+ }
+ // x < 0 <=> false
+ if (m_util.is_numeral_ext(args[1], v2) && v2 == 0) {
+ result = m.mk_false();
+ return BR_DONE;
+ }
+ // 0 < x <=> 0 != x
+ if (m_util.is_numeral_ext(args[1], v1) && v1 == 0) {
+ result = m.mk_not(m.mk_eq(args[0], args[1]));
+ return BR_DONE;
+ }
+ break;
- default:
- break;
+ default:
+ break;
}
return BR_FAILED;
}
diff --git a/src/ast/rewriter/float_rewriter.cpp b/src/ast/rewriter/float_rewriter.cpp
deleted file mode 100644
index 7dc34dd11..000000000
--- a/src/ast/rewriter/float_rewriter.cpp
+++ /dev/null
@@ -1,556 +0,0 @@
-/*++
-Copyright (c) 2012 Microsoft Corporation
-
-Module Name:
-
- float_rewriter.cpp
-
-Abstract:
-
- Basic rewriting rules for floating point numbers.
-
-Author:
-
- Leonardo (leonardo) 2012-02-02
-
-Notes:
-
---*/
-#include"float_rewriter.h"
-
-float_rewriter::float_rewriter(ast_manager & m, params_ref const & p):
- m_util(m) {
- updt_params(p);
-}
-
-float_rewriter::~float_rewriter() {
-}
-
-void float_rewriter::updt_params(params_ref const & p) {
-}
-
-void float_rewriter::get_param_descrs(param_descrs & r) {
-}
-
-br_status float_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
- br_status st = BR_FAILED;
- SASSERT(f->get_family_id() == get_fid());
- switch (f->get_decl_kind()) {
- case OP_TO_FLOAT: st = mk_to_fp(f, num_args, args, result); break;
- case OP_FLOAT_ADD: SASSERT(num_args == 3); st = mk_add(args[0], args[1], args[2], result); break;
- case OP_FLOAT_SUB: SASSERT(num_args == 3); st = mk_sub(args[0], args[1], args[2], result); break;
- case OP_FLOAT_NEG: SASSERT(num_args == 1); st = mk_neg(args[0], result); break;
- case OP_FLOAT_MUL: SASSERT(num_args == 3); st = mk_mul(args[0], args[1], args[2], result); break;
- case OP_FLOAT_DIV: SASSERT(num_args == 3); st = mk_div(args[0], args[1], args[2], result); break;
- case OP_FLOAT_REM: SASSERT(num_args == 2); st = mk_rem(args[0], args[1], result); break;
- case OP_FLOAT_ABS: SASSERT(num_args == 1); st = mk_abs(args[0], result); break;
- case OP_FLOAT_MIN: SASSERT(num_args == 2); st = mk_min(args[0], args[1], result); break;
- case OP_FLOAT_MAX: SASSERT(num_args == 2); st = mk_max(args[0], args[1], result); break;
- case OP_FLOAT_FMA: SASSERT(num_args == 4); st = mk_fma(args[0], args[1], args[2], args[3], result); break;
- case OP_FLOAT_SQRT: SASSERT(num_args == 2); st = mk_sqrt(args[0], args[1], result); break;
- case OP_FLOAT_ROUND_TO_INTEGRAL: SASSERT(num_args == 2); st = mk_round(args[0], args[1], result); break;
-
- case OP_FLOAT_EQ: SASSERT(num_args == 2); st = mk_float_eq(args[0], args[1], result); break;
- case OP_FLOAT_LT: SASSERT(num_args == 2); st = mk_lt(args[0], args[1], result); break;
- case OP_FLOAT_GT: SASSERT(num_args == 2); st = mk_gt(args[0], args[1], result); break;
- case OP_FLOAT_LE: SASSERT(num_args == 2); st = mk_le(args[0], args[1], result); break;
- case OP_FLOAT_GE: SASSERT(num_args == 2); st = mk_ge(args[0], args[1], result); break;
- case OP_FLOAT_IS_ZERO: SASSERT(num_args == 1); st = mk_is_zero(args[0], result); break;
- case OP_FLOAT_IS_NZERO: SASSERT(num_args == 1); st = mk_is_nzero(args[0], result); break;
- case OP_FLOAT_IS_PZERO: SASSERT(num_args == 1); st = mk_is_pzero(args[0], result); break;
- case OP_FLOAT_IS_NAN: SASSERT(num_args == 1); st = mk_is_nan(args[0], result); break;
- case OP_FLOAT_IS_INF: SASSERT(num_args == 1); st = mk_is_inf(args[0], result); break;
- case OP_FLOAT_IS_NORMAL: SASSERT(num_args == 1); st = mk_is_normal(args[0], result); break;
- case OP_FLOAT_IS_SUBNORMAL: SASSERT(num_args == 1); st = mk_is_subnormal(args[0], result); break;
- case OP_FLOAT_IS_NEGATIVE: SASSERT(num_args == 1); st = mk_is_negative(args[0], result); break;
- case OP_FLOAT_IS_POSITIVE: SASSERT(num_args == 1); st = mk_is_positive(args[0], result); break;
- case OP_FLOAT_TO_IEEE_BV: SASSERT(num_args == 1); st = mk_to_ieee_bv(args[0], result); break;
- case OP_FLOAT_FP: SASSERT(num_args == 3); st = mk_fp(args[0], args[1], args[2], result); break;
- case OP_FLOAT_TO_UBV: SASSERT(num_args == 2); st = mk_to_ubv(args[0], args[1], result); break;
- case OP_FLOAT_TO_SBV: SASSERT(num_args == 2); st = mk_to_sbv(args[0], args[1], result); break;
- case OP_FLOAT_TO_REAL: SASSERT(num_args == 1); st = mk_to_real(args[0], result); break;
- }
- return st;
-}
-
-br_status float_rewriter::mk_to_fp(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
- SASSERT(f->get_num_parameters() == 2);
- SASSERT(f->get_parameter(0).is_int());
- SASSERT(f->get_parameter(1).is_int());
- unsigned ebits = f->get_parameter(0).get_int();
- unsigned sbits = f->get_parameter(1).get_int();
-
- if (num_args == 2) {
- mpf_rounding_mode rm;
- if (!m_util.is_rm_value(args[0], rm))
- return BR_FAILED;
-
- rational q;
- mpf q_mpf;
- if (m_util.au().is_numeral(args[1], q)) {
- TRACE("fp_rewriter", tout << "q: " << q << std::endl; );
- mpf v;
- m_util.fm().set(v, ebits, sbits, rm, q.to_mpq());
- result = m_util.mk_value(v);
- m_util.fm().del(v);
- // TRACE("fp_rewriter", tout << "result: " << result << std::endl; );
- return BR_DONE;
- }
- else if (m_util.is_value(args[1], q_mpf)) {
- TRACE("fp_rewriter", tout << "q: " << m_util.fm().to_string(q_mpf) << std::endl; );
- mpf v;
- m_util.fm().set(v, ebits, sbits, rm, q_mpf);
- result = m_util.mk_value(v);
- m_util.fm().del(v);
- // TRACE("fp_rewriter", tout << "result: " << result << std::endl; );
- return BR_DONE;
- }
- else
- return BR_FAILED;
- }
- else if (num_args == 3 &&
- m_util.is_rm(args[0]) &&
- m_util.au().is_real(args[1]) &&
- m_util.au().is_int(args[2])) {
-
- mpf_rounding_mode rm;
- if (!m_util.is_rm_value(args[0], rm))
- return BR_FAILED;
-
- rational q;
- if (!m_util.au().is_numeral(args[1], q))
- return BR_FAILED;
-
- rational e;
- if (!m_util.au().is_numeral(args[2], e))
- return BR_FAILED;
-
- TRACE("fp_rewriter", tout << "q: " << q << ", e: " << e << "\n";);
- mpf v;
- m_util.fm().set(v, ebits, sbits, rm, q.to_mpq(), e.to_mpq().numerator());
- result = m_util.mk_value(v);
- m_util.fm().del(v);
- return BR_DONE;
- }
- else {
- return BR_FAILED;
- }
-}
-
-br_status float_rewriter::mk_add(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm()), v3(m_util.fm());
- if (m_util.is_value(arg2, v2) && m_util.is_value(arg3, v3)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().add(rm, v2, v3, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_sub(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
- // a - b = a + (-b)
- result = m_util.mk_add(arg1, arg2, m_util.mk_neg(arg3));
- return BR_REWRITE2;
-}
-
-br_status float_rewriter::mk_mul(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm()), v3(m_util.fm());
- if (m_util.is_value(arg2, v2) && m_util.is_value(arg3, v3)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().mul(rm, v2, v3, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_div(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm()), v3(m_util.fm());
- if (m_util.is_value(arg2, v2) && m_util.is_value(arg3, v3)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().div(rm, v2, v3, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_neg(expr * arg1, expr_ref & result) {
- if (m_util.is_nan(arg1)) {
- // -nan --> nan
- result = arg1;
- return BR_DONE;
- }
- if (m_util.is_plus_inf(arg1)) {
- // - +oo --> -oo
- result = m_util.mk_minus_inf(m().get_sort(arg1));
- return BR_DONE;
- }
- if (m_util.is_minus_inf(arg1)) {
- // - -oo -> +oo
- result = m_util.mk_plus_inf(m().get_sort(arg1));
- return BR_DONE;
- }
- if (m_util.is_neg(arg1)) {
- // - - a --> a
- result = to_app(arg1)->get_arg(0);
- return BR_DONE;
- }
-
- scoped_mpf v1(m_util.fm());
- if (m_util.is_value(arg1, v1)) {
- m_util.fm().neg(v1);
- result = m_util.mk_value(v1);
- return BR_DONE;
- }
-
- // TODO: more simplifications
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_rem(expr * arg1, expr * arg2, expr_ref & result) {
- scoped_mpf v1(m_util.fm()), v2(m_util.fm());
- if (m_util.is_value(arg1, v1) && m_util.is_value(arg2, v2)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().rem(v1, v2, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_abs(expr * arg1, expr_ref & result) {
- if (m_util.is_nan(arg1)) {
- result = arg1;
- return BR_DONE;
- }
- result = m().mk_ite(m_util.mk_is_sign_minus(arg1),
- m_util.mk_neg(arg1),
- arg1);
- return BR_REWRITE2;
-}
-
-br_status float_rewriter::mk_min(expr * arg1, expr * arg2, expr_ref & result) {
- if (m_util.is_nan(arg1)) {
- result = arg2;
- return BR_DONE;
- }
- if (m_util.is_nan(arg2)) {
- result = arg1;
- return BR_DONE;
- }
- // expand as using ite's
- result = m().mk_ite(m().mk_or(mk_eq_nan(arg1), m().mk_and(m_util.mk_is_zero(arg1), m_util.mk_is_zero(arg2))),
- arg2,
- m().mk_ite(mk_eq_nan(arg2),
- arg1,
- m().mk_ite(m_util.mk_lt(arg1, arg2),
- arg1,
- arg2)));
- return BR_REWRITE_FULL;
-}
-
-br_status float_rewriter::mk_max(expr * arg1, expr * arg2, expr_ref & result) {
- if (m_util.is_nan(arg1)) {
- result = arg2;
- return BR_DONE;
- }
- if (m_util.is_nan(arg2)) {
- result = arg1;
- return BR_DONE;
- }
- // expand as using ite's
- result = m().mk_ite(m().mk_or(mk_eq_nan(arg1), m().mk_and(m_util.mk_is_zero(arg1), m_util.mk_is_zero(arg2))),
- arg2,
- m().mk_ite(mk_eq_nan(arg2),
- arg1,
- m().mk_ite(m_util.mk_gt(arg1, arg2),
- arg1,
- arg2)));
- return BR_REWRITE_FULL;
-}
-
-br_status float_rewriter::mk_fma(expr * arg1, expr * arg2, expr * arg3, expr * arg4, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm()), v3(m_util.fm()), v4(m_util.fm());
- if (m_util.is_value(arg2, v2) && m_util.is_value(arg3, v3) && m_util.is_value(arg4, v4)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().fused_mul_add(rm, v2, v3, v4, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_sqrt(expr * arg1, expr * arg2, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm());
- if (m_util.is_value(arg2, v2)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().sqrt(rm, v2, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_round(expr * arg1, expr * arg2, expr_ref & result) {
- mpf_rounding_mode rm;
- if (m_util.is_rm_value(arg1, rm)) {
- scoped_mpf v2(m_util.fm());
- if (m_util.is_value(arg2, v2)) {
- scoped_mpf t(m_util.fm());
- m_util.fm().round_to_integral(rm, v2, t);
- result = m_util.mk_value(t);
- return BR_DONE;
- }
- }
-
- return BR_FAILED;
-}
-
-// This the floating point theory ==
-br_status float_rewriter::mk_float_eq(expr * arg1, expr * arg2, expr_ref & result) {
- scoped_mpf v1(m_util.fm()), v2(m_util.fm());
- if (m_util.is_value(arg1, v1) && m_util.is_value(arg2, v2)) {
- result = (m_util.fm().eq(v1, v2)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-// Return (= arg NaN)
-app * float_rewriter::mk_eq_nan(expr * arg) {
- return m().mk_eq(arg, m_util.mk_nan(m().get_sort(arg)));
-}
-
-// Return (not (= arg NaN))
-app * float_rewriter::mk_neq_nan(expr * arg) {
- return m().mk_not(mk_eq_nan(arg));
-}
-
-br_status float_rewriter::mk_lt(expr * arg1, expr * arg2, expr_ref & result) {
- if (m_util.is_nan(arg1) || m_util.is_nan(arg2)) {
- result = m().mk_false();
- return BR_DONE;
- }
- if (m_util.is_minus_inf(arg1)) {
- // -oo < arg2 --> not(arg2 = -oo) and not(arg2 = NaN)
- result = m().mk_and(m().mk_not(m().mk_eq(arg2, arg1)), mk_neq_nan(arg2));
- return BR_REWRITE3;
- }
- if (m_util.is_minus_inf(arg2)) {
- // arg1 < -oo --> false
- result = m().mk_false();
- return BR_DONE;
- }
- if (m_util.is_plus_inf(arg1)) {
- // +oo < arg2 --> false
- result = m().mk_false();
- return BR_DONE;
- }
- if (m_util.is_plus_inf(arg2)) {
- // arg1 < +oo --> not(arg1 = +oo) and not(arg1 = NaN)
- result = m().mk_and(m().mk_not(m().mk_eq(arg1, arg2)), mk_neq_nan(arg1));
- return BR_REWRITE3;
- }
-
- scoped_mpf v1(m_util.fm()), v2(m_util.fm());
- if (m_util.is_value(arg1, v1) && m_util.is_value(arg2, v2)) {
- result = (m_util.fm().lt(v1, v2)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- // TODO: more simplifications
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_gt(expr * arg1, expr * arg2, expr_ref & result) {
- result = m_util.mk_lt(arg2, arg1);
- return BR_REWRITE1;
-}
-
-br_status float_rewriter::mk_le(expr * arg1, expr * arg2, expr_ref & result) {
- if (m_util.is_nan(arg1) || m_util.is_nan(arg2)) {
- result = m().mk_false();
- return BR_DONE;
- }
- scoped_mpf v1(m_util.fm()), v2(m_util.fm());
- if (m_util.is_value(arg1, v1) && m_util.is_value(arg2, v2)) {
- result = (m_util.fm().le(v1, v2)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_ge(expr * arg1, expr * arg2, expr_ref & result) {
- result = m_util.mk_le(arg2, arg1);
- return BR_REWRITE1;
-}
-
-br_status float_rewriter::mk_is_zero(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_zero(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_nzero(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_nzero(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_pzero(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_pzero(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_nan(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_nan(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_inf(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_inf(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_normal(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_normal(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_subnormal(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_denormal(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_negative(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_neg(v)) ? m().mk_true() : m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_is_positive(expr * arg1, expr_ref & result) {
- scoped_mpf v(m_util.fm());
- if (m_util.is_value(arg1, v)) {
- result = (m_util.fm().is_neg(v) || m_util.fm().is_nan(v)) ? m().mk_false() : m().mk_true();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-
-// This the SMT =
-br_status float_rewriter::mk_eq_core(expr * arg1, expr * arg2, expr_ref & result) {
- scoped_mpf v1(m_util.fm()), v2(m_util.fm());
- if (m_util.is_value(arg1, v1) && m_util.is_value(arg2, v2)) {
- // Note: == is the floats-equality, here we need normal equality.
- result = (m_fm.is_nan(v1) && m_fm.is_nan(v2)) ? m().mk_true() :
- (m_fm.is_zero(v1) && m_fm.is_zero(v2) && m_fm.sgn(v1)!=m_fm.sgn(v2)) ? m().mk_false() :
- (v1 == v2) ? m().mk_true() :
- m().mk_false();
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_to_ieee_bv(expr * arg1, expr_ref & result) {
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_fp(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
- bv_util bu(m());
- rational r1, r2, r3;
- unsigned bvs1, bvs2, bvs3;
-
- if (bu.is_numeral(arg1, r1, bvs1) && bu.is_numeral(arg2, r2, bvs2) && bu.is_numeral(arg3, r3, bvs3)) {
- SASSERT(m_util.fm().mpz_manager().is_one(r2.to_mpq().denominator()));
- SASSERT(m_util.fm().mpz_manager().is_one(r3.to_mpq().denominator()));
- SASSERT(m_util.fm().mpz_manager().is_int64(r3.to_mpq().numerator()));
- scoped_mpf v(m_util.fm());
- mpf_exp_t biased_exp = m_util.fm().mpz_manager().get_int64(r2.to_mpq().numerator());
- m_util.fm().set(v, bvs2, bvs3 + 1,
- r1.is_one(),
- r3.to_mpq().numerator(),
- m_util.fm().unbias_exp(bvs2, biased_exp));
- TRACE("fp_rewriter", tout << "v = " << m_util.fm().to_string(v) << std::endl;);
- result = m_util.mk_value(v);
- return BR_DONE;
- }
-
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_to_ubv(expr * arg1, expr * arg2, expr_ref & result) {
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_to_sbv(expr * arg1, expr * arg2, expr_ref & result) {
- return BR_FAILED;
-}
-
-br_status float_rewriter::mk_to_real(expr * arg1, expr_ref & result) {
- return BR_FAILED;
-}
\ No newline at end of file
diff --git a/src/ast/rewriter/fpa_rewriter.cpp b/src/ast/rewriter/fpa_rewriter.cpp
new file mode 100644
index 000000000..9a8ab7da0
--- /dev/null
+++ b/src/ast/rewriter/fpa_rewriter.cpp
@@ -0,0 +1,596 @@
+/*++
+Copyright (c) 2012 Microsoft Corporation
+
+Module Name:
+
+ fpa_rewriter.cpp
+
+Abstract:
+
+ Basic rewriting rules for floating point numbers.
+
+Author:
+
+ Leonardo (leonardo) 2012-02-02
+
+Notes:
+
+--*/
+#include"fpa_rewriter.h"
+
+fpa_rewriter::fpa_rewriter(ast_manager & m, params_ref const & p):
+ m_util(m) {
+ updt_params(p);
+}
+
+fpa_rewriter::~fpa_rewriter() {
+}
+
+void fpa_rewriter::updt_params(params_ref const & p) {
+}
+
+void fpa_rewriter::get_param_descrs(param_descrs & r) {
+}
+
+br_status fpa_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
+ br_status st = BR_FAILED;
+ SASSERT(f->get_family_id() == get_fid());
+ switch (f->get_decl_kind()) {
+ case OP_FPA_TO_FP: st = mk_to_fp(f, num_args, args, result); break;
+ case OP_FPA_TO_FP_UNSIGNED: st = mk_to_fp_unsigned(f, num_args, args, result); break;
+ case OP_FPA_ADD: SASSERT(num_args == 3); st = mk_add(args[0], args[1], args[2], result); break;
+ case OP_FPA_SUB: SASSERT(num_args == 3); st = mk_sub(args[0], args[1], args[2], result); break;
+ case OP_FPA_NEG: SASSERT(num_args == 1); st = mk_neg(args[0], result); break;
+ case OP_FPA_MUL: SASSERT(num_args == 3); st = mk_mul(args[0], args[1], args[2], result); break;
+ case OP_FPA_DIV: SASSERT(num_args == 3); st = mk_div(args[0], args[1], args[2], result); break;
+ case OP_FPA_REM: SASSERT(num_args == 2); st = mk_rem(args[0], args[1], result); break;
+ case OP_FPA_ABS: SASSERT(num_args == 1); st = mk_abs(args[0], result); break;
+ case OP_FPA_MIN: SASSERT(num_args == 2); st = mk_min(args[0], args[1], result); break;
+ case OP_FPA_MAX: SASSERT(num_args == 2); st = mk_max(args[0], args[1], result); break;
+ case OP_FPA_FMA: SASSERT(num_args == 4); st = mk_fma(args[0], args[1], args[2], args[3], result); break;
+ case OP_FPA_SQRT: SASSERT(num_args == 2); st = mk_sqrt(args[0], args[1], result); break;
+ case OP_FPA_ROUND_TO_INTEGRAL: SASSERT(num_args == 2); st = mk_round(args[0], args[1], result); break;
+
+ case OP_FPA_EQ: SASSERT(num_args == 2); st = mk_float_eq(args[0], args[1], result); break;
+ case OP_FPA_LT: SASSERT(num_args == 2); st = mk_lt(args[0], args[1], result); break;
+ case OP_FPA_GT: SASSERT(num_args == 2); st = mk_gt(args[0], args[1], result); break;
+ case OP_FPA_LE: SASSERT(num_args == 2); st = mk_le(args[0], args[1], result); break;
+ case OP_FPA_GE: SASSERT(num_args == 2); st = mk_ge(args[0], args[1], result); break;
+ case OP_FPA_IS_ZERO: SASSERT(num_args == 1); st = mk_is_zero(args[0], result); break;
+ case OP_FPA_IS_NAN: SASSERT(num_args == 1); st = mk_is_nan(args[0], result); break;
+ case OP_FPA_IS_INF: SASSERT(num_args == 1); st = mk_is_inf(args[0], result); break;
+ case OP_FPA_IS_NORMAL: SASSERT(num_args == 1); st = mk_is_normal(args[0], result); break;
+ case OP_FPA_IS_SUBNORMAL: SASSERT(num_args == 1); st = mk_is_subnormal(args[0], result); break;
+ case OP_FPA_IS_NEGATIVE: SASSERT(num_args == 1); st = mk_is_negative(args[0], result); break;
+ case OP_FPA_IS_POSITIVE: SASSERT(num_args == 1); st = mk_is_positive(args[0], result); break;
+ case OP_FPA_FP: SASSERT(num_args == 3); st = mk_fp(args[0], args[1], args[2], result); break;
+ case OP_FPA_TO_UBV: SASSERT(num_args == 2); st = mk_to_ubv(args[0], args[1], result); break;
+ case OP_FPA_TO_SBV: SASSERT(num_args == 2); st = mk_to_sbv(args[0], args[1], result); break;
+ case OP_FPA_TO_REAL: SASSERT(num_args == 1); st = mk_to_real(args[0], result); break;
+ case OP_FPA_TO_IEEE_BV: SASSERT(num_args == 1); st = mk_to_ieee_bv(args[0], result); break;
+ }
+ return st;
+}
+
+br_status fpa_rewriter::mk_to_fp(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
+ SASSERT(f->get_num_parameters() == 2);
+ SASSERT(f->get_parameter(0).is_int());
+ SASSERT(f->get_parameter(1).is_int());
+ unsigned ebits = f->get_parameter(0).get_int();
+ unsigned sbits = f->get_parameter(1).get_int();
+
+ if (num_args == 2) {
+ mpf_rounding_mode rm;
+ if (!m_util.is_rm_numeral(args[0], rm))
+ return BR_FAILED;
+
+ rational q;
+ scoped_mpf q_mpf(m_util.fm());
+ if (m_util.au().is_numeral(args[1], q)) {
+ TRACE("fp_rewriter", tout << "q: " << q << std::endl; );
+ scoped_mpf v(m_util.fm());
+ m_util.fm().set(v, ebits, sbits, rm, q.to_mpq());
+ result = m_util.mk_value(v);
+ m_util.fm().del(v);
+ // TRACE("fp_rewriter", tout << "result: " << result << std::endl; );
+ return BR_DONE;
+ }
+ else if (m_util.is_numeral(args[1], q_mpf)) {
+ TRACE("fp_rewriter", tout << "q: " << m_util.fm().to_string(q_mpf) << std::endl; );
+ scoped_mpf v(m_util.fm());
+ m_util.fm().set(v, ebits, sbits, rm, q_mpf);
+ result = m_util.mk_value(v);
+ m_util.fm().del(v);
+ // TRACE("fp_rewriter", tout << "result: " << result << std::endl; );
+ return BR_DONE;
+ }
+ else
+ return BR_FAILED;
+ }
+ else if (num_args == 3) {
+ bv_util bu(m());
+ rational r1, r2, r3;
+ unsigned bvs1, bvs2, bvs3;
+
+ if (m_util.is_rm(args[0]) &&
+ m_util.au().is_real(args[1]) &&
+ m_util.au().is_int(args[2])) {
+ mpf_rounding_mode rm;
+ if (!m_util.is_rm_numeral(args[0], rm))
+ return BR_FAILED;
+
+ rational q;
+ if (!m_util.au().is_numeral(args[1], q))
+ return BR_FAILED;
+
+ rational e;
+ if (!m_util.au().is_numeral(args[2], e))
+ return BR_FAILED;
+
+ TRACE("fp_rewriter", tout << "q: " << q << ", e: " << e << "\n";);
+ scoped_mpf v(m_util.fm());
+ m_util.fm().set(v, ebits, sbits, rm, q.to_mpq(), e.to_mpq().numerator());
+ result = m_util.mk_value(v);
+ m_util.fm().del(v);
+ return BR_DONE;
+ }
+ else if (bu.is_numeral(args[0], r1, bvs1) &&
+ bu.is_numeral(args[1], r2, bvs2) &&
+ bu.is_numeral(args[2], r3, bvs3)) {
+ SASSERT(m_util.fm().mpz_manager().is_one(r2.to_mpq().denominator()));
+ SASSERT(m_util.fm().mpz_manager().is_one(r3.to_mpq().denominator()));
+ SASSERT(m_util.fm().mpz_manager().is_int64(r3.to_mpq().numerator()));
+ scoped_mpf v(m_util.fm());
+ mpf_exp_t biased_exp = m_util.fm().mpz_manager().get_int64(r2.to_mpq().numerator());
+ m_util.fm().set(v, bvs2, bvs3 + 1,
+ r1.is_one(),
+ r3.to_mpq().numerator(),
+ m_util.fm().unbias_exp(bvs2, biased_exp));
+ TRACE("fp_rewriter", tout << "v = " << m_util.fm().to_string(v) << std::endl;);
+ result = m_util.mk_value(v);
+ return BR_DONE;
+ }
+ else
+ return BR_FAILED;
+ }
+ else
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_to_fp_unsigned(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
+ SASSERT(f->get_num_parameters() == 2);
+ SASSERT(f->get_parameter(0).is_int());
+ SASSERT(f->get_parameter(1).is_int());
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_add(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm()), v3(m_util.fm());
+ if (m_util.is_numeral(arg2, v2) && m_util.is_numeral(arg3, v3)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().add(rm, v2, v3, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_sub(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
+ // a - b = a + (-b)
+ result = m_util.mk_add(arg1, arg2, m_util.mk_neg(arg3));
+ return BR_REWRITE2;
+}
+
+br_status fpa_rewriter::mk_mul(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm()), v3(m_util.fm());
+ if (m_util.is_numeral(arg2, v2) && m_util.is_numeral(arg3, v3)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().mul(rm, v2, v3, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_div(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm()), v3(m_util.fm());
+ if (m_util.is_numeral(arg2, v2) && m_util.is_numeral(arg3, v3)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().div(rm, v2, v3, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_neg(expr * arg1, expr_ref & result) {
+ if (m_util.is_nan(arg1)) {
+ // -nan --> nan
+ result = arg1;
+ return BR_DONE;
+ }
+ if (m_util.is_pinf(arg1)) {
+ // - +oo --> -oo
+ result = m_util.mk_ninf(m().get_sort(arg1));
+ return BR_DONE;
+ }
+ if (m_util.is_ninf(arg1)) {
+ // - -oo -> +oo
+ result = m_util.mk_pinf(m().get_sort(arg1));
+ return BR_DONE;
+ }
+ if (m_util.is_neg(arg1)) {
+ // - - a --> a
+ result = to_app(arg1)->get_arg(0);
+ return BR_DONE;
+ }
+
+ scoped_mpf v1(m_util.fm());
+ if (m_util.is_numeral(arg1, v1)) {
+ m_util.fm().neg(v1);
+ result = m_util.mk_value(v1);
+ return BR_DONE;
+ }
+
+ // TODO: more simplifications
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_rem(expr * arg1, expr * arg2, expr_ref & result) {
+ scoped_mpf v1(m_util.fm()), v2(m_util.fm());
+ if (m_util.is_numeral(arg1, v1) && m_util.is_numeral(arg2, v2)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().rem(v1, v2, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_abs(expr * arg1, expr_ref & result) {
+ if (m_util.is_nan(arg1)) {
+ result = arg1;
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_min(expr * arg1, expr * arg2, expr_ref & result) {
+ if (m_util.is_nan(arg1)) {
+ result = arg2;
+ return BR_DONE;
+ }
+ if (m_util.is_nan(arg2)) {
+ result = arg1;
+ return BR_DONE;
+ }
+ // expand as using ite's
+ result = m().mk_ite(m().mk_or(mk_eq_nan(arg1), m().mk_and(m_util.mk_is_zero(arg1), m_util.mk_is_zero(arg2))),
+ arg2,
+ m().mk_ite(mk_eq_nan(arg2),
+ arg1,
+ m().mk_ite(m_util.mk_lt(arg1, arg2),
+ arg1,
+ arg2)));
+ return BR_REWRITE_FULL;
+}
+
+br_status fpa_rewriter::mk_max(expr * arg1, expr * arg2, expr_ref & result) {
+ if (m_util.is_nan(arg1)) {
+ result = arg2;
+ return BR_DONE;
+ }
+ if (m_util.is_nan(arg2)) {
+ result = arg1;
+ return BR_DONE;
+ }
+ // expand as using ite's
+ result = m().mk_ite(m().mk_or(mk_eq_nan(arg1), m().mk_and(m_util.mk_is_zero(arg1), m_util.mk_is_zero(arg2))),
+ arg2,
+ m().mk_ite(mk_eq_nan(arg2),
+ arg1,
+ m().mk_ite(m_util.mk_gt(arg1, arg2),
+ arg1,
+ arg2)));
+ return BR_REWRITE_FULL;
+}
+
+br_status fpa_rewriter::mk_fma(expr * arg1, expr * arg2, expr * arg3, expr * arg4, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm()), v3(m_util.fm()), v4(m_util.fm());
+ if (m_util.is_numeral(arg2, v2) && m_util.is_numeral(arg3, v3) && m_util.is_numeral(arg4, v4)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().fused_mul_add(rm, v2, v3, v4, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_sqrt(expr * arg1, expr * arg2, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm());
+ if (m_util.is_numeral(arg2, v2)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().sqrt(rm, v2, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_round(expr * arg1, expr * arg2, expr_ref & result) {
+ mpf_rounding_mode rm;
+ if (m_util.is_rm_numeral(arg1, rm)) {
+ scoped_mpf v2(m_util.fm());
+ if (m_util.is_numeral(arg2, v2)) {
+ scoped_mpf t(m_util.fm());
+ m_util.fm().round_to_integral(rm, v2, t);
+ result = m_util.mk_value(t);
+ return BR_DONE;
+ }
+ }
+
+ return BR_FAILED;
+}
+
+// This the floating point theory ==
+br_status fpa_rewriter::mk_float_eq(expr * arg1, expr * arg2, expr_ref & result) {
+ scoped_mpf v1(m_util.fm()), v2(m_util.fm());
+ if (m_util.is_numeral(arg1, v1) && m_util.is_numeral(arg2, v2)) {
+ result = (m_util.fm().eq(v1, v2)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+// Return (= arg NaN)
+app * fpa_rewriter::mk_eq_nan(expr * arg) {
+ return m().mk_eq(arg, m_util.mk_nan(m().get_sort(arg)));
+}
+
+// Return (not (= arg NaN))
+app * fpa_rewriter::mk_neq_nan(expr * arg) {
+ return m().mk_not(mk_eq_nan(arg));
+}
+
+br_status fpa_rewriter::mk_lt(expr * arg1, expr * arg2, expr_ref & result) {
+ if (m_util.is_nan(arg1) || m_util.is_nan(arg2)) {
+ result = m().mk_false();
+ return BR_DONE;
+ }
+ if (m_util.is_ninf(arg1)) {
+ // -oo < arg2 --> not(arg2 = -oo) and not(arg2 = NaN)
+ result = m().mk_and(m().mk_not(m().mk_eq(arg2, arg1)), mk_neq_nan(arg2));
+ return BR_REWRITE3;
+ }
+ if (m_util.is_ninf(arg2)) {
+ // arg1 < -oo --> false
+ result = m().mk_false();
+ return BR_DONE;
+ }
+ if (m_util.is_pinf(arg1)) {
+ // +oo < arg2 --> false
+ result = m().mk_false();
+ return BR_DONE;
+ }
+ if (m_util.is_pinf(arg2)) {
+ // arg1 < +oo --> not(arg1 = +oo) and not(arg1 = NaN)
+ result = m().mk_and(m().mk_not(m().mk_eq(arg1, arg2)), mk_neq_nan(arg1));
+ return BR_REWRITE3;
+ }
+
+ scoped_mpf v1(m_util.fm()), v2(m_util.fm());
+ if (m_util.is_numeral(arg1, v1) && m_util.is_numeral(arg2, v2)) {
+ result = (m_util.fm().lt(v1, v2)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ // TODO: more simplifications
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_gt(expr * arg1, expr * arg2, expr_ref & result) {
+ result = m_util.mk_lt(arg2, arg1);
+ return BR_REWRITE1;
+}
+
+br_status fpa_rewriter::mk_le(expr * arg1, expr * arg2, expr_ref & result) {
+ if (m_util.is_nan(arg1) || m_util.is_nan(arg2)) {
+ result = m().mk_false();
+ return BR_DONE;
+ }
+ scoped_mpf v1(m_util.fm()), v2(m_util.fm());
+ if (m_util.is_numeral(arg1, v1) && m_util.is_numeral(arg2, v2)) {
+ result = (m_util.fm().le(v1, v2)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_ge(expr * arg1, expr * arg2, expr_ref & result) {
+ result = m_util.mk_le(arg2, arg1);
+ return BR_REWRITE1;
+}
+
+br_status fpa_rewriter::mk_is_zero(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_zero(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_nzero(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_nzero(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_pzero(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_pzero(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_nan(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_nan(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_inf(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_inf(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_normal(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_normal(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_subnormal(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_denormal(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_negative(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_neg(v)) ? m().mk_true() : m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_is_positive(expr * arg1, expr_ref & result) {
+ scoped_mpf v(m_util.fm());
+ if (m_util.is_numeral(arg1, v)) {
+ result = (m_util.fm().is_neg(v) || m_util.fm().is_nan(v)) ? m().mk_false() : m().mk_true();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+
+// This the SMT =
+br_status fpa_rewriter::mk_eq_core(expr * arg1, expr * arg2, expr_ref & result) {
+ scoped_mpf v1(m_util.fm()), v2(m_util.fm());
+ if (m_util.is_numeral(arg1, v1) && m_util.is_numeral(arg2, v2)) {
+ // Note: == is the floats-equality, here we need normal equality.
+ result = (m_fm.is_nan(v1) && m_fm.is_nan(v2)) ? m().mk_true() :
+ (m_fm.is_zero(v1) && m_fm.is_zero(v2) && m_fm.sgn(v1)!=m_fm.sgn(v2)) ? m().mk_false() :
+ (v1 == v2) ? m().mk_true() :
+ m().mk_false();
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_to_ieee_bv(expr * arg1, expr_ref & result) {
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_fp(expr * arg1, expr * arg2, expr * arg3, expr_ref & result) {
+ bv_util bu(m());
+ rational r1, r2, r3;
+ unsigned bvs1, bvs2, bvs3;
+
+ if (bu.is_numeral(arg1, r1, bvs1) && bu.is_numeral(arg2, r2, bvs2) && bu.is_numeral(arg3, r3, bvs3)) {
+ SASSERT(m_util.fm().mpz_manager().is_one(r2.to_mpq().denominator()));
+ SASSERT(m_util.fm().mpz_manager().is_one(r3.to_mpq().denominator()));
+ SASSERT(m_util.fm().mpz_manager().is_int64(r3.to_mpq().numerator()));
+ scoped_mpf v(m_util.fm());
+ mpf_exp_t biased_exp = m_util.fm().mpz_manager().get_int64(r2.to_mpq().numerator());
+ m_util.fm().set(v, bvs2, bvs3 + 1,
+ r1.is_one(),
+ r3.to_mpq().numerator(),
+ m_util.fm().unbias_exp(bvs2, biased_exp));
+ TRACE("fp_rewriter", tout << "simplified (fp ...) to " << m_util.fm().to_string(v) << std::endl;);
+ result = m_util.mk_value(v);
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_to_ubv(expr * arg1, expr * arg2, expr_ref & result) {
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_to_sbv(expr * arg1, expr * arg2, expr_ref & result) {
+ return BR_FAILED;
+}
+
+br_status fpa_rewriter::mk_to_real(expr * arg1, expr_ref & result) {
+ scoped_mpf fv(m_util.fm());
+
+ if (m_util.is_numeral(arg1, fv)) {
+ if (m_fm.is_nan(fv) || m_fm.is_inf(fv)) {
+ result = m_util.mk_internal_to_real_unspecified();
+ }
+ else {
+ scoped_mpq r(m_fm.mpq_manager());
+ m_fm.to_rational(fv, r);
+ result = m_util.au().mk_numeral(r.get(), false);
+ }
+ return BR_DONE;
+ }
+
+ return BR_FAILED;
+}
diff --git a/src/ast/rewriter/float_rewriter.h b/src/ast/rewriter/fpa_rewriter.h
similarity index 91%
rename from src/ast/rewriter/float_rewriter.h
rename to src/ast/rewriter/fpa_rewriter.h
index 4d8cec856..a10df95ca 100644
--- a/src/ast/rewriter/float_rewriter.h
+++ b/src/ast/rewriter/fpa_rewriter.h
@@ -22,19 +22,19 @@ Notes:
#include"ast.h"
#include"rewriter.h"
#include"params.h"
-#include"float_decl_plugin.h"
+#include"fpa_decl_plugin.h"
#include"mpf.h"
-class float_rewriter {
- float_util m_util;
+class fpa_rewriter {
+ fpa_util m_util;
mpf_manager m_fm;
app * mk_eq_nan(expr * arg);
app * mk_neq_nan(expr * arg);
public:
- float_rewriter(ast_manager & m, params_ref const & p = params_ref());
- ~float_rewriter();
+ fpa_rewriter(ast_manager & m, params_ref const & p = params_ref());
+ ~fpa_rewriter();
ast_manager & m() const { return m_util.m(); }
family_id get_fid() const { return m_util.get_fid(); }
@@ -75,6 +75,7 @@ public:
br_status mk_to_ieee_bv(expr * arg1, expr_ref & result);
br_status mk_to_fp(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result);
+ br_status mk_to_fp_unsigned(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result);
br_status mk_fp(expr * arg1, expr * arg2, expr * arg3, expr_ref & result);
br_status mk_to_fp_unsigned(expr * arg1, expr * arg2, expr_ref & result);
br_status mk_to_ubv(expr * arg1, expr * arg2, expr_ref & result);
diff --git a/src/ast/rewriter/mk_simplified_app.cpp b/src/ast/rewriter/mk_simplified_app.cpp
index a46e71582..45245ce1b 100644
--- a/src/ast/rewriter/mk_simplified_app.cpp
+++ b/src/ast/rewriter/mk_simplified_app.cpp
@@ -22,7 +22,7 @@ Notes:
#include"bv_rewriter.h"
#include"datatype_rewriter.h"
#include"array_rewriter.h"
-#include"float_rewriter.h"
+#include"fpa_rewriter.h"
struct mk_simplified_app::imp {
ast_manager & m;
@@ -31,7 +31,7 @@ struct mk_simplified_app::imp {
bv_rewriter m_bv_rw;
array_rewriter m_ar_rw;
datatype_rewriter m_dt_rw;
- float_rewriter m_f_rw;
+ fpa_rewriter m_f_rw;
imp(ast_manager & _m, params_ref const & p):
m(_m),
diff --git a/src/ast/rewriter/th_rewriter.cpp b/src/ast/rewriter/th_rewriter.cpp
index 0e2c8e781..f35c3b134 100644
--- a/src/ast/rewriter/th_rewriter.cpp
+++ b/src/ast/rewriter/th_rewriter.cpp
@@ -23,7 +23,7 @@ Notes:
#include"bv_rewriter.h"
#include"datatype_rewriter.h"
#include"array_rewriter.h"
-#include"float_rewriter.h"
+#include"fpa_rewriter.h"
#include"dl_rewriter.h"
#include"rewriter_def.h"
#include"expr_substitution.h"
@@ -39,7 +39,7 @@ struct th_rewriter_cfg : public default_rewriter_cfg {
bv_rewriter m_bv_rw;
array_rewriter m_ar_rw;
datatype_rewriter m_dt_rw;
- float_rewriter m_f_rw;
+ fpa_rewriter m_f_rw;
dl_rewriter m_dl_rw;
arith_util m_a_util;
bv_util m_bv_util;
diff --git a/src/ast/simplifier/distribute_forall.cpp b/src/ast/simplifier/distribute_forall.cpp
index 5e2958579..bd2af5675 100644
--- a/src/ast/simplifier/distribute_forall.cpp
+++ b/src/ast/simplifier/distribute_forall.cpp
@@ -148,7 +148,7 @@ void distribute_forall::operator()(expr * f, expr_ref & result) {
while (!m_todo.empty()) {
expr * e = m_todo.back();
- if (visit_children(e)) {
+ if (visit_children(e)) {
m_todo.pop_back();
reduce1(e);
}
diff --git a/src/ast/simplifier/fpa_simplifier_plugin.cpp b/src/ast/simplifier/fpa_simplifier_plugin.cpp
new file mode 100644
index 000000000..4aba9c76c
--- /dev/null
+++ b/src/ast/simplifier/fpa_simplifier_plugin.cpp
@@ -0,0 +1,39 @@
+/*++
+Copyright (c) 2015 Microsoft Corporation
+
+Module Name:
+
+ fpa_simplifier_plugin.cpp
+
+Abstract:
+
+ Simplifier for the floating-point theory
+
+Author:
+
+ Christoph (cwinter) 2015-01-14
+
+--*/
+#include"fpa_simplifier_plugin.h"
+
+fpa_simplifier_plugin::fpa_simplifier_plugin(ast_manager & m, basic_simplifier_plugin & b) :
+simplifier_plugin(symbol("fpa"), m),
+m_util(m),
+m_rw(m) {}
+
+fpa_simplifier_plugin::~fpa_simplifier_plugin() {}
+
+bool fpa_simplifier_plugin::reduce(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
+ set_reduce_invoked();
+
+ SASSERT(f->get_family_id() == get_family_id());
+
+ return m_rw.mk_app_core(f, num_args, args, result) == BR_DONE;
+}
+
+bool fpa_simplifier_plugin::reduce_eq(expr * lhs, expr * rhs, expr_ref & result) {
+ set_reduce_invoked();
+
+ return m_rw.mk_eq_core(lhs, rhs, result) == BR_DONE;
+}
+
diff --git a/src/ast/simplifier/fpa_simplifier_plugin.h b/src/ast/simplifier/fpa_simplifier_plugin.h
new file mode 100644
index 000000000..13a235091
--- /dev/null
+++ b/src/ast/simplifier/fpa_simplifier_plugin.h
@@ -0,0 +1,39 @@
+/*++
+Copyright (c) 2015 Microsoft Corporation
+
+Module Name:
+
+ fpa_simplifier_plugin.h
+
+Abstract:
+
+ Simplifier for the floating-point theory
+
+Author:
+
+ Christoph (cwinter) 2015-01-14
+
+--*/
+#ifndef _FPA_SIMPLIFIER_PLUGIN_H_
+#define _FPA_SIMPLIFIER_PLUGIN_H_
+
+#include"basic_simplifier_plugin.h"
+#include"fpa_decl_plugin.h"
+#include"fpa_rewriter.h"
+
+class fpa_simplifier_plugin : public simplifier_plugin {
+ fpa_util m_util;
+ fpa_rewriter m_rw;
+
+public:
+ fpa_simplifier_plugin(ast_manager & m, basic_simplifier_plugin & b);
+ ~fpa_simplifier_plugin();
+
+
+ virtual bool reduce(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result);
+
+ virtual bool reduce_eq(expr * lhs, expr * rhs, expr_ref & result);
+
+};
+
+#endif /* _FPA_SIMPLIFIER_PLUGIN_H_ */
diff --git a/src/cmd_context/basic_cmds.cpp b/src/cmd_context/basic_cmds.cpp
index a80c5bc6c..94bd4f5e1 100644
--- a/src/cmd_context/basic_cmds.cpp
+++ b/src/cmd_context/basic_cmds.cpp
@@ -255,7 +255,7 @@ protected:
s == m_print_success || s == m_print_warning || s == m_expand_definitions ||
s == m_interactive_mode || s == m_produce_proofs || s == m_produce_unsat_cores ||
s == m_produce_models || s == m_produce_assignments || s == m_produce_interpolants ||
- s == m_regular_output_channel || s == m_diagnostic_output_channel ||
+ s == m_regular_output_channel || s == m_diagnostic_output_channel ||
s == m_random_seed || s == m_verbosity || s == m_global_decls;
}
diff --git a/src/cmd_context/cmd_context.cpp b/src/cmd_context/cmd_context.cpp
index ee5437bd6..f5937955d 100644
--- a/src/cmd_context/cmd_context.cpp
+++ b/src/cmd_context/cmd_context.cpp
@@ -24,7 +24,7 @@ Notes:
#include"array_decl_plugin.h"
#include"datatype_decl_plugin.h"
#include"seq_decl_plugin.h"
-#include"float_decl_plugin.h"
+#include"fpa_decl_plugin.h"
#include"ast_pp.h"
#include"var_subst.h"
#include"pp.h"
@@ -240,7 +240,7 @@ protected:
arith_util m_autil;
bv_util m_bvutil;
array_util m_arutil;
- float_util m_futil;
+ fpa_util m_futil;
datalog::dl_decl_util m_dlutil;
format_ns::format * pp_fdecl_name(symbol const & s, func_decls const & fs, func_decl * f, unsigned & len) {
@@ -267,7 +267,7 @@ public:
virtual arith_util & get_autil() { return m_autil; }
virtual bv_util & get_bvutil() { return m_bvutil; }
virtual array_util & get_arutil() { return m_arutil; }
- virtual float_util & get_futil() { return m_futil; }
+ virtual fpa_util & get_futil() { return m_futil; }
virtual datalog::dl_decl_util& get_dlutil() { return m_dlutil; }
virtual bool uses(symbol const & s) const {
return
@@ -512,8 +512,8 @@ bool cmd_context::logic_has_arith_core(symbol const & s) const {
s == "UFNIA" ||
s == "LIA" ||
s == "LRA" ||
- s == "QF_FPA" ||
- s == "QF_FPABV" ||
+ s == "QF_FP" ||
+ s == "QF_FPBV" ||
s == "HORN";
}
@@ -532,7 +532,7 @@ bool cmd_context::logic_has_bv_core(symbol const & s) const {
s == "QF_ABV" ||
s == "QF_AUFBV" ||
s == "QF_BVRE" ||
- s == "QF_FPABV" ||
+ s == "QF_FPBV" ||
s == "HORN";
}
@@ -556,8 +556,8 @@ bool cmd_context::logic_has_seq() const {
return !has_logic() || logic_has_seq_core(m_logic);
}
-bool cmd_context::logic_has_floats() const {
- return !has_logic() || m_logic == "QF_FPA" || m_logic == "QF_FPABV";
+bool cmd_context::logic_has_fpa() const {
+ return !has_logic() || m_logic == "QF_FP" || m_logic == "QF_FPBV";
}
bool cmd_context::logic_has_array_core(symbol const & s) const {
@@ -601,7 +601,7 @@ void cmd_context::init_manager_core(bool new_manager) {
register_plugin(symbol("array"), alloc(array_decl_plugin), logic_has_array());
register_plugin(symbol("datatype"), alloc(datatype_decl_plugin), logic_has_datatype());
register_plugin(symbol("seq"), alloc(seq_decl_plugin), logic_has_seq());
- register_plugin(symbol("float"), alloc(float_decl_plugin), logic_has_floats());
+ register_plugin(symbol("fpa"), alloc(fpa_decl_plugin), logic_has_fpa());
}
else {
// the manager was created by an external module
@@ -614,7 +614,7 @@ void cmd_context::init_manager_core(bool new_manager) {
load_plugin(symbol("array"), logic_has_array(), fids);
load_plugin(symbol("datatype"), logic_has_datatype(), fids);
load_plugin(symbol("seq"), logic_has_seq(), fids);
- load_plugin(symbol("float"), logic_has_floats(), fids);
+ load_plugin(symbol("fpa"), logic_has_fpa(), fids);
svector::iterator it = fids.begin();
svector::iterator end = fids.end();
@@ -668,7 +668,7 @@ bool cmd_context::supported_logic(symbol const & s) const {
logic_has_arith_core(s) || logic_has_bv_core(s) ||
logic_has_array_core(s) || logic_has_seq_core(s) ||
logic_has_horn(s) ||
- s == "QF_FPA" || s == "QF_FPABV";
+ s == "QF_FP" || s == "QF_FPBV";
}
bool cmd_context::set_logic(symbol const & s) {
diff --git a/src/cmd_context/cmd_context.h b/src/cmd_context/cmd_context.h
index 1c8dba21a..f9e50e611 100644
--- a/src/cmd_context/cmd_context.h
+++ b/src/cmd_context/cmd_context.h
@@ -241,7 +241,7 @@ protected:
bool logic_has_seq() const;
bool logic_has_array() const;
bool logic_has_datatype() const;
- bool logic_has_floats() const;
+ bool logic_has_fpa() const;
bool supported_logic(symbol const & s) const;
void print_unsupported_msg() { regular_stream() << "unsupported" << std::endl; }
diff --git a/src/duality/duality_profiling.cpp b/src/duality/duality_profiling.cpp
index 5bcda972a..13a379946 100755
--- a/src/duality/duality_profiling.cpp
+++ b/src/duality/duality_profiling.cpp
@@ -124,20 +124,20 @@ namespace Duality {
}
void timer_stop(const char *name){
- if(current->name != name || !current->parent){
+ if (current->name != name || !current->parent) {
#if 0
- std::cerr << "imbalanced timer_start and timer_stop";
- exit(1);
+ std::cerr << "imbalanced timer_start and timer_stop";
+ exit(1);
#endif
- // in case we lost a timer stop due to an exception
- while(current->name != name && current->parent)
- current = current->parent;
- if(current->parent){
- current->time += (current_time() - current->start_time);
- current = current->parent;
+ // in case we lost a timer stop due to an exception
+ while (current->name != name && current->parent)
+ current = current->parent;
+ if (current->parent) {
+ current->time += (current_time() - current->start_time);
+ current = current->parent;
+ }
+ return;
}
- return;
- }
current->time += (current_time() - current->start_time);
current = current->parent;
}
diff --git a/src/duality/duality_rpfp.cpp b/src/duality/duality_rpfp.cpp
index cdc8fb3b2..e2a5d05dc 100755
--- a/src/duality/duality_rpfp.cpp
+++ b/src/duality/duality_rpfp.cpp
@@ -97,12 +97,12 @@ namespace Duality {
memo.insert(t);
if(t.is_app()){
decl_kind k = t.decl().get_decl_kind();
- if(k == And || k == Or || k == Not || k == Implies || k == Iff){
- ops++;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- SummarizeRec(memo,lits,ops,t.arg(i));
- return;
+ if (k == And || k == Or || k == Not || k == Implies || k == Iff) {
+ ops++;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ SummarizeRec(memo, lits, ops, t.arg(i));
+ return;
}
}
lits.push_back(t);
@@ -137,12 +137,12 @@ namespace Duality {
memo.insert(t);
if(t.is_app()){
decl_kind k = t.decl().get_decl_kind();
- if(k == And || k == Or){
- int count = 1;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- count += CountOperatorsRec(memo,t.arg(i));
- return count;
+ if (k == And || k == Or) {
+ int count = 1;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ count += CountOperatorsRec(memo, t.arg(i));
+ return count;
}
return 0;
}
@@ -172,13 +172,12 @@ namespace Duality {
Term b(ctx);
std::vector v;
RedVars(child, b, v);
- for (unsigned i = 0; i < args.size(); i++)
- {
- if (eq(args[i].get_sort(),ctx.bool_sort()))
- args[i] = ctx.make(Iff,args[i], v[i]);
- else
- args[i] = args[i] == v[i];
- }
+ for (unsigned i = 0; i < args.size(); i++) {
+ if (eq(args[i].get_sort(), ctx.bool_sort()))
+ args[i] = ctx.make(Iff, args[i], v[i]);
+ else
+ args[i] = args[i] == v[i];
+ }
return args.size() > 0 ? (b && conjoin(args)) : b;
}
@@ -202,18 +201,18 @@ namespace Duality {
names.push_back(Z3_get_quantifier_bound_name(c,a,i));
}
Z3_ast foo = Z3_mk_quantifier_ex(c,
- Z3_is_quantifier_forall(c,a),
- Z3_get_quantifier_weight(c,a),
- 0,
- 0,
- num_pats,
- &pats[0],
- num_no_pats,
- &no_pats[0],
- bound,
- &sorts[0],
- &names[0],
- new_body);
+ Z3_is_quantifier_forall(c,a),
+ Z3_get_quantifier_weight(c,a),
+ 0,
+ 0,
+ num_pats,
+ &pats[0],
+ num_no_pats,
+ &no_pats[0],
+ bound,
+ &sorts[0],
+ &names[0],
+ new_body);
return expr(ctx,foo);
#endif
return clone_quantifier(t,new_body);
@@ -231,36 +230,32 @@ namespace Duality {
res = it->second;
return res;
}
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(LocalizeRec(e, memo, t.arg(i)));
- hash_map::iterator rit = e->relMap.find(f);
- if(rit != e->relMap.end())
- res = RedDualRela(e,args,(rit->second));
- else {
- if (args.size() == 0 && f.get_decl_kind() == Uninterpreted && !ls->is_constant(f))
- {
- res = HideVariable(t,e->number);
- }
- else
- {
- res = f(args.size(),&args[0]);
- }
- }
- }
- else if (t.is_quantifier())
- {
- std::vector pats;
- t.get_patterns(pats);
- for(unsigned i = 0; i < pats.size(); i++)
- pats[i] = LocalizeRec(e,memo,pats[i]);
- Term body = LocalizeRec(e,memo,t.body());
- res = clone_quantifier(t, body, pats);
- }
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(LocalizeRec(e, memo, t.arg(i)));
+ hash_map::iterator rit = e->relMap.find(f);
+ if (rit != e->relMap.end())
+ res = RedDualRela(e, args, (rit->second));
+ else {
+ if (args.size() == 0 && f.get_decl_kind() == Uninterpreted && !ls->is_constant(f)) {
+ res = HideVariable(t, e->number);
+ }
+ else {
+ res = f(args.size(), &args[0]);
+ }
+ }
+ }
+ else if (t.is_quantifier()) {
+ std::vector pats;
+ t.get_patterns(pats);
+ for (unsigned i = 0; i < pats.size(); i++)
+ pats[i] = LocalizeRec(e, memo, pats[i]);
+ Term body = LocalizeRec(e, memo, t.body());
+ res = clone_quantifier(t, body, pats);
+ }
else res = t;
return res;
}
@@ -353,24 +348,22 @@ namespace Duality {
std::pair::iterator, bool> bar = memo.insert(foo);
Term &res = bar.first->second;
if(!bar.second) return res;
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(SubstRec(memo, t.arg(i)));
- res = f(args.size(),&args[0]);
- }
- else if (t.is_quantifier())
- {
- std::vector pats;
- t.get_patterns(pats);
- for(unsigned i = 0; i < pats.size(); i++)
- pats[i] = SubstRec(memo,pats[i]);
- Term body = SubstRec(memo,t.body());
- res = clone_quantifier(t, body, pats);
- }
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(SubstRec(memo, t.arg(i)));
+ res = f(args.size(), &args[0]);
+ }
+ else if (t.is_quantifier()) {
+ std::vector pats;
+ t.get_patterns(pats);
+ for (unsigned i = 0; i < pats.size(); i++)
+ pats[i] = SubstRec(memo, pats[i]);
+ Term body = SubstRec(memo, t.body());
+ res = clone_quantifier(t, body, pats);
+ }
// res = CloneQuantifier(t,SubstRec(memo, t.body()));
else res = t;
return res;
@@ -382,27 +375,25 @@ namespace Duality {
std::pair::iterator, bool> bar = memo.insert(foo);
Term &res = bar.first->second;
if(!bar.second) return res;
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(SubstRec(memo, map, t.arg(i)));
- hash_map::iterator it = map.find(f);
- if(it != map.end())
- f = it->second;
- res = f(args.size(),&args[0]);
- }
- else if (t.is_quantifier())
- {
- std::vector pats;
- t.get_patterns(pats);
- for(unsigned i = 0; i < pats.size(); i++)
- pats[i] = SubstRec(memo, map, pats[i]);
- Term body = SubstRec(memo, map, t.body());
- res = clone_quantifier(t, body, pats);
- }
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(SubstRec(memo, map, t.arg(i)));
+ hash_map::iterator it = map.find(f);
+ if (it != map.end())
+ f = it->second;
+ res = f(args.size(), &args[0]);
+ }
+ else if (t.is_quantifier()) {
+ std::vector pats;
+ t.get_patterns(pats);
+ for (unsigned i = 0; i < pats.size(); i++)
+ pats[i] = SubstRec(memo, map, pats[i]);
+ Term body = SubstRec(memo, map, t.body());
+ res = clone_quantifier(t, body, pats);
+ }
// res = CloneQuantifier(t,SubstRec(memo, t.body()));
else res = t;
return res;
@@ -415,20 +406,20 @@ namespace Duality {
Term &res = bar.first->second;
if(!bar.second) return res;
if (t.is_app()) {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(ExtractStores(memo, t.arg(i),cnstrs,renaming));
- res = f(args.size(),&args[0]);
- if(f.get_decl_kind() == Store){
- func_decl fresh = ctx.fresh_func_decl("@arr", res.get_sort());
- expr y = fresh();
- expr equ = ctx.make(Equal,y,res);
- cnstrs.push_back(equ);
- renaming[y] = res;
- res = y;
- }
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(ExtractStores(memo, t.arg(i), cnstrs, renaming));
+ res = f(args.size(), &args[0]);
+ if (f.get_decl_kind() == Store) {
+ func_decl fresh = ctx.fresh_func_decl("@arr", res.get_sort());
+ expr y = fresh();
+ expr equ = ctx.make(Equal, y, res);
+ cnstrs.push_back(equ);
+ renaming[y] = res;
+ res = y;
+ }
}
else res = t;
return res;
@@ -436,20 +427,20 @@ namespace Duality {
bool Z3User::IsLiteral(const expr &lit, expr &atom, expr &val){
- if(!(lit.is_quantifier() && IsClosedFormula(lit))){
- if(!lit.is_app())
- return false;
- decl_kind k = lit.decl().get_decl_kind();
- if(k == Not){
- if(IsLiteral(lit.arg(0),atom,val)){
- val = eq(val,ctx.bool_val(true)) ? ctx.bool_val(false) : ctx.bool_val(true);
- return true;
- }
- return false;
+ if (!(lit.is_quantifier() && IsClosedFormula(lit))) {
+ if (!lit.is_app())
+ return false;
+ decl_kind k = lit.decl().get_decl_kind();
+ if (k == Not) {
+ if (IsLiteral(lit.arg(0), atom, val)) {
+ val = eq(val, ctx.bool_val(true)) ? ctx.bool_val(false) : ctx.bool_val(true);
+ return true;
+ }
+ return false;
+ }
+ if (k == And || k == Or || k == Iff || k == Implies)
+ return false;
}
- if(k == And || k == Or || k == Iff || k == Implies)
- return false;
- }
atom = lit;
val = ctx.bool_val(true);
return true;
@@ -467,11 +458,11 @@ namespace Duality {
expr Z3User::ReduceAndOr(const std::vector &args, bool is_and, std::vector &res){
for(unsigned i = 0; i < args.size(); i++)
- if(!eq(args[i],ctx.bool_val(is_and))){
- if(eq(args[i],ctx.bool_val(!is_and)))
- return ctx.bool_val(!is_and);
- res.push_back(args[i]);
- }
+ if (!eq(args[i], ctx.bool_val(is_and))) {
+ if (eq(args[i], ctx.bool_val(!is_and)))
+ return ctx.bool_val(!is_and);
+ res.push_back(args[i]);
+ }
return expr();
}
@@ -495,36 +486,36 @@ namespace Duality {
// first check if there's anything to do...
if(args.size() < 2)
return FinishAndOr(args,is_and);
- for(unsigned i = 0; i < args.size(); i++){
- const expr &a = args[i];
- if(!(a.is_app() && a.decl().get_decl_kind() == (is_and ? Or : And)))
- return FinishAndOr(args,is_and);
+ for (unsigned i = 0; i < args.size(); i++) {
+ const expr &a = args[i];
+ if (!(a.is_app() && a.decl().get_decl_kind() == (is_and ? Or : And)))
+ return FinishAndOr(args, is_and);
}
std::vector common;
- for(unsigned i = 0; i < args.size(); i++){
- unsigned n = args[i].num_args();
- std::vector v(n),w;
- for(unsigned j = 0; j < n; j++)
- v[j] = args[i].arg(j);
- std::less comp;
- std::sort(v.begin(),v.end(),comp);
- if(i == 0)
- common.swap(v);
- else {
- std::set_intersection(common.begin(),common.end(),v.begin(),v.end(),std::inserter(w,w.begin()),comp);
- common.swap(w);
- }
- }
+ for (unsigned i = 0; i < args.size(); i++) {
+ unsigned n = args[i].num_args();
+ std::vector v(n), w;
+ for (unsigned j = 0; j < n; j++)
+ v[j] = args[i].arg(j);
+ std::less comp;
+ std::sort(v.begin(), v.end(), comp);
+ if (i == 0)
+ common.swap(v);
+ else {
+ std::set_intersection(common.begin(), common.end(), v.begin(), v.end(), std::inserter(w, w.begin()), comp);
+ common.swap(w);
+ }
+ }
if(common.empty())
return FinishAndOr(args,is_and);
std::set common_set(common.begin(),common.end());
for(unsigned i = 0; i < args.size(); i++){
unsigned n = args[i].num_args();
std::vector lits;
- for(unsigned j = 0; j < n; j++){
- const expr b = args[i].arg(j);
- if(common_set.find(b) == common_set.end())
- lits.push_back(b);
+ for (unsigned j = 0; j < n; j++) {
+ const expr b = args[i].arg(j);
+ if (common_set.find(b) == common_set.end())
+ lits.push_back(b);
}
args[i] = SimplifyAndOr(lits,!is_and);
}
@@ -549,148 +540,145 @@ namespace Duality {
}
Z3User::Term Z3User::PushQuantifier(const expr &t, const expr &body, bool is_forall){
- if(t.get_quantifier_num_bound() == 1){
- std::vector fmlas,free,not_free;
- CollectJuncts(body,fmlas, is_forall ? Or : And, false);
- for(unsigned i = 0; i < fmlas.size(); i++){
- const expr &fmla = fmlas[i];
- if(fmla.has_free(0))
- free.push_back(fmla);
- else
- not_free.push_back(fmla);
+ if (t.get_quantifier_num_bound() == 1) {
+ std::vector fmlas, free, not_free;
+ CollectJuncts(body, fmlas, is_forall ? Or : And, false);
+ for (unsigned i = 0; i < fmlas.size(); i++) {
+ const expr &fmla = fmlas[i];
+ if (fmla.has_free(0))
+ free.push_back(fmla);
+ else
+ not_free.push_back(fmla);
+ }
+ decl_kind op = is_forall ? Or : And;
+ if (free.empty())
+ return DeleteBound(0, 1, SimplifyAndOr(not_free, op == And));
+ expr q = clone_quantifier(is_forall ? Forall : Exists, t, SimplifyAndOr(free, op == And));
+ if (!not_free.empty())
+ q = ctx.make(op, q, DeleteBound(0, 1, SimplifyAndOr(not_free, op == And)));
+ return q;
}
- decl_kind op = is_forall ? Or : And;
- if(free.empty())
- return DeleteBound(0,1,SimplifyAndOr(not_free,op == And));
- expr q = clone_quantifier(is_forall ? Forall : Exists,t, SimplifyAndOr(free, op == And));
- if(!not_free.empty())
- q = ctx.make(op,q,DeleteBound(0,1,SimplifyAndOr(not_free, op == And)));
- return q;
- }
return clone_quantifier(is_forall ? Forall : Exists,t,body);
}
- Z3User::Term Z3User::CloneQuantAndSimp(const expr &t, const expr &body, bool is_forall){
- if(body.is_app()){
- if(body.decl().get_decl_kind() == (is_forall ? And : Or)){ // quantifier distributes
- int nargs = body.num_args();
- std::vector args(nargs);
- for(int i = 0; i < nargs; i++)
- args[i] = CloneQuantAndSimp(t, body.arg(i), is_forall);
- return SimplifyAndOr(args, body.decl().get_decl_kind() == And);
+ Z3User::Term Z3User::CloneQuantAndSimp(const expr &t, const expr &body, bool is_forall) {
+ if (body.is_app()) {
+ if (body.decl().get_decl_kind() == (is_forall ? And : Or)) { // quantifier distributes
+ int nargs = body.num_args();
+ std::vector args(nargs);
+ for (int i = 0; i < nargs; i++)
+ args[i] = CloneQuantAndSimp(t, body.arg(i), is_forall);
+ return SimplifyAndOr(args, body.decl().get_decl_kind() == And);
+ }
+ else if (body.decl().get_decl_kind() == (is_forall ? Or : And)) { // quantifier distributes
+ return PushQuantifier(t, body, is_forall); // may distribute partially
+ }
+ else if (body.decl().get_decl_kind() == Not) {
+ return ctx.make(Not, CloneQuantAndSimp(t, body.arg(0), !is_forall));
+ }
}
- else if(body.decl().get_decl_kind() == (is_forall ? Or : And)){ // quantifier distributes
- return PushQuantifier(t,body,is_forall); // may distribute partially
- }
- else if(body.decl().get_decl_kind() == Not){
- return ctx.make(Not,CloneQuantAndSimp(t,body.arg(0),!is_forall));
- }
- }
- if(t.get_quantifier_num_bound() == 1 && !body.has_free(0))
- return DeleteBound(0,1,body); // drop the quantifier
- return clone_quantifier(is_forall ? Forall : Exists,t,body);
+ if (t.get_quantifier_num_bound() == 1 && !body.has_free(0))
+ return DeleteBound(0, 1, body); // drop the quantifier
+ return clone_quantifier(is_forall ? Forall : Exists, t, body);
}
Z3User::Term Z3User::CloneQuantAndSimp(const expr &t, const expr &body){
return CloneQuantAndSimp(t,body,t.is_quantifier_forall());
}
- Z3User::Term Z3User::SubstAtom(hash_map &memo, const expr &t, const expr &atom, const expr &val){
- std::pair foo(t,expr(ctx));
- std::pair::iterator, bool> bar = memo.insert(foo);
- Term &res = bar.first->second;
- if(!bar.second) return res;
- if (t.is_app()){
- func_decl f = t.decl();
- decl_kind k = f.get_decl_kind();
-
- // TODO: recur here, but how much? We don't want to be quadractic in formula size
-
- if(k == And || k == Or){
- int nargs = t.num_args();
- std::vector args(nargs);
- for(int i = 0; i < nargs; i++)
- args[i] = SubstAtom(memo,t.arg(i),atom,val);
- res = ReallySimplifyAndOr(args, k==And);
- return res;
+ Z3User::Term Z3User::SubstAtom(hash_map &memo, const expr &t, const expr &atom, const expr &val) {
+ std::pair foo(t, expr(ctx));
+ std::pair::iterator, bool> bar = memo.insert(foo);
+ Term &res = bar.first->second;
+ if (!bar.second) return res;
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ decl_kind k = f.get_decl_kind();
+
+ // TODO: recur here, but how much? We don't want to be quadractic in formula size
+
+ if (k == And || k == Or) {
+ int nargs = t.num_args();
+ std::vector args(nargs);
+ for (int i = 0; i < nargs; i++)
+ args[i] = SubstAtom(memo, t.arg(i), atom, val);
+ res = ReallySimplifyAndOr(args, k == And);
+ return res;
+ }
}
- }
- else if(t.is_quantifier() && atom.is_quantifier()){
- if(eq(t,atom))
- res = val;
- else
- res = clone_quantifier(t,SubstAtom(memo,t.body(),atom,val));
+ else if (t.is_quantifier() && atom.is_quantifier()) {
+ if (eq(t, atom))
+ res = val;
+ else
+ res = clone_quantifier(t, SubstAtom(memo, t.body(), atom, val));
+ return res;
+ }
+ res = SubstAtomTriv(t, atom, val);
return res;
- }
- res = SubstAtomTriv(t,atom,val);
- return res;
}
- void Z3User::RemoveRedundancyOp(bool pol, std::vector &args, hash_map &smemo){
- for(unsigned i = 0; i < args.size(); i++){
- const expr &lit = args[i];
- expr atom, val;
- if(IsLiteral(lit,atom,val)){
- if(atom.is_app() && atom.decl().get_decl_kind() == Equal)
- if(pol ? eq(val,ctx.bool_val(true)) : eq(val,ctx.bool_val(false))){
- expr lhs = atom.arg(0), rhs = atom.arg(1);
- if(lhs.is_numeral())
- std::swap(lhs,rhs);
- if(rhs.is_numeral() && lhs.is_app()){
- for(unsigned j = 0; j < args.size(); j++)
- if(j != i){
- smemo.clear();
- smemo[lhs] = rhs;
- args[j] = SubstRec(smemo,args[j]);
- }
- }
- }
- for(unsigned j = 0; j < args.size(); j++)
- if(j != i){
- smemo.clear();
- args[j] = SubstAtom(smemo,args[j],atom,pol ? val : !val);
- }
+ void Z3User::RemoveRedundancyOp(bool pol, std::vector &args, hash_map &smemo) {
+ for (unsigned i = 0; i < args.size(); i++) {
+ const expr &lit = args[i];
+ expr atom, val;
+ if (IsLiteral(lit, atom, val)) {
+ if (atom.is_app() && atom.decl().get_decl_kind() == Equal)
+ if (pol ? eq(val, ctx.bool_val(true)) : eq(val, ctx.bool_val(false))) {
+ expr lhs = atom.arg(0), rhs = atom.arg(1);
+ if (lhs.is_numeral())
+ std::swap(lhs, rhs);
+ if (rhs.is_numeral() && lhs.is_app()) {
+ for (unsigned j = 0; j < args.size(); j++)
+ if (j != i) {
+ smemo.clear();
+ smemo[lhs] = rhs;
+ args[j] = SubstRec(smemo, args[j]);
+ }
+ }
+ }
+ for (unsigned j = 0; j < args.size(); j++)
+ if (j != i) {
+ smemo.clear();
+ args[j] = SubstAtom(smemo, args[j], atom, pol ? val : !val);
+ }
+ }
}
- }
}
- Z3User::Term Z3User::RemoveRedundancyRec(hash_map &memo, hash_map &smemo, const Term &t)
- {
- std::pair foo(t,expr(ctx));
- std::pair::iterator, bool> bar = memo.insert(foo);
- Term &res = bar.first->second;
- if(!bar.second) return res;
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(RemoveRedundancyRec(memo, smemo, t.arg(i)));
+ Z3User::Term Z3User::RemoveRedundancyRec(hash_map &memo, hash_map &smemo, const Term &t) {
+ std::pair foo(t, expr(ctx));
+ std::pair::iterator, bool> bar = memo.insert(foo);
+ Term &res = bar.first->second;
+ if (!bar.second) return res;
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(RemoveRedundancyRec(memo, smemo, t.arg(i)));
- decl_kind k = f.get_decl_kind();
- if(k == And){
- RemoveRedundancyOp(true,args,smemo);
- res = ReallySimplifyAndOr(args, true);
- }
- else if(k == Or){
- RemoveRedundancyOp(false,args,smemo);
- res = ReallySimplifyAndOr(args, false);
- }
- else {
- if(k == Equal && args[0].get_id() > args[1].get_id())
- std::swap(args[0],args[1]);
- res = f(args.size(),&args[0]);
- }
+ decl_kind k = f.get_decl_kind();
+ if (k == And) {
+ RemoveRedundancyOp(true, args, smemo);
+ res = ReallySimplifyAndOr(args, true);
+ }
+ else if (k == Or) {
+ RemoveRedundancyOp(false, args, smemo);
+ res = ReallySimplifyAndOr(args, false);
+ }
+ else {
+ if (k == Equal && args[0].get_id() > args[1].get_id())
+ std::swap(args[0], args[1]);
+ res = f(args.size(), &args[0]);
+ }
}
- else if (t.is_quantifier())
- {
- Term body = RemoveRedundancyRec(memo,smemo,t.body());
- res = CloneQuantAndSimp(t, body);
+ else if (t.is_quantifier()) {
+ Term body = RemoveRedundancyRec(memo, smemo, t.body());
+ res = CloneQuantAndSimp(t, body);
}
- else res = t;
- return res;
+ else res = t;
+ return res;
}
Z3User::Term Z3User::RemoveRedundancy(const Term &t){
@@ -706,43 +694,40 @@ namespace Duality {
return t;
}
- Z3User::Term Z3User::IneqToEqRec(hash_map &memo, const Term &t)
- {
- std::pair foo(t,expr(ctx));
- std::pair::iterator, bool> bar = memo.insert(foo);
- Term &res = bar.first->second;
- if(!bar.second) return res;
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- for(int i = 0; i < nargs; i++)
- args.push_back(IneqToEqRec(memo, t.arg(i)));
+ Z3User::Term Z3User::IneqToEqRec(hash_map &memo, const Term &t) {
+ std::pair foo(t, expr(ctx));
+ std::pair::iterator, bool> bar = memo.insert(foo);
+ Term &res = bar.first->second;
+ if (!bar.second) return res;
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ for (int i = 0; i < nargs; i++)
+ args.push_back(IneqToEqRec(memo, t.arg(i)));
- decl_kind k = f.get_decl_kind();
- if(k == And){
- for(int i = 0; i < nargs-1; i++){
- if((args[i].is_app() && args[i].decl().get_decl_kind() == Geq &&
- args[i+1].is_app() && args[i+1].decl().get_decl_kind() == Leq)
- ||
- (args[i].is_app() && args[i].decl().get_decl_kind() == Leq &&
- args[i+1].is_app() && args[i+1].decl().get_decl_kind() == Geq))
- if(eq(args[i].arg(0),args[i+1].arg(0)) && eq(args[i].arg(1),args[i+1].arg(1))){
- args[i] = ctx.make(Equal,args[i].arg(0),args[i].arg(1));
- args[i+1] = ctx.bool_val(true);
- }
- }
- }
- res = f(args.size(),&args[0]);
+ decl_kind k = f.get_decl_kind();
+ if (k == And) {
+ for (int i = 0; i < nargs - 1; i++) {
+ if ((args[i].is_app() && args[i].decl().get_decl_kind() == Geq &&
+ args[i + 1].is_app() && args[i + 1].decl().get_decl_kind() == Leq)
+ ||
+ (args[i].is_app() && args[i].decl().get_decl_kind() == Leq &&
+ args[i + 1].is_app() && args[i + 1].decl().get_decl_kind() == Geq))
+ if (eq(args[i].arg(0), args[i + 1].arg(0)) && eq(args[i].arg(1), args[i + 1].arg(1))) {
+ args[i] = ctx.make(Equal, args[i].arg(0), args[i].arg(1));
+ args[i + 1] = ctx.bool_val(true);
+ }
+ }
+ }
+ res = f(args.size(), &args[0]);
}
- else if (t.is_quantifier())
- {
- Term body = IneqToEqRec(memo,t.body());
- res = clone_quantifier(t, body);
+ else if (t.is_quantifier()) {
+ Term body = IneqToEqRec(memo, t.body());
+ res = clone_quantifier(t, body);
}
- else res = t;
- return res;
+ else res = t;
+ return res;
}
Z3User::Term Z3User::IneqToEq(const Term &t){
@@ -750,87 +735,85 @@ namespace Duality {
return IneqToEqRec(memo,t);
}
- Z3User::Term Z3User::SubstRecHide(hash_map &memo, const Term &t, int number)
- {
- std::pair foo(t,expr(ctx));
- std::pair::iterator, bool> bar = memo.insert(foo);
- Term &res = bar.first->second;
- if(!bar.second) return res;
- if (t.is_app())
- {
- func_decl f = t.decl();
- std::vector args;
- int nargs = t.num_args();
- if (nargs == 0 && f.get_decl_kind() == Uninterpreted){
- std::string name = std::string("@q_") + t.decl().name().str() + "_" + string_of_int(number);
- res = ctx.constant(name.c_str(), t.get_sort());
- return res;
- }
- for(int i = 0; i < nargs; i++)
- args.push_back(SubstRec(memo, t.arg(i)));
- res = f(args.size(),&args[0]);
+ Z3User::Term Z3User::SubstRecHide(hash_map &memo, const Term &t, int number) {
+ std::pair foo(t, expr(ctx));
+ std::pair::iterator, bool> bar = memo.insert(foo);
+ Term &res = bar.first->second;
+ if (!bar.second) return res;
+ if (t.is_app()) {
+ func_decl f = t.decl();
+ std::vector args;
+ int nargs = t.num_args();
+ if (nargs == 0 && f.get_decl_kind() == Uninterpreted) {
+ std::string name = std::string("@q_") + t.decl().name().str() + "_" + string_of_int(number);
+ res = ctx.constant(name.c_str(), t.get_sort());
+ return res;
+ }
+ for (int i = 0; i < nargs; i++)
+ args.push_back(SubstRec(memo, t.arg(i)));
+ res = f(args.size(), &args[0]);
}
- else if (t.is_quantifier())
- res = CloneQuantifier(t,SubstRec(memo, t.body()));
- else res = t;
- return res;
+ else if (t.is_quantifier())
+ res = CloneQuantifier(t, SubstRec(memo, t.body()));
+ else res = t;
+ return res;
}
RPFP::Term RPFP::SubstParams(const std::vector &from,
- const std::vector &to, const Term &t){
- hash_map memo;
- bool some_diff = false;
- for(unsigned i = 0; i < from.size(); i++)
- if(i < to.size() && !eq(from[i],to[i])){
- memo[from[i]] = to[i];
- some_diff = true;
- }
- return some_diff ? SubstRec(memo,t) : t;
+ const std::vector &to, const Term &t) {
+ hash_map memo;
+ bool some_diff = false;
+ for (unsigned i = 0; i < from.size(); i++)
+ if (i < to.size() && !eq(from[i], to[i])) {
+ memo[from[i]] = to[i];
+ some_diff = true;
+ }
+ return some_diff ? SubstRec(memo, t) : t;
}
RPFP::Term RPFP::SubstParamsNoCapture(const std::vector &from,
- const std::vector &to, const Term &t){
- hash_map memo;
- bool some_diff = false;
- for(unsigned i = 0; i < from.size(); i++)
- if(i < to.size() && !eq(from[i],to[i])){
- memo[from[i]] = to[i];
- // if the new param is not being mapped to anything else, we need to rename it to prevent capture
- // note, if the new param *is* mapped later in the list, it will override this substitution
- const expr &w = to[i];
- if(memo.find(w) == memo.end()){
- std::string old_name = w.decl().name().str();
- func_decl fresh = ctx.fresh_func_decl(old_name.c_str(), w.get_sort());
- expr y = fresh();
- memo[w] = y;
- }
- some_diff = true;
- }
- return some_diff ? SubstRec(memo,t) : t;
+ const std::vector &to, const Term &t) {
+ hash_map memo;
+ bool some_diff = false;
+ for (unsigned i = 0; i < from.size(); i++)
+ if (i < to.size() && !eq(from[i], to[i])) {
+ memo[from[i]] = to[i];
+ // if the new param is not being mapped to anything else, we need to rename it to prevent capture
+ // note, if the new param *is* mapped later in the list, it will override this substitution
+ const expr &w = to[i];
+ if (memo.find(w) == memo.end()) {
+ std::string old_name = w.decl().name().str();
+ func_decl fresh = ctx.fresh_func_decl(old_name.c_str(), w.get_sort());
+ expr y = fresh();
+ memo[w] = y;
+ }
+ some_diff = true;
+ }
+ return some_diff ? SubstRec(memo, t) : t;
}
- RPFP::Transformer RPFP::Fuse(const std::vector &trs){
- assert(!trs.empty());
- const std::vector ¶ms = trs[0]->IndParams;
- std::vector fmlas(trs.size());
- fmlas[0] = trs[0]->Formula;
- for(unsigned i = 1; i < trs.size(); i++)
- fmlas[i] = SubstParamsNoCapture(trs[i]->IndParams,params,trs[i]->Formula);
- std::vector rel_params = trs[0]->RelParams;
- for(unsigned i = 1; i < trs.size(); i++){
- const std::vector ¶ms2 = trs[i]->RelParams;
- hash_map map;
- for(unsigned j = 0; j < params2.size(); j++){
- func_decl rel = RenumberPred(params2[j],rel_params.size());
- rel_params.push_back(rel);
- map[params2[j]] = rel;
+ RPFP::Transformer RPFP::Fuse(const std::vector &trs) {
+ assert(!trs.empty());
+ const std::vector ¶ms = trs[0]->IndParams;
+ std::vector fmlas(trs.size());
+ fmlas[0] = trs[0]->Formula;
+ for (unsigned i = 1; i < trs.size(); i++)
+ fmlas[i] = SubstParamsNoCapture(trs[i]->IndParams, params, trs[i]->Formula);
+ std::vector rel_params = trs[0]->RelParams;
+ for (unsigned i = 1; i < trs.size(); i++) {
+ const std::vector ¶ms2 = trs[i]->RelParams;
+ hash_map map;
+ for (unsigned j = 0; j < params2.size(); j++) {
+ func_decl rel = RenumberPred(params2[j], rel_params.size());
+ rel_params.push_back(rel);
+ map[params2[j]] = rel;
+ }
+ hash_map memo;
+ fmlas[i] = SubstRec(memo, map, fmlas[i]);
}
- hash_map memo;
- fmlas[i] = SubstRec(memo,map,fmlas[i]);
- }
- return Transformer(rel_params,params,ctx.make(Or,fmlas),trs[0]->owner);
+ return Transformer(rel_params, params, ctx.make(Or, fmlas), trs[0]->owner);
}
@@ -855,19 +838,17 @@ namespace Duality {
root->Annotation.Formula = annot;
}
- void RPFP::DecodeTree(Node *root, TermTree *interp, int persist)
- {
- std::vector &ic = interp->getChildren();
- if (ic.size() > 0)
- {
- std::vector &nc = root->Outgoing->Children;
- for (unsigned i = 0; i < nc.size(); i++)
- DecodeTree(nc[i], ic[i], persist);
+ void RPFP::DecodeTree(Node *root, TermTree *interp, int persist) {
+ std::vector &ic = interp->getChildren();
+ if (ic.size() > 0) {
+ std::vector &nc = root->Outgoing->Children;
+ for (unsigned i = 0; i < nc.size(); i++)
+ DecodeTree(nc[i], ic[i], persist);
}
- SetAnnotation(root,interp->getTerm());
+ SetAnnotation(root, interp->getTerm());
#if 0
- if(persist != 0)
- Z3_persist_ast(ctx,root->Annotation.Formula,persist);
+ if(persist != 0)
+ Z3_persist_ast(ctx,root->Annotation.Formula,persist);
#endif
}
@@ -926,31 +907,30 @@ namespace Duality {
#endif
- expr RPFP::GetEdgeFormula(Edge *e, int persist, bool with_children, bool underapprox)
- {
- if (e->dual.null()) {
- timer_start("ReducedDualEdge");
- e->dual = ReducedDualEdge(e);
- timer_stop("ReducedDualEdge");
- timer_start("getting children");
- if(underapprox){
- std::vector cus(e->Children.size());
- for(unsigned i = 0; i < e->Children.size(); i++)
- cus[i] = !UnderapproxFlag(e->Children[i]) || GetUnderapprox(e->Children[i]);
- expr cnst = conjoin(cus);
- e->dual = e->dual && cnst;
+ expr RPFP::GetEdgeFormula(Edge *e, int persist, bool with_children, bool underapprox) {
+ if (e->dual.null()) {
+ timer_start("ReducedDualEdge");
+ e->dual = ReducedDualEdge(e);
+ timer_stop("ReducedDualEdge");
+ timer_start("getting children");
+ if (underapprox) {
+ std::vector cus(e->Children.size());
+ for (unsigned i = 0; i < e->Children.size(); i++)
+ cus[i] = !UnderapproxFlag(e->Children[i]) || GetUnderapprox(e->Children[i]);
+ expr cnst = conjoin(cus);
+ e->dual = e->dual && cnst;
+ }
+ timer_stop("getting children");
+ timer_start("Persisting");
+ std::list::reverse_iterator it = stack.rbegin();
+ for (int i = 0; i < persist && it != stack.rend(); i++)
+ it++;
+ if (it != stack.rend())
+ it->edges.push_back(e);
+ timer_stop("Persisting");
+ //Console.WriteLine("{0}", cnst);
}
- timer_stop("getting children");
- timer_start("Persisting");
- std::list::reverse_iterator it = stack.rbegin();
- for(int i = 0; i < persist && it != stack.rend(); i++)
- it++;
- if(it != stack.rend())
- it->edges.push_back(e);
- timer_stop("Persisting");
- //Console.WriteLine("{0}", cnst);
- }
- return e->dual;
+ return e->dual;
}
/** For incremental solving, asserts the constraint associated
@@ -970,47 +950,46 @@ namespace Duality {
*
*/
- void RPFP::AssertEdge(Edge *e, int persist, bool with_children, bool underapprox)
- {
- if(eq(e->F.Formula,ctx.bool_val(true)) && (!with_children || e->Children.empty()))
- return;
- expr fmla = GetEdgeFormula(e, persist, with_children, underapprox);
- timer_start("solver add");
- slvr_add(e->dual);
- timer_stop("solver add");
- if(with_children)
- for(unsigned i = 0; i < e->Children.size(); i++)
- ConstrainParent(e,e->Children[i]);
+ void RPFP::AssertEdge(Edge *e, int persist, bool with_children, bool underapprox) {
+ if (eq(e->F.Formula, ctx.bool_val(true)) && (!with_children || e->Children.empty()))
+ return;
+ expr fmla = GetEdgeFormula(e, persist, with_children, underapprox);
+ timer_start("solver add");
+ slvr_add(e->dual);
+ timer_stop("solver add");
+ if (with_children)
+ for (unsigned i = 0; i < e->Children.size(); i++)
+ ConstrainParent(e, e->Children[i]);
}
#ifdef LIMIT_STACK_WEIGHT
void RPFP_caching::AssertEdge(Edge *e, int persist, bool with_children, bool underapprox)
{
- unsigned old_new_alits = new_alits.size();
- if(eq(e->F.Formula,ctx.bool_val(true)) && (!with_children || e->Children.empty()))
- return;
- expr fmla = GetEdgeFormula(e, persist, with_children, underapprox);
- timer_start("solver add");
- slvr_add(e->dual);
- timer_stop("solver add");
- if(old_new_alits < new_alits.size())
- weight_added.val++;
- if(with_children)
- for(unsigned i = 0; i < e->Children.size(); i++)
- ConstrainParent(e,e->Children[i]);
+ unsigned old_new_alits = new_alits.size();
+ if(eq(e->F.Formula,ctx.bool_val(true)) && (!with_children || e->Children.empty()))
+ return;
+ expr fmla = GetEdgeFormula(e, persist, with_children, underapprox);
+ timer_start("solver add");
+ slvr_add(e->dual);
+ timer_stop("solver add");
+ if(old_new_alits < new_alits.size())
+ weight_added.val++;
+ if(with_children)
+ for(unsigned i = 0; i < e->Children.size(); i++)
+ ConstrainParent(e,e->Children[i]);
}
#endif
// caching verion of above
- void RPFP_caching::AssertEdgeCache(Edge *e, std::vector &lits, bool with_children){
- if(eq(e->F.Formula,ctx.bool_val(true)) && (!with_children || e->Children.empty()))
- return;
- expr fmla = GetEdgeFormula(e, 0, with_children, false);
- GetAssumptionLits(fmla,lits);
- if(with_children)
- for(unsigned i = 0; i < e->Children.size(); i++)
- ConstrainParentCache(e,e->Children[i],lits);
+ void RPFP_caching::AssertEdgeCache(Edge *e, std::vector