tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +58 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +633 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1448 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1995 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,884 @@
|
|
|
1
|
+
import { SmtCanceledError, SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
KIND_QUANTIFIER,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_DIV,
|
|
9
|
+
OP_GE,
|
|
10
|
+
OP_ITE,
|
|
11
|
+
OP_LE,
|
|
12
|
+
OP_MUL,
|
|
13
|
+
OP_NOT,
|
|
14
|
+
OP_OR,
|
|
15
|
+
OP_SUB,
|
|
16
|
+
OP_TO_REAL,
|
|
17
|
+
OP_UMINUS,
|
|
18
|
+
SORT_BOOL,
|
|
19
|
+
SORT_INT,
|
|
20
|
+
SORT_REAL,
|
|
21
|
+
} from "./ast";
|
|
22
|
+
import { type Dependency, type Goal, joinDependencies } from "./goal";
|
|
23
|
+
import type { ProtoModel } from "./proto-model";
|
|
24
|
+
import { getGcd, getLcm, Rational } from "./rational";
|
|
25
|
+
import { RefVector } from "./ref-vector";
|
|
26
|
+
import { UINT_MAX } from "./sat/clause";
|
|
27
|
+
|
|
28
|
+
export interface FmOptions {
|
|
29
|
+
isRealOnly: boolean;
|
|
30
|
+
limit: number;
|
|
31
|
+
cutoff1: number;
|
|
32
|
+
cutoff2: number;
|
|
33
|
+
extra: number;
|
|
34
|
+
isOcc: boolean;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
// lits \/ (as[0]*xs[0] + ... + as[n-1]*xs[n-1] <= c), with < when strict. A literal is the index
|
|
38
|
+
// of a Boolean constant, negative when negated.
|
|
39
|
+
interface Constraint {
|
|
40
|
+
id: number;
|
|
41
|
+
lits: number[];
|
|
42
|
+
xs: number[];
|
|
43
|
+
as: Rational[];
|
|
44
|
+
c: Rational;
|
|
45
|
+
isStrict: boolean;
|
|
46
|
+
isDead: boolean;
|
|
47
|
+
dependency: Dependency | undefined;
|
|
48
|
+
}
|
|
49
|
+
|
|
50
|
+
class ConstraintSet {
|
|
51
|
+
private id2pos: number[] = [];
|
|
52
|
+
private set: Constraint[] = [];
|
|
53
|
+
|
|
54
|
+
get isEmpty() {
|
|
55
|
+
return this.set.length === 0;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
insert(constraint: Constraint) {
|
|
59
|
+
if (this.id2pos[constraint.id] !== undefined && this.id2pos[constraint.id] !== -1) return;
|
|
60
|
+
this.id2pos[constraint.id] = this.set.length;
|
|
61
|
+
this.set.push(constraint);
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
erase(constraint: Constraint) {
|
|
65
|
+
const pos = this.id2pos[constraint.id];
|
|
66
|
+
if (pos === undefined || pos === -1) return;
|
|
67
|
+
this.id2pos[constraint.id] = -1;
|
|
68
|
+
const last = this.set.length - 1;
|
|
69
|
+
if (pos !== last) {
|
|
70
|
+
const lastConstraint = this.set[last];
|
|
71
|
+
this.set[pos] = lastConstraint;
|
|
72
|
+
this.id2pos[lastConstraint.id] = pos;
|
|
73
|
+
}
|
|
74
|
+
this.set.pop();
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
pop() {
|
|
78
|
+
const constraint = this.set.pop() as Constraint;
|
|
79
|
+
this.id2pos[constraint.id] = -1;
|
|
80
|
+
return constraint;
|
|
81
|
+
}
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
class IdGen {
|
|
85
|
+
private next = 0;
|
|
86
|
+
private free: number[] = [];
|
|
87
|
+
|
|
88
|
+
mk() {
|
|
89
|
+
return this.free.pop() ?? this.next++;
|
|
90
|
+
}
|
|
91
|
+
|
|
92
|
+
recycle(id: number) {
|
|
93
|
+
this.free.push(id);
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
class Fm {
|
|
98
|
+
private bvar2expr: RefVector;
|
|
99
|
+
private bvar2sign: number[] = [0];
|
|
100
|
+
private expr2bvar = new Map<number, number>();
|
|
101
|
+
private isInts: boolean[] = [];
|
|
102
|
+
private forbidden: boolean[] = [];
|
|
103
|
+
private var2expr: RefVector;
|
|
104
|
+
private expr2var = new Map<number, number>();
|
|
105
|
+
private var2pos: number[] = [];
|
|
106
|
+
private lowers: Constraint[][] = [];
|
|
107
|
+
private uppers: Constraint[][] = [];
|
|
108
|
+
private forbiddenSet = new Set<number>();
|
|
109
|
+
private idGen = new IdGen();
|
|
110
|
+
private counter = 0;
|
|
111
|
+
private isInconsistent = false;
|
|
112
|
+
private inconsistentCore: Dependency | undefined;
|
|
113
|
+
private subTodo = new ConstraintSet();
|
|
114
|
+
readonly converter: { decl: number; clauses: RefVector }[] = [];
|
|
115
|
+
|
|
116
|
+
constructor(
|
|
117
|
+
private manager: AstManager,
|
|
118
|
+
private goal: Goal,
|
|
119
|
+
private options: FmOptions,
|
|
120
|
+
) {
|
|
121
|
+
this.bvar2expr = new RefVector(manager);
|
|
122
|
+
this.bvar2expr.push(-1);
|
|
123
|
+
this.var2expr = new RefVector(manager);
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
private isLiteral(expr: number) {
|
|
127
|
+
const manager = this.manager;
|
|
128
|
+
return (
|
|
129
|
+
manager.isUninterpretedConst(expr) ||
|
|
130
|
+
(manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0)))
|
|
131
|
+
);
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
private getVar(expr: number) {
|
|
135
|
+
const manager = this.manager;
|
|
136
|
+
if (manager.isUninterpretedConst(expr)) return expr;
|
|
137
|
+
if (manager.getOp(expr) === OP_TO_REAL && manager.isUninterpretedConst(manager.getArg(expr, 0)))
|
|
138
|
+
return manager.getArg(expr, 0);
|
|
139
|
+
return undefined;
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
private getMulArgs(expr: number) {
|
|
143
|
+
const manager = this.manager;
|
|
144
|
+
return manager.getOp(expr) === OP_MUL && manager.getNumArgs(expr) === 2
|
|
145
|
+
? manager.getArgs(expr)
|
|
146
|
+
: undefined;
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
private getLinearMonVar(expr: number) {
|
|
150
|
+
const args = this.getMulArgs(expr);
|
|
151
|
+
if (args !== undefined && this.manager.isNumeral(args[0])) {
|
|
152
|
+
const variable = this.getVar(args[1]);
|
|
153
|
+
if (variable !== undefined) return variable;
|
|
154
|
+
}
|
|
155
|
+
return this.getVar(expr);
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private getMonomials(expr: number) {
|
|
159
|
+
const manager = this.manager;
|
|
160
|
+
return manager.getOp(expr) === OP_ADD ? manager.getArgs(expr) : [expr];
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
private isLinearPol(expr: number) {
|
|
164
|
+
const manager = this.manager;
|
|
165
|
+
const visited = new Set<number>();
|
|
166
|
+
let isAllForbidden = true;
|
|
167
|
+
for (const monomial of this.getMonomials(expr)) {
|
|
168
|
+
const variable = this.getLinearMonVar(monomial);
|
|
169
|
+
if (variable === undefined || visited.has(variable)) return false;
|
|
170
|
+
visited.add(variable);
|
|
171
|
+
if (
|
|
172
|
+
!this.forbiddenSet.has(manager.decls[variable]) &&
|
|
173
|
+
(!this.options.isRealOnly || manager.sorts[variable] !== SORT_INT)
|
|
174
|
+
)
|
|
175
|
+
isAllForbidden = false;
|
|
176
|
+
}
|
|
177
|
+
return !isAllForbidden;
|
|
178
|
+
}
|
|
179
|
+
|
|
180
|
+
private isLinearIneq(expr: number) {
|
|
181
|
+
const manager = this.manager;
|
|
182
|
+
const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
|
|
183
|
+
const op = manager.getOp(atom);
|
|
184
|
+
if (op !== OP_LE && op !== OP_GE) return false;
|
|
185
|
+
if (!manager.isNumeral(manager.getArg(atom, 1))) return false;
|
|
186
|
+
return this.isLinearPol(manager.getArg(atom, 0));
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
private isOcc(expr: number) {
|
|
190
|
+
const manager = this.manager;
|
|
191
|
+
if (this.options.isOcc && manager.getOp(expr) === OP_OR) {
|
|
192
|
+
let isFound = false;
|
|
193
|
+
for (const arg of manager.getArgs(expr)) {
|
|
194
|
+
if (this.isLiteral(arg)) continue;
|
|
195
|
+
if (!this.isLinearIneq(arg) || isFound) return false;
|
|
196
|
+
isFound = true;
|
|
197
|
+
}
|
|
198
|
+
return isFound;
|
|
199
|
+
}
|
|
200
|
+
return this.isLinearIneq(expr);
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
private delConstraint(constraint: Constraint) {
|
|
204
|
+
this.subTodo.erase(constraint);
|
|
205
|
+
this.idGen.recycle(constraint.id);
|
|
206
|
+
}
|
|
207
|
+
|
|
208
|
+
private mkConstraint(
|
|
209
|
+
lits: number[],
|
|
210
|
+
xs: number[],
|
|
211
|
+
as: Rational[],
|
|
212
|
+
c: Rational,
|
|
213
|
+
isStrict: boolean,
|
|
214
|
+
dependency: Dependency | undefined,
|
|
215
|
+
): Constraint {
|
|
216
|
+
return {
|
|
217
|
+
id: this.idGen.mk(),
|
|
218
|
+
lits: [...lits],
|
|
219
|
+
xs: [...xs],
|
|
220
|
+
as: [...as],
|
|
221
|
+
c,
|
|
222
|
+
isStrict,
|
|
223
|
+
isDead: false,
|
|
224
|
+
dependency,
|
|
225
|
+
};
|
|
226
|
+
}
|
|
227
|
+
|
|
228
|
+
private normalizeCoeffs(constraint: Constraint) {
|
|
229
|
+
if (constraint.xs.length === 0) return;
|
|
230
|
+
let gcd = constraint.c.num < 0n ? -constraint.c.num : constraint.c.num;
|
|
231
|
+
for (const coeff of constraint.as) {
|
|
232
|
+
if (gcd === 1n) break;
|
|
233
|
+
gcd = getGcd(coeff.num, gcd);
|
|
234
|
+
}
|
|
235
|
+
if (gcd === 1n) return;
|
|
236
|
+
const divisor = Rational.of(gcd);
|
|
237
|
+
constraint.c = constraint.c.div(divisor);
|
|
238
|
+
constraint.as = constraint.as.map((coeff) => coeff.div(divisor));
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
private subsumes(first: Constraint, second: Constraint) {
|
|
242
|
+
if (first === second) return false;
|
|
243
|
+
if (first.lits.length > second.lits.length) return false;
|
|
244
|
+
if (first.xs.length !== second.xs.length) return false;
|
|
245
|
+
if (first.c.compare(second.c) > 0) return false;
|
|
246
|
+
if (!first.isStrict && second.isStrict && first.c.equals(second.c)) return false;
|
|
247
|
+
this.counter += first.lits.length + second.lits.length;
|
|
248
|
+
for (const [index, variable] of first.xs.entries()) this.var2pos[variable] = index;
|
|
249
|
+
let isFailed = false;
|
|
250
|
+
for (const [index, variable] of second.xs.entries()) {
|
|
251
|
+
const pos = this.var2pos[variable];
|
|
252
|
+
if (pos === UINT_MAX || !first.as[pos].equals(second.as[index])) {
|
|
253
|
+
isFailed = true;
|
|
254
|
+
break;
|
|
255
|
+
}
|
|
256
|
+
}
|
|
257
|
+
for (const variable of first.xs) this.var2pos[variable] = UINT_MAX;
|
|
258
|
+
if (isFailed) return false;
|
|
259
|
+
for (const lit of second.lits) this.bvar2sign[Math.abs(lit)] = lit < 0 ? -1 : 1;
|
|
260
|
+
for (const lit of first.lits)
|
|
261
|
+
if (this.bvar2sign[Math.abs(lit)] !== (lit < 0 ? -1 : 1)) {
|
|
262
|
+
isFailed = true;
|
|
263
|
+
break;
|
|
264
|
+
}
|
|
265
|
+
for (const lit of second.lits) this.bvar2sign[Math.abs(lit)] = 0;
|
|
266
|
+
return !isFailed;
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
private backwardSubsumption(constraint: Constraint) {
|
|
270
|
+
if (constraint.xs.length === 0) return;
|
|
271
|
+
let best = UINT_MAX;
|
|
272
|
+
let bestSize = UINT_MAX;
|
|
273
|
+
let isBestLower = false;
|
|
274
|
+
for (const [index, variable] of constraint.xs.entries()) {
|
|
275
|
+
if (this.forbidden[variable]) continue;
|
|
276
|
+
const isNegative = constraint.as[index].isNegative();
|
|
277
|
+
const list = isNegative ? this.lowers[variable] : this.uppers[variable];
|
|
278
|
+
if (list.length < bestSize) {
|
|
279
|
+
best = variable;
|
|
280
|
+
bestSize = list.length;
|
|
281
|
+
isBestLower = isNegative;
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
if (bestSize === 0 || best === UINT_MAX) return;
|
|
285
|
+
const list = isBestLower ? this.lowers[best] : this.uppers[best];
|
|
286
|
+
this.counter += list.length;
|
|
287
|
+
let kept = 0;
|
|
288
|
+
for (const other of list) {
|
|
289
|
+
if (other.isDead) continue;
|
|
290
|
+
if (this.subsumes(constraint, other)) {
|
|
291
|
+
other.isDead = true;
|
|
292
|
+
continue;
|
|
293
|
+
}
|
|
294
|
+
list[kept++] = other;
|
|
295
|
+
}
|
|
296
|
+
list.length = kept;
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
private subsume() {
|
|
300
|
+
while (!this.subTodo.isEmpty) {
|
|
301
|
+
const constraint = this.subTodo.pop();
|
|
302
|
+
if (!constraint.isDead) this.backwardSubsumption(constraint);
|
|
303
|
+
}
|
|
304
|
+
}
|
|
305
|
+
|
|
306
|
+
private initForbiddenSet() {
|
|
307
|
+
const manager = this.manager;
|
|
308
|
+
const visited = new Set<number>();
|
|
309
|
+
for (const form of this.goal.forms.items) {
|
|
310
|
+
if (this.isOcc(form)) continue;
|
|
311
|
+
const todo = [form];
|
|
312
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
313
|
+
if (visited.has(expr)) continue;
|
|
314
|
+
visited.add(expr);
|
|
315
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
316
|
+
const data = manager.getQuantifier(expr);
|
|
317
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
318
|
+
continue;
|
|
319
|
+
}
|
|
320
|
+
if (manager.kinds[expr] !== KIND_APP) continue;
|
|
321
|
+
if (
|
|
322
|
+
manager.isUninterpretedConst(expr) &&
|
|
323
|
+
manager.getSortFamily(manager.sorts[expr]) === FAMILY_ARITH
|
|
324
|
+
)
|
|
325
|
+
this.forbiddenSet.add(manager.decls[expr]);
|
|
326
|
+
manager.pushArgs(expr, todo);
|
|
327
|
+
}
|
|
328
|
+
}
|
|
329
|
+
}
|
|
330
|
+
|
|
331
|
+
private isAllInt(constraint: Constraint) {
|
|
332
|
+
return constraint.xs.every((variable) => this.isInts[variable]);
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
private toExpr(constraint: Constraint) {
|
|
336
|
+
const manager = this.manager;
|
|
337
|
+
let ineq = -1;
|
|
338
|
+
if (constraint.xs.length === 0) {
|
|
339
|
+
if (constraint.c.isPositive() || (!constraint.isStrict && constraint.c.isZero()))
|
|
340
|
+
return manager.trueExpr;
|
|
341
|
+
} else {
|
|
342
|
+
const isIntConstraint = this.isAllInt(constraint);
|
|
343
|
+
const sort = isIntConstraint ? SORT_INT : SORT_REAL;
|
|
344
|
+
const monomials = constraint.xs.map((variable, index) => {
|
|
345
|
+
const expr = this.var2expr.items[variable];
|
|
346
|
+
const term =
|
|
347
|
+
!isIntConstraint && this.isInts[variable]
|
|
348
|
+
? manager.mkApp(OP_TO_REAL, [expr], SORT_REAL)
|
|
349
|
+
: expr;
|
|
350
|
+
const coeff = constraint.as[index];
|
|
351
|
+
return coeff.equals(Rational.one)
|
|
352
|
+
? term
|
|
353
|
+
: manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(coeff, sort), term], sort);
|
|
354
|
+
});
|
|
355
|
+
const lhs = monomials.length === 1 ? monomials[0] : manager.mkApp(OP_ADD, monomials, sort);
|
|
356
|
+
const rhs = manager.mkNumeralOfSort(constraint.c, sort);
|
|
357
|
+
ineq = constraint.isStrict
|
|
358
|
+
? manager.mkApp(OP_NOT, [manager.mkApp(OP_GE, [lhs, rhs], SORT_BOOL)], SORT_BOOL)
|
|
359
|
+
: manager.mkApp(OP_LE, [lhs, rhs], SORT_BOOL);
|
|
360
|
+
}
|
|
361
|
+
if (constraint.lits.length === 0) return ineq === -1 ? manager.falseExpr : ineq;
|
|
362
|
+
const lits = constraint.lits.map((lit) => {
|
|
363
|
+
const atom = this.bvar2expr.items[Math.abs(lit)];
|
|
364
|
+
return lit < 0 ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
|
|
365
|
+
});
|
|
366
|
+
if (ineq !== -1) lits.push(ineq);
|
|
367
|
+
return lits.length === 1 ? lits[0] : manager.mkApp(OP_OR, lits, SORT_BOOL);
|
|
368
|
+
}
|
|
369
|
+
|
|
370
|
+
private toVar(expr: number) {
|
|
371
|
+
const manager = this.manager;
|
|
372
|
+
const existing = this.expr2var.get(expr);
|
|
373
|
+
if (existing !== undefined) return existing;
|
|
374
|
+
const variable = this.var2expr.size;
|
|
375
|
+
this.var2expr.push(expr);
|
|
376
|
+
const isInt = manager.sorts[expr] === SORT_INT;
|
|
377
|
+
this.isInts.push(isInt);
|
|
378
|
+
this.var2pos.push(UINT_MAX);
|
|
379
|
+
this.expr2var.set(expr, variable);
|
|
380
|
+
this.lowers.push([]);
|
|
381
|
+
this.uppers.push([]);
|
|
382
|
+
this.forbidden.push(
|
|
383
|
+
this.forbiddenSet.has(manager.decls[expr]) || (this.options.isRealOnly && isInt),
|
|
384
|
+
);
|
|
385
|
+
return variable;
|
|
386
|
+
}
|
|
387
|
+
|
|
388
|
+
private toLiteral(expr: number) {
|
|
389
|
+
const manager = this.manager;
|
|
390
|
+
const isNegated = manager.isNot(expr);
|
|
391
|
+
const atom = isNegated ? manager.getArg(expr, 0) : expr;
|
|
392
|
+
let bvar = this.expr2bvar.get(atom);
|
|
393
|
+
if (bvar === undefined) {
|
|
394
|
+
bvar = this.bvar2expr.size;
|
|
395
|
+
this.bvar2expr.push(atom);
|
|
396
|
+
this.bvar2sign.push(0);
|
|
397
|
+
this.expr2bvar.set(atom, bvar);
|
|
398
|
+
}
|
|
399
|
+
return isNegated ? -bvar : bvar;
|
|
400
|
+
}
|
|
401
|
+
|
|
402
|
+
private addConstraint(form: number, dependency: Dependency | undefined) {
|
|
403
|
+
const manager = this.manager;
|
|
404
|
+
const lits: number[] = [];
|
|
405
|
+
const xs: number[] = [];
|
|
406
|
+
let as: Rational[] = [];
|
|
407
|
+
let c = Rational.zero;
|
|
408
|
+
let isStrict = false;
|
|
409
|
+
const args = manager.getOp(form) === OP_OR ? manager.getArgs(form) : [form];
|
|
410
|
+
for (const arg of args) {
|
|
411
|
+
if (this.isLiteral(arg)) {
|
|
412
|
+
lits.push(this.toLiteral(arg));
|
|
413
|
+
continue;
|
|
414
|
+
}
|
|
415
|
+
let isNegated = manager.isNot(arg);
|
|
416
|
+
const atom = isNegated ? manager.getArg(arg, 0) : arg;
|
|
417
|
+
isStrict = isNegated;
|
|
418
|
+
if (manager.getOp(atom) === OP_GE) isNegated = !isNegated;
|
|
419
|
+
const [lhs, rhs] = manager.getArgs(atom);
|
|
420
|
+
c = manager.getRationalValue(rhs);
|
|
421
|
+
if (isNegated) c = c.neg();
|
|
422
|
+
let isAllInt = true;
|
|
423
|
+
for (const monomial of this.getMonomials(lhs)) {
|
|
424
|
+
const mulArgs = this.getMulArgs(monomial);
|
|
425
|
+
let coeff = mulArgs === undefined ? Rational.one : manager.getRationalValue(mulArgs[0]);
|
|
426
|
+
if (isNegated) coeff = coeff.neg();
|
|
427
|
+
const variable = this.toVar(
|
|
428
|
+
this.getVar(mulArgs === undefined ? monomial : mulArgs[1]) as number,
|
|
429
|
+
);
|
|
430
|
+
xs.push(variable);
|
|
431
|
+
as.push(coeff);
|
|
432
|
+
if (!this.isInts[variable]) isAllInt = false;
|
|
433
|
+
}
|
|
434
|
+
const lcm = as.reduce((value, coeff) => getLcm(value, coeff.den), c.den);
|
|
435
|
+
if (lcm !== 1n) {
|
|
436
|
+
const factor = Rational.of(lcm);
|
|
437
|
+
c = c.mul(factor);
|
|
438
|
+
as = as.map((coeff) => coeff.mul(factor));
|
|
439
|
+
}
|
|
440
|
+
if (isAllInt && isStrict) {
|
|
441
|
+
isStrict = false;
|
|
442
|
+
c = c.sub(Rational.one);
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
this.registerConstraint(this.mkConstraint(lits, xs, as, c, isStrict, dependency));
|
|
446
|
+
}
|
|
447
|
+
|
|
448
|
+
private isFalse(constraint: Constraint) {
|
|
449
|
+
return (
|
|
450
|
+
constraint.lits.length === 0 &&
|
|
451
|
+
constraint.xs.length === 0 &&
|
|
452
|
+
(constraint.c.isNegative() || (constraint.isStrict && constraint.c.isZero()))
|
|
453
|
+
);
|
|
454
|
+
}
|
|
455
|
+
|
|
456
|
+
private registerConstraint(constraint: Constraint) {
|
|
457
|
+
this.normalizeCoeffs(constraint);
|
|
458
|
+
if (this.isFalse(constraint)) {
|
|
459
|
+
this.delConstraint(constraint);
|
|
460
|
+
this.isInconsistent = true;
|
|
461
|
+
return;
|
|
462
|
+
}
|
|
463
|
+
let isIndexed = false;
|
|
464
|
+
for (const [index, variable] of constraint.xs.entries()) {
|
|
465
|
+
if (this.forbidden[variable]) continue;
|
|
466
|
+
isIndexed = true;
|
|
467
|
+
if (constraint.as[index].isNegative()) this.lowers[variable].push(constraint);
|
|
468
|
+
else this.uppers[variable].push(constraint);
|
|
469
|
+
}
|
|
470
|
+
if (isIndexed) {
|
|
471
|
+
this.subTodo.insert(constraint);
|
|
472
|
+
return;
|
|
473
|
+
}
|
|
474
|
+
this.goal.assert(this.toExpr(constraint), constraint.dependency);
|
|
475
|
+
this.delConstraint(constraint);
|
|
476
|
+
}
|
|
477
|
+
|
|
478
|
+
private getCost(variable: number) {
|
|
479
|
+
return Math.min(this.lowers[variable].length * this.uppers[variable].length, UINT_MAX);
|
|
480
|
+
}
|
|
481
|
+
|
|
482
|
+
private sortCandidates() {
|
|
483
|
+
const candidates: { variable: number; cost: number }[] = [];
|
|
484
|
+
for (let variable = 0; variable < this.isInts.length; variable++)
|
|
485
|
+
if (!this.forbidden[variable]) candidates.push({ variable, cost: this.getCost(variable) });
|
|
486
|
+
const getKey = (candidate: { variable: number; cost: number }) =>
|
|
487
|
+
candidate.cost === 0
|
|
488
|
+
? [0, candidate.variable, 0]
|
|
489
|
+
: [1, this.isInts[candidate.variable] ? 1 : 0, candidate.cost];
|
|
490
|
+
return candidates
|
|
491
|
+
.sort((first, second) => {
|
|
492
|
+
const firstKey = getKey(first);
|
|
493
|
+
const secondKey = getKey(second);
|
|
494
|
+
return (
|
|
495
|
+
firstKey[0] - secondKey[0] || firstKey[1] - secondKey[1] || firstKey[2] - secondKey[2]
|
|
496
|
+
);
|
|
497
|
+
})
|
|
498
|
+
.map((candidate) => candidate.variable);
|
|
499
|
+
}
|
|
500
|
+
|
|
501
|
+
private cleanupConstraints(list: Constraint[]) {
|
|
502
|
+
let kept = 0;
|
|
503
|
+
for (const constraint of list) if (!constraint.isDead) list[kept++] = constraint;
|
|
504
|
+
list.length = kept;
|
|
505
|
+
}
|
|
506
|
+
|
|
507
|
+
// The coefficient of variable is unit in all of list, or undefined when a variable is real.
|
|
508
|
+
private getUnitCoeff(list: Constraint[], variable: number) {
|
|
509
|
+
let isUnit = true;
|
|
510
|
+
for (const constraint of list)
|
|
511
|
+
for (const [index, other] of constraint.xs.entries()) {
|
|
512
|
+
if (!this.isInts[other]) return undefined;
|
|
513
|
+
if (other === variable) {
|
|
514
|
+
const coeff = constraint.as[index];
|
|
515
|
+
if (!coeff.equals(Rational.one) && !coeff.equals(Rational.minusOne)) isUnit = false;
|
|
516
|
+
}
|
|
517
|
+
}
|
|
518
|
+
return isUnit;
|
|
519
|
+
}
|
|
520
|
+
|
|
521
|
+
private canEliminate(variable: number) {
|
|
522
|
+
if (!this.isInts[variable]) return true;
|
|
523
|
+
const isLowerUnit = this.getUnitCoeff(this.lowers[variable], variable);
|
|
524
|
+
if (isLowerUnit === undefined) return false;
|
|
525
|
+
const isUpperUnit = this.getUnitCoeff(this.uppers[variable], variable);
|
|
526
|
+
return isUpperUnit !== undefined && (isLowerUnit || isUpperUnit);
|
|
527
|
+
}
|
|
528
|
+
|
|
529
|
+
private markConstraintsDead(variable: number) {
|
|
530
|
+
const clauses = new RefVector(this.manager);
|
|
531
|
+
for (const constraint of [...this.lowers[variable], ...this.uppers[variable]])
|
|
532
|
+
clauses.push(this.toExpr(constraint));
|
|
533
|
+
const decl = this.manager.decls[this.var2expr.items[variable]];
|
|
534
|
+
this.manager.incDeclRef(decl);
|
|
535
|
+
this.converter.push({ decl, clauses });
|
|
536
|
+
for (const constraint of this.lowers[variable]) constraint.isDead = true;
|
|
537
|
+
for (const constraint of this.uppers[variable]) constraint.isDead = true;
|
|
538
|
+
}
|
|
539
|
+
|
|
540
|
+
private getCoeff(constraint: Constraint, variable: number) {
|
|
541
|
+
return constraint.as[constraint.xs.indexOf(variable)];
|
|
542
|
+
}
|
|
543
|
+
|
|
544
|
+
private resolve(lower: Constraint, upper: Constraint, variable: number) {
|
|
545
|
+
this.counter += lower.xs.length + upper.xs.length + lower.lits.length + upper.lits.length;
|
|
546
|
+
const a = this.getCoeff(lower, variable).neg();
|
|
547
|
+
const b = this.getCoeff(upper, variable);
|
|
548
|
+
let newXs: number[] = [];
|
|
549
|
+
let newAs: Rational[] = [];
|
|
550
|
+
let newC = lower.c.mul(b).add(upper.c.mul(a));
|
|
551
|
+
let isNewStrict = lower.isStrict || upper.isStrict;
|
|
552
|
+
for (const [index, other] of lower.xs.entries()) {
|
|
553
|
+
if (other === variable) continue;
|
|
554
|
+
this.var2pos[other] = newXs.length;
|
|
555
|
+
newXs.push(other);
|
|
556
|
+
newAs.push(lower.as[index].mul(b));
|
|
557
|
+
}
|
|
558
|
+
for (const [index, other] of upper.xs.entries()) {
|
|
559
|
+
if (other === variable) continue;
|
|
560
|
+
const pos = this.var2pos[other];
|
|
561
|
+
if (pos === UINT_MAX) {
|
|
562
|
+
newXs.push(other);
|
|
563
|
+
newAs.push(upper.as[index].mul(a));
|
|
564
|
+
} else newAs[pos] = newAs[pos].add(upper.as[index].mul(a));
|
|
565
|
+
}
|
|
566
|
+
let isAllInt = true;
|
|
567
|
+
const kept = newAs.map((coeff) => !coeff.isZero());
|
|
568
|
+
newXs = newXs.filter((_other, index) => kept[index]);
|
|
569
|
+
newAs = newAs.filter((_coeff, index) => kept[index]);
|
|
570
|
+
for (const other of newXs) if (!this.isInts[other]) isAllInt = false;
|
|
571
|
+
if (isAllInt && isNewStrict) {
|
|
572
|
+
isNewStrict = false;
|
|
573
|
+
newC = newC.sub(Rational.one);
|
|
574
|
+
}
|
|
575
|
+
for (const other of lower.xs) this.var2pos[other] = UINT_MAX;
|
|
576
|
+
if (newXs.length === 0 && (newC.isPositive() || (!isNewStrict && newC.isZero())))
|
|
577
|
+
return undefined;
|
|
578
|
+
const newLits: number[] = [];
|
|
579
|
+
for (const lit of lower.lits) {
|
|
580
|
+
this.bvar2sign[Math.abs(lit)] = lit < 0 ? -1 : 1;
|
|
581
|
+
newLits.push(lit);
|
|
582
|
+
}
|
|
583
|
+
let isTautology = false;
|
|
584
|
+
for (const lit of upper.lits) {
|
|
585
|
+
const sign = this.bvar2sign[Math.abs(lit)];
|
|
586
|
+
if (sign === 0) newLits.push(lit);
|
|
587
|
+
else if ((sign === -1 && lit > 0) || (sign === 1 && lit < 0)) {
|
|
588
|
+
isTautology = true;
|
|
589
|
+
break;
|
|
590
|
+
}
|
|
591
|
+
}
|
|
592
|
+
for (const lit of lower.lits) this.bvar2sign[Math.abs(lit)] = 0;
|
|
593
|
+
if (isTautology) return undefined;
|
|
594
|
+
const newDependency = joinDependencies(lower.dependency, upper.dependency);
|
|
595
|
+
if (
|
|
596
|
+
newLits.length === 0 &&
|
|
597
|
+
newXs.length === 0 &&
|
|
598
|
+
(newC.isNegative() || (isNewStrict && newC.isZero()))
|
|
599
|
+
) {
|
|
600
|
+
this.isInconsistent = true;
|
|
601
|
+
this.inconsistentCore = newDependency;
|
|
602
|
+
return undefined;
|
|
603
|
+
}
|
|
604
|
+
return this.mkConstraint(newLits, newXs, newAs, newC, isNewStrict, newDependency);
|
|
605
|
+
}
|
|
606
|
+
|
|
607
|
+
private tryEliminate(variable: number) {
|
|
608
|
+
const lowers = this.lowers[variable];
|
|
609
|
+
const uppers = this.uppers[variable];
|
|
610
|
+
this.cleanupConstraints(lowers);
|
|
611
|
+
this.cleanupConstraints(uppers);
|
|
612
|
+
if (lowers.length === 0 || uppers.length === 0) {
|
|
613
|
+
this.markConstraintsDead(variable);
|
|
614
|
+
return true;
|
|
615
|
+
}
|
|
616
|
+
const numLowers = lowers.length;
|
|
617
|
+
const numUppers = uppers.length;
|
|
618
|
+
if (numLowers > this.options.cutoff1 && numUppers > this.options.cutoff1) return false;
|
|
619
|
+
if (numLowers * numUppers > this.options.cutoff2) return false;
|
|
620
|
+
if (!this.canEliminate(variable)) return false;
|
|
621
|
+
this.counter += numLowers * numUppers;
|
|
622
|
+
const limit = numLowers + numUppers + this.options.extra;
|
|
623
|
+
const newConstraints: Constraint[] = [];
|
|
624
|
+
for (const lower of lowers)
|
|
625
|
+
for (const upper of uppers) {
|
|
626
|
+
if (this.isInconsistent || newConstraints.length > limit) {
|
|
627
|
+
for (const constraint of newConstraints) this.delConstraint(constraint);
|
|
628
|
+
return false;
|
|
629
|
+
}
|
|
630
|
+
const resolved = this.resolve(lower, upper, variable);
|
|
631
|
+
if (resolved !== undefined) newConstraints.push(resolved);
|
|
632
|
+
}
|
|
633
|
+
this.markConstraintsDead(variable);
|
|
634
|
+
this.counter += newConstraints.length;
|
|
635
|
+
for (const constraint of newConstraints) {
|
|
636
|
+
this.backwardSubsumption(constraint);
|
|
637
|
+
this.registerConstraint(constraint);
|
|
638
|
+
}
|
|
639
|
+
return true;
|
|
640
|
+
}
|
|
641
|
+
|
|
642
|
+
private copyRemaining(lists: Constraint[][]) {
|
|
643
|
+
for (const list of lists)
|
|
644
|
+
for (const constraint of list) {
|
|
645
|
+
if (constraint.isDead) continue;
|
|
646
|
+
constraint.isDead = true;
|
|
647
|
+
this.goal.assert(this.toExpr(constraint), constraint.dependency);
|
|
648
|
+
}
|
|
649
|
+
}
|
|
650
|
+
|
|
651
|
+
run() {
|
|
652
|
+
const manager = this.manager;
|
|
653
|
+
const goal = this.goal;
|
|
654
|
+
this.initForbiddenSet();
|
|
655
|
+
const forms = new RefVector(manager);
|
|
656
|
+
for (const form of goal.forms.items) forms.push(form);
|
|
657
|
+
const dependencies = goal.dependencies;
|
|
658
|
+
goal.reset();
|
|
659
|
+
goal.depth++;
|
|
660
|
+
for (const [index, form] of forms.items.entries()) {
|
|
661
|
+
if (this.isInconsistent) break;
|
|
662
|
+
if (this.isOcc(form)) this.addConstraint(form, dependencies[index]);
|
|
663
|
+
else goal.assert(form, dependencies[index]);
|
|
664
|
+
}
|
|
665
|
+
forms.reset();
|
|
666
|
+
if (this.isInconsistent) {
|
|
667
|
+
goal.reset();
|
|
668
|
+
goal.assert(manager.falseExpr, this.inconsistentCore);
|
|
669
|
+
return false;
|
|
670
|
+
}
|
|
671
|
+
this.subsume();
|
|
672
|
+
for (const variable of this.sortCandidates()) {
|
|
673
|
+
if (!manager.limit.inc()) throw new SmtCanceledError();
|
|
674
|
+
if (this.counter > this.options.limit) break;
|
|
675
|
+
this.counter++;
|
|
676
|
+
this.tryEliminate(variable);
|
|
677
|
+
if (this.isInconsistent) {
|
|
678
|
+
goal.reset();
|
|
679
|
+
goal.assert(manager.falseExpr, this.inconsistentCore);
|
|
680
|
+
return false;
|
|
681
|
+
}
|
|
682
|
+
}
|
|
683
|
+
this.copyRemaining(this.uppers);
|
|
684
|
+
this.copyRemaining(this.lowers);
|
|
685
|
+
return true;
|
|
686
|
+
}
|
|
687
|
+
|
|
688
|
+
release() {
|
|
689
|
+
this.bvar2expr.reset();
|
|
690
|
+
this.var2expr.reset();
|
|
691
|
+
}
|
|
692
|
+
}
|
|
693
|
+
|
|
694
|
+
interface Bound {
|
|
695
|
+
value: Rational;
|
|
696
|
+
expr: number;
|
|
697
|
+
}
|
|
698
|
+
|
|
699
|
+
const LOWER = 1;
|
|
700
|
+
const UPPER = 2;
|
|
701
|
+
|
|
702
|
+
class FmModelConverter {
|
|
703
|
+
constructor(
|
|
704
|
+
private manager: AstManager,
|
|
705
|
+
private entries: { decl: number; clauses: RefVector }[],
|
|
706
|
+
) {}
|
|
707
|
+
|
|
708
|
+
private evaluate(model: ProtoModel, expr: number) {
|
|
709
|
+
const value = model.eval(expr, true);
|
|
710
|
+
this.manager.releaseLater(value);
|
|
711
|
+
return value;
|
|
712
|
+
}
|
|
713
|
+
|
|
714
|
+
private process(
|
|
715
|
+
model: ProtoModel,
|
|
716
|
+
decl: number,
|
|
717
|
+
clause: number,
|
|
718
|
+
): { kind: number; bound: Bound } | undefined {
|
|
719
|
+
const manager = this.manager;
|
|
720
|
+
const isInt = manager.funcDecls[decl].range === SORT_INT;
|
|
721
|
+
const lits = manager.getOp(clause) === OP_OR ? manager.getArgs(clause) : [clause];
|
|
722
|
+
let result: { kind: number; bound: Bound } | undefined;
|
|
723
|
+
for (const lit of lits) {
|
|
724
|
+
if (
|
|
725
|
+
manager.isUninterpretedConst(lit) ||
|
|
726
|
+
(manager.isNot(lit) && manager.isUninterpretedConst(manager.getArg(lit, 0)))
|
|
727
|
+
) {
|
|
728
|
+
if (manager.isTrue(this.evaluate(model, lit))) return undefined;
|
|
729
|
+
continue;
|
|
730
|
+
}
|
|
731
|
+
let isNegated = manager.isNot(lit);
|
|
732
|
+
const atom = isNegated ? manager.getArg(lit, 0) : lit;
|
|
733
|
+
const isStrict = isNegated;
|
|
734
|
+
if (manager.getOp(atom) === OP_GE) isNegated = !isNegated;
|
|
735
|
+
const [lhs, rhs] = manager.getArgs(atom);
|
|
736
|
+
if (!manager.isNumeral(rhs)) return undefined;
|
|
737
|
+
let c = manager.getRationalValue(rhs);
|
|
738
|
+
if (isNegated) c = c.neg();
|
|
739
|
+
let cExpr = -1;
|
|
740
|
+
let coeff = Rational.zero;
|
|
741
|
+
const monomials = manager.getOp(lhs) === OP_ADD ? manager.getArgs(lhs) : [lhs];
|
|
742
|
+
for (const monomial of monomials) {
|
|
743
|
+
const mulArgs =
|
|
744
|
+
manager.getOp(monomial) === OP_MUL && manager.getNumArgs(monomial) === 2
|
|
745
|
+
? manager.getArgs(monomial)
|
|
746
|
+
: undefined;
|
|
747
|
+
if (mulArgs !== undefined && !manager.isNumeral(mulArgs[0])) return undefined;
|
|
748
|
+
const factor = mulArgs === undefined ? Rational.one : manager.getRationalValue(mulArgs[0]);
|
|
749
|
+
const inner = mulArgs === undefined ? monomial : mulArgs[1];
|
|
750
|
+
const variable = manager.getOp(inner) === OP_TO_REAL ? manager.getArg(inner, 0) : inner;
|
|
751
|
+
if (!manager.isUninterpretedConst(variable)) return undefined;
|
|
752
|
+
if (manager.decls[variable] === decl) {
|
|
753
|
+
coeff = isNegated ? factor.neg() : factor;
|
|
754
|
+
continue;
|
|
755
|
+
}
|
|
756
|
+
const value = this.evaluate(model, monomial);
|
|
757
|
+
if (manager.isNumeral(value)) {
|
|
758
|
+
const numeral = manager.getRationalValue(value);
|
|
759
|
+
c = c.sub(isNegated ? numeral.neg() : numeral);
|
|
760
|
+
continue;
|
|
761
|
+
}
|
|
762
|
+
const term = isNegated ? manager.mkApp(OP_UMINUS, [value], manager.sorts[value]) : value;
|
|
763
|
+
cExpr =
|
|
764
|
+
cExpr === -1
|
|
765
|
+
? manager.mkApp(OP_UMINUS, [term], manager.sorts[term])
|
|
766
|
+
: manager.mkApp(OP_SUB, [cExpr, term], manager.sorts[term]);
|
|
767
|
+
}
|
|
768
|
+
if (isInt && isStrict) c = c.sub(Rational.one);
|
|
769
|
+
const kind = coeff.isNegative() ? LOWER : UPPER;
|
|
770
|
+
c = c.div(coeff);
|
|
771
|
+
if (cExpr !== -1)
|
|
772
|
+
cExpr = manager.mkApp(
|
|
773
|
+
OP_DIV,
|
|
774
|
+
[cExpr, manager.mkNumeralOfSort(coeff, SORT_REAL)],
|
|
775
|
+
SORT_REAL,
|
|
776
|
+
);
|
|
777
|
+
if (isInt) c = kind === LOWER ? c.ceil() : c.floor();
|
|
778
|
+
result = { kind, bound: { value: c, expr: cExpr } };
|
|
779
|
+
}
|
|
780
|
+
return result;
|
|
781
|
+
}
|
|
782
|
+
|
|
783
|
+
convert(model: ProtoModel) {
|
|
784
|
+
const manager = this.manager;
|
|
785
|
+
const mkIte = (isMax: boolean, first: number, second: number) => {
|
|
786
|
+
const condition = manager.mkApp(OP_GE, [first, second], SORT_BOOL);
|
|
787
|
+
return manager.mkApp(
|
|
788
|
+
OP_ITE,
|
|
789
|
+
isMax ? [condition, first, second] : [condition, second, first],
|
|
790
|
+
manager.sorts[first],
|
|
791
|
+
);
|
|
792
|
+
};
|
|
793
|
+
const outer = manager.beginTemporaries();
|
|
794
|
+
for (let index = this.entries.length - 1; index >= 0; index--) {
|
|
795
|
+
const entry = this.entries[index];
|
|
796
|
+
const decl = entry.decl;
|
|
797
|
+
let lower: Rational | undefined;
|
|
798
|
+
let upper: Rational | undefined;
|
|
799
|
+
let lowerExpr = -1;
|
|
800
|
+
let upperExpr = -1;
|
|
801
|
+
for (const clause of entry.clauses.items) {
|
|
802
|
+
if (!manager.limit.inc()) throw new SmtTacticError("canceled");
|
|
803
|
+
const processed = this.process(model, decl, clause);
|
|
804
|
+
if (processed === undefined) continue;
|
|
805
|
+
const bound = processed.bound;
|
|
806
|
+
if (processed.kind === LOWER) {
|
|
807
|
+
if (bound.expr !== -1)
|
|
808
|
+
lowerExpr = lowerExpr === -1 ? bound.expr : mkIte(true, lowerExpr, bound.expr);
|
|
809
|
+
else if (lower === undefined || bound.value.compare(lower) > 0) lower = bound.value;
|
|
810
|
+
} else if (bound.expr !== -1)
|
|
811
|
+
upperExpr = upperExpr === -1 ? bound.expr : mkIte(false, upperExpr, bound.expr);
|
|
812
|
+
else if (upper === undefined || bound.value.compare(upper) < 0) upper = bound.value;
|
|
813
|
+
}
|
|
814
|
+
const value =
|
|
815
|
+
manager.funcDecls[decl].range === SORT_INT
|
|
816
|
+
? this.getIntValue(lower, upper, lowerExpr, upperExpr, mkIte)
|
|
817
|
+
: this.getRealValue(lower, upper, lowerExpr, upperExpr, mkIte);
|
|
818
|
+
model.registerConst(decl, value);
|
|
819
|
+
}
|
|
820
|
+
manager.endTemporaries(outer);
|
|
821
|
+
return model;
|
|
822
|
+
}
|
|
823
|
+
|
|
824
|
+
private getIntValue(
|
|
825
|
+
lower: Rational | undefined,
|
|
826
|
+
upper: Rational | undefined,
|
|
827
|
+
lowerExpr: number,
|
|
828
|
+
upperExpr: number,
|
|
829
|
+
mkIte: (isMax: boolean, first: number, second: number) => number,
|
|
830
|
+
) {
|
|
831
|
+
const manager = this.manager;
|
|
832
|
+
if (lowerExpr !== -1)
|
|
833
|
+
return lower === undefined
|
|
834
|
+
? lowerExpr
|
|
835
|
+
: mkIte(true, lowerExpr, manager.mkNumeralOfSort(lower, SORT_INT));
|
|
836
|
+
if (upperExpr !== -1)
|
|
837
|
+
return upper === undefined
|
|
838
|
+
? upperExpr
|
|
839
|
+
: mkIte(false, upperExpr, manager.mkNumeralOfSort(upper, SORT_INT));
|
|
840
|
+
return manager.mkNumeralOfSort(lower ?? upper ?? Rational.zero, SORT_INT);
|
|
841
|
+
}
|
|
842
|
+
|
|
843
|
+
private getRealValue(
|
|
844
|
+
lower: Rational | undefined,
|
|
845
|
+
upper: Rational | undefined,
|
|
846
|
+
inputLowerExpr: number,
|
|
847
|
+
inputUpperExpr: number,
|
|
848
|
+
mkIte: (isMax: boolean, first: number, second: number) => number,
|
|
849
|
+
) {
|
|
850
|
+
const manager = this.manager;
|
|
851
|
+
const real = (value: Rational) => manager.mkNumeralOfSort(value, SORT_REAL);
|
|
852
|
+
const lowerExpr =
|
|
853
|
+
inputLowerExpr !== -1 && lower !== undefined
|
|
854
|
+
? mkIte(true, inputLowerExpr, real(lower))
|
|
855
|
+
: inputLowerExpr;
|
|
856
|
+
const upperExpr =
|
|
857
|
+
inputUpperExpr !== -1 && upper !== undefined
|
|
858
|
+
? mkIte(false, inputUpperExpr, real(upper))
|
|
859
|
+
: inputUpperExpr;
|
|
860
|
+
const two = Rational.of(2n);
|
|
861
|
+
if (lowerExpr !== -1 && upperExpr !== -1)
|
|
862
|
+
return manager.mkApp(
|
|
863
|
+
OP_DIV,
|
|
864
|
+
[manager.mkApp(OP_ADD, [lowerExpr, upperExpr], SORT_REAL), real(two)],
|
|
865
|
+
SORT_REAL,
|
|
866
|
+
);
|
|
867
|
+
if (lowerExpr !== -1) return manager.mkApp(OP_ADD, [lowerExpr, real(Rational.one)], SORT_REAL);
|
|
868
|
+
if (upperExpr !== -1) return manager.mkApp(OP_SUB, [upperExpr, real(Rational.one)], SORT_REAL);
|
|
869
|
+
if (lower !== undefined && upper !== undefined) return real(upper.add(lower).div(two));
|
|
870
|
+
if (lower !== undefined) return real(lower.add(Rational.one));
|
|
871
|
+
if (upper !== undefined) return real(upper.sub(Rational.one));
|
|
872
|
+
return real(Rational.zero);
|
|
873
|
+
}
|
|
874
|
+
}
|
|
875
|
+
|
|
876
|
+
export const fm = (manager: AstManager, goal: Goal, options: FmOptions) => {
|
|
877
|
+
if (goal.isProofsEnabled) throw new SmtTacticError("fm does not support proof production");
|
|
878
|
+
const eliminator = new Fm(manager, goal, options);
|
|
879
|
+
const isConsistent = eliminator.run();
|
|
880
|
+
eliminator.release();
|
|
881
|
+
if (!isConsistent) return;
|
|
882
|
+
const converter = new FmModelConverter(manager, eliminator.converter);
|
|
883
|
+
goal.addModelConversion((model) => converter.convert(model));
|
|
884
|
+
};
|