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
@@ -1,107 +1,41 @@
1
1
  import { createCanonicalizer } from "./canonical";
2
2
  import { createSearch } from "./check";
3
3
  import { createEnvironment } from "./environment";
4
- import { createFingerprintTable, getFingerprintOwner, writeStateFingerprint } from "./fingerprints";
5
- import type { LevelMessage, Port, StartMessage, WorkerMessage } from "./parallel";
6
- import { getSuccessors } from "./successors";
7
- import { getTlcStringOrder, getTlcVariableOrder } from "./tlc-order";
4
+ import {
5
+ createFingerprintTable,
6
+ insertSharedFingerprint,
7
+ isSharedFingerprintsFull,
8
+ writeStateFingerprint,
9
+ } from "./fingerprints";
10
+ import type { CoordinatorMessage, LevelMessage, StartMessage, WorkerMessage } from "./parallel";
11
+ import { getSuccessors, type Successor } from "./successors";
12
+ import { getTlcStringOrder, getTlcDeclarationOrder } from "./tlc-order";
8
13
  import { OUT_DEGREE_BUCKETS } from "./tlc-summary";
9
14
  import { createStateDecoder, createStateEncoder, type EncodedStates } from "./transfer";
10
- import { getRankedStringCount, setStringOrder, type Value } from "./values";
15
+ import { getRankedStringCount, setStringOrder, setValueVersion, type Value } from "./values";
16
+ import { getParentPort, type Port } from "./worker";
11
17
 
12
- const WORKER_THREADS_MODULE = "node:worker_threads";
18
+ const LOCKED = -1;
13
19
 
14
- interface Pending {
20
+ interface Expansion {
15
21
  states: Value[][];
16
- origins: number[];
17
- fingerprints: number[];
22
+ origin: number;
23
+ end: number;
24
+ successors: Successor[] | undefined;
25
+ index: number;
26
+ added: number;
27
+ generated: number;
28
+ outDegrees: number[];
29
+ next: Value[][];
30
+ fingerprintStates: Value[][];
18
31
  }
19
32
 
20
- interface PeerMessage {
21
- phase: "query" | "answer" | "sizes" | "balance";
22
- level: number;
23
- from: number;
24
- fingerprints?: Int32Array;
25
- bits?: Uint8Array;
26
- states?: EncodedStates;
27
- unmarks?: Int32Array;
28
- size?: number;
29
- }
30
-
31
- interface Transfer {
32
- from: number;
33
- to: number;
34
- count: number;
35
- }
36
-
37
- const getBalancePlan = (sizes: number[]) => {
38
- const total = sizes.reduce((sum, size) => sum + size, 0);
39
- const average = total / sizes.length;
40
- if (Math.max(...sizes) - Math.min(...sizes) <= Math.max(64, average / 4)) return [];
41
- const targets = sizes.map(
42
- (_, index) => Math.floor(average) + (index < total % sizes.length ? 1 : 0),
43
- );
44
- const donors = sizes.flatMap((size, index) =>
45
- size > targets[index] ? [{ index, amount: size - targets[index] }] : [],
46
- );
47
- const receivers = sizes.flatMap((size, index) =>
48
- size < targets[index] ? [{ index, amount: targets[index] - size }] : [],
49
- );
50
- const transfers: Transfer[] = [];
51
- for (const donor of donors) {
52
- for (const receiver of receivers) {
53
- const moved = Math.min(donor.amount, receiver.amount);
54
- if (moved === 0) continue;
55
- transfers.push({ from: donor.index, to: receiver.index, count: moved });
56
- donor.amount -= moved;
57
- receiver.amount -= moved;
58
- }
59
- }
60
- return transfers;
61
- };
62
-
63
- const getParentPort = async () => {
64
- if (typeof (globalThis as { postMessage?: unknown }).postMessage === "function") {
65
- return globalThis as unknown as Port;
66
- }
67
- const threads: typeof import("node:worker_threads") = await import(
68
- /* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
69
- );
70
- return threads.parentPort as unknown as Port;
71
- };
72
-
73
- const createInbox = () => {
74
- const messages = new Map<string, PeerMessage[]>();
75
- const waiters = new Map<string, { count: number; resolve: (messages: PeerMessage[]) => void }>();
76
- const getKey = (phase: PeerMessage["phase"], level: number) => `${phase}:${level}`;
77
- const settle = (key: string) => {
78
- const waiter = waiters.get(key);
79
- const received = messages.get(key) ?? [];
80
- if (!waiter || received.length < waiter.count) return;
81
- waiters.delete(key);
82
- messages.delete(key);
83
- waiter.resolve(received);
84
- };
85
- return {
86
- deliver: (message: PeerMessage) => {
87
- const key = getKey(message.phase, message.level);
88
- messages.set(key, [...(messages.get(key) ?? []), message]);
89
- settle(key);
90
- },
91
- receive: (phase: PeerMessage["phase"], level: number, count: number) =>
92
- new Promise<PeerMessage[]>((resolve) => {
93
- const key = getKey(phase, level);
94
- waiters.set(key, { count, resolve });
95
- settle(key);
96
- }),
97
- };
98
- };
99
-
100
33
  const run = (start: StartMessage, parent: Port) => {
101
34
  const modules = new Map(start.modules);
102
35
  const loadModule = (name: string) => modules.get(name);
103
36
  const classes = new Map(start.classes);
104
37
  setStringOrder(getTlcStringOrder(start.source, start.config, loadModule));
38
+ setValueVersion(start.version);
105
39
  const startupStrings = getRankedStringCount();
106
40
  const specification = createEnvironment(start.config, {
107
41
  source: start.source,
@@ -109,173 +43,179 @@ const run = (start: StartMessage, parent: Port) => {
109
43
  loadClass: (name) => classes.get(name),
110
44
  print: () => {},
111
45
  files: { readFile: undefined, writeFile: undefined },
46
+ isTool: start.isTool,
47
+ isTraceRecorded: start.isTraceRecorded,
48
+ isWarningEnabled: start.isWarningEnabled,
49
+ version: start.version,
112
50
  });
113
51
  const environment = specification.environment;
114
52
  const search = createSearch(start.config, environment, () =>
115
- getTlcVariableOrder(start.source, loadModule),
53
+ getTlcDeclarationOrder(start.source, loadModule, "variable"),
116
54
  );
117
55
  const nextAction = search?.spec.next;
118
56
  if (!search || nextAction === undefined)
119
57
  return parent.postMessage({ type: "abort" } satisfies WorkerMessage);
120
- const count = start.count;
121
58
  const self = start.index;
122
59
  const canonicalize = createCanonicalizer();
123
60
  const decode = createStateDecoder(environment.variables.length);
124
- const table = createFingerprintTable();
125
- const known = createFingerprintTable();
61
+ const shared = { fingerprints: start.fingerprints };
62
+ const requests = start.requests;
63
+ const remaining = start.remaining;
64
+ // Under symmetry, a successor the worker generated before has the representative it had then,
65
+ // so the worker skips the search for one.
66
+ const generatedStates = search.isSymmetric ? createFingerprintTable() : undefined;
126
67
  const fingerprint = new Int32Array(2);
127
- const inbox = createInbox();
128
- const peers = start.ports.flatMap((port, index) => (port ? [{ port, index }] : []));
129
- peers.forEach((peer) => {
130
- peer.port.addEventListener("message", (event) => inbox.deliver(event.data as PeerMessage));
131
- peer.port.start?.();
68
+ const waiters = { resume: () => {}, loot: (_states: EncodedStates) => {} };
69
+ start.ports.forEach((port) => {
70
+ port?.addEventListener("message", (event) => waiters.loot(event.data as EncodedStates));
71
+ port?.start?.();
132
72
  });
133
- for (let index = 0; index < start.seedFingerprints.length; index += 2) {
134
- table.insert(start.seedFingerprints[index], start.seedFingerprints[index + 1]);
135
- }
136
73
  const frontier = { states: decode(start.seed).map(canonicalize) };
137
- const send = (index: number, message: PeerMessage, transfer: unknown[]) =>
138
- start.ports[index]?.postMessage(message, transfer);
139
74
 
140
- const expand = (states: Value[][], next: Value[][]) => {
141
- const pending: Pending[] = Array.from({ length: count }, () => ({
142
- states: [],
143
- origins: [],
144
- fingerprints: [],
145
- }));
146
- const statistics = { generated: 0 };
147
- const newStates = new Int32Array(states.length);
148
- for (let origin = 0; origin < states.length; origin++) {
149
- const state = states[origin];
150
- const successors = getSuccessors(nextAction, state, environment, search.spec.scope);
151
- statistics.generated += successors.length;
152
- if (successors.length === 0 && start.config.checkDeadlock) return undefined;
153
- for (const successor of successors) {
75
+ // A worker that runs out of states asks a peer for some by writing its index + 1 to the peer's
76
+ // request word. The peer sends half of the states it hasn't started, keeps expanding, and wakes
77
+ // the workers waiting to ask it next.
78
+ const answer = (expansion: Expansion, request: number) => {
79
+ const thief = Atomics.load(requests, self) - 1;
80
+ const given = Math.floor((expansion.end - expansion.origin - 1) / 2);
81
+ const encoder = createStateEncoder();
82
+ const states = expansion.states.slice(expansion.end - given, expansion.end);
83
+ const isEncoded = given > 0 && states.every(encoder.encode);
84
+ if (isEncoded) expansion.end -= given;
85
+ const loot = isEncoded ? encoder.finish() : createStateEncoder().finish();
86
+ start.ports[thief]?.postMessage(loot, [loot.words.buffer]);
87
+ Atomics.store(requests, self, request);
88
+ Atomics.notify(requests, self);
89
+ };
90
+
91
+ // A worker answers any request before it pauses or runs out of states, and takes no more until
92
+ // it resumes.
93
+ const lock = (expansion: Expansion) => {
94
+ Atomics.store(remaining, self, 0);
95
+ if (Atomics.compareExchange(requests, self, 0, LOCKED) === 0) return;
96
+ answer(expansion, LOCKED);
97
+ };
98
+
99
+ const unlock = (expansion: Expansion) => {
100
+ Atomics.store(remaining, self, expansion.end - expansion.origin);
101
+ Atomics.store(requests, self, 0);
102
+ };
103
+
104
+ // The worker pauses before a successor when the shared table needs to grow, and resumes there.
105
+ const expand = (expansion: Expansion) => {
106
+ for (; expansion.origin < expansion.end; expansion.origin++) {
107
+ const state = expansion.states[expansion.origin];
108
+ if (!expansion.successors) {
109
+ if (Atomics.load(requests, self) > 0) answer(expansion, 0);
110
+ Atomics.store(remaining, self, expansion.end - expansion.origin - 1);
111
+ expansion.successors = getSuccessors(nextAction, state, environment, search.spec.scope);
112
+ expansion.generated += expansion.successors.length;
113
+ if (expansion.successors.length === 0 && start.config.checkDeadlock) return undefined;
114
+ }
115
+ const successors = expansion.successors;
116
+ for (; expansion.index < successors.length; expansion.index++) {
117
+ if (isSharedFingerprintsFull(shared.fingerprints)) return "paused";
118
+ const successor = successors[expansion.index];
154
119
  if (search.findViolatedActionProperty(state, successor.state)) return undefined;
155
- if (!search.satisfiesActionConstraints(state, successor.state)) continue;
156
- canonicalize(successor.state);
157
- writeStateFingerprint(search.getFingerprintState(successor.state), fingerprint);
158
- const owner = getFingerprintOwner(fingerprint[1], count);
159
- if (owner === self) {
160
- if (!table.insert(fingerprint[0], fingerprint[1])) continue;
120
+ if (!search.satisfiesActionConstraints(state, successor.state)) {
121
+ // TLC checks the invariants of every successor it has not seen, even outside the model.
161
122
  if (search.findViolatedInvariant(successor.state, state)) return undefined;
162
- if (!search.satisfiesConstraints(successor.state, state)) {
163
- table.remove(fingerprint[0], fingerprint[1]);
164
- continue;
165
- }
166
- next.push(successor.state);
167
- newStates[origin]++;
168
123
  continue;
169
124
  }
170
- if (!known.insert(fingerprint[0], fingerprint[1])) continue;
171
- pending[owner].states.push(successor.state);
172
- pending[owner].origins.push(origin);
173
- pending[owner].fingerprints.push(fingerprint[0], fingerprint[1]);
125
+ if (generatedStates) {
126
+ writeStateFingerprint(successor.state, fingerprint);
127
+ if (!generatedStates.insert(fingerprint[0], fingerprint[1])) continue;
128
+ }
129
+ canonicalize(successor.state);
130
+ const fingerprintState = search.getFingerprintState(successor.state);
131
+ writeStateFingerprint(fingerprintState, fingerprint);
132
+ if (!insertSharedFingerprint(shared.fingerprints, fingerprint[0], fingerprint[1])) continue;
133
+ if (search.findViolatedInvariant(successor.state, state)) return undefined;
134
+ if (!search.satisfiesConstraints(successor.state, state)) continue;
135
+ expansion.next.push(successor.state);
136
+ expansion.fingerprintStates.push(fingerprintState);
137
+ expansion.added++;
174
138
  }
139
+ expansion.outDegrees[Math.min(expansion.added, OUT_DEGREE_BUCKETS - 1)]++;
140
+ expansion.successors = undefined;
141
+ expansion.index = 0;
142
+ expansion.added = 0;
175
143
  }
176
- return { pending, generated: statistics.generated, newStates };
144
+ return "done";
177
145
  };
178
146
 
179
- const answer = (fingerprints: Int32Array | number[]) => {
180
- const bits = new Uint8Array(fingerprints.length / 2);
181
- for (let index = 0; index < bits.length; index++) {
182
- bits[index] = table.insert(fingerprints[index * 2], fingerprints[index * 2 + 1]) ? 1 : 0;
183
- }
184
- return bits;
185
- };
186
-
187
- const commit = (pending: Pending, bits: Uint8Array, next: Value[][], newStates: Int32Array) => {
188
- const unmarks: number[] = [];
189
- for (let index = 0; index < bits.length; index++) {
190
- if (bits[index] === 0) continue;
191
- const state = pending.states[index];
192
- const parentState = frontier.states[pending.origins[index]];
193
- if (search.findViolatedInvariant(state, parentState)) return undefined;
194
- if (search.satisfiesConstraints(state, parentState)) {
195
- next.push(state);
196
- newStates[pending.origins[index]]++;
147
+ // Each attempt asks the peer with the most states left. While another worker's request to that
148
+ // peer is open, the worker waits for the peer to answer it. The worker stops once no peer that
149
+ // takes requests has two states left.
150
+ const steal = async (expansion: Expansion) => {
151
+ const skipped = new Set<number>();
152
+ for (;;) {
153
+ const victim = start.ports.reduce<number | undefined>((best, port, index) => {
154
+ if (!port || skipped.has(index) || Atomics.load(remaining, index) < 2) return best;
155
+ return best === undefined || Atomics.load(remaining, index) > Atomics.load(remaining, best)
156
+ ? index
157
+ : best;
158
+ }, undefined);
159
+ if (victim === undefined) return false;
160
+ const request = Atomics.compareExchange(requests, victim, 0, self + 1);
161
+ if (request === LOCKED) skipped.add(victim);
162
+ if (request > 0) Atomics.wait(requests, victim, request);
163
+ if (request !== 0) continue;
164
+ const loot = await new Promise<EncodedStates>((resolve) => (waiters.loot = resolve));
165
+ if (loot.count === 0) {
166
+ skipped.add(victim);
197
167
  continue;
198
168
  }
199
- known.remove(pending.fingerprints[index * 2], pending.fingerprints[index * 2 + 1]);
200
- unmarks.push(pending.fingerprints[index * 2], pending.fingerprints[index * 2 + 1]);
201
- }
202
- return Int32Array.from(unmarks);
203
- };
204
-
205
- const removeAll = (fingerprints: Int32Array) => {
206
- for (let index = 0; index < fingerprints.length; index += 2) {
207
- table.remove(fingerprints[index], fingerprints[index + 1]);
169
+ expansion.states = decode(loot).map(canonicalize);
170
+ expansion.origin = 0;
171
+ expansion.end = expansion.states.length;
172
+ unlock(expansion);
173
+ return true;
208
174
  }
209
175
  };
210
176
 
211
- const balance = async (level: number, next: Value[][], sizes: number[]) => {
212
- const transfers = getBalancePlan(sizes);
213
- if (transfers.length === 0) return true;
214
- const outgoing = new Map(peers.map((peer) => [peer.index, createStateEncoder()]));
215
- for (const transfer of transfers.filter((candidate) => candidate.from === self)) {
216
- const encoder = outgoing.get(transfer.to);
217
- const states = next.splice(next.length - transfer.count, transfer.count);
218
- if (!encoder || !states.every(encoder.encode)) return false;
219
- }
220
- outgoing.forEach((encoder, index) => {
221
- const states = encoder.finish();
222
- send(index, { phase: "balance", level, from: self, states }, [states.words.buffer]);
223
- });
224
- const incoming = await inbox.receive("balance", level, peers.length);
225
- incoming.forEach((message) => {
226
- if (message.states) next.push(...decode(message.states).map(canonicalize));
227
- });
228
- return true;
229
- };
177
+ const report = (message: WorkerMessage) =>
178
+ parent.postMessage(message, message.type === "level" ? [message.fingerprints.buffer] : []);
230
179
 
231
180
  const runLevel = async (level: number): Promise<LevelMessage | undefined> => {
232
- const next: Value[][] = [];
233
- const expanded = expand(frontier.states, next);
234
- if (!expanded || getRankedStringCount() !== startupStrings) return undefined;
235
- peers.forEach((peer) => {
236
- const fingerprints = Int32Array.from(expanded.pending[peer.index].fingerprints);
237
- send(peer.index, { phase: "query", level, from: self, fingerprints }, [fingerprints.buffer]);
238
- });
239
- const queries = await inbox.receive("query", level, peers.length);
240
- queries.forEach((query) => {
241
- const bits = answer(query.fingerprints ?? []);
242
- send(query.from, { phase: "answer", level, from: self, bits }, [bits.buffer]);
243
- });
244
- const answers = await inbox.receive("answer", level, peers.length);
245
- for (const reply of answers) {
246
- const unmarks = commit(
247
- expanded.pending[reply.from],
248
- reply.bits ?? new Uint8Array(),
249
- next,
250
- expanded.newStates,
251
- );
252
- if (!unmarks) return undefined;
253
- send(reply.from, { phase: "sizes", level, from: self, unmarks }, [unmarks.buffer]);
181
+ const expansion: Expansion = {
182
+ states: frontier.states,
183
+ origin: 0,
184
+ end: frontier.states.length,
185
+ successors: undefined,
186
+ index: 0,
187
+ added: 0,
188
+ generated: 0,
189
+ outDegrees: Array.from({ length: OUT_DEGREE_BUCKETS }, () => 0),
190
+ next: [],
191
+ fingerprintStates: [],
192
+ };
193
+ for (;;) {
194
+ const status = expand(expansion);
195
+ if (status === undefined) return undefined;
196
+ lock(expansion);
197
+ if (status === "paused") {
198
+ const resumed = new Promise<void>((resolve) => (waiters.resume = resolve));
199
+ report({ type: "paused" });
200
+ await resumed;
201
+ unlock(expansion);
202
+ continue;
203
+ }
204
+ if (!(await steal(expansion))) break;
254
205
  }
255
- const added = next.length;
256
- const outDegrees = Array.from({ length: OUT_DEGREE_BUCKETS }, () => 0);
257
- expanded.newStates.forEach((degree) => outDegrees[Math.min(degree, OUT_DEGREE_BUCKETS - 1)]++);
258
- const fingerprints = BigInt64Array.from(next, (state) =>
259
- environment.runtime.getFingerprint(state),
260
- );
261
- const sizes = Array.from({ length: count }, () => 0);
262
- sizes[self] = added;
263
- peers.forEach((peer) =>
264
- send(peer.index, { phase: "sizes", level, from: self, size: added }, []),
265
- );
266
- const received = await inbox.receive("sizes", level, peers.length * 2);
267
- received.forEach((message) => {
268
- if (message.unmarks) removeAll(message.unmarks);
269
- else sizes[message.from] = message.size ?? 0;
270
- });
271
206
  if (getRankedStringCount() !== startupStrings) return undefined;
272
- if (!(await balance(level, next, sizes))) return undefined;
273
- frontier.states = next;
274
- return { type: "level", level, generated: expanded.generated, added, outDegrees, fingerprints };
207
+ frontier.states = expansion.next;
208
+ Atomics.store(remaining, self, frontier.states.length);
209
+ return {
210
+ type: "level",
211
+ level,
212
+ generated: expansion.generated,
213
+ added: expansion.next.length,
214
+ outDegrees: expansion.outDegrees,
215
+ fingerprints: search.getStoredFingerprints(expansion.next, expansion.fingerprintStates),
216
+ };
275
217
  };
276
218
 
277
- const report = (message: WorkerMessage) =>
278
- parent.postMessage(message, message.type === "level" ? [message.fingerprints.buffer] : []);
279
219
  const step = (level: number) => {
280
220
  runLevel(level).then(
281
221
  (message) => report(message ?? { type: "abort" }),
@@ -283,9 +223,14 @@ const run = (start: StartMessage, parent: Port) => {
283
223
  );
284
224
  };
285
225
  parent.addEventListener("message", (event) => {
286
- const message = event.data as { type: string; level: number };
226
+ const message = event.data as CoordinatorMessage;
287
227
  if (message.type === "level") step(message.level);
228
+ if (message.type === "resize") {
229
+ shared.fingerprints = message.fingerprints;
230
+ waiters.resume();
231
+ }
288
232
  });
233
+ Atomics.store(remaining, self, frontier.states.length);
289
234
  report({ type: "ready" });
290
235
  };
291
236