tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0
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 +8 -0
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +121 -12
- package/dist/index.d.ts +121 -12
- 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 +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1155 -900
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -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 +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +318 -656
- package/src/cli/typescript.ts +0 -3
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +260 -371
- package/src/errors.ts +93 -58
- package/src/evaluate.ts +848 -374
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +97 -43
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -325
- package/src/liveness.ts +224 -131
- 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 +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- 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 +121 -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 +34 -57
- package/src/parallel.ts +62 -72
- package/src/parser.ts +1184 -531
- 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 +226 -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 +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- 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 +34 -77
- 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 +4 -47
- 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 +26 -31
- 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 +1021 -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 +626 -56
- 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 +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -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 +127 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- 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 +296 -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-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -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 +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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -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 +113 -133
- 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 +355 -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 +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- 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 +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- 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 +92 -136
- 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 +177 -149
- 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 +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- 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 +310 -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 +106 -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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- 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 +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -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 +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -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 +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -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/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -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 +41 -51
- 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 -16
- package/src/prover/smt/solver/qsat.ts +829 -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 +22 -32
- 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 +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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +2107 -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 +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +129 -38
- 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 +2141 -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 +1210 -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 +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -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-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -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 +74 -48
- 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 +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- 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 +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -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 +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +296 -105
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +10 -25
- package/src/typescript/collections.ts +34 -35
- package/src/typescript/compile.ts +1 -8
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +9 -15
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +14 -16
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +20 -28
- package/src/typescript/types.ts +3 -10
- package/src/values.ts +917 -522
- 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,296 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_VAR,
|
|
6
|
+
OP_DISTINCT,
|
|
7
|
+
OP_DT_CONSTRUCTOR,
|
|
8
|
+
OP_DT_IS,
|
|
9
|
+
OP_DT_RECOGNISER,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_IMPLIES,
|
|
12
|
+
OP_ITE,
|
|
13
|
+
OP_ULEQ,
|
|
14
|
+
SORT_BOOL,
|
|
15
|
+
QUANTIFIER_FORALL,
|
|
16
|
+
} from "./ast";
|
|
17
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
18
|
+
import {
|
|
19
|
+
getConstructorIndex,
|
|
20
|
+
getDatatypeConstructors,
|
|
21
|
+
getDatatypeDef,
|
|
22
|
+
getNumConstructors,
|
|
23
|
+
getRecognizerConstructor,
|
|
24
|
+
} from "./datatype-decl-plugin";
|
|
25
|
+
import { release } from "./expr-ref";
|
|
26
|
+
import type { Definition, Goal } from "./goal";
|
|
27
|
+
import { ObjMap } from "./hashtable";
|
|
28
|
+
import { RefVector } from "./ref-vector";
|
|
29
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
30
|
+
|
|
31
|
+
const isEnumSort = (manager: AstManager, sort: number) =>
|
|
32
|
+
manager.isDatatypeSort(sort) &&
|
|
33
|
+
(getDatatypeDef(manager, sort)?.constructors.every(
|
|
34
|
+
(constructor) => constructor.accessors.length === 0,
|
|
35
|
+
) ??
|
|
36
|
+
false);
|
|
37
|
+
|
|
38
|
+
const getEnumBvSize = (manager: AstManager, sort: number) => {
|
|
39
|
+
const numConstructors = getNumConstructors(manager, sort);
|
|
40
|
+
let size = 1;
|
|
41
|
+
while (2 ** size < numConstructors) size++;
|
|
42
|
+
return size;
|
|
43
|
+
};
|
|
44
|
+
|
|
45
|
+
const mkEnumValue = (manager: AstManager, index: number, sort: number) =>
|
|
46
|
+
manager.mkBvNumeral(BigInt(index), getEnumBvSize(manager, sort));
|
|
47
|
+
|
|
48
|
+
const constrainDomain = (manager: AstManager, bounds: RefVector, expr: number, sort: number) => {
|
|
49
|
+
const domainSize = getNumConstructors(manager, sort);
|
|
50
|
+
if ((domainSize & (domainSize - 1)) !== 0 || domainSize === 1)
|
|
51
|
+
bounds.push(mkBvApp(manager, OP_ULEQ, [expr, mkEnumValue(manager, domainSize - 1, sort)]));
|
|
52
|
+
};
|
|
53
|
+
|
|
54
|
+
export class Enum2BvRewriter extends RewriterTpl {
|
|
55
|
+
readonly enumIndexes: ObjMap<number>;
|
|
56
|
+
readonly enumConsts: number[] = [];
|
|
57
|
+
readonly enumBvs: number[] = [];
|
|
58
|
+
readonly enumDefs: RefVector;
|
|
59
|
+
readonly bounds: RefVector;
|
|
60
|
+
private readonly enumConstsLimits: number[] = [];
|
|
61
|
+
|
|
62
|
+
// Without fd sorts, every enumeration sort is finite-domain.
|
|
63
|
+
constructor(
|
|
64
|
+
manager: AstManager,
|
|
65
|
+
private fdSorts: Set<number> | undefined,
|
|
66
|
+
) {
|
|
67
|
+
super(manager);
|
|
68
|
+
this.enumIndexes = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
69
|
+
this.enumDefs = new RefVector(manager);
|
|
70
|
+
this.bounds = new RefVector(manager);
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
private isFd(sort: number) {
|
|
74
|
+
return isEnumSort(this.manager, sort) && (this.fdSorts?.has(sort) ?? true);
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
private throwNonFd(expr: number): never {
|
|
78
|
+
throw new SmtTacticError(
|
|
79
|
+
`unable to handle nested data-type expression ${this.manager.toString(expr)}`,
|
|
80
|
+
);
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private reduceArg(arg: number) {
|
|
84
|
+
const manager = this.manager;
|
|
85
|
+
const sort = manager.sorts[arg];
|
|
86
|
+
if (!this.isFd(sort)) return -1;
|
|
87
|
+
const bvSort = manager.mkBvSort(getEnumBvSize(manager, sort));
|
|
88
|
+
if (manager.kinds[arg] === KIND_VAR) return manager.mkVar(manager.values[arg], bvSort);
|
|
89
|
+
const decl = manager.decls[arg];
|
|
90
|
+
if (manager.funcDecls[decl].op === OP_DT_CONSTRUCTOR)
|
|
91
|
+
return mkEnumValue(manager, getConstructorIndex(manager, decl), sort);
|
|
92
|
+
if (!manager.isUninterpretedConst(arg)) this.throwNonFd(arg);
|
|
93
|
+
const existing = this.enumIndexes.get(decl);
|
|
94
|
+
if (existing !== undefined) return manager.mkApp(this.enumBvs[existing], [], bvSort);
|
|
95
|
+
const fresh = manager.mkFreshConst(manager.funcDecls[decl].name, bvSort);
|
|
96
|
+
constrainDomain(manager, this.bounds, fresh, sort);
|
|
97
|
+
const constructors = getDatatypeConstructors(manager, sort);
|
|
98
|
+
let def = manager.mkApp(constructors[constructors.length - 1], [], sort);
|
|
99
|
+
for (let index = constructors.length - 2; index >= 0; index--)
|
|
100
|
+
def = manager.mkApp(
|
|
101
|
+
OP_ITE,
|
|
102
|
+
[
|
|
103
|
+
manager.mkEq(fresh, mkEnumValue(manager, index, sort)),
|
|
104
|
+
manager.mkApp(constructors[index], [], sort),
|
|
105
|
+
def,
|
|
106
|
+
],
|
|
107
|
+
sort,
|
|
108
|
+
);
|
|
109
|
+
this.enumIndexes.set(decl, this.enumConsts.length);
|
|
110
|
+
manager.incDeclRef(decl);
|
|
111
|
+
this.enumConsts.push(decl);
|
|
112
|
+
manager.incDeclRef(manager.decls[fresh]);
|
|
113
|
+
this.enumBvs.push(manager.decls[fresh]);
|
|
114
|
+
this.enumDefs.push(def);
|
|
115
|
+
return fresh;
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
reduceApp(decl: number, args: number[]) {
|
|
119
|
+
const manager = this.manager;
|
|
120
|
+
const op = manager.funcDecls[decl].op;
|
|
121
|
+
if (decl === OP_EQ) {
|
|
122
|
+
const first = this.reduceArg(args[0]);
|
|
123
|
+
const second = first === -1 ? -1 : this.reduceArg(args[1]);
|
|
124
|
+
if (second !== -1) {
|
|
125
|
+
const result = manager.mkEq(first, second);
|
|
126
|
+
manager.incRef(result);
|
|
127
|
+
return result;
|
|
128
|
+
}
|
|
129
|
+
} else if (decl === OP_DISTINCT) {
|
|
130
|
+
const reduced: number[] = [];
|
|
131
|
+
for (const arg of args) {
|
|
132
|
+
const reducedArg = this.reduceArg(arg);
|
|
133
|
+
if (reducedArg === -1) break;
|
|
134
|
+
reduced.push(reducedArg);
|
|
135
|
+
}
|
|
136
|
+
if (reduced.length === args.length) {
|
|
137
|
+
const result = manager.mkApp(OP_DISTINCT, reduced, SORT_BOOL);
|
|
138
|
+
manager.incRef(result);
|
|
139
|
+
return result;
|
|
140
|
+
}
|
|
141
|
+
} else if (op === OP_DT_RECOGNISER || op === OP_DT_IS) {
|
|
142
|
+
const reduced = this.reduceArg(args[0]);
|
|
143
|
+
if (reduced !== -1) {
|
|
144
|
+
const constructor = getRecognizerConstructor(manager, decl);
|
|
145
|
+
const result = manager.mkEq(
|
|
146
|
+
reduced,
|
|
147
|
+
mkEnumValue(manager, getConstructorIndex(manager, constructor), manager.sorts[args[0]]),
|
|
148
|
+
);
|
|
149
|
+
manager.incRef(result);
|
|
150
|
+
return result;
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
for (const arg of args) if (this.isFd(manager.sorts[arg])) this.throwNonFd(arg);
|
|
154
|
+
return -1;
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
reduceQuantifier(expr: number, body: number, patterns: number[]) {
|
|
158
|
+
const manager = this.manager;
|
|
159
|
+
const data = manager.getQuantifier(expr);
|
|
160
|
+
const numDecls = data.sorts.length;
|
|
161
|
+
const bounds = new RefVector(manager);
|
|
162
|
+
let isFound = false;
|
|
163
|
+
const sorts = data.sorts.map((sort, index) => {
|
|
164
|
+
if (!this.isFd(sort)) return sort;
|
|
165
|
+
const bvSort = manager.mkBvSort(getEnumBvSize(manager, sort));
|
|
166
|
+
constrainDomain(manager, bounds, manager.mkVar(numDecls - index - 1, bvSort), sort);
|
|
167
|
+
isFound = true;
|
|
168
|
+
return bvSort;
|
|
169
|
+
});
|
|
170
|
+
if (!isFound) return -1;
|
|
171
|
+
if (bounds.size > 0 && data.kind !== QUANTIFIER_FORALL) bounds.push(body);
|
|
172
|
+
const newBody =
|
|
173
|
+
bounds.size === 0
|
|
174
|
+
? body
|
|
175
|
+
: data.kind === QUANTIFIER_FORALL
|
|
176
|
+
? manager.mkApp(OP_IMPLIES, [manager.mkAnd(bounds.items), body], SORT_BOOL)
|
|
177
|
+
: manager.mkAnd(bounds.items);
|
|
178
|
+
// Z3 reads the no-patterns from a vector its rewriter has shrunk: they are the quantifier's own.
|
|
179
|
+
const result = manager.mkQuantifier({ ...data, sorts, body: newBody, patterns });
|
|
180
|
+
manager.incRef(result);
|
|
181
|
+
bounds.reset();
|
|
182
|
+
return result;
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
push() {
|
|
186
|
+
this.enumConstsLimits.push(this.enumConsts.length);
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
pop(numScopes: number) {
|
|
190
|
+
const manager = this.manager;
|
|
191
|
+
if (numScopes > 0) {
|
|
192
|
+
const size = this.enumConstsLimits.length - numScopes;
|
|
193
|
+
const limit = this.enumConstsLimits[size];
|
|
194
|
+
for (let index = this.enumConsts.length - 1; index >= limit; index--)
|
|
195
|
+
this.enumIndexes.delete(this.enumConsts[index]);
|
|
196
|
+
this.enumConstsLimits.length = size;
|
|
197
|
+
for (const decl of this.enumConsts.splice(limit)) manager.decDeclRef(decl);
|
|
198
|
+
this.enumDefs.shrink(limit);
|
|
199
|
+
for (const decl of this.enumBvs.splice(limit)) manager.decDeclRef(decl);
|
|
200
|
+
}
|
|
201
|
+
this.reset();
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
// ~imp: the rewriter goes before the vectors.
|
|
205
|
+
release() {
|
|
206
|
+
const manager = this.manager;
|
|
207
|
+
super.release();
|
|
208
|
+
this.enumDefs.reset();
|
|
209
|
+
for (const decl of this.enumBvs) manager.decDeclRef(decl);
|
|
210
|
+
for (const decl of this.enumConsts) manager.decDeclRef(decl);
|
|
211
|
+
this.bounds.reset();
|
|
212
|
+
}
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
export const createDt2BvTactic = (manager: AstManager) => {
|
|
216
|
+
const fdSorts = new Set<number>();
|
|
217
|
+
const nonFdSorts = new Set<number>();
|
|
218
|
+
const isFd = (expr: number) => isEnumSort(manager, manager.sorts[expr]);
|
|
219
|
+
const argsCannotBeFd = (expr: number) => {
|
|
220
|
+
for (const arg of manager.getArgs(expr)) if (isFd(arg)) nonFdSorts.add(manager.sorts[arg]);
|
|
221
|
+
};
|
|
222
|
+
return (goal: Goal) => {
|
|
223
|
+
const visited = new Set<number>();
|
|
224
|
+
const todo = [...goal.forms.items];
|
|
225
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
226
|
+
if (visited.has(expr)) continue;
|
|
227
|
+
visited.add(expr);
|
|
228
|
+
const kind = manager.kinds[expr];
|
|
229
|
+
if (kind === KIND_VAR) {
|
|
230
|
+
if (isFd(expr)) fdSorts.add(manager.sorts[expr]);
|
|
231
|
+
continue;
|
|
232
|
+
}
|
|
233
|
+
if (kind !== KIND_APP) {
|
|
234
|
+
const data = manager.getQuantifier(expr);
|
|
235
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
236
|
+
continue;
|
|
237
|
+
}
|
|
238
|
+
manager.pushArgs(expr, todo);
|
|
239
|
+
const decl = manager.decls[expr];
|
|
240
|
+
const op = manager.funcDecls[decl].op;
|
|
241
|
+
if (decl === OP_EQ || decl === OP_DISTINCT) continue;
|
|
242
|
+
if ((op === OP_DT_RECOGNISER || op === OP_DT_IS) && isFd(manager.getArg(expr, 0)))
|
|
243
|
+
fdSorts.add(manager.sorts[manager.getArg(expr, 0)]);
|
|
244
|
+
else if (isFd(expr) && manager.getNumArgs(expr) > 0) {
|
|
245
|
+
nonFdSorts.add(manager.sorts[expr]);
|
|
246
|
+
argsCannotBeFd(expr);
|
|
247
|
+
} else if (isFd(expr)) fdSorts.add(manager.sorts[expr]);
|
|
248
|
+
else argsCannotBeFd(expr);
|
|
249
|
+
}
|
|
250
|
+
for (const sort of nonFdSorts) fdSorts.delete(sort);
|
|
251
|
+
if (fdSorts.size > 0)
|
|
252
|
+
runEnum2Bv(
|
|
253
|
+
manager,
|
|
254
|
+
goal,
|
|
255
|
+
(visit) => {
|
|
256
|
+
const size = goal.forms.size;
|
|
257
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++) visit(index);
|
|
258
|
+
},
|
|
259
|
+
fdSorts,
|
|
260
|
+
);
|
|
261
|
+
goal.depth++;
|
|
262
|
+
return [goal];
|
|
263
|
+
};
|
|
264
|
+
};
|
|
265
|
+
|
|
266
|
+
export const runEnum2Bv = (
|
|
267
|
+
manager: AstManager,
|
|
268
|
+
goal: Goal,
|
|
269
|
+
forEachIndex: (visit: (index: number) => void) => void,
|
|
270
|
+
fdSorts?: Set<number>,
|
|
271
|
+
) => {
|
|
272
|
+
const rewriter = new Enum2BvRewriter(manager, fdSorts);
|
|
273
|
+
let rewritten = -1;
|
|
274
|
+
try {
|
|
275
|
+
forEachIndex((index) => {
|
|
276
|
+
const next = rewriter.rewrite(goal.forms.items[index]);
|
|
277
|
+
release(manager, rewritten);
|
|
278
|
+
rewritten = next;
|
|
279
|
+
goal.update(index, rewritten);
|
|
280
|
+
});
|
|
281
|
+
const bounds = new RefVector(manager);
|
|
282
|
+
for (const bound of rewriter.bounds.items) bounds.push(bound);
|
|
283
|
+
rewriter.bounds.reset();
|
|
284
|
+
for (const bound of bounds.items) goal.assert(bound);
|
|
285
|
+
const definitions: Definition[] = [];
|
|
286
|
+
for (const entry of rewriter.enumIndexes)
|
|
287
|
+
definitions.push({ decl: rewriter.enumBvs[entry[1]], def: -1 });
|
|
288
|
+
for (const entry of rewriter.enumIndexes)
|
|
289
|
+
definitions.push({ decl: entry[0], def: rewriter.enumDefs.items[entry[1]] });
|
|
290
|
+
if (definitions.length > 0) goal.addDefinitions(definitions);
|
|
291
|
+
bounds.reset();
|
|
292
|
+
} finally {
|
|
293
|
+
release(manager, rewritten);
|
|
294
|
+
rewriter.release();
|
|
295
|
+
}
|
|
296
|
+
};
|
|
@@ -1,13 +1,8 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/dyn_ack.cpp), MIT license, see z3-license.txt. Dynamic Ackermann
|
|
2
|
-
// reduction with Z3's default DACK_ROOT strategy: a pair of applications whose congruence is the
|
|
3
|
-
// root of conflicts often enough gets the clause f(a) = f(b) or some a_i != b_i, so the search can
|
|
4
|
-
// learn from it without the E-graph. dack.eq is off by default, so equalities are not tracked.
|
|
5
1
|
import { OP_EQ } from "./ast";
|
|
6
2
|
import { CLS_TH_LEMMA } from "./clause";
|
|
7
3
|
import type { Context } from "./context";
|
|
8
4
|
import { Literal, negate } from "./literal";
|
|
9
5
|
|
|
10
|
-
// dyn_ack_params defaults: dack.threshold, dack.factor, dack.gc and dack.gc_inv_decay.
|
|
11
6
|
const DACK_THRESHOLD = 10;
|
|
12
7
|
const DACK_FACTOR = 0.1;
|
|
13
8
|
const DACK_GC = 2000;
|
|
@@ -21,7 +16,6 @@ interface AppPair {
|
|
|
21
16
|
|
|
22
17
|
export class DynAckManager {
|
|
23
18
|
private appPair2NumOccs = new Map<string, number>();
|
|
24
|
-
// The pairs that hold references to their applications. A pair can appear more than once.
|
|
25
19
|
private appPairs: AppPair[] = [];
|
|
26
20
|
private toInstantiate: AppPair[] = [];
|
|
27
21
|
private qhead = 0;
|
|
@@ -49,8 +43,6 @@ export class DynAckManager {
|
|
|
49
43
|
this.numPropagationsSinceLastGc = 0;
|
|
50
44
|
}
|
|
51
45
|
|
|
52
|
-
// cg_conflict_eh, which DACK_ROOT turns into cg_eh: the congruence of the two applications is the
|
|
53
|
-
// root of a conflict.
|
|
54
46
|
cgConflictEh(inputFirst: number, inputSecond: number) {
|
|
55
47
|
const manager = this.context.manager;
|
|
56
48
|
if (manager.decls[inputFirst] === OP_EQ) return;
|
|
@@ -71,8 +63,6 @@ export class DynAckManager {
|
|
|
71
63
|
if (numOccs === DACK_THRESHOLD) this.toInstantiate.push(pair);
|
|
72
64
|
}
|
|
73
65
|
|
|
74
|
-
// gc: decays every count, drops the pairs that fall to 1 or below, and queues the frequent ones,
|
|
75
|
-
// most frequent first.
|
|
76
66
|
private gc() {
|
|
77
67
|
const manager = this.context.manager;
|
|
78
68
|
this.toInstantiate = [];
|
|
@@ -132,7 +122,6 @@ export class DynAckManager {
|
|
|
132
122
|
negate(this.mkEq(manager.getArg(pair.first, index), manager.getArg(pair.second, index))),
|
|
133
123
|
);
|
|
134
124
|
this.appPair2NumOccs.delete(pair.key);
|
|
135
|
-
// The pair stays in appPairs, which still holds its references.
|
|
136
125
|
this.instantiated.add(pair.key);
|
|
137
126
|
literals.push(this.mkEq(pair.first, pair.second));
|
|
138
127
|
for (const literal of literals) context.markLiteralAsRelevant(literal);
|
|
@@ -1,8 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
// patterns against the E-graph with Z3's matching abstract machine: the patterns are compiled into
|
|
3
|
-
// code trees, new relevant terms become candidates of the tree for their label, and the inverted
|
|
4
|
-
// path index with approximate label sets finds the candidates that a merge creates.
|
|
5
|
-
import { AstManager, KIND_VAR } from "./ast";
|
|
1
|
+
import { type AstManager, KIND_VAR } from "./ast";
|
|
6
2
|
import type { Context } from "./context";
|
|
7
3
|
import type { Enode } from "./enode";
|
|
8
4
|
import { hashU, mkMix } from "./hash";
|
|
@@ -10,8 +6,6 @@ import { type CodeTree, Compiler, hasHash, type LabelHasher } from "./mam-compil
|
|
|
10
6
|
import { Interpreter, type OnMatch } from "./mam-interpreter";
|
|
11
7
|
import { setAt, shrink } from "./array";
|
|
12
8
|
|
|
13
|
-
// A step from a term to its parent: the parent's label, the position of the term in it, and an
|
|
14
|
-
// optional ground argument the parent must also have.
|
|
15
9
|
interface Path {
|
|
16
10
|
label: number;
|
|
17
11
|
argIndex: number;
|
|
@@ -21,8 +15,6 @@ interface Path {
|
|
|
21
15
|
child: Path | null;
|
|
22
16
|
}
|
|
23
17
|
|
|
24
|
-
// The inverted path index shares the prefixes of paths. Siblings are alternatives for the same step,
|
|
25
|
-
// the first child is the next step, and a code receives the terms where a path ends.
|
|
26
18
|
interface PathTree {
|
|
27
19
|
label: number;
|
|
28
20
|
argIndex: number;
|
|
@@ -33,7 +25,6 @@ interface PathTree {
|
|
|
33
25
|
code: CodeTree | null;
|
|
34
26
|
firstChild: PathTree | null;
|
|
35
27
|
sibling: PathTree | null;
|
|
36
|
-
// The roots that collect_parents visits at this node, while it walks the tree.
|
|
37
28
|
todo: Enode[] | null;
|
|
38
29
|
}
|
|
39
30
|
|
|
@@ -54,7 +45,6 @@ const isEqualPath = (first: Path, second: Path): boolean => {
|
|
|
54
45
|
}
|
|
55
46
|
};
|
|
56
47
|
|
|
57
|
-
// A multi-pattern of a quantifier: the terms of one of its patterns.
|
|
58
48
|
interface MultiPattern {
|
|
59
49
|
quantifier: number;
|
|
60
50
|
patterns: number[];
|
|
@@ -62,7 +52,6 @@ interface MultiPattern {
|
|
|
62
52
|
|
|
63
53
|
export class Mam implements LabelHasher {
|
|
64
54
|
private trees = new Map<number, CodeTree>();
|
|
65
|
-
// m_shared_enodes: the ground terms of the patterns.
|
|
66
55
|
private sharedEnodes = new Set<Enode>();
|
|
67
56
|
private toMatch: CodeTree[] = [];
|
|
68
57
|
private newPatterns: MultiPattern[] = [];
|
|
@@ -72,12 +61,9 @@ export class Mam implements LabelHasher {
|
|
|
72
61
|
private clbls = new Set<number>();
|
|
73
62
|
private r1: Enode | null = null;
|
|
74
63
|
private r2: Enode | null = null;
|
|
75
|
-
// The nodes that collect_parents marks, to unmark at the end of each level.
|
|
76
64
|
private visitedParents: Enode[] = [];
|
|
77
65
|
private queuedRoots: Enode[] = [];
|
|
78
66
|
private labelHashes: (number | undefined)[] = [];
|
|
79
|
-
// m_trail_stack: the matcher undoes its changes with a trail of its own, which the quantifier
|
|
80
|
-
// manager pops before the context pops its trail.
|
|
81
67
|
private trail: (() => void)[] = [];
|
|
82
68
|
private trailScopes: number[] = [];
|
|
83
69
|
private compiler: Compiler;
|
|
@@ -87,7 +73,7 @@ export class Mam implements LabelHasher {
|
|
|
87
73
|
private context: Context,
|
|
88
74
|
onMatch: OnMatch,
|
|
89
75
|
) {
|
|
90
|
-
this.compiler = new Compiler(context
|
|
76
|
+
this.compiler = new Compiler(context, this);
|
|
91
77
|
this.interpreter = new Interpreter(context, onMatch);
|
|
92
78
|
}
|
|
93
79
|
|
|
@@ -95,7 +81,6 @@ export class Mam implements LabelHasher {
|
|
|
95
81
|
return this.context.manager;
|
|
96
82
|
}
|
|
97
83
|
|
|
98
|
-
// label_hasher: Bob Jenkins' mix of the small id of a declaration, in [0, 64).
|
|
99
84
|
getLabelHash(decl: number) {
|
|
100
85
|
const cached = this.labelHashes[decl];
|
|
101
86
|
if (cached !== undefined) return cached;
|
|
@@ -104,9 +89,7 @@ export class Mam implements LabelHasher {
|
|
|
104
89
|
return hash;
|
|
105
90
|
}
|
|
106
91
|
|
|
107
|
-
//
|
|
108
|
-
// The context's trail undoes both. Z3 pops it after the matcher's trail, so the labels of a root
|
|
109
|
-
// can keep a hash that a merge undone by the matcher's trail added.
|
|
92
|
+
// Z3 undoes this on the context's trail, popped after the matcher's, so a root can keep a hash that an undone merge added.
|
|
110
93
|
private setLblHash(node: Enode) {
|
|
111
94
|
const hash = hashU(this.manager.ids[node.owner]) & 63;
|
|
112
95
|
node.lblHash = hash;
|
|
@@ -184,12 +167,10 @@ export class Mam implements LabelHasher {
|
|
|
184
167
|
if (this.context.isRelevant(node.owner)) this.updateLbls(node, hash);
|
|
185
168
|
}
|
|
186
169
|
|
|
187
|
-
// mk_code: the code tree of a path, which runs each candidate once.
|
|
188
170
|
private mkCode(mp: MultiPattern, patternIndex: number) {
|
|
189
171
|
return this.compiler.mkTree(mp.quantifier, mp.patterns, patternIndex, true);
|
|
190
172
|
}
|
|
191
173
|
|
|
192
|
-
// mk_path_tree: a chain of path tree nodes whose last one has a code for the path's pattern.
|
|
193
174
|
private mkPathTree(path: Path, mp: MultiPattern): PathTree {
|
|
194
175
|
const tree: PathTree = {
|
|
195
176
|
label: path.label,
|
|
@@ -211,7 +192,6 @@ export class Mam implements LabelHasher {
|
|
|
211
192
|
return tree;
|
|
212
193
|
}
|
|
213
194
|
|
|
214
|
-
// compiler::insert for path trees.
|
|
215
195
|
private insertPath(head: PathTree, path: Path, mp: MultiPattern) {
|
|
216
196
|
let isLabelFound = false;
|
|
217
197
|
let last = head;
|
|
@@ -329,7 +309,7 @@ export class Mam implements LabelHasher {
|
|
|
329
309
|
const numArgs = manager.getNumArgs(pattern);
|
|
330
310
|
let groundArgIndex = -1;
|
|
331
311
|
for (let index = 0; index < numArgs && groundArgIndex === -1; index++)
|
|
332
|
-
if (manager.
|
|
312
|
+
if (manager.isGroundApp(manager.getArg(pattern, index))) groundArgIndex = index;
|
|
333
313
|
const groundArg =
|
|
334
314
|
groundArgIndex === -1
|
|
335
315
|
? null
|
|
@@ -363,7 +343,7 @@ export class Mam implements LabelHasher {
|
|
|
363
343
|
if (!isFound) paths.push(path);
|
|
364
344
|
continue;
|
|
365
345
|
}
|
|
366
|
-
if (manager.
|
|
346
|
+
if (manager.isGroundApp(child)) {
|
|
367
347
|
const node = this.getGroundEnode(child, mp.quantifier);
|
|
368
348
|
if (node === null) continue;
|
|
369
349
|
this.updatePlbls(label);
|
|
@@ -380,7 +360,7 @@ export class Mam implements LabelHasher {
|
|
|
380
360
|
|
|
381
361
|
addPattern(quantifier: number, patterns: number[]) {
|
|
382
362
|
const manager = this.manager;
|
|
383
|
-
if (patterns.every((pattern) => manager.
|
|
363
|
+
if (patterns.every((pattern) => manager.isGroundApp(pattern))) return;
|
|
384
364
|
if (patterns.some((pattern) => manager.hasQuantifierFlags[pattern])) return;
|
|
385
365
|
const mp = { quantifier, patterns };
|
|
386
366
|
const numDecls = manager.getQuantifier(quantifier).sorts.length;
|
|
@@ -388,9 +368,8 @@ export class Mam implements LabelHasher {
|
|
|
388
368
|
patterns.forEach((pattern, index) => this.updateFilters(pattern, null, index, varPaths, mp));
|
|
389
369
|
this.collectGroundExprs(quantifier, patterns);
|
|
390
370
|
this.newPatterns.push(mp);
|
|
391
|
-
// code_tree_map::add_pattern for each pattern as the first one.
|
|
392
371
|
patterns.forEach((pattern, firstIndex) => {
|
|
393
|
-
if (manager.
|
|
372
|
+
if (manager.isGroundApp(pattern)) return;
|
|
394
373
|
const label = manager.decls[pattern];
|
|
395
374
|
const tree = this.trees.get(label);
|
|
396
375
|
if (tree !== undefined) {
|
|
@@ -403,13 +382,11 @@ export class Mam implements LabelHasher {
|
|
|
403
382
|
});
|
|
404
383
|
}
|
|
405
384
|
|
|
406
|
-
// collect_ground_exprs: the ground patterns become relevant enodes, and the ground subterms of the
|
|
407
|
-
// other patterns become enodes that theory combination treats as shared.
|
|
408
385
|
private collectGroundExprs(quantifier: number, patterns: number[]) {
|
|
409
386
|
const manager = this.manager;
|
|
410
387
|
const todo: number[] = [];
|
|
411
388
|
for (const pattern of patterns) {
|
|
412
|
-
if (!manager.
|
|
389
|
+
if (!manager.isGroundApp(pattern)) {
|
|
413
390
|
todo.push(pattern);
|
|
414
391
|
continue;
|
|
415
392
|
}
|
|
@@ -419,7 +396,7 @@ export class Mam implements LabelHasher {
|
|
|
419
396
|
this.addSharedEnode(node);
|
|
420
397
|
}
|
|
421
398
|
for (let term = todo.pop(); term !== undefined; term = todo.pop()) {
|
|
422
|
-
if (manager.
|
|
399
|
+
if (manager.isGroundApp(term)) {
|
|
423
400
|
const node = this.getGroundEnode(term, quantifier);
|
|
424
401
|
if (node !== null) this.addSharedEnode(node);
|
|
425
402
|
} else
|
|
@@ -440,8 +417,6 @@ export class Mam implements LabelHasher {
|
|
|
440
417
|
return this.sharedEnodes.has(node);
|
|
441
418
|
}
|
|
442
419
|
|
|
443
|
-
// add_candidate, with compress_candidates, which keeps the first of each candidate once there are
|
|
444
|
-
// many, as match does.
|
|
445
420
|
private addCandidateTo(tree: CodeTree, node: Enode) {
|
|
446
421
|
if (tree.candidates.length === 0) this.toMatch.push(tree);
|
|
447
422
|
tree.candidates.push(node);
|
|
@@ -470,9 +445,6 @@ export class Mam implements LabelHasher {
|
|
|
470
445
|
);
|
|
471
446
|
}
|
|
472
447
|
|
|
473
|
-
// collect_parents: walks the path tree level by level from the merged class, visiting each parent
|
|
474
|
-
// once per level, and hands the terms where a path ends to that path's code. The mark of a parent
|
|
475
|
-
// says it was visited at this level, and the second mark of a root says it is queued for the next.
|
|
476
448
|
private collectParents(start: Enode, head: PathTree | null | undefined) {
|
|
477
449
|
if (head === null || head === undefined) return;
|
|
478
450
|
const context = this.context;
|
|
@@ -569,7 +541,6 @@ export class Mam implements LabelHasher {
|
|
|
569
541
|
}
|
|
570
542
|
}
|
|
571
543
|
|
|
572
|
-
// add_eq_eh: r2's labels take r1's after the paths are followed.
|
|
573
544
|
addEqEh(r1: Enode, r2: Enode) {
|
|
574
545
|
this.r1 = r1;
|
|
575
546
|
this.r2 = r2;
|
|
@@ -603,8 +574,6 @@ export class Mam implements LabelHasher {
|
|
|
603
574
|
if (this.newPatterns.length > 0) this.matchNewPatterns();
|
|
604
575
|
}
|
|
605
576
|
|
|
606
|
-
// match_new_patterns: one temporary tree per label, in the order the labels first appear, run
|
|
607
|
-
// against the relevant terms with the label.
|
|
608
577
|
private matchNewPatterns() {
|
|
609
578
|
const context = this.context;
|
|
610
579
|
const manager = this.manager;
|
|
@@ -627,7 +596,6 @@ export class Mam implements LabelHasher {
|
|
|
627
596
|
this.newPatterns = [];
|
|
628
597
|
}
|
|
629
598
|
|
|
630
|
-
// rematch: every code tree, in the order of their labels' small ids, against every relevant term.
|
|
631
599
|
rematch() {
|
|
632
600
|
const context = this.context;
|
|
633
601
|
const funcDecls = this.manager.funcDecls;
|
|
@@ -0,0 +1,89 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_VAR,
|
|
4
|
+
OP_ADD,
|
|
5
|
+
OP_GE,
|
|
6
|
+
OP_LE,
|
|
7
|
+
OP_MUL,
|
|
8
|
+
OP_NOT,
|
|
9
|
+
OP_OR,
|
|
10
|
+
QUANTIFIER_FORALL,
|
|
11
|
+
} from "./ast";
|
|
12
|
+
import { Rational } from "./rational";
|
|
13
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
14
|
+
import { collectUsedVars, elimUnusedVars } from "./var-subst";
|
|
15
|
+
|
|
16
|
+
interface Bound {
|
|
17
|
+
lower: number;
|
|
18
|
+
upper: number;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
const getBound = (manager: AstManager, atom: number): Bound | undefined => {
|
|
22
|
+
const isNegated = manager.getOp(atom) === OP_NOT;
|
|
23
|
+
const inequality = isNegated ? manager.getArg(atom, 0) : atom;
|
|
24
|
+
const op = manager.getOp(inequality);
|
|
25
|
+
if ((op !== OP_LE && op !== OP_GE) || !manager.isNumeral(manager.getArg(inequality, 1)))
|
|
26
|
+
return undefined;
|
|
27
|
+
const isLe = (op === OP_LE) !== isNegated;
|
|
28
|
+
const term = manager.getArg(inequality, 0);
|
|
29
|
+
const bound = { lower: -1, upper: -1 };
|
|
30
|
+
if (manager.kinds[term] === KIND_VAR) bound.upper = term;
|
|
31
|
+
else if (manager.getOp(term) === OP_ADD && manager.getNumArgs(term) === 2) {
|
|
32
|
+
const first = manager.getArg(term, 0);
|
|
33
|
+
if (manager.kinds[first] === KIND_VAR) bound.upper = first;
|
|
34
|
+
else if (!manager.isGroundApp(first)) return undefined;
|
|
35
|
+
const second = manager.getArg(term, 1);
|
|
36
|
+
if (
|
|
37
|
+
manager.getOp(second) !== OP_MUL ||
|
|
38
|
+
!manager.isNumeral(manager.getArg(second, 0)) ||
|
|
39
|
+
!manager.getRationalValue(manager.getArg(second, 0)).equals(Rational.minusOne)
|
|
40
|
+
)
|
|
41
|
+
return undefined;
|
|
42
|
+
const negated = manager.getArg(second, 1);
|
|
43
|
+
if (manager.kinds[negated] === KIND_VAR) bound.lower = negated;
|
|
44
|
+
else if (!manager.isGroundApp(negated)) return undefined;
|
|
45
|
+
} else return undefined;
|
|
46
|
+
return isLe ? bound : { lower: bound.upper, upper: bound.lower };
|
|
47
|
+
};
|
|
48
|
+
|
|
49
|
+
export class ElimBoundsRw extends RewriterTpl {
|
|
50
|
+
reduceQuantifier(expr: number, body: number) {
|
|
51
|
+
const manager = this.manager;
|
|
52
|
+
const data = manager.getQuantifier(expr);
|
|
53
|
+
if (data.kind !== QUANTIFIER_FORALL) return -1;
|
|
54
|
+
const numVars = data.sorts.length;
|
|
55
|
+
const atoms = manager.getOp(body) === OP_OR ? manager.getArgs(body) : [body];
|
|
56
|
+
const isUsed = Array.from({ length: numVars }, () => false);
|
|
57
|
+
for (const atom of atoms)
|
|
58
|
+
if (getBound(manager, atom) === undefined)
|
|
59
|
+
for (const [index, isVarUsed] of collectUsedVars(manager, atom, numVars).entries())
|
|
60
|
+
if (isVarUsed) isUsed[index] = true;
|
|
61
|
+
if (isUsed.every((isVarUsed) => isVarUsed)) return -1;
|
|
62
|
+
const isCandidate = (variable: number) =>
|
|
63
|
+
variable !== -1 && manager.values[variable] < numVars && !isUsed[manager.values[variable]];
|
|
64
|
+
const lowers = new Set<number>();
|
|
65
|
+
const uppers = new Set<number>();
|
|
66
|
+
for (const atom of atoms) {
|
|
67
|
+
const bound = getBound(manager, atom);
|
|
68
|
+
if (bound === undefined) continue;
|
|
69
|
+
if (isCandidate(bound.lower)) lowers.add(bound.lower);
|
|
70
|
+
if (isCandidate(bound.upper)) uppers.add(bound.upper);
|
|
71
|
+
}
|
|
72
|
+
const candidates = new Set(
|
|
73
|
+
[...lowers, ...uppers].filter((variable) => !lowers.has(variable) || !uppers.has(variable)),
|
|
74
|
+
);
|
|
75
|
+
if (candidates.size === 0) return -1;
|
|
76
|
+
const kept = atoms.filter((atom) => {
|
|
77
|
+
const bound = getBound(manager, atom);
|
|
78
|
+
return bound === undefined || (!candidates.has(bound.lower) && !candidates.has(bound.upper));
|
|
79
|
+
});
|
|
80
|
+
if (kept.length === atoms.length) return -1;
|
|
81
|
+
if (kept.length === 0) {
|
|
82
|
+
manager.incRef(manager.falseExpr);
|
|
83
|
+
return manager.falseExpr;
|
|
84
|
+
}
|
|
85
|
+
return manager.withTemporaries(() =>
|
|
86
|
+
elimUnusedVars(manager, manager.mkQuantifier({ ...data, body: manager.mkOr(kept) })),
|
|
87
|
+
);
|
|
88
|
+
}
|
|
89
|
+
}
|