tla-ts 0.0.4 → 0.0.5-dev.552d313
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 +38 -127
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +46 -12
- package/dist/index.d.ts +46 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +76 -92
- package/dist/transfer.js +76 -92
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1153
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +115 -721
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +43 -22
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +97 -35
- package/src/evaluate.ts +361 -181
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +10 -0
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +207 -141
- package/src/liveness.ts +38 -34
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +172 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +39 -51
- package/src/parallel.ts +39 -66
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +645 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +21 -22
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +39 -23
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -190
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/transfer.ts +32 -32
- package/src/values.ts +166 -111
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/canonical.ts +0 -40
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
|
@@ -0,0 +1,572 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt. The instantiation
|
|
2
|
+
// sets and the AUF solver of the model finder: the solver groups the argument positions and
|
|
3
|
+
// variables that must share an instantiation set, and each group gets a projection function that
|
|
4
|
+
// maps any value to the value of a term in its set.
|
|
5
|
+
import { SmtInvariantError } from "../../../errors";
|
|
6
|
+
import { OP_ITE, OP_LT, SORT_BOOL, SORT_INT, isArithSort, type AstManager } from "./ast";
|
|
7
|
+
import { combineHash } from "./hash";
|
|
8
|
+
import { ObjHashtable, ObjMap } from "./hashtable";
|
|
9
|
+
import { FuncInterp, type ProtoModel } from "./proto-model";
|
|
10
|
+
import { RandomGen } from "./random-gen";
|
|
11
|
+
import { RefVector } from "./ref-vector";
|
|
12
|
+
import { Rewriter } from "./rewriter";
|
|
13
|
+
|
|
14
|
+
export type Evaluate = (expr: number) => number | null;
|
|
15
|
+
|
|
16
|
+
// instantiation_set: the S_{k,j} sets of the paper, with the generation of each term. The set holds
|
|
17
|
+
// its terms.
|
|
18
|
+
export class InstantiationSet {
|
|
19
|
+
readonly elems: ObjMap<number>;
|
|
20
|
+
readonly inv: ObjMap<number>;
|
|
21
|
+
|
|
22
|
+
constructor(private manager: AstManager) {
|
|
23
|
+
const getHash = (expr: number) => manager.hashes[expr];
|
|
24
|
+
this.elems = new ObjMap(getHash);
|
|
25
|
+
this.inv = new ObjMap(getHash);
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
insert(expr: number, generation: number) {
|
|
29
|
+
if (this.elems.has(expr) || this.manager.containsModelValue(expr)) return;
|
|
30
|
+
this.manager.incRef(expr);
|
|
31
|
+
this.elems.set(expr, generation);
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
remove(expr: number) {
|
|
35
|
+
this.elems.delete(expr);
|
|
36
|
+
this.manager.decRef(expr);
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
// ~instantiation_set.
|
|
40
|
+
release() {
|
|
41
|
+
for (const entry of this.elems) this.manager.decRef(entry[0]);
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
getInv(value: number, model: ProtoModel) {
|
|
45
|
+
const term = this.inv.get(value);
|
|
46
|
+
if (term !== undefined) return term;
|
|
47
|
+
for (const entry of this.inv) if (model.areEqual(entry[0], value)) return entry[1];
|
|
48
|
+
return undefined;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
getGeneration(term: number) {
|
|
52
|
+
return this.elems.get(term) ?? 0;
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
mkInverse(evaluate: Evaluate) {
|
|
56
|
+
for (const entry of this.elems) {
|
|
57
|
+
const value = evaluate(entry[0]);
|
|
58
|
+
if (value === null) break;
|
|
59
|
+
const old = this.inv.get(value);
|
|
60
|
+
if (old === undefined || entry[1] < (this.elems.get(old) ?? 0)) this.inv.set(value, entry[0]);
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
// node: a set of argument positions and variables that share an instantiation set.
|
|
66
|
+
export class Node {
|
|
67
|
+
private find: Node | null = null;
|
|
68
|
+
private eqcSize = 1;
|
|
69
|
+
private isMono = false;
|
|
70
|
+
private avoidSet: Node[] = [];
|
|
71
|
+
private exceptions: number[] = [];
|
|
72
|
+
private set: InstantiationSet | null = null;
|
|
73
|
+
private elseExpr: number | null = null;
|
|
74
|
+
private proj: number | null = null;
|
|
75
|
+
|
|
76
|
+
constructor(
|
|
77
|
+
readonly id: number,
|
|
78
|
+
readonly sort: number,
|
|
79
|
+
) {}
|
|
80
|
+
|
|
81
|
+
isRoot() {
|
|
82
|
+
return this.find === null;
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
getRoot(): Node {
|
|
86
|
+
return this.find === null ? this : this.find.getRoot();
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
merge(other: Node) {
|
|
90
|
+
let first = this.getRoot();
|
|
91
|
+
let second = other.getRoot();
|
|
92
|
+
if (first === second) return;
|
|
93
|
+
if (first.eqcSize > second.eqcSize) [first, second] = [second, first];
|
|
94
|
+
first.find = second;
|
|
95
|
+
second.eqcSize += first.eqcSize;
|
|
96
|
+
second.isMono = second.isMono || first.isMono;
|
|
97
|
+
second.avoidSet = appendNew(second.avoidSet, first.avoidSet);
|
|
98
|
+
second.exceptions = appendNew(second.exceptions, first.exceptions);
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
insertAvoid(node: Node) {
|
|
102
|
+
const root = this.getRoot();
|
|
103
|
+
if (!root.avoidSet.includes(node)) root.avoidSet.push(node);
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
insertException(expr: number) {
|
|
107
|
+
const root = this.getRoot();
|
|
108
|
+
if (!root.exceptions.includes(expr)) root.exceptions.push(expr);
|
|
109
|
+
}
|
|
110
|
+
|
|
111
|
+
setMonoProj() {
|
|
112
|
+
this.getRoot().isMono = true;
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
isMonoProj() {
|
|
116
|
+
return this.getRoot().isMono;
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
mkInstantiationSet(manager: AstManager) {
|
|
120
|
+
this.set = new InstantiationSet(manager);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
// ~node.
|
|
124
|
+
release() {
|
|
125
|
+
this.set?.release();
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
// Only closed terms join the set.
|
|
129
|
+
insert(manager: AstManager, expr: number, generation: number) {
|
|
130
|
+
if (manager.isGround(expr)) this.getRoot().set?.insert(expr, generation);
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
getInstantiationSet() {
|
|
134
|
+
const set = this.getRoot().set;
|
|
135
|
+
if (set === null) throw new SmtInvariantError("the instantiation set was not created");
|
|
136
|
+
return set;
|
|
137
|
+
}
|
|
138
|
+
|
|
139
|
+
getExceptions() {
|
|
140
|
+
return this.getRoot().exceptions;
|
|
141
|
+
}
|
|
142
|
+
|
|
143
|
+
getAvoidSet() {
|
|
144
|
+
return this.getRoot().avoidSet;
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
setElse(expr: number) {
|
|
148
|
+
this.getRoot().elseExpr = expr;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
getElse() {
|
|
152
|
+
return this.getRoot().elseExpr;
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
setProj(decl: number) {
|
|
156
|
+
this.getRoot().proj = decl;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
getProj() {
|
|
160
|
+
return this.getRoot().proj;
|
|
161
|
+
}
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
const appendNew = <T>(target: T[], source: T[]) => {
|
|
165
|
+
if (source.length === 0) return target;
|
|
166
|
+
if (target.length === 0) return source;
|
|
167
|
+
for (const item of source) if (!target.includes(item)) target.push(item);
|
|
168
|
+
return target;
|
|
169
|
+
};
|
|
170
|
+
|
|
171
|
+
interface AFINode {
|
|
172
|
+
decl: number;
|
|
173
|
+
index: number;
|
|
174
|
+
node: Node;
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
// The number that keys an argument position of a declaration in m_A_f_is.
|
|
178
|
+
const ARITY_BOUND = 2 ** 20;
|
|
179
|
+
const getAFIKey = (decl: number, index: number) => decl * ARITY_BOUND + index;
|
|
180
|
+
|
|
181
|
+
// auf_solver: the "almost uninterpreted fragment" of the paper.
|
|
182
|
+
export class AufSolver {
|
|
183
|
+
private nodes: Node[] = [];
|
|
184
|
+
private uvars = new Map<string, Node>();
|
|
185
|
+
// m_A_f_is, a table in Z3's slot order, hashed like pair_hash of the declaration and position.
|
|
186
|
+
private aFIs: ObjMap<AFINode>;
|
|
187
|
+
private sort2k = new Map<number, number>();
|
|
188
|
+
// m_ks, the range of m_sort2k.
|
|
189
|
+
private ks: RefVector;
|
|
190
|
+
private model: ProtoModel | null = null;
|
|
191
|
+
// m_eval_cache for each model completion flag, and m_eval_cache_range, which holds the results.
|
|
192
|
+
private evalCache = [new Map<number, number>(), new Map<number, number>()];
|
|
193
|
+
private evalCacheRange: RefVector;
|
|
194
|
+
private rootNodes: Node[] = [];
|
|
195
|
+
private newConstraints: number[] = [];
|
|
196
|
+
// m_rand, seeded with the steps the resource limit counted before the solver was made, which
|
|
197
|
+
// then counts one more.
|
|
198
|
+
private random: RandomGen;
|
|
199
|
+
constructor(
|
|
200
|
+
private manager: AstManager,
|
|
201
|
+
readonly rewriter: Rewriter,
|
|
202
|
+
) {
|
|
203
|
+
this.evalCacheRange = new RefVector(manager);
|
|
204
|
+
this.ks = new RefVector(manager);
|
|
205
|
+
this.random = new RandomGen(manager.limit.count >>> 0);
|
|
206
|
+
manager.limit.inc();
|
|
207
|
+
this.aFIs = new ObjMap((key) =>
|
|
208
|
+
combineHash(manager.getDeclHash(Math.floor(key / ARITY_BOUND)), key % ARITY_BOUND),
|
|
209
|
+
);
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
reset() {
|
|
213
|
+
for (const node of this.nodes) node.release();
|
|
214
|
+
this.nodes = [];
|
|
215
|
+
this.uvars.clear();
|
|
216
|
+
this.aFIs.clear();
|
|
217
|
+
this.rootNodes = [];
|
|
218
|
+
this.sort2k.clear();
|
|
219
|
+
this.ks.reset();
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
setModel(model: ProtoModel) {
|
|
223
|
+
this.resetEvalCache();
|
|
224
|
+
this.model = model;
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
private getModel() {
|
|
228
|
+
if (this.model === null) throw new SmtInvariantError("the model finder has no model");
|
|
229
|
+
return this.model;
|
|
230
|
+
}
|
|
231
|
+
|
|
232
|
+
private resetEvalCache() {
|
|
233
|
+
this.evalCache[0].clear();
|
|
234
|
+
this.evalCache[1].clear();
|
|
235
|
+
this.evalCacheRange.reset();
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private mkNode(key: string, map: Map<string, Node>, sort: number) {
|
|
239
|
+
const existing = map.get(key);
|
|
240
|
+
if (existing !== undefined) return existing;
|
|
241
|
+
const node = new Node(this.nodes.length, sort);
|
|
242
|
+
map.set(key, node);
|
|
243
|
+
this.nodes.push(node);
|
|
244
|
+
return node;
|
|
245
|
+
}
|
|
246
|
+
|
|
247
|
+
getUvar(quantifier: number, index: number) {
|
|
248
|
+
const sorts = this.manager.getQuantifier(quantifier).sorts;
|
|
249
|
+
return this.mkNode(`${quantifier}:${index}`, this.uvars, sorts[sorts.length - index - 1]);
|
|
250
|
+
}
|
|
251
|
+
|
|
252
|
+
getAFI(decl: number, index: number) {
|
|
253
|
+
const key = getAFIKey(decl, index);
|
|
254
|
+
const existing = this.aFIs.get(key);
|
|
255
|
+
if (existing !== undefined) return existing.node;
|
|
256
|
+
const node = new Node(this.nodes.length, this.manager.funcDecls[decl].domain[index]);
|
|
257
|
+
this.nodes.push(node);
|
|
258
|
+
this.aFIs.set(key, { decl, index, node });
|
|
259
|
+
return node;
|
|
260
|
+
}
|
|
261
|
+
|
|
262
|
+
getUvarInstSet(quantifier: number, index: number) {
|
|
263
|
+
return this.uvars.get(`${quantifier}:${index}`)?.getInstantiationSet() ?? null;
|
|
264
|
+
}
|
|
265
|
+
|
|
266
|
+
mkInstantiationSets() {
|
|
267
|
+
for (const node of this.nodes) if (node.isRoot()) node.mkInstantiationSet(this.manager);
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
// cleanup_instantiation_sets: drops the terms that do not evaluate to values.
|
|
271
|
+
private cleanupInstantiationSets() {
|
|
272
|
+
const manager = this.manager;
|
|
273
|
+
for (const node of this.nodes) {
|
|
274
|
+
if (!node.isRoot()) continue;
|
|
275
|
+
const set = node.getInstantiationSet();
|
|
276
|
+
const toDelete: number[] = [];
|
|
277
|
+
for (const term of set.elems.keys()) {
|
|
278
|
+
const value = this.eval(term, true);
|
|
279
|
+
if (value === null || !manager.isUniqueValue(value)) toDelete.push(term);
|
|
280
|
+
}
|
|
281
|
+
for (const term of toDelete) set.remove(term);
|
|
282
|
+
this.resetEvalCache();
|
|
283
|
+
}
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
eval(expr: number, isModelCompletion: boolean) {
|
|
287
|
+
const cache = this.evalCache[isModelCompletion ? 1 : 0];
|
|
288
|
+
const cached = cache.get(expr);
|
|
289
|
+
if (cached !== undefined) return cached;
|
|
290
|
+
const result = this.getModel().eval(expr, isModelCompletion);
|
|
291
|
+
cache.set(expr, result);
|
|
292
|
+
this.evalCacheRange.pushOwned(result);
|
|
293
|
+
return result;
|
|
294
|
+
}
|
|
295
|
+
|
|
296
|
+
private collectExceptionsValues(node: Node) {
|
|
297
|
+
const result: number[] = [];
|
|
298
|
+
for (const expr of node.getExceptions()) {
|
|
299
|
+
const value = this.eval(expr, true);
|
|
300
|
+
if (value !== null) result.push(value);
|
|
301
|
+
}
|
|
302
|
+
for (const avoid of node.getAvoidSet()) {
|
|
303
|
+
const root = avoid.getRoot();
|
|
304
|
+
const elseExpr = root.getElse();
|
|
305
|
+
if (!root.isMonoProj() && elseExpr !== null) {
|
|
306
|
+
const value = this.eval(elseExpr, true);
|
|
307
|
+
if (value !== null) result.push(value);
|
|
308
|
+
}
|
|
309
|
+
}
|
|
310
|
+
return result;
|
|
311
|
+
}
|
|
312
|
+
|
|
313
|
+
private areDistinct(first: number, second: number) {
|
|
314
|
+
const manager = this.manager;
|
|
315
|
+
return first !== second && manager.isUniqueValue(first) && manager.isUniqueValue(second);
|
|
316
|
+
}
|
|
317
|
+
|
|
318
|
+
// pick_instance_diff_exceptions: the term of least generation whose value differs from every
|
|
319
|
+
// exception.
|
|
320
|
+
private pickInstanceDiffExceptions(node: Node, exceptionValues: number[]) {
|
|
321
|
+
let result: number | null = null;
|
|
322
|
+
let resultGeneration = Number.POSITIVE_INFINITY;
|
|
323
|
+
for (const entry of node.getInstantiationSet().elems) {
|
|
324
|
+
const value = this.eval(entry[0], true);
|
|
325
|
+
if (value === null) return result;
|
|
326
|
+
const isFound = exceptionValues.some((other) => !this.areDistinct(value, other));
|
|
327
|
+
if (!isFound && (result === null || entry[1] < resultGeneration)) {
|
|
328
|
+
result = entry[0];
|
|
329
|
+
resultGeneration = entry[1];
|
|
330
|
+
}
|
|
331
|
+
}
|
|
332
|
+
return result;
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
// Uninterpreted sorts are not assumed infinite in benchmarks with quantifiers.
|
|
336
|
+
private isInfinite(sort: number) {
|
|
337
|
+
return isArithSort(sort);
|
|
338
|
+
}
|
|
339
|
+
|
|
340
|
+
private getKFor(sort: number) {
|
|
341
|
+
const existing = this.sort2k.get(sort);
|
|
342
|
+
if (existing !== undefined) return existing;
|
|
343
|
+
const created = this.manager.mkFreshConst("k", sort);
|
|
344
|
+
this.getModel().registerAuxDecl(this.manager.decls[created]);
|
|
345
|
+
this.sort2k.set(sort, created);
|
|
346
|
+
this.ks.push(created);
|
|
347
|
+
return created;
|
|
348
|
+
}
|
|
349
|
+
|
|
350
|
+
private getKInterp(k: number) {
|
|
351
|
+
const model = this.getModel();
|
|
352
|
+
const decl = this.manager.decls[k];
|
|
353
|
+
const existing = model.constInterps.get(decl);
|
|
354
|
+
if (existing !== undefined) return existing;
|
|
355
|
+
const fresh = model.getFreshValue(this.manager.sorts[k]);
|
|
356
|
+
if (fresh === null) return null;
|
|
357
|
+
model.registerConst(decl, fresh);
|
|
358
|
+
return fresh;
|
|
359
|
+
}
|
|
360
|
+
|
|
361
|
+
private assertKDiseqExceptions(k: number, exceptions: number[]) {
|
|
362
|
+
const kValue = this.getKInterp(k);
|
|
363
|
+
if (kValue === null) return false;
|
|
364
|
+
for (const exception of exceptions) {
|
|
365
|
+
const value = this.eval(exception, true);
|
|
366
|
+
// The constraint cannot go into the context while the model is built, so it waits for the
|
|
367
|
+
// next restart.
|
|
368
|
+
if (value !== null && !this.areDistinct(kValue, value))
|
|
369
|
+
this.newConstraints.push(this.manager.mkNot(this.manager.mkEq(k, exception)));
|
|
370
|
+
}
|
|
371
|
+
return true;
|
|
372
|
+
}
|
|
373
|
+
|
|
374
|
+
private setProjectionElse(node: Node) {
|
|
375
|
+
const set = node.getInstantiationSet();
|
|
376
|
+
const exceptions = node.getExceptions();
|
|
377
|
+
if (set.elems.size === 0) return;
|
|
378
|
+
if (exceptions.length > 0 || node.getAvoidSet().length > 0) {
|
|
379
|
+
const picked = this.pickInstanceDiffExceptions(node, this.collectExceptionsValues(node));
|
|
380
|
+
if (picked !== null) {
|
|
381
|
+
node.setElse(picked);
|
|
382
|
+
return;
|
|
383
|
+
}
|
|
384
|
+
if (this.isInfinite(node.sort)) {
|
|
385
|
+
const k = this.getKFor(node.sort);
|
|
386
|
+
if (this.assertKDiseqExceptions(k, exceptions)) {
|
|
387
|
+
node.insert(this.manager, k, 0);
|
|
388
|
+
node.setElse(k);
|
|
389
|
+
return;
|
|
390
|
+
}
|
|
391
|
+
}
|
|
392
|
+
}
|
|
393
|
+
node.setElse(set.elems.keys().next().value ?? 0);
|
|
394
|
+
}
|
|
395
|
+
|
|
396
|
+
// add_mono_exceptions: e - 1 and e + 1 join the set for each integer exception e.
|
|
397
|
+
private addMonoExceptions(node: Node) {
|
|
398
|
+
if (node.sort !== SORT_INT) return;
|
|
399
|
+
const rewriter = this.rewriter;
|
|
400
|
+
const one = this.manager.mkNumeral(1n);
|
|
401
|
+
for (const exception of node.getExceptions()) {
|
|
402
|
+
const minusOne = rewriter.mkSub(exception, one);
|
|
403
|
+
const plusOne = rewriter.mkAdd([exception, one]);
|
|
404
|
+
node.insert(this.manager, plusOne, 0);
|
|
405
|
+
node.insert(this.manager, minusOne, 0);
|
|
406
|
+
}
|
|
407
|
+
}
|
|
408
|
+
|
|
409
|
+
private getInstantiationSetValues(node: Node) {
|
|
410
|
+
const manager = this.manager;
|
|
411
|
+
const values: number[] = [];
|
|
412
|
+
const found = new Set<number>();
|
|
413
|
+
for (const term of node.getInstantiationSet().elems.keys()) {
|
|
414
|
+
const value = this.eval(term, true);
|
|
415
|
+
if (value === null) continue;
|
|
416
|
+
const isFound = !manager.isUniqueValue(value) && values.includes(value);
|
|
417
|
+
if (!isFound && !found.has(value)) {
|
|
418
|
+
values.push(value);
|
|
419
|
+
found.add(value);
|
|
420
|
+
}
|
|
421
|
+
}
|
|
422
|
+
return values;
|
|
423
|
+
}
|
|
424
|
+
|
|
425
|
+
private mkMonoProj(node: Node) {
|
|
426
|
+
const manager = this.manager;
|
|
427
|
+
this.addMonoExceptions(node);
|
|
428
|
+
const values = this.getInstantiationSetValues(node);
|
|
429
|
+
if (values.length === 0) return;
|
|
430
|
+
if (!isArithSort(node.sort) || !values.every((value) => manager.isNumeral(value))) return;
|
|
431
|
+
values.sort((first, second) =>
|
|
432
|
+
manager.getRationalValue(first).compare(manager.getRationalValue(second)),
|
|
433
|
+
);
|
|
434
|
+
const variable = manager.mkVar(0, node.sort);
|
|
435
|
+
let projection = values[values.length - 1];
|
|
436
|
+
for (let index = values.length - 1; index >= 1; index--)
|
|
437
|
+
projection = manager.mkApp(
|
|
438
|
+
OP_ITE,
|
|
439
|
+
[manager.mkApp(OP_LT, [variable, values[index]], SORT_BOOL), values[index - 1], projection],
|
|
440
|
+
node.sort,
|
|
441
|
+
);
|
|
442
|
+
const interp = new FuncInterp(manager, 1);
|
|
443
|
+
interp.setElse(projection);
|
|
444
|
+
const decl = manager.mkFreshFuncDecl(null, [node.sort], node.sort);
|
|
445
|
+
this.getModel().registerAuxDecl(decl, interp);
|
|
446
|
+
node.setProj(decl);
|
|
447
|
+
}
|
|
448
|
+
|
|
449
|
+
private mkSimpleProj(node: Node) {
|
|
450
|
+
const manager = this.manager;
|
|
451
|
+
this.setProjectionElse(node);
|
|
452
|
+
const values = this.getInstantiationSetValues(node);
|
|
453
|
+
const decl = manager.mkFreshFuncDecl(null, [node.sort], node.sort);
|
|
454
|
+
const interp = new FuncInterp(manager, 1);
|
|
455
|
+
this.getModel().registerAuxDecl(decl, interp);
|
|
456
|
+
const elseExpr = node.getElse();
|
|
457
|
+
if (elseExpr !== null) {
|
|
458
|
+
const elseValue = this.eval(elseExpr, true);
|
|
459
|
+
if (elseValue !== null) interp.setElse(elseValue);
|
|
460
|
+
}
|
|
461
|
+
for (const value of values) interp.insertNewEntry([value], value);
|
|
462
|
+
node.setProj(decl);
|
|
463
|
+
}
|
|
464
|
+
|
|
465
|
+
// collect_partial_funcs: a func_decl_set, in Z3's slot order.
|
|
466
|
+
private collectPartialFuncs() {
|
|
467
|
+
const manager = this.manager;
|
|
468
|
+
const model = this.getModel();
|
|
469
|
+
const result = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
470
|
+
for (const entry of this.aFIs.entries()) {
|
|
471
|
+
const decl = entry[1].decl;
|
|
472
|
+
if (result.has(decl)) continue;
|
|
473
|
+
let interp = model.funcInterps.get(decl);
|
|
474
|
+
if (interp === undefined) {
|
|
475
|
+
interp = new FuncInterp(manager, manager.funcDecls[decl].domain.length);
|
|
476
|
+
model.registerFunc(decl, interp);
|
|
477
|
+
}
|
|
478
|
+
if (interp.isPartial()) result.add(decl);
|
|
479
|
+
}
|
|
480
|
+
return result;
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
// mk_sorts_finite: every uninterpreted sort gets a finite universe.
|
|
484
|
+
private mkSortsFinite() {
|
|
485
|
+
const model = this.getModel();
|
|
486
|
+
for (const node of this.rootNodes)
|
|
487
|
+
if (this.manager.isUninterpretedSort(node.sort) && !model.isFinite(node.sort))
|
|
488
|
+
model.freezeUniverse(node.sort);
|
|
489
|
+
}
|
|
490
|
+
|
|
491
|
+
private addElemToEmptyInstSets() {
|
|
492
|
+
const manager = this.manager;
|
|
493
|
+
const sort2elems = new Map<number, number>();
|
|
494
|
+
const needFresh: Node[] = [];
|
|
495
|
+
for (const node of this.rootNodes) {
|
|
496
|
+
const elems = node.getInstantiationSet().elems;
|
|
497
|
+
if (elems.size === 0) {
|
|
498
|
+
if (manager.isUninterpretedSort(node.sort)) needFresh.push(node);
|
|
499
|
+
else node.insert(manager, this.getModel().getSomeValue(node.sort), 0);
|
|
500
|
+
} else sort2elems.set(node.sort, elems.keys().next().value ?? 0);
|
|
501
|
+
}
|
|
502
|
+
for (const node of needFresh) {
|
|
503
|
+
let elem = sort2elems.get(node.sort);
|
|
504
|
+
if (elem === undefined) {
|
|
505
|
+
elem = manager.mkFreshConst("elem", node.sort);
|
|
506
|
+
sort2elems.set(node.sort, elem);
|
|
507
|
+
}
|
|
508
|
+
node.insert(manager, elem, 0);
|
|
509
|
+
}
|
|
510
|
+
}
|
|
511
|
+
|
|
512
|
+
private collectRootNodes() {
|
|
513
|
+
this.rootNodes = this.nodes.filter((node) => node.isRoot());
|
|
514
|
+
}
|
|
515
|
+
|
|
516
|
+
private getFIProj(decl: number, index: number) {
|
|
517
|
+
return this.aFIs.get(getAFIKey(decl, index))?.node.getProj() ?? null;
|
|
518
|
+
}
|
|
519
|
+
|
|
520
|
+
private completePartialFuncs(partialFuncs: ObjHashtable) {
|
|
521
|
+
const manager = this.manager;
|
|
522
|
+
const model = this.getModel();
|
|
523
|
+
for (const decl of partialFuncs) {
|
|
524
|
+
model.completePartialFunc(decl, true);
|
|
525
|
+
const interp = model.funcInterps.get(decl);
|
|
526
|
+
if (interp === undefined || interp.isConstant()) continue;
|
|
527
|
+
const data = manager.funcDecls[decl];
|
|
528
|
+
let hasProj = false;
|
|
529
|
+
const args = data.domain.map((sort, index) => {
|
|
530
|
+
const variable = manager.mkVar(index, sort);
|
|
531
|
+
const proj = this.getFIProj(decl, index);
|
|
532
|
+
if (proj === null) return variable;
|
|
533
|
+
hasProj = true;
|
|
534
|
+
return manager.mkApp(proj, [variable], sort);
|
|
535
|
+
});
|
|
536
|
+
if (!hasProj) continue;
|
|
537
|
+
const auxDecl = manager.mkFreshFuncDecl(data.name, data.domain, data.range);
|
|
538
|
+
const newInterp = new FuncInterp(manager, data.domain.length);
|
|
539
|
+
newInterp.setElse(manager.mkApp(auxDecl, args, data.range));
|
|
540
|
+
model.reregisterDecl(decl, newInterp, auxDecl);
|
|
541
|
+
}
|
|
542
|
+
}
|
|
543
|
+
|
|
544
|
+
private mkInverses() {
|
|
545
|
+
const offset = this.random.next();
|
|
546
|
+
const count = this.rootNodes.length;
|
|
547
|
+
for (let index = count - 1; index >= 0; index--)
|
|
548
|
+
this.rootNodes[(index + offset) % count]
|
|
549
|
+
.getInstantiationSet()
|
|
550
|
+
.mkInverse((expr) => this.eval(expr, true));
|
|
551
|
+
}
|
|
552
|
+
|
|
553
|
+
fixModel(newConstraints: number[]) {
|
|
554
|
+
this.cleanupInstantiationSets();
|
|
555
|
+
this.newConstraints = newConstraints;
|
|
556
|
+
const partialFuncs = this.collectPartialFuncs();
|
|
557
|
+
this.resetEvalCache();
|
|
558
|
+
this.collectRootNodes();
|
|
559
|
+
this.addElemToEmptyInstSets();
|
|
560
|
+
this.mkSortsFinite();
|
|
561
|
+
for (const node of this.rootNodes) {
|
|
562
|
+
if (node.isMonoProj()) this.mkMonoProj(node);
|
|
563
|
+
else this.mkSimpleProj(node);
|
|
564
|
+
}
|
|
565
|
+
this.mkInverses();
|
|
566
|
+
this.completePartialFuncs(partialFuncs);
|
|
567
|
+
}
|
|
568
|
+
|
|
569
|
+
isDefaultRepresentative(term: number) {
|
|
570
|
+
return this.sort2k.get(this.manager.sorts[term]) === term;
|
|
571
|
+
}
|
|
572
|
+
}
|