tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32

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 (382) hide show
  1. package/README.md +32 -6
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +27 -27
  5. package/dist/deciders.js +34 -34
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +12 -14
  8. package/dist/index.d.ts +12 -14
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +516 -25
  15. package/dist/prove.js +518 -27
  16. package/dist/run.cjs +45 -0
  17. package/dist/run.js +45 -0
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +76 -86
  21. package/dist/transfer.js +73 -83
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +1 -1
  25. package/src/ast.ts +2 -2
  26. package/src/bags.ts +22 -23
  27. package/src/builtins.ts +16 -8
  28. package/src/check.ts +131 -1154
  29. package/src/{cli-options.ts → cli/options.ts} +54 -9
  30. package/src/cli/run.ts +63 -0
  31. package/src/cli/shared.ts +106 -0
  32. package/src/cli/tlapm.ts +374 -0
  33. package/src/{run-cli.ts → cli/tlc.ts} +112 -761
  34. package/src/cli/xml-exporter.ts +221 -0
  35. package/src/cli.ts +1 -1
  36. package/src/codegen.ts +17 -15
  37. package/src/config.ts +5 -5
  38. package/src/dependencies.ts +4 -6
  39. package/src/environment.ts +55 -60
  40. package/src/errors.ts +12 -36
  41. package/src/evaluate.ts +81 -101
  42. package/src/exit-codes.ts +1 -1
  43. package/src/fingerprints.ts +3 -3
  44. package/src/index.ts +2 -2
  45. package/src/instances.ts +56 -46
  46. package/src/java-overrides.ts +79 -41
  47. package/src/json.ts +31 -36
  48. package/src/levels.ts +10 -13
  49. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  50. package/src/liveness.ts +38 -34
  51. package/src/obligations/action.ts +58 -105
  52. package/src/obligations/{anon.ts → anonymize.ts} +44 -52
  53. package/src/obligations/equality.ts +260 -0
  54. package/src/obligations/expression.ts +42 -530
  55. package/src/obligations/format.ts +7 -8
  56. package/src/obligations/generate.ts +93 -783
  57. package/src/obligations/index.ts +23 -23
  58. package/src/obligations/levels.ts +38 -44
  59. package/src/obligations/module.ts +106 -729
  60. package/src/obligations/normalize.ts +554 -0
  61. package/src/obligations/operators.ts +176 -0
  62. package/src/obligations/pragma.ts +35 -29
  63. package/src/obligations/printer.ts +98 -209
  64. package/src/obligations/proof.ts +0 -1
  65. package/src/obligations/regroup.ts +100 -0
  66. package/src/obligations/simplify.ts +668 -0
  67. package/src/obligations/source.ts +92 -192
  68. package/src/obligations/{deref.ts → subexpression.ts} +82 -113
  69. package/src/obligations/substitution.ts +261 -0
  70. package/src/obligations/temporal.ts +32 -30
  71. package/src/obligations/tuples.ts +37 -53
  72. package/src/parallel-worker.ts +37 -33
  73. package/src/parallel.ts +30 -24
  74. package/src/parser.ts +67 -74
  75. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  76. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  77. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  78. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  79. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  80. package/src/{prove → prover}/decide-pool.ts +14 -19
  81. package/src/{prove → prover}/deciders.ts +7 -1
  82. package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
  83. package/src/{prove → prover}/isabelle/decide.ts +3 -6
  84. package/src/{prove → prover}/isabelle/encode.ts +106 -138
  85. package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
  86. package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
  87. package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
  88. package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
  89. package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
  90. package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
  91. package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
  92. package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
  93. package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
  94. package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
  95. package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
  96. package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
  97. package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
  98. package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
  99. package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
  100. package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
  101. package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
  102. package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
  103. package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
  104. package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
  105. package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
  106. package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
  107. package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
  108. package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
  109. package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
  110. package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
  111. package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
  112. package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
  113. package/src/{prove → prover}/ocaml.ts +1 -1
  114. package/src/{prove → prover}/prep/action.ts +54 -66
  115. package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
  116. package/src/{prove → prover}/prep/fingerprint.ts +3 -3
  117. package/src/{prove → prover}/prep/level-comparison.ts +15 -38
  118. package/src/{prove → prover}/prep/md5.ts +2 -9
  119. package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
  120. package/src/prover/prep/normalize.ts +309 -0
  121. package/src/{prove → prover}/prove-worker.ts +4 -11
  122. package/src/prover/prove.ts +492 -0
  123. package/src/{prove → prover}/ptl/encode.ts +19 -31
  124. package/src/{prove → prover}/smt/axioms.ts +78 -79
  125. package/src/{prove → prover}/smt/data.ts +16 -45
  126. package/src/{prove → prover}/smt/encode.ts +134 -28
  127. package/src/{prove → prover}/smt/extensionality.ts +14 -12
  128. package/src/{prove → prover}/smt/flatten.ts +3 -18
  129. package/src/{prove → prover}/smt/format.ts +14 -3
  130. package/src/{prove → prover}/smt/instances.ts +4 -5
  131. package/src/{prove → prover}/smt/rewrite.ts +41 -59
  132. package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
  133. package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
  134. package/src/{prove → prover}/smt/solver/enode.ts +1 -1
  135. package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
  136. package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
  137. package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
  138. package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
  139. package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
  140. package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
  141. package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
  142. package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
  143. package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
  144. package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
  145. package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
  146. package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
  147. package/src/{prove → prover}/smt/solver/solver.ts +2 -2
  148. package/src/prover/tlapm/cache.ts +236 -0
  149. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  150. package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
  151. package/src/prover/verdict.ts +13 -0
  152. package/src/{prove → prover}/zenon/decide.ts +5 -11
  153. package/src/{prove → prover}/zenon/encode.ts +40 -106
  154. package/src/{prove → prover}/zenon/eqrel.ts +1 -1
  155. package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
  156. package/src/{prove → prover}/zenon/expr.ts +2 -2
  157. package/src/{prove → prover}/zenon/index-table.ts +1 -1
  158. package/src/{prove → prover}/zenon/isar.ts +1 -1
  159. package/src/{prove → prover}/zenon/llproof.ts +1 -1
  160. package/src/{prove → prover}/zenon/mltoll.ts +1 -1
  161. package/src/{prove → prover}/zenon/node.ts +1 -1
  162. package/src/{prove → prover}/zenon/search.ts +1 -1
  163. package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
  164. package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
  165. package/src/randomization.ts +19 -24
  166. package/src/resolve.ts +15 -22
  167. package/src/runtime.ts +8 -8
  168. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  169. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  170. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  171. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  172. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  173. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  174. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  175. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  176. package/src/{sany-report.ts → sany/report.ts} +16 -17
  177. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  178. package/src/{sany-source.ts → sany/source.ts} +6 -7
  179. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  180. package/src/search.ts +969 -0
  181. package/src/spec-description.ts +26 -20
  182. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  183. package/src/standard-modules.ts +16 -20
  184. package/src/state-graph.ts +9 -8
  185. package/src/substitution-levels.ts +2 -2
  186. package/src/successors.ts +16 -19
  187. package/src/symmetry.ts +1 -1
  188. package/src/tableau.ts +6 -7
  189. package/src/tlc/fingerprint.ts +214 -0
  190. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  191. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  192. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  193. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  194. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  195. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  196. package/src/transfer.ts +32 -32
  197. package/src/values.ts +72 -67
  198. package/src/worker.ts +1 -4
  199. package/dist/run-cli.cjs +0 -38
  200. package/dist/run-cli.js +0 -38
  201. package/src/canonical.ts +0 -40
  202. package/src/obligations/ctx.ts +0 -64
  203. package/src/prove/prep/defs.ts +0 -27
  204. package/src/prove/prep/elab.ts +0 -156
  205. package/src/prove/prep/enabled.ts +0 -43
  206. package/src/prove/prep/flatten.ts +0 -70
  207. package/src/prove/prep/trivial.ts +0 -22
  208. package/src/prove/prove.ts +0 -417
  209. package/src/prove/smt/axiomatize.ts +0 -69
  210. package/src/prove/smt/simplify.ts +0 -57
  211. package/src/prove/verdict.ts +0 -13
  212. package/src/standard-ranges.ts +0 -116
  213. package/src/value-sources.ts +0 -29
  214. /package/src/{prove → prover}/isabelle/LICENSE +0 -0
  215. /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
  216. /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
  217. /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
  218. /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
  219. /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
  220. /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
  221. /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
  222. /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
  223. /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
  224. /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
  225. /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
  226. /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
  227. /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
  228. /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
  229. /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
  230. /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
  231. /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
  232. /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
  233. /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
  234. /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
  235. /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
  236. /package/src/{prove → prover}/ptl/decide.ts +0 -0
  237. /package/src/{prove → prover}/ptl/sat.ts +0 -0
  238. /package/src/{prove → prover}/ptl/tableau.ts +0 -0
  239. /package/src/{prove → prover}/smt/context.ts +0 -0
  240. /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
  241. /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
  242. /package/src/{prove → prover}/smt/solver/array.ts +0 -0
  243. /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
  244. /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
  245. /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
  246. /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
  247. /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
  248. /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
  249. /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
  250. /package/src/{prove → prover}/smt/solver/context.ts +0 -0
  251. /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
  252. /package/src/{prove → prover}/smt/solver/der.ts +0 -0
  253. /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
  254. /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
  255. /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
  256. /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
  257. /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
  258. /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
  259. /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
  260. /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
  261. /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
  262. /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
  263. /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
  264. /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
  265. /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
  266. /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
  267. /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
  268. /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
  269. /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
  270. /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
  271. /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
  272. /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
  273. /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
  274. /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
  275. /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
  276. /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
  277. /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
  278. /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
  279. /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
  280. /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
  281. /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
  282. /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
  283. /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
  284. /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
  285. /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
  286. /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
  287. /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
  288. /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
  289. /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
  290. /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
  291. /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
  292. /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
  293. /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
  294. /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
  295. /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
  296. /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
  297. /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
  298. /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
  299. /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
  300. /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
  301. /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
  302. /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
  303. /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
  304. /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
  305. /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
  306. /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
  307. /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
  308. /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
  309. /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
  310. /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
  311. /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
  312. /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
  313. /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
  314. /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
  315. /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
  316. /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
  317. /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
  318. /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
  319. /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
  320. /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
  321. /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
  322. /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
  323. /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
  324. /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
  325. /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
  326. /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
  327. /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
  328. /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
  329. /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
  330. /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
  331. /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
  332. /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
  333. /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
  334. /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
  335. /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
  336. /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
  337. /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
  338. /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
  339. /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
  340. /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
  341. /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
  342. /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
  343. /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
  344. /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
  345. /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
  346. /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
  347. /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
  348. /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
  349. /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
  350. /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
  351. /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
  352. /package/src/{prove → prover}/smt/table.ts +0 -0
  353. /package/src/{prove → prover}/tlaps-module.ts +0 -0
  354. /package/src/{prove → prover}/zenon/LICENSE +0 -0
  355. /package/src/{prove → prover}/zenon/check/check.ts +0 -0
  356. /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
  357. /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
  358. /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
  359. /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
  360. /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
  361. /package/src/{prove → prover}/zenon/check/records.ts +0 -0
  362. /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
  363. /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
  364. /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
  365. /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
  366. /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
  367. /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
  368. /package/src/{prove → prover}/zenon/limits.ts +0 -0
  369. /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
  370. /package/src/{prove → prover}/zenon/parse.ts +0 -0
  371. /package/src/{prove → prover}/zenon/phrase.ts +0 -0
  372. /package/src/{prove → prover}/zenon/proof.ts +0 -0
  373. /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
  374. /package/src/{prove → prover}/zenon/rules.ts +0 -0
  375. /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
  376. /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
  377. /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
  378. /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
  379. /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
  380. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  381. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  382. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
package/dist/run-cli.cjs DELETED
@@ -1,38 +0,0 @@
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("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:os"),s=require("node:url"),c=require("node:v8");var l=`0.0.4-dev.702eb98`;const u=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},d=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(u).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},f={builtin:1,number:2,string:3,ident:4,added:5},p=()=>({labelFlag:!1,reportLabelsFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,fairAlgorithm:!1,checkTermination:!1,noOld:!1,nocfg:!1,noDoneDisjunct:!1,specOption:!1,myspecOption:!1,specFile:``,optionsInFile:!1,inputVersionNumber:1903}),m=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},h=[`unfair`,`wf`,`sf`],g=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),_=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,v=t=>{if(t.kind!==`LabeledStmt`)throw new e.s(`ClassCastException: ${t.kind}`);return t},y=(t,n)=>{if(n<0||n>=t.length)throw new e.s(`ArrayIndexOutOfBoundsException: ${n}`);return t[n]},b=(e,t,n)=>({string:e,column:t,type:n}),x=e=>e.type===f.string?e.string.length+2:e.string.length,S=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),C=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},w=e=>{let t=S(e);return C(t),t},T=t=>{let n=t.anchorTokens,r=t.anchorTokCol;if(n===void 0||r===void 0)throw new e.s(`NullPointerException: TLAExpr.renormalize`);t.tokens.forEach((t,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new e.o(`TLAExpr.renormalize() found anchor has moved to left.`);t.forEach(e=>{e.column+=o})})},E=e=>w(e.tokens.map(e=>e.map(e=>({...e})))),D=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+x(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,T(e)},ee=e=>e.tokens.length===1&&e.tokens[0].length===1,O=(e,t)=>y(y(e.tokens,t.line),t.item),te=(t,n,r)=>{if(t.tokens.length<=n.line)throw new e.a(`TLAExpr.StepCoord called with line too big`);if(t.tokens[n.line].length<=n.item)throw new e.a(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let e=0;e<r;e++)if(i.item+=1,t.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<t.tokens.length&&t.tokens[i.line].length===0;)i.line+=1;if(i.line===t.tokens.length)return}return i},k=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=O(e,r),i=n.type===f.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?te(e,r,2):void 0,o=a===void 0?void 0:O(e,a),s=o!==void 0&&o.type!==f.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=te(e,r,c)}},ne=(e,t,n,r)=>{let i=O(e,n);if(ee(e)){let n=E(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+x(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(ee(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=f.builtin);let n=E(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(b(`)`,e.column+x(e),f.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+x(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return T(e),te(e,d,1)},re=(t,n,r,i=!0)=>{let a=r.map(e=>k(t,e,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=te(t,o.position,1),c=ne(t,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:k(t,r[o.index],c),a.forEach((t,n)=>{if(n!==o.index&&t!==void 0&&c!==void 0){if(s===void 0)throw new e.s(`NullPointerException: TLAExpr.substituteForAll`);t.line===o.position.line&&(t.item+=c.item-s.item),t.line+=c.line-s.line}})}},ie=(e,t,n)=>{let r=E(e);return re(r,t,n),r},ae=(e,t,n)=>e.map(e=>ie(e,t,n)),A=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===f.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
10
- `)} >>`},oe=(e,t,n)=>{let r=e=>A(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${h[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},j=(e,t,n,r,i)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).reduce((e,t)=>t===` `?(Math.floor(e/8)+1)*8:e+1,0):0,lastLine:r,lastColumn:i,isTabToSpaces:!1}),M=e=>{if(e.currentLine===void 0)return` `;if(e.isTabToSpaces)return e.vcolumn+=1,e.vcolumn%8==0&&(e.isTabToSpaces=!1),` `;if(e.line>e.lastLine||e.line===e.lastLine&&e.column>=e.lastColumn)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
11
- `;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t===` `?(e.vcolumn%8!=0&&(e.isTabToSpaces=!0),` `):t},se=t=>{if(t.column>0){--t.column,--t.vcolumn;return}if(t.line===0)throw new e.a(`PcalCharReader.backspace trying to move past beginning of reader`);--t.line;let n=Array.from(t.lines[t.line]);for(t.currentLine=n,t.column=0,t.vcolumn=0;t.column<n.length-1;)M(t)},ce=e=>{for(;;){let t=M(e);if(t===` `)return` `;if(t!==` `&&t!==`
12
- `)break}return se(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},le=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),ue=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),de=/* @__PURE__ */ new Set([...le,...ue,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),N=e=>/^[A-Za-z_]$/.test(e),fe=e=>/^[0-9]$/.test(e),pe=e=>e===` `||e===`\f`||e===`\r`,me=new Set([...de].filter(e=>!N(e[0])&&!(e[0]===`\\`&&N(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),he=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),ge=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),P={...f,dashes:6,endModule:7},_e=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),ve=(t,n,r,i)=>{let a={lines:[],line:[],token:``,state:`start`,column:n.vcolumn,nextColumn:n.vcolumn,nextChar:M(n),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},o=()=>{a.nextColumn=n.vcolumn,a.nextChar=M(n)},s=()=>{a.token+=a.nextChar,o()},c=()=>{a.state=`start`,a.column=a.nextColumn},l=()=>{a.lines.push(a.line),a.line=[],a.column=0},u=t=>{throw new e.o(`${t} \`${a.token}' found at\n line ${n.line+1}, column ${a.column+1}`)},d=()=>{a.isExprEnd=!0,t.delimiter=a.token,t.delimiterCol=a.column,t.delimiterLine=n.line-+(a.nextChar===`
13
- `)},f=e=>{if(!r){d(),a.token=``;return}e>P.ident&&u(`Illegal token in an expression`);let t=a.token;e!==P.string&&(ge.has(t)&&!(e===P.ident&&[`.`,`[`,`,`].includes(a.previousToken))||(t===`,`&&!a.isInQuantifier&&!i||t===`)`||t===`}`)&&a.parenDepth===0)?(a.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),a.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),a.line.length>0&&l()):(e===P.builtin&&le.has(t)&&(a.parenDepth+=1),e===P.builtin&&ue.has(t)&&(--a.parenDepth,a.parenDepth<0&&u(`Extra (unmatching)`)),a.previousToken=e===P.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&a.parenDepth===0&&(a.isInQuantifier=!0),a.isInQuantifier&&t===`:`&&a.parenDepth===0&&(a.isInQuantifier=!1),(t!==``||e===P.string)&&a.line.push(b(t,a.column,e)),a.token=``)},p=e=>{f(e),c()},m=e=>{s(),a.state=e},h=e=>{o(),a.state=e},g=r=>{switch(a.state){case`start`:if(pe(r))return o(),c();if(N(r))return m(`id`);if(r===`ℕ`||r===`ℤ`||r===`ℝ`)return s(),p(P.ident);if(fe(r))return m(`numOrId`);if(r===`\\`)return m(`bs`);if(r===`-`)return m(`dash1`);if(r===`=`)return m(`eq1`);if(r===`(`)return h(`leftParen`);if(r===`"`)return h(`string`);if(r===`
14
- `)return o(),l(),c();if(me.has(r))return m(`builtIn`);if(r===` `){a.state=`done`;return}return s(),u(`Illegal lexeme`);case`id`:return a.token===`WF_`||a.token===`SF_`?p(P.builtin):N(r)||fe(r)?s():p(de.has(a.token)?P.builtin:P.ident);case`numOrId`:return fe(r)?s():N(r)?m(`id`):p(P.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(r))return m(`numOrBi`);if(N(r)){a.state=`bsBuiltIn`;return}if(r===`*`){o(),a.token=``,a.state=`lineComment`;return}a.state=`builtIn`;return;case`numOrBi`:a.state=fe(r)?`num`:`bsBuiltIn`;return;case`num`:if(fe(r))return s();if(!N(r))return p(P.number);s(),a.token.startsWith(`\\`)&&u(`Illegal lexeme`),a.state=`id`;return;case`bsBuiltIn`:return N(r)&&r!==`_`?s():de.has(a.token)?p(P.builtin):u(`Illegal lexeme `);case`builtIn`:if(me.has(a.token+r))return s();if(!de.has(a.token)){for(se(n);!de.has(a.token);)se(n),a.token.length===0&&u(`Illegal lexeme`),a.token=Array.from(a.token).slice(0,-1).join(``);o()}return p(P.builtin);case`dash1`:case`dash2`:if(r===`-`)return m(a.state===`dash1`?`dash2`:`dash3`);a.state=`builtIn`;return;case`dash3`:return r!==`-`&&u(`Illegal lexeme`),m(`dashes`);case`dashes`:return r===`-`?s():p(P.dashes);case`eq1`:case`eq2`:if(r===`=`)return m(a.state===`eq1`?`eq2`:`eq3`);a.state=`builtIn`;return;case`eq3`:return r!==`=`&&u(`Illegal lexeme`),m(`eqs`);case`eqs`:return r===`=`?s():p(P.endModule);case`leftParen`:if(r===`*`)return t.commentDepth=1,h(`comment`);a.token=`(`,a.state=`builtIn`;return;case`string`:if(r===`\\`)return m(`escString`);if(r===`"`)return o(),p(P.string);s(),he.has(r)||u(`Illegal character in string`);return;case`escString`:s(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(r)||u(`Illegal character following \\ in string`),a.state=`string`;return;case`lineComment`:return r===`(`?h(`lineComParen`):r===`*`&&t.commentDepth>0?h(`lineComStar`):r===`
15
- `||r===` `?(a.token=``,t.commentDepth=0,c()):t.commentDepth===0?s():o();case`lineComParen`:if(r===`*`)return t.commentDepth+=1,h(`lineComment`);t.commentDepth===0&&(a.token+=`(`),a.state=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--t.commentDepth,t.commentDepth<0)throw new e.a(`Failure of assertion: case LINE_COM_STAR`);return h(`lineComment`)}t.commentDepth===0&&(a.token+=`*`),a.state=`lineComment`;return;case`comment`:case`orComment`:{let n=a.state===`comment`;if(r===`*`)return h(n?`commentStar`:`orCommentStar`);if(r===`(`)return h(n?`commentParen`:`orCommentParen`);if(r===`
16
- `){a.token=``,o(),l(),a.state=`orComment`;return}if(r===` `)throw new e.o(n?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return t.commentDepth===1?s():o()}case`commentStar`:case`orCommentStar`:{let n=a.state===`commentStar`?`comment`:`orComment`;if(r!==`)`){t.commentDepth===1&&(a.token+=`*`),a.state=n;return}if(o(),--t.commentDepth,n===`orComment`&&t.commentDepth<0)throw new e.a(`Assertion failure`);if(t.commentDepth!==0){a.state=n;return}return a.token=``,c()}case`commentParen`:case`orCommentParen`:{let e=a.state===`commentParen`?`comment`:`orComment`;if(r===`*`)return t.commentDepth+=1,h(e);t.commentDepth===1&&(a.token+=`(`),a.state=e;return}}};for(;a.state!==`done`&&!a.isExprEnd;)g(a.nextChar);return a.nextChar!==`
17
- `&&se(n),w(a.lines)},ye=(e,t,n)=>ve(e,t,!0,n),be=(e,t)=>(ve(e,t,!1,!1),e.delimiter),xe=(e,t)=>({params:e,tokenizer:_e(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),Se=()=>w([[b(`defaultInitValue`,0,0)]]),Ce=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],we=(e,t)=>!t.some(t=>e.includes(t)),Te=(e,t)=>{t.splice(0,t.length,...e)},Ee=(t,n,r)=>{let i=t.params,a=t.lookahead,o=t.lastToken,s={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],pSyntax:!1,cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:i.inputVersionNumber>=1500,omitStutteringWhenDone:i.inputVersionNumber>=1500},c=t=>{throw new e.o(`${t}\n line ${o.line}, column ${o.column}`)},l=()=>{if(s.lookaheadSize===0)return ce(n),o.column=n.vcolumn+1,o.line=n.line+1,o.text=be(t.tokenizer,n),o.text;o.column=a.columns[0]+1,o.line=a.lines[0]+1;let e=a.tokens[0];for(let e=1;e<s.lookaheadSize;e++)a.tokens[e-1]=a.tokens[e],a.columns[e-1]=a.columns[e],a.lines[e-1]=a.lines[e];return--s.lookaheadSize,o.text=e,e},u=r=>{for(;s.lookaheadSize<r;){let r=s.lookaheadSize;if(ce(n)===` `)throw new e.o(`Premature end of file, perhaps because of unclosed comment, near\n line ${a.lines[r]+1}, column ${a.columns[r]+1}`);a.columns[r]=n.vcolumn,a.lines[r]=n.line,a.tokens[r]=be(t.tokenizer,n),s.lookaheadSize+=1}return a.tokens[r-1]},d=r=>{if(r<s.lookaheadSize)throw new e.a(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
18
- it has already peeked at`);for(;r>s.lookaheadSize;)a.tokens[s.lookaheadSize]=be(t.tokenizer,n),s.lookaheadSize+=1;return ce(n)},p=(r=!1)=>{if(s.lookaheadSize!==0)throw new e.a(`ParseAlgorithm: GetExpr called after lookahead`);let i=ye(t.tokenizer,n,r);return a.tokens[0]=t.tokenizer.delimiter,a.columns[0]=t.tokenizer.delimiterCol,a.lines[0]=t.tokenizer.delimiterLine,s.lookaheadSize=1,i},m=(t,n)=>{if(t===`;`){let t=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(t))return;if(`if either while with call return goto print assert skip`.split(` `).includes(t))throw new e.o(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}let r=l();r!==t&&r!==n&&c(`Expected "${t}" but found "${r}"`)},h=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},v=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},b=()=>m(u(1)===`,`?`,`:`;`),x=()=>m(s.pSyntax?`begin`:`{`),w=e=>{s.cSyntax?m(`}`):(m(`end`),m(e))},T=()=>{u(1)===`variables`?h(`variables`):m(`variable`)},k=()=>{let t={...g(),kind:`VarDecl`,var:l(),col:o.column,line:o.line,isEq:!0,val:Se()};if(![`=`,`\\in`,`∈`].includes(u(1)))return s.hasDefaultInitialization=!0,t;if(t.isEq=v(),t.val=p(),t.val.tokens.length===0)throw new e.s(`NullPointerException`);return t},ne=()=>{T();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(k()),b();return e},re=()=>{let t={...g(),kind:`PVarDecl`,var:l(),col:o.column,line:o.line,val:Se()};if(u(1)!==`=`)return s.hasDefaultInitialization=!0,t;if(m(`=`),t.val=p(),t.val.tokens.length===0)throw new e.s(`NullPointerException`);return t},A=()=>{T();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(re()),b();return e},oe=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=ce(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},j=()=>{if(!oe())return``;let e=l();t.isInMacro&&c(`A label may not appear in a macro.`),e===`Done`&&c("Cannot use `Done' as a label."),e===`Error`&&c("Cannot use `Error' as a label."),m(`:`),s.hasLabel=!0,s.allLabels.add(e);let n=u(1);return n!==`+`&&n!==`-`||(m(n),(n===`+`?s.plusLabels:s.minusLabels).push(e),s.omitPC=!1),e},M=()=>{let e=[],t=e=>s.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||s.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...le());return s.cSyntax&&e.length===0&&c(`Empty statement list`),e},se=t=>{h(`{`);let n=M();if(m(`}`),m(`;`),t!==``){if(n[0].lbl!==``)throw new e.o(`Duplicate labeling of statement`,n[0]);n[0].lbl=t}return n},le=()=>{let e=j();if(s.cSyntax&&u(1)===`{`)return se(e);let t=ue();return t.lbl=e,[t]},ue=()=>{let t=u(1);if(t===`if`)return N(0);if(t===`either`)return fe();if(t===`with`)return pe(0);if(t===`when`||t===`await`){h(t);let n=o.column,r=o.line,i=p();if(i.tokens.length===0)throw new e.s(`NullPointerException`);return m(`;`),{...g(),kind:`When`,col:n,line:r,exp:i}}if(t===`print`||t===`assert`){h(t);let e=o.column,n=o.line,r=p();return r.tokens.length===0&&c(`Empty expression in ${t} statement at `),m(`;`),{...g(),kind:t===`print`?`PrintS`:`Assert`,col:e,line:n,exp:r}}if(t===`skip`){h(`skip`);let e={...g(),kind:`Skip`,col:o.column,line:o.line};return m(`;`),e}if(t===`call`)return _e();if(t===`return`){h(`return`);let e={...g(),kind:`Return`,col:o.column,line:o.line,from:s.currentProcedure};return m(`;`),e}if(t===`goto`){h(`goto`);let e=o.column,t=o.line,n=l();return s.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(s.gotoDoneUsed=!0),m(`;`),{...g(),kind:`Goto`,col:e,line:t,to:n}}return t===`while`?de():d(1)[0]===`(`?ve():he()},de=()=>{h(`while`);let e=o.column,t=o.line;s.cSyntax&&m(`(`);let n=p();s.cSyntax&&m(`)`),n.tokens.length===0&&c(`Empty while test at `),s.pSyntax&&m(`do`);let r=s.pSyntax?M():le();return s.pSyntax&&(m(`end`),m(`while`),m(`;`)),r.length===0&&c(`Missing body of while statement at`),{...g(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},N=e=>{h(e===0?`if`:`elsif`);let t={...g(),kind:`LabelIf`,col:o.column,line:o.line,test:S(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};s.cSyntax&&m(`(`),t.test=p(),s.cSyntax&&m(`)`),t.test.tokens.length===0&&c(`Empty if test at `),s.pSyntax&&m(`then`),t.unlabThen=s.pSyntax?M():le();let n=u(1);return n===`else`&&(h(`else`),t.unlabElse=s.pSyntax?M():le()),s.pSyntax&&n===`elsif`&&(t.unlabElse=[N(e+1)]),s.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),s.pSyntax&&e===0&&(m(`end`),m(`if`),m(`;`)),t.unlabElse.length===0&&y(t.unlabThen,t.unlabThen.length-1),t},fe=()=>{h(`either`);let t={...g(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...g(),kind:`Clause`,unlabOr:s.pSyntax?M():le(),labOr:[]};if(n.unlabOr.length===0)throw new e.o("`either' statement with empty `or' clause",t);if(t.clauses.push(n),u(1)!==`or`)break;h(`or`)}if(s.pSyntax&&(h(`end`),m(`either`),m(`;`)),t.clauses.length===1)throw new e.o("`either' statement has no `or'",t);return t},pe=t=>{t===0&&(m(`with`),s.cSyntax&&m(`(`));let n={...g(),kind:`With`,col:o.column,line:o.line,var:l(),isEq:!0,exp:S(),Do:[]};n.isEq=v(),n.exp=p(),(s.pSyntax||u(1)!==`)`)&&b(),n.exp.tokens.length===0&&c(`Empty with expression at `);let r=s.pSyntax&&u(1)===`do`,i=s.cSyntax&&u(1)===`)`;if(r&&m(`do`),i&&h(`)`),n.Do=r?M():i?le():[pe(t+1)],r&&(m(`end`),m(`with`),m(`;`)),n.Do.length===0)throw new e.o(`Missing body of with statement`,n);return n},me=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...g(),kind:`Lhs`,col:e,line:t,var:l(),sub:p()};m(`:=`,`≔`);let r=p();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...g(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},he=()=>{let t={...g(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[me()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{t.ass.push(me())}catch(t){if(!(t instanceof e.o))throw t;c(`Bad assignment statement at `)}}return m(`;`),t},ge=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=p();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;m(`,`)}return m(`)`),m(`;`),e},P=()=>{h(`call`);let e={...g(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:l(),args:[]};return m(`(`),e.args=ge(),s.proceduresCalled.includes(e.to)||s.proceduresCalled.push(e.to),e},_e=()=>{let e=P();if(u(1)===`return`)return h(`return`),m(`;`),{...g(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:s.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;h(`goto`);let t={...g(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return s.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(s.gotoDoneUsed=!0),m(`;`),t},ve=()=>{let e={...g(),kind:`MacroCall`,name:l(),col:o.column,line:o.line,args:[]};return h(`(`),e.args=ge(),e},xe=e=>{t.isInMacro=!0,h(`macro`);let n={...g(),kind:`Macro`,col:o.column,line:o.line,name:l(),params:[],body:[]};for(m(`(`);u(1)!==`)`;)n.params.length>0&&m(`,`),n.params.push(l());return h(`)`),x(),n.body=M(),w(`macro`),u(1)===`;`&&l(),Pe(n.body,e),t.isInMacro=!1,n},Ee=()=>{m(`procedure`);let e={...g(),kind:`Procedure`,col:o.column,line:o.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(s.currentProcedure=e.name,s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],m(`(`);u(1)!==`)`;)e.params.length>0&&m(`,`),e.params.push(re());return h(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=A()),x(),e.body=M(),w(`procedure`),u(1)===`;`&&l(),s.currentProcedure=void 0,e.plusLabels=s.plusLabels,e.minusLabels=s.minusLabels,e.proceduresCalled=s.proceduresCalled,e},F=()=>{m(`process`);let e=o.column,t=o.line;s.cSyntax&&m(`(`);let n=l(),r=v(),i=p();s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],s.cSyntax&&m(`)`),i.tokens.length===0&&c(`Empty process id at `);let a=u(1)===`begin`||u(1)===`{`?[]:ne();x();let d=M();return w(`process`),u(1)===`;`&&l(),{...g(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:s.minusLabels,plusLabels:s.plusLabels,proceduresCalled:s.proceduresCalled,isEq:r,id:i,decls:a,body:d}},De=()=>{let e=`${i.labelRoot}${s.nextLabelNum}`;return s.nextLabelNum+=1,s.allLabels.has(e)?De():e},Oe=e=>{e.lbl===``&&(e.lbl=De(),s.addedLabels.push(e.lbl),s.addedLabelsLocs.push(_(e)))},ke=(t,n,r,i,a)=>{Te(i,a);let o={isNextLabeled:n,hasLabel:!1},c=e=>{Oe(e),o.hasLabel=!0,a.length=0};return t.forEach(t=>{if(t.lbl!==``&&(o.hasLabel=!0,a.length=0,r))throw new e.o("Label in `with' statement",t);if(o.isNextLabeled){if(r)throw new e.o("Statement follows `call' or `return' inside a `with' statement.",t);c(t),o.isNextLabeled=!1}switch(t.kind){case`LabelIf`:{let e=[],n=[],i=ke(t.unlabThen,!1,r,a,e);o.isNextLabeled=ke(t.unlabElse,!1,r,a,n)||i,Te(Ce(e,n),a);return}case`LabelEither`:{let e=[];t.clauses.forEach(t=>{let n=[];o.isNextLabeled=ke(t.unlabOr,!1,r,a,n)||o.isNextLabeled,Te(Ce(n,e),e)}),Te(e,a);return}case`While`:if(r)throw new e.o("`while' inside a `with' statement",t);c(t),ke(t.unlabDo,!1,!1,a,[]),o.isNextLabeled=!1;return;case`With`:{let e=[];o.isNextLabeled=ke(t.Do,!1,!0,r?[...i]:[],e),Te(e,a),!r&&!we(i,a)&&c(t);return}}let n=t.kind===`Call`||t.kind===`CallGoto`,l=t.kind===`Return`||t.kind===`CallReturn`,u=t.kind===`Assign`?Ce([],t.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||t.to===s.currentProcedure?s.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o.isNextLabeled=n||l||t.kind===`Goto`,we(a,u))Te(Ce(a,u),a);else{if(r)throw new e.o(t.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",t);c(t),Te(u,a)}}),o.hasLabel||o.isNextLabeled},Ae=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return Ae(n),{unlabeled:n,labeled:I(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},I=t=>{let n=[];return t.forEach(t=>{if(t.lbl===``&&n.length>0)n[n.length-1].stmts.push(t);else{if(t.lbl===``)throw new e.a(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...g(),kind:`LabeledStmt`,col:t.col,line:t.line,macroCol:t.macroCol,macroLine:t.macroLine,label:t.lbl,stmts:[t]})}}),n.forEach(e=>Ae(e.stmts)),n},je=(t,n)=>{let r=t[n];switch(r.kind){case`LabelIf`:{let e=L(r.unlabThen);r.labThen.forEach(e=>L(e.stmts));let i=L(r.unlabElse);return r.labElse.forEach(e=>L(e.stmts)),r.labThen.length>0||r.labElse.length>0||e===2||i===2?2:(t[n]={...g(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(e+i>0))}case`LabelEither`:{let e=r.clauses.reduce((e,t)=>{let n=Math.max(e,L(t.unlabOr));return t.labOr.forEach(e=>L(e.stmts)),t.labOr.length>0?2:n},0);return e===2?2:(t[n]={...g(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},e)}case`With`:{let t=L(r.Do);if(t===2)throw new e.o(`with statement at ${_(r)} contains a labeled statement`);return t}case`While`:if(n!==0)throw new e.a("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return L(r.unlabDo),r.labDo.forEach(e=>L(e.stmts)),0;case`Call`:return t[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(s.currentProcedure===void 0)throw new e.o(`return statement not in a procedure at ${_(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new e.a(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},L=t=>{for(let n=0;n<t.length;n++){let r=je(t,n);if(r!==0){if(n===t.length-1)return r;throw new e.a(`Translator discovered later than it should have that\n Statement at ${_(t[n+1])} must have a label`)}}return 0},R=e=>{ke(e,!0,!1,[],[]);let t=I(e);return t.forEach(e=>L(e.stmts)),t},Me=(t,n,r,i,a)=>{let o=e=>ie(e,n,r),s=e=>e.map(e=>Me(e,n,r,i,a)),c=e=>e.map(e=>({...g(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>Me(e,n,r,-1,0))})),l={...g(),col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine};switch(t.kind){case`Assign`:return{...l,kind:`Assign`,ass:t.ass.map(e=>Ne(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(t.test),Then:s(t.Then),Else:s(t.Else)};case`Either`:return{...l,kind:`Either`,ors:t.ors.map(s)};case`With`:return{...l,kind:`With`,var:t.var,isEq:t.isEq,exp:o(t.exp),Do:s(t.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:t.kind,exp:o(t.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(t.test),unlabDo:s(t.unlabDo),labDo:c(t.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(t.test),unlabThen:s(t.unlabThen),labThen:c(t.labThen),unlabElse:s(t.unlabElse),labElse:c(t.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:t.clauses.map(e=>({...g(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:t.to,returnTo:t.returnTo,args:ae(t.args,n,r)};case`Return`:return{...l,kind:`Return`,from:t.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:t.to,from:t.from,args:ae(t.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:t.to,after:t.after,args:ae(t.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:t.to};default:throw new e.a(`Found unexpected statement type in macro at${_(t)}`)}},Ne=(t,n,r,i,a)=>{let o=ie(t.rhs,n,r),s={...g(),kind:`Lhs`,var:t.lhs.var,sub:t.lhs.sub.tokens.length===0?t.lhs.sub:ie(t.lhs.sub,n,r)},c={...g(),kind:`SingleAssign`,col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=O(u,{line:0,item:0});if(d.type!==f.ident)throw new e.o(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${_(c)}`);if(s.var=d.string,te(u,{line:0,item:0},1)===void 0)return c;let p=E(u);return p.tokens[0].splice(0,1),C(p),s.sub.tokens.length===0?s.sub=p:D(s.sub,p,0),c},Pe=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Pe(e.unlabThen,t),Pe(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Pe(e.unlabOr,t)),[e];case`With`:return Pe(e.Do,t),[e];case`While`:return Pe(e.unlabDo,t),[e];case`MacroCall`:return Fe(e,t);default:return[e]}});e.splice(0,e.length,...n)},Fe=(t,n)=>{let r=n.findLast(e=>e.name===t.name);if(r===void 0)throw new e.o(`Macro ${t.name} undefined,\n at ${_(t)}`);if(r.params.length!==t.args.length)throw new e.o(`Macro ${t.name} called with wrong number of arguments at \n ${_(t)}`);let i=r.body.map(e=>Me(e,t.args,r.params,t.line,t.col));return i.length>0&&(i[0].lbl=t.lbl),i},Ie=t=>{t.forEach((n,r)=>{if(t.slice(r+1).some(e=>e.name===n.name))throw new e.o(`Multiple definitions of macro name \`${n.name}'`)})},Le=e=>{if(e.length===0)return;let t=()=>{s.omitPC=!1,s.omitStutteringWhenDone=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!ee(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(s.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(s.omitPC=!1)},Re=()=>{let t=s.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new e.o([t,...s.addedLabelsLocs].join(`
19
- `))},z=()=>{i.reportLabelsFlag?(t.log(s.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),s.addedLabels.forEach((e,n)=>t.log(` ${e} at ${s.addedLabelsLocs[n]}`))):t.log(`Labels added.`)},B=e=>s.procedures.forEach(t=>{s.currentProcedure=t.name,Pe(t.body,e),t.body=R(t.body)}),ze=()=>{r&&(l()!==`algorithm`&&c("`--fair' not followed by `algorithm'"),i.fairAlgorithm=!0);let e=l();s.cSyntax=u(1)===`{`,s.pSyntax=!s.cSyntax,s.cSyntax&&h(`{`);let n=u(1)===`variable`||u(1)===`variables`?ne():[],a={value:S()};u(1)===`define`&&(h(`define`),s.cSyntax&&m(`{`),a.value=p(!0),w(`define`),m(`;`));let o=[];for(;u(1)===`macro`;)o.push(xe(o));for(;u(1)===`procedure`;)s.procedures.push(Ee()),s.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let t=[];for(;u(1)===`fair`||u(1)===`process`;){let e=u(1)===`fair`;e&&h(`fair`);let n=e&&u(1)===`+`;n&&h(`+`);let r=n||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;t.push({...F(),fairness:r})}w(`algorithm`),Ie(o);let r=t.map(e=>(Pe(e.body,o),e.body=R(e.body),s.omitStutteringWhenDone=!0,Le(e.body),s.omitStutteringWhenDone));return s.omitStutteringWhenDone=r.includes(!0),B(o),s.addedLabels.length>0&&(i.labelFlag||Re(),z()),s.gotoDoneUsed&&(s.omitPC=!1,s.omitStutteringWhenDone=!1),s.gotoUsed&&(s.omitPC=!1),{...g(),kind:`Multiprocess`,name:e,decls:n,defs:a.value,macros:o,prcds:s.procedures,procs:t}}i.inputVersionNumber===1500&&u(1)===`fair`&&(m(`fair`),u(1)===`+`&&m(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||t.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),x();let d=M();Ie(o),Pe(d,o),B(o),s.cSyntax&&m(`}`),w(`algorithm`);let f=R(d);return s.addedLabels.length>0&&(s.hasLabel&&!i.labelFlag&&Re(),z()),s.gotoUsed&&(s.omitPC=!1),s.gotoDoneUsed||Le(f),s.gotoDoneUsed&&(s.omitPC=!1,s.omitStutteringWhenDone=!1),{...g(),kind:`Uniprocess`,name:e,decls:n,defs:a.value,macros:o,prcds:s.procedures,body:f}};try{return{ast:ze(),omitPC:s.omitPC,omitStutteringWhenDone:s.omitStutteringWhenDone,hasDefaultInitialization:s.hasDefaultInitialization}}catch(t){if(!(t instanceof e.s))throw t;return c(`Unknown error at or before`)}},F={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},De=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],Oe=/* @__PURE__ */ new Set([F.global,F.processVar,F.procedureVar,F.parameter]),ke=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Ae=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),I=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},je=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},L=(e,t,n,r,i,a,o)=>!(t===F.procedureVar||t===F.processVar||t===F.parameter?ke(e,F.global,n,``)!==void 0||Ae(e,n,r)!==void 0:ke(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),R=(e,t,n,r)=>ke(e,t,n,r)?.useThis??n,Me=(e,t,n)=>{let r=Ae(e,t,n);return r===void 0?t:Oe.has(r.type)?r.useThis:t},Ne=t=>{let n={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},r=(e,t,r)=>{L(n,F.label,e.label,t,r,e.line,e.col)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t,r))},i=(t,n,a)=>{let o=e=>e.forEach(e=>i(e,n,a)),s=e=>e.forEach(e=>r(e,n,a));switch(t.kind){case`While`:o(t.unlabDo),s(t.labDo);return;case`If`:o(t.Then),o(t.Else);return;case`With`:o(t.Do);return;case`LabelIf`:o(t.unlabThen),s(t.labThen),o(t.unlabElse),s(t.labElse);return;case`Either`:t.ors.forEach(o);return;case`LabelEither`:t.clauses.forEach(e=>{o(e.unlabOr),s(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new e.a(`Unexpected AST type ${t.kind}`)}},a=(e,t,r=`process`,i=t===``?F.global:F.processVar)=>{L(n,i,e.var,t,r,e.line,e.col)||(n.errorReport+=`\n${De[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(L(n,F.global,`pc`,``,``,0,0),t.prcds.length>0&&L(n,F.global,`stack`,``,``,0,0),t.decls.forEach(e=>a(e,``)),t.prcds.forEach(e=>{let t=I(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:v(e.body[0]).label}),L(n,F.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>a(t,e.name,`procedure`,F.procedureVar)),e.params.forEach(t=>a(t,e.name,`procedure`,F.parameter)),e.body.forEach(t=>r(v(t),e.name,`procedure`))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>{let t=je(n,e.name)<n.processes.length;t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processes.push({name:e.name,initialPC:e.body.length===0?void 0:v(e.body[0]).label}),L(n,F.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(v(t),e.name,`process`))}),t.kind===`Uniprocess`&&(t.body.length>0&&(n.initialPC=v(t.body[0]).label),t.body.forEach(e=>r(v(e),``,``))),n.errorReport.length>0)throw new e.o(n.errorReport);return n},Pe=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1;for(let n=0;n<=7;n+=1)e.symbols.forEach(r=>{if(r.type!==n)return;r.useThis=r.id;for(let e=1;n>0&&t(r.useThis);e+=1)r.useThis+=e===1?`_`:r.context[e-2]??String(n);if(r.id===r.useThis)return;let i=r.context.length===0?``:` of ${r.contextType} ${r.context}`;e.disambiguateReport.push(`\\* ${De[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},Fe=t=>{let n=t.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${De[e.type]} name`);if(n.length>0)throw new e.o(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},Ie=(t,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==f.ident)return;let a=Me(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(w([[B(a)]])))})),i.length>0&&re(e,i,r,!1)},a=(e,t)=>{e.var=Me(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=R(n,F.label,r,t)}),s=(e,t)=>e===void 0?void 0:R(n,F.procedure,e,t),c=(e,t)=>{e.label=R(n,F.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(t,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(t.kind){case`LabeledStmt`:c(t,r);return;case`While`:a(t.unlabDo),o(t.labDo),i(t.test,r);return;case`Assign`:t.ass.forEach(e=>{e.lhs.var=Me(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(t.Then),a(t.Else),i(t.test,r);return;case`With`:i(t.exp,r),a(t.Do);return;case`When`:case`PrintS`:case`Assert`:i(t.exp,r);return;case`Skip`:return;case`LabelIf`:i(t.test,r),a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Call`:t.returnTo=R(n,F.procedure,t.returnTo,r),t.to=R(n,F.procedure,t.to,r),u(t.args);return;case`Return`:t.from=s(t.from,r);return;case`CallReturn`:t.from=s(t.from,r),t.to=R(n,F.procedure,t.to,r),u(t.args);return;case`CallGoto`:t.after=R(n,F.procedure,t.after,r),t.to=R(n,F.procedure,t.to,r),u(t.args);return;case`Goto`:if(ke(n,F.label,t.to,r)===void 0&&t.to!==`Done`)throw new e.o(`goto to non-existent label \`${t.to}' at line ${t.line}, column ${t.col}`);t.to=R(n,F.label,t.to,r);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new e.a(`Unexpected AST type${t.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(v(t),e.name));let t=y(n.procedures,I(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=R(n,F.label,t.initialPC,e.name)),e.name=R(n,F.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(v(t),e.name));let t=y(n.processes,je(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=R(n,F.label,t.initialPC,e.name)),e.name=R(n,F.process,e.name,``),t.name=e.name};t.decls.forEach(e=>a(e,``)),t.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(t.prcds,t.procs),t.kind===`Uniprocess`&&(t.prcds.forEach(u),t.body.forEach(e=>c(v(e),``))),n.initialPC!==void 0&&(n.initialPC=R(n,F.label,n.initialPC,``))},Le=e=>b(e,0,f.string),Re=e=>b(e,0,f.added),z=e=>b(e,0,f.builtin),B=e=>b(e,0,f.ident),ze=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+x(r)+t;n.push(b(e.string,i,e.type))}),w([n])},Be=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=x(e),e.type===f.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),Ve=(e,t,n,r=0,i=0)=>({...g(),kind:`SingleAssign`,line:r,col:i,lhs:{...g(),kind:`Lhs`,var:e,sub:t},rhs:n}),He=(e,t=0,n=0)=>({...g(),kind:`Assign`,line:t,col:n,ass:e}),Ue=(e,t,n=0,r=0)=>He([Ve(e,w([]),t,n,r)],n,r),We=e=>{if(e.tokens.length>1)return!1;let t=y(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Ge=e=>({...g(),kind:`When`,exp:ze([Re(`pc`),z(`=`),Le(e)],1)}),Ke=e=>Ue(`pc`,w([[Le(e??`null`)]])),qe=e=>[B(`Head`),z(`(`),Re(`stack`),z(`)`),z(`.`),B(e)],Je=()=>[B(`Tail`),z(`(`),Re(`stack`),z(`)`)],Ye=e=>w([qe(e)]),Xe=(e,t,n,r)=>{let i=[[z(`<<`),z(`[`),B(`procedure`),z(`|->`),Le(e),z(`,`)],[B(`pc`),z(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(z(`,`)),i.push([B(e.var),z(`|->`),B(e.var)])}),i[i.length-1].push(z(`]`),z(`>>`)),i.push(r);let a=S(i);return Be(a),C(a),a},Ze=(t,n,r)=>{if(n.params.length!==r.args.length)throw new e.o(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((e,n)=>t.ass.push(Ve(e.var,w([]),r.args[n],r.line,r.col))),[t,...n.decls.map(e=>Ue(e.var,e.val,r.line,r.col)),Ke(n.initialPC)]},Qe=(t,n,r)=>{let i={procedure:void 0},a=(t,r)=>{let i=I(n,t.to);if(i===n.procedures.length)throw new e.o(`Call of non-existent procedure ${t.to}`,t);let a=n.procedures[i],o=Xe(t.to,[Le(r)],[...a.decls,...a.params],[z(`\\o`),Re(`stack`)]);return Ze(Ue(`stack`,o,t.line,t.col),a,t)},o=t=>{t.from??=i.procedure;let r=t.from;if(r===void 0)throw new e.o("`return' statement not in procedure",t);let a=I(n,r);if(a>=n.procedures.length)throw new e.o(`Error in procedure (perhaps name used elsewhere)`,t);let o=n.procedures[a],s=(e,n)=>He([Ve(e,S(),n,t.line,t.col)],t.line,t.col);return[s(`pc`,Ye(`pc`)),...o.decls.map(e=>s(e.var,Ye(e.var))),...o.params.map(e=>s(e.var,Ye(e.var))),s(`stack`,w([Je()]))]},s=t=>{let r=t.from;if(r===void 0)throw new e.o(`\`return' statement following \`call' at ${_(t)} not in a procedure`);let i=y(n.procedures,I(n,r)),a=I(n,t.to);if(a===n.procedures.length)throw new e.o(`Call of non-existent procedure ${t.to}`,t);let o=n.procedures[a],s=He([],t.line,t.col);if(r!==t.to){i.decls.forEach(e=>s.ass.push(Ve(e.var,S(),Ye(e.var),t.line,t.col)));let e=Xe(t.to,qe(`pc`),[...o.decls,...o.params],[z(`\\o`),...Je()]);s.ass.push(Ve(`stack`,w([]),e,t.line,t.col))}return Ze(s,o,t)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(Ke(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...g(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(Ke(t)),a.needsGoto&&i.Else.push(Ke(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(Ke(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(Ke(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(Ge(e.label)),a.push({...g(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=We(t.test),c=s?a.stmts:[{...g(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...g(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[Ge(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...g(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...g(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(v),t),b=e=>{i.procedure=e.name;let t=h(e.body,R(n,F.label,`Error`,``));return i.procedure=void 0,{...g(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},x=e=>({...g(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),C=t.prcds.map(b);return t.kind===`Uniprocess`?{...g(),kind:`Uniprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:C,body:h(t.body,`Done`)}:{...g(),kind:`Multiprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:C,procs:t.procs.map(x)}},$e=(t,n)=>{let r=n?[]:[`pc`];if(r.push(...t.decls.map(e=>e.var)),t.prcds.length>0&&r.push(`stack`),t.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new e.o(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(t,n)=>{let s=[...n];t.ass=o(t.ass),new Set(t.ass.map(e=>e.lhs.var)).forEach(n=>{let a=t.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new e.o(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new e.o(`Multiple assignment to ${n}`,t)}),a(n,s)},c=(t,n)=>{switch(t.kind){case`Assign`:s(t,n);return;case`If`:{let e=[...n],r=[...n];t.Then.forEach(t=>c(t,e)),t.Else.forEach(e=>c(e,r)),a(n,e),a(n,r);return}case`Either`:{let e=[...n];t.ors.forEach(t=>{let r=[...n];t.forEach(e=>c(e,r)),a(e,r)}),a(n,e);return}case`With`:t.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new e.a(`Unexpected AST type ${t.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);v(e).stmts.forEach(e=>c(e,t))});t.prcds.forEach(e=>l(e.body)),(t.kind===`Uniprocess`?[t.body]:t.procs.map(e=>e.body)).forEach(l)},et=(e,t,n,r)=>{let i=Ne(e);Pe(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),Ie(e,i,r),$e(Qe(e,i,t),t),n&&Fe(i)},V=`[ \\t\\n\\x0B\\f\\r]`,tt=RegExp(`\\\\\\* BEGIN TRANSLATION${V}+\\(${V}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${V}*(=${V}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${V}*STRING)${V}*\\/\\\\${V}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${V}*(=${V}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${V}*STRING)${V}*\\)`),nt=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),rt=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),it=(e,t)=>rt(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${_(t.node)}`),at=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),ot=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},st=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},ct=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},lt=e=>/^[\p{L}\p{Nd}_]$/u.test(e),ut=(e,t,n)=>{for(;t.line<e.length;){let r=st(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=ct(r,e,` `),!0}t.column=ct(r,t.column,` `)}return!1},dt=(e,t)=>rt(e,`Command-line error: ${t}`),ft=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(dt(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){dt(e,`
20
- Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){dt(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}n.specFile=s,a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:n.noOld=!0;continue;case`-nocfg`:n.nocfg=!0;continue;case`-noDoneDisjunct`:case`noDoneDisjunct`:n.noDoneDisjunct=!0;continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){dt(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){dt(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){dt(e,"Version number must follow `-version' option");return}let t=m(s);if(t<0||t>1903){rt(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),dt(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){dt(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:dt(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},pt=(e,t,n)=>{if(st(t,n),n.column+=7,!st(t,n).slice(n.column).startsWith(`(`)){rt(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=st(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=ct(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?rt(e,`No closing ')' found in options statement`):ft(e,r)},mt=(t,n,r)=>{let i={depth:0,isDone:!1,isInString:!1};for(let a=n;!i.isDone&&a<t.length;a++){let o=t[a],s=a===n?r:0,c=[o.slice(0,s)];i.isInString=!1;for(let e=s;!i.isDone&&e<o.length;e++){let t=o[e],n=o.slice(e,e+2);if(n===`(*`&&!i.isInString)i.depth+=1,c.push(` `),e+=1;else if(n===`*)`&&!i.isInString&&i.depth===0)c.push(n),i.isDone=!0;else if(n===`*)`&&!i.isInString)--i.depth,c.push(` `),e+=1;else if(i.depth>0)c.push(` `);else if(i.isInString&&t===`\\`&&n.length===2)c.push(n),e+=1;else{if(!i.isInString&&n===`\\*`){c.push(` `);break}t===`"`&&(i.isInString=!i.isInString),c.push(t)}}if(i.isInString)return new e.o(`Unterminated string in line ${a+1}`);t[a]=c.join(``)}},ht=(t,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new e.s(`java.lang.ArrayIndexOutOfBoundsException: Index ${t} out of bounds for length ${r}`)},gt=(t,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=at(n),a={line:0,column:0};for(;ut(i,a,`PlusCal`);){let e=st(i,a).slice(a.column),n=Array.from(e).findIndex(e=>!lt(e));if(e.startsWith(`options`)&&(n===-1?e.length:n)===7){t.params.optionsInFile=!0,pt(t,i,a);break}}let o={line:0,column:-1,isFound:!1,isFair:!1};for(;o.line<i.length;o.line++){let e=i[o.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o.column=t+11,o.isFound=!0;break}if(n!==-1){o.column=n+6,o.isFound=!0,o.isFair=!0;break}}let s=/* @__PURE__ */ new Set,c=ot(i,0,`BEGIN`,`TRANSLATION`);c===-1&&s.add(`NO_TRANSLATION_EXISTS`);let l=ot(i,c+1,`END`,`TRANSLATION`);if(l===-1&&s.add(`NO_TRANSLATION_EXISTS`),c===-1&&l===-1)return s;if(!o.isFound)return s.add(`NO_PLUSCAL_EXISTS`),s;let u=mt(i,o.line,o.column);if(u!==void 0)return it(t,u),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let d={ast:void 0};try{let e=j(i,o.line,o.column,n.length,0),r=Ee(t,e,o.isFair);d.ast=r.ast,et(r.ast,r.omitPC,r.hasDefaultInitialization,t.log)}catch(n){if(!(n instanceof e.o))throw n;it(t,n)}c===-1&&ht(-1,i.length);let f=tt.exec(i[c]);if(f===null)return s.add(`NO_PCAL_CHECKSUMS_EXIST`),s;let p=f.groups?.pcal,m=o.isFair&&r!==`1.7.4`?`fair`:d.ast===void 0?void 0:oe(d.ast,t.params.inputVersionNumber,r);p!==void 0&&(m===void 0||p!==nt(m))&&s.add(`PCAL_DIVERGENCE_EXISTS`);let h=f.groups?.tla;if(h!==void 0){if(l===-1)throw new e.s(`java.lang.IllegalArgumentException: fromIndex(${c+1}) > toIndex(-1)`);let t=n.slice(c+1,l).join(``);h!==nt(t)&&s.add(`TLA_DIVERGENCE_EXISTS`)}return s.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):s},_t=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],vt={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},H=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),yt=e=>_t.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...H(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...H(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:vt,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),bt=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},xt=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,St=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,Ct=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},wt=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Tt=(e,t)=>(e&2147483647)%t,Et=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Tt(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Dt=(e,t,n=t)=>e.buckets[Tt(Ct(n),e.buckets.length)].find(e=>e.key===t)?.value,Ot=(e,t,n,r=t)=>{let i=Ct(r),a=e.buckets[Tt(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Et(e),e.buckets[Tt(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},kt=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),At=`\0module `,U=()=>({table:wt(),symbols:[]}),jt=e=>e.kind===`Module`?At+e.name:e.name,Mt=(e,t)=>{Ot(e.table,jt(t),t,t.name),e.symbols.push(t)},Nt=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Pt=(e,t)=>Dt(e.table,t),Ft=(e,t)=>Dt(e.table,At+t,t),It=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Lt=(e,t)=>kt(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Rt=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),zt=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Bt=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Vt=e=>{switch(e.kind){case`Identifier`:return Bt(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Bt(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Ht=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Ut=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Wt=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Gt=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Kt=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,qt=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Jt=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Yt=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Pt(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Jt(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Ut(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Jt(u.nameLocation,l(u.index)),u.name=p,Gt(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=Nt(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Ut(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
21
- operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Wt(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Wt(f.op,a.length);if(o){let e=Wt(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Wt(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=qt(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Wt(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Wt(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Wt(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
22
- from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Nt(f.op):u.previousMode===`FindingOpName`&&Kt(f)?Nt(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Nt(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=zt.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Xt=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Zt=(e,t)=>`${e}:${t}`,Qt=(e,n)=>{let r=t.nt(n).filter(e=>e.kind!==`End`).map(t.tt),i=[0,0];for(let e=0;e<n.length;e++)n[e]===`
23
- `&&i.push(e+1);return{name:e,source:n,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[Zt(e.line,e.column),t]))}},W=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,$t=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},en=(e,t)=>e.tokenIndexes.get(Zt(t.line,t.column))??Math.min($t(e,t,!1),e.tokens.length-1),tn=(e,t)=>Math.max($t(e,t,!0)-1,0),nn=(e,t)=>{let n=e.tokens[t].text,r=Xt.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(W(e,a,n))i++;else if(W(e,a,r)&&(i--,i===0))return a;return t},rn=(e,t)=>({start:en(e,t.start),end:tn(e,t.end)}),G=(e,t)=>{let n=t.location.range;if(n)return rn(e,n);let r=en(e,t.location);return{start:r,end:nn(e,r)}},an=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&W(e,r,`)`)&&nn(e,n)===r?an(e,{start:n,end:r}):t},on=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&nn(e,n)===r&&(W(e,n-1,`(`)||W(e,n-1,`,`))?on(e,{start:n,end:r}):t},K=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),q=(e,t)=>K(e,{start:t,end:t}),sn=(e,n,r)=>{let i=0,a=e.lineOffsets[n];for(;a<e.source.length;){if(i=e.source[a]===` `?t.et(i):i+1,i>=r)return a;a++}return a},cn=(e,t)=>{let n=e.tokens[t],r=sn(e,n.line,n.column);return e.source.slice(r,sn(e,n.line,n.endColumn)+1)},ln=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},un=n=>{let r=Qt(``,n),i=r.tokens.reduce((e,t,n)=>{if(!ln(r,n))return e;let i=sn(r,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},n);if(i!==n&&t.j(n)!==void 0)throw new e.D(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return i},dn=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:sn(e,n.line,n.endColumn)+1,a=e.source.slice(i,sn(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
24
- `,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},fn=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},pn=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(W(e,i,r))return i;return-1},mn=new Map(t.M.flatMap(([e,...t])=>t.map(t=>[t,e]))),hn=e=>e.split(`!`).map(e=>mn.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),gn={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},_n=e=>/^[A-Za-z0-9_]+$/.test(e),vn=e=>e!==`!!`&&e.includes(`!`),yn=e=>e.contexts[e.contexts.length-1],bn=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Pt(e.contexts[n],t);if(r)return r}},xn=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,Sn=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,Cn=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||wn(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&wn(n.module)}return!1},wn=e=>Lt(e,2).length===0&&Lt(e,3).length===0,Tn=e=>[...e.kind===`Let`?e.instances??[]:[],...t.G(e).flatMap(Tn)],En=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:En(e)):Tn(e),Dn=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},On=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Tn(e.definition.body):e.kind===`Theorem`&&s?En(e.theorem.statement):e.kind===`Assumption`&&s?Tn(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Dn(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},kn=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),An=e=>{let t=e.kind===`Apply`?Vt(e):void 0;return kn.has(e.kind)||t!==void 0&&Ht(t)},jn=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Mn=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Nn=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Pn=(e,t)=>Nn.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Fn=(n,r,i={})=>{let a=[],o=(e,t)=>bt(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>bt(a,{location:e,text:t,isWarning:!0}),c={value:i.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},d=(e,t)=>{let n=bn(e,t.name);if(n===t)return;if(n===void 0){Mt(yn(e),t);return}let r=t.kind===`FormalParam`||xn(n)!==xn(t)||Nt(n)!==Nt(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&i.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${xt(n.location)}.`):Cn(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${xt(n.location)}.`)};i.version!==`1.7.4`&&yt(l);let f=yt(l);l();let p=new Map(f.map(e=>[e.name,e])),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Map,g=(n,r)=>{let a=n===i.rootFileName&&i.rootFilePath||`${n}.tla`,o=t=>new e.T(`Could not parse module ${n} from file ${a}`,n,t),s=i.version===`1.7.4`?t.$(r):void 0;if(s!==void 0)throw o(s);try{return t.k(un(r))}catch(n){throw n instanceof e.D?o(t.j(r)??`***Parse Error***\n${n.message}`):n}},_=(t,n,r)=>{let a=h.get(t);if(a)return a;if(n===void 0)throw new e.x(t,r,i.version!==`1.7.4`);i.onParse?.(t);let o=g(t,n);if(o.name!==t)throw new e.T(`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Qt(o.name,n),module:o};return h.set(t,s),s},v=[],y=/* @__PURE__ */ new Set,b=[],x=(t,n,i)=>{let a=b.indexOf(t);if(a!==-1)throw new e.T(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...b.slice(a),t].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(y.has(t))return;y.add(t),b.push(t);let o=D(t,_(t,n,i).module);[...o.extendees,...o.instancees].forEach(e=>x(e,r(e),t)),b.pop(),v.push(t)},S=/* @__PURE__ */ new Set,C=(e,t)=>S.has(`${e} ${t}`),w=(e,t,n)=>{let r=h.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!C(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=C(e,r)?w(r,t,n):void 0;if(i)return i}},T=e=>{_(e,n);let t=()=>w(e,`extendees`,/* @__PURE__ */ new Set)??w(e,`instancees`,/* @__PURE__ */ new Set);for(let e=t();e!==void 0;e=t())h.has(e.name)||_(e.name,r(e.name),e.namingModule),S.add(`${e.importer} ${e.name}`)},E=i.rootFileName??g(``,n).name,D=(e,t)=>{let n=On(t);return e!==E||i.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...i.rootExtendees),i.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};T(E),x(E,n);let ee=(t,n,r,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},f=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>K(n,G(n,e)),E=e=>e.range?rn(n,e.range):{start:en(n,e),end:en(n,e)},D={kind:`Module`,id:l(),name:t.name,location:K(n,E(t.location)),extendees:[],context:yn(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(D);let O=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Ft(a.contexts[t],e);if(n?.kind===`Module`)return n}return m.get(e)},te=t=>{let n=O(t);if(n===void 0)throw new e.D(`Could not find module ${t}`);return n},k=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},ne=(e,t,n,r)=>{let i={...H(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&d(a,i),i},re=e=>({...H(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ie=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},ae=(e,t,n,r={},i=l())=>({...H(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),A=()=>({...ae(oe(`$Nop`),[],vt,{},u.id),isNull:!0}),oe=t=>{let n=p.get(t);if(!n)throw new e.k(`SANY has no builtin operator ${t}`);return n},j=(e,t,n,r={})=>ae(oe(e),t,n,r),M=(e,t)=>({...H(l()),kind:`String`,value:e,location:t}),se=(e,t)=>({...H(l()),kind:`OpArg`,op:e,location:t}),ce=(t,n)=>{let r=bn(a,hn(t));if(r===void 0||r.kind===`Module`)throw new e.D(`Unknown operator: \`${t}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},le=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&Nt(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},ue=Yt({version:i.version,resolveSymbol:e=>bn(a,e),resolveSynonym:hn,generateExpression:e=>I(e),generateArgument:(e,t,n,r)=>ye(e,t,n,r),createOpAppl:(e,t,n)=>{let r=ae(e,t,n);return le(e,t,n),r},createOpArg:se,createFormalParam:(e,t,n)=>ne(e,t,n,!1),createLambda:(e,t,r)=>re({name:`LAMBDA`,params:e,body:t,location:r,preComments:dn(n,en(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>B(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:oe,addError:(e,t)=>(o(e,t),A()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),de=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=pn(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=nn(n,a);return r.value=t+1,{...e,location:K(n,{start:a,end:t})}}r.value=a+1;let o=q(n,a);if(e.args===void 0||!W(n,a+1,`(`))return{...e,location:o};let s=nn(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:K(n,{start:a+1,end:s})}})},N=(t,r,i,a)=>{let o=Vt(t);if(o===void 0)throw new e.D(`Expected a name, found ${t.kind}`);return ue(de(o,G(n,t)),r,i,a,T(t))},fe=t=>{let n=N(t,0,!1,!1);if(n.kind!==`OpAppl`)throw new e.D(`Expected an expression`);return n},pe=e=>{if(e.kind!==`OpAppl`)return;let t=f.find(t=>t.name===e.operator.name);t&&(t.node.operator=oe(`$RecursiveFcnSpec`))},me=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),he=(e,t)=>je(e,t,me(e).map(e=>I(e[0].set))),ge=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=I(t);return n?.params.pop(),r},P=e=>{let t=G(n,e),r=fn(n,t.start,t.end,e.params);return k(U(),()=>{let i=e.params.map((e,t)=>ne(e,0,q(n,r[t]),!0)),a=ge(i,e.body);return re({name:`LAMBDA`,params:i,body:a,location:K(n,t),preComments:dn(n,t.start)})})},_e=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[en(n,e.location)].text,ve=(t,n)=>{let r=T(t);if(t.kind===`Lambda`)return t.location.range===void 0?se(ce(_e(t),r),r):se(P(t),r);if(!An(t))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),A();if(t.kind===`OperatorReference`)return se(ce(t.operator,r),r);let i=N(t,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new e.D(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ye=(t,r,i,s)=>{let c=t.kind===`OpDef`&&(t.defKind===`UserDefined`||t.defKind===`ModuleInstance`)?t.params?.[r]?.arity??0:0;if(c===0)return I(i);let l=G(n,i),u=K(n,l),d=`${r+1} (counting from 1)`,f=on(n,l);if(f!==l||!An(i))return o(K(n,f),`An expression appears as argument number ${d} to operator '${t.name}', in a position an operator is required.`),A();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let t=N(i,c,!1,!1);if(t.kind===`OpArg`||t.kind===`OpAppl`)return t;throw new e.D(`Expected an operator argument at ${xt(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let e=P(i),n=Nt(e);return n===c?se(e,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${t.name}', \nbut an operator of arity ${c} is required.`),A())}let p=_e(i),m=bn(a,hn(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),A();let h=Nt(m);return h===c?se(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${xt(t.location)}', \nbut an operator of arity ${c} was expected.`),A())},be=e=>{let t=T(e);if(e.isBulleted)return j(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(I),t);let r=G(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=an(n,G(n,t)),c=a===o.length-1?r.end:s.end;return j(i,[e,I(t)],K(n,{start:r.start,end:c}))},I(a))},xe=e=>{let t=G(n,e),r=e.arms.map((r,i)=>{let a=an(n,G(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=an(n,G(n,r.body)),c=[I(r.condition),I(r.body)];return j(`$Pair`,c,K(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=an(n,G(n,i)),a=Se(e.start,`OTHER`);r.push(j(`$Pair`,[void 0,I(i)],K(n,{start:a,end:t.end})))}return j(`$Case`,r,K(n,t))},Se=(e,t)=>{for(let r=e;r>=0;r--)if(W(n,r,t))return r;return e},Ce=e=>{let t=G(n,e),r=K(n,t),i=[I(e.function)],a=j(`$Except`,i,r),o=G(n,e.function),s={value:pn(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=pn(n,s.value,t.end,`!`),o=an(n,G(n,e.value)),c=K(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=we(l.value,e.name);return l.value=t+1,M(e.name,q(n,t))}let r=pn(n,l.value,t.end,`[`),i=nn(n,r);return l.value=i+1,e.args.length===1?I(e.args[0]):j(`$Tuple`,e.args.map(I),K(n,{start:r,end:i}))}),d=j(`$Seq`,u,c),f=j(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(I(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},we=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},Te=(e,t)=>{let r=G(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=we(i.value,e.name),s=an(n,G(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(q(n,a),`Non-unique fields in constructor.`),j(`$Pair`,[M(e.name,q(n,a)),I(e.value)],K(n,{start:a,end:s.end}))}),s=j(e,a,K(n,r));return D.records.push(s),s},Ee=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),F=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=W(n,r+1,`(`)?nn(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Ee(r),range:{module:n.name,start:Ee(r),end:Ee(e)}}}),!W(n,e+1,`,`))break;r=e+2}return t},De=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=G(n,e).start,i=an(n,G(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);W(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:F(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Oe=e=>{let t=U();return k(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];De(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?ze(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),c.curLevel=Math.max(c.curLevel-1,0);let i=I(e.body);return{...H(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},ke=e=>{let t=G(n,e),r=K(n,t);return k(U(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=fn(n,t.start,t.end,a),s=a.map((e,r)=>ne(e,0,q(n,i.kind===`Name`?t.start:o[r]),!0)),c=ge(s,e.body);return j(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=I(e.set),s=G(n,e.set),c=fn(n,t.start,s.start,a),l=a.map((e,t)=>ne(e,0,q(n,c[t]),!0)),u=ge(l,e.body);return j(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Ae=e=>{if(_n(e.operator)||vn(e.operator)||e.args.length>2||bn(a,hn(e.operator))!==void 0)return;let t=G(n,e);if(n.tokens[t.start].text===e.operator&&W(n,t.start+1,`(`))return;let r=an(n,G(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=cn(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},I=e=>{let t=T(e);switch(e.kind){case`Number`:return{...H(l()),kind:`Numeral`,value:In(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...H(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return M(e.value,t);case`Identifier`:{let t=fe(e);return pe(t),t}case`Apply`:{let r=Ae(e);if(r!==void 0)return o(q(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...A(),isAbsent:!0};let i=fe(e);return(vn(e.operator)||_n(e.operator))&&pe(i),i}case`Bracket`:return o(q(n,G(n,e).start),"Unsupported expression type `['."),{...A(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[G(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Pn(e,r)}'.`),{...A(),isAbsent:!0}}case`And`:case`Or`:return be(e);case`Prime`:return j(`'`,[I(e.expression)],t);case`Unchanged`:return j(`UNCHANGED`,[I(e.expression)],t);case`Enabled`:return j(`ENABLED`,[I(e.expression)],t);case`Always`:return j(`[]`,[I(e.expression)],t);case`Eventually`:return j(`<>`,[I(e.expression)],t);case`If`:return j(`$IfThenElse`,[I(e.condition),I(e.consequent),I(e.alternative)],t);case`Case`:return xe(e);case`Let`:return Oe(e);case`Forall`:case`Exists`:{let r=G(n,e);return k(U(),()=>{let n=he(e.bounds,r.start),i=ge(n.bounded.flat(),e.body);return j(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=G(n,e),i=G(n,e.body),a=fn(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return k(U(),()=>{let r=e.names.map((e,t)=>ne(e,0,q(n,a[t]),!0)),i=ge(r,e.body);return j(o,[i],t,{unbounded:r})})}case`Choose`:return ke(e);case`SetEnumeration`:return j(`$SetEnumerate`,e.elements.map(I),t);case`Tuple`:return j(`$Tuple`,e.elements.map(I),t);case`SetFilter`:{let r=I(e.bound.set),i=G(n,e);return k(U(),()=>{let n=je([e.bound],i.start,[r]),a=ge(n.bounded.flat(),e.predicate);return j(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=G(n,e.expression);return k(U(),()=>{let n=he(e.bounds,r.end+1),i=ge(n.bounded.flat(),e.expression);return j(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=G(n,e);return k(U(),()=>{let n=he(e.bounds,r.start),i=ge(n.bounded.flat(),e.body);return j(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return j(`$SetOfFcns`,[I(e.domain),I(e.range)],t);case`Record`:return Te(`$RcdConstructor`,e);case`RecordSet`:return Te(`$SetOfRcds`,e);case`Except`:return Ce(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),A()):{...H(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=I(e.function);if(St(n))return n;pe(n);let r=e.args.length===1?I(e.args[0]):j(`$Tuple`,e.args.map(I),t);return j(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=I(e.record),i=G(n,e);return j(`$RcdSelect`,[r,M(e.field,q(n,i.end))],t)}case`Product`:return j(`$CartesianProd`,e.factors.map(I),t);case`BoxAction`:case`AngleAction`:return j(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[I(e.action),I(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return j(e.kind===`WeakFairness`?`$WF`:`$SF`,[I(e.subscript),I(e.action)],t);case`Label`:return L(e);case`Subexpression`:return fe(e)}},je=(e,t,r)=>{let i=me(e),a={value:t};return{bounded:i.map(e=>{let t=G(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=fn(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>ne(e,0,q(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},L=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),A();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),A();if(h.length>0&&g.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),A();y();let i=I(e.body),s=b(),c=fn(n,G(n,e).start,G(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=bn(a,t);if(i?.kind===`FormalParam`)return i;let s=q(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),ne(t,0,s,!1)}),d={...H(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},R=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?en(n,e.location):we(i.value,e.name),a=st(t,e.arity);return i.value=a.end+1,ne(hn(e.name),e.arity,K(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!W(n,t.start,`LOCAL`)&&W(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=K(n,r),s=hn(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=k(U(),()=>{let t=R(e,l,!0),n=bn(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return y(),{params:t,body:I(e.body),existing:n}}),f=b(),p=u.existing,m=u.params,h=dn(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=re({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});d(a,g),ie(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=K(n,r),s=U(),l=e.isLocal?r.start+1:r.start,u=k(s,()=>he(e.bounds,l+1)),p=bn(a,e.name),m=k(s,()=>ne(e.name,0,i,p===void 0)),h=j(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===c.curLevel;_?p.arity!==0&&o(i,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=dn(n,r.start),x=p===void 0?re({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Pe(p,h,i,v):p===void 0&&x!==void 0&&(d(a,x),ie(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),f.unshift({name:e.name,node:h}),y();let S=()=>ge(u.bounded.flat(),e.body),C=x===void 0?S():k(s,S),w=b();x!==void 0&&(x.labels=w),f.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ct(e);l();let r=Array.from({length:e.arity},()=>ne(``,0,void 0,!1)),i=re({name:hn(e.name),params:r,location:K(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});d(a,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{c.unresolvedCount[c.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},z=(e,t,r)=>{l();let s=kt(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=bn(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?ae(t,[],r):se(t,r),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?Nt(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Me(e),f={value:pn(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let i=pn(n,f.value,d.end,e.name);i!==-1&&(f.value=G(n,e.expression).end+1);let a=Pt(t,hn(e.name));if(a?.kind!==`OpDecl`){o(i===-1?r:q(n,i),`Identifier '${i===-1?e.name:cn(n,i)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=a.arity===0?I(e.expression):ve(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&i.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(r,`Substitution missing for symbol ${e.name} declared at ${xt(e.location)} \nand instantiated in module ${D.name}.`)),c},B=(e,t,n,r,i,a=D)=>(St(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
25
- in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...H(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),ze=(e,t,r)=>{let o=Me(e),s=K(n,o),c=dn(n,o.start),u=e.name??``,f=U(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(f);let m=R(e,{start:p,end:o.end},e.params.length>0),h=te(e.module),g=h.context,_=z(e,g,s);e.params.length>0&&a.contexts.pop(),kt(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?re({name:i,params:r,body:_.length>0&&n.body?B(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):re({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});d(a,o),n.defKind===`UserDefined`&&ie(o),(t??D.definitions).push(o)}),kt(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?B(`APSubstIn`,_,n.body,h,s):n.body,i={...H(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};d(a,i),(t??D.definitions).push(i)});let v={...H(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(r??D.topLevel).push(v);let y=re({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});d(a,y),i.version!==`1.7.4`&&t?.push(y)},Be=(e,t=!0,r)=>{let i=Me(e),o=r??K(n,i),s=dn(n,i.start),c=te(e.module),u=c.context,f=z(e,u,o),p=e.isLocal,m=wn(c);kt(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=re({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return d(a,r),r},n=()=>(d(a,e),e),r=e.module===void 0||wn(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&B(`SubstIn`,f,e.body,c,o));D.definitions.push(i),ie(i)}),kt(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...H(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return d(a,r),r},r=m?p?n(e.module,e.body):(d(a,e),e):wn(e.module)?p?n(D,e.body):e:n(D,B(`APSubstIn`,f,e.body,c,o));t&&D.definitions.push(r)});let h={...H(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:f,location:o};return t&&D.topLevel.push(h),h},Ve=e=>{let t=O(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(q(n,en(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},He=t=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return Ve(t);let n=Vt(t);if(n===void 0||!Ht(n))return[I(t)];let r=N(t,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new e.D(`Expected a fact`);return[r]}),Ue=e=>W(n,e.start,`(`)&&nn(n,e.start)===e.end,We=e=>an(n,G(n,e)),Ge=(e,t)=>We(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ke=(e,t)=>Ue(t)?`N_ParenExpr`:e.kind===`String`?cn(n,t.start):e.kind===`Apply`?Ge(e,t):jn.get(e.kind),qe=(e,t)=>{if(e.kind===`String`&&!Ue(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ke(e,t);return n===void 0||Mn.has(n)?void 0:!0},Je=(e,t)=>{let r=(e,t=We(e))=>({last:t,lastKind:Ke(e,t)});if(Ue(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:qe(e.expression,We(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=We(t),i=r.end+1;return{hasChildlessFirstChild:qe(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=Ge(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=We(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:qe(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Ye=e=>{let t=an(n,G(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ue(t))return!1;let r=Je(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=K(n,r.last);return r.hasChildlessFirstChild&&o(K(n,t),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?o(i,"Selector `!(...)' should not have argument(s)."):(o(i,`Unexpected token found.`),o(i,`Need name or step number here, not \`${r.lastKind}'.`)),o(K(n,t),`DEF clause entry should describe a defined operator.`),!0},Xe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ve(e);if(Ye(e))return[];let t=N(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(o(T(e),`DEF clause entry should describe a defined operator.`),[])}),Ze=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},Qe=e=>{let t=K(n,E(e.location));Ze(e,t);let r=He(e.facts),i=Xe(e.defs);return r.length+i.length===0&&o(t,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>o(e.location,`The only expression allowed as a fact in a HIDE is
26
- the name of a theorem, assumption, or step.`)),{...H(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},$e=e=>{let t=E(e.location),r=e.set&&I(e.set),i=we(t.start,e.name),o=gn[e.level],s={...H(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:hn(e.name),arity:e.arity,declKind:o.declKind,location:K(n,st(i,e.arity)),module:D};return d(a,s),{...H(l()),kind:`NewSymb`,declaration:s,set:r,location:K(n,t)}},et=(e,t,r)=>{let i=E(e.location),s=ln(n,i.start-1),c=G(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=K(n,{start:s?i.start-1:i.start,end:i.start});s!==ln(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(U()),s&&a.contexts.some(e=>v.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||v.add(yn(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};x.depth=t,x.isDeclared[t]=!1,t===1&&(x.goal=r&&p,x.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?et(e,t+1):r?$e(e):I(e);return x.depth=t,r&&(x.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&x.goalClause++,i}),h=I(e.conclusion);t>1&&a.contexts.pop(),x.depth=t-1,t===1&&(x.goal=void 0);let g={...H(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:K(n,{start:s?i.start-1:i.start,end:i.end})};return S.set(g,p),g},V=(e,t,n,r,i,a=!0)=>({...H(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),tt=e=>{let t=K(n,E(e.location));e.kind===`By`&&Ze(e,t);let r=e.kind===`By`?He(e.facts):[],i=e.kind===`By`?Xe(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...H(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},nt=(e,t)=>{let r=e.body,i=K(n,t);switch(r.kind){case`Have`:return{node:j(`$Have`,[I(r.expression)],i),isPick:!1};case`Case`:return{node:j(`$Pfcase`,[I(r.expression)],i),isPick:!1};case`Witness`:return{node:j(`$Witness`,r.expressions.map(I),i),isPick:!1};case`Qed`:return{node:j(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(U());let s=e=>r.kind===`Pick`?[ge(e,r.body)]:[];if(r.bounds.length>0){let n=he(r.bounds,t.start),a=s(n.bounded.flat());return{node:j(o,a,i,n),isPick:e}}let c=fn(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>ne(e,0,q(n,c[t]),!0)),u=s(l);return{node:j(o,u,i,{unbounded:l}),isPick:e}}}},rt=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=an(n,G(n,e.args[0])),r=G(n,e).start;return t.start===r&&!W(n,t.end+1,`(`)},it=t=>{if(t.kind!==`Steps`)return tt(t);let r=U();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(t,r,a)=>{if(t.kind===`Define`){let r=t.definitions.map(t=>{let n=[];t.kind===`Instance`?ze(t,n,i):t.kind===`Function`?Fe(t,n):Ne(t,n);let r=n[t.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new e.D(`A DEFINE step defines no operator`);return r});return{...H(l()),kind:`DefStep`,defs:r,location:K(n,a)}}if(t.kind===`Use`||t.kind===`Hide`)return{...Qe(t),location:K(n,r)};if(t.kind===`Instance`)return Be(t,!1,K(n,a))},u=t.steps.map(t=>{let r=E(t.location),i=rn(n,t.head),u={start:i.start+1,end:i.end},f=t.body;t.name!==void 0&&y();let p=t.name===void 0?void 0:l();f.kind!==`Assert`&&(s.previousRight=void 0);let m=c(f,r,u);if(m!==void 0)return t.name!==void 0&&d(a,re({defKind:`NumberedProofStep`,name:t.name,location:K(n,r),labels:b(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=U(),v=f.kind===`Assert`?{node:(e=>{if(e.kind===`AssumeProve`){let n=k(_,()=>et(e,1,t.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let t=I(e);return j(`$Suffices`,[t],K(n,u))}let r=s.previousRight,i=r!==void 0&&e.kind===`Apply`&&rt(e)&&e.args[0].kind===`ExceptAt`,a=i?I(e.args[1]):void 0,o=i?ae(ce(e.operator,T(e)),[j(`$Nop`,[r],T(e.args[0])),a],T(e)):I(e),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=rt(e)?c:void 0,o})(f.statement),isPick:!1}:nt(t,u);if(v===void 0)throw new e.D(`Unexpected proof step ${f.kind}`);let x=v.isPick?a.contexts.pop():void 0,S=t.name===void 0||p===void 0?void 0:V(p,t.name,v.node,q(n,en(n,t.location)),b());S&&d(a,S);let C=h&&!g;C&&a.contexts.push(_);let D=t.proof&&it(t.proof);return C&&a.contexts.pop(),w(v.node),h&&g&&(o.push(_),a.contexts.push(_)),x?.symbols.forEach(e=>d(a,e)),{...H(l()),kind:`Theorem`,definition:S,body:v.node,proof:D,isSuffices:g,location:K(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>Mt(r,e))}),a.contexts.pop(),{...H(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:t.level,location:K(n,E(t.location))}},at=e=>{let t=K(n,E(e.location)),r=e.statement,i=U();e.name!==void 0&&y();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?et(r,1,e.name===void 0?void 0:{isSuffices:!1}):I(r),c=e.name===void 0||o===void 0?void 0:V(o,e.name,s,t,b());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),d(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&it(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),w(s);let f={...H(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(f)},ot=e=>{let t=E(e.location),r=K(n,t);e.name!==void 0&&y();let i=I(e.expression),o=e.name===void 0?void 0:V(l(),e.name,i,r,b(),!1);o&&(d(a,o),D.definitions.push(o));let s={...H(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},st=(e,t)=>t===0?{start:e,end:e}:W(n,e,`_`)?{start:e,end:W(n,e+2,`_`)?e+2:e+1}:W(n,e+1,`(`)?{start:e,end:nn(n,e+1)}:{start:e,end:W(n,e+1,`_`)?e+1:e},ct=e=>st(E(e.location).start,e.arity),lt=(e,t)=>{let r=ct(e);e.name===`@`&&t===3&&o(K(n,r),`Attempted to declare '@' as a variable.`);let i={...H(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:hn(e.name),arity:e.arity,declKind:t,location:K(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),d(a,i),i};t.extends.forEach(e=>{let t=te(e);D.extendees.push(t);let n=yn(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Ft(n,e.name):Pt(n,e.name);t===void 0?Mt(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${Sn(e)} of '${e.name}' conflicts with \nits ${Sn(t)} at ${xt(t.location)}.`):t!==e&&!Cn(t,e)&&s(e.location,`Warning: the ${Sn(t)} of '${e.name}' conflicts with \nits ${Sn(t)} at ${xt(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let ut=(e,t)=>{c.unresolvedSum!==0&&o(K(n,E(e)),`${t} may not appear within a recursive definition section.`)};return t.units.forEach(e=>{switch(e.kind){case`Variables`:ut(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>lt(e,3));break;case`Constants`:ut(e.location,`A declaration`),e.declarations.forEach(e=>lt(e,2));break;case`Recursive`:Le(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Fe(e.definition,void 0):Ne(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Be(e.instance):ze(e.instance,void 0,void 0);break;case`Assumption`:ut(e.assumption.location,`An ASSUME`),ot(e.assumption);break;case`Theorem`:ut(e.theorem.location,`A THEOREM`),at(e.theorem);break;case`Use`:ut(e.use.location,`A USE or HIDE`),D.topLevel.push(Qe(e.use));break;case`Module`:{ut(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,U()]},r=ee(e.module,n,D,t),i=O(r.name);i===void 0?Mt(yn(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${xt(i.location)}.`);break}}}),Re(),D},O=v.map(e=>{i.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=_(e,void 0),n=U();f.toReversed().forEach(e=>Mt(n,e));let r=ee(t.module,t.file,void 0,{contexts:[n]});return m.set(e,r),i.onModule?.(r,a),r});return{root:O[O.length-1],modules:O,messages:a}},In=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},J=(e,t,n,r)=>bt(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Ln=(e,t,n)=>`${e.id}:${t}:${n.id}`,Rn=(e,t,n,r)=>{e.set(Ln(t,n,r),{op:t,index:n,param:r})},zn=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Bn=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Vn=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Bn(e,r,t)})},Hn=(e,t)=>`${e.id}:${t}`,Un=(e,t,n,r)=>{let i=Hn(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Wn=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Un(e,t.param,t.position,t.level)})},Gn=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Kn=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Vn(e.levelConstraints,t.levelConstraints),Wn(e.argLevelConstraints,t.argLevelConstraints),zn(e.argLevelParams,t.argLevelParams)},qn=(e,t)=>t.includes(e.op)||t.includes(e.param),Jn=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Yn=e=>e.kind!==`Module`,Xn=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Zn=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Qn=(e,t)=>e.kind===`OpDef`?e.weights[Zn(e,t)]??0:0,$n=(e,t)=>e.maxLevels[Zn(e,t)]??3,er=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,tr=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Zn(e,t)]??!0:e.isLeibnizArg[t]??!0,nr=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,rr=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],ir=(e,t)=>t.find(t=>t.op===e)?.expr,ar=(e,t,n)=>{let r=ir(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},or=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=ir(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Jn(i.op))return;let a=i.op;ar(e.param,t,!1).forEach(t=>Rn(n,a,e.index,t))}),n},sr=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;ar(r,t,!1).forEach(e=>Bn(a,e,i))}),e.argLevelParams.forEach(e=>{let n=ir(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=$n(n.op,e.index);ar(e.param,t,!1).forEach(e=>Bn(a,e,o))}),a},cr=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=ir(e.param,t);n===void 0?Un(i,e.param,e.position,e.level):n.kind===`OpArg`&&Jn(n.op)&&Un(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=ir(e.param,t);if(a===void 0)return;let o=ir(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Jn(s)&&(X(a,n,r),Un(i,s,e.index,a.level))}),i},lr=(e,t)=>Lt(e,3).length>0||(vr(e,t),It(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ur=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Hn(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Ln(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Hn(t,n))}),zn(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},dr=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>$n(t,o)&&(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Xn(a.op)))return;let s=a.op;X(s,r,i);let c=Nt(s);for(let l=0;l<c;l++){let c=er(t,o,l);$n(s,l)>=c||(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!nr(t,o,l,u)||n.level<=$n(s,u)||(X(a,r,i)&&X(n,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${xt(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},fr=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Vn(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Vn(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Vn(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=$n(t,r);n?.levelParams.forEach(t=>Bn(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Xn(n.op))return;let o=n.op;X(o,r,i);let s=Nt(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!nr(t,a,r,i))continue;let s=$n(o,i);n?.levelParams.forEach(t=>Bn(e.levelConstraints,t,s)),!o.isLeibniz&&!tr(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Xn(n.op)&&(X(n.op,r,i),Bn(e.levelConstraints,t.param,$n(n.op,t.index)))}),Wn(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Wn(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Wn(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Jn(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Un(e.argLevelConstraints,i,n,er(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&nr(t,r,a,o)&&Un(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Un(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&zn(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>zn(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Rn(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Jn(a.op)&&Rn(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Jn(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&nr(t,r,a,o)&&n.levelParams.forEach(t=>Rn(e.argLevelParams,i,o,t))})})},pr=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),mr=(e,t)=>{let n=(n,r)=>{J(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=pr.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},hr=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Xn(i)){let r=X(i,t,n);dr(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Qn(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Qn(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),tr(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(rr(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),fr(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Vn(e.levelConstraints,t.levelConstraints),Un(e.argLevelConstraints,i,n,t.level),Wn(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Rn(e.argLevelParams,i,n,t)),zn(e.argLevelParams,t.argLevelParams)});return mr(e,n),e.levelCorrect},gr=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),ur(e,i,r),e.levelCorrect},_r=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),ur(e,e.params,e.body)),e.levelCorrect),vr=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),gr(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||J(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),gr(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(vr(e,t)));let a=It(e);return a.forEach(e=>i(gr(e,1,t))),Rt(e).forEach(e=>i(_r(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),lr(e,t)||Lt(e,2).forEach(t=>Bn(e.levelConstraints,t,0)),a.forEach(t=>{Vn(e.levelConstraints,t.levelConstraints),Wn(e.argLevelConstraints,t.argLevelConstraints),zn(e.argLevelParams,t.argLevelParams,e=>!qn(e,t.params??[]))}),e.topLevel.forEach(t=>{Vn(e.levelConstraints,t.levelConstraints),Wn(e.argLevelConstraints,t.argLevelConstraints),zn(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},yr=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Yn(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Kn(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),br=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&J(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&J(t,e.body.location,`Non-constant CASE for temporal goal.`),br(e.proof,t)):n===`$Qed`&&br(e.proof,t)})},xr=(e,t,n,r,i,a)=>{e.levelConstraints=sr(t,n,r,i,a),e.argLevelConstraints=cr(t,n,i,a),e.argLevelParams=or(t.argLevelParams,n)},Sr=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;vr(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=lr(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||J(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Hn(i.op,t))?.level;a===void 0||$n(o,t)>=a||(s&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=$n(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&J(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Vn(e.levelConstraints,sr(r,e.substs,i,t,n),a),e.substs.forEach(t=>Vn(e.levelConstraints,t.expr.levelConstraints,a)),Wn(e.argLevelConstraints,cr(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Wn(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),zn(e.argLevelParams,or(r.argLevelParams,e.substs),t=>!qn(t,e.params)),e.substs.forEach(t=>zn(e.argLevelParams,t.expr.argLevelParams,t=>!qn(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Yn(e))return vr(e,n);switch(e.kind){case`OpAppl`:return hr(e,t,n);case`OpDef`:return gr(e,t,n);case`ThmOrAssumpDef`:return _r(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Gn(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Vn(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Vn(e.levelConstraints,t.levelConstraints)),Wn(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Wn(e.argLevelConstraints,t.argLevelConstraints)),zn(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];zn(e.argLevelParams,t.argLevelParams,e=>!qn(e,n))}),e.instances.forEach(t=>zn(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Gn(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Kn(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,ar(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,ar(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=lr(e.instantiatedModule,n);return xr(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return Sr(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Gn(e,e.body),e.level!==0&&J(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=yr(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&J(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&br(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return yr(e,e.facts,t,n);case`NonLeafProof`:return yr(e,[...e.steps,...e.instances],t,n);case`DefStep`:return yr(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,J(n,e.location,`Level error:
27
- Temporal formula used as set.`)),Gn(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Kn(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Bn(e.levelConstraints,t,2)})),e.levelCorrect}},Cr=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},wr=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Tr=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&wr.get(e)===t.name||n(t))return!0}}return Cr(e).some(n)};return n(e)},Er=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Dr=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Or=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(Er(t).map(e=>Dr(e)?.value));return Er(e).every(e=>n.has(Dr(e)?.value))},kr=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),kr(e,t))}),t),Ar=e=>{let t=[...[...kr(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Or(e,n)).flatMap(Er).some(Tr)?[]:Er(n).flatMap(t=>{let n=Dr(t),r=n&&Pt(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${xt(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},jr=e=>`${xt(e.location)}\n\n${e.text}`,Mr=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${jr(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${jr(e)}\n\n\n`)].join(``)},Nr=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Pr=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},Fr=n=>{try{return t.k(un(n))}catch(t){if(t instanceof e.D)return;throw t}},Ir=(e,n)=>n===`1.7.4`&&t.$(e)!==void 0?void 0:Fr(e)?.name,Lr=(n,r=()=>void 0,o={})=>{let s=(0,i.basename)(n,`.tla`),c=t.T(o.version),l=o.fileName??s,u=(0,a.existsSync)(n)?(0,a.readFileSync)(n,`utf8`):c.get(s),d=[],f=e=>{d.push(e),o.onPrint?.(e)},m=e=>f(`${e}\n`),h=o.version===`1.7.4`,g=h&&o.isXmlExport,_=e=>{o.isXmlExport||m(e)},v=o.describeFile,y=/* @__PURE__ */ new Map([[s,(0,a.existsSync)(n)?`file`:`standard`]]),b={value:!1},x=[],S={isReported:!1,isAborted:!1},C=xe(p(),m),w=/* @__PURE__ */ new Map,T=[],E=()=>T.splice(0).forEach(e=>e.isError?o.onPrintError?.(`${e.text}\n`):m(e.text)),D=e=>{let t=w.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=gt(C,r.slice(n.start.line-1,n.end.line),o.version),a=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.has(`PCAL_DIVERGENCE_EXISTS`),c=a===s?void 0:`The ${a?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(h){let t=a&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&T.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):T.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=a&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||a||s;x.some(e=>e.text===l)||x.push({location:e,text:l,isWarning:u})},ee=(e,t)=>{if(o.isXmlExport||w.has(e))return;let n=Fr(t);if(n===void 0||n.name!==e)return;let r=[...w.values()].filter(t=>Pr(t.module).includes(e));w.set(e,{text:t,module:n}),r.forEach(()=>D(e)),Pr(n).filter(t=>t!==e&&w.has(t)).forEach(D)},O=()=>{if(E(),S.isReported)return;S.isReported=!0;let e=x.filter(e=>e.isWarning);e.length>0&&(_(`Warnings (${e.length}) during syntax parsing of ${l}:\n\n`),e.forEach(e=>_(`${jr(e)}\n\n\n`))),e.length!==x.length&&(m(Mr(x)),b.value=!0,S.isAborted=!0)},te=e=>{let n=c.get(e),i=r(e),a=i===void 0&&n===void 0&&u!==void 0&&!h?t.D(u,e):void 0,o=i??a;return y.set(e,i===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&ee(e,o),o??n},k=(()=>{try{if(u===void 0)throw new e.T(`Cannot find source file for module ${l}`,void 0);return ee(s,u),Fn(u,te,{rootFileName:s,rootFilePath:o.isXmlExport?`${l.replace(/\.tla$/,``)}.tla`:void 0,version:o.version,rootExtendees:o.rootExtendees,onParse:e=>{v&&m(`Parsing file ${v(e,y.get(e)??`file`)}`),e===s&&D(s),E()},onAnalyze:e=>{O(),(v||g)&&!S.isAborted&&m(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(S.isAborted||(t.every(e=>e.isWarning)&&vr(e,{messages:t,isTlc174:h}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(b.value=!0),h)return m(`Semantic errors:\n\n${Mr(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(_(`*** Warnings: ${n.length}\n`),n.forEach(e=>_(`${jr(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(m(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>m(`${jr(e)}\n\n`)))}})}catch(t){if(b.value=!0,t instanceof e.s){m(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),m(t.message),m(Mr(x));return}if(!(t instanceof e.T))throw t;let n={location:t.location,text:t.message,isWarning:!1},r=h&&t.parseError?.includes(` and token "" `);if(t.parseError!==void 0&&!r&&!g&&m(t.parseError),m(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),r){m(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(h){m(`tla2sany.semantic.AbortException`),f(`*** Abort messages: 1\n\n${jr(n)}\n\n\n`);return}m(jr(n)),m(Mr(S.isReported?[n]:[...x,n]))}})();if(k!==void 0&&O(),k!==void 0&&!b.value&&!o.isXmlExport&&!h){let e=k.modules.filter(e=>!Nr.has(e.name));v&&e.forEach(e=>m(`Linting of module ${e.name}`)),e.flatMap(Ar).forEach(e=>m(`${jr(e)}\n\n\n`))}return{text:d.join(``),isFailed:b.value,specification:S.isAborted?void 0:k}},Rr={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},zr=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Br={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},Vr=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Br[e]),Hr=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Ur=e=>{let t=(e.cdata??e.text)?.match(Hr)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Ur(t);if(e)return e}},Wr=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Vr(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Wr(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Gr=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Kr=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},qr={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Jr={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Yr=xt(`--TLA+ BUILTINS--`),Xr=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Zr=(e,t=16)=>e>t*.75?Zr(e,t*2):t,Qr=(e,t)=>(e^e>>>16)&t-1,$r=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},ei=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),ti=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,ni=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=$r(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(ti,``)}).join(`
28
- `)},ri=e=>{let t=$r(e),n=e=>ei(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
29
- `)},ii=(t,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(t,n)=>{let r=[...c,...n].reverse(),i=[t,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
30
- `),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.U(new e.b(i,a),Rr.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...Xr(e.kind,xt(e.location))],()=>g(e)))),Z(Kr(e),[Q(`UID`,e.id)])),p=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Gr(n),...r]:r;return{...e,children:[...i,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
31
- `),n=r.isUncommented?ri(ni(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=t=>{switch(t.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity)]),t,t.location);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Q(`kind`,t.declKind)]),t,t.location);case`OpDef`:{if(t.defKind===`NumberedProofStep`)throw i?u(zr(37),[Jr]):e.U(new e.k(zr(37)),Rr.uncaughtException);if(t.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,t.name),...t.isLocal&&!i?[Z(`local`)]:[]]),t,t.location);let n=t.params??[];if(t.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...t.params?[m(n,t.isLeibnizArg,$.builtInParam)]:[]]),t,t.location);let r=t.body,a=t.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${t.name} has no body`);return p(i?Z(`UserDefinedOpKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Z(`body`,[x(r,$.body)]),...t.params?[m(n,t.isLeibnizArg,$.param)]:[],...t.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Z(`originalOperator`,[f(t.source??t)]),Z(`originallyDefinedInModule`,[f(a)]),Z(`body`,[x(r,$.body)]),m(n,t.isLeibnizArg,$.param),...h(t.preComments),...t.inRecursive?[Z(`recursive`)]:[],...t.recursiveSection>=0?[Q(`recursiveSection`,t.recursiveSection)]:[],...t.isLocal?[Z(`local`)]:[]]),t,t.location)}case`ThmOrAssumpDef`:return p(Z(t.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,t.name),x(t.body,$.theoremDefinitionBody)]),t,t.location);case`Module`:return Z(`ModuleNode`,[Gr(t.location),..._(t)]);case`Theorem`:return p(Z(`TheoremNode`,[...t.definition?[Z(`definition`,[f(t.definition,$.theoremDefinition)])]:[],Z(`body`,[x(t.body,$.theorem)]),...t.proof?[x(t.proof,$.proof)]:[],...t.isSuffices?[Z(`suffices`)]:[]]),t,t.location);case`Assume`:return Z(`AssumeNode`,[Gr(t.location),...t.body.levelChecked===0?[]:[Q(`level`,t.body.level)],...t.definition?[Z(`definition`,[f(t.definition,$.assumeDefinition)])]:[],Z(`body`,[x(t.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Lt(e,2).filter(t).map(e=>f(e,$.constant)),...Lt(e,3).filter(t).map(e=>f(e,$.variable)),...It(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.isNull&&i)throw u(zr(0),[$.operator,...Xr(`OpDef`,Yr),Jr]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&St(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw d(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:xt(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return l(n,()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e,e.location);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e,e.location)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e,e.location);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=qr[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Gr(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&St(e.set))?[x(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e,e.location)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e,e.location);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e,e.location)}},C=(r.isRestricted?[n]:t).map(e=>f(e,$.main)),w=Zr(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Qr(e,w)-Qr(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},ai=(t,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=ii(t.modules,t.root,n),i=Ur(r);if(i){let t=i.character.codePointAt(0)??0;throw e.U(new e.k(`The spec contains the character U+${t.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Rr.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Wr(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
32
- `)}\n`},oi=`META-INF/MANIFEST.MF`,si=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===oi})[oi];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},ci={success:e.V.success,"assumption-violation":e.V.assumptionViolation,deadlock:e.V.deadlock,"invariant-violation":e.V.safetyViolation,"property-violation":e.V.safetyViolation,"liveness-violation":e.V.livenessViolation,"postcondition-violation":e.V.assumptionViolation,error:e.V.error},li=d(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),ui=d(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`-N`,isRequired:!0},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--summary`},{flag:`--strict`},{flag:`-I <directory>`,isRepeatable:!0}]),di=d(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`--backend <${n.t.join(`|`)}>`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-workers <count|auto>`}]),fi=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),pi=/* @__PURE__ */ new Set([`-o`]),mi=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
33
- `)})(),hi=[`Usage: ${li.usage}`,` ${di.usage}`,` ${ui.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
34
- `),gi=/[*?[{]/,_i=e=>e.flatMap(e=>gi.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),vi=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),yi=e=>e?e[0]===`auto`?(0,o.availableParallelism)():Math.max(1,Number.parseInt(e[0],10)||1):1,bi=[`constrained`,`stuttering`,`strict`],xi=(e,t)=>e.endsWith(t)?e:`${e}${t}`,Si=e=>{if(e.length===1)return{path:xi(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:xi(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},Ci=(e,n)=>e.print(t.L.computingInitProgress,t.R.none,`Computed ${n} initial states...`),wi=(e,n)=>e===`invariant-violation`?{code:t.L.invariantViolatedInitial,text:`Invariant ${n} is violated by the initial state:`}:{code:t.L.propertyViolatedInitial,text:`Property ${n} is violated by the initial state:`},Ti=(e,n)=>n?.forEach(n=>{if(typeof n==`string`)return console.log(n);if(n.kind===`initial-states-progress`)return Ci(e,n.count);let r=wi(n.status,n.name);e.print(r.code,t.R.error,`${r.text}\n${t.q(n.state)}`)}),Ei=(e,n,r={code:t.L.behaviorUpToThisPoint,text:`The behavior up to this point is:`},i=!1)=>{n.length>0&&e.print(r.code,t.R.error,r.text),n.forEach((n,r)=>{(r>0||i)&&Ti(e,n.output),e.print(t.L.statePrint2,t.R.state,`${r+1}: <${n.label??n.action??`Initial predicate`}>\n${t.q(n.state)}`)})},Di={code:t.L.counterExample,text:`The following behavior constitutes a counter-example:
35
- `},Oi=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
36
- `:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,ki=e=>e.filter((t,n)=>t!==e[n-1]).map((e,n)=>`${n}) ${t.N(e)}\n`).toReversed().join(``),Ai=e=>{if(e.length===0)return` The error call stack is empty.
37
- `;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},ji=(e,n)=>{let r=n.generated,i=n.distinct,a=t.H(/* @__PURE__ */ new Date);r===i?e.print(t.L.initGenerated1,t.R.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(t.L.initGenerated2,t.R.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},Mi=(e,n,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(t.L.progress,t.R.none,`Progress(${Math.max(n.depth,1)}) at ${t.H(/* @__PURE__ */ new Date)}: ${a(n.generatedStates)} states generated${o(n.generatedStates,`s`)}, ${a(n.distinctStates)} distinct states found${o(n.distinctStates,`ds`)}, ${a(n.queuedStates)} states left on queue.`)},Ni=(e,t)=>(0,i.join)(e,`${t}.class`),Pi=(e,n,r,a)=>{let o=e.print;switch(n.kind){case`parsed`:r.isParsed=!0,e.isTool&&o(t.L.sanyFinished,t.R.none,`SANY finished.`),o(t.L.starting,t.R.none,`Starting... (${t.H(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;o(t.L.constantLevelInvariant,t.R.warning,`The invariant ${n.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;o(t.L.stateLevelProperty,t.R.warning,`The formula ${n.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${n.name} holds in all states of every behavior, use INVARIANT ${n.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${n.name} changes it into a temporal formula, asserting that ${n.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:n.isSymmetric&&o(t.L.livenessSymmetry,t.R.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),n.isConstrained&&e.version===`1.7.4`&&o(t.L.livenessConstraints,t.R.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:o(t.L.temporalBranches,t.R.none,`Implied-temporal checking--satisfiability problem has ${n.branches} branches.`);return;case`java-override`:{let e=(0,s.pathToFileURL)((0,i.resolve)(Ni(a,n.module))).href;o(n.isMatched?t.L.javaOverrideLoaded:t.L.javaOverrideMismatch,n.isMatched?t.R.none:t.R.warning,`${n.isMatched?`Loading`:`Failed to match`} ${n.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${n.signature}>.`);return}case`initial-states-started`:o(t.L.computingInit,t.R.none,`Computing initial states...`);return;case`initial-states-progress`:Ci(e,n.count);return;case`initial-states-computed`:ji(e,n.initialStates);return;case`progress`:Mi(e,n.statistics,r.start);return;case`liveness-started`:{r.liveness=Date.now(),n.isComplete&&Mi(e,n.statistics);let i=n.branches>1?`${n.branches} branches of `:``,a=n.branches*n.states;o(t.L.checkingTemporal,t.R.none,`Checking ${i}temporal properties for the ${n.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${t.H(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Fi(e,r);return;case`warning`:o(n.code,t.R.warning,n.text)}},Fi=(e,n)=>{n.liveness!==void 0&&(e.print(t.L.checkingTemporalEnd,t.R.none,`Finished checking temporal properties in ${t.U(Date.now()-n.liveness)} at ${t.H(/* @__PURE__ */ new Date)}`),n.liveness=void 0)},Ii=(e,n,r)=>{let i=r.print,a=n.name,o=n.loopStart,s=o===void 0&&n.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:t.L.temporalPropertyViolated,text:Oi(n.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":n.message?{code:t.L.assumptionEvaluationError,text:t.B(t.L.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${n.message}`,r.isTool)}:{code:t.L.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:t.L.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?wi(`invariant-violation`,a):{code:t.L.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?wi(`liveness-violation`,a):{code:t.L.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:n.postcondition?.code??t.L.general,text:n.message??`Postcondition ${a} is false.`}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d,p=f&&r.version!==`1.7.4`;if(p&&Ti(r,n.trace[0]?.output),n.counts&&console.log(n.counts),l){let e=s?`${l.text}\n${t.q(n.trace[0].state)}`:l.text;i(l.code,t.R.error,e)}if(s||(f||Ti(r,n.trace[0]?.output),Ei(r,n.trace,f?Di:void 0,f&&!p),Ti(r,n.traceOutput)),d){let e=n.loopLabel;o===n.trace.length-1?i(t.L.statePrint3,t.R.state,`${o+2}: Stuttering`):r.isTool?i(t.L.backToState,t.R.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}n.warning&&r.version!==`1.7.4`&&i(n.warning.code,t.R.warning,n.warning.text);let m=n.unwitnessed??(e===`postcondition-violation`?void 0:n.postcondition);return m?.counts&&console.log(m.counts),m&&i(m.code,t.R.error,m.message),!s&&e!==`assumption-violation`},Li=(e,n)=>e.print(t.L.nestedExpression,t.R.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Ai(n)}`),Ri=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?Ai(i.callStack):ki(e.sources);a(t.L.fingerprintFailed,t.R.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.V(e.reason,r.isTool)}`)}else i.callStack&&Li(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.q(i.initialState)}`}catch(t){throw t instanceof e.g?e.U(new e.g(`${e.M}${t.message}`),e.V.error):t}})();a(c?t.L.initialState:i.code,t.R.error,c?`${o}\n${c}`:o),Ti(r,i.trace[0]?.output),Ei(r,i.trace);let l=i.traceFailure;l&&a(l.code,t.R.error,r.isTool?l.toolMessage:l.message),Ti(r,i.traceOutput);let u=i.postcondition;u?.counts&&console.log(u.counts),u&&a(u.code,t.R.error,u.message),i.isCallStackFirst||s()}else if(n.violation){if(!Ii(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Ii(`property-violation`,e,r),n.liveCallStack&&Li(r,n.liveCallStack)}else{Fi(r,i);let e=t._(n.distinctStates,n.generatedStates),o=n.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${t.m(t.h(n.fingerprintDistance))}`];a(t.L.success,t.R.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${t.m(e)}`,...o].join(`
38
- `))}if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&Fi(r,i),r.isTool&&Mi(r,n,i.start),a(t.L.stats,t.R.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.L.searchDepth,t.R.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.v(s);c&&a(t.L.stateGraphOutdegree,t.R.none,c)},zi=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),Bi=e=>t=>{let n=zi(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},Vi=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),Hi=e=>`jar:file:${(0,s.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,Ui=e=>t.E([e]).toString(),Wi=(e,t,n,r,s)=>{let c=n.temporaryDirectory??(0,o.tmpdir)(),l=(0,a.existsSync)(c)?(0,a.realpathSync)(c):(0,i.resolve)(c),u=(0,i.join)(l,`tlc-${Ui((0,i.resolve)(e))}`),d=Ca(n);return(n,o)=>{let c=`${n}.tla`;if(o===`file`)return(0,a.realpathSync)(zi(t,n)??e);if(s===`1.7.4`)return(0,i.join)(l,c);if(o===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,Ui(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${Hi(d)}${c})`}},Gi=e=>e.print(t.L.version,t.R.none,`TLC2 Version ${l} (rev: tla-ts)`),Ki=(e,n)=>(Gi(e),e.print(t.L.commandLineError,t.R.error,`${n}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),qi=(e,n,r)=>e.print(t.L.modelChecking,t.R.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(n)} with ${r} worker${r===1?``:`s`} on ${(0,o.availableParallelism)()} cores with ${Math.floor((0,c.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${(0,o.type)()} ${(0,o.release)()} ${(0,o.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Ji=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},Yi=async(r,o,s,c)=>{let l=o.has(`-seed`)?o.get(`-seed`)?.[0]:`0`;if(l===void 0)return Ki(c,`Error: seed required.`);if(!vi(l))return Ki(c,`Error: An integer for seed required. But encountered ${l}`);let u=o.has(`-lncheck`)?o.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(u===void 0)return Ki(c,`Error: expect a strategy such as final for -lncheck option.`);let d=o.get(`-dump`);if(d?.length===0)return Ki(c,`Error: A file name for dumping states required.`);let f=d?.length===2&&bi.find(e=>d[0].toLowerCase().includes(e));if(f)return console.error(`Error: tla-ts does not support the -dump format ${f}.`),1;let p=o.get(`-fp`)?.[0];if(p!==void 0&&Number(p)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${p}.`),1;let m=yi(o.get(`-workers`)),h=c.version;Gi(c),qi(c,l,m);let g=o.get(`-config`)?.[0]??(o.has(`-config`)?void 0:r.replace(/\.tla$/,`.cfg`));if(!g||!(0,a.existsSync)(g))return c.print(t.L.configFileError,t.R.error,`TLC encountered the following error when trying to read the configuration file ${g??``}:\nFile not found.`),e.V.configParseError;let _=(0,i.basename)(r,`.tla`),v={start:Date.now(),liveness:void 0,isParsed:!1},y=()=>{let e=Date.now()-v.start;c.print(t.L.finished,t.R.none,`Finished in ${c.isTool?`${e}ms`:t.U(e)} at (${t.H(/* @__PURE__ */ new Date)})`)},b=()=>c.print(t.L.parsingFailed,t.R.error,`Parsing or semantic analysis failed.`),x=t=>(t instanceof e.D?b():Zi(t,c),y(),e.R(t)),S=(()=>{try{return t.Q((0,a.readFileSync)(g,`utf8`),h)}catch(t){if(!(t instanceof e.m))throw t;return t}})();if(S instanceof e.m&&h===`1.7.4`)return c.print(t.L.general,t.R.error,`${e.z(`tlc2.tool.ConfigFileException`)}${t.V(S.message,c.isTool)}`),y(),e.V.error;if(S instanceof e.m)return x(S);o.has(`-deadlock`)&&(S.checkDeadlock=!1);let C=(0,i.dirname)(r),w=[C,...s.libraries],T=Bi(w),E=Ji(o,h),D=async()=>{let s=(0,a.readFileSync)(r,`utf8`),f=t.O(s).name;if(f!==_)throw new e.T(`File name '${_}' does not match the name '${f}' of the top level module it contains.`,void 0);let p=await n.l({workers:m,livenessCheck:[`final`,`seqfinal`,`off`].includes(u)?`final`:`default`,seed:BigInt(l),dump:d&&Si(d),isTool:c.isTool,isTraceRecorded:E,isSanyReported:!0,isWarningEnabled:!o.has(`-nowarning`),version:h,onProgress:e=>Pi(c,e,v,C),source:s,config:S,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:T,loadClass:e=>{let t=Ni(C,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0,writeFile:(e,t)=>{(0,a.mkdirSync)((0,i.dirname)((0,i.resolve)(e)),{recursive:!0}),(0,a.writeFileSync)(e,t)}});return Ri(p,c,v),y(),p.failure?.exitCode??ci[p.status]};c.isTool&&c.print(t.L.startingSany,t.R.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),O=ee?_:r.replace(/\.tla$/,``),te=Ca(s),k=h===`1.7.4`?va(r,s,te):void 0;if(k?!(0,a.existsSync)(r)&&!t.C.has(_)&&k(`${_}.tla`):!(0,a.existsSync)(r)&&!t.w.has(_)&&Vi(ee?C:process.cwd(),ee?`${_}.tla`:`./${O}.tla`,[...ee||C===`.`?[]:[C],...s.libraries]),Lr(r,k?ya(T,k):T,{fileName:O,describeFile:Wi(r,w,s,o.get(`-metadir`)?.[0],h),version:h,rootExtendees:E?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Pi(c,{kind:`parsed`},v,C),b(),y(),e.V.specParseError;try{return await D()}catch(t){if(!(t instanceof e.h))throw t;return t instanceof e.D&&console.log(Xi(t,_)),v.isParsed||Pi(c,{kind:`parsed`},v,C),x(t)}},Xi=(t,n)=>{let r=t instanceof e.T;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},Zi=(n,r)=>{if(n instanceof e.m||n instanceof e.g){let e=t.W(n.message),i=e&&!e.isEvalException?e.code:t.L.general;return r.print(i,t.R.error,t.B(i,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},Qi=async(n,r=t.z(!1))=>{try{return await n()}catch(t){if(!(t instanceof e.h))throw t;return Zi(t,r),e.R(t)}},$i=async(t,n,r)=>{let i=[];for(let[e,a]of t.entries()){e>0&&console.log(``);let t=r();i.push(await Qi(()=>n(a,t),t))}return i.find(t=>t!==e.V.success)??e.V.success},ea=()=>r.getTlapmPaths().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).find(e=>(0,a.existsSync)(e)),ta=e=>e.flatMap(e=>gi.test(e)?(0,a.globSync)(e).sort():[e]),na=e=>(0,a.existsSync)(e)?{file:e,source:(0,a.readFileSync)(e,`utf8`)}:void 0,ra=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),ia=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,aa=e=>console.log(`\n\\* TLAPM version 5f5037f\n\\* launched at ${t.H(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`prove`,...e].map(ia).join(` `)}\n`),oa={incomplete:11,emptyTarget:12},sa=(e,t,r)=>{let i=e.summary;r||(i.absent.forEach(e=>console.error(`Missing proof at ${n.c(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${n.c(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${n.s(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${n.s(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[oa.incomplete]:[],...o?[oa.emptyTarget]:[]]},ca=t=>{try{return t()}catch(t){if(!(t instanceof e.C))throw t;console.error(` tlapm ending abnormally with ${t.exception}\n`);return}},la=r=>{let o=di.parse(r),s=o.get(`--backend`)?.[0];if(o.unknown[0]!==void 0||o.incomplete||s!==void 0&&!n.n(s))return console.error(`Usage: ${di.usage}`),1;let c=ta(o.positionals).map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(c.length===0)return console.error(`Usage: ${di.usage}`),1;let l=ea(),u=o.options.flatMap(e=>e.name===`-I`?e.values:[]);return $i(c,async t=>{let r=[(0,i.dirname)(t),`.`,...l?[l]:[],...u.toReversed()],c=await n.r({source:(0,a.readFileSync)(t,`utf8`),loadModule:e=>r.map(t=>na(`${t}/${e}.tla`)).find(Boolean)?.source,backend:s,workers:yi(o.get(`-workers`)),onObligation:e=>console.log(`${t}:${e.location}: ${e.status}${e.status===`proved`?` by ${e.prover}`:``}${e.status===`failed`||e.status===`unsupported`?` (${e.reason})`:``}`)}),d=Map.groupBy(c.obligations,e=>e.status),f=e=>d.get(e)?.length??0;return console.log(`${c.obligations.length} obligations: ${f(`proved`)} proved, ${f(`trivial`)} trivial, ${f(`failed`)} failed, ${f(`unsupported`)} unsupported`),f(`failed`)+f(`unsupported`)===0?e.V.success:1},()=>t.z(!1))},ua=t=>{if(!t.includes(`-N`)&&!t.includes(`--summary`))return la(t);let r=ui.parse(t),o=r.unknown[0];if(o!==void 0)return console.error(`Error: tla-ts prove does not support the tlapm option ${o}.`),1;if(r.incomplete)return console.error(`Error: option '${r.incomplete.name}' needs an argument.`),1;let s=r.options.find(e=>e.name!==`-I`&&e.values.some(e=>!/^-?\d+$/.test(e)));if(s)return console.error(`Error: option '${s.name}' expects an integer.`),1;let c=ta(r.positionals),l=c.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(l.length===0)return console.error(hi),1;let u=r.has(`--toolbox`)||r.has(`--line`);u&&aa(t);let d=r.options.reduce((e,t)=>{let[r,i]=t.values.map(Number);return t.name===`--toolbox`?{start:r,end:i===0?1/0:i}:t.name===`--line`?r===0?n.i:{start:r,end:r}:e},n.i),f=ea(),p=r.options.flatMap(e=>e.name===`-I`?e.values:[]),m=l.reduce((e,t)=>e.includes((0,i.dirname)(t))?e:[(0,i.dirname)(t),...e],[`.`,...f?[f]:[],...p.toReversed()]),h=ca(()=>{let t=l.findIndex(e=>!(0,a.existsSync)(e));if(t!==-1){let n=c[t];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new e.C(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return n.o(l.map(e=>({file:`./${e}`,source:(0,a.readFileSync)(e,`utf8`)})),e=>m.map(t=>na(`${t}/${e}.tla`)).find(Boolean),{lines:d,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(u&&t)return ra([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!h)return 3;let g=h.flatMap(e=>(r.has(`--summary`)&&console.log(n.a(e)),u&&(e.obligations.forEach(e=>ra([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:to be proved`,...r.has(`--printallobs`)?[`obl:${e.text}`]:[]])),ra([`type:obligationsnumber`,`count:${e.obligations.length}`])),r.has(`--strict`)?sa(e,d.start>0||d.end<1/0,r.has(`--summary`)):[]));return g.includes(oa.incomplete)?oa.incomplete:g[0]??e.V.success},da=async(e,n)=>{let r=li.parse(e),o=_i(r.positionals),s=r.has(`-config`),c=o.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||s||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(c.length===0)return console.error(hi),1;if(s&&c.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let l=[...new Set(c.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:n.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],u=n.tlcVersion??`master`;return $i(l,(e,t)=>(l.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),Yi(e,r,n,t)),()=>t.z(r.has(`-tool`),!r.has(`-nowarning`),u))},fa=e=>(process.stderr.write(`ERROR: ${e}\n${mi}`),Rr.argsParsingFailure),pa=(t,n)=>{try{return process.stdout.write(ai(t,n)),e.V.success}catch(t){if(!(t instanceof e.k))throw t;let n=e.R(t),r=t instanceof e.b?t.unwound:``;return console.error(n===Rr.uncaughtException?`${r}Exception in thread "main" ${t.message}`:`ERROR: ${t.message}`),n}},ma=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={flag:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.flag=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.flag=i}return r.flag===e.length-2?n:{...n,error:`several-files`}},ha=n=>{if(n.length===0)return fa(`at least one .tla file must be given`);let r=ma(n,fi);if(r.error===`missing-include`)return fa(`the -I flag must be followed by a directory and at least one .tla file`);if(r.error===`several-files`)return fa(`Only one TLA file to check allowed!`);let o=n[n.length-1];if(o===`-help`)return process.stdout.write(mi),e.V.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!t.w.has(s.slice(0,-4))&&Vi(process.cwd(),`./${s}`,r.includes);let u=Lr(l??s,Bi(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Rr.specParsingFailure):pa(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},ga=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[Hi(n)]].join(`, `)}`),_a=e=>e.endsWith(`/`)?e:`${e}/`,va=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(_a),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>ga(`${o}${e}`,a,n)},ya=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.C.has(r)&&n(`${r}.tla`),i},ba=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Rr.uncaughtException),xa=(n,r)=>{if(n.length===0)return ba(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let o=ma(n,pi);if(o.error===`missing-include`)return ba(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(o.error===`several-files`)return ba(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let s=n[n.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(_a),u=[`.`,...l],d=e=>ga(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!t.C.has((0,i.basename)(c,`.tla`)))return d(c),e.V.success;let p=Lr(f??c,ya(Bi(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?ba(`tla2sany.xml.XMLExportingException: spec ${(f&&Ir((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):pa(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Sa=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Ca=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`)),wa=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Sa.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Ta=e=>e.mainClass===`tlc2.TLC`?da(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?Qi(()=>e.java.tlcVersion===`1.7.4`?xa(e.args,Ca(e.java)):ha(e.args)):(console.error(`Error: tla-ts runs the Java classes ${Sa.join(` and `)}, not ${e.mainClass}.`),1),Ea=async e=>{if(e[0]===`prove`)return Qi(()=>ua(e.slice(1)));let t=wa(e);return t===void 0?da(e,{libraries:[]}):(t.java.tlcVersion??=await si(Ca(t.java)),Ta(t))},Da=async()=>{process.exitCode=await Ea(process.argv.slice(2))};exports.runCli=Da;