tla-ts 0.0.3 → 0.0.4-dev.2a873ee

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 (370) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +996 -0
  17. package/dist/prove.js +996 -0
  18. package/dist/run-cli.cjs +37 -20
  19. package/dist/run-cli.js +37 -20
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1387 -18
  23. package/dist/transfer.js +1387 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +4 -7
  29. package/src/builtins.ts +29 -11
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/canonical.ts +4 -3
  32. package/src/check.ts +1540 -235
  33. package/src/cli-options.ts +12 -6
  34. package/src/cli.ts +8 -1
  35. package/src/codegen.ts +98 -39
  36. package/src/config.ts +254 -181
  37. package/src/dependencies.ts +2 -2
  38. package/src/environment.ts +540 -140
  39. package/src/errors.ts +284 -4
  40. package/src/evaluate.ts +1043 -293
  41. package/src/exit-codes.ts +22 -43
  42. package/src/fingerprints.ts +46 -11
  43. package/src/index.ts +11 -0
  44. package/src/instances.ts +19 -16
  45. package/src/java-overrides.ts +104 -25
  46. package/src/levels.ts +191 -45
  47. package/src/lexer.ts +127 -30
  48. package/src/live-check.ts +867 -0
  49. package/src/liveness.ts +218 -572
  50. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  51. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  52. package/src/obligations/ctx.ts +64 -0
  53. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  54. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  55. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  56. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  57. package/src/{obligations.ts → obligations/index.ts} +32 -16
  58. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  59. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  60. package/src/obligations/pickle.ts +98 -0
  61. package/src/obligations/pragma.ts +189 -0
  62. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  63. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  64. package/src/{obligation-source.ts → obligations/source.ts} +156 -99
  65. package/src/obligations/temporal.ts +321 -0
  66. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  67. package/src/ocaml-marshal.ts +166 -0
  68. package/src/parallel-worker.ts +169 -224
  69. package/src/parallel.ts +140 -81
  70. package/src/parser.ts +456 -147
  71. package/src/pcal-ast.ts +770 -0
  72. package/src/pcal-parse.ts +1523 -0
  73. package/src/pcal-tokenize.ts +516 -0
  74. package/src/pcal-translate.ts +1230 -0
  75. package/src/pcal-validate.ts +454 -0
  76. package/src/prove/decide-pool.ts +95 -0
  77. package/src/prove/deciders.ts +33 -0
  78. package/src/prove/first-order.ts +78 -0
  79. package/src/prove/isabelle/LICENSE +36 -0
  80. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  81. package/src/prove/isabelle/decide.ts +47 -0
  82. package/src/prove/isabelle/encode.ts +446 -0
  83. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  84. package/src/prove/isabelle/isar/method.ts +367 -0
  85. package/src/prove/isabelle/isar/proof.ts +28 -0
  86. package/src/prove/isabelle/isar/statement.ts +57 -0
  87. package/src/prove/isabelle/isar/theory.ts +192 -0
  88. package/src/prove/isabelle/isar/type-check.ts +278 -0
  89. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  90. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  91. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  92. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  93. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  94. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  95. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  96. package/src/prove/isabelle/provers/classical.ts +389 -0
  97. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  98. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  99. package/src/prove/isabelle/pure/consts.ts +32 -0
  100. package/src/prove/isabelle/pure/conv.ts +79 -0
  101. package/src/prove/isabelle/pure/drule.ts +264 -0
  102. package/src/prove/isabelle/pure/envir.ts +331 -0
  103. package/src/prove/isabelle/pure/goal.ts +53 -0
  104. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  105. package/src/prove/isabelle/pure/list.ts +12 -0
  106. package/src/prove/isabelle/pure/logic.ts +330 -0
  107. package/src/prove/isabelle/pure/name.ts +98 -0
  108. package/src/prove/isabelle/pure/net.ts +215 -0
  109. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  110. package/src/prove/isabelle/pure/pattern.ts +631 -0
  111. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  112. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  113. package/src/prove/isabelle/pure/search.ts +68 -0
  114. package/src/prove/isabelle/pure/seq.ts +133 -0
  115. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  116. package/src/prove/isabelle/pure/table.ts +201 -0
  117. package/src/prove/isabelle/pure/tactic.ts +168 -0
  118. package/src/prove/isabelle/pure/tactical.ts +264 -0
  119. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  120. package/src/prove/isabelle/pure/term.ts +688 -0
  121. package/src/prove/isabelle/pure/thm.ts +783 -0
  122. package/src/prove/isabelle/pure/type.ts +121 -0
  123. package/src/prove/isabelle/pure/unify.ts +753 -0
  124. package/src/prove/isabelle/pure/variable.ts +25 -0
  125. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  126. package/src/prove/isabelle/tla/context.ts +74 -0
  127. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  128. package/src/prove/isabelle/tla/logic.ts +215 -0
  129. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  130. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  131. package/src/prove/ocaml.ts +22 -0
  132. package/src/prove/prep/action.ts +508 -0
  133. package/src/prove/prep/defs.ts +33 -0
  134. package/src/prove/prep/elab.ts +156 -0
  135. package/src/prove/prep/enabled-axioms.ts +189 -0
  136. package/src/prove/prep/enabled.ts +43 -0
  137. package/src/prove/prep/fingerprint.ts +388 -0
  138. package/src/prove/prep/flatten.ts +70 -0
  139. package/src/prove/prep/level-comparison.ts +529 -0
  140. package/src/prove/prep/md5.ts +67 -0
  141. package/src/prove/prep/pragma.ts +221 -0
  142. package/src/prove/prep/trivial.ts +22 -0
  143. package/src/prove/prove-worker.ts +22 -0
  144. package/src/prove/prove.ts +498 -0
  145. package/src/prove/ptl/decide.ts +68 -0
  146. package/src/prove/ptl/encode.ts +255 -0
  147. package/src/prove/ptl/sat.ts +151 -0
  148. package/src/prove/ptl/tableau.ts +276 -0
  149. package/src/prove/smt/axiomatize.ts +69 -0
  150. package/src/prove/smt/axioms.ts +209 -0
  151. package/src/prove/smt/context.ts +108 -0
  152. package/src/prove/smt/data.ts +636 -0
  153. package/src/prove/smt/encode.ts +164 -0
  154. package/src/prove/smt/extensionality.ts +65 -0
  155. package/src/prove/smt/flatten.ts +112 -0
  156. package/src/prove/smt/format.ts +154 -0
  157. package/src/prove/smt/instances.ts +181 -0
  158. package/src/prove/smt/rewrite.ts +772 -0
  159. package/src/prove/smt/simplify.ts +57 -0
  160. package/src/prove/smt/solver/act-cache.ts +265 -0
  161. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prove/smt/solver/array.ts +22 -0
  163. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prove/smt/solver/ast-lt.ts +157 -0
  165. package/src/prove/smt/solver/ast-util.ts +91 -0
  166. package/src/prove/smt/solver/ast.ts +1315 -0
  167. package/src/prove/smt/solver/auf-solver.ts +572 -0
  168. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prove/smt/solver/cg-table.ts +175 -0
  170. package/src/prove/smt/solver/clause.ts +276 -0
  171. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prove/smt/solver/context.ts +1292 -0
  173. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prove/smt/solver/der.ts +224 -0
  175. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prove/smt/solver/e-matching.ts +659 -0
  177. package/src/prove/smt/solver/enode.ts +259 -0
  178. package/src/prove/smt/solver/expr-ref.ts +21 -0
  179. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prove/smt/solver/fingerprints.ts +92 -0
  181. package/src/prove/smt/solver/flat-literals.ts +51 -0
  182. package/src/prove/smt/solver/goal.ts +138 -0
  183. package/src/prove/smt/solver/hash.ts +173 -0
  184. package/src/prove/smt/solver/hashtable.ts +166 -0
  185. package/src/prove/smt/solver/internalizer.ts +1381 -0
  186. package/src/prove/smt/solver/lbool.ts +5 -0
  187. package/src/prove/smt/solver/literal.ts +24 -0
  188. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prove/smt/solver/lp/containers.ts +296 -0
  191. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prove/smt/solver/lp/nex.ts +120 -0
  208. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prove/smt/solver/model-checker.ts +347 -0
  238. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prove/smt/solver/model-finder.ts +155 -0
  240. package/src/prove/smt/solver/model-generator.ts +97 -0
  241. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prove/smt/solver/nnf.ts +469 -0
  255. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prove/smt/solver/propagate-values.ts +83 -0
  258. package/src/prove/smt/solver/proto-model.ts +551 -0
  259. package/src/prove/smt/solver/pull-quant.ts +139 -0
  260. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prove/smt/solver/qe-lite.ts +381 -0
  263. package/src/prove/smt/solver/qi-queue.ts +362 -0
  264. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prove/smt/solver/random-gen.ts +10 -0
  268. package/src/prove/smt/solver/rational.ts +165 -0
  269. package/src/prove/smt/solver/ref-vector.ts +62 -0
  270. package/src/prove/smt/solver/relevancy.ts +247 -0
  271. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prove/smt/solver/rewriter.ts +843 -0
  273. package/src/prove/smt/solver/rlimit.ts +79 -0
  274. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prove/smt/solver/solver.ts +71 -0
  276. package/src/prove/smt/solver/sort.ts +35 -0
  277. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prove/smt/solver/theory-lra.ts +56 -0
  286. package/src/prove/smt/solver/var-subst.ts +258 -0
  287. package/src/prove/smt/solver/z3-license.txt +10 -0
  288. package/src/prove/smt/table.ts +170 -0
  289. package/src/prove/tlapm/tlapm.ts +96 -0
  290. package/src/prove/tlaps-module.ts +510 -0
  291. package/src/prove/verdict.ts +18 -0
  292. package/src/prove/zenon/LICENSE +32 -0
  293. package/src/prove/zenon/check/check.ts +105 -0
  294. package/src/prove/zenon/check/definitions.ts +144 -0
  295. package/src/prove/zenon/check/equality.ts +182 -0
  296. package/src/prove/zenon/check/functions.ts +62 -0
  297. package/src/prove/zenon/check/keys.ts +125 -0
  298. package/src/prove/zenon/check/propositional.ts +104 -0
  299. package/src/prove/zenon/check/records.ts +188 -0
  300. package/src/prove/zenon/check/relations.ts +121 -0
  301. package/src/prove/zenon/check/rewrites.ts +224 -0
  302. package/src/prove/zenon/check/sets.ts +302 -0
  303. package/src/prove/zenon/check/terms.ts +127 -0
  304. package/src/prove/zenon/check/tla.ts +126 -0
  305. package/src/prove/zenon/decide.ts +113 -0
  306. package/src/prove/zenon/encode.ts +379 -0
  307. package/src/prove/zenon/eqrel.ts +300 -0
  308. package/src/prove/zenon/equality-rules.ts +435 -0
  309. package/src/prove/zenon/expr.ts +551 -0
  310. package/src/prove/zenon/index-table.ts +350 -0
  311. package/src/prove/zenon/isar-case.ts +513 -0
  312. package/src/prove/zenon/isar.ts +1249 -0
  313. package/src/prove/zenon/limits.ts +15 -0
  314. package/src/prove/zenon/llproof.ts +173 -0
  315. package/src/prove/zenon/mltoll.ts +1566 -0
  316. package/src/prove/zenon/node.ts +297 -0
  317. package/src/prove/zenon/ocaml.ts +169 -0
  318. package/src/prove/zenon/parse.ts +247 -0
  319. package/src/prove/zenon/phrase.ts +191 -0
  320. package/src/prove/zenon/proof.ts +198 -0
  321. package/src/prove/zenon/propositional-rules.ts +387 -0
  322. package/src/prove/zenon/rules.ts +94 -0
  323. package/src/prove/zenon/search.ts +288 -0
  324. package/src/prove/zenon/tla/functions.ts +151 -0
  325. package/src/prove/zenon/tla/llproof.ts +480 -0
  326. package/src/prove/zenon/tla/records.ts +225 -0
  327. package/src/prove/zenon/tla/rewrites.ts +447 -0
  328. package/src/prove/zenon/tla/sets.ts +304 -0
  329. package/src/prove/zenon/tla/terms.ts +162 -0
  330. package/src/prove/zenon/tla/tla.ts +506 -0
  331. package/src/randomization.ts +24 -7
  332. package/src/resolve.ts +1481 -426
  333. package/src/run-cli.ts +1483 -212
  334. package/src/runtime.ts +19 -1
  335. package/src/sany-builtins.ts +147 -0
  336. package/src/sany-generator.ts +3128 -0
  337. package/src/sany-levels.ts +1208 -0
  338. package/src/sany-lexer.ts +545 -0
  339. package/src/sany-linter.ts +122 -0
  340. package/src/sany-modules.ts +1398 -0
  341. package/src/sany-nodes.ts +463 -0
  342. package/src/sany-parse-error.ts +2161 -0
  343. package/src/sany-report.ts +356 -0
  344. package/src/sany-selectors.ts +738 -0
  345. package/src/sany-source.ts +248 -0
  346. package/src/sany-xml.ts +1017 -0
  347. package/src/spec-description.ts +42 -11
  348. package/src/standard-modules.ts +203 -148
  349. package/src/standard-ranges.ts +116 -0
  350. package/src/state-graph.ts +180 -0
  351. package/src/subexpressions.ts +231 -171
  352. package/src/substitution-levels.ts +38 -17
  353. package/src/successors.ts +241 -110
  354. package/src/symmetry.ts +194 -54
  355. package/src/tableau.ts +54 -25
  356. package/src/tlapm-cache.ts +236 -0
  357. package/src/tlc-ext.ts +42 -29
  358. package/src/tlc-messages.ts +329 -0
  359. package/src/tlc-module.ts +52 -43
  360. package/src/tlc-modules.ts +4 -0
  361. package/src/tlc-order.ts +78 -10
  362. package/src/tlc-random.ts +84 -33
  363. package/src/tlc-replay.ts +655 -0
  364. package/src/tlc-summary.ts +20 -5
  365. package/src/tlc-version.ts +19 -0
  366. package/src/transfer.ts +15 -3
  367. package/src/values.ts +787 -190
  368. package/src/worker.ts +65 -0
  369. package/dist/parallel.cjs +0 -12
  370. package/dist/parallel.js +0 -12
package/dist/index.d.ts CHANGED
@@ -38,32 +38,42 @@ interface StringExpression {
38
38
  interface IdentifierExpression {
39
39
  kind: "Identifier";
40
40
  name: string;
41
+ spelling?: string;
42
+ selectorRanges?: SourceRange[];
41
43
  location: SourceLocation;
42
44
  resolution?: LocalResolution;
43
45
  }
44
46
  interface ApplyExpression {
45
47
  kind: "Apply";
46
48
  operator: string;
49
+ spelling?: string;
47
50
  args: Expression[];
48
51
  argumentCounts?: number[];
52
+ argumentsRange?: SourceRange;
53
+ selectorRanges?: SourceRange[];
54
+ argumentRanges?: (SourceRange | undefined)[];
49
55
  location: SourceLocation;
50
56
  resolution?: LocalResolution;
51
57
  }
52
58
  interface OperatorReferenceExpression {
53
59
  kind: "OperatorReference";
54
60
  operator: string;
61
+ spelling?: string;
55
62
  location: SourceLocation;
56
63
  }
57
64
  interface LambdaExpression {
58
65
  kind: "Lambda";
59
66
  params: string[];
67
+ paramRanges?: SourceRange[];
60
68
  body: Expression;
69
+ operator?: string;
61
70
  location: SourceLocation;
62
71
  }
63
72
  interface JunctionExpression {
64
73
  kind: "And" | "Or";
65
74
  operands: Expression[];
66
75
  isBulleted?: boolean;
76
+ prefixEnds?: SourceLocation[];
67
77
  location: SourceLocation;
68
78
  }
69
79
  interface PrimeExpression {
@@ -108,9 +118,11 @@ interface LetExpression {
108
118
  type BoundPattern = {
109
119
  kind: "Name";
110
120
  name: string;
121
+ ranges?: SourceRange[];
111
122
  } | {
112
123
  kind: "Tuple";
113
124
  names: string[];
125
+ ranges?: SourceRange[];
114
126
  };
115
127
  interface Bound {
116
128
  pattern: BoundPattern;
@@ -126,6 +138,7 @@ interface UnboundedQuantifierExpression {
126
138
  kind: "UnboundedQuantifier";
127
139
  quantifier: "Forall" | "Exists";
128
140
  names: string[];
141
+ nameRanges?: SourceRange[];
129
142
  isTemporal?: boolean;
130
143
  body: Expression;
131
144
  location: SourceLocation;
@@ -175,6 +188,7 @@ interface FunctionSetExpression {
175
188
  interface RecordField {
176
189
  name: string;
177
190
  value: Expression;
191
+ location: SourceLocation;
178
192
  }
179
193
  interface RecordExpression {
180
194
  kind: "Record" | "RecordSet";
@@ -208,6 +222,11 @@ interface FunctionApplicationExpression {
208
222
  args: Expression[];
209
223
  location: SourceLocation;
210
224
  }
225
+ interface BracketExpression {
226
+ kind: "Bracket";
227
+ args: Expression[];
228
+ location: SourceLocation;
229
+ }
211
230
  interface FieldAccessExpression {
212
231
  kind: "FieldAccess";
213
232
  record: Expression;
@@ -241,6 +260,7 @@ interface LabelExpression {
241
260
  kind: "Label";
242
261
  name: string;
243
262
  params: string[];
263
+ paramRanges?: SourceRange[];
244
264
  body: Expression;
245
265
  location: SourceLocation;
246
266
  }
@@ -262,9 +282,11 @@ type Selector = {
262
282
  interface SubexpressionExpression {
263
283
  kind: "Subexpression";
264
284
  selectors: Selector[];
285
+ selectorRanges?: SourceRange[];
286
+ argumentRanges?: (SourceRange | undefined)[];
265
287
  location: SourceLocation;
266
288
  }
267
- 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 | FieldAccessExpression | ProductExpression | TemporalExpression | ActionExpression | FairnessExpression | LabelExpression | SubexpressionExpression;
289
+ 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;
268
290
  interface OperatorParam {
269
291
  name: string;
270
292
  arity: number;
@@ -287,6 +309,7 @@ interface FunctionDefinition {
287
309
  body: Expression;
288
310
  isLocal: boolean;
289
311
  isRecursive: boolean;
312
+ isSelfReferential?: boolean;
290
313
  location: SourceLocation;
291
314
  }
292
315
  type Definition = OperatorDefinition | FunctionDefinition;
@@ -303,6 +326,7 @@ interface Assumption {
303
326
  }
304
327
  interface InstanceSubstitution {
305
328
  name: string;
329
+ nameRange: SourceRange;
306
330
  expression: Expression;
307
331
  }
308
332
  interface Instance {
@@ -322,6 +346,7 @@ interface NewSymbol {
322
346
  arity: number;
323
347
  level: "Constant" | "Variable" | "State" | "Action" | "Temporal";
324
348
  set: Expression | undefined;
349
+ nameRange?: SourceRange;
325
350
  location: SourceLocation;
326
351
  }
327
352
  interface AssumeProve {
@@ -371,6 +396,7 @@ type StepBody = UseOrHide | Instance | DefineStep | {
371
396
  } | {
372
397
  kind: "Take";
373
398
  names: string[];
399
+ nameRanges?: SourceRange[];
374
400
  bounds: Bound[];
375
401
  } | {
376
402
  kind: "Witness";
@@ -378,6 +404,7 @@ type StepBody = UseOrHide | Instance | DefineStep | {
378
404
  } | {
379
405
  kind: "Pick";
380
406
  names: string[];
407
+ nameRanges?: SourceRange[];
381
408
  bounds: Bound[];
382
409
  body: Expression;
383
410
  } | {
@@ -395,6 +422,7 @@ interface ProofStep {
395
422
  token: string;
396
423
  body: StepBody;
397
424
  head: SourceRange;
425
+ statement: SourceRange;
398
426
  proof: Proof | undefined;
399
427
  location: SourceLocation;
400
428
  }
@@ -405,11 +433,9 @@ interface Theorem {
405
433
  location: SourceLocation;
406
434
  }
407
435
  type ModuleUnit = {
408
- kind: "Constants";
409
- declarations: Declaration[];
410
- } | {
411
- kind: "Variables";
436
+ kind: "Constants" | "Variables";
412
437
  declarations: Declaration[];
438
+ location: SourceLocation;
413
439
  } | {
414
440
  kind: "Recursive";
415
441
  declarations: Declaration[];
@@ -447,6 +473,7 @@ interface Module {
447
473
  uses: UseOrHide[];
448
474
  units: ModuleUnit[];
449
475
  }
476
+ type TlcVersion = "1.7.4" | "master";
450
477
  type ConfigValue = {
451
478
  kind: "Number";
452
479
  value: number;
@@ -493,7 +520,13 @@ interface ModelConfig {
493
520
  periodic: string | undefined;
494
521
  rlReward: string | undefined;
495
522
  }
496
- export declare const parseConfig: (source: string) => ModelConfig;
523
+ export declare const parseConfig: (source: string, version?: TlcVersion) => ModelConfig;
524
+ interface JavaOverride {
525
+ module: string;
526
+ operator: string;
527
+ signature: string;
528
+ isMatched: boolean;
529
+ }
497
530
  export declare class TlaError extends Error {
498
531
  constructor(message: string, cause?: unknown);
499
532
  }
@@ -503,9 +536,20 @@ interface SyntaxFailure {
503
536
  column: number;
504
537
  isEnd: boolean;
505
538
  }
539
+ interface SanyError {
540
+ location: string;
541
+ message: string;
542
+ }
543
+ interface SanyReport {
544
+ errors: SanyError[];
545
+ warnings: SanyError[];
546
+ isFatal: boolean;
547
+ parseError?: string;
548
+ }
506
549
  export declare class TlaSyntaxError extends TlaError {
507
550
  failure: SyntaxFailure | undefined;
508
- constructor(message: string, cause?: unknown, failure?: SyntaxFailure);
551
+ sany: SanyReport | undefined;
552
+ constructor(message: string, cause?: unknown, failure?: SyntaxFailure, sany?: SanyReport);
509
553
  }
510
554
  export declare class TlaConfigError extends TlaError {
511
555
  constructor(message: string, cause?: unknown);
@@ -520,12 +564,14 @@ interface ModelValue {
520
564
  kind: "ModelValue";
521
565
  name: string;
522
566
  type: string | undefined;
567
+ rank: number;
523
568
  }
524
569
  interface SetValue {
525
570
  kind: "Set";
526
571
  elements: Value[];
527
572
  hash: number;
528
573
  fingerprint: number;
574
+ isFingerprinted: boolean;
529
575
  }
530
576
  interface MixedSetValue {
531
577
  kind: "MixedSet";
@@ -538,6 +584,8 @@ interface FunctionValue {
538
584
  hash: number;
539
585
  fingerprint: number;
540
586
  writtenKeys: Value[] | undefined;
587
+ functionClass: FunctionClass | undefined;
588
+ isFingerprinted: boolean;
541
589
  }
542
590
  interface IntervalValue {
543
591
  kind: "Interval";
@@ -576,10 +624,15 @@ interface SetOperationValue {
576
624
  left: Value;
577
625
  right: Value;
578
626
  }
627
+ interface FilteredSetSource {
628
+ names: string;
629
+ predicate: string;
630
+ }
579
631
  interface FilteredSetValue {
580
632
  kind: "FilteredSet";
581
633
  base: Value;
582
634
  test: (element: Value) => boolean;
635
+ source?: FilteredSetSource;
583
636
  }
584
637
  interface UnionValue {
585
638
  kind: "Union";
@@ -598,9 +651,22 @@ interface LazyFunctionValue {
598
651
  domain: Value;
599
652
  apply: (argument: Value) => Value;
600
653
  source?: LazyFunctionSource;
654
+ functionClass?: FunctionClass;
601
655
  }
602
656
  type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
657
+ type FunctionClass = "lambda" | "tuple" | "record";
603
658
  export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
659
+ interface FingerprintFailure {
660
+ sources: Expression[];
661
+ reason: string;
662
+ }
663
+ interface StateDump {
664
+ path: string;
665
+ dot?: boolean;
666
+ colorize?: boolean;
667
+ actionLabels?: boolean;
668
+ snapshot?: boolean;
669
+ }
604
670
  interface CheckOptions {
605
671
  source: string;
606
672
  config: string | ModelConfig;
@@ -613,32 +679,111 @@ interface CheckOptions {
613
679
  seed?: bigint;
614
680
  workers?: number;
615
681
  livenessCheck?: "default" | "final";
682
+ dump?: StateDump;
683
+ isTool?: boolean;
684
+ isTraceRecorded?: boolean;
685
+ isSanyReported?: boolean;
686
+ isWarningEnabled?: boolean;
687
+ version?: TlcVersion;
688
+ onProgress?: (progress: CheckProgress) => void;
689
+ }
690
+ interface InitialStatesProgress {
691
+ kind: "initial-states-progress";
692
+ count: number;
693
+ }
694
+ interface InitialStateViolation {
695
+ kind: "initial-state-violation";
696
+ status: "invariant-violation" | "liveness-violation";
697
+ name: string;
698
+ state: Record<string, Value>;
616
699
  }
700
+ type OutputLine = string | InitialStatesProgress | InitialStateViolation;
701
+ type CheckProgress = {
702
+ kind: "parsed";
703
+ } | {
704
+ kind: "constant-level-invariant";
705
+ name: string;
706
+ } | {
707
+ kind: "state-level-property";
708
+ name: string;
709
+ } | {
710
+ kind: "liveness-initializing";
711
+ isSymmetric: boolean;
712
+ isConstrained: boolean;
713
+ } | {
714
+ kind: "liveness-prepared";
715
+ branches: number;
716
+ } | {
717
+ kind: "initial-states-started";
718
+ } | InitialStatesProgress | {
719
+ kind: "initial-states-computed";
720
+ initialStates: InitialStates;
721
+ } | {
722
+ kind: "progress";
723
+ statistics: SearchStatistics;
724
+ } | {
725
+ kind: "liveness-started";
726
+ branches: number;
727
+ isComplete: boolean;
728
+ states: number;
729
+ statistics: SearchStatistics;
730
+ } | {
731
+ kind: "liveness-finished";
732
+ } | {
733
+ kind: "warning";
734
+ code: number;
735
+ text: string;
736
+ } | ({
737
+ kind: "java-override";
738
+ } & JavaOverride);
739
+ interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth"> {}
617
740
  type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
618
741
  interface TraceStep {
619
742
  action: string | undefined;
620
743
  label: string | undefined;
621
744
  state: Record<string, Value>;
745
+ output?: OutputLine[];
622
746
  }
623
747
  interface Violation {
624
748
  name: string;
749
+ properties?: string[];
625
750
  trace: TraceStep[];
751
+ traceOutput?: OutputLine[];
626
752
  loopStart: number | undefined;
627
753
  loopLabel?: string;
628
754
  message?: string;
629
755
  counts?: string;
630
756
  unwitnessed?: Postcondition;
757
+ postcondition?: Postcondition;
758
+ warning?: {
759
+ code: number;
760
+ text: string;
761
+ };
631
762
  }
632
763
  interface Postcondition {
633
764
  name: string;
765
+ code: number;
634
766
  message: string;
635
767
  counts?: string;
636
768
  }
637
769
  interface EvaluationFailure {
770
+ code: number;
638
771
  message: string;
772
+ toolMessage: string;
639
773
  trace: TraceStep[];
774
+ traceOutput?: OutputLine[];
640
775
  initialState: Record<string, Value> | undefined;
641
776
  exitCode: number;
777
+ callStack: Expression[] | undefined;
778
+ isCallStackFirst?: boolean;
779
+ fingerprint?: FingerprintFailure;
780
+ traceFailure?: FailureMessage;
781
+ postcondition?: Postcondition;
782
+ isWithoutStatistics?: boolean;
783
+ }
784
+ interface InitialStates {
785
+ generated: number;
786
+ distinct: number;
642
787
  }
643
788
  interface CheckResult {
644
789
  status: CheckStatus;
@@ -648,9 +793,50 @@ interface CheckResult {
648
793
  distinctStates: number;
649
794
  queuedStates: number;
650
795
  depth: number;
796
+ initialStates: InitialStates | undefined;
651
797
  outDegrees: number[] | undefined;
652
798
  fingerprintDistance: bigint | undefined;
799
+ additionalViolation?: Violation;
800
+ liveCallStack?: Expression[];
801
+ violationOutDegrees?: number[];
802
+ }
803
+ interface FailureMessage {
804
+ code: number;
805
+ message: string;
806
+ toolMessage: string;
653
807
  }
654
808
  export declare const check: (options: CheckOptions) => Promise<CheckResult>;
655
809
  export declare const parseModule: (source: string) => Module;
656
- export type { CheckOptions, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, EvaluationFailure, ModelConfig, Module, Substitution, TraceStep, Value, Violation };
810
+ interface ObligationBase {
811
+ id: number;
812
+ location: string;
813
+ text: string;
814
+ }
815
+ interface ProvedObligation extends ObligationBase {
816
+ status: "proved";
817
+ prover: string;
818
+ }
819
+ interface TrivialObligation extends ObligationBase {
820
+ status: "trivial";
821
+ }
822
+ interface UnprovedObligation extends ObligationBase {
823
+ status: "failed" | "unsupported";
824
+ reason: string;
825
+ }
826
+ type ProofObligation = ProvedObligation | TrivialObligation | UnprovedObligation;
827
+ type ProofStatus = ProofObligation["status"];
828
+ interface ProveResult {
829
+ obligations: ProofObligation[];
830
+ missingProofCount: number;
831
+ omittedProofCount: number;
832
+ }
833
+ interface ProveOptions {
834
+ source: string;
835
+ loadModule?: (name: string) => string | undefined;
836
+ backend?: "tla-ts" | "tlapm";
837
+ signal?: AbortSignal;
838
+ onObligation?: (obligation: ProofObligation) => void;
839
+ workers?: number;
840
+ }
841
+ 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 };
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,C as t,D as n,N as r,P as i,_ as a,j as o,k as s}from"./transfer.js";import{t as c}from"./parallel.js";export{s as TlaConfigError,e as TlaError,o as TlaEvaluationError,r as TlaSyntaxError,i as TlaUnsupportedError,c as check,t as formatValue,n as parseConfig,a as parseModule};
9
+ import{D as e,g as t,h as n,k as r,m as i}from"./worker.js";import{J as a,O as o,Q as s}from"./transfer.js";import{m as c,r as l}from"./prove.js";export{i as TlaConfigError,n as TlaError,t as TlaEvaluationError,e as TlaSyntaxError,r as TlaUnsupportedError,c as check,a as formatValue,s as parseConfig,o as parseModule,l as prove};
@@ -6,7 +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("./transfer.cjs"),t=e=>{let t=e.reduce((e,t)=>e+t,0),n=t/e.length;if(Math.max(...e)-Math.min(...e)<=Math.max(64,n/4))return[];let r=e.map((r,i)=>Math.floor(n)+ +(i<t%e.length)),i=e.flatMap((e,t)=>e>r[t]?[{index:t,amount:e-r[t]}]:[]),a=e.flatMap((e,t)=>e<r[t]?[{index:t,amount:r[t]-e}]:[]),o=[];for(let e of i)for(let t of a){let n=Math.min(e.amount,t.amount);n!==0&&(o.push({from:e.index,to:t.index,count:n}),e.amount-=n,t.amount-=n)}return o},n=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
10
- /* @vite-ignore */
11
- /* webpackIgnore: true */
12
- `node:worker_threads`)).parentPort,r=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=(e,t)=>`${e}:${t}`,r=n=>{let r=t.get(n),i=e.get(n)??[];!r||i.length<r.count||(t.delete(n),e.delete(n),r.resolve(i))};return{deliver:t=>{let i=n(t.phase,t.level);e.set(i,[...e.get(i)??[],t]),r(i)},receive:(e,i,a)=>new Promise(o=>{let s=n(e,i);t.set(s,{count:a,resolve:o}),r(s)})}},i=(n,i)=>{let a=new Map(n.modules),o=e=>a.get(e),s=new Map(n.classes);e.T(e.m(n.source,n.config,o));let c=e.w(),l=e.g(n.config,{source:n.source,loadModule:o,loadClass:e=>s.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,u=e.s(n.config,l,()=>e.h(n.source,o)),d=u?.spec.next;if(!u||d===void 0)return i.postMessage({type:`abort`});let f=n.count,p=n.index,m=e.S(),h=e.t(l.variables.length),g=e.r(),_=e.r(),v=/* @__PURE__ */ new Int32Array(2),y=r(),b=n.ports.flatMap((e,t)=>e?[{port:e,index:t}]:[]);b.forEach(e=>{e.port.addEventListener(`message`,e=>y.deliver(e.data)),e.port.start?.()});for(let e=0;e<n.seedFingerprints.length;e+=2)g.insert(n.seedFingerprints[e],n.seedFingerprints[e+1]);let x={states:h(n.seed).map(m)},S=(e,t,r)=>n.ports[e]?.postMessage(t,r),C=(t,r)=>{let i=Array.from({length:f},()=>({states:[],origins:[],fingerprints:[]})),a={generated:0},o=new Int32Array(t.length);for(let s=0;s<t.length;s++){let c=t[s],h=e.x(d,c,l,u.spec.scope);if(a.generated+=h.length,h.length===0&&n.config.checkDeadlock)return;for(let t of h){if(u.findViolatedActionProperty(c,t.state))return;if(!u.satisfiesActionConstraints(c,t.state))continue;m(t.state),e.a(u.getFingerprintState(t.state),v);let n=e.i(v[1],f);if(n===p){if(!g.insert(v[0],v[1]))continue;if(u.findViolatedInvariant(t.state,c))return;if(!u.satisfiesConstraints(t.state,c)){g.remove(v[0],v[1]);continue}r.push(t.state),o[s]++}else _.insert(v[0],v[1])&&(i[n].states.push(t.state),i[n].origins.push(s),i[n].fingerprints.push(v[0],v[1]))}}return{pending:i,generated:a.generated,newStates:o}},w=e=>{let t=new Uint8Array(e.length/2);for(let n=0;n<t.length;n++)t[n]=+!!g.insert(e[n*2],e[n*2+1]);return t},T=(e,t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){if(t[a]===0)continue;let o=e.states[a],s=x.states[e.origins[a]];if(u.findViolatedInvariant(o,s))return;u.satisfiesConstraints(o,s)?(n.push(o),r[e.origins[a]]++):(_.remove(e.fingerprints[a*2],e.fingerprints[a*2+1]),i.push(e.fingerprints[a*2],e.fingerprints[a*2+1]))}return Int32Array.from(i)},E=e=>{for(let t=0;t<e.length;t+=2)g.remove(e[t],e[t+1])},D=async(n,r,i)=>{let a=t(i);if(a.length===0)return!0;let o=new Map(b.map(t=>[t.index,e.n()]));for(let e of a.filter(e=>e.from===p)){let t=o.get(e.to),n=r.splice(r.length-e.count,e.count);if(!t||!n.every(t.encode))return!1}return o.forEach((e,t)=>{let r=e.finish();S(t,{phase:`balance`,level:n,from:p,states:r},[r.words.buffer])}),(await y.receive(`balance`,n,b.length)).forEach(e=>{e.states&&r.push(...h(e.states).map(m))}),!0},O=async t=>{let n=[],r=C(x.states,n);if(!r||e.w()!==c)return;b.forEach(e=>{let n=Int32Array.from(r.pending[e.index].fingerprints);S(e.index,{phase:`query`,level:t,from:p,fingerprints:n},[n.buffer])}),(await y.receive(`query`,t,b.length)).forEach(e=>{let n=w(e.fingerprints??[]);S(e.from,{phase:`answer`,level:t,from:p,bits:n},[n.buffer])});let i=await y.receive(`answer`,t,b.length);for(let e of i){let i=T(r.pending[e.from],e.bits??/* @__PURE__ */ new Uint8Array,n,r.newStates);if(!i)return;S(e.from,{phase:`sizes`,level:t,from:p,unmarks:i},[i.buffer])}let a=n.length,o=Array.from({length:32},()=>0);r.newStates.forEach(e=>o[Math.min(e,31)]++);let s=BigInt64Array.from(n,e=>l.runtime.getFingerprint(e)),u=Array.from({length:f},()=>0);if(u[p]=a,b.forEach(e=>S(e.index,{phase:`sizes`,level:t,from:p,size:a},[])),(await y.receive(`sizes`,t,b.length*2)).forEach(e=>{e.unmarks?E(e.unmarks):u[e.from]=e.size??0}),e.w()===c&&await D(t,n,u))return x.states=n,{type:`level`,level:t,generated:r.generated,added:a,outDegrees:o,fingerprints:s}},k=e=>i.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),A=e=>{O(e).then(e=>k(e??{type:`abort`}),()=>k({type:`abort`}))};i.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(t.level)}),k({type:`ready`})};n().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{i(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
9
+ const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(e,n)=>{let r=new Map(e.modules),i=e=>r.get(e),a=new Map(e.classes);t.X(t.x(e.source,e.config,i)),t.Z(e.version);let o=t.Y(),s=t.y(e.config,{source:e.source,loadModule:i,loadClass:e=>a.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,c=t.u(e.config,s,()=>t.b(e.source,i,`variable`)),l=c?.spec.next;if(!c||l===void 0)return n.postMessage({type:`abort`});let u=e.index,d=t.K(),f=t.t(s.variables.length),p={fingerprints:e.fingerprints},m=e.requests,h=e.remaining,g=c.isSymmetric?t.r():void 0,_=/* @__PURE__ */ new Int32Array(2),v={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>v.loot(e.data)),e?.start?.()});let y={states:f(e.seed).map(d)},b=(n,r)=>{let i=Atomics.load(m,u)-1,a=Math.floor((n.end-n.origin-1)/2),o=t.n(),s=n.states.slice(n.end-a,n.end),c=a>0&&s.every(o.encode);c&&(n.end-=a);let l=c?o.finish():t.n().finish();e.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(m,u,r),Atomics.notify(m,u)},x=e=>{Atomics.store(h,u,0),Atomics.compareExchange(m,u,0,-1)!==0&&b(e,-1)},S=e=>{Atomics.store(h,u,e.end-e.origin),Atomics.store(m,u,0)},C=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(m,u)>0&&b(n,0),Atomics.store(h,u,n.end-n.origin-1),n.successors=t.I(l,r,s,c.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&e.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(t.s(p.fingerprints))return`paused`;let e=i[n.index];if(c.findViolatedActionProperty(r,e.state))return;if(!c.satisfiesActionConstraints(r,e.state)){if(c.findViolatedInvariant(e.state,r))return;continue}if(g&&(t.c(e.state,_),!g.insert(_[0],_[1])))continue;d(e.state);let a=c.getFingerprintState(e.state);if(t.c(a,_),t.o(p.fingerprints,_[0],_[1])){if(c.findViolatedInvariant(e.state,r))return;c.satisfiesConstraints(e.state,r)&&(n.next.push(e.state),n.fingerprintStates.push(a),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.added=0}return`done`},w=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(h,r)<2?e:e===void 0||Atomics.load(h,r)>Atomics.load(h,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(m,r,0,u+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(m,r,i),i!==0)continue;let a=await new Promise(e=>v.loot=e);if(a.count===0)n.add(r);else return t.states=f(a).map(d),t.origin=0,t.end=t.states.length,S(t),!0}},T=e=>n.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),E=async e=>{let n={states:y.states,origin:0,end:y.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=C(n);if(e===void 0)return;if(x(n),e===`paused`){let e=new Promise(e=>v.resume=e);T({type:`paused`}),await e,S(n)}else if(!await w(n))break}if(t.Y()===o)return y.states=n.next,Atomics.store(h,u,y.states.length),{type:`level`,level:e,generated:n.generated,added:n.next.length,outDegrees:n.outDegrees,fingerprints:c.getStoredFingerprints(n.next,n.fingerprintStates)}},D=e=>{E(e).then(e=>T(e??{type:`abort`}),()=>T({type:`abort`}))};n.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&D(t.level),t.type===`resize`&&(p.fingerprints=t.fingerprints,v.resume())}),Atomics.store(h,u,y.states.length),T({type:`ready`})};e.t().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
@@ -6,7 +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{S as e,T as t,a as n,g as r,h as i,i as a,m as o,n as s,r as c,s as l,t as u,w as d,x as f}from"./transfer.js";const p=e=>{let t=e.reduce((e,t)=>e+t,0),n=t/e.length;if(Math.max(...e)-Math.min(...e)<=Math.max(64,n/4))return[];let r=e.map((r,i)=>Math.floor(n)+ +(i<t%e.length)),i=e.flatMap((e,t)=>e>r[t]?[{index:t,amount:e-r[t]}]:[]),a=e.flatMap((e,t)=>e<r[t]?[{index:t,amount:r[t]-e}]:[]),o=[];for(let e of i)for(let t of a){let n=Math.min(e.amount,t.amount);n!==0&&(o.push({from:e.index,to:t.index,count:n}),e.amount-=n,t.amount-=n)}return o},m=async()=>typeof globalThis.postMessage==`function`?globalThis:(await import(
10
- /* @vite-ignore */
11
- /* webpackIgnore: true */
12
- `node:worker_threads`)).parentPort,h=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=(e,t)=>`${e}:${t}`,r=n=>{let r=t.get(n),i=e.get(n)??[];!r||i.length<r.count||(t.delete(n),e.delete(n),r.resolve(i))};return{deliver:t=>{let i=n(t.phase,t.level);e.set(i,[...e.get(i)??[],t]),r(i)},receive:(e,i,a)=>new Promise(o=>{let s=n(e,i);t.set(s,{count:a,resolve:o}),r(s)})}},g=(m,g)=>{let _=new Map(m.modules),v=e=>_.get(e),y=new Map(m.classes);t(o(m.source,m.config,v));let b=d(),x=r(m.config,{source:m.source,loadModule:v,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0}}).environment,S=l(m.config,x,()=>i(m.source,v)),C=S?.spec.next;if(!S||C===void 0)return g.postMessage({type:`abort`});let w=m.count,T=m.index,E=e(),D=u(x.variables.length),O=c(),k=c(),A=/* @__PURE__ */ new Int32Array(2),j=h(),M=m.ports.flatMap((e,t)=>e?[{port:e,index:t}]:[]);M.forEach(e=>{e.port.addEventListener(`message`,e=>j.deliver(e.data)),e.port.start?.()});for(let e=0;e<m.seedFingerprints.length;e+=2)O.insert(m.seedFingerprints[e],m.seedFingerprints[e+1]);let N={states:D(m.seed).map(E)},P=(e,t,n)=>m.ports[e]?.postMessage(t,n),F=(e,t)=>{let r=Array.from({length:w},()=>({states:[],origins:[],fingerprints:[]})),i={generated:0},o=new Int32Array(e.length);for(let s=0;s<e.length;s++){let c=e[s],l=f(C,c,x,S.spec.scope);if(i.generated+=l.length,l.length===0&&m.config.checkDeadlock)return;for(let e of l){if(S.findViolatedActionProperty(c,e.state))return;if(!S.satisfiesActionConstraints(c,e.state))continue;E(e.state),n(S.getFingerprintState(e.state),A);let i=a(A[1],w);if(i===T){if(!O.insert(A[0],A[1]))continue;if(S.findViolatedInvariant(e.state,c))return;if(!S.satisfiesConstraints(e.state,c)){O.remove(A[0],A[1]);continue}t.push(e.state),o[s]++}else k.insert(A[0],A[1])&&(r[i].states.push(e.state),r[i].origins.push(s),r[i].fingerprints.push(A[0],A[1]))}}return{pending:r,generated:i.generated,newStates:o}},I=e=>{let t=new Uint8Array(e.length/2);for(let n=0;n<t.length;n++)t[n]=+!!O.insert(e[n*2],e[n*2+1]);return t},L=(e,t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){if(t[a]===0)continue;let o=e.states[a],s=N.states[e.origins[a]];if(S.findViolatedInvariant(o,s))return;S.satisfiesConstraints(o,s)?(n.push(o),r[e.origins[a]]++):(k.remove(e.fingerprints[a*2],e.fingerprints[a*2+1]),i.push(e.fingerprints[a*2],e.fingerprints[a*2+1]))}return Int32Array.from(i)},R=e=>{for(let t=0;t<e.length;t+=2)O.remove(e[t],e[t+1])},z=async(e,t,n)=>{let r=p(n);if(r.length===0)return!0;let i=new Map(M.map(e=>[e.index,s()]));for(let e of r.filter(e=>e.from===T)){let n=i.get(e.to),r=t.splice(t.length-e.count,e.count);if(!n||!r.every(n.encode))return!1}return i.forEach((t,n)=>{let r=t.finish();P(n,{phase:`balance`,level:e,from:T,states:r},[r.words.buffer])}),(await j.receive(`balance`,e,M.length)).forEach(e=>{e.states&&t.push(...D(e.states).map(E))}),!0},B=async e=>{let t=[],n=F(N.states,t);if(!n||d()!==b)return;M.forEach(t=>{let r=Int32Array.from(n.pending[t.index].fingerprints);P(t.index,{phase:`query`,level:e,from:T,fingerprints:r},[r.buffer])}),(await j.receive(`query`,e,M.length)).forEach(t=>{let n=I(t.fingerprints??[]);P(t.from,{phase:`answer`,level:e,from:T,bits:n},[n.buffer])});let r=await j.receive(`answer`,e,M.length);for(let i of r){let r=L(n.pending[i.from],i.bits??/* @__PURE__ */ new Uint8Array,t,n.newStates);if(!r)return;P(i.from,{phase:`sizes`,level:e,from:T,unmarks:r},[r.buffer])}let i=t.length,a=Array.from({length:32},()=>0);n.newStates.forEach(e=>a[Math.min(e,31)]++);let o=BigInt64Array.from(t,e=>x.runtime.getFingerprint(e)),s=Array.from({length:w},()=>0);if(s[T]=i,M.forEach(t=>P(t.index,{phase:`sizes`,level:e,from:T,size:i},[])),(await j.receive(`sizes`,e,M.length*2)).forEach(e=>{e.unmarks?R(e.unmarks):s[e.from]=e.size??0}),d()===b&&await z(e,t,s))return N.states=t,{type:`level`,level:e,generated:n.generated,added:i,outDegrees:a,fingerprints:o}},V=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=e=>{B(e).then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&H(t.level)}),V({type:`ready`})};m().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
9
+ import{t as e}from"./worker.js";import{I as t,K as n,X as r,Y as i,Z as a,b as o,c as s,n as c,o as l,r as u,s as d,t as f,u as p,x as m,y as h}from"./transfer.js";const g=(e,g)=>{let _=new Map(e.modules),v=e=>_.get(e),y=new Map(e.classes);r(m(e.source,e.config,v)),a(e.version);let b=i(),x=h(e.config,{source:e.source,loadModule:v,loadClass:e=>y.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,S=p(e.config,x,()=>o(e.source,v,`variable`)),C=S?.spec.next;if(!S||C===void 0)return g.postMessage({type:`abort`});let w=e.index,T=n(),E=f(x.variables.length),D={fingerprints:e.fingerprints},O=e.requests,k=e.remaining,A=S.isSymmetric?u():void 0,j=/* @__PURE__ */ new Int32Array(2),M={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>M.loot(e.data)),e?.start?.()});let N={states:E(e.seed).map(T)},P=(t,n)=>{let r=Atomics.load(O,w)-1,i=Math.floor((t.end-t.origin-1)/2),a=c(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let l=s?a.finish():c().finish();e.ports[r]?.postMessage(l,[l.words.buffer]),Atomics.store(O,w,n),Atomics.notify(O,w)},F=e=>{Atomics.store(k,w,0),Atomics.compareExchange(O,w,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(k,w,e.end-e.origin),Atomics.store(O,w,0)},L=n=>{for(;n.origin<n.end;n.origin++){let r=n.states[n.origin];if(!n.successors&&(Atomics.load(O,w)>0&&P(n,0),Atomics.store(k,w,n.end-n.origin-1),n.successors=t(C,r,x,S.spec.scope),n.generated+=n.successors.length,n.successors.length===0&&e.config.checkDeadlock))return;let i=n.successors;for(;n.index<i.length;n.index++){if(d(D.fingerprints))return`paused`;let e=i[n.index];if(S.findViolatedActionProperty(r,e.state))return;if(!S.satisfiesActionConstraints(r,e.state)){if(S.findViolatedInvariant(e.state,r))return;continue}if(A&&(s(e.state,j),!A.insert(j[0],j[1])))continue;T(e.state);let t=S.getFingerprintState(e.state);if(s(t,j),l(D.fingerprints,j[0],j[1])){if(S.findViolatedInvariant(e.state,r))return;S.satisfiesConstraints(e.state,r)&&(n.next.push(e.state),n.fingerprintStates.push(t),n.added++)}}n.outDegrees[Math.min(n.added,31)]++,n.successors=void 0,n.index=0,n.added=0}return`done`},R=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(k,r)<2?e:e===void 0||Atomics.load(k,r)>Atomics.load(k,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(O,r,0,w+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(O,r,i),i!==0)continue;let a=await new Promise(e=>M.loot=e);if(a.count===0)n.add(r);else return t.states=E(a).map(T),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>g.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async e=>{let t={states:N.states,origin:0,end:N.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[]};for(;;){let e=L(t);if(e===void 0)return;if(F(t),e===`paused`){let e=new Promise(e=>M.resume=e);z({type:`paused`}),await e,I(t)}else if(!await R(t))break}if(i()===b)return N.states=t.next,Atomics.store(k,w,N.states.length),{type:`level`,level:e,generated:t.generated,added:t.next.length,outDegrees:t.outDegrees,fingerprints:S.getStoredFingerprints(t.next,t.fingerprintStates)}},V=e=>{B(e).then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};g.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(t.level),t.type===`resize`&&(D.fingerprints=t.fingerprints,M.resume())}),Atomics.store(k,w,N.states.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{g(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
@@ -0,0 +1,9 @@
1
+ /**
2
+ * @license tla-ts
3
+ *
4
+ * Copyright (c) Aiden Bai
5
+ *
6
+ * This source code is licensed under the MIT license found in the
7
+ * LICENSE file in the root directory of this source tree.
8
+ */
9
+ const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.w)return{error:t.message};throw t}};e.t().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
@@ -0,0 +1,9 @@
1
+ /**
2
+ * @license tla-ts
3
+ *
4
+ * Copyright (c) Aiden Bai
5
+ *
6
+ * This source code is licensed under the MIT license found in the
7
+ * LICENSE file in the root directory of this source tree.
8
+ */
9
+ export {}
@@ -0,0 +1,9 @@
1
+ /**
2
+ * @license tla-ts
3
+ *
4
+ * Copyright (c) Aiden Bai
5
+ *
6
+ * This source code is licensed under the MIT license found in the
7
+ * LICENSE file in the root directory of this source tree.
8
+ */
9
+ export {}
@@ -0,0 +1,9 @@
1
+ /**
2
+ * @license tla-ts
3
+ *
4
+ * Copyright (c) Aiden Bai
5
+ *
6
+ * This source code is licensed under the MIT license found in the
7
+ * LICENSE file in the root directory of this source tree.
8
+ */
9
+ import{t as e,w as t}from"./worker.js";import{t as n}from"./deciders.js";const r=e=>{try{return n(e.prover,e.text,{timeLimitMs:e.timeLimitMs})}catch(e){if(e instanceof t)return{error:e.message};throw e}};e().then(e=>{e.addEventListener(`message`,t=>e.postMessage(r(t.data))),e.start?.()});