tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,1205 @@
|
|
|
1
|
+
import { SmtInvariantError, SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_BASIC,
|
|
5
|
+
FAMILY_MODEL_VALUE,
|
|
6
|
+
FAMILY_USER,
|
|
7
|
+
KIND_QUANTIFIER,
|
|
8
|
+
OP_DISTINCT,
|
|
9
|
+
OP_EQ,
|
|
10
|
+
OP_ITE,
|
|
11
|
+
SORT_BOOL,
|
|
12
|
+
SORT_SIZE_INFINITE,
|
|
13
|
+
SORT_SIZE_VERY_BIG,
|
|
14
|
+
QUANTIFIER_LAMBDA,
|
|
15
|
+
} from "../ast";
|
|
16
|
+
import { ObjHashtable } from "../hashtable";
|
|
17
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
18
|
+
import type { ProtoModel } from "../proto-model";
|
|
19
|
+
import { FuncInterp } from "../proto-model";
|
|
20
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
|
|
21
|
+
import { NULL_LITERAL } from "../sat/clause";
|
|
22
|
+
import {
|
|
23
|
+
CR_CONTINUE,
|
|
24
|
+
CR_DONE,
|
|
25
|
+
CR_GIVEUP,
|
|
26
|
+
JUSTIFICATION_EXT,
|
|
27
|
+
type SatExtension,
|
|
28
|
+
type Solver,
|
|
29
|
+
} from "../sat/solver";
|
|
30
|
+
import { Egraph, type Enode, getClass, mkExternal, NULL_BOOL_VAR, type ThEq } from "./egraph";
|
|
31
|
+
import {
|
|
32
|
+
addDependency,
|
|
33
|
+
type Dependencies,
|
|
34
|
+
type ThExplain,
|
|
35
|
+
type ThSolver,
|
|
36
|
+
TrailStack,
|
|
37
|
+
} from "./th-solver";
|
|
38
|
+
|
|
39
|
+
export interface EufInternalizer {
|
|
40
|
+
internalize(expr: number): number;
|
|
41
|
+
isBoolOp(expr: number): boolean;
|
|
42
|
+
addBoolVar(expr: number): number;
|
|
43
|
+
toBoolVar(expr: number): number;
|
|
44
|
+
push(): void;
|
|
45
|
+
pop(numScopes: number): void;
|
|
46
|
+
uncache(lit: number): void;
|
|
47
|
+
cache(expr: number, lit: number): void;
|
|
48
|
+
isCached(expr: number, lit: number): boolean;
|
|
49
|
+
setExpr2VarReplay(replay: Map<number, number> | null): void;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
// A theory solver for the family of a declaration, created on first use like euf::solver::get_solver.
|
|
53
|
+
export type ThSolverFactory = (ctx: EufSolver, family: number) => ThSolver | null;
|
|
54
|
+
|
|
55
|
+
const K_CONFLICT = 0;
|
|
56
|
+
const K_EQ = 1;
|
|
57
|
+
const K_LIT = 2;
|
|
58
|
+
|
|
59
|
+
interface Constraint {
|
|
60
|
+
readonly owner: ThSolver | null;
|
|
61
|
+
readonly kind: number;
|
|
62
|
+
readonly node: Enode | null;
|
|
63
|
+
readonly data: unknown;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
// The external justification of an egraph merge: a literal, or the index of a theory constraint.
|
|
67
|
+
const literalPayload = (lit: number) => lit * 2;
|
|
68
|
+
const constraintPayload = (index: number) => index * 2 + 1;
|
|
69
|
+
const isLiteralPayload = (payload: number) => (payload & 1) === 0;
|
|
70
|
+
|
|
71
|
+
interface Reinit {
|
|
72
|
+
readonly expr: number;
|
|
73
|
+
readonly generation: number;
|
|
74
|
+
readonly boolVar: number;
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
export class EufSolver implements SatExtension {
|
|
78
|
+
readonly egraph: Egraph;
|
|
79
|
+
readonly solvers: ThSolver[] = [];
|
|
80
|
+
private id2solver = new Map<number, ThSolver>();
|
|
81
|
+
qsolver: ThSolver | null = null;
|
|
82
|
+
private boolVar2exprs: (number | undefined)[] = [];
|
|
83
|
+
private varTrail: number[] = [];
|
|
84
|
+
private scopes: number[] = [];
|
|
85
|
+
readonly trail = new TrailStack();
|
|
86
|
+
readonly unhandledFunctions: number[] = [];
|
|
87
|
+
generation = 0;
|
|
88
|
+
private constraints: Constraint[] = [
|
|
89
|
+
{ owner: null, kind: K_CONFLICT, node: null, data: null },
|
|
90
|
+
{ owner: null, kind: K_EQ, node: null, data: null },
|
|
91
|
+
];
|
|
92
|
+
private explanation: number[] = [];
|
|
93
|
+
private assertedVars: boolean[] = [];
|
|
94
|
+
private reinits: Reinit[] = [];
|
|
95
|
+
private stack: { expr: number; index: number }[] = [];
|
|
96
|
+
private rewriter: Rewriter;
|
|
97
|
+
reasonUnknown = "";
|
|
98
|
+
private values: (number | undefined)[] = [];
|
|
99
|
+
private values2rootMap: Map<number, Enode> | null = null;
|
|
100
|
+
qmodel: ProtoModel | null = null;
|
|
101
|
+
|
|
102
|
+
constructor(
|
|
103
|
+
readonly manager: AstManager,
|
|
104
|
+
readonly si: EufInternalizer,
|
|
105
|
+
readonly s: Solver,
|
|
106
|
+
readonly mkThSolver: ThSolverFactory,
|
|
107
|
+
) {
|
|
108
|
+
this.egraph = new Egraph(manager);
|
|
109
|
+
this.egraph.onPropagateLiteral = (node, ante) => this.propagateLiteral(node, ante);
|
|
110
|
+
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
getEnode(expr: number) {
|
|
114
|
+
return this.egraph.find(expr);
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
boolVar2expr(boolVar: number) {
|
|
118
|
+
return this.boolVar2exprs[boolVar];
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
private setBoolVar2expr(boolVar: number, expr: number) {
|
|
122
|
+
this.varTrail.push(boolVar);
|
|
123
|
+
while (this.boolVar2exprs.length <= boolVar) this.boolVar2exprs.push(undefined);
|
|
124
|
+
this.boolVar2exprs[boolVar] = expr;
|
|
125
|
+
}
|
|
126
|
+
|
|
127
|
+
expr2literal(expr: number) {
|
|
128
|
+
return 2 * (this.egraph.find(expr) as Enode).boolVar;
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
rewrite(expr: number) {
|
|
132
|
+
return this.rewriter.rewrite(expr);
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
private boolVar2solver(boolVar: number) {
|
|
136
|
+
const expr = this.boolVar2exprs[boolVar];
|
|
137
|
+
return expr === undefined ? null : this.expr2solver(expr);
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
expr2solver(expr: number) {
|
|
141
|
+
const manager = this.manager;
|
|
142
|
+
if (manager.isApp(expr)) return this.decl2solver(manager.decls[expr]);
|
|
143
|
+
return manager.kinds[expr] === KIND_QUANTIFIER &&
|
|
144
|
+
manager.getQuantifier(expr).kind !== QUANTIFIER_LAMBDA
|
|
145
|
+
? this.quantifier2solver()
|
|
146
|
+
: null;
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
private quantifier2solver() {
|
|
150
|
+
if (this.qsolver !== null) return this.qsolver;
|
|
151
|
+
const solver = this.mkThSolver(this, -1);
|
|
152
|
+
if (solver === null) return null;
|
|
153
|
+
this.qsolver = solver;
|
|
154
|
+
this.addSolver(solver);
|
|
155
|
+
return solver;
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
decl2solver(decl: number) {
|
|
159
|
+
return this.getSolver(this.manager.funcDecls[decl].family, decl);
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
sort2solver(sort: number) {
|
|
163
|
+
return this.getSolver(this.manager.getSortFamily(sort), -1);
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
fid2solver(family: number) {
|
|
167
|
+
return this.id2solver.get(family);
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
private getSolver(family: number, decl: number) {
|
|
171
|
+
if (family < 0) return null;
|
|
172
|
+
const existing = this.id2solver.get(family);
|
|
173
|
+
if (existing !== undefined) return existing;
|
|
174
|
+
if (family === FAMILY_BASIC || family === FAMILY_USER) return null;
|
|
175
|
+
const solver = this.mkThSolver(this, family);
|
|
176
|
+
if (solver !== null) this.addSolver(solver);
|
|
177
|
+
else if (decl !== -1) this.unhandledFunction(decl);
|
|
178
|
+
return solver;
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
private addSolver(solver: ThSolver) {
|
|
182
|
+
const numScopes = this.s.scopeLvl + this.s.numUserScopes;
|
|
183
|
+
for (let index = 0; index < numScopes; index++) solver.push();
|
|
184
|
+
this.solvers.push(solver);
|
|
185
|
+
this.id2solver.set(solver.id, solver);
|
|
186
|
+
if (solver.useDiseqs()) this.egraph.setThPropagatesDiseqs(solver.id);
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
private unhandledFunction(decl: number) {
|
|
190
|
+
if (
|
|
191
|
+
this.unhandledFunctions.includes(decl) ||
|
|
192
|
+
this.manager.funcDecls[decl].family === FAMILY_MODEL_VALUE
|
|
193
|
+
)
|
|
194
|
+
return;
|
|
195
|
+
this.unhandledFunctions.push(decl);
|
|
196
|
+
this.trail.push(() => this.unhandledFunctions.pop());
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
hasUnhandled() {
|
|
200
|
+
return this.unhandledFunctions.length > 0;
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
internalizeTerm(expr: number) {
|
|
204
|
+
if (this.getEnode(expr) !== undefined) return;
|
|
205
|
+
if (this.si.isBoolOp(expr)) this.attachLit(this.si.internalize(expr), expr);
|
|
206
|
+
else {
|
|
207
|
+
const solver = this.expr2solver(expr);
|
|
208
|
+
if (solver !== null) solver.internalizeTerm(expr);
|
|
209
|
+
else this.visitRec(expr, false, false);
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
mkLiteral(expr: number) {
|
|
214
|
+
const manager = this.manager;
|
|
215
|
+
const isNot = manager.isNot(expr);
|
|
216
|
+
const lit = this.internalize(isNot ? manager.getArg(expr, 0) : expr, false, false);
|
|
217
|
+
return isNot ? lit ^ 1 : lit;
|
|
218
|
+
}
|
|
219
|
+
|
|
220
|
+
internalize(expr: number, isSign: boolean, isRoot: boolean): number {
|
|
221
|
+
const manager = this.manager;
|
|
222
|
+
const node = this.getEnode(expr);
|
|
223
|
+
if (node !== undefined)
|
|
224
|
+
return manager.isBool(expr) ? 2 * node.boolVar + (isSign ? 1 : 0) : NULL_LITERAL;
|
|
225
|
+
if (this.si.isBoolOp(expr)) {
|
|
226
|
+
const lit = this.attachLit(this.si.internalize(expr), expr);
|
|
227
|
+
return isSign ? lit ^ 1 : lit;
|
|
228
|
+
}
|
|
229
|
+
const solver = this.expr2solver(expr);
|
|
230
|
+
if (solver !== null) return solver.internalize(expr, isSign, isRoot);
|
|
231
|
+
if (!this.visitRec(expr, isSign, isRoot)) return NULL_LITERAL;
|
|
232
|
+
return manager.isBool(expr) ? 2 * this.si.toBoolVar(expr) + (isSign ? 1 : 0) : NULL_LITERAL;
|
|
233
|
+
}
|
|
234
|
+
|
|
235
|
+
private visitRec(expr: number, isSign: boolean, isRoot: boolean) {
|
|
236
|
+
const stack = this.stack;
|
|
237
|
+
const manager = this.manager;
|
|
238
|
+
const base = stack.length;
|
|
239
|
+
this.visit(expr);
|
|
240
|
+
loop: while (stack.length > base) {
|
|
241
|
+
const frame = stack[stack.length - 1];
|
|
242
|
+
const current = frame.expr;
|
|
243
|
+
if (this.egraph.find(current) !== undefined) {
|
|
244
|
+
stack.pop();
|
|
245
|
+
continue;
|
|
246
|
+
}
|
|
247
|
+
const numArgs = manager.getNumArgs(current);
|
|
248
|
+
while (frame.index < numArgs)
|
|
249
|
+
if (!this.visit(manager.getArg(current, frame.index++))) continue loop;
|
|
250
|
+
if (
|
|
251
|
+
this.egraph.find(current) === undefined &&
|
|
252
|
+
!this.postVisit(current, isSign, isRoot && current === expr)
|
|
253
|
+
) {
|
|
254
|
+
stack.length = base;
|
|
255
|
+
return false;
|
|
256
|
+
}
|
|
257
|
+
stack.pop();
|
|
258
|
+
}
|
|
259
|
+
return true;
|
|
260
|
+
}
|
|
261
|
+
|
|
262
|
+
private visit(expr: number) {
|
|
263
|
+
const manager = this.manager;
|
|
264
|
+
const node = this.egraph.find(expr);
|
|
265
|
+
if (node !== undefined) {
|
|
266
|
+
if (!this.si.isBoolOp(expr)) {
|
|
267
|
+
const solver = this.expr2solver(expr);
|
|
268
|
+
if (solver !== null && node.getThVar(solver.id) === -1) solver.internalizeTerm(expr);
|
|
269
|
+
}
|
|
270
|
+
return true;
|
|
271
|
+
}
|
|
272
|
+
if (this.si.isBoolOp(expr)) {
|
|
273
|
+
this.attachLit(this.si.internalize(expr), expr);
|
|
274
|
+
return true;
|
|
275
|
+
}
|
|
276
|
+
if (manager.isApp(expr) && manager.getNumArgs(expr) > 0) {
|
|
277
|
+
this.stack.push({ expr, index: 0 });
|
|
278
|
+
return false;
|
|
279
|
+
}
|
|
280
|
+
const solver = this.expr2solver(expr);
|
|
281
|
+
if (solver !== null) solver.internalizeTerm(expr);
|
|
282
|
+
else this.attachNode(this.mkEnode(expr, []));
|
|
283
|
+
return true;
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
private postVisit(expr: number, isSign: boolean, isRoot: boolean) {
|
|
287
|
+
const manager = this.manager;
|
|
288
|
+
const args = manager.isApp(expr)
|
|
289
|
+
? manager.getArgs(expr).map((arg) => this.egraph.find(arg) as Enode)
|
|
290
|
+
: [];
|
|
291
|
+
if (isRoot && this.internalizeRoot(expr, isSign, args)) return false;
|
|
292
|
+
const solver = this.expr2solver(expr);
|
|
293
|
+
if (solver !== null) solver.internalizeTerm(expr);
|
|
294
|
+
else this.attachNode(this.mkEnode(expr, args));
|
|
295
|
+
return true;
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
attachNode(node: Enode) {
|
|
299
|
+
const manager = this.manager;
|
|
300
|
+
const expr = node.owner;
|
|
301
|
+
const sort = manager.sorts[expr];
|
|
302
|
+
if (manager.isBool(expr)) this.attachLit(2 * this.si.addBoolVar(expr), expr);
|
|
303
|
+
if (!manager.isBool(expr) && !manager.isUninterpretedSort(sort)) {
|
|
304
|
+
const exprSolver = this.expr2solver(expr);
|
|
305
|
+
const sortSolver = this.sort2solver(sort);
|
|
306
|
+
if (sortSolver !== null && sortSolver !== exprSolver) sortSolver.applySortCnstr(node, sort);
|
|
307
|
+
else if (sortSolver === null && exprSolver === null && manager.isApp(expr))
|
|
308
|
+
this.unhandledFunction(manager.decls[expr]);
|
|
309
|
+
}
|
|
310
|
+
if (manager.getFamily(expr) === FAMILY_BASIC && manager.getOp(expr) === OP_EQ)
|
|
311
|
+
this.sort2solver(manager.sorts[manager.getArg(expr, 0)])?.eqInternalized(node);
|
|
312
|
+
this.axiomatizeBasic(node);
|
|
313
|
+
}
|
|
314
|
+
|
|
315
|
+
attachLit(lit: number, expr: number) {
|
|
316
|
+
const s = this.s;
|
|
317
|
+
let boolVar = lit >> 1;
|
|
318
|
+
s.setExternal(boolVar);
|
|
319
|
+
s.setEliminated(boolVar, false);
|
|
320
|
+
let result = lit;
|
|
321
|
+
if ((lit & 1) === 1) {
|
|
322
|
+
boolVar = this.si.addBoolVar(expr);
|
|
323
|
+
s.setExternal(boolVar);
|
|
324
|
+
s.setEliminated(boolVar, false);
|
|
325
|
+
this.setBoolVar2expr(boolVar, expr);
|
|
326
|
+
this.varTrail.push(boolVar);
|
|
327
|
+
const lit2 = 2 * boolVar;
|
|
328
|
+
s.mkClause([lit ^ 1, lit2]);
|
|
329
|
+
s.mkClause([lit, lit2 ^ 1]);
|
|
330
|
+
result = lit2;
|
|
331
|
+
}
|
|
332
|
+
if (this.boolVar2exprs[boolVar] !== undefined && this.egraph.find(expr) !== undefined)
|
|
333
|
+
return result;
|
|
334
|
+
this.setBoolVar2expr(boolVar, expr);
|
|
335
|
+
const node = this.egraph.find(expr) ?? this.mkEnode(expr, []);
|
|
336
|
+
node.boolVar = boolVar;
|
|
337
|
+
if (this.si.isBoolOp(expr)) this.egraph.setCgcEnabled(node, false);
|
|
338
|
+
const value = s.value(result);
|
|
339
|
+
if (value !== L_UNDEF)
|
|
340
|
+
this.egraph.setValue(
|
|
341
|
+
node,
|
|
342
|
+
value,
|
|
343
|
+
mkExternal(literalPayload(value === L_TRUE ? result : result ^ 1)),
|
|
344
|
+
);
|
|
345
|
+
return result;
|
|
346
|
+
}
|
|
347
|
+
|
|
348
|
+
private internalizeRoot(expr: number, isSign: boolean, args: readonly Enode[]) {
|
|
349
|
+
const manager = this.manager;
|
|
350
|
+
if (manager.getFamily(expr) !== FAMILY_BASIC || manager.getOp(expr) !== OP_DISTINCT)
|
|
351
|
+
return false;
|
|
352
|
+
if (isSign) this.addNotDistinctAxiom(expr, args);
|
|
353
|
+
else this.addDistinctAxiom(expr, args);
|
|
354
|
+
return true;
|
|
355
|
+
}
|
|
356
|
+
|
|
357
|
+
private addNotDistinctAxiom(expr: number, args: readonly Enode[]) {
|
|
358
|
+
const manager = this.manager;
|
|
359
|
+
const size = args.length;
|
|
360
|
+
if (size <= 1) {
|
|
361
|
+
this.s.mkClause([]);
|
|
362
|
+
return;
|
|
363
|
+
}
|
|
364
|
+
if (new Set(manager.getArgs(expr)).size < size) return;
|
|
365
|
+
if (size > 32) throw new SmtUnsupportedError("distinct over more than 32 arguments");
|
|
366
|
+
const lits: number[] = [];
|
|
367
|
+
for (let first = 0; first < size; first++)
|
|
368
|
+
for (let second = first + 1; second < size; second++)
|
|
369
|
+
lits.push(this.mkLiteral(this.mkEq(args[first].owner, args[second].owner)));
|
|
370
|
+
this.s.mkClause(lits);
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
private addDistinctAxiom(expr: number, args: readonly Enode[]) {
|
|
374
|
+
const manager = this.manager;
|
|
375
|
+
const size = args.length;
|
|
376
|
+
if (size <= 1) return;
|
|
377
|
+
const sortSize = manager.getSortSize(manager.sorts[manager.getArg(expr, 0)]);
|
|
378
|
+
if (sortSize !== SORT_SIZE_INFINITE && sortSize !== SORT_SIZE_VERY_BIG && sortSize < size) {
|
|
379
|
+
this.s.mkClause([]);
|
|
380
|
+
return;
|
|
381
|
+
}
|
|
382
|
+
if (size > 32) throw new SmtUnsupportedError("distinct over more than 32 arguments");
|
|
383
|
+
for (let first = 0; first < size; first++)
|
|
384
|
+
for (let second = first + 1; second < size; second++)
|
|
385
|
+
this.s.mkClause([this.mkLiteral(this.mkEq(args[first].owner, args[second].owner)) ^ 1]);
|
|
386
|
+
}
|
|
387
|
+
|
|
388
|
+
private axiomatizeBasic(node: Enode) {
|
|
389
|
+
const manager = this.manager;
|
|
390
|
+
const expr = node.owner;
|
|
391
|
+
if (manager.getFamily(expr) !== FAMILY_BASIC) return;
|
|
392
|
+
const op = manager.getOp(expr);
|
|
393
|
+
if (op === OP_ITE && !manager.isBool(expr)) {
|
|
394
|
+
const condition = manager.getArg(expr, 0);
|
|
395
|
+
const thenExpr = manager.getArg(expr, 1);
|
|
396
|
+
const elseExpr = manager.getArg(expr, 2);
|
|
397
|
+
const thenLit = this.mkLiteral(this.mkEq(expr, thenExpr));
|
|
398
|
+
if (thenExpr === elseExpr) {
|
|
399
|
+
this.s.mkClause([thenLit]);
|
|
400
|
+
return;
|
|
401
|
+
}
|
|
402
|
+
const conditionLit = this.mkLiteral(condition);
|
|
403
|
+
const elseLit = this.mkLiteral(this.mkEq(expr, elseExpr));
|
|
404
|
+
this.s.mkClause([conditionLit ^ 1, thenLit]);
|
|
405
|
+
this.s.mkClause([conditionLit, elseLit]);
|
|
406
|
+
} else if (op === OP_DISTINCT) {
|
|
407
|
+
const eqs: number[] = [];
|
|
408
|
+
for (let first = 0; first < node.numArgs; first++)
|
|
409
|
+
for (let second = first + 1; second < node.numArgs; second++)
|
|
410
|
+
eqs.push(this.mkEq(node.getArg(first).owner, node.getArg(second).owner));
|
|
411
|
+
const disjunction =
|
|
412
|
+
eqs.length === 0 ? manager.falseExpr : eqs.length === 1 ? eqs[0] : manager.mkOr(eqs);
|
|
413
|
+
manager.incRef(disjunction);
|
|
414
|
+
const distinctLit = 2 * this.si.toBoolVar(expr);
|
|
415
|
+
const someEq = this.si.internalize(disjunction);
|
|
416
|
+
this.s.mkClause([distinctLit ^ 1, someEq ^ 1]);
|
|
417
|
+
this.s.mkClause([distinctLit, someEq]);
|
|
418
|
+
} else if (op === OP_EQ && !manager.isBool(manager.getArg(expr, 0)))
|
|
419
|
+
this.s.setPhaseLiteral(this.expr2literal(expr));
|
|
420
|
+
}
|
|
421
|
+
|
|
422
|
+
isShared(node: Enode) {
|
|
423
|
+
const manager = this.manager;
|
|
424
|
+
const root = node.root;
|
|
425
|
+
if (root.isShared !== L_UNDEF) return root.isShared === L_TRUE;
|
|
426
|
+
const setShared = (isShared: boolean) => {
|
|
427
|
+
root.isShared = isShared ? L_TRUE : L_FALSE;
|
|
428
|
+
return isShared;
|
|
429
|
+
};
|
|
430
|
+
if (manager.getFamily(root.owner) === FAMILY_BASIC && manager.getOp(root.owner) === OP_ITE)
|
|
431
|
+
return setShared(true);
|
|
432
|
+
let thId = FAMILY_BASIC;
|
|
433
|
+
for (const thVar of root.thVars) {
|
|
434
|
+
if (thVar.id === FAMILY_BASIC) continue;
|
|
435
|
+
if (thId !== FAMILY_BASIC) return setShared(true);
|
|
436
|
+
thId = thVar.id;
|
|
437
|
+
}
|
|
438
|
+
if (manager.isBool(root.owner) && thId !== FAMILY_BASIC) return setShared(true);
|
|
439
|
+
for (const parent of root.parents) {
|
|
440
|
+
const family = manager.getFamily(parent.owner);
|
|
441
|
+
if (this.isBetaRedex(parent, root)) continue;
|
|
442
|
+
if (family !== thId && family !== FAMILY_BASIC) return setShared(true);
|
|
443
|
+
}
|
|
444
|
+
for (const thVar of root.thVars)
|
|
445
|
+
if (this.id2solver.get(thVar.id)?.isShared(thVar.thVar) === true) return setShared(true);
|
|
446
|
+
return setShared(false);
|
|
447
|
+
}
|
|
448
|
+
|
|
449
|
+
isBetaRedex(parent: Enode, node: Enode) {
|
|
450
|
+
for (const thVar of parent.thVars)
|
|
451
|
+
if (this.id2solver.get(thVar.id)?.isBetaRedex(parent, node) === true) return true;
|
|
452
|
+
return false;
|
|
453
|
+
}
|
|
454
|
+
|
|
455
|
+
mkEq(first: number, second: number) {
|
|
456
|
+
const manager = this.manager;
|
|
457
|
+
if (first === second) return manager.trueExpr;
|
|
458
|
+
if (manager.areDistinct(first, second)) return manager.falseExpr;
|
|
459
|
+
const swapped = manager.mkEq(second, first);
|
|
460
|
+
return this.egraph.find(swapped) !== undefined ? swapped : manager.mkEq(first, second);
|
|
461
|
+
}
|
|
462
|
+
|
|
463
|
+
getMaxGeneration(expr: number) {
|
|
464
|
+
const manager = this.manager;
|
|
465
|
+
let generation = 0;
|
|
466
|
+
const visited = new Set<number>();
|
|
467
|
+
const todo = [expr];
|
|
468
|
+
while (todo.length > 0) {
|
|
469
|
+
const current = todo.pop() as number;
|
|
470
|
+
if (visited.has(current)) continue;
|
|
471
|
+
visited.add(current);
|
|
472
|
+
const node = this.egraph.find(current);
|
|
473
|
+
if (node !== undefined) generation = Math.max(generation, node.generation);
|
|
474
|
+
else if (manager.isApp(current)) todo.push(...manager.getArgs(current));
|
|
475
|
+
}
|
|
476
|
+
return generation;
|
|
477
|
+
}
|
|
478
|
+
|
|
479
|
+
eInternalize(expr: number) {
|
|
480
|
+
const existing = this.egraph.find(expr);
|
|
481
|
+
if (existing !== undefined) return existing;
|
|
482
|
+
this.internalizeTerm(expr);
|
|
483
|
+
return this.egraph.find(expr) as Enode;
|
|
484
|
+
}
|
|
485
|
+
|
|
486
|
+
mkEnode(expr: number, args: readonly Enode[]) {
|
|
487
|
+
const manager = this.manager;
|
|
488
|
+
const isBoolOp = this.si.isBoolOp(expr);
|
|
489
|
+
const isIte = manager.getFamily(expr) === FAMILY_BASIC && manager.getOp(expr) === OP_ITE;
|
|
490
|
+
const nodeArgs = isBoolOp || isIte ? [] : args;
|
|
491
|
+
const node = this.egraph.mk(expr, this.generation, nodeArgs);
|
|
492
|
+
if (isBoolOp) this.egraph.setCgcEnabled(node, false);
|
|
493
|
+
for (const arg of nodeArgs)
|
|
494
|
+
if (manager.isBool(arg.owner)) this.egraph.setMergeTfEnabled(arg, true);
|
|
495
|
+
return node;
|
|
496
|
+
}
|
|
497
|
+
|
|
498
|
+
addClause(lits: number[], isRedundant: boolean) {
|
|
499
|
+
this.s.mkClause(lits, isRedundant, true);
|
|
500
|
+
}
|
|
501
|
+
|
|
502
|
+
mkConstraint(owner: ThSolver, data: unknown) {
|
|
503
|
+
return this.pushConstraint({ owner, kind: K_LIT, node: null, data });
|
|
504
|
+
}
|
|
505
|
+
|
|
506
|
+
constraintData(index: number) {
|
|
507
|
+
return this.constraints[index].data;
|
|
508
|
+
}
|
|
509
|
+
|
|
510
|
+
addExplain(payload: number) {
|
|
511
|
+
this.explanation.push(payload);
|
|
512
|
+
}
|
|
513
|
+
|
|
514
|
+
private pushConstraint(constraint: Constraint) {
|
|
515
|
+
const index = this.constraints.length;
|
|
516
|
+
this.constraints.push(constraint);
|
|
517
|
+
this.trail.push(() => this.constraints.pop());
|
|
518
|
+
return index;
|
|
519
|
+
}
|
|
520
|
+
|
|
521
|
+
private litConstraint(node: Enode) {
|
|
522
|
+
return this.pushConstraint({ owner: null, kind: K_LIT, node, data: null });
|
|
523
|
+
}
|
|
524
|
+
|
|
525
|
+
propagated() {
|
|
526
|
+
return false;
|
|
527
|
+
}
|
|
528
|
+
|
|
529
|
+
setConflict(index: number) {
|
|
530
|
+
this.s.setConflict(this.s.scopeLvl, JUSTIFICATION_EXT, index);
|
|
531
|
+
}
|
|
532
|
+
|
|
533
|
+
propagate(lit: number, index: number) {
|
|
534
|
+
this.s.assign(lit, this.s.scopeLvl, JUSTIFICATION_EXT, index);
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
propagateEq(first: Enode, second: Enode, index: number) {
|
|
538
|
+
if (first.root === second.root) return false;
|
|
539
|
+
this.egraph.merge(first, second, constraintPayload(index));
|
|
540
|
+
return true;
|
|
541
|
+
}
|
|
542
|
+
|
|
543
|
+
resolveConflict() {
|
|
544
|
+
return L_UNDEF;
|
|
545
|
+
}
|
|
546
|
+
|
|
547
|
+
getAntecedents(lit: number, index: number, antecedents: number[]) {
|
|
548
|
+
const constraint = this.constraints[index];
|
|
549
|
+
const egraph = this.egraph;
|
|
550
|
+
egraph.beginExplain();
|
|
551
|
+
this.explanation = [];
|
|
552
|
+
if (constraint.owner === null) this.getEufAntecedents(lit, constraint);
|
|
553
|
+
else constraint.owner.getAntecedents(lit, constraint.data, antecedents);
|
|
554
|
+
this.explainQueue(antecedents);
|
|
555
|
+
egraph.endExplain();
|
|
556
|
+
let kept = 0;
|
|
557
|
+
for (const antecedent of antecedents)
|
|
558
|
+
if (this.s.lvl(antecedent) > 0) antecedents[kept++] = antecedent;
|
|
559
|
+
antecedents.length = kept;
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
private explainQueue(antecedents: number[]) {
|
|
563
|
+
const explanation = this.explanation;
|
|
564
|
+
for (let head = 0; head < explanation.length; head++) {
|
|
565
|
+
const payload = explanation[head];
|
|
566
|
+
if (isLiteralPayload(payload)) antecedents.push(payload >> 1);
|
|
567
|
+
else {
|
|
568
|
+
const constraint = this.constraints[payload >> 1];
|
|
569
|
+
(constraint.owner as ThSolver).getAntecedents(NULL_LITERAL, constraint.data, antecedents);
|
|
570
|
+
}
|
|
571
|
+
}
|
|
572
|
+
}
|
|
573
|
+
|
|
574
|
+
addEqAntecedent(first: Enode, second: Enode) {
|
|
575
|
+
this.egraph.explainEq(this.explanation, first, second);
|
|
576
|
+
}
|
|
577
|
+
|
|
578
|
+
getThAntecedents(explain: ThExplain, antecedents: number[]) {
|
|
579
|
+
for (const lit of explain.lits) antecedents.push(lit);
|
|
580
|
+
for (const eq of explain.eqs)
|
|
581
|
+
if (eq[0].owner > eq[1].owner) this.egraph.explainEq(this.explanation, eq[1], eq[0]);
|
|
582
|
+
else this.egraph.explainEq(this.explanation, eq[0], eq[1]);
|
|
583
|
+
}
|
|
584
|
+
|
|
585
|
+
explainDiseq(justifications: number[], first: Enode, second: Enode) {
|
|
586
|
+
const boolVar = this.egraph.explainDiseq(justifications, first, second);
|
|
587
|
+
if (boolVar !== NULL_BOOL_VAR) justifications.push(literalPayload(2 * boolVar + 1));
|
|
588
|
+
}
|
|
589
|
+
|
|
590
|
+
private getEufAntecedents(lit: number, constraint: Constraint) {
|
|
591
|
+
const egraph = this.egraph;
|
|
592
|
+
if (constraint.kind === K_CONFLICT) {
|
|
593
|
+
egraph.explain(this.explanation);
|
|
594
|
+
return;
|
|
595
|
+
}
|
|
596
|
+
const node = egraph.find(this.boolVar2exprs[lit >> 1] as number) as Enode;
|
|
597
|
+
if (constraint.kind === K_EQ) {
|
|
598
|
+
egraph.explainEq(this.explanation, node.getArg(0), node.getArg(1));
|
|
599
|
+
return;
|
|
600
|
+
}
|
|
601
|
+
const ante = constraint.node as Enode;
|
|
602
|
+
egraph.explainEq(this.explanation, node, ante);
|
|
603
|
+
const manager = this.manager;
|
|
604
|
+
if (!manager.isTrue(ante.owner) && !manager.isFalse(ante.owner))
|
|
605
|
+
this.explanation.push(literalPayload(2 * ante.boolVar + (ante.value === L_FALSE ? 1 : 0)));
|
|
606
|
+
}
|
|
607
|
+
|
|
608
|
+
setEliminated(boolVar: number) {
|
|
609
|
+
this.si.uncache(2 * boolVar);
|
|
610
|
+
this.si.uncache(2 * boolVar + 1);
|
|
611
|
+
}
|
|
612
|
+
|
|
613
|
+
asserted(lit: number) {
|
|
614
|
+
const expr = this.boolVar2exprs[lit >> 1];
|
|
615
|
+
if (expr === undefined) return;
|
|
616
|
+
const egraph = this.egraph;
|
|
617
|
+
const node = egraph.find(expr);
|
|
618
|
+
if (node === undefined) return;
|
|
619
|
+
const boolVar = lit >> 1;
|
|
620
|
+
if (this.assertedVars[boolVar] === true) return;
|
|
621
|
+
while (this.assertedVars.length <= boolVar) this.assertedVars.push(false);
|
|
622
|
+
this.assertedVars[boolVar] = true;
|
|
623
|
+
this.trail.push(() => {
|
|
624
|
+
this.assertedVars[boolVar] = false;
|
|
625
|
+
});
|
|
626
|
+
const isSign = (lit & 1) === 1;
|
|
627
|
+
const oldValue = node.value;
|
|
628
|
+
const newValue = isSign ? L_FALSE : L_TRUE;
|
|
629
|
+
egraph.setValue(node, newValue, mkExternal(literalPayload(lit)));
|
|
630
|
+
if (oldValue === L_UNDEF && node.isCgcEnabled)
|
|
631
|
+
for (const other of getClass(node)) {
|
|
632
|
+
if (other.boolVar === NULL_BOOL_VAR || other.value === newValue) continue;
|
|
633
|
+
const otherLit = 2 * other.boolVar + (isSign ? 1 : 0);
|
|
634
|
+
if (this.s.value(otherLit) === L_TRUE) continue;
|
|
635
|
+
this.propagate(otherLit, this.litConstraint(node));
|
|
636
|
+
if (this.s.value(otherLit) === L_FALSE) return;
|
|
637
|
+
}
|
|
638
|
+
for (const thVar of node.thVars) (this.id2solver.get(thVar.id) as ThSolver).asserted(lit);
|
|
639
|
+
if (node.mergeTf)
|
|
640
|
+
egraph.merge(node, isSign ? this.mkFalse() : this.mkTrue(), literalPayload(lit));
|
|
641
|
+
if (node.isEquality) {
|
|
642
|
+
if (isSign) egraph.newDiseq(node);
|
|
643
|
+
else egraph.merge(node.getArg(0), node.getArg(1), literalPayload(lit));
|
|
644
|
+
}
|
|
645
|
+
}
|
|
646
|
+
|
|
647
|
+
canPropagate() {
|
|
648
|
+
return this.egraph.canPropagate();
|
|
649
|
+
}
|
|
650
|
+
|
|
651
|
+
unitPropagate() {
|
|
652
|
+
let isPropagated = false;
|
|
653
|
+
const egraph = this.egraph;
|
|
654
|
+
while (!this.s.isInconsistent) {
|
|
655
|
+
if (egraph.isInconsistent) {
|
|
656
|
+
this.setConflict(K_CONFLICT);
|
|
657
|
+
return true;
|
|
658
|
+
}
|
|
659
|
+
let isPropagatedOnce = false;
|
|
660
|
+
if (egraph.propagate()) {
|
|
661
|
+
this.propagateThEqs();
|
|
662
|
+
isPropagatedOnce = true;
|
|
663
|
+
}
|
|
664
|
+
for (let index = 0; index < this.solvers.length; index++)
|
|
665
|
+
if (this.solvers[index].unitPropagate()) isPropagatedOnce = true;
|
|
666
|
+
if (!isPropagatedOnce) break;
|
|
667
|
+
isPropagated = true;
|
|
668
|
+
}
|
|
669
|
+
return isPropagated;
|
|
670
|
+
}
|
|
671
|
+
|
|
672
|
+
private propagateLiteral(node: Enode, ante: Enode | null) {
|
|
673
|
+
const manager = this.manager;
|
|
674
|
+
const boolVar = node.boolVar;
|
|
675
|
+
if (boolVar === NULL_BOOL_VAR) return;
|
|
676
|
+
const constraint = ante === null ? K_EQ : this.litConstraint(ante);
|
|
677
|
+
const lit =
|
|
678
|
+
ante === null
|
|
679
|
+
? 2 * boolVar
|
|
680
|
+
: 2 * boolVar +
|
|
681
|
+
((ante.value === L_UNDEF
|
|
682
|
+
? manager.isTrue(ante.owner)
|
|
683
|
+
? L_TRUE
|
|
684
|
+
: L_FALSE
|
|
685
|
+
: ante.value) === L_FALSE
|
|
686
|
+
? 1
|
|
687
|
+
: 0);
|
|
688
|
+
if (this.s.value(lit) !== L_TRUE) {
|
|
689
|
+
this.s.assign(lit, this.s.scopeLvl, JUSTIFICATION_EXT, constraint);
|
|
690
|
+
return;
|
|
691
|
+
}
|
|
692
|
+
if (!node.mergeTf || manager.isValue(node.root.owner)) return;
|
|
693
|
+
this.egraph.merge(node, ante ?? this.mkTrue(), literalPayload(lit));
|
|
694
|
+
}
|
|
695
|
+
|
|
696
|
+
private isSelfPropagated(eq: ThEq) {
|
|
697
|
+
if (eq.root === null) return false;
|
|
698
|
+
const egraph = this.egraph;
|
|
699
|
+
egraph.beginExplain();
|
|
700
|
+
const explanation: number[] = [];
|
|
701
|
+
egraph.explainEq(explanation, eq.child, eq.root);
|
|
702
|
+
egraph.endExplain();
|
|
703
|
+
if (egraph.usesCongruence) return false;
|
|
704
|
+
for (const payload of explanation) {
|
|
705
|
+
if (isLiteralPayload(payload)) return false;
|
|
706
|
+
const owner = this.constraints[payload >> 1].owner;
|
|
707
|
+
if (owner === null || owner.id !== eq.id || owner.isSelfPropagating()) return false;
|
|
708
|
+
}
|
|
709
|
+
return true;
|
|
710
|
+
}
|
|
711
|
+
|
|
712
|
+
private propagateThEqs() {
|
|
713
|
+
const egraph = this.egraph;
|
|
714
|
+
for (
|
|
715
|
+
;
|
|
716
|
+
egraph.hasThEq() && !this.s.isInconsistent && !egraph.isInconsistent;
|
|
717
|
+
egraph.nextThEq()
|
|
718
|
+
) {
|
|
719
|
+
const eq = egraph.getThEq();
|
|
720
|
+
const solver = this.id2solver.get(eq.id) as ThSolver;
|
|
721
|
+
if (eq.root === null) solver.newDiseqEh(eq);
|
|
722
|
+
else if (!this.isSelfPropagated(eq)) solver.newEqEh(eq);
|
|
723
|
+
}
|
|
724
|
+
}
|
|
725
|
+
|
|
726
|
+
mkTrue() {
|
|
727
|
+
this.visit(this.manager.trueExpr);
|
|
728
|
+
return this.egraph.find(this.manager.trueExpr) as Enode;
|
|
729
|
+
}
|
|
730
|
+
|
|
731
|
+
mkFalse() {
|
|
732
|
+
this.visit(this.manager.falseExpr);
|
|
733
|
+
return this.egraph.find(this.manager.falseExpr) as Enode;
|
|
734
|
+
}
|
|
735
|
+
|
|
736
|
+
check() {
|
|
737
|
+
if (this.unitPropagate()) return CR_CONTINUE;
|
|
738
|
+
const numNodes = this.egraph.numNodes;
|
|
739
|
+
let isGivenUp = false;
|
|
740
|
+
let isContinued = false;
|
|
741
|
+
const applySolver = (solver: ThSolver) => {
|
|
742
|
+
const result = solver.check();
|
|
743
|
+
if (result === CR_CONTINUE) isContinued = true;
|
|
744
|
+
else if (result === CR_GIVEUP) {
|
|
745
|
+
this.reasonUnknown = `incomplete theory ${solver.name}`;
|
|
746
|
+
isGivenUp = true;
|
|
747
|
+
}
|
|
748
|
+
};
|
|
749
|
+
if (this.mergeSharedBools()) isContinued = true;
|
|
750
|
+
for (let index = 0; index < this.solvers.length; index++) {
|
|
751
|
+
const solver = this.solvers[index];
|
|
752
|
+
if (!this.manager.limit.inc()) {
|
|
753
|
+
this.reasonUnknown = "canceled";
|
|
754
|
+
return CR_GIVEUP;
|
|
755
|
+
}
|
|
756
|
+
if (solver === this.qsolver) continue;
|
|
757
|
+
applySolver(solver);
|
|
758
|
+
if (this.s.isInconsistent) return CR_CONTINUE;
|
|
759
|
+
}
|
|
760
|
+
if (this.s.isInconsistent || isContinued) return CR_CONTINUE;
|
|
761
|
+
if (this.qsolver !== null) applySolver(this.qsolver);
|
|
762
|
+
if (numNodes < this.egraph.numNodes || isContinued) return CR_CONTINUE;
|
|
763
|
+
if (isGivenUp) return CR_GIVEUP;
|
|
764
|
+
for (const solver of this.solvers) solver.finalize();
|
|
765
|
+
return CR_DONE;
|
|
766
|
+
}
|
|
767
|
+
|
|
768
|
+
getReasonUnknown() {
|
|
769
|
+
return this.reasonUnknown;
|
|
770
|
+
}
|
|
771
|
+
|
|
772
|
+
private mergeSharedBools() {
|
|
773
|
+
const manager = this.manager;
|
|
774
|
+
let isMerged = false;
|
|
775
|
+
const nodes = this.egraph.nodes;
|
|
776
|
+
for (let index = nodes.length; index-- > 0;) {
|
|
777
|
+
const node = nodes[index];
|
|
778
|
+
if (!manager.isBool(node.owner) || !this.isShared(node)) continue;
|
|
779
|
+
if (node.value === L_TRUE && node.isCgcEnabled && !manager.isTrue(node.root.owner)) {
|
|
780
|
+
this.egraph.merge(node, this.mkTrue(), literalPayload(2 * node.boolVar));
|
|
781
|
+
isMerged = true;
|
|
782
|
+
}
|
|
783
|
+
if (node.value === L_FALSE && node.isCgcEnabled && !manager.isFalse(node.root.owner)) {
|
|
784
|
+
this.egraph.merge(node, this.mkFalse(), literalPayload(2 * node.boolVar + 1));
|
|
785
|
+
isMerged = true;
|
|
786
|
+
}
|
|
787
|
+
}
|
|
788
|
+
return isMerged;
|
|
789
|
+
}
|
|
790
|
+
|
|
791
|
+
push() {
|
|
792
|
+
this.si.push();
|
|
793
|
+
this.scopes.push(this.varTrail.length);
|
|
794
|
+
this.trail.pushScope();
|
|
795
|
+
for (const solver of this.solvers) solver.push();
|
|
796
|
+
this.egraph.pushScope();
|
|
797
|
+
}
|
|
798
|
+
|
|
799
|
+
pop(numScopes: number) {
|
|
800
|
+
this.startReinit();
|
|
801
|
+
this.trail.popScope(numScopes);
|
|
802
|
+
for (const solver of this.solvers) solver.pop(numScopes);
|
|
803
|
+
this.si.pop(numScopes);
|
|
804
|
+
this.egraph.popScopes(numScopes);
|
|
805
|
+
const varLim = this.scopes[this.scopes.length - numScopes];
|
|
806
|
+
for (let index = this.varTrail.length; index-- > varLim;) {
|
|
807
|
+
const boolVar = this.varTrail[index];
|
|
808
|
+
this.boolVar2exprs[boolVar] = undefined;
|
|
809
|
+
this.s.setNonExternal(boolVar);
|
|
810
|
+
}
|
|
811
|
+
this.varTrail.length = varLim;
|
|
812
|
+
this.scopes.length -= numScopes;
|
|
813
|
+
}
|
|
814
|
+
|
|
815
|
+
// user_push: the scope literal of the sat solver gets a fresh constant, out of the egraph.
|
|
816
|
+
userPush() {
|
|
817
|
+
this.push();
|
|
818
|
+
const manager = this.manager;
|
|
819
|
+
const guard = manager.mkFreshConst("sat.scope", SORT_BOOL);
|
|
820
|
+
manager.incRef(guard);
|
|
821
|
+
this.trail.push(() => manager.decRef(guard));
|
|
822
|
+
this.setBoolVar2expr(this.s.userScopeLiterals[this.scopes.length - 1] >> 1, guard);
|
|
823
|
+
}
|
|
824
|
+
|
|
825
|
+
userPop(numScopes: number) {
|
|
826
|
+
this.pop(numScopes);
|
|
827
|
+
}
|
|
828
|
+
|
|
829
|
+
private startReinit() {
|
|
830
|
+
this.reinits = [];
|
|
831
|
+
for (const boolVar of this.s.varsToReinit) {
|
|
832
|
+
const expr = this.boolVar2exprs[boolVar];
|
|
833
|
+
if (expr === undefined) continue;
|
|
834
|
+
this.manager.incRef(expr);
|
|
835
|
+
this.reinits.push({
|
|
836
|
+
expr,
|
|
837
|
+
generation: this.getEnode(expr)?.generation ?? 0,
|
|
838
|
+
boolVar,
|
|
839
|
+
});
|
|
840
|
+
}
|
|
841
|
+
}
|
|
842
|
+
|
|
843
|
+
popReinit() {
|
|
844
|
+
this.finishReinit();
|
|
845
|
+
for (const solver of this.solvers) solver.popReinit();
|
|
846
|
+
}
|
|
847
|
+
|
|
848
|
+
private finishReinit() {
|
|
849
|
+
if (this.reinits.length === 0) return;
|
|
850
|
+
const manager = this.manager;
|
|
851
|
+
const si = this.si;
|
|
852
|
+
const replay = new Map<number, number>();
|
|
853
|
+
for (const reinit of this.reinits) replay.set(reinit.expr, reinit.boolVar);
|
|
854
|
+
si.setExpr2VarReplay(replay);
|
|
855
|
+
// scoped_suspend_rlimit: the replay runs to its end even when the limit is spent.
|
|
856
|
+
const limit = manager.limit;
|
|
857
|
+
const wasSuspended = limit.isSuspended;
|
|
858
|
+
limit.isSuspended = true;
|
|
859
|
+
try {
|
|
860
|
+
for (const reinit of this.reinits) {
|
|
861
|
+
const expr = reinit.expr;
|
|
862
|
+
const oldGeneration = this.generation;
|
|
863
|
+
this.generation = reinit.generation;
|
|
864
|
+
const lit = si.isBoolOp(expr) ? 2 * (replay.get(expr) as number) : si.internalize(expr);
|
|
865
|
+
const isConnective =
|
|
866
|
+
manager.getFamily(expr) === FAMILY_BASIC &&
|
|
867
|
+
(si.isBoolOp(expr) ||
|
|
868
|
+
(manager.getOp(expr) === OP_EQ && manager.isBool(manager.getArg(expr, 0))));
|
|
869
|
+
if (this.egraph.find(expr) === undefined && !isConnective) {
|
|
870
|
+
const args = manager.isApp(expr)
|
|
871
|
+
? manager.getArgs(expr).map((arg) => this.eInternalize(arg))
|
|
872
|
+
: [];
|
|
873
|
+
this.internalizeTerm(expr);
|
|
874
|
+
if (this.egraph.find(expr) === undefined) this.mkEnode(expr, args);
|
|
875
|
+
} else this.attachLit(lit, expr);
|
|
876
|
+
this.generation = oldGeneration;
|
|
877
|
+
}
|
|
878
|
+
} finally {
|
|
879
|
+
limit.isSuspended = wasSuspended;
|
|
880
|
+
}
|
|
881
|
+
for (const entry of replay)
|
|
882
|
+
if (si.isBoolOp(entry[0]) && !si.isCached(entry[0], 2 * entry[1]))
|
|
883
|
+
si.cache(entry[0], 2 * entry[1]);
|
|
884
|
+
si.setExpr2VarReplay(null);
|
|
885
|
+
for (const reinit of this.reinits) manager.decRef(reinit.expr);
|
|
886
|
+
this.reinits = [];
|
|
887
|
+
}
|
|
888
|
+
|
|
889
|
+
isRelevant() {
|
|
890
|
+
return true;
|
|
891
|
+
}
|
|
892
|
+
|
|
893
|
+
getPhase(boolVar: number) {
|
|
894
|
+
return this.boolVar2solver(boolVar)?.getPhase(boolVar) ?? L_UNDEF;
|
|
895
|
+
}
|
|
896
|
+
|
|
897
|
+
isExternal(boolVar: number) {
|
|
898
|
+
if (this.s.isExternal(boolVar) || this.boolVar2exprs[boolVar] !== undefined) return true;
|
|
899
|
+
return this.solvers.some((solver) => solver.isExternal(boolVar));
|
|
900
|
+
}
|
|
901
|
+
|
|
902
|
+
initSearch() {
|
|
903
|
+
this.reasonUnknown = "";
|
|
904
|
+
for (const solver of this.solvers) solver.initSearch();
|
|
905
|
+
}
|
|
906
|
+
|
|
907
|
+
preSimplify() {
|
|
908
|
+
for (const solver of this.solvers) solver.preSimplify();
|
|
909
|
+
}
|
|
910
|
+
|
|
911
|
+
simplify() {
|
|
912
|
+
for (const solver of this.solvers) solver.simplify();
|
|
913
|
+
}
|
|
914
|
+
|
|
915
|
+
gc() {}
|
|
916
|
+
|
|
917
|
+
setRoot() {
|
|
918
|
+
return false;
|
|
919
|
+
}
|
|
920
|
+
|
|
921
|
+
flushRoots() {
|
|
922
|
+
for (const solver of this.solvers) solver.flushRoots();
|
|
923
|
+
}
|
|
924
|
+
|
|
925
|
+
initUseList() {}
|
|
926
|
+
|
|
927
|
+
findMutexes() {}
|
|
928
|
+
|
|
929
|
+
// Every theory solver but pb's returns false from to_formulas, which ends the walk.
|
|
930
|
+
toFormulas(_lit2expr: (lit: number) => number, formulas: number[]) {
|
|
931
|
+
if (this.solvers.length > 0) return;
|
|
932
|
+
for (const node of this.egraph.nodes)
|
|
933
|
+
if (node.root !== node) formulas.push(this.manager.mkEq(node.owner, node.root.owner));
|
|
934
|
+
}
|
|
935
|
+
|
|
936
|
+
saveModel(model: ProtoModel | null) {
|
|
937
|
+
model?.incRef();
|
|
938
|
+
this.qmodel?.decRef();
|
|
939
|
+
this.qmodel = model;
|
|
940
|
+
}
|
|
941
|
+
|
|
942
|
+
updateModel(model: ProtoModel) {
|
|
943
|
+
if (this.qmodel !== null) return this.qmodel;
|
|
944
|
+
model.resetEvalCache();
|
|
945
|
+
for (const solver of this.solvers) solver.initModel();
|
|
946
|
+
this.values = [];
|
|
947
|
+
this.values2rootMap = null;
|
|
948
|
+
const userSorts = new UserSortValues(this.manager);
|
|
949
|
+
const deps = new EnodeTopSort(this.manager);
|
|
950
|
+
this.collectDependencies(userSorts, deps);
|
|
951
|
+
deps.sort();
|
|
952
|
+
this.dependencies2values(userSorts, deps, model);
|
|
953
|
+
this.values2model(deps, model);
|
|
954
|
+
for (const solver of this.solvers) solver.finalizeModel(model);
|
|
955
|
+
userSorts.registerWith(model);
|
|
956
|
+
return model;
|
|
957
|
+
}
|
|
958
|
+
|
|
959
|
+
// validate_model, for its side effect: evaluating an application of a partial theory function,
|
|
960
|
+
// such as a division by zero, completes its interpretation with some value.
|
|
961
|
+
validateModel(model: ProtoModel) {
|
|
962
|
+
if (this.hasUnhandled() || this.solvers.some((solver) => solver.hasUnhandled())) return;
|
|
963
|
+
const manager = this.manager;
|
|
964
|
+
for (const node of this.egraph.nodes) {
|
|
965
|
+
const expr = node.owner;
|
|
966
|
+
if (!manager.isBool(expr) || manager.hasQuantifierFlags[expr] === 1) continue;
|
|
967
|
+
if (node.boolVar === NULL_BOOL_VAR) continue;
|
|
968
|
+
const value = model.eval(expr, false);
|
|
969
|
+
if (
|
|
970
|
+
this.s.value(2 * node.boolVar) === L_TRUE ? manager.isFalse(value) : manager.isTrue(value)
|
|
971
|
+
)
|
|
972
|
+
throw new SmtInvariantError("the euf model falsifies an assignment");
|
|
973
|
+
}
|
|
974
|
+
}
|
|
975
|
+
|
|
976
|
+
private includeFuncInterp(decl: number) {
|
|
977
|
+
const info = this.manager.funcDecls[decl];
|
|
978
|
+
if (info.family === FAMILY_USER) return true;
|
|
979
|
+
if (info.family === FAMILY_BASIC || info.isSkolem) return false;
|
|
980
|
+
return this.decl2solver(decl)?.includeFuncInterp(decl) === true;
|
|
981
|
+
}
|
|
982
|
+
|
|
983
|
+
private collectDependencies(userSorts: UserSortValues, deps: EnodeTopSort) {
|
|
984
|
+
const manager = this.manager;
|
|
985
|
+
const freshValues: Enode[] = [];
|
|
986
|
+
const nodes = this.egraph.nodes;
|
|
987
|
+
for (const node of nodes) {
|
|
988
|
+
const expr = node.owner;
|
|
989
|
+
const sort = manager.sorts[expr];
|
|
990
|
+
const solver = this.sort2solver(sort);
|
|
991
|
+
if (solver === null) deps.insert(node, null);
|
|
992
|
+
else if (!solver.addDep(node, deps.deps)) freshValues.push(node);
|
|
993
|
+
if (node.isRoot && manager.isUninterpretedSort(sort) && manager.isValue(expr))
|
|
994
|
+
userSorts.registerValue(expr);
|
|
995
|
+
}
|
|
996
|
+
for (const node of freshValues) deps.insert(node, null);
|
|
997
|
+
const freshSet = new Set(freshValues);
|
|
998
|
+
for (const node of freshValues)
|
|
999
|
+
for (const root of nodes)
|
|
1000
|
+
if (
|
|
1001
|
+
root.isRoot &&
|
|
1002
|
+
manager.sorts[root.owner] === manager.sorts[node.owner] &&
|
|
1003
|
+
!freshSet.has(root)
|
|
1004
|
+
)
|
|
1005
|
+
addDependency(deps.deps, node, root);
|
|
1006
|
+
}
|
|
1007
|
+
|
|
1008
|
+
private dependencies2values(userSorts: UserSortValues, deps: EnodeTopSort, model: ProtoModel) {
|
|
1009
|
+
const manager = this.manager;
|
|
1010
|
+
const values = this.values;
|
|
1011
|
+
for (const node of deps.sorted) {
|
|
1012
|
+
const id = node.root.owner;
|
|
1013
|
+
if (values[id] !== undefined) continue;
|
|
1014
|
+
const expr = node.owner;
|
|
1015
|
+
if (manager.isBool(expr)) {
|
|
1016
|
+
if (manager.isUninterpretedConst(expr)) {
|
|
1017
|
+
const interp = model.constInterps.get(manager.decls[expr]);
|
|
1018
|
+
if (interp !== undefined) {
|
|
1019
|
+
values[id] = interp;
|
|
1020
|
+
continue;
|
|
1021
|
+
}
|
|
1022
|
+
}
|
|
1023
|
+
if (manager.isTrue(expr) || manager.isFalse(expr)) {
|
|
1024
|
+
values[id] = expr;
|
|
1025
|
+
continue;
|
|
1026
|
+
}
|
|
1027
|
+
const value =
|
|
1028
|
+
node.value !== L_UNDEF
|
|
1029
|
+
? node.value
|
|
1030
|
+
: node.boolVar === NULL_BOOL_VAR
|
|
1031
|
+
? L_UNDEF
|
|
1032
|
+
: this.s.value(2 * node.boolVar);
|
|
1033
|
+
if (value !== L_UNDEF) values[id] = value === L_TRUE ? manager.trueExpr : manager.falseExpr;
|
|
1034
|
+
continue;
|
|
1035
|
+
}
|
|
1036
|
+
const sort = manager.sorts[expr];
|
|
1037
|
+
if (manager.isUninterpretedSort(sort)) {
|
|
1038
|
+
userSorts.add(node.root, sort, values);
|
|
1039
|
+
continue;
|
|
1040
|
+
}
|
|
1041
|
+
const solver = this.sort2solver(sort) ?? this.expr2solver(expr);
|
|
1042
|
+
if (solver !== null) solver.addValue(node, model, values);
|
|
1043
|
+
else if (manager.isApp(expr) && manager.getFamily(expr) !== FAMILY_BASIC) values[id] = expr;
|
|
1044
|
+
}
|
|
1045
|
+
}
|
|
1046
|
+
|
|
1047
|
+
private values2model(deps: EnodeTopSort, model: ProtoModel) {
|
|
1048
|
+
const manager = this.manager;
|
|
1049
|
+
const values = this.values;
|
|
1050
|
+
for (const node of deps.sorted) {
|
|
1051
|
+
const expr = node.owner;
|
|
1052
|
+
if (!manager.isApp(expr)) continue;
|
|
1053
|
+
const decl = manager.decls[expr];
|
|
1054
|
+
if (!this.includeFuncInterp(decl)) continue;
|
|
1055
|
+
if (
|
|
1056
|
+
manager.isBool(expr) &&
|
|
1057
|
+
manager.isUninterpretedConst(expr) &&
|
|
1058
|
+
model.constInterps.has(decl)
|
|
1059
|
+
)
|
|
1060
|
+
continue;
|
|
1061
|
+
const value = values[node.root.owner];
|
|
1062
|
+
if (value === undefined) continue;
|
|
1063
|
+
const arity = node.numArgs;
|
|
1064
|
+
if (arity === 0) {
|
|
1065
|
+
model.registerConst(decl, value);
|
|
1066
|
+
continue;
|
|
1067
|
+
}
|
|
1068
|
+
let interp = model.funcInterps.get(decl);
|
|
1069
|
+
if (interp === undefined) {
|
|
1070
|
+
interp = new FuncInterp(manager, arity);
|
|
1071
|
+
model.registerFunc(decl, interp);
|
|
1072
|
+
}
|
|
1073
|
+
const args = manager
|
|
1074
|
+
.getArgs(expr)
|
|
1075
|
+
.map((arg) => values[(this.getEnode(arg) as Enode).root.owner] as number);
|
|
1076
|
+
if (interp.getEntry(args) === undefined) interp.insertNewEntry(args, value);
|
|
1077
|
+
}
|
|
1078
|
+
}
|
|
1079
|
+
|
|
1080
|
+
modelUpdated(model: ProtoModel) {
|
|
1081
|
+
this.values2rootMap = null;
|
|
1082
|
+
for (const node of this.egraph.nodes)
|
|
1083
|
+
if (node.isRoot && this.values[node.owner] !== undefined)
|
|
1084
|
+
this.values[node.owner] = model.eval(node.owner, false);
|
|
1085
|
+
}
|
|
1086
|
+
|
|
1087
|
+
values2root() {
|
|
1088
|
+
if (this.values2rootMap !== null) return this.values2rootMap;
|
|
1089
|
+
const map = new Map<number, Enode>();
|
|
1090
|
+
for (const node of this.egraph.nodes) {
|
|
1091
|
+
const value = this.values[node.owner];
|
|
1092
|
+
if (node.isRoot && value !== undefined) map.set(value, node);
|
|
1093
|
+
}
|
|
1094
|
+
this.values2rootMap = map;
|
|
1095
|
+
return map;
|
|
1096
|
+
}
|
|
1097
|
+
|
|
1098
|
+
node2value(node: Enode) {
|
|
1099
|
+
return this.values[node.root.owner];
|
|
1100
|
+
}
|
|
1101
|
+
}
|
|
1102
|
+
|
|
1103
|
+
// euf::solver::user_sort: the universe of each uninterpreted sort, with fresh values from a
|
|
1104
|
+
// user_sort_factory.
|
|
1105
|
+
class UserSortValues {
|
|
1106
|
+
private sort2values = new Map<number, number[]>();
|
|
1107
|
+
private registered = new Map<number, Set<number>>();
|
|
1108
|
+
private next = new Map<number, number>();
|
|
1109
|
+
|
|
1110
|
+
constructor(private manager: AstManager) {}
|
|
1111
|
+
|
|
1112
|
+
registerValue(value: number) {
|
|
1113
|
+
const sort = this.manager.sorts[value];
|
|
1114
|
+
const set = this.registered.get(sort) ?? new Set<number>();
|
|
1115
|
+
this.registered.set(sort, set);
|
|
1116
|
+
set.add(value);
|
|
1117
|
+
}
|
|
1118
|
+
|
|
1119
|
+
private getFreshValue(sort: number) {
|
|
1120
|
+
const set = this.registered.get(sort) ?? new Set<number>();
|
|
1121
|
+
this.registered.set(sort, set);
|
|
1122
|
+
for (let index = this.next.get(sort) ?? 0; ; index++) {
|
|
1123
|
+
const value = this.manager.mkModelValue(index, sort);
|
|
1124
|
+
if (set.has(value)) continue;
|
|
1125
|
+
set.add(value);
|
|
1126
|
+
this.next.set(sort, index + 1);
|
|
1127
|
+
return value;
|
|
1128
|
+
}
|
|
1129
|
+
}
|
|
1130
|
+
|
|
1131
|
+
add(root: Enode, sort: number, values: (number | undefined)[]) {
|
|
1132
|
+
const value = this.manager.isValue(root.owner) ? root.owner : this.getFreshValue(sort);
|
|
1133
|
+
values[root.owner] = value;
|
|
1134
|
+
const sortValues = this.sort2values.get(sort) ?? [];
|
|
1135
|
+
this.sort2values.set(sort, sortValues);
|
|
1136
|
+
sortValues.push(value);
|
|
1137
|
+
}
|
|
1138
|
+
|
|
1139
|
+
registerWith(model: ProtoModel) {
|
|
1140
|
+
for (const entry of this.sort2values) {
|
|
1141
|
+
for (const value of entry[1]) model.registerValue(value);
|
|
1142
|
+
model.registerUsort(entry[0], entry[1]);
|
|
1143
|
+
}
|
|
1144
|
+
}
|
|
1145
|
+
}
|
|
1146
|
+
|
|
1147
|
+
// top_sort<enode>: the nodes ordered so that each comes after the nodes it depends on.
|
|
1148
|
+
class EnodeTopSort {
|
|
1149
|
+
readonly deps: Dependencies = new Map();
|
|
1150
|
+
readonly sorted: Enode[] = [];
|
|
1151
|
+
private partitions = new Map<Enode, number>();
|
|
1152
|
+
private dfsNums = new Map<Enode, number>();
|
|
1153
|
+
private stackS: Enode[] = [];
|
|
1154
|
+
private stackP: Enode[] = [];
|
|
1155
|
+
|
|
1156
|
+
constructor(private manager: AstManager) {}
|
|
1157
|
+
|
|
1158
|
+
insert(node: Enode, deps: Enode[] | null) {
|
|
1159
|
+
this.deps.set(node, deps);
|
|
1160
|
+
}
|
|
1161
|
+
|
|
1162
|
+
sort() {
|
|
1163
|
+
for (const node of this.deps.keys()) this.traverse(node);
|
|
1164
|
+
}
|
|
1165
|
+
|
|
1166
|
+
private traverse(node: Enode) {
|
|
1167
|
+
const dfsNum = this.dfsNums.get(node);
|
|
1168
|
+
if (dfsNum !== undefined) {
|
|
1169
|
+
if (this.partitions.has(node)) return;
|
|
1170
|
+
for (
|
|
1171
|
+
let top = this.stackP.at(-1);
|
|
1172
|
+
top !== undefined && (this.partitions.get(top) ?? -1) > dfsNum;
|
|
1173
|
+
top = this.stackP.at(-1)
|
|
1174
|
+
)
|
|
1175
|
+
this.stackP.pop();
|
|
1176
|
+
return;
|
|
1177
|
+
}
|
|
1178
|
+
if (!this.deps.has(node)) return;
|
|
1179
|
+
this.dfsNums.set(node, this.dfsNums.size);
|
|
1180
|
+
this.stackS.push(node);
|
|
1181
|
+
this.stackP.push(node);
|
|
1182
|
+
const deps = this.deps.get(node);
|
|
1183
|
+
if (deps !== null && deps !== undefined)
|
|
1184
|
+
for (const dep of sortByExprId(this.manager, deps)) this.traverse(dep);
|
|
1185
|
+
if (node !== this.stackP.at(-1)) return;
|
|
1186
|
+
const partition = this.sorted.length;
|
|
1187
|
+
for (let top = this.stackS.pop(); top !== undefined; top = this.stackS.pop()) {
|
|
1188
|
+
this.sorted.push(top);
|
|
1189
|
+
this.partitions.set(top, partition);
|
|
1190
|
+
if (top === node) break;
|
|
1191
|
+
}
|
|
1192
|
+
this.stackP.pop();
|
|
1193
|
+
}
|
|
1194
|
+
}
|
|
1195
|
+
|
|
1196
|
+
// An obj_hashtable<enode> iterates its nodes by hash, which is the id of their expression.
|
|
1197
|
+
const sortByExprId = (manager: AstManager, nodes: readonly Enode[]) => {
|
|
1198
|
+
const table = new ObjHashtable((expr) => manager.ids[expr]);
|
|
1199
|
+
const byId = new Map<number, Enode>();
|
|
1200
|
+
for (const node of nodes) {
|
|
1201
|
+
table.add(node.owner);
|
|
1202
|
+
byId.set(node.owner, node);
|
|
1203
|
+
}
|
|
1204
|
+
return [...table].map((id) => byId.get(id) as Enode);
|
|
1205
|
+
};
|