tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,961 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
FAMILY_SEQ,
|
|
4
|
+
OP_EQ,
|
|
5
|
+
OP_SEQ_AT,
|
|
6
|
+
OP_SEQ_CONTAINS,
|
|
7
|
+
OP_SEQ_EXTRACT,
|
|
8
|
+
OP_SEQ_FOLDL,
|
|
9
|
+
OP_SEQ_FOLDLI,
|
|
10
|
+
OP_SEQ_INDEX,
|
|
11
|
+
OP_SEQ_IN_RE,
|
|
12
|
+
OP_SEQ_LAST_INDEX,
|
|
13
|
+
OP_SEQ_LENGTH,
|
|
14
|
+
OP_SEQ_MAP,
|
|
15
|
+
OP_SEQ_MAPI,
|
|
16
|
+
OP_SEQ_NTH_I,
|
|
17
|
+
OP_SEQ_NTH_U,
|
|
18
|
+
OP_SEQ_POWER,
|
|
19
|
+
OP_SEQ_PREFIX,
|
|
20
|
+
OP_SEQ_REPLACE,
|
|
21
|
+
OP_SEQ_REPLACE_ALL,
|
|
22
|
+
OP_SEQ_REPLACE_RE,
|
|
23
|
+
OP_SEQ_REPLACE_RE_ALL,
|
|
24
|
+
OP_SEQ_SUFFIX,
|
|
25
|
+
OP_SEQ_UNIT,
|
|
26
|
+
OP_STRING_FROM_CODE,
|
|
27
|
+
OP_STRING_IS_DIGIT,
|
|
28
|
+
OP_STRING_ITOS,
|
|
29
|
+
OP_STRING_LE,
|
|
30
|
+
OP_STRING_LT,
|
|
31
|
+
OP_STRING_SBVTOS,
|
|
32
|
+
OP_STRING_STOI,
|
|
33
|
+
OP_STRING_TO_CODE,
|
|
34
|
+
OP_STRING_UBVTOS,
|
|
35
|
+
SORT_BOOL,
|
|
36
|
+
} from "./ast";
|
|
37
|
+
import type { Context } from "./context";
|
|
38
|
+
import type { Enode } from "./enode";
|
|
39
|
+
import { ObjMap } from "./hashtable";
|
|
40
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
41
|
+
import {
|
|
42
|
+
type BoolVar,
|
|
43
|
+
FALSE_LITERAL,
|
|
44
|
+
type Literal,
|
|
45
|
+
mkLiteral,
|
|
46
|
+
negate,
|
|
47
|
+
TRUE_LITERAL,
|
|
48
|
+
} from "./literal";
|
|
49
|
+
import type { ProtoModel } from "./proto-model";
|
|
50
|
+
import { mkSeqApp } from "./seq-decl-plugin";
|
|
51
|
+
import type { SeqFactory } from "./seq-factory";
|
|
52
|
+
import { type DependentValue, FC_CONTINUE, FC_DONE, FC_GIVEUP } from "./theory";
|
|
53
|
+
import { TheorySeqRegex } from "./theory-seq-regex";
|
|
54
|
+
|
|
55
|
+
const MAX_UNFOLDING = 0x3fffffff;
|
|
56
|
+
const MAX_PAD = 1 << 16;
|
|
57
|
+
const SOURCE_UNIT = 0;
|
|
58
|
+
const SOURCE_INT = 1;
|
|
59
|
+
const SOURCE_STRING = 2;
|
|
60
|
+
|
|
61
|
+
const compareCodes = (first: readonly number[], second: readonly number[]) => {
|
|
62
|
+
for (let index = 0; index < first.length && index < second.length; index++)
|
|
63
|
+
if (first[index] !== second[index]) return first[index] - second[index];
|
|
64
|
+
return first.length - second.length;
|
|
65
|
+
};
|
|
66
|
+
|
|
67
|
+
export class TheorySeq extends TheorySeqRegex {
|
|
68
|
+
readonly name = "seq";
|
|
69
|
+
private factory: SeqFactory | undefined;
|
|
70
|
+
private limitMap: ObjMap<number>;
|
|
71
|
+
|
|
72
|
+
constructor(context: Context) {
|
|
73
|
+
super(context, FAMILY_SEQ);
|
|
74
|
+
this.limitMap = new ObjMap((key) => context.manager.hashes[key]);
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
finalCheckEh() {
|
|
78
|
+
if (!this.hasSeq) return FC_DONE;
|
|
79
|
+
this.isNewPropagation = false;
|
|
80
|
+
if (this.simplifyAndSolveEqs()) return FC_CONTINUE;
|
|
81
|
+
if (this.checkEquationConflict()) return FC_CONTINUE;
|
|
82
|
+
if (this.checkLts()) return FC_CONTINUE;
|
|
83
|
+
if (this.solveNqs(0)) return FC_CONTINUE;
|
|
84
|
+
if (this.checkFixedLength(true, false)) return FC_CONTINUE;
|
|
85
|
+
if (this.checkFixedLength(false, false)) return FC_CONTINUE;
|
|
86
|
+
if (this.checkFixedLength(false, true)) return FC_CONTINUE;
|
|
87
|
+
if (this.checkContains()) return FC_CONTINUE;
|
|
88
|
+
if (this.checkIntString()) return FC_CONTINUE;
|
|
89
|
+
if (this.reduceLengthEq()) return FC_CONTINUE;
|
|
90
|
+
if (this.branchUnitVariable()) return FC_CONTINUE;
|
|
91
|
+
if (this.branchBinaryVariable()) return FC_CONTINUE;
|
|
92
|
+
if (this.branchVariable()) return FC_CONTINUE;
|
|
93
|
+
if (this.checkLengthCoherence()) return FC_CONTINUE;
|
|
94
|
+
if (!this.checkExtensionality()) return FC_CONTINUE;
|
|
95
|
+
if (this.branchNqs()) return FC_CONTINUE;
|
|
96
|
+
if (this.branchItos()) return FC_CONTINUE;
|
|
97
|
+
if (this.checkFixedLength(false, true)) return FC_CONTINUE;
|
|
98
|
+
if (this.solveRecfuns()) return FC_CONTINUE;
|
|
99
|
+
if (this.finalCheckRegex()) return FC_CONTINUE;
|
|
100
|
+
if (this.unhandledExpr !== undefined) return FC_GIVEUP;
|
|
101
|
+
return this.eqs.size === 0 && this.ncs.size === 0 ? FC_DONE : FC_GIVEUP;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
private simplifyAndSolveEqs() {
|
|
105
|
+
this.isNewSolution = true;
|
|
106
|
+
while (this.isNewSolution && !this.context.isInconsistent()) {
|
|
107
|
+
this.isNewSolution = false;
|
|
108
|
+
this.solveEqs(0);
|
|
109
|
+
}
|
|
110
|
+
return this.isNewPropagation || this.context.isInconsistent();
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
private mkVar(node: Enode) {
|
|
114
|
+
const expr = node.owner;
|
|
115
|
+
if (!this.isSeq(expr) && !this.isRe(expr) && !this.isNthU(expr)) return -1;
|
|
116
|
+
if (this.isAttachedToVar(node)) return node.getThVar(this.id);
|
|
117
|
+
const thVar = this.varEnodes.length;
|
|
118
|
+
this.varEnodes.push(node);
|
|
119
|
+
this.unionFind.mkVar();
|
|
120
|
+
this.context.attachThVar(node, this, thVar);
|
|
121
|
+
this.context.markAsRelevant(expr);
|
|
122
|
+
return thVar;
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
internalizeAtom(atom: number) {
|
|
126
|
+
return this.internalizeTerm(atom);
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
internalizeTerm(term: number) {
|
|
130
|
+
const context = this.context;
|
|
131
|
+
const manager = this.manager;
|
|
132
|
+
this.hasSeq = true;
|
|
133
|
+
const op = manager.getOp(term);
|
|
134
|
+
if (op === OP_SEQ_IN_RE) this.mkVar(this.ensureEnodeOf(manager.getArg(term, 0)));
|
|
135
|
+
if (op === OP_STRING_UBVTOS || op === OP_STRING_SBVTOS)
|
|
136
|
+
throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
|
|
137
|
+
if (op === OP_SEQ_LENGTH) this.mkVar(this.ensureEnodeOf(manager.getArg(term, 0)));
|
|
138
|
+
const existing = context.getEnode(term);
|
|
139
|
+
if (existing !== undefined) {
|
|
140
|
+
this.mkVar(existing);
|
|
141
|
+
return true;
|
|
142
|
+
}
|
|
143
|
+
const isBool = manager.isBool(term);
|
|
144
|
+
if (isBool && (op === OP_SEQ_IN_RE || this.sk.isSkolem(term))) {
|
|
145
|
+
context.setVarTheory(context.mkBoolVar(term), this.id);
|
|
146
|
+
context.markAsRelevant(term);
|
|
147
|
+
return true;
|
|
148
|
+
}
|
|
149
|
+
for (const arg of manager.getArgs(term)) this.mkVar(this.ensureEnodeOf(arg));
|
|
150
|
+
if (isBool) {
|
|
151
|
+
context.setVarTheory(context.mkBoolVar(term), this.id);
|
|
152
|
+
context.markAsRelevant(term);
|
|
153
|
+
}
|
|
154
|
+
this.mkVar(context.getEnode(term) ?? context.mkEnode(term, false, isBool, true));
|
|
155
|
+
if (!context.relevancy.isEnabled) this.relevantEh(term);
|
|
156
|
+
return true;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
internalizeEqEh(eq: number) {
|
|
160
|
+
const context = this.context;
|
|
161
|
+
for (const arg of this.manager.getArgs(eq)) this.mkVar(context.getEnode(arg)!);
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
applySortCnstr(node: Enode) {
|
|
165
|
+
this.mkVar(node);
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
isBetaRedex(parent: Enode, node: Enode) {
|
|
169
|
+
const op = this.manager.getOp(parent.owner);
|
|
170
|
+
if (op !== OP_SEQ_MAP && op !== OP_SEQ_MAPI && op !== OP_SEQ_FOLDL && op !== OP_SEQ_FOLDLI)
|
|
171
|
+
return false;
|
|
172
|
+
return parent.getArg(0).root === node.root;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
includeFuncInterp(decl: number) {
|
|
176
|
+
return this.manager.funcDecls[decl].op === OP_SEQ_NTH_U;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
private checkFixedLength(isZero: boolean, isCheckingLongStrings: boolean) {
|
|
180
|
+
let isFound = false;
|
|
181
|
+
for (let index = 0; index < this.lengths.length; index++)
|
|
182
|
+
if (this.fixedLength(this.lengths[index], isZero, isCheckingLongStrings)) isFound = true;
|
|
183
|
+
return isFound;
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
private fixedLength(length: number, isZero: boolean, isCheckingLongStrings: boolean) {
|
|
187
|
+
const manager = this.manager;
|
|
188
|
+
const context = this.context;
|
|
189
|
+
const expr = manager.getArg(length, 0);
|
|
190
|
+
if (!this.isVar(expr)) return false;
|
|
191
|
+
const lower = this.lowerBound(length);
|
|
192
|
+
if (lower === undefined) return false;
|
|
193
|
+
const upper = this.upperBound(length);
|
|
194
|
+
if (upper === undefined || !lower.equals(upper)) return false;
|
|
195
|
+
if (isZero ? !lower.isZero() : lower.isNegative() || lower.num > 0xffffffffn) return false;
|
|
196
|
+
const sk = this.sk;
|
|
197
|
+
if (
|
|
198
|
+
sk.isTail(expr) ||
|
|
199
|
+
sk.isSeqFirst(expr) ||
|
|
200
|
+
sk.isIndexofLeft(expr) ||
|
|
201
|
+
sk.isIndexofRight(expr) ||
|
|
202
|
+
this.fixed.has(expr)
|
|
203
|
+
)
|
|
204
|
+
return false;
|
|
205
|
+
const isLength = this.mkEqLiteral(length, manager.mkNumeral(lower.num), false);
|
|
206
|
+
if (context.getAssignment(isLength) === L_FALSE) return false;
|
|
207
|
+
if (!isCheckingLongStrings && lower.num > 20n && !isZero) return false;
|
|
208
|
+
this.fixed.add(this.keep(expr));
|
|
209
|
+
this.trailStack.push(() => {
|
|
210
|
+
this.fixed.delete(expr);
|
|
211
|
+
});
|
|
212
|
+
let seq = expr;
|
|
213
|
+
if (lower.isZero()) seq = this.mkEmpty(manager.sorts[expr]);
|
|
214
|
+
else if (!isZero) {
|
|
215
|
+
const elems: number[] = [];
|
|
216
|
+
for (let index = 0n; index < lower.num; index++) {
|
|
217
|
+
const decomposition = this.decompose(seq);
|
|
218
|
+
elems.push(decomposition.head);
|
|
219
|
+
seq = decomposition.tail;
|
|
220
|
+
}
|
|
221
|
+
seq = this.mkConcat(elems);
|
|
222
|
+
}
|
|
223
|
+
const eq = this.mkSeqEq(seq, expr);
|
|
224
|
+
if (context.getAssignment(eq) === L_TRUE) return false;
|
|
225
|
+
this.addAxiomOf(negate(isLength), eq);
|
|
226
|
+
if (context.scopeLevel !== context.baseLevel) {
|
|
227
|
+
const kept = this.keep(length);
|
|
228
|
+
this.trailStack.push(() => {
|
|
229
|
+
this.replay.push(() => {
|
|
230
|
+
this.fixedLength(kept, false, false);
|
|
231
|
+
});
|
|
232
|
+
});
|
|
233
|
+
}
|
|
234
|
+
return true;
|
|
235
|
+
}
|
|
236
|
+
|
|
237
|
+
private checkContains() {
|
|
238
|
+
for (let index = 0; !this.context.isInconsistent() && index < this.ncs.size; index++)
|
|
239
|
+
if (this.solveNc(index)) this.ncs.eraseAndSwap(index--);
|
|
240
|
+
return this.isNewPropagation || this.context.isInconsistent();
|
|
241
|
+
}
|
|
242
|
+
|
|
243
|
+
private solveNc(index: number) {
|
|
244
|
+
const manager = this.manager;
|
|
245
|
+
const nc = this.ncs.items[index];
|
|
246
|
+
const text = manager.getArg(nc.contains, 0);
|
|
247
|
+
const pattern = manager.getArg(nc.contains, 1);
|
|
248
|
+
const value = this.context.getAssignment(nc.lengthGreater);
|
|
249
|
+
if (value === L_TRUE) {
|
|
250
|
+
this.addLengthToEqc(text);
|
|
251
|
+
this.addLengthToEqc(pattern);
|
|
252
|
+
return true;
|
|
253
|
+
}
|
|
254
|
+
if (value === L_UNDEF) {
|
|
255
|
+
this.context.markLiteralAsRelevant(nc.lengthGreater);
|
|
256
|
+
this.isNewPropagation = true;
|
|
257
|
+
return false;
|
|
258
|
+
}
|
|
259
|
+
if (!this.sk.isTail(text)) this.addLengthLimit(text, this.maxUnfoldingDepth, true);
|
|
260
|
+
this.ax.unrollNotContains(nc.contains);
|
|
261
|
+
return true;
|
|
262
|
+
}
|
|
263
|
+
|
|
264
|
+
private checkLts() {
|
|
265
|
+
const manager = this.manager;
|
|
266
|
+
const context = this.context;
|
|
267
|
+
if (this.lts.size === 0 || this.isLtsChecked) return false;
|
|
268
|
+
const size = this.lts.size;
|
|
269
|
+
this.trailStack.push(() => {
|
|
270
|
+
this.isLtsChecked = false;
|
|
271
|
+
});
|
|
272
|
+
this.isLtsChecked = true;
|
|
273
|
+
const orient = (predicate: number) => {
|
|
274
|
+
let first = manager.getArg(predicate, 0);
|
|
275
|
+
let second = manager.getArg(predicate, 1);
|
|
276
|
+
let literal = context.getLiteral(predicate);
|
|
277
|
+
let isStrict = manager.getOp(predicate) === OP_STRING_LT;
|
|
278
|
+
if (context.getAssignment(literal) === L_FALSE) {
|
|
279
|
+
const swapped = first;
|
|
280
|
+
first = second;
|
|
281
|
+
second = swapped;
|
|
282
|
+
literal = negate(literal);
|
|
283
|
+
isStrict = !isStrict;
|
|
284
|
+
}
|
|
285
|
+
return { first, second, literal, isStrict };
|
|
286
|
+
};
|
|
287
|
+
for (let index = 0; index + 1 < size; index++) {
|
|
288
|
+
const outer = orient(this.lts.items[index]);
|
|
289
|
+
for (let other = index + 1; other < size; other++) {
|
|
290
|
+
const inner = orient(this.lts.items[other]);
|
|
291
|
+
if (context.getEnode(outer.second)!.root !== context.getEnode(inner.first)!.root) continue;
|
|
292
|
+
const eq =
|
|
293
|
+
outer.second === inner.first
|
|
294
|
+
? TRUE_LITERAL
|
|
295
|
+
: this.mkEqLiteral(outer.second, inner.first, false);
|
|
296
|
+
const isStrict = outer.isStrict || inner.isStrict;
|
|
297
|
+
const lower = manager.getString(outer.first);
|
|
298
|
+
const upper = manager.getString(inner.second);
|
|
299
|
+
if (lower !== undefined && upper !== undefined) {
|
|
300
|
+
const comparison = compareCodes(lower, upper);
|
|
301
|
+
if (isStrict ? comparison >= 0 : comparison > 0)
|
|
302
|
+
this.addAxiomOf(negate(outer.literal), negate(inner.literal), negate(eq));
|
|
303
|
+
continue;
|
|
304
|
+
}
|
|
305
|
+
const bound = mkSeqApp(manager, isStrict ? OP_STRING_LT : OP_STRING_LE, [
|
|
306
|
+
outer.first,
|
|
307
|
+
inner.second,
|
|
308
|
+
]);
|
|
309
|
+
this.addAxiomOf(
|
|
310
|
+
negate(outer.literal),
|
|
311
|
+
negate(inner.literal),
|
|
312
|
+
negate(eq),
|
|
313
|
+
this.mkLiteralOf(bound),
|
|
314
|
+
);
|
|
315
|
+
}
|
|
316
|
+
}
|
|
317
|
+
return true;
|
|
318
|
+
}
|
|
319
|
+
|
|
320
|
+
private checkIntString() {
|
|
321
|
+
let isChanged = false;
|
|
322
|
+
for (const expr of this.intStrings) if (this.checkIntStringOf(expr)) isChanged = true;
|
|
323
|
+
return isChanged;
|
|
324
|
+
}
|
|
325
|
+
|
|
326
|
+
private checkIntStringOf(expr: number) {
|
|
327
|
+
const manager = this.manager;
|
|
328
|
+
if (this.context.isInconsistent()) return true;
|
|
329
|
+
const arg = manager.getArg(expr, 0);
|
|
330
|
+
if (
|
|
331
|
+
this.isOp(expr, OP_STRING_ITOS) &&
|
|
332
|
+
!this.isOp(arg, OP_STRING_STOI) &&
|
|
333
|
+
this.addLengthToEqc(expr)
|
|
334
|
+
)
|
|
335
|
+
return true;
|
|
336
|
+
return (
|
|
337
|
+
this.isOp(expr, OP_STRING_STOI) && !this.isOp(arg, OP_STRING_ITOS) && this.addLengthToEqc(arg)
|
|
338
|
+
);
|
|
339
|
+
}
|
|
340
|
+
|
|
341
|
+
private branchItos() {
|
|
342
|
+
let isChanged = false;
|
|
343
|
+
for (const expr of this.intStrings) if (this.branchItosOf(expr)) isChanged = true;
|
|
344
|
+
return isChanged;
|
|
345
|
+
}
|
|
346
|
+
|
|
347
|
+
private branchItosOf(expr: number) {
|
|
348
|
+
const manager = this.manager;
|
|
349
|
+
const context = this.context;
|
|
350
|
+
if (context.isInconsistent()) return true;
|
|
351
|
+
if (!this.isOp(expr, OP_STRING_ITOS) || !context.isEInternalized(expr)) return false;
|
|
352
|
+
if (this.isString(context.getEnode(expr)!.root.owner)) return false;
|
|
353
|
+
const number = manager.getArg(expr, 0);
|
|
354
|
+
const value = this.getNumValue(number);
|
|
355
|
+
if (value === undefined || value.isNegative()) return false;
|
|
356
|
+
const digits = [...value.num.toString()].map((digit) => digit.charCodeAt(0));
|
|
357
|
+
const eq = this.mkEqLiteral(expr, manager.mkString(digits), false);
|
|
358
|
+
const assignment = context.getAssignment(eq);
|
|
359
|
+
if (assignment === L_TRUE) return false;
|
|
360
|
+
if (assignment === L_FALSE)
|
|
361
|
+
this.addAxiomOf(negate(this.mkEqLiteral(number, manager.mkNumeral(value.num), false)), eq);
|
|
362
|
+
else {
|
|
363
|
+
context.forcePhase(eq);
|
|
364
|
+
context.markLiteralAsRelevant(eq);
|
|
365
|
+
}
|
|
366
|
+
return true;
|
|
367
|
+
}
|
|
368
|
+
|
|
369
|
+
private solveRecfuns() {
|
|
370
|
+
for (let index = 0; index < this.recfuns.size && !this.context.isInconsistent(); index++) {
|
|
371
|
+
const term = this.recfuns.items[index];
|
|
372
|
+
const state = { dep: null, isChanged: false };
|
|
373
|
+
const canonical = this.canonize(term, state);
|
|
374
|
+
if (canonical !== undefined && canonical !== term) {
|
|
375
|
+
this.addSolution(term, canonical, state.dep);
|
|
376
|
+
this.recfuns.eraseAndSwap(index--);
|
|
377
|
+
}
|
|
378
|
+
}
|
|
379
|
+
return this.isNewPropagation || this.context.isInconsistent();
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
private addLengthLimit(input: number, limit: number, isSearching: boolean) {
|
|
383
|
+
const manager = this.manager;
|
|
384
|
+
const todo = [input];
|
|
385
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
386
|
+
if (this.isConcat(expr)) {
|
|
387
|
+
todo.push(...manager.getArgs(expr));
|
|
388
|
+
continue;
|
|
389
|
+
}
|
|
390
|
+
if (this.isUnit(expr) || this.isEmpty(expr)) continue;
|
|
391
|
+
if (this.sk.isSkolem(expr)) {
|
|
392
|
+
for (const arg of manager.getArgs(expr))
|
|
393
|
+
if (this.isSeq(arg) || this.sk.isSkolem(arg)) todo.push(arg);
|
|
394
|
+
continue;
|
|
395
|
+
}
|
|
396
|
+
const tracker = this.keep(this.ax.lengthLimit(expr, limit));
|
|
397
|
+
const previous = this.limitMap.get(expr);
|
|
398
|
+
if (previous !== undefined && limit <= previous) continue;
|
|
399
|
+
this.limitMap.set(this.keep(expr), limit);
|
|
400
|
+
this.lengthLimits.push(tracker);
|
|
401
|
+
this.trailStack.push(() => {
|
|
402
|
+
this.lengthLimits.pop();
|
|
403
|
+
});
|
|
404
|
+
this.trailStack.push(() => {
|
|
405
|
+
if (previous === undefined) this.limitMap.delete(expr);
|
|
406
|
+
else this.limitMap.set(expr, previous);
|
|
407
|
+
});
|
|
408
|
+
if (isSearching) {
|
|
409
|
+
const depth = this.sk.mkMaxUnfoldingDepth(this.maxUnfoldingDepth);
|
|
410
|
+
this.addAxiomOf(negate(this.mkLiteralOf(depth)), this.mkLiteralOf(tracker));
|
|
411
|
+
}
|
|
412
|
+
}
|
|
413
|
+
}
|
|
414
|
+
|
|
415
|
+
assignEh(boolVar: BoolVar, isTrue: boolean) {
|
|
416
|
+
const manager = this.manager;
|
|
417
|
+
const context = this.context;
|
|
418
|
+
const expr = context.boolVar2Expr[boolVar];
|
|
419
|
+
const literal = mkLiteral(boolVar, !isTrue);
|
|
420
|
+
const op = manager.getOp(expr);
|
|
421
|
+
if (op === OP_SEQ_PREFIX || op === OP_SEQ_SUFFIX) {
|
|
422
|
+
if (!isTrue) {
|
|
423
|
+
this.propagateNotAffix(expr);
|
|
424
|
+
return;
|
|
425
|
+
}
|
|
426
|
+
const first = this.rewrite(manager.getArg(expr, 0));
|
|
427
|
+
const second = this.rewrite(manager.getArg(expr, 1));
|
|
428
|
+
const isPrefix = op === OP_SEQ_PREFIX;
|
|
429
|
+
const inverse = isPrefix
|
|
430
|
+
? this.sk.mkPrefixInv(first, second)
|
|
431
|
+
: this.sk.mkSuffixInv(first, second);
|
|
432
|
+
const whole = isPrefix ? this.mkConcat2(first, inverse) : this.mkConcat2(inverse, first);
|
|
433
|
+
this.propagateEq(null, [literal], whole, second, true);
|
|
434
|
+
this.propagateEq(null, [literal], this.mkLen(whole), this.mkLen(second), false);
|
|
435
|
+
return;
|
|
436
|
+
}
|
|
437
|
+
if (op === OP_SEQ_CONTAINS) {
|
|
438
|
+
if (this.canonizes(isTrue, expr)) return;
|
|
439
|
+
const text = this.rewrite(manager.getArg(expr, 0));
|
|
440
|
+
const pattern = this.rewrite(manager.getArg(expr, 1));
|
|
441
|
+
if (isTrue) {
|
|
442
|
+
const left = this.sk.mkContainsLeft(text, pattern);
|
|
443
|
+
const right = this.sk.mkContainsRight(text, pattern);
|
|
444
|
+
const whole = this.mkConcat([left, pattern, right]);
|
|
445
|
+
const original = manager.getArg(expr, 0);
|
|
446
|
+
this.propagateEq(null, [literal], whole, original, true);
|
|
447
|
+
this.propagateEq(null, [literal], this.mkLen(whole), this.mkLen(original), false);
|
|
448
|
+
return;
|
|
449
|
+
}
|
|
450
|
+
this.propagateLit(null, [literal], negate(this.mkEqEmpty(pattern)));
|
|
451
|
+
const dep = this.mkLiteralLeaf(literal);
|
|
452
|
+
const isShorter = this.mkLeLiteral(this.mkSub(this.mkLen(text), this.mkLen(pattern)), -1);
|
|
453
|
+
context.forcePhase(isShorter);
|
|
454
|
+
this.ncs.push({ contains: this.keep(expr), lengthGreater: isShorter, dep });
|
|
455
|
+
return;
|
|
456
|
+
}
|
|
457
|
+
if (this.sk.getAccept(expr) !== undefined) {
|
|
458
|
+
if (isTrue) this.propagateAccept(literal);
|
|
459
|
+
return;
|
|
460
|
+
}
|
|
461
|
+
if (this.sk.isEq(expr)) {
|
|
462
|
+
if (isTrue)
|
|
463
|
+
this.propagateEq(null, [literal], manager.getArg(expr, 0), manager.getArg(expr, 1), true);
|
|
464
|
+
return;
|
|
465
|
+
}
|
|
466
|
+
if (op === OP_SEQ_IN_RE) {
|
|
467
|
+
this.propagateInRe(literal);
|
|
468
|
+
return;
|
|
469
|
+
}
|
|
470
|
+
if (this.sk.getLengthLimit(expr) !== undefined) {
|
|
471
|
+
if (isTrue) this.propagateLengthLimit(expr);
|
|
472
|
+
return;
|
|
473
|
+
}
|
|
474
|
+
if (op === OP_STRING_LT || op === OP_STRING_LE) {
|
|
475
|
+
this.assignLt(expr, literal, isTrue);
|
|
476
|
+
return;
|
|
477
|
+
}
|
|
478
|
+
if (
|
|
479
|
+
op === OP_SEQ_NTH_I ||
|
|
480
|
+
op === OP_SEQ_NTH_U ||
|
|
481
|
+
this.sk.isSkolem(expr) ||
|
|
482
|
+
op === OP_STRING_IS_DIGIT ||
|
|
483
|
+
op === OP_SEQ_FOLDL ||
|
|
484
|
+
op === OP_SEQ_FOLDLI
|
|
485
|
+
)
|
|
486
|
+
return;
|
|
487
|
+
throw new SmtUnsupportedError(
|
|
488
|
+
`the sequence atom ${manager.funcDecls[manager.decls[expr]].name}`,
|
|
489
|
+
);
|
|
490
|
+
}
|
|
491
|
+
|
|
492
|
+
private assignLt(expr: number, literal: Literal, isTrue: boolean) {
|
|
493
|
+
const manager = this.manager;
|
|
494
|
+
const context = this.context;
|
|
495
|
+
this.lts.push(this.keep(expr));
|
|
496
|
+
const getBound = (predicate: number) => {
|
|
497
|
+
const first = manager.getArg(predicate, 0);
|
|
498
|
+
const second = manager.getArg(predicate, 1);
|
|
499
|
+
const firstChars = manager.getString(first);
|
|
500
|
+
const secondChars = manager.getString(second);
|
|
501
|
+
if (firstChars !== undefined && secondChars === undefined)
|
|
502
|
+
return { isLower: true, bound: firstChars, variable: second };
|
|
503
|
+
if (firstChars === undefined && secondChars !== undefined)
|
|
504
|
+
return { isLower: false, bound: secondChars, variable: first };
|
|
505
|
+
return undefined;
|
|
506
|
+
};
|
|
507
|
+
const own = isTrue && manager.getOp(expr) === OP_STRING_LT ? getBound(expr) : undefined;
|
|
508
|
+
if (own === undefined || !context.isEInternalized(own.variable)) return;
|
|
509
|
+
const root = context.getEnode(own.variable)!.root;
|
|
510
|
+
for (const predicate of this.lts.items) {
|
|
511
|
+
if (predicate === expr || manager.getOp(predicate) !== OP_STRING_LT) continue;
|
|
512
|
+
const predicateLiteral = context.getLiteral(predicate);
|
|
513
|
+
if (predicateLiteral === TRUE_LITERAL || predicateLiteral === FALSE_LITERAL) continue;
|
|
514
|
+
if (context.getAssignment(predicateLiteral) !== L_TRUE) continue;
|
|
515
|
+
const other = getBound(predicate);
|
|
516
|
+
if (other === undefined || other.isLower === own.isLower) continue;
|
|
517
|
+
if (!context.isEInternalized(other.variable)) continue;
|
|
518
|
+
if (context.getEnode(other.variable)!.root !== root) continue;
|
|
519
|
+
const lower = own.isLower ? own.bound : other.bound;
|
|
520
|
+
const upper = own.isLower ? other.bound : own.bound;
|
|
521
|
+
if (compareCodes(lower, upper) >= 0) {
|
|
522
|
+
this.setConflict(null, [literal, predicateLiteral]);
|
|
523
|
+
return;
|
|
524
|
+
}
|
|
525
|
+
}
|
|
526
|
+
}
|
|
527
|
+
|
|
528
|
+
newEqEh(first: number, second: number) {
|
|
529
|
+
const firstNode = this.getEnode(first);
|
|
530
|
+
const secondNode = this.getEnode(second);
|
|
531
|
+
if (this.isRe(firstNode.owner)) {
|
|
532
|
+
this.propagateReEq(firstNode.owner, secondNode.owner);
|
|
533
|
+
return;
|
|
534
|
+
}
|
|
535
|
+
if (!this.isSeq(firstNode.owner)) return;
|
|
536
|
+
this.newEqEhOf(
|
|
537
|
+
this.mkAssumption({ first: firstNode, second: secondNode, literal: undefined }),
|
|
538
|
+
firstNode,
|
|
539
|
+
secondNode,
|
|
540
|
+
);
|
|
541
|
+
}
|
|
542
|
+
|
|
543
|
+
newDiseqEh(first: number, second: number) {
|
|
544
|
+
const manager = this.manager;
|
|
545
|
+
const context = this.context;
|
|
546
|
+
const firstNode = this.getEnode(first);
|
|
547
|
+
const secondNode = this.getEnode(second);
|
|
548
|
+
let left = firstNode.owner;
|
|
549
|
+
let right = secondNode.owner;
|
|
550
|
+
if (firstNode.root === secondNode.root) return;
|
|
551
|
+
if (this.isRe(left)) {
|
|
552
|
+
this.propagateReNe(left, right);
|
|
553
|
+
return;
|
|
554
|
+
}
|
|
555
|
+
if (!this.isSeq(left)) return;
|
|
556
|
+
this.exclude.update(this.keep(left), this.keep(right));
|
|
557
|
+
if (this.rewrite(manager.mkApp(OP_EQ, [left, right], SORT_BOOL)) === manager.falseExpr) return;
|
|
558
|
+
const literal = this.mkEqLiteral(left, right, false);
|
|
559
|
+
context.markLiteralAsRelevant(literal);
|
|
560
|
+
if (this.isEmpty(right)) {
|
|
561
|
+
const swapped = left;
|
|
562
|
+
left = right;
|
|
563
|
+
right = swapped;
|
|
564
|
+
}
|
|
565
|
+
const dep = this.mkLiteralLeaf(negate(literal));
|
|
566
|
+
this.nqs.push({ left, right, eqs: [{ ls: [left], rs: [right] }], literals: [], dep });
|
|
567
|
+
if (context.getAssignment(literal) !== L_UNDEF) this.solveNqs(this.nqs.size - 1);
|
|
568
|
+
}
|
|
569
|
+
|
|
570
|
+
pushScopeEh() {
|
|
571
|
+
super.pushScopeEh();
|
|
572
|
+
this.rep.pushScope();
|
|
573
|
+
this.exclude.pushScope();
|
|
574
|
+
this.pushScopeDeps();
|
|
575
|
+
this.trailStack.pushScope();
|
|
576
|
+
const axiomsHead = this.axiomsHead;
|
|
577
|
+
this.trailStack.push(() => {
|
|
578
|
+
this.axiomsHead = axiomsHead;
|
|
579
|
+
});
|
|
580
|
+
this.eqs.pushScope();
|
|
581
|
+
this.nqs.pushScope();
|
|
582
|
+
this.ncs.pushScope();
|
|
583
|
+
this.lts.pushScope();
|
|
584
|
+
this.recfuns.pushScope();
|
|
585
|
+
}
|
|
586
|
+
|
|
587
|
+
popScopeEh(numScopes: number) {
|
|
588
|
+
const context = this.context;
|
|
589
|
+
this.trailStack.popScope(numScopes);
|
|
590
|
+
super.popScopeEh(numScopes);
|
|
591
|
+
this.popScopeDeps(numScopes);
|
|
592
|
+
this.rep.popScope(numScopes);
|
|
593
|
+
this.exclude.popScope(numScopes);
|
|
594
|
+
this.eqs.popScope(numScopes);
|
|
595
|
+
this.nqs.popScope(numScopes);
|
|
596
|
+
this.ncs.popScope(numScopes);
|
|
597
|
+
this.lts.popScope(numScopes);
|
|
598
|
+
this.recfuns.popScope(numScopes);
|
|
599
|
+
this.rewriter.reset();
|
|
600
|
+
if (context.baseLevel > context.scopeLevel - numScopes) this.replay = [];
|
|
601
|
+
}
|
|
602
|
+
|
|
603
|
+
relevantEh(expr: number) {
|
|
604
|
+
const manager = this.manager;
|
|
605
|
+
const op = manager.getOp(expr);
|
|
606
|
+
if (
|
|
607
|
+
op === OP_SEQ_INDEX ||
|
|
608
|
+
op === OP_SEQ_REPLACE ||
|
|
609
|
+
op === OP_SEQ_EXTRACT ||
|
|
610
|
+
op === OP_SEQ_AT ||
|
|
611
|
+
op === OP_SEQ_NTH_I ||
|
|
612
|
+
this.isEmpty(expr) ||
|
|
613
|
+
this.isString(expr) ||
|
|
614
|
+
op === OP_STRING_ITOS ||
|
|
615
|
+
op === OP_STRING_STOI ||
|
|
616
|
+
op === OP_STRING_LT ||
|
|
617
|
+
op === OP_STRING_IS_DIGIT ||
|
|
618
|
+
op === OP_STRING_FROM_CODE ||
|
|
619
|
+
op === OP_STRING_TO_CODE ||
|
|
620
|
+
op === OP_SEQ_UNIT ||
|
|
621
|
+
op === OP_SEQ_POWER ||
|
|
622
|
+
op === OP_SEQ_LAST_INDEX ||
|
|
623
|
+
op === OP_SEQ_LENGTH ||
|
|
624
|
+
op === OP_STRING_LE
|
|
625
|
+
)
|
|
626
|
+
this.enqueAxiom(expr);
|
|
627
|
+
if (op === OP_STRING_ITOS || op === OP_STRING_STOI) {
|
|
628
|
+
this.intStrings.push(this.keep(expr));
|
|
629
|
+
this.trailStack.push(() => {
|
|
630
|
+
this.intStrings.pop();
|
|
631
|
+
});
|
|
632
|
+
}
|
|
633
|
+
if (op === OP_SEQ_FOLDL || op === OP_SEQ_FOLDLI || op === OP_SEQ_MAP || op === OP_SEQ_MAPI) {
|
|
634
|
+
this.addLengthToEqc(manager.getArg(expr, manager.getNumArgs(expr) - 1));
|
|
635
|
+
this.recfuns.push(this.keep(expr));
|
|
636
|
+
}
|
|
637
|
+
if (this.sk.isTail(expr))
|
|
638
|
+
this.addLengthLimit(manager.getArg(expr, 0), this.maxUnfoldingDepth, true);
|
|
639
|
+
if (op === OP_SEQ_LENGTH) {
|
|
640
|
+
const arg = manager.getArg(expr, 0);
|
|
641
|
+
if (!this.hasLength(arg) && this.context.isEInternalized(arg)) this.addLengthToEqc(arg);
|
|
642
|
+
}
|
|
643
|
+
if (op === OP_SEQ_REPLACE_ALL || op === OP_SEQ_REPLACE_RE || op === OP_SEQ_REPLACE_RE_ALL)
|
|
644
|
+
this.addUnhandledExpr(expr);
|
|
645
|
+
}
|
|
646
|
+
|
|
647
|
+
canPropagate() {
|
|
648
|
+
return this.axiomsHead < this.axioms.length || this.replay.length > 0 || this.isNewSolution;
|
|
649
|
+
}
|
|
650
|
+
|
|
651
|
+
propagate() {
|
|
652
|
+
const context = this.context;
|
|
653
|
+
while (this.axiomsHead < this.axioms.length && !context.isInconsistent()) {
|
|
654
|
+
this.dequeAxiom(this.axioms[this.axiomsHead]);
|
|
655
|
+
this.axiomsHead++;
|
|
656
|
+
}
|
|
657
|
+
while (this.replay.length > 0 && !context.isInconsistent()) {
|
|
658
|
+
this.replay[this.replay.length - 1]();
|
|
659
|
+
this.replay.pop();
|
|
660
|
+
}
|
|
661
|
+
if (this.isNewSolution) {
|
|
662
|
+
this.simplifyAndSolveEqs();
|
|
663
|
+
this.isNewSolution = false;
|
|
664
|
+
}
|
|
665
|
+
}
|
|
666
|
+
|
|
667
|
+
private enqueAxiom(expr: number) {
|
|
668
|
+
if (this.axiomSet.has(expr)) return;
|
|
669
|
+
this.axioms.push(this.keep(expr));
|
|
670
|
+
this.axiomSet.add(expr);
|
|
671
|
+
this.trailStack.push(() => {
|
|
672
|
+
this.axioms.pop();
|
|
673
|
+
});
|
|
674
|
+
this.trailStack.push(() => {
|
|
675
|
+
this.axiomSet.delete(expr);
|
|
676
|
+
});
|
|
677
|
+
}
|
|
678
|
+
|
|
679
|
+
private dequeAxiom(expr: number) {
|
|
680
|
+
const manager = this.manager;
|
|
681
|
+
const ax = this.ax;
|
|
682
|
+
const op = manager.getOp(expr);
|
|
683
|
+
if (op === OP_SEQ_LENGTH) {
|
|
684
|
+
this.addLength(expr);
|
|
685
|
+
ax.lengthAxiom(expr);
|
|
686
|
+
if (this.context.scopeLevel !== this.context.baseLevel)
|
|
687
|
+
this.trailStack.push(() => {
|
|
688
|
+
this.replay.push(() => {
|
|
689
|
+
this.enqueAxiom(expr);
|
|
690
|
+
});
|
|
691
|
+
});
|
|
692
|
+
} else if (this.isEmpty(expr) && !this.hasLength(expr) && this.hasLengthSet.size > 0)
|
|
693
|
+
this.addLengthToEqc(expr);
|
|
694
|
+
else if (op === OP_SEQ_INDEX) ax.indexofAxiom(expr);
|
|
695
|
+
else if (op === OP_SEQ_LAST_INDEX) ax.lastIndexofAxiom(expr);
|
|
696
|
+
else if (op === OP_SEQ_REPLACE) ax.replaceAxiom(expr);
|
|
697
|
+
else if (op === OP_SEQ_EXTRACT) ax.extractAxiom(expr);
|
|
698
|
+
else if (op === OP_SEQ_AT) ax.atAxiom(expr);
|
|
699
|
+
else if (op === OP_SEQ_NTH_I) ax.nthAxiom(expr);
|
|
700
|
+
else if (this.isString(expr)) this.addElimStringAxiom(expr);
|
|
701
|
+
else if (op === OP_STRING_ITOS) {
|
|
702
|
+
ax.itosAxiom(expr);
|
|
703
|
+
this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
|
|
704
|
+
} else if (op === OP_STRING_STOI) {
|
|
705
|
+
ax.stoiAxiom(expr);
|
|
706
|
+
this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
|
|
707
|
+
} else if (op === OP_STRING_LT) ax.ltAxiom(expr);
|
|
708
|
+
else if (op === OP_STRING_LE) ax.leAxiom(expr);
|
|
709
|
+
else if (op === OP_SEQ_UNIT) ax.unitAxiom(expr);
|
|
710
|
+
else if (op === OP_SEQ_POWER) {
|
|
711
|
+
ax.powerAxiom(expr);
|
|
712
|
+
this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
|
|
713
|
+
} else if (op === OP_STRING_IS_DIGIT) ax.isDigitAxiom(expr);
|
|
714
|
+
else if (op === OP_STRING_FROM_CODE) ax.strFromCodeAxiom(expr);
|
|
715
|
+
else if (op === OP_STRING_TO_CODE) ax.strToCodeAxiom(expr);
|
|
716
|
+
}
|
|
717
|
+
|
|
718
|
+
private addElimStringAxiom(expr: number) {
|
|
719
|
+
const manager = this.manager;
|
|
720
|
+
const chars = manager.getString(expr)!;
|
|
721
|
+
if (chars.length === 0) return;
|
|
722
|
+
const mkUnit = (code: number) => mkSeqApp(manager, OP_SEQ_UNIT, [manager.mkChar(code)]);
|
|
723
|
+
let result = mkUnit(chars[chars.length - 1]);
|
|
724
|
+
for (let index = chars.length - 1; index-- > 0;)
|
|
725
|
+
result = this.mkConcat2(mkUnit(chars[index]), result);
|
|
726
|
+
this.addAxiomOf(this.mkEqLiteral(expr, result, false));
|
|
727
|
+
this.rep.update(this.keep(expr), this.keep(result), null);
|
|
728
|
+
this.isNewSolution = true;
|
|
729
|
+
}
|
|
730
|
+
|
|
731
|
+
private propagateLengthLimit(expr: number) {
|
|
732
|
+
const manager = this.manager;
|
|
733
|
+
const limit = this.sk.getLengthLimit(expr)!;
|
|
734
|
+
const op = manager.getOp(limit.seq);
|
|
735
|
+
if (op === OP_STRING_STOI) this.ax.stoiAxiomOf(limit.seq, limit.limit);
|
|
736
|
+
if (op === OP_STRING_ITOS) this.ax.itosAxiomOf(limit.seq, limit.limit);
|
|
737
|
+
if (op === OP_SEQ_POWER) this.ax.powerUnfoldAxiom(limit.seq, limit.limit);
|
|
738
|
+
}
|
|
739
|
+
|
|
740
|
+
private propagateNotAffix(expr: number) {
|
|
741
|
+
const literal = this.context.getLiteral(expr);
|
|
742
|
+
const state = { dep: null, isChanged: false };
|
|
743
|
+
const canonical = this.canonize(expr, state);
|
|
744
|
+
if (canonical === this.manager.trueExpr) {
|
|
745
|
+
this.propagateLit(state.dep, [], literal);
|
|
746
|
+
return;
|
|
747
|
+
}
|
|
748
|
+
this.propagateLit(
|
|
749
|
+
null,
|
|
750
|
+
[negate(literal)],
|
|
751
|
+
negate(this.mkEqEmpty(this.manager.getArg(expr, 0))),
|
|
752
|
+
);
|
|
753
|
+
if (this.isOp(expr, OP_SEQ_PREFIX)) this.ax.prefixAxiom(expr);
|
|
754
|
+
else this.ax.suffixAxiom(expr);
|
|
755
|
+
}
|
|
756
|
+
|
|
757
|
+
private canonizes(isTrue: boolean, expr: number) {
|
|
758
|
+
const manager = this.manager;
|
|
759
|
+
const state = { dep: null, isChanged: false };
|
|
760
|
+
const canonical = this.canonize(expr, state) ?? expr;
|
|
761
|
+
if (
|
|
762
|
+
(canonical === manager.trueExpr && !isTrue) ||
|
|
763
|
+
(canonical === manager.falseExpr && isTrue)
|
|
764
|
+
) {
|
|
765
|
+
const literal = this.context.getLiteral(expr);
|
|
766
|
+
this.propagateLit(state.dep, [], isTrue ? negate(literal) : literal);
|
|
767
|
+
return true;
|
|
768
|
+
}
|
|
769
|
+
return (
|
|
770
|
+
(canonical === manager.falseExpr && !isTrue) || (canonical === manager.trueExpr && isTrue)
|
|
771
|
+
);
|
|
772
|
+
}
|
|
773
|
+
|
|
774
|
+
addTheoryAssumptions(assumptions: number[]) {
|
|
775
|
+
if (!this.hasSeq) return;
|
|
776
|
+
const depth = this.sk.mkMaxUnfoldingDepth(this.maxUnfoldingDepth);
|
|
777
|
+
const previous = this.maxUnfoldingLiteral;
|
|
778
|
+
this.trailStack.push(() => {
|
|
779
|
+
this.maxUnfoldingLiteral = previous;
|
|
780
|
+
});
|
|
781
|
+
this.maxUnfoldingLiteral = this.mkLiteralOf(depth);
|
|
782
|
+
assumptions.push(this.keep(depth));
|
|
783
|
+
for (const [seq, limit] of this.limitMap.entries())
|
|
784
|
+
if (limit > 0) assumptions.push(this.keep(this.sk.mkLengthLimit(seq, limit)));
|
|
785
|
+
}
|
|
786
|
+
|
|
787
|
+
shouldResearch(unsatCore: readonly number[]) {
|
|
788
|
+
if (!this.hasSeq) return false;
|
|
789
|
+
let minLimit = Infinity;
|
|
790
|
+
let minSeq: number | undefined;
|
|
791
|
+
let count = 0;
|
|
792
|
+
let hasMaxUnfolding = false;
|
|
793
|
+
for (const expr of unsatCore) {
|
|
794
|
+
const limit = this.sk.getLengthLimit(expr);
|
|
795
|
+
if (this.sk.isMaxUnfolding(expr)) hasMaxUnfolding = true;
|
|
796
|
+
else if (limit !== undefined) {
|
|
797
|
+
if (limit.limit < minLimit) {
|
|
798
|
+
minLimit = limit.limit;
|
|
799
|
+
minSeq = limit.seq;
|
|
800
|
+
count = 0;
|
|
801
|
+
} else if (limit.limit === minLimit && this.context.getRandomValue() % ++count === 0)
|
|
802
|
+
minSeq = limit.seq;
|
|
803
|
+
}
|
|
804
|
+
}
|
|
805
|
+
if (minSeq !== undefined && minLimit < MAX_UNFOLDING) {
|
|
806
|
+
this.maxUnfoldingDepth++;
|
|
807
|
+
let limit = minLimit * 2;
|
|
808
|
+
if (this.isSeq(minSeq)) {
|
|
809
|
+
limit = Math.max(this.getMinLength(minSeq), limit);
|
|
810
|
+
const lower = this.lowerBound2(minSeq);
|
|
811
|
+
if (lower !== undefined && !lower.isNegative() && lower.num <= 0xffffffffn)
|
|
812
|
+
limit = Math.max(Number(lower.num), limit);
|
|
813
|
+
}
|
|
814
|
+
this.addLengthLimit(minSeq, limit, false);
|
|
815
|
+
return true;
|
|
816
|
+
}
|
|
817
|
+
if (hasMaxUnfolding) {
|
|
818
|
+
this.maxUnfoldingDepth = Math.floor((1 + 3 * this.maxUnfoldingDepth) / 2);
|
|
819
|
+
return true;
|
|
820
|
+
}
|
|
821
|
+
if (minLimit !== Infinity) throw new SmtUnsupportedError("a deeper unfolding of sequences");
|
|
822
|
+
return false;
|
|
823
|
+
}
|
|
824
|
+
|
|
825
|
+
initModel(model: ProtoModel) {
|
|
826
|
+
this.rep.pushScope();
|
|
827
|
+
const factory = model.getSeqFactory();
|
|
828
|
+
this.factory = factory;
|
|
829
|
+
for (const ne of this.nqs.items) {
|
|
830
|
+
factory.registerValue(ne.left);
|
|
831
|
+
factory.registerValue(ne.right);
|
|
832
|
+
}
|
|
833
|
+
for (const ne of this.nqs.items)
|
|
834
|
+
for (const eq of ne.eqs) {
|
|
835
|
+
this.initModelOf(eq.ls);
|
|
836
|
+
this.initModelOf(eq.rs);
|
|
837
|
+
}
|
|
838
|
+
}
|
|
839
|
+
|
|
840
|
+
private initModelOf(exprs: readonly number[]) {
|
|
841
|
+
for (const expr of exprs) {
|
|
842
|
+
const state = { dep: null, isChanged: false };
|
|
843
|
+
const canonical = this.canonize(expr, state) ?? expr;
|
|
844
|
+
if (this.isVar(canonical)) {
|
|
845
|
+
const fresh = this.keep(this.factory!.getFreshValue(this.manager.sorts[canonical]));
|
|
846
|
+
this.rep.update(this.keep(canonical), fresh, state.dep);
|
|
847
|
+
}
|
|
848
|
+
}
|
|
849
|
+
}
|
|
850
|
+
|
|
851
|
+
finalizeModel() {
|
|
852
|
+
this.rep.popScope(1);
|
|
853
|
+
}
|
|
854
|
+
|
|
855
|
+
mkValue(node: Enode): number | DependentValue {
|
|
856
|
+
const manager = this.manager;
|
|
857
|
+
const context = this.context;
|
|
858
|
+
const expr = this.getIteValue(node.owner);
|
|
859
|
+
if (!this.isSeq(expr)) return this.mkValueOf(expr);
|
|
860
|
+
const concats: number[] = [];
|
|
861
|
+
const todo = [expr];
|
|
862
|
+
for (let next = todo.pop(); next !== undefined; next = todo.pop()) {
|
|
863
|
+
const current = this.rep.find(this.getIteValue(this.rep.find(next)));
|
|
864
|
+
if (this.isConcat(current)) todo.push(manager.getArg(current, 1), manager.getArg(current, 0));
|
|
865
|
+
else concats.push(current);
|
|
866
|
+
}
|
|
867
|
+
const sort = manager.sorts[expr];
|
|
868
|
+
const dependencies: Enode[] = [];
|
|
869
|
+
const sources: number[] = [];
|
|
870
|
+
const strings: number[] = [];
|
|
871
|
+
for (const concat of concats) {
|
|
872
|
+
const arg = manager.getNumArgs(concat) > 0 ? manager.getArg(concat, 0) : -1;
|
|
873
|
+
if (this.isUnit(concat)) {
|
|
874
|
+
if (context.isEInternalized(arg)) {
|
|
875
|
+
dependencies.push(context.getEnode(arg)!);
|
|
876
|
+
sources.push(SOURCE_UNIT);
|
|
877
|
+
} else if (manager.isValue(arg)) {
|
|
878
|
+
strings.push(concat);
|
|
879
|
+
sources.push(SOURCE_STRING);
|
|
880
|
+
}
|
|
881
|
+
} else if (this.isOp(concat, OP_STRING_ITOS)) {
|
|
882
|
+
if (context.isEInternalized(arg)) {
|
|
883
|
+
dependencies.push(context.getEnode(arg)!);
|
|
884
|
+
sources.push(SOURCE_INT);
|
|
885
|
+
}
|
|
886
|
+
} else if (this.isString(concat)) {
|
|
887
|
+
strings.push(concat);
|
|
888
|
+
sources.push(SOURCE_STRING);
|
|
889
|
+
} else {
|
|
890
|
+
strings.push(this.mkValueOf(concat));
|
|
891
|
+
sources.push(SOURCE_STRING);
|
|
892
|
+
}
|
|
893
|
+
}
|
|
894
|
+
return {
|
|
895
|
+
dependencies,
|
|
896
|
+
mkValue: (values) => this.mkSeqValue(sort, sources, strings, values),
|
|
897
|
+
};
|
|
898
|
+
}
|
|
899
|
+
|
|
900
|
+
private mkSeqValue(
|
|
901
|
+
sort: number,
|
|
902
|
+
sources: readonly number[],
|
|
903
|
+
strings: readonly number[],
|
|
904
|
+
values: readonly number[],
|
|
905
|
+
) {
|
|
906
|
+
const manager = this.manager;
|
|
907
|
+
let valueIndex = 0;
|
|
908
|
+
let stringIndex = 0;
|
|
909
|
+
if (manager.isStringSort(sort)) {
|
|
910
|
+
const codes: number[] = [];
|
|
911
|
+
for (const source of sources) {
|
|
912
|
+
if (source === SOURCE_UNIT) codes.push(manager.getChar(values[valueIndex++]));
|
|
913
|
+
else if (source === SOURCE_STRING) {
|
|
914
|
+
const string = strings[stringIndex++];
|
|
915
|
+
const canonical = this.canonize(string, { dep: null, isChanged: false }) ?? string;
|
|
916
|
+
const chars = manager.getString(this.strRewriter.rewrite(canonical));
|
|
917
|
+
if (chars !== undefined) codes.push(...chars);
|
|
918
|
+
} else {
|
|
919
|
+
const value = manager.getNumeral(values[valueIndex++])!;
|
|
920
|
+
if (value >= 0n) for (const digit of value.toString()) codes.push(digit.charCodeAt(0));
|
|
921
|
+
}
|
|
922
|
+
}
|
|
923
|
+
return this.keep(manager.mkString(codes));
|
|
924
|
+
}
|
|
925
|
+
const args = sources.map((source) =>
|
|
926
|
+
source === SOURCE_UNIT
|
|
927
|
+
? mkSeqApp(manager, OP_SEQ_UNIT, [values[valueIndex++]])
|
|
928
|
+
: strings[stringIndex++],
|
|
929
|
+
);
|
|
930
|
+
return this.keep(this.strRewriter.rewrite(this.mkConcat(args, sort)));
|
|
931
|
+
}
|
|
932
|
+
|
|
933
|
+
private mkValueOf(input: number) {
|
|
934
|
+
const manager = this.manager;
|
|
935
|
+
const factory = this.factory!;
|
|
936
|
+
const expr = this.getIteValue(input);
|
|
937
|
+
let result = this.rep.find(expr);
|
|
938
|
+
if (this.isVar(result)) result = factory.getFreshValue(manager.sorts[result]);
|
|
939
|
+
else result = this.rewrite(result);
|
|
940
|
+
if (this.isSeq(result) && !manager.isValue(result)) {
|
|
941
|
+
const fresh = factory.getFreshValue(manager.sorts[result]);
|
|
942
|
+
const chars = manager.getString(fresh);
|
|
943
|
+
const lower = chars === undefined ? undefined : this.lowerBound2(expr);
|
|
944
|
+
result = fresh;
|
|
945
|
+
if (
|
|
946
|
+
chars !== undefined &&
|
|
947
|
+
lower !== undefined &&
|
|
948
|
+
lower.isPositive() &&
|
|
949
|
+
lower.num <= BigInt(MAX_PAD) &&
|
|
950
|
+
BigInt(chars.length) < lower.num
|
|
951
|
+
) {
|
|
952
|
+
const padded = [...chars];
|
|
953
|
+
while (padded.length < Number(lower.num)) padded.push(97);
|
|
954
|
+
result = manager.mkString(padded);
|
|
955
|
+
}
|
|
956
|
+
}
|
|
957
|
+
this.keep(result);
|
|
958
|
+
this.rep.update(this.keep(expr), result, null);
|
|
959
|
+
return result;
|
|
960
|
+
}
|
|
961
|
+
}
|