tla-ts 0.0.8 → 0.0.9-dev.0493be549

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 (390) hide show
  1. package/README.md +30 -0
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +43 -43
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +98 -19
  8. package/dist/index.d.ts +98 -19
  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 +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +128 -106
  21. package/dist/transfer.js +128 -106
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +7 -21
  26. package/src/bags.ts +99 -99
  27. package/src/builtins.ts +44 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +605 -311
  30. package/src/cli/options.ts +12 -6
  31. package/src/cli/run.ts +2 -2
  32. package/src/cli/runtime-invariants.ts +135 -0
  33. package/src/cli/shared.ts +20 -9
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +646 -0
  36. package/src/cli/tlc-usage.ts +362 -0
  37. package/src/cli/tlc.ts +545 -218
  38. package/src/cli/typescript.ts +23 -0
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -69
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +314 -24
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +263 -129
  47. package/src/errors.ts +70 -55
  48. package/src/evaluate.ts +734 -980
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +79 -11
  53. package/src/java-overrides.ts +2 -12
  54. package/src/json-reader.ts +456 -0
  55. package/src/json.ts +262 -139
  56. package/src/levels.ts +2 -3
  57. package/src/lexer.ts +150 -70
  58. package/src/liveness-checker.ts +10 -18
  59. package/src/liveness.ts +122 -64
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +31 -38
  82. package/src/parallel.ts +41 -17
  83. package/src/parser.ts +436 -90
  84. package/src/pcal/ast.ts +7 -28
  85. package/src/pcal/parse.ts +11 -39
  86. package/src/pcal/tokenize.ts +4 -20
  87. package/src/pcal/translate.ts +10 -42
  88. package/src/pcal/validate.ts +3 -21
  89. package/src/pretty-print.ts +1 -2
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +23 -34
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +84 -35
  336. package/src/resolve.ts +18 -60
  337. package/src/runtime.ts +11 -4
  338. package/src/sany/builtins.ts +3 -4
  339. package/src/sany/generator.ts +128 -176
  340. package/src/sany/levels.ts +6 -30
  341. package/src/sany/lexer.ts +7 -23
  342. package/src/sany/linter.ts +31 -29
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +536 -180
  351. package/src/simulate.ts +694 -0
  352. package/src/spec-description.ts +167 -49
  353. package/src/standard-definitions.ts +2 -3
  354. package/src/standard-modules.ts +264 -68
  355. package/src/state-graph.ts +51 -18
  356. package/src/subexpressions.ts +31 -5
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +269 -85
  359. package/src/symmetry.ts +59 -147
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +226 -151
  362. package/src/tlc/jar-data.ts +113 -6
  363. package/src/tlc/messages.ts +122 -37
  364. package/src/tlc/order.ts +56 -82
  365. package/src/tlc/random.ts +16 -16
  366. package/src/tlc/replay.ts +564 -212
  367. package/src/tlc/summary.ts +2 -4
  368. package/src/tlc/tlc-operators.ts +81 -36
  369. package/src/tlc/tlcext-operators.ts +138 -117
  370. package/src/tlc/trace-spec.ts +273 -0
  371. package/src/tlc/value-stream.ts +143 -0
  372. package/src/tlc/version.ts +2 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +481 -0
  375. package/src/typescript/collections.ts +600 -0
  376. package/src/typescript/compile.ts +65 -0
  377. package/src/typescript/context.ts +94 -0
  378. package/src/typescript/emit.ts +121 -0
  379. package/src/typescript/expressions.ts +496 -0
  380. package/src/typescript/formula.ts +152 -0
  381. package/src/typescript/functions.ts +284 -0
  382. package/src/typescript/model.ts +163 -0
  383. package/src/typescript/names.ts +114 -0
  384. package/src/typescript/program.ts +48 -0
  385. package/src/typescript/properties.ts +139 -0
  386. package/src/typescript/scope.ts +112 -0
  387. package/src/typescript/steps.ts +165 -0
  388. package/src/typescript/types.ts +171 -0
  389. package/src/values.ts +910 -318
  390. package/src/worker.ts +7 -8
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.h,exports.TlaError=e.g,exports.TlaEvaluationError=e._,exports.TlaSyntaxError=e.O,exports.TlaUnsupportedError=e.A,exports.check=n.m,exports.formatValue=t.jt,exports.parseConfig=n.h,exports.parseModule=t.V,exports.prove=n.r;
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.m,exports.formatValue=t.Ot,exports.parseConfig=t.en,exports.parseModule=t.V,exports.prove=n.r;
package/dist/index.d.cts CHANGED
@@ -6,6 +6,7 @@
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 "@typescript/typescript6";
9
10
  interface LocalResolution {
10
11
  kind: "Local";
11
12
  }
@@ -106,6 +107,7 @@ interface CaseExpression {
106
107
  kind: "Case";
107
108
  arms: CaseArm[];
108
109
  other: Expression | undefined;
110
+ otherRange?: SourceRange;
109
111
  location: SourceLocation;
110
112
  }
111
113
  interface LetExpression {
@@ -261,6 +263,7 @@ interface LabelExpression {
261
263
  name: string;
262
264
  params: string[];
263
265
  paramRanges?: SourceRange[];
266
+ head?: SourceRange;
264
267
  body: Expression;
265
268
  location: SourceLocation;
266
269
  }
@@ -298,6 +301,7 @@ interface OperatorDefinition {
298
301
  params: OperatorParam[];
299
302
  body: Expression;
300
303
  bodyRange?: SourceRange;
304
+ head?: SourceRange;
301
305
  isLocal: boolean;
302
306
  isRecursive: boolean;
303
307
  location: SourceLocation;
@@ -439,6 +443,7 @@ type ModuleUnit = {
439
443
  } | {
440
444
  kind: "Recursive";
441
445
  declarations: Declaration[];
446
+ location: SourceLocation;
442
447
  } | {
443
448
  kind: "Definition";
444
449
  definition: Definition;
@@ -511,6 +516,7 @@ interface ModelConfig {
511
516
  actionConstraints: string[];
512
517
  constants: ConstantAssignment[];
513
518
  substitutions: Substitution[];
519
+ rawConstants: string[];
514
520
  checkDeadlock: boolean;
515
521
  symmetry: string | undefined;
516
522
  view: string | undefined;
@@ -529,6 +535,13 @@ interface SyntaxFailure {
529
535
  line: number;
530
536
  column: number;
531
537
  isEnd: boolean;
538
+ proof?: {
539
+ stop: {
540
+ line: number;
541
+ column: number;
542
+ };
543
+ exception: string;
544
+ };
532
545
  }
533
546
  interface SanyError {
534
547
  location: string;
@@ -559,15 +572,24 @@ interface ModelValue {
559
572
  name: string;
560
573
  type: string | undefined;
561
574
  rank: number;
575
+ hash: number;
576
+ fingerprint: number;
577
+ }
578
+ interface LazySet {
579
+ enumerated?: SetValue;
580
+ isCached?: boolean;
581
+ isFingerprinted?: boolean;
562
582
  }
563
583
  interface SetValue {
564
584
  kind: "Set";
565
585
  elements: Value[];
586
+ writtenElements: Value[] | undefined;
587
+ isNormalized: boolean;
566
588
  hash: number;
567
589
  fingerprint: number;
568
590
  isFingerprinted: boolean;
569
591
  }
570
- interface MixedSetValue {
592
+ interface MixedSetValue extends LazySet {
571
593
  kind: "MixedSet";
572
594
  elements: Value[];
573
595
  }
@@ -579,6 +601,7 @@ interface FunctionValue {
579
601
  fingerprint: number;
580
602
  writtenKeys: Value[] | undefined;
581
603
  functionClass: FunctionClass | undefined;
604
+ lambdaDomain: Value | undefined;
582
605
  isFingerprinted: boolean;
583
606
  }
584
607
  interface IntervalValue {
@@ -590,29 +613,29 @@ interface InfiniteSetValue {
590
613
  kind: "InfiniteSet";
591
614
  name: "Nat" | "Int" | "STRING" | "Any";
592
615
  }
593
- interface SubsetValue {
616
+ interface SubsetValue extends LazySet {
594
617
  kind: "Subset";
595
618
  base: Value;
596
619
  }
597
- interface FunctionSetValue {
620
+ interface FunctionSetValue extends LazySet {
598
621
  kind: "FunctionSet";
599
622
  domain: Value;
600
623
  range: Value;
601
624
  }
602
- interface RecordSetValue {
625
+ interface RecordSetValue extends LazySet {
603
626
  kind: "RecordSet";
604
627
  names: string[];
605
628
  sets: Value[];
606
629
  }
607
- interface ProductSetValue {
630
+ interface ProductSetValue extends LazySet {
608
631
  kind: "ProductSet";
609
632
  factors: Value[];
610
633
  }
611
- interface SequenceSetValue {
634
+ interface SequenceSetValue extends LazySet {
612
635
  kind: "SequenceSet";
613
636
  base: Value;
614
637
  }
615
- interface SetOperationValue {
638
+ interface SetOperationValue extends LazySet {
616
639
  kind: "SetOperation";
617
640
  operator: "\\cup" | "\\cap" | "\\";
618
641
  left: Value;
@@ -622,13 +645,13 @@ interface FilteredSetSource {
622
645
  names: string;
623
646
  predicate: string;
624
647
  }
625
- interface FilteredSetValue {
648
+ interface FilteredSetValue extends LazySet {
626
649
  kind: "FilteredSet";
627
650
  base: Value;
628
- test: (element: Value) => boolean;
651
+ test: (element: Value, isMember: boolean) => boolean;
629
652
  source?: FilteredSetSource;
630
653
  }
631
- interface UnionValue {
654
+ interface UnionValue extends LazySet {
632
655
  kind: "Union";
633
656
  base: Value;
634
657
  }
@@ -644,28 +667,56 @@ interface LazyFunctionValue {
644
667
  kind: "LazyFunction";
645
668
  domain: Value;
646
669
  apply: (argument: Value) => Value;
670
+ boundTupleLengths?: (number | undefined)[];
647
671
  source?: LazyFunctionSource;
648
672
  functionClass?: FunctionClass;
673
+ enumerated?: FunctionValue;
674
+ isFingerprinted?: boolean;
649
675
  }
650
676
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
651
677
  type FunctionClass = "lambda" | "tuple" | "record";
652
678
  export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
653
- interface FingerprintFailure {
654
- sources: Expression[];
655
- reason: string;
656
- }
657
679
  interface JavaOverride {
658
680
  module: string;
659
681
  operator: string;
660
682
  signature: string;
661
683
  isMatched: boolean;
662
684
  }
685
+ interface FingerprintFailure {
686
+ sources: Expression[];
687
+ reason: string;
688
+ }
689
+ type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
690
+ interface CoverageReport {
691
+ variables: CoverageVariable[];
692
+ relations: CoverageRelationReport[];
693
+ }
694
+ interface CoverageVariable {
695
+ label: string;
696
+ distinct: number;
697
+ }
698
+ interface CoverageRelationReport {
699
+ kind: CoverageKind;
700
+ label: string;
701
+ distinct: number;
702
+ generated: number;
703
+ expressions: CoverageExpression[];
704
+ }
705
+ interface CoverageExpression {
706
+ location: string;
707
+ depth: number;
708
+ count: number;
709
+ cost: number;
710
+ }
663
711
  interface StateDump {
664
712
  path: string;
665
713
  dot?: boolean;
666
714
  colorize?: boolean;
667
715
  actionLabels?: boolean;
668
716
  snapshot?: boolean;
717
+ constrained?: boolean;
718
+ stuttering?: boolean;
719
+ strict?: boolean;
669
720
  }
670
721
  interface FailureMessage {
671
722
  code: number;
@@ -680,18 +731,36 @@ interface CheckOptions {
680
731
  onPrint?: (text: string) => void;
681
732
  onPause?: () => void;
682
733
  readFile?: (path: string) => string | undefined;
683
- writeFile?: (path: string, content: string) => void;
734
+ writeFile?: (path: string, content: string | Uint8Array) => void;
735
+ makeDirectory?: (path: string) => void;
684
736
  seed?: bigint;
685
737
  workers?: number;
686
- livenessCheck?: "default" | "final";
738
+ livenessCheck?: "default" | "final" | "off";
739
+ fingerprintPolynomial?: number;
740
+ isLazyValueExpanded?: boolean;
741
+ isViewPrinted?: boolean;
742
+ maxSetSize?: number;
687
743
  dump?: StateDump;
688
744
  isTool?: boolean;
689
- isTraceRecorded?: boolean;
745
+ isContinued?: boolean;
746
+ moduleOperators?: ModuleOperator[];
747
+ traceSpec?: TraceSpecOptions;
690
748
  isSanyReported?: boolean;
691
749
  isWarningEnabled?: boolean;
750
+ coverage?: number;
692
751
  version?: TlcVersion;
693
752
  onProgress?: (progress: CheckProgress) => void;
694
753
  }
754
+ interface TraceSpecOptions {
755
+ module: string;
756
+ traceFile?: string;
757
+ }
758
+ interface ModuleOperator {
759
+ kind: "postcondition" | "constraint" | "view";
760
+ module: string;
761
+ operator: string;
762
+ constants?: Record<string, string>;
763
+ }
695
764
  interface InitialStatesProgress {
696
765
  kind: "initial-states-progress";
697
766
  count: number;
@@ -734,14 +803,21 @@ type CheckProgress = {
734
803
  statistics: SearchStatistics;
735
804
  } | {
736
805
  kind: "liveness-finished";
806
+ } | {
807
+ kind: "sequential-fallback";
808
+ string: string;
737
809
  } | {
738
810
  kind: "warning";
739
811
  code: number;
740
812
  text: string;
813
+ } | {
814
+ kind: "violation";
815
+ status: CheckStatus;
816
+ violation: Violation;
741
817
  } | ({
742
818
  kind: "java-override";
743
819
  } & JavaOverride);
744
- interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth"> {}
820
+ interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth" | "coverage"> {}
745
821
  type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
746
822
  interface TraceStep {
747
823
  action: string | undefined;
@@ -754,6 +830,7 @@ interface Violation {
754
830
  properties?: string[];
755
831
  trace: TraceStep[];
756
832
  traceOutput?: OutputLine[];
833
+ postconditionOutput?: OutputLine[];
757
834
  loopStart: number | undefined;
758
835
  loopLabel?: string;
759
836
  message?: string;
@@ -804,6 +881,8 @@ interface CheckResult {
804
881
  additionalViolation?: Violation;
805
882
  liveCallStack?: Expression[];
806
883
  violationOutDegrees?: number[];
884
+ traceSpec?: string;
885
+ coverage?: CoverageReport;
807
886
  }
808
887
  export declare const check: (options: CheckOptions) => Promise<CheckResult>;
809
888
  export declare const parseModule: (source: string) => Module;
@@ -839,4 +918,4 @@ interface ProveOptions {
839
918
  workers?: number;
840
919
  }
841
920
  export declare const prove: (options: ProveOptions) => Promise<ProveResult>;
842
- export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, EvaluationFailure, ModelConfig, Module, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
921
+ export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, CoverageReport, EvaluationFailure, ModelConfig, Module, ModuleOperator, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceSpecOptions, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
package/dist/index.d.ts CHANGED
@@ -6,6 +6,7 @@
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 ts from "@typescript/typescript6";
9
10
  interface LocalResolution {
10
11
  kind: "Local";
11
12
  }
@@ -106,6 +107,7 @@ interface CaseExpression {
106
107
  kind: "Case";
107
108
  arms: CaseArm[];
108
109
  other: Expression | undefined;
110
+ otherRange?: SourceRange;
109
111
  location: SourceLocation;
110
112
  }
111
113
  interface LetExpression {
@@ -261,6 +263,7 @@ interface LabelExpression {
261
263
  name: string;
262
264
  params: string[];
263
265
  paramRanges?: SourceRange[];
266
+ head?: SourceRange;
264
267
  body: Expression;
265
268
  location: SourceLocation;
266
269
  }
@@ -298,6 +301,7 @@ interface OperatorDefinition {
298
301
  params: OperatorParam[];
299
302
  body: Expression;
300
303
  bodyRange?: SourceRange;
304
+ head?: SourceRange;
301
305
  isLocal: boolean;
302
306
  isRecursive: boolean;
303
307
  location: SourceLocation;
@@ -439,6 +443,7 @@ type ModuleUnit = {
439
443
  } | {
440
444
  kind: "Recursive";
441
445
  declarations: Declaration[];
446
+ location: SourceLocation;
442
447
  } | {
443
448
  kind: "Definition";
444
449
  definition: Definition;
@@ -511,6 +516,7 @@ interface ModelConfig {
511
516
  actionConstraints: string[];
512
517
  constants: ConstantAssignment[];
513
518
  substitutions: Substitution[];
519
+ rawConstants: string[];
514
520
  checkDeadlock: boolean;
515
521
  symmetry: string | undefined;
516
522
  view: string | undefined;
@@ -529,6 +535,13 @@ interface SyntaxFailure {
529
535
  line: number;
530
536
  column: number;
531
537
  isEnd: boolean;
538
+ proof?: {
539
+ stop: {
540
+ line: number;
541
+ column: number;
542
+ };
543
+ exception: string;
544
+ };
532
545
  }
533
546
  interface SanyError {
534
547
  location: string;
@@ -559,15 +572,24 @@ interface ModelValue {
559
572
  name: string;
560
573
  type: string | undefined;
561
574
  rank: number;
575
+ hash: number;
576
+ fingerprint: number;
577
+ }
578
+ interface LazySet {
579
+ enumerated?: SetValue;
580
+ isCached?: boolean;
581
+ isFingerprinted?: boolean;
562
582
  }
563
583
  interface SetValue {
564
584
  kind: "Set";
565
585
  elements: Value[];
586
+ writtenElements: Value[] | undefined;
587
+ isNormalized: boolean;
566
588
  hash: number;
567
589
  fingerprint: number;
568
590
  isFingerprinted: boolean;
569
591
  }
570
- interface MixedSetValue {
592
+ interface MixedSetValue extends LazySet {
571
593
  kind: "MixedSet";
572
594
  elements: Value[];
573
595
  }
@@ -579,6 +601,7 @@ interface FunctionValue {
579
601
  fingerprint: number;
580
602
  writtenKeys: Value[] | undefined;
581
603
  functionClass: FunctionClass | undefined;
604
+ lambdaDomain: Value | undefined;
582
605
  isFingerprinted: boolean;
583
606
  }
584
607
  interface IntervalValue {
@@ -590,29 +613,29 @@ interface InfiniteSetValue {
590
613
  kind: "InfiniteSet";
591
614
  name: "Nat" | "Int" | "STRING" | "Any";
592
615
  }
593
- interface SubsetValue {
616
+ interface SubsetValue extends LazySet {
594
617
  kind: "Subset";
595
618
  base: Value;
596
619
  }
597
- interface FunctionSetValue {
620
+ interface FunctionSetValue extends LazySet {
598
621
  kind: "FunctionSet";
599
622
  domain: Value;
600
623
  range: Value;
601
624
  }
602
- interface RecordSetValue {
625
+ interface RecordSetValue extends LazySet {
603
626
  kind: "RecordSet";
604
627
  names: string[];
605
628
  sets: Value[];
606
629
  }
607
- interface ProductSetValue {
630
+ interface ProductSetValue extends LazySet {
608
631
  kind: "ProductSet";
609
632
  factors: Value[];
610
633
  }
611
- interface SequenceSetValue {
634
+ interface SequenceSetValue extends LazySet {
612
635
  kind: "SequenceSet";
613
636
  base: Value;
614
637
  }
615
- interface SetOperationValue {
638
+ interface SetOperationValue extends LazySet {
616
639
  kind: "SetOperation";
617
640
  operator: "\\cup" | "\\cap" | "\\";
618
641
  left: Value;
@@ -622,13 +645,13 @@ interface FilteredSetSource {
622
645
  names: string;
623
646
  predicate: string;
624
647
  }
625
- interface FilteredSetValue {
648
+ interface FilteredSetValue extends LazySet {
626
649
  kind: "FilteredSet";
627
650
  base: Value;
628
- test: (element: Value) => boolean;
651
+ test: (element: Value, isMember: boolean) => boolean;
629
652
  source?: FilteredSetSource;
630
653
  }
631
- interface UnionValue {
654
+ interface UnionValue extends LazySet {
632
655
  kind: "Union";
633
656
  base: Value;
634
657
  }
@@ -644,28 +667,56 @@ interface LazyFunctionValue {
644
667
  kind: "LazyFunction";
645
668
  domain: Value;
646
669
  apply: (argument: Value) => Value;
670
+ boundTupleLengths?: (number | undefined)[];
647
671
  source?: LazyFunctionSource;
648
672
  functionClass?: FunctionClass;
673
+ enumerated?: FunctionValue;
674
+ isFingerprinted?: boolean;
649
675
  }
650
676
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
651
677
  type FunctionClass = "lambda" | "tuple" | "record";
652
678
  export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
653
- interface FingerprintFailure {
654
- sources: Expression[];
655
- reason: string;
656
- }
657
679
  interface JavaOverride {
658
680
  module: string;
659
681
  operator: string;
660
682
  signature: string;
661
683
  isMatched: boolean;
662
684
  }
685
+ interface FingerprintFailure {
686
+ sources: Expression[];
687
+ reason: string;
688
+ }
689
+ type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
690
+ interface CoverageReport {
691
+ variables: CoverageVariable[];
692
+ relations: CoverageRelationReport[];
693
+ }
694
+ interface CoverageVariable {
695
+ label: string;
696
+ distinct: number;
697
+ }
698
+ interface CoverageRelationReport {
699
+ kind: CoverageKind;
700
+ label: string;
701
+ distinct: number;
702
+ generated: number;
703
+ expressions: CoverageExpression[];
704
+ }
705
+ interface CoverageExpression {
706
+ location: string;
707
+ depth: number;
708
+ count: number;
709
+ cost: number;
710
+ }
663
711
  interface StateDump {
664
712
  path: string;
665
713
  dot?: boolean;
666
714
  colorize?: boolean;
667
715
  actionLabels?: boolean;
668
716
  snapshot?: boolean;
717
+ constrained?: boolean;
718
+ stuttering?: boolean;
719
+ strict?: boolean;
669
720
  }
670
721
  interface FailureMessage {
671
722
  code: number;
@@ -680,18 +731,36 @@ interface CheckOptions {
680
731
  onPrint?: (text: string) => void;
681
732
  onPause?: () => void;
682
733
  readFile?: (path: string) => string | undefined;
683
- writeFile?: (path: string, content: string) => void;
734
+ writeFile?: (path: string, content: string | Uint8Array) => void;
735
+ makeDirectory?: (path: string) => void;
684
736
  seed?: bigint;
685
737
  workers?: number;
686
- livenessCheck?: "default" | "final";
738
+ livenessCheck?: "default" | "final" | "off";
739
+ fingerprintPolynomial?: number;
740
+ isLazyValueExpanded?: boolean;
741
+ isViewPrinted?: boolean;
742
+ maxSetSize?: number;
687
743
  dump?: StateDump;
688
744
  isTool?: boolean;
689
- isTraceRecorded?: boolean;
745
+ isContinued?: boolean;
746
+ moduleOperators?: ModuleOperator[];
747
+ traceSpec?: TraceSpecOptions;
690
748
  isSanyReported?: boolean;
691
749
  isWarningEnabled?: boolean;
750
+ coverage?: number;
692
751
  version?: TlcVersion;
693
752
  onProgress?: (progress: CheckProgress) => void;
694
753
  }
754
+ interface TraceSpecOptions {
755
+ module: string;
756
+ traceFile?: string;
757
+ }
758
+ interface ModuleOperator {
759
+ kind: "postcondition" | "constraint" | "view";
760
+ module: string;
761
+ operator: string;
762
+ constants?: Record<string, string>;
763
+ }
695
764
  interface InitialStatesProgress {
696
765
  kind: "initial-states-progress";
697
766
  count: number;
@@ -734,14 +803,21 @@ type CheckProgress = {
734
803
  statistics: SearchStatistics;
735
804
  } | {
736
805
  kind: "liveness-finished";
806
+ } | {
807
+ kind: "sequential-fallback";
808
+ string: string;
737
809
  } | {
738
810
  kind: "warning";
739
811
  code: number;
740
812
  text: string;
813
+ } | {
814
+ kind: "violation";
815
+ status: CheckStatus;
816
+ violation: Violation;
741
817
  } | ({
742
818
  kind: "java-override";
743
819
  } & JavaOverride);
744
- interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth"> {}
820
+ interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth" | "coverage"> {}
745
821
  type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
746
822
  interface TraceStep {
747
823
  action: string | undefined;
@@ -754,6 +830,7 @@ interface Violation {
754
830
  properties?: string[];
755
831
  trace: TraceStep[];
756
832
  traceOutput?: OutputLine[];
833
+ postconditionOutput?: OutputLine[];
757
834
  loopStart: number | undefined;
758
835
  loopLabel?: string;
759
836
  message?: string;
@@ -804,6 +881,8 @@ interface CheckResult {
804
881
  additionalViolation?: Violation;
805
882
  liveCallStack?: Expression[];
806
883
  violationOutDegrees?: number[];
884
+ traceSpec?: string;
885
+ coverage?: CoverageReport;
807
886
  }
808
887
  export declare const check: (options: CheckOptions) => Promise<CheckResult>;
809
888
  export declare const parseModule: (source: string) => Module;
@@ -839,4 +918,4 @@ interface ProveOptions {
839
918
  workers?: number;
840
919
  }
841
920
  export declare const prove: (options: ProveOptions) => Promise<ProveResult>;
842
- export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, EvaluationFailure, ModelConfig, Module, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
921
+ export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, CoverageReport, EvaluationFailure, ModelConfig, Module, ModuleOperator, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceSpecOptions, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
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{A as e,O as t,_ as n,g as r,h as i}from"./worker.js";import{V as a,jt as o}from"./transfer.js";import{h as s,m as c,r as l}from"./prove.js";export{i as TlaConfigError,r as TlaError,n as TlaEvaluationError,t as TlaSyntaxError,e as TlaUnsupportedError,c as check,o as formatValue,s as parseConfig,a as parseModule,l as prove};
9
+ import{B as e,F as t,_ as n,b as r,y as i}from"./worker.js";import{Ot as a,V as o,en as s}from"./transfer.js";import{m as c,r 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,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.N(n.source,a);t.zt(s.getStringOrder(n.config)),t.Bt(n.version);let c=t.Pt(),l=t.M(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version}).environment,u=t.h(n.config,l,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Tt(),m=t.t(l.variables.length),h={fingerprints:n.fingerprints},g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():void 0,y=/* @__PURE__ */ new Int32Array(2),b={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>b.loot(e.data)),e?.start?.()});let x={states:m(n.seed).map(p)},S=e.t(),C=(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)},w=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&C(e,-1)},T=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},E=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&&C(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.ct(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.s(h.fingerprints))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.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(h.fingerprints,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`},D=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=>b.loot=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,T(e),!0}},O=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),k=async()=>{let e={states:x.states,origin:0,end:x.states.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=E(e);if(t===void 0)return;if(t===`break`)await S(),e.breakAt=performance.now()+100;else if(w(e),t===`paused`){let t=new Promise(e=>b.resume=e);O({type:`paused`}),await t,T(e)}else if(!await D(e))break}if(t.Pt()===c)return x.states=e.next,Atomics.store(_,f,x.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}},A=()=>{k().then(e=>O(e??{type:`abort`}),()=>O({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(),t.type===`resize`&&(h.fingerprints=t.fingerprints,b.resume())}),Atomics.store(_,f,x.states.length),O({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.z(n.source,a);t.Rt(s.getStringOrder(n.config)),t.zt(n),t.St(n.fingerprintPolynomial??0),t.kt();let c=t.R(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0,makeDirectory:void 0},isTool:n.isTool,traceFile:n.traceFile,isWarningEnabled:n.isWarningEnabled,version:n.version}),l=c.environment,u=t.h(n.config,l,c.variableLocations,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.wt(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():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.et(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.s(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.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(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.Pt();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{Bt as n,M as r,N as i,Pt as a,Tt as o,c as s,ct as c,h as l,n as u,o as d,r as f,s as p,t as m,zt as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes),b=i(e.source,v);h(b.getStringOrder(e.config)),n(e.version);let x=a(),S=r(e.config,{source:e.source,loadModule:v,order:b,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,C=l(e.config,S,()=>b.getDeclarationOrder(`variable`)),w=C?.spec.next;if(!C||w===void 0)return g.postMessage({type:`abort`});let T=e.index,E=o(),D=m(S.variables.length),O={fingerprints:e.fingerprints},k=e.requests,A=e.remaining,j=C.isSymmetric?f():void 0,M=/* @__PURE__ */ new Int32Array(2),N={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>N.loot(e.data)),e?.start?.()});let P={states:D(e.seed).map(E)},F=t(),I=(t,n)=>{let r=Atomics.load(k,T)-1,i=Math.floor((t.end-t.origin-1)/2),a=u(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():u().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(k,T,n),Atomics.notify(k,T)},L=e=>{Atomics.store(A,T,0),Atomics.compareExchange(k,T,0,-1)!==0&&I(e,-1)},R=e=>{Atomics.store(A,T,e.end-e.origin),Atomics.store(k,T,0)},z=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(k,T)>0&&I(t,0),Atomics.store(A,T,t.end-t.origin-1),t.successors=c(w,n,S,C.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(p(O.fingerprints))return`paused`;let e=r[t.index];if(C.findViolatedActionProperty(n,e.state))return;if(!C.satisfiesActionConstraints(n,e.state)){if(C.findViolatedInvariant(e.state,n))return;continue}if(j&&(s(e.state,M),!j.insert(M[0],M[1])))continue;E(e.state);let i=C.getFingerprintState(e.state);if(s(i,M),d(O.fingerprints,M[0],M[1])){if(C.findViolatedInvariant(e.state,n))return;C.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`},B=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(A,r)<2?e:e===void 0||Atomics.load(A,r)>Atomics.load(A,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(k,r,0,T+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(k,r,i),i!==0)continue;let a=await new Promise(e=>N.loot=e);if(a.count===0)n.add(r);else return t.states=D(a).map(E),t.origin=0,t.end=t.states.length,R(t),!0}},V=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=async()=>{let e={states:P.states,origin:0,end:P.states.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=z(e);if(t===void 0)return;if(t===`break`)await F(),e.breakAt=performance.now()+100;else if(L(e),t===`paused`){let t=new Promise(e=>N.resume=e);V({type:`paused`}),await t,R(e)}else if(!await B(e))break}if(a()===x)return P.states=e.next,Atomics.store(A,T,P.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:C.getStoredFingerprints(e.next,e.fingerprintStates)}},U=()=>{H().then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&U(),t.type===`resize`&&(O.fingerprints=t.fingerprints,N.resume())}),Atomics.store(A,T,P.states.length),V({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{n as e,t}from"./worker.js";import{Pt as n,R as r,Rt as i,St as a,c as o,et as s,h as c,kt as l,n as u,o as d,r as f,s as p,t as m,wt as h,z as g,zt as _}from"./transfer.js";const v=(e,v)=>{let y=new Map(e.modules),b=e=>y.get(e),x=new Map(e.classes),S=g(e.source,b);i(S.getStringOrder(e.config)),_(e),a(e.fingerprintPolynomial??0),l();let C=r(e.config,{source:e.source,loadModule:b,order:S,loadClass:e=>x.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0,makeDirectory:void 0},isTool:e.isTool,traceFile:e.traceFile,isWarningEnabled:e.isWarningEnabled,version:e.version}),w=C.environment,T=c(e.config,w,C.variableLocations,()=>S.getDeclarationOrder(`variable`)),E=T?.spec.next;if(!T||E===void 0)return v.postMessage({type:`abort`});let D=e.index,O=h(),k=m(w.variables.length),A=e.fingerprints,j=e.requests,M=e.remaining,N=T.isSymmetric?f():void 0,P=/* @__PURE__ */ new Int32Array(2),F=()=>{},I=e=>{};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>I(e.data)),e?.start?.()});let L=k(e.seed).map(O),R=t(),z=(t,n)=>{let r=Atomics.load(j,D)-1,i=Math.floor((t.end-t.origin-1)/2),a=u(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():u().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(j,D,n),Atomics.notify(j,D)},B=e=>{Atomics.store(M,D,0),Atomics.compareExchange(j,D,0,-1)!==0&&z(e,-1)},V=e=>{Atomics.store(M,D,e.end-e.origin),Atomics.store(j,D,0)},H=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(j,D)>0&&z(t,0),Atomics.store(M,D,t.end-t.origin-1),t.successors=s(E,n,w,T.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(p(A))return`paused`;let e=r[t.index];if(T.findViolatedActionProperty(n,e.state))return;if(!T.satisfiesActionConstraints(n,e.state)){if(T.findViolatedInvariant(e.state,n))return;continue}if(N&&(o(e.state,P),!N.insert(P[0],P[1])))continue;O(e.state);let i=T.getFingerprintState(e.state);if(o(i,P),d(A,P[0],P[1])){if(T.findViolatedInvariant(e.state,n))return;T.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`},U=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(M,r)<2?e:e===void 0||Atomics.load(M,r)>Atomics.load(M,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(j,r,0,D+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(j,r,i),i!==0)continue;let a=await new Promise(e=>I=e);if(a.count===0)n.add(r);else return t.states=k(a).map(O),t.origin=0,t.end=t.states.length,V(t),!0}},W=e=>v.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),G=async()=>{let e={states:L,origin:0,end:L.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=H(e);if(t===void 0)return;if(t===`break`)await R(),e.breakAt=performance.now()+100;else if(B(e),t===`paused`){let t=new Promise(e=>F=e);W({type:`paused`}),await t,V(e)}else if(!await U(e))break}let t=n();return t===void 0?(L=e.next,Atomics.store(M,D,L.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:T.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t}},K=()=>{G().then(e=>W(e??{type:`abort`}),()=>W({type:`abort`}))};v.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&K(),t.type===`resize`&&(A=t.fingerprints,F())}),Atomics.store(M,D,L.length),W({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{v(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.T)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.j)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{T 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{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?.()});