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,606 @@
|
|
|
1
|
+
import { type AstManager, KIND_APP, OP_AND, OP_DISTINCT, OP_EQ, SORT_BOOL } from "../ast";
|
|
2
|
+
import { getNumExprs, isAppOf } from "../ast-util";
|
|
3
|
+
import { RefVector } from "../ref-vector";
|
|
4
|
+
import { mkArithSolvePlugin, mkBasicSolvePlugin, type SolvePlugin } from "./mbp-solve-plugin";
|
|
5
|
+
|
|
6
|
+
class Term {
|
|
7
|
+
root: Term = this;
|
|
8
|
+
repr: Term | undefined;
|
|
9
|
+
next: Term = this;
|
|
10
|
+
isMarked = false;
|
|
11
|
+
readonly isEq: boolean;
|
|
12
|
+
readonly isNeq: boolean;
|
|
13
|
+
readonly isDistinct: boolean;
|
|
14
|
+
isNeqChild = false;
|
|
15
|
+
isCgr = false;
|
|
16
|
+
// Maintained for roots only.
|
|
17
|
+
readonly parents: Term[] = [];
|
|
18
|
+
readonly children: Term[] = [];
|
|
19
|
+
// Class properties, meaningful at the root.
|
|
20
|
+
isGrClass = false;
|
|
21
|
+
classSize = 1;
|
|
22
|
+
|
|
23
|
+
constructor(
|
|
24
|
+
readonly expr: number,
|
|
25
|
+
manager: AstManager,
|
|
26
|
+
app2Term: Map<number, Term>,
|
|
27
|
+
) {
|
|
28
|
+
this.isEq = isAppOf(manager, expr, OP_EQ);
|
|
29
|
+
this.isNeq = manager.isNot(expr) && isAppOf(manager, manager.getArg(expr, 0), OP_EQ);
|
|
30
|
+
this.isDistinct = isAppOf(manager, expr, OP_DISTINCT);
|
|
31
|
+
if (manager.kinds[expr] !== KIND_APP) return;
|
|
32
|
+
for (const arg of manager.getArgs(expr)) {
|
|
33
|
+
const child = app2Term.get(arg) as Term;
|
|
34
|
+
child.root.parents.push(this);
|
|
35
|
+
this.children.push(child);
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
get isEqOrNeq() {
|
|
40
|
+
return this.isEq || this.isNeq || this.isDistinct;
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
get isClassGr() {
|
|
44
|
+
return this.root.isGrClass;
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
set isClassGr(value: boolean) {
|
|
48
|
+
this.root.isGrClass = value;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
get isRepr() {
|
|
52
|
+
return this.repr === this;
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
areAllChildrenGround() {
|
|
56
|
+
return this.children.every((child) => child.isClassGr);
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
areAllChildrenPicked() {
|
|
60
|
+
return this.children.every((child) => child.repr !== undefined);
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
mergeEqClass(other: Term) {
|
|
64
|
+
[this.next, other.next] = [other.next, this.next];
|
|
65
|
+
this.classSize += other.classSize;
|
|
66
|
+
this.isGrClass ||= other.isGrClass;
|
|
67
|
+
other.classSize = 0;
|
|
68
|
+
other.isGrClass = false;
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
mkRepr() {
|
|
72
|
+
this.repr = this;
|
|
73
|
+
for (let current = this.next; current !== this; current = current.next) current.repr = this;
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
*getClass() {
|
|
77
|
+
yield this;
|
|
78
|
+
for (let current = this.next; current !== this; current = current.next) yield current;
|
|
79
|
+
}
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
// With isExclude, the declarations are those of the variables.
|
|
83
|
+
class IsVariableProc {
|
|
84
|
+
private isExclude = true;
|
|
85
|
+
private readonly decls = new Set<number>();
|
|
86
|
+
private readonly solved = new Set<number>();
|
|
87
|
+
|
|
88
|
+
constructor(private manager: AstManager) {}
|
|
89
|
+
|
|
90
|
+
isVariable(expr: number) {
|
|
91
|
+
const manager = this.manager;
|
|
92
|
+
if (manager.kinds[expr] !== KIND_APP || !manager.isUninterpreted(expr)) return false;
|
|
93
|
+
const decl = manager.decls[expr];
|
|
94
|
+
return !this.solved.has(decl) && this.isExclude === this.decls.has(decl);
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
setDecls(vars: readonly number[], isExclude: boolean) {
|
|
98
|
+
this.decls.clear();
|
|
99
|
+
this.solved.clear();
|
|
100
|
+
this.isExclude = isExclude;
|
|
101
|
+
for (const innerVar of vars) this.decls.add(this.manager.decls[innerVar]);
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
addDecl(innerVar: number) {
|
|
105
|
+
this.decls.add(this.manager.decls[innerVar]);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
markSolved(expr: number) {
|
|
109
|
+
if (this.isVariable(expr)) this.solved.add(this.manager.decls[expr]);
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
contains(decl: number) {
|
|
113
|
+
return this.decls.has(decl) === this.isExclude;
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
export class TermGraph {
|
|
118
|
+
private readonly isVar: IsVariableProc;
|
|
119
|
+
private terms: Term[] = [];
|
|
120
|
+
private app2Term = new Map<number, Term>();
|
|
121
|
+
private cgTable = new Map<string, Term>();
|
|
122
|
+
readonly lits: RefVector;
|
|
123
|
+
private readonly pinned: RefVector;
|
|
124
|
+
private term2App = new Map<Term, number>();
|
|
125
|
+
private merges: [Term, Term][] = [];
|
|
126
|
+
private deqPairs: [Term, Term][] = [];
|
|
127
|
+
private deqDistinct: Term[][] = [];
|
|
128
|
+
private isExplicitEq = false;
|
|
129
|
+
private plugins: SolvePlugin[];
|
|
130
|
+
|
|
131
|
+
constructor(private manager: AstManager) {
|
|
132
|
+
this.isVar = new IsVariableProc(manager);
|
|
133
|
+
this.lits = new RefVector(manager);
|
|
134
|
+
this.pinned = new RefVector(manager);
|
|
135
|
+
const isVariable = (expr: number) => this.isVar.isVariable(expr);
|
|
136
|
+
const pin = (expr: number) => this.pin(expr);
|
|
137
|
+
this.plugins = [
|
|
138
|
+
mkBasicSolvePlugin(manager, isVariable, pin),
|
|
139
|
+
mkArithSolvePlugin(manager, isVariable, pin),
|
|
140
|
+
];
|
|
141
|
+
}
|
|
142
|
+
|
|
143
|
+
release() {
|
|
144
|
+
this.lits.reset();
|
|
145
|
+
this.pinned.reset();
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
setVars(vars: readonly number[]) {
|
|
149
|
+
this.isVar.setDecls(vars, true);
|
|
150
|
+
}
|
|
151
|
+
|
|
152
|
+
addVars(vars: readonly number[]) {
|
|
153
|
+
for (const innerVar of vars) this.isVar.addDecl(innerVar);
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
setExplicitEq() {
|
|
157
|
+
this.isExplicitEq = true;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
private pin(expr: number) {
|
|
161
|
+
this.pinned.push(expr);
|
|
162
|
+
return expr;
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private isGround(expr: number) {
|
|
166
|
+
const manager = this.manager;
|
|
167
|
+
const visited = new Set<number>();
|
|
168
|
+
const todo = [expr];
|
|
169
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
170
|
+
if (visited.has(current)) continue;
|
|
171
|
+
visited.add(current);
|
|
172
|
+
if (manager.kinds[current] !== KIND_APP) continue;
|
|
173
|
+
if (this.isVar.contains(manager.decls[current])) return false;
|
|
174
|
+
manager.pushArgs(current, todo);
|
|
175
|
+
}
|
|
176
|
+
return true;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
private isPure(expr: number) {
|
|
180
|
+
const manager = this.manager;
|
|
181
|
+
const visited = new Set<number>();
|
|
182
|
+
const todo = [expr];
|
|
183
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
184
|
+
if (visited.has(current)) continue;
|
|
185
|
+
visited.add(current);
|
|
186
|
+
if (this.isVar.isVariable(current)) return false;
|
|
187
|
+
if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
|
|
188
|
+
}
|
|
189
|
+
return true;
|
|
190
|
+
}
|
|
191
|
+
|
|
192
|
+
private getLitFamily(lit: number): number {
|
|
193
|
+
const manager = this.manager;
|
|
194
|
+
if (manager.isNot(lit)) return this.getLitFamily(manager.getArg(lit, 0));
|
|
195
|
+
if (isAppOf(manager, lit, OP_EQ))
|
|
196
|
+
return manager.getSortFamily(manager.sorts[manager.getArg(lit, 0)]);
|
|
197
|
+
return manager.kinds[lit] === KIND_APP ? manager.getFamily(lit) : -1;
|
|
198
|
+
}
|
|
199
|
+
|
|
200
|
+
addLit(lit: number) {
|
|
201
|
+
const manager = this.manager;
|
|
202
|
+
const lits = new RefVector(manager);
|
|
203
|
+
lits.push(lit);
|
|
204
|
+
for (let index = 0; index < lits.size; index++) {
|
|
205
|
+
const current = lits.items[index];
|
|
206
|
+
const family = this.getLitFamily(current);
|
|
207
|
+
const plugin = this.plugins.find((candidate) => candidate.family === family);
|
|
208
|
+
const solved = plugin === undefined ? current : this.solveLit(plugin, current);
|
|
209
|
+
if (manager.getOp(solved) === OP_AND)
|
|
210
|
+
for (const arg of manager.getArgs(solved)) lits.push(arg);
|
|
211
|
+
else {
|
|
212
|
+
this.lits.push(solved);
|
|
213
|
+
this.internalizeLit(solved);
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
lits.reset();
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
private solveLit(plugin: SolvePlugin, lit: number) {
|
|
220
|
+
const manager = this.manager;
|
|
221
|
+
return manager.isNot(lit)
|
|
222
|
+
? plugin.solve(manager.getArg(lit, 0), false)
|
|
223
|
+
: plugin.solve(lit, true);
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
addLits(lits: readonly number[]) {
|
|
227
|
+
for (const lit of lits) this.addLit(lit);
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
addEq(first: number, second: number) {
|
|
231
|
+
this.internalizeEq(first, second);
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
addDeq(first: number, second: number) {
|
|
235
|
+
this.internalizeDeq(first, second);
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
// Terms other than those under a disequality.
|
|
239
|
+
getTerms() {
|
|
240
|
+
return this.terms.filter((term) => !term.isNeqChild).map((term) => term.expr);
|
|
241
|
+
}
|
|
242
|
+
|
|
243
|
+
isInternalized(expr: number) {
|
|
244
|
+
return this.app2Term.has(expr);
|
|
245
|
+
}
|
|
246
|
+
|
|
247
|
+
private getCgKey(term: Term) {
|
|
248
|
+
const manager = this.manager;
|
|
249
|
+
const expr = term.expr;
|
|
250
|
+
if (term.children.length === 0) return `e${expr}`;
|
|
251
|
+
return `${manager.decls[expr]}:${manager.sorts[expr]}:${term.children.map((child) => manager.ids[child.root.expr]).join(",")}`;
|
|
252
|
+
}
|
|
253
|
+
|
|
254
|
+
private mkTerm(expr: number) {
|
|
255
|
+
const manager = this.manager;
|
|
256
|
+
this.pin(expr);
|
|
257
|
+
const term = new Term(expr, manager, this.app2Term);
|
|
258
|
+
if (this.isGround(expr)) {
|
|
259
|
+
term.isCgr = true;
|
|
260
|
+
term.isClassGr = true;
|
|
261
|
+
} else if (term.children.length > 0 && term.areAllChildrenGround()) {
|
|
262
|
+
term.isCgr = true;
|
|
263
|
+
term.isClassGr = true;
|
|
264
|
+
}
|
|
265
|
+
this.terms.push(term);
|
|
266
|
+
this.app2Term.set(expr, term);
|
|
267
|
+
return term;
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
private insertCg(term: Term) {
|
|
271
|
+
const key = this.getCgKey(term);
|
|
272
|
+
const existing = this.cgTable.get(key);
|
|
273
|
+
if (existing !== undefined) return existing;
|
|
274
|
+
this.cgTable.set(key, term);
|
|
275
|
+
return term;
|
|
276
|
+
}
|
|
277
|
+
|
|
278
|
+
private internalizeTerm(root: number) {
|
|
279
|
+
const manager = this.manager;
|
|
280
|
+
const existing = this.app2Term.get(root);
|
|
281
|
+
if (existing !== undefined) return existing;
|
|
282
|
+
const todo = [root];
|
|
283
|
+
let result: Term | undefined;
|
|
284
|
+
while (todo.length > 0) {
|
|
285
|
+
const expr = todo[todo.length - 1];
|
|
286
|
+
result = this.app2Term.get(expr);
|
|
287
|
+
if (result !== undefined) {
|
|
288
|
+
todo.pop();
|
|
289
|
+
continue;
|
|
290
|
+
}
|
|
291
|
+
const size = todo.length;
|
|
292
|
+
if (manager.kinds[expr] === KIND_APP)
|
|
293
|
+
for (const arg of manager.getArgs(expr)) if (!this.app2Term.has(arg)) todo.push(arg);
|
|
294
|
+
if (size < todo.length) continue;
|
|
295
|
+
todo.pop();
|
|
296
|
+
result = this.mkTerm(expr);
|
|
297
|
+
// The term may be congruent to a term internalized in another syntactic form.
|
|
298
|
+
const old = this.insertCg(result);
|
|
299
|
+
if (result.isCgr) old.isCgr = true;
|
|
300
|
+
if (old.root !== result.root) this.merges.push([result, old]);
|
|
301
|
+
}
|
|
302
|
+
this.mergeFlush();
|
|
303
|
+
return result as Term;
|
|
304
|
+
}
|
|
305
|
+
|
|
306
|
+
private internalizeEq(first: number, second: number) {
|
|
307
|
+
this.merge(this.internalizeTerm(first), this.internalizeTerm(second));
|
|
308
|
+
this.mergeFlush();
|
|
309
|
+
if (!this.isExplicitEq) return;
|
|
310
|
+
const eq = this.pin(this.manager.mkEq(first, second));
|
|
311
|
+
if (!this.app2Term.has(eq)) this.mkTerm(eq);
|
|
312
|
+
}
|
|
313
|
+
|
|
314
|
+
private internalizeDistinct(expr: number) {
|
|
315
|
+
const terms = this.manager.getArgs(expr).map((arg) => this.internalizeTerm(arg));
|
|
316
|
+
this.deqDistinct.push(terms);
|
|
317
|
+
if (this.isExplicitEq && !this.app2Term.has(expr)) this.mkTerm(expr);
|
|
318
|
+
}
|
|
319
|
+
|
|
320
|
+
private internalizeDeq(first: number, second: number) {
|
|
321
|
+
const manager = this.manager;
|
|
322
|
+
const term1 = this.internalizeTerm(first);
|
|
323
|
+
const term2 = this.internalizeTerm(second);
|
|
324
|
+
this.deqPairs.push([term1, term2]);
|
|
325
|
+
if (!this.isExplicitEq) return;
|
|
326
|
+
const eq = this.pin(manager.mkEq(first, second));
|
|
327
|
+
const eqTerm = this.mkTerm(eq);
|
|
328
|
+
eqTerm.isNeqChild = true;
|
|
329
|
+
const deq = this.pin(manager.mkNot(eq));
|
|
330
|
+
if (!this.app2Term.has(deq)) this.mkTerm(deq);
|
|
331
|
+
}
|
|
332
|
+
|
|
333
|
+
private internalizeLit(lit: number) {
|
|
334
|
+
const manager = this.manager;
|
|
335
|
+
if (isAppOf(manager, lit, OP_EQ))
|
|
336
|
+
this.internalizeEq(manager.getArg(lit, 0), manager.getArg(lit, 1));
|
|
337
|
+
else if (isAppOf(manager, lit, OP_DISTINCT)) this.internalizeDistinct(lit);
|
|
338
|
+
else if (manager.isNot(lit) && isAppOf(manager, manager.getArg(lit, 0), OP_EQ)) {
|
|
339
|
+
const eq = manager.getArg(lit, 0);
|
|
340
|
+
this.internalizeDeq(manager.getArg(eq, 0), manager.getArg(eq, 1));
|
|
341
|
+
} else this.internalizeTerm(lit);
|
|
342
|
+
// A pure definition solves its variable.
|
|
343
|
+
if (isAppOf(manager, lit, OP_EQ)) {
|
|
344
|
+
const variable = manager.getArg(lit, 0);
|
|
345
|
+
if (this.isVar.isVariable(variable) && this.isPure(manager.getArg(lit, 1)))
|
|
346
|
+
this.isVar.markSolved(variable);
|
|
347
|
+
}
|
|
348
|
+
}
|
|
349
|
+
|
|
350
|
+
private mergeFlush() {
|
|
351
|
+
for (let pair = this.merges.pop(); pair !== undefined; pair = this.merges.pop())
|
|
352
|
+
this.merge(pair[0], pair[1]);
|
|
353
|
+
}
|
|
354
|
+
|
|
355
|
+
private merge(term1: Term, term2: Term) {
|
|
356
|
+
let first = term1.root;
|
|
357
|
+
let second = term2.root;
|
|
358
|
+
if (first === second) return;
|
|
359
|
+
this.term2App.clear();
|
|
360
|
+
if (first.classSize > second.classSize) [first, second] = [second, first];
|
|
361
|
+
for (const parent of second.parents) {
|
|
362
|
+
if (parent.isMarked) continue;
|
|
363
|
+
parent.isMarked = true;
|
|
364
|
+
this.cgTable.delete(this.getCgKey(parent));
|
|
365
|
+
}
|
|
366
|
+
const isPropagatingGround = second.isClassGr !== first.isClassGr;
|
|
367
|
+
second.root = first;
|
|
368
|
+
for (let current = second.next; current !== second; current = current.next)
|
|
369
|
+
current.root = first;
|
|
370
|
+
first.mergeEqClass(second);
|
|
371
|
+
for (const parent of second.parents) {
|
|
372
|
+
if (!parent.isMarked) continue;
|
|
373
|
+
const old = this.insertCg(parent);
|
|
374
|
+
parent.isMarked = false;
|
|
375
|
+
first.parents.push(parent);
|
|
376
|
+
if (parent.root !== old.root) this.merges.push([parent, old]);
|
|
377
|
+
}
|
|
378
|
+
if (isPropagatingGround) this.percolateGroundUpFrom(first);
|
|
379
|
+
}
|
|
380
|
+
|
|
381
|
+
private mkAppCore(expr: number): number {
|
|
382
|
+
const manager = this.manager;
|
|
383
|
+
// A constant rebuilt from its declaration is itself, and a numeral keeps its value this way.
|
|
384
|
+
if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0) return expr;
|
|
385
|
+
// A value stays as it is, so a coefficient never becomes a variable that equals it.
|
|
386
|
+
const kids = manager
|
|
387
|
+
.getArgs(expr)
|
|
388
|
+
.map((arg) => (manager.isValue(arg) ? arg : this.mkAppOfExpr(arg)));
|
|
389
|
+
return this.pin(manager.mkApp(manager.decls[expr], kids, manager.sorts[expr]));
|
|
390
|
+
}
|
|
391
|
+
|
|
392
|
+
private mkAppOfTerm(term: Term): number {
|
|
393
|
+
if (term.children.length === 0) return term.expr;
|
|
394
|
+
const cached = this.term2App.get(term);
|
|
395
|
+
if (cached !== undefined) return cached;
|
|
396
|
+
const result = this.mkAppCore(term.expr);
|
|
397
|
+
this.term2App.set(term, result);
|
|
398
|
+
return result;
|
|
399
|
+
}
|
|
400
|
+
|
|
401
|
+
private mkAppOfExpr(expr: number): number {
|
|
402
|
+
const term = this.app2Term.get(expr);
|
|
403
|
+
return term === undefined ? expr : this.mkAppOfTerm(term.repr as Term);
|
|
404
|
+
}
|
|
405
|
+
|
|
406
|
+
private mkQeLiteEqualities(term: Term, out: number[], containsNc: (expr: number) => boolean) {
|
|
407
|
+
const manager = this.manager;
|
|
408
|
+
if (term.classSize === 1) return;
|
|
409
|
+
const repr = this.mkAppOfTerm(term);
|
|
410
|
+
if (containsNc(repr)) return;
|
|
411
|
+
for (let current = term.next; current !== term; current = current.next) {
|
|
412
|
+
// No equalities for the variables to eliminate.
|
|
413
|
+
if (this.isVar.contains(manager.decls[current.expr])) continue;
|
|
414
|
+
const member = this.mkAppCore(current.expr);
|
|
415
|
+
if (repr !== member && !containsNc(member)) out.push(this.pin(manager.mkEq(repr, member)));
|
|
416
|
+
}
|
|
417
|
+
}
|
|
418
|
+
|
|
419
|
+
// Prefers constants over applications, uninterpreted constants over values, and smaller
|
|
420
|
+
// expressions over larger ones.
|
|
421
|
+
private isTermLess(term1: Term, term2: Term) {
|
|
422
|
+
const manager = this.manager;
|
|
423
|
+
const numArgs1 = term1.children.length;
|
|
424
|
+
const numArgs2 = term2.children.length;
|
|
425
|
+
if (numArgs1 === 0 || numArgs2 === 0) {
|
|
426
|
+
if (numArgs1 === numArgs2) {
|
|
427
|
+
if (manager.isValue(term1.expr) === manager.isValue(term2.expr))
|
|
428
|
+
return manager.ids[term1.expr] < manager.ids[term2.expr];
|
|
429
|
+
return manager.isValue(term2.expr);
|
|
430
|
+
}
|
|
431
|
+
return numArgs1 < numArgs2;
|
|
432
|
+
}
|
|
433
|
+
return getNumExprs(manager, term1.expr) < getNumExprs(manager, term2.expr);
|
|
434
|
+
}
|
|
435
|
+
|
|
436
|
+
private pickReprPercolateUp(todo: Term[]) {
|
|
437
|
+
for (let term = todo.pop(); term !== undefined; term = todo.pop()) {
|
|
438
|
+
if (term.repr !== undefined) continue;
|
|
439
|
+
this.pickReprClass(term);
|
|
440
|
+
for (const parent of term.root.parents) if (parent.areAllChildrenPicked()) todo.push(parent);
|
|
441
|
+
}
|
|
442
|
+
}
|
|
443
|
+
|
|
444
|
+
// The class representative is c-ground when possible and least by isTermLess.
|
|
445
|
+
private pickReprClass(term: Term) {
|
|
446
|
+
let repr = term;
|
|
447
|
+
for (let current = term.next; current !== term; current = current.next) {
|
|
448
|
+
if (!current.areAllChildrenPicked()) continue;
|
|
449
|
+
if (
|
|
450
|
+
(current.isCgr && !repr.isCgr) ||
|
|
451
|
+
(current.isCgr === repr.isCgr && this.isTermLess(current, repr))
|
|
452
|
+
)
|
|
453
|
+
repr = current;
|
|
454
|
+
}
|
|
455
|
+
repr.mkRepr();
|
|
456
|
+
}
|
|
457
|
+
|
|
458
|
+
private pickRepr() {
|
|
459
|
+
this.term2App.clear();
|
|
460
|
+
for (const term of this.terms) term.repr = undefined;
|
|
461
|
+
const todo: Term[] = [];
|
|
462
|
+
for (const term of this.terms) if (term.children.length === 0 && term.isCgr) todo.push(term);
|
|
463
|
+
this.pickReprPercolateUp(todo);
|
|
464
|
+
for (const term of this.terms)
|
|
465
|
+
if (term.repr === undefined && term.children.length === 0) todo.push(term);
|
|
466
|
+
this.pickReprPercolateUp(todo);
|
|
467
|
+
}
|
|
468
|
+
|
|
469
|
+
// A variable representative gives way to a non-variable that makes no cycle.
|
|
470
|
+
private refineReprClass(term: Term) {
|
|
471
|
+
const manager = this.manager;
|
|
472
|
+
const isVariable = (candidate: Term) => this.isVar.contains(manager.decls[candidate.expr]);
|
|
473
|
+
if (!isVariable(term)) return;
|
|
474
|
+
let repr = term;
|
|
475
|
+
for (let current = term.next; current !== term; current = current.next)
|
|
476
|
+
if (!this.makesCycle(current) && isVariable(repr) && !isVariable(current)) repr = current;
|
|
477
|
+
repr.mkRepr();
|
|
478
|
+
}
|
|
479
|
+
|
|
480
|
+
private makesCycle(term: Term) {
|
|
481
|
+
const root = term.root;
|
|
482
|
+
const todo = term.children.map((child) => child.repr as Term);
|
|
483
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
484
|
+
if (current.root === root) return true;
|
|
485
|
+
for (const child of current.children) todo.push(child.repr as Term);
|
|
486
|
+
}
|
|
487
|
+
return false;
|
|
488
|
+
}
|
|
489
|
+
|
|
490
|
+
private refineRepr() {
|
|
491
|
+
this.term2App.clear();
|
|
492
|
+
for (const term of this.terms) {
|
|
493
|
+
const repr = term.repr as Term;
|
|
494
|
+
if (!repr.isCgr) this.refineReprClass(repr);
|
|
495
|
+
}
|
|
496
|
+
}
|
|
497
|
+
|
|
498
|
+
// Whether the graph implies that the expression equals a value.
|
|
499
|
+
hasValInClass(expr: number) {
|
|
500
|
+
const term = this.app2Term.get(expr);
|
|
501
|
+
if (term === undefined) return false;
|
|
502
|
+
for (const member of term.getClass()) if (this.manager.isValue(member.expr)) return true;
|
|
503
|
+
return false;
|
|
504
|
+
}
|
|
505
|
+
|
|
506
|
+
private mkNeq(first: number, second: number) {
|
|
507
|
+
const manager = this.manager;
|
|
508
|
+
if (
|
|
509
|
+
(manager.isNot(first) && manager.getArg(first, 0) === second) ||
|
|
510
|
+
(manager.isNot(second) && manager.getArg(second, 0) === first) ||
|
|
511
|
+
manager.areDistinct(first, second)
|
|
512
|
+
)
|
|
513
|
+
return manager.trueExpr;
|
|
514
|
+
return this.pin(manager.mkNot(manager.mkEq(first, second)));
|
|
515
|
+
}
|
|
516
|
+
|
|
517
|
+
private toLitsQeLite(nonCore: ((expr: number) => boolean) | undefined) {
|
|
518
|
+
const manager = this.manager;
|
|
519
|
+
const cache = new Map<number, boolean>();
|
|
520
|
+
const containsNc = (expr: number): boolean => {
|
|
521
|
+
if (nonCore === undefined) return false;
|
|
522
|
+
const cached = cache.get(expr);
|
|
523
|
+
if (cached !== undefined) return cached;
|
|
524
|
+
const result =
|
|
525
|
+
nonCore(expr) ||
|
|
526
|
+
(manager.kinds[expr] === KIND_APP && manager.someArg(expr, (arg) => containsNc(arg)));
|
|
527
|
+
cache.set(expr, result);
|
|
528
|
+
return result;
|
|
529
|
+
};
|
|
530
|
+
const lits: number[] = [];
|
|
531
|
+
for (const lit of this.lits.items) {
|
|
532
|
+
const term = this.app2Term.get(lit);
|
|
533
|
+
if (term === undefined) continue;
|
|
534
|
+
if (this.isExplicitEq && term.isEqOrNeq) continue;
|
|
535
|
+
const result = this.mkAppOfExpr(lit);
|
|
536
|
+
if (nonCore === undefined || !containsNc(result)) lits.push(result);
|
|
537
|
+
}
|
|
538
|
+
for (const term of this.terms)
|
|
539
|
+
if (!term.isEqOrNeq && term.isRepr) this.mkQeLiteEqualities(term, lits, containsNc);
|
|
540
|
+
for (const [first, second] of this.deqPairs) {
|
|
541
|
+
const expr1 = this.mkAppOfTerm(first.repr as Term);
|
|
542
|
+
const expr2 = this.mkAppOfTerm(second.repr as Term);
|
|
543
|
+
if (nonCore === undefined || (!containsNc(expr1) && !containsNc(expr2)))
|
|
544
|
+
lits.push(this.mkNeq(expr1, expr2));
|
|
545
|
+
}
|
|
546
|
+
for (const terms of this.deqDistinct) {
|
|
547
|
+
const args: number[] = [];
|
|
548
|
+
for (const term of terms) {
|
|
549
|
+
const arg = this.mkAppOfTerm(term.repr as Term);
|
|
550
|
+
if (nonCore === undefined || !containsNc(arg)) args.push(arg);
|
|
551
|
+
}
|
|
552
|
+
if (args.length < 2) continue;
|
|
553
|
+
lits.push(
|
|
554
|
+
args.length === 2
|
|
555
|
+
? this.mkNeq(args[0], args[1])
|
|
556
|
+
: this.pin(manager.mkApp(OP_DISTINCT, args, SORT_BOOL)),
|
|
557
|
+
);
|
|
558
|
+
}
|
|
559
|
+
return lits;
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
// A quantifier reduction of the graph's formula: keeps in vars only the variables that have no
|
|
563
|
+
// ground representative and still occur in the result.
|
|
564
|
+
qel(vars: RefVector, nonCore?: (expr: number) => boolean) {
|
|
565
|
+
const manager = this.manager;
|
|
566
|
+
filterRefVector(vars, (innerVar) => this.isInternalized(innerVar));
|
|
567
|
+
this.pickRepr();
|
|
568
|
+
this.refineRepr();
|
|
569
|
+
const lits = this.toLitsQeLite(nonCore);
|
|
570
|
+
const formula = this.pin(manager.mkAnd(lits));
|
|
571
|
+
const occurring = new Set<number>();
|
|
572
|
+
const todo = [formula];
|
|
573
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
574
|
+
if (occurring.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
|
|
575
|
+
occurring.add(expr);
|
|
576
|
+
manager.pushArgs(expr, todo);
|
|
577
|
+
}
|
|
578
|
+
filterRefVector(vars, (innerVar) => occurring.has(innerVar));
|
|
579
|
+
return formula;
|
|
580
|
+
}
|
|
581
|
+
|
|
582
|
+
private percolateGroundUpFrom(term: Term) {
|
|
583
|
+
let current = term;
|
|
584
|
+
// Every ground class has a c-ground term.
|
|
585
|
+
while (!current.isCgr) current = current.next;
|
|
586
|
+
this.percolateGroundUp([current]);
|
|
587
|
+
}
|
|
588
|
+
|
|
589
|
+
private percolateGroundUp(todo: Term[]) {
|
|
590
|
+
for (let term = todo.pop(); term !== undefined; term = todo.pop()) {
|
|
591
|
+
term.isCgr = true;
|
|
592
|
+
term.isClassGr = true;
|
|
593
|
+
for (const parent of term.root.parents)
|
|
594
|
+
if (!parent.isCgr && parent.areAllChildrenGround()) todo.push(parent);
|
|
595
|
+
}
|
|
596
|
+
}
|
|
597
|
+
}
|
|
598
|
+
|
|
599
|
+
export const filterRefVector = (vector: RefVector, keep: (expr: number) => boolean) => {
|
|
600
|
+
let kept = 0;
|
|
601
|
+
for (const expr of vector.items) {
|
|
602
|
+
if (!keep(expr)) continue;
|
|
603
|
+
vector.set(kept++, expr);
|
|
604
|
+
}
|
|
605
|
+
vector.shrink(kept);
|
|
606
|
+
};
|