tla-ts 0.0.10-dev.99796fe03 → 0.0.10-dev.a17d6d9fa

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 (226) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +36 -36
  4. package/dist/deciders.js +54 -54
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +3 -2
  7. package/dist/index.d.ts +3 -2
  8. package/dist/index.js +1 -1
  9. package/dist/parallel-worker.cjs +1 -1
  10. package/dist/parallel-worker.js +1 -1
  11. package/dist/prove-worker.cjs +1 -1
  12. package/dist/prove-worker.js +1 -1
  13. package/dist/prove.cjs +60 -60
  14. package/dist/prove.js +78 -78
  15. package/dist/run.cjs +42 -44
  16. package/dist/run.js +44 -46
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +43 -43
  20. package/dist/transfer.js +39 -39
  21. package/dist/worker.cjs +6 -6
  22. package/dist/worker.js +6 -6
  23. package/package.json +1 -1
  24. package/src/ast.ts +1 -0
  25. package/src/bags.ts +50 -29
  26. package/src/builtins.ts +4 -3
  27. package/src/check-failure.ts +1 -1
  28. package/src/check-trace.ts +90 -51
  29. package/src/check.ts +367 -178
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +1 -2
  33. package/src/cli/tlc.ts +16 -10
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +26 -9
  36. package/src/dependencies.ts +49 -9
  37. package/src/dfid.ts +22 -10
  38. package/src/environment.ts +58 -33
  39. package/src/errors.ts +7 -0
  40. package/src/evaluate.ts +117 -41
  41. package/src/exit-codes.ts +4 -2
  42. package/src/instances.ts +5 -5
  43. package/src/java-hash.ts +14 -0
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/liveness-checker.ts +81 -33
  47. package/src/liveness.ts +49 -11
  48. package/src/obligations/index.ts +1 -1
  49. package/src/obligations/normalize.ts +1 -4
  50. package/src/obligations/printer.ts +5 -5
  51. package/src/parallel-worker.ts +8 -2
  52. package/src/parallel.ts +5 -0
  53. package/src/parser.ts +112 -145
  54. package/src/prover/isabelle/isar/attrib.ts +4 -4
  55. package/src/prover/isabelle/isar/rule-cases.ts +8 -6
  56. package/src/prover/isabelle/provers/clasimp.ts +1 -1
  57. package/src/prover/isabelle/provers/hypsubst.ts +2 -2
  58. package/src/prover/isabelle/pure/rewriter.ts +3 -3
  59. package/src/prover/isabelle/pure/term.ts +3 -3
  60. package/src/prover/prep/md5.ts +26 -29
  61. package/src/prover/smt/rewrite.ts +2 -7
  62. package/src/prover/smt/simplify.ts +1 -1
  63. package/src/prover/smt/solver/arith-rewriter.ts +11 -3
  64. package/src/prover/smt/solver/array-rewriter.ts +12 -2
  65. package/src/prover/smt/solver/asserted-formulas.ts +169 -58
  66. package/src/prover/smt/solver/ast-lt.ts +1 -1
  67. package/src/prover/smt/solver/ast.ts +63 -14
  68. package/src/prover/smt/solver/auf-solver.ts +23 -12
  69. package/src/prover/smt/solver/bit-blast-tactic.ts +26 -0
  70. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  71. package/src/prover/smt/solver/bound-simplifier.ts +11 -13
  72. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
  73. package/src/prover/smt/solver/bv-rewriter.ts +1 -1
  74. package/src/prover/smt/solver/card2bv.ts +32 -18
  75. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -24
  76. package/src/prover/smt/solver/context.ts +47 -9
  77. package/src/prover/smt/solver/ctx-simplify.ts +1 -2
  78. package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
  79. package/src/prover/smt/solver/dependent-expr-state.ts +9 -4
  80. package/src/prover/smt/solver/diff-neq.ts +1 -2
  81. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  82. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  83. package/src/prover/smt/solver/elim-uncnstr.ts +5 -8
  84. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
  85. package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
  86. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
  87. package/src/prover/smt/solver/euf/egraph.ts +4 -11
  88. package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
  89. package/src/prover/smt/solver/euf/mam.ts +1 -5
  90. package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
  91. package/src/prover/smt/solver/euf/th-solver.ts +0 -7
  92. package/src/prover/smt/solver/expr2polynomial.ts +204 -79
  93. package/src/prover/smt/solver/factor.ts +36 -14
  94. package/src/prover/smt/solver/fd-solver.ts +2 -0
  95. package/src/prover/smt/solver/fix-dl-var.ts +1 -2
  96. package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
  97. package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
  98. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
  99. package/src/prover/smt/solver/goal.ts +6 -3
  100. package/src/prover/smt/solver/goal2nlsat.ts +57 -30
  101. package/src/prover/smt/solver/hashtable.ts +4 -0
  102. package/src/prover/smt/solver/internalizer.ts +1 -1
  103. package/src/prover/smt/solver/logic-tactics.ts +9 -2
  104. package/src/prover/smt/solver/lp/lp-settings.ts +5 -1
  105. package/src/prover/smt/solver/lp/nla-core.ts +1 -1
  106. package/src/prover/smt/solver/lp/nla-grobner.ts +2 -2
  107. package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
  108. package/src/prover/smt/solver/lp/pdd.ts +2 -3
  109. package/src/prover/smt/solver/lp/union-find.ts +1 -1
  110. package/src/prover/smt/solver/mam-compiler.ts +1 -1
  111. package/src/prover/smt/solver/model-based-opt.ts +1 -1
  112. package/src/prover/smt/solver/model-evaluator.ts +2 -0
  113. package/src/prover/smt/solver/model-generator.ts +85 -43
  114. package/src/prover/smt/solver/mpf.ts +2 -4
  115. package/src/prover/smt/solver/mus.ts +2 -3
  116. package/src/prover/smt/solver/muz/dl-context.ts +10 -4
  117. package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
  118. package/src/prover/smt/solver/muz/dl-rule.ts +2 -2
  119. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
  120. package/src/prover/smt/solver/muz/horn-tactic.ts +1 -1
  121. package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
  122. package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
  123. package/src/prover/smt/solver/nlqsat.ts +1 -1
  124. package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
  125. package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
  126. package/src/prover/smt/solver/nlsat/explain.ts +375 -217
  127. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
  128. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
  129. package/src/prover/smt/solver/nlsat/solver.ts +74 -64
  130. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
  131. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
  132. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
  133. package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
  134. package/src/prover/smt/solver/nnf.ts +6 -2
  135. package/src/prover/smt/solver/opt-context.ts +20 -7
  136. package/src/prover/smt/solver/opt-nlsat.ts +29 -18
  137. package/src/prover/smt/solver/opt-pareto.ts +19 -0
  138. package/src/prover/smt/solver/opt-preprocess.ts +1 -1
  139. package/src/prover/smt/solver/opt-solver.ts +9 -5
  140. package/src/prover/smt/solver/optsmt.ts +1 -1
  141. package/src/prover/smt/solver/pb-rewriter.ts +1 -4
  142. package/src/prover/smt/solver/poly-rewriter.ts +75 -18
  143. package/src/prover/smt/solver/probes.ts +88 -23
  144. package/src/prover/smt/solver/proto-model.ts +8 -8
  145. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  146. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
  147. package/src/prover/smt/solver/qe-lite.ts +2 -2
  148. package/src/prover/smt/solver/qe.ts +3 -2
  149. package/src/prover/smt/solver/qsat.ts +16 -6
  150. package/src/prover/smt/solver/quantifier-manager.ts +14 -9
  151. package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
  152. package/src/prover/smt/solver/rewriter.ts +31 -25
  153. package/src/prover/smt/solver/rlimit.ts +4 -0
  154. package/src/prover/smt/solver/sat/config.ts +1 -1
  155. package/src/prover/smt/solver/sat/goal2sat.ts +0 -1
  156. package/src/prover/smt/solver/sat/inc-sat-solver.ts +39 -5
  157. package/src/prover/smt/solver/sat/model-converter.ts +1 -1
  158. package/src/prover/smt/solver/sat/pb-solver.ts +1 -1
  159. package/src/prover/smt/solver/sat/sat-tactic.ts +13 -5
  160. package/src/prover/smt/solver/sat/simplifier.ts +1 -1
  161. package/src/prover/smt/solver/sat/solver.ts +25 -47
  162. package/src/prover/smt/solver/seq-axioms.ts +20 -35
  163. package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
  164. package/src/prover/smt/solver/seq-derive.ts +2 -2
  165. package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
  166. package/src/prover/smt/solver/seq-monadic.ts +7 -5
  167. package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
  168. package/src/prover/smt/solver/seq-re-util.ts +1 -1
  169. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
  170. package/src/prover/smt/solver/seq-regex-live.ts +2 -2
  171. package/src/prover/smt/solver/seq-rewriter.ts +31 -29
  172. package/src/prover/smt/solver/seq-skolem.ts +0 -23
  173. package/src/prover/smt/solver/seq-view-witness.ts +4 -4
  174. package/src/prover/smt/solver/smt-kernel.ts +39 -5
  175. package/src/prover/smt/solver/smt-setup.ts +96 -10
  176. package/src/prover/smt/solver/smtlib-parser.ts +584 -223
  177. package/src/prover/smt/solver/smtlib-script.ts +509 -154
  178. package/src/prover/smt/solver/solve-eqs.ts +36 -37
  179. package/src/prover/smt/solver/solver.ts +18 -3
  180. package/src/prover/smt/solver/tactic.ts +284 -168
  181. package/src/prover/smt/solver/theory-bv.ts +13 -3
  182. package/src/prover/smt/solver/theory-fpa.ts +1 -1
  183. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
  184. package/src/prover/smt/solver/theory-lra-internalize.ts +2 -0
  185. package/src/prover/smt/solver/theory-lra-propagate.ts +11 -3
  186. package/src/prover/smt/solver/theory-lra.ts +1 -1
  187. package/src/prover/smt/solver/theory-pb.ts +24 -7
  188. package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
  189. package/src/prover/smt/solver/theory-seq-state.ts +2 -21
  190. package/src/prover/smt/solver/tseitin-cnf.ts +1 -0
  191. package/src/prover/tlapm/cache.ts +8 -8
  192. package/src/prover/zenon/index-table.ts +5 -2
  193. package/src/prover/zenon/isar-case.ts +1 -1
  194. package/src/prover/zenon/isar.ts +2 -2
  195. package/src/prover/zenon/phrase.ts +1 -1
  196. package/src/resolve.ts +959 -243
  197. package/src/runtime.ts +7 -1
  198. package/src/sany/builtins.ts +10 -10
  199. package/src/sany/generation.ts +2 -13
  200. package/src/sany/generator-definitions.ts +3 -1
  201. package/src/sany/generator-expressions.ts +36 -30
  202. package/src/sany/generator-proofs.ts +5 -3
  203. package/src/sany/generator.ts +2 -1
  204. package/src/sany/lexer.ts +3 -3
  205. package/src/sany/modules.ts +4 -2
  206. package/src/sany/nodes.ts +1 -1
  207. package/src/sany/selectors.ts +11 -6
  208. package/src/sany/xml.ts +2 -3
  209. package/src/search.ts +166 -101
  210. package/src/simulate.ts +110 -50
  211. package/src/spec-description.ts +5 -6
  212. package/src/standard-modules.ts +15 -6
  213. package/src/subexpressions.ts +398 -108
  214. package/src/successors.ts +4 -2
  215. package/src/symmetry.ts +1 -1
  216. package/src/tlc/jar-data.ts +10 -0
  217. package/src/tlc/messages.ts +3 -3
  218. package/src/tlc/order.ts +14 -3
  219. package/src/tlc/random.ts +2 -1
  220. package/src/tlc/replay.ts +3 -2
  221. package/src/tlc/tlc-operators.ts +10 -8
  222. package/src/tlc/tlcext-operators.ts +44 -15
  223. package/src/tlc/trace-spec.ts +9 -22
  224. package/src/typed-tier.ts +32 -25
  225. package/src/typescript/types.ts +2 -2
  226. 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._,exports.TlaError=e.y,exports.TlaEvaluationError=e.b,exports.TlaSyntaxError=e.F,exports.TlaUnsupportedError=e.B,exports.check=n.S,exports.formatValue=t.Ht,exports.parseConfig=t.gn,exports.parseModule=t.x,exports.prove=n.o;
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.Wt,exports.parseConfig=t.xn,exports.parseModule=t.x,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
  }
@@ -815,7 +816,7 @@ type CheckProgress = {
815
816
  branches: number;
816
817
  /** Whether TLC checks the complete state graph. */
817
818
  isComplete: boolean;
818
- /** How many states of the graph each branch has. */
819
+ /** How many states the graphs of all branches have together. */
819
820
  states: number;
820
821
  statistics: SearchStatistics;
821
822
  } | {
@@ -912,7 +913,7 @@ interface CheckResult {
912
913
  outDegrees: number[] | undefined;
913
914
  /** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
914
915
  fingerprintDistance: bigint | undefined;
915
- /** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
916
+ /** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
916
917
  additionalViolation?: Violation;
917
918
  /** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
918
919
  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
  }
@@ -815,7 +816,7 @@ type CheckProgress = {
815
816
  branches: number;
816
817
  /** Whether TLC checks the complete state graph. */
817
818
  isComplete: boolean;
818
- /** How many states of the graph each branch has. */
819
+ /** How many states the graphs of all branches have together. */
819
820
  states: number;
820
821
  statistics: SearchStatistics;
821
822
  } | {
@@ -912,7 +913,7 @@ interface CheckResult {
912
913
  outDegrees: number[] | undefined;
913
914
  /** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
914
915
  fingerprintDistance: bigint | undefined;
915
- /** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
916
+ /** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
916
917
  additionalViolation?: Violation;
917
918
  /** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
918
919
  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{B as e,F as t,_ as n,b as r,y as i}from"./worker.js";import{Ht as a,gn as o,x as s}from"./transfer.js";import{S as c,o as l}from"./prove.js";export{n as TlaConfigError,i as TlaError,r as TlaEvaluationError,t as TlaSyntaxError,e as TlaUnsupportedError,c as check,a as formatValue,o as parseConfig,s as parseModule,l as prove};
9
+ import{I as e,V as t,b as n,v as r,x as i}from"./worker.js";import{Wt as a,x as o,xn 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,a as formatValue,s as parseConfig,o 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=(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`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Mt(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.P():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.tt(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.H(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.W(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.W(a,y),t.B(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.Yt();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?.()});
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.Pt(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.P():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.tt(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.H(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.W(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.W(a,y),t.B(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.Zt();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?.()});
@@ -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{B as n,H as r,Mt as i,P as a,W as o,Yt as s,c,n as l,t as u,tt 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),_=c(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`)),x=b?.spec.next;if(!b||x===void 0)return p.postMessage({type:`abort`});let S=e.index,C=i(),w=u(y.variables.length),T=e.fingerprints,E=e.requests,D=e.remaining,O=b.isSymmetric?a():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=l(),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():l().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 i=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=d(x,i,y,b.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let a=t.successors;for(;t.index<a.length;t.index++){if(r(T))return`paused`;let e=a[t.index];if(b.findViolatedActionProperty(i,e.state))return;if(!b.satisfiesActionConstraints(i,e.state)){if(b.findViolatedInvariant(e.state,i))return;continue}if(O&&(o(e.state,k),!O.insert(k[0],k[1])))continue;C(e.state);let s=b.getFingerprintState(e.state);if(o(s,k),n(T,k[0],k[1])){if(b.findViolatedInvariant(e.state,i))return;b.satisfiesConstraints(e.state,i)&&(t.next.push(e.state),t.fingerprintStates.push(s),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=s();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?.()});
9
+ import{n as e,t}from"./worker.js";import{B as n,H as r,P as i,Pt as a,W as o,Zt as s,c,n as l,t as u,tt 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),_=c(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=a(),w=u(y.variables.length),T=e.fingerprints,E=e.requests,D=e.remaining,O=b.isSymmetric?i():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=l(),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():l().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 i=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=d(x,i,y,b.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let a=t.successors;for(;t.index<a.length;t.index++){if(r(T))return`paused`;let e=a[t.index];if(b.findViolatedActionProperty(i,e.state))return;if(!b.satisfiesActionConstraints(i,e.state)){if(b.findViolatedInvariant(e.state,i))return;continue}if(O&&(o(e.state,k),!O.insert(k[0],k[1])))continue;C(e.state);let s=b.getFingerprintState(e.state);if(o(s,k),n(T,k[0],k[1])){if(b.findViolatedInvariant(e.state,i))return;b.satisfiesConstraints(e.state,i)&&(t.next.push(e.state),t.fingerprintStates.push(s),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=s();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?.()});
@@ -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.j)return{error:t.message};throw t}};e.n().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.M)return{error:t.message};throw t}};e.n().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{j 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?.()});
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?.()});