tla-ts 0.0.10-dev.f57f64938 → 0.0.10-dev.fdc173479

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 (271) 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 +53 -53
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +18 -4
  7. package/dist/index.d.ts +18 -4
  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 +56 -56
  14. package/dist/prove.js +79 -79
  15. package/dist/run.cjs +40 -44
  16. package/dist/run.js +42 -46
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +97 -92
  20. package/dist/transfer.js +97 -92
  21. package/dist/worker.cjs +7 -7
  22. package/dist/worker.js +7 -7
  23. package/package.json +1 -1
  24. package/src/ast.ts +31 -3
  25. package/src/bags.ts +50 -29
  26. package/src/builtins.ts +4 -3
  27. package/src/check-failure.ts +13 -11
  28. package/src/check-trace.ts +146 -107
  29. package/src/check.ts +535 -281
  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 +18 -4
  33. package/src/cli/tlc.ts +18 -12
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +23 -10
  36. package/src/coverage.ts +255 -18
  37. package/src/dependencies.ts +68 -15
  38. package/src/dfid.ts +101 -36
  39. package/src/environment.ts +123 -38
  40. package/src/errors.ts +7 -0
  41. package/src/evaluate.ts +424 -135
  42. package/src/exit-codes.ts +28 -13
  43. package/src/instances.ts +135 -11
  44. package/src/java-hash.ts +14 -0
  45. package/src/java-overrides.ts +2 -2
  46. package/src/levels.ts +675 -236
  47. package/src/lexer.ts +12 -2
  48. package/src/liveness-checker.ts +204 -62
  49. package/src/liveness.ts +55 -10
  50. package/src/obligations/index.ts +1 -1
  51. package/src/obligations/normalize.ts +1 -4
  52. package/src/obligations/printer.ts +5 -5
  53. package/src/obligations/source.ts +2 -0
  54. package/src/parallel-worker.ts +8 -2
  55. package/src/parallel.ts +5 -0
  56. package/src/parser.ts +180 -149
  57. package/src/prover/isabelle/isar/attrib.ts +4 -4
  58. package/src/prover/isabelle/isar/rule-cases.ts +8 -6
  59. package/src/prover/isabelle/provers/clasimp.ts +1 -1
  60. package/src/prover/isabelle/provers/hypsubst.ts +2 -2
  61. package/src/prover/isabelle/pure/rewriter.ts +3 -3
  62. package/src/prover/isabelle/pure/term.ts +3 -3
  63. package/src/prover/prep/md5.ts +26 -29
  64. package/src/prover/smt/rewrite.ts +2 -7
  65. package/src/prover/smt/simplify.ts +1 -1
  66. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +3 -2
  67. package/src/prover/smt/solver/arith-rewriter.ts +11 -3
  68. package/src/prover/smt/solver/array-rewriter.ts +12 -2
  69. package/src/prover/smt/solver/asserted-formulas.ts +171 -58
  70. package/src/prover/smt/solver/ast-lt.ts +1 -1
  71. package/src/prover/smt/solver/ast.ts +66 -14
  72. package/src/prover/smt/solver/auf-solver.ts +23 -12
  73. package/src/prover/smt/solver/bit-blast-tactic.ts +28 -2
  74. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  75. package/src/prover/smt/solver/bound-simplifier.ts +11 -13
  76. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
  77. package/src/prover/smt/solver/bv-rewriter.ts +1 -1
  78. package/src/prover/smt/solver/bv1-blast.ts +1 -1
  79. package/src/prover/smt/solver/card2bv.ts +35 -18
  80. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -24
  81. package/src/prover/smt/solver/context.ts +84 -15
  82. package/src/prover/smt/solver/ctx-simplify.ts +9 -4
  83. package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
  84. package/src/prover/smt/solver/dependent-expr-state.ts +28 -16
  85. package/src/prover/smt/solver/diff-neq.ts +9 -8
  86. package/src/prover/smt/solver/dt2bv-tactic.ts +66 -28
  87. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  88. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  89. package/src/prover/smt/solver/elim-uncnstr.ts +31 -28
  90. package/src/prover/smt/solver/eq2bv-tactic.ts +15 -6
  91. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
  92. package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
  93. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
  94. package/src/prover/smt/solver/euf/egraph.ts +4 -10
  95. package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
  96. package/src/prover/smt/solver/euf/mam.ts +1 -5
  97. package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
  98. package/src/prover/smt/solver/euf/th-solver.ts +0 -7
  99. package/src/prover/smt/solver/expr2polynomial.ts +204 -79
  100. package/src/prover/smt/solver/factor.ts +36 -14
  101. package/src/prover/smt/solver/fd-solver.ts +608 -139
  102. package/src/prover/smt/solver/fix-dl-var.ts +2 -3
  103. package/src/prover/smt/solver/fm-tactic.ts +9 -7
  104. package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
  105. package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
  106. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
  107. package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -1
  108. package/src/prover/smt/solver/goal.ts +6 -3
  109. package/src/prover/smt/solver/goal2nlsat.ts +57 -30
  110. package/src/prover/smt/solver/hashtable.ts +4 -0
  111. package/src/prover/smt/solver/internalizer.ts +1 -1
  112. package/src/prover/smt/solver/lia2pb.ts +1 -1
  113. package/src/prover/smt/solver/logic-tactics.ts +15 -5
  114. package/src/prover/smt/solver/lp/containers.ts +7 -1
  115. package/src/prover/smt/solver/lp/core-solver.ts +12 -8
  116. package/src/prover/smt/solver/lp/cross-nested.ts +1 -3
  117. package/src/prover/smt/solver/lp/lar-solver.ts +1 -1
  118. package/src/prover/smt/solver/lp/lp-settings.ts +6 -2
  119. package/src/prover/smt/solver/lp/nex-creator.ts +3 -2
  120. package/src/prover/smt/solver/lp/nex.ts +2 -1
  121. package/src/prover/smt/solver/lp/nla-basics.ts +46 -1
  122. package/src/prover/smt/solver/lp/nla-core.ts +26 -6
  123. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -81
  124. package/src/prover/smt/solver/lp/nra-solver.ts +138 -95
  125. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -2
  126. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -20
  127. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -39
  128. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  129. package/src/prover/smt/solver/lp/union-find.ts +1 -1
  130. package/src/prover/smt/solver/mam-compiler.ts +1 -1
  131. package/src/prover/smt/solver/maxcore.ts +2 -1
  132. package/src/prover/smt/solver/maxsmt-base.ts +1 -0
  133. package/src/prover/smt/solver/model-based-opt.ts +1 -1
  134. package/src/prover/smt/solver/model-checker.ts +1 -1
  135. package/src/prover/smt/solver/model-evaluator.ts +2 -0
  136. package/src/prover/smt/solver/model-generator.ts +85 -43
  137. package/src/prover/smt/solver/mpf.ts +2 -4
  138. package/src/prover/smt/solver/mus.ts +2 -3
  139. package/src/prover/smt/solver/muz/dl-context.ts +22 -44
  140. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +1 -1
  141. package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
  142. package/src/prover/smt/solver/muz/dl-rule.ts +8 -9
  143. package/src/prover/smt/solver/muz/hnf.ts +2 -2
  144. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
  145. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -2
  146. package/src/prover/smt/solver/muz/rule-properties.ts +22 -0
  147. package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
  148. package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
  149. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -1
  150. package/src/prover/smt/solver/nlqsat.ts +2 -1
  151. package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
  152. package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
  153. package/src/prover/smt/solver/nlsat/explain.ts +375 -217
  154. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
  155. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
  156. package/src/prover/smt/solver/nlsat/solver.ts +74 -71
  157. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
  158. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
  159. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
  160. package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
  161. package/src/prover/smt/solver/nnf.ts +6 -2
  162. package/src/prover/smt/solver/normalize-bounds.ts +2 -2
  163. package/src/prover/smt/solver/occf.ts +1 -1
  164. package/src/prover/smt/solver/opt-context.ts +21 -7
  165. package/src/prover/smt/solver/opt-nlsat.ts +29 -18
  166. package/src/prover/smt/solver/opt-pareto.ts +19 -0
  167. package/src/prover/smt/solver/opt-preprocess.ts +1 -1
  168. package/src/prover/smt/solver/opt-solver.ts +10 -6
  169. package/src/prover/smt/solver/optsmt.ts +1 -1
  170. package/src/prover/smt/solver/parallel-tactic.ts +1 -1
  171. package/src/prover/smt/solver/pb-rewriter.ts +1 -4
  172. package/src/prover/smt/solver/pb2bv-tactic.ts +9 -3
  173. package/src/prover/smt/solver/poly-rewriter.ts +75 -18
  174. package/src/prover/smt/solver/probes.ts +88 -23
  175. package/src/prover/smt/solver/proto-model.ts +8 -8
  176. package/src/prover/smt/solver/purify-arith.ts +51 -49
  177. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  178. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
  179. package/src/prover/smt/solver/qe-lite.ts +2 -2
  180. package/src/prover/smt/solver/qe.ts +3 -2
  181. package/src/prover/smt/solver/qsat.ts +23 -8
  182. package/src/prover/smt/solver/quantifier-manager.ts +14 -9
  183. package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
  184. package/src/prover/smt/solver/reduce-args.ts +2 -2
  185. package/src/prover/smt/solver/rewriter-tpl.ts +7 -6
  186. package/src/prover/smt/solver/rewriter.ts +31 -25
  187. package/src/prover/smt/solver/rlimit.ts +20 -3
  188. package/src/prover/smt/solver/sat/config.ts +1 -1
  189. package/src/prover/smt/solver/sat/goal2sat.ts +75 -12
  190. package/src/prover/smt/solver/sat/inc-sat-solver.ts +149 -47
  191. package/src/prover/smt/solver/sat/model-converter.ts +1 -1
  192. package/src/prover/smt/solver/sat/pb-constraint.ts +7 -0
  193. package/src/prover/smt/solver/sat/pb-solver.ts +26 -7
  194. package/src/prover/smt/solver/sat/sat-tactic.ts +54 -25
  195. package/src/prover/smt/solver/sat/sat2goal.ts +75 -50
  196. package/src/prover/smt/solver/sat/simplifier.ts +1 -1
  197. package/src/prover/smt/solver/sat/solver.ts +27 -47
  198. package/src/prover/smt/solver/seq-axioms.ts +20 -35
  199. package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
  200. package/src/prover/smt/solver/seq-derive.ts +4 -7
  201. package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
  202. package/src/prover/smt/solver/seq-monadic.ts +7 -5
  203. package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
  204. package/src/prover/smt/solver/seq-re-util.ts +1 -1
  205. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
  206. package/src/prover/smt/solver/seq-regex-live.ts +2 -2
  207. package/src/prover/smt/solver/seq-rewriter.ts +31 -29
  208. package/src/prover/smt/solver/seq-skolem.ts +0 -23
  209. package/src/prover/smt/solver/seq-view-witness.ts +4 -4
  210. package/src/prover/smt/solver/smt-consequences.ts +1 -1
  211. package/src/prover/smt/solver/smt-kernel.ts +48 -7
  212. package/src/prover/smt/solver/smt-setup.ts +106 -13
  213. package/src/prover/smt/solver/smtlib-parser.ts +589 -224
  214. package/src/prover/smt/solver/smtlib-script.ts +718 -213
  215. package/src/prover/smt/solver/solve-eqs.ts +36 -37
  216. package/src/prover/smt/solver/solver.ts +18 -4
  217. package/src/prover/smt/solver/tactic.ts +389 -199
  218. package/src/prover/smt/solver/theory-bv.ts +13 -3
  219. package/src/prover/smt/solver/theory-fpa.ts +1 -1
  220. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
  221. package/src/prover/smt/solver/theory-lra-internalize.ts +10 -0
  222. package/src/prover/smt/solver/theory-lra-propagate.ts +12 -3
  223. package/src/prover/smt/solver/theory-lra-state.ts +1 -1
  224. package/src/prover/smt/solver/theory-lra.ts +1 -1
  225. package/src/prover/smt/solver/theory-pb.ts +24 -7
  226. package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
  227. package/src/prover/smt/solver/theory-seq-state.ts +2 -21
  228. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  229. package/src/prover/smt/solver/tseitin-cnf.ts +15 -5
  230. package/src/prover/tlapm/cache.ts +8 -8
  231. package/src/prover/zenon/equality-rules.ts +24 -0
  232. package/src/prover/zenon/expr.ts +21 -0
  233. package/src/prover/zenon/index-table.ts +7 -2
  234. package/src/prover/zenon/isar-case.ts +1 -1
  235. package/src/prover/zenon/isar.ts +2 -2
  236. package/src/prover/zenon/phrase.ts +1 -1
  237. package/src/prover/zenon/rules.ts +2 -1
  238. package/src/resolve.ts +1274 -257
  239. package/src/runtime.ts +21 -2
  240. package/src/sany/builtins.ts +10 -10
  241. package/src/sany/generation.ts +5 -15
  242. package/src/sany/generator-def-entries.ts +123 -36
  243. package/src/sany/generator-definitions.ts +5 -3
  244. package/src/sany/generator-expressions.ts +60 -37
  245. package/src/sany/generator-proofs.ts +18 -12
  246. package/src/sany/generator.ts +12 -6
  247. package/src/sany/lexer.ts +15 -7
  248. package/src/sany/modules.ts +4 -2
  249. package/src/sany/nodes.ts +1 -1
  250. package/src/sany/selectors.ts +11 -6
  251. package/src/sany/xml.ts +2 -3
  252. package/src/search.ts +321 -135
  253. package/src/simulate.ts +250 -185
  254. package/src/spec-description.ts +15 -7
  255. package/src/standard-definitions.ts +1 -0
  256. package/src/standard-modules.ts +56 -22
  257. package/src/subexpressions.ts +564 -138
  258. package/src/successors.ts +50 -20
  259. package/src/symmetry.ts +2 -1
  260. package/src/tlc/jar-data.ts +10 -0
  261. package/src/tlc/messages.ts +3 -3
  262. package/src/tlc/order.ts +14 -3
  263. package/src/tlc/random.ts +2 -1
  264. package/src/tlc/replay.ts +147 -46
  265. package/src/tlc/tlc-operators.ts +10 -8
  266. package/src/tlc/tlcext-operators.ts +44 -15
  267. package/src/tlc/trace-spec.ts +11 -25
  268. package/src/trace-liveness.ts +529 -0
  269. package/src/typed-tier.ts +52 -31
  270. package/src/typescript/types.ts +2 -2
  271. package/src/values.ts +150 -79
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.Bt,exports.parseConfig=t.tr,exports.parseModule=t.Mn,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
  }
@@ -203,10 +204,12 @@ type ExceptPathStep = {
203
204
  } | {
204
205
  kind: "Index";
205
206
  args: Expression[];
207
+ tupleRange: SourceRange;
206
208
  };
207
209
  interface ExceptUpdate {
208
210
  path: ExceptPathStep[];
209
211
  value: Expression;
212
+ range: SourceRange;
210
213
  }
211
214
  interface ExceptExpression {
212
215
  kind: "Except";
@@ -289,7 +292,12 @@ interface SubexpressionExpression {
289
292
  argumentRanges?: (SourceRange | undefined)[];
290
293
  location: SourceLocation;
291
294
  }
292
- 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;
295
+ interface SelectionExpression {
296
+ kind: "Selection";
297
+ expression: Expression;
298
+ location: SourceLocation;
299
+ }
300
+ 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
301
  interface OperatorParam {
294
302
  name: string;
295
303
  arity: number;
@@ -477,6 +485,7 @@ interface Module {
477
485
  theorems: Theorem[];
478
486
  uses: UseOrHide[];
479
487
  units: ModuleUnit[];
488
+ hasRecursiveLet: boolean;
480
489
  }
481
490
  type TlcVersion = "1.7.4" | "master";
482
491
  type ConfigValue = {
@@ -650,6 +659,7 @@ interface FilteredSetValue extends LazySet {
650
659
  kind: "FilteredSet";
651
660
  base: Value;
652
661
  test: (element: Value, isMember: boolean) => boolean;
662
+ startPass?: (isMaterialized: boolean) => (element: Value) => boolean;
653
663
  source?: FilteredSetSource;
654
664
  }
655
665
  interface UnionValue extends LazySet {
@@ -815,7 +825,7 @@ type CheckProgress = {
815
825
  branches: number;
816
826
  /** Whether TLC checks the complete state graph. */
817
827
  isComplete: boolean;
818
- /** How many states of the graph each branch has. */
828
+ /** How many states the graphs of all branches have together. */
819
829
  states: number;
820
830
  statistics: SearchStatistics;
821
831
  } | {
@@ -872,6 +882,10 @@ interface Postcondition {
872
882
  message: string;
873
883
  counts?: string;
874
884
  }
885
+ interface TraceFailure extends FailureMessage {
886
+ /** What the spec prints as TLC rebuilds the step it then fails to print. */
887
+ output: OutputLine[];
888
+ }
875
889
  /** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
876
890
  interface EvaluationFailure {
877
891
  code: number;
@@ -888,7 +902,7 @@ interface EvaluationFailure {
888
902
  /** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
889
903
  fingerprint?: FingerprintFailure;
890
904
  /** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
891
- traceFailure?: FailureMessage;
905
+ traceFailure?: TraceFailure;
892
906
  /** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
893
907
  postcondition?: Postcondition;
894
908
  /** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
@@ -912,7 +926,7 @@ interface CheckResult {
912
926
  outDegrees: number[] | undefined;
913
927
  /** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
914
928
  fingerprintDistance: bigint | undefined;
915
- /** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
929
+ /** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
916
930
  additionalViolation?: Violation;
917
931
  /** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
918
932
  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
  }
@@ -203,10 +204,12 @@ type ExceptPathStep = {
203
204
  } | {
204
205
  kind: "Index";
205
206
  args: Expression[];
207
+ tupleRange: SourceRange;
206
208
  };
207
209
  interface ExceptUpdate {
208
210
  path: ExceptPathStep[];
209
211
  value: Expression;
212
+ range: SourceRange;
210
213
  }
211
214
  interface ExceptExpression {
212
215
  kind: "Except";
@@ -289,7 +292,12 @@ interface SubexpressionExpression {
289
292
  argumentRanges?: (SourceRange | undefined)[];
290
293
  location: SourceLocation;
291
294
  }
292
- 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;
295
+ interface SelectionExpression {
296
+ kind: "Selection";
297
+ expression: Expression;
298
+ location: SourceLocation;
299
+ }
300
+ 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
301
  interface OperatorParam {
294
302
  name: string;
295
303
  arity: number;
@@ -477,6 +485,7 @@ interface Module {
477
485
  theorems: Theorem[];
478
486
  uses: UseOrHide[];
479
487
  units: ModuleUnit[];
488
+ hasRecursiveLet: boolean;
480
489
  }
481
490
  type TlcVersion = "1.7.4" | "master";
482
491
  type ConfigValue = {
@@ -650,6 +659,7 @@ interface FilteredSetValue extends LazySet {
650
659
  kind: "FilteredSet";
651
660
  base: Value;
652
661
  test: (element: Value, isMember: boolean) => boolean;
662
+ startPass?: (isMaterialized: boolean) => (element: Value) => boolean;
653
663
  source?: FilteredSetSource;
654
664
  }
655
665
  interface UnionValue extends LazySet {
@@ -815,7 +825,7 @@ type CheckProgress = {
815
825
  branches: number;
816
826
  /** Whether TLC checks the complete state graph. */
817
827
  isComplete: boolean;
818
- /** How many states of the graph each branch has. */
828
+ /** How many states the graphs of all branches have together. */
819
829
  states: number;
820
830
  statistics: SearchStatistics;
821
831
  } | {
@@ -872,6 +882,10 @@ interface Postcondition {
872
882
  message: string;
873
883
  counts?: string;
874
884
  }
885
+ interface TraceFailure extends FailureMessage {
886
+ /** What the spec prints as TLC rebuilds the step it then fails to print. */
887
+ output: OutputLine[];
888
+ }
875
889
  /** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
876
890
  interface EvaluationFailure {
877
891
  code: number;
@@ -888,7 +902,7 @@ interface EvaluationFailure {
888
902
  /** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
889
903
  fingerprint?: FingerprintFailure;
890
904
  /** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
891
- traceFailure?: FailureMessage;
905
+ traceFailure?: TraceFailure;
892
906
  /** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
893
907
  postcondition?: Postcondition;
894
908
  /** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
@@ -912,7 +926,7 @@ interface CheckResult {
912
926
  outDegrees: number[] | undefined;
913
927
  /** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
914
928
  fingerprintDistance: bigint | undefined;
915
- /** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
929
+ /** A temporal property TLC finds violated as it adds the state it stopped at to the behavior graph, reported after. */
916
930
  additionalViolation?: Violation;
917
931
  /** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
918
932
  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{Bt as a,Mn as o,tr 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.u(n.config,{...n,loadModule:a,loadClass:e=>o.get(e),seed:void 0},()=>{},!0),c=s.specification,l=c.environment,u=t.f(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.At(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.N():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.nt(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.V(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.U(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.U(a,y),t.z(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.qt();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{At as n,N as r,U as i,V as a,f as o,n as s,nt as c,qt as l,t as u,u as d,z 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),_=d(e.config,{...e,loadModule:h,loadClass:e=>g.get(e),seed:void 0},()=>{},!0),v=_.specification,y=v.environment,b=o(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=n(),w=u(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=s(),o=t.states.slice(t.end-i,t.end),c=i>0&&o.every(a.encode);c&&(t.end-=i);let l=c?a.finish():s().finish();e.ports[r]?.postMessage(l,[l.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=c(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(a(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),f(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=l();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?.()});