tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- 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 +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- 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 +120 -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 +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- 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 +226 -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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- 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 +9 -20
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -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 +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -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 +298 -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-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -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 +111 -39
- 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 +355 -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 +30 -11
- 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 +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- 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 +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +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 +310 -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 +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- 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 +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -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 +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -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 +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- 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 +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- 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 +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -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 +57 -26
- 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 +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- 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 +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +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/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- 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,236 @@
|
|
|
1
|
+
import { type AstManager, OP_SEQ_CONCAT, OP_SEQ_UNIT } from "./ast";
|
|
2
|
+
import { GuardSet, GuardSetCache } from "./guard-set";
|
|
3
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
4
|
+
import { RefVector } from "./ref-vector";
|
|
5
|
+
import { isEmptySeq } from "./seq-decl-plugin";
|
|
6
|
+
import { TRANSITION_LIGHT_ANTIMIROV } from "./seq-derive";
|
|
7
|
+
import type { ReRewriter } from "./seq-re-rewriter";
|
|
8
|
+
import { isReEmpty, mkFullChar, mkFullSeq, mkToRe } from "./seq-re-util";
|
|
9
|
+
|
|
10
|
+
const RANGE_CACHE_CAP = 1 << 16;
|
|
11
|
+
|
|
12
|
+
interface Node {
|
|
13
|
+
leftSegment: number;
|
|
14
|
+
rightSegment: number;
|
|
15
|
+
leftStates: number[];
|
|
16
|
+
rightStates: number[];
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
export class SeqEqApprox {
|
|
20
|
+
private views = new Map<number, number[]>();
|
|
21
|
+
private pins: RefVector;
|
|
22
|
+
readonly used: number[] = [];
|
|
23
|
+
private rangeCache: GuardSetCache;
|
|
24
|
+
private budget = 0;
|
|
25
|
+
|
|
26
|
+
constructor(
|
|
27
|
+
private manager: AstManager,
|
|
28
|
+
private re: ReRewriter,
|
|
29
|
+
private maxStates: number,
|
|
30
|
+
) {
|
|
31
|
+
this.pins = new RefVector(manager);
|
|
32
|
+
this.rangeCache = new GuardSetCache(manager);
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
addView(term: number, state: number, target: number) {
|
|
36
|
+
const views = this.views.get(term) ?? [];
|
|
37
|
+
views.push(state, target);
|
|
38
|
+
this.views.set(term, views);
|
|
39
|
+
this.pins.push(term);
|
|
40
|
+
this.pins.push(state);
|
|
41
|
+
if (target !== -1) this.pins.push(target);
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
resetViews() {
|
|
45
|
+
this.views.clear();
|
|
46
|
+
this.pins.reset();
|
|
47
|
+
this.used.length = 0;
|
|
48
|
+
}
|
|
49
|
+
|
|
50
|
+
private nullable(regex: number) {
|
|
51
|
+
const manager = this.manager;
|
|
52
|
+
const info = this.re.info.getInfo(regex).nullable;
|
|
53
|
+
if (info !== L_UNDEF) return info;
|
|
54
|
+
const formula = this.re.isNullable(regex);
|
|
55
|
+
return manager.isTrue(formula) ? L_TRUE : manager.isFalse(formula) ? L_FALSE : L_UNDEF;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
private isOutOfBudget() {
|
|
59
|
+
if (this.budget === 0 || !this.manager.limit.inc()) return true;
|
|
60
|
+
this.budget--;
|
|
61
|
+
return false;
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
private addSegment(regex: number, segments: number[][]) {
|
|
65
|
+
this.pins.push(regex);
|
|
66
|
+
segments.push([regex, -1]);
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
private toSegments(term: number, segments: number[][]) {
|
|
70
|
+
const manager = this.manager;
|
|
71
|
+
if (isEmptySeq(manager, term)) return;
|
|
72
|
+
if (manager.getOp(term) === OP_SEQ_CONCAT) {
|
|
73
|
+
for (const arg of manager.getArgs(term)) this.toSegments(arg, segments);
|
|
74
|
+
return;
|
|
75
|
+
}
|
|
76
|
+
const reSort = manager.mkReSort(manager.sorts[term]);
|
|
77
|
+
const views = this.views.get(term);
|
|
78
|
+
if (views !== undefined) {
|
|
79
|
+
if (!this.used.includes(term)) this.used.push(term);
|
|
80
|
+
segments.push(views);
|
|
81
|
+
return;
|
|
82
|
+
}
|
|
83
|
+
const chars = manager.getString(term);
|
|
84
|
+
if (chars !== undefined) {
|
|
85
|
+
if (chars.length > 0) this.addSegment(mkToRe(manager, term), segments);
|
|
86
|
+
return;
|
|
87
|
+
}
|
|
88
|
+
if (manager.getOp(term) === OP_SEQ_UNIT)
|
|
89
|
+
this.addSegment(
|
|
90
|
+
manager.isValue(manager.getArg(term, 0))
|
|
91
|
+
? mkToRe(manager, term)
|
|
92
|
+
: mkFullChar(manager, reSort),
|
|
93
|
+
segments,
|
|
94
|
+
);
|
|
95
|
+
else this.addSegment(mkFullSeq(manager, reSort), segments);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
private isSegmentDone(views: readonly number[], states: readonly number[]) {
|
|
99
|
+
for (let index = 0; index < states.length; index++) {
|
|
100
|
+
const target = views[2 * index + 1];
|
|
101
|
+
if (target !== -1) {
|
|
102
|
+
if (states[index] !== target) return L_FALSE;
|
|
103
|
+
continue;
|
|
104
|
+
}
|
|
105
|
+
const nullable = this.nullable(states[index]);
|
|
106
|
+
if (nullable !== L_TRUE) return nullable;
|
|
107
|
+
}
|
|
108
|
+
return L_TRUE;
|
|
109
|
+
}
|
|
110
|
+
|
|
111
|
+
private intersectNonempty(left: number[][], right: number[][]) {
|
|
112
|
+
const manager = this.manager;
|
|
113
|
+
this.budget = this.maxStates;
|
|
114
|
+
if (left.length === 0 && right.length === 0) return L_TRUE;
|
|
115
|
+
let probe = -1;
|
|
116
|
+
for (const segments of [left, right])
|
|
117
|
+
for (const segment of segments) {
|
|
118
|
+
if (segment.length === 0) return L_UNDEF;
|
|
119
|
+
if (probe === -1) probe = segment[0];
|
|
120
|
+
}
|
|
121
|
+
if (probe === -1) return L_UNDEF;
|
|
122
|
+
const elementSort = manager.getSeqElementSort(manager.getReSeqSort(manager.sorts[probe]));
|
|
123
|
+
const variable0 = manager.mkVar(0, elementSort);
|
|
124
|
+
const getStates = (segments: number[][], index: number) => {
|
|
125
|
+
const states: number[] = [];
|
|
126
|
+
if (index < segments.length)
|
|
127
|
+
for (let view = 0; view < segments[index].length; view += 2)
|
|
128
|
+
states.push(segments[index][view]);
|
|
129
|
+
return states;
|
|
130
|
+
};
|
|
131
|
+
const work: Node[] = [];
|
|
132
|
+
const visited = new Set<string>();
|
|
133
|
+
const push = (node: Node) => {
|
|
134
|
+
const key = [
|
|
135
|
+
node.leftSegment,
|
|
136
|
+
node.rightSegment,
|
|
137
|
+
...node.leftStates.map((state) => manager.ids[state]),
|
|
138
|
+
...node.rightStates.map((state) => manager.ids[state]),
|
|
139
|
+
].join(",");
|
|
140
|
+
if (visited.has(key)) return;
|
|
141
|
+
visited.add(key);
|
|
142
|
+
work.push(node);
|
|
143
|
+
};
|
|
144
|
+
push({
|
|
145
|
+
leftSegment: 0,
|
|
146
|
+
rightSegment: 0,
|
|
147
|
+
leftStates: getStates(left, 0),
|
|
148
|
+
rightStates: getStates(right, 0),
|
|
149
|
+
});
|
|
150
|
+
const derive = this.re.getDerive();
|
|
151
|
+
let isBailing = false;
|
|
152
|
+
for (let head = 0; head < work.length; head++) {
|
|
153
|
+
if (this.isOutOfBudget()) return L_UNDEF;
|
|
154
|
+
const node = work[head];
|
|
155
|
+
const isLeftDone = node.leftSegment === left.length;
|
|
156
|
+
const isRightDone = node.rightSegment === right.length;
|
|
157
|
+
if (isLeftDone && isRightDone) return L_TRUE;
|
|
158
|
+
if (!isLeftDone) {
|
|
159
|
+
const isDone = this.isSegmentDone(left[node.leftSegment], node.leftStates);
|
|
160
|
+
if (isDone === L_UNDEF) return L_UNDEF;
|
|
161
|
+
if (isDone === L_TRUE)
|
|
162
|
+
push({
|
|
163
|
+
...node,
|
|
164
|
+
leftSegment: node.leftSegment + 1,
|
|
165
|
+
leftStates: getStates(left, node.leftSegment + 1),
|
|
166
|
+
});
|
|
167
|
+
}
|
|
168
|
+
if (!isRightDone) {
|
|
169
|
+
const isDone = this.isSegmentDone(right[node.rightSegment], node.rightStates);
|
|
170
|
+
if (isDone === L_UNDEF) return L_UNDEF;
|
|
171
|
+
if (isDone === L_TRUE)
|
|
172
|
+
push({
|
|
173
|
+
...node,
|
|
174
|
+
rightSegment: node.rightSegment + 1,
|
|
175
|
+
rightStates: getStates(right, node.rightSegment + 1),
|
|
176
|
+
});
|
|
177
|
+
}
|
|
178
|
+
if (isLeftDone || isRightDone) continue;
|
|
179
|
+
const branches = [...node.leftStates, ...node.rightStates].map((state) =>
|
|
180
|
+
derive.getCachedCofactors(TRANSITION_LIGHT_ANTIMIROV, state),
|
|
181
|
+
);
|
|
182
|
+
const currentLeft = [...node.leftStates];
|
|
183
|
+
const currentRight = [...node.rightStates];
|
|
184
|
+
const numLeft = currentLeft.length;
|
|
185
|
+
const recurse = (index: number, accumulated: GuardSet) => {
|
|
186
|
+
if (isBailing) return;
|
|
187
|
+
if (index === branches.length) {
|
|
188
|
+
push({
|
|
189
|
+
leftSegment: node.leftSegment,
|
|
190
|
+
rightSegment: node.rightSegment,
|
|
191
|
+
leftStates: [...currentLeft],
|
|
192
|
+
rightStates: [...currentRight],
|
|
193
|
+
});
|
|
194
|
+
return;
|
|
195
|
+
}
|
|
196
|
+
const cofactors = branches[index];
|
|
197
|
+
for (let pair = 0; pair < cofactors.size; pair += 2) {
|
|
198
|
+
const target = cofactors.items[pair + 1];
|
|
199
|
+
if (isReEmpty(manager, target)) continue;
|
|
200
|
+
const joint = accumulated.clone();
|
|
201
|
+
joint.conjoin(cofactors.items[pair]);
|
|
202
|
+
const status = joint.eval(false).status;
|
|
203
|
+
if (status === L_UNDEF) {
|
|
204
|
+
joint.release();
|
|
205
|
+
isBailing = true;
|
|
206
|
+
return;
|
|
207
|
+
}
|
|
208
|
+
if (status === L_FALSE) {
|
|
209
|
+
joint.release();
|
|
210
|
+
continue;
|
|
211
|
+
}
|
|
212
|
+
if (index < numLeft) currentLeft[index] = target;
|
|
213
|
+
else currentRight[index - numLeft] = target;
|
|
214
|
+
recurse(index + 1, joint);
|
|
215
|
+
joint.release();
|
|
216
|
+
if (isBailing) return;
|
|
217
|
+
}
|
|
218
|
+
};
|
|
219
|
+
const top = new GuardSet(manager, elementSort, variable0, this.rangeCache);
|
|
220
|
+
recurse(0, top);
|
|
221
|
+
top.release();
|
|
222
|
+
if (isBailing) return L_UNDEF;
|
|
223
|
+
}
|
|
224
|
+
return L_FALSE;
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
check(lhs: number, rhs: number) {
|
|
228
|
+
this.used.length = 0;
|
|
229
|
+
this.rangeCache.maybeReset(RANGE_CACHE_CAP);
|
|
230
|
+
const left: number[][] = [];
|
|
231
|
+
const right: number[][] = [];
|
|
232
|
+
this.toSegments(lhs, left);
|
|
233
|
+
this.toSegments(rhs, right);
|
|
234
|
+
return this.intersectNonempty(left, right);
|
|
235
|
+
}
|
|
236
|
+
}
|
|
@@ -0,0 +1,439 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
OP_ADD,
|
|
5
|
+
OP_EQ,
|
|
6
|
+
OP_ITE,
|
|
7
|
+
OP_MUL,
|
|
8
|
+
OP_SEQ_CONCAT,
|
|
9
|
+
OP_SEQ_FOLDL,
|
|
10
|
+
OP_SEQ_FOLDLI,
|
|
11
|
+
OP_SEQ_LENGTH,
|
|
12
|
+
OP_SEQ_MAP,
|
|
13
|
+
OP_SEQ_MAPI,
|
|
14
|
+
OP_SEQ_NTH_I,
|
|
15
|
+
OP_SEQ_UNIT,
|
|
16
|
+
OP_STRING_ITOS,
|
|
17
|
+
OP_STRING_UBVTOS,
|
|
18
|
+
SORT_BOOL,
|
|
19
|
+
SORT_INT,
|
|
20
|
+
} from "./ast";
|
|
21
|
+
import { Rational } from "./rational";
|
|
22
|
+
import { isEmptySeq, mkConcatOf, mkSeqApp } from "./seq-decl-plugin";
|
|
23
|
+
import type { SeqAxioms } from "./seq-axioms";
|
|
24
|
+
|
|
25
|
+
export interface SeqLength {
|
|
26
|
+
isKnown: boolean;
|
|
27
|
+
value: Rational;
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
interface SeqEqSolverHost {
|
|
31
|
+
addConsequence(isUsingDeps: boolean, clause: number[]): void;
|
|
32
|
+
addSolution(variable: number, term: number): void;
|
|
33
|
+
expr2rep(expr: number): number;
|
|
34
|
+
getLength(expr: number): SeqLength;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
export interface BinaryEq {
|
|
38
|
+
x: number;
|
|
39
|
+
xs: number[];
|
|
40
|
+
ys: number[];
|
|
41
|
+
y: number;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
interface TernaryEq {
|
|
45
|
+
x: number;
|
|
46
|
+
xs: number[];
|
|
47
|
+
y1: number;
|
|
48
|
+
ys: number[];
|
|
49
|
+
y2: number;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
export interface QuatEq {
|
|
53
|
+
x1: number;
|
|
54
|
+
xs: number[];
|
|
55
|
+
x2: number;
|
|
56
|
+
y1: number;
|
|
57
|
+
ys: number[];
|
|
58
|
+
y2: number;
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
const isSameList = (first: readonly number[], second: readonly number[]) =>
|
|
62
|
+
first.length === second.length && first.every((expr, index) => expr === second[index]);
|
|
63
|
+
|
|
64
|
+
export class SeqEqSolver {
|
|
65
|
+
constructor(
|
|
66
|
+
private manager: AstManager,
|
|
67
|
+
private host: SeqEqSolverHost,
|
|
68
|
+
private axioms: SeqAxioms,
|
|
69
|
+
) {}
|
|
70
|
+
|
|
71
|
+
private isOp(expr: number, op: number) {
|
|
72
|
+
return this.manager.getOp(expr) === op;
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
private isUnit(expr: number) {
|
|
76
|
+
return this.isOp(expr, OP_SEQ_UNIT);
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
private mkEq(first: number, second: number) {
|
|
80
|
+
return this.manager.mkApp(OP_EQ, [first, second], SORT_BOOL);
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private mkConcat(exprs: readonly number[], sort: number) {
|
|
84
|
+
return mkConcatOf(this.manager, exprs, sort);
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
reduce(ls: readonly number[], rs: readonly number[]) {
|
|
88
|
+
return (
|
|
89
|
+
this.reduceUnit(ls, rs) ||
|
|
90
|
+
this.reduceItos1(ls, rs) ||
|
|
91
|
+
this.reduceItos2(ls, rs) ||
|
|
92
|
+
this.reduceItos3(ls, rs) ||
|
|
93
|
+
this.reduceUbv2s(ls, rs) ||
|
|
94
|
+
this.reduceBinaryEq(ls, rs) ||
|
|
95
|
+
this.reduceNthSolved(ls, rs)
|
|
96
|
+
);
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private addConsequence(...clause: number[]) {
|
|
100
|
+
this.host.addConsequence(true, clause);
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
private reduceItos1(ls: readonly number[], rs: readonly number[]) {
|
|
104
|
+
if (ls.length !== 1 || rs.length !== 1) return false;
|
|
105
|
+
if (!this.isOp(ls[0], OP_STRING_ITOS) || !this.isOp(rs[0], OP_STRING_ITOS)) return false;
|
|
106
|
+
const first = this.manager.getArg(ls[0], 0);
|
|
107
|
+
const second = this.manager.getArg(rs[0], 0);
|
|
108
|
+
const eq = this.mkEq(first, second);
|
|
109
|
+
this.addConsequence(eq, this.axioms.mkLe(first, -1));
|
|
110
|
+
this.addConsequence(eq, this.axioms.mkLe(second, -1));
|
|
111
|
+
return true;
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
private reduceItos2(ls: readonly number[], rs: readonly number[]) {
|
|
115
|
+
const itos =
|
|
116
|
+
ls.length === 1 && rs.length === 0 && this.isOp(ls[0], OP_STRING_ITOS)
|
|
117
|
+
? ls[0]
|
|
118
|
+
: rs.length === 1 && ls.length === 0 && this.isOp(rs[0], OP_STRING_ITOS)
|
|
119
|
+
? rs[0]
|
|
120
|
+
: undefined;
|
|
121
|
+
if (itos === undefined) return false;
|
|
122
|
+
this.addConsequence(this.axioms.mkLe(this.manager.getArg(itos, 0), -1));
|
|
123
|
+
return true;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
private reduceItos3(ls: readonly number[], rs: readonly number[]) {
|
|
127
|
+
const manager = this.manager;
|
|
128
|
+
const isLeft = ls.length === 1 && this.isOp(ls[0], OP_STRING_ITOS);
|
|
129
|
+
if (!isLeft && !(rs.length === 1 && this.isOp(rs[0], OP_STRING_ITOS))) return false;
|
|
130
|
+
const number = manager.getArg(isLeft ? ls[0] : rs[0], 0);
|
|
131
|
+
const digits = isLeft ? rs : ls;
|
|
132
|
+
if (digits.length === 0) {
|
|
133
|
+
this.addConsequence(this.axioms.mkLe(number, -1));
|
|
134
|
+
return true;
|
|
135
|
+
}
|
|
136
|
+
for (const digit of digits) {
|
|
137
|
+
if (!this.isUnit(digit)) continue;
|
|
138
|
+
const isDigit = this.axioms.isDigit(manager.getArg(digit, 0));
|
|
139
|
+
if (this.host.expr2rep(isDigit) !== manager.trueExpr) this.addConsequence(isDigit);
|
|
140
|
+
}
|
|
141
|
+
if (!digits.every((digit) => this.isUnit(digit))) return false;
|
|
142
|
+
let num = -1;
|
|
143
|
+
for (const digit of digits) {
|
|
144
|
+
const value = this.axioms.skolem.mkDigit2int(manager.getArg(digit, 0));
|
|
145
|
+
num =
|
|
146
|
+
num === -1
|
|
147
|
+
? value
|
|
148
|
+
: manager.mkApp(
|
|
149
|
+
OP_ADD,
|
|
150
|
+
[manager.mkApp(OP_MUL, [manager.mkNumeral(10n), num], SORT_INT), value],
|
|
151
|
+
SORT_INT,
|
|
152
|
+
);
|
|
153
|
+
}
|
|
154
|
+
this.addConsequence(this.axioms.rewrite(this.mkEq(number, num)));
|
|
155
|
+
if (digits.length > 1) {
|
|
156
|
+
const value = this.axioms.skolem.mkDigit2int(manager.getArg(digits[0], 0));
|
|
157
|
+
this.addConsequence(this.axioms.mkGe(value, 1));
|
|
158
|
+
}
|
|
159
|
+
const term = this.mkConcat(digits, manager.sorts[digits[0]]);
|
|
160
|
+
this.host.addSolution(mkSeqApp(manager, OP_STRING_ITOS, [number]), term);
|
|
161
|
+
return true;
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
private reduceUnit(ls: readonly number[], rs: readonly number[]) {
|
|
165
|
+
if (isSameList(ls, rs)) return true;
|
|
166
|
+
const manager = this.manager;
|
|
167
|
+
if (ls.length === 1 && this.isVar(ls[0]) && !this.occurs(ls[0], rs)) {
|
|
168
|
+
this.host.addSolution(ls[0], this.mkConcat(rs, manager.sorts[ls[0]]));
|
|
169
|
+
return true;
|
|
170
|
+
}
|
|
171
|
+
if (rs.length === 1 && this.isVar(rs[0]) && !this.occurs(rs[0], ls)) {
|
|
172
|
+
this.host.addSolution(rs[0], this.mkConcat(ls, manager.sorts[rs[0]]));
|
|
173
|
+
return true;
|
|
174
|
+
}
|
|
175
|
+
return false;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
private reduceUbv2s(ls: readonly number[], rs: readonly number[]) {
|
|
179
|
+
if (
|
|
180
|
+
(ls.length === 1 && this.isOp(ls[0], OP_STRING_UBVTOS)) ||
|
|
181
|
+
(rs.length === 1 && this.isOp(rs[0], OP_STRING_UBVTOS))
|
|
182
|
+
)
|
|
183
|
+
throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
|
|
184
|
+
return false;
|
|
185
|
+
}
|
|
186
|
+
|
|
187
|
+
private reduceBinaryEq(ls: readonly number[], rs: readonly number[]) {
|
|
188
|
+
const match = this.matchSelfBinaryEq(ls, rs);
|
|
189
|
+
if (match === undefined) return false;
|
|
190
|
+
if (match.xs.length !== match.ys.length) {
|
|
191
|
+
this.host.addConsequence(true, []);
|
|
192
|
+
return true;
|
|
193
|
+
}
|
|
194
|
+
if (match.xs.length === 0) return true;
|
|
195
|
+
if (match.xs.length !== 1) return false;
|
|
196
|
+
const host = this.host;
|
|
197
|
+
if (host.expr2rep(match.xs[0]) === host.expr2rep(match.ys[0])) return false;
|
|
198
|
+
const eq = this.mkEq(match.xs[0], match.ys[0]);
|
|
199
|
+
const value = host.expr2rep(eq);
|
|
200
|
+
if (value === this.manager.trueExpr) return false;
|
|
201
|
+
this.addConsequence(eq);
|
|
202
|
+
return value === this.manager.falseExpr;
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
private reduceNthSolved(ls: readonly number[], rs: readonly number[]) {
|
|
206
|
+
const solved = this.matchNthSolved(ls, rs) ?? this.matchNthSolved(rs, ls);
|
|
207
|
+
if (solved === undefined) return false;
|
|
208
|
+
this.host.addSolution(solved.x, solved.y);
|
|
209
|
+
return true;
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
private matchNthSolved(ls: readonly number[], rs: readonly number[]) {
|
|
213
|
+
const manager = this.manager;
|
|
214
|
+
if (ls.length !== 1 || !this.isVar(ls[0])) return undefined;
|
|
215
|
+
let next = 0n;
|
|
216
|
+
for (const element of rs) {
|
|
217
|
+
const inner = this.isUnit(element) ? manager.getArg(element, 0) : -1;
|
|
218
|
+
if (
|
|
219
|
+
inner === -1 ||
|
|
220
|
+
!this.isOp(inner, OP_SEQ_NTH_I) ||
|
|
221
|
+
manager.getNumeral(manager.getArg(inner, 1)) !== next ||
|
|
222
|
+
manager.getArg(inner, 0) !== ls[0]
|
|
223
|
+
)
|
|
224
|
+
return undefined;
|
|
225
|
+
next++;
|
|
226
|
+
}
|
|
227
|
+
return { x: ls[0], y: this.mkConcat(rs, manager.sorts[ls[0]]) };
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
branchUnitVariableOf(variable: number, units: readonly number[]) {
|
|
231
|
+
const manager = this.manager;
|
|
232
|
+
const length = this.host.getLength(variable).value;
|
|
233
|
+
const count = Rational.of(BigInt(units.length));
|
|
234
|
+
if (length.compare(count) > 0) {
|
|
235
|
+
this.addConsequence(
|
|
236
|
+
this.axioms.mkLe(mkSeqApp(manager, OP_SEQ_LENGTH, [variable]), units.length),
|
|
237
|
+
);
|
|
238
|
+
return true;
|
|
239
|
+
}
|
|
240
|
+
const lengthValue = manager.mkNumeral(length.num);
|
|
241
|
+
const lengthTerm = mkSeqApp(manager, OP_SEQ_LENGTH, [variable]);
|
|
242
|
+
const isLength = this.mkEq(lengthValue, lengthTerm);
|
|
243
|
+
if (this.host.expr2rep(isLength) === manager.falseExpr) return false;
|
|
244
|
+
const prefix = this.mkConcat(units.slice(0, Number(length.num)), manager.sorts[variable]);
|
|
245
|
+
const eq = this.axioms.skolem.mkEq(variable, prefix);
|
|
246
|
+
this.addConsequence(this.axioms.mkNot(isLength), eq);
|
|
247
|
+
return true;
|
|
248
|
+
}
|
|
249
|
+
|
|
250
|
+
branchUnitVariable(ls: readonly number[], rs: readonly number[]) {
|
|
251
|
+
if (ls.length > 0 && this.isVar(ls[0]) && rs.every((expr) => this.isUnit(expr)))
|
|
252
|
+
return this.branchUnitVariableOf(ls[0], rs);
|
|
253
|
+
if (rs.length > 0 && this.isVar(rs[0]) && ls.every((expr) => this.isUnit(expr)))
|
|
254
|
+
return this.branchUnitVariableOf(rs[0], ls);
|
|
255
|
+
return false;
|
|
256
|
+
}
|
|
257
|
+
|
|
258
|
+
isVar(expr: number) {
|
|
259
|
+
const manager = this.manager;
|
|
260
|
+
if (!manager.isSeqSort(manager.sorts[expr])) return false;
|
|
261
|
+
if (isEmptySeq(manager, expr) || manager.getString(expr) !== undefined) return false;
|
|
262
|
+
const op = manager.getOp(expr);
|
|
263
|
+
return (
|
|
264
|
+
op !== OP_SEQ_CONCAT &&
|
|
265
|
+
op !== OP_SEQ_UNIT &&
|
|
266
|
+
op !== OP_STRING_ITOS &&
|
|
267
|
+
op !== OP_SEQ_NTH_I &&
|
|
268
|
+
op !== OP_SEQ_MAP &&
|
|
269
|
+
op !== OP_SEQ_MAPI &&
|
|
270
|
+
op !== OP_SEQ_FOLDL &&
|
|
271
|
+
op !== OP_SEQ_FOLDLI &&
|
|
272
|
+
op !== OP_ITE
|
|
273
|
+
);
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
private occurs(variable: number, exprs: readonly number[]) {
|
|
277
|
+
return exprs.some((expr) => expr === variable || this.isOp(expr, OP_ITE));
|
|
278
|
+
}
|
|
279
|
+
|
|
280
|
+
private countUnitsL2r(exprs: readonly number[], offset: number) {
|
|
281
|
+
let index = offset;
|
|
282
|
+
while (index < exprs.length && this.isUnit(exprs[index])) index++;
|
|
283
|
+
return index - offset;
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
private countUnitsR2l(exprs: readonly number[], offset: number) {
|
|
287
|
+
let count = 0;
|
|
288
|
+
for (let index = offset; index >= 0 && this.isUnit(exprs[index]); index--) count++;
|
|
289
|
+
return count;
|
|
290
|
+
}
|
|
291
|
+
|
|
292
|
+
private countNonUnitsL2r(exprs: readonly number[], offset: number) {
|
|
293
|
+
let index = offset;
|
|
294
|
+
while (index < exprs.length && !this.isUnit(exprs[index])) index++;
|
|
295
|
+
return index - offset;
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
private countNonUnitsR2l(exprs: readonly number[], offset: number) {
|
|
299
|
+
let count = 0;
|
|
300
|
+
for (let index = offset; index >= 0 && !this.isUnit(exprs[index]); index--) count++;
|
|
301
|
+
return count;
|
|
302
|
+
}
|
|
303
|
+
|
|
304
|
+
private getPrefix(exprs: readonly number[], size: number) {
|
|
305
|
+
return this.mkConcat(exprs.slice(0, size), this.manager.sorts[exprs[0]]);
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
private getSuffix(exprs: readonly number[], size: number) {
|
|
309
|
+
return this.mkConcat(exprs.slice(exprs.length - size), this.manager.sorts[exprs[0]]);
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
private matchTernaryEqR(ls: readonly number[], rs: readonly number[]): TernaryEq | undefined {
|
|
313
|
+
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs[rs.length - 1]))
|
|
314
|
+
return undefined;
|
|
315
|
+
const numLsUnits = this.countUnitsR2l(ls, ls.length - 1);
|
|
316
|
+
if (numLsUnits === 0 || numLsUnits === ls.length) return undefined;
|
|
317
|
+
const numRsNonUnits = this.countNonUnitsR2l(rs, rs.length - 1);
|
|
318
|
+
if (numRsNonUnits === rs.length) return undefined;
|
|
319
|
+
const numRsUnits = this.countUnitsR2l(rs, rs.length - 1 - numRsNonUnits);
|
|
320
|
+
if (numRsUnits === 0) return undefined;
|
|
321
|
+
const offset = rs.length - numRsNonUnits - numRsUnits;
|
|
322
|
+
return {
|
|
323
|
+
x: this.getPrefix(ls, ls.length - numLsUnits),
|
|
324
|
+
xs: ls.slice(ls.length - numLsUnits),
|
|
325
|
+
y1: this.getPrefix(rs, offset),
|
|
326
|
+
ys: rs.slice(offset, offset + numRsUnits),
|
|
327
|
+
y2: this.getSuffix(rs, numRsNonUnits),
|
|
328
|
+
};
|
|
329
|
+
}
|
|
330
|
+
|
|
331
|
+
matchTernaryEqRhs(ls: readonly number[], rs: readonly number[]) {
|
|
332
|
+
return this.matchTernaryEqR(ls, rs) ?? this.matchTernaryEqR(rs, ls);
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
private matchTernaryEqL(ls: readonly number[], rs: readonly number[]): TernaryEq | undefined {
|
|
336
|
+
if (ls.length <= 1 || rs.length <= 1 || !this.isVar(rs[0]) || !this.isVar(rs[rs.length - 1]))
|
|
337
|
+
return undefined;
|
|
338
|
+
const numLsUnits = this.countUnitsL2r(ls, 0);
|
|
339
|
+
if (numLsUnits === 0 || numLsUnits === ls.length) return undefined;
|
|
340
|
+
const numRsNonUnits = this.countNonUnitsL2r(rs, 0);
|
|
341
|
+
if (numRsNonUnits === rs.length || numRsNonUnits === 0) return undefined;
|
|
342
|
+
const numRsUnits = this.countUnitsL2r(rs, numRsNonUnits);
|
|
343
|
+
if (numRsUnits === 0) return undefined;
|
|
344
|
+
return {
|
|
345
|
+
xs: ls.slice(0, numLsUnits),
|
|
346
|
+
x: this.getSuffix(ls, ls.length - numLsUnits),
|
|
347
|
+
y1: this.getPrefix(rs, numRsNonUnits),
|
|
348
|
+
ys: rs.slice(numRsNonUnits, numRsNonUnits + numRsUnits),
|
|
349
|
+
y2: this.getSuffix(rs, rs.length - numRsNonUnits - numRsUnits),
|
|
350
|
+
};
|
|
351
|
+
}
|
|
352
|
+
|
|
353
|
+
matchTernaryEqLhs(ls: readonly number[], rs: readonly number[]) {
|
|
354
|
+
return this.matchTernaryEqL(ls, rs) ?? this.matchTernaryEqL(rs, ls);
|
|
355
|
+
}
|
|
356
|
+
|
|
357
|
+
matchBinaryEq(ls: readonly number[], rs: readonly number[]): BinaryEq | undefined {
|
|
358
|
+
if (
|
|
359
|
+
ls.length > 1 &&
|
|
360
|
+
this.isVar(ls[0]) &&
|
|
361
|
+
rs.length > 1 &&
|
|
362
|
+
this.isVar(rs[rs.length - 1]) &&
|
|
363
|
+
ls.slice(1).every((expr) => this.isUnit(expr)) &&
|
|
364
|
+
rs.slice(0, -1).every((expr) => this.isUnit(expr))
|
|
365
|
+
)
|
|
366
|
+
return { x: ls[0], y: rs[rs.length - 1], xs: ls.slice(1), ys: rs.slice(0, -1) };
|
|
367
|
+
return undefined;
|
|
368
|
+
}
|
|
369
|
+
|
|
370
|
+
private matchSelfBinaryEq(ls: readonly number[], rs: readonly number[]) {
|
|
371
|
+
const first = this.matchBinaryEq(ls, rs);
|
|
372
|
+
if (first !== undefined && first.x === first.y) return first;
|
|
373
|
+
const second = this.matchBinaryEq(rs, ls);
|
|
374
|
+
if (second !== undefined && second.x === second.y) return second;
|
|
375
|
+
return undefined;
|
|
376
|
+
}
|
|
377
|
+
|
|
378
|
+
matchQuatEq(ls: readonly number[], rs: readonly number[]): QuatEq | undefined {
|
|
379
|
+
if (
|
|
380
|
+
ls.length <= 1 ||
|
|
381
|
+
!this.isVar(ls[0]) ||
|
|
382
|
+
!this.isVar(ls[ls.length - 1]) ||
|
|
383
|
+
rs.length <= 1 ||
|
|
384
|
+
!this.isVar(rs[0]) ||
|
|
385
|
+
!this.isVar(rs[rs.length - 1])
|
|
386
|
+
)
|
|
387
|
+
return undefined;
|
|
388
|
+
const lsNonUnit = this.countNonUnitsL2r(ls, 0);
|
|
389
|
+
const rsNonUnit = this.countNonUnitsL2r(rs, 0);
|
|
390
|
+
if (lsNonUnit === ls.length || rsNonUnit === rs.length) return undefined;
|
|
391
|
+
const lsUnit = this.countUnitsL2r(ls, lsNonUnit);
|
|
392
|
+
const rsUnit = this.countUnitsL2r(rs, rsNonUnit);
|
|
393
|
+
if (lsUnit === 0 || rsUnit === 0) return undefined;
|
|
394
|
+
return {
|
|
395
|
+
x1: this.getPrefix(ls, lsNonUnit),
|
|
396
|
+
xs: ls.slice(lsNonUnit, lsNonUnit + lsUnit),
|
|
397
|
+
x2: this.getSuffix(ls, ls.length - lsNonUnit - lsUnit),
|
|
398
|
+
y1: this.getPrefix(rs, rsNonUnit),
|
|
399
|
+
ys: rs.slice(rsNonUnit, rsNonUnit + rsUnit),
|
|
400
|
+
y2: this.getSuffix(rs, rs.length - rsNonUnit - rsUnit),
|
|
401
|
+
};
|
|
402
|
+
}
|
|
403
|
+
|
|
404
|
+
canAlignFromLhs(ls: readonly number[], rs: readonly number[]) {
|
|
405
|
+
const manager = this.manager;
|
|
406
|
+
const last = rs[rs.length - 1];
|
|
407
|
+
for (let index = 0; index < ls.length; index++) {
|
|
408
|
+
if (manager.areDistinct(ls[index], last)) continue;
|
|
409
|
+
if (index === 0) return true;
|
|
410
|
+
let isSame = true;
|
|
411
|
+
if (rs.length > index) {
|
|
412
|
+
const diff = rs.length - (index + 1);
|
|
413
|
+
for (let inner = 0; isSame && inner < index; inner++)
|
|
414
|
+
isSame = !manager.areDistinct(ls[inner], rs[diff + inner]);
|
|
415
|
+
} else {
|
|
416
|
+
const diff = index + 1 - rs.length;
|
|
417
|
+
for (let inner = 0; isSame && inner + 1 < rs.length; inner++)
|
|
418
|
+
isSame = !manager.areDistinct(ls[diff + inner], rs[inner]);
|
|
419
|
+
}
|
|
420
|
+
if (isSame) return true;
|
|
421
|
+
}
|
|
422
|
+
return false;
|
|
423
|
+
}
|
|
424
|
+
|
|
425
|
+
canAlignFromRhs(ls: readonly number[], rs: readonly number[]) {
|
|
426
|
+
const manager = this.manager;
|
|
427
|
+
for (let index = 0; index < ls.length; index++) {
|
|
428
|
+
const diff = ls.length - 1 - index;
|
|
429
|
+
if (manager.areDistinct(ls[diff], rs[0])) continue;
|
|
430
|
+
if (index === 0) return true;
|
|
431
|
+
let isSame = true;
|
|
432
|
+
const bound = rs.length > index ? index : rs.length - 1;
|
|
433
|
+
for (let inner = 1; isSame && inner <= bound; inner++)
|
|
434
|
+
isSame = !manager.areDistinct(ls[diff + inner], rs[inner]);
|
|
435
|
+
if (isSame) return true;
|
|
436
|
+
}
|
|
437
|
+
return false;
|
|
438
|
+
}
|
|
439
|
+
}
|