tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
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 +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- 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/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- 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 +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- 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 +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- 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 +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- 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 +9 -4
- 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 +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -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 +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -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 +0 -2
- 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 +56 -74
- package/src/runtime.ts +4 -0
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +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 +2 -3
- 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 +205 -43
- package/src/simulate.ts +157 -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 +0 -2
- 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/messages.ts +20 -15
- 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 +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- 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 +62 -152
- 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
|
@@ -1,21 +1,26 @@
|
|
|
1
|
-
|
|
2
|
-
import { SmtInvariantError } from "../../../errors";
|
|
1
|
+
import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
|
|
3
2
|
import {
|
|
4
3
|
AstManager,
|
|
5
|
-
FAMILY_ARITH,
|
|
6
4
|
FAMILY_BASIC,
|
|
7
5
|
FAMILY_USER,
|
|
8
6
|
KIND_APP,
|
|
9
7
|
KIND_QUANTIFIER,
|
|
8
|
+
OP_ADD,
|
|
10
9
|
OP_AND,
|
|
10
|
+
OP_BADD,
|
|
11
|
+
OP_BAND,
|
|
12
|
+
OP_BMUL,
|
|
13
|
+
OP_BOR,
|
|
14
|
+
OP_BXNOR,
|
|
15
|
+
OP_BXOR,
|
|
11
16
|
OP_EQ,
|
|
12
17
|
OP_IMPLIES,
|
|
13
18
|
OP_ITE,
|
|
19
|
+
OP_MUL,
|
|
14
20
|
OP_NOT,
|
|
15
21
|
OP_OR,
|
|
16
22
|
OP_XOR,
|
|
17
23
|
SORT_BOOL,
|
|
18
|
-
isArithSort,
|
|
19
24
|
} from "./ast";
|
|
20
25
|
import { CaseSplitQueue } from "./case-split-queue";
|
|
21
26
|
import { CgTable, getCongruenceJustification, isCongruent } from "./cg-table";
|
|
@@ -38,6 +43,7 @@ import {
|
|
|
38
43
|
NO_ENODES,
|
|
39
44
|
UnitResolutionJustification,
|
|
40
45
|
} from "./enode";
|
|
46
|
+
import { isCommutativeDecl } from "./euf/egraph";
|
|
41
47
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
42
48
|
import {
|
|
43
49
|
BoolVar,
|
|
@@ -55,8 +61,9 @@ import type { DefaultQuantifierManager } from "./quantifier-manager";
|
|
|
55
61
|
import { RelevancyPropagator } from "./relevancy";
|
|
56
62
|
import { KERNEL_REWRITER_OPTIONS, Rewriter } from "./rewriter";
|
|
57
63
|
import { sortNumbers } from "./sort";
|
|
58
|
-
import type {
|
|
64
|
+
import type { Theory } from "./theory";
|
|
59
65
|
import { setAt, shrink } from "./array";
|
|
66
|
+
import { DEFAULT_CONFIG, IA_RANDOM, IA_RANDOM_WHEN_SEARCHING } from "./smt-setup";
|
|
60
67
|
import { StickyGenerations } from "./sticky-generations";
|
|
61
68
|
|
|
62
69
|
const DEEP_EXPR_THRESHOLD = 1024;
|
|
@@ -85,6 +92,26 @@ export const BV_THEORY = 1 << 31;
|
|
|
85
92
|
export const UNDO_ADD_EQ = 8;
|
|
86
93
|
export const UNDO_TH_VAR = 9;
|
|
87
94
|
|
|
95
|
+
// func_decl_info::is_flat_associative of a commutative declaration. cg_table::mk_table_for gives
|
|
96
|
+
// such a declaration the n-ary table, not the binary commutative one.
|
|
97
|
+
const isFlatAssociativeDecl = (manager: AstManager, decl: number) => {
|
|
98
|
+
switch (manager.funcDecls[decl].op) {
|
|
99
|
+
case OP_AND:
|
|
100
|
+
case OP_OR:
|
|
101
|
+
case OP_ADD:
|
|
102
|
+
case OP_MUL:
|
|
103
|
+
case OP_BADD:
|
|
104
|
+
case OP_BMUL:
|
|
105
|
+
case OP_BAND:
|
|
106
|
+
case OP_BOR:
|
|
107
|
+
case OP_BXOR:
|
|
108
|
+
case OP_BXNOR:
|
|
109
|
+
return true;
|
|
110
|
+
default:
|
|
111
|
+
return false;
|
|
112
|
+
}
|
|
113
|
+
};
|
|
114
|
+
|
|
88
115
|
interface NewEq {
|
|
89
116
|
lhs: Enode;
|
|
90
117
|
rhs: Enode;
|
|
@@ -104,12 +131,13 @@ export abstract class Internalizer {
|
|
|
104
131
|
readonly caseSplitQueue: CaseSplitQueue;
|
|
105
132
|
readonly cgTable = new CgTable();
|
|
106
133
|
private stickyGenerations = new StickyGenerations();
|
|
107
|
-
abstract
|
|
134
|
+
abstract getTheory(family: number): Theory | undefined;
|
|
108
135
|
abstract readonly qmanager: DefaultQuantifierManager;
|
|
109
136
|
|
|
110
137
|
numBoolVars = 0;
|
|
111
138
|
boolVar2Expr: number[] = [];
|
|
112
139
|
private boolVarData = new Int32Array(2048);
|
|
140
|
+
private boolVarTheories: number[] = [];
|
|
113
141
|
justifications: BJustification[] = [];
|
|
114
142
|
activity: number[] = [];
|
|
115
143
|
protected assignment: number[] = [];
|
|
@@ -146,11 +174,11 @@ export abstract class Internalizer {
|
|
|
146
174
|
protected cachedGeneration = new Map<number, number>();
|
|
147
175
|
private randomSeed = 0;
|
|
148
176
|
isSearching = false;
|
|
177
|
+
config = DEFAULT_CONFIG;
|
|
149
178
|
|
|
150
179
|
constructor(
|
|
151
180
|
readonly manager: AstManager,
|
|
152
181
|
isRelevancyEnabled: boolean,
|
|
153
|
-
isDelayingNewCaseSplits: boolean,
|
|
154
182
|
) {
|
|
155
183
|
this.rewriter = new Rewriter(manager, KERNEL_REWRITER_OPTIONS);
|
|
156
184
|
this.relevancy = new RelevancyPropagator(
|
|
@@ -170,7 +198,7 @@ export abstract class Internalizer {
|
|
|
170
198
|
getNumBoolVars: () => this.numBoolVars,
|
|
171
199
|
isUnassigned: (boolVar) => this.assignment[mkLiteral(boolVar)] === L_UNDEF,
|
|
172
200
|
},
|
|
173
|
-
|
|
201
|
+
isRelevancyEnabled,
|
|
174
202
|
);
|
|
175
203
|
this.mkBoolVar(manager.trueExpr);
|
|
176
204
|
this.assignment[0] = L_TRUE;
|
|
@@ -306,12 +334,18 @@ export abstract class Internalizer {
|
|
|
306
334
|
}
|
|
307
335
|
|
|
308
336
|
findCongruent(decl: number, args: Enode[]) {
|
|
309
|
-
return this.cgTable.findFor(
|
|
337
|
+
return this.cgTable.findFor(
|
|
338
|
+
decl,
|
|
339
|
+
args,
|
|
340
|
+
args.length === 2 &&
|
|
341
|
+
isCommutativeDecl(this.manager, decl) &&
|
|
342
|
+
!isFlatAssociativeDecl(this.manager, decl),
|
|
343
|
+
);
|
|
310
344
|
}
|
|
311
345
|
|
|
312
|
-
isDiseq(first: Enode, second: Enode) {
|
|
346
|
+
isDiseq(first: Enode, second: Enode, isCheckingValues = true) {
|
|
313
347
|
const manager = this.manager;
|
|
314
|
-
if (manager.areDistinct(first.root.owner, second.root.owner)) return true;
|
|
348
|
+
if (isCheckingValues && manager.areDistinct(first.root.owner, second.root.owner)) return true;
|
|
315
349
|
const tmp = this.isDiseqTmp;
|
|
316
350
|
if (tmp === -1 || manager.sorts[manager.getArg(tmp, 0)] !== manager.sorts[first.owner]) {
|
|
317
351
|
if (tmp !== -1) manager.decRef(tmp);
|
|
@@ -351,8 +385,8 @@ export abstract class Internalizer {
|
|
|
351
385
|
if (arg === manager.trueExpr) return L_FALSE;
|
|
352
386
|
return L_UNDEF;
|
|
353
387
|
}
|
|
354
|
-
if (this.isBInternalized(expr)) return this.getAssignmentOfExpr(expr);
|
|
355
388
|
if (expr === manager.falseExpr) return L_FALSE;
|
|
389
|
+
if (this.isBInternalized(expr)) return this.getAssignmentOfExpr(expr);
|
|
356
390
|
if (expr === manager.trueExpr) return L_TRUE;
|
|
357
391
|
return L_UNDEF;
|
|
358
392
|
}
|
|
@@ -445,7 +479,12 @@ export abstract class Internalizer {
|
|
|
445
479
|
this.boolVarData[2 * boolVar] = 0;
|
|
446
480
|
this.boolVarData[2 * boolVar + 1] = this.scopeLevel;
|
|
447
481
|
this.justifications[boolVar] = null;
|
|
448
|
-
|
|
482
|
+
const initialActivity = this.config.randomInitialActivity;
|
|
483
|
+
this.activity[boolVar] =
|
|
484
|
+
initialActivity === IA_RANDOM ||
|
|
485
|
+
(initialActivity === IA_RANDOM_WHEN_SEARCHING && this.isSearching)
|
|
486
|
+
? -((this.getRandomValue() % 1000) / 1000)
|
|
487
|
+
: 0;
|
|
449
488
|
this.assignment[literal] = L_UNDEF;
|
|
450
489
|
this.assignment[literal + 1] = L_UNDEF;
|
|
451
490
|
this.resetWatches(literal);
|
|
@@ -511,7 +550,12 @@ export abstract class Internalizer {
|
|
|
511
550
|
return this.hasBoolVarFlag(boolVar, BV_EQ | BV_ENODE | BV_THEORY | BV_QUANTIFIER);
|
|
512
551
|
}
|
|
513
552
|
|
|
514
|
-
|
|
553
|
+
getBoolVarTheory(boolVar: BoolVar) {
|
|
554
|
+
return this.hasBoolVarFlag(boolVar, BV_THEORY) ? this.boolVarTheories[boolVar] : -1;
|
|
555
|
+
}
|
|
556
|
+
|
|
557
|
+
setVarTheory(boolVar: BoolVar, thId: number) {
|
|
558
|
+
setAt(this.boolVarTheories, boolVar, thId);
|
|
515
559
|
if (this.scopeLevel > this.getInternLevel(boolVar)) {
|
|
516
560
|
this.trailInts.push(boolVar);
|
|
517
561
|
this.trailKinds.push(UNDO_VAR_THEORY);
|
|
@@ -519,6 +563,12 @@ export abstract class Internalizer {
|
|
|
519
563
|
this.setBoolVarFlag(boolVar, BV_THEORY, true);
|
|
520
564
|
}
|
|
521
565
|
|
|
566
|
+
forcePhase(literal: Literal) {
|
|
567
|
+
const boolVar = getVar(literal);
|
|
568
|
+
this.setBoolVarFlag(boolVar, BV_PHASE_AVAILABLE, true);
|
|
569
|
+
this.setBoolVarFlag(boolVar, BV_PHASE, !isNegated(literal));
|
|
570
|
+
}
|
|
571
|
+
|
|
522
572
|
setTrueFirstFlag(boolVar: BoolVar) {
|
|
523
573
|
this.trailInts.push(boolVar);
|
|
524
574
|
this.trailKinds.push(UNDO_TRUE_FIRST);
|
|
@@ -536,15 +586,19 @@ export abstract class Internalizer {
|
|
|
536
586
|
const moreArgs: Enode[] = numArgs > 2 ? [] : NO_ENODES;
|
|
537
587
|
for (let index = 2; index < numArgs; index++) moreArgs.push(this.getArgEnode(expr, index));
|
|
538
588
|
const isEq = !isSuppressingArgs && manager.getOp(expr) === OP_EQ;
|
|
589
|
+
const decl = manager.decls[expr];
|
|
590
|
+
const isCommutative = isEq || (numArgs === 2 && isCommutativeDecl(manager, decl));
|
|
539
591
|
const node = new Enode(
|
|
540
592
|
expr,
|
|
541
|
-
|
|
593
|
+
decl,
|
|
542
594
|
numArgs,
|
|
543
595
|
numArgs > 0 ? this.getArgEnode(expr, 0) : null,
|
|
544
596
|
numArgs > 1 ? this.getArgEnode(expr, 1) : null,
|
|
545
597
|
moreArgs,
|
|
546
598
|
generation,
|
|
547
599
|
isEq,
|
|
600
|
+
isCommutative,
|
|
601
|
+
isEq || (isCommutative && !isFlatAssociativeDecl(manager, decl)),
|
|
548
602
|
manager.sorts[expr] === SORT_BOOL,
|
|
549
603
|
isMergeTf,
|
|
550
604
|
isCgcEnabled,
|
|
@@ -648,18 +702,20 @@ export abstract class Internalizer {
|
|
|
648
702
|
return family === FAMILY_BASIC || family === FAMILY_USER;
|
|
649
703
|
}
|
|
650
704
|
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
this.isEInternalized(expr) ||
|
|
654
|
-
this.manager.depths[expr] <= DEEP_EXPR_THRESHOLD ||
|
|
655
|
-
!this.shouldInternalizeRec(expr)
|
|
656
|
-
)
|
|
657
|
-
return;
|
|
705
|
+
// Internalizes bottom up in topological order, so the recursion of internalizeRec stays shallow.
|
|
706
|
+
private internalizeDeep(exprs: readonly number[]) {
|
|
658
707
|
const manager = this.manager;
|
|
708
|
+
const isDeep = (expr: number) =>
|
|
709
|
+
!this.isEInternalized(expr) &&
|
|
710
|
+
manager.depths[expr] > DEEP_EXPR_THRESHOLD &&
|
|
711
|
+
this.shouldInternalizeRec(expr);
|
|
712
|
+
if (!exprs.some(isDeep)) return;
|
|
659
713
|
const colors = new Map<number, number>();
|
|
660
714
|
const getColor = (current: number, isGate: boolean) =>
|
|
661
715
|
colors.get(current * 2 + (isGate ? 1 : 0)) ?? WHITE;
|
|
662
|
-
const todo: [number, boolean][] =
|
|
716
|
+
const todo: [number, boolean][] = exprs
|
|
717
|
+
.filter(isDeep)
|
|
718
|
+
.map((innerExpr): [number, boolean] => [innerExpr, true]);
|
|
663
719
|
const sorted: [number, boolean][] = [];
|
|
664
720
|
const visitChild = (child: number, isGate: boolean) => {
|
|
665
721
|
if (getColor(child, isGate) === WHITE) todo.push([child, isGate]);
|
|
@@ -690,7 +746,7 @@ export abstract class Internalizer {
|
|
|
690
746
|
visitChildren(top[0]);
|
|
691
747
|
} else {
|
|
692
748
|
colors.set(top[0] * 2 + (top[1] ? 1 : 0), BLACK);
|
|
693
|
-
if (top[0]
|
|
749
|
+
if (!exprs.includes(top[0]) && !manager.isNot(top[0]) && this.shouldInternalizeRec(top[0]))
|
|
694
750
|
sorted.push(top);
|
|
695
751
|
}
|
|
696
752
|
}
|
|
@@ -700,7 +756,7 @@ export abstract class Internalizer {
|
|
|
700
756
|
internalizeAssertion(expr: number, generation: number) {
|
|
701
757
|
const savedGeneration = this.generation;
|
|
702
758
|
this.generation = generation;
|
|
703
|
-
this.internalizeDeep(expr);
|
|
759
|
+
this.internalizeDeep([expr]);
|
|
704
760
|
const manager = this.manager;
|
|
705
761
|
if (this.isGate(expr)) {
|
|
706
762
|
switch (manager.getOp(expr)) {
|
|
@@ -764,13 +820,19 @@ export abstract class Internalizer {
|
|
|
764
820
|
internalize(expr: number, isGateContext: boolean, generation = this.generation) {
|
|
765
821
|
const savedGeneration = this.generation;
|
|
766
822
|
this.generation = generation;
|
|
767
|
-
this.internalizeDeep(expr);
|
|
823
|
+
this.internalizeDeep([expr]);
|
|
768
824
|
this.internalizeRec(expr, isGateContext);
|
|
769
825
|
this.generation = savedGeneration;
|
|
770
826
|
}
|
|
771
827
|
|
|
828
|
+
internalizeAll(exprs: readonly number[], isGateContext: boolean) {
|
|
829
|
+
this.internalizeDeep(exprs);
|
|
830
|
+
for (const expr of exprs) this.internalizeRec(expr, isGateContext);
|
|
831
|
+
}
|
|
832
|
+
|
|
772
833
|
private internalizeRec(expr: number, isGateContext: boolean) {
|
|
773
834
|
const manager = this.manager;
|
|
835
|
+
if (manager.isLambda(expr)) throw new SmtUnsupportedError("lambdas in the array theory");
|
|
774
836
|
if (manager.sorts[expr] === SORT_BOOL) this.internalizeFormula(expr, isGateContext);
|
|
775
837
|
else this.internalizeTerm(expr);
|
|
776
838
|
}
|
|
@@ -809,13 +871,16 @@ export abstract class Internalizer {
|
|
|
809
871
|
this.internalizeFormulaCore(expr, isGateContext);
|
|
810
872
|
const boolVar = this.getBoolVar(expr);
|
|
811
873
|
this.setBoolVarFlag(boolVar, BV_EQ, true);
|
|
812
|
-
const
|
|
813
|
-
|
|
874
|
+
const manager = this.manager;
|
|
875
|
+
this.getTheory(manager.getSortFamily(manager.sorts[manager.getArg(expr, 0)]))?.internalizeEqEh(
|
|
876
|
+
expr,
|
|
877
|
+
boolVar,
|
|
878
|
+
);
|
|
814
879
|
}
|
|
815
880
|
|
|
816
881
|
private internalizeTheoryAtom(expr: number, isGateContext: boolean) {
|
|
817
|
-
|
|
818
|
-
|
|
882
|
+
const theory = this.getTheory(this.manager.getFamily(expr));
|
|
883
|
+
if (theory === undefined || !theory.internalizeAtom(expr, isGateContext)) return false;
|
|
819
884
|
const boolVar = this.getBoolVar(expr);
|
|
820
885
|
if (!isGateContext) {
|
|
821
886
|
const node = this.exprToEnode[expr];
|
|
@@ -940,21 +1005,28 @@ export abstract class Internalizer {
|
|
|
940
1005
|
const existing = this.exprToEnode[expr];
|
|
941
1006
|
if (existing !== undefined) {
|
|
942
1007
|
this.updateGeneration(existing);
|
|
943
|
-
|
|
944
|
-
|
|
1008
|
+
const theory = this.getTheory(manager.getFamily(expr));
|
|
1009
|
+
if (theory !== undefined && !theory.isAttachedToVar(existing)) theory.internalizeTerm(expr);
|
|
945
1010
|
return;
|
|
946
1011
|
}
|
|
947
1012
|
if (manager.getOp(expr) === OP_ITE) {
|
|
948
1013
|
this.internalizeIteTerm(expr);
|
|
949
1014
|
return;
|
|
950
1015
|
}
|
|
951
|
-
if (manager.getFamily(expr)
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
|
|
1016
|
+
if (!this.getTheory(manager.getFamily(expr))?.internalizeTerm(expr)) {
|
|
1017
|
+
for (let index = 0; index < manager.getNumArgs(expr); index++) {
|
|
1018
|
+
const arg = manager.getArg(expr, index);
|
|
1019
|
+
this.internalizeRec(arg, false);
|
|
1020
|
+
}
|
|
1021
|
+
if (this.exprToEnode[expr] === undefined) this.mkEnode(expr, false, false, true);
|
|
955
1022
|
}
|
|
956
|
-
|
|
957
|
-
this.
|
|
1023
|
+
const node = this.exprToEnode[expr];
|
|
1024
|
+
if (node !== undefined) this.applySortCnstr(expr, node);
|
|
1025
|
+
}
|
|
1026
|
+
|
|
1027
|
+
private applySortCnstr(expr: number, node: Enode) {
|
|
1028
|
+
const sort = this.manager.sorts[expr];
|
|
1029
|
+
this.getTheory(this.manager.getSortFamily(sort))?.applySortCnstr(node, sort);
|
|
958
1030
|
}
|
|
959
1031
|
|
|
960
1032
|
mkEqAtom(lhs: number, rhs: number) {
|
|
@@ -0,0 +1,381 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
KIND_VAR,
|
|
5
|
+
OP_ARRAY_MAP,
|
|
6
|
+
OP_AS_ARRAY,
|
|
7
|
+
OP_IMPLIES,
|
|
8
|
+
SORT_BOOL,
|
|
9
|
+
} from "./ast";
|
|
10
|
+
import {
|
|
11
|
+
AckrInfo,
|
|
12
|
+
type AppOcc,
|
|
13
|
+
calculateLemmaBound,
|
|
14
|
+
createFun2Terms,
|
|
15
|
+
createSel2Terms,
|
|
16
|
+
insertTerm,
|
|
17
|
+
isAckrSelect,
|
|
18
|
+
isUninterpFn,
|
|
19
|
+
markNonSelect,
|
|
20
|
+
pruneNonMarked,
|
|
21
|
+
} from "./ackr-helper";
|
|
22
|
+
import type { Goal } from "./goal";
|
|
23
|
+
import { ObjMap } from "./hashtable";
|
|
24
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
25
|
+
import { ModelEvaluator } from "./model-evaluator";
|
|
26
|
+
import { ProtoModel } from "./proto-model";
|
|
27
|
+
import { RefVector } from "./ref-vector";
|
|
28
|
+
import { type RewriterOptions, Rewriter } from "./rewriter";
|
|
29
|
+
|
|
30
|
+
export interface AckrSolver {
|
|
31
|
+
assert: (expr: number) => void;
|
|
32
|
+
check: () => number;
|
|
33
|
+
getModel: () => ProtoModel;
|
|
34
|
+
release: () => void;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
interface ValInfo {
|
|
38
|
+
value: number;
|
|
39
|
+
sourceTerm: number;
|
|
40
|
+
}
|
|
41
|
+
|
|
42
|
+
class LackrModelConstructor {
|
|
43
|
+
conflicts: [number, number][] = [];
|
|
44
|
+
private pinned: RefVector;
|
|
45
|
+
private values2val: ObjMap<ValInfo>;
|
|
46
|
+
private app2val: ObjMap<number>;
|
|
47
|
+
private visited = new Set<number>();
|
|
48
|
+
private evaluator: ModelEvaluator | undefined;
|
|
49
|
+
|
|
50
|
+
constructor(
|
|
51
|
+
private manager: AstManager,
|
|
52
|
+
private info: AckrInfo,
|
|
53
|
+
private abstrModel: ProtoModel,
|
|
54
|
+
) {
|
|
55
|
+
this.pinned = new RefVector(manager);
|
|
56
|
+
this.values2val = new ObjMap((expr) => manager.hashes[expr]);
|
|
57
|
+
this.app2val = new ObjMap((expr) => manager.hashes[expr]);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
check() {
|
|
61
|
+
const manager = this.manager;
|
|
62
|
+
let isOk = true;
|
|
63
|
+
for (const decl of this.abstrModel.getConstDecls()) {
|
|
64
|
+
const term =
|
|
65
|
+
this.info.findTerm(decl) ?? manager.mkApp(decl, [], manager.funcDecls[decl].range);
|
|
66
|
+
if (!this.checkTerm(term)) isOk = false;
|
|
67
|
+
}
|
|
68
|
+
return isOk;
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
release() {
|
|
72
|
+
this.evaluator?.release();
|
|
73
|
+
this.pinned.reset();
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
private checkTerm(term: number) {
|
|
77
|
+
const manager = this.manager;
|
|
78
|
+
this.evaluator ??= new ModelEvaluator(manager, new ProtoModel(manager).mkModel());
|
|
79
|
+
const stack = [term];
|
|
80
|
+
while (stack.length > 0) {
|
|
81
|
+
const current = stack[stack.length - 1];
|
|
82
|
+
if (this.visited.has(current)) {
|
|
83
|
+
stack.pop();
|
|
84
|
+
continue;
|
|
85
|
+
}
|
|
86
|
+
let isDone = true;
|
|
87
|
+
for (const arg of manager.getArgs(current))
|
|
88
|
+
if (!this.visited.has(arg)) {
|
|
89
|
+
stack.push(arg);
|
|
90
|
+
isDone = false;
|
|
91
|
+
}
|
|
92
|
+
if (!isDone) continue;
|
|
93
|
+
this.visited.add(current);
|
|
94
|
+
stack.pop();
|
|
95
|
+
if (!this.mkValue(current)) return false;
|
|
96
|
+
}
|
|
97
|
+
return true;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
private getCachedValue(app: number) {
|
|
101
|
+
return this.manager.isValue(app) ? app : this.app2val.get(app);
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
private mkValue(app: number) {
|
|
105
|
+
const manager = this.manager;
|
|
106
|
+
if (manager.isValue(app)) return true;
|
|
107
|
+
const result = this.evaluate(app);
|
|
108
|
+
if (result === undefined) return false;
|
|
109
|
+
this.app2val.set(app, result);
|
|
110
|
+
this.pinned.push(app);
|
|
111
|
+
this.pinned.push(result);
|
|
112
|
+
manager.decRef(result);
|
|
113
|
+
return true;
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
// The result comes with a reference.
|
|
117
|
+
private evaluate(app: number) {
|
|
118
|
+
const manager = this.manager;
|
|
119
|
+
const decl = manager.decls[app];
|
|
120
|
+
if (manager.getNumArgs(app) === 0) {
|
|
121
|
+
const value =
|
|
122
|
+
this.abstrModel.constInterps.get(decl) ??
|
|
123
|
+
this.abstrModel.getSomeValue(manager.funcDecls[decl].range);
|
|
124
|
+
manager.incRef(value);
|
|
125
|
+
return value;
|
|
126
|
+
}
|
|
127
|
+
const values = new RefVector(manager);
|
|
128
|
+
for (const arg of manager.getArgs(app)) {
|
|
129
|
+
const value = this.getCachedValue(arg);
|
|
130
|
+
if (value === undefined) {
|
|
131
|
+
values.reset();
|
|
132
|
+
return undefined;
|
|
133
|
+
}
|
|
134
|
+
values.push(value);
|
|
135
|
+
}
|
|
136
|
+
const term = manager.mkApp(decl, values.items, manager.sorts[app]);
|
|
137
|
+
manager.incRef(term);
|
|
138
|
+
const result = isUninterpFn(manager, app)
|
|
139
|
+
? this.mkUninterpretedValue(app, term)
|
|
140
|
+
: isAckrSelect(manager, app)
|
|
141
|
+
? undefined
|
|
142
|
+
: (this.evaluator as ModelEvaluator).rewrite(term);
|
|
143
|
+
manager.decRef(term);
|
|
144
|
+
values.reset();
|
|
145
|
+
return result;
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
private mkUninterpretedValue(app: number, key: number) {
|
|
149
|
+
const manager = this.manager;
|
|
150
|
+
const abstrDecl = manager.decls[this.info.getAbstr(app)];
|
|
151
|
+
const value =
|
|
152
|
+
this.abstrModel.constInterps.get(abstrDecl) ??
|
|
153
|
+
this.abstrModel.getSomeValue(manager.funcDecls[abstrDecl].range);
|
|
154
|
+
const existing = this.values2val.get(key);
|
|
155
|
+
if (existing === undefined) {
|
|
156
|
+
this.values2val.set(key, { value, sourceTerm: app });
|
|
157
|
+
this.pinned.push(app);
|
|
158
|
+
this.pinned.push(value);
|
|
159
|
+
this.pinned.push(key);
|
|
160
|
+
manager.incRef(value);
|
|
161
|
+
return value;
|
|
162
|
+
}
|
|
163
|
+
if (existing.value !== value) {
|
|
164
|
+
this.conflicts.push([app, existing.sourceTerm]);
|
|
165
|
+
return undefined;
|
|
166
|
+
}
|
|
167
|
+
manager.incRef(existing.value);
|
|
168
|
+
return existing.value;
|
|
169
|
+
}
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
export class Lackr {
|
|
173
|
+
readonly info: AckrInfo;
|
|
174
|
+
model: ProtoModel | undefined;
|
|
175
|
+
private abstr: RefVector;
|
|
176
|
+
private fun2terms: ObjMap<AppOcc>;
|
|
177
|
+
private sel2terms: ObjMap<AppOcc>;
|
|
178
|
+
private simp: Rewriter;
|
|
179
|
+
private ackrs: RefVector;
|
|
180
|
+
private nonSelect = new Set<number>();
|
|
181
|
+
private nonFuns = new Set<number>();
|
|
182
|
+
private isInit = false;
|
|
183
|
+
|
|
184
|
+
constructor(
|
|
185
|
+
private manager: AstManager,
|
|
186
|
+
private formulas: readonly number[],
|
|
187
|
+
rewriterOptions: RewriterOptions,
|
|
188
|
+
private isEager: boolean,
|
|
189
|
+
private solver?: AckrSolver,
|
|
190
|
+
) {
|
|
191
|
+
this.abstr = new RefVector(manager);
|
|
192
|
+
this.fun2terms = createFun2Terms(manager);
|
|
193
|
+
this.sel2terms = createSel2Terms(manager);
|
|
194
|
+
this.info = new AckrInfo(manager);
|
|
195
|
+
this.simp = new Rewriter(manager, rewriterOptions);
|
|
196
|
+
this.ackrs = new RefVector(manager);
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
solve() {
|
|
200
|
+
if (!this.init()) return L_UNDEF;
|
|
201
|
+
const result = this.isEager ? this.eager() : this.lazy();
|
|
202
|
+
if (result === L_TRUE) this.model = this.solver?.getModel();
|
|
203
|
+
return result;
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
mkAckermann(goal: Goal, lemmasUpperBound: number) {
|
|
207
|
+
if (lemmasUpperBound <= 0 || !this.init()) return false;
|
|
208
|
+
if (calculateLemmaBound(this.fun2terms, this.sel2terms) > lemmasUpperBound) return false;
|
|
209
|
+
this.eagerEnc();
|
|
210
|
+
for (const form of this.abstr.items) goal.assert(form);
|
|
211
|
+
for (const form of this.ackrs.items) goal.assert(form);
|
|
212
|
+
return true;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
// ~lackr: the lemmas, the simplifier, the abstraction info and the abstractions, in that order.
|
|
216
|
+
release(isInfoKept: boolean) {
|
|
217
|
+
this.ackrs.reset();
|
|
218
|
+
this.simp.release();
|
|
219
|
+
if (!isInfoKept) this.info.release();
|
|
220
|
+
this.abstr.reset();
|
|
221
|
+
}
|
|
222
|
+
|
|
223
|
+
private init() {
|
|
224
|
+
if (this.isInit) return true;
|
|
225
|
+
if (!this.collectTerms()) return false;
|
|
226
|
+
this.abstract();
|
|
227
|
+
this.isInit = true;
|
|
228
|
+
return true;
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
private isEqual(first: number, second: number) {
|
|
232
|
+
const manager = this.manager;
|
|
233
|
+
return (
|
|
234
|
+
first === second ||
|
|
235
|
+
(manager.isAlgebraicNumeral(first) &&
|
|
236
|
+
manager.isAlgebraicNumeral(second) &&
|
|
237
|
+
manager.am.compare(manager.getAlgebraicValue(first), manager.getAlgebraicValue(second)) ===
|
|
238
|
+
0)
|
|
239
|
+
);
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
private ackr(first: number, second: number) {
|
|
243
|
+
const manager = this.manager;
|
|
244
|
+
const eqs = new RefVector(manager);
|
|
245
|
+
for (let index = 0; index < manager.getNumArgs(first); index++) {
|
|
246
|
+
const firstArg = manager.getArg(first, index);
|
|
247
|
+
const secondArg = manager.getArg(second, index);
|
|
248
|
+
if (this.isEqual(firstArg, secondArg)) continue;
|
|
249
|
+
if (manager.areDistinct(firstArg, secondArg)) {
|
|
250
|
+
eqs.reset();
|
|
251
|
+
return false;
|
|
252
|
+
}
|
|
253
|
+
eqs.push(manager.mkEq(firstArg, secondArg));
|
|
254
|
+
}
|
|
255
|
+
const lhs = manager.mkAnd(eqs.items);
|
|
256
|
+
manager.incRef(lhs);
|
|
257
|
+
const rhs = manager.mkEq(this.info.getAbstr(first), this.info.getAbstr(second));
|
|
258
|
+
manager.incRef(rhs);
|
|
259
|
+
const implication = manager.mkApp(OP_IMPLIES, [lhs, rhs], SORT_BOOL);
|
|
260
|
+
manager.incRef(implication);
|
|
261
|
+
const abstracted = this.info.abstract(implication);
|
|
262
|
+
const simplified = this.simp.rewrite(abstracted);
|
|
263
|
+
manager.decRef(abstracted);
|
|
264
|
+
const isTrivial = manager.isTrue(simplified);
|
|
265
|
+
if (isTrivial) manager.decRef(simplified);
|
|
266
|
+
else this.ackrs.pushOwned(simplified);
|
|
267
|
+
manager.decRef(implication);
|
|
268
|
+
manager.decRef(rhs);
|
|
269
|
+
manager.decRef(lhs);
|
|
270
|
+
eqs.reset();
|
|
271
|
+
return !isTrivial;
|
|
272
|
+
}
|
|
273
|
+
|
|
274
|
+
private eagerEnc() {
|
|
275
|
+
for (const occs of [this.fun2terms, this.sel2terms])
|
|
276
|
+
for (const entry of occs) {
|
|
277
|
+
this.manager.limit.checkpoint();
|
|
278
|
+
this.ackrOcc(entry[1]);
|
|
279
|
+
}
|
|
280
|
+
}
|
|
281
|
+
|
|
282
|
+
private ackrOcc(occ: AppOcc) {
|
|
283
|
+
const varArgs = [...occ.varArgs];
|
|
284
|
+
for (const [index, first] of varArgs.entries()) {
|
|
285
|
+
for (const second of varArgs.slice(index + 1)) this.ackr(first, second);
|
|
286
|
+
for (const second of occ.constArgs) this.ackr(first, second);
|
|
287
|
+
}
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
private abstract() {
|
|
291
|
+
const manager = this.manager;
|
|
292
|
+
for (const entry of this.fun2terms) {
|
|
293
|
+
const name = manager.funcDecls[entry[0]].name;
|
|
294
|
+
for (const terms of [entry[1].varArgs, entry[1].constArgs])
|
|
295
|
+
for (const term of terms)
|
|
296
|
+
this.info.setAbstr(term, manager.mkFreshConst(name, manager.sorts[term]));
|
|
297
|
+
}
|
|
298
|
+
for (const entry of this.sel2terms) {
|
|
299
|
+
const name = manager.funcDecls[manager.decls[entry[0]]].name;
|
|
300
|
+
for (const terms of [entry[1].constArgs, entry[1].varArgs])
|
|
301
|
+
for (const term of terms)
|
|
302
|
+
this.info.setAbstr(term, manager.mkFreshConst(name, manager.sorts[term]));
|
|
303
|
+
}
|
|
304
|
+
for (const form of this.formulas) this.abstr.pushOwned(this.info.abstract(form));
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
private eager() {
|
|
308
|
+
const manager = this.manager;
|
|
309
|
+
const solver = this.solver as AckrSolver;
|
|
310
|
+
for (const form of this.abstr.items) solver.assert(form);
|
|
311
|
+
if (solver.check() === L_FALSE) return L_FALSE;
|
|
312
|
+
this.eagerEnc();
|
|
313
|
+
const all = manager.mkAnd(this.ackrs.items);
|
|
314
|
+
manager.incRef(all);
|
|
315
|
+
const simplified = this.simp.rewrite(all);
|
|
316
|
+
manager.decRef(all);
|
|
317
|
+
solver.assert(simplified);
|
|
318
|
+
manager.decRef(simplified);
|
|
319
|
+
return solver.check();
|
|
320
|
+
}
|
|
321
|
+
|
|
322
|
+
private lazy() {
|
|
323
|
+
const solver = this.solver as AckrSolver;
|
|
324
|
+
for (const form of this.abstr.items) solver.assert(form);
|
|
325
|
+
let ackrHead = 0;
|
|
326
|
+
let constructor: LackrModelConstructor | undefined;
|
|
327
|
+
while (true) {
|
|
328
|
+
this.manager.limit.checkpoint();
|
|
329
|
+
const result = solver.check();
|
|
330
|
+
if (result !== L_TRUE) {
|
|
331
|
+
constructor?.release();
|
|
332
|
+
return result;
|
|
333
|
+
}
|
|
334
|
+
constructor?.release();
|
|
335
|
+
constructor = new LackrModelConstructor(this.manager, this.info, solver.getModel());
|
|
336
|
+
if (constructor.check()) {
|
|
337
|
+
constructor.release();
|
|
338
|
+
return L_TRUE;
|
|
339
|
+
}
|
|
340
|
+
for (const conflict of constructor.conflicts) this.ackr(conflict[0], conflict[1]);
|
|
341
|
+
while (ackrHead < this.ackrs.size) solver.assert(this.ackrs.items[ackrHead++]);
|
|
342
|
+
}
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
private collectTerms() {
|
|
346
|
+
const manager = this.manager;
|
|
347
|
+
const stack = [...this.formulas];
|
|
348
|
+
const visited = new Set<number>();
|
|
349
|
+
while (stack.length > 0) {
|
|
350
|
+
const current = stack[stack.length - 1];
|
|
351
|
+
if (visited.has(current)) {
|
|
352
|
+
stack.pop();
|
|
353
|
+
continue;
|
|
354
|
+
}
|
|
355
|
+
if (manager.kinds[current] === KIND_VAR) {
|
|
356
|
+
visited.add(current);
|
|
357
|
+
stack.pop();
|
|
358
|
+
continue;
|
|
359
|
+
}
|
|
360
|
+
if (manager.kinds[current] !== KIND_APP) return false;
|
|
361
|
+
let isDone = true;
|
|
362
|
+
for (const arg of manager.getArgs(current))
|
|
363
|
+
if (!visited.has(arg)) {
|
|
364
|
+
stack.push(arg);
|
|
365
|
+
isDone = false;
|
|
366
|
+
}
|
|
367
|
+
if (isDone) {
|
|
368
|
+
visited.add(current);
|
|
369
|
+
stack.pop();
|
|
370
|
+
markNonSelect(manager, current, this.nonSelect);
|
|
371
|
+
insertTerm(manager, this.fun2terms, this.sel2terms, current);
|
|
372
|
+
}
|
|
373
|
+
const op = manager.getOp(current);
|
|
374
|
+
if (op === OP_AS_ARRAY || op === OP_ARRAY_MAP)
|
|
375
|
+
this.nonFuns.add(manager.funcDecls[manager.decls[current]].parameters[0]);
|
|
376
|
+
}
|
|
377
|
+
pruneNonMarked(this.sel2terms, this.nonSelect);
|
|
378
|
+
pruneNonMarked(this.fun2terms, this.nonFuns);
|
|
379
|
+
return true;
|
|
380
|
+
}
|
|
381
|
+
}
|