tla-ts 0.0.10-dev.c92e6a4ea → 0.0.10-dev.d166e0ae9
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/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +36 -36
- package/dist/deciders.js +54 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +13 -3
- package/dist/index.d.ts +13 -3
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +68 -68
- package/dist/prove.js +78 -78
- package/dist/run.cjs +42 -42
- package/dist/run.js +44 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +45 -43
- package/dist/transfer.js +45 -43
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +11 -1
- package/src/bags.ts +50 -29
- package/src/builtins.ts +4 -3
- package/src/check-failure.ts +9 -6
- package/src/check-trace.ts +116 -64
- package/src/check.ts +356 -173
- package/src/cli/tlc-output.ts +1 -0
- package/src/cli/tlc.ts +4 -3
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +34 -13
- package/src/coverage.ts +3 -0
- package/src/dependencies.ts +61 -13
- package/src/dfid.ts +22 -10
- package/src/environment.ts +71 -35
- package/src/errors.ts +7 -0
- package/src/evaluate.ts +149 -54
- package/src/exit-codes.ts +29 -15
- package/src/instances.ts +16 -6
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +186 -97
- package/src/liveness-checker.ts +131 -83
- package/src/liveness.ts +52 -11
- package/src/obligations/index.ts +1 -1
- package/src/obligations/normalize.ts +1 -4
- package/src/obligations/printer.ts +5 -5
- package/src/obligations/source.ts +2 -0
- package/src/parser.ts +115 -145
- package/src/prover/isabelle/isar/attrib.ts +4 -4
- package/src/prover/isabelle/isar/rule-cases.ts +8 -6
- package/src/prover/isabelle/provers/clasimp.ts +1 -1
- package/src/prover/isabelle/provers/hypsubst.ts +2 -2
- package/src/prover/isabelle/pure/rewriter.ts +3 -3
- package/src/prover/isabelle/pure/term.ts +3 -3
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/smt/rewrite.ts +2 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/arith-rewriter.ts +11 -3
- package/src/prover/smt/solver/array-rewriter.ts +12 -2
- package/src/prover/smt/solver/asserted-formulas.ts +169 -58
- package/src/prover/smt/solver/ast-lt.ts +1 -1
- package/src/prover/smt/solver/ast.ts +63 -14
- package/src/prover/smt/solver/auf-solver.ts +23 -12
- package/src/prover/smt/solver/bit-blast-tactic.ts +26 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-simplifier.ts +11 -13
- package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
- package/src/prover/smt/solver/bv-rewriter.ts +1 -1
- package/src/prover/smt/solver/card2bv.ts +35 -18
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -24
- package/src/prover/smt/solver/context.ts +67 -13
- package/src/prover/smt/solver/ctx-simplify.ts +1 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
- package/src/prover/smt/solver/dependent-expr-state.ts +26 -15
- package/src/prover/smt/solver/diff-neq.ts +1 -2
- package/src/prover/smt/solver/dt2bv-tactic.ts +36 -20
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +5 -8
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/egraph.ts +4 -11
- package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
- package/src/prover/smt/solver/euf/mam.ts +1 -5
- package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
- package/src/prover/smt/solver/euf/th-solver.ts +0 -7
- package/src/prover/smt/solver/expr2polynomial.ts +204 -79
- package/src/prover/smt/solver/factor.ts +36 -14
- package/src/prover/smt/solver/fd-solver.ts +148 -39
- package/src/prover/smt/solver/fix-dl-var.ts +1 -2
- package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
- package/src/prover/smt/solver/goal.ts +6 -3
- package/src/prover/smt/solver/goal2nlsat.ts +57 -30
- package/src/prover/smt/solver/hashtable.ts +4 -0
- package/src/prover/smt/solver/internalizer.ts +1 -1
- package/src/prover/smt/solver/logic-tactics.ts +9 -2
- package/src/prover/smt/solver/lp/lp-settings.ts +5 -1
- package/src/prover/smt/solver/lp/nla-core.ts +1 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +2 -2
- package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
- package/src/prover/smt/solver/lp/pdd.ts +2 -3
- package/src/prover/smt/solver/lp/union-find.ts +1 -1
- package/src/prover/smt/solver/mam-compiler.ts +1 -1
- package/src/prover/smt/solver/maxcore.ts +2 -1
- package/src/prover/smt/solver/maxsmt-base.ts +1 -0
- package/src/prover/smt/solver/model-based-opt.ts +1 -1
- package/src/prover/smt/solver/model-checker.ts +1 -1
- package/src/prover/smt/solver/model-evaluator.ts +2 -0
- package/src/prover/smt/solver/model-generator.ts +85 -43
- package/src/prover/smt/solver/mpf.ts +2 -4
- package/src/prover/smt/solver/mus.ts +2 -3
- package/src/prover/smt/solver/muz/dl-context.ts +22 -44
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +1 -1
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
- package/src/prover/smt/solver/muz/dl-rule.ts +8 -9
- package/src/prover/smt/solver/muz/hnf.ts +2 -2
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -2
- package/src/prover/smt/solver/muz/rule-properties.ts +22 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
- package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -1
- package/src/prover/smt/solver/nlqsat.ts +1 -1
- package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
- package/src/prover/smt/solver/nlsat/explain.ts +375 -217
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
- package/src/prover/smt/solver/nlsat/solver.ts +74 -64
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
- package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
- package/src/prover/smt/solver/nnf.ts +6 -2
- package/src/prover/smt/solver/opt-context.ts +21 -7
- package/src/prover/smt/solver/opt-nlsat.ts +29 -18
- package/src/prover/smt/solver/opt-pareto.ts +19 -0
- package/src/prover/smt/solver/opt-preprocess.ts +1 -1
- package/src/prover/smt/solver/opt-solver.ts +10 -6
- package/src/prover/smt/solver/optsmt.ts +1 -1
- package/src/prover/smt/solver/parallel-tactic.ts +1 -1
- package/src/prover/smt/solver/pb-rewriter.ts +1 -4
- package/src/prover/smt/solver/poly-rewriter.ts +75 -18
- package/src/prover/smt/solver/probes.ts +88 -23
- package/src/prover/smt/solver/proto-model.ts +8 -8
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
- package/src/prover/smt/solver/qe-lite.ts +2 -2
- package/src/prover/smt/solver/qe.ts +3 -2
- package/src/prover/smt/solver/qsat.ts +23 -8
- package/src/prover/smt/solver/quantifier-manager.ts +14 -9
- package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +7 -6
- package/src/prover/smt/solver/rewriter.ts +31 -25
- package/src/prover/smt/solver/rlimit.ts +4 -0
- package/src/prover/smt/solver/sat/config.ts +1 -1
- package/src/prover/smt/solver/sat/goal2sat.ts +0 -1
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +81 -28
- package/src/prover/smt/solver/sat/model-converter.ts +1 -1
- package/src/prover/smt/solver/sat/pb-solver.ts +1 -1
- package/src/prover/smt/solver/sat/sat-tactic.ts +17 -7
- package/src/prover/smt/solver/sat/sat2goal.ts +10 -7
- package/src/prover/smt/solver/sat/simplifier.ts +1 -1
- package/src/prover/smt/solver/sat/solver.ts +25 -47
- package/src/prover/smt/solver/seq-axioms.ts +20 -35
- package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
- package/src/prover/smt/solver/seq-derive.ts +2 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
- package/src/prover/smt/solver/seq-monadic.ts +7 -5
- package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
- package/src/prover/smt/solver/seq-re-util.ts +1 -1
- package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
- package/src/prover/smt/solver/seq-regex-live.ts +2 -2
- package/src/prover/smt/solver/seq-rewriter.ts +31 -29
- package/src/prover/smt/solver/seq-skolem.ts +0 -23
- package/src/prover/smt/solver/seq-view-witness.ts +4 -4
- package/src/prover/smt/solver/smt-consequences.ts +1 -1
- package/src/prover/smt/solver/smt-kernel.ts +48 -7
- package/src/prover/smt/solver/smt-setup.ts +96 -10
- package/src/prover/smt/solver/smtlib-parser.ts +589 -224
- package/src/prover/smt/solver/smtlib-script.ts +674 -195
- package/src/prover/smt/solver/solve-eqs.ts +36 -37
- package/src/prover/smt/solver/solver.ts +18 -3
- package/src/prover/smt/solver/tactic.ts +332 -189
- package/src/prover/smt/solver/theory-bv.ts +13 -3
- package/src/prover/smt/solver/theory-fpa.ts +1 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +2 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +11 -3
- package/src/prover/smt/solver/theory-lra.ts +1 -1
- package/src/prover/smt/solver/theory-pb.ts +24 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
- package/src/prover/smt/solver/theory-seq-state.ts +2 -21
- package/src/prover/smt/solver/tseitin-cnf.ts +1 -0
- package/src/prover/tlapm/cache.ts +8 -8
- package/src/prover/zenon/index-table.ts +5 -2
- package/src/prover/zenon/isar-case.ts +1 -1
- package/src/prover/zenon/isar.ts +2 -2
- package/src/prover/zenon/phrase.ts +1 -1
- package/src/resolve.ts +1071 -251
- package/src/runtime.ts +5 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +38 -30
- package/src/sany/generator-proofs.ts +6 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/lexer.ts +3 -3
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +197 -117
- package/src/simulate.ts +165 -102
- package/src/spec-description.ts +8 -6
- package/src/standard-modules.ts +56 -22
- package/src/subexpressions.ts +518 -123
- package/src/successors.ts +10 -3
- package/src/symmetry.ts +2 -1
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/random.ts +2 -1
- package/src/tlc/replay.ts +27 -14
- package/src/tlc/tlc-operators.ts +10 -8
- package/src/tlc/tlcext-operators.ts +26 -10
- package/src/tlc/trace-spec.ts +9 -22
- package/src/typed-tier.ts +44 -27
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +135 -78
package/dist/index.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.
|
|
9
|
+
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.v,exports.TlaError=e.b,exports.TlaEvaluationError=e.x,exports.TlaSyntaxError=e.I,exports.TlaUnsupportedError=e.V,exports.check=n.S,exports.formatValue=t.Kt,exports.parseConfig=t.Cn,exports.parseModule=t._t,exports.prove=n.o;
|
package/dist/index.d.cts
CHANGED
|
@@ -114,6 +114,7 @@ interface LetExpression {
|
|
|
114
114
|
kind: "Let";
|
|
115
115
|
definitions: Definition[];
|
|
116
116
|
instances?: Instance[];
|
|
117
|
+
recursive?: Declaration[];
|
|
117
118
|
body: Expression;
|
|
118
119
|
location: SourceLocation;
|
|
119
120
|
}
|
|
@@ -289,7 +290,12 @@ interface SubexpressionExpression {
|
|
|
289
290
|
argumentRanges?: (SourceRange | undefined)[];
|
|
290
291
|
location: SourceLocation;
|
|
291
292
|
}
|
|
292
|
-
|
|
293
|
+
interface SelectionExpression {
|
|
294
|
+
kind: "Selection";
|
|
295
|
+
expression: Expression;
|
|
296
|
+
location: SourceLocation;
|
|
297
|
+
}
|
|
298
|
+
type Expression = NumberExpression | DecimalExpression | StringExpression | IdentifierExpression | ApplyExpression | OperatorReferenceExpression | LambdaExpression | JunctionExpression | PrimeExpression | UnchangedExpression | EnabledExpression | IfExpression | CaseExpression | LetExpression | QuantifierExpression | UnboundedQuantifierExpression | ChooseExpression | SetEnumerationExpression | SetFilterExpression | SetMapExpression | TupleExpression | FunctionConstructionExpression | FunctionSetExpression | RecordExpression | ExceptExpression | ExceptAtExpression | FunctionApplicationExpression | BracketExpression | FieldAccessExpression | ProductExpression | TemporalExpression | ActionExpression | FairnessExpression | LabelExpression | SubexpressionExpression | SelectionExpression;
|
|
293
299
|
interface OperatorParam {
|
|
294
300
|
name: string;
|
|
295
301
|
arity: number;
|
|
@@ -872,6 +878,10 @@ interface Postcondition {
|
|
|
872
878
|
message: string;
|
|
873
879
|
counts?: string;
|
|
874
880
|
}
|
|
881
|
+
interface TraceFailure extends FailureMessage {
|
|
882
|
+
/** What the spec prints as TLC rebuilds the step it then fails to print. */
|
|
883
|
+
output: OutputLine[];
|
|
884
|
+
}
|
|
875
885
|
/** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
|
|
876
886
|
interface EvaluationFailure {
|
|
877
887
|
code: number;
|
|
@@ -888,7 +898,7 @@ interface EvaluationFailure {
|
|
|
888
898
|
/** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
|
|
889
899
|
fingerprint?: FingerprintFailure;
|
|
890
900
|
/** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
|
|
891
|
-
traceFailure?:
|
|
901
|
+
traceFailure?: TraceFailure;
|
|
892
902
|
/** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
|
|
893
903
|
postcondition?: Postcondition;
|
|
894
904
|
/** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
|
|
@@ -912,7 +922,7 @@ interface CheckResult {
|
|
|
912
922
|
outDegrees: number[] | undefined;
|
|
913
923
|
/** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
|
|
914
924
|
fingerprintDistance: bigint | undefined;
|
|
915
|
-
/** A temporal property TLC finds violated as it adds
|
|
925
|
+
/** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
|
|
916
926
|
additionalViolation?: Violation;
|
|
917
927
|
/** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
|
|
918
928
|
liveCallStack?: Expression[];
|
package/dist/index.d.ts
CHANGED
|
@@ -114,6 +114,7 @@ interface LetExpression {
|
|
|
114
114
|
kind: "Let";
|
|
115
115
|
definitions: Definition[];
|
|
116
116
|
instances?: Instance[];
|
|
117
|
+
recursive?: Declaration[];
|
|
117
118
|
body: Expression;
|
|
118
119
|
location: SourceLocation;
|
|
119
120
|
}
|
|
@@ -289,7 +290,12 @@ interface SubexpressionExpression {
|
|
|
289
290
|
argumentRanges?: (SourceRange | undefined)[];
|
|
290
291
|
location: SourceLocation;
|
|
291
292
|
}
|
|
292
|
-
|
|
293
|
+
interface SelectionExpression {
|
|
294
|
+
kind: "Selection";
|
|
295
|
+
expression: Expression;
|
|
296
|
+
location: SourceLocation;
|
|
297
|
+
}
|
|
298
|
+
type Expression = NumberExpression | DecimalExpression | StringExpression | IdentifierExpression | ApplyExpression | OperatorReferenceExpression | LambdaExpression | JunctionExpression | PrimeExpression | UnchangedExpression | EnabledExpression | IfExpression | CaseExpression | LetExpression | QuantifierExpression | UnboundedQuantifierExpression | ChooseExpression | SetEnumerationExpression | SetFilterExpression | SetMapExpression | TupleExpression | FunctionConstructionExpression | FunctionSetExpression | RecordExpression | ExceptExpression | ExceptAtExpression | FunctionApplicationExpression | BracketExpression | FieldAccessExpression | ProductExpression | TemporalExpression | ActionExpression | FairnessExpression | LabelExpression | SubexpressionExpression | SelectionExpression;
|
|
293
299
|
interface OperatorParam {
|
|
294
300
|
name: string;
|
|
295
301
|
arity: number;
|
|
@@ -872,6 +878,10 @@ interface Postcondition {
|
|
|
872
878
|
message: string;
|
|
873
879
|
counts?: string;
|
|
874
880
|
}
|
|
881
|
+
interface TraceFailure extends FailureMessage {
|
|
882
|
+
/** What the spec prints as TLC rebuilds the step it then fails to print. */
|
|
883
|
+
output: OutputLine[];
|
|
884
|
+
}
|
|
875
885
|
/** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
|
|
876
886
|
interface EvaluationFailure {
|
|
877
887
|
code: number;
|
|
@@ -888,7 +898,7 @@ interface EvaluationFailure {
|
|
|
888
898
|
/** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
|
|
889
899
|
fingerprint?: FingerprintFailure;
|
|
890
900
|
/** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
|
|
891
|
-
traceFailure?:
|
|
901
|
+
traceFailure?: TraceFailure;
|
|
892
902
|
/** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
|
|
893
903
|
postcondition?: Postcondition;
|
|
894
904
|
/** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
|
|
@@ -912,7 +922,7 @@ interface CheckResult {
|
|
|
912
922
|
outDegrees: number[] | undefined;
|
|
913
923
|
/** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
|
|
914
924
|
fingerprintDistance: bigint | undefined;
|
|
915
|
-
/** A temporal property TLC finds violated as it adds
|
|
925
|
+
/** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
|
|
916
926
|
additionalViolation?: Violation;
|
|
917
927
|
/** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
|
|
918
928
|
liveCallStack?: Expression[];
|
package/dist/index.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{I as e,V as t,b as n,v as r,x as i}from"./worker.js";import{Cn as a,Kt as o,_t as s}from"./transfer.js";import{S as c,o as l}from"./prove.js";export{r as TlaConfigError,n as TlaError,i as TlaEvaluationError,e as TlaSyntaxError,t as TlaUnsupportedError,c as check,o as formatValue,a as parseConfig,s as parseModule,l as prove};
|
package/dist/parallel-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.c(n.config,{...n,loadModule:a,loadClass:e=>o.get(e),seed:void 0},()=>{},!0),c=s.specification,l=c.environment,u=t.u(n.config,l,c.variableLocations,()=>s.order.getDeclarationOrder(`variable`),void 0,[],c.runtimeInvariants),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.c(n.config,{...n,loadModule:a,loadClass:e=>o.get(e),seed:void 0},()=>{},!0),c=s.specification,l=c.environment,u=t.u(n.config,l,c.variableLocations,()=>s.order.getDeclarationOrder(`variable`),void 0,[],c.runtimeInvariants),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.It(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.A():void 0,y=/* @__PURE__ */ new Int32Array(2),b=()=>{},x=e=>{};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>x(e.data)),e?.start?.()});let S=m(n.seed).map(p),C=e.t(),w=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},T=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&w(e,-1)},E=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},D=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&w(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.Q(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.R(h))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.B(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.B(a,y),t.I(h,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},O=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>x=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,E(e),!0}},k=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),A=async()=>{let e={states:S,origin:0,end:S.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=D(e);if(t===void 0)return;if(t===`break`)await C(),e.breakAt=performance.now()+100;else if(T(e),t===`paused`){let t=new Promise(e=>b=e);k({type:`paused`}),await t,E(e)}else if(!await O(e))break}let n=t.$t();return n===void 0?(S=e.next,Atomics.store(_,f,S.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:n}},j=()=>{A().then(e=>k(e??{type:`abort`}),()=>k({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&j(),t.type===`resize`&&(h=t.fingerprints,b())}),Atomics.store(_,f,S.length),k({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/parallel-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{n as e,t}from"./worker.js";import{
|
|
9
|
+
import{n as e,t}from"./worker.js";import{$t as n,A as r,B as i,I as a,It as o,Q as s,R as c,c as l,n as u,t as d,u as f}from"./transfer.js";const p=(e,p)=>{let m=new Map(e.modules),h=e=>m.get(e),g=new Map(e.classes),_=l(e.config,{...e,loadModule:h,loadClass:e=>g.get(e),seed:void 0},()=>{},!0),v=_.specification,y=v.environment,b=f(e.config,y,v.variableLocations,()=>_.order.getDeclarationOrder(`variable`),void 0,[],v.runtimeInvariants),x=b?.spec.next;if(!b||x===void 0)return p.postMessage({type:`abort`});let S=e.index,C=o(),w=d(y.variables.length),T=e.fingerprints,E=e.requests,D=e.remaining,O=b.isSymmetric?r():void 0,k=/* @__PURE__ */ new Int32Array(2),A=()=>{},j=e=>{};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>j(e.data)),e?.start?.()});let M=w(e.seed).map(C),N=t(),P=(t,n)=>{let r=Atomics.load(E,S)-1,i=Math.floor((t.end-t.origin-1)/2),a=u(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():u().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(E,S,n),Atomics.notify(E,S)},F=e=>{Atomics.store(D,S,0),Atomics.compareExchange(E,S,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(D,S,e.end-e.origin),Atomics.store(E,S,0)},L=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(E,S)>0&&P(t,0),Atomics.store(D,S,t.end-t.origin-1),t.successors=s(x,n,y,b.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let r=t.successors;for(;t.index<r.length;t.index++){if(c(T))return`paused`;let e=r[t.index];if(b.findViolatedActionProperty(n,e.state))return;if(!b.satisfiesActionConstraints(n,e.state)){if(b.findViolatedInvariant(e.state,n))return;continue}if(O&&(i(e.state,k),!O.insert(k[0],k[1])))continue;C(e.state);let o=b.getFingerprintState(e.state);if(i(o,k),a(T,k[0],k[1])){if(b.findViolatedInvariant(e.state,n))return;b.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(o),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},R=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(D,r)<2?e:e===void 0||Atomics.load(D,r)>Atomics.load(D,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(E,r,0,S+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(E,r,i),i!==0)continue;let a=await new Promise(e=>j=e);if(a.count===0)n.add(r);else return t.states=w(a).map(C),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>p.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async()=>{let e={states:M,origin:0,end:M.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=L(e);if(t===void 0)return;if(t===`break`)await N(),e.breakAt=performance.now()+100;else if(F(e),t===`paused`){let t=new Promise(e=>A=e);z({type:`paused`}),await t,I(e)}else if(!await R(e))break}let t=n();return t===void 0?(M=e.next,Atomics.store(D,S,M.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:b.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t}},V=()=>{B().then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};p.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(),t.type===`resize`&&(T=t.fingerprints,A())}),Atomics.store(D,S,M.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{p(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/prove-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.M)return{error:t.message};throw t}};e.n().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
|
package/dist/prove-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{M as e,n as t}from"./worker.js";import{t as n}from"./deciders.js";const r=t=>{try{return n(t.prover,t.text,{timeLimitMs:t.timeLimitMs})}catch(t){if(t instanceof e)return{error:t.message};throw t}};t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(r(t.data))),e.start?.()});
|