tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/bags.ts +47 -28
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +476 -590
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +60 -708
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +25 -18
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +14 -7
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +42 -44
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +597 -240
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +652 -220
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +536 -117
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -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 +1407 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1704 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1995 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +127 -108
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +382 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1092 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +243 -52
- package/src/simulate.ts +160 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/subexpressions.ts +3 -1
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +16 -12
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +26 -47
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +63 -158
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,1010 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
OP_ADD,
|
|
7
|
+
OP_CHAR_IS_DIGIT,
|
|
8
|
+
OP_CHAR_LE,
|
|
9
|
+
OP_CHAR_TO_INT,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_GE,
|
|
12
|
+
OP_LE,
|
|
13
|
+
OP_MUL,
|
|
14
|
+
OP_NOT,
|
|
15
|
+
OP_SEQ_AT,
|
|
16
|
+
OP_SEQ_CONCAT,
|
|
17
|
+
OP_SEQ_CONTAINS,
|
|
18
|
+
OP_SEQ_EMPTY,
|
|
19
|
+
OP_SEQ_EXTRACT,
|
|
20
|
+
OP_SEQ_INDEX,
|
|
21
|
+
OP_SEQ_LENGTH,
|
|
22
|
+
OP_SEQ_NTH_I,
|
|
23
|
+
OP_SEQ_POWER,
|
|
24
|
+
OP_SEQ_PREFIX,
|
|
25
|
+
OP_SEQ_UNIT,
|
|
26
|
+
OP_STRING_FROM_CODE,
|
|
27
|
+
OP_STRING_ITOS,
|
|
28
|
+
OP_STRING_LT,
|
|
29
|
+
OP_STRING_STOI,
|
|
30
|
+
OP_STRING_TO_CODE,
|
|
31
|
+
OP_SUB,
|
|
32
|
+
SORT_BOOL,
|
|
33
|
+
SORT_INT,
|
|
34
|
+
} from "./ast";
|
|
35
|
+
import { FALSE_LITERAL, type Literal, TRUE_LITERAL, negate } from "./literal";
|
|
36
|
+
import { isBinaryApp, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
|
|
37
|
+
import { SeqSkolem } from "./seq-skolem";
|
|
38
|
+
|
|
39
|
+
export interface SeqAxiomsHost {
|
|
40
|
+
rewrite(expr: number): number;
|
|
41
|
+
mkEqLiteral(first: number, second: number): Literal;
|
|
42
|
+
ensureEnode(expr: number): void;
|
|
43
|
+
getLiteral(expr: number): Literal;
|
|
44
|
+
forcePhase(literal: Literal): void;
|
|
45
|
+
addAxiom(literals: Literal[]): void;
|
|
46
|
+
pushTrail(undo: () => void): void;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
export const getMinLengthOf = (manager: AstManager, seq: number): number => {
|
|
50
|
+
const getLength = (expr: number) =>
|
|
51
|
+
manager.getOp(expr) === OP_SEQ_UNIT ? 1 : (manager.getString(expr)?.length ?? 0);
|
|
52
|
+
let result = 0;
|
|
53
|
+
let current = seq;
|
|
54
|
+
while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
|
|
55
|
+
const first = manager.getArg(current, 0);
|
|
56
|
+
result +=
|
|
57
|
+
manager.getOp(first) === OP_SEQ_CONCAT ? getMinLengthOf(manager, first) : getLength(first);
|
|
58
|
+
current = manager.getArg(current, 1);
|
|
59
|
+
}
|
|
60
|
+
return result + getLength(current);
|
|
61
|
+
};
|
|
62
|
+
|
|
63
|
+
const UINT_MAX = 0xffffffff;
|
|
64
|
+
|
|
65
|
+
export const getMaxLengthOf = (manager: AstManager, seq: number): number => {
|
|
66
|
+
const getLength = (expr: number) => {
|
|
67
|
+
if (isEmptySeq(manager, expr)) return 0;
|
|
68
|
+
const op = manager.getOp(expr);
|
|
69
|
+
if (op === OP_SEQ_UNIT || op === OP_SEQ_AT) return 1;
|
|
70
|
+
if (op === OP_SEQ_EXTRACT) {
|
|
71
|
+
const length = manager.getNumeral(manager.getArg(expr, 2));
|
|
72
|
+
return length !== undefined && length >= 0n && length <= BigInt(UINT_MAX)
|
|
73
|
+
? Number(length)
|
|
74
|
+
: UINT_MAX;
|
|
75
|
+
}
|
|
76
|
+
return manager.getString(expr)?.length ?? UINT_MAX;
|
|
77
|
+
};
|
|
78
|
+
const add = (first: number, second: number) => Math.min(UINT_MAX, first + second);
|
|
79
|
+
let result = 0;
|
|
80
|
+
let current = seq;
|
|
81
|
+
while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
|
|
82
|
+
const first = manager.getArg(current, 0);
|
|
83
|
+
result = add(
|
|
84
|
+
manager.getOp(first) === OP_SEQ_CONCAT ? getMaxLengthOf(manager, first) : getLength(first),
|
|
85
|
+
result,
|
|
86
|
+
);
|
|
87
|
+
current = manager.getArg(current, 1);
|
|
88
|
+
}
|
|
89
|
+
return add(getLength(current), result);
|
|
90
|
+
};
|
|
91
|
+
|
|
92
|
+
export class SeqAxioms {
|
|
93
|
+
readonly skolem: SeqSkolem;
|
|
94
|
+
private purified = new Map<number, number>();
|
|
95
|
+
private purifyTrail: number[] = [];
|
|
96
|
+
private isDigitsInitialized = false;
|
|
97
|
+
|
|
98
|
+
constructor(
|
|
99
|
+
private manager: AstManager,
|
|
100
|
+
private host: SeqAxiomsHost,
|
|
101
|
+
) {
|
|
102
|
+
this.skolem = new SeqSkolem(manager, (expr) => host.rewrite(expr));
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
private mkInt(value: number | bigint) {
|
|
106
|
+
return this.manager.mkNumeral(BigInt(value));
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
private mkArith(op: number, args: number[]) {
|
|
110
|
+
return this.manager.mkApp(op, args, op === OP_GE || op === OP_LE ? SORT_BOOL : SORT_INT);
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
private mkSeq(op: number, args: number[]) {
|
|
114
|
+
return mkSeqApp(this.manager, op, args);
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
private mkEq(first: number, second: number) {
|
|
118
|
+
return this.manager.mkApp(OP_EQ, [first, second], SORT_BOOL);
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
rewrite(expr: number) {
|
|
122
|
+
return this.host.rewrite(expr);
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
mkNot(expr: number) {
|
|
126
|
+
const manager = this.manager;
|
|
127
|
+
return manager.isNot(expr) ? manager.getArg(expr, 0) : manager.mkApp(OP_NOT, [expr], SORT_BOOL);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
private mkConcat(...args: number[]) {
|
|
131
|
+
return mkConcatOf(this.manager, args, this.manager.sorts[args[0]]);
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
private mkNth(seq: number, index: number) {
|
|
135
|
+
return this.mkSeq(OP_SEQ_NTH_I, [seq, this.mkInt(index)]);
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
private mkUnit(expr: number) {
|
|
139
|
+
return this.mkSeq(OP_SEQ_UNIT, [expr]);
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
private mkEmpty(sort: number) {
|
|
143
|
+
return mkEmptySeq(this.manager, sort);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
mkSub(first: number, second: number) {
|
|
147
|
+
return this.host.rewrite(this.mkArith(OP_SUB, [first, second]));
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
private mkGeE(first: number, second: number) {
|
|
151
|
+
return this.host.rewrite(this.mkArith(OP_GE, [first, second]));
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
private mkLeE(first: number, second: number) {
|
|
155
|
+
return this.host.rewrite(this.mkArith(OP_LE, [first, second]));
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
mkGe(expr: number, bound: number | bigint) {
|
|
159
|
+
return this.mkGeE(expr, this.mkInt(bound));
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
mkLe(expr: number, bound: number | bigint) {
|
|
163
|
+
return this.mkLeE(expr, this.mkInt(bound));
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
private mkSeqEq(first: number, second: number) {
|
|
167
|
+
const result = this.skolem.mkEq(first, second);
|
|
168
|
+
this.host.forcePhase(this.mkLiteral(result));
|
|
169
|
+
return result;
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private mkEqEmpty(expr: number) {
|
|
173
|
+
return this.mkSeqEq(this.mkEmpty(this.manager.sorts[expr]), expr);
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
private mkLenAxiom(seq: number) {
|
|
177
|
+
const length = this.mkSeq(OP_SEQ_LENGTH, [seq]);
|
|
178
|
+
const result = this.host.rewrite(length);
|
|
179
|
+
if (result !== length) this.addClause([this.mkEq(length, result)]);
|
|
180
|
+
return result;
|
|
181
|
+
}
|
|
182
|
+
|
|
183
|
+
mkLen(seq: number) {
|
|
184
|
+
return this.host.rewrite(this.mkSeq(OP_SEQ_LENGTH, [seq]));
|
|
185
|
+
}
|
|
186
|
+
|
|
187
|
+
private purify(expr: number | undefined) {
|
|
188
|
+
const manager = this.manager;
|
|
189
|
+
if (expr === undefined) return undefined;
|
|
190
|
+
if (manager.depths[expr] === 1 || manager.isValue(expr)) return expr;
|
|
191
|
+
if (this.host.rewrite(expr) === expr) return expr;
|
|
192
|
+
let result = this.purified.get(expr);
|
|
193
|
+
if (result === undefined) {
|
|
194
|
+
if (this.purifyTrail.length === 4000) {
|
|
195
|
+
const kept = this.purifyTrail.slice(2000);
|
|
196
|
+
for (const dropped of this.purifyTrail.slice(0, 2000)) manager.decRef(dropped);
|
|
197
|
+
this.purified.clear();
|
|
198
|
+
for (let index = 0; index < 2000; index += 2)
|
|
199
|
+
this.purified.set(kept[index], kept[index + 1]);
|
|
200
|
+
this.purifyTrail = kept;
|
|
201
|
+
}
|
|
202
|
+
result = manager.mkFreshConst("seq.purify", manager.sorts[expr]);
|
|
203
|
+
manager.incRef(expr);
|
|
204
|
+
manager.incRef(result);
|
|
205
|
+
this.purified.set(expr, result);
|
|
206
|
+
this.purifyTrail.push(expr, result);
|
|
207
|
+
}
|
|
208
|
+
this.addClause([this.mkEq(result, expr)]);
|
|
209
|
+
return result;
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
mkLiteral(input: number): Literal {
|
|
213
|
+
const manager = this.manager;
|
|
214
|
+
if (manager.isNot(input)) return negate(this.mkLiteral(manager.getArg(input, 0)));
|
|
215
|
+
if (manager.getOp(input) === OP_EQ)
|
|
216
|
+
return this.host.mkEqLiteral(manager.getArg(input, 0), manager.getArg(input, 1));
|
|
217
|
+
const expr =
|
|
218
|
+
manager.kinds[input] === KIND_APP && manager.getFamily(input) === FAMILY_ARITH
|
|
219
|
+
? this.host.rewrite(input)
|
|
220
|
+
: input;
|
|
221
|
+
this.host.ensureEnode(expr);
|
|
222
|
+
return this.host.getLiteral(expr);
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
private addClause(clause: number[]) {
|
|
226
|
+
const literals: Literal[] = [];
|
|
227
|
+
for (const expr of clause) {
|
|
228
|
+
const literal = this.mkLiteral(expr);
|
|
229
|
+
if (literal === TRUE_LITERAL) return;
|
|
230
|
+
if (literal !== FALSE_LITERAL) literals.push(this.mkLiteral(expr));
|
|
231
|
+
}
|
|
232
|
+
this.host.addAxiom(literals);
|
|
233
|
+
}
|
|
234
|
+
|
|
235
|
+
isDigit(char: number) {
|
|
236
|
+
return this.mkSeq(OP_CHAR_IS_DIGIT, [char]);
|
|
237
|
+
}
|
|
238
|
+
|
|
239
|
+
private mkDigit2int(char: number) {
|
|
240
|
+
this.ensureDigitAxiom();
|
|
241
|
+
return this.skolem.mkDigit2int(char);
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
private ensureDigitAxiom() {
|
|
245
|
+
if (this.isDigitsInitialized) return;
|
|
246
|
+
for (let digit = 0; digit < 10; digit++) {
|
|
247
|
+
const value = this.skolem.mkDigit2int(this.manager.mkChar(48 + digit));
|
|
248
|
+
this.host.addAxiom([this.host.mkEqLiteral(value, this.mkInt(digit))]);
|
|
249
|
+
}
|
|
250
|
+
this.host.pushTrail(() => {
|
|
251
|
+
this.isDigitsInitialized = false;
|
|
252
|
+
});
|
|
253
|
+
this.isDigitsInitialized = true;
|
|
254
|
+
}
|
|
255
|
+
|
|
256
|
+
extractAxiom(expr: number) {
|
|
257
|
+
const manager = this.manager;
|
|
258
|
+
const [seqArg, indexArg, lengthArg] = manager.getArgs(expr);
|
|
259
|
+
const seq = this.purify(seqArg)!;
|
|
260
|
+
const index = this.purify(indexArg)!;
|
|
261
|
+
const length = this.purify(lengthArg)!;
|
|
262
|
+
if (this.smallSegmentAxiom(expr, seqArg, indexArg, lengthArg)) return;
|
|
263
|
+
if (this.isTail(seq, indexArg, lengthArg)) {
|
|
264
|
+
this.tailAxiom(expr, seq);
|
|
265
|
+
return;
|
|
266
|
+
}
|
|
267
|
+
if (this.isDropLast(seq, indexArg, lengthArg)) {
|
|
268
|
+
this.dropLastAxiom(expr, seq);
|
|
269
|
+
return;
|
|
270
|
+
}
|
|
271
|
+
if (manager.getNumeral(indexArg) === 0n) {
|
|
272
|
+
this.extractPrefixAxiom(expr, seq, length);
|
|
273
|
+
return;
|
|
274
|
+
}
|
|
275
|
+
if (this.isExtractSuffix(seq, indexArg, lengthArg)) {
|
|
276
|
+
this.extractSuffixAxiom(expr, seq, index);
|
|
277
|
+
return;
|
|
278
|
+
}
|
|
279
|
+
const skolem = this.skolem;
|
|
280
|
+
const prefix = skolem.mkPre(seq, index);
|
|
281
|
+
const seqLength = this.mkLenAxiom(seqArg);
|
|
282
|
+
const prefixLength = this.mkLenAxiom(prefix);
|
|
283
|
+
const exprLength = this.mkLenAxiom(expr);
|
|
284
|
+
const remaining = this.mkSub(this.mkSub(seqLength, indexArg), lengthArg);
|
|
285
|
+
const suffix = skolem.mkPost(seq, this.mkArith(OP_ADD, [index, length]));
|
|
286
|
+
this.mkConcat(prefix, expr);
|
|
287
|
+
const whole = this.mkConcat(prefix, expr, suffix);
|
|
288
|
+
const zero = this.mkInt(0);
|
|
289
|
+
const isIndexNonNegative = this.mkGe(indexArg, 0);
|
|
290
|
+
const isIndexAtMostLength = this.mkLe(this.mkSub(indexArg, seqLength), 0);
|
|
291
|
+
const isLengthAtMostIndex = this.mkLe(this.mkSub(seqLength, indexArg), 0);
|
|
292
|
+
const isRemainingNonNegative = this.mkGe(remaining, 0);
|
|
293
|
+
const isLengthNonNegative = this.mkGe(length, 0);
|
|
294
|
+
const isLengthNonPositive = this.mkLe(length, 0);
|
|
295
|
+
const isSeqLengthNonPositive = this.mkLe(seqLength, 0);
|
|
296
|
+
const isExprEmpty = this.mkEq(exprLength, zero);
|
|
297
|
+
const isIndexNegative = this.mkNot(isIndexNonNegative);
|
|
298
|
+
const isIndexAboveLength = this.mkNot(isIndexAtMostLength);
|
|
299
|
+
const isLengthNegative = this.mkNot(isLengthNonNegative);
|
|
300
|
+
this.addClause([
|
|
301
|
+
isIndexNegative,
|
|
302
|
+
isIndexAboveLength,
|
|
303
|
+
isLengthNegative,
|
|
304
|
+
this.mkSeqEq(whole, seq),
|
|
305
|
+
]);
|
|
306
|
+
this.addClause([isIndexNegative, isIndexAboveLength, this.mkEq(prefixLength, index)]);
|
|
307
|
+
const isRemainingNegative = this.mkNot(isRemainingNonNegative);
|
|
308
|
+
this.addClause([
|
|
309
|
+
isIndexNegative,
|
|
310
|
+
isIndexAboveLength,
|
|
311
|
+
isLengthNegative,
|
|
312
|
+
isRemainingNegative,
|
|
313
|
+
this.mkEq(exprLength, length),
|
|
314
|
+
]);
|
|
315
|
+
this.addClause([
|
|
316
|
+
isIndexNegative,
|
|
317
|
+
isIndexAboveLength,
|
|
318
|
+
isLengthNegative,
|
|
319
|
+
isRemainingNonNegative,
|
|
320
|
+
this.mkEq(exprLength, this.mkSub(seqLength, index)),
|
|
321
|
+
]);
|
|
322
|
+
this.addClause([isIndexNonNegative, isExprEmpty]);
|
|
323
|
+
this.addClause([this.mkNot(isLengthAtMostIndex), isExprEmpty]);
|
|
324
|
+
this.addClause([this.mkNot(isSeqLengthNonPositive), isExprEmpty]);
|
|
325
|
+
this.addClause([this.mkNot(isLengthNonPositive), isExprEmpty]);
|
|
326
|
+
this.addClause([
|
|
327
|
+
this.mkNot(isExprEmpty),
|
|
328
|
+
isIndexNegative,
|
|
329
|
+
isLengthAtMostIndex,
|
|
330
|
+
isSeqLengthNonPositive,
|
|
331
|
+
isLengthNonPositive,
|
|
332
|
+
]);
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
private tailAxiom(expr: number, seq: number) {
|
|
336
|
+
const parts = this.skolem.decompose(seq);
|
|
337
|
+
const isEmpty = this.mkEqEmpty(seq);
|
|
338
|
+
this.addClause([isEmpty, this.mkSeqEq(seq, this.mkConcat(parts.head, expr))]);
|
|
339
|
+
this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(expr)]);
|
|
340
|
+
}
|
|
341
|
+
|
|
342
|
+
private dropLastAxiom(expr: number, seq: number) {
|
|
343
|
+
const isEmpty = this.mkEqEmpty(seq);
|
|
344
|
+
this.addClause([
|
|
345
|
+
isEmpty,
|
|
346
|
+
this.mkSeqEq(seq, this.mkConcat(expr, this.mkUnit(this.skolem.mkLast(seq)))),
|
|
347
|
+
]);
|
|
348
|
+
this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(expr)]);
|
|
349
|
+
}
|
|
350
|
+
|
|
351
|
+
private isDropLast(seq: number, index: number, length: number) {
|
|
352
|
+
if (this.manager.getNumeral(index) !== 0n) return false;
|
|
353
|
+
const seqLength = this.mkLenAxiom(seq);
|
|
354
|
+
const expected = this.mkSub(seqLength, this.mkInt(1));
|
|
355
|
+
return this.host.rewrite(length) === this.host.rewrite(expected);
|
|
356
|
+
}
|
|
357
|
+
|
|
358
|
+
private smallSegmentAxiom(expr: number, seq: number, index: number, length: number) {
|
|
359
|
+
const start = this.manager.getNumeral(index);
|
|
360
|
+
const count = this.manager.getNumeral(length);
|
|
361
|
+
if (start === undefined || start < 0n || count === undefined || count > 5n) return false;
|
|
362
|
+
const elements: number[] = [];
|
|
363
|
+
for (let offset = 0n; offset < count; offset++)
|
|
364
|
+
elements.push(
|
|
365
|
+
this.mkSeq(OP_SEQ_AT, [seq, this.mkArith(OP_ADD, [index, this.mkInt(offset)])]),
|
|
366
|
+
);
|
|
367
|
+
const result = mkConcatOf(this.manager, elements, this.manager.sorts[seq]);
|
|
368
|
+
this.addClause([this.mkSeqEq(result, expr)]);
|
|
369
|
+
return true;
|
|
370
|
+
}
|
|
371
|
+
|
|
372
|
+
private isTail(seq: number, index: number, length: number) {
|
|
373
|
+
if (this.manager.getNumeral(index) !== 1n) return false;
|
|
374
|
+
const seqLength = this.mkLenAxiom(seq);
|
|
375
|
+
const expected = this.mkSub(seqLength, this.mkInt(1));
|
|
376
|
+
return this.host.rewrite(length) === this.host.rewrite(expected);
|
|
377
|
+
}
|
|
378
|
+
|
|
379
|
+
private isExtractSuffix(seq: number, index: number, length: number) {
|
|
380
|
+
const sum = this.host.rewrite(this.mkArith(OP_ADD, [length, index]));
|
|
381
|
+
return this.manager.getOp(sum) === OP_SEQ_LENGTH && this.manager.getArg(sum, 0) === seq;
|
|
382
|
+
}
|
|
383
|
+
|
|
384
|
+
private extractPrefixAxiom(expr: number, seq: number, length: number) {
|
|
385
|
+
const exprLength = this.mkLenAxiom(expr);
|
|
386
|
+
const seqLength = this.mkLenAxiom(seq);
|
|
387
|
+
this.mkSub(seqLength, length);
|
|
388
|
+
const suffix = this.skolem.mkPost(seq, length);
|
|
389
|
+
const whole = this.mkConcat(expr, suffix);
|
|
390
|
+
const isWithin = this.mkLe(this.mkSub(length, seqLength), 0);
|
|
391
|
+
this.addClause([this.mkSeqEq(seq, whole)]);
|
|
392
|
+
const isPositive = this.mkNot(this.mkLe(length, 0));
|
|
393
|
+
this.addClause([isPositive, this.mkEqEmpty(expr)]);
|
|
394
|
+
const isNegative = this.mkNot(this.mkGe(length, 0));
|
|
395
|
+
const isAbove = this.mkNot(isWithin);
|
|
396
|
+
this.addClause([isNegative, isAbove, this.mkEq(exprLength, length)]);
|
|
397
|
+
this.addClause([isWithin, this.mkEq(expr, seq)]);
|
|
398
|
+
}
|
|
399
|
+
|
|
400
|
+
private extractSuffixAxiom(expr: number, seq: number, index: number) {
|
|
401
|
+
const prefix = this.skolem.mkPre(seq, index);
|
|
402
|
+
const prefixLength = this.mkLenAxiom(prefix);
|
|
403
|
+
const seqLength = this.mkLenAxiom(seq);
|
|
404
|
+
const whole = this.mkConcat(prefix, expr);
|
|
405
|
+
const isEmpty = this.mkEqEmpty(expr);
|
|
406
|
+
const isIndexNonNegative = this.mkGe(index, 0);
|
|
407
|
+
const isIndexWithin = this.mkLe(this.mkSub(index, seqLength), 0);
|
|
408
|
+
this.addClause([this.mkEq(seq, whole)]);
|
|
409
|
+
this.addClause([
|
|
410
|
+
this.mkNot(isIndexNonNegative),
|
|
411
|
+
this.mkNot(isIndexWithin),
|
|
412
|
+
this.mkEq(index, prefixLength),
|
|
413
|
+
]);
|
|
414
|
+
this.addClause([isIndexNonNegative, isEmpty]);
|
|
415
|
+
this.addClause([isIndexWithin, isEmpty]);
|
|
416
|
+
}
|
|
417
|
+
|
|
418
|
+
private tightestPrefix(pattern: number, prefix: number) {
|
|
419
|
+
const isEmpty = this.mkEqEmpty(pattern);
|
|
420
|
+
if (getMaxLengthOf(this.manager, pattern) <= 1) {
|
|
421
|
+
this.addClause([isEmpty, this.mkNot(this.mkSeq(OP_SEQ_CONTAINS, [prefix, pattern]))]);
|
|
422
|
+
return;
|
|
423
|
+
}
|
|
424
|
+
const first = this.skolem.mkFirst(pattern);
|
|
425
|
+
const last = this.skolem.mkLast(pattern);
|
|
426
|
+
const whole = this.mkConcat(first, this.mkUnit(last));
|
|
427
|
+
this.addClause([isEmpty, this.mkSeqEq(pattern, whole)]);
|
|
428
|
+
this.addClause([
|
|
429
|
+
isEmpty,
|
|
430
|
+
this.mkNot(this.mkSeq(OP_SEQ_CONTAINS, [this.mkConcat(prefix, first), pattern])),
|
|
431
|
+
]);
|
|
432
|
+
}
|
|
433
|
+
|
|
434
|
+
indexofAxiom(index: number) {
|
|
435
|
+
const manager = this.manager;
|
|
436
|
+
const args = manager.getArgs(index);
|
|
437
|
+
const minusOne = this.mkInt(-1);
|
|
438
|
+
const zero = this.mkInt(0);
|
|
439
|
+
const offset = this.purify(args[2]);
|
|
440
|
+
const pattern = this.purify(args[1])!;
|
|
441
|
+
const text = this.purify(args[0])!;
|
|
442
|
+
const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
|
|
443
|
+
const isMinusOne = this.mkEq(index, minusOne);
|
|
444
|
+
const isZero = this.mkEq(index, zero);
|
|
445
|
+
const isPatternEmpty = this.mkEq(pattern, this.mkEmpty(manager.sorts[pattern]));
|
|
446
|
+
const isTextEmpty = this.mkEqEmpty(text);
|
|
447
|
+
this.addClause([this.mkGe(index, -1)]);
|
|
448
|
+
this.addClause([contains, isMinusOne]);
|
|
449
|
+
this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, isMinusOne]);
|
|
450
|
+
const skolem = this.skolem;
|
|
451
|
+
if (offset === undefined || manager.getNumeral(offset) === 0n) {
|
|
452
|
+
this.addClause([this.mkNot(isPatternEmpty), isZero]);
|
|
453
|
+
const left = skolem.mkIndexofLeft(text, pattern);
|
|
454
|
+
const right = skolem.mkIndexofRight(text, pattern);
|
|
455
|
+
const whole = this.mkConcat(left, pattern, right);
|
|
456
|
+
const leftLength = this.mkLenAxiom(left);
|
|
457
|
+
this.addClause([this.mkNot(contains), isPatternEmpty, this.mkSeqEq(text, whole)]);
|
|
458
|
+
const notContains = this.mkNot(contains);
|
|
459
|
+
this.addClause([notContains, isPatternEmpty, this.mkEq(index, leftLength)]);
|
|
460
|
+
const notContainsAgain = this.mkNot(contains);
|
|
461
|
+
this.addClause([notContainsAgain, this.mkGe(index, 0)]);
|
|
462
|
+
this.tightestPrefix(pattern, left);
|
|
463
|
+
return;
|
|
464
|
+
}
|
|
465
|
+
const textLength = this.mkLenAxiom(text);
|
|
466
|
+
const isOffsetAtLeastLength = this.mkGe(this.mkSub(offset, textLength), 0);
|
|
467
|
+
const isOffsetAtMostLength = this.mkLe(this.mkSub(offset, textLength), 0);
|
|
468
|
+
const isIndexOffset = this.mkEq(index, offset);
|
|
469
|
+
this.addClause([this.mkNot(isOffsetAtLeastLength), isPatternEmpty, isMinusOne]);
|
|
470
|
+
this.addClause([isOffsetAtMostLength, isMinusOne]);
|
|
471
|
+
this.addClause([
|
|
472
|
+
this.mkNot(isOffsetAtLeastLength),
|
|
473
|
+
this.mkNot(isOffsetAtMostLength),
|
|
474
|
+
this.mkNot(isPatternEmpty),
|
|
475
|
+
isIndexOffset,
|
|
476
|
+
]);
|
|
477
|
+
const left = skolem.mkIndexofLeft(text, pattern, offset);
|
|
478
|
+
const right = skolem.mkIndexofRight(text, pattern, offset);
|
|
479
|
+
const indexof0 = this.mkSeq(OP_SEQ_INDEX, [right, pattern, zero]);
|
|
480
|
+
const shifted = this.mkArith(OP_ADD, [offset, indexof0]);
|
|
481
|
+
const isOffsetNonNegative = this.mkGe(offset, 0);
|
|
482
|
+
this.addClause([
|
|
483
|
+
this.mkNot(isOffsetNonNegative),
|
|
484
|
+
isOffsetAtLeastLength,
|
|
485
|
+
this.mkSeqEq(text, this.mkConcat(left, right)),
|
|
486
|
+
]);
|
|
487
|
+
const notNonNegative = this.mkNot(isOffsetNonNegative);
|
|
488
|
+
this.addClause([
|
|
489
|
+
notNonNegative,
|
|
490
|
+
isOffsetAtLeastLength,
|
|
491
|
+
this.mkEq(this.mkLenAxiom(left), offset),
|
|
492
|
+
]);
|
|
493
|
+
const notNonNegativeAgain = this.mkNot(isOffsetNonNegative);
|
|
494
|
+
this.addClause([
|
|
495
|
+
notNonNegativeAgain,
|
|
496
|
+
isOffsetAtLeastLength,
|
|
497
|
+
this.mkNot(this.mkEq(indexof0, minusOne)),
|
|
498
|
+
isMinusOne,
|
|
499
|
+
]);
|
|
500
|
+
const isOffsetNegative = this.mkNot(isOffsetNonNegative);
|
|
501
|
+
const isIndexof0Negative = this.mkNot(this.mkGe(indexof0, 0));
|
|
502
|
+
this.addClause([
|
|
503
|
+
isOffsetNegative,
|
|
504
|
+
isOffsetAtLeastLength,
|
|
505
|
+
isIndexof0Negative,
|
|
506
|
+
this.mkEq(shifted, index),
|
|
507
|
+
]);
|
|
508
|
+
this.addClause([isOffsetNonNegative, isMinusOne]);
|
|
509
|
+
}
|
|
510
|
+
|
|
511
|
+
lastIndexofAxiom(index: number) {
|
|
512
|
+
const manager = this.manager;
|
|
513
|
+
const [textArg, patternArg] = manager.getArgs(index);
|
|
514
|
+
const text = this.purify(textArg)!;
|
|
515
|
+
const pattern = this.purify(patternArg)!;
|
|
516
|
+
const minusOne = this.mkInt(-1);
|
|
517
|
+
const zero = this.mkInt(0);
|
|
518
|
+
const skolem = this.skolem;
|
|
519
|
+
const left = skolem.mkLastIndexofLeft(text, pattern);
|
|
520
|
+
const right = skolem.mkLastIndexofRight(text, pattern);
|
|
521
|
+
const parts = skolem.decompose(pattern);
|
|
522
|
+
const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
|
|
523
|
+
const containsTail = this.mkSeq(OP_SEQ_CONTAINS, [this.mkConcat(parts.tail, right), pattern]);
|
|
524
|
+
const isMinusOne = this.mkEq(index, minusOne);
|
|
525
|
+
this.mkEq(index, zero);
|
|
526
|
+
const isPatternEmpty = this.mkEqEmpty(pattern);
|
|
527
|
+
const isTextEmpty = this.mkEqEmpty(text);
|
|
528
|
+
const whole = this.mkConcat(left, pattern, right);
|
|
529
|
+
this.addClause([contains, isMinusOne]);
|
|
530
|
+
this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, isMinusOne]);
|
|
531
|
+
this.addClause([this.mkNot(isPatternEmpty), this.mkEq(index, this.mkLenAxiom(text))]);
|
|
532
|
+
this.addClause([isTextEmpty, this.mkNot(contains), this.mkSeqEq(text, whole)]);
|
|
533
|
+
const notContains = this.mkNot(contains);
|
|
534
|
+
this.addClause([isTextEmpty, notContains, this.mkEq(index, this.mkLenAxiom(left))]);
|
|
535
|
+
this.addClause([isPatternEmpty, this.mkEq(pattern, this.mkConcat(parts.head, parts.tail))]);
|
|
536
|
+
this.addClause([isPatternEmpty, this.mkNot(containsTail)]);
|
|
537
|
+
}
|
|
538
|
+
|
|
539
|
+
replaceAxiom(replace: number) {
|
|
540
|
+
const manager = this.manager;
|
|
541
|
+
const [source, patternArg, targetArg] = manager.getArgs(replace);
|
|
542
|
+
const text = this.purify(source)!;
|
|
543
|
+
const pattern = this.purify(patternArg)!;
|
|
544
|
+
const target = this.purify(targetArg)!;
|
|
545
|
+
const skolem = this.skolem;
|
|
546
|
+
const left = skolem.mkIndexofLeft(text, pattern);
|
|
547
|
+
const right = skolem.mkIndexofRight(text, pattern);
|
|
548
|
+
const replaced = this.mkConcat(left, target, right);
|
|
549
|
+
const whole = this.mkConcat(left, pattern, right);
|
|
550
|
+
const isTextEmpty = this.mkEqEmpty(text);
|
|
551
|
+
const isPatternEmpty = this.mkEqEmpty(pattern);
|
|
552
|
+
const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
|
|
553
|
+
this.addClause([
|
|
554
|
+
this.mkNot(isPatternEmpty),
|
|
555
|
+
this.mkSeqEq(replace, this.mkConcat(target, text)),
|
|
556
|
+
]);
|
|
557
|
+
this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, this.mkSeqEq(replace, text)]);
|
|
558
|
+
this.addClause([contains, this.mkSeqEq(replace, text)]);
|
|
559
|
+
this.addClause([this.mkNot(contains), isTextEmpty, isPatternEmpty, this.mkSeqEq(text, whole)]);
|
|
560
|
+
const notContains = this.mkNot(contains);
|
|
561
|
+
this.addClause([notContains, isTextEmpty, isPatternEmpty, this.mkSeqEq(replace, replaced)]);
|
|
562
|
+
this.tightestPrefix(pattern, left);
|
|
563
|
+
}
|
|
564
|
+
|
|
565
|
+
atAxiom(expr: number) {
|
|
566
|
+
const manager = this.manager;
|
|
567
|
+
const [seqArg, indexArg] = manager.getArgs(expr);
|
|
568
|
+
const seq = this.purify(seqArg)!;
|
|
569
|
+
const index = this.purify(indexArg)!;
|
|
570
|
+
this.mkInt(0);
|
|
571
|
+
const one = this.mkInt(1);
|
|
572
|
+
const empty = this.mkEmpty(manager.sorts[expr]);
|
|
573
|
+
this.mkLenAxiom(seq);
|
|
574
|
+
const isIndexNonNegative = this.mkGe(index, 0);
|
|
575
|
+
const isIndexBeyond = this.mkGe(this.mkSub(index, this.mkLenAxiom(seq)), 0);
|
|
576
|
+
const exprLength = this.mkLenAxiom(expr);
|
|
577
|
+
const value = manager.getNumeral(index);
|
|
578
|
+
if (value !== undefined && value >= 0n && value <= BigInt(UINT_MAX)) {
|
|
579
|
+
const elements: number[] = [];
|
|
580
|
+
for (let offset = 0; offset <= Number(value); offset++)
|
|
581
|
+
elements.push(this.mkUnit(this.mkNth(seq, offset)));
|
|
582
|
+
const nth = elements[elements.length - 1];
|
|
583
|
+
elements.push(this.skolem.mkTail(seq, index));
|
|
584
|
+
this.addClause([
|
|
585
|
+
this.mkNot(isIndexNonNegative),
|
|
586
|
+
isIndexBeyond,
|
|
587
|
+
this.mkSeqEq(seq, mkConcatOf(manager, elements, manager.sorts[expr])),
|
|
588
|
+
]);
|
|
589
|
+
const isNegative = this.mkNot(isIndexNonNegative);
|
|
590
|
+
this.addClause([isNegative, isIndexBeyond, this.mkSeqEq(nth, expr)]);
|
|
591
|
+
} else {
|
|
592
|
+
const prefix = this.skolem.mkPre(seq, index);
|
|
593
|
+
const suffix = this.skolem.mkTail(seq, index);
|
|
594
|
+
const whole = this.mkConcat(prefix, expr, suffix);
|
|
595
|
+
const prefixLength = this.mkLenAxiom(prefix);
|
|
596
|
+
this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkSeqEq(seq, whole)]);
|
|
597
|
+
const isNegative = this.mkNot(isIndexNonNegative);
|
|
598
|
+
this.addClause([isNegative, isIndexBeyond, this.mkEq(index, prefixLength)]);
|
|
599
|
+
}
|
|
600
|
+
this.addClause([isIndexNonNegative, this.mkEq(expr, empty)]);
|
|
601
|
+
const isNotBeyond = this.mkNot(isIndexBeyond);
|
|
602
|
+
this.addClause([isNotBeyond, this.mkEq(expr, empty)]);
|
|
603
|
+
this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkEq(one, exprLength)]);
|
|
604
|
+
this.addClause([this.mkLe(exprLength, 1)]);
|
|
605
|
+
}
|
|
606
|
+
|
|
607
|
+
nthAxiom(expr: number) {
|
|
608
|
+
const manager = this.manager;
|
|
609
|
+
const [seq, index] = manager.getArgs(expr);
|
|
610
|
+
const chars = manager.getString(seq);
|
|
611
|
+
const value = manager.getNumeral(index);
|
|
612
|
+
if (chars !== undefined && value !== undefined && value >= 0n && value < BigInt(chars.length)) {
|
|
613
|
+
this.addClause([this.mkEq(manager.mkChar(chars[Number(value)]), expr)]);
|
|
614
|
+
return;
|
|
615
|
+
}
|
|
616
|
+
const zero = this.mkInt(0);
|
|
617
|
+
const isIndexNonNegative = this.mkGe(index, 0);
|
|
618
|
+
const isIndexBeyond = this.mkGe(this.mkSub(index, this.mkLenAxiom(seq)), 0);
|
|
619
|
+
const unit = this.mkUnit(expr);
|
|
620
|
+
const at =
|
|
621
|
+
manager.getOp(seq) !== OP_SEQ_AT || zero !== index
|
|
622
|
+
? this.mkSeq(OP_SEQ_AT, [seq, index])
|
|
623
|
+
: seq;
|
|
624
|
+
const rhs = this.host.rewrite(at);
|
|
625
|
+
this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkEq(unit, rhs)]);
|
|
626
|
+
}
|
|
627
|
+
|
|
628
|
+
itosAxiom(expr: number) {
|
|
629
|
+
const manager = this.manager;
|
|
630
|
+
const number = manager.getArg(expr, 0);
|
|
631
|
+
const zero = this.mkInt(0);
|
|
632
|
+
const isEmpty = this.mkEq(expr, this.mkEmpty(manager.sorts[expr]));
|
|
633
|
+
const isNonNegative = this.mkGe(number, 0);
|
|
634
|
+
this.addClause([this.mkNot(isEmpty), this.mkNot(isNonNegative)]);
|
|
635
|
+
this.addClause([isEmpty, isNonNegative]);
|
|
636
|
+
this.addClause([this.mkGe(this.mkLenAxiom(expr), 0)]);
|
|
637
|
+
const stoi = this.mkSeq(OP_STRING_STOI, [expr]);
|
|
638
|
+
const isInverse = this.mkEq(stoi, number);
|
|
639
|
+
this.addClause([this.mkNot(isNonNegative), isInverse]);
|
|
640
|
+
this.host.forcePhase(this.mkLiteral(isInverse));
|
|
641
|
+
const zeroString = this.host.rewrite(manager.mkString([48]));
|
|
642
|
+
const isZero = this.mkEq(number, zero);
|
|
643
|
+
const isAtZero = this.mkEq(this.mkSeq(OP_SEQ_AT, [expr, zero]), zeroString);
|
|
644
|
+
this.addClause([isZero, this.mkNot(isAtZero)]);
|
|
645
|
+
this.addClause([this.mkNot(isZero), this.mkEq(expr, zeroString)]);
|
|
646
|
+
}
|
|
647
|
+
|
|
648
|
+
stoiAxiom(expr: number) {
|
|
649
|
+
const manager = this.manager;
|
|
650
|
+
const isNonNegative = this.mkGe(expr, 0);
|
|
651
|
+
const seq = manager.getArg(expr, 0);
|
|
652
|
+
this.addClause([this.mkGe(expr, -1)]);
|
|
653
|
+
const stoiEmpty = this.mkSeq(OP_STRING_STOI, [this.mkEmpty(manager.sorts[seq])]);
|
|
654
|
+
this.addClause([this.mkEq(stoiEmpty, this.mkInt(-1))]);
|
|
655
|
+
const isNegative = this.mkNot(isNonNegative);
|
|
656
|
+
this.addClause([isNegative, this.isDigit(this.mkNth(seq, 0))]);
|
|
657
|
+
this.addClause([isNegative, this.mkGe(this.mkLenAxiom(seq), 1)]);
|
|
658
|
+
}
|
|
659
|
+
|
|
660
|
+
stoiAxiomOf(expr: number, limit: number) {
|
|
661
|
+
const seq = this.host.rewrite(this.manager.getArg(expr, 0));
|
|
662
|
+
const stoi = (index: number) => this.skolem.mk("seq.stoi", [seq, this.mkInt(index)], SORT_INT);
|
|
663
|
+
const digit = (index: number) => this.mkDigit2int(this.mkNth(seq, index));
|
|
664
|
+
const isDigitAt = (index: number) => this.isDigit(this.mkNth(seq, index));
|
|
665
|
+
const length = this.mkLenAxiom(seq);
|
|
666
|
+
const isNonNegative = this.mkGe(expr, 0);
|
|
667
|
+
const isShort = this.mkLe(length, limit);
|
|
668
|
+
this.addClause([this.mkNot(isShort), this.mkEq(expr, stoi(limit - 1))]);
|
|
669
|
+
{
|
|
670
|
+
const isEmpty = this.mkLe(length, 0);
|
|
671
|
+
const isNotDigit = this.mkNot(isDigitAt(0));
|
|
672
|
+
const value = stoi(0);
|
|
673
|
+
this.addClause([isEmpty, isNotDigit, this.mkEq(value, digit(0))]);
|
|
674
|
+
}
|
|
675
|
+
{
|
|
676
|
+
const isEmpty = this.mkLe(length, 0);
|
|
677
|
+
const isDigitFirst = isDigitAt(0);
|
|
678
|
+
const value = stoi(0);
|
|
679
|
+
this.addClause([isEmpty, isDigitFirst, this.mkEq(value, this.mkInt(-1))]);
|
|
680
|
+
}
|
|
681
|
+
for (let index = 1; index < limit; index++) {
|
|
682
|
+
{
|
|
683
|
+
const isLonger = this.mkNot(this.mkLe(length, index));
|
|
684
|
+
const value = stoi(index);
|
|
685
|
+
this.addClause([isLonger, this.mkEq(value, stoi(index - 1))]);
|
|
686
|
+
}
|
|
687
|
+
{
|
|
688
|
+
const isShortEnough = this.mkLe(length, index);
|
|
689
|
+
const isPreviousNegative = this.mkNot(this.mkGe(stoi(index - 1), 0));
|
|
690
|
+
const isNotDigit = this.mkNot(isDigitAt(index));
|
|
691
|
+
const value = stoi(index);
|
|
692
|
+
const ten = this.mkInt(10);
|
|
693
|
+
const previous = stoi(index - 1);
|
|
694
|
+
const scaled = this.mkArith(OP_MUL, [ten, previous]);
|
|
695
|
+
this.addClause([
|
|
696
|
+
isShortEnough,
|
|
697
|
+
isPreviousNegative,
|
|
698
|
+
isNotDigit,
|
|
699
|
+
this.mkEq(value, this.mkArith(OP_ADD, [scaled, digit(index)])),
|
|
700
|
+
]);
|
|
701
|
+
}
|
|
702
|
+
{
|
|
703
|
+
const isShortEnough = this.mkLe(length, index);
|
|
704
|
+
const isDigitHere = isDigitAt(index);
|
|
705
|
+
const value = stoi(index);
|
|
706
|
+
this.addClause([isShortEnough, isDigitHere, this.mkEq(value, this.mkInt(-1))]);
|
|
707
|
+
}
|
|
708
|
+
{
|
|
709
|
+
const isShortEnough = this.mkLe(length, index);
|
|
710
|
+
const isPreviousNonNegative = this.mkGe(stoi(index - 1), 0);
|
|
711
|
+
const value = stoi(index);
|
|
712
|
+
this.addClause([isShortEnough, isPreviousNonNegative, this.mkEq(value, this.mkInt(-1))]);
|
|
713
|
+
}
|
|
714
|
+
{
|
|
715
|
+
const isNegative = this.mkNot(isNonNegative);
|
|
716
|
+
const isShortEnough = this.mkLe(length, index);
|
|
717
|
+
this.addClause([isNegative, isShortEnough, isDigitAt(index)]);
|
|
718
|
+
}
|
|
719
|
+
}
|
|
720
|
+
}
|
|
721
|
+
|
|
722
|
+
itosAxiomOf(expr: number, limit: number) {
|
|
723
|
+
const number = this.manager.getArg(expr, 0);
|
|
724
|
+
const length = this.mkLenAxiom(expr);
|
|
725
|
+
{
|
|
726
|
+
const isAtLeastTen = this.mkGe(number, 10);
|
|
727
|
+
this.addClause([isAtLeastTen, this.mkLe(length, 1)]);
|
|
728
|
+
}
|
|
729
|
+
{
|
|
730
|
+
const isNegative = this.mkLe(number, -1);
|
|
731
|
+
this.addClause([isNegative, this.mkGe(length, 1)]);
|
|
732
|
+
}
|
|
733
|
+
let low = 1n;
|
|
734
|
+
for (let index = 1; index <= limit; index++) {
|
|
735
|
+
low *= 10n;
|
|
736
|
+
{
|
|
737
|
+
const isAtLeastLow = this.mkGe(number, low);
|
|
738
|
+
this.addClause([isAtLeastLow, this.mkLe(length, index)]);
|
|
739
|
+
}
|
|
740
|
+
{
|
|
741
|
+
const isBelowLow = this.mkLe(number, low - 1n);
|
|
742
|
+
this.addClause([isBelowLow, this.mkGe(length, index + 1)]);
|
|
743
|
+
}
|
|
744
|
+
}
|
|
745
|
+
}
|
|
746
|
+
|
|
747
|
+
ltAxiom(expr: number) {
|
|
748
|
+
const manager = this.manager;
|
|
749
|
+
const [firstArg, secondArg] = manager.getArgs(expr);
|
|
750
|
+
const first = this.purify(firstArg)!;
|
|
751
|
+
const second = this.purify(secondArg)!;
|
|
752
|
+
const charSort = manager.getSeqElementSort(manager.sorts[first]);
|
|
753
|
+
const lt = expr;
|
|
754
|
+
const gt = this.mkSeq(OP_STRING_LT, [second, first]);
|
|
755
|
+
const skolem = this.skolem;
|
|
756
|
+
const x = skolem.mk("str.<.x", [first, second]);
|
|
757
|
+
const y = skolem.mk("str.<.y", [first, second]);
|
|
758
|
+
const z = skolem.mk("str.<.z", [first, second]);
|
|
759
|
+
const c = skolem.mk("str.<.c", [first, second], charSort);
|
|
760
|
+
const d = skolem.mk("str.<.d", [first, second], charSort);
|
|
761
|
+
const xcy = this.mkConcat(x, this.mkUnit(c), y);
|
|
762
|
+
const xdz = this.mkConcat(x, this.mkUnit(d), z);
|
|
763
|
+
const eq = this.mkEq(first, second);
|
|
764
|
+
const prefix21 = this.mkSeq(OP_SEQ_PREFIX, [second, first]);
|
|
765
|
+
const prefix12 = this.mkSeq(OP_SEQ_PREFIX, [first, second]);
|
|
766
|
+
const isFirstXcy = this.mkEq(first, xcy);
|
|
767
|
+
const isSecondXdz = this.mkEq(second, xdz);
|
|
768
|
+
const isCLessD = this.mkNot(this.mkSeq(OP_CHAR_LE, [d, c]));
|
|
769
|
+
const isDLessC = this.mkNot(this.mkSeq(OP_CHAR_LE, [c, d]));
|
|
770
|
+
this.addClause([this.mkNot(lt), prefix12, isSecondXdz]);
|
|
771
|
+
this.addClause([this.mkNot(lt), prefix12, isFirstXcy]);
|
|
772
|
+
this.addClause([this.mkNot(lt), prefix12, isCLessD]);
|
|
773
|
+
this.addClause([lt, prefix21, isFirstXcy]);
|
|
774
|
+
this.addClause([lt, prefix21, isDLessC]);
|
|
775
|
+
this.addClause([lt, prefix21, isSecondXdz]);
|
|
776
|
+
this.addClause([this.mkNot(eq), this.mkNot(lt)]);
|
|
777
|
+
this.addClause([eq, lt, gt]);
|
|
778
|
+
}
|
|
779
|
+
|
|
780
|
+
leAxiom(expr: number) {
|
|
781
|
+
const [first, second] = this.manager.getArgs(expr);
|
|
782
|
+
const lt = this.mkSeq(OP_STRING_LT, [first, second]);
|
|
783
|
+
const eq = this.mkEq(first, second);
|
|
784
|
+
this.addClause([this.mkNot(expr), lt, eq]);
|
|
785
|
+
this.addClause([this.mkNot(eq), expr]);
|
|
786
|
+
this.addClause([this.mkNot(lt), expr]);
|
|
787
|
+
}
|
|
788
|
+
|
|
789
|
+
isDigitAxiom(expr: number) {
|
|
790
|
+
const code = this.mkSeq(OP_STRING_TO_CODE, [this.manager.getArg(expr, 0)]);
|
|
791
|
+
const isAtLeastZero = this.mkGe(code, 48);
|
|
792
|
+
const isAtMostNine = this.mkLe(code, 57);
|
|
793
|
+
this.addClause([this.mkNot(expr), isAtLeastZero]);
|
|
794
|
+
this.addClause([this.mkNot(expr), isAtMostNine]);
|
|
795
|
+
const isBelow = this.mkNot(isAtLeastZero);
|
|
796
|
+
this.addClause([expr, isBelow, this.mkNot(isAtMostNine)]);
|
|
797
|
+
}
|
|
798
|
+
|
|
799
|
+
strToCodeAxiom(expr: number) {
|
|
800
|
+
const manager = this.manager;
|
|
801
|
+
const seq = manager.getArg(expr, 0);
|
|
802
|
+
const length = this.mkLenAxiom(seq);
|
|
803
|
+
const isLengthOne = this.mkEq(length, this.mkInt(1));
|
|
804
|
+
this.addClause([this.mkNot(isLengthOne), this.mkGe(expr, 0)]);
|
|
805
|
+
{
|
|
806
|
+
const notOne = this.mkNot(isLengthOne);
|
|
807
|
+
this.addClause([notOne, this.mkLe(expr, this.manager.maxChar)]);
|
|
808
|
+
}
|
|
809
|
+
{
|
|
810
|
+
const notOne = this.mkNot(isLengthOne);
|
|
811
|
+
const value = this.mkEq(expr, this.mkSeq(OP_CHAR_TO_INT, [this.mkNth(seq, 0)]));
|
|
812
|
+
this.addClause([notOne, value]);
|
|
813
|
+
}
|
|
814
|
+
if (manager.getOp(seq) !== OP_STRING_FROM_CODE) {
|
|
815
|
+
const notOne = this.mkNot(isLengthOne);
|
|
816
|
+
const inverse = this.mkEq(seq, this.mkSeq(OP_STRING_FROM_CODE, [expr]));
|
|
817
|
+
this.addClause([notOne, inverse]);
|
|
818
|
+
}
|
|
819
|
+
this.addClause([isLengthOne, this.mkEq(expr, this.mkInt(-1))]);
|
|
820
|
+
}
|
|
821
|
+
|
|
822
|
+
strFromCodeAxiom(expr: number) {
|
|
823
|
+
const manager = this.manager;
|
|
824
|
+
const code = manager.getArg(expr, 0);
|
|
825
|
+
const isNonNegative = this.mkGe(code, 0);
|
|
826
|
+
const isAtMostMax = this.mkLe(code, this.manager.maxChar);
|
|
827
|
+
const isEmpty = this.mkEq(expr, this.mkEmpty(manager.sorts[expr]));
|
|
828
|
+
{
|
|
829
|
+
const length = this.mkLenAxiom(expr);
|
|
830
|
+
const one = this.mkInt(1);
|
|
831
|
+
this.addClause([this.mkNot(isNonNegative), this.mkNot(isAtMostMax), this.mkEq(length, one)]);
|
|
832
|
+
}
|
|
833
|
+
if (manager.getOp(code) !== OP_STRING_TO_CODE) {
|
|
834
|
+
const notNonNegative = this.mkNot(isNonNegative);
|
|
835
|
+
const notAtMostMax = this.mkNot(isAtMostMax);
|
|
836
|
+
const inverse = this.mkEq(this.mkSeq(OP_STRING_TO_CODE, [expr]), code);
|
|
837
|
+
this.addClause([notNonNegative, notAtMostMax, inverse]);
|
|
838
|
+
}
|
|
839
|
+
this.addClause([isNonNegative, isEmpty]);
|
|
840
|
+
this.addClause([isAtMostMax, isEmpty]);
|
|
841
|
+
}
|
|
842
|
+
|
|
843
|
+
unitAxiom(expr: number) {
|
|
844
|
+
this.addClause([this.mkEq(this.manager.getArg(expr, 0), this.skolem.mkUnitInv(expr))]);
|
|
845
|
+
}
|
|
846
|
+
|
|
847
|
+
powerAxiom(expr: number) {
|
|
848
|
+
const manager = this.manager;
|
|
849
|
+
const [seq, exponent] = manager.getArgs(expr);
|
|
850
|
+
const empty = this.mkEmpty(manager.sorts[expr]);
|
|
851
|
+
const isPositive = this.mkGe(exponent, 1);
|
|
852
|
+
const exprLength = this.mkLenAxiom(expr);
|
|
853
|
+
this.addClause([isPositive, this.mkEq(expr, empty)]);
|
|
854
|
+
{
|
|
855
|
+
const notEmpty = this.mkNot(this.mkEq(seq, empty));
|
|
856
|
+
this.addClause([notEmpty, this.mkEq(expr, empty)]);
|
|
857
|
+
}
|
|
858
|
+
this.addClause([
|
|
859
|
+
this.mkNot(isPositive),
|
|
860
|
+
this.mkEq(exprLength, this.mkArith(OP_MUL, [exponent, this.mkLenAxiom(seq)])),
|
|
861
|
+
]);
|
|
862
|
+
{
|
|
863
|
+
const notPositive = this.mkNot(isPositive);
|
|
864
|
+
const isSeqEmpty = this.mkEq(seq, empty);
|
|
865
|
+
this.addClause([notPositive, isSeqEmpty, this.mkGeE(exprLength, exponent)]);
|
|
866
|
+
}
|
|
867
|
+
}
|
|
868
|
+
|
|
869
|
+
powerUnfoldAxiom(expr: number, limit: number) {
|
|
870
|
+
const manager = this.manager;
|
|
871
|
+
const [seq, exponent] = manager.getArgs(expr);
|
|
872
|
+
let power = seq;
|
|
873
|
+
const count = manager.getNumeral(exponent);
|
|
874
|
+
if (count !== undefined) {
|
|
875
|
+
if (count <= 0n || count > BigInt(limit)) return;
|
|
876
|
+
for (let index = 1n; index < count; index++) power = this.mkConcat(seq, power);
|
|
877
|
+
this.addClause([this.mkSeqEq(expr, power)]);
|
|
878
|
+
return;
|
|
879
|
+
}
|
|
880
|
+
for (let index = 1; index <= limit; index++) {
|
|
881
|
+
const isOther = this.mkNot(this.mkEq(exponent, this.mkInt(index)));
|
|
882
|
+
this.addClause([isOther, this.mkSeqEq(expr, power)]);
|
|
883
|
+
power = this.mkConcat(seq, power);
|
|
884
|
+
}
|
|
885
|
+
}
|
|
886
|
+
|
|
887
|
+
suffixAxiom(expr: number) {
|
|
888
|
+
this.affixAxiom(expr, "seq.suffix", false);
|
|
889
|
+
}
|
|
890
|
+
|
|
891
|
+
prefixAxiom(expr: number) {
|
|
892
|
+
this.affixAxiom(expr, "seq.prefix", true);
|
|
893
|
+
}
|
|
894
|
+
|
|
895
|
+
private affixAxiom(expr: number, name: string, isPrefix: boolean) {
|
|
896
|
+
const manager = this.manager;
|
|
897
|
+
const [firstArg, secondArg] = manager.getArgs(expr);
|
|
898
|
+
const first = this.purify(firstArg)!;
|
|
899
|
+
const second = this.purify(secondArg)!;
|
|
900
|
+
const firstLength = this.mkLenAxiom(first);
|
|
901
|
+
const secondLength = this.mkLenAxiom(second);
|
|
902
|
+
const isLonger = this.mkGe(this.mkSub(firstLength, secondLength), 1);
|
|
903
|
+
const charSort = manager.getSeqElementSort(manager.sorts[first]);
|
|
904
|
+
const skolem = this.skolem;
|
|
905
|
+
const x = skolem.mk(`${name}.x`, [first, second]);
|
|
906
|
+
const y = skolem.mk(`${name}.y`, [first, second]);
|
|
907
|
+
const z = skolem.mk(`${name}.z`, [first, second]);
|
|
908
|
+
const c = skolem.mk(`${name}.c`, [first, second], charSort);
|
|
909
|
+
const d = skolem.mk(`${name}.d`, [first, second], charSort);
|
|
910
|
+
this.addClause([
|
|
911
|
+
expr,
|
|
912
|
+
isLonger,
|
|
913
|
+
this.mkSeqEq(
|
|
914
|
+
first,
|
|
915
|
+
isPrefix ? this.mkConcat(x, this.mkUnit(c), y) : this.mkConcat(y, this.mkUnit(c), x),
|
|
916
|
+
),
|
|
917
|
+
]);
|
|
918
|
+
this.addClause([
|
|
919
|
+
expr,
|
|
920
|
+
isLonger,
|
|
921
|
+
this.mkSeqEq(
|
|
922
|
+
second,
|
|
923
|
+
isPrefix ? this.mkConcat(x, this.mkUnit(d), z) : this.mkConcat(z, this.mkUnit(d), x),
|
|
924
|
+
),
|
|
925
|
+
]);
|
|
926
|
+
this.addClause([expr, isLonger, this.mkNot(this.mkEq(c, d))]);
|
|
927
|
+
}
|
|
928
|
+
|
|
929
|
+
lengthAxiom(expr: number) {
|
|
930
|
+
const manager = this.manager;
|
|
931
|
+
const seq = manager.getArg(expr, 0);
|
|
932
|
+
const op = manager.getOp(seq);
|
|
933
|
+
if (op === OP_SEQ_EXTRACT) {
|
|
934
|
+
const [source, offset, length] = manager.getArgs(seq);
|
|
935
|
+
const sourceLength = this.mkLenAxiom(source);
|
|
936
|
+
const zero = this.mkInt(0);
|
|
937
|
+
const isLongEnough = this.mkGe(
|
|
938
|
+
this.mkArith(OP_SUB, [sourceLength, this.mkArith(OP_ADD, [offset, length])]),
|
|
939
|
+
0,
|
|
940
|
+
);
|
|
941
|
+
const isOffsetWithin = this.mkGe(this.mkArith(OP_SUB, [sourceLength, offset]), 0);
|
|
942
|
+
const isOffsetNonNegative = this.mkGe(offset, 0);
|
|
943
|
+
const isLengthNonNegative = this.mkGe(length, 0);
|
|
944
|
+
this.addClause([
|
|
945
|
+
this.mkNot(isOffsetNonNegative),
|
|
946
|
+
this.mkNot(isLengthNonNegative),
|
|
947
|
+
this.mkNot(isLongEnough),
|
|
948
|
+
this.mkEq(expr, length),
|
|
949
|
+
]);
|
|
950
|
+
this.addClause([isOffsetNonNegative, this.mkEq(expr, zero)]);
|
|
951
|
+
this.addClause([isLengthNonNegative, this.mkEq(expr, zero)]);
|
|
952
|
+
this.addClause([isOffsetWithin, this.mkEq(expr, zero)]);
|
|
953
|
+
this.addClause([
|
|
954
|
+
this.mkNot(isOffsetNonNegative),
|
|
955
|
+
this.mkNot(isOffsetWithin),
|
|
956
|
+
isLongEnough,
|
|
957
|
+
this.mkEq(expr, this.mkArith(OP_SUB, [sourceLength, offset])),
|
|
958
|
+
]);
|
|
959
|
+
return;
|
|
960
|
+
}
|
|
961
|
+
if (
|
|
962
|
+
op === OP_SEQ_UNIT ||
|
|
963
|
+
op === OP_SEQ_EMPTY ||
|
|
964
|
+
op === OP_SEQ_CONCAT ||
|
|
965
|
+
manager.getString(seq) !== undefined
|
|
966
|
+
) {
|
|
967
|
+
this.addClause([this.mkEq(this.host.rewrite(expr), expr)]);
|
|
968
|
+
return;
|
|
969
|
+
}
|
|
970
|
+
this.addClause([this.mkGe(expr, 0)]);
|
|
971
|
+
}
|
|
972
|
+
|
|
973
|
+
unrollNotContains(expr: number) {
|
|
974
|
+
const manager = this.manager;
|
|
975
|
+
const [text, pattern] = manager.getArgs(expr);
|
|
976
|
+
const parts = this.skolem.decompose(text);
|
|
977
|
+
const prefix = this.mkSeq(OP_SEQ_PREFIX, [pattern, text]);
|
|
978
|
+
const tailContains = this.mkSeq(OP_SEQ_CONTAINS, [parts.tail, pattern]);
|
|
979
|
+
const isEmpty = this.mkEqEmpty(text);
|
|
980
|
+
this.addClause([expr, this.mkNot(prefix)]);
|
|
981
|
+
this.addClause([expr, isEmpty, this.mkNot(tailContains)]);
|
|
982
|
+
this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(parts.tail)]);
|
|
983
|
+
this.addClause([isEmpty, this.mkEq(text, this.mkConcat(parts.head, parts.tail))]);
|
|
984
|
+
if (this.skolem.isTail(parts.tail))
|
|
985
|
+
this.addClause([
|
|
986
|
+
isEmpty,
|
|
987
|
+
this.mkGeE(this.mkLenAxiom(manager.getArg(parts.tail, 0)), manager.getArg(parts.tail, 1)),
|
|
988
|
+
]);
|
|
989
|
+
}
|
|
990
|
+
|
|
991
|
+
lengthLimit(seq: number, limit: number) {
|
|
992
|
+
const manager = this.manager;
|
|
993
|
+
const tracker = this.skolem.mkLengthLimit(seq, limit);
|
|
994
|
+
if (manager.getOp(seq) === OP_SEQ_POWER) {
|
|
995
|
+
this.addClause([this.mkNot(tracker), this.mkLe(manager.getArg(seq, 1), limit)]);
|
|
996
|
+
return tracker;
|
|
997
|
+
}
|
|
998
|
+
const target = manager.getOp(seq) === OP_STRING_STOI ? manager.getArg(seq, 0) : seq;
|
|
999
|
+
this.addClause([this.mkNot(tracker), this.mkLe(this.mkLenAxiom(target), limit)]);
|
|
1000
|
+
return tracker;
|
|
1001
|
+
}
|
|
1002
|
+
|
|
1003
|
+
ubvAxiom(): never {
|
|
1004
|
+
throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
|
|
1005
|
+
}
|
|
1006
|
+
|
|
1007
|
+
isItos(expr: number) {
|
|
1008
|
+
return this.manager.getOp(expr) === OP_STRING_ITOS;
|
|
1009
|
+
}
|
|
1010
|
+
}
|