tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.1ebc153bd
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/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +38 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- 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 +146 -58
- package/dist/prove.js +145 -57
- package/dist/run.cjs +43 -43
- package/dist/run.js +45 -45
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +40 -37
- package/dist/transfer.js +38 -35
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +268 -71
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +8 -1
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +2 -6
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/index.ts +9 -8
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +1 -6
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +5 -7
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +1 -4
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +256 -185
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +86 -55
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -12
- package/src/prover/isabelle/isar/method.ts +6 -10
- package/src/prover/isabelle/isar/proof.ts +40 -39
- package/src/prover/isabelle/isar/rule-cases.ts +14 -22
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -56
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- 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 +1 -3
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +3 -5
- 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 +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +55 -6
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/context.ts +10 -14
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +3 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +25 -16
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +4 -7
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +1 -4
- package/src/prover/smt/solver/asserted-formulas.ts +67 -3
- package/src/prover/smt/solver/ast-lt.ts +2 -3
- package/src/prover/smt/solver/ast-util.ts +4 -5
- package/src/prover/smt/solver/ast.ts +171 -168
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +2 -5
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +15 -19
- package/src/prover/smt/solver/bv1-blast.ts +1 -11
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +3 -7
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +19 -16
- package/src/prover/smt/solver/check-logic.ts +6 -2
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +2 -5
- package/src/prover/smt/solver/conflict-resolution.ts +8 -8
- package/src/prover/smt/solver/context.ts +45 -15
- package/src/prover/smt/solver/ctx-simplify.ts +1 -3
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +22 -17
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +2 -5
- package/src/prover/smt/solver/dependent-expr-state.ts +25 -7
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +1 -3
- package/src/prover/smt/solver/distribute-forall.ts +1 -11
- package/src/prover/smt/solver/dom-simplify.ts +1 -3
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
- package/src/prover/smt/solver/enode.ts +16 -10
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +2 -8
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +21 -12
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
- package/src/prover/smt/solver/euf/egraph.ts +69 -53
- package/src/prover/smt/solver/euf/euf-solver.ts +38 -37
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
- package/src/prover/smt/solver/euf/mam.ts +7 -55
- package/src/prover/smt/solver/euf/q-ematch.ts +27 -98
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
- package/src/prover/smt/solver/euf/q-solver.ts +3 -3
- package/src/prover/smt/solver/euf/th-solver.ts +1 -16
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +204 -80
- package/src/prover/smt/solver/factor.ts +37 -26
- package/src/prover/smt/solver/fd-solver.ts +3 -5
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +2 -4
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +25 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +12 -14
- package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
- package/src/prover/smt/solver/goal.ts +6 -4
- package/src/prover/smt/solver/goal2nlsat.ts +57 -32
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +4 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +41 -3
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +1 -2
- package/src/prover/smt/solver/lia2pb.ts +18 -5
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +9 -6
- 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 +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- 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 +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -2
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- 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 +26 -7
- 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 +158 -82
- 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 +144 -108
- 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 +50 -19
- 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 +138 -97
- 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 +1 -2
- package/src/prover/smt/solver/macro-finder.ts +1 -4
- package/src/prover/smt/solver/mam-compiler.ts +14 -15
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +6 -15
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
- package/src/prover/smt/solver/maxlex.ts +0 -8
- package/src/prover/smt/solver/maxsmt-base.ts +7 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
- package/src/prover/smt/solver/model-based-opt.ts +1 -2
- package/src/prover/smt/solver/model-checker.ts +2 -3
- package/src/prover/smt/solver/model-evaluator.ts +9 -6
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +3 -2
- package/src/prover/smt/solver/model-macro-solver.ts +3 -4
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +2 -5
- package/src/prover/smt/solver/mus.ts +2 -4
- package/src/prover/smt/solver/muz/dl-context.ts +67 -19
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +93 -57
- package/src/prover/smt/solver/muz/hnf.ts +6 -6
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
- package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +111 -102
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
- package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
- package/src/prover/smt/solver/muz/substitution.ts +88 -39
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +5 -5
- package/src/prover/smt/solver/nlsat/algebraic.ts +197 -96
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +379 -217
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +118 -105
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +1 -2
- package/src/prover/smt/solver/nnf.ts +6 -3
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +19 -13
- package/src/prover/smt/solver/opt-nlsat.ts +97 -77
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +1 -2
- package/src/prover/smt/solver/opt-solver.ts +22 -11
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +13 -12
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +2 -3
- package/src/prover/smt/solver/pb-rewriter.ts +15 -30
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +76 -21
- package/src/prover/smt/solver/probes.ts +91 -28
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +9 -12
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +50 -16
- package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +2 -3
- package/src/prover/smt/solver/qe-mbp.ts +13 -24
- package/src/prover/smt/solver/qe.ts +48 -57
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +71 -97
- package/src/prover/smt/solver/quant-hoist.ts +2 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +14 -10
- package/src/prover/smt/solver/quasi-macros.ts +9 -20
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +17 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
- package/src/prover/smt/solver/rewriter.ts +1 -2
- package/src/prover/smt/solver/rlimit.ts +17 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
- package/src/prover/smt/solver/sat/clause.ts +2 -20
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +6 -9
- package/src/prover/smt/solver/sat/consequences.ts +1 -2
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +30 -15
- package/src/prover/smt/solver/sat/model-converter.ts +2 -22
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
- package/src/prover/smt/solver/sat/probing.ts +22 -21
- package/src/prover/smt/solver/sat/sat-tactic.ts +4 -4
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
- package/src/prover/smt/solver/sat/scc.ts +1 -2
- package/src/prover/smt/solver/sat/simplifier.ts +16 -60
- package/src/prover/smt/solver/sat/solver.ts +47 -70
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +7 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +21 -39
- package/src/prover/smt/solver/seq-decl-plugin.ts +10 -14
- package/src/prover/smt/solver/seq-derive.ts +11 -16
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
- package/src/prover/smt/solver/seq-factory.ts +2 -4
- package/src/prover/smt/solver/seq-monadic.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
- package/src/prover/smt/solver/seq-re-rewriter.ts +5 -130
- package/src/prover/smt/solver/seq-re-util.ts +8 -27
- package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
- package/src/prover/smt/solver/seq-regex-live.ts +6 -8
- package/src/prover/smt/solver/seq-rewriter.ts +32 -35
- package/src/prover/smt/solver/seq-skolem.ts +0 -24
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +4 -6
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +9 -5
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +86 -20
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1681 -721
- package/src/prover/smt/solver/smtlib-script.ts +1273 -793
- package/src/prover/smt/solver/solve-eqs.ts +13 -23
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +269 -130
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +25 -60
- package/src/prover/smt/solver/theory-bv.ts +15 -54
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +46 -79
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +1 -2
- package/src/prover/smt/solver/theory-lra-internalize.ts +9 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +6 -5
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -7
- package/src/prover/smt/solver/theory-pb.ts +34 -15
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +2 -3
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
- package/src/prover/smt/solver/theory-seq-state.ts +8 -36
- package/src/prover/smt/solver/theory-seq.ts +32 -55
- package/src/prover/smt/solver/theory.ts +16 -2
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
- package/src/prover/smt/solver/var-subst.ts +6 -6
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/tlapm/cache.ts +8 -8
- package/src/prover/zenon/decide.ts +9 -13
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +12 -13
- package/src/prover/zenon/parse.ts +0 -2
- 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 +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +1 -3
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -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 +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,15 +1,11 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_rewriter.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
import {
|
|
4
3
|
type AstManager,
|
|
5
4
|
FAMILY_SEQ,
|
|
6
5
|
OP_AND,
|
|
7
|
-
OP_CHAR_LE,
|
|
8
|
-
OP_EQ,
|
|
9
6
|
OP_GE,
|
|
10
7
|
OP_ITE,
|
|
11
8
|
OP_LT,
|
|
12
|
-
OP_NOT,
|
|
13
9
|
OP_OR,
|
|
14
10
|
OP_RE_COMPLEMENT,
|
|
15
11
|
OP_RE_CONCAT,
|
|
@@ -39,8 +35,6 @@ import {
|
|
|
39
35
|
OP_STRING_LE,
|
|
40
36
|
SORT_BOOL,
|
|
41
37
|
} from "./ast";
|
|
42
|
-
import { flattenAndVector } from "./ast-util";
|
|
43
|
-
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
44
38
|
import { L_FALSE, L_TRUE } from "./lbool";
|
|
45
39
|
import { RefVector } from "./ref-vector";
|
|
46
40
|
import { KERNEL_REWRITER_OPTIONS, Rewriter } from "./rewriter";
|
|
@@ -55,11 +49,9 @@ import {
|
|
|
55
49
|
uniteRanges,
|
|
56
50
|
} from "./seq-range-predicate";
|
|
57
51
|
import { RegexBisim } from "./seq-regex-bisim";
|
|
58
|
-
import { RegexWitness } from "./seq-regex-witness";
|
|
59
52
|
import {
|
|
60
53
|
UINT_MAX,
|
|
61
54
|
canBeMember,
|
|
62
|
-
getCharConstRange,
|
|
63
55
|
getLoopBounds,
|
|
64
56
|
getLoopLower,
|
|
65
57
|
getRangeChars,
|
|
@@ -408,7 +400,7 @@ export class ReRewriter {
|
|
|
408
400
|
return this.mkReAppend(tailReverse, headReverse);
|
|
409
401
|
}
|
|
410
402
|
|
|
411
|
-
mkRegexUnionNormalize(first: number, second: number) {
|
|
403
|
+
private mkRegexUnionNormalize(first: number, second: number) {
|
|
412
404
|
const manager = this.manager;
|
|
413
405
|
if (first === second || isReEmpty(manager, second) || isFullSeq(manager, first)) return first;
|
|
414
406
|
if (isReEmpty(manager, first) || isFullSeq(manager, second)) return second;
|
|
@@ -442,7 +434,7 @@ export class ReRewriter {
|
|
|
442
434
|
);
|
|
443
435
|
}
|
|
444
436
|
|
|
445
|
-
mkRegexInterNormalize(inputFirst: number, inputSecond: number) {
|
|
437
|
+
private mkRegexInterNormalize(inputFirst: number, inputSecond: number) {
|
|
446
438
|
const manager = this.manager;
|
|
447
439
|
const isSwapped = isEpsilon(manager, inputSecond);
|
|
448
440
|
const first = isSwapped ? inputSecond : inputFirst;
|
|
@@ -492,7 +484,8 @@ export class ReRewriter {
|
|
|
492
484
|
left === right ? 0 : getId(left) < getId(right) ? -1 : 1;
|
|
493
485
|
const composeResult = (suffix: number) => {
|
|
494
486
|
let result = suffix;
|
|
495
|
-
|
|
487
|
+
for (let regex = prefix.pop(); regex !== undefined; regex = prefix.pop())
|
|
488
|
+
result = compose(regex, result);
|
|
496
489
|
return result;
|
|
497
490
|
};
|
|
498
491
|
let left = first;
|
|
@@ -777,8 +770,7 @@ export class ReRewriter {
|
|
|
777
770
|
};
|
|
778
771
|
const isEveryInterArmEndingWithFullSeq = (regex: number) => {
|
|
779
772
|
const todo = [regex];
|
|
780
|
-
|
|
781
|
-
const current = todo.pop()!;
|
|
773
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
782
774
|
const split = this.getSplit(current, OP_RE_INTERSECT);
|
|
783
775
|
if (split !== undefined) todo.push(split.head, split.tail);
|
|
784
776
|
else if (!isEndingWithFullSeq(current)) return false;
|
|
@@ -1107,116 +1099,6 @@ export class ReRewriter {
|
|
|
1107
1099
|
return this.mkUnion(this.mkToRe(mkEmptySeq(this.manager, this.getSeqSort(regex))), regex);
|
|
1108
1100
|
}
|
|
1109
1101
|
|
|
1110
|
-
elimCondition(element: number, inputCondition: number) {
|
|
1111
|
-
const manager = this.manager;
|
|
1112
|
-
const maxChar = this.manager.maxChar;
|
|
1113
|
-
const conds = new RefVector(manager);
|
|
1114
|
-
const rangeConds = new RefVector(manager);
|
|
1115
|
-
conds.push(inputCondition);
|
|
1116
|
-
flattenAndVector(manager, conds);
|
|
1117
|
-
let isAllRanges = false;
|
|
1118
|
-
if (manager.isCharSort(manager.sorts[element])) {
|
|
1119
|
-
isAllRanges = true;
|
|
1120
|
-
let ranges = [0, maxChar];
|
|
1121
|
-
const intersect = (lo: number, hi: number, current: number[]) => {
|
|
1122
|
-
const result: number[] = [];
|
|
1123
|
-
for (let index = 0; index < current.length; index += 2) {
|
|
1124
|
-
if (hi < current[index]) break;
|
|
1125
|
-
if (current[index + 1] >= lo)
|
|
1126
|
-
result.push(Math.max(current[index], lo), Math.min(current[index + 1], hi));
|
|
1127
|
-
}
|
|
1128
|
-
return result;
|
|
1129
|
-
};
|
|
1130
|
-
const excludeRange = (lower: number, upper: number) => {
|
|
1131
|
-
if (lower === 0) ranges = upper === maxChar ? [] : intersect(upper + 1, maxChar, ranges);
|
|
1132
|
-
else if (upper === maxChar) ranges = intersect(0, lower - 1, ranges);
|
|
1133
|
-
else
|
|
1134
|
-
ranges = [...intersect(0, lower - 1, ranges), ...intersect(upper + 1, maxChar, ranges)];
|
|
1135
|
-
};
|
|
1136
|
-
const getConstChars = (expr: number, op: number) => {
|
|
1137
|
-
if (manager.getOp(expr) !== op || manager.getNumArgs(expr) !== 2) return undefined;
|
|
1138
|
-
const first = manager.getChar(manager.getArg(expr, 0));
|
|
1139
|
-
const second = manager.getChar(manager.getArg(expr, 1));
|
|
1140
|
-
return first !== -1 && second !== -1 ? [first, second] : undefined;
|
|
1141
|
-
};
|
|
1142
|
-
const isSelfEq = (expr: number) =>
|
|
1143
|
-
manager.getOp(expr) === OP_EQ && manager.getArg(expr, 0) === manager.getArg(expr, 1);
|
|
1144
|
-
for (const cond of conds.items) {
|
|
1145
|
-
const range = getCharConstRange(manager, element, cond);
|
|
1146
|
-
const negated = manager.getOp(cond) === OP_NOT ? manager.getArg(cond, 0) : -1;
|
|
1147
|
-
const charsEq = negated === -1 ? undefined : getConstChars(negated, OP_EQ);
|
|
1148
|
-
const charsLe = getConstChars(cond, OP_CHAR_LE);
|
|
1149
|
-
const negatedCharsLe = negated === -1 ? undefined : getConstChars(negated, OP_CHAR_LE);
|
|
1150
|
-
if (range !== undefined) {
|
|
1151
|
-
if (range.lo > range.hi) {
|
|
1152
|
-
if (range.isNegated) continue;
|
|
1153
|
-
ranges = [];
|
|
1154
|
-
} else if (range.isNegated) excludeRange(range.lo, range.hi);
|
|
1155
|
-
else ranges = intersect(range.lo, range.hi, ranges);
|
|
1156
|
-
rangeConds.push(cond);
|
|
1157
|
-
} else if (manager.isTrue(cond) || isSelfEq(cond)) continue;
|
|
1158
|
-
else if (charsEq !== undefined && charsEq[0] !== charsEq[1]) continue;
|
|
1159
|
-
else if (charsLe !== undefined && charsLe[0] <= charsLe[1]) continue;
|
|
1160
|
-
else if (negatedCharsLe !== undefined && negatedCharsLe[0] > negatedCharsLe[1]) continue;
|
|
1161
|
-
else if (
|
|
1162
|
-
manager.isFalse(cond) ||
|
|
1163
|
-
(negated !== -1 && isSelfEq(negated)) ||
|
|
1164
|
-
charsLe !== undefined ||
|
|
1165
|
-
negatedCharsLe !== undefined
|
|
1166
|
-
)
|
|
1167
|
-
ranges = [];
|
|
1168
|
-
else {
|
|
1169
|
-
isAllRanges = false;
|
|
1170
|
-
break;
|
|
1171
|
-
}
|
|
1172
|
-
if (ranges.length === 0) break;
|
|
1173
|
-
}
|
|
1174
|
-
if (isAllRanges) {
|
|
1175
|
-
const trivial =
|
|
1176
|
-
ranges.length === 0
|
|
1177
|
-
? manager.falseExpr
|
|
1178
|
-
: manager.isUninterpretedConst(element)
|
|
1179
|
-
? manager.trueExpr
|
|
1180
|
-
: -1;
|
|
1181
|
-
if (trivial !== -1) {
|
|
1182
|
-
rangeConds.reset();
|
|
1183
|
-
conds.reset();
|
|
1184
|
-
return trivial;
|
|
1185
|
-
}
|
|
1186
|
-
conds.reset();
|
|
1187
|
-
for (const cond of rangeConds.items) conds.push(cond);
|
|
1188
|
-
}
|
|
1189
|
-
}
|
|
1190
|
-
let solution = -1;
|
|
1191
|
-
for (const cond of conds.items) {
|
|
1192
|
-
if (manager.getOp(cond) !== OP_EQ) continue;
|
|
1193
|
-
const lhs = manager.getArg(cond, 0);
|
|
1194
|
-
const rhs = manager.getArg(cond, 1);
|
|
1195
|
-
if (lhs !== element && rhs !== element) continue;
|
|
1196
|
-
solution = rhs === element ? lhs : rhs;
|
|
1197
|
-
break;
|
|
1198
|
-
}
|
|
1199
|
-
let result = inputCondition;
|
|
1200
|
-
if (solution !== -1) {
|
|
1201
|
-
const replace = new ExprSafeReplace(manager);
|
|
1202
|
-
replace.insert(element, solution);
|
|
1203
|
-
result = replace.apply(inputCondition);
|
|
1204
|
-
replace.release();
|
|
1205
|
-
manager.releaseLater(result);
|
|
1206
|
-
if (!manager.isUninterpretedConst(element))
|
|
1207
|
-
result = this.mkBool(OP_AND, [manager.mkEq(element, solution), result]);
|
|
1208
|
-
} else if (isAllRanges)
|
|
1209
|
-
result =
|
|
1210
|
-
conds.size === 0
|
|
1211
|
-
? manager.trueExpr
|
|
1212
|
-
: conds.size === 1
|
|
1213
|
-
? conds.items[0]
|
|
1214
|
-
: this.mkBool(OP_AND, [...conds.items]);
|
|
1215
|
-
rangeConds.reset();
|
|
1216
|
-
conds.reset();
|
|
1217
|
-
return result;
|
|
1218
|
-
}
|
|
1219
|
-
|
|
1220
1102
|
private reduceReIsEmpty(regex: number): Result {
|
|
1221
1103
|
const manager = this.manager;
|
|
1222
1104
|
const union = this.getSplit(regex, OP_RE_UNION);
|
|
@@ -1286,11 +1168,4 @@ export class ReRewriter {
|
|
|
1286
1168
|
? manager.falseExpr
|
|
1287
1169
|
: undefined;
|
|
1288
1170
|
}
|
|
1289
|
-
|
|
1290
|
-
someStringInRe(regex: number) {
|
|
1291
|
-
const witness = new RegexWitness(this.manager, this);
|
|
1292
|
-
const result = witness.getWitness(regex);
|
|
1293
|
-
witness.release();
|
|
1294
|
-
return result;
|
|
1295
|
-
}
|
|
1296
1171
|
}
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq_decl_plugin.cpp, src/ast/char_decl_plugin.cpp,
|
|
2
|
-
// src/util/len_abs.cpp), MIT license, see z3-license.txt.
|
|
3
1
|
import { SmtUnsupportedError } from "../../../errors";
|
|
4
2
|
import {
|
|
5
3
|
type AstManager,
|
|
@@ -42,7 +40,7 @@ const MAX_PERIOD = 64;
|
|
|
42
40
|
export const addTruncate = (first: number, second: number) =>
|
|
43
41
|
first + second > UINT_MAX ? UINT_MAX : first + second;
|
|
44
42
|
|
|
45
|
-
|
|
43
|
+
const mulTruncate = (first: number, second: number) =>
|
|
46
44
|
first * second > UINT_MAX ? UINT_MAX : first * second;
|
|
47
45
|
|
|
48
46
|
const getGcd = (first: number, second: number): number => {
|
|
@@ -59,7 +57,7 @@ export interface LenAbs {
|
|
|
59
57
|
residues: bigint;
|
|
60
58
|
}
|
|
61
59
|
|
|
62
|
-
|
|
60
|
+
interface ReInfo extends LenAbs {
|
|
63
61
|
isKnown: boolean;
|
|
64
62
|
isInterpreted: boolean;
|
|
65
63
|
nullable: number;
|
|
@@ -93,7 +91,7 @@ const getCommonPeriod = (first: number, second: number) => {
|
|
|
93
91
|
|
|
94
92
|
const getEffectivePeriod = (abs: LenAbs) => (abs.lo === abs.hi ? 0 : abs.period);
|
|
95
93
|
|
|
96
|
-
|
|
94
|
+
const isLenAbsEmpty = (abs: LenAbs) => {
|
|
97
95
|
if (abs.lo > abs.hi || abs.residues === 0n) return true;
|
|
98
96
|
if (abs.period <= 1) return false;
|
|
99
97
|
if (abs.hi === UINT_MAX || abs.hi - abs.lo >= abs.period - 1) return false;
|
|
@@ -211,12 +209,7 @@ const loopLenAbs = (abs: LenAbs, lower: number, upper: number) => {
|
|
|
211
209
|
return result;
|
|
212
210
|
};
|
|
213
211
|
|
|
214
|
-
|
|
215
|
-
period: number,
|
|
216
|
-
residues: bigint,
|
|
217
|
-
constant: number,
|
|
218
|
-
stride: number,
|
|
219
|
-
) => {
|
|
212
|
+
const isResidueReachable = (period: number, residues: bigint, constant: number, stride: number) => {
|
|
220
213
|
if (period === 0) return true;
|
|
221
214
|
const offset = constant % period;
|
|
222
215
|
const gcd = stride === 0 ? period : getGcd(stride, period);
|
|
@@ -250,8 +243,6 @@ const mkInfo = (
|
|
|
250
243
|
...(abs ?? mkLenAbs(minLength, maxLength)),
|
|
251
244
|
});
|
|
252
245
|
|
|
253
|
-
const negateLbool = (value: number) => -value;
|
|
254
|
-
|
|
255
246
|
const starInfo = (info: ReInfo) =>
|
|
256
247
|
mkInfo(info.isInterpreted, L_TRUE, 0, 0, info.isClassical, starLenAbs(info, 0));
|
|
257
248
|
|
|
@@ -272,7 +263,7 @@ const optInfo = (info: ReInfo) =>
|
|
|
272
263
|
|
|
273
264
|
const complementInfo = (info: ReInfo) => {
|
|
274
265
|
if (!info.isKnown) return info;
|
|
275
|
-
const nullable =
|
|
266
|
+
const nullable = -info.nullable;
|
|
276
267
|
return mkInfo(info.isInterpreted, nullable, nullable === L_FALSE ? 1 : 0, UINT_MAX, false);
|
|
277
268
|
};
|
|
278
269
|
|
|
@@ -519,14 +510,8 @@ export class ReInfoCache {
|
|
|
519
510
|
}
|
|
520
511
|
}
|
|
521
512
|
|
|
522
|
-
export const getReMinLength = (info: ReInfoCache, expr: number) => info.getInfo(expr).lo;
|
|
523
|
-
|
|
524
|
-
export const getReMaxLength = (info: ReInfoCache, expr: number) => info.getInfo(expr).hi;
|
|
525
|
-
|
|
526
513
|
export const isReGround = (info: ReInfoCache, expr: number) => info.getInfo(expr).isInterpreted;
|
|
527
514
|
|
|
528
|
-
export const isLengthEmpty = (info: ReInfo) => info.isKnown && isLenAbsEmpty(info);
|
|
529
|
-
|
|
530
515
|
const getUnsigned = (manager: AstManager, expr: number) => {
|
|
531
516
|
const value = manager.getNumeral(expr);
|
|
532
517
|
return value !== undefined && value >= 0n && value <= BigInt(UINT_MAX)
|
|
@@ -638,7 +623,7 @@ export const getStrMinLength = (manager: AstManager, seq: number): number => {
|
|
|
638
623
|
return result + getLength(current);
|
|
639
624
|
};
|
|
640
625
|
|
|
641
|
-
|
|
626
|
+
const getStrMaxLength = (manager: AstManager, seq: number): number => {
|
|
642
627
|
const getLength = (part: number) => {
|
|
643
628
|
if (isEmptySeq(manager, part)) return 0;
|
|
644
629
|
const op = manager.getOp(part);
|
|
@@ -659,13 +644,12 @@ export const getStrMaxLength = (manager: AstManager, seq: number): number => {
|
|
|
659
644
|
return addTruncate(getLength(current), result);
|
|
660
645
|
};
|
|
661
646
|
|
|
662
|
-
|
|
647
|
+
const getLengthShape = (manager: AstManager, seq: number) => {
|
|
663
648
|
let constant = 0;
|
|
664
649
|
let stride = 0;
|
|
665
650
|
const multiplicities = new Map<number, number>();
|
|
666
651
|
const todo = [seq];
|
|
667
|
-
|
|
668
|
-
const expr = todo.pop()!;
|
|
652
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
669
653
|
if (isBinaryApp(manager, expr, OP_SEQ_CONCAT)) {
|
|
670
654
|
todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
|
|
671
655
|
continue;
|
|
@@ -772,6 +756,3 @@ export const getUnitStringChar = (manager: AstManager, seq: number) => {
|
|
|
772
756
|
if (chars !== undefined) return chars.length === 1 ? manager.mkChar(chars[0]) : -1;
|
|
773
757
|
return manager.getOp(seq) === OP_SEQ_UNIT ? manager.getArg(seq, 0) : -1;
|
|
774
758
|
};
|
|
775
|
-
|
|
776
|
-
export const isReSortOf = (manager: AstManager, expr: number) =>
|
|
777
|
-
manager.isReSort(manager.sorts[expr]);
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_regex_bisim.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { type AstManager, OP_RE_XOR } from "./ast";
|
|
3
2
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
4
3
|
import { RefVector } from "./ref-vector";
|
|
@@ -59,7 +58,7 @@ export class RegexBisim {
|
|
|
59
58
|
return (
|
|
60
59
|
manager.isReSort(manager.sorts[regex]) &&
|
|
61
60
|
this.info.getInfo(regex).isKnown &&
|
|
62
|
-
manager.
|
|
61
|
+
manager.isGroundApp(regex)
|
|
63
62
|
);
|
|
64
63
|
}
|
|
65
64
|
|
|
@@ -118,7 +117,7 @@ export class RegexBisim {
|
|
|
118
117
|
this.worklist.pop();
|
|
119
118
|
const cofactors = new RefVector(manager);
|
|
120
119
|
derive.derivativeCofactors(regex, cofactors);
|
|
121
|
-
const leaves = cofactors.items.filter((
|
|
120
|
+
const leaves = cofactors.items.filter((_value, index) => index % 2 === 1);
|
|
122
121
|
const status = this.areLeavesEquivalent(leaves);
|
|
123
122
|
if (status === L_TRUE)
|
|
124
123
|
for (const leaf of leaves) {
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_regex_live.cpp, src/ast/seq/seq_regex_live.h), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import type { AstManager } from "./ast";
|
|
4
2
|
import { L_FALSE, L_TRUE } from "./lbool";
|
|
5
3
|
import { RefVector } from "./ref-vector";
|
|
@@ -7,8 +5,8 @@ import type { ReRewriter } from "./seq-re-rewriter";
|
|
|
7
5
|
import { isReEmpty } from "./seq-re-util";
|
|
8
6
|
|
|
9
7
|
export const LIVE_FAILURE_NONE = 0;
|
|
10
|
-
|
|
11
|
-
|
|
8
|
+
const LIVE_FAILURE_STATE_CAP = 1;
|
|
9
|
+
const LIVE_FAILURE_RESOURCE = 2;
|
|
12
10
|
|
|
13
11
|
const NULLABLE_UNKNOWN = 2;
|
|
14
12
|
const NULLABLE_UNDEF = 3;
|
|
@@ -76,8 +74,7 @@ export class LiveStates {
|
|
|
76
74
|
|
|
77
75
|
private markLive(search: LiveSearch, start: number) {
|
|
78
76
|
const todo = [start];
|
|
79
|
-
|
|
80
|
-
const id = todo.pop()!;
|
|
77
|
+
for (let id = todo.pop(); id !== undefined; id = todo.pop()) {
|
|
81
78
|
if (!search.seen.has(id) || search.live[id]) continue;
|
|
82
79
|
search.live[id] = true;
|
|
83
80
|
search.liveFrontier.push(id);
|
|
@@ -175,8 +172,9 @@ export class LiveStates {
|
|
|
175
172
|
if (target === -1) this.membershipSearches.set(state, search);
|
|
176
173
|
else {
|
|
177
174
|
search.targetId = this.intern(target);
|
|
178
|
-
|
|
179
|
-
this.reachSearches.
|
|
175
|
+
const searches = this.reachSearches.get(state);
|
|
176
|
+
if (searches === undefined) this.reachSearches.set(state, new Map([[target, search]]));
|
|
177
|
+
else searches.set(target, search);
|
|
180
178
|
}
|
|
181
179
|
this.addState(search, search.rootId);
|
|
182
180
|
return search;
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/seq_rewriter.cpp, src/ast/rewriter/char_rewriter.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt.
|
|
3
1
|
import { mkArrayApp } from "./array-decl-plugin";
|
|
4
2
|
import {
|
|
5
3
|
type AstManager,
|
|
@@ -71,6 +69,7 @@ import {
|
|
|
71
69
|
import { mkBvApp } from "./bv-decl-plugin";
|
|
72
70
|
import { getCompositeHash } from "./hash";
|
|
73
71
|
import { ObjMap } from "./hashtable";
|
|
72
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
74
73
|
import type { Rewrite } from "./rewriter-tpl";
|
|
75
74
|
import {
|
|
76
75
|
getConcat,
|
|
@@ -99,10 +98,6 @@ const SIGN_ZERO = 0;
|
|
|
99
98
|
const SIGN_POS = 1;
|
|
100
99
|
const SIGN_NEG = 2;
|
|
101
100
|
|
|
102
|
-
const L_FALSE = -1;
|
|
103
|
-
const L_UNDEF = 0;
|
|
104
|
-
const L_TRUE = 1;
|
|
105
|
-
|
|
106
101
|
const NON_LIFTING_OPS = new Set([
|
|
107
102
|
OP_SEQ_EMPTY,
|
|
108
103
|
OP_RE_EMPTY_SET,
|
|
@@ -187,7 +182,7 @@ const isDigit = (code: number) => code >= 48 && code <= 57;
|
|
|
187
182
|
const getCount = (bag: Map<number, number>, key: number) => bag.get(key) ?? 0;
|
|
188
183
|
|
|
189
184
|
const isSameBag = (first: Map<number, number>, second: Map<number, number>) =>
|
|
190
|
-
first.size === second.size && [...first].every((
|
|
185
|
+
first.size === second.size && [...first].every((entry) => second.get(entry[0]) === entry[1]);
|
|
191
186
|
|
|
192
187
|
export class SeqRewriter {
|
|
193
188
|
readonly re: ReRewriter;
|
|
@@ -504,8 +499,7 @@ export class SeqRewriter {
|
|
|
504
499
|
return manager.mkString([...firstChars, ...secondChars]);
|
|
505
500
|
const elements: number[] = [];
|
|
506
501
|
const todo = [second, first];
|
|
507
|
-
|
|
508
|
-
const expr = todo.pop()!;
|
|
502
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
509
503
|
if (this.isConcat2(expr)) {
|
|
510
504
|
todo.push(this.getArg(expr, 1), this.getArg(expr, 0));
|
|
511
505
|
continue;
|
|
@@ -515,7 +509,8 @@ export class SeqRewriter {
|
|
|
515
509
|
if (elements.length === 0) return this.mkEmpty(manager.sorts[first]);
|
|
516
510
|
const coalesced: number[] = [];
|
|
517
511
|
for (const element of elements) {
|
|
518
|
-
const previous =
|
|
512
|
+
const previous =
|
|
513
|
+
coalesced.length > 0 ? manager.getString(coalesced[coalesced.length - 1]) : undefined;
|
|
519
514
|
const chars = manager.getString(element);
|
|
520
515
|
if (this.isCoalescingChars && previous !== undefined && chars !== undefined)
|
|
521
516
|
coalesced[coalesced.length - 1] = manager.mkString([...previous, ...chars]);
|
|
@@ -523,7 +518,10 @@ export class SeqRewriter {
|
|
|
523
518
|
}
|
|
524
519
|
return coalesced
|
|
525
520
|
.slice(0, -1)
|
|
526
|
-
.reduceRight(
|
|
521
|
+
.reduceRight(
|
|
522
|
+
(tail, element) => this.mkConcat(element, tail),
|
|
523
|
+
coalesced[coalesced.length - 1],
|
|
524
|
+
);
|
|
527
525
|
}
|
|
528
526
|
|
|
529
527
|
private mkSeqLength(seq: number): Result {
|
|
@@ -770,8 +768,7 @@ export class SeqRewriter {
|
|
|
770
768
|
let isOtherFactorAtLeastOne = true;
|
|
771
769
|
const todo = [offset];
|
|
772
770
|
const visited = new Set<number>();
|
|
773
|
-
|
|
774
|
-
const arg = todo.pop()!;
|
|
771
|
+
for (let arg = todo.pop(); arg !== undefined; arg = todo.pop()) {
|
|
775
772
|
if (visited.has(arg)) continue;
|
|
776
773
|
visited.add(arg);
|
|
777
774
|
if (this.isOp(arg, OP_MUL)) todo.push(...manager.getArgs(arg));
|
|
@@ -961,7 +958,7 @@ export class SeqRewriter {
|
|
|
961
958
|
let start = 0;
|
|
962
959
|
let end = seqUnits.length;
|
|
963
960
|
const first = otherUnits[0];
|
|
964
|
-
const last = otherUnits.
|
|
961
|
+
const last = otherUnits[otherUnits.length - 1];
|
|
965
962
|
while (start < seqUnits.length && this.isNotContainingPrefix(seqUnits[start], first)) start++;
|
|
966
963
|
while (end > start && this.isNotContainingSuffix(seqUnits[end - 1], last)) end--;
|
|
967
964
|
if (start === end) return rewrite(this.mkIsEmpty(other), BR_REWRITE2);
|
|
@@ -1706,7 +1703,7 @@ export class SeqRewriter {
|
|
|
1706
1703
|
const seq = this.getArg(value, 0);
|
|
1707
1704
|
const maxLength = this.getMaxLength(seq);
|
|
1708
1705
|
if (!maxLength.isBounded || maxLength.length > 1n) return undefined;
|
|
1709
|
-
const eqs = Array.from({ length: 10 }, (
|
|
1706
|
+
const eqs = Array.from({ length: 10 }, (_value, digit) =>
|
|
1710
1707
|
this.mkEq(seq, manager.mkString([48 + digit])),
|
|
1711
1708
|
);
|
|
1712
1709
|
const isDigitString = manager.mkApp(OP_OR, eqs, SORT_BOOL);
|
|
@@ -1743,8 +1740,8 @@ export class SeqRewriter {
|
|
|
1743
1740
|
}
|
|
1744
1741
|
const units = getConcatUnits(manager, seq, []);
|
|
1745
1742
|
if (units.length === 0) return this.minusOne();
|
|
1746
|
-
if (this.isUnit(units.
|
|
1747
|
-
const tail = this.mkSeq(OP_STRING_STOI, [units.
|
|
1743
|
+
if (this.isUnit(units[units.length - 1])) {
|
|
1744
|
+
const tail = this.mkSeq(OP_STRING_STOI, [units[units.length - 1]]);
|
|
1748
1745
|
const head = this.mkConcatOf(units.slice(0, -1), manager.sorts[seq]);
|
|
1749
1746
|
const headValue = this.mkSeq(OP_STRING_STOI, [head]);
|
|
1750
1747
|
const isHeadValid = this.mkGe(headValue, this.zero());
|
|
@@ -1794,24 +1791,20 @@ export class SeqRewriter {
|
|
|
1794
1791
|
if (isVisited) cache.set(expr, { isBounded: isValid, length: count });
|
|
1795
1792
|
return isVisited;
|
|
1796
1793
|
} else if (this.isOp(expr, OP_ITE)) {
|
|
1797
|
-
const size = pending.length;
|
|
1798
1794
|
const thenLength = cache.get(this.getArg(expr, 1));
|
|
1799
1795
|
const elseLength = cache.get(this.getArg(expr, 2));
|
|
1800
1796
|
if (thenLength === undefined) pending.push(this.getArg(expr, 1));
|
|
1801
1797
|
if (elseLength === undefined) pending.push(this.getArg(expr, 2));
|
|
1802
|
-
if (
|
|
1798
|
+
if (thenLength === undefined || elseLength === undefined) return false;
|
|
1803
1799
|
cache.set(expr, {
|
|
1804
1800
|
isBounded:
|
|
1805
|
-
thenLength
|
|
1806
|
-
|
|
1807
|
-
thenLength!.length === elseLength!.length,
|
|
1808
|
-
length: Math.min(thenLength!.length, elseLength!.length),
|
|
1801
|
+
thenLength.isBounded && elseLength.isBounded && thenLength.length === elseLength.length,
|
|
1802
|
+
length: Math.min(thenLength.length, elseLength.length),
|
|
1809
1803
|
});
|
|
1810
1804
|
} else cache.set(expr, { isBounded: false, length: 0 });
|
|
1811
1805
|
return true;
|
|
1812
1806
|
};
|
|
1813
|
-
|
|
1814
|
-
const expr = todo.pop()!;
|
|
1807
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1815
1808
|
const chars = manager.getString(expr);
|
|
1816
1809
|
if (this.isUnit(expr)) length++;
|
|
1817
1810
|
else if (this.isEmpty(expr)) continue;
|
|
@@ -1821,7 +1814,7 @@ export class SeqRewriter {
|
|
|
1821
1814
|
const thenExpr = this.getArg(expr, 1);
|
|
1822
1815
|
const elseExpr = this.getArg(expr, 2);
|
|
1823
1816
|
pending.push(thenExpr, elseExpr);
|
|
1824
|
-
while (pending.length > 0) if (visit(pending.
|
|
1817
|
+
while (pending.length > 0) if (visit(pending[pending.length - 1])) pending.pop();
|
|
1825
1818
|
const thenLength = cache.get(thenExpr) ?? { isBounded: false, length: 0 };
|
|
1826
1819
|
const elseLength = cache.get(elseExpr) ?? { isBounded: false, length: 0 };
|
|
1827
1820
|
if (
|
|
@@ -1840,8 +1833,7 @@ export class SeqRewriter {
|
|
|
1840
1833
|
const manager = this.manager;
|
|
1841
1834
|
const todo = [seq];
|
|
1842
1835
|
let length = 0n;
|
|
1843
|
-
|
|
1844
|
-
const expr = todo.pop()!;
|
|
1836
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1845
1837
|
const chars = manager.getString(expr);
|
|
1846
1838
|
if (this.isUnit(expr) || this.isApp(expr, OP_SEQ_AT, 2)) length += 1n;
|
|
1847
1839
|
else if (chars !== undefined) length += BigInt(chars.length);
|
|
@@ -2041,8 +2033,7 @@ export class SeqRewriter {
|
|
|
2041
2033
|
const manager = this.manager;
|
|
2042
2034
|
const elements: number[] = [];
|
|
2043
2035
|
const todo = [seq];
|
|
2044
|
-
|
|
2045
|
-
const expr = todo.pop()!;
|
|
2036
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
2046
2037
|
if (this.isOp(expr, OP_SEQ_CONCAT)) {
|
|
2047
2038
|
todo.push(...manager.getArgs(expr));
|
|
2048
2039
|
continue;
|
|
@@ -2118,10 +2109,13 @@ export class SeqRewriter {
|
|
|
2118
2109
|
private reduceBack(pair: SeqPair, eqs: EqPair[]) {
|
|
2119
2110
|
const manager = this.manager;
|
|
2120
2111
|
while (pair.left.length > 0 && pair.right.length > 0) {
|
|
2121
|
-
if (
|
|
2112
|
+
if (
|
|
2113
|
+
this.isUnit(pair.right[pair.right.length - 1]) &&
|
|
2114
|
+
manager.getString(pair.left[pair.left.length - 1]) !== undefined
|
|
2115
|
+
)
|
|
2122
2116
|
this.swap(pair);
|
|
2123
|
-
const left = pair.left.
|
|
2124
|
-
const right = pair.right.
|
|
2117
|
+
const left = pair.left[pair.left.length - 1];
|
|
2118
|
+
const right = pair.right[pair.right.length - 1];
|
|
2125
2119
|
const rightChars = manager.getString(right);
|
|
2126
2120
|
const leftChars = manager.getString(left);
|
|
2127
2121
|
if (left === right) {
|
|
@@ -2133,7 +2127,10 @@ export class SeqRewriter {
|
|
|
2133
2127
|
pair.left.pop();
|
|
2134
2128
|
pair.right.pop();
|
|
2135
2129
|
} else if (this.isUnit(left) && rightChars !== undefined) {
|
|
2136
|
-
eqs.push({
|
|
2130
|
+
eqs.push({
|
|
2131
|
+
left: manager.mkChar(rightChars[rightChars.length - 1]),
|
|
2132
|
+
right: this.getArg(left, 0),
|
|
2133
|
+
});
|
|
2137
2134
|
pair.left.pop();
|
|
2138
2135
|
if (rightChars.length === 1) pair.right.pop();
|
|
2139
2136
|
else pair.right[pair.right.length - 1] = manager.mkString(rightChars.slice(0, -1));
|
|
@@ -2234,7 +2231,7 @@ export class SeqRewriter {
|
|
|
2234
2231
|
for (const expr of right) {
|
|
2235
2232
|
const index = remaining.indexOf(expr);
|
|
2236
2233
|
if (index !== -1) {
|
|
2237
|
-
remaining[index] = remaining.
|
|
2234
|
+
remaining[index] = remaining[remaining.length - 1];
|
|
2238
2235
|
remaining.pop();
|
|
2239
2236
|
continue;
|
|
2240
2237
|
}
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_skolem.cpp, src/ast/seq/seq_skolem.h), MIT license, see z3-license.txt.
|
|
2
1
|
import {
|
|
3
2
|
type AstManager,
|
|
4
3
|
OP_SEQ_CONCAT,
|
|
@@ -49,10 +48,6 @@ export class SeqSkolem {
|
|
|
49
48
|
return this.manager.mkNumeral(BigInt(value));
|
|
50
49
|
}
|
|
51
50
|
|
|
52
|
-
mkAlign(args: number[]) {
|
|
53
|
-
return this.mk("seq.align", args);
|
|
54
|
-
}
|
|
55
|
-
|
|
56
51
|
mkAlignL(args: number[]) {
|
|
57
52
|
return this.mk("seq.align.l", args);
|
|
58
53
|
}
|
|
@@ -202,12 +197,6 @@ export class SeqSkolem {
|
|
|
202
197
|
return this.isNamed(expr, TAIL);
|
|
203
198
|
}
|
|
204
199
|
|
|
205
|
-
getTailIndex(expr: number) {
|
|
206
|
-
if (!this.isTail(expr)) return undefined;
|
|
207
|
-
const index = this.manager.getNumeral(this.manager.getArg(expr, 1));
|
|
208
|
-
return index !== undefined && index >= 0n && index <= 0xffffffffn ? Number(index) : undefined;
|
|
209
|
-
}
|
|
210
|
-
|
|
211
200
|
isSeqFirst(expr: number) {
|
|
212
201
|
return this.isNamed(expr, SEQ_FIRST);
|
|
213
202
|
}
|
|
@@ -232,10 +221,6 @@ export class SeqSkolem {
|
|
|
232
221
|
return this.isNamed(expr, EQ) && this.manager.getNumArgs(expr) === 2;
|
|
233
222
|
}
|
|
234
223
|
|
|
235
|
-
isDigit(expr: number) {
|
|
236
|
-
return this.isNamed(expr, "seq.is_digit");
|
|
237
|
-
}
|
|
238
|
-
|
|
239
224
|
isMaxUnfolding(expr: number) {
|
|
240
225
|
return this.isNamed(expr, MAX_UNFOLDING);
|
|
241
226
|
}
|
|
@@ -258,15 +243,6 @@ export class SeqSkolem {
|
|
|
258
243
|
return this.isNamed(expr, "seq.align.r");
|
|
259
244
|
}
|
|
260
245
|
|
|
261
|
-
isRegexSkolem(expr: number) {
|
|
262
|
-
return (
|
|
263
|
-
this.isNamed(expr, ACCEPT) ||
|
|
264
|
-
this.isNamed(expr, "re.is_empty") ||
|
|
265
|
-
this.isNamed(expr, "re.is_non_empty") ||
|
|
266
|
-
this.isNamed(expr, "aut.step")
|
|
267
|
-
);
|
|
268
|
-
}
|
|
269
|
-
|
|
270
246
|
decompose(input: number): Decomposition {
|
|
271
247
|
const manager = this.manager;
|
|
272
248
|
const mkNthUnit = (seq: number, index: number | bigint) =>
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/seq/seq_view_witness.cpp, src/ast/seq/seq_view_witness.h,
|
|
2
|
-
// src/ast/seq/seq_view.h), MIT license, see z3-license.txt.
|
|
3
1
|
import { type AstManager, OP_SEQ_UNIT } from "./ast";
|
|
4
2
|
import { GuardSet, GuardSetCache } from "./guard-set";
|
|
5
3
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
@@ -10,12 +8,12 @@ import type { ReRewriter } from "./seq-re-rewriter";
|
|
|
10
8
|
import { isReEmpty } from "./seq-re-util";
|
|
11
9
|
|
|
12
10
|
export const VIEW_FAILURE_NONE = 0;
|
|
13
|
-
|
|
11
|
+
const VIEW_FAILURE_UNSUPPORTED = 1;
|
|
14
12
|
export const VIEW_FAILURE_BUDGET = 2;
|
|
15
13
|
export const VIEW_FAILURE_RESOURCE = 3;
|
|
16
14
|
export const VIEW_FAILURE_STATE_EXPANSION = 4;
|
|
17
|
-
|
|
18
|
-
|
|
15
|
+
const VIEW_FAILURE_NULLABILITY = 5;
|
|
16
|
+
const VIEW_FAILURE_GUARD = 6;
|
|
19
17
|
|
|
20
18
|
const INNER_LIMIT = 1 << 16;
|
|
21
19
|
const RANGE_CACHE_CAP = 1 << 16;
|
|
@@ -26,7 +24,7 @@ interface IntervalList {
|
|
|
26
24
|
isOk: boolean;
|
|
27
25
|
}
|
|
28
26
|
|
|
29
|
-
|
|
27
|
+
interface ProductResult {
|
|
30
28
|
status: number;
|
|
31
29
|
word: number;
|
|
32
30
|
}
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_consequences.cpp, src/smt/smt_solver.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import { SmtUnsupportedError } from "../../../errors";
|
|
4
2
|
import { KIND_APP, OP_DT_IS, OP_DT_RECOGNISER, OP_EQ, OP_IMPLIES, OP_NOT, SORT_BOOL } from "./ast";
|
|
5
3
|
import { BinJustification, CLS_AUX } from "./clause";
|