tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.c4929d7
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 +27 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- 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 +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +37 -47
- package/dist/run-cli.js +37 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/check.ts +1 -0
- package/src/codegen.ts +5 -3
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +265 -55
- package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
- package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
- package/src/{obligations.ts → obligations/index.ts} +29 -13
- package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
- package/src/{obligation-module.ts → obligations/module.ts} +56 -33
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +159 -97
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +503 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +521 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +557 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +25 -0
- package/src/prove/prove.ts +505 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +222 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +166 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +773 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +437 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +334 -75
- package/src/standard-modules.ts +5 -2
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +80 -35
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,224 @@
|
|
|
1
|
+
// Ported from Z3 (src/math/lp/cross_nested.h), MIT license, see z3-license.txt. Enumerates the
|
|
2
|
+
// cross-nested forms of a sum, such as x*(y + z) + w for x*y + x*z + w, and calls back on each
|
|
3
|
+
// until the callback returns true or 100 forms are reported. A form is built by rewriting the
|
|
4
|
+
// expression in place: the front holds the slots of the subsums still to split.
|
|
5
|
+
//
|
|
6
|
+
// The occurrence map is a Map in insertion order, where Z3 has an unordered_map. So when several
|
|
7
|
+
// variables divide every summand, the extracted common factor may list them in another order.
|
|
8
|
+
import { Rational } from "../rational";
|
|
9
|
+
import {
|
|
10
|
+
type Nex,
|
|
11
|
+
type NexMul,
|
|
12
|
+
type NexSum,
|
|
13
|
+
containsVar,
|
|
14
|
+
getPowersFromMul,
|
|
15
|
+
getVarsOfExpr,
|
|
16
|
+
isLinear,
|
|
17
|
+
} from "./nex";
|
|
18
|
+
import type { NexCreator } from "./nex-creator";
|
|
19
|
+
|
|
20
|
+
// A place that holds an expression, where Z3 has a nex**.
|
|
21
|
+
interface NexSlot {
|
|
22
|
+
get(): Nex;
|
|
23
|
+
set(value: Nex): void;
|
|
24
|
+
}
|
|
25
|
+
|
|
26
|
+
interface Limit {
|
|
27
|
+
inc(): boolean;
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
const getMulChildSlot = (mul: NexMul, index: number): NexSlot => ({
|
|
31
|
+
get: () => mul.children[index].expr,
|
|
32
|
+
set: (value) => {
|
|
33
|
+
mul.children[index] = { expr: value, power: mul.children[index].power };
|
|
34
|
+
},
|
|
35
|
+
});
|
|
36
|
+
|
|
37
|
+
const getSumChildSlot = (sum: NexSum, index: number): NexSlot => ({
|
|
38
|
+
get: () => sum.children[index],
|
|
39
|
+
set: (value) => {
|
|
40
|
+
sum.children[index] = value;
|
|
41
|
+
},
|
|
42
|
+
});
|
|
43
|
+
|
|
44
|
+
const isDivisibleByVar = (expr: Nex, variable: number) =>
|
|
45
|
+
(expr.kind === "mul" && containsVar(expr, variable)) ||
|
|
46
|
+
(expr.kind === "var" && expr.variable === variable);
|
|
47
|
+
|
|
48
|
+
// has_common_factor: whether a variable of the first summand divides the rest. A sum that
|
|
49
|
+
// simplified to one term counts as a sum of that term.
|
|
50
|
+
const hasCommonFactor = (expr: Nex) => {
|
|
51
|
+
const children = expr.kind === "sum" ? expr.children : [expr];
|
|
52
|
+
for (const variable of getVarsOfExpr(children[0]))
|
|
53
|
+
if (children.slice(1).every((child) => containsVar(child, variable))) return true;
|
|
54
|
+
return false;
|
|
55
|
+
};
|
|
56
|
+
|
|
57
|
+
export class CrossNested {
|
|
58
|
+
private root: Nex = { kind: "sum", children: [] };
|
|
59
|
+
private isDone = false;
|
|
60
|
+
private isLimitExceeded = false;
|
|
61
|
+
private reported = 0;
|
|
62
|
+
private isRandomBit = false;
|
|
63
|
+
|
|
64
|
+
constructor(
|
|
65
|
+
private readonly callOnResult: (expr: Nex) => boolean,
|
|
66
|
+
private readonly varIsFixed: (variable: number) => boolean,
|
|
67
|
+
private readonly limit: Limit,
|
|
68
|
+
private randomSeed: number,
|
|
69
|
+
readonly nexCreator: NexCreator,
|
|
70
|
+
) {}
|
|
71
|
+
|
|
72
|
+
run(expr: Nex) {
|
|
73
|
+
this.root = expr;
|
|
74
|
+
const rootSlot: NexSlot = {
|
|
75
|
+
get: () => this.root,
|
|
76
|
+
set: (value) => {
|
|
77
|
+
this.root = value;
|
|
78
|
+
},
|
|
79
|
+
};
|
|
80
|
+
this.exploreExprOnFrontElem(rootSlot, []);
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
done() {
|
|
84
|
+
return this.isDone;
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
private nextRandom() {
|
|
88
|
+
this.randomSeed = (Math.imul(this.randomSeed, 214013) + 2531011) >>> 0;
|
|
89
|
+
return (this.randomSeed >>> 16) & 0x7fff;
|
|
90
|
+
}
|
|
91
|
+
|
|
92
|
+
private report() {
|
|
93
|
+
this.isDone = this.callOnResult(this.root) || ++this.reported > 100;
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
private extractCommonFactor(sum: NexSum) {
|
|
97
|
+
const size = sum.children.length;
|
|
98
|
+
const factors = [...this.nexCreator.occurencesMap]
|
|
99
|
+
.filter((entry) => entry[1].occs === size)
|
|
100
|
+
.map((entry) => ({ expr: this.nexCreator.mkVar(entry[0]), power: entry[1].power }));
|
|
101
|
+
if (factors.length === 0) return null;
|
|
102
|
+
return this.nexCreator.mkMulWithPowers(Rational.one, factors);
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
private proceedWithCommonFactor(slot: NexSlot, expr: NexSum, front: NexSlot[]) {
|
|
106
|
+
const factor = this.extractCommonFactor(expr);
|
|
107
|
+
if (factor === null) return false;
|
|
108
|
+
const quotient = this.nexCreator.simplify(this.nexCreator.mkDiv(expr, factor));
|
|
109
|
+
const product = this.nexCreator.mkMul(factor, quotient);
|
|
110
|
+
slot.set(product);
|
|
111
|
+
this.exploreExprOnFrontElem(getMulChildSlot(product, 1), front);
|
|
112
|
+
return true;
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
private exploreExprOnFrontElemVars(slot: NexSlot, front: NexSlot[], vars: number[]) {
|
|
116
|
+
const copyOfExpr = slot.get();
|
|
117
|
+
const copyOfFront = front.map((frontSlot) => frontSlot.get());
|
|
118
|
+
for (const variable of vars) {
|
|
119
|
+
if (this.isDone || this.isLimitExceeded) return;
|
|
120
|
+
if (this.varIsFixed(variable)) continue;
|
|
121
|
+
this.exploreOfExprOnSumAndVar(slot, variable, [...front]);
|
|
122
|
+
if (this.isDone || this.isLimitExceeded) return;
|
|
123
|
+
slot.set(copyOfExpr);
|
|
124
|
+
front.forEach((frontSlot, index) => frontSlot.set(copyOfFront[index]));
|
|
125
|
+
}
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
private calcOccurences(sum: NexSum) {
|
|
129
|
+
const occurences = this.nexCreator.occurencesMap;
|
|
130
|
+
occurences.clear();
|
|
131
|
+
this.nexCreator.powers.clear();
|
|
132
|
+
for (const child of sum.children) {
|
|
133
|
+
if (child.kind === "mul") {
|
|
134
|
+
getPowersFromMul(child, this.nexCreator.powers);
|
|
135
|
+
for (const entry of this.nexCreator.powers) {
|
|
136
|
+
const occ = occurences.get(entry[0]);
|
|
137
|
+
if (occ === undefined) occurences.set(entry[0], { occs: 1, power: entry[1] });
|
|
138
|
+
else {
|
|
139
|
+
occ.occs++;
|
|
140
|
+
occ.power = Math.min(occ.power, entry[1]);
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
} else if (child.kind === "var") {
|
|
144
|
+
const occ = occurences.get(child.variable);
|
|
145
|
+
if (occ === undefined) occurences.set(child.variable, { occs: 1, power: 1 });
|
|
146
|
+
else {
|
|
147
|
+
occ.occs++;
|
|
148
|
+
occ.power = 1;
|
|
149
|
+
}
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
for (const entry of occurences) if (entry[1].occs <= 1) occurences.delete(entry[0]);
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
// The variables to factor out, by occurrences, then by power, then by index in the direction
|
|
156
|
+
// of a random bit.
|
|
157
|
+
private getVarsFromOccurencesMap() {
|
|
158
|
+
const occurences = this.nexCreator.occurencesMap;
|
|
159
|
+
this.isRandomBit = this.nextRandom() % 2 === 1;
|
|
160
|
+
return [...occurences.keys()].sort((first, second) => {
|
|
161
|
+
const firstOcc = occurences.get(first);
|
|
162
|
+
const secondOcc = occurences.get(second);
|
|
163
|
+
if (firstOcc === undefined || secondOcc === undefined) return 0;
|
|
164
|
+
if (firstOcc.occs !== secondOcc.occs) return secondOcc.occs - firstOcc.occs;
|
|
165
|
+
if (firstOcc.power !== secondOcc.power) return secondOcc.power - firstOcc.power;
|
|
166
|
+
return this.isRandomBit ? first - second : second - first;
|
|
167
|
+
});
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
private exploreExprOnFrontElem(slot: NexSlot, front: NexSlot[]) {
|
|
171
|
+
if (this.isDone || this.isLimitExceeded) return;
|
|
172
|
+
if (!this.limit.inc()) {
|
|
173
|
+
this.isLimitExceeded = true;
|
|
174
|
+
return;
|
|
175
|
+
}
|
|
176
|
+
const expr = slot.get();
|
|
177
|
+
// A front element is a sum, unlike in Z3, which would misread anything else as one.
|
|
178
|
+
if (expr.kind === "sum") {
|
|
179
|
+
this.calcOccurences(expr);
|
|
180
|
+
// Z3 passes a copy of the front here.
|
|
181
|
+
if (this.proceedWithCommonFactor(slot, expr, [...front])) return;
|
|
182
|
+
const vars = this.getVarsFromOccurencesMap();
|
|
183
|
+
if (vars.length > 0) return this.exploreExprOnFrontElemVars(slot, front, vars);
|
|
184
|
+
}
|
|
185
|
+
const next = front.pop();
|
|
186
|
+
if (next === undefined) return this.report();
|
|
187
|
+
this.exploreExprOnFrontElem(next, front);
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
private exploreOfExprOnSumAndVar(slot: NexSlot, variable: number, front: NexSlot[]) {
|
|
191
|
+
if (this.isDone || this.isLimitExceeded) return;
|
|
192
|
+
if (!this.limit.inc()) {
|
|
193
|
+
this.isLimitExceeded = true;
|
|
194
|
+
return;
|
|
195
|
+
}
|
|
196
|
+
if (!this.splitWithVar(slot, variable, front)) return;
|
|
197
|
+
const next = front.pop();
|
|
198
|
+
if (next === undefined) return this.report();
|
|
199
|
+
this.exploreExprOnFrontElem(next, front);
|
|
200
|
+
}
|
|
201
|
+
|
|
202
|
+
// split_with_var: e = j*a + b, where a sums the summands divisible by j, divided by it, and b
|
|
203
|
+
// sums the rest. It is enough to split on the variables where a has no common factor.
|
|
204
|
+
private splitWithVar(slot: NexSlot, variable: number, front: NexSlot[]) {
|
|
205
|
+
const expr = slot.get();
|
|
206
|
+
if (expr.kind !== "sum") return false;
|
|
207
|
+
const quotients: Nex[] = [];
|
|
208
|
+
const rest: Nex[] = [];
|
|
209
|
+
for (const child of expr.children) {
|
|
210
|
+
if (isDivisibleByVar(child, variable))
|
|
211
|
+
quotients.push(this.nexCreator.mkDivByVar(child, variable));
|
|
212
|
+
else rest.push(child);
|
|
213
|
+
}
|
|
214
|
+
const quotient = this.nexCreator.simplifySum(this.nexCreator.mkSum(quotients));
|
|
215
|
+
const remainder = rest.length === 1 ? rest[0] : this.nexCreator.mkSum(rest);
|
|
216
|
+
if (hasCommonFactor(quotient)) return false;
|
|
217
|
+
const product = this.nexCreator.mkMul(this.nexCreator.mkVar(variable), quotient);
|
|
218
|
+
const split = this.nexCreator.mkSum([product, remainder]);
|
|
219
|
+
slot.set(split);
|
|
220
|
+
if (!isLinear(quotient)) front.push(getMulChildSlot(product, 1));
|
|
221
|
+
if (remainder.kind === "sum" && !isLinear(remainder)) front.push(getSumChildSlot(split, 1));
|
|
222
|
+
return true;
|
|
223
|
+
}
|
|
224
|
+
}
|