tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +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 +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +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 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- 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 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +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 +175 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- 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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +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 +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 +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 +3126 -316
- 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 +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- 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 +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- 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 +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,1050 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
FAMILY_BASIC,
|
|
5
|
+
FAMILY_BV,
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_AND,
|
|
9
|
+
OP_MUL,
|
|
10
|
+
OP_OR,
|
|
11
|
+
OP_XOR,
|
|
12
|
+
} from "../ast";
|
|
13
|
+
import { isAssociativeBvOp } from "../bv-decl-plugin";
|
|
14
|
+
import { hashU, mkMix } from "../hash";
|
|
15
|
+
import {
|
|
16
|
+
type CodeTree,
|
|
17
|
+
Compiler,
|
|
18
|
+
hasHash,
|
|
19
|
+
type Instruction,
|
|
20
|
+
type Joint,
|
|
21
|
+
JOINT_GROUND,
|
|
22
|
+
JOINT_NESTED,
|
|
23
|
+
JOINT_VAR,
|
|
24
|
+
type LabelHasher,
|
|
25
|
+
OP_BIND,
|
|
26
|
+
OP_CFILTER,
|
|
27
|
+
OP_CHECK,
|
|
28
|
+
OP_CHOOSE,
|
|
29
|
+
OP_COMPARE,
|
|
30
|
+
OP_CONTINUE,
|
|
31
|
+
OP_FILTER,
|
|
32
|
+
OP_GET_CGR,
|
|
33
|
+
OP_GET_ENODE,
|
|
34
|
+
OP_INIT,
|
|
35
|
+
OP_INITAC,
|
|
36
|
+
OP_IS_CGR,
|
|
37
|
+
OP_NOOP,
|
|
38
|
+
OP_PFILTER,
|
|
39
|
+
OP_YIELD,
|
|
40
|
+
} from "../mam-compiler";
|
|
41
|
+
import { type Egraph, type Enode, getClass } from "./egraph";
|
|
42
|
+
import type { TrailStack } from "./th-solver";
|
|
43
|
+
|
|
44
|
+
// euf::mam_solver: the solver whose trail undoes the matcher.
|
|
45
|
+
export interface MamSolver {
|
|
46
|
+
readonly manager: AstManager;
|
|
47
|
+
readonly egraph: Egraph;
|
|
48
|
+
readonly trail: TrailStack;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
export type OnBinding = (
|
|
52
|
+
quantifier: number,
|
|
53
|
+
pattern: number,
|
|
54
|
+
bindings: readonly Enode[],
|
|
55
|
+
maxGeneration: number,
|
|
56
|
+
) => void;
|
|
57
|
+
|
|
58
|
+
const isAcDecl = (manager: AstManager, decl: number) => {
|
|
59
|
+
const info = manager.funcDecls[decl];
|
|
60
|
+
if (info.family === FAMILY_BASIC)
|
|
61
|
+
return info.op === OP_AND || info.op === OP_OR || info.op === OP_XOR;
|
|
62
|
+
if (info.family === FAMILY_ARITH) return info.op === OP_ADD || info.op === OP_MUL;
|
|
63
|
+
return info.family === FAMILY_BV && isAssociativeBvOp(info.op);
|
|
64
|
+
};
|
|
65
|
+
|
|
66
|
+
interface BacktrackPoint {
|
|
67
|
+
instr: Instruction<Enode>;
|
|
68
|
+
oldMaxGeneration: number;
|
|
69
|
+
currGeneration: number;
|
|
70
|
+
curr: Enode | null;
|
|
71
|
+
candidates: readonly Enode[];
|
|
72
|
+
index: number;
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
const MAX_FILTERED_GET_CGR_ARGS = 6;
|
|
76
|
+
|
|
77
|
+
class Interpreter {
|
|
78
|
+
private registers: Enode[] = [];
|
|
79
|
+
private bindings: Enode[] = [];
|
|
80
|
+
private backtrackStack: BacktrackPoint[] = [];
|
|
81
|
+
private top = 0;
|
|
82
|
+
private maxGeneration = 0;
|
|
83
|
+
private currMaxGeneration = 0;
|
|
84
|
+
private acArgs: Enode[] = [];
|
|
85
|
+
private acBitset: boolean[] = [];
|
|
86
|
+
private acPatArg: number[] = [];
|
|
87
|
+
|
|
88
|
+
constructor(
|
|
89
|
+
private ctx: MamSolver,
|
|
90
|
+
private onBinding: OnBinding,
|
|
91
|
+
) {}
|
|
92
|
+
|
|
93
|
+
private pushPoint(instr: Instruction<Enode>, oldMaxGeneration: number) {
|
|
94
|
+
let point = this.backtrackStack[this.top];
|
|
95
|
+
if (point === undefined) {
|
|
96
|
+
point = {
|
|
97
|
+
instr,
|
|
98
|
+
oldMaxGeneration,
|
|
99
|
+
currGeneration: 0,
|
|
100
|
+
curr: null,
|
|
101
|
+
candidates: [],
|
|
102
|
+
index: 0,
|
|
103
|
+
};
|
|
104
|
+
this.backtrackStack.push(point);
|
|
105
|
+
}
|
|
106
|
+
point.instr = instr;
|
|
107
|
+
point.oldMaxGeneration = oldMaxGeneration;
|
|
108
|
+
this.top++;
|
|
109
|
+
return point;
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
private updateMaxGeneration(node: Enode) {
|
|
113
|
+
this.maxGeneration = Math.max(this.maxGeneration, node.generation);
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
private getFirstFApp(label: number, numArgs: number, first: Enode) {
|
|
117
|
+
let matchingCgr: Enode | null = null;
|
|
118
|
+
let minGenMatch: Enode | null = null;
|
|
119
|
+
for (const curr of getClass(first)) {
|
|
120
|
+
if (curr.decl !== label || curr.numArgs !== numArgs) continue;
|
|
121
|
+
if (curr.isCgr && matchingCgr === null) matchingCgr = curr;
|
|
122
|
+
if (minGenMatch === null || minGenMatch.generation > curr.generation) minGenMatch = curr;
|
|
123
|
+
}
|
|
124
|
+
if (matchingCgr !== null) this.updateMaxGeneration(minGenMatch as Enode);
|
|
125
|
+
return matchingCgr;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
private getNextFApp(label: number, numArgs: number, first: Enode, start: Enode) {
|
|
129
|
+
for (let curr = start.next; curr !== first; curr = curr.next)
|
|
130
|
+
if (curr.decl === label && curr.numArgs === numArgs && curr.isCgr) return curr;
|
|
131
|
+
return null;
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
private isCgr(instr: Instruction<Enode>) {
|
|
135
|
+
const numArgs = instr.numArgs;
|
|
136
|
+
const args = instr.regs.map((reg) => this.registers[reg].root);
|
|
137
|
+
const first = this.registers[instr.reg];
|
|
138
|
+
for (const node of getClass(first)) {
|
|
139
|
+
if (node.decl !== instr.label || (numArgs > 2 && node.numArgs !== numArgs)) continue;
|
|
140
|
+
if (args.every((arg, index) => node.getArg(index).root === arg)) {
|
|
141
|
+
this.updateMaxGeneration(node);
|
|
142
|
+
return true;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
return false;
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
private isRelevantParent(parent: Enode, decl: number, argIndex: number, child: Enode) {
|
|
149
|
+
return (
|
|
150
|
+
parent.decl === decl &&
|
|
151
|
+
argIndex < parent.numArgs &&
|
|
152
|
+
parent.isRelevant &&
|
|
153
|
+
parent.isCgr &&
|
|
154
|
+
parent.getArg(argIndex).root === child
|
|
155
|
+
);
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private getDepth1Vector(node: Enode, decl: number, argIndex: number, limit: number) {
|
|
159
|
+
const root = node.root;
|
|
160
|
+
const result: Enode[] = [];
|
|
161
|
+
for (const parent of root.parents) {
|
|
162
|
+
if (!this.isRelevantParent(parent, decl, argIndex, root)) continue;
|
|
163
|
+
if (result.length + 1 >= limit) return null;
|
|
164
|
+
result.push(parent);
|
|
165
|
+
}
|
|
166
|
+
return result;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private getDepth2Vector(joint: Joint<Enode>, decl: number, argIndex: number, limit: number) {
|
|
170
|
+
const root = this.registers[joint.reg].root;
|
|
171
|
+
if (root.parents.length === 0) return null;
|
|
172
|
+
const result: Enode[] = [];
|
|
173
|
+
for (const parent of root.parents) {
|
|
174
|
+
if (!this.isRelevantParent(parent, joint.decl, joint.argPos, root)) continue;
|
|
175
|
+
const parentRoot = parent.root;
|
|
176
|
+
for (const grandparent of parentRoot.parents) {
|
|
177
|
+
if (!this.isRelevantParent(grandparent, decl, argIndex, parentRoot)) continue;
|
|
178
|
+
if (result.length + 1 >= limit) return null;
|
|
179
|
+
result.push(grandparent);
|
|
180
|
+
}
|
|
181
|
+
}
|
|
182
|
+
return result;
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
private getJointNode(joint: Joint<Enode>) {
|
|
186
|
+
if (joint.kind === JOINT_GROUND) return joint.enode;
|
|
187
|
+
if (joint.kind === JOINT_VAR) return this.registers[joint.reg];
|
|
188
|
+
return null;
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
private initContinue(instr: Instruction<Enode>) {
|
|
192
|
+
const label = instr.label;
|
|
193
|
+
const all = this.ctx.egraph.enodesOf(label);
|
|
194
|
+
for (const joint of instr.joints) {
|
|
195
|
+
const node = this.getJointNode(joint);
|
|
196
|
+
if (node === null) continue;
|
|
197
|
+
const root = node.root;
|
|
198
|
+
if ((root.plbls & instr.lblLow) === 0 && (root.plblsHigh & instr.lblHigh) === 0) return null;
|
|
199
|
+
if (root.parents.length === 0) return null;
|
|
200
|
+
}
|
|
201
|
+
let best: Enode[] | null = null;
|
|
202
|
+
for (let argIndex = 0; argIndex < instr.joints.length; argIndex++) {
|
|
203
|
+
const joint = instr.joints[argIndex];
|
|
204
|
+
const node = this.getJointNode(joint);
|
|
205
|
+
const limit: number = best === null ? all.length : Math.min(all.length, best.length);
|
|
206
|
+
const current =
|
|
207
|
+
node !== null
|
|
208
|
+
? this.getDepth1Vector(node, label, argIndex, limit)
|
|
209
|
+
: joint.kind === JOINT_NESTED
|
|
210
|
+
? this.getDepth2Vector(joint, label, argIndex, limit)
|
|
211
|
+
: null;
|
|
212
|
+
if (
|
|
213
|
+
current === null ||
|
|
214
|
+
current.length >= all.length ||
|
|
215
|
+
(best !== null && current.length >= best.length)
|
|
216
|
+
)
|
|
217
|
+
continue;
|
|
218
|
+
if (current.length === 0) return null;
|
|
219
|
+
best = current;
|
|
220
|
+
}
|
|
221
|
+
const candidates = best ?? all;
|
|
222
|
+
let index = 0;
|
|
223
|
+
while (index < candidates.length) {
|
|
224
|
+
const node = candidates[index];
|
|
225
|
+
if (node.numArgs === instr.numArgs && node.isRelevant) break;
|
|
226
|
+
index++;
|
|
227
|
+
}
|
|
228
|
+
if (index === candidates.length) return null;
|
|
229
|
+
const point = this.pushPoint(instr, this.maxGeneration);
|
|
230
|
+
point.candidates = candidates;
|
|
231
|
+
point.index = index;
|
|
232
|
+
this.updateMaxGeneration(candidates[index]);
|
|
233
|
+
return candidates[index];
|
|
234
|
+
}
|
|
235
|
+
|
|
236
|
+
private setArgs(oreg: number, node: Enode, numArgs: number) {
|
|
237
|
+
for (let index = 0; index < numArgs; index++) this.registers[oreg + index] = node.getArg(index);
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
private initAc(instr: Instruction<Enode>) {
|
|
241
|
+
const app = this.registers[0];
|
|
242
|
+
const acArgs = this.acArgs;
|
|
243
|
+
acArgs.length = 0;
|
|
244
|
+
acArgs.push(app);
|
|
245
|
+
const manager = this.ctx.manager;
|
|
246
|
+
for (let index = 0; index < acArgs.length; index++) {
|
|
247
|
+
const arg = acArgs[index];
|
|
248
|
+
if (!manager.isApp(arg.owner) || arg.decl !== app.decl) continue;
|
|
249
|
+
acArgs.push(...arg.args);
|
|
250
|
+
acArgs[index] = acArgs[acArgs.length - 1];
|
|
251
|
+
acArgs.pop();
|
|
252
|
+
index--;
|
|
253
|
+
}
|
|
254
|
+
const numPatArgs = instr.numArgs;
|
|
255
|
+
if (numPatArgs > acArgs.length) return false;
|
|
256
|
+
this.acBitset = acArgs.map(() => false);
|
|
257
|
+
this.acPatArg = acArgs.map(() => 0);
|
|
258
|
+
this.pushPoint(instr, this.currMaxGeneration);
|
|
259
|
+
for (let index = 0; index < numPatArgs; index++) {
|
|
260
|
+
this.acPatArg[index] = index;
|
|
261
|
+
this.acBitset[index] = true;
|
|
262
|
+
this.registers[index + 1] = acArgs[index];
|
|
263
|
+
}
|
|
264
|
+
return true;
|
|
265
|
+
}
|
|
266
|
+
|
|
267
|
+
private nextAcMatch(numArgs: number) {
|
|
268
|
+
const acArgs = this.acArgs;
|
|
269
|
+
const bitset = this.acBitset;
|
|
270
|
+
const patArg = this.acPatArg;
|
|
271
|
+
for (let index = numArgs; index-- > 0;) {
|
|
272
|
+
let next = patArg[index];
|
|
273
|
+
bitset[next] = false;
|
|
274
|
+
for (;;) {
|
|
275
|
+
next++;
|
|
276
|
+
while (next < acArgs.length && bitset[next]) next++;
|
|
277
|
+
if (next === acArgs.length) break;
|
|
278
|
+
this.registers[index + 1] = acArgs[next];
|
|
279
|
+
bitset[next] = true;
|
|
280
|
+
patArg[index] = next;
|
|
281
|
+
let isFilled = true;
|
|
282
|
+
for (let later = index + 1; later < numArgs; later++) {
|
|
283
|
+
const free = bitset.indexOf(false);
|
|
284
|
+
if (free === -1) {
|
|
285
|
+
for (let undone = later - 1; undone >= index; undone--) bitset[patArg[undone]] = false;
|
|
286
|
+
isFilled = false;
|
|
287
|
+
break;
|
|
288
|
+
}
|
|
289
|
+
this.registers[later + 1] = acArgs[free];
|
|
290
|
+
bitset[free] = true;
|
|
291
|
+
patArg[later] = free;
|
|
292
|
+
}
|
|
293
|
+
if (isFilled) return true;
|
|
294
|
+
next = patArg[index];
|
|
295
|
+
}
|
|
296
|
+
}
|
|
297
|
+
return false;
|
|
298
|
+
}
|
|
299
|
+
|
|
300
|
+
private resume(point: BacktrackPoint): Instruction<Enode> | null {
|
|
301
|
+
const instr = point.instr;
|
|
302
|
+
switch (instr.op) {
|
|
303
|
+
case OP_CHOOSE:
|
|
304
|
+
this.top--;
|
|
305
|
+
return instr.alt;
|
|
306
|
+
case OP_BIND: {
|
|
307
|
+
const node = this.getNextFApp(
|
|
308
|
+
instr.label,
|
|
309
|
+
instr.numArgs,
|
|
310
|
+
this.registers[instr.reg],
|
|
311
|
+
point.curr as Enode,
|
|
312
|
+
);
|
|
313
|
+
if (node === null) {
|
|
314
|
+
this.top--;
|
|
315
|
+
return null;
|
|
316
|
+
}
|
|
317
|
+
point.curr = node;
|
|
318
|
+
this.maxGeneration = point.currGeneration;
|
|
319
|
+
this.setArgs(instr.oreg, node, instr.numArgs);
|
|
320
|
+
return instr.next;
|
|
321
|
+
}
|
|
322
|
+
case OP_INITAC:
|
|
323
|
+
if (this.nextAcMatch(instr.numArgs)) return instr.next;
|
|
324
|
+
this.top--;
|
|
325
|
+
return null;
|
|
326
|
+
default:
|
|
327
|
+
for (point.index++; point.index < point.candidates.length; point.index++) {
|
|
328
|
+
const node = point.candidates[point.index];
|
|
329
|
+
if (node.numArgs === instr.numArgs && node.isRelevant) {
|
|
330
|
+
this.updateMaxGeneration(node);
|
|
331
|
+
this.setArgs(instr.oreg, node, instr.numArgs);
|
|
332
|
+
return instr.next;
|
|
333
|
+
}
|
|
334
|
+
}
|
|
335
|
+
this.top--;
|
|
336
|
+
return null;
|
|
337
|
+
}
|
|
338
|
+
}
|
|
339
|
+
|
|
340
|
+
executeCore(tree: CodeTree<Enode>, node: Enode) {
|
|
341
|
+
const manager = this.ctx.manager;
|
|
342
|
+
const egraph = this.ctx.egraph;
|
|
343
|
+
const registers = this.registers;
|
|
344
|
+
if (!node.isRelevant) return false;
|
|
345
|
+
this.maxGeneration = node.generation;
|
|
346
|
+
registers[0] = node;
|
|
347
|
+
this.top = 0;
|
|
348
|
+
let pc: Instruction<Enode> | null = tree.root;
|
|
349
|
+
for (;;) {
|
|
350
|
+
if (pc === null) {
|
|
351
|
+
if (this.top === 0) return true;
|
|
352
|
+
const point = this.backtrackStack[this.top - 1];
|
|
353
|
+
this.maxGeneration = point.oldMaxGeneration;
|
|
354
|
+
pc = this.resume(point);
|
|
355
|
+
continue;
|
|
356
|
+
}
|
|
357
|
+
const instr: Instruction<Enode> = pc;
|
|
358
|
+
pc = null;
|
|
359
|
+
switch (instr.op) {
|
|
360
|
+
case OP_INIT: {
|
|
361
|
+
const first = registers[0];
|
|
362
|
+
if (first.numArgs !== instr.numArgs) break;
|
|
363
|
+
this.setArgs(1, first, instr.numArgs);
|
|
364
|
+
pc = instr.next;
|
|
365
|
+
break;
|
|
366
|
+
}
|
|
367
|
+
case OP_INITAC:
|
|
368
|
+
if (this.initAc(instr)) pc = instr.next;
|
|
369
|
+
break;
|
|
370
|
+
case OP_COMPARE:
|
|
371
|
+
if (registers[instr.reg].root === registers[instr.reg2].root) pc = instr.next;
|
|
372
|
+
break;
|
|
373
|
+
case OP_CHECK:
|
|
374
|
+
if (registers[instr.reg].root === (instr.enode as Enode).root) pc = instr.next;
|
|
375
|
+
break;
|
|
376
|
+
case OP_CFILTER:
|
|
377
|
+
case OP_FILTER:
|
|
378
|
+
case OP_PFILTER: {
|
|
379
|
+
const root = registers[instr.reg].root;
|
|
380
|
+
const isParent = instr.op === OP_PFILTER;
|
|
381
|
+
const low = isParent ? root.plbls : root.lbls;
|
|
382
|
+
const high = isParent ? root.plblsHigh : root.lblsHigh;
|
|
383
|
+
if ((low & instr.lblLow) !== 0 || (high & instr.lblHigh) !== 0) pc = instr.next;
|
|
384
|
+
break;
|
|
385
|
+
}
|
|
386
|
+
case OP_CHOOSE:
|
|
387
|
+
this.pushPoint(instr, this.maxGeneration);
|
|
388
|
+
pc = instr.next;
|
|
389
|
+
break;
|
|
390
|
+
case OP_NOOP:
|
|
391
|
+
pc = instr.next;
|
|
392
|
+
break;
|
|
393
|
+
case OP_BIND: {
|
|
394
|
+
this.currMaxGeneration = this.maxGeneration;
|
|
395
|
+
const found = this.getFirstFApp(instr.label, instr.numArgs, registers[instr.reg]);
|
|
396
|
+
if (found === null) break;
|
|
397
|
+
const point = this.pushPoint(instr, this.currMaxGeneration);
|
|
398
|
+
point.curr = found;
|
|
399
|
+
point.currGeneration = this.maxGeneration;
|
|
400
|
+
this.setArgs(instr.oreg, found, instr.numArgs);
|
|
401
|
+
pc = instr.next;
|
|
402
|
+
break;
|
|
403
|
+
}
|
|
404
|
+
case OP_YIELD: {
|
|
405
|
+
const numBindings = instr.regs.length;
|
|
406
|
+
const bindings = this.bindings;
|
|
407
|
+
bindings.length = 0;
|
|
408
|
+
for (let index = 0; index < numBindings; index++)
|
|
409
|
+
bindings.push(registers[instr.regs[numBindings - index - 1]]);
|
|
410
|
+
for (const binding of bindings)
|
|
411
|
+
this.maxGeneration = Math.max(this.maxGeneration, binding.generation);
|
|
412
|
+
if (!manager.limit.inc()) return false;
|
|
413
|
+
this.onBinding(instr.quantifier, instr.pattern, bindings, this.maxGeneration);
|
|
414
|
+
break;
|
|
415
|
+
}
|
|
416
|
+
case OP_GET_ENODE:
|
|
417
|
+
registers[instr.oreg] = instr.enode as Enode;
|
|
418
|
+
pc = instr.next;
|
|
419
|
+
break;
|
|
420
|
+
case OP_GET_CGR: {
|
|
421
|
+
const args = instr.regs.map((reg) => registers[reg]);
|
|
422
|
+
if (
|
|
423
|
+
instr.numArgs <= MAX_FILTERED_GET_CGR_ARGS &&
|
|
424
|
+
args.some(
|
|
425
|
+
(arg) =>
|
|
426
|
+
(arg.root.plbls & instr.lblLow) === 0 && (arg.root.plblsHigh & instr.lblHigh) === 0,
|
|
427
|
+
)
|
|
428
|
+
)
|
|
429
|
+
break;
|
|
430
|
+
const found = egraph.findCongruent(instr.label, args);
|
|
431
|
+
if (found === undefined || !found.isRelevant) break;
|
|
432
|
+
this.updateMaxGeneration(found);
|
|
433
|
+
registers[instr.oreg] = found;
|
|
434
|
+
pc = instr.next;
|
|
435
|
+
break;
|
|
436
|
+
}
|
|
437
|
+
case OP_IS_CGR:
|
|
438
|
+
if (this.isCgr(instr)) pc = instr.next;
|
|
439
|
+
break;
|
|
440
|
+
case OP_CONTINUE: {
|
|
441
|
+
const found = this.initContinue(instr);
|
|
442
|
+
if (found === null) break;
|
|
443
|
+
this.setArgs(instr.oreg, found, instr.numArgs);
|
|
444
|
+
pc = instr.next;
|
|
445
|
+
break;
|
|
446
|
+
}
|
|
447
|
+
}
|
|
448
|
+
}
|
|
449
|
+
}
|
|
450
|
+
|
|
451
|
+
execute(tree: CodeTree<Enode>) {
|
|
452
|
+
if (tree.qhead >= tree.candidates.length) return;
|
|
453
|
+
const qhead = tree.qhead;
|
|
454
|
+
this.ctx.trail.push(() => {
|
|
455
|
+
tree.qhead = qhead;
|
|
456
|
+
});
|
|
457
|
+
const start = tree.qhead;
|
|
458
|
+
const isFiltering = tree.isFilteringCandidates;
|
|
459
|
+
while (tree.qhead < tree.candidates.length) {
|
|
460
|
+
const app = tree.candidates[tree.qhead++];
|
|
461
|
+
if (isFiltering ? !app.isMarked3 && app.isCgr : app.isCgr) {
|
|
462
|
+
this.executeCore(tree, app);
|
|
463
|
+
if (isFiltering) app.isMarked3 = true;
|
|
464
|
+
}
|
|
465
|
+
}
|
|
466
|
+
if (!isFiltering) return;
|
|
467
|
+
for (let index = tree.candidates.length; index-- > start;)
|
|
468
|
+
tree.candidates[index].isMarked3 = false;
|
|
469
|
+
}
|
|
470
|
+
}
|
|
471
|
+
|
|
472
|
+
interface Path {
|
|
473
|
+
label: number;
|
|
474
|
+
argIndex: number;
|
|
475
|
+
groundArgIndex: number;
|
|
476
|
+
groundArg: Enode | null;
|
|
477
|
+
patternIndex: number;
|
|
478
|
+
child: Path | null;
|
|
479
|
+
}
|
|
480
|
+
|
|
481
|
+
interface PathTree {
|
|
482
|
+
label: number;
|
|
483
|
+
argIndex: number;
|
|
484
|
+
groundArgIndex: number;
|
|
485
|
+
groundArg: Enode | null;
|
|
486
|
+
filter: number;
|
|
487
|
+
filterHigh: number;
|
|
488
|
+
code: CodeTree<Enode> | null;
|
|
489
|
+
firstChild: PathTree | null;
|
|
490
|
+
sibling: PathTree | null;
|
|
491
|
+
todo: Enode[] | null;
|
|
492
|
+
}
|
|
493
|
+
|
|
494
|
+
const isEqualPath = (first: Path, second: Path): boolean => {
|
|
495
|
+
let left = first;
|
|
496
|
+
let right = second;
|
|
497
|
+
for (;;) {
|
|
498
|
+
if (
|
|
499
|
+
left.label !== right.label ||
|
|
500
|
+
left.argIndex !== right.argIndex ||
|
|
501
|
+
left.patternIndex !== right.patternIndex ||
|
|
502
|
+
(left.child === null) !== (right.child === null)
|
|
503
|
+
)
|
|
504
|
+
return false;
|
|
505
|
+
if (left.child === null || right.child === null) return true;
|
|
506
|
+
left = left.child;
|
|
507
|
+
right = right.child;
|
|
508
|
+
}
|
|
509
|
+
};
|
|
510
|
+
|
|
511
|
+
interface MultiPattern {
|
|
512
|
+
quantifier: number;
|
|
513
|
+
pattern: number;
|
|
514
|
+
patterns: number[];
|
|
515
|
+
}
|
|
516
|
+
|
|
517
|
+
// euf::mam::ground_subterms: the maximal ground applications of an expression.
|
|
518
|
+
export const getGroundSubterms = (manager: AstManager, expr: number) => {
|
|
519
|
+
const ground: number[] = [];
|
|
520
|
+
if (!manager.isApp(expr)) return ground;
|
|
521
|
+
const seen = new Set<number>();
|
|
522
|
+
const todo = [expr];
|
|
523
|
+
for (let node = todo.pop(); node !== undefined; node = todo.pop()) {
|
|
524
|
+
if (seen.has(node)) continue;
|
|
525
|
+
seen.add(node);
|
|
526
|
+
if (manager.isGroundApp(node)) ground.push(node);
|
|
527
|
+
else
|
|
528
|
+
for (let index = 0; index < manager.getNumArgs(node); index++) {
|
|
529
|
+
const arg = manager.getArg(node, index);
|
|
530
|
+
if (manager.isApp(arg)) todo.push(arg);
|
|
531
|
+
}
|
|
532
|
+
}
|
|
533
|
+
return ground;
|
|
534
|
+
};
|
|
535
|
+
|
|
536
|
+
export class Mam implements LabelHasher<Enode> {
|
|
537
|
+
private trees = new Map<number, CodeTree<Enode>>();
|
|
538
|
+
private toMatch: CodeTree<Enode>[] = [];
|
|
539
|
+
private toMatchHead = 0;
|
|
540
|
+
private newPatterns: MultiPattern[] = [];
|
|
541
|
+
private newPatternsHead = 0;
|
|
542
|
+
private pc = new Map<number, PathTree>();
|
|
543
|
+
private pp = new Map<number, (PathTree | null)[]>();
|
|
544
|
+
private plbls = new Set<number>();
|
|
545
|
+
private clbls = new Set<number>();
|
|
546
|
+
private root: Enode | null = null;
|
|
547
|
+
private other: Enode | null = null;
|
|
548
|
+
private visitedParents: Enode[] = [];
|
|
549
|
+
private queuedRoots: Enode[] = [];
|
|
550
|
+
private labelHashes: (number | undefined)[] = [];
|
|
551
|
+
private compiler: Compiler<Enode>;
|
|
552
|
+
private interpreter: Interpreter;
|
|
553
|
+
|
|
554
|
+
constructor(
|
|
555
|
+
private ctx: MamSolver,
|
|
556
|
+
onBinding: OnBinding,
|
|
557
|
+
) {
|
|
558
|
+
const manager = ctx.manager;
|
|
559
|
+
this.compiler = new Compiler<Enode>(
|
|
560
|
+
{ manager, pushTrail: (undo) => ctx.trail.push(undo) },
|
|
561
|
+
this,
|
|
562
|
+
(decl) => isAcDecl(manager, decl),
|
|
563
|
+
);
|
|
564
|
+
this.interpreter = new Interpreter(ctx, onBinding);
|
|
565
|
+
}
|
|
566
|
+
|
|
567
|
+
private get manager() {
|
|
568
|
+
return this.ctx.manager;
|
|
569
|
+
}
|
|
570
|
+
|
|
571
|
+
private pushTrail(undo: () => void) {
|
|
572
|
+
this.ctx.trail.push(undo);
|
|
573
|
+
}
|
|
574
|
+
|
|
575
|
+
getLabelHash(decl: number) {
|
|
576
|
+
const cached = this.labelHashes[decl];
|
|
577
|
+
if (cached !== undefined) return cached;
|
|
578
|
+
const hash = mkMix(17, 3, this.manager.funcDecls[decl].smallId) & 63;
|
|
579
|
+
this.labelHashes[decl] = hash;
|
|
580
|
+
return hash;
|
|
581
|
+
}
|
|
582
|
+
|
|
583
|
+
getLblHash(node: Enode) {
|
|
584
|
+
if (node.lblHash === -1)
|
|
585
|
+
this.ctx.egraph.setLblHash(node, hashU(this.manager.ids[node.owner]) & 63);
|
|
586
|
+
return node.lblHash;
|
|
587
|
+
}
|
|
588
|
+
|
|
589
|
+
getGroundEnode(expr: number) {
|
|
590
|
+
return this.ctx.egraph.find(expr) ?? null;
|
|
591
|
+
}
|
|
592
|
+
|
|
593
|
+
canPropagate() {
|
|
594
|
+
return this.toMatch.length > 0 || this.newPatterns.length > 0;
|
|
595
|
+
}
|
|
596
|
+
|
|
597
|
+
private setLbls(root: Enode, isParent: boolean, hash: number) {
|
|
598
|
+
const low = isParent ? root.plbls : root.lbls;
|
|
599
|
+
const high = isParent ? root.plblsHigh : root.lblsHigh;
|
|
600
|
+
if (hasHash(low, high, hash)) return;
|
|
601
|
+
this.pushTrail(() => {
|
|
602
|
+
if (isParent) {
|
|
603
|
+
root.plbls = low;
|
|
604
|
+
root.plblsHigh = high;
|
|
605
|
+
} else {
|
|
606
|
+
root.lbls = low;
|
|
607
|
+
root.lblsHigh = high;
|
|
608
|
+
}
|
|
609
|
+
});
|
|
610
|
+
const bit = 1 << hash;
|
|
611
|
+
if (isParent && hash < 32) root.plbls |= bit;
|
|
612
|
+
else if (isParent) root.plblsHigh |= bit;
|
|
613
|
+
else if (hash < 32) root.lbls |= bit;
|
|
614
|
+
else root.lblsHigh |= bit;
|
|
615
|
+
}
|
|
616
|
+
|
|
617
|
+
private updateChildrenPlbls(node: Enode, hash: number) {
|
|
618
|
+
for (const arg of node.args) this.setLbls(arg.root, true, hash);
|
|
619
|
+
}
|
|
620
|
+
|
|
621
|
+
private updatePlbls(decl: number) {
|
|
622
|
+
if (this.plbls.has(decl)) return;
|
|
623
|
+
this.plbls.add(decl);
|
|
624
|
+
this.pushTrail(() => this.plbls.delete(decl));
|
|
625
|
+
const hash = this.getLabelHash(decl);
|
|
626
|
+
for (const node of this.ctx.egraph.enodesOf(decl))
|
|
627
|
+
if (node.isRelevant) this.updateChildrenPlbls(node, hash);
|
|
628
|
+
}
|
|
629
|
+
|
|
630
|
+
private updateClbls(decl: number) {
|
|
631
|
+
if (this.clbls.has(decl)) return;
|
|
632
|
+
this.clbls.add(decl);
|
|
633
|
+
this.pushTrail(() => this.clbls.delete(decl));
|
|
634
|
+
const hash = this.getLabelHash(decl);
|
|
635
|
+
for (const node of this.ctx.egraph.enodesOf(decl))
|
|
636
|
+
if (node.isRelevant) this.setLbls(node.root, false, hash);
|
|
637
|
+
}
|
|
638
|
+
|
|
639
|
+
private mkPathTree(path: Path, mp: MultiPattern): PathTree {
|
|
640
|
+
const hash = this.getLabelHash(path.label);
|
|
641
|
+
const tree: PathTree = {
|
|
642
|
+
label: path.label,
|
|
643
|
+
argIndex: path.argIndex,
|
|
644
|
+
groundArgIndex: path.groundArgIndex,
|
|
645
|
+
groundArg: path.groundArg,
|
|
646
|
+
filter: hash < 32 ? 1 << hash : 0,
|
|
647
|
+
filterHigh: hash < 32 ? 0 : 1 << hash,
|
|
648
|
+
code: null,
|
|
649
|
+
firstChild: null,
|
|
650
|
+
sibling: null,
|
|
651
|
+
todo: null,
|
|
652
|
+
};
|
|
653
|
+
if (path.child === null)
|
|
654
|
+
tree.code = this.compiler.mkTree(
|
|
655
|
+
mp.quantifier,
|
|
656
|
+
mp.patterns,
|
|
657
|
+
path.patternIndex,
|
|
658
|
+
true,
|
|
659
|
+
mp.pattern,
|
|
660
|
+
);
|
|
661
|
+
else tree.firstChild = this.mkPathTree(path.child, mp);
|
|
662
|
+
return tree;
|
|
663
|
+
}
|
|
664
|
+
|
|
665
|
+
private insertPath(head: PathTree, path: Path, mp: MultiPattern) {
|
|
666
|
+
let isLabelFound = false;
|
|
667
|
+
let last = head;
|
|
668
|
+
for (let tree: PathTree | null = head; tree !== null; tree = tree.sibling) {
|
|
669
|
+
last = tree;
|
|
670
|
+
if (tree.label !== path.label) continue;
|
|
671
|
+
isLabelFound = true;
|
|
672
|
+
if (
|
|
673
|
+
tree.argIndex !== path.argIndex ||
|
|
674
|
+
tree.groundArg !== path.groundArg ||
|
|
675
|
+
tree.groundArgIndex !== path.groundArgIndex
|
|
676
|
+
)
|
|
677
|
+
continue;
|
|
678
|
+
const found = tree;
|
|
679
|
+
if (path.child !== null && found.firstChild !== null)
|
|
680
|
+
this.insertPath(found.firstChild, path.child, mp);
|
|
681
|
+
else if (path.child !== null) {
|
|
682
|
+
found.firstChild = this.mkPathTree(path.child, mp);
|
|
683
|
+
this.pushTrail(() => {
|
|
684
|
+
found.firstChild = null;
|
|
685
|
+
});
|
|
686
|
+
} else if (found.code !== null)
|
|
687
|
+
this.compiler.insert(
|
|
688
|
+
found.code,
|
|
689
|
+
mp.quantifier,
|
|
690
|
+
mp.patterns,
|
|
691
|
+
path.patternIndex,
|
|
692
|
+
false,
|
|
693
|
+
mp.pattern,
|
|
694
|
+
);
|
|
695
|
+
else {
|
|
696
|
+
found.code = this.compiler.mkTree(
|
|
697
|
+
mp.quantifier,
|
|
698
|
+
mp.patterns,
|
|
699
|
+
path.patternIndex,
|
|
700
|
+
true,
|
|
701
|
+
mp.pattern,
|
|
702
|
+
);
|
|
703
|
+
this.pushTrail(() => {
|
|
704
|
+
found.code = null;
|
|
705
|
+
});
|
|
706
|
+
}
|
|
707
|
+
return;
|
|
708
|
+
}
|
|
709
|
+
const previous = last;
|
|
710
|
+
previous.sibling = this.mkPathTree(path, mp);
|
|
711
|
+
this.pushTrail(() => {
|
|
712
|
+
previous.sibling = null;
|
|
713
|
+
});
|
|
714
|
+
if (isLabelFound) return;
|
|
715
|
+
const low = head.filter;
|
|
716
|
+
const high = head.filterHigh;
|
|
717
|
+
this.pushTrail(() => {
|
|
718
|
+
head.filter = low;
|
|
719
|
+
head.filterHigh = high;
|
|
720
|
+
});
|
|
721
|
+
const hash = this.getLabelHash(path.label);
|
|
722
|
+
if (hash < 32) head.filter |= 1 << hash;
|
|
723
|
+
else head.filterHigh |= 1 << hash;
|
|
724
|
+
}
|
|
725
|
+
|
|
726
|
+
private updatePc(firstHash: number, secondHash: number, path: Path, mp: MultiPattern) {
|
|
727
|
+
const key = firstHash * 64 + secondHash;
|
|
728
|
+
const existing = this.pc.get(key);
|
|
729
|
+
if (existing !== undefined) {
|
|
730
|
+
this.insertPath(existing, path, mp);
|
|
731
|
+
return;
|
|
732
|
+
}
|
|
733
|
+
this.pc.set(key, this.mkPathTree(path, mp));
|
|
734
|
+
this.pushTrail(() => this.pc.delete(key));
|
|
735
|
+
}
|
|
736
|
+
|
|
737
|
+
private updatePp(
|
|
738
|
+
inputFirstHash: number,
|
|
739
|
+
inputSecondHash: number,
|
|
740
|
+
inputFirst: Path,
|
|
741
|
+
inputSecond: Path,
|
|
742
|
+
mp: MultiPattern,
|
|
743
|
+
) {
|
|
744
|
+
if (inputFirstHash === inputSecondHash) {
|
|
745
|
+
const key = inputFirstHash * 65;
|
|
746
|
+
const entry = this.pp.get(key);
|
|
747
|
+
if (entry !== undefined) {
|
|
748
|
+
this.insertPath(entry[0] as PathTree, inputFirst, mp);
|
|
749
|
+
if (!isEqualPath(inputFirst, inputSecond))
|
|
750
|
+
this.insertPath(entry[0] as PathTree, inputSecond, mp);
|
|
751
|
+
return;
|
|
752
|
+
}
|
|
753
|
+
const tree = this.mkPathTree(inputFirst, mp);
|
|
754
|
+
this.pp.set(key, [tree, null]);
|
|
755
|
+
this.pushTrail(() => this.pp.delete(key));
|
|
756
|
+
this.insertPath(tree, inputSecond, mp);
|
|
757
|
+
return;
|
|
758
|
+
}
|
|
759
|
+
const isSwapped = inputFirstHash > inputSecondHash;
|
|
760
|
+
const firstHash = isSwapped ? inputSecondHash : inputFirstHash;
|
|
761
|
+
const secondHash = isSwapped ? inputFirstHash : inputSecondHash;
|
|
762
|
+
const first = isSwapped ? inputSecond : inputFirst;
|
|
763
|
+
const second = isSwapped ? inputFirst : inputSecond;
|
|
764
|
+
const key = firstHash * 64 + secondHash;
|
|
765
|
+
const entry = this.pp.get(key);
|
|
766
|
+
if (entry !== undefined) {
|
|
767
|
+
this.insertPath(entry[0] as PathTree, first, mp);
|
|
768
|
+
this.insertPath(entry[1] as PathTree, second, mp);
|
|
769
|
+
return;
|
|
770
|
+
}
|
|
771
|
+
this.pp.set(key, [this.mkPathTree(first, mp), this.mkPathTree(second, mp)]);
|
|
772
|
+
this.pushTrail(() => this.pp.delete(key));
|
|
773
|
+
}
|
|
774
|
+
|
|
775
|
+
private updateFilters(
|
|
776
|
+
pattern: number,
|
|
777
|
+
parentPath: Path | null,
|
|
778
|
+
patternIndex: number,
|
|
779
|
+
varPaths: Path[][],
|
|
780
|
+
mp: MultiPattern,
|
|
781
|
+
) {
|
|
782
|
+
const manager = this.manager;
|
|
783
|
+
const numArgs = manager.getNumArgs(pattern);
|
|
784
|
+
let groundArgIndex = 0;
|
|
785
|
+
let groundArg: Enode | null = null;
|
|
786
|
+
for (let index = 0; index < numArgs; index++)
|
|
787
|
+
if (manager.isGroundApp(manager.getArg(pattern, index))) {
|
|
788
|
+
groundArgIndex = index;
|
|
789
|
+
groundArg = this.getGroundEnode(manager.getArg(pattern, index));
|
|
790
|
+
break;
|
|
791
|
+
}
|
|
792
|
+
const label = manager.decls[pattern];
|
|
793
|
+
for (let index = 0; index < numArgs; index++) {
|
|
794
|
+
const child = manager.getArg(pattern, index);
|
|
795
|
+
const path: Path = {
|
|
796
|
+
label,
|
|
797
|
+
argIndex: index,
|
|
798
|
+
groundArgIndex,
|
|
799
|
+
groundArg,
|
|
800
|
+
patternIndex,
|
|
801
|
+
child: parentPath,
|
|
802
|
+
};
|
|
803
|
+
if (manager.kinds[child] === KIND_VAR) {
|
|
804
|
+
const varIndex = manager.values[child];
|
|
805
|
+
if (varIndex >= varPaths.length) continue;
|
|
806
|
+
const paths = varPaths[varIndex];
|
|
807
|
+
let isFound = false;
|
|
808
|
+
for (const existing of paths) {
|
|
809
|
+
if (isEqualPath(path, existing)) isFound = true;
|
|
810
|
+
this.updatePlbls(existing.label);
|
|
811
|
+
this.updatePlbls(path.label);
|
|
812
|
+
this.updatePp(
|
|
813
|
+
this.getLabelHash(existing.label),
|
|
814
|
+
this.getLabelHash(path.label),
|
|
815
|
+
existing,
|
|
816
|
+
path,
|
|
817
|
+
mp,
|
|
818
|
+
);
|
|
819
|
+
}
|
|
820
|
+
if (!isFound) paths.push(path);
|
|
821
|
+
continue;
|
|
822
|
+
}
|
|
823
|
+
if (manager.isGroundApp(child)) {
|
|
824
|
+
const node = this.getGroundEnode(child);
|
|
825
|
+
if (node === null) continue;
|
|
826
|
+
this.updatePlbls(label);
|
|
827
|
+
this.updatePc(this.getLabelHash(label), this.getLblHash(node), path, mp);
|
|
828
|
+
continue;
|
|
829
|
+
}
|
|
830
|
+
const childLabel = manager.decls[child];
|
|
831
|
+
this.updatePlbls(label);
|
|
832
|
+
this.updateClbls(childLabel);
|
|
833
|
+
this.updatePc(this.getLabelHash(label), this.getLabelHash(childLabel), path, mp);
|
|
834
|
+
this.updateFilters(child, path, patternIndex, varPaths, mp);
|
|
835
|
+
}
|
|
836
|
+
}
|
|
837
|
+
|
|
838
|
+
addPattern(quantifier: number, pattern: number) {
|
|
839
|
+
const manager = this.manager;
|
|
840
|
+
const patterns = manager.getArgs(pattern);
|
|
841
|
+
if (patterns.every((arg) => manager.isGroundApp(arg))) return;
|
|
842
|
+
if (patterns.some((arg) => manager.hasQuantifierFlags[arg])) return;
|
|
843
|
+
const mp: MultiPattern = { quantifier, pattern, patterns };
|
|
844
|
+
const numDecls = manager.getQuantifier(quantifier).sorts.length;
|
|
845
|
+
const varPaths: Path[][] = Array.from({ length: numDecls }, () => []);
|
|
846
|
+
patterns.forEach((arg, index) => this.updateFilters(arg, null, index, varPaths, mp));
|
|
847
|
+
this.newPatterns.push(mp);
|
|
848
|
+
this.pushTrail(() => this.newPatterns.pop());
|
|
849
|
+
patterns.forEach((arg, firstIndex) => {
|
|
850
|
+
if (manager.isGroundApp(arg)) return;
|
|
851
|
+
const label = manager.decls[arg];
|
|
852
|
+
const tree = this.trees.get(label);
|
|
853
|
+
if (tree !== undefined) {
|
|
854
|
+
this.compiler.insert(tree, quantifier, patterns, firstIndex, false, pattern);
|
|
855
|
+
return;
|
|
856
|
+
}
|
|
857
|
+
this.trees.set(label, this.compiler.mkTree(quantifier, patterns, firstIndex, false, pattern));
|
|
858
|
+
this.pushTrail(() => this.trees.delete(label));
|
|
859
|
+
});
|
|
860
|
+
}
|
|
861
|
+
|
|
862
|
+
private addCandidateTo(tree: CodeTree<Enode>, node: Enode) {
|
|
863
|
+
if (tree.qhead >= tree.candidates.length) {
|
|
864
|
+
this.toMatch.push(tree);
|
|
865
|
+
this.pushTrail(() => this.toMatch.pop());
|
|
866
|
+
}
|
|
867
|
+
tree.candidates.push(node);
|
|
868
|
+
this.pushTrail(() => tree.candidates.pop());
|
|
869
|
+
}
|
|
870
|
+
|
|
871
|
+
addNode(node: Enode, isLazy: boolean) {
|
|
872
|
+
if (node.lblHash !== -1) this.setLbls(node.root, false, node.lblHash);
|
|
873
|
+
if (node.numArgs === 0) return;
|
|
874
|
+
const hash = this.getLabelHash(node.decl);
|
|
875
|
+
if (this.clbls.has(node.decl)) this.setLbls(node.root, false, hash);
|
|
876
|
+
if (this.plbls.has(node.decl)) this.updateChildrenPlbls(node, hash);
|
|
877
|
+
const tree = this.trees.get(node.decl);
|
|
878
|
+
if (!isLazy && tree !== undefined) this.addCandidateTo(tree, node);
|
|
879
|
+
}
|
|
880
|
+
|
|
881
|
+
private isEqModMerge(first: Enode, second: Enode) {
|
|
882
|
+
const firstRoot = first.root;
|
|
883
|
+
const secondRoot = second.root;
|
|
884
|
+
return (
|
|
885
|
+
firstRoot === secondRoot ||
|
|
886
|
+
(firstRoot === this.other && secondRoot === this.root) ||
|
|
887
|
+
(firstRoot === this.root && secondRoot === this.other)
|
|
888
|
+
);
|
|
889
|
+
}
|
|
890
|
+
|
|
891
|
+
private collectParents(start: Enode, head: PathTree | null | undefined) {
|
|
892
|
+
if (head === null || head === undefined) return;
|
|
893
|
+
const levels: PathTree[] = [head];
|
|
894
|
+
const visitedParents = this.visitedParents;
|
|
895
|
+
const queuedRoots = this.queuedRoots;
|
|
896
|
+
head.todo = [start];
|
|
897
|
+
for (let index = 0; index < levels.length; index++) {
|
|
898
|
+
const level = levels[index];
|
|
899
|
+
const nodes = level.todo ?? [];
|
|
900
|
+
level.todo = null;
|
|
901
|
+
const filter = level.filter;
|
|
902
|
+
const filterHigh = level.filterHigh;
|
|
903
|
+
for (const node of nodes) {
|
|
904
|
+
const child = node.root;
|
|
905
|
+
if ((child.plbls & filter) === 0 && (child.plblsHigh & filterHigh) === 0) continue;
|
|
906
|
+
for (const parent of child.parents) {
|
|
907
|
+
if (parent.isEquality) continue;
|
|
908
|
+
const label = parent.decl;
|
|
909
|
+
const parentRoot = parent.root;
|
|
910
|
+
if (
|
|
911
|
+
!hasHash(filter, filterHigh, this.getLabelHash(label)) ||
|
|
912
|
+
parent.isMarked1 ||
|
|
913
|
+
(parent.cg !== parent && this.isEqModMerge(parent.cg, parentRoot)) ||
|
|
914
|
+
!parent.isRelevant
|
|
915
|
+
)
|
|
916
|
+
continue;
|
|
917
|
+
for (let tree: PathTree | null = level; tree !== null; tree = tree.sibling) {
|
|
918
|
+
if (
|
|
919
|
+
tree.label !== label ||
|
|
920
|
+
tree.argIndex >= parent.numArgs ||
|
|
921
|
+
parent.getArg(tree.argIndex).root !== child ||
|
|
922
|
+
tree.groundArgIndex >= parent.numArgs ||
|
|
923
|
+
(tree.groundArg !== null &&
|
|
924
|
+
!this.isEqModMerge(tree.groundArg, parent.getArg(tree.groundArgIndex)))
|
|
925
|
+
)
|
|
926
|
+
continue;
|
|
927
|
+
if (tree.code !== null) this.addCandidateTo(tree.code, parent);
|
|
928
|
+
const next = tree.firstChild;
|
|
929
|
+
if (next === null) continue;
|
|
930
|
+
if (next.todo === null) {
|
|
931
|
+
next.todo = [];
|
|
932
|
+
levels.push(next);
|
|
933
|
+
}
|
|
934
|
+
if (!parentRoot.isMarked2) next.todo.push(parentRoot);
|
|
935
|
+
}
|
|
936
|
+
parent.isMarked1 = true;
|
|
937
|
+
visitedParents.push(parent);
|
|
938
|
+
if (!parentRoot.isMarked2) {
|
|
939
|
+
parentRoot.isMarked2 = true;
|
|
940
|
+
queuedRoots.push(parentRoot);
|
|
941
|
+
}
|
|
942
|
+
}
|
|
943
|
+
}
|
|
944
|
+
for (const parent of visitedParents) parent.isMarked1 = false;
|
|
945
|
+
for (const root of queuedRoots) root.isMarked2 = false;
|
|
946
|
+
visitedParents.length = 0;
|
|
947
|
+
queuedRoots.length = 0;
|
|
948
|
+
}
|
|
949
|
+
}
|
|
950
|
+
|
|
951
|
+
private processPc(r1: Enode, r2: Enode) {
|
|
952
|
+
if ((r1.plbls === 0 && r1.plblsHigh === 0) || (r2.lbls === 0 && r2.lblsHigh === 0)) return;
|
|
953
|
+
for (let parentHash = 0; parentHash < 64; parentHash++) {
|
|
954
|
+
if (!hasHash(r1.plbls, r1.plblsHigh, parentHash)) continue;
|
|
955
|
+
if (!this.manager.limit.inc()) return;
|
|
956
|
+
for (let childHash = 0; childHash < 64; childHash++)
|
|
957
|
+
if (hasHash(r2.lbls, r2.lblsHigh, childHash))
|
|
958
|
+
this.collectParents(r1, this.pc.get(parentHash * 64 + childHash));
|
|
959
|
+
}
|
|
960
|
+
}
|
|
961
|
+
|
|
962
|
+
private processPp(r1: Enode, r2: Enode) {
|
|
963
|
+
if ((r1.plbls === 0 && r1.plblsHigh === 0) || (r2.plbls === 0 && r2.plblsHigh === 0)) return;
|
|
964
|
+
for (let firstHash = 0; firstHash < 64; firstHash++) {
|
|
965
|
+
if (!hasHash(r1.plbls, r1.plblsHigh, firstHash)) continue;
|
|
966
|
+
if (!this.manager.limit.inc()) return;
|
|
967
|
+
for (let secondHash = 0; secondHash < 64; secondHash++) {
|
|
968
|
+
if (!hasHash(r2.plbls, r2.plblsHigh, secondHash)) continue;
|
|
969
|
+
const isSwapped = firstHash > secondHash;
|
|
970
|
+
const lowHash = isSwapped ? secondHash : firstHash;
|
|
971
|
+
const highHash = isSwapped ? firstHash : secondHash;
|
|
972
|
+
const lowRoot = isSwapped ? r2 : r1;
|
|
973
|
+
const highRoot = isSwapped ? r1 : r2;
|
|
974
|
+
const entry = this.pp.get(lowHash * 64 + highHash);
|
|
975
|
+
if (entry === undefined) continue;
|
|
976
|
+
if (lowHash === highHash) {
|
|
977
|
+
if (lowRoot.parents.length <= highRoot.parents.length)
|
|
978
|
+
this.collectParents(lowRoot, entry[0]);
|
|
979
|
+
else this.collectParents(highRoot, entry[0]);
|
|
980
|
+
} else if (lowRoot.parents.length <= highRoot.parents.length)
|
|
981
|
+
this.collectParents(lowRoot, entry[0]);
|
|
982
|
+
else this.collectParents(highRoot, entry[1]);
|
|
983
|
+
}
|
|
984
|
+
}
|
|
985
|
+
}
|
|
986
|
+
|
|
987
|
+
onMerge(root: Enode, other: Enode) {
|
|
988
|
+
this.other = other;
|
|
989
|
+
this.root = root;
|
|
990
|
+
this.processPc(other, root);
|
|
991
|
+
this.processPc(root, other);
|
|
992
|
+
this.processPp(other, root);
|
|
993
|
+
this.other = null;
|
|
994
|
+
this.root = null;
|
|
995
|
+
const lbls = root.lbls;
|
|
996
|
+
const lblsHigh = root.lblsHigh;
|
|
997
|
+
const plbls = root.plbls;
|
|
998
|
+
const plblsHigh = root.plblsHigh;
|
|
999
|
+
this.pushTrail(() => {
|
|
1000
|
+
root.lbls = lbls;
|
|
1001
|
+
root.lblsHigh = lblsHigh;
|
|
1002
|
+
});
|
|
1003
|
+
this.pushTrail(() => {
|
|
1004
|
+
root.plbls = plbls;
|
|
1005
|
+
root.plblsHigh = plblsHigh;
|
|
1006
|
+
});
|
|
1007
|
+
root.lbls |= other.lbls;
|
|
1008
|
+
root.lblsHigh |= other.lblsHigh;
|
|
1009
|
+
root.plbls |= other.plbls;
|
|
1010
|
+
root.plblsHigh |= other.plblsHigh;
|
|
1011
|
+
}
|
|
1012
|
+
|
|
1013
|
+
propagate() {
|
|
1014
|
+
if (this.toMatchHead < this.toMatch.length) {
|
|
1015
|
+
const head = this.toMatchHead;
|
|
1016
|
+
this.pushTrail(() => {
|
|
1017
|
+
this.toMatchHead = head;
|
|
1018
|
+
});
|
|
1019
|
+
for (; this.toMatchHead < this.toMatch.length; this.toMatchHead++)
|
|
1020
|
+
this.interpreter.execute(this.toMatch[this.toMatchHead]);
|
|
1021
|
+
}
|
|
1022
|
+
this.propagateNewPatterns();
|
|
1023
|
+
}
|
|
1024
|
+
|
|
1025
|
+
private propagateNewPatterns() {
|
|
1026
|
+
if (this.newPatternsHead >= this.newPatterns.length) return;
|
|
1027
|
+
const head = this.newPatternsHead;
|
|
1028
|
+
this.pushTrail(() => {
|
|
1029
|
+
this.newPatternsHead = head;
|
|
1030
|
+
});
|
|
1031
|
+
const manager = this.manager;
|
|
1032
|
+
const egraph = this.ctx.egraph;
|
|
1033
|
+
const tmpTrees = new Map<number, CodeTree<Enode>>();
|
|
1034
|
+
for (; this.newPatternsHead < this.newPatterns.length; this.newPatternsHead++) {
|
|
1035
|
+
if (!manager.limit.inc()) break;
|
|
1036
|
+
const mp = this.newPatterns[this.newPatternsHead];
|
|
1037
|
+
const label = manager.decls[mp.patterns[0]];
|
|
1038
|
+
if (egraph.enodesOf(label).length === 0) continue;
|
|
1039
|
+
const tree = tmpTrees.get(label);
|
|
1040
|
+
if (tree === undefined)
|
|
1041
|
+
tmpTrees.set(label, this.compiler.mkTree(mp.quantifier, mp.patterns, 0, false, mp.pattern));
|
|
1042
|
+
else this.compiler.insert(tree, mp.quantifier, mp.patterns, 0, true, mp.pattern);
|
|
1043
|
+
}
|
|
1044
|
+
for (const entry of tmpTrees) {
|
|
1045
|
+
const nodes = egraph.enodesOf(entry[0]);
|
|
1046
|
+
for (let index = 0; index < nodes.length; index++)
|
|
1047
|
+
if (nodes[index].isRelevant) this.interpreter.executeCore(entry[1], nodes[index]);
|
|
1048
|
+
}
|
|
1049
|
+
}
|
|
1050
|
+
}
|