tla-ts 0.0.4-dev.c4929d7 → 0.0.4-dev.ca40dfe

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.
Files changed (207) hide show
  1. package/README.md +31 -6
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +27 -27
  5. package/dist/deciders.js +34 -34
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +12 -14
  8. package/dist/index.d.ts +12 -14
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +37 -27
  15. package/dist/prove.js +39 -29
  16. package/dist/run.cjs +45 -0
  17. package/dist/run.js +45 -0
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +76 -86
  21. package/dist/transfer.js +73 -83
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +1 -1
  25. package/src/ast.ts +2 -2
  26. package/src/bags.ts +22 -23
  27. package/src/builtins.ts +16 -8
  28. package/src/check.ts +131 -1154
  29. package/src/{cli-options.ts → cli/options.ts} +54 -9
  30. package/src/cli/run.ts +63 -0
  31. package/src/cli/shared.ts +106 -0
  32. package/src/cli/tlapm.ts +374 -0
  33. package/src/cli/tlc.ts +941 -0
  34. package/src/cli/xml-exporter.ts +221 -0
  35. package/src/cli.ts +1 -1
  36. package/src/codegen.ts +17 -15
  37. package/src/config.ts +5 -5
  38. package/src/dependencies.ts +4 -6
  39. package/src/environment.ts +55 -60
  40. package/src/errors.ts +12 -36
  41. package/src/evaluate.ts +81 -101
  42. package/src/exit-codes.ts +1 -1
  43. package/src/fingerprints.ts +3 -3
  44. package/src/instances.ts +56 -46
  45. package/src/java-overrides.ts +79 -41
  46. package/src/json.ts +31 -36
  47. package/src/levels.ts +10 -13
  48. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  49. package/src/liveness.ts +38 -34
  50. package/src/obligations/action.ts +9 -45
  51. package/src/obligations/{anon.ts → anonymize.ts} +13 -25
  52. package/src/obligations/equality.ts +260 -0
  53. package/src/obligations/expression.ts +42 -517
  54. package/src/obligations/generate.ts +88 -778
  55. package/src/obligations/index.ts +20 -22
  56. package/src/obligations/levels.ts +36 -41
  57. package/src/obligations/module.ts +88 -708
  58. package/src/obligations/normalize.ts +554 -0
  59. package/src/obligations/operators.ts +176 -0
  60. package/src/obligations/pragma.ts +21 -15
  61. package/src/obligations/printer.ts +81 -188
  62. package/src/obligations/proof.ts +0 -1
  63. package/src/obligations/regroup.ts +100 -0
  64. package/src/obligations/simplify.ts +668 -0
  65. package/src/obligations/source.ts +25 -131
  66. package/src/obligations/{deref.ts → subexpression.ts} +48 -56
  67. package/src/obligations/substitution.ts +261 -0
  68. package/src/obligations/temporal.ts +28 -26
  69. package/src/obligations/tuples.ts +37 -53
  70. package/src/parallel-worker.ts +37 -33
  71. package/src/parallel.ts +30 -24
  72. package/src/parser.ts +67 -74
  73. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  74. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  75. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  76. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  77. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  78. package/src/prove/decide-pool.ts +7 -12
  79. package/src/{obligations/pickle.ts → prove/first-order.ts} +79 -2
  80. package/src/prove/isabelle/decide.ts +3 -6
  81. package/src/prove/isabelle/encode.ts +35 -93
  82. package/src/prove/isabelle/isar/inner-syntax.ts +1 -1
  83. package/src/prove/isabelle/isar/method.ts +3 -3
  84. package/src/prove/isabelle/isar/type-check.ts +1 -1
  85. package/src/prove/isabelle/provers/blast/blast.ts +1 -1
  86. package/src/prove/isabelle/provers/blast/branch.ts +1 -1
  87. package/src/prove/isabelle/provers/blast/term.ts +3 -4
  88. package/src/prove/isabelle/provers/clasimp.ts +1 -1
  89. package/src/prove/isabelle/provers/classical.ts +3 -3
  90. package/src/prove/isabelle/provers/hypsubst.ts +1 -9
  91. package/src/prove/isabelle/pure/conv.ts +1 -1
  92. package/src/prove/isabelle/pure/drule.ts +2 -2
  93. package/src/prove/isabelle/pure/envir.ts +3 -35
  94. package/src/prove/isabelle/pure/logic.ts +4 -76
  95. package/src/prove/isabelle/pure/name.ts +1 -13
  96. package/src/prove/isabelle/pure/net.ts +2 -49
  97. package/src/prove/isabelle/pure/pattern.ts +3 -22
  98. package/src/prove/isabelle/pure/raw-simplifier.ts +3 -18
  99. package/src/prove/isabelle/pure/seq.ts +0 -23
  100. package/src/prove/isabelle/pure/simplifier.ts +2 -8
  101. package/src/prove/isabelle/pure/table.ts +1 -8
  102. package/src/prove/isabelle/pure/tactic.ts +5 -113
  103. package/src/prove/isabelle/pure/tactical.ts +1 -84
  104. package/src/prove/isabelle/pure/term-ord.ts +1 -55
  105. package/src/prove/isabelle/pure/term.ts +8 -128
  106. package/src/prove/isabelle/pure/thm.ts +4 -27
  107. package/src/prove/isabelle/pure/type.ts +0 -12
  108. package/src/prove/isabelle/pure/unify.ts +1 -1
  109. package/src/prove/isabelle/tla/classical-setup.ts +1 -1
  110. package/src/prove/ocaml.ts +1 -1
  111. package/src/prove/prep/action.ts +23 -36
  112. package/src/prove/prep/enabled-axioms.ts +2 -2
  113. package/src/prove/prep/fingerprint.ts +3 -3
  114. package/src/prove/prep/level-comparison.ts +9 -37
  115. package/src/prove/prep/md5.ts +2 -9
  116. package/src/prove/prep/normalize.ts +309 -0
  117. package/src/prove/prove-worker.ts +2 -5
  118. package/src/prove/prove.ts +98 -111
  119. package/src/prove/ptl/encode.ts +19 -31
  120. package/src/prove/smt/axioms.ts +45 -58
  121. package/src/prove/smt/encode.ts +124 -15
  122. package/src/prove/smt/instances.ts +2 -3
  123. package/src/prove/smt/rewrite.ts +24 -31
  124. package/src/prove/smt/solver/ast-util.ts +0 -56
  125. package/src/prove/smt/solver/case-split-queue.ts +1 -1
  126. package/src/prove/smt/solver/enode.ts +1 -1
  127. package/src/prove/smt/solver/lp/dep-intervals.ts +0 -14
  128. package/src/prove/smt/solver/model-macro-solver.ts +1 -1
  129. package/src/prove/smt/solver/nlsat/algebraic.ts +3 -3
  130. package/src/prove/smt/solver/nlsat/atoms.ts +1 -1
  131. package/src/prove/smt/solver/nlsat/explain.ts +1 -1
  132. package/src/prove/smt/solver/nlsat/interval-set.ts +1 -1
  133. package/src/prove/smt/solver/nlsat/levelwise.ts +4 -7
  134. package/src/prove/smt/solver/nlsat/polynomial.ts +4 -4
  135. package/src/prove/smt/solver/nlsat/upolynomial.ts +2 -2
  136. package/src/prove/smt/solver/pattern-inference.ts +1 -1
  137. package/src/prove/smt/solver/relevancy.ts +2 -2
  138. package/src/prove/smt/solver/rewriter.ts +1 -1
  139. package/src/prove/smt/solver/solver.ts +2 -2
  140. package/src/{tlapm-cache.ts → prove/tlapm/cache.ts} +11 -11
  141. package/src/{ocaml-marshal.ts → prove/tlapm/ocaml-marshal.ts} +1 -1
  142. package/src/prove/verdict.ts +0 -5
  143. package/src/prove/zenon/decide.ts +5 -11
  144. package/src/prove/zenon/encode.ts +21 -80
  145. package/src/prove/zenon/eqrel.ts +1 -1
  146. package/src/prove/zenon/equality-rules.ts +1 -1
  147. package/src/prove/zenon/expr.ts +2 -2
  148. package/src/prove/zenon/index-table.ts +1 -1
  149. package/src/prove/zenon/isar.ts +1 -1
  150. package/src/prove/zenon/llproof.ts +1 -1
  151. package/src/prove/zenon/mltoll.ts +1 -1
  152. package/src/prove/zenon/node.ts +1 -1
  153. package/src/prove/zenon/search.ts +1 -1
  154. package/src/prove/zenon/tla/terms.ts +1 -20
  155. package/src/prove/zenon/tla/tla.ts +1 -1
  156. package/src/randomization.ts +19 -24
  157. package/src/resolve.ts +15 -22
  158. package/src/runtime.ts +8 -8
  159. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  160. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  161. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  162. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  163. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  164. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  165. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  166. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  167. package/src/{sany-report.ts → sany/report.ts} +16 -17
  168. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  169. package/src/{sany-source.ts → sany/source.ts} +6 -7
  170. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  171. package/src/search.ts +969 -0
  172. package/src/spec-description.ts +26 -20
  173. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  174. package/src/standard-modules.ts +16 -20
  175. package/src/state-graph.ts +9 -8
  176. package/src/substitution-levels.ts +2 -2
  177. package/src/successors.ts +16 -19
  178. package/src/symmetry.ts +1 -1
  179. package/src/tableau.ts +6 -7
  180. package/src/tlc/fingerprint.ts +214 -0
  181. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  182. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  183. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  184. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  185. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  186. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  187. package/src/transfer.ts +32 -32
  188. package/src/values.ts +72 -67
  189. package/src/worker.ts +1 -4
  190. package/dist/run-cli.cjs +0 -45
  191. package/dist/run-cli.js +0 -45
  192. package/src/canonical.ts +0 -40
  193. package/src/obligations/ctx.ts +0 -64
  194. package/src/prove/prep/defs.ts +0 -33
  195. package/src/prove/prep/elab.ts +0 -156
  196. package/src/prove/prep/enabled.ts +0 -43
  197. package/src/prove/prep/flatten.ts +0 -70
  198. package/src/prove/prep/trivial.ts +0 -22
  199. package/src/prove/smt/axiomatize.ts +0 -69
  200. package/src/prove/smt/simplify.ts +0 -57
  201. package/src/run-cli.ts +0 -1806
  202. package/src/standard-ranges.ts +0 -116
  203. package/src/value-sources.ts +0 -29
  204. /package/src/prove/prep/{pragma.ts → methods.ts} +0 -0
  205. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  206. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  207. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
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.m,exports.TlaError=e.h,exports.TlaEvaluationError=e.g,exports.TlaSyntaxError=e.D,exports.TlaUnsupportedError=e.k,exports.check=n.g,exports.formatValue=t.J,exports.parseConfig=t.Q,exports.parseModule=t.O,exports.prove=n.a;
9
+ Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.m,exports.TlaError=e.h,exports.TlaEvaluationError=e.g,exports.TlaSyntaxError=e.D,exports.TlaUnsupportedError=e.k,exports.check=n.m,exports.formatValue=t.Mt,exports.parseConfig=n.h,exports.parseModule=t.H,exports.prove=n.r;
package/dist/index.d.cts CHANGED
@@ -521,12 +521,6 @@ interface ModelConfig {
521
521
  rlReward: string | undefined;
522
522
  }
523
523
  export declare const parseConfig: (source: string, version?: TlcVersion) => ModelConfig;
524
- interface JavaOverride {
525
- module: string;
526
- operator: string;
527
- signature: string;
528
- isMatched: boolean;
529
- }
530
524
  export declare class TlaError extends Error {
531
525
  constructor(message: string, cause?: unknown);
532
526
  }
@@ -660,6 +654,12 @@ interface FingerprintFailure {
660
654
  sources: Expression[];
661
655
  reason: string;
662
656
  }
657
+ interface JavaOverride {
658
+ module: string;
659
+ operator: string;
660
+ signature: string;
661
+ isMatched: boolean;
662
+ }
663
663
  interface StateDump {
664
664
  path: string;
665
665
  dot?: boolean;
@@ -667,6 +667,11 @@ interface StateDump {
667
667
  actionLabels?: boolean;
668
668
  snapshot?: boolean;
669
669
  }
670
+ interface FailureMessage {
671
+ code: number;
672
+ message: string;
673
+ toolMessage: string;
674
+ }
670
675
  interface CheckOptions {
671
676
  source: string;
672
677
  config: string | ModelConfig;
@@ -800,11 +805,6 @@ interface CheckResult {
800
805
  liveCallStack?: Expression[];
801
806
  violationOutDegrees?: number[];
802
807
  }
803
- interface FailureMessage {
804
- code: number;
805
- message: string;
806
- toolMessage: string;
807
- }
808
808
  export declare const check: (options: CheckOptions) => Promise<CheckResult>;
809
809
  export declare const parseModule: (source: string) => Module;
810
810
  interface ObligationBase {
@@ -830,12 +830,10 @@ interface ProveResult {
830
830
  missingProofCount: number;
831
831
  omittedProofCount: number;
832
832
  }
833
- declare const PROVE_BACKENDS: readonly ["tla-ts", "tlapm"];
834
- type ProveBackend = (typeof PROVE_BACKENDS)[number];
835
833
  interface ProveOptions {
836
834
  source: string;
837
835
  loadModule?: (name: string) => string | undefined;
838
- backend?: ProveBackend;
836
+ backend?: "tla-ts" | "tlapm";
839
837
  signal?: AbortSignal;
840
838
  onObligation?: (obligation: ProofObligation) => void;
841
839
  workers?: number;
package/dist/index.d.ts CHANGED
@@ -521,12 +521,6 @@ interface ModelConfig {
521
521
  rlReward: string | undefined;
522
522
  }
523
523
  export declare const parseConfig: (source: string, version?: TlcVersion) => ModelConfig;
524
- interface JavaOverride {
525
- module: string;
526
- operator: string;
527
- signature: string;
528
- isMatched: boolean;
529
- }
530
524
  export declare class TlaError extends Error {
531
525
  constructor(message: string, cause?: unknown);
532
526
  }
@@ -660,6 +654,12 @@ interface FingerprintFailure {
660
654
  sources: Expression[];
661
655
  reason: string;
662
656
  }
657
+ interface JavaOverride {
658
+ module: string;
659
+ operator: string;
660
+ signature: string;
661
+ isMatched: boolean;
662
+ }
663
663
  interface StateDump {
664
664
  path: string;
665
665
  dot?: boolean;
@@ -667,6 +667,11 @@ interface StateDump {
667
667
  actionLabels?: boolean;
668
668
  snapshot?: boolean;
669
669
  }
670
+ interface FailureMessage {
671
+ code: number;
672
+ message: string;
673
+ toolMessage: string;
674
+ }
670
675
  interface CheckOptions {
671
676
  source: string;
672
677
  config: string | ModelConfig;
@@ -800,11 +805,6 @@ interface CheckResult {
800
805
  liveCallStack?: Expression[];
801
806
  violationOutDegrees?: number[];
802
807
  }
803
- interface FailureMessage {
804
- code: number;
805
- message: string;
806
- toolMessage: string;
807
- }
808
808
  export declare const check: (options: CheckOptions) => Promise<CheckResult>;
809
809
  export declare const parseModule: (source: string) => Module;
810
810
  interface ObligationBase {
@@ -830,12 +830,10 @@ interface ProveResult {
830
830
  missingProofCount: number;
831
831
  omittedProofCount: number;
832
832
  }
833
- declare const PROVE_BACKENDS: readonly ["tla-ts", "tlapm"];
834
- type ProveBackend = (typeof PROVE_BACKENDS)[number];
835
833
  interface ProveOptions {
836
834
  source: string;
837
835
  loadModule?: (name: string) => string | undefined;
838
- backend?: ProveBackend;
836
+ backend?: "tla-ts" | "tlapm";
839
837
  signal?: AbortSignal;
840
838
  onObligation?: (obligation: ProofObligation) => void;
841
839
  workers?: number;
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{D as e,g as t,h as n,k as r,m as i}from"./worker.js";import{J as a,O as o,Q as s}from"./transfer.js";import{a as c,g as l}from"./prove.js";export{i as TlaConfigError,n as TlaError,t as TlaEvaluationError,e as TlaSyntaxError,r as TlaUnsupportedError,l as check,a as formatValue,s as parseConfig,o as parseModule,c as prove};
9
+ import{D as e,g as t,h as n,k as r,m as i}from"./worker.js";import{H as a,Mt as o}from"./transfer.js";import{h as s,m as c,r as l}from"./prove.js";export{i as TlaConfigError,n as TlaError,t as TlaEvaluationError,e as TlaSyntaxError,r as TlaUnsupportedError,c as check,o as formatValue,s as parseConfig,a as parseModule,l as prove};
@@ -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=(e,n)=>{let r=new Map(e.modules),i=e=>r.get(e),a=new Map(e.classes);t.X(t.x(e.source,e.config,i)),t.Z(e.version);let o=t.Y(),s=t.y(e.config,{source:e.source,loadModule:i,loadClass:e=>a.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,c=t.u(e.config,s,()=>t.b(e.source,i,`variable`)),l=c?.spec.next;if(!c||l===void 0)return n.postMessage({type:`abort`});let u=e.index,d=t.K(),f=t.t(s.variables.length),p={fingerprints:e.fingerprints},m=e.requests,h=e.remaining,g=c.isSymmetric?t.r():void 0,_=/* @__PURE__ */ new Int32Array(2),v={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>v.loot(e.data)),e?.start?.()});let y={states:f(e.seed).map(d)},b=(n,r)=>{let i=Atomics.load(m,u)-1,a=Math.floor((n.end-n.origin-1)/2),o=t.n(),s=n.states.slice(n.end-a,n.end),c=a>0&&s.every(o.encode);c&&(n.end-=a);let l=c?o.finish():t.n().finish();e.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(m,u,r),Atomics.notify(m,u)},x=e=>{Atomics.store(h,u,0),Atomics.compareExchange(m,u,0,-1)!==0&&b(e,-1)},S=e=>{Atomics.store(h,u,e.end-e.origin),Atomics.store(m,u,0)},C=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(m,u)>0&&b(n,0),Atomics.store(h,u,n.end-n.origin-1),n.successors=t.I(l,r,s,c.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&e.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(t.s(p.fingerprints))return`paused`;let e=i[n.index];if(c.findViolatedActionProperty(r,e.state))return;if(!c.satisfiesActionConstraints(r,e.state)){if(c.findViolatedInvariant(e.state,r))return;continue}if(g&&(t.c(e.state,_),!g.insert(_[0],_[1])))continue;d(e.state);let a=c.getFingerprintState(e.state);if(t.c(a,_),t.o(p.fingerprints,_[0],_[1])){if(c.findViolatedInvariant(e.state,r))return;c.satisfiesConstraints(e.state,r)&&(n.next.push(e.state),n.fingerprintStates.push(a),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.added=0}return`done`},w=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(h,r)<2?e:e===void 0||Atomics.load(h,r)>Atomics.load(h,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(m,r,0,u+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(m,r,i),i!==0)continue;let a=await new Promise(e=>v.loot=e);if(a.count===0)n.add(r);else return t.states=f(a).map(d),t.origin=0,t.end=t.states.length,S(t),!0}},T=e=>n.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),E=async e=>{let n={states:y.states,origin:0,end:y.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=C(n);if(e===void 0)return;if(x(n),e===`paused`){let e=new Promise(e=>v.resume=e);T({type:`paused`}),await e,S(n)}else if(!await w(n))break}if(t.Y()===o)return y.states=n.next,Atomics.store(h,u,y.states.length),{type:`level`,level:e,generated:n.generated,added:n.next.length,outDegrees:n.outDegrees,fingerprints:c.getStoredFingerprints(n.next,n.fingerprintStates)}},D=e=>{E(e).then(e=>T(e??{type:`abort`}),()=>T({type:`abort`}))};n.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&D(t.level),t.type===`resize`&&(p.fingerprints=t.fingerprints,v.resume())}),Atomics.store(h,u,y.states.length),T({type:`ready`})};e.t().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?.()});
9
+ const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(e,n)=>{let r=new Map(e.modules),i=e=>r.get(e),a=new Map(e.classes);t.Bt(t.N(e.source,e.config,i)),t.Vt(e.version);let o=t.Ft(),s=t.M(e.config,{source:e.source,loadModule:i,loadClass:e=>a.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,c=t.h(e.config,s,()=>t.P(e.source,i)),l=c?.spec.next;if(!c||l===void 0)return n.postMessage({type:`abort`});let u=e.index,d=t.Et(),f=t.t(s.variables.length),p={fingerprints:e.fingerprints},m=e.requests,h=e.remaining,g=c.isSymmetric?t.r():void 0,_=/* @__PURE__ */ new Int32Array(2),v={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>v.loot(e.data)),e?.start?.()});let y={states:f(e.seed).map(d)},b=(n,r)=>{let i=Atomics.load(m,u)-1,a=Math.floor((n.end-n.origin-1)/2),o=t.n(),s=n.states.slice(n.end-a,n.end),c=a>0&&s.every(o.encode);c&&(n.end-=a);let l=c?o.finish():t.n().finish();e.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(m,u,r),Atomics.notify(m,u)},x=e=>{Atomics.store(h,u,0),Atomics.compareExchange(m,u,0,-1)!==0&&b(e,-1)},S=e=>{Atomics.store(h,u,e.end-e.origin),Atomics.store(m,u,0)},C=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(m,u)>0&&b(n,0),Atomics.store(h,u,n.end-n.origin-1),n.successors=t.lt(l,r,s,c.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&e.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(t.s(p.fingerprints))return`paused`;let e=i[n.index];if(c.findViolatedActionProperty(r,e.state))return;if(!c.satisfiesActionConstraints(r,e.state)){if(c.findViolatedInvariant(e.state,r))return;continue}if(g&&(t.c(e.state,_),!g.insert(_[0],_[1])))continue;d(e.state);let a=c.getFingerprintState(e.state);if(t.c(a,_),t.o(p.fingerprints,_[0],_[1])){if(c.findViolatedInvariant(e.state,r))return;c.satisfiesConstraints(e.state,r)&&(n.next.push(e.state),n.fingerprintStates.push(a),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.added=0}return`done`},w=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(h,r)<2?e:e===void 0||Atomics.load(h,r)>Atomics.load(h,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(m,r,0,u+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(m,r,i),i!==0)continue;let a=await new Promise(e=>v.loot=e);if(a.count===0)n.add(r);else return t.states=f(a).map(d),t.origin=0,t.end=t.states.length,S(t),!0}},T=e=>n.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),E=async()=>{let e={states:y.states,origin:0,end:y.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let t=C(e);if(t===void 0)return;if(x(e),t===`paused`){let t=new Promise(e=>v.resume=e);T({type:`paused`}),await t,S(e)}else if(!await w(e))break}if(t.Ft()===o)return y.states=e.next,Atomics.store(h,u,y.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:c.getStoredFingerprints(e.next,e.fingerprintStates)}},D=()=>{E().then(e=>T(e??{type:`abort`}),()=>T({type:`abort`}))};n.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&D(),t.type===`resize`&&(p.fingerprints=t.fingerprints,v.resume())}),Atomics.store(h,u,y.states.length),T({type:`ready`})};e.t().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?.()});
@@ -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{t as e}from"./worker.js";import{I as t,K as n,X as r,Y as i,Z as a,b as o,c as s,n as c,o as l,r as u,s as d,t as f,u as p,x as m,y as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes);r(m(e.source,e.config,v)),a(e.version);let b=i(),x=h(e.config,{source:e.source,loadModule:v,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,S=p(e.config,x,()=>o(e.source,v,`variable`)),C=S?.spec.next;if(!S||C===void 0)return g.postMessage({type:`abort`});let w=e.index,T=n(),E=f(x.variables.length),D={fingerprints:e.fingerprints},O=e.requests,k=e.remaining,A=S.isSymmetric?u():void 0,j=/* @__PURE__ */ new Int32Array(2),M={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>M.loot(e.data)),e?.start?.()});let N={states:E(e.seed).map(T)},P=(t,n)=>{let r=Atomics.load(O,w)-1,i=Math.floor((t.end-t.origin-1)/2),a=c(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let l=s?a.finish():c().finish();e.ports[r]?.postMessage(l,[l.words.buffer]),Atomics.store(O,w,n),Atomics.notify(O,w)},F=e=>{Atomics.store(k,w,0),Atomics.compareExchange(O,w,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(k,w,e.end-e.origin),Atomics.store(O,w,0)},L=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(O,w)>0&&P(n,0),Atomics.store(k,w,n.end-n.origin-1),n.successors=t(C,r,x,S.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&e.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(d(D.fingerprints))return`paused`;let e=i[n.index];if(S.findViolatedActionProperty(r,e.state))return;if(!S.satisfiesActionConstraints(r,e.state)){if(S.findViolatedInvariant(e.state,r))return;continue}if(A&&(s(e.state,j),!A.insert(j[0],j[1])))continue;T(e.state);let t=S.getFingerprintState(e.state);if(s(t,j),l(D.fingerprints,j[0],j[1])){if(S.findViolatedInvariant(e.state,r))return;S.satisfiesConstraints(e.state,r)&&(n.next.push(e.state),n.fingerprintStates.push(t),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.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(k,r)<2?e:e===void 0||Atomics.load(k,r)>Atomics.load(k,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(O,r,0,w+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(O,r,i),i!==0)continue;let a=await new Promise(e=>M.loot=e);if(a.count===0)n.add(r);else return t.states=E(a).map(T),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async e=>{let t={states:N.states,origin:0,end:N.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=L(t);if(e===void 0)return;if(F(t),e===`paused`){let e=new Promise(e=>M.resume=e);z({type:`paused`}),await e,I(t)}else if(!await R(t))break}if(i()===b)return N.states=t.next,Atomics.store(k,w,N.states.length),{type:`level`,level:e,generated:t.generated,added:t.next.length,outDegrees:t.outDegrees,fingerprints:S.getStoredFingerprints(t.next,t.fingerprintStates)}},V=e=>{B(e).then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(t.level),t.type===`resize`&&(D.fingerprints=t.fingerprints,M.resume())}),Atomics.store(k,w,N.states.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
9
+ import{t as e}from"./worker.js";import{Bt as t,Et as n,Ft as r,M as i,N as a,P as o,Vt as s,c,h as l,lt as u,n as d,o as f,r as p,s as m,t as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes);t(a(e.source,e.config,v)),s(e.version);let b=r(),x=i(e.config,{source:e.source,loadModule:v,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,S=l(e.config,x,()=>o(e.source,v)),C=S?.spec.next;if(!S||C===void 0)return g.postMessage({type:`abort`});let w=e.index,T=n(),E=h(x.variables.length),D={fingerprints:e.fingerprints},O=e.requests,k=e.remaining,A=S.isSymmetric?p():void 0,j=/* @__PURE__ */ new Int32Array(2),M={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>M.loot(e.data)),e?.start?.()});let N={states:E(e.seed).map(T)},P=(t,n)=>{let r=Atomics.load(O,w)-1,i=Math.floor((t.end-t.origin-1)/2),a=d(),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():d().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(O,w,n),Atomics.notify(O,w)},F=e=>{Atomics.store(k,w,0),Atomics.compareExchange(O,w,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(k,w,e.end-e.origin),Atomics.store(O,w,0)},L=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors&&(Atomics.load(O,w)>0&&P(t,0),Atomics.store(k,w,t.end-t.origin-1),t.successors=u(C,n,x,S.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(m(D.fingerprints))return`paused`;let e=r[t.index];if(S.findViolatedActionProperty(n,e.state))return;if(!S.satisfiesActionConstraints(n,e.state)){if(S.findViolatedInvariant(e.state,n))return;continue}if(A&&(c(e.state,j),!A.insert(j[0],j[1])))continue;T(e.state);let i=S.getFingerprintState(e.state);if(c(i,j),f(D.fingerprints,j[0],j[1])){if(S.findViolatedInvariant(e.state,n))return;S.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(i),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(k,r)<2?e:e===void 0||Atomics.load(k,r)>Atomics.load(k,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(O,r,0,w+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(O,r,i),i!==0)continue;let a=await new Promise(e=>M.loot=e);if(a.count===0)n.add(r);else return t.states=E(a).map(T),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async()=>{let e={states:N.states,origin:0,end:N.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let t=L(e);if(t===void 0)return;if(F(e),t===`paused`){let t=new Promise(e=>M.resume=e);z({type:`paused`}),await t,I(e)}else if(!await R(e))break}if(r()===b)return N.states=e.next,Atomics.store(k,w,N.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:S.getStoredFingerprints(e.next,e.fingerprintStates)}},V=()=>{B().then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(),t.type===`resize`&&(D.fingerprints=t.fingerprints,M.resume())}),Atomics.store(k,w,N.states.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
@@ -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.w)return{error:{name:`TlaProverError`,message:t.message}};if(t instanceof e.k)return{error:{name:`TlaUnsupportedError`,message:t.message}};throw t}};e.t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
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.w)return{error:t.message};throw t}};e.t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
@@ -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{k as e,t,w as n}from"./worker.js";import{t as r}from"./deciders.js";const i=t=>{try{return r(t.prover,t.text,{timeLimitMs:t.timeLimitMs})}catch(t){if(t instanceof n)return{error:{name:`TlaProverError`,message:t.message}};if(t instanceof e)return{error:{name:`TlaUnsupportedError`,message:t.message}};throw t}};t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(i(t.data))),e.start?.()});
9
+ import{t as e,w as t}from"./worker.js";import{t as n}from"./deciders.js";const r=e=>{try{return n(e.prover,e.text,{timeLimitMs:e.timeLimitMs})}catch(e){if(e instanceof t)return{error:e.message};throw e}};e().then(e=>{e.addEventListener(`message`,t=>e.postMessage(r(t.data))),e.start?.()});