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
(Expr<BoolSort> query)
| 121 | * @throws Z3Exception |
| 122 | **/ |
| 123 | public Status query(Expr<BoolSort> query) { |
| 124 | getContext().checkContextMatch(query); |
| 125 | Z3_lbool r = Z3_lbool.fromInt(Native.fixedpointQuery(getContext().nCtx(), |
| 126 | getNativeObject(), query.getNativeObject())); |
| 127 | switch (r) |
| 128 | { |
| 129 | case Z3_L_TRUE: |
| 130 | return Status.SATISFIABLE; |
| 131 | case Z3_L_FALSE: |
| 132 | return Status.UNSATISFIABLE; |
| 133 | default: |
| 134 | return Status.UNKNOWN; |
| 135 | } |
| 136 | } |
| 137 | |
| 138 | /** |
| 139 | * Query the fixedpoint solver. A query is an array of relations. The query |
nothing calls this directly
no test coverage detected