tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- 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 -16
- 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 +615 -53
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- 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 +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- 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 +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -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 +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- 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 +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 -21
- 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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -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 +308 -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 +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +43 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -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 +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -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 +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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,929 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_AND,
|
|
9
|
+
OP_BADD,
|
|
10
|
+
OP_BMUL,
|
|
11
|
+
OP_BSUB,
|
|
12
|
+
OP_DIV,
|
|
13
|
+
OP_EQ,
|
|
14
|
+
OP_GE,
|
|
15
|
+
OP_IMPLIES,
|
|
16
|
+
OP_ITE,
|
|
17
|
+
OP_LE,
|
|
18
|
+
OP_MOD,
|
|
19
|
+
OP_MUL,
|
|
20
|
+
OP_OR,
|
|
21
|
+
OP_SELECT,
|
|
22
|
+
OP_SUB,
|
|
23
|
+
OP_TO_REAL,
|
|
24
|
+
OP_UMINUS,
|
|
25
|
+
SORT_BOOL,
|
|
26
|
+
SORT_INT,
|
|
27
|
+
SORT_REAL,
|
|
28
|
+
QUANTIFIER_FORALL,
|
|
29
|
+
} from "./ast";
|
|
30
|
+
import { BoundManager } from "./bound-manager";
|
|
31
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
32
|
+
import type { Definition, Goal } from "./goal";
|
|
33
|
+
import { ObjMap } from "./hashtable";
|
|
34
|
+
import { Rational } from "./rational";
|
|
35
|
+
import { getSubterms } from "./recfun-decl-plugin";
|
|
36
|
+
import { RefVector } from "./ref-vector";
|
|
37
|
+
import { Rewriter, type RewriterOptions } from "./rewriter";
|
|
38
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
39
|
+
|
|
40
|
+
export interface SolveEqsOptions {
|
|
41
|
+
isTheorySolver: boolean;
|
|
42
|
+
isIteSolver: boolean;
|
|
43
|
+
isContextSolve: boolean;
|
|
44
|
+
isEliminatingMod: boolean;
|
|
45
|
+
rewriter: RewriterOptions;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
interface DependentEq {
|
|
49
|
+
orig: number;
|
|
50
|
+
variable: number;
|
|
51
|
+
term: number;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
interface Signed {
|
|
55
|
+
isNegated: boolean;
|
|
56
|
+
expr: number;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
interface NestedItem {
|
|
60
|
+
isNegated: boolean;
|
|
61
|
+
depth: number;
|
|
62
|
+
expr: number;
|
|
63
|
+
parent: number;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
export class SubstReplacer extends RewriterTpl {
|
|
67
|
+
constructor(
|
|
68
|
+
manager: AstManager,
|
|
69
|
+
private substitution: ObjMap<number>,
|
|
70
|
+
) {
|
|
71
|
+
super(manager);
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
getSubst(expr: number) {
|
|
75
|
+
return this.substitution.get(expr);
|
|
76
|
+
}
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
const getModInverse = (value: bigint, modulus: bigint) => {
|
|
80
|
+
let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
|
|
81
|
+
let [oldCoefficient, coefficient] = [1n, 0n];
|
|
82
|
+
while (remainder !== 0n) {
|
|
83
|
+
const quotient = oldRemainder / remainder;
|
|
84
|
+
[oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
|
|
85
|
+
[oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
|
|
86
|
+
}
|
|
87
|
+
return ((oldCoefficient % modulus) + modulus) % modulus;
|
|
88
|
+
};
|
|
89
|
+
|
|
90
|
+
export class SolveEqs {
|
|
91
|
+
private pinned: RefVector;
|
|
92
|
+
private eqTerms: RefVector;
|
|
93
|
+
private nonzero = new Set<number>();
|
|
94
|
+
private bounds: BoundManager;
|
|
95
|
+
private isAllowingBool = true;
|
|
96
|
+
private var2id = new Map<number, number>();
|
|
97
|
+
private id2var: number[] = [];
|
|
98
|
+
private next: DependentEq[][] = [];
|
|
99
|
+
private id2level: number[] = [];
|
|
100
|
+
private substIds: number[] = [];
|
|
101
|
+
private substitution: ObjMap<number>;
|
|
102
|
+
private definitions: Definition[] = [];
|
|
103
|
+
private containsV = new Set<number>();
|
|
104
|
+
private unsafeVars = new Set<number>();
|
|
105
|
+
private andPositive = new Set<number>();
|
|
106
|
+
private andNegative = new Set<number>();
|
|
107
|
+
private orPositive = new Set<number>();
|
|
108
|
+
private orNegative = new Set<number>();
|
|
109
|
+
private rewriter: Rewriter;
|
|
110
|
+
|
|
111
|
+
constructor(
|
|
112
|
+
private manager: AstManager,
|
|
113
|
+
private goal: Goal,
|
|
114
|
+
private options: SolveEqsOptions,
|
|
115
|
+
) {
|
|
116
|
+
this.pinned = new RefVector(manager);
|
|
117
|
+
this.eqTerms = new RefVector(manager);
|
|
118
|
+
this.bounds = new BoundManager(manager);
|
|
119
|
+
this.substitution = new ObjMap((expr) => manager.hashes[expr]);
|
|
120
|
+
this.rewriter = new Rewriter(manager, options.rewriter);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private pin(expr: number) {
|
|
124
|
+
this.eqTerms.push(expr);
|
|
125
|
+
return expr;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
private mkApp(op: number, args: number[], sort: number) {
|
|
129
|
+
return this.pin(this.manager.mkApp(op, args, sort));
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
private mkMul(args: number[], sort: number) {
|
|
133
|
+
return args.length === 1 ? args[0] : this.mkApp(OP_MUL, args, sort);
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
private push(eqs: DependentEq[], orig: number, variable: number, term: number) {
|
|
137
|
+
this.eqTerms.push(term);
|
|
138
|
+
eqs.push({ orig, variable, term });
|
|
139
|
+
}
|
|
140
|
+
|
|
141
|
+
private isConst(expr: number) {
|
|
142
|
+
return this.manager.kinds[expr] === KIND_APP && this.manager.isUninterpretedConst(expr);
|
|
143
|
+
}
|
|
144
|
+
|
|
145
|
+
private isEqOf(first: number, second: number) {
|
|
146
|
+
const manager = this.manager;
|
|
147
|
+
if (manager.getOp(first) !== OP_EQ || manager.getOp(second) !== OP_EQ) return undefined;
|
|
148
|
+
const [x1, x2] = manager.getArgs(first);
|
|
149
|
+
const [y1, y2] = manager.getArgs(second);
|
|
150
|
+
if (x1 === y1) return { variable: x1, thenExpr: x2, elseExpr: y2 };
|
|
151
|
+
if (x1 === y2) return { variable: x1, thenExpr: x2, elseExpr: y1 };
|
|
152
|
+
if (x2 === y1) return { variable: x2, thenExpr: x1, elseExpr: y2 };
|
|
153
|
+
return undefined;
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
private isComplementary(first: number, second: number) {
|
|
157
|
+
const manager = this.manager;
|
|
158
|
+
return (
|
|
159
|
+
(manager.isNot(first) && manager.getArg(first, 0) === second) ||
|
|
160
|
+
(manager.isNot(second) && manager.getArg(second, 0) === first)
|
|
161
|
+
);
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
private getBasicEqs(form: number, eqs: DependentEq[]) {
|
|
165
|
+
const manager = this.manager;
|
|
166
|
+
const op = manager.getOp(form);
|
|
167
|
+
if (op === OP_EQ) {
|
|
168
|
+
const [left, right] = manager.getArgs(form);
|
|
169
|
+
if (left === right) return;
|
|
170
|
+
if (!this.isAllowingBool && manager.sorts[left] === SORT_BOOL) return;
|
|
171
|
+
if (this.isConst(left)) this.push(eqs, form, left, right);
|
|
172
|
+
if (this.isConst(right)) this.push(eqs, form, right, left);
|
|
173
|
+
}
|
|
174
|
+
if (this.isAllowingBool) {
|
|
175
|
+
if (this.isConst(form)) this.push(eqs, form, form, manager.trueExpr);
|
|
176
|
+
if (manager.isNot(form) && this.isConst(manager.getArg(form, 0)))
|
|
177
|
+
this.push(eqs, form, manager.getArg(form, 0), manager.falseExpr);
|
|
178
|
+
}
|
|
179
|
+
if (this.goal.isProofsEnabled) return;
|
|
180
|
+
if (this.options.isIteSolver && op === OP_ITE) {
|
|
181
|
+
const [condition, thenExpr, elseExpr] = manager.getArgs(form);
|
|
182
|
+
if (manager.getOp(thenExpr) === OP_EQ && manager.getOp(elseExpr) === OP_EQ) {
|
|
183
|
+
let [x1, y1] = manager.getArgs(thenExpr);
|
|
184
|
+
let [x2, y2] = manager.getArgs(elseExpr);
|
|
185
|
+
if (!this.isAllowingBool && manager.sorts[x1] === SORT_BOOL) return;
|
|
186
|
+
if (x1 === y2 && this.isConst(x1)) [x2, y2] = [y2, x2];
|
|
187
|
+
if (x2 === y2 && this.isConst(x2)) {
|
|
188
|
+
[x2, y2] = [y2, x2];
|
|
189
|
+
[x1, y1] = [y1, x1];
|
|
190
|
+
}
|
|
191
|
+
if (x2 === y1 && this.isConst(x2)) [x1, y1] = [y1, x1];
|
|
192
|
+
if (x1 === x2 && this.isConst(x1))
|
|
193
|
+
this.push(eqs, form, x1, manager.mkApp(OP_ITE, [condition, y1, y2], manager.sorts[y1]));
|
|
194
|
+
}
|
|
195
|
+
}
|
|
196
|
+
const isBinary = (expr: number, binaryOp: number) =>
|
|
197
|
+
manager.getOp(expr) === binaryOp && manager.getNumArgs(expr) === 2;
|
|
198
|
+
const outer = op === OP_OR ? OP_AND : op === OP_AND ? OP_OR : -1;
|
|
199
|
+
if (outer === -1 || !isBinary(form, op)) return;
|
|
200
|
+
const [first, second] = manager.getArgs(form);
|
|
201
|
+
if (!isBinary(first, outer) || !isBinary(second, outer)) return;
|
|
202
|
+
const [x1, x2] = manager.getArgs(first);
|
|
203
|
+
const [y1, y2] = manager.getArgs(second);
|
|
204
|
+
const cases: [number, number, number, number, number][] =
|
|
205
|
+
op === OP_OR
|
|
206
|
+
? [
|
|
207
|
+
[x1, y1, x2, y2, x2],
|
|
208
|
+
[x1, y2, x2, y1, x2],
|
|
209
|
+
[x2, y2, x1, y1, x1],
|
|
210
|
+
[x2, y1, x1, y2, x1],
|
|
211
|
+
]
|
|
212
|
+
: [
|
|
213
|
+
[x1, y1, x2, y2, y2],
|
|
214
|
+
[x1, y2, x2, y1, y1],
|
|
215
|
+
[x2, y2, x1, y1, y1],
|
|
216
|
+
[x2, y1, x1, y2, y2],
|
|
217
|
+
];
|
|
218
|
+
for (const [eqFirst, eqSecond, complementFirst, complementSecond, condition] of cases) {
|
|
219
|
+
const found = this.isEqOf(eqFirst, eqSecond);
|
|
220
|
+
if (found !== undefined && this.isComplementary(complementFirst, complementSecond))
|
|
221
|
+
this.push(
|
|
222
|
+
eqs,
|
|
223
|
+
form,
|
|
224
|
+
found.variable,
|
|
225
|
+
manager.mkApp(
|
|
226
|
+
OP_ITE,
|
|
227
|
+
[condition, found.thenExpr, found.elseExpr],
|
|
228
|
+
manager.sorts[found.thenExpr],
|
|
229
|
+
),
|
|
230
|
+
);
|
|
231
|
+
}
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
private mkSubTerm(sum: number, index: number, rhs: number) {
|
|
235
|
+
const manager = this.manager;
|
|
236
|
+
const isBv = manager.isBvSort(manager.sorts[rhs]);
|
|
237
|
+
return manager
|
|
238
|
+
.getArgs(sum)
|
|
239
|
+
.reduce(
|
|
240
|
+
(term, arg, other) =>
|
|
241
|
+
other === index
|
|
242
|
+
? term
|
|
243
|
+
: isBv
|
|
244
|
+
? this.pin(mkBvApp(manager, OP_BSUB, [term, arg]))
|
|
245
|
+
: this.mkApp(OP_SUB, [term, arg], manager.sorts[rhs]),
|
|
246
|
+
rhs,
|
|
247
|
+
);
|
|
248
|
+
}
|
|
249
|
+
|
|
250
|
+
private isNonzeroFactor(expr: number) {
|
|
251
|
+
const manager = this.manager;
|
|
252
|
+
return (
|
|
253
|
+
this.nonzero.has(expr) ||
|
|
254
|
+
(manager.isNumeral(expr) && !manager.getRationalValue(expr).isZero())
|
|
255
|
+
);
|
|
256
|
+
}
|
|
257
|
+
|
|
258
|
+
private solveArithAdd(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
259
|
+
const manager = this.manager;
|
|
260
|
+
if (manager.getOp(x) !== OP_ADD) return;
|
|
261
|
+
for (const [index, arg] of manager.getArgs(x).entries()) {
|
|
262
|
+
if (this.isConst(arg)) {
|
|
263
|
+
this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
|
|
264
|
+
continue;
|
|
265
|
+
}
|
|
266
|
+
const isReal = manager.sorts[arg] === SORT_REAL;
|
|
267
|
+
if (manager.getOp(arg) === OP_MUL && manager.getNumArgs(arg) === 2) {
|
|
268
|
+
const [coefficient, variable] = manager.getArgs(arg);
|
|
269
|
+
if (manager.isNumeral(coefficient) && this.isConst(variable)) {
|
|
270
|
+
const value = manager.getRationalValue(coefficient);
|
|
271
|
+
if (value.equals(Rational.minusOne))
|
|
272
|
+
this.push(
|
|
273
|
+
eqs,
|
|
274
|
+
orig,
|
|
275
|
+
variable,
|
|
276
|
+
this.mkApp(OP_UMINUS, [this.mkSubTerm(x, index, y)], manager.sorts[y]),
|
|
277
|
+
);
|
|
278
|
+
else if (isReal && !value.isZero())
|
|
279
|
+
this.push(
|
|
280
|
+
eqs,
|
|
281
|
+
orig,
|
|
282
|
+
variable,
|
|
283
|
+
this.mkApp(OP_DIV, [this.mkSubTerm(x, index, y), coefficient], SORT_REAL),
|
|
284
|
+
);
|
|
285
|
+
continue;
|
|
286
|
+
}
|
|
287
|
+
}
|
|
288
|
+
if (!isReal || manager.getOp(arg) !== OP_MUL) continue;
|
|
289
|
+
const factors = manager.getArgs(arg);
|
|
290
|
+
for (const [factorIndex, factor] of factors.entries()) {
|
|
291
|
+
if (!this.isConst(factor)) continue;
|
|
292
|
+
if (
|
|
293
|
+
!factors.every(
|
|
294
|
+
(other, otherIndex) => otherIndex === factorIndex || this.isNonzeroFactor(other),
|
|
295
|
+
)
|
|
296
|
+
)
|
|
297
|
+
continue;
|
|
298
|
+
const others = factors.filter((_, otherIndex) => otherIndex !== factorIndex);
|
|
299
|
+
const term = this.mkSubTerm(x, index, y);
|
|
300
|
+
this.push(
|
|
301
|
+
eqs,
|
|
302
|
+
orig,
|
|
303
|
+
factor,
|
|
304
|
+
this.mkApp(OP_DIV, [term, this.mkMul(others, SORT_REAL)], SORT_REAL),
|
|
305
|
+
);
|
|
306
|
+
}
|
|
307
|
+
}
|
|
308
|
+
}
|
|
309
|
+
|
|
310
|
+
private solveArithMod(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
311
|
+
const manager = this.manager;
|
|
312
|
+
if (!this.options.isEliminatingMod || manager.getOp(x) !== OP_MOD) return;
|
|
313
|
+
const [dividend, divisor] = manager.getArgs(x);
|
|
314
|
+
if (!manager.isNumeral(divisor) || !manager.getRationalValue(divisor).isPositive()) return;
|
|
315
|
+
const fresh = this.pin(manager.mkFreshConst("mod", SORT_INT));
|
|
316
|
+
const term = this.mkApp(OP_ADD, [this.mkApp(OP_MUL, [divisor, fresh], SORT_INT), y], SORT_INT);
|
|
317
|
+
if (this.isConst(dividend)) this.push(eqs, orig, dividend, term);
|
|
318
|
+
else this.solveArithEq(orig, dividend, term, eqs);
|
|
319
|
+
}
|
|
320
|
+
|
|
321
|
+
private solveArithMul(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
322
|
+
const manager = this.manager;
|
|
323
|
+
if (manager.getOp(x) !== OP_MUL) return;
|
|
324
|
+
const factors = manager.getArgs(x);
|
|
325
|
+
for (const [index, factor] of factors.entries()) {
|
|
326
|
+
if (!this.isConst(factor) || manager.sorts[factor] !== SORT_REAL) continue;
|
|
327
|
+
if (
|
|
328
|
+
!factors.every((other, otherIndex) => otherIndex === index || this.isNonzeroFactor(other))
|
|
329
|
+
)
|
|
330
|
+
continue;
|
|
331
|
+
const others = factors.filter((_, otherIndex) => otherIndex !== index);
|
|
332
|
+
this.push(
|
|
333
|
+
eqs,
|
|
334
|
+
orig,
|
|
335
|
+
factor,
|
|
336
|
+
this.mkApp(OP_DIV, [y, this.mkMul(others, SORT_REAL)], SORT_REAL),
|
|
337
|
+
);
|
|
338
|
+
}
|
|
339
|
+
}
|
|
340
|
+
|
|
341
|
+
private solveArithToReal(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
342
|
+
const manager = this.manager;
|
|
343
|
+
if (manager.getOp(x) !== OP_TO_REAL || !this.isConst(manager.getArg(x, 0))) return;
|
|
344
|
+
const variable = manager.getArg(x, 0);
|
|
345
|
+
if (manager.getOp(y) === OP_TO_REAL) this.push(eqs, orig, variable, manager.getArg(y, 0));
|
|
346
|
+
else if (manager.isNumeral(y) && manager.getRationalValue(y).isInt())
|
|
347
|
+
this.push(eqs, orig, variable, manager.mkNumeral(manager.getRationalValue(y).num));
|
|
348
|
+
}
|
|
349
|
+
|
|
350
|
+
private solveArithEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
351
|
+
this.solveArithAdd(orig, x, y, eqs);
|
|
352
|
+
this.solveArithMod(orig, x, y, eqs);
|
|
353
|
+
this.solveArithMul(orig, x, y, eqs);
|
|
354
|
+
this.solveArithToReal(orig, x, y, eqs);
|
|
355
|
+
}
|
|
356
|
+
|
|
357
|
+
private getArithEqs(form: number, eqs: DependentEq[]) {
|
|
358
|
+
const manager = this.manager;
|
|
359
|
+
if (!this.options.isTheorySolver) return;
|
|
360
|
+
if (manager.getOp(form) === OP_EQ) {
|
|
361
|
+
const [x, y] = manager.getArgs(form);
|
|
362
|
+
if (manager.sorts[x] === SORT_INT || manager.sorts[x] === SORT_REAL) {
|
|
363
|
+
this.solveArithEq(form, x, y, eqs);
|
|
364
|
+
this.solveArithEq(form, y, x, eqs);
|
|
365
|
+
}
|
|
366
|
+
}
|
|
367
|
+
if (manager.getOp(form) !== OP_LE) return;
|
|
368
|
+
const [x, y] = manager.getArgs(form);
|
|
369
|
+
const lower = this.bounds.lowers.get(x);
|
|
370
|
+
if (
|
|
371
|
+
!manager.isNumeral(y) ||
|
|
372
|
+
lower === undefined ||
|
|
373
|
+
lower.isStrict ||
|
|
374
|
+
!lower.value.equals(manager.getRationalValue(y))
|
|
375
|
+
)
|
|
376
|
+
return;
|
|
377
|
+
if (this.isConst(x)) this.push(eqs, form, x, y);
|
|
378
|
+
else {
|
|
379
|
+
this.solveArithEq(form, x, y, eqs);
|
|
380
|
+
this.solveArithEq(form, y, x, eqs);
|
|
381
|
+
}
|
|
382
|
+
}
|
|
383
|
+
|
|
384
|
+
private getOddCoefficient(expr: number) {
|
|
385
|
+
const manager = this.manager;
|
|
386
|
+
if (manager.getOp(expr) !== OP_BMUL || manager.getNumArgs(expr) !== 2) return undefined;
|
|
387
|
+
const [coefficient, variable] = manager.getArgs(expr);
|
|
388
|
+
if (!manager.isBvNumeral(coefficient) || !this.isConst(variable)) return undefined;
|
|
389
|
+
const value = manager.getBvNumeralValue(coefficient);
|
|
390
|
+
if (value % 2n === 0n) return undefined;
|
|
391
|
+
const width = manager.getBvSize(manager.sorts[variable]);
|
|
392
|
+
return {
|
|
393
|
+
variable,
|
|
394
|
+
inverse: manager.mkBvNumeral(getModInverse(value, 1n << BigInt(width)), width),
|
|
395
|
+
};
|
|
396
|
+
}
|
|
397
|
+
|
|
398
|
+
private solveBvEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
|
|
399
|
+
const manager = this.manager;
|
|
400
|
+
if (manager.getOp(x) === OP_BADD)
|
|
401
|
+
for (const [index, arg] of manager.getArgs(x).entries()) {
|
|
402
|
+
if (this.isConst(arg)) {
|
|
403
|
+
this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
|
|
404
|
+
continue;
|
|
405
|
+
}
|
|
406
|
+
const odd = this.getOddCoefficient(arg);
|
|
407
|
+
if (odd === undefined) continue;
|
|
408
|
+
const term = this.mkSubTerm(x, index, y);
|
|
409
|
+
this.push(
|
|
410
|
+
eqs,
|
|
411
|
+
orig,
|
|
412
|
+
odd.variable,
|
|
413
|
+
this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), term])),
|
|
414
|
+
);
|
|
415
|
+
}
|
|
416
|
+
const odd = this.getOddCoefficient(x);
|
|
417
|
+
if (odd !== undefined)
|
|
418
|
+
this.push(
|
|
419
|
+
eqs,
|
|
420
|
+
orig,
|
|
421
|
+
odd.variable,
|
|
422
|
+
this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), y])),
|
|
423
|
+
);
|
|
424
|
+
}
|
|
425
|
+
|
|
426
|
+
private getBvEqs(form: number, eqs: DependentEq[]) {
|
|
427
|
+
const manager = this.manager;
|
|
428
|
+
if (manager.getOp(form) !== OP_EQ) return;
|
|
429
|
+
const [x, y] = manager.getArgs(form);
|
|
430
|
+
if (!manager.isBvSort(manager.sorts[x])) return;
|
|
431
|
+
this.solveBvEq(form, x, y, eqs);
|
|
432
|
+
this.solveBvEq(form, y, x, eqs);
|
|
433
|
+
}
|
|
434
|
+
|
|
435
|
+
private hasSubterm(root: number, isMatch: (expr: number) => boolean) {
|
|
436
|
+
const manager = this.manager;
|
|
437
|
+
const visited = new Set<number>();
|
|
438
|
+
const todo = [root];
|
|
439
|
+
while (todo.length > 0) {
|
|
440
|
+
const expr = todo.pop() as number;
|
|
441
|
+
if (visited.has(expr)) continue;
|
|
442
|
+
visited.add(expr);
|
|
443
|
+
if (isMatch(expr)) return true;
|
|
444
|
+
if (manager.kinds[expr] === KIND_APP || manager.kinds[expr] === KIND_QUANTIFIER)
|
|
445
|
+
manager.pushArgs(expr, todo);
|
|
446
|
+
}
|
|
447
|
+
return false;
|
|
448
|
+
}
|
|
449
|
+
|
|
450
|
+
// Array definitions by a universal quantifier need lambdas, which the port does not have.
|
|
451
|
+
private checkArrayEqs(form: number) {
|
|
452
|
+
const manager = this.manager;
|
|
453
|
+
if (
|
|
454
|
+
manager.kinds[form] !== KIND_QUANTIFIER ||
|
|
455
|
+
manager.getQuantifier(form).kind !== QUANTIFIER_FORALL
|
|
456
|
+
)
|
|
457
|
+
return;
|
|
458
|
+
const numVars = manager.getQuantifier(form).sorts.length;
|
|
459
|
+
const body = manager.getQuantifier(form).body;
|
|
460
|
+
const [guard, eq] =
|
|
461
|
+
manager.getOp(body) === OP_IMPLIES
|
|
462
|
+
? manager.getArgs(body)
|
|
463
|
+
: manager.getOp(body) === OP_OR && manager.getNumArgs(body) === 2
|
|
464
|
+
? manager.getOp(manager.getArg(body, 1)) === OP_EQ
|
|
465
|
+
? manager.getArgs(body)
|
|
466
|
+
: manager.getOp(manager.getArg(body, 0)) === OP_EQ
|
|
467
|
+
? manager.getArgs(body).reverse()
|
|
468
|
+
: [-1, -1]
|
|
469
|
+
: [-1, body];
|
|
470
|
+
if (eq === -1 || manager.getOp(eq) !== OP_EQ) return;
|
|
471
|
+
const [lhs, rhs] = manager.getArgs(eq);
|
|
472
|
+
const isGuardedIte =
|
|
473
|
+
guard === -1 &&
|
|
474
|
+
manager.getOp(lhs) === OP_ITE &&
|
|
475
|
+
manager.getOp(rhs) === OP_ITE &&
|
|
476
|
+
manager.getArg(lhs, 0) === manager.getArg(rhs, 0) &&
|
|
477
|
+
manager.getArg(lhs, 2) === manager.getArg(rhs, 2);
|
|
478
|
+
const [condition, left, right] = isGuardedIte
|
|
479
|
+
? [manager.getArg(lhs, 0), manager.getArg(lhs, 1), manager.getArg(rhs, 1)]
|
|
480
|
+
: [guard, lhs, rhs];
|
|
481
|
+
const isSelectOfVars = (expr: number) =>
|
|
482
|
+
manager.getOp(expr) === OP_SELECT &&
|
|
483
|
+
manager.getNumArgs(expr) === numVars + 1 &&
|
|
484
|
+
manager
|
|
485
|
+
.getArgs(expr)
|
|
486
|
+
.slice(1)
|
|
487
|
+
.every(
|
|
488
|
+
(arg, index) =>
|
|
489
|
+
manager.kinds[arg] === KIND_VAR && manager.values[arg] === numVars - index - 1,
|
|
490
|
+
);
|
|
491
|
+
const [select, def] = isSelectOfVars(left)
|
|
492
|
+
? [left, right]
|
|
493
|
+
: isSelectOfVars(right)
|
|
494
|
+
? [right, left]
|
|
495
|
+
: [-1, -1];
|
|
496
|
+
if (select === -1) return;
|
|
497
|
+
const array = manager.getArg(select, 0);
|
|
498
|
+
const isQuantifier = (expr: number) => manager.kinds[expr] === KIND_QUANTIFIER;
|
|
499
|
+
const parts = condition === -1 ? [def] : [def, condition];
|
|
500
|
+
if (
|
|
501
|
+
this.isConst(array) &&
|
|
502
|
+
!parts.some((part) => this.hasSubterm(part, (expr) => expr === array)) &&
|
|
503
|
+
!parts.some((part) => this.hasSubterm(part, isQuantifier))
|
|
504
|
+
)
|
|
505
|
+
throw new SmtUnsupportedError("solving for an array defined by a quantifier");
|
|
506
|
+
}
|
|
507
|
+
|
|
508
|
+
private getEqsOf(form: number, eqs: DependentEq[]) {
|
|
509
|
+
if (!this.goal.isProofsEnabled) this.getArithEqs(form, eqs);
|
|
510
|
+
this.getBasicEqs(form, eqs);
|
|
511
|
+
if (!this.goal.isProofsEnabled) {
|
|
512
|
+
this.getBvEqs(form, eqs);
|
|
513
|
+
this.checkArrayEqs(form);
|
|
514
|
+
}
|
|
515
|
+
}
|
|
516
|
+
|
|
517
|
+
private getEqs() {
|
|
518
|
+
const eqs: DependentEq[] = [];
|
|
519
|
+
const forms = this.goal.forms.items;
|
|
520
|
+
if (!this.goal.isProofsEnabled) for (const form of forms) this.getArithEqs(form, eqs);
|
|
521
|
+
for (const form of forms) this.getBasicEqs(form, eqs);
|
|
522
|
+
if (!this.goal.isProofsEnabled) {
|
|
523
|
+
for (const form of forms) this.getBvEqs(form, eqs);
|
|
524
|
+
for (const form of forms) this.checkArrayEqs(form);
|
|
525
|
+
}
|
|
526
|
+
return eqs;
|
|
527
|
+
}
|
|
528
|
+
|
|
529
|
+
private extractDepGraph(eqs: DependentEq[]) {
|
|
530
|
+
this.var2id.clear();
|
|
531
|
+
this.id2var = [];
|
|
532
|
+
for (const eq of eqs) {
|
|
533
|
+
if (this.var2id.has(eq.variable) || !this.canBeVar(eq.variable)) continue;
|
|
534
|
+
this.var2id.set(eq.variable, this.id2var.length);
|
|
535
|
+
this.id2var.push(eq.variable);
|
|
536
|
+
}
|
|
537
|
+
this.next = this.id2var.map(() => []);
|
|
538
|
+
for (const eq of eqs)
|
|
539
|
+
if (this.canBeVar(eq.variable)) this.next[this.var2id.get(eq.variable) as number].push(eq);
|
|
540
|
+
}
|
|
541
|
+
|
|
542
|
+
private extractSubst() {
|
|
543
|
+
const manager = this.manager;
|
|
544
|
+
const size = this.id2var.length;
|
|
545
|
+
this.id2level = this.id2var.map(() => Infinity);
|
|
546
|
+
this.substIds = [];
|
|
547
|
+
this.substitution = new ObjMap((expr) => manager.hashes[expr]);
|
|
548
|
+
let initLevel = 2 ** 32 - 1;
|
|
549
|
+
const todo: number[] = [];
|
|
550
|
+
for (let id = 0; id < size; id++) {
|
|
551
|
+
if (this.id2level[id] !== Infinity) continue;
|
|
552
|
+
if (initLevel < size + 1) return;
|
|
553
|
+
initLevel -= size + 1;
|
|
554
|
+
let currLevel = initLevel;
|
|
555
|
+
todo.push(id);
|
|
556
|
+
while (todo.length > 0) {
|
|
557
|
+
const next = todo.pop() as number;
|
|
558
|
+
if (this.id2level[next] !== Infinity) continue;
|
|
559
|
+
this.id2level[next] = currLevel++;
|
|
560
|
+
for (const eq of this.next[next]) {
|
|
561
|
+
const todoSize = todo.length;
|
|
562
|
+
let isSafe = true;
|
|
563
|
+
const visited = new Set<number>();
|
|
564
|
+
const stack = [eq.term];
|
|
565
|
+
while (stack.length > 0) {
|
|
566
|
+
const expr = stack.pop() as number;
|
|
567
|
+
if (visited.has(expr)) continue;
|
|
568
|
+
visited.add(expr);
|
|
569
|
+
if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, stack);
|
|
570
|
+
else if (manager.kinds[expr] === KIND_QUANTIFIER)
|
|
571
|
+
stack.push(manager.getQuantifier(expr).body);
|
|
572
|
+
const id = this.var2id.get(expr);
|
|
573
|
+
if (id === undefined) continue;
|
|
574
|
+
if (this.id2level[id] < currLevel) {
|
|
575
|
+
isSafe = false;
|
|
576
|
+
break;
|
|
577
|
+
}
|
|
578
|
+
if (this.id2level[id] === Infinity) todo.push(id);
|
|
579
|
+
}
|
|
580
|
+
if (!isSafe) {
|
|
581
|
+
todo.length = todoSize;
|
|
582
|
+
continue;
|
|
583
|
+
}
|
|
584
|
+
this.next[next][0] = eq;
|
|
585
|
+
this.substIds.push(next);
|
|
586
|
+
break;
|
|
587
|
+
}
|
|
588
|
+
}
|
|
589
|
+
}
|
|
590
|
+
}
|
|
591
|
+
|
|
592
|
+
private normalize() {
|
|
593
|
+
if (this.substIds.length === 0) return;
|
|
594
|
+
const manager = this.manager;
|
|
595
|
+
const replacer = new SubstReplacer(manager, this.substitution);
|
|
596
|
+
this.substIds.sort((first, second) => this.id2level[second] - this.id2level[first]);
|
|
597
|
+
for (const id of this.substIds) {
|
|
598
|
+
manager.limit.checkpoint();
|
|
599
|
+
const eq = this.next[id][0];
|
|
600
|
+
const definition = replacer.rewrite(eq.term);
|
|
601
|
+
this.pinned.pushOwned(definition);
|
|
602
|
+
manager.incRef(eq.variable);
|
|
603
|
+
this.pinned.pushOwned(eq.variable);
|
|
604
|
+
this.substitution.set(eq.variable, definition);
|
|
605
|
+
}
|
|
606
|
+
replacer.release();
|
|
607
|
+
}
|
|
608
|
+
|
|
609
|
+
private applySubst() {
|
|
610
|
+
if (this.substIds.length === 0) return;
|
|
611
|
+
const manager = this.manager;
|
|
612
|
+
const replacer = new SubstReplacer(manager, this.substitution);
|
|
613
|
+
const goal = this.goal;
|
|
614
|
+
const size = goal.forms.size;
|
|
615
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++) {
|
|
616
|
+
const form = goal.forms.items[index];
|
|
617
|
+
const replaced = replacer.rewrite(form);
|
|
618
|
+
const simplified = this.rewriter.rewrite(replaced);
|
|
619
|
+
manager.decRef(replaced);
|
|
620
|
+
if (simplified !== form) goal.update(index, simplified);
|
|
621
|
+
manager.decRef(simplified);
|
|
622
|
+
}
|
|
623
|
+
replacer.release();
|
|
624
|
+
}
|
|
625
|
+
|
|
626
|
+
private saveSubst() {
|
|
627
|
+
for (const [variable, def] of this.substitution.entries())
|
|
628
|
+
this.definitions.push({ decl: this.manager.decls[variable], def });
|
|
629
|
+
}
|
|
630
|
+
|
|
631
|
+
private canBeVar(expr: number) {
|
|
632
|
+
return this.isConst(expr) && !this.unsafeVars.has(expr);
|
|
633
|
+
}
|
|
634
|
+
|
|
635
|
+
// filter_unsafe_vars: the recfun theory unfolds a recursive definition, which a substitution
|
|
636
|
+
// does not reach, so the constants in its body stay.
|
|
637
|
+
private runRound(getEqs: () => DependentEq[]) {
|
|
638
|
+
const manager = this.manager;
|
|
639
|
+
this.unsafeVars = new Set(
|
|
640
|
+
[...manager.recFunDefs.values()]
|
|
641
|
+
.filter((def) => !def.isMacro && def.rhs !== -1)
|
|
642
|
+
.flatMap((def) => getSubterms(manager, def.rhs)),
|
|
643
|
+
);
|
|
644
|
+
this.eqTerms.reset();
|
|
645
|
+
const eqs = getEqs();
|
|
646
|
+
this.extractDepGraph(eqs);
|
|
647
|
+
this.extractSubst();
|
|
648
|
+
this.normalize();
|
|
649
|
+
this.applySubst();
|
|
650
|
+
this.saveSubst();
|
|
651
|
+
}
|
|
652
|
+
|
|
653
|
+
reduce() {
|
|
654
|
+
const goal = this.goal;
|
|
655
|
+
if (!goal.isProofsEnabled && this.options.isTheorySolver)
|
|
656
|
+
for (const form of goal.forms.items) {
|
|
657
|
+
this.markPositive(form);
|
|
658
|
+
this.bounds.add(form);
|
|
659
|
+
}
|
|
660
|
+
for (let count = 0; count < 20; count++) {
|
|
661
|
+
this.runRound(() => this.getEqs());
|
|
662
|
+
if (this.substIds.length === 0) break;
|
|
663
|
+
this.manager.limit.checkpoint();
|
|
664
|
+
}
|
|
665
|
+
if (this.options.isContextSolve && !goal.isProofsEnabled)
|
|
666
|
+
this.runRound(() => this.collectNestedEqualities());
|
|
667
|
+
this.eqTerms.reset();
|
|
668
|
+
goal.elimTrue();
|
|
669
|
+
goal.elimRedundancies();
|
|
670
|
+
goal.depth++;
|
|
671
|
+
if (this.definitions.length > 0) goal.addDefinitions(this.definitions);
|
|
672
|
+
}
|
|
673
|
+
|
|
674
|
+
private markPositive(form: number) {
|
|
675
|
+
const manager = this.manager;
|
|
676
|
+
const isNegated = manager.isNot(form);
|
|
677
|
+
const atom = isNegated ? manager.getArg(form, 0) : form;
|
|
678
|
+
const op = manager.getOp(atom);
|
|
679
|
+
if (op !== OP_LE && op !== OP_GE && op !== OP_EQ) return;
|
|
680
|
+
const [lhs, rhs] = manager.getArgs(atom);
|
|
681
|
+
if (!manager.isNumeral(rhs)) return;
|
|
682
|
+
const value = manager.getRationalValue(rhs);
|
|
683
|
+
const isNonzero = isNegated
|
|
684
|
+
? (op === OP_LE && !value.isNegative()) ||
|
|
685
|
+
(op === OP_GE && !value.isPositive()) ||
|
|
686
|
+
(op === OP_EQ && value.isZero())
|
|
687
|
+
: (op === OP_LE && value.isNegative()) || (op === OP_GE && value.isPositive());
|
|
688
|
+
if (isNonzero) this.nonzero.add(lhs);
|
|
689
|
+
}
|
|
690
|
+
|
|
691
|
+
private markOccurs(roots: number[], variable: number) {
|
|
692
|
+
const manager = this.manager;
|
|
693
|
+
const occurs = this.containsV;
|
|
694
|
+
const visited = new Set<number>([variable]);
|
|
695
|
+
occurs.add(variable);
|
|
696
|
+
const todo = [...roots];
|
|
697
|
+
while (todo.length > 0) {
|
|
698
|
+
const expr = todo[todo.length - 1];
|
|
699
|
+
if (visited.has(expr)) {
|
|
700
|
+
todo.pop();
|
|
701
|
+
continue;
|
|
702
|
+
}
|
|
703
|
+
if (manager.kinds[expr] === KIND_APP) {
|
|
704
|
+
let isOccurring = false;
|
|
705
|
+
let isAllVisited = true;
|
|
706
|
+
for (const arg of manager.getArgs(expr))
|
|
707
|
+
if (!visited.has(arg)) {
|
|
708
|
+
todo.push(arg);
|
|
709
|
+
isAllVisited = false;
|
|
710
|
+
} else if (occurs.has(arg)) isOccurring = true;
|
|
711
|
+
if (isAllVisited) {
|
|
712
|
+
if (isOccurring) occurs.add(expr);
|
|
713
|
+
else occurs.delete(expr);
|
|
714
|
+
visited.add(expr);
|
|
715
|
+
todo.pop();
|
|
716
|
+
}
|
|
717
|
+
} else if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
718
|
+
const body = manager.getQuantifier(expr).body;
|
|
719
|
+
if (visited.has(body)) {
|
|
720
|
+
visited.add(expr);
|
|
721
|
+
if (occurs.has(body)) occurs.add(expr);
|
|
722
|
+
else occurs.delete(expr);
|
|
723
|
+
todo.pop();
|
|
724
|
+
} else todo.push(body);
|
|
725
|
+
} else {
|
|
726
|
+
visited.add(expr);
|
|
727
|
+
todo.pop();
|
|
728
|
+
}
|
|
729
|
+
}
|
|
730
|
+
}
|
|
731
|
+
|
|
732
|
+
private isConjunction(isNegated: boolean, expr: number) {
|
|
733
|
+
const op = this.manager.getOp(expr);
|
|
734
|
+
return (!isNegated && op === OP_AND) || (isNegated && op === OP_OR);
|
|
735
|
+
}
|
|
736
|
+
|
|
737
|
+
private containsConjunctively(form: number, isNegated: boolean, eq: number, conjuncts: Signed[]) {
|
|
738
|
+
const manager = this.manager;
|
|
739
|
+
const todo: Signed[] = [{ isNegated, expr: form }];
|
|
740
|
+
while (todo.length > 0) {
|
|
741
|
+
const item = todo.pop() as Signed;
|
|
742
|
+
if (!item.isNegated && item.expr === eq) return true;
|
|
743
|
+
const marks = item.isNegated ? this.andNegative : this.andPositive;
|
|
744
|
+
if (marks.has(item.expr)) continue;
|
|
745
|
+
marks.add(item.expr);
|
|
746
|
+
if (!this.containsV.has(item.expr)) continue;
|
|
747
|
+
const op = manager.getOp(item.expr);
|
|
748
|
+
if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
|
|
749
|
+
for (const arg of manager.getArgs(item.expr))
|
|
750
|
+
todo.push({ isNegated: item.isNegated, expr: arg });
|
|
751
|
+
else if (manager.isNot(item.expr))
|
|
752
|
+
todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
|
|
753
|
+
else conjuncts.push(item);
|
|
754
|
+
}
|
|
755
|
+
return false;
|
|
756
|
+
}
|
|
757
|
+
|
|
758
|
+
private isDisjunctivelySafe(depth: number, root: number, isNegated: boolean, eq: number) {
|
|
759
|
+
const manager = this.manager;
|
|
760
|
+
const todo: Signed[] = [{ isNegated, expr: root }];
|
|
761
|
+
while (todo.length > 0) {
|
|
762
|
+
const item = todo.pop() as Signed;
|
|
763
|
+
const marks = item.isNegated ? this.orNegative : this.orPositive;
|
|
764
|
+
if (marks.has(item.expr)) continue;
|
|
765
|
+
marks.add(item.expr);
|
|
766
|
+
const op = manager.getOp(item.expr);
|
|
767
|
+
if (!item.isNegated && item.expr === eq) continue;
|
|
768
|
+
if (!this.containsV.has(item.expr)) continue;
|
|
769
|
+
if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
|
|
770
|
+
for (const arg of manager.getArgs(item.expr))
|
|
771
|
+
todo.push({ isNegated: item.isNegated, expr: arg });
|
|
772
|
+
else if (manager.isNot(item.expr))
|
|
773
|
+
todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
|
|
774
|
+
else if (!this.isConjunction(item.isNegated, item.expr)) return false;
|
|
775
|
+
else if (!this.isSafeEqIn(depth + 1, item.expr, item.isNegated, eq)) return false;
|
|
776
|
+
}
|
|
777
|
+
return true;
|
|
778
|
+
}
|
|
779
|
+
|
|
780
|
+
private isSafeEqIn(depth: number, form: number, isNegated: boolean, eq: number): boolean {
|
|
781
|
+
if (!this.containsV.has(form)) return true;
|
|
782
|
+
const conjuncts: Signed[] = [];
|
|
783
|
+
if (this.containsConjunctively(form, isNegated, eq, conjuncts)) return true;
|
|
784
|
+
if (depth > 3) return false;
|
|
785
|
+
return conjuncts.every((conjunct) =>
|
|
786
|
+
this.isDisjunctivelySafe(depth, conjunct.expr, conjunct.isNegated, eq),
|
|
787
|
+
);
|
|
788
|
+
}
|
|
789
|
+
|
|
790
|
+
private isSafeEq(eq: number) {
|
|
791
|
+
this.andPositive.clear();
|
|
792
|
+
this.andNegative.clear();
|
|
793
|
+
this.orPositive.clear();
|
|
794
|
+
this.orNegative.clear();
|
|
795
|
+
return this.goal.forms.items.every((form) => this.isSafeEqIn(0, form, false, eq));
|
|
796
|
+
}
|
|
797
|
+
|
|
798
|
+
private isSafeVar(variable: number, index: number, form: number, todo: NestedItem[]) {
|
|
799
|
+
this.containsV.clear();
|
|
800
|
+
this.markOccurs([form], variable);
|
|
801
|
+
const isParent = (parent: number, child: number) => {
|
|
802
|
+
let current = child;
|
|
803
|
+
while (current !== parent && current !== 0) current = todo[current].parent;
|
|
804
|
+
return current === parent;
|
|
805
|
+
};
|
|
806
|
+
let top = index;
|
|
807
|
+
while (top !== 0) {
|
|
808
|
+
if (todo[top].depth !== todo[index].depth) break;
|
|
809
|
+
top = todo[top].parent;
|
|
810
|
+
}
|
|
811
|
+
return todo.every(
|
|
812
|
+
(item, other) =>
|
|
813
|
+
other === index ||
|
|
814
|
+
!this.containsV.has(item.expr) ||
|
|
815
|
+
isParent(other, index) ||
|
|
816
|
+
isParent(top, other),
|
|
817
|
+
);
|
|
818
|
+
}
|
|
819
|
+
|
|
820
|
+
private collectNestedIn(form: number, visited: Set<number>, eqs: DependentEq[]) {
|
|
821
|
+
const manager = this.manager;
|
|
822
|
+
const todo: NestedItem[] = [{ isNegated: false, depth: 0, expr: form, parent: 0 }];
|
|
823
|
+
const incOr = (depth: number) => (depth % 2 === 0 ? depth + 1 : depth);
|
|
824
|
+
const incAnd = (depth: number) => (depth % 2 === 0 ? depth : depth + 1);
|
|
825
|
+
for (let index = 0; index < todo.length; index++) {
|
|
826
|
+
const item = todo[index];
|
|
827
|
+
if (visited.has(item.expr)) continue;
|
|
828
|
+
visited.add(item.expr);
|
|
829
|
+
const op = manager.getOp(item.expr);
|
|
830
|
+
const pushArgs = (depth: number) => {
|
|
831
|
+
for (const arg of manager.getArgs(item.expr))
|
|
832
|
+
todo.push({ isNegated: item.isNegated, depth, expr: arg, parent: index });
|
|
833
|
+
};
|
|
834
|
+
if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
|
|
835
|
+
pushArgs(incOr(item.depth));
|
|
836
|
+
if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
|
|
837
|
+
pushArgs(incAnd(item.depth));
|
|
838
|
+
else if (manager.isNot(item.expr))
|
|
839
|
+
todo.push({
|
|
840
|
+
isNegated: !item.isNegated,
|
|
841
|
+
depth: item.depth,
|
|
842
|
+
expr: manager.getArg(item.expr, 0),
|
|
843
|
+
parent: index,
|
|
844
|
+
});
|
|
845
|
+
else if (!item.isNegated && item.depth >= 1) {
|
|
846
|
+
const start = eqs.length;
|
|
847
|
+
this.isAllowingBool = false;
|
|
848
|
+
this.getEqsOf(item.expr, eqs);
|
|
849
|
+
this.isAllowingBool = true;
|
|
850
|
+
for (let current = start; current < eqs.length; current++)
|
|
851
|
+
if (!this.isSafeVar(eqs[current].variable, index, form, todo)) {
|
|
852
|
+
eqs[current] = eqs[eqs.length - 1];
|
|
853
|
+
current--;
|
|
854
|
+
eqs.pop();
|
|
855
|
+
}
|
|
856
|
+
}
|
|
857
|
+
}
|
|
858
|
+
}
|
|
859
|
+
|
|
860
|
+
private collectNestedEqualities() {
|
|
861
|
+
const manager = this.manager;
|
|
862
|
+
const forms = this.goal.forms.items;
|
|
863
|
+
const visited = new Set<number>();
|
|
864
|
+
const collected: DependentEq[] = [];
|
|
865
|
+
for (const form of forms) this.collectNestedIn(form, visited, collected);
|
|
866
|
+
if (collected.length === 0) return collected;
|
|
867
|
+
const eqs = collected
|
|
868
|
+
.map((eq, index) => ({ eq, index }))
|
|
869
|
+
.sort(
|
|
870
|
+
(first, second) =>
|
|
871
|
+
manager.ids[first.eq.variable] - manager.ids[second.eq.variable] ||
|
|
872
|
+
first.index - second.index,
|
|
873
|
+
)
|
|
874
|
+
.map((entry) => entry.eq);
|
|
875
|
+
const firstOccurrence = new Map<number, number>();
|
|
876
|
+
const lastOccurrence = new Map<number, number>();
|
|
877
|
+
const record = (occurrence: Map<number, number>, order: number[]) => {
|
|
878
|
+
const seen = new Set<number>();
|
|
879
|
+
for (const index of order) {
|
|
880
|
+
const todo = [forms[index]];
|
|
881
|
+
while (todo.length > 0) {
|
|
882
|
+
const expr = todo.pop() as number;
|
|
883
|
+
if (seen.has(expr)) continue;
|
|
884
|
+
seen.add(expr);
|
|
885
|
+
occurrence.set(expr, index);
|
|
886
|
+
if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
|
|
887
|
+
else if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
888
|
+
const data = manager.getQuantifier(expr);
|
|
889
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
890
|
+
}
|
|
891
|
+
}
|
|
892
|
+
}
|
|
893
|
+
};
|
|
894
|
+
record(
|
|
895
|
+
firstOccurrence,
|
|
896
|
+
forms.map((_, index) => index),
|
|
897
|
+
);
|
|
898
|
+
record(
|
|
899
|
+
lastOccurrence,
|
|
900
|
+
forms.map((_, index) => forms.length - 1 - index),
|
|
901
|
+
);
|
|
902
|
+
const kept: DependentEq[] = [];
|
|
903
|
+
let lastVar = -1;
|
|
904
|
+
let isUnsafe = false;
|
|
905
|
+
for (const eq of eqs) {
|
|
906
|
+
const first = firstOccurrence.get(eq.variable);
|
|
907
|
+
if (first === undefined || first !== lastOccurrence.get(eq.variable)) continue;
|
|
908
|
+
if (eq.variable !== lastVar) {
|
|
909
|
+
this.containsV.clear();
|
|
910
|
+
this.markOccurs([eq.term], eq.variable);
|
|
911
|
+
lastVar = eq.variable;
|
|
912
|
+
isUnsafe = false;
|
|
913
|
+
if (this.containsV.has(eq.term)) {
|
|
914
|
+
isUnsafe = true;
|
|
915
|
+
continue;
|
|
916
|
+
}
|
|
917
|
+
this.markOccurs([forms[first]], eq.variable);
|
|
918
|
+
} else if (this.containsV.has(eq.term) || isUnsafe) continue;
|
|
919
|
+
if (this.isSafeEq(eq.orig)) kept.push(eq);
|
|
920
|
+
}
|
|
921
|
+
return kept;
|
|
922
|
+
}
|
|
923
|
+
|
|
924
|
+
release() {
|
|
925
|
+
this.rewriter.release();
|
|
926
|
+
this.pinned.reset();
|
|
927
|
+
this.eqTerms.reset();
|
|
928
|
+
}
|
|
929
|
+
}
|