The main interaction with Z3 happens via the Context. More...
Inheritance diagram for Context:Public Member Functions | |
| Context () | |
| Constructor. | |
| Context (Dictionary< string, string > settings) | |
| Constructor. | |
| IntSymbol | MkSymbol (int i) |
| Creates a new symbol using an integer. | |
| StringSymbol | MkSymbol (string name) |
| Create a symbol using a string. | |
| BoolSort | MkBoolSort () |
| Create a new Boolean sort. | |
| UninterpretedSort | MkUninterpretedSort (Symbol s) |
| Create a new uninterpreted sort. | |
| UninterpretedSort | MkUninterpretedSort (string str) |
| Create a new uninterpreted sort. | |
| IntSort | MkIntSort () |
| Create a new integer sort. | |
| RealSort | MkRealSort () |
| Create a real sort. | |
| BitVecSort | MkBitVecSort (uint size) |
| Create a new bit-vector sort. | |
| ArraySort | MkArraySort (Sort domain, Sort range) |
| Create a new array sort. | |
| TupleSort | MkTupleSort (Symbol name, Symbol[] fieldNames, Sort[] fieldSorts) |
| Create a new tuple sort. | |
| EnumSort | MkEnumSort (Symbol name, Symbol[] enumNames) |
| Create a new enumeration sort. | |
| EnumSort | MkEnumSort (string name, string[] enumNames) |
| Create a new enumeration sort. | |
| ListSort | MkListSort (Symbol name, Sort elemSort) |
| Create a new list sort. | |
| ListSort | MkListSort (string name, Sort elemSort) |
| Create a new list sort. | |
| FiniteDomainSort | MkFiniteDomainSort (Symbol name, ulong size) |
| Create a new finite domain sort. | |
| FiniteDomainSort | MkFiniteDomainSort (string name, ulong size) |
| Create a new finite domain sort. | |
| Constructor | MkConstructor (Symbol name, Symbol recognizer, Symbol[] fieldNames=null, Sort[] sorts=null, uint[] sortRefs=null) |
| Create a datatype constructor. | |
| Constructor | MkConstructor (string name, string recognizer, string[] fieldNames=null, Sort[] sorts=null, uint[] sortRefs=null) |
| Create a datatype constructor. | |
| DatatypeSort | MkDatatypeSort (Symbol name, Constructor[] constructors) |
| Create a new datatype sort. | |
| DatatypeSort | MkDatatypeSort (string name, Constructor[] constructors) |
| Create a new datatype sort. | |
| DatatypeSort[] | MkDatatypeSorts (Symbol[] names, Constructor[][] c) |
| Create mutually recursive datatypes. | |
| DatatypeSort[] | MkDatatypeSorts (string[] names, Constructor[][] c) |
| Create mutually recursive data-types. | |
| FuncDecl | MkFuncDecl (Symbol name, Sort[] domain, Sort range) |
| Creates a new function declaration. | |
| FuncDecl | MkFuncDecl (Symbol name, Sort domain, Sort range) |
| Creates a new function declaration. | |
| FuncDecl | MkFuncDecl (string name, Sort[] domain, Sort range) |
| Creates a new function declaration. | |
| FuncDecl | MkFuncDecl (string name, Sort domain, Sort range) |
| Creates a new function declaration. | |
| FuncDecl | MkFreshFuncDecl (string prefix, Sort[] domain, Sort range) |
| Creates a fresh function declaration with a name prefixed with prefix . | |
| FuncDecl | MkConstDecl (Symbol name, Sort range) |
| Creates a new constant function declaration. | |
| FuncDecl | MkConstDecl (string name, Sort range) |
| Creates a new constant function declaration. | |
| FuncDecl | MkFreshConstDecl (string prefix, Sort range) |
| Creates a fresh constant function declaration with a name prefixed with prefix . | |
| Expr | MkBound (uint index, Sort ty) |
| Creates a new bound variable. | |
| Pattern | MkPattern (params Expr[] terms) |
| Create a quantifier pattern. | |
| Expr | MkConst (Symbol name, Sort range) |
| Creates a new Constant of sort range and named name . | |
| Expr | MkConst (string name, Sort range) |
| Creates a new Constant of sort range and named name . | |
| Expr | MkFreshConst (string prefix, Sort range) |
| Creates a fresh Constant of sort range and a name prefixed with prefix . | |
| Expr | MkConst (FuncDecl f) |
| Creates a fresh constant from the FuncDecl f . | |
| BoolExpr | MkBoolConst (Symbol name) |
| Create a Boolean constant. | |
| BoolExpr | MkBoolConst (string name) |
| Create a Boolean constant. | |
| IntExpr | MkIntConst (Symbol name) |
| Creates an integer constant. | |
| IntExpr | MkIntConst (string name) |
| Creates an integer constant. | |
| RealExpr | MkRealConst (Symbol name) |
| Creates a real constant. | |
| RealExpr | MkRealConst (string name) |
| Creates a real constant. | |
| BitVecExpr | MkBVConst (Symbol name, uint size) |
| Creates a bit-vector constant. | |
| BitVecExpr | MkBVConst (string name, uint size) |
| Creates a bit-vector constant. | |
| Expr | MkApp (FuncDecl f, params Expr[] args) |
| Create a new function application. | |
| BoolExpr | MkTrue () |
| The true Term. | |
| BoolExpr | MkFalse () |
| The false Term. | |
| BoolExpr | MkBool (bool value) |
| Creates a Boolean value. | |
| BoolExpr | MkEq (Expr x, Expr y) |
| Creates the equality x = y . | |
| BoolExpr | MkDistinct (params Expr[] args) |
Creates a distinct term. | |
| BoolExpr | MkNot (BoolExpr a) |
Mk an expression representing not(a). | |
| Expr | MkITE (BoolExpr t1, Expr t2, Expr t3) |
Create an expression representing an if-then-else: ite(t1, t2, t3). | |
| BoolExpr | MkIff (BoolExpr t1, BoolExpr t2) |
Create an expression representing t1 iff t2. | |
| BoolExpr | MkImplies (BoolExpr t1, BoolExpr t2) |
Create an expression representing t1 -> t2. | |
| BoolExpr | MkXor (BoolExpr t1, BoolExpr t2) |
Create an expression representing t1 xor t2. | |
| BoolExpr | MkAnd (params BoolExpr[] t) |
Create an expression representing t[0] and t[1] and .... | |
| BoolExpr | MkOr (params BoolExpr[] t) |
Create an expression representing t[0] or t[1] or .... | |
| ArithExpr | MkAdd (params ArithExpr[] t) |
Create an expression representing t[0] + t[1] + .... | |
| ArithExpr | MkMul (params ArithExpr[] t) |
Create an expression representing t[0] * t[1] * .... | |
| ArithExpr | MkSub (params ArithExpr[] t) |
Create an expression representing t[0] - t[1] - .... | |
| ArithExpr | MkUnaryMinus (ArithExpr t) |
Create an expression representing -t. | |
| ArithExpr | MkDiv (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 / t2. | |
| IntExpr | MkMod (IntExpr t1, IntExpr t2) |
Create an expression representing t1 mod t2. | |
| IntExpr | MkRem (IntExpr t1, IntExpr t2) |
Create an expression representing t1 rem t2. | |
| ArithExpr | MkPower (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 ^ t2. | |
| BoolExpr | MkLt (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 < t2 | |
| BoolExpr | MkLe (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 <= t2 | |
| BoolExpr | MkGt (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 > t2 | |
| BoolExpr | MkGe (ArithExpr t1, ArithExpr t2) |
Create an expression representing t1 >= t2 | |
| RealExpr | MkInt2Real (IntExpr t) |
| Coerce an integer to a real. | |
| IntExpr | MkReal2Int (RealExpr t) |
| Coerce a real to an integer. | |
| BoolExpr | MkIsInteger (RealExpr t) |
| Creates an expression that checks whether a real number is an integer. | |
| BitVecExpr | MkBVNot (BitVecExpr t) |
| Bitwise negation. | |
| BitVecExpr | MkBVRedAND (BitVecExpr t) |
| Take conjunction of bits in a vector, return vector of length 1. | |
| BitVecExpr | MkBVRedOR (BitVecExpr t) |
| Take disjunction of bits in a vector, return vector of length 1. | |
| BitVecExpr | MkBVAND (BitVecExpr t1, BitVecExpr t2) |
| Bitwise conjunction. | |
| BitVecExpr | MkBVOR (BitVecExpr t1, BitVecExpr t2) |
| Bitwise disjunction. | |
| BitVecExpr | MkBVXOR (BitVecExpr t1, BitVecExpr t2) |
| Bitwise XOR. | |
| BitVecExpr | MkBVNAND (BitVecExpr t1, BitVecExpr t2) |
| Bitwise NAND. | |
| BitVecExpr | MkBVNOR (BitVecExpr t1, BitVecExpr t2) |
| Bitwise NOR. | |
| BitVecExpr | MkBVXNOR (BitVecExpr t1, BitVecExpr t2) |
| Bitwise XNOR. | |
| BitVecExpr | MkBVNeg (BitVecExpr t) |
| Standard two's complement unary minus. | |
| BitVecExpr | MkBVAdd (BitVecExpr t1, BitVecExpr t2) |
| Two's complement addition. | |
| BitVecExpr | MkBVSub (BitVecExpr t1, BitVecExpr t2) |
| Two's complement subtraction. | |
| BitVecExpr | MkBVMul (BitVecExpr t1, BitVecExpr t2) |
| Two's complement multiplication. | |
| BitVecExpr | MkBVUDiv (BitVecExpr t1, BitVecExpr t2) |
| Unsigned division. | |
| BitVecExpr | MkBVSDiv (BitVecExpr t1, BitVecExpr t2) |
| Signed division. | |
| BitVecExpr | MkBVURem (BitVecExpr t1, BitVecExpr t2) |
| Unsigned remainder. | |
| BitVecExpr | MkBVSRem (BitVecExpr t1, BitVecExpr t2) |
| Signed remainder. | |
| BitVecExpr | MkBVSMod (BitVecExpr t1, BitVecExpr t2) |
| Two's complement signed remainder (sign follows divisor). | |
| BoolExpr | MkBVULT (BitVecExpr t1, BitVecExpr t2) |
| Unsigned less-than | |
| BoolExpr | MkBVSLT (BitVecExpr t1, BitVecExpr t2) |
| Two's complement signed less-than | |
| BoolExpr | MkBVULE (BitVecExpr t1, BitVecExpr t2) |
| Unsigned less-than or equal to. | |
| BoolExpr | MkBVSLE (BitVecExpr t1, BitVecExpr t2) |
| Two's complement signed less-than or equal to. | |
| BoolExpr | MkBVUGE (BitVecExpr t1, BitVecExpr t2) |
| Unsigned greater than or equal to. | |
| BoolExpr | MkBVSGE (BitVecExpr t1, BitVecExpr t2) |
| Two's complement signed greater than or equal to. | |
| BoolExpr | MkBVUGT (BitVecExpr t1, BitVecExpr t2) |
| Unsigned greater-than. | |
| BoolExpr | MkBVSGT (BitVecExpr t1, BitVecExpr t2) |
| Two's complement signed greater-than. | |
| BitVecExpr | MkConcat (BitVecExpr t1, BitVecExpr t2) |
| Bit-vector concatenation. | |
| BitVecExpr | MkExtract (uint high, uint low, BitVecExpr t) |
| Bit-vector extraction. | |
| BitVecExpr | MkSignExt (uint i, BitVecExpr t) |
| Bit-vector sign extension. | |
| BitVecExpr | MkZeroExt (uint i, BitVecExpr t) |
| Bit-vector zero extension. | |
| BitVecExpr | MkRepeat (uint i, BitVecExpr t) |
| Bit-vector repetition. | |
| BitVecExpr | MkBVSHL (BitVecExpr t1, BitVecExpr t2) |
| Shift left. | |
| BitVecExpr | MkBVLSHR (BitVecExpr t1, BitVecExpr t2) |
| Logical shift right | |
| BitVecExpr | MkBVASHR (BitVecExpr t1, BitVecExpr t2) |
| Arithmetic shift right | |
| BitVecExpr | MkBVRotateLeft (uint i, BitVecExpr t) |
| Rotate Left. | |
| BitVecExpr | MkBVRotateRight (uint i, BitVecExpr t) |
| Rotate Right. | |
| BitVecExpr | MkBVRotateLeft (BitVecExpr t1, BitVecExpr t2) |
| Rotate Left. | |
| BitVecExpr | MkBVRotateRight (BitVecExpr t1, BitVecExpr t2) |
| Rotate Right. | |
| BitVecExpr | MkInt2BV (uint n, IntExpr t) |
| Create an n bit bit-vector from the integer argument t . | |
| IntExpr | MkBV2Int (BitVecExpr t, bool signed) |
| Create an integer from the bit-vector argument t . | |
| BoolExpr | MkBVAddNoOverflow (BitVecExpr t1, BitVecExpr t2, bool isSigned) |
| Create a predicate that checks that the bit-wise addition does not overflow. | |
| BoolExpr | MkBVAddNoUnderflow (BitVecExpr t1, BitVecExpr t2) |
| Create a predicate that checks that the bit-wise addition does not underflow. | |
| BoolExpr | MkBVSubNoOverflow (BitVecExpr t1, BitVecExpr t2) |
| Create a predicate that checks that the bit-wise subtraction does not overflow. | |
| BoolExpr | MkBVSubNoUnderflow (BitVecExpr t1, BitVecExpr t2, bool isSigned) |
| Create a predicate that checks that the bit-wise subtraction does not underflow. | |
| BoolExpr | MkBVSDivNoOverflow (BitVecExpr t1, BitVecExpr t2) |
| Create a predicate that checks that the bit-wise signed division does not overflow. | |
| BoolExpr | MkBVNegNoOverflow (BitVecExpr t) |
| Create a predicate that checks that the bit-wise negation does not overflow. | |
| BoolExpr | MkBVMulNoOverflow (BitVecExpr t1, BitVecExpr t2, bool isSigned) |
| Create a predicate that checks that the bit-wise multiplication does not overflow. | |
| BoolExpr | MkBVMulNoUnderflow (BitVecExpr t1, BitVecExpr t2) |
| Create a predicate that checks that the bit-wise multiplication does not underflow. | |
| ArrayExpr | MkArrayConst (Symbol name, Sort domain, Sort range) |
| Create an array constant. | |
| ArrayExpr | MkArrayConst (string name, Sort domain, Sort range) |
| Create an array constant. | |
| Expr | MkSelect (ArrayExpr a, Expr i) |
| Array read. | |
| ArrayExpr | MkStore (ArrayExpr a, Expr i, Expr v) |
| Array update. | |
| ArrayExpr | MkConstArray (Sort domain, Expr v) |
| Create a constant array. | |
| ArrayExpr | MkMap (FuncDecl f, params ArrayExpr[] args) |
| Maps f on the argument arrays. | |
| Expr | MkTermArray (ArrayExpr array) |
| Access the array default value. | |
| SetSort | MkSetSort (Sort ty) |
| Create a set type. | |
| Expr | MkEmptySet (Sort domain) |
| Create an empty set. | |
| Expr | MkFullSet (Sort domain) |
| Create the full set. | |
| Expr | MkSetAdd (Expr set, Expr element) |
| Add an element to the set. | |
| Expr | MkSetDel (Expr set, Expr element) |
| Remove an element from a set. | |
| Expr | MkSetUnion (params Expr[] args) |
| Take the union of a list of sets. | |
| Expr | MkSetIntersection (params Expr[] args) |
| Take the intersection of a list of sets. | |
| Expr | MkSetDifference (Expr arg1, Expr arg2) |
| Take the difference between two sets. | |
| Expr | MkSetComplement (Expr arg) |
| Take the complement of a set. | |
| Expr | MkSetMembership (Expr elem, Expr set) |
| Check for set membership. | |
| Expr | MkSetSubset (Expr arg1, Expr arg2) |
| Check for subsetness of sets. | |
| Expr | MkNumeral (string v, Sort ty) |
| Create a Term of a given sort. | |
| Expr | MkNumeral (int v, Sort ty) |
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. | |
| Expr | MkNumeral (uint v, Sort ty) |
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. | |
| Expr | MkNumeral (long v, Sort ty) |
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. | |
| Expr | MkNumeral (ulong v, Sort ty) |
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. | |
| RatNum | MkReal (int num, int den) |
| Create a real from a fraction. | |
| RatNum | MkReal (string v) |
| Create a real numeral. | |
| RatNum | MkReal (int v) |
| Create a real numeral. | |
| RatNum | MkReal (uint v) |
| Create a real numeral. | |
| RatNum | MkReal (long v) |
| Create a real numeral. | |
| RatNum | MkReal (ulong v) |
| Create a real numeral. | |
| IntNum | MkInt (string v) |
| Create an integer numeral. | |
| IntNum | MkInt (int v) |
| Create an integer numeral. | |
| IntNum | MkInt (uint v) |
| Create an integer numeral. | |
| IntNum | MkInt (long v) |
| Create an integer numeral. | |
| IntNum | MkInt (ulong v) |
| Create an integer numeral. | |
| BitVecNum | MkBV (string v, uint size) |
| Create a bit-vector numeral. | |
| BitVecNum | MkBV (int v, uint size) |
| Create a bit-vector numeral. | |
| BitVecNum | MkBV (uint v, uint size) |
| Create a bit-vector numeral. | |
| BitVecNum | MkBV (long v, uint size) |
| Create a bit-vector numeral. | |
| BitVecNum | MkBV (ulong v, uint size) |
| Create a bit-vector numeral. | |
| Quantifier | MkForall (Sort[] sorts, Symbol[] names, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create a universal Quantifier. | |
| Quantifier | MkForall (Expr[] boundConstants, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create a universal Quantifier. | |
| Quantifier | MkExists (Sort[] sorts, Symbol[] names, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create an existential Quantifier. | |
| Quantifier | MkExists (Expr[] boundConstants, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create an existential Quantifier. | |
| Quantifier | MkQuantifier (bool universal, Sort[] sorts, Symbol[] names, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create a Quantifier. | |
| Quantifier | MkQuantifier (bool universal, Expr[] boundConstants, Expr body, uint weight=1, Pattern[] patterns=null, Expr[] noPatterns=null, Symbol quantifierID=null, Symbol skolemID=null) |
| Create a Quantifier. | |
| string | BenchmarkToSMTString (string name, string logic, string status, string attributes, BoolExpr[] assumptions, BoolExpr formula) |
| Convert a benchmark into an SMT-LIB formatted string. | |
| void | ParseSMTLIBString (string str, Symbol[] sortNames=null, Sort[] sorts=null, Symbol[] declNames=null, FuncDecl[] decls=null) |
| Parse the given string using the SMT-LIB parser. | |
| void | ParseSMTLIBFile (string fileName, Symbol[] sortNames=null, Sort[] sorts=null, Symbol[] declNames=null, FuncDecl[] decls=null) |
| Parse the given file using the SMT-LIB parser. | |
| BoolExpr | ParseSMTLIB2String (string str, Symbol[] sortNames=null, Sort[] sorts=null, Symbol[] declNames=null, FuncDecl[] decls=null) |
| Parse the given string using the SMT-LIB2 parser. | |
| BoolExpr | ParseSMTLIB2File (string fileName, Symbol[] sortNames=null, Sort[] sorts=null, Symbol[] declNames=null, FuncDecl[] decls=null) |
| Parse the given file using the SMT-LIB2 parser. | |
| Goal | MkGoal (bool models=true, bool unsatCores=false, bool proofs=false) |
| Creates a new Goal. | |
| Params | MkParams () |
| Creates a new ParameterSet. | |
| string | TacticDescription (string name) |
| Returns a string containing a description of the tactic with the given name. | |
| Tactic | MkTactic (string name) |
| Creates a new Tactic. | |
| Tactic | AndThen (Tactic t1, Tactic t2, params Tactic[] ts) |
| Create a tactic that applies t1 to a Goal and then t2 to every subgoal produced by t1 . | |
| Tactic | Then (Tactic t1, Tactic t2, params Tactic[] ts) |
| Create a tactic that applies t1 to a Goal and then t2 to every subgoal produced by t1 . | |
| Tactic | OrElse (Tactic t1, Tactic t2) |
| Create a tactic that first applies t1 to a Goal and if it fails then returns the result of t2 applied to the Goal. | |
| Tactic | TryFor (Tactic t, uint ms) |
| Create a tactic that applies t to a goal for ms milliseconds. | |
| Tactic | When (Probe p, Tactic t) |
| Create a tactic that applies t to a given goal if the probe p evaluates to true. | |
| Tactic | Cond (Probe p, Tactic t1, Tactic t2) |
| Create a tactic that applies t1 to a given goal if the probe p evaluates to true and t2 otherwise. | |
| Tactic | Repeat (Tactic t, uint max=uint.MaxValue) |
| Create a tactic that keeps applying t until the goal is not modified anymore or the maximum number of iterations max is reached. | |
| Tactic | Skip () |
| Create a tactic that just returns the given goal. | |
| Tactic | Fail () |
| Create a tactic always fails. | |
| Tactic | FailIf (Probe p) |
| Create a tactic that fails if the probe p evaluates to false. | |
| Tactic | FailIfNotDecided () |
| Create a tactic that fails if the goal is not triviall satisfiable (i.e., empty) or trivially unsatisfiable (i.e., contains `false'). | |
| Tactic | UsingParams (Tactic t, Params p) |
| Create a tactic that applies t using the given set of parameters p . | |
| Tactic | With (Tactic t, Params p) |
| Create a tactic that applies t using the given set of parameters p . | |
| Tactic | ParOr (params Tactic[] t) |
| Create a tactic that applies the given tactics in parallel. | |
| Tactic | ParAndThen (Tactic t1, Tactic t2) |
| Create a tactic that applies t1 to a given goal and then t2 to every subgoal produced by t1 . The subgoals are processed in parallel. | |
| void | Interrupt () |
| Interrupt the execution of a Z3 procedure. | |
| string | ProbeDescription (string name) |
| Returns a string containing a description of the probe with the given name. | |
| Probe | MkProbe (string name) |
| Creates a new Probe. | |
| Probe | Const (double val) |
| Create a probe that always evaluates to val . | |
| Probe | Lt (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value returned by p1 is less than the value returned by p2 | |
| Probe | Gt (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value returned by p1 is greater than the value returned by p2 | |
| Probe | Le (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value returned by p1 is less than or equal the value returned by p2 | |
| Probe | Ge (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value returned by p1 is greater than or equal the value returned by p2 | |
| Probe | Eq (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value returned by p1 is equal to the value returned by p2 | |
| Probe | And (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value p1 and p2 evaluate to "true". | |
| Probe | Or (Probe p1, Probe p2) |
| Create a probe that evaluates to "true" when the value p1 or p2 evaluate to "true". | |
| Probe | Not (Probe p) |
| Create a probe that evaluates to "true" when the value p does not evaluate to "true". | |
| Solver | MkSolver (Symbol logic=null) |
| Creates a new (incremental) solver. | |
| Solver | MkSolver (string logic) |
| Creates a new (incremental) solver. | |
| Solver | MkSimpleSolver () |
| Creates a new (incremental) solver. | |
| Solver | MkSolver (Tactic t) |
| Creates a solver that is implemented using the given tactic. | |
| Fixedpoint | MkFixedpoint () |
| Create a Fixedpoint context. | |
| AST | WrapAST (IntPtr nativeObject) |
| Wraps an AST. | |
| IntPtr | UnwrapAST (AST a) |
| Unwraps an AST. | |
| string | SimplifyHelp () |
Return a string describing all available parameters to Expr.Simplify. | |
| void | UpdateParamValue (string id, string value) |
| Update a mutable configuration parameter. | |
| string | GetParamValue (string id) |
| Get a configuration parameter. | |
| void | Dispose () |
| Disposes of the context. | |
Static Public Member Functions | |
| static void | ToggleWarningMessages (bool enabled) |
| Enable/disable printing of warning messages to the console. | |
Properties | |
| BoolSort | BoolSort [get] |
| Retrieves the Boolean sort of the context. | |
| IntSort | IntSort [get] |
| Retrieves the Integer sort of the context. | |
| RealSort | RealSort [get] |
| Retrieves the Real sort of the context. | |
| Z3_ast_print_mode | PrintMode [set] |
| Selects the format used for pretty-printing expressions. | |
| uint | NumSMTLIBFormulas [get] |
The number of SMTLIB formulas parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| BoolExpr[] | SMTLIBFormulas [get] |
The formulas parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| uint | NumSMTLIBAssumptions [get] |
The number of SMTLIB assumptions parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| BoolExpr[] | SMTLIBAssumptions [get] |
The assumptions parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| uint | NumSMTLIBDecls [get] |
The number of SMTLIB declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| FuncDecl[] | SMTLIBDecls [get] |
The declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| uint | NumSMTLIBSorts [get] |
The number of SMTLIB sorts parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| Sort[] | SMTLIBSorts [get] |
The declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile. | |
| uint | NumTactics [get] |
| The number of supported tactics. | |
| string[] | TacticNames [get] |
| The names of all supported tactics. | |
| uint | NumProbes [get] |
| The number of supported Probes. | |
| string[] | ProbeNames [get] |
| The names of all supported Probes. | |
| ParamDescrs | SimplifyParameterDescriptions [get] |
| Retrieves parameter descriptions for simplifier. | |
The main interaction with Z3 happens via the Context.
Definition at line 31 of file Context.cs.
|
inline |
Definition at line 37 of file Context.cs.
|
inline |
Definition at line 47 of file Context.cs.
Create a probe that evaluates to "true" when the value p1 and p2 evaluate to "true".
Definition at line 3302 of file Context.cs.
Create a tactic that applies t1 to a Goal and then t2 to every subgoal produced by t1 .
Definition at line 2937 of file Context.cs.
|
inline |
Convert a benchmark into an SMT-LIB formatted string.
| name | Name of the benchmark. The argument is optional. |
| logic | The benchmark logic. |
| status | The status string (sat, unsat, or unknown) |
| attributes | Other attributes, such as source, difficulty or category. |
| assumptions | Auxiliary assumptions. |
| formula | Formula to be checked for consistency in conjunction with assumptions. |
Definition at line 2676 of file Context.cs.
Create a tactic that applies t1 to a given goal if the probe p evaluates to true and t2 otherwise.
Definition at line 3034 of file Context.cs.
|
inline |
Create a probe that always evaluates to val .
Definition at line 3216 of file Context.cs.
|
inline |
Disposes of the context.
Definition at line 3642 of file Context.cs.
Create a probe that evaluates to "true" when the value returned by p1 is equal to the value returned by p2
Definition at line 3287 of file Context.cs.
|
inline |
Create a tactic always fails.
Definition at line 3073 of file Context.cs.
Create a tactic that fails if the probe p evaluates to false.
Definition at line 3083 of file Context.cs.
|
inline |
Create a tactic that fails if the goal is not triviall satisfiable (i.e., empty) or trivially unsatisfiable (i.e., contains `false').
Definition at line 3096 of file Context.cs.
Create a probe that evaluates to "true" when the value returned by p1 is greater than or equal the value returned by p2
Definition at line 3272 of file Context.cs.
|
inline |
Get a configuration parameter.
Returns null if the parameter value does not exist.
Definition at line 3512 of file Context.cs.
Create a probe that evaluates to "true" when the value returned by p1 is greater than the value returned by p2
Definition at line 3242 of file Context.cs.
|
inline |
Interrupt the execution of a Z3 procedure.
This procedure can be used to interrupt: solvers, simplifiers and tactics.
Definition at line 3161 of file Context.cs.
Create a probe that evaluates to "true" when the value returned by p1 is less than or equal the value returned by p2
Definition at line 3257 of file Context.cs.
Create a probe that evaluates to "true" when the value returned by p1 is less than the value returned by p2
Definition at line 3227 of file Context.cs.
Create an expression representing t[0] + t[1] + ....
Definition at line 896 of file Context.cs.
Create an expression representing t[0] and t[1] and ....
Definition at line 868 of file Context.cs.
Create a new function application.
Definition at line 722 of file Context.cs.
Create an array constant.
Definition at line 1942 of file Context.cs.
Create an array constant.
Definition at line 1955 of file Context.cs.
Create a new array sort.
Definition at line 202 of file Context.cs.
|
inline |
Create a new bit-vector sort.
Definition at line 192 of file Context.cs.
|
inline |
Creates a Boolean value.
Definition at line 757 of file Context.cs.
Create a Boolean constant.
Definition at line 635 of file Context.cs.
|
inline |
Create a Boolean constant.
Definition at line 646 of file Context.cs.
|
inline |
Create a new Boolean sort.
Definition at line 142 of file Context.cs.
Creates a new bound variable.
| index | The de-Bruijn index of the variable |
| ty | The sort of the variable |
Definition at line 552 of file Context.cs.
|
inline |
Create a bit-vector numeral.
| v | A string representing the value in decimal notation. |
| size | the size of the bit-vector |
Definition at line 2453 of file Context.cs.
|
inline |
Create a bit-vector numeral.
| v | value of the numeral. |
| size | the size of the bit-vector |
Definition at line 2465 of file Context.cs.
|
inline |
Create a bit-vector numeral.
| v | value of the numeral. |
| size | the size of the bit-vector |
Definition at line 2477 of file Context.cs.
|
inline |
Create a bit-vector numeral.
| v | value of the numeral. |
///
| size | the size of the bit-vector |
Definition at line 2489 of file Context.cs.
|
inline |
Create a bit-vector numeral.
| v | value of the numeral. |
| size | the size of the bit-vector |
Definition at line 2501 of file Context.cs.
|
inline |
Create an integer from the bit-vector argument t .
If is_signed is false, then the bit-vector 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 t . If is_signed is true, 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.
Definition at line 1794 of file Context.cs.
|
inline |
Two's complement addition.
The arguments must have the same bit-vector sort.
Definition at line 1253 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise addition does not overflow.
The arguments must be of bit-vector sort.
Definition at line 1809 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise addition does not underflow.
The arguments must be of bit-vector sort.
Definition at line 1826 of file Context.cs.
|
inline |
Bitwise conjunction.
The arguments must have a bit-vector sort.
Definition at line 1150 of file Context.cs.
|
inline |
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.
Definition at line 1681 of file Context.cs.
|
inline |
Creates a bit-vector constant.
Definition at line 699 of file Context.cs.
|
inline |
Creates a bit-vector constant.
Definition at line 710 of file Context.cs.
|
inline |
Logical shift right
It is equivalent to unsigned division by 2^x where x is the value of 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.
Definition at line 1656 of file Context.cs.
|
inline |
Two's complement multiplication.
The arguments must have the same bit-vector sort.
Definition at line 1283 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise multiplication does not overflow.
The arguments must be of bit-vector sort.
Definition at line 1909 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise multiplication does not underflow.
The arguments must be of bit-vector sort.
Definition at line 1926 of file Context.cs.
|
inline |
Bitwise NAND.
The arguments must have a bit-vector sort.
Definition at line 1195 of file Context.cs.
|
inline |
Standard two's complement unary minus.
The arguments must have a bit-vector sort.
Definition at line 1240 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise negation does not overflow.
The arguments must be of bit-vector sort.
Definition at line 1894 of file Context.cs.
|
inline |
Bitwise NOR.
The arguments must have a bit-vector sort.
Definition at line 1210 of file Context.cs.
|
inline |
Bitwise negation.
The argument must have a bit-vector sort.
Definition at line 1111 of file Context.cs.
|
inline |
Bitwise disjunction.
The arguments must have a bit-vector sort.
Definition at line 1165 of file Context.cs.
|
inline |
Take conjunction of bits in a vector, return vector of length 1.
The argument must have a bit-vector sort.
Definition at line 1124 of file Context.cs.
|
inline |
Take disjunction of bits in a vector, return vector of length 1.
The argument must have a bit-vector sort.
Definition at line 1137 of file Context.cs.
|
inline |
Rotate Left.
Rotate bits of t to the left i times. The argument t must have a bit-vector sort.
Definition at line 1699 of file Context.cs.
|
inline |
Rotate Left.
Rotate bits of t1 to the left t2 times. The arguments must have the same bit-vector sort.
Definition at line 1731 of file Context.cs.
|
inline |
Rotate Right.
Rotate bits of t to the right i times. The argument t must have a bit-vector sort.
Definition at line 1715 of file Context.cs.
|
inline |
Rotate Right.
Rotate bits of t1 to the rightt2 times. The arguments must have the same bit-vector sort.
Definition at line 1749 of file Context.cs.
|
inline |
Signed division.
It is defined in the following way:
floor of t1/t2 if t2 is different from zero, and t1*t2 >= 0.ceiling of t1/t2 if 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.
Definition at line 1327 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise signed division does not overflow.
The arguments must be of bit-vector sort.
Definition at line 1877 of file Context.cs.
|
inline |
Two's complement signed greater than or equal to.
The arguments must have the same bit-vector sort.
Definition at line 1487 of file Context.cs.
|
inline |
Two's complement signed greater-than.
The arguments must have the same bit-vector sort.
Definition at line 1521 of file Context.cs.
|
inline |
Shift left.
It is equivalent to multiplication by 2^x where x is the value of 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.
Definition at line 1633 of file Context.cs.
|
inline |
Two's complement signed less-than or equal to.
The arguments must have the same bit-vector sort.
Definition at line 1453 of file Context.cs.
|
inline |
Two's complement signed less-than
The arguments must have the same bit-vector sort.
Definition at line 1419 of file Context.cs.
|
inline |
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.
Definition at line 1385 of file Context.cs.
|
inline |
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 t1.
If t2 is zero, then the result is undefined. The arguments must have the same bit-vector sort.
Definition at line 1367 of file Context.cs.
|
inline |
Two's complement subtraction.
The arguments must have the same bit-vector sort.
Definition at line 1268 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise subtraction does not overflow.
The arguments must be of bit-vector sort.
Definition at line 1843 of file Context.cs.
|
inline |
Create a predicate that checks that the bit-wise subtraction does not underflow.
The arguments must be of bit-vector sort.
Definition at line 1860 of file Context.cs.
|
inline |
Unsigned division.
It is defined as the floor of t1/t2 if t2 is different from zero. If t2 is zero, then the result is undefined. The arguments must have the same bit-vector sort.
Definition at line 1303 of file Context.cs.
|
inline |
Unsigned greater than or equal to.
The arguments must have the same bit-vector sort.
Definition at line 1470 of file Context.cs.
|
inline |
Unsigned greater-than.
The arguments must have the same bit-vector sort.
Definition at line 1504 of file Context.cs.
|
inline |
Unsigned less-than or equal to.
The arguments must have the same bit-vector sort.
Definition at line 1436 of file Context.cs.
|
inline |
Unsigned less-than
The arguments must have the same bit-vector sort.
Definition at line 1402 of file Context.cs.
|
inline |
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.
Definition at line 1346 of file Context.cs.
|
inline |
Bitwise XNOR.
The arguments must have a bit-vector sort.
Definition at line 1225 of file Context.cs.
|
inline |
Bitwise XOR.
The arguments must have a bit-vector sort.
Definition at line 1180 of file Context.cs.
|
inline |
Bit-vector concatenation.
The arguments must have a bit-vector sort.
n1+n2, where n1 (n2) is the size of t1 (t2). Definition at line 1542 of file Context.cs.
Creates a new Constant of sort range and named name .
Definition at line 584 of file Context.cs.
Creates a new Constant of sort range and named name .
Definition at line 599 of file Context.cs.
Creates a fresh constant from the FuncDecl f .
| f | A decl of a 0-arity function |
Definition at line 624 of file Context.cs.
Create a constant array.
The resulting term is an array, such that a selecton an arbitrary index produces the value v.
Definition at line 2027 of file Context.cs.
Creates a new constant function declaration.
Definition at line 508 of file Context.cs.
Creates a new constant function declaration.
Definition at line 522 of file Context.cs.
|
inline |
Create a datatype constructor.
| name | constructor name |
| recognizer | name of recognizer function. |
| fieldNames | names of the constructor fields. |
| sorts | field sorts, 0 if the field sort refers to a recursive sort. |
| 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. |
Definition at line 317 of file Context.cs.
|
inline |
Create a datatype constructor.
| name | |
| recognizer | |
| fieldNames | |
| sorts | |
| sortRefs |
Definition at line 335 of file Context.cs.
|
inline |
Create a new datatype sort.
Definition at line 345 of file Context.cs.
|
inline |
Create a new datatype sort.
Definition at line 361 of file Context.cs.
|
inline |
Create mutually recursive datatypes.
| names | names of datatype sorts |
| c | list of constructors, one list per sort. |
Definition at line 376 of file Context.cs.
|
inline |
Create mutually recursive data-types.
| names | |
| c |
Definition at line 411 of file Context.cs.
Creates a distinct term.
Definition at line 781 of file Context.cs.
Create an expression representing t1 / t2.
Definition at line 947 of file Context.cs.
Create an empty set.
Definition at line 2093 of file Context.cs.
Create a new enumeration sort.
Definition at line 233 of file Context.cs.
|
inline |
Create a new enumeration sort.
Definition at line 249 of file Context.cs.
Creates the equality x = y .
Definition at line 767 of file Context.cs.
|
inline |
Create an existential Quantifier.
Definition at line 2567 of file Context.cs.
|
inline |
Create an existential Quantifier.
Definition at line 2585 of file Context.cs.
|
inline |
Bit-vector extraction.
Extract the bits high down to low from a bitvector of size m to yield a new bitvector of size n, where n = high - low + 1. The argument t must have a bit-vector sort.
Definition at line 1562 of file Context.cs.
|
inline |
The false Term.
Definition at line 747 of file Context.cs.
|
inline |
Create a new finite domain sort.
Definition at line 286 of file Context.cs.
|
inline |
Create a new finite domain sort.
Definition at line 298 of file Context.cs.
|
inline |
Create a Fixedpoint context.
Definition at line 3402 of file Context.cs.
|
inline |
Create a universal Quantifier.
Creates a forall formula, where weight is the weight, patterns is an array of patterns, sorts is an array with the sorts of the bound variables, names is an array with the 'names' of the bound variables, and body is the body of the quantifier. Quantifiers are associated with weights indicating the importance of using the quantifier during instantiation.
| sorts | the sorts of the bound variables. |
| names | names of the bound variables |
| body | the body of the quantifier. |
| weight | quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0. |
| patterns | array containing the patterns created using MkPattern. |
| noPatterns | array containing the anti-patterns created using MkPattern. |
| quantifierID | optional symbol to track quantifier. |
| skolemID | optional symbol to track skolem constants. |
Definition at line 2531 of file Context.cs.
|
inline |
Create a universal Quantifier.
Definition at line 2551 of file Context.cs.
Creates a fresh Constant of sort range and a name prefixed with prefix .
Definition at line 611 of file Context.cs.
Creates a fresh constant function declaration with a name prefixed with prefix .
Definition at line 536 of file Context.cs.
Creates a fresh function declaration with a name prefixed with prefix .
Definition at line 494 of file Context.cs.
Create the full set.
Definition at line 2105 of file Context.cs.
Creates a new function declaration.
Definition at line 430 of file Context.cs.
Creates a new function declaration.
Definition at line 446 of file Context.cs.
Creates a new function declaration.
Definition at line 463 of file Context.cs.
Creates a new function declaration.
Definition at line 477 of file Context.cs.
Create an expression representing t1 >= t2
Definition at line 1047 of file Context.cs.
|
inline |
Creates a new Goal.
Note that the Context must have been created with proof generation support if proofs is set to true here.
| models | Indicates whether model generation should be enabled. |
| unsatCores | Indicates whether unsat core generation should be enabled. |
| proofs | Indicates whether proof generation should be enabled. |
Definition at line 2867 of file Context.cs.
Referenced by Goal.Simplify().
Create an expression representing t1 > t2
Definition at line 1033 of file Context.cs.
Create an expression representing t1 iff t2.
Definition at line 826 of file Context.cs.
Create an expression representing t1 -> t2.
Definition at line 840 of file Context.cs.
|
inline |
Create an integer numeral.
| v | A string representing the Term value in decimal notation. |
Definition at line 2391 of file Context.cs.
|
inline |
Create an integer numeral.
| v | value of the numeral. |
Definition at line 2403 of file Context.cs.
|
inline |
Create an integer numeral.
| v | value of the numeral. |
Definition at line 2415 of file Context.cs.
|
inline |
Create an integer numeral.
| v | value of the numeral. |
Definition at line 2427 of file Context.cs.
|
inline |
Create an integer numeral.
| v | value of the numeral. |
Definition at line 2439 of file Context.cs.
|
inline |
Create an n bit bit-vector from the integer argument t .
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.
Definition at line 1770 of file Context.cs.
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.
Definition at line 1068 of file Context.cs.
Creates an integer constant.
Definition at line 656 of file Context.cs.
|
inline |
Creates an integer constant.
Definition at line 667 of file Context.cs.
|
inline |
Create a new integer sort.
Definition at line 173 of file Context.cs.
Creates an expression that checks whether a real number is an integer.
Definition at line 1096 of file Context.cs.
Create an expression representing an if-then-else: ite(t1, t2, t3).
| t1 | An expression with Boolean sort |
| t2 | An expression |
| t3 | An expression with the same sort as t2 |
Definition at line 810 of file Context.cs.
Create an expression representing t1 <= t2
Definition at line 1019 of file Context.cs.
Create a new list sort.
Definition at line 260 of file Context.cs.
Create a new list sort.
Definition at line 274 of file Context.cs.
Create an expression representing t1 < t2
Definition at line 1005 of file Context.cs.
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].
Definition at line 2049 of file Context.cs.
Create an expression representing t1 mod t2.
The arguments must have int type.
Definition at line 962 of file Context.cs.
Create an expression representing t[0] * t[1] * ....
Definition at line 909 of file Context.cs.
Mk an expression representing not(a).
Definition at line 795 of file Context.cs.
Create a Term of a given sort.
| 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]*. |
| ty | The sort of the numeral. In the current implementation, the given sort can be an int, real, or bit-vectors of arbitrary size. |
Definition at line 2232 of file Context.cs.
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.
| v | Value of the numeral |
| ty | Sort of the numeral |
Definition at line 2248 of file Context.cs.
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.
| v | Value of the numeral |
| ty | Sort of the numeral |
Definition at line 2264 of file Context.cs.
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.
| v | Value of the numeral |
| ty | Sort of the numeral |
Definition at line 2280 of file Context.cs.
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.
| v | Value of the numeral |
| ty | Sort of the numeral |
Definition at line 2296 of file Context.cs.
Create an expression representing t[0] or t[1] or ....
Definition at line 881 of file Context.cs.
|
inline |
Creates a new ParameterSet.
Definition at line 2879 of file Context.cs.
Create a quantifier pattern.
Definition at line 565 of file Context.cs.
Create an expression representing t1 ^ t2.
Definition at line 991 of file Context.cs.
|
inline |
Creates a new Probe.
Definition at line 3206 of file Context.cs.
|
inline |
Create a Quantifier.
Definition at line 2600 of file Context.cs.
|
inline |
Create a Quantifier.
Definition at line 2623 of file Context.cs.
|
inline |
Create a real from a fraction.
| num | numerator of rational. |
| den | denominator of rational. |
Definition at line 2314 of file Context.cs.
|
inline |
Create a real numeral.
| v | A string representing the Term value in decimal notation. |
Definition at line 2330 of file Context.cs.
|
inline |
Create a real numeral.
| v | value of the numeral. |
Definition at line 2342 of file Context.cs.
|
inline |
Create a real numeral.
| v | value of the numeral. |
Definition at line 2354 of file Context.cs.
|
inline |
Create a real numeral.
| v | value of the numeral. |
Definition at line 2366 of file Context.cs.
|
inline |
Create a real numeral.
| v | value of the numeral. |
Definition at line 2378 of file Context.cs.
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.
Definition at line 1084 of file Context.cs.
Creates a real constant.
Definition at line 678 of file Context.cs.
|
inline |
Creates a real constant.
Definition at line 689 of file Context.cs.
|
inline |
Create a real sort.
Definition at line 183 of file Context.cs.
Create an expression representing t1 rem t2.
The arguments must have int type.
Definition at line 977 of file Context.cs.
|
inline |
Bit-vector repetition.
The argument t must have a bit-vector sort.
Definition at line 1612 of file Context.cs.
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.
Definition at line 1977 of file Context.cs.
Add an element to the set.
Definition at line 2117 of file Context.cs.
Take the complement of a set.
Definition at line 2185 of file Context.cs.
Remove an element from a set.
Definition at line 2132 of file Context.cs.
Take the difference between two sets.
Definition at line 2171 of file Context.cs.
Take the intersection of a list of sets.
Definition at line 2158 of file Context.cs.
Check for set membership.
Definition at line 2197 of file Context.cs.
Create a set type.
Definition at line 2081 of file Context.cs.
Check for subsetness of sets.
Definition at line 2211 of file Context.cs.
Take the union of a list of sets.
Definition at line 2146 of file Context.cs.
|
inline |
Bit-vector sign extension.
Sign-extends the given bit-vector to the (signed) equivalent bitvector of size m+i, where m is the size of the given bit-vector. The argument t must have a bit-vector sort.
Definition at line 1579 of file Context.cs.
|
inline |
Creates a new (incremental) solver.
Definition at line 3375 of file Context.cs.
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.
Definition at line 3351 of file Context.cs.
|
inline |
Creates a new (incremental) solver.
Definition at line 3365 of file Context.cs.
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.
Definition at line 3389 of file Context.cs.
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).
Definition at line 2005 of file Context.cs.
Create an expression representing t[0] - t[1] - ....
Definition at line 922 of file Context.cs.
|
inline |
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.
Definition at line 69 of file Context.cs.
Referenced by Params.Add().
|
inline |
Create a symbol using a string.
Definition at line 79 of file Context.cs.
|
inline |
Creates a new Tactic.
Definition at line 2926 of file Context.cs.
Referenced by Goal.Simplify().
Access the array default value.
Produces the default range value, for arrays that can be represented as finite maps with a default range value.
Definition at line 2067 of file Context.cs.
|
inline |
The true Term.
Definition at line 737 of file Context.cs.
Create a new tuple sort.
Definition at line 216 of file Context.cs.
Create an expression representing -t.
Definition at line 935 of file Context.cs.
|
inline |
Create a new uninterpreted sort.
Definition at line 151 of file Context.cs.
|
inline |
Create a new uninterpreted sort.
Definition at line 163 of file Context.cs.
Create an expression representing t1 xor t2.
Definition at line 854 of file Context.cs.
|
inline |
Bit-vector zero extension.
Extend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m is the size of the given bit-vector. The argument t must have a bit-vector sort.
Definition at line 1597 of file Context.cs.
Create a probe that evaluates to "true" when the value p does not evaluate to "true".
Definition at line 3332 of file Context.cs.
Create a probe that evaluates to "true" when the value p1 or p2 evaluate to "true".
Definition at line 3317 of file Context.cs.
Create a tactic that first applies t1 to a Goal and if it fails then returns the result of t2 applied to the Goal.
Definition at line 2986 of file Context.cs.
Create a tactic that applies t1 to a given goal and then t2 to every subgoal produced by t1 . The subgoals are processed in parallel.
Definition at line 3146 of file Context.cs.
Create a tactic that applies the given tactics in parallel.
Definition at line 3133 of file Context.cs.
|
inline |
Parse the given file using the SMT-LIB2 parser.
Definition at line 2840 of file Context.cs.
|
inline |
Parse the given string using the SMT-LIB2 parser.
Definition at line 2821 of file Context.cs.
|
inline |
Parse the given file using the SMT-LIB parser.
Definition at line 2715 of file Context.cs.
|
inline |
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 sortNames and declNames don't need to match the names of the sorts and declarations in the arrays sorts and decls . This is a useful feature since we can use arbitrary names to reference sorts and declarations.
Definition at line 2698 of file Context.cs.
|
inline |
Returns a string containing a description of the probe with the given name.
Definition at line 3196 of file Context.cs.
Create a tactic that keeps applying t until the goal is not modified anymore or the maximum number of iterations max is reached.
Definition at line 3051 of file Context.cs.
|
inline |
Return a string describing all available parameters to Expr.Simplify.
Definition at line 3447 of file Context.cs.
|
inline |
Create a tactic that just returns the given goal.
Definition at line 3063 of file Context.cs.
|
inline |
Returns a string containing a description of the tactic with the given name.
Definition at line 2916 of file Context.cs.
Create a tactic that applies t1 to a Goal and then t2 to every subgoal produced by t1 .
Shorthand for AndThen.
Definition at line 2972 of file Context.cs.
|
inlinestatic |
Enable/disable printing of warning messages to the console.
Note that this function is static and effects the behaviour of all contexts globally.
Definition at line 3467 of file Context.cs.
Create a tactic that applies t to a goal for ms milliseconds.
If t does not terminate within ms milliseconds, then it fails.
Definition at line 3003 of file Context.cs.
|
inline |
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.,
).
| a | The AST to unwrap. |
Definition at line 3439 of file Context.cs.
|
inline |
Update a mutable configuration parameter.
The list of all configuration parameters can be obtained using the Z3 executable: 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.
Definition at line 3500 of file Context.cs.
Create a tactic that applies t using the given set of parameters p .
Definition at line 3106 of file Context.cs.
Create a tactic that applies t to a given goal if the probe p evaluates to true.
If p evaluates to false, then the new tactic behaves like the skip tactic.
Definition at line 3019 of file Context.cs.
Create a tactic that applies t using the given set of parameters p .
Alias for UsingParams
Definition at line 3121 of file Context.cs.
|
inline |
Wraps an AST.
This function is used for transitions between native and managed objects. Note that nativeObject must be a native object obtained from Z3 (e.g., through
) and that it must have a correct reference count (see e.g., .
| nativeObject | The native pointer to wrap. |
Definition at line 3422 of file Context.cs.
Retrieves the Boolean sort of the context.
Definition at line 112 of file Context.cs.
Retrieves the Integer sort of the context.
Definition at line 125 of file Context.cs.
|
get |
The number of supported Probes.
Definition at line 3172 of file Context.cs.
|
get |
The number of SMTLIB assumptions parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2753 of file Context.cs.
|
get |
The number of SMTLIB declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2775 of file Context.cs.
|
get |
The number of SMTLIB formulas parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2731 of file Context.cs.
|
get |
The number of SMTLIB sorts parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2797 of file Context.cs.
|
get |
The number of supported tactics.
Definition at line 2892 of file Context.cs.
|
set |
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 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.
Definition at line 2660 of file Context.cs.
|
get |
The names of all supported Probes.
Definition at line 3180 of file Context.cs.
Retrieves the Real sort of the context.
Definition at line 137 of file Context.cs.
|
get |
Retrieves parameter descriptions for simplifier.
Definition at line 3458 of file Context.cs.
|
get |
The assumptions parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2759 of file Context.cs.
|
get |
The declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2781 of file Context.cs.
|
get |
The formulas parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2737 of file Context.cs.
|
get |
The declarations parsed by the last call to ParseSMTLIBString or ParseSMTLIBFile.
Definition at line 2803 of file Context.cs.
|
get |
The names of all supported tactics.
Definition at line 2900 of file Context.cs.
1.8.2