tla-ts 0.0.3 → 0.0.4-dev.1a3acf6
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 +46 -115
- 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 +194 -8
- package/dist/index.d.ts +194 -8
- 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 +1377 -18
- package/dist/transfer.js +1377 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +26 -30
- package/src/builtins.ts +45 -19
- package/src/bundled-modules.ts +3 -3
- package/src/check.ts +1182 -900
- package/src/cli/options.ts +109 -0
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/cli/tlc.ts +941 -0
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +9 -2
- package/src/codegen.ts +112 -51
- package/src/config.ts +254 -181
- package/src/dependencies.ts +5 -7
- package/src/environment.ts +579 -184
- package/src/errors.ts +287 -4
- package/src/evaluate.ts +1095 -365
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +49 -14
- package/src/index.ts +11 -0
- package/src/instances.ts +73 -60
- package/src/java-overrides.ts +183 -66
- package/src/json.ts +31 -36
- package/src/levels.ts +197 -54
- package/src/lexer.ts +127 -30
- package/src/liveness-checker.ts +894 -0
- package/src/liveness.ts +246 -596
- 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} +174 -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 +184 -235
- package/src/parallel.ts +156 -91
- package/src/parser.ts +490 -188
- package/src/pcal/ast.ts +755 -0
- package/src/pcal/parse.ts +1487 -0
- package/src/pcal/tokenize.ts +487 -0
- package/src/pcal/translate.ts +1151 -0
- package/src/pcal/validate.ts +444 -0
- 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 +648 -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 +39 -27
- package/src/resolve.ts +1474 -426
- package/src/runtime.ts +25 -7
- package/src/sany/builtins.ts +147 -0
- package/src/sany/generator.ts +3111 -0
- package/src/sany/levels.ts +1205 -0
- package/src/sany/lexer.ts +544 -0
- package/src/sany/linter.ts +122 -0
- package/src/sany/modules.ts +1398 -0
- package/src/sany/nodes.ts +463 -0
- package/src/sany/parse-error.ts +2161 -0
- package/src/sany/report.ts +355 -0
- package/src/sany/selectors.ts +736 -0
- package/src/sany/source.ts +247 -0
- package/src/sany/xml.ts +1016 -0
- package/src/search.ts +969 -0
- package/src/spec-description.ts +66 -29
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +215 -164
- package/src/state-graph.ts +181 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +40 -19
- package/src/successors.ts +253 -125
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +60 -32
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
- package/src/tlc/messages.ts +441 -0
- package/src/{tlc-order.ts → tlc/order.ts} +84 -16
- package/src/{tlc-random.ts → tlc/random.ts} +30 -189
- package/src/tlc/replay.ts +659 -0
- package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
- package/src/tlc/version.ts +19 -0
- package/src/transfer.ts +44 -32
- package/src/values.ts +843 -241
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -28
- package/dist/run-cli.js +0 -28
- package/src/canonical.ts +0 -39
- package/src/cli-options.ts +0 -58
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/run-cli.ts +0 -478
|
@@ -0,0 +1,526 @@
|
|
|
1
|
+
// Ported from Z3 (src/qe/lite/qe_lite_tactic.cpp, src/qe/mbp/mbp_solve_plugin.cpp), MIT license,
|
|
2
|
+
// see z3-license.txt. The eq_der of qe-lite: destructive equality resolution, which removes the
|
|
3
|
+
// variables of a quantifier that its body defines by an equality, with the solve plugins for
|
|
4
|
+
// Booleans and integer arithmetic.
|
|
5
|
+
import {
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_AND,
|
|
9
|
+
OP_EQ,
|
|
10
|
+
OP_IDIV,
|
|
11
|
+
OP_ITE,
|
|
12
|
+
OP_MOD,
|
|
13
|
+
OP_MUL,
|
|
14
|
+
OP_SUB,
|
|
15
|
+
OP_UMINUS,
|
|
16
|
+
SORT_BOOL,
|
|
17
|
+
SORT_INT,
|
|
18
|
+
type AstManager,
|
|
19
|
+
} from "./ast";
|
|
20
|
+
import { flattenAndVector, mkNot } from "./ast-util";
|
|
21
|
+
import { isOccurring } from "./der";
|
|
22
|
+
import { RefVector } from "./ref-vector";
|
|
23
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
24
|
+
import { BetaReducer } from "./rewriter-tpl";
|
|
25
|
+
import { assign, assignOwned, release } from "./expr-ref";
|
|
26
|
+
|
|
27
|
+
// A summand of a linear equation and whether it is on the left-hand side.
|
|
28
|
+
interface SignedExpr {
|
|
29
|
+
isLeft: boolean;
|
|
30
|
+
expr: number;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
interface SolvedVar {
|
|
34
|
+
variable: number;
|
|
35
|
+
// Held by a reference that the receiver releases.
|
|
36
|
+
term: number;
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
// eq_der: destructive equality resolution on a conjunction.
|
|
40
|
+
export class EqDer {
|
|
41
|
+
private subst: BetaReducer;
|
|
42
|
+
private substMap: RefVector;
|
|
43
|
+
private newExprs: RefVector;
|
|
44
|
+
private rewriter: Rewriter;
|
|
45
|
+
private map: number[] = [];
|
|
46
|
+
private pos2var: number[] = [];
|
|
47
|
+
private var2pos: number[] = [];
|
|
48
|
+
private inx2var: number[] = [];
|
|
49
|
+
private order: number[] = [];
|
|
50
|
+
// is_variable_test: the variables of the quantifier at hand are those below this index.
|
|
51
|
+
numVars = 0;
|
|
52
|
+
|
|
53
|
+
constructor(private manager: AstManager) {
|
|
54
|
+
this.subst = new BetaReducer(manager);
|
|
55
|
+
this.substMap = new RefVector(manager);
|
|
56
|
+
this.newExprs = new RefVector(manager);
|
|
57
|
+
this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
private isVariable(expr: number) {
|
|
61
|
+
const manager = this.manager;
|
|
62
|
+
return manager.kinds[expr] === KIND_VAR && manager.values[expr] < this.numVars;
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
// operator(): reduce_var_set until nothing changes.
|
|
66
|
+
apply(conjs: RefVector) {
|
|
67
|
+
while (this.reduceVarSet(conjs));
|
|
68
|
+
this.newExprs.reset();
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
// ~eq_der.
|
|
72
|
+
release() {
|
|
73
|
+
this.rewriter.release();
|
|
74
|
+
this.newExprs.reset();
|
|
75
|
+
this.substMap.reset();
|
|
76
|
+
this.subst.release();
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
private reduceVarSet(conjs: RefVector) {
|
|
80
|
+
const manager = this.manager;
|
|
81
|
+
// flatten_definitions: a false conjunct is the whole conjunction.
|
|
82
|
+
const falseConj = conjs.items.find((conj) => manager.isFalse(conj));
|
|
83
|
+
if (falseConj !== undefined) {
|
|
84
|
+
conjs.set(0, falseConj);
|
|
85
|
+
conjs.shrink(1);
|
|
86
|
+
}
|
|
87
|
+
let isReduced = false;
|
|
88
|
+
const found = this.findDefinitions(conjs.items);
|
|
89
|
+
if (found.numDefs > 0) {
|
|
90
|
+
this.sortVars();
|
|
91
|
+
if (this.order.length > 0) {
|
|
92
|
+
const conjunction = manager.mkApp(OP_AND, conjs.items, SORT_BOOL);
|
|
93
|
+
manager.incRef(conjunction);
|
|
94
|
+
this.createSubstitution(found.largestIndex + 1);
|
|
95
|
+
let substituted = this.subst.rewriteWithBindings(conjunction, this.substMap.items);
|
|
96
|
+
substituted = assignOwned(manager, substituted, this.rewriter.rewrite(substituted));
|
|
97
|
+
conjs.reset();
|
|
98
|
+
conjs.push(substituted);
|
|
99
|
+
flattenAndVector(manager, conjs);
|
|
100
|
+
isReduced = true;
|
|
101
|
+
manager.decRef(substituted);
|
|
102
|
+
manager.decRef(conjunction);
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
return this.removeUnconstrained(conjs) || isReduced;
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
// find_definitions: one definition per variable, preferring values, then ground terms, then
|
|
109
|
+
// constants.
|
|
110
|
+
private findDefinitions(args: number[]) {
|
|
111
|
+
const manager = this.manager;
|
|
112
|
+
let numDefs = 0;
|
|
113
|
+
let largestIndex = 0;
|
|
114
|
+
this.map = [];
|
|
115
|
+
this.pos2var = args.map(() => -1);
|
|
116
|
+
this.var2pos = [];
|
|
117
|
+
this.inx2var = [];
|
|
118
|
+
args.forEach((arg, position) => {
|
|
119
|
+
manager.limit.checkpoint();
|
|
120
|
+
const vars: number[] = [];
|
|
121
|
+
const terms = new RefVector(manager);
|
|
122
|
+
let term = -1;
|
|
123
|
+
if (this.getVarEq(arg, vars, terms))
|
|
124
|
+
vars.forEach((variable, index) => {
|
|
125
|
+
term = assign(manager, term, terms.items[index]);
|
|
126
|
+
term = assignOwned(manager, term, this.rewriter.rewrite(term));
|
|
127
|
+
if (term !== terms.items[index]) this.newExprs.push(term);
|
|
128
|
+
const varIndex = manager.values[variable];
|
|
129
|
+
const old = this.map[varIndex] ?? -1;
|
|
130
|
+
if (old === -1) {
|
|
131
|
+
this.map[varIndex] = term;
|
|
132
|
+
this.inx2var[varIndex] = variable;
|
|
133
|
+
this.pos2var[position] = varIndex;
|
|
134
|
+
this.var2pos[varIndex] = position;
|
|
135
|
+
numDefs++;
|
|
136
|
+
largestIndex = Math.max(varIndex, largestIndex);
|
|
137
|
+
} else if (
|
|
138
|
+
manager.isUniqueValue(old) ||
|
|
139
|
+
!(
|
|
140
|
+
manager.isUniqueValue(term) ||
|
|
141
|
+
(manager.isGroundApp(term) && !manager.isGroundApp(old)) ||
|
|
142
|
+
manager.isUninterpretedConst(term)
|
|
143
|
+
)
|
|
144
|
+
)
|
|
145
|
+
return;
|
|
146
|
+
else {
|
|
147
|
+
this.pos2var[this.var2pos[varIndex]] = -1;
|
|
148
|
+
this.pos2var[position] = varIndex;
|
|
149
|
+
this.var2pos[varIndex] = position;
|
|
150
|
+
this.map[varIndex] = term;
|
|
151
|
+
}
|
|
152
|
+
this.newExprs.pushOwned(term);
|
|
153
|
+
term = -1;
|
|
154
|
+
});
|
|
155
|
+
release(manager, term);
|
|
156
|
+
terms.reset();
|
|
157
|
+
});
|
|
158
|
+
return { numDefs, largestIndex };
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
// is_var_eq: a variable and its definition from a literal, through the solve plugin of the sort.
|
|
162
|
+
private getVarEq(expr: number, vars: number[], terms: RefVector) {
|
|
163
|
+
const manager = this.manager;
|
|
164
|
+
const isEq = manager.getOp(expr) === OP_EQ;
|
|
165
|
+
if (isEq) {
|
|
166
|
+
const lhs = manager.getArg(expr, 0);
|
|
167
|
+
const rhs = manager.getArg(expr, 1);
|
|
168
|
+
const isSwapped = !this.isVariable(lhs);
|
|
169
|
+
if (this.isVariable(isSwapped ? rhs : lhs)) {
|
|
170
|
+
vars.push(isSwapped ? rhs : lhs);
|
|
171
|
+
terms.push(isSwapped ? lhs : rhs);
|
|
172
|
+
return true;
|
|
173
|
+
}
|
|
174
|
+
}
|
|
175
|
+
const sort = isEq ? manager.sorts[manager.getArg(expr, 0)] : manager.sorts[expr];
|
|
176
|
+
if (sort !== SORT_BOOL && sort !== SORT_INT) return false;
|
|
177
|
+
// solve_plugin::operator(): the arithmetic plugin only sees positive equalities.
|
|
178
|
+
const isNegated = manager.isNot(expr);
|
|
179
|
+
const solved =
|
|
180
|
+
sort === SORT_INT
|
|
181
|
+
? this.solveArithEq(expr)
|
|
182
|
+
: this.solveBasic(isNegated ? manager.getArg(expr, 0) : expr, !isNegated);
|
|
183
|
+
const isFound =
|
|
184
|
+
solved !== expr &&
|
|
185
|
+
manager.getOp(solved) === OP_EQ &&
|
|
186
|
+
this.isVariable(manager.getArg(solved, 0));
|
|
187
|
+
if (isFound) {
|
|
188
|
+
vars.push(manager.getArg(solved, 0));
|
|
189
|
+
terms.push(manager.getArg(solved, 1));
|
|
190
|
+
}
|
|
191
|
+
manager.decRef(solved);
|
|
192
|
+
return isFound;
|
|
193
|
+
}
|
|
194
|
+
|
|
195
|
+
// arith_solve_plugin::is_invertible_const: a numeral that a variable's coefficient may be.
|
|
196
|
+
private getInvertibleConst(expr: number): bigint | undefined {
|
|
197
|
+
const manager = this.manager;
|
|
198
|
+
if (manager.getOp(expr) === OP_UMINUS) {
|
|
199
|
+
const inner = this.getInvertibleConst(manager.getArg(expr, 0));
|
|
200
|
+
return inner === undefined ? undefined : -inner;
|
|
201
|
+
}
|
|
202
|
+
const value = manager.getNumeral(expr);
|
|
203
|
+
return value === 1n || value === -1n ? value : undefined;
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
// arith_solve_plugin::is_invertible_mul: a variable times an invertible coefficient.
|
|
207
|
+
private getInvertibleMul(expr: number) {
|
|
208
|
+
const manager = this.manager;
|
|
209
|
+
if (this.isVariable(expr)) return { variable: expr, coefficient: 1n };
|
|
210
|
+
if (manager.getOp(expr) !== OP_MUL || manager.getNumArgs(expr) !== 2) return undefined;
|
|
211
|
+
const first = manager.getArg(expr, 0);
|
|
212
|
+
const second = manager.getArg(expr, 1);
|
|
213
|
+
const secondValue = this.getInvertibleConst(second);
|
|
214
|
+
if (this.isVariable(first) && secondValue !== undefined)
|
|
215
|
+
return { variable: first, coefficient: secondValue };
|
|
216
|
+
const firstValue = this.getInvertibleConst(first);
|
|
217
|
+
if (this.isVariable(second) && firstValue !== undefined)
|
|
218
|
+
return { variable: second, coefficient: firstValue };
|
|
219
|
+
return undefined;
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
// arith_solve_plugin::solve: lhs = rhs as variable = term.
|
|
223
|
+
private solveLinear(lhs: number, rhs: number): SolvedVar | undefined {
|
|
224
|
+
const manager = this.manager;
|
|
225
|
+
if (manager.sorts[lhs] !== SORT_INT) return undefined;
|
|
226
|
+
const todo: SignedExpr[] = [
|
|
227
|
+
{ isLeft: true, expr: lhs },
|
|
228
|
+
{ isLeft: false, expr: rhs },
|
|
229
|
+
];
|
|
230
|
+
const done: SignedExpr[] = [];
|
|
231
|
+
for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
|
|
232
|
+
const op = manager.getOp(item.expr);
|
|
233
|
+
if (op === OP_ADD)
|
|
234
|
+
for (let index = 0; index < manager.getNumArgs(item.expr); index++)
|
|
235
|
+
todo.push({ isLeft: item.isLeft, expr: manager.getArg(item.expr, index) });
|
|
236
|
+
else if (op === OP_SUB) {
|
|
237
|
+
todo.push({ isLeft: item.isLeft, expr: manager.getArg(item.expr, 0) });
|
|
238
|
+
for (let index = 1; index < manager.getNumArgs(item.expr); index++)
|
|
239
|
+
todo.push({ isLeft: !item.isLeft, expr: manager.getArg(item.expr, index) });
|
|
240
|
+
} else if (op === OP_UMINUS)
|
|
241
|
+
todo.push({ isLeft: !item.isLeft, expr: manager.getArg(item.expr, 0) });
|
|
242
|
+
else {
|
|
243
|
+
const mul = this.getInvertibleMul(item.expr);
|
|
244
|
+
if (mul === undefined) {
|
|
245
|
+
done.push(item);
|
|
246
|
+
continue;
|
|
247
|
+
}
|
|
248
|
+
done.push(...todo);
|
|
249
|
+
// mk_term: the other summands times the inverse of the coefficient, negated on the
|
|
250
|
+
// variable's side.
|
|
251
|
+
const coefficient = 1n / mul.coefficient;
|
|
252
|
+
const isLeft = item.isLeft;
|
|
253
|
+
const terms = new RefVector(manager);
|
|
254
|
+
for (const summand of done) {
|
|
255
|
+
const factor = summand.isLeft === isLeft ? -coefficient : coefficient;
|
|
256
|
+
terms.push(
|
|
257
|
+
factor === 1n
|
|
258
|
+
? summand.expr
|
|
259
|
+
: manager.mkApp(OP_MUL, [manager.mkNumeral(factor), summand.expr], SORT_INT),
|
|
260
|
+
);
|
|
261
|
+
}
|
|
262
|
+
const term =
|
|
263
|
+
terms.size === 0
|
|
264
|
+
? manager.mkNumeral(0n)
|
|
265
|
+
: terms.size === 1
|
|
266
|
+
? terms.items[0]
|
|
267
|
+
: manager.mkApp(OP_ADD, terms.items, SORT_INT);
|
|
268
|
+
manager.incRef(term);
|
|
269
|
+
terms.reset();
|
|
270
|
+
return { variable: mul.variable, term };
|
|
271
|
+
}
|
|
272
|
+
}
|
|
273
|
+
return undefined;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
// arith_solve_plugin::mk_eq_core.
|
|
277
|
+
private mkArithEqCore(inputLeft: number, inputRight: number) {
|
|
278
|
+
const manager = this.manager;
|
|
279
|
+
const solved = this.solveLinear(inputLeft, inputRight);
|
|
280
|
+
if (solved !== undefined) {
|
|
281
|
+
const result = manager.mkEq(solved.variable, solved.term);
|
|
282
|
+
manager.incRef(result);
|
|
283
|
+
manager.decRef(solved.term);
|
|
284
|
+
return result;
|
|
285
|
+
}
|
|
286
|
+
const isLeftZero = manager.getNumeral(inputLeft) === 0n;
|
|
287
|
+
const left = isLeftZero ? inputRight : inputLeft;
|
|
288
|
+
const right = isLeftZero ? inputLeft : inputRight;
|
|
289
|
+
const isBinarySum =
|
|
290
|
+
manager.getNumeral(right) === 0n &&
|
|
291
|
+
manager.getOp(left) === OP_ADD &&
|
|
292
|
+
manager.getNumArgs(left) === 2;
|
|
293
|
+
const negatedSecond = isBinarySum
|
|
294
|
+
? manager.getTimesMinusOneArg(manager.getArg(left, 1))
|
|
295
|
+
: undefined;
|
|
296
|
+
const negatedFirst = isBinarySum
|
|
297
|
+
? manager.getTimesMinusOneArg(manager.getArg(left, 0))
|
|
298
|
+
: undefined;
|
|
299
|
+
const result =
|
|
300
|
+
negatedSecond !== undefined
|
|
301
|
+
? manager.mkEq(manager.getArg(left, 0), negatedSecond)
|
|
302
|
+
: negatedFirst !== undefined
|
|
303
|
+
? manager.mkEq(manager.getArg(left, 1), negatedFirst)
|
|
304
|
+
: manager.mkEq(left, right);
|
|
305
|
+
manager.incRef(result);
|
|
306
|
+
return result;
|
|
307
|
+
}
|
|
308
|
+
|
|
309
|
+
// arith_solve_plugin::try_int_mul_solve: k*y = x becomes y = x div k and x mod k = 0, or x = 0
|
|
310
|
+
// when k is zero.
|
|
311
|
+
private tryIntMulSolve(atom: number) {
|
|
312
|
+
const manager = this.manager;
|
|
313
|
+
if (manager.sorts[manager.getArg(atom, 0)] !== SORT_INT) return -1;
|
|
314
|
+
const isMulOnLeft = manager.getOp(manager.getArg(atom, 1)) !== OP_MUL;
|
|
315
|
+
if (isMulOnLeft && manager.getOp(manager.getArg(atom, 0)) !== OP_MUL) return -1;
|
|
316
|
+
const lhs = manager.getArg(atom, isMulOnLeft ? 1 : 0);
|
|
317
|
+
const product = manager.getArg(atom, isMulOnLeft ? 0 : 1);
|
|
318
|
+
if (manager.getNumArgs(product) !== 2) return -1;
|
|
319
|
+
const isNumeralSecond = !manager.isNumeral(manager.getArg(product, 0));
|
|
320
|
+
if (isNumeralSecond && !manager.isNumeral(manager.getArg(product, 1))) return -1;
|
|
321
|
+
const first = manager.getArg(product, isNumeralSecond ? 1 : 0);
|
|
322
|
+
const second = manager.getArg(product, isNumeralSecond ? 0 : 1);
|
|
323
|
+
if (manager.getNumeralValue(first) === 0n) {
|
|
324
|
+
const result = manager.mkEq(lhs, manager.mkNumeral(0n));
|
|
325
|
+
manager.incRef(result);
|
|
326
|
+
return result;
|
|
327
|
+
}
|
|
328
|
+
const held = new RefVector(manager);
|
|
329
|
+
const quotientEq = manager.mkEq(second, manager.mkApp(OP_IDIV, [lhs, first], SORT_INT));
|
|
330
|
+
held.push(quotientEq);
|
|
331
|
+
const zero = manager.mkNumeral(0n);
|
|
332
|
+
held.push(zero);
|
|
333
|
+
const remainder = manager.mkApp(OP_MOD, [lhs, first], SORT_INT);
|
|
334
|
+
held.push(remainder);
|
|
335
|
+
const remainderEq = manager.mkEq(zero, remainder);
|
|
336
|
+
held.push(remainderEq);
|
|
337
|
+
const result = manager.mkApp(OP_AND, [quotientEq, remainderEq], SORT_BOOL);
|
|
338
|
+
manager.incRef(result);
|
|
339
|
+
held.items.reverse();
|
|
340
|
+
held.reset();
|
|
341
|
+
return result;
|
|
342
|
+
}
|
|
343
|
+
|
|
344
|
+
// arith_solve_plugin::solve on a positive equality.
|
|
345
|
+
private solveArithEq(atom: number) {
|
|
346
|
+
const manager = this.manager;
|
|
347
|
+
const mulSolved = this.tryIntMulSolve(atom);
|
|
348
|
+
if (mulSolved !== -1) return mulSolved;
|
|
349
|
+
const lhs = manager.getArg(atom, 0);
|
|
350
|
+
const rhs = manager.getArg(atom, 1);
|
|
351
|
+
let variable = assign(manager, -1, lhs);
|
|
352
|
+
let term = assign(manager, -1, rhs);
|
|
353
|
+
const solved = this.solveLinear(lhs, rhs);
|
|
354
|
+
if (solved !== undefined) {
|
|
355
|
+
variable = assign(manager, variable, solved.variable);
|
|
356
|
+
term = assignOwned(manager, term, solved.term);
|
|
357
|
+
}
|
|
358
|
+
const result = this.mkArithEqCore(variable, term);
|
|
359
|
+
manager.decRef(term);
|
|
360
|
+
manager.decRef(variable);
|
|
361
|
+
return result;
|
|
362
|
+
}
|
|
363
|
+
|
|
364
|
+
// basic_solve_plugin::solve.
|
|
365
|
+
private solveBasic(atom: number, isPositive: boolean): number {
|
|
366
|
+
const manager = this.manager;
|
|
367
|
+
let result = assign(manager, -1, atom);
|
|
368
|
+
if (manager.getOp(atom) === OP_EQ) {
|
|
369
|
+
const lhs = manager.getArg(atom, 0);
|
|
370
|
+
const rhs = manager.getArg(atom, 1);
|
|
371
|
+
if (manager.isNot(lhs) && this.isVariable(manager.getArg(lhs, 0)))
|
|
372
|
+
result = assign(manager, result, manager.mkEq(manager.getArg(lhs, 0), mkNot(manager, rhs)));
|
|
373
|
+
else if (manager.isNot(rhs) && this.isVariable(manager.getArg(rhs, 0)))
|
|
374
|
+
result = assign(manager, result, manager.mkEq(manager.getArg(rhs, 0), mkNot(manager, lhs)));
|
|
375
|
+
else if (this.isVariable(rhs) && !this.isVariable(lhs))
|
|
376
|
+
result = assign(manager, result, manager.mkEq(rhs, lhs));
|
|
377
|
+
}
|
|
378
|
+
if (manager.getOp(atom) === OP_ITE) {
|
|
379
|
+
const condition = manager.getArg(atom, 0);
|
|
380
|
+
const thenExpr = manager.getArg(atom, 1);
|
|
381
|
+
const elseExpr = manager.getArg(atom, 2);
|
|
382
|
+
const thenSolved = this.solveBasic(thenExpr, true);
|
|
383
|
+
const elseSolved = this.solveBasic(elseExpr, true);
|
|
384
|
+
if (
|
|
385
|
+
manager.getOp(thenSolved) === OP_EQ &&
|
|
386
|
+
manager.getOp(elseSolved) === OP_EQ &&
|
|
387
|
+
manager.getArg(thenSolved, 0) === manager.getArg(elseSolved, 0)
|
|
388
|
+
) {
|
|
389
|
+
const thenTerm = manager.getArg(thenSolved, 1);
|
|
390
|
+
const ite = manager.mkApp(
|
|
391
|
+
OP_ITE,
|
|
392
|
+
[condition, thenTerm, manager.getArg(elseSolved, 1)],
|
|
393
|
+
manager.sorts[thenTerm],
|
|
394
|
+
);
|
|
395
|
+
result = assign(manager, result, manager.mkEq(manager.getArg(thenSolved, 0), ite));
|
|
396
|
+
}
|
|
397
|
+
manager.decRef(elseSolved);
|
|
398
|
+
manager.decRef(thenSolved);
|
|
399
|
+
}
|
|
400
|
+
if (this.isVariable(atom) && manager.sorts[atom] === SORT_BOOL)
|
|
401
|
+
return assign(
|
|
402
|
+
manager,
|
|
403
|
+
result,
|
|
404
|
+
manager.mkEq(atom, isPositive ? manager.trueExpr : manager.falseExpr),
|
|
405
|
+
);
|
|
406
|
+
if (isPositive) return result;
|
|
407
|
+
const negated = assign(manager, -1, mkNot(manager, result));
|
|
408
|
+
manager.decRef(result);
|
|
409
|
+
return negated;
|
|
410
|
+
}
|
|
411
|
+
|
|
412
|
+
// der_sort_vars: the definitions in an order where each only uses the ones before it, dropping
|
|
413
|
+
// the definitions on a cycle.
|
|
414
|
+
private sortVars() {
|
|
415
|
+
const manager = this.manager;
|
|
416
|
+
const definitions = this.map;
|
|
417
|
+
const getDefinition = (index: number) => definitions[index] ?? -1;
|
|
418
|
+
this.order = [];
|
|
419
|
+
let isFound = false;
|
|
420
|
+
for (let index = 0; index < definitions.length; index++) {
|
|
421
|
+
const definition = getDefinition(index);
|
|
422
|
+
if (
|
|
423
|
+
definition === -1 ||
|
|
424
|
+
manager.hasQuantifierFlags[definition] ||
|
|
425
|
+
isOccurring(manager, manager.values[this.inx2var[index]], definition)
|
|
426
|
+
)
|
|
427
|
+
definitions[index] = -1;
|
|
428
|
+
else isFound = true;
|
|
429
|
+
}
|
|
430
|
+
if (!isFound) return;
|
|
431
|
+
const visiting = new Set<number>();
|
|
432
|
+
const done = new Set<number>();
|
|
433
|
+
for (let index = 0; index < definitions.length; index++) {
|
|
434
|
+
if (getDefinition(index) === -1) continue;
|
|
435
|
+
const todo: [number, number][] = [[this.inx2var[index], 0]];
|
|
436
|
+
while (todo.length > 0) {
|
|
437
|
+
const frame = todo[todo.length - 1];
|
|
438
|
+
const expr = frame[0];
|
|
439
|
+
if (done.has(expr)) {
|
|
440
|
+
todo.pop();
|
|
441
|
+
continue;
|
|
442
|
+
}
|
|
443
|
+
if (manager.kinds[expr] === KIND_VAR) {
|
|
444
|
+
const varIndex = manager.values[expr];
|
|
445
|
+
if (frame[1] === 0 && getDefinition(varIndex) !== -1) {
|
|
446
|
+
if (!visiting.has(expr)) {
|
|
447
|
+
visiting.add(expr);
|
|
448
|
+
frame[1] = 1;
|
|
449
|
+
todo.push([getDefinition(varIndex), 0]);
|
|
450
|
+
continue;
|
|
451
|
+
}
|
|
452
|
+
visiting.delete(expr);
|
|
453
|
+
definitions[varIndex] = -1;
|
|
454
|
+
} else if (frame[1] === 1) {
|
|
455
|
+
visiting.delete(expr);
|
|
456
|
+
if (getDefinition(varIndex) !== -1) this.order.push(varIndex);
|
|
457
|
+
}
|
|
458
|
+
} else {
|
|
459
|
+
let isPushed = false;
|
|
460
|
+
while (frame[1] < manager.getNumArgs(expr) && !isPushed) {
|
|
461
|
+
const arg = manager.getArg(expr, frame[1]++);
|
|
462
|
+
if (!done.has(arg)) {
|
|
463
|
+
todo.push([arg, 0]);
|
|
464
|
+
isPushed = true;
|
|
465
|
+
}
|
|
466
|
+
}
|
|
467
|
+
if (isPushed) continue;
|
|
468
|
+
}
|
|
469
|
+
done.add(expr);
|
|
470
|
+
todo.pop();
|
|
471
|
+
}
|
|
472
|
+
}
|
|
473
|
+
}
|
|
474
|
+
|
|
475
|
+
private createSubstitution(size: number) {
|
|
476
|
+
const manager = this.manager;
|
|
477
|
+
this.substMap.reset();
|
|
478
|
+
this.substMap.resize(size);
|
|
479
|
+
this.subst.reset();
|
|
480
|
+
this.subst.setInvBindings(this.substMap.items);
|
|
481
|
+
for (const index of this.order) {
|
|
482
|
+
const definition = this.map[index];
|
|
483
|
+
const result = manager.isGroundApp(definition)
|
|
484
|
+
? assign(manager, -1, definition)
|
|
485
|
+
: this.subst.rewrite(definition);
|
|
486
|
+
const position = size - index - 1;
|
|
487
|
+
this.subst.updateInvBindingAt(position, result);
|
|
488
|
+
this.substMap.setOwned(position, result);
|
|
489
|
+
}
|
|
490
|
+
}
|
|
491
|
+
|
|
492
|
+
// is_unconstrained: an integer variable that no other conjunct mentions.
|
|
493
|
+
private isUnconstrained(variable: number, term: number, position: number, conjs: number[]) {
|
|
494
|
+
const manager = this.manager;
|
|
495
|
+
const index = manager.values[variable];
|
|
496
|
+
return (
|
|
497
|
+
manager.sorts[variable] === SORT_INT &&
|
|
498
|
+
!isOccurring(manager, index, term) &&
|
|
499
|
+
conjs.every((conj, other) => other === position || !isOccurring(manager, index, conj))
|
|
500
|
+
);
|
|
501
|
+
}
|
|
502
|
+
|
|
503
|
+
// remove_unconstrained: a disequality on an unconstrained integer variable holds.
|
|
504
|
+
private removeUnconstrained(conjs: RefVector) {
|
|
505
|
+
const manager = this.manager;
|
|
506
|
+
let isReduced = false;
|
|
507
|
+
for (let isChanged = true; isChanged;) {
|
|
508
|
+
isChanged = false;
|
|
509
|
+
for (let position = 0; position < conjs.size; position++) {
|
|
510
|
+
const conj = conjs.items[position];
|
|
511
|
+
if (!manager.isNot(conj) || manager.getOp(manager.getArg(conj, 0)) !== OP_EQ) continue;
|
|
512
|
+
const lhs = manager.getArg(manager.getArg(conj, 0), 0);
|
|
513
|
+
const rhs = manager.getArg(manager.getArg(conj, 0), 1);
|
|
514
|
+
if (
|
|
515
|
+
(this.isVariable(lhs) && this.isUnconstrained(lhs, rhs, position, conjs.items)) ||
|
|
516
|
+
(this.isVariable(rhs) && this.isUnconstrained(rhs, lhs, position, conjs.items))
|
|
517
|
+
) {
|
|
518
|
+
conjs.set(position, manager.trueExpr);
|
|
519
|
+
isReduced = true;
|
|
520
|
+
isChanged = true;
|
|
521
|
+
}
|
|
522
|
+
}
|
|
523
|
+
}
|
|
524
|
+
return isReduced;
|
|
525
|
+
}
|
|
526
|
+
}
|