tla-ts 0.0.3 → 0.0.4-dev.2a873ee

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (370) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +996 -0
  17. package/dist/prove.js +996 -0
  18. package/dist/run-cli.cjs +37 -20
  19. package/dist/run-cli.js +37 -20
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1387 -18
  23. package/dist/transfer.js +1387 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +4 -7
  29. package/src/builtins.ts +29 -11
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/canonical.ts +4 -3
  32. package/src/check.ts +1540 -235
  33. package/src/cli-options.ts +12 -6
  34. package/src/cli.ts +8 -1
  35. package/src/codegen.ts +98 -39
  36. package/src/config.ts +254 -181
  37. package/src/dependencies.ts +2 -2
  38. package/src/environment.ts +540 -140
  39. package/src/errors.ts +284 -4
  40. package/src/evaluate.ts +1043 -293
  41. package/src/exit-codes.ts +22 -43
  42. package/src/fingerprints.ts +46 -11
  43. package/src/index.ts +11 -0
  44. package/src/instances.ts +19 -16
  45. package/src/java-overrides.ts +104 -25
  46. package/src/levels.ts +191 -45
  47. package/src/lexer.ts +127 -30
  48. package/src/live-check.ts +867 -0
  49. package/src/liveness.ts +218 -572
  50. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  51. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  52. package/src/obligations/ctx.ts +64 -0
  53. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  54. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  55. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  56. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  57. package/src/{obligations.ts → obligations/index.ts} +32 -16
  58. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  59. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  60. package/src/obligations/pickle.ts +98 -0
  61. package/src/obligations/pragma.ts +189 -0
  62. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  63. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  64. package/src/{obligation-source.ts → obligations/source.ts} +156 -99
  65. package/src/obligations/temporal.ts +321 -0
  66. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  67. package/src/ocaml-marshal.ts +166 -0
  68. package/src/parallel-worker.ts +169 -224
  69. package/src/parallel.ts +140 -81
  70. package/src/parser.ts +456 -147
  71. package/src/pcal-ast.ts +770 -0
  72. package/src/pcal-parse.ts +1523 -0
  73. package/src/pcal-tokenize.ts +516 -0
  74. package/src/pcal-translate.ts +1230 -0
  75. package/src/pcal-validate.ts +454 -0
  76. package/src/prove/decide-pool.ts +95 -0
  77. package/src/prove/deciders.ts +33 -0
  78. package/src/prove/first-order.ts +78 -0
  79. package/src/prove/isabelle/LICENSE +36 -0
  80. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  81. package/src/prove/isabelle/decide.ts +47 -0
  82. package/src/prove/isabelle/encode.ts +446 -0
  83. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  84. package/src/prove/isabelle/isar/method.ts +367 -0
  85. package/src/prove/isabelle/isar/proof.ts +28 -0
  86. package/src/prove/isabelle/isar/statement.ts +57 -0
  87. package/src/prove/isabelle/isar/theory.ts +192 -0
  88. package/src/prove/isabelle/isar/type-check.ts +278 -0
  89. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  90. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  91. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  92. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  93. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  94. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  95. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  96. package/src/prove/isabelle/provers/classical.ts +389 -0
  97. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  98. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  99. package/src/prove/isabelle/pure/consts.ts +32 -0
  100. package/src/prove/isabelle/pure/conv.ts +79 -0
  101. package/src/prove/isabelle/pure/drule.ts +264 -0
  102. package/src/prove/isabelle/pure/envir.ts +331 -0
  103. package/src/prove/isabelle/pure/goal.ts +53 -0
  104. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  105. package/src/prove/isabelle/pure/list.ts +12 -0
  106. package/src/prove/isabelle/pure/logic.ts +330 -0
  107. package/src/prove/isabelle/pure/name.ts +98 -0
  108. package/src/prove/isabelle/pure/net.ts +215 -0
  109. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  110. package/src/prove/isabelle/pure/pattern.ts +631 -0
  111. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  112. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  113. package/src/prove/isabelle/pure/search.ts +68 -0
  114. package/src/prove/isabelle/pure/seq.ts +133 -0
  115. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  116. package/src/prove/isabelle/pure/table.ts +201 -0
  117. package/src/prove/isabelle/pure/tactic.ts +168 -0
  118. package/src/prove/isabelle/pure/tactical.ts +264 -0
  119. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  120. package/src/prove/isabelle/pure/term.ts +688 -0
  121. package/src/prove/isabelle/pure/thm.ts +783 -0
  122. package/src/prove/isabelle/pure/type.ts +121 -0
  123. package/src/prove/isabelle/pure/unify.ts +753 -0
  124. package/src/prove/isabelle/pure/variable.ts +25 -0
  125. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  126. package/src/prove/isabelle/tla/context.ts +74 -0
  127. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  128. package/src/prove/isabelle/tla/logic.ts +215 -0
  129. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  130. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  131. package/src/prove/ocaml.ts +22 -0
  132. package/src/prove/prep/action.ts +508 -0
  133. package/src/prove/prep/defs.ts +33 -0
  134. package/src/prove/prep/elab.ts +156 -0
  135. package/src/prove/prep/enabled-axioms.ts +189 -0
  136. package/src/prove/prep/enabled.ts +43 -0
  137. package/src/prove/prep/fingerprint.ts +388 -0
  138. package/src/prove/prep/flatten.ts +70 -0
  139. package/src/prove/prep/level-comparison.ts +529 -0
  140. package/src/prove/prep/md5.ts +67 -0
  141. package/src/prove/prep/pragma.ts +221 -0
  142. package/src/prove/prep/trivial.ts +22 -0
  143. package/src/prove/prove-worker.ts +22 -0
  144. package/src/prove/prove.ts +498 -0
  145. package/src/prove/ptl/decide.ts +68 -0
  146. package/src/prove/ptl/encode.ts +255 -0
  147. package/src/prove/ptl/sat.ts +151 -0
  148. package/src/prove/ptl/tableau.ts +276 -0
  149. package/src/prove/smt/axiomatize.ts +69 -0
  150. package/src/prove/smt/axioms.ts +209 -0
  151. package/src/prove/smt/context.ts +108 -0
  152. package/src/prove/smt/data.ts +636 -0
  153. package/src/prove/smt/encode.ts +164 -0
  154. package/src/prove/smt/extensionality.ts +65 -0
  155. package/src/prove/smt/flatten.ts +112 -0
  156. package/src/prove/smt/format.ts +154 -0
  157. package/src/prove/smt/instances.ts +181 -0
  158. package/src/prove/smt/rewrite.ts +772 -0
  159. package/src/prove/smt/simplify.ts +57 -0
  160. package/src/prove/smt/solver/act-cache.ts +265 -0
  161. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prove/smt/solver/array.ts +22 -0
  163. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prove/smt/solver/ast-lt.ts +157 -0
  165. package/src/prove/smt/solver/ast-util.ts +91 -0
  166. package/src/prove/smt/solver/ast.ts +1315 -0
  167. package/src/prove/smt/solver/auf-solver.ts +572 -0
  168. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prove/smt/solver/cg-table.ts +175 -0
  170. package/src/prove/smt/solver/clause.ts +276 -0
  171. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prove/smt/solver/context.ts +1292 -0
  173. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prove/smt/solver/der.ts +224 -0
  175. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prove/smt/solver/e-matching.ts +659 -0
  177. package/src/prove/smt/solver/enode.ts +259 -0
  178. package/src/prove/smt/solver/expr-ref.ts +21 -0
  179. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prove/smt/solver/fingerprints.ts +92 -0
  181. package/src/prove/smt/solver/flat-literals.ts +51 -0
  182. package/src/prove/smt/solver/goal.ts +138 -0
  183. package/src/prove/smt/solver/hash.ts +173 -0
  184. package/src/prove/smt/solver/hashtable.ts +166 -0
  185. package/src/prove/smt/solver/internalizer.ts +1381 -0
  186. package/src/prove/smt/solver/lbool.ts +5 -0
  187. package/src/prove/smt/solver/literal.ts +24 -0
  188. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prove/smt/solver/lp/containers.ts +296 -0
  191. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prove/smt/solver/lp/nex.ts +120 -0
  208. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prove/smt/solver/model-checker.ts +347 -0
  238. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prove/smt/solver/model-finder.ts +155 -0
  240. package/src/prove/smt/solver/model-generator.ts +97 -0
  241. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prove/smt/solver/nnf.ts +469 -0
  255. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prove/smt/solver/propagate-values.ts +83 -0
  258. package/src/prove/smt/solver/proto-model.ts +551 -0
  259. package/src/prove/smt/solver/pull-quant.ts +139 -0
  260. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prove/smt/solver/qe-lite.ts +381 -0
  263. package/src/prove/smt/solver/qi-queue.ts +362 -0
  264. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prove/smt/solver/random-gen.ts +10 -0
  268. package/src/prove/smt/solver/rational.ts +165 -0
  269. package/src/prove/smt/solver/ref-vector.ts +62 -0
  270. package/src/prove/smt/solver/relevancy.ts +247 -0
  271. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prove/smt/solver/rewriter.ts +843 -0
  273. package/src/prove/smt/solver/rlimit.ts +79 -0
  274. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prove/smt/solver/solver.ts +71 -0
  276. package/src/prove/smt/solver/sort.ts +35 -0
  277. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prove/smt/solver/theory-lra.ts +56 -0
  286. package/src/prove/smt/solver/var-subst.ts +258 -0
  287. package/src/prove/smt/solver/z3-license.txt +10 -0
  288. package/src/prove/smt/table.ts +170 -0
  289. package/src/prove/tlapm/tlapm.ts +96 -0
  290. package/src/prove/tlaps-module.ts +510 -0
  291. package/src/prove/verdict.ts +18 -0
  292. package/src/prove/zenon/LICENSE +32 -0
  293. package/src/prove/zenon/check/check.ts +105 -0
  294. package/src/prove/zenon/check/definitions.ts +144 -0
  295. package/src/prove/zenon/check/equality.ts +182 -0
  296. package/src/prove/zenon/check/functions.ts +62 -0
  297. package/src/prove/zenon/check/keys.ts +125 -0
  298. package/src/prove/zenon/check/propositional.ts +104 -0
  299. package/src/prove/zenon/check/records.ts +188 -0
  300. package/src/prove/zenon/check/relations.ts +121 -0
  301. package/src/prove/zenon/check/rewrites.ts +224 -0
  302. package/src/prove/zenon/check/sets.ts +302 -0
  303. package/src/prove/zenon/check/terms.ts +127 -0
  304. package/src/prove/zenon/check/tla.ts +126 -0
  305. package/src/prove/zenon/decide.ts +113 -0
  306. package/src/prove/zenon/encode.ts +379 -0
  307. package/src/prove/zenon/eqrel.ts +300 -0
  308. package/src/prove/zenon/equality-rules.ts +435 -0
  309. package/src/prove/zenon/expr.ts +551 -0
  310. package/src/prove/zenon/index-table.ts +350 -0
  311. package/src/prove/zenon/isar-case.ts +513 -0
  312. package/src/prove/zenon/isar.ts +1249 -0
  313. package/src/prove/zenon/limits.ts +15 -0
  314. package/src/prove/zenon/llproof.ts +173 -0
  315. package/src/prove/zenon/mltoll.ts +1566 -0
  316. package/src/prove/zenon/node.ts +297 -0
  317. package/src/prove/zenon/ocaml.ts +169 -0
  318. package/src/prove/zenon/parse.ts +247 -0
  319. package/src/prove/zenon/phrase.ts +191 -0
  320. package/src/prove/zenon/proof.ts +198 -0
  321. package/src/prove/zenon/propositional-rules.ts +387 -0
  322. package/src/prove/zenon/rules.ts +94 -0
  323. package/src/prove/zenon/search.ts +288 -0
  324. package/src/prove/zenon/tla/functions.ts +151 -0
  325. package/src/prove/zenon/tla/llproof.ts +480 -0
  326. package/src/prove/zenon/tla/records.ts +225 -0
  327. package/src/prove/zenon/tla/rewrites.ts +447 -0
  328. package/src/prove/zenon/tla/sets.ts +304 -0
  329. package/src/prove/zenon/tla/terms.ts +162 -0
  330. package/src/prove/zenon/tla/tla.ts +506 -0
  331. package/src/randomization.ts +24 -7
  332. package/src/resolve.ts +1481 -426
  333. package/src/run-cli.ts +1483 -212
  334. package/src/runtime.ts +19 -1
  335. package/src/sany-builtins.ts +147 -0
  336. package/src/sany-generator.ts +3128 -0
  337. package/src/sany-levels.ts +1208 -0
  338. package/src/sany-lexer.ts +545 -0
  339. package/src/sany-linter.ts +122 -0
  340. package/src/sany-modules.ts +1398 -0
  341. package/src/sany-nodes.ts +463 -0
  342. package/src/sany-parse-error.ts +2161 -0
  343. package/src/sany-report.ts +356 -0
  344. package/src/sany-selectors.ts +738 -0
  345. package/src/sany-source.ts +248 -0
  346. package/src/sany-xml.ts +1017 -0
  347. package/src/spec-description.ts +42 -11
  348. package/src/standard-modules.ts +203 -148
  349. package/src/standard-ranges.ts +116 -0
  350. package/src/state-graph.ts +180 -0
  351. package/src/subexpressions.ts +231 -171
  352. package/src/substitution-levels.ts +38 -17
  353. package/src/successors.ts +241 -110
  354. package/src/symmetry.ts +194 -54
  355. package/src/tableau.ts +54 -25
  356. package/src/tlapm-cache.ts +236 -0
  357. package/src/tlc-ext.ts +42 -29
  358. package/src/tlc-messages.ts +329 -0
  359. package/src/tlc-module.ts +52 -43
  360. package/src/tlc-modules.ts +4 -0
  361. package/src/tlc-order.ts +78 -10
  362. package/src/tlc-random.ts +84 -33
  363. package/src/tlc-replay.ts +655 -0
  364. package/src/tlc-summary.ts +20 -5
  365. package/src/tlc-version.ts +19 -0
  366. package/src/transfer.ts +15 -3
  367. package/src/values.ts +787 -190
  368. package/src/worker.ts +65 -0
  369. package/dist/parallel.cjs +0 -12
  370. package/dist/parallel.js +0 -12
package/dist/run-cli.js CHANGED
@@ -6,23 +6,40 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- import{A as e,C as t,D as n,E as r,F as i,I as a,L as o,M as s,N as c,O as l,P as u,f as d,j as f,k as p,l as m,p as h,u as g,v as _}from"./transfer.js";import{t as v}from"./parallel.js";import{existsSync as y,globSync as ee,mkdirSync as b,readFileSync as x,readSync as S,realpathSync as C,writeFileSync as te}from"node:fs";import{spawnSync as ne}from"node:child_process";import{basename as w,delimiter as T,dirname as E,join as re,resolve as ie}from"node:path";import{availableParallelism as ae}from"node:os";const oe=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},se=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(oe).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},ce=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},le=e=>`File ${JSON.stringify(e.file)}, ${ce(e)}`,ue=e=>`${e?le(e):`<unknown location>`}:\n`,D=(e,t)=>({text:`${ue(e)}Error: ${t}`,channel:`stderr`}),de=e=>e?`${le(e)} :\n`:``,O=e=>({kind:`Shift`,amount:e}),fe=(e,t)=>({kind:`Cons`,expression:e,rest:t}),pe=(e,t)=>e.reduce((e,t)=>fe(t,e),t),k=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},A=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},me=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},j=(e,t,n)=>A({kind:`Apply`,operator:A({kind:`Internal`,builtin:e},n),args:t},n),he=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},M=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),ge=(e,t)=>t.reduce(M,e),_e=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},ve=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(me(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},ye=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},N=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},P=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),be=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),xe=(e,t,n)=>{switch(e.kind){case`Shift`:return A({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?A(we(e.expression),n):xe(e.rest,t-1,n);case`Compose`:return F(e.outer,xe(e.inner,t,n));case`Bump`:return t<=e.amount?A({kind:`Ix`,index:t},n):F(O(e.amount),xe(e.rest,t-e.amount,n))}},Se=(e,t)=>t.map(t=>F(e,t)),Ce=(e,t)=>{if(e.kind===`Lambda`){if(e.params.length!==t.length)throw new s(`Arity mismatch`);return we(F(pe(t,O(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...t]}:t.length===0?we(e):{kind:`Apply`,operator:e,args:t}},we=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},Te=(e,t)=>[k(t.length,e),Fe(t,t=>F(e,t))],Ee=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return Re(t,t=>F(e,t));case`Instance`:{let n=k(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:F(n,e.expression)}))}}}}},De=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:F(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:Ee(e,t.definition)};case`Fact`:return{...t,expression:F(e,t.expression)}}},Oe=(e,t)=>{let[n,r]=N(e,t.context,(e,t)=>[k(1,e),De(e,t)]);return{context:r,active:F(n,t.active)}},F=(e,t)=>{let n=t=>F(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return xe(e,t.index,t);case`Apply`:return A(Ce(n(t.operator),Se(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>Ie(e,n))};case`Lambda`:return{...t,body:F(k(t.params.length,e),t.body)};case`Let`:{let[n,r]=N(e,t.definitions,(e,t)=>[k(1,e),Ee(e,t)]);return{...t,definitions:r,body:F(n,t.body)}}case`Sequent`:return{...t,sequent:Oe(e,t.sequent)};case`With`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:Se(e,t.items)};case`Quant`:{let[n,r]=Te(e,t.bounds);return{...t,bounds:r,body:F(n,t.body)}}case`Tquant`:return{...t,body:F(k(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:F(k(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:F(k(1,e),t.body)};case`SetOf`:{let[n,r]=Te(e,t.bounds);return{...t,bounds:r,element:F(n,t.element)}}case`SetEnum`:return{...t,elements:Se(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=Te(e,t.bounds);return{...t,bounds:r,body:F(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:Se(e,t.args)};case`Product`:return{...t,factors:Se(e,t.factors)};case`Tuple`:return{...t,elements:Se(e,t.elements)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:Le(t.specs,n)};case`Dot`:return{...t,expression:n(t.expression)};case`Sub`:case`Tsub`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Fair`:return{...t,subscript:n(t.subscript),action:n(t.action)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)};case`Parens`:return{...t,expression:n(t.expression)}}},I=(e,t)=>e===0?t:F(O(e),t),L=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),ke=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!R(t,n))return!1}return!0},Ae=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&R(e.domain.expression,t.domain.expression)),je=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&L(e.args,t.args,R);case`Label`:return t.kind===`Label`&&e.label===t.label&&L(e.args,t.args,R);default:return!0}},Me=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return R(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return L(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&ke(n,r)}return!1},Ne=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level!==t.level||e.shape!==t.shape?!1:!e.domain||!t.domain?!e.domain&&!t.domain:R(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?Me(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&R(e.expression,t.expression),Pe=(e,t)=>L(e.context,t.context,Ne)&&R(e.active,t.active),R=(e,t)=>{if(e.kind===`Parens`)return R(e.expression,t);if(t.kind===`Parens`)return R(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&R(e.body,t.body);case`Apply`:return t.kind===`Apply`&&R(e.operator,t.operator)&&L(e.args,t.args,R);case`Sequent`:return t.kind===`Sequent`&&Pe(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&R(e.expression,t.expression)&&L(e.selectors,t.selectors,je);case`With`:return t.kind===`With`&&R(e.expression,t.expression);case`Let`:return t.kind===`Let`&&L(e.definitions,t.definitions,Me)&&R(e.body,t.body);case`If`:return t.kind===`If`&&R(e.condition,t.condition)&&R(e.consequent,t.consequent)&&R(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&L(e.items,t.items,R);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&L(e.bounds,t.bounds,Ae)&&R(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&L(e.names,t.names,(e,t)=>e===t)&&R(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?R(e.domain,t.domain)&&R(e.body,t.body):!e.domain&&!t.domain&&R(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&R(e.domain,t.domain)&&R(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&R(e.element,t.element)&&L(e.bounds,t.bounds,Ae);case`SetEnum`:return t.kind===`SetEnum`&&L(e.elements,t.elements,R);case`Arrow`:return t.kind===`Arrow`&&R(e.domain,t.domain)&&R(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&L(e.bounds,t.bounds,Ae)&&R(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&L([e.function,...e.args],[t.function,...t.args],R);case`Tuple`:return t.kind===`Tuple`&&L(e.elements,t.elements,R);case`Product`:return t.kind===`Product`&&L(e.factors,t.factors,R);case`Rect`:return t.kind===`Rect`&&ke(e.fields,t.fields);case`Record`:return t.kind===`Record`&&ke(e.fields,t.fields);case`Except`:return t.kind===`Except`&&R(e.function,t.function)&&L(e.specs,t.specs,(e,t)=>L(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&R(e.expression,t.expression))&&R(e.value,t.value));case`Dot`:return t.kind===`Dot`&&R(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&R(e.action,t.action)&&R(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&R(e.subscript,t.subscript)&&R(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:R(e.arms[0].condition,t.arms[0].condition)&&R(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?R(e.other,t.other):!e.other&&!t.other;case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},Fe=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),Ie=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,Le=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),Re=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,ze=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:Re(e.definition,t)}:{...e,expression:t(e.expression)},Be=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,P(t.name,t.level)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=P(t.name,`Unknown`,t.shape);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=N(e,t.sequent.context,(e,t)=>{let a=ze(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=N(e,t.definitions,(e,t)=>{let i=Re(t,t=>n(e,t));return[r(e,{kind:`Defn`,definition:i,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=Fe(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=Fe(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?be(t.name,i):P(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=be(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>Ie(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=Le(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},Ve=(e,t)=>Be(void 0,e,(e,n)=>t(n),()=>void 0,`all`),He=e=>{let t=[];return Ve(e,e=>(t.push(e),e)),t},Ue={kind:`Opaque`,name:`$Bad`},We=e=>e.kind===`Opaque`&&e.name===Ue.name,Ge=e=>{let t=e.kind===`Parens`?Ge(e.expression):Ve(e,Ge);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},Ke=e=>e.kind===`Let`?A({kind:`Let`,definitions:e.definitions,body:Ke(e.body)},e.body):e.kind===`Parens`?Ke(e.expression):Ve(e,Ke),qe=e=>e.kind===`Ix`?e.index<=0:He(e).some(qe),Je=(e,t,n)=>{let r=(e,r=n)=>Je(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(e=>P(e.name,e.level))]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(e=>P(e.name,`Unknown`,e.shape))]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,P(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of He(e)){let e=r(t);if(e)return e}return}},Ye=(e,t)=>pe(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),O(e+t)),Xe=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),Ze=(e,t,n)=>{switch(t.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(t.bounds.length!==n.length){let r=t.bounds.length,i=`Arity mismatch in subexpression instance.\nExpected ${r} argument${r===1?``:`s`}, but found${n.length<r?` only`:``} ${n.length}.`;throw e(D(t.location,i)),new s(i,{failure:`Expr.Deref.deref_inst`})}let r=t.kind===`SetOf`?t.element:t.body;return F(pe(n,O(0)),r)}case`Tquant`:return Ze(e,A({kind:`Quant`,quantifier:t.quantifier,bounds:t.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`Lambda`:return Ze(e,A({kind:`Quant`,quantifier:`Forall`,bounds:t.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`SetSt`:case`Choose`:if(n.length!==1){let r=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${n.length}.`;throw e(D(t.location,r)),new s(r,{failure:`Expr.Deref.deref_inst`})}return F(pe(n,O(0)),t.body);default:{let n=`Cannot instantiate non-binding expression`;throw e(D(t.location,n)),new s(n,{failure:`Expr.Deref.deref_inst`})}}},Qe=(e,t,n)=>{let r=(()=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:return n.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return n.names.map(e=>({name:e,shape:0}));case`Lambda`:return n.params;case`SetSt`:case`Choose`:return[{name:n.name,shape:0}];default:{let t=`Cannot abstract over bound variables in a non-binding expression`;throw e(D(n.location,t)),new s(t,{failure:`Expr.Deref.deref_at`})}}})(),i=F(Ye(t,r.length),n);return[r,Ze(e,i,Xe(r.length))]},$e=(e,t,n,r,i,a)=>{let o=t=>{if(!(r<=t))throw e(D(i.location,a)),new s(a,{failure:`Expr.Deref.deref_num`})},c=e=>(o(e.length),e[r-1]),l=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let t=`subexpression reference does not resolve to an expression`;throw e(D(n.location,t)),new s(t,{failure:`Expr.Deref.deref_num`})}let c=F(O(-(r-1)),a?a.expression:i.active);if(qe(c))throw e(D(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
10
- Tlapm does not handle yet such subexpression namings.`)),new s(`Subexpression of ASSUME/PROVE uses identifiers declared therein
11
-
12
- Tlapm does not handle yet such subexpression namings.`,{failure:`Expr.Deref.deref_num`});return[t,c]}case`Apply`:return[t,c(n.args)];case`With`:return $e(e,t,n.expression,r,i,a);case`If`:return[t,c([n.condition,n.consequent,n.alternative])];case`List`:return[t,c(n.items)];case`SetEnum`:case`Tuple`:return[t,c(n.elements)];case`Product`:return[t,c(n.factors)];case`Let`:return o(1),[[...t,...n.definitions],n.body];case`Quant`:case`SetOf`:case`Fcn`:return[t,c(n.bounds.flatMap(e=>e.domain.kind===`Domain`?[e.domain.expression]:[]))];case`Choose`:case`SetSt`:if(!n.domain)break;return[t,c([n.domain])];case`Arrow`:return[t,c([n.domain,n.range])];case`FcnApp`:{let e=n.args.length===1?n.args[0]:A({kind:`Tuple`,elements:n.args},n);return[t,c([n.function,e])]}case`Rect`:case`Record`:return[t,c(n.fields.map(e=>e.value))];case`Dot`:return[t,c([n.expression,A({kind:`String`,value:n.field},n)])];case`Except`:return[t,c([n.function,...n.specs.map(e=>e.value)])];case`Sub`:case`Tsub`:return[t,c([n.action,n.subscript])];case`Fair`:return[t,c([n.subscript,n.action])];case`Case`:return[t,c([...n.arms.map(e=>A({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...n.other?[A({kind:`Tuple`,elements:[Ue,n.other]},n.other)]:[]])]}let l=`Expression has no subexpressions`;throw e(D(n.location,l)),new s(l,{failure:`Expr.Deref.deref_num`})})();if(We(l[1])){let t=`Cannot resolve subexpression reference !${r}`;throw e(D(n.location,t)),new s(t,{failure:`Expr.Deref.deref_num`})}return l},et=(e,t)=>{let n=e.length,r=e;for(let e=n-1;e>=0;e--)r.includes(n-e)||(r=r.map(t=>t+e<n?t:t-1));return r.map(e=>t[n-e])},tt=(e,t,n,r,a)=>{let o=Je(n,r,[]);if(!o)return e(D(n.location,`Could not find label ${r}`)),{params:[],definitions:[],expression:Ue};let c=o.indices;if(c.length!==a.length&&a.length>0){let t=c.length===1?``:`s`,n=`Expected ${c.length} argument${t} for labelled reference !${r}, but found ${a.length}`;throw e(D(o.expression.location,n)),new s(n,{failure:`Expr.Deref.deref_lsub`})}let l=a.length===0?c.map(e=>({name:e.name,shape:0})):[],u=a.length===0?Xe(c.length):a,d=o.context.reduceRight((e,t)=>t.kind===`Defn`?A({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?A({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):F(O(-1),e),o.expression),f=F(Ye(t,l.length),d),p=[],m=f,h=et(c.map(e=>e.index),u);for(;h.length>0;)if(m.kind===`Let`&&m.definitions.length===1)p.push(m.definitions[0]),m=m.body,h=h.map(e=>F(O(1),e));else{if(m.kind!==`Quant`||m.bounds.length!==1)throw new i(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);m=F(fe(h[0],O(0)),m.body),h=h.slice(1)}return{params:l,definitions:p,expression:m}},nt=(e,t,n,r,i)=>{if(n.kind!==`Let`)throw e(D(n.location,`not a LET expression`)),new s(`not a LET expression`,{failure:`Expr.Deref.deref_letop`});let a=n.definitions.findIndex(e=>e.kind===`Operator`&&e.name===r),o=n.definitions[a];if(!o||o.kind!==`Operator`){let t=`no definition of operator ${r}`;throw e(D(n.location,t)),new s(t,{failure:`Expr.Deref.deref_letop`})}let c=o.body,l=c.kind===`Lambda`?A({...c,body:A({kind:`Parens`,expression:c.body,form:{kind:`Xlabel`,label:r,indices:c.params.map((e,t)=>({name:e.name,index:c.params.length-t}))}},c.body)},c):A({kind:`Parens`,expression:c,form:{kind:`Xlabel`,label:r,indices:[]}},c);return tt(e,t,A({kind:`Let`,definitions:n.definitions.slice(0,a),body:l},c),r,i)},rt=(e,t,n,r)=>{let[i,...a]=r;if(!i){let e=n.definitions.length===0?n.expression:A({kind:`Let`,definitions:n.definitions,body:n.expression},n.expression),t=n.params.length===0?e:A({kind:`Lambda`,params:n.params,body:e},e);return{...Ge(t),isAtomic:!0}}if(n.expression.isAtomic)return e(D(n.expression.location,`Expression has no subexpressions`)),Ue;let o=t?n.expression:Ke(n.expression),c=n.definitions.length,l=(()=>{let r=(t,r)=>{let[i,s]=$e(e,[],o,t,n.expression,r);return{params:[],definitions:i,expression:s,rest:a,isLabel:!1}};switch(i.kind){case`Down`:{let[n,...r]=a;if(o.kind===`Let`&&n?.kind===`Label`&&t)return{...nt(e,c,o,n.label,n.args),rest:r,isLabel:!0};if(t)return{params:[],definitions:[],expression:o,rest:a,isLabel:!1};throw new s(`!: is forbidden for this expression.
13
- `,{failure:`Expr.Deref.deref: !:`})}case`Number`:return r(i.value,`Cannot resolve !${i.value}`);case`Left`:return r(1,`Cannot resolve !<<`);case`Right`:return r(2,`Cannot resolve !>>`);case`Instance`:return{params:[],definitions:[],expression:Ze(e,o,i.args),rest:a,isLabel:!1};case`Label`:return{...o.kind===`Let`&&!t?nt(e,c,o,i.label,i.args):tt(e,c,o,i.label,i.args),rest:a,isLabel:!0};case`At`:{let[t,n]=Qe(e,c,o);return{params:t,definitions:[],expression:n,rest:a,isLabel:!1}}}})();return rt(e,l.isLabel,{params:[...n.params,...l.params],definitions:[...n.definitions,...l.definitions],expression:l.expression},l.rest.map(e=>Ie(e,e=>F(O(l.definitions.length),e))))},it=(e,t,n)=>{if(n.length>0)return{params:[],definitions:[],expression:Ze(e,t,n)};if(t.kind!==`Lambda`)return{params:[],definitions:[],expression:t};let[r,i]=Qe(e,0,t);return{params:r,definitions:[],expression:i}},at=(e,t,n,r)=>{let i=rt(e,!0,it(e,t,n),r);if(We(i)){let n=`Could not resolve subexpression reference`;throw e(D(t.location,n)),new s(n,{failure:`Expr.Anon: 2`})}return i},ot=e=>e.kind===`Named`?`<${e.level}>${e.label}`:`<${e.level}>`,st=e=>++e.value,ct={kind:`Fact`,expression:{kind:`At`,isExcept:!1},visibility:`Visible`},lt={Number:`1NUM`,Down:`1DOWN`,At:`1AT`,Instance:`1INST`,Left:`1`,Right:`1`},ut={kind:`Opaque`,name:`$badexp`},dt=(e,t,n)=>{let r,a=e=>e.scope?.size??0,o=(e,t)=>{if(t.kind===`At`&&t.isExcept)return r?I(a(e)-r.size,r.expression):t;if(t.kind!==`Except`)return f(e,t);let n=o(e,t.function);return t.specs.reduce((n,i)=>{let[s,c]=N(n,i.trail,(t,n)=>{if(n.kind===`Dot`)return[A({kind:`Dot`,expression:t,field:n.field},t),n];let r=o(e,n.expression);return[A({kind:`FcnApp`,function:t,args:[r]},t),{kind:`Apply`,expression:r}]}),l=r;r={expression:s,size:a(e)};let u=o(e,i.value);return r=l,A({kind:`Except`,function:n,specs:[{trail:c,value:u}]},t)},n)},c=(e,t,n)=>{let r=A({kind:`Ix`,index:e},n);return t.length===0?r:A({kind:`Apply`,operator:r,args:t},n)},l=(e,t,n,r,i)=>{if(t!==`Builtin`)return c(e,r,i);let a=I(e,n);return A(r.length===0?a:Ce(a,r),i)},u=(e,t,r,a)=>{let o=ve(e.scope,t);if(!o){let e=`Operator "${t}" not found`;throw n(D(a.location,e)),new s(e,{failure:`Expr.Anon: 4`})}let u=o.depth+1,d=o.hyp;switch(d.kind){case`Defn`:{let e=d.definition;if(e.kind===`Operator`)return l(u,d.whereDefined,e.body,r,a);if(e.kind===`Recursive`)throw new s(`Recursive operators not supported by TLAPS`,{failure:`Expr.Anon: Recursive`});return c(u,r,a)}case`Fresh`:return c(u,r,a);case`Flex`:return A({kind:`Ix`,index:u},a);case`Fact`:throw new i(`File "src/expr/e_anon.ml", line 230, characters 24-36: Assertion failed`)}},d=(e,t,r,i,a,c)=>{let u=ve(e.scope,t);if(!u){let[a,...l]=i;if(a?.kind===`Label`){let n=a.args.map(t=>o(e,t));return d(e,`${t}!${a.label}`,[...r,...n],l,!0,c)}let u=`Operator "${t}" not found`;throw a&&n(D(c.location,u)),new s(u,{failure:`Expr.Anon: ${a?lt[a.kind]:`1EMPTY`}`})}let f=u.hyp;if(f.kind!==`Defn`||f.definition.kind!==`Operator`&&f.definition.kind!==`Bpragma`)throw new s(`invalid subexpression reference`);let p=u.depth+1;if(i.length===0&&a)return r.length===0?A({kind:`Ix`,index:p},c):l(p,f.whereDefined,f.definition.body,r,c);let m=ft(I(p,f.definition.body),c);return ft(at(n,m,r,i),c)},f=(e,t)=>{switch(t.kind){case`Bang`:{let n=t.expression;if(n.kind===`Apply`&&n.operator.kind===`Opaque`){let r=t.selectors.map(t=>Ie(t,t=>o(e,t))),i=n.args.map(t=>o(e,t)),a={warnedSteps:[],scope:e.scope};return d(a,n.operator.name,i,r,!1,t)}return o(e,{...t,expression:A({kind:`Apply`,operator:n,args:[]},n)})}case`Apply`:{if(t.operator.kind!==`Opaque`)return _(e,t);let r=t.operator.name;if(e.warnedSteps.includes(r))return n({text:`${de(t.location)}Warning: ${r} does not introduce any assumptions. It does not make sense to use it here.\n`,channel:`toolbox`}),A({kind:`Internal`,builtin:`TRUE`},t);let i=t.args.map(t=>o(e,t));return u(e,r,i,t)}case`Opaque`:return o(e,A({kind:`Apply`,operator:t,args:[]},t));case`Parens`:return t.form.kind===`Syntax`?o(e,t.expression):{...t,expression:o(e,t.expression),form:p(e,t.form)};default:return _(e,t)}},p=(e,t)=>t.kind===`Nlabel`?{kind:`Xlabel`,label:t.label,indices:t.names.map(t=>{let n=ve(e.scope,t);if(!n)throw new s(`Identifier "${t}" in label parameters not found`);return{name:t,index:n.depth+1}})}:t,m=(e,t)=>({warnedSteps:e.warnedSteps,scope:t}),h=(e,t)=>m(e,M(e.scope,t)),g=(e,t)=>{let n=Fe(t,t=>o(e,t));return[n.reduce((e,t)=>h(e,P(t.name,t.level)),e),n]},_=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:b(e,t.sequent)[1]};if(t.kind===`Let`){let[n,r]=y(e,t.definitions);return{...t,definitions:r,body:o(n,t.body)}}return Be(e,t,o,h)},v=(e,t)=>{if(t.kind!==`Operator`)return t;let n=t.body;if(n.kind!==`Fcn`)return{...t,body:o(e,n)};let r=o(h(e,P(t.name,`Constant`)),n);if(R(F(fe({kind:`Opaque`,name:`%%%`},O(1)),r),r))return{...t,body:I(-1,r)};let i=j(`Eq`,[A({kind:`Ix`,index:1},r),r],r);return{...t,body:A({kind:`Choose`,name:t.name,domain:void 0,body:i},r)}},y=(e,n)=>{let r=e,i=[...n],a=[];for(let e=0;e<i.length;e++){let n=i[e];if(n.kind===`Instance`){i.splice(e+1,0,...t(r.scope,n));continue}let o=v(r,n);r=h(r,{kind:`Defn`,definition:o,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),a.push(o)}return[r,a]},ee=(e,t)=>{let n=(()=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:o(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:v(e,t.definition)};case`Fact`:return{...t,expression:o(e,t.expression)}}})();return[h(e,n),n]},b=(e,t)=>{let[n,r]=N(e,t.context,ee);return[n,{context:r,active:o(n,t.active)}]},x=(e,t)=>({warnedSteps:[ot(t),...e.warnedSteps],scope:e.scope}),S=(e,t,n,r)=>h(e,{kind:`Defn`,definition:{kind:`Operator`,name:ot(t),body:n,location:r.location},whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:r.location}),C=(e,t)=>m(e,ge(e.scope,Array.from({length:t},()=>ct))),te=e=>{let t=[...e.context.map((t,n)=>{let r=e.context.length-n+1;if(t.kind===`Fact`)return I(r,t.expression);if(t.kind!==`Fresh`||!t.domain)return ut;let i=j(`Mem`,[A({kind:`Ix`,index:0},t.domain),t.domain],t.domain);return I(r,i)}),I(1,e.active)];return t.length===1?t[0]:{kind:`Tuple`,elements:t}},ne=e=>e.kind!==`Use`&&e.kind!==`Hide`&&e.kind!==`Define`,w=(e,t)=>({facts:t.facts.map(t=>o(e,t)),defs:t.defs.flatMap(t=>{if(t.kind===`Dx`)return[t];let r=o(e,A({kind:`Opaque`,name:t.name},t));return r.kind===`Ix`?ye(e.scope,r.index-1)?.hyp.kind===`Defn`?[{kind:`Dx`,index:r.index,location:t.location}]:(n({text:`${de(t.location)}${JSON.stringify(t.name)} is not a definition and cannot be used in a DEF clause.`,channel:`toolbox`}),[]):(n({text:`${de(t.location)}Ignored unexpandable identifier ${JSON.stringify(t.name)} in BY DEF.`,channel:`stderr`}),[])})}),T=(e,t)=>{switch(t.kind){case`Steps`:{let[n,r]=N(e,t.steps,E),i=T(t.step?x(n,t.step):n,t.qed.proof);return{...t,steps:r,qed:{...t.qed,proof:i}}}case`By`:return{...t,usable:w(e,t.usable)};default:return t}},E=(t,n)=>{let r=n.step?.kind===`Unnamed`&&ne(n)?{kind:`Named`,level:n.step.level,label:`_a${st(e)}`,isAnonymous:!0}:n.step;if(!r)throw new i;let a={...n,step:r};switch(a.kind){case`Assert`:{let[,e]=b(t,a.sequent),n=e.context.reduce(h,t),i=C(S(C(n,1),r,A(te(e),a),a),1),o=e.context.length===0?x(i,r):i,s={...a,sequent:e,proof:T(o,a.proof)};return[C(S(t,r,A(he(e),a),a),1),s]}case`Pcase`:{let e=o(t,a.expression),n=A({kind:`Tuple`,elements:[I(2,e)]},a),i=C(S(C(t,2),r,n,a),1),s={...a,expression:e,proof:T(i,a.proof)},c=S(t,r,A({kind:`Tuple`,elements:[e]},a),a);return[C(c,1),s]}case`Suffices`:{let[,e]=b(t,a.sequent),n=A({kind:`Tuple`,elements:[A(he(e),a)]},a),i=C(S(t,r,n,a),1),o={...a,sequent:e,proof:T(i,a.proof)},s=e.context.reduce(h,t),c=A({kind:`Tuple`,elements:[A(te(e),a)]},a);return[C(S(C(s,1),r,c,a),1),o]}case`Have`:{let e=o(t,a.expression),n=A({kind:`Tuple`,elements:[I(2,e)]},a);return[C(S(C(t,2),r,n,a),1),{...a,expression:e}]}case`Take`:{let[e,n]=g(t,a.bounds),i=A({kind:`Quant`,quantifier:`Forall`,bounds:n,body:ut},a);return[C(S(C(e,1),r,i,a),1),{...a,bounds:n}]}case`Witness`:{let e=a.expressions.map(e=>o(t,e)),n=A({kind:`Tuple`,elements:e},a);return[C(S(C(t,1),r,n,a),1),{...a,expressions:e}]}case`Pick`:{let[e,n]=g(t,a.bounds),i=o(e,a.expression),s=A({kind:`Quant`,quantifier:`Exists`,bounds:n,body:i},a),c=x(C(S(C(t,1),r,s,a),1),r),l={...a,bounds:n,expression:i,proof:T(c,a.proof)},u=n.reduce((e,t)=>h(e,P(t.name,t.level)),C(t,2)),d=I(4+n.length,s);return[C(S(C(u,2),r,d,a),1),l]}case`Use`:{let e=w(t,a.usable);return[C(t,e.facts.length),{...a,usable:e}]}case`Hide`:return[t,{...a,usable:w(t,a.usable)}];case`Define`:{let[e,n]=y(t,a.definitions);return[e,{...a,definitions:n}]}case`Forget`:return[t,a]}};return{expr:(e,t)=>o({warnedSteps:[],scope:e},t),defn:(e,t)=>v({warnedSteps:[],scope:e},t),sequent:(e,t)=>b({warnedSteps:[],scope:e},t)[1],usable:(e,t)=>w({warnedSteps:[],scope:e},t),proof:(e,t)=>T({warnedSteps:[],scope:e},t)}},ft=(e,t)=>t.location?{...e,location:t.location}:e,pt=1000000010,mt=new TextEncoder,ht=e=>{for(let t=0;t<e.length;t++)if(e.charCodeAt(t)>127)return mt.encode(e).length;return e.length},gt=()=>({leftTotal:-1,element:{size:-1,token:{kind:`Text`,text:``},length:0}}),_t=()=>{let e={size:-1,token:{kind:`Begin`,indent:0,box:`hov`},length:0};return{queue:[e],queueStart:0,scanStack:[gt(),{leftTotal:1,element:e}],formatStack:[],margin:78,maxIndent:68,spaceLeft:78,currentIndent:0,isNewLine:!0,leftTotal:1,rightTotal:1,depth:1,output:[]}},vt=(e,t)=>{e.rightTotal+=t.length,e.queue.push(t)},yt=(e,t,n)=>{e.output.push(`
14
- `),e.isNewLine=!0,e.currentIndent=Math.min(e.maxIndent,e.margin-n+t),e.spaceLeft=e.margin-e.currentIndent,e.output.push(` `.repeat(e.currentIndent))},bt=(e,t)=>{e.spaceLeft-=t,e.output.push(` `.repeat(t))},xt=e=>{let t=e.formatStack.at(-1);t?t.width>e.spaceLeft&&t.box!==`fits`&&t.box!==`h`&&yt(e,0,t.width):e.output.push(`
15
- `)},St=(e,t,n)=>{switch(n.kind){case`Text`:e.spaceLeft-=t,e.output.push(n.text),e.isNewLine=!1;return;case`Begin`:{e.margin-e.spaceLeft>e.maxIndent&&xt(e);let r=e.spaceLeft-n.indent,i=n.box===`v`||t>e.spaceLeft?n.box:`fits`;e.formatStack.push({box:i,width:r});return}case`End`:e.formatStack.pop();return;case`Newline`:{let t=e.formatStack.at(-1);t?yt(e,0,t.width):e.output.push(`
16
- `);return}case`Break`:{let r=e.formatStack.at(-1);if(!r)return;let i=r.width;switch(r.box){case`hov`:t>e.spaceLeft?yt(e,n.offset,i):bt(e,n.width);return;case`b`:e.isNewLine?bt(e,n.width):t>e.spaceLeft||e.currentIndent>e.margin-i+n.offset?yt(e,n.offset,i):bt(e,n.width);return;case`hv`:case`v`:yt(e,n.offset,i);return;case`fits`:case`h`:bt(e,n.width);return}}}},Ct=e=>{for(;e.queueStart<e.queue.length;){let t=e.queue[e.queueStart],n=t.size>=0;if(!n&&e.rightTotal-e.leftTotal<e.spaceLeft)return;e.queueStart++,St(e,n?t.size:pt,t.token),e.leftTotal+=t.length}e.queue.length=0,e.queueStart=0},wt=(e,t)=>{vt(e,t),Ct(e)},Tt=(e,t)=>{let n=e.scanStack.at(-1);n&&(n.leftTotal<e.leftTotal?e.scanStack=[gt()]:n.element.token.kind===(t?`Break`:`Begin`)&&(n.element.size=e.rightTotal+n.element.size,e.scanStack.pop()))},Et=(e,t,n)=>{vt(e,n),t&&Tt(e,!0),e.scanStack.push({leftTotal:e.rightTotal,element:n})},Dt=(e,t,n)=>{e.depth++,Et(e,!1,{size:-e.rightTotal,token:{kind:`Begin`,indent:n,box:t},length:0})},Ot=e=>{e.depth<=1||(vt(e,{size:0,token:{kind:`End`},length:0}),Tt(e,!0),Tt(e,!1),e.depth--)},kt=(e,t,n)=>wt(e,{size:t,token:{kind:`Text`,text:n},length:t}),At=(e,t,n)=>Et(e,!0,{size:-e.rightTotal,token:{kind:`Break`,width:t,offset:n},length:t}),jt=e=>wt(e,{size:0,token:{kind:`Newline`},length:0}),Mt=e=>{for(;e.depth>1;)Ot(e);return e.rightTotal=pt,Ct(e),e.output.join(``)},Nt=e=>{Mt(e);let t=[...e.output,`
17
- `];Object.assign(e,_t()),e.output=t},Pt={h:`h`,v:`v`,hv:`hv`,hov:`hov`,b:`b`},Ft=e=>({kind:`Text`,text:e,size:ht(e)}),z=e=>e===``?[]:[Ft(e)],It={kind:`Break`,width:1,offset:0},Lt={kind:`Break`,width:0,offset:0},Rt=e=>{let t=e.search(/\d|$/);return{kind:`Open`,box:Pt[e.slice(0,t)],indent:Number(e.slice(t)||0)}},B=(e,...t)=>{let n=[],r=0,i=``,a=()=>{i!==``&&(n.push(Ft(i)),i=``)};for(let o=0;o<e.length;o++){let s=e[o];if(s===`%`){a();let e=t[r++];typeof e==`string`?e!==``&&n.push(Ft(e)):n.push(e),o++}else if(s!==`@`)i+=s;else switch(a(),e[o+1]){case`[`:{if(e[o+2]!==`<`){n.push({kind:`Open`,box:`b`,indent:0}),o++;break}let t=e.indexOf(`>`,o);n.push(Rt(e.slice(o+3,t))),o=t;break}case`]`:n.push({kind:`Close`}),o++;break;case` `:n.push(It),o++;break;case`,`:n.push(Lt),o++;break;case`
18
- `:n.push({kind:`Newline`}),o++;break;case`.`:n.push({kind:`Flush`}),o++;break;case`;`:{let t=e.indexOf(`>`,o),r=e.slice(o+3,t).split(` `);n.push({kind:`Break`,width:Number(r[0]),offset:Number(r[1])}),o=t;break}case`<`:{let i=e.indexOf(`>`,o);n.push({kind:`Text`,text:String(t[r++]),size:Number(e.slice(o+2,i))}),o=i+2;break}}}return a(),n},V=(e,t,n=[Ft(`,`),It])=>e.flatMap((e,r)=>r===0?[t(e)]:[n,t(e)]),zt=(e,t)=>{for(let n of t)if(Array.isArray(n))zt(e,n);else switch(n.kind){case`Open`:Dt(e,n.box,n.indent);break;case`Close`:Ot(e);break;case`Text`:kt(e,n.size,n.text);break;case`Break`:At(e,n.width,n.offset);break;case`Newline`:jt(e);break;case`Flush`:Nt(e)}},Bt=e=>{let t=_t();return zt(t,e),Mt(t)},Vt=[[`=>`,1,1,`InfixNon`,[]],[`<=>`,2,2,`InfixNon`,[`\\equiv`]],[`/\\`,3,3,`InfixLeft`,[`\\land`]],[`\\/`,3,3,`InfixLeft`,[`\\lor`]],[`~`,4,4,`Prefix`,[`\\neg`,`\\lnot`]],[`=`,5,5,`InfixNon`,[]],[`#`,5,5,`InfixNon`,[`/=`]],[`SUBSET`,8,8,`Prefix`,[]],[`UNION`,8,8,`Prefix`,[]],[`DOMAIN`,9,9,`Prefix`,[]],[`\\subseteq`,5,5,`InfixNon`,[]],[`\\in`,5,5,`InfixNon`,[]],[`\\notin`,5,5,`InfixNon`,[]],[`\\`,8,8,`InfixNon`,[]],[`\\cap`,8,8,`InfixLeft`,[`\\intersect`]],[`\\cup`,8,8,`InfixLeft`,[`\\union`]],[`\\X`,10,13,`Prefix`,[`\\times`]],[`'`,15,15,`Postfix`,[]],[`~>`,2,2,`InfixNon`,[`\\leadsto`]],[`ENABLED`,4,15,`Prefix`,[]],[`UNCHANGED`,4,15,`Prefix`,[]],[`\\cdot`,5,14,`InfixLeft`,[]],[`-+->`,2,2,`InfixNon`,[]],[`[]`,4,15,`Prefix`,[]],[`<>`,4,15,`Prefix`,[]],[`^`,14,14,`InfixNon`,[]],[`/`,13,13,`InfixNon`,[]],[`*`,13,13,`InfixLeft`,[]],[`-.`,12,12,`Prefix`,[`-`]],[`-`,11,11,`InfixLeft`,[]],[`+`,10,10,`InfixLeft`,[]],[`^+`,15,15,`Postfix`,[]],[`^*`,15,15,`Postfix`,[]],[`^#`,15,15,`Postfix`,[]],[`<`,5,5,`InfixNon`,[]],[`=<`,5,5,`InfixNon`,[`<=`,`\\leq`]],[`>`,5,5,`InfixNon`,[]],[`>=`,5,5,`InfixNon`,[`\\geq`]],[`...`,9,9,`InfixNon`,[]],[`..`,9,9,`InfixNon`,[]],[`|`,10,11,`InfixLeft`,[]],[`||`,10,11,`InfixLeft`,[]],[`&&`,13,13,`InfixLeft`,[]],[`&`,13,13,`InfixLeft`,[]],[`$$`,9,13,`InfixLeft`,[]],[`$`,9,13,`InfixLeft`,[]],[`??`,9,13,`InfixLeft`,[]],[`%%`,10,11,`InfixLeft`,[]],[`%`,10,11,`InfixLeft`,[`\\mod`]],[`##`,9,13,`InfixLeft`,[]],[`++`,10,10,`InfixLeft`,[]],[`--`,11,11,`InfixLeft`,[]],[`**`,13,13,`InfixLeft`,[]],[`//`,13,13,`InfixNon`,[]],[`^^`,14,14,`InfixNon`,[]],[`@@`,6,6,`InfixLeft`,[]],[`!!`,9,13,`InfixNon`,[]],[`|-`,5,5,`InfixNon`,[]],[`|=`,5,5,`InfixNon`,[]],[`-|`,5,5,`InfixNon`,[]],[`=|`,5,5,`InfixNon`,[]],[`<:`,7,7,`InfixNon`,[]],[`:>`,7,7,`InfixNon`,[]],[`:=`,5,5,`InfixNon`,[]],[`::=`,5,5,`InfixNon`,[]],[`(+)`,10,10,`InfixLeft`,[`\\oplus`]],[`(-)`,11,11,`InfixLeft`,[`\\ominus`]],[`(.)`,13,13,`InfixLeft`,[`\\odot`]],[`(/)`,13,13,`InfixNon`,[`\\oslash`]],[`(\\X)`,13,13,`InfixLeft`,[`\\otimes`]],[`\\uplus`,9,13,`InfixLeft`,[]],[`\\sqcap`,9,13,`InfixLeft`,[]],[`\\sqcup`,9,13,`InfixLeft`,[]],[`\\div`,13,13,`InfixNon`,[]],[`\\wr`,9,14,`InfixNon`,[]],[`\\star`,13,13,`InfixLeft`,[]],[`\\o`,13,13,`InfixLeft`,[`\\circ`]],[`\\bigcirc`,13,13,`InfixLeft`,[]],[`\\bullet`,13,13,`InfixLeft`,[]],[`\\prec`,5,5,`InfixNon`,[]],[`\\succ`,5,5,`InfixNon`,[]],[`\\preceq`,5,5,`InfixNon`,[]],[`\\succeq`,5,5,`InfixNon`,[]],[`\\sim`,5,5,`InfixNon`,[]],[`\\simeq`,5,5,`InfixNon`,[]],[`\\ll`,5,5,`InfixNon`,[]],[`\\gg`,5,5,`InfixNon`,[]],[`\\asymp`,5,5,`InfixNon`,[]],[`\\subset`,5,5,`InfixNon`,[]],[`\\supset`,5,5,`InfixNon`,[]],[`\\supseteq`,5,5,`InfixNon`,[]],[`\\approx`,5,5,`InfixNon`,[]],[`\\cong`,5,5,`InfixNon`,[]],[`\\sqsubset`,5,5,`InfixNon`,[]],[`\\sqsubseteq`,5,5,`InfixNon`,[]],[`\\sqsupset`,5,5,`InfixNon`,[]],[`\\sqsupseteq`,5,5,`InfixNon`,[]],[`\\doteq`,5,5,`InfixNon`,[]],[`\\propto`,5,5,`InfixNon`,[]]],Ht=/* @__PURE__ */ new Map;for(let[e,t,n,r,i]of Vt){let a={name:e,low:t,high:n,fixity:r};for(let t of[e,...i])Ht.set(t,a)}const Ut=e=>({name:e,low:-1,high:-1,fixity:`Nonfix`}),H=e=>Ht.get(e)??Ut(e),Wt={Implies:`=>`,Equiv:`<=>`,Conj:`/\\`,Disj:`\\/`,Neg:`~`,Eq:`=`,Neq:`#`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,Subseteq:`\\subseteq`,Mem:`\\in`,Notmem:`\\notin`,Setminus:`\\`,Cap:`\\cap`,Cup:`\\cup`,Prime:`'`,StrongPrime:`'`,Leadsto:`~>`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,Cdot:`\\cdot`,Actplus:`-+->`,BoxTrue:`[]`,BoxFalse:`[]`,Diamond:`<>`,Plus:`+`,Minus:`-`,Times:`*`,Ratio:`/`,Quotient:`\\div`,Remainder:`%`,Exp:`^`,Lteq:`=<`,Lt:`<`,Gteq:`>=`,Gt:`>`,Range:`..`,Cat:`\\o`,OneArg:`:>`,Extend:`@@`},Gt=e=>{if(e===`Divides`)return{name:`?|`,low:10,high:11,fixity:`InfixNon`};if(e===`Uminus`)return{...H(`-.`),name:`-`};let t=Wt[e];return t?H(t):Ut(e)},Kt=e=>e.salt===0?e.rep:`${e.rep}_${e.salt}`,qt=()=>({stack:[],idents:/* @__PURE__ */ new Map,defined:/* @__PURE__ */ new Map}),U=(e,t)=>{let n=e.idents.get(t)?.at(-1),r=n?{rep:t,salt:n.salt+1}:{rep:t,salt:0};for(;e.defined.has(Kt(r));)r={rep:t,salt:r.salt+1};e.stack.push(r);let i=e.idents.get(t);i?i.push(r):e.idents.set(t,[r]);let a=Kt(r);return e.defined.set(a,(e.defined.get(a)??0)+1),a},Jt=(e,t)=>{for(let n=0;n<t;n++){let t=e.stack.pop();if(!t)return;e.idents.get(t.rep)?.pop();let n=Kt(t),r=(e.defined.get(n)??1)-1;r===0?e.defined.delete(n):e.defined.set(n,r)}},Yt=(e,t,n)=>{let r=n(t.map(t=>U(e,t)));return Jt(e,t.length),r},Xt=(e,t)=>t.kind===`Atm`||t.kind===`Op`&&e<t.low,Zt=e=>[B(`(`),e,B(`)`)],Qt=(e,t)=>t?W(e):Zt(W(e)),W=e=>{if(e.kind!==`Op`)return e.doc;let t=e.skeleton,n=t=>Xt(e.high,t);switch(t.kind){case`Prefix`:case`Postfix`:{let r=t.operand,i=Qt(r,n(r)||r.kind===`Op`&&r.skeleton.kind===t.kind),a=t.kind===`Prefix`?[e.doc,i]:[i,e.doc];return[B(`@[<h>`),...a,B(`@]`)]}case`Infix`:{let r=t.left,i=t.right,a=n(r)||r.kind===`Op`&&r.name===e.name&&t.assoc===`Left`,o=n(i)||t.assoc===`Right`&&i.kind===`Op`&&i.skeleton.kind===`Infix`&&i.skeleton.assoc===`Right`;return[B(`@[<b0>`),Qt(r,a),e.doc,Qt(i,o),B(`@]`)]}}},G=e=>({kind:`Atm`,doc:e}),K=e=>({kind:`Big`,doc:e}),$t=e=>e.kind===`Lambda`?$t(e.body):e.kind===`Sequent`?$t(e.sequent.active):e.kind===`With`,en=e=>{if(e.kind===`Defn`){let t=e.definition,n=t.kind===`Operator`&&$t(t.body);return e.visibility===`Hidden`||n||e.whereDefined!==`User`}return e.kind===`Fact`?e.visibility===`Hidden`||$t(e.expression):!1},tn=e=>e===0?[]:B(`@[<hov1>(%a)@]`,V(Array.from({length:e},()=>`_`),z)),nn=e=>B(`%s%a`,e.name,tn(e.shape)),rn={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`UNKNOWN`},an=(e=[])=>{let t=qt(),n=e=>W(u(e)),r=(e,r)=>Yt(t,e.map(e=>e.name),()=>B(`@[<b2>LAMBDA @[<hv0>%a@] :@ %a@]`,V(e,nn),n(r))),i=(e,r)=>{let i=e.map(e=>e.domain.kind===`Domain`?n(e.domain.expression):void 0);return Yt(t,e.map(e=>e.name),t=>{let n=[];return e.forEach((e,r)=>{r>0&&e.domain.kind===`Ditto`?n.at(-1)?.names.push(t[r]):n.push({names:[t[r]],index:r})}),r(V(n,t=>{let n=V(t.names,z),r=e[t.index].domain;return r.kind===`NoDomain`?n:r.kind===`Ditto`?B(`@[<hov0>%a@ \\in ??????@]`,n):B(`@[<hov0>%a@ \\in %a@]`,n,i[t.index]??[])}))})},a=e=>{switch(e.kind){case`Down`:return B(`:`);case`Left`:return B(`<<`);case`Right`:return B(`>>`);case`At`:return z(`@`);case`Number`:return z(String(e.value));case`Instance`:return B(`@[<b1>(%a)@]`,V(e.args,n));case`Label`:return e.args.length===0?z(e.label):B(`@[<b2>%s@,@[<b1>(%a)@]@]`,e.label,V(e.args,n))}},o=e=>e.length===0?[]:[B(`!`),V(e,a,B(`!`))],c=n=>{if(n<0)return`#$$${Math.abs(n)}`;if(n===0)return`#$0`;if(n<=t.stack.length)return Kt(t.stack[t.stack.length-n]);let r=e[e.length-(n-t.stack.length)];return r?me(r)??`??? FACT ???`:`#$${n}`},l=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Op`,name:` `,doc:B(`@ `),low:20,high:20,skeleton:{kind:`Infix`,assoc:`Left`,left:K(r(e.params,e.body)),right:G(B(`(%a)`,V(t,n)))}};if(e.kind===`Bang`)return t.length===0?u(e):G(B(`@[<b2>%a@[<b1>(%a)@]@]`,n(e),V(t,n)));if(e.kind===`Internal`&&t.length===1){if(e.builtin===`BoxFalse`||e.builtin===`Unprimable`)return u(t[0]);if(e.builtin===`Irregular`)return G(B(`@[<h>@<1>%s%a@<1>%s@]`,`<[`,n(t[0]),`]>`))}let i=(()=>{switch(e.kind){case`Ix`:return H(c(e.index));case`Opaque`:{let t=H(e.name);return{...t,name:`?${t.name}`}}case`Internal`:return Gt(e.builtin);default:throw new s(`Cannot print this operator`)}})(),a=(e,t)=>({kind:`Op`,name:i.name,doc:e,low:i.low,high:i.high,skeleton:t});if(t.length===0)return G(z(i.name));if(i.fixity===`Nonfix`)return G(B(`@[<b2>%s@[<b1>(%a)@]@]`,i.name,V(t,n)));if(i.fixity===`Prefix`&&t.length===1)return a(/[A-Za-z]$/.test(i.name)?B(`%s@ `,i.name):z(i.name),{kind:`Prefix`,operand:u(t[0])});if(i.fixity===`Postfix`&&t.length===1)return a(z(i.name),{kind:`Postfix`,operand:u(t[0])});if(i.fixity.startsWith(`Infix`)&&t.length===2){let e=i.fixity===`InfixLeft`?`Left`:i.fixity===`InfixRight`?`Right`:`Non`;return a(i.name===`..`?z(i.name):B(`@ %s `,i.name),{kind:`Infix`,assoc:e,left:u(t[0]),right:u(t[1])})}throw new s(`Arity mismatch for operator ${i.name}`)},u=e=>{switch(e.kind){case`Ix`:case`Opaque`:case`Internal`:return l(e,[]);case`Lambda`:return K(r(e.params,e.body));case`Bang`:return G([n(e.expression),o(e.selectors)]);case`Apply`:return l(e.operator,e.args);case`Sequent`:return K(p(e.sequent));case`With`:return u(e.expression);case`If`:return K(B(`@[<hv2>@[<b2>IF@ %a@]@ @[<b2>THEN %a@]@ @[<b2>ELSE %a@]@]`,n(e.condition),n(e.consequent),n(e.alternative)));case`List`:{if(e.bullet===`Refs`&&e.items.length===0)return G(B(`TRUE`));if(e.bullet===`Refs`&&e.items.length===1)return u(e.items[0]);let t=e.bullet===`Or`?`\\/`:`/\\`;return K(B(`@[<v0>%a@]`,V(e.items,e=>B(`@[<h>%s %a@]`,t,n(e)),B(`@,`))))}case`Let`:{let r=V(e.definitions,d,B(`@,`)),i=n(e.body);return Jt(t,e.definitions.length),K([B(`@[<hv0>LET @[<v0>`),r,B(`@]@
19
- IN %a@]`,i)])}case`Quant`:return i(e.bounds,t=>K(B(`@[<b3>%s @[<b0>%a@] :@ %a@]`,e.quantifier===`Forall`?`\\A`:`\\E`,t,n(e.body))));case`Tquant`:return Yt(t,e.names,t=>K(B(`@[<b4>%s @[<b0>%a@] : %a@]`,e.quantifier===`Forall`?`\\AA`:`\\EE`,V(t,z),n(e.body))));case`Choose`:{let r=e.domain&&n(e.domain);return Yt(t,[e.name],([t])=>K(r?B(`@[<b2>CHOOSE @[<b2>%s \\in@ %a@] :@ %a@]`,t,r,n(e.body)):B(`@[<b2>CHOOSE %s :@ %a@]`,t,n(e.body))))}case`SetSt`:{let r=n(e.domain);return Yt(t,[e.name],([t])=>G(B(`@[<b3>{@[<b2>%s \\in@ %a@] :@ %a}@]`,t,r,n(e.body))))}case`SetOf`:return i(e.bounds,t=>G(B(`@[<b3>{%a :@ %a}@]`,n(e.element),t)));case`SetEnum`:return G(B(`@[<h>{@[<b0>%a@]}@]`,V(e.elements,n)));case`Arrow`:return G(B(`@[<b3>[%a ->@ %a]@]`,n(e.domain),n(e.range)));case`Fcn`:return i(e.bounds,t=>G(B(`@[<b3>[%a |->@ %a]@]`,t,n(e.body))));case`FcnApp`:{let t=u(e.function),r=t.kind===`Atm`;return G(B(`@[<h>%s%a%s@[<b1>[%a]@]@]`,r?``:`(`,W(t),r?``:`)`,V(e.args,n)))}case`Product`:if(e.factors.length===1)return u(e.factors[0]);if(e.factors.length===0)throw new s(`Expr.Fmt.fmt_expr: PRODUCT []`);return{kind:`Op`,name:`\\X`,doc:B(`@ \\X `),low:10,high:13,skeleton:{kind:`Infix`,assoc:`Right`,left:u(e.factors[0]),right:u({...e,factors:e.factors.slice(1)})}};case`Tuple`:return G(B(`@[<b2><<%a>>@]`,V(e.elements,n)));case`Rect`:return G(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s : %a@]`,e.name,n(e.value)))));case`Record`:return G(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s |-> %a@]`,e.name,n(e.value)))));case`Except`:return G(B(`@[<b3>[%a EXCEPT@ @[<v0>%a@]]@]`,n(e.function),V(e.specs,e=>B(`!@[<h>%a = %a@]`,e.trail.map(e=>e.kind===`Dot`?B(`.%s`,e.field):B(`[%a]`,n(e.expression))),n(e.value)))));case`Dot`:return{kind:`Op`,name:`.`,doc:B(`.`),low:16,high:16,skeleton:{kind:`Infix`,assoc:`Left`,left:u(e.expression),right:G(z(e.field))}};case`Sub`:case`Tsub`:{let t=e.modal===`Box`,r=e.kind===`Sub`?t?`[`:`<<`:t?`[][`:`<><<`;return G(B(`@[<h>%s@[<b2>%a@]%s%a@]`,r,n(e.action),t?`]_`:`>>_`,n(e.subscript)))}case`Fair`:return K(B(`@[<h>%s_%a (%a)@]`,e.fairness===`Weak`?`WF`:`SF`,Zt(n(e.subscript)),n(e.action)));case`Case`:return K(B(`@[<v2>CASE %a%a@]`,V(e.arms,e=>B(`@[<b2>%a ->@ %a@]`,n(e.condition),n(e.body)),B(`@,[] `)),e.other?B(`@,[] @[<b2>OTHER ->@ %a@]`,n(e.other)):[]));case`String`:return G(B(`"%s"`,e.value));case`Num`:return G(z(e.fraction===``?e.integer:`${e.integer}.${e.fraction}`));case`At`:return G(z(`@`));case`Parens`:{let n=e.form;if(n.kind===`Syntax`)return u(e.expression);let r=n.kind===`Nlabel`?n.names:n.indices.map(e=>e.index>=1&&e.index<=t.stack.length?c(e.index):`¶${e.index}`),i=u(e.expression);if(r.length===0){let e=i.kind===`Op`?`%s::(%a)`:`%s::%a`;return G(B(e,n.label,W(i)))}let a=V(r,z);return i.kind===`Atm`?G(B(`%s(%a)::%a`,n.label,a,W(i))):i.kind===`Big`?G(B(`%s(%a)::(%a)`,n.label,a,W(i))):G(B(`(%s(%a):: %a)`,n.label,a,W(i)))}}},d=e=>{switch(e.kind){case`Operator`:case`Bpragma`:{let r=e.body;if(r.kind===`Lambda`){let i=Yt(t,r.params.map(e=>e.name),()=>n(r.body)),a=U(t,e.name);return B(`@[<b2>%s@[<b1>(%a)@] ==@ %a@]`,a,V(r.params,nn),i)}let i=n(r);return B(`@[<b2>%s ==@ %a@]`,U(t,e.name),i)}case`Instance`:{let r=e.instance,i=Yt(t,r.args,e=>({doc:B(`@[<b2>INSTANCE %s%a@]`,r.module,r.substitutions.length===0?[]:B(`@ WITH@ %a`,V(r.substitutions,e=>B(`@[<b2>%s <- %a@]`,e.name,n(e.expression))))),args:e})),a=U(t,e.name),o=r.args.length===0?z(a):B(`%s (@[<b0>%a@])`,a,V(i.args,z));return B(`@[<b2>%a == %a@]`,o,i.doc)}case`Recursive`:{let n=U(t,e.name);return B(`@[<b2>NEW CONSTANT %s%a@]`,n,tn(e.shape))}}},f=e=>{switch(e.kind){case`Fresh`:{let r=e.domain&&e.domainVisibility===`Visible`?n(e.domain):void 0,i=U(t,e.name);return[B(`NEW %s %s%a`,rn[e.level],i,tn(e.shape)),r?B(` \\in %a`,r):[]]}case`Flex`:return B(`NEW VARIABLE %s`,U(t,e.name));case`Defn`:return d(e.definition);case`Fact`:{let r=B(`@[<h>%a @]`,n(e.expression));return U(t,``),r}}},p=e=>{if(e.context.length===0)return n(e.active);let r=[];for(let n of e.context)en(n)?U(t,me(n)??``):r.push(f(n));let i=n(e.active);return Jt(t,e.context.length),r.length===0?i:[B(`@[<v0>ASSUME @[<v0>`),V(r,e=>e),B(`@]@
20
- PROVE %a@]`,i)]};return{printSequent:p,printExpr:n}},on=(e,t)=>an(e).printExpr(t),sn=e=>{let t=an();return Bt(B(`@[<b0>%a@]`,t.printSequent(e))).trimEnd()},cn={kind:`At`,isExcept:!1},q=e=>({location:e.location,step:e.step,isSuppressed:e.isSuppressed}),ln=e=>e?.kind===`Named`&&e.isAnonymous,un=e=>e?.level??0,dn=e=>A({kind:`Internal`,builtin:`TRUE`},e),fn=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t&&e.args.length===2,pn=(e,...t)=>Bt(B(e,...t)),mn=e=>hn(e).map((e,t)=>{let n=e.domain.kind===`Domain`?I(t,e.domain.expression):void 0;return{kind:`Fresh`,name:e.name,shape:0,level:n?`Constant`:e.level,domain:n,domainVisibility:`Visible`}}),hn=e=>{let t={kind:`NoDomain`};return e.map(e=>e.domain.kind===`Ditto`?{...e,domain:t}:(t=e.domain,e))},gn=(e,t)=>t.context.flatMap((n,r)=>n.kind===`Fact`&&n.visibility===`Visible`?[I(e+t.context.length-1-r,n.expression)]:[]),_n=(e,t)=>{if(!e.step)throw new i;return{kind:`Defn`,definition:{kind:`Operator`,name:ot(e.step),body:t,location:e.location},whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:e.location}},vn=(e,t,n)=>{let r=ln(n.step)?`Visible`:`Hidden`,i=t.context.map(e=>e.kind===`Fact`?{...e,visibility:r}:e),a=A({kind:`List`,bullet:`Refs`,items:gn(2,t)},n);return{context:[...e,...i,{kind:`Fact`,expression:dn(n),visibility:`Hidden`,location:n.location},_n(n,a),{kind:`Fact`,expression:A({kind:`Ix`,index:1},n),visibility:`Hidden`,location:n.location}],active:I(3,t.active)}},yn=(e,t,n,r,i)=>{let a=e||ln(i.step)?`Visible`:`Hidden`;return{context:[...t,_n(i,A(he(r),i)),{kind:`Fact`,expression:A({kind:`Ix`,index:1},i),visibility:a,location:i.location}],active:I(2,n)}},bn=(e,t,n)=>{if(n.kind!==`Dx`)throw new s(`Unknown definition ${n.name}`);let r=t.length-n.index,i=t[r];if(!i)return t;if(i.kind!==`Defn`)throw new s(`Indicated point is not a definition`);return t.map((t,n)=>n===r?{...i,visibility:e}:t)},xn=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Mem`&&e.args[0]?.kind===`Ix`&&e.args[0].index===0&&R(t,e.args[1]),Sn=(e,t,n,r)=>{let i=!1,a=n,o=[...r];for(let e=r.length-1;e>=0;e--){a=I(-1,a);let n=r[e];n.kind===`Fact`&&R(n.expression,a)?(i=!0,o[e]={...n,visibility:t}):n.kind===`Fresh`&&n.domain&&xn(a,n.domain)&&(i=!0,o[e]={...n,domainVisibility:t})}if(!i){let t=`This expression does not appear in the context and cannot be hidden.`;throw e(D(n.location,`${t}\n`)),new s(t,{failure:`proof.Gen.set_expr`})}return o},Cn=(e,t)=>{let n=Te(O(1),t)[1];return n[0].domain.kind===`Ditto`&&e.domain.kind===`Domain`?[{...n[0],domain:{kind:`Domain`,expression:I(1,e.domain.expression)}},...n.slice(1)]:n},wn=(e,t)=>{if(e.isSuppressed||t.length===0)return{kind:`Obvious`,...q(e)};let n=t.map((e,t)=>{let n=I(2*t+2,e);return{kind:`Assert`,sequent:{context:[],active:n},proof:{kind:`By`,usable:{facts:[I(3,n)],defs:[]},isOnly:!1,location:e.location},location:e.location}}),r={kind:`By`,usable:{facts:[A({kind:`Ix`,index:2*t.length+2},e),...t.map((n,r)=>A({kind:`Ix`,index:2*(t.length-r)},e))],defs:[]},isOnly:!0,...q(e)};return{kind:`Steps`,steps:n,qed:{proof:r,location:r.location},...q(e)}},Tn=(e,t,n)=>({sequent:e,location:t.location,kind:n}),En={total:0,absent:[],omitted:[]},Dn=(e,t)=>({total:e.total+t.total,absent:[...e.absent,...t.absent],omitted:[...e.omitted,...t.omitted]}),On=e=>{switch(e.kind){case`Use`:return{...En,total:e.obligations?.length??0};case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return kn(e.proof);default:return En}},kn=e=>e.kind===`Steps`?[...e.steps.map(On),kn(e.qed.proof)].reduce(Dn):e.kind!==`Omitted`||!e.obligations||!e.location?{...En,total:e.obligations?.length??0}:{total:e.obligations.length,absent:e.omission===`Implicit`?[e.location]:[],omitted:e.omission===`Explicit`?[e.location]:[]},An=(e,t)=>e.kind===`At`&&!e.isExcept?A(we(t),e):Ve(e,e=>An(e,t)),jn=(e,t,n,r)=>{let i=(e,r)=>{let o=r.location;if(!o||!t.has(o.file)||o.endLine<n.start||o.startLine>n.end)return r;switch(r.kind){case`Obvious`:return{...r,obligations:[Tn(e,r,{kind:`Main`})]};case`Omitted`:return{...r,obligations:[Tn(e,r,{kind:`Omitted`,omission:r.omission})]};case`Error`:return{...r,obligations:[Tn(e,r,{kind:`Error`,message:r.message})]};case`By`:throw new s(`Proof.Gen.generate`);case`Steps`:{let[t,n]=N(e,r.steps,a),o=i(t,r.qed.proof);return{...r,steps:n,qed:{...r.qed,proof:o}}}}},a=(e,t)=>{switch(t.kind){case`Forget`:{let n=e.context.length,r=e.context.map((e,r)=>e.kind===`Fact`&&e.visibility===`Visible`&&t.count+r<n?{...e,visibility:`Hidden`}:e);return[{...e,context:r},t]}case`Use`:{let n=t.usable;if(n.defs.length===0&&n.facts.length===1){let r=n.facts[0],i=Tn({...e,active:r},t,{kind:`Support`});return[{context:[...e.context,{kind:`Fact`,expression:r,visibility:`Visible`,location:r.location}],active:I(1,e.active)},{...t,obligations:[i]}]}if(n.facts.length>0)throw new s(`Proof.Gen.gen_step: USE with facts and definitions`);let r=n.defs.reduce((e,t)=>bn(`Visible`,e,t),e.context);return[{...e,context:r},t]}case`Hide`:{let n=t.usable.defs.reduce((e,t)=>bn(`Hidden`,e,t),e.context),i=t.usable.facts.reduceRight((e,t)=>Sn(r,`Hidden`,t,e),n);return[{...e,context:i},t]}case`Define`:return[{context:[...e.context,...t.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0,location:e.location}))],active:I(t.definitions.length,e.active)},t];case`Assert`:{let n=i(vn(e.context,t.sequent,t),t.proof),r={...t,proof:n};return[yn(!1,e.context,e.active,t.sequent,r),r]}case`Suffices`:{let n=i(yn(!0,e.context,e.active,t.sequent,t),t.proof),r={...t,proof:n};return[vn(e.context,t.sequent,r),r]}default:throw new s(`Proof.Gen.gen_step`)}},o=(e,t,n,r)=>{let i={kind:`Unnamed`,level:0,id:0},[o,s]=a({context:e,active:{...cn,location:r}},t===`Use`?{kind:`Use`,usable:n,isOnly:!1,location:r,step:i}:{kind:`Hide`,usable:n,location:r,step:i});return[o.context,s.obligations??[]]},c=(e,t,n,r)=>{if(n.defs.length===0&&n.facts.length===0)return[e,[]];let i=n.defs.length>0,[a,...s]=n.facts,[l,u]=o(e,t,i?{defs:n.defs,facts:[]}:{defs:[],facts:[a]},r),d=i?n.facts:s.map(e=>I(1,e)),[f,p]=c(l,t,{defs:[],facts:d},r);return[f,[...u,...p]]},l=e=>{let t=[],n=e=>{e.kind===`Steps`?(n(e.qed.proof),e.steps.forEach(r)):e.obligations&&!e.isSuppressed&&t.push(...e.obligations)},r=e=>{e.kind===`Use`&&e.obligations&&!e.isSuppressed&&t.push(...e.obligations),(e.kind===`Assert`||e.kind===`Suffices`||e.kind===`Pcase`||e.kind===`Pick`)&&n(e.proof)};return n(e),t},u=t=>({kind:`Named`,level:t,label:`_a${st(e)}`,isAnonymous:!0}),d=(e,t)=>t?.kind===`Named`?{...t,level:e}:u(e),f=(e,t)=>{let n={...t,step:d(e,t.step)};if(n.kind!==`Steps`)return n;let r=n.steps.map(t=>p(e,t));return{...n,steps:r,qed:{...n.qed,proof:f(e+1,n.qed.proof)}}},p=(e,t)=>{let n={...t,step:d(e,t.step)};switch(n.kind){case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return{...n,proof:f(e+1,n.proof)};default:return n}},m=(e,t)=>{let n=t.kind===`Apply`?t.operator:t;if(n.kind===`Ix`){let r=e[e.length-n.index];if(!r)throw new s(`expose_connective`);if(r.kind!==`Defn`||r.definition.kind!==`Operator`)return t;let i=I(n.index,r.definition.body);if(t.kind!==`Apply`)return m(e,i);let a={...i,location:t.location};return m(e,A(Ce(a,t.args),a))}if(t.kind===`Apply`&&t.operator.kind===`Internal`&&t.operator.builtin===`Prime`){let n=m(e,t.args[0]),r=e=>j(`Prime`,[e],e);return n.kind===`Quant`?A({kind:`Quant`,quantifier:n.quantifier,bounds:n.bounds.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:r(e.domain.expression)}}:e),body:r(n.body)},t):fn(n,`Implies`)||fn(n,`Mem`)?A({kind:`Apply`,operator:n.operator,args:[r(n.args[0]),r(n.args[1])]},t):r(n)}return t.kind===`Parens`?m(e,t.expression):t},h=e=>{if(e.kind!==`Assert`)return;let t=e.sequent.active;return t.kind===`Apply`&&t.args.length===2?t.args[1]:void 0},g=e=>{if(e.kind!==`Steps`)return e;let t=[];return e.steps.forEach(e=>{let n=t.at(-1),r=n&&h(n);if(e.kind!==`Assert`||!r){t.push(e);return}let i=An(e.sequent.active,I(2,r));t.push({...e,sequent:{...e.sequent,active:i}})}),{...e,steps:t}},_=(e,t,n)=>{let r=g(n);switch(r.kind){case`Obvious`:case`Omitted`:case`Error`:return r;case`By`:{let e=r.usable,t=e.defs.length===0?[]:[{kind:`Use`,usable:{facts:[],defs:e.defs},isOnly:!1,location:r.location}],n=e.facts.map((e,t)=>({kind:`Use`,usable:{facts:[I(t,e)],defs:[]},isOnly:!1,location:e.location,isSuppressed:r.isSuppressed})),i=r.isOnly?[{kind:`Forget`,count:e.facts.length,location:r.location}]:[],a=un(r.step),o=[...t,...n,...i].map(e=>({...e,step:u(a)})),s={kind:`Obvious`,location:r.location,step:u(a),isSuppressed:r.isSuppressed};return{kind:`Steps`,steps:o,qed:{proof:s,location:s.location,step:s.step},location:r.location,step:r.step,isSuppressed:r.isSuppressed}}case`Steps`:{let n=e,i=t,a=r.steps.flatMap(e=>{let[t,r,a]=v(n,i,e);return n=t,i=r,a}),o=_(n,i,r.qed.proof);return{...r,steps:a,qed:{...r.qed,proof:o}}}}},v=(e,t,n)=>{let r=un(n.step);switch(n.kind){case`Forget`:return[e,t,[n]];case`Assert`:{let r=vn(e,n.sequent,n),i={...n,proof:_(r.context,r.active,n.proof)},a=yn(!1,e,t,n.sequent,i);return[a.context,a.active,[i]]}case`Suffices`:{let r=yn(!0,e,t,n.sequent,n),i={...n,proof:_(r.context,r.active,n.proof)},a=vn(e,n.sequent,i);return[a.context,a.active,[i]]}case`Use`:{let r={kind:`By`,usable:n.usable,isOnly:n.isOnly,location:n.location,step:n.step,isSuppressed:n.isSuppressed},i=_(e,t,r);if(i.kind!==`Steps`)throw new s(`simplifying BY does not produce a non-leaf proof!`);let a=n.usable.facts.map(()=>({kind:`Fact`,expression:cn,visibility:`Visible`,location:n.location}));return[[...e,...a],I(n.usable.facts.length,t),i.steps]}case`Hide`:return[n.usable.defs.reduce((e,t)=>{if(t.kind!==`Dx`)throw new s(`set_vis`);let r=e.length-t.index,i=e[r];if(i?.kind!==`Defn`){let e=i?i.kind===`Fact`?`??? FACT ???`:i.name:``;throw new s(`USE DEF ${e} invalid because ${e} is not a defined operator`)}return e.map((e,t)=>t===r?{...i,visibility:`Hidden`,location:n.location}:e)},e),t,[n]];case`Define`:return[[...e,...n.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:n.location}))],I(n.definitions.length,t),[n]];case`Have`:{let i=m(e,t),a={kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location},o=fn(i,`Implies`),s={context:[a],active:o?I(1,i.args[1]):i},c=o?{kind:`By`,usable:{facts:[A({kind:`Ix`,index:2},n)],defs:[]},isOnly:!0,...q(n)}:{kind:`Error`,message:pn(`@.@[<v2>@[%s@ %s@]@,%a@]@.`,`Error: this HAVE step is applied to the following goal,`,`which is not an implication:`,on(e,t)),...q(n)},l=p(r,{kind:`Suffices`,sequent:s,proof:c,location:n.location,step:n.step});return v(e,t,l)}case`Take`:return v(e,t,p(r,ee(e,t,n)));case`Witness`:return v(e,t,p(r,b(e,t,n)));case`Pcase`:{let i={kind:`Assert`,sequent:{context:[{kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location}],active:I(1,t)},proof:n.proof,...q(n)};return v(e,t,p(r,i))}case`Pick`:{let r=A({kind:`Quant`,quantifier:`Exists`,bounds:n.bounds,body:n.expression},n),i=y(n.step,`ex`),[a,o,c]=v(e,t,{kind:`Assert`,sequent:{context:[],active:r},proof:n.proof,...q(n),step:i}),l=I(2,r);if(l.kind!==`Quant`)throw new s(`Proof.Simplify.simplify_step/PICK`);let u=[...mn(l.bounds),{kind:`Fact`,expression:l.body,visibility:`Visible`,location:l.body.location}],[d,f,p]=v(a,o,{kind:`Suffices`,sequent:{context:u,active:I(u.length,o)},proof:{kind:`Omitted`,omission:`Elsewhere`,...q(n)},...q(n)});return[d,f,[...c,...p]]}}},y=(t,n)=>({kind:`Named`,level:un(t),label:`${t?.kind===`Named`?t.label:`_a`}${n}${st(e)}`,isAnonymous:!1}),ee=(e,t,n)=>{let r=hn(n.bounds),i=(t,n,r,a)=>{let o=a[0];if(!o)return{aux:n,goal:r};let s=m(e,r);if(s.kind!==`Quant`||s.quantifier!==`Forall`||s.bounds.length===0)return pn(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this TAKE step is applied to the following goal,`,`which is not a universal formula:`,on(e,r));let c=s.bounds[0],l=hn(s.bounds).slice(1),u=o.domain,d=c.domain;if(u.kind===`NoDomain`&&d.kind===`Domain`)return pn(`@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.`,`Error: the TAKE argument`,o.name,`does not match the pattern`,c.name,on(e,d.expression));if(u.kind===`Domain`&&d.kind===`NoDomain`)return pn(`@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.`,`Error: the TAKE argument`,o.name,on(e,u.expression),`does not match the pattern`,c.name);let f=u.kind===`Domain`&&d.kind===`Domain`&&!R(u.expression,d.expression)?[{kind:`Apply`,operator:{kind:`Internal`,builtin:`Subseteq`},args:[d.expression,u.expression]},...n]:n;if(l.length===0)return i(1,f,s.body,a.slice(1));let p=a.length===1?l.map(e=>Te(O(t),[e])[1][0]):l;return i(t+1,f,A({kind:`Quant`,quantifier:`Forall`,bounds:p,body:s.body},s),a.slice(1))},a=i(1,[],t,r);if(typeof a==`string`)return{kind:`Suffices`,sequent:{context:[{kind:`Fact`,expression:dn(t),visibility:`Visible`,location:n.location}],active:t},proof:{kind:`Error`,message:a,...q(n)},...q(n)};let o=a.aux.filter((e,t)=>a.aux.findIndex(t=>R(e,t))===t),s=[A({kind:`Ix`,index:2},n),...o.map(e=>I(2,e))];return{kind:`Suffices`,sequent:{context:mn(r),active:a.goal},proof:{kind:`By`,usable:{facts:s,defs:[]},isOnly:!0,...q(n)},...q(n)}},b=(e,t,n)=>{let r=[],i=``,a=t;for(let t of n.expressions){let n=m(e,a);if(n.kind!==`Quant`||n.quantifier!==`Exists`||n.bounds.length===0){i||=pn(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this WITNESS step is applied to the following goal,`,`which is not an existential formula:`,on(e,n)),a=n;break}let[o,...s]=n.bounds,c=s.length===0?n.body:A({kind:`Quant`,quantifier:`Exists`,bounds:Cn(o,s),body:n.body},n),l=t;if(o.domain.kind===`Domain`){let n=o.domain.expression,a=m(e,t);if(fn(a,`Mem`)){let[e,t]=a.args,i=R(t,n)?[]:[j(`Subseteq`,[t,n],t)];r.push(...i,a),l=e}else i||=pn(`@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.`,`Error: the WITNESS argument`,on(e,a),`does not match the pattern`,o.name,on(e,n)),l=a}let u=j(`Unprimable`,[l],l);a=F(fe(u,O(0)),c)}let o=i===``?wn(n,r):{kind:`Error`,message:i,...q(n)};return{kind:`Suffices`,sequent:{context:[],active:a},proof:o,...q(n)}};return{generate:i,collect:l,mutate:c,simplify:_}},J=(e,t=0)=>({level:e,weights:Array.from({length:t},()=>!0),params:/* @__PURE__ */ new Set}),Mn={TRUE:[0,0],FALSE:[0,0],Implies:[0,2],Equiv:[0,2],Conj:[0,2],Disj:[0,2],Neg:[0,1],Eq:[0,2],Neq:[0,2],STRING:[0,0],BOOLEAN:[0,0],SUBSET:[0,1],UNION:[0,1],DOMAIN:[0,1],Subseteq:[0,2],Mem:[0,2],Notmem:[0,2],Setminus:[0,2],Cap:[0,2],Cup:[0,2],Actplus:[3,2],BoxTrue:[3,1],BoxFalse:[3,1],Diamond:[3,1],Prime:[2,1],StrongPrime:[2,1],ENABLED:[1,1],UNCHANGED:[2,1],Leadsto:[3,2],Cdot:[2,2],Nat:[0,0],Int:[0,0],Real:[0,0],Infinity:[0,0],Plus:[0,2],Minus:[0,2],Times:[0,2],Ratio:[0,2],Quotient:[0,2],Remainder:[0,2],Exp:[0,2],Divides:[0,2],Lteq:[0,2],Lt:[0,2],Gteq:[0,2],Gt:[0,2],Range:[0,2],Uminus:[0,1],Seq:[0,1],Len:[0,1],BSeq:[0,2],Cat:[0,2],Append:[0,2],Head:[0,1],Tail:[0,1],SubSeq:[0,3],SelectSeq:[0,2],OneArg:[0,2],Extend:[0,2],Print:[0,2],PrintT:[0,1],Assert:[0,2],JavaTime:[0,0],TLCGet:[0,1],TLCSet:[0,2],Permutations:[0,1],SortSeq:[0,2],RandomElement:[0,1],Any:[0,0],ToString:[0,1],Unprimable:[0,1]},Nn={Constant:0,State:1,Action:2,Temporal:3,Unknown:0},Pn=e=>new Set(e.flatMap(e=>[...e])),Y=e=>({level:Math.max(0,...e.map(e=>e.level)),weights:[],params:Pn(e.map(e=>e.params))}),Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=e.hyp;switch(t.kind){case`Flex`:return J(1);case`Fresh`:return{...J(Nn[t.level],t.shape),params:/* @__PURE__ */ new Set([t.name])};case`Defn`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new i;return X(e.rest,n.body)}case`Fact`:return X(e.rest,t.expression)}},Ln=e=>{let t=Fn.get(e);if(t)return t;let n=In(e);return Fn.set(e,n),n},Rn=(e,t,n)=>{let r=t.flatMap(t=>t.domain.kind===`Domain`?[X(e,t.domain.expression)]:[]),i=t.reduce((e,t)=>M(e,P(t.name,t.level)),e);return Y([X(i,n),...r])},zn=(e,t)=>{if(e.weights.length!==t.length)throw new s(`Invalid number of arguments`);let n=t.filter((t,n)=>e.weights[n]);return{level:Math.max(e.level,...n.map(e=>e.level)),weights:[],params:Pn([e.params,...n.map(e=>e.params)])}},X=(e,t)=>{let n=t=>X(e,t);switch(t.kind){case`Ix`:{let n=ye(e,t.index-1);if(!n)throw new i;return Ln(n)}case`Internal`:{let e=Mn[t.builtin];if(!e)throw new i;return J(e[0],e[1])}case`Opaque`:case`String`:case`Num`:return J(0);case`Lambda`:{let n=t.params.reduce((e,t)=>M(e,P(t.name,`Unknown`,t.shape)),e),r=X(n,t.body),i=new Set(t.params.map(e=>e.name));return{level:r.level,weights:t.params.map(e=>r.params.has(e.name)),params:new Set([...r.params].filter(e=>!i.has(e)))}}case`Apply`:{let e=t.operator;if(e.kind===`Opaque`)return zn(J(0,t.args.length),t.args.map(n));if(e.kind===`Internal`&&t.args.length===1){let r=t.args[0];switch(e.builtin){case`Prime`:case`StrongPrime`:if(n(r).level>1)throw new i;return J(2,1);case`ENABLED`:{let e=n(r);if(e.level>2)throw new i;return{level:1,weights:[],params:e.params}}case`UNCHANGED`:{let e=n(r);if(e.level>1)throw new i;return{level:2,weights:[],params:e.params}}}}return e.kind===`Internal`&&e.builtin===`Cdot`?(t.args.forEach(n),J(2)):e.kind===`Internal`&&e.builtin===`Leadsto`?(t.args.forEach(n),J(3,2)):zn(n(e),t.args.map(n))}case`Sequent`:{let[n,r]=N(e,t.sequent.context,(e,t)=>{let n=M(e,t);return[n,Ln(n).level]});return J(Math.max(0,...r,X(n,t.sequent.active).level))}case`With`:case`Dot`:case`Parens`:return n(t.expression);case`Let`:{let n=t.definitions.reduce((e,t)=>M(e,{kind:`Defn`,definition:t,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),e);return X(n,t.body)}case`If`:return Y([t.condition,t.consequent,t.alternative].map(n));case`List`:return Y(t.items.map(n));case`Quant`:case`Fcn`:return Rn(e,t.bounds,t.body);case`SetOf`:return Rn(e,t.bounds,t.element);case`Tquant`:return X(t.names.reduce((e,t)=>M(e,{kind:`Flex`,name:t}),e),t.body),J(3);case`Choose`:case`SetSt`:{let r=t.domain&&n(t.domain),i=t.domain?be(t.name,t.domain):P(t.name,`Constant`);return Y([X(M(e,i),t.body),...r?[r]:[]])}case`SetEnum`:case`Tuple`:return Y(t.elements.map(n));case`Product`:return Y(t.factors.map(n));case`FcnApp`:return Y([t.function,...t.args].map(n));case`Arrow`:return Y([n(t.domain),n(t.range)]);case`Rect`:case`Record`:return Y(t.fields.map(e=>n(e.value)));case`Except`:return Y([n(t.function),...t.specs.flatMap(e=>[...e.trail.flatMap(e=>e.kind===`Apply`?[n(e.expression)]:[]),n(e.value)])]);case`Sub`:return{...Y([n(t.action),n(t.subscript)]),level:2};case`Tsub`:case`Fair`:return n(t.action),n(t.subscript),J(3);case`Case`:return Y([...t.arms.flatMap(e=>[n(e.condition),n(e.body)]),...t.other?[n(t.other)]:[]]);case`Bang`:case`At`:throw new i}},Bn=(e,t)=>{let n=ye(e,t-1)?.hyp;if(!n)throw new i;return n},Vn=e=>e.kind===`Internal`&&(e.builtin===`ENABLED`||e.builtin===`Cdot`),Hn=e=>e.kind===`Apply`&&e.args.length===1&&e.args[0].kind===`Lambda`&&(Vn(e.operator)||e.operator.kind===`Opaque`&&(e.operator.name===`EnabledWrapper`||e.operator.name===`CdotWrapper`)),Un=e=>e===void 0?2:Math.min(2,e),Wn=e=>e===void 0?void 0:Math.max(1,e-1),Gn=(e,t,n,r)=>{let a=(n,i=r)=>Gn(e,t,n,i);if(Hn(n))return n;if(n.kind===`Sub`)return{...n,action:a(n.action),subscript:a(n.subscript,Wn(r))};if(n.kind===`Apply`&&n.operator.kind===`Internal`){let e=n.operator.builtin,[t,i]=n.args;if(e===`Cdot`&&n.args.length===2)return{...n,args:[a(t,Un(r)),a(i,1)]};if(e===`ENABLED`&&n.args.length===1)return{...n,args:[a(t,Un(r))]};if((e===`Prime`||e===`UNCHANGED`)&&n.args.length===1)return{...n,args:[a(t,Wn(r))]}}let o=n.kind===`Apply`&&n.operator.kind===`Ix`?n.operator:n;if(o.kind!==`Ix`)return Be(t,n,(t,n)=>Gn(e,t,n,r),M);if(r===void 0)return n;let c=X(t,n).level,l=Bn(t,o.index),u=e=>`The operator \`${e}\` is declared at:\n${l.location?le(l.location):`<unknown location>`}`;if(l.kind===`Fresh`&&l.level===`Unknown`)throw e(D(n.location,`Declared operator \`${l.name}\` has unknown level and occurs within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}.\nIf a constant operator is substituted for this operator, then the expression that results from applying this declared operator has expression level ${c}.\n May need expansion. A declared operator cannot be expanded.\n${u(l.name)}\n and has arity: ${l.shape}`)),new i(`File "src/expr/e_action.ml", line 367, characters 20-26: Assertion failed`);if(c<r)return n;if(c>2||l.kind===`Fact`)throw new i;if(l.kind===`Flex`){if(n.kind!==`Ix`)throw new i;return n}if(l.kind===`Fresh`){let t=`The expression that results from applying the declared operator \`${l.name}\` has expression level ${c} within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}. A declared operator cannot be expanded.\n${u(l.name)}\n and has level: ${Nn[l.level]}\n and arity: ${l.shape}`;throw e(D(n.location,t)),new s(t)}let d=l.definition;if(d.kind!==`Operator`&&d.kind!==`Bpragma`)throw new i;e({text:`${ue(n.location)}[INFO]: Auto-expanding the definition of operator: ${d.name}\n`,channel:`stdout`});let f=F(O(o.index),d.body);return a(we(n.kind===`Apply`?Ce(f,n.args):f))},Kn=e=>j(`Eq`,[j(`Prime`,[e],e),e],e),qn=e=>{let t=e=>e.kind===`Tuple`?e.elements.flatMap(t):[e],n=t(e);return n.length===0?A({kind:`Internal`,builtin:`TRUE`},e):n.length===1?Kn(n[0]):A({kind:`List`,bullet:`And`,items:n.map(Kn)},e)},Jn=e=>{if(e.kind===`Apply`&&e.args.length===1)return qn(e.args[0]);if(e.kind!==`Sub`)throw new i;let t=qn(e.subscript),n=e.modal===`Box`?t:j(`Neg`,[t],e);return j(e.modal===`Box`?`Disj`:`Conj`,[e.action,n],e)},Yn=e=>{let t=(e,t)=>e<<t|e>>>32-t,n=(e,n)=>{let r=Math.imul(t(Math.imul(n,3432918353),15),461845907);return Math.imul(t(e^r,13),5)+3864292196|0},r=new TextEncoder().encode(e),i=r.length-r.length%4,a=0;for(let e=0;e<i;e+=4)a=n(a,r[e]|r[e+1]<<8|r[e+2]<<16|r[e+3]<<24);let o=r.subarray(i).reduceRight((e,t)=>e<<8|t,0);return r.length>i&&(a=n(a,o)),a^=r.length,a=Math.imul(a^a>>>16,2246822507),a=Math.imul(a^a>>>13,3266489909),(a^a>>>16)&1073741823},Xn=e=>{let t=Array.from({length:16},()=>[]);return e.forEach((e,n)=>{if(t[Yn(e)&t.length-1].unshift(e),n+1<=t.length*2)return;let r=Array.from({length:t.length*2},()=>[]);t.flat().forEach(e=>r[Yn(e)&r.length-1].push(e)),t=r}),t.flat()},Zn=(e,t,n,r,a)=>{let o=i=>Zn(e,t,n,r,i),s=t!==void 0||n!==void 0,c=(i,o)=>{let s={names:[],depth:Math.max(t?.depth??0,n?.depth??0)+1},[c,l]=o,u=[Zn(e,t,s,r,c),...l?[Zn(e,s,n,r,l)]:[]],d=s.names.length===0?[`r#0`]:Xn(s.names);return A({kind:`Apply`,operator:i,args:[{kind:`Lambda`,params:[`_`,...d].map(e=>({name:e,shape:0})),body:u.length===1?u[0]:{kind:`List`,bullet:`And`,items:u}}]},a)};if(Hn(a))return a;if(a.kind===`Apply`&&a.operator.kind===`Internal`){let t=a.operator.builtin;if(t===`ENABLED`&&a.args.length===1||t===`Cdot`&&a.args.length===2)return c(a.operator,a.args);if(t===`Prime`&&a.args.length===1){let t=Zn(e,n,void 0,r,a.args[0]);return n?t:{...a,args:[t]}}if(t===`UNCHANGED`&&s)return o(Jn(a))}if(a.kind===`Sub`&&s)return o(Jn(a));if(a.kind===`Ix`){if(!t)return a;let e=Bn(r,a.index);if(e.kind===`Fact`)throw new i;if(e.kind!==`Flex`)return a;let n=`${e.name}#enabled#prime${t.depth}`;return t.names.includes(n)||t.names.push(n),A({kind:`Opaque`,name:n},a)}if(a.kind===`Apply`&&a.operator.kind===`Opaque`)throw e(D(a.location,`Named operator \`${a.operator.name}\` unexpected after anonymization.`)),new i(`File "src/expr/e_action.ml", line 1048, characters 12-18: Assertion failed`);return Be(r,a,(r,i)=>Zn(e,t,n,r,i),M)},Qn=(e,t)=>{if(t.kind===`Apply`&&Vn(t.operator)){let[n]=t.args;if(t.args.length!==1||n.kind!==`Lambda`)throw new i;let[r,...a]=n.params;if(r.name!==`_`)return t;let o=Qn({kind:`Compose`,outer:e,inner:O(a.length)},n.body);return{kind:`Apply`,operator:t.operator,args:[{kind:`Lambda`,params:a,body:o}]}}return t.kind===`Ix`?F(e,t):t.kind===`Apply`?A(Ce(Qn(e,t.operator),t.args.map(t=>Qn(e,t))),t):Be(e,t,Qn,e=>k(1,e))},$n=e=>{if(e.kind===`Apply`&&Vn(e.operator)){let[t]=e.args;if(e.args.length!==1||t.kind!==`Lambda`||t.params[0].name===`_`)throw new i;let n=e.operator.builtin===`Cdot`?`CdotWrapper`:`EnabledWrapper`;return{kind:`Apply`,operator:A({kind:`Opaque`,name:n},e.operator),args:[{kind:`Lambda`,params:t.params.map((e,t)=>({name:`r#${t}`,shape:0})),body:$n(t.body)}]}}return Be(void 0,e,(e,t)=>$n(t),()=>void 0)},er=e=>{if(e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Cdot`&&e.args.length===1&&e.args[0].kind!==`Lambda`)throw new i;return Be(void 0,e,(e,t)=>er(t),()=>void 0)},tr=(e,t,n,r)=>{let i=Gn(t,n,r,void 0),a=Qn(O(0),Zn(t,void 0,void 0,n,i));return er($n(e.expr(n,a)))},nr=(e,t)=>({kind:`Definition`,definition:{kind:`Operator`,name:e,body:{kind:`Internal`,builtin:t}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),Z=(e,t,n)=>({kind:`Definition`,definition:{kind:`Operator`,name:t,body:{kind:`Lambda`,params:Array.from({length:e},(e,t)=>({name:`x${t+1}`,shape:0})),body:{kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n}))}}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),rr=[nr(`Nat`,`Nat`),Z(2,`+`,`Plus`),Z(2,`-`,`Minus`),Z(2,`*`,`Times`),Z(2,`^`,`Exp`),Z(2,`<`,`Lt`),Z(2,`>`,`Gt`),Z(2,`=<`,`Lteq`),Z(2,`>=`,`Gteq`),Z(2,`%`,`Remainder`),Z(2,`\\div`,`Quotient`),Z(2,`..`,`Range`)],ir=[...rr,nr(`Int`,`Int`),Z(1,`-.`,`Uminus`)],ar=[...ir,nr(`Real`,`Real`),Z(2,`/`,`Ratio`),nr(`Infinity`,`Infinity`)],or=[Z(1,`Seq`,`Seq`),Z(1,`Len`,`Len`),Z(2,`BSeq`,`BSeq`),Z(2,`\\o`,`Cat`),Z(2,`Append`,`Append`),Z(1,`Head`,`Head`),Z(1,`Tail`,`Tail`),Z(3,`SubSeq`,`SubSeq`),Z(2,`SelectSeq`,`SelectSeq`)],sr=[Z(2,`Print`,`Print`),Z(1,`PrintT`,`PrintT`),Z(2,`Assert`,`Assert`),nr(`JavaTime`,`JavaTime`),Z(1,`TLCGet`,`TLCGet`),Z(2,`TLCSet`,`TLCSet`),Z(2,`:>`,`OneArg`),Z(2,`@@`,`Extend`),Z(1,`Permutations`,`Permutations`),Z(2,`SortSeq`,`SortSeq`),Z(1,`RandomElement`,`RandomElement`),nr(`Any`,`Any`),Z(1,`ToString`,`ToString`)],cr=(e,t)=>({name:e,extendees:[],body:t,isImportant:!1,isStandard:!0}),lr=new Map([cr(`Naturals`,rr),cr(`Integers`,ir),cr(`Reals`,ar),cr(`Sequences`,or),cr(`TLC`,sr)].map(e=>[e.name,e])),ur=e=>{let t=e.location;switch(e.kind){case`Constants`:return e.declarations.map(e=>({kind:`Fresh`,name:e.name,shape:e.shape,level:`Constant`,domain:void 0,domainVisibility:`Visible`,location:t}));case`Recursives`:return e.declarations.map(e=>({kind:`Defn`,definition:{kind:`Recursive`,name:e.name,shape:e.shape,location:t},whereDefined:`User`,visibility:`Hidden`,isLocal:!1,location:t}));case`Variables`:return e.names.map(e=>({kind:`Flex`,name:e,location:t}));case`Definition`:return[{kind:`Defn`,definition:e.definition,whereDefined:e.whereDefined,visibility:e.visibility,isLocal:e.isLocal,location:t}];case`Axiom`:return e.name===void 0?[{kind:`Fact`,expression:e.expression,visibility:`Hidden`,location:t}]:fr(e.name,e.expression,t);case`Theorem`:{let n=Oe(O(-e.axiomCount),{...e.sequent,context:e.sequent.context.slice(e.axiomCount)}),r=A(he(n),e);return e.name===void 0?[{kind:`Fact`,expression:r,visibility:`Hidden`,location:t}]:fr(e.name,r,t)}case`Mutate`:return e.mode===`Use`?e.usable.facts.map((e,n)=>({kind:`Fact`,expression:I(n,e),visibility:`Visible`,location:t})):[];case`Submod`:case`Anoninst`:return[]}},dr=e=>e.kind===`Axiom`||e.kind===`Theorem`?e.name===void 0?1:2:ur(e).length,fr=(e,t,n)=>[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:t,location:n},whereDefined:`User`,visibility:`Visible`,isLocal:!1,location:n},{kind:`Fact`,expression:{kind:`Ix`,index:1,location:n},visibility:`Hidden`,location:n}],pr=e=>e.body.flatMap(e=>{switch(e.kind){case`Definition`:return[{...e,whereDefined:e.isLocal?`Builtin`:e.whereDefined}];case`Mutate`:return[];case`Theorem`:return[{...e,proof:{kind:`Omitted`,omission:`Elsewhere`,location:e.location}}];case`Submod`:return[{...e,module:{...e.module,body:pr(e.module)}}];default:return[e]}}),mr=(e,t,n,r=/* @__PURE__ */ new Set([t.name]))=>{let a=[];for(let o of t.extendees){if(n.has(o))continue;if(r.has(o))throw new i(`Stack overflow`);let t=e.get(o);if(!t)throw new s(`Module "${o}" unknown`);a.push(...pr(mr(e,t,n,/* @__PURE__ */ new Set([...r,o])))),n.add(o)}return{...t,body:[...a,...t.body].map(t=>t.kind===`Submod`?{...t,module:mr(e,t.module,/* @__PURE__ */ new Set)}:t)}},hr=e=>{let t=/* @__PURE__ */ new Map,n=(e,n)=>{t.has(e)||t.set(e,n)},r=e=>e.extendees.forEach((t,r)=>n(t,e.extendeeLocations?.[r])),i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o=e=>{typeof e==`object`&&e&&(`instance`in e&&gr(e.instance)&&n(e.instance.module,e.instance.location),Object.values(e).forEach(o))},s=e=>{e.kind===`Theorem`?o(e.sequent):e.kind!==`Submod`&&o(e),e.kind===`Submod`&&(i.add(e.module.name),a.set(e.module.name,e.module),r(e.module),e.module.body.forEach(s))};return e.body.forEach(s),i.forEach(e=>t.delete(e)),r(e),{dependencies:[...t.keys()].sort(_r),locations:t,submodules:a}},gr=e=>typeof e==`object`&&!!e&&`module`in e&&typeof e.module==`string`&&`substitutions`in e,_r=(e,t)=>e<t?-1:+(e>t),vr=(e,t)=>({facts:Se(e,t.facts),defs:t.defs.map(t=>{if(t.kind===`Dvar`)return t;let n=F(e,{kind:`Ix`,index:t.index});if(n.kind!==`Ix`)throw new s(`substitution produced bad definition`);return{...t,index:n.index}})}),yr=(e,t)=>{switch(t.kind){case`Constants`:case`Recursives`:return[k(t.declarations.length,e),t];case`Variables`:return[k(t.names.length,e),t];case`Definition`:return[k(1,e),{...t,definition:Ee(e,t.definition)}];case`Axiom`:return[k(dr(t),e),{...t,expression:F(e,t.expression)}];case`Theorem`:return[k(dr(t),e),{...t,sequent:Oe(e,t.sequent)}];case`Submod`:return[e,{...t,module:{...t.module,body:br(e,t.module.body)}}];case`Mutate`:return[t.mode===`Hide`?e:k(t.usable.facts.length,e),{...t,usable:vr(e,t.usable)}];case`Anoninst`:return[e,{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(t=>({name:t.name,expression:F(e,t.expression)}))}}]}},br=(e,t)=>N(e,t,yr)[1],xr=(e,t,n,r)=>{try{let n=tr(e.anonymizer,e.onWarning,t,{kind:`Sequent`,sequent:r});if(n.kind!==`Sequent`)throw new i;return n.sequent}catch(t){if(!(t instanceof s)||t.failure===void 0)throw t;let i=r.active.location,a=`${t.failure}\nCould not instantiate the theorem ${n===void 0?``:`named: ${n}, `}at: ${i?le(i):`<unknown location>`}`;return e.onWarning({text:`${ue(i)}[ERROR]${a}`,channel:`stdout`}),e.onWarning({text:a,channel:`toolboxOnly`}),{context:[],active:A({kind:`Internal`,builtin:`TRUE`},r.active)}}},Sr=(e,t,n)=>{if(n.kind===`Theorem`)return{...n,sequent:xr(e,t,n.name,n.sequent)};if(n.kind!==`Definition`)return n;let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)return n;let i=tr(e.anonymizer,e.onWarning,t,r.body);return{...n,definition:{...r,body:i}}},Cr=(e,t,n)=>N(t,n,(t,n)=>{if(n.kind===`Submod`){let[r,i]=Cr(e,t,n.module.body);return[r,{...n,module:{...n.module,body:i}}]}let r=Sr(e,t,n);return[ge(t,ur(r)),r]}),wr=(e,t)=>{let n=[],r=0,i=e;for(;i.length>0;){let[e,...a]=i,o=e.kind===`Constants`?{name:e.declarations[0].name,remaining:{...e,declarations:e.declarations.slice(1)}}:e.kind===`Variables`?{name:e.names[0],remaining:{...e,names:e.names.slice(1)}}:void 0;if(o){let e=t.get(o.name);if(!e)throw new s(`Parameter ${o.name} has no substitute`);let n=dr(o.remaining)===0;i=br(fe(I(r,e),O(0)),n?a:[o.remaining,...a])}else n.push(e),r+=dr(e),i=a}return n},Tr=(e,t,n)=>{let r=Array.from({length:t},(e,r)=>A({kind:`Ix`,index:t-r},{location:n})),i=Array.from({length:t},(e,t)=>A({kind:`Ix`,index:t+1},{location:n})),a=Array.from({length:e},(e,i)=>{let a=A({kind:`Ix`,index:i+t+1},{location:n});return t>0?A({kind:`Apply`,operator:a,args:r},{location:n}):a});return pe([...a,...i].reverse(),O(e+t))},Er=(e,t)=>{let n=t.map(e=>({name:e,shape:0}));return e.kind===`Lambda`?{...e,params:[...n,...e.params]}:t.length===0?e:A({kind:`Lambda`,params:n,body:e},e)},Dr=(e,t,n,r,i,a)=>{let o=e=>n===``?e:`${n}!${e}`,c=r.args.length,l=[],u=0,d=t,f=c===0,p=t=>{f||(f=!0,e.onWarning({text:t,channel:`stderr`}))};for(;d.length>0;){let[t,...n]=d;d=n;let f=e=>Er(F(Tr(u,c,a),e),r.args);switch(t.kind){case`Definition`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new s(`Module.Elab.localize`);let r=t.isLocal?`${n.name}$${st(e.salts)}`:n.name;l.push({...t,definition:{...n,name:o(r),body:f(n.body)},whereDefined:t.isLocal?`Builtin`:t.whereDefined,isLocal:t.isLocal||i}),u+=1;continue}case`Axiom`:{p(`${de(a)}Instancing produces parametric axioms.\nSuch axioms will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e={...t,name:t.name===void 0?void 0:o(t.name),expression:f(t.expression)};l.push(e),u+=dr(e);continue}case`Theorem`:{p(`${ue(a)}Warning: Instancing produces parametric theorems.\nSuch theorems will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e=f(A(he(t.sequent),t));l.push({...t,name:t.name===void 0?void 0:o(t.name),sequent:e.kind===`Sequent`?e.sequent:{context:[],active:e},proof:{kind:`Omitted`,omission:`Elsewhere`,location:t.location}}),u+=1;continue}case`Mutate`:t.mode===`Use`&&(d=br(O(-t.usable.facts.length),d));continue;case`Submod`:continue;default:throw new s(`Module.Elab.localize`)}}return l},Or=e=>{let t=[],n=e;for(;n.length>0;){let[e,...r]=n;if(e.kind!==`Axiom`){t.push(e),n=r;continue}let i=e.location;e.name!==void 0&&t.push({kind:`Definition`,definition:{kind:`Operator`,name:e.name,body:e.expression,location:i},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:i});let a={kind:`Fact`,expression:e.name===void 0?I(1,e.expression):A({kind:`Ix`,index:2},e),visibility:`Visible`,location:i},o=0,s=r.map(e=>{let t=o;if(o+=dr(e),e.kind!==`Theorem`)return e;let n=Oe(O(1),e.sequent);return{...e,sequent:{...n,context:[De(O(t),a),...n.context]},axiomCount:e.axiomCount+1}});n=br(O(-1),s)}return t},kr=e=>new Set(e.body.flatMap(e=>e.kind===`Constants`?e.declarations.map(e=>e.name):e.kind===`Variables`?e.names:[])),Ar=(e,t,n,r,i,a,o)=>{let c=t.get(r.module);if(!c)throw new s(`Module "${r.module}" unknown`);let l=kr(c);for(let e of r.substitutions)if(!l.has(e.name))throw new s(`Parameter ${e.name} occurs in the statement \`INSTANCE ${r.module} WITH\`, and is not declared in the module ${r.module}`);let u=ge(n,r.args.map(e=>P(e,`Unknown`))),d=new Map(r.substitutions.map(e=>[e.name,e.expression]));for(let e of[...l].sort(_r))if(!d.has(e)){if(!ve(u,e))throw new s(`Required parameter ${e} for module ${r.module} could not be inferred.`);d.set(e,A({kind:`Opaque`,name:e},{location:o}))}let f=new Map([...d].map(([t,n])=>[t,e.anonymizer.expr(u,n)])),p=br(O((u?.size??0)-(c.depth??0)),c.body.map(e=>e.kind===`Theorem`?{...e,proof:{kind:`Omitted`,omission:`Implicit`,location:e.proof.location}}:e)),[,m]=Cr(e,u,p);return Or(Dr(e,wr(m,f),a,r,i,o))},jr=(e,t,n)=>e===void 0?{hyps:[],sequent:t}:{hyps:[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:A(he(t),{location:n}),location:n},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:n}],sequent:Oe(O(1),t)},Mr=(e,t,n)=>{let r=n.instance.module;if(!e.latestModules.has(r))throw e.onWarning({text:`${de(n.instance.location)}Module ${JSON.stringify(r)} unknown\n`,channel:`toolbox`}),new s(`Module ${JSON.stringify(r)} unknown`,{failure:`Module.Elab.anon#defns`});let i=Ar(e,e.latestModules,t,n.instance,!0,n.name,n.location),a=[],o=i;for(;o.length>0;){let[e,...t]=o;e.kind===`Definition`?(a.push(e.definition),o=t):o=br(O(-dr(e)),t)}return a},Nr=(e,t,n,r)=>{let i=[],a=n,o=e=>{i.push(e),a=ge(a,ur(e))},s=e=>e!==void 0&&ve(a,e)!==void 0,c=r.body.map(e=>({unit:e,isAnonymized:!1}));for(let n=0;n<c.length;n++){let i=c[n].unit,l=(r,o,s)=>{let l=Ar(e,t,a,r,o,s,i.location);c.splice(n+1,0,...l.map(e=>({unit:e,isAnonymized:!0})))};switch(i.kind){case`Anoninst`:l(i.instance,i.isLocal,``);continue;case`Definition`:{let t=i.definition;if(t.kind===`Instance`){l(t.instance,i.isLocal,t.name);continue}let r=t.kind===`Recursive`||c[n].isAnonymized?t:e.anonymizer.defn(a,t),s={...i,definition:r};if(t.kind===`Recursive`){o(s);continue}let u=ur(s)[0],d=ve(a,t.name);if(d?.hyp.kind===`Defn`&&(d.hyp.definition.kind===`Recursive`||Ne(De(O(d.depth+1),d.hyp),u))){let e=c.slice(n+1),t=br(fe(A({kind:`Ix`,index:d.depth+1},i),O(0)),e.map(e=>e.unit));c.splice(n+1,e.length,...e.map((e,n)=>({...e,unit:t[n]})));continue}o(s);continue}case`Recursives`:case`Constants`:case`Variables`:o(i);continue;case`Axiom`:if(s(i.name))continue;e.latestModules=new Map(t),o({...i,expression:e.anonymizer.expr(a,i.expression)});continue;case`Theorem`:{let n=s(i.name),c=n?`(redundant)${i.name}`:i.name,l=n?{kind:`Obvious`,location:i.proof.location}:i.proof;e.latestModules=new Map(t);let u=e.anonymizer.sequent(a,i.sequent),d=jr(c,u,i.location),f=ge(ge(a,d.hyps),d.sequent.context),p=e.anonymizer.proof(f,l),m=r.isImportant?e.generator.simplify(_e(f),d.sequent.active,p):p;o({...i,name:c,sequent:u,proof:m});continue}case`Mutate`:e.latestModules=new Map(t),o({...i,usable:e.anonymizer.usable(a,i.usable)});continue;case`Submod`:o({...i,module:Nr(e,t,a,i.module)});continue}}let l={...r,body:i,depth:n?.size??0};return t.set(r.name,l),l},Pr=(e,t,n)=>{let r=[],i=[],a=En,o=t;for(let t of n.body)switch(t.kind){case`Theorem`:{let n=jr(t.name,t.sequent,t.location),s=[...o,...n.hyps],c=e.generator.generate({context:[...s,...n.sequent.context],active:n.sequent.active},t.proof);r.push(...e.generator.collect(c));let l=kn(c);i.push({...l,location:t.location}),a=Dn(a,l);let u=t.name===void 0?A(he(t.sequent),t):{kind:`Ix`,index:1,location:t.location};o=[...s,{kind:`Fact`,expression:u,visibility:`Hidden`,location:t.location}];continue}case`Submod`:{let n=Pr(e,o,t.module);r.push(...n.obligations),a=Dn(a,n.summary);continue}case`Mutate`:{let[n,i]=e.generator.mutate(o,t.mode,t.usable,t.location);r.push(...i),o=n;continue}default:o=[...o,...ur(t)]}return{obligations:r,summary:{...a,theorems:i}}},Fr=e=>({kind:`Opaque`,name:e}),Ir=e=>({kind:`Tuple`,elements:e.map(Fr)}),Lr=(e,t)=>({kind:`Apply`,operator:{kind:`Internal`,builtin:`Eq`},args:[e,t]}),Rr=e=>e.map(e=>({name:e,level:`Constant`,domain:{kind:`NoDomain`}})),zr=(e,t)=>e?.kind===`Product`&&e.factors.length===t.length?e.factors:void 0,Br=(e,t)=>t.map((t,n)=>({kind:`Operator`,name:t,body:{kind:`FcnApp`,function:Fr(e),args:[{kind:`Num`,integer:String(n+1),fraction:``}]}})),Vr=(e,t)=>e.map((e,n)=>({name:e,level:`Constant`,domain:{kind:`Domain`,expression:t[n]}})),Hr=e=>({name:e.name,level:`Constant`,domain:e.domain}),Ur=(e,t,n)=>{let r=[];return t.forEach(e=>{e.kind===`Name`&&e.domain.kind===`Ditto`?r.at(-1)?.push(e):r.push([e])}),r.reduceRight((t,n)=>{let r=n[0];if(r.kind===`Name`)return{kind:`Quant`,quantifier:e,bounds:n.flatMap(e=>e.kind===`Name`?[Hr(e)]:[]),body:t,location:t.location};let i=zr(r.domain,r.names);if(i)return{kind:`Quant`,quantifier:e,bounds:Vr(r.names,i),body:t,location:t.location};let a={kind:`Apply`,operator:{kind:`Internal`,builtin:e===`Exists`?`Mem`:`Notmem`},args:[Ir(r.names),r.domain]};return{kind:`Quant`,quantifier:e,bounds:Rr(r.names),body:{kind:`List`,bullet:e===`Exists`?`And`:`Or`,items:[a,t]},location:t.location}},n)},Wr=(e,t,n,r)=>zr(n,t)?{kind:`Let`,definitions:Br(e,t),body:r}:{kind:`Quant`,quantifier:`Exists`,bounds:Rr(t),body:{kind:`List`,bullet:`And`,items:[Lr(Fr(e),Ir(t)),r]}},Gr=(e,t,n)=>{let r=`choose#${e[0]}`;return{kind:`Choose`,name:r,domain:t,body:Wr(r,e,t,n)}},Kr=(e,t,n)=>{let r=`setst#${e[0]}`;return{kind:`SetSt`,name:r,domain:t,body:Wr(r,e,t,n)}},qr=(e,t,n)=>{let r=e.map(e=>{if(e.kind===`Name`)return{bounds:[Hr(e)],definitions:[]};let t=zr(e.domain,e.names);if(t&&n)return{bounds:Vr(e.names,t),definitions:[]};let r=`fcn#${e.names[0]}`,i={name:r,level:`Constant`,domain:{kind:`Domain`,expression:e.domain}};if(t)return{bounds:[i],definitions:Br(r,e.names)};let a=`choose#${r}`;return{bounds:[i],definitions:[{kind:`Operator`,name:a,body:Gr(e.names,void 0,Lr(Fr(r),Ir(e.names)))},...Br(a,e.names)]}}),i=r.flatMap(e=>e.definitions);return{bounds:r.flatMap(e=>e.bounds),value:i.length===0?t:{kind:`Let`,definitions:i,body:t}}},Jr=(e,t)=>{let n=qr(t,e,!0);return{kind:`SetOf`,element:n.value,bounds:n.bounds}},Yr=(e,t)=>{let n=qr(e,t,!1);return{kind:`Fcn`,bounds:n.bounds,body:n.value}},Xr={"=>":`Implies`,"<=>":`Equiv`,"/\\":`Conj`,"\\/":`Disj`,"~":`Neg`,"=":`Eq`,"#":`Neq`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,"\\subseteq":`Subseteq`,"\\in":`Mem`,"\\notin":`Notmem`,"\\":`Setminus`,"\\cap":`Cap`,"\\cup":`Cup`,"'":`Prime`,"~>":`Leadsto`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,"\\cdot":`Cdot`,"-+->":`Actplus`,"[]":`BoxTrue`,"<>":`Diamond`,TRUE:`TRUE`,FALSE:`FALSE`,BOOLEAN:`BOOLEAN`,STRING:`STRING`},Q=(e,t=!1)=>t&&e===`-`?`-.`:H(e).name,Zr=/^<(\d+|\*|\+)>([A-Za-z0-9_]*)\.*$/,$=(e,t)=>{if(!e||!t)return e??t;let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return{file:e.file,startLine:n?e.startLine:t.startLine,startColumn:n?e.startColumn:t.startColumn,endLine:r?e.endLine:t.endLine,endColumn:r?e.endColumn:t.endColumn}},Qr={Always:`[]`,Eventually:`<>`,Enabled:`ENABLED`,Unchanged:`UNCHANGED`},$r=(e,t)=>e!==void 0&&t!==void 0&&e.line===t.line&&e.column===t.column,ei=e=>e.location.range?.start,ti=e=>e.location.range?.end,ni=(e,t)=>{let n=e.location.range;return n&&t?{...e,location:{...e.location,range:{...n,end:t}}}:e},ri=e=>{if(e.kind===`Apply`){let t=H(e.operator),n=e.args.length===2&&t.fixity.startsWith(`Infix`),r=e.args.length===1&&t.fixity===`Prefix`;if(!n&&!r)return;let i=e.args.length-1;return{operator:t,isInfix:n,operand:e.args[i],replace:t=>({...e,args:[...e.args.slice(0,i),t]})}}let t=Qr[e.kind];if(t!==void 0&&`expression`in e)return{operator:H(t),isInfix:!1,operand:e.expression,replace:t=>({...e,expression:t})}},ii=(e,t)=>e.high<t.low,ai=e=>{let t=H(e.operator),[n,r]=e.args,i=ti(e),a=t=>{let n=e.location.range,i=ei(t);return{...e,args:[t,r],location:n&&i?{...e.location,range:{...n,start:i}}:e.location}},o=(e,n)=>{let r=n?ri(e):void 0;if(!r)return{kind:`Reduced`,isFinal:!1};let s=o(r.operand,$r(ti(r.operand),ti(e)));return s.kind===`Attached`?{kind:`Attached`,expression:ni(r.replace(s.expression),i)}:!s.isFinal&&(ii(t,r.operator)||r.isInfix&&t.fixity===`InfixLeft`&&r.operator.fixity===`InfixLeft`&&!ii(r.operator,t))?{kind:`Reduced`,isFinal:!ii(t,r.operator)}:{kind:`Attached`,expression:ni(r.replace(a(r.operand)),i)}},s=o(n,$r(ei(n),ei(e)));return s.kind===`Attached`?s.expression:e},oi="use instead the class`E_visit.iter_concrete`",si=(e,t,n,r)=>{let i=t.split(`
21
- `),a=t=>({file:e,startLine:t.start.line,startColumn:t.start.column,endLine:t.end.line,endColumn:t.end.column+1}),o=e=>{let t={line:e.endLine-1,column:e.endColumn-1},n=e=>e===` `||e===`\r`;for(;t.line<i.length;){let e=i[t.line];for(;n(e[t.column]);)t.column++;if(t.column<e.length)break;t.line++,t.column=0}if(!(i[t.line]??``).startsWith(`(*{`,t.column))return e;for(let n=t.line;n<i.length;n++){let r=i[n].indexOf(`}*)`,n===t.line?t.column:0);if(r!==-1)return{...e,endLine:n+1,endColumn:r+4}}return e},c=(t,n)=>({file:e,startLine:n.line,startColumn:n.column,endLine:n.line,endColumn:n.column+t.length}),l=t=>t.range?a(t.range):{file:e,startLine:t.line,startColumn:t.column,endLine:t.line,endColumn:t.column+1},d=(e,t)=>{let n=Q(e),r=Xr[n];return A(r?{kind:`Internal`,builtin:r}:{kind:`Opaque`,name:n},{location:t})},f=(e,t,n,r)=>{if(e.startsWith(`<`)){let t=A({kind:`Opaque`,name:e},{location:n});return A({kind:`Bang`,expression:t,selectors:[]},{location:n})}let i=Xr[e];if(i&&t.length===0)return A({kind:`Internal`,builtin:i},{location:n});let a=e.split(`!`);if(a.length===1){let r=A({kind:`Opaque`,name:e},{location:n});return t.length===0?r:A({kind:`Apply`,operator:r,args:t},{location:n})}let o=r??a.map((e,n)=>n===a.length-1?t.length:0),s=o.map((e,t)=>o.slice(0,t).reduce((e,t)=>e+t,0)),c=e=>t.slice(s[e],s[e]+o[e]),l=A({kind:`Opaque`,name:a[0]},{location:n});return A({kind:`Bang`,expression:o[0]===0?l:A({kind:`Apply`,operator:l,args:c(0)},{location:n}),selectors:a.slice(1).map((e,t)=>({kind:`Label`,label:Q(e),args:c(t+1)}))},{location:n})},p=(e,t)=>e.map((n,r)=>{if(n.pattern.kind===`Tuple`)throw new s(`Unexpected tuple declaration`,{failure:oi});let i=r>0&&e[r-1].set===n.set;return{name:n.pattern.name,level:`Constant`,domain:i?{kind:`Ditto`}:{kind:`Domain`,expression:_(n.set,t)}}}),m=(e,t)=>e.map((n,r)=>{let i=_(n.set,t);if(n.pattern.kind===`Tuple`)return{kind:`Tuple`,names:n.pattern.names,domain:i};let a=r>0&&e[r-1].set===n.set;return{kind:`Name`,name:n.pattern.name,domain:a?{kind:`Ditto`}:{kind:`Domain`,expression:i}}}),h=(e,t)=>{if(!r)throw new s(`Unexpected tuple declaration`,{failure:oi});return A(e(),{location:t})},g=e=>e.some(e=>e.pattern.kind===`Tuple`),_=(e,t)=>{let n=l(e.location),r=e=>_(e,t),i=(e,t)=>e.length===2?$(e[0].location,e[1].location):e.length!==1||!e[0].location?n:t===`Prefix`?$({...n,endLine:n.startLine,endColumn:n.startColumn+1},e[0].location):t===`Postfix`?$({...n,startLine:n.endLine,startColumn:n.endColumn-1},e[0].location):n,a=(e,t)=>A({kind:`Apply`,operator:{kind:`Internal`,builtin:e},args:[t]},{location:i([t],`Prefix`)});switch(e.kind){case`Number`:return A({kind:`Num`,integer:e.text??String(e.value),fraction:``},{location:n});case`Decimal`:{let[t,r]=e.text.split(`.`);return A({kind:`Num`,integer:t,fraction:r},{location:n})}case`String`:return A({kind:`String`,value:e.value},{location:n});case`Identifier`:return f(e.name,[],n);case`Apply`:{if(e.args.length===2){let t=ai(e);if(t!==e)return r(t)}let t=e.args.map(r),a=H(e.operator);return a.fixity===`Nonfix`?f(e.operator,t,n,e.argumentCounts):A({kind:`Apply`,operator:d(e.operator,void 0),args:t},{location:i(t,a.fixity)})}case`OperatorReference`:return d(e.operator,n);case`Lambda`:return A({kind:`Lambda`,params:e.params.map(e=>({name:e,shape:0})),body:r(e.body)},{location:n});case`And`:case`Or`:{let t=e.operands.map(r);if(e.isBulleted)return A({kind:`List`,bullet:e.kind,items:t},{location:n});let i=e.kind===`And`?`Conj`:`Disj`;return t.reduce((e,t)=>A({kind:`Apply`,operator:{kind:`Internal`,builtin:i},args:[e,t]},{location:$(e.location,t.location)}))}case`Prime`:{let t=r(e.expression);return A({kind:`Apply`,operator:{kind:`Internal`,builtin:`Prime`},args:[t]},{location:i([t],`Postfix`)})}case`Unchanged`:return a(`UNCHANGED`,r(e.expression));case`Enabled`:return a(`ENABLED`,r(e.expression));case`If`:return A({kind:`If`,condition:r(e.condition),consequent:r(e.consequent),alternative:r(e.alternative)},{location:n});case`Case`:return A({kind:`Case`,arms:e.arms.map(e=>({condition:r(e.condition),body:r(e.body)})),other:e.other&&r(e.other)},{location:n});case`Let`:return A({kind:`Let`,definitions:[...e.definitions,...e.instances??[]].sort((e,t)=>e.location.line-t.location.line||e.location.column-t.location.column).map(e=>y(e,t)),body:r(e.body)},{location:n});case`Forall`:case`Exists`:if(g(e.bounds)){let i=m(e.bounds,t),a=r(e.body);return h(()=>Ur(e.kind,i,a),n)}return A({kind:`Quant`,quantifier:e.kind,bounds:p(e.bounds,t),body:r(e.body)},{location:n});case`UnboundedQuantifier`:{let t=r(e.body),i=e.quantifier;return e.isTemporal?A({kind:`Tquant`,quantifier:i,names:e.names,body:t},{location:n}):A({kind:`Quant`,quantifier:i,bounds:Rr(e.names),body:t},{location:n})}case`Choose`:if(e.pattern.kind===`Tuple`){let t=e.pattern.names,i=e.set&&r(e.set),a=r(e.body);return h(()=>Gr(t,i,a),n)}return A({kind:`Choose`,name:e.pattern.name,domain:e.set&&r(e.set),body:r(e.body)},{location:n});case`SetEnumeration`:return A({kind:`SetEnum`,elements:e.elements.map(r)},{location:n});case`SetFilter`:if(e.bound.pattern.kind===`Tuple`){let t=e.bound.pattern.names,i=r(e.bound.set),a=r(e.predicate);return h(()=>Kr(t,i,a),n)}return A({kind:`SetSt`,name:e.bound.pattern.name,domain:r(e.bound.set),body:r(e.predicate)},{location:n});case`SetMap`:if(g(e.bounds)){let i=r(e.expression),a=m(e.bounds,t);return h(()=>Jr(i,a),n)}return A({kind:`SetOf`,element:r(e.expression),bounds:p(e.bounds,t)},{location:n});case`Tuple`:return A({kind:`Tuple`,elements:e.elements.map(r)},{location:{...n,startLine:n.endLine,startColumn:n.endColumn-2}});case`FunctionConstruction`:if(g(e.bounds)){let i=m(e.bounds,t),a=r(e.body);return h(()=>Yr(i,a),n)}return A({kind:`Fcn`,bounds:p(e.bounds,t),body:r(e.body)},{location:n});case`FunctionSet`:return A({kind:`Arrow`,domain:r(e.domain),range:r(e.range)},{location:n});case`Record`:case`RecordSet`:return A({kind:e.kind===`Record`?`Record`:`Rect`,fields:e.fields.map(e=>({name:e.name,value:r(e.value)}))},{location:n});case`Except`:return A({kind:`Except`,function:r(e.function),specs:e.updates.map(e=>({trail:e.path.map(e=>e.kind===`Field`?{kind:`Dot`,field:e.name}:{kind:`Apply`,expression:e.args.length===1?r(e.args[0]):{kind:`Tuple`,elements:e.args.map(r)}}),value:_(e.value,!0)}))},{location:n});case`ExceptAt`:return A({kind:`At`,isExcept:t},{location:n});case`FunctionApplication`:return A({kind:`FcnApp`,function:r(e.function),args:e.args.map(r)},{location:n});case`FieldAccess`:return A({kind:`Dot`,expression:r(e.record),field:e.field},{location:n});case`Product`:return A({kind:`Product`,factors:e.factors.map(r)},{location:n});case`Always`:case`Eventually`:{let t=e.expression;return e.kind===`Always`&&t.kind===`BoxAction`?A({kind:`Tsub`,modal:`Box`,action:r(t.action),subscript:r(t.subscript)},{location:n}):e.kind===`Eventually`&&t.kind===`AngleAction`?A({kind:`Tsub`,modal:`Dia`,action:r(t.action),subscript:r(t.subscript)},{location:n}):a(e.kind===`Always`?`BoxTrue`:`Diamond`,r(t))}case`BoxAction`:case`AngleAction`:return A({kind:`Sub`,modal:e.kind===`BoxAction`?`Box`:`Dia`,action:r(e.action),subscript:r(e.subscript)},{location:n});case`WeakFairness`:case`StrongFairness`:return A({kind:`Fair`,fairness:e.kind===`WeakFairness`?`Weak`:`Strong`,subscript:r(e.subscript),action:r(e.action)},{location:n});case`Label`:return A({kind:`Parens`,expression:r(e.body),form:{kind:`Nlabel`,label:e.name,names:e.params}},{location:n});case`Subexpression`:{let[t,...i]=e.selectors;if(t.kind!==`Name`)throw new s(`Unexpected subexpression reference`);let a=A({kind:`Opaque`,name:t.name},{location:n}),o=t.args.length===0?a:A({kind:`Apply`,operator:a,args:t.args.map(r)},{location:n});return A({kind:`Bang`,expression:o,selectors:i.map(e=>{switch(e.kind){case`Name`:return{kind:`Label`,label:Q(e.name),args:e.args.map(r)};case`Operand`:return e.operand===`<<`?{kind:`Left`}:e.operand===`>>`?{kind:`Right`}:{kind:`Number`,value:e.operand};case`Bound`:return{kind:`Instance`,args:e.args.map(r)};case`At`:return{kind:`At`};case`Colon`:return{kind:`Down`}}})},{location:n})}}},v=e=>({location:a(e.definitionRange??e.instanceRange),args:e.params.map(e=>e.name),module:e.module,substitutions:e.substitutions.map(e=>({name:Q(e.name),expression:_(e.expression,!1)}))}),y=(e,t=!1)=>{let n=l(e.location);if(e.kind===`Instance`){if(e.name===void 0)throw new s(`Unexpected keyword INSTANCE`);return{kind:`Instance`,name:e.name,instance:v(e),location:n}}let r=Q(e.name,e.kind===`Operator`&&e.params.length===1&&e.name===`-`),i=_(e.body,t);if(e.kind===`Function`&&g(e.bounds)){let a=m(e.bounds,t);return{kind:`Operator`,name:r,body:h(()=>Yr(a,i),n),location:n}}if(e.kind===`Function`){let a=p(e.bounds,t);return{kind:`Operator`,name:r,body:A({kind:`Fcn`,bounds:a,body:i},{location:n}),location:n}}return e.params.length===0?{kind:`Operator`,name:r,body:i,location:n}:{kind:`Operator`,name:r,body:A({kind:`Lambda`,params:e.params.map(e=>({name:Q(e.name),shape:e.arity,...e.location&&{location:c(e.name,e.location)}})),body:i},{location:n}),location:n}},ee=e=>{let t=l(e.location);return e.level===`Variable`?{kind:`Flex`,name:e.name,location:t}:{kind:`Fresh`,name:e.name,shape:e.arity,level:e.level,domain:e.set&&_(e.set,!1),domainVisibility:`Visible`,location:t}},b=e=>e.kind===`AssumeProve`?{context:e.assumptions.map(e=>{if(e.kind===`NewSymbol`)return ee(e);if(e.kind===`AssumeProve`){let t=l(e.location);return{kind:`Fact`,expression:A({kind:`Sequent`,sequent:b(e)},{location:t}),visibility:`Visible`,location:t}}let t=x(e);return{kind:`Fact`,expression:t,visibility:`Visible`,location:t.location}}),active:_(e.conclusion,!1)}:{context:[],active:_(e,!1)},x=e=>{if(e.kind!==`Label`||e.params.length>0)return _(e,!1);let t=l(e.location);return A({kind:`Parens`,expression:_(e.body,!1),form:{kind:`Xlabel`,label:e.name,indices:[]}},{location:t})},S=e=>{if(e.kind===`ModuleFact`)throw new u(`MODULE facts in proof obligations are not supported`);let t=_(e,!1);return t.kind===`Bang`&&t.selectors.length===0?t.expression:t},C=e=>{let t=l(e.location);if(e.kind===`ModuleFact`)return{kind:`Dvar`,name:e.name,location:t};if(e.kind===`Identifier`)return{kind:`Dvar`,name:Q(e.name),location:t};if(e.kind===`OperatorReference`)return{kind:`Dvar`,name:Q(e.operator),location:t};throw new u(`This DEF clause in proof obligations is not supported`)},te=e=>({facts:e.facts.map(S),defs:e.defs.map(C)}),ne=(e,t)=>{let r=e?e[2]:``;return r===``?{kind:`Unnamed`,level:t,id:st(n)}:{kind:`Named`,level:t,label:r,isAnonymous:!1}},w=(e,t,n)=>{if(!e)return{kind:`Omitted`,omission:`Implicit`,location:n};switch(e.kind){case`Obvious`:return{kind:`Obvious`,location:o(a(e.keyword))};case`Omitted`:return{kind:`Omitted`,omission:`Explicit`,location:a(e.keyword)};case`By`:return{kind:`By`,usable:te(e),isOnly:e.isOnly,location:a(e.keyword),step:{kind:`Unnamed`,level:t,id:0}};case`Steps`:{let n=e.steps.map(e=>Zr.exec(e.token)),r=n[0],i=r&&r[1]!==`*`&&r[1]!==`+`?Number(r[1]):t,o=e.steps.slice(0,-1).map((e,t)=>E(e,ne(n[t],i),i)),s=e.steps[e.steps.length-1],c=ne(n[n.length-1],i),l=a(s.head),u=w(s.proof,i+1,l),d={proof:u,location:$(l,u.location),step:c};return{kind:`Steps`,steps:o,qed:d,location:o.reduce((e,t)=>$(e,t.location),d.location),step:d.step}}}},T=e=>$(a(e.keyword),e.defs.length>0?l(e.defs[e.defs.length-1].location):void 0),E=(e,t,n)=>{let r=a(e.head),i=e.body,o=i=>{let a=w(e.proof,n+1,r);return{...i(a),location:$(r,a.location),step:t}},c=e=>({...e,location:r,step:t});switch(i.kind){case`Use`:case`Hide`:{let n=$(a({...e.head,end:e.head.start}),T(i)),r=te(i);return i.kind===`Use`?{kind:`Use`,usable:r,isOnly:i.isOnly,location:n,step:t}:{kind:`Hide`,usable:r,location:n,step:t}}case`Instance`:throw new s(`Unexpected keyword INSTANCE`);case`Define`:return c({kind:`Define`,definitions:i.definitions.map(e=>y(e))});case`Have`:return c({kind:`Have`,expression:_(i.expression,!1)});case`Take`:return c({kind:`Take`,bounds:i.names.length>0?Rr(i.names):p(i.bounds,!1)});case`Witness`:return c({kind:`Witness`,expressions:i.expressions.map(e=>_(e,!1))});case`Pick`:{let e=i.names.length>0?Rr(i.names):p(i.bounds,!1),t=_(i.body,!1);return o(n=>({kind:`Pick`,bounds:e,expression:t,proof:n}))}case`Case`:{let e=_(i.expression,!1);return o(t=>({kind:`Pcase`,expression:e,proof:t}))}case`Assert`:{let e=b(i.statement);return o(t=>i.isSuffices?{kind:`Suffices`,sequent:e,proof:t}:{kind:`Assert`,sequent:e,proof:t})}case`Qed`:throw new u(`QED in the middle of a proof`)}},re=e=>({name:e.name,extendees:e.extends,extendeeLocations:e.extendsRanges.map(a),isImportant:!1,location:l(e.location),body:e.units.map(e=>{switch(e.kind){case`Constants`:case`Recursive`:return{kind:e.kind===`Constants`?`Constants`:`Recursives`,declarations:e.declarations.map(e=>({name:Q(e.name),shape:e.arity})),location:l(e.declarations[0].location)};case`Variables`:return{kind:`Variables`,names:e.declarations.map(e=>e.name),location:l(e.declarations[0].location)};case`Definition`:return{kind:`Definition`,definition:y(e.definition),whereDefined:`User`,visibility:`Hidden`,isLocal:e.definition.isLocal,location:l(e.definition.location)};case`Instance`:{let t=e.instance,n=l(t.location);return t.name===void 0?{kind:`Anoninst`,instance:v(t),isLocal:t.isLocal,location:n}:{kind:`Definition`,definition:y(t),whereDefined:`User`,visibility:`Hidden`,isLocal:t.isLocal,location:a(t.instanceRange)}}case`Assumption`:return{kind:`Axiom`,name:e.assumption.name,expression:_(e.assumption.expression,!1),location:l(e.assumption.location)};case`Theorem`:{let t=e.theorem,n=l(t.location),r=o(n);return{kind:`Theorem`,name:t.name,sequent:b(t.statement),axiomCount:0,proof:w(t.proof,0,{...r,startLine:r.endLine,startColumn:r.endColumn}),location:n}}case`Use`:return{kind:`Mutate`,mode:e.use.kind,isSuppressed:!1,usable:te(e.use),location:T(e.use)};case`Module`:return{kind:`Submod`,module:{...re(e.module),isImportant:!0}}}})});return{convertModule:re}},ci={start:0,end:1/0},li=/-{4,} *MODULE/,ui=`Unexpected EOF`,di=e=>e?`${e.startLine}:${e.startColumn}:${e.endLine}:${e.endColumn}`:``,fi=e=>{let t=l(e),n=e.split(`
22
- `),r=t.at(-1)?.line??n.length,i=n.slice(0,r-1).reduce((e,t)=>e+t.length+1,0)+n[r-1].indexOf(`====`),a=e.indexOf(` `,e.search(li));if(a===-1||a>=i)return;let o=e.slice(0,a).split(`
23
- `).length,s=a-e.lastIndexOf(`
24
- `,a-1),c=t.findLast(e=>e.kind!==`End`&&(e.line<o||e.line===o&&e.column<s));return{offset:a,line:o,column:s,end:{reason:ui,line:c?.line??o,column:c?c.endColumn+1:s,isEnd:!0}}},pi=e=>{try{return e()}catch(e){if(!(e instanceof c)||!e.failure)throw e;return e.failure}},mi=e=>typeof e==`object`&&!!e&&`reason`in e,hi=e=>{let t=pi(()=>fi(e));if(mi(t))return[t];let n=pi(()=>_(t?e.slice(0,t.offset):e));return t&&(!mi(n)||n.isEnd)?[{reason:`Unexpected TAB character. TLAPS does not handle TAB characters in source files.`,line:t.line,column:t.column,isEnd:!1},mi(n)&&n.reason===ui?n:t.end]:mi(n)?[n]:n},gi=(e,t,n,r,i)=>{if(!li.test(e.source))throw new s(`No tokens in file`);let a=hi(e.source);if(Array.isArray(a)){a.forEach(t=>{let n=`File ${JSON.stringify(e.file)}, line ${t.line}, character ${t.column}\n${t.reason}`;r({text:n,channel:`stderr`}),r({text:`${n}\n`,channel:`toolboxOnly`})});let t=`Could not parse ${JSON.stringify(e.file)} successfully.`;throw r({text:`${i}Error: ${t}`,channel:`stderr`}),new s(t,{failure:`Module.Parser.parse_file`})}let o=si(e.file,e.source,t,n).convertModule(a),c=e.file.slice(e.file.lastIndexOf(`/`)+1),l=c.replace(/\.tla$/,``);return o.name===l?o:(r({text:`${de(o.location)}Warning: module name ${JSON.stringify(o.name)} does not match file name ${JSON.stringify(c)}.`,channel:`toolbox`}),{...o,name:l})},_i=e=>{let t=new Map([...e].map(([e,t])=>[e,hr(t).dependencies])),n=/* @__PURE__ */ new Set,r=[],i=a=>{if(n.has(a))return;n.add(a);let o=e.get(a);if(!o)throw new s(`Module "${a}" not found`);(t.get(a)??[]).forEach(i),r.push(o)};return[...e.keys()].sort(_r).forEach(i),r},vi=(e,t,n)=>t.length===0?[]:[` ${e}_proofs_count = ${t.length}`,...t.map((t,r)=>` ${e}_proof_${n+r+1} at ${ce(t)}`)],yi=(e,t,n)=>{let r=e.location;return[` ---- incomplete proof of theorem at ${r?ce({...r,endLine:r.startLine,endColumn:r.startColumn}):`<unknown location>`} ----`,...vi(`missing`,e.absent,t),...vi(`omitted`,e.omitted,n),` ====`]},bi=e=>{let t=e.summary,n=t.theorems.reduce((e,t)=>t.absent.length+t.omitted.length===0?e:{lines:[...e.lines,...yi(t,e.missing,e.omitted)],missing:e.missing+t.absent.length,omitted:e.omitted+t.omitted.length},{lines:[],missing:0,omitted:0});return[`---- summary of module ${JSON.stringify(e.name)} ----`,` obligations_count = ${t.total}`,...t.absent.length>0?[` missing_proofs_count = ${t.absent.length}`]:[],...t.omitted.length>0?[` omitted_proofs_count = ${t.omitted.length}`]:[],...n.lines,`====`].join(`
25
- `)},xi=(e,t,n={})=>{let r=n.lines??ci,i=n.onWarning??(()=>{}),a={value:0},o=new Map(lr);e.forEach(e=>{let t={...gi(e,a,!0,i,`File "<unknown>":
26
- `),isImportant:!0};o.set(t.name,t)});let c=[...o.values()].sort((e,t)=>_r(e.name,t.name)),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set;for(let e=0;e<c.length;e++){let n=hr(c[e]);n.submodules.forEach((e,t)=>{u.add(t),o.has(t)||o.set(t,e)});for(let e of n.dependencies){if(o.has(e)&&!lr.has(e))continue;let r=t(e);if(!r){!o.has(e)&&!l.has(e)&&l.set(e,n.locations.get(e));continue}let s=gi(r,a,!1,i,ue(n.locations.get(e)));o.set(e,s),c.push(s)}}let d=[...l.keys()].filter(e=>!u.has(e)).sort(_r);if(d.forEach(e=>i(D(l.get(e),`Unknown module ${JSON.stringify(e)}`))),d.length>0)throw new s(`Unknown module ${JSON.stringify(d[0])}`,{failure:`Module.Parser.load_module`});let f={anonymizer:dt(a,(e,t)=>Mr(f,e,t),i),generator:jn(a,new Set(e.map(e=>e.file)),r,i),salts:{value:0},latestModules:/* @__PURE__ */ new Map,onWarning:i},p=_i(o).map(e=>e.isStandard?e:mr(o,e,/* @__PURE__ */ new Set)),m=new Map(p.map(e=>[e.name,e]));return p.flatMap(e=>{if(e.isStandard)return[];let t=Nr(f,m,void 0,e);if(!e.isImportant)return[];let n=Pr(f,[],t),i=n.obligations.flatMap((e,t)=>{let n=e.location;if(e.kind.kind===`Omitted`||n&&(n.startLine<r.start||n.endLine>r.end))return[];let i=e.kind.kind===`Error`?e.kind.message:`${sn(e.sequent)}\n`;return[{id:t+1,location:di(n),text:i}]});return[{name:e.name,location:e.location,obligations:i,summary:n.summary}]})},Si={success:o.success,"assumption-violation":o.assumptionViolation,deadlock:o.deadlock,"invariant-violation":o.safetyViolation,"property-violation":o.safetyViolation,"liveness-violation":o.livenessViolation,"postcondition-violation":o.assumptionViolation,error:o.error},Ci=se(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-lncheck <final|default>`},{flag:`-seed <num>`},{flag:`-workers <count|auto>`}]),wi=se(`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}]),Ti=[`Usage: ${Ci.usage}`,` ${wi.usage}`,` tla-ts prove [<tlapm option>]... <Module.tla|glob>...`].join(`
27
- `),Ei=/[*?[{]/,Di=e=>e.flatMap(e=>Ei.test(e)?ee(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Oi=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),ki=e=>e?e[0]===`auto`?ae():Math.max(1,Number.parseInt(e[0],10)||1):1,Ai=e=>{let n=Object.entries(e);n.forEach(([e,i])=>console.log(`${n.length===1?``:`/\\ `}${e} = ${r(t(i))}`)),console.log(``)},ji=(e,t=`Error: The behavior up to this point is:`)=>{e.length>0&&console.log(t),e.forEach((e,t)=>{console.log(`State ${t+1}: <${e.label??e.action??`Initial predicate`}>`),Ai(e.state)})},Mi=e=>{if(e.failure)console.log(`Error: ${e.failure.message}`),e.failure.initialState&&(console.log(`While working on the initial state:`),Ai(e.failure.initialState)),ji(e.failure.trace);else if(e.violation){let t=e.violation,n=t.name,r=t.loopStart,i=r===void 0&&t.trace.length===1&&(e.status===`invariant-violation`||e.status===`liveness-violation`),a={success:``,error:``,"assumption-violation":t.message?`Error: Evaluating assumption ${n} failed.\n${t.message}`:`Error: Assumption ${n} is false.`,deadlock:`Error: Deadlock reached.`,"invariant-violation":i?`Error: Invariant ${n} is violated by the initial state:`:`Error: Invariant ${n} is violated.`,"property-violation":`Error: Property ${n} is violated.`,"liveness-violation":r===void 0?i?`Error: Property ${n} is violated by the initial state:`:`Error: Action property ${n} is violated.`:`Error: Temporal property ${n} was violated.\n`,"postcondition-violation":`Error: ${t.message??`Postcondition ${n} is false.`}`}[e.status];if(t.counts&&console.log(t.counts),console.log(a),i)Ai(t.trace[0].state);else if(r===void 0)ji(t.trace);else{ji(t.trace,`Error: The following behavior constitutes a counter-example:
28
- `);let e=r===t.trace.length-1;console.log(e?`State ${r+2}: Stuttering`:`Back to state ${r+1}${t.loopLabel?`: <${t.loopLabel}>\n`:``}`)}let o=t.unwitnessed;if(o?.counts&&console.log(o.counts),o&&console.log(`Error: ${o.message}`),i||e.status===`assumption-violation`)return}else{let t=d(e.distinctStates,e.generatedStates);if(console.log(`Model checking completed. No error has been found.`),console.log(` Estimates of the probability that TLC did not check all reachable states`),console.log(` because two distinct states had the same fingerprint:`),console.log(` calculated (optimistic): val = ${m(t)}`),e.fingerprintDistance!==void 0){let t=g(e.fingerprintDistance);console.log(` based on the actual fingerprints: val = ${m(t)}`)}}console.log(`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`),console.log(`The depth of the complete state graph search is ${e.depth}.`);let t=e.outDegrees&&h(e.outDegrees);t&&console.log(t)},Ni=async(e,t)=>{if(!y(e))return console.error(`Cannot find the specification file ${e}`),o.configParseError;let r=t.get(`-config`)?.[0]??(t.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!r||!y(r))return console.error(`Cannot find the configuration file ${r??``}`),o.configParseError;let i=n(x(r,`utf8`));t.has(`-deadlock`)&&(i.checkDeadlock=!1);let a=t.has(`-seed`)?t.get(`-seed`)?.[0]:`0`;if(a===void 0)return console.error(`Error: seed required.`),1;if(!Oi(a))return console.error(`Error: An integer for seed required. But encountered ${a}`),1;let s=t.has(`-lncheck`)?t.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(s===void 0)return console.error(`Error: expect a strategy such as final for -lncheck option.`),1;let c=E(e);console.log(`Checking ${w(e)} with ${w(r)}`);let l=await v({workers:ki(t.get(`-workers`)),livenessCheck:[`final`,`seqfinal`,`off`].includes(s)?`final`:`default`,seed:BigInt(a),source:x(e,`utf8`),config:i,onPause:()=>S(0,Buffer.alloc(1)),loadModule:e=>{let t=re(c,`${e}.tla`);return y(t)?x(t,`utf8`):void 0},loadClass:e=>{let t=re(c,`${e}.class`);return y(t)?x(t):void 0},readFile:e=>y(e)?x(e,`utf8`):void 0,writeFile:(e,t)=>{b(E(ie(e)),{recursive:!0}),te(e,t)}});return Mi(l),l.failure?.exitCode??Si[l.status]},Pi=e=>{if(e instanceof p||e instanceof f)return console.log(`Error: ${e.message}`);console.error(`${e.name}: ${e.message}`)},Fi=async t=>{try{return await t()}catch(t){if(!(t instanceof e))throw t;return Pi(t),a(t)}},Ii=async(e,t)=>{let n=[];for(let[r,i]of e.entries())r>0&&console.log(``),n.push(await Fi(()=>t(i)));return n.find(e=>e!==o.success)??o.success},Li=()=>(process.env.PATH??``).split(T).map(e=>re(e,`tlapm`)).filter(e=>y(e)),Ri=()=>Li().map(e=>re(E(E(C(e))),`lib/tlapm/stdlib`)).find(e=>y(e)),zi=e=>e.flatMap(e=>Ei.test(e)?ee(e).sort():[e]),Bi=e=>{let t=Li()[0];return t===void 0?(console.error(`Error: tla-ts prove runs tlapm to prove obligations, but tlapm isn't on your PATH. Install tlapm, or pass -N to only generate the obligations.`),1):ne(t,zi(e),{stdio:`inherit`}).status??1},Vi=e=>y(e)?{file:e,source:x(e,`utf8`)}:void 0,Hi=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Ui=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Wi=e=>{let t=/* @__PURE__ */ new Date,n=e=>String(e).padStart(2,`0`),r=`${t.getFullYear()}-${n(t.getMonth()+1)}-${n(t.getDate())}`,i=`${n(t.getHours())}:${n(t.getMinutes())}:${n(t.getSeconds())}`;console.log(`\n\\* TLAPM version 5f5037f\n\\* launched at ${r} ${i} with command line:\n\\* ${[`tla-ts`,`prove`,...e].map(Ui).join(` `)}\n`)},Gi={incomplete:11,emptyTarget:12},Ki=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${le(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${le(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${ue(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${ue(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[Gi.incomplete]:[],...a?[Gi.emptyTarget]:[]]},qi=e=>{try{return e()}catch(e){if(!(e instanceof s))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},Ji=e=>{if(!e.includes(`-N`)&&!e.includes(`--summary`))return Bi(e);let t=wi.parse(e),n=t.unknown[0];if(n!==void 0)return console.error(`Error: tla-ts prove does not support the tlapm option ${n}.`),1;if(t.incomplete)return console.error(`Error: option '${t.incomplete.name}' needs an argument.`),1;let r=t.options.find(e=>e.name!==`-I`&&e.values.some(e=>!/^-?\d+$/.test(e)));if(r)return console.error(`Error: option '${r.name}' expects an integer.`),1;let i=zi(t.positionals),a=i.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(a.length===0)return console.error(Ti),1;let c=t.has(`--toolbox`)||t.has(`--line`);c&&Wi(e);let l=t.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?ci:{start:n,end:n}:e},ci),u=Ri(),d=t.options.flatMap(e=>e.name===`-I`?e.values:[]),f=a.reduce((e,t)=>e.includes(E(t))?e:[E(t),...e],[`.`,...u?[u]:[],...d.toReversed()]),p=qi(()=>{let e=a.findIndex(e=>!y(e));if(e!==-1){let t=i[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(t)} not found`),new s(`File ${t} not found`,{failure:`Module.Parser.parse_file`})}return xi(a.map(e=>({file:`./${e}`,source:x(e,`utf8`)})),e=>f.map(t=>Vi(`${t}/${e}.tla`)).find(Boolean),{lines:l,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(c&&t)return Hi([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!p)return 3;let m=p.flatMap(e=>(t.has(`--summary`)&&console.log(bi(e)),c&&(e.obligations.forEach(e=>Hi([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:to be proved`,...t.has(`--printallobs`)?[`obl:${e.text}`]:[]])),Hi([`type:obligationsnumber`,`count:${e.obligations.length}`])),t.has(`--strict`)?Ki(e,l.start>0||l.end<1/0,t.has(`--summary`)):[]));return m.includes(Gi.incomplete)?Gi.incomplete:m[0]??o.success},Yi=async e=>{if(e[0]===`prove`)return Fi(()=>Ji(e.slice(1)));let t=Ci.parse(e),n=Di(t.positionals),r=t.has(`-config`),i=n.map(e=>({...e,path:e.path.replace(/\.cfg$/,`.tla`)})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||r||y(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);return i.length===0?(console.error(Ti),1):r&&i.length>1?(console.error(`Error: -config applies to one specification, but several were given.`),1):Ii([...new Set(i)],e=>Ni(e,t))},Xi=async()=>{process.exitCode=await Yi(process.argv.slice(2))};export{Xi as runCli};
9
+ import{C as e,D as t,M as n,R as r,T as i,U as a,V as o,a as s,b as c,g as l,h as u,k as d,m as f,o as p,s as m,x as h,z as g}from"./worker.js";import{$ as _,B as v,C as y,D as b,E as x,G as S,H as C,L as w,M as ee,N as T,O as E,Q as D,R as O,T as k,U as te,V as A,W as j,_ as ne,et as re,h as ie,j as ae,k as oe,m as M,nt as se,q as ce,tt as le,v as ue,w as de,z as fe}from"./transfer.js";import{a as pe,c as me,d as he,f as ge,i as _e,l as N,m as ve,n as ye,o as be,p as xe,s as Se,t as Ce,u as we}from"./prove.js";import{getTlapmPaths as Te}from"./tlapm.js";import{basename as Ee,delimiter as De,dirname as Oe,isAbsolute as ke,join as Ae,resolve as je}from"node:path";import{cpSync as Me,existsSync as P,globSync as F,mkdirSync as Ne,readFileSync as Pe,readSync as Fe,readdirSync as Ie,realpathSync as Le,renameSync as Re,rmSync as ze,statSync as Be,writeFileSync as Ve}from"node:fs";import{arch as He,availableParallelism as Ue,release as We,tmpdir as Ge,type as Ke}from"node:os";import{pathToFileURL as qe}from"node:url";import{getHeapStatistics as Je}from"node:v8";var Ye=`0.0.4-dev.2a873ee`;const Xe=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Ze=(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(Xe).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}}}},Qe=2224400062,I={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},$e={smallInt:64,smallString:32,smallBlock:128},L=(e,...t)=>({tag:e,fields:t}),et=e=>typeof e==`object`&&`tag`in e,tt=(t,n)=>{let r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.length<n+20||r.getUint32(n)!==Qe)throw new e(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o={position:n+20},s=t=>{let n=o.position;if(o.position+=t,o.position>i)throw new e(`corrupted fingerprint file`);return n},c=new TextDecoder,l=e=>{let n=s(e),r=c.decode(t.subarray(n,n+e));return a.push(r),r},u=(e,t)=>{let n=L(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=t[s(1)];if(n>=$e.smallBlock)return u(n&15,n>>4&7);if(n>=$e.smallInt)return n&63;if(n>=$e.smallString)return l(n&31);switch(n){case I.int8:return r.getInt8(s(1));case I.int16:return r.getInt16(s(2));case I.int32:return r.getInt32(s(4));case I.shared8:return d(r.getUint8(s(1)));case I.shared16:return d(r.getUint16(s(2)));case I.shared32:return d(r.getUint32(s(4)));case I.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case I.string8:return l(r.getUint8(s(1)));case I.string32:return l(r.getUint32(s(4)));case I.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new e(`corrupted fingerprint file`)};return{value:f(),next:i}},nt=e=>{let t=[],n={objects:0,words32:0,words64:0},r=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},i=new TextEncoder,a=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push($e.smallInt+e):e>=-128&&e<128?t.push(I.int8,e&255):e>=-32768&&e<32768?(t.push(I.int16),r(e,2)):(t.push(I.int32),r(e,4));if(n.objects++,typeof e==`string`){let a=i.encode(e);a.length<32?t.push($e.smallString+a.length):a.length<256?t.push(I.string8,a.length):(t.push(I.string32),r(a.length,4)),t.push(...a),n.words32+=1+Math.floor((a.length+4)/4),n.words64+=1+Math.floor((a.length+8)/8);return}if(!et(e)){let r=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));r.setFloat64(0,e.float,!0),t.push(I.doubleLittle,...new Uint8Array(r.buffer)),n.words32+=3,n.words64+=2;return}let o=e.fields.length;o===0?n.objects--:(n.words32+=1+o,n.words64+=1+o),e.tag<16&&o<8?t.push($e.smallBlock+e.tag+(o<<4)):(t.push(I.block32),r(o*1024+e.tag,4)),e.fields.forEach(a)};a(e);let o=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[Qe,t.length,n.objects,n.words32,n.words64].forEach((e,t)=>o.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(o.buffer),...t])},rt=20210223,it={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16}},at=[`false`,`timeout`],ot=`tla-ts ${Ye}`,st=/* @__PURE__ */ new Map([[it.zenon.field,3],[it.isabelle.field,4]]),R=(e,t)=>e!==void 0&&et(e)?e.fields[t]:void 0,ct=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,lt=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},ut=e=>e!==void 0&&et(e)?[[e.fields[0],e.fields[1]],...ut(e.fields[2])]:[],dt=(t,n,r)=>{let i=Pe(n),a=tt(i,0),o=tt(i,a.next).value;if(a.value!==rt||!et(o)||o.tag!==0)throw new e(`corrupted fingerprint file`);let s=R(R(o,0),1),c=(e,t)=>{let n=st.get(t);return!r||n===void 0||R(R(e,0),n)===ot};t.clear(),(s!==void 0&&et(s)?s.fields:[]).flatMap(e=>ut(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!et(r))throw new e(`corrupted fingerprint file`);t.set(n,r.fields.map((e,t)=>c(e,t)?e:0))})},ft=(e,t)=>{let n=R(t,0),r=R(n,0),i=R(R(n,1),0);if(r===void 0||r===1)return;let a=ct(R(e===`isabelle`?R(i,0):i,0)),o=e===`isabelle`?R(i,1):void 0,s=R(R(r,0),0);return{method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,isReused:!1,...s!==void 0&&{reason:typeof s==`number`?at[s]:String(R(s,0))}}},pt=e=>{let t=/* @__PURE__ */ new Date,n=e.method,r={float:n.rlimit??n.timeLimitMs/1e3},i=n.prover===`zenon`?L(0,r,5):n.prover===`isabelle`?L(0,L(0,r),n.tactic??`auto`):L(0,r),a=at.indexOf(e.reason??``),o=e.reason===void 0?0:L(0,a===-1?L(0,e.reason):a);return L(0,L(0,L(0,e.isProved?0:L(0,o),L(it[n.prover].tag,i)),L(0,t.getFullYear(),t.getMonth(),t.getDate(),t.getHours(),t.getMinutes(),t.getSeconds()),ot,ot,ot))},mt=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=lt(r)&t-1;n[i]=L(0,r,L(0,...e),n[i])}),L(0,L(0,e.size,L(0,...n),0,512))},ht=e=>String(e).padStart(2,`0`),gt=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=Ae(r,`${n.getFullYear()}-${ht(n.getMonth()+1)}-${ht(n.getDate())}_${ht(n.getHours())}_${ht(n.getMinutes())}_${ht(n.getSeconds())}`);Ne(i,{recursive:!0}),[e,...t].filter(e=>P(e)).forEach(e=>Me(e,Ae(i,Ee(e)),{preserveTimestamps:!0})),Ie(r).map(e=>Ae(r,e)).sort((e,t)=>Be(t).mtimeMs-Be(e).mtimeMs).slice(10).forEach(e=>ze(e,{recursive:!0,force:!0}))},_t=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(Object.entries(it).flatMap(([e,n])=>{let i=ft(e,R(r[n.field],0));return i?(t.set(i,r[n.field]),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];r.forEach((e,n)=>{a[it[n].field]=t.get(e)??pt(e)}),e.set(i,a)}),Ve(`${i}.tmp`,Buffer.concat([nt(rt),nt(mt(e))])),Re(`${i}.tmp`,i)}}},vt={builtin:1,number:2,string:3,ident:4,added:5},yt=()=>({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}),bt=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)},xt=[`unfair`,`wf`,`sf`],z=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),St=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}`,Ct=e=>{if(e.kind!==`LabeledStmt`)throw new m(`ClassCastException: ${e.kind}`);return e},wt=(e,t)=>{if(t<0||t>=e.length)throw new m(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},Tt=(e,t,n)=>({string:e,column:t,type:n}),Et=e=>e.type===vt.string?e.string.length+2:e.string.length,Dt=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Ot=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},kt=e=>{let t=Dt(e);return Ot(t),t},At=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new m(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new p(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},jt=e=>kt(e.tokens.map(e=>e.map(e=>({...e})))),Mt=(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+Et(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,At(e)},Nt=e=>e.tokens.length===1&&e.tokens[0].length===1,Pt=(e,t)=>wt(wt(e.tokens,t.line),t.item),Ft=(e,t,n)=>{if(e.tokens.length<=t.line)throw new s(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new s(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},It=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=Pt(e,r),i=n.type===vt.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Ft(e,r,2):void 0,o=a===void 0?void 0:Pt(e,a),s=o!==void 0&&o.type!==vt.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Ft(e,r,c)}},Lt=(e,t,n,r)=>{let i=Pt(e,n);if(Nt(e)){let n=jt(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+Et(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(Nt(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=vt.builtin);let n=jt(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(Tt(`)`,e.column+Et(e),vt.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+Et(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return At(e),Ft(e,d,1)},Rt=(e,t,n,r=!0)=>{let i=n.map(t=>It(e,t,{line:0,item:0}));for(;;){let a=i.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(a===void 0)return;let o=Ft(e,a.position,1),s=Lt(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:It(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new m(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},zt=(e,t,n)=>{let r=jt(e);return Rt(r,t,n),r},Bt=(e,t,n)=>e.map(e=>zt(e,t,n)),Vt=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===vt.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
+ `)} >>`},Ht=(e,t,n)=>{let r=e=>Vt(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 |-> "${xt[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)},Ut=(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}),Wt=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},Gt=e=>{if(e.column>0){--e.column,--e.vcolumn;return}if(e.line===0)throw new s(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line;let t=Array.from(e.lines[e.line]);for(e.currentLine=t,e.column=0,e.vcolumn=0;e.column<t.length-1;)Wt(e)},Kt=e=>{for(;;){let t=Wt(e);if(t===` `)return` `;if(t!==` `&&t!==`
12
+ `)break}return Gt(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},qt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),Jt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),Yt=/* @__PURE__ */ new Set([...qt,...Jt,...`_ 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(` `)]),Xt=e=>/^[A-Za-z_]$/.test(e),Zt=e=>/^[0-9]$/.test(e),Qt=e=>e===` `||e===`\f`||e===`\r`,$t=new Set([...Yt].filter(e=>!Xt(e[0])&&!(e[0]===`\\`&&Xt(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),en=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),tn=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(` `)),B={...vt,dashes:6,endModule:7},nn=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),rn=(e,t,n,r)=>{let i={lines:[],line:[],token:``,state:`start`,column:t.vcolumn,nextColumn:t.vcolumn,nextChar:Wt(t),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},a=()=>{i.nextColumn=t.vcolumn,i.nextChar=Wt(t)},o=()=>{i.token+=i.nextChar,a()},c=()=>{i.state=`start`,i.column=i.nextColumn},l=()=>{i.lines.push(i.line),i.line=[],i.column=0},u=e=>{throw new p(`${e} \`${i.token}' found at\n line ${t.line+1}, column ${i.column+1}`)},d=()=>{i.isExprEnd=!0,e.delimiter=i.token,e.delimiterCol=i.column,e.delimiterLine=t.line-+(i.nextChar===`
13
+ `)},f=e=>{if(!n){d(),i.token=``;return}e>B.ident&&u(`Illegal token in an expression`);let t=i.token;e!==B.string&&(tn.has(t)&&!(e===B.ident&&[`.`,`[`,`,`].includes(i.previousToken))||(t===`,`&&!i.isInQuantifier&&!r||t===`)`||t===`}`)&&i.parenDepth===0)?(i.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),i.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),i.line.length>0&&l()):(e===B.builtin&&qt.has(t)&&(i.parenDepth+=1),e===B.builtin&&Jt.has(t)&&(--i.parenDepth,i.parenDepth<0&&u(`Extra (unmatching)`)),i.previousToken=e===B.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&i.parenDepth===0&&(i.isInQuantifier=!0),i.isInQuantifier&&t===`:`&&i.parenDepth===0&&(i.isInQuantifier=!1),(t!==``||e===B.string)&&i.line.push(Tt(t,i.column,e)),i.token=``)},m=e=>{f(e),c()},h=e=>{o(),i.state=e},g=e=>{a(),i.state=e},_=n=>{switch(i.state){case`start`:if(Qt(n))return a(),c();if(Xt(n))return h(`id`);if(n===`ℕ`||n===`ℤ`||n===`ℝ`)return o(),m(B.ident);if(Zt(n))return h(`numOrId`);if(n===`\\`)return h(`bs`);if(n===`-`)return h(`dash1`);if(n===`=`)return h(`eq1`);if(n===`(`)return g(`leftParen`);if(n===`"`)return g(`string`);if(n===`
14
+ `)return a(),l(),c();if($t.has(n))return h(`builtIn`);if(n===` `){i.state=`done`;return}return o(),u(`Illegal lexeme`);case`id`:return i.token===`WF_`||i.token===`SF_`?m(B.builtin):Xt(n)||Zt(n)?o():m(Yt.has(i.token)?B.builtin:B.ident);case`numOrId`:return Zt(n)?o():Xt(n)?h(`id`):m(B.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(n))return h(`numOrBi`);if(Xt(n)){i.state=`bsBuiltIn`;return}if(n===`*`){a(),i.token=``,i.state=`lineComment`;return}i.state=`builtIn`;return;case`numOrBi`:i.state=Zt(n)?`num`:`bsBuiltIn`;return;case`num`:if(Zt(n))return o();if(!Xt(n))return m(B.number);o(),i.token.startsWith(`\\`)&&u(`Illegal lexeme`),i.state=`id`;return;case`bsBuiltIn`:return Xt(n)&&n!==`_`?o():Yt.has(i.token)?m(B.builtin):u(`Illegal lexeme `);case`builtIn`:if($t.has(i.token+n))return o();if(!Yt.has(i.token)){for(Gt(t);!Yt.has(i.token);)Gt(t),i.token.length===0&&u(`Illegal lexeme`),i.token=Array.from(i.token).slice(0,-1).join(``);a()}return m(B.builtin);case`dash1`:case`dash2`:if(n===`-`)return h(i.state===`dash1`?`dash2`:`dash3`);i.state=`builtIn`;return;case`dash3`:return n!==`-`&&u(`Illegal lexeme`),h(`dashes`);case`dashes`:return n===`-`?o():m(B.dashes);case`eq1`:case`eq2`:if(n===`=`)return h(i.state===`eq1`?`eq2`:`eq3`);i.state=`builtIn`;return;case`eq3`:return n!==`=`&&u(`Illegal lexeme`),h(`eqs`);case`eqs`:return n===`=`?o():m(B.endModule);case`leftParen`:if(n===`*`)return e.commentDepth=1,g(`comment`);i.token=`(`,i.state=`builtIn`;return;case`string`:if(n===`\\`)return h(`escString`);if(n===`"`)return a(),m(B.string);o(),en.has(n)||u(`Illegal character in string`);return;case`escString`:o(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(n)||u(`Illegal character following \\ in string`),i.state=`string`;return;case`lineComment`:return n===`(`?g(`lineComParen`):n===`*`&&e.commentDepth>0?g(`lineComStar`):n===`
15
+ `||n===` `?(i.token=``,e.commentDepth=0,c()):e.commentDepth===0?o():a();case`lineComParen`:if(n===`*`)return e.commentDepth+=1,g(`lineComment`);e.commentDepth===0&&(i.token+=`(`),i.state=`lineComment`;return;case`lineComStar`:if(n===`)`){if(--e.commentDepth,e.commentDepth<0)throw new s(`Failure of assertion: case LINE_COM_STAR`);return g(`lineComment`)}e.commentDepth===0&&(i.token+=`*`),i.state=`lineComment`;return;case`comment`:case`orComment`:{let t=i.state===`comment`;if(n===`*`)return g(t?`commentStar`:`orCommentStar`);if(n===`(`)return g(t?`commentParen`:`orCommentParen`);if(n===`
16
+ `){i.token=``,a(),l(),i.state=`orComment`;return}if(n===` `)throw new p(t?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?o():a()}case`commentStar`:case`orCommentStar`:{let t=i.state===`commentStar`?`comment`:`orComment`;if(n!==`)`){e.commentDepth===1&&(i.token+=`*`),i.state=t;return}if(a(),--e.commentDepth,t===`orComment`&&e.commentDepth<0)throw new s(`Assertion failure`);if(e.commentDepth!==0){i.state=t;return}return i.token=``,c()}case`commentParen`:case`orCommentParen`:{let t=i.state===`commentParen`?`comment`:`orComment`;if(n===`*`)return e.commentDepth+=1,g(t);e.commentDepth===1&&(i.token+=`(`),i.state=t;return}}};for(;i.state!==`done`&&!i.isExprEnd;)_(i.nextChar);return i.nextChar!==`
17
+ `&&Gt(t),kt(i.lines)},an=(e,t,n)=>rn(e,t,!0,n),on=(e,t)=>(rn(e,t,!1,!1),e.delimiter),sn=(e,t)=>({params:e,tokenizer:nn(),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}),cn=()=>kt([[Tt(`defaultInitValue`,0,0)]]),ln=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],un=(e,t)=>!t.some(t=>e.includes(t)),dn=(e,t)=>{t.splice(0,t.length,...e)},fn=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o={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:r.inputVersionNumber>=1500,omitStutteringWhenDone:r.inputVersionNumber>=1500},c=e=>{throw new p(`${e}\n line ${a.line}, column ${a.column}`)},l=()=>{if(o.lookaheadSize===0)return Kt(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=on(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o.lookaheadSize;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o.lookaheadSize,a.text=n,n},u=n=>{for(;o.lookaheadSize<n;){let n=o.lookaheadSize;if(Kt(t)===` `)throw new p(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=on(e.tokenizer,t),o.lookaheadSize+=1}return i.tokens[n-1]},d=n=>{if(n<o.lookaheadSize)throw new s(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
18
+ it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=on(e.tokenizer,t),o.lookaheadSize+=1;return Kt(t)},f=(n=!1)=>{if(o.lookaheadSize!==0)throw new s(`ParseAlgorithm: GetExpr called after lookahead`);let r=an(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},h=(e,t)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new p(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=l();n!==e&&n!==t&&c(`Expected "${e}" but found "${n}"`)},g=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},_=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},v=()=>h(u(1)===`,`?`,`:`;`),y=()=>h(o.pSyntax?`begin`:`{`),b=e=>{o.cSyntax?h(`}`):(h(`end`),h(e))},x=()=>{u(1)===`variables`?g(`variables`):h(`variable`)},S=()=>{let e={...z(),kind:`VarDecl`,var:l(),col:a.column,line:a.line,isEq:!0,val:cn()};if(![`=`,`\\in`,`∈`].includes(u(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=_(),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},C=()=>{x();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(S()),v();return e},w=()=>{let e={...z(),kind:`PVarDecl`,var:l(),col:a.column,line:a.line,val:cn()};if(u(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(h(`=`),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},ee=()=>{x();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(w()),v();return e},T=()=>{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=Kt(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},E=()=>{if(!T())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),h(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(h(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},D=()=>{let e=[],t=e=>o.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...k());return o.cSyntax&&e.length===0&&c(`Empty statement list`),e},O=e=>{g(`{`);let t=D();if(h(`}`),h(`;`),e!==``){if(t[0].lbl!==``)throw new p(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},k=()=>{let e=E();if(o.cSyntax&&u(1)===`{`)return O(e);let t=te();return t.lbl=e,[t]},te=()=>{let e=u(1);if(e===`if`)return j(0);if(e===`either`)return ne();if(e===`with`)return re(0);if(e===`when`||e===`await`){g(e);let t=a.column,n=a.line,r=f();if(r.tokens.length===0)throw new m(`NullPointerException`);return h(`;`),{...z(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){g(e);let t=a.column,n=a.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),h(`;`),{...z(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){g(`skip`);let e={...z(),kind:`Skip`,col:a.column,line:a.line};return h(`;`),e}if(e===`call`)return se();if(e===`return`){g(`return`);let e={...z(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return h(`;`),e}if(e===`goto`){g(`goto`);let e=a.column,t=a.line,n=l();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),{...z(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?A():d(1)[0]===`(`?ce():ae()},A=()=>{g(`while`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=f();o.cSyntax&&h(`)`),n.tokens.length===0&&c(`Empty while test at `),o.pSyntax&&h(`do`);let r=o.pSyntax?D():k();return o.pSyntax&&(h(`end`),h(`while`),h(`;`)),r.length===0&&c(`Missing body of while statement at`),{...z(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},j=e=>{g(e===0?`if`:`elsif`);let t={...z(),kind:`LabelIf`,col:a.column,line:a.line,test:Dt(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&h(`(`),t.test=f(),o.cSyntax&&h(`)`),t.test.tokens.length===0&&c(`Empty if test at `),o.pSyntax&&h(`then`),t.unlabThen=o.pSyntax?D():k();let n=u(1);return n===`else`&&(g(`else`),t.unlabElse=o.pSyntax?D():k()),o.pSyntax&&n===`elsif`&&(t.unlabElse=[j(e+1)]),o.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),o.pSyntax&&e===0&&(h(`end`),h(`if`),h(`;`)),t.unlabElse.length===0&&wt(t.unlabThen,t.unlabThen.length-1),t},ne=()=>{g(`either`);let e={...z(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...z(),kind:`Clause`,unlabOr:o.pSyntax?D():k(),labOr:[]};if(t.unlabOr.length===0)throw new p("`either' statement with empty `or' clause",e);if(e.clauses.push(t),u(1)!==`or`)break;g(`or`)}if(o.pSyntax&&(g(`end`),h(`either`),h(`;`)),e.clauses.length===1)throw new p("`either' statement has no `or'",e);return e},re=e=>{e===0&&(h(`with`),o.cSyntax&&h(`(`));let t={...z(),kind:`With`,col:a.column,line:a.line,var:l(),isEq:!0,exp:Dt(),Do:[]};t.isEq=_(),t.exp=f(),(o.pSyntax||u(1)!==`)`)&&v(),t.exp.tokens.length===0&&c(`Empty with expression at `);let n=o.pSyntax&&u(1)===`do`,r=o.cSyntax&&u(1)===`)`;if(n&&h(`do`),r&&g(`)`),t.Do=n?D():r?k():[re(e+1)],n&&(h(`end`),h(`with`),h(`;`)),t.Do.length===0)throw new p(`Missing body of with statement`,t);return t},ie=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...z(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};h(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...z(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},ae=()=>{let e={...z(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[ie()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ie())}catch(e){if(!(e instanceof p))throw e;c(`Bad assignment statement at `)}}return h(`;`),e},oe=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;h(`,`)}return h(`)`),h(`;`),e},M=()=>{g(`call`);let e={...z(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:l(),args:[]};return h(`(`),e.args=oe(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},se=()=>{let e=M();if(u(1)===`return`)return g(`return`),h(`;`),{...z(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;g(`goto`);let t={...z(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),t},ce=()=>{let e={...z(),kind:`MacroCall`,name:l(),col:a.column,line:a.line,args:[]};return g(`(`),e.args=oe(),e},le=t=>{e.isInMacro=!0,g(`macro`);let n={...z(),kind:`Macro`,col:a.column,line:a.line,name:l(),params:[],body:[]};for(h(`(`);u(1)!==`)`;)n.params.length>0&&h(`,`),n.params.push(l());return g(`)`),y(),n.body=D(),b(`macro`),u(1)===`;`&&l(),xe(n.body,t),e.isInMacro=!1,n},ue=()=>{h(`procedure`);let e={...z(),kind:`Procedure`,col:a.column,line:a.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],h(`(`);u(1)!==`)`;)e.params.length>0&&h(`,`),e.params.push(w());return g(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=ee()),y(),e.body=D(),b(`procedure`),u(1)===`;`&&l(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},de=()=>{h(`process`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=l(),r=_(),i=f();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&h(`)`),i.tokens.length===0&&c(`Empty process id at `);let s=u(1)===`begin`||u(1)===`{`?[]:C();y();let d=D();return b(`process`),u(1)===`;`&&l(),{...z(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:s,body:d}},fe=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?fe():e},pe=e=>{e.lbl===``&&(e.lbl=fe(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(St(e)))},me=(e,t,n,r,i)=>{dn(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{pe(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new p("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new p("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=me(e.unlabThen,!1,n,i,t);a.isNextLabeled=me(e.unlabElse,!1,n,i,r)||o,dn(ln(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=me(e.unlabOr,!1,n,i,r)||a.isNextLabeled,dn(ln(r,t),t)}),dn(t,i);return}case`While`:if(n)throw new p("`while' inside a `with' statement",e);s(e),me(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=me(e.Do,!1,!0,n?[...r]:[],t),dn(t,i),!n&&!un(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?ln([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,un(i,l))dn(ln(i,l),i);else{if(n)throw new p(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),dn(l,i)}}),a.hasLabel||a.isNextLabeled},he=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return he(n),{unlabeled:n,labeled:ge(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}}})},ge=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new s(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>he(e.stmts)),t},_e=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=N(n.unlabThen);n.labThen.forEach(e=>N(e.stmts));let i=N(n.unlabElse);return n.labElse.forEach(e=>N(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...z(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,N(t.unlabOr));return t.labOr.forEach(e=>N(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...z(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=N(n.Do);if(e===2)throw new p(`with statement at ${St(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new s("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return N(n.unlabDo),n.labDo.forEach(e=>N(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new p(`return statement not in a procedure at ${St(n)}`);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 s(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},N=e=>{for(let t=0;t<e.length;t++){let n=_e(e,t);if(n!==0){if(t===e.length-1)return n;throw new s(`Translator discovered later than it should have that\n Statement at ${St(e[t+1])} must have a label`)}}return 0},ve=e=>{me(e,!0,!1,[],[]);let t=ge(e);return t.forEach(e=>N(e.stmts)),t},ye=(e,t,n,r,i)=>{let a=e=>zt(e,t,n),o=e=>e.map(e=>ye(e,t,n,r,i)),c=e=>e.map(e=>({...z(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>ye(e,t,n,-1,0))})),l={...z(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>be(e,t,n,r,i))};case`If`:return{...l,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...l,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:c(e.labThen),unlabElse:o(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...z(),kind:`Clause`,labOr:c(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Bt(e.args,t,n)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:Bt(e.args,t,n)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:Bt(e.args,t,n)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new s(`Found unexpected statement type in macro at${St(e)}`)}},be=(e,t,n,r,i)=>{let a=zt(e.rhs,t,n),o={...z(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:zt(e.lhs.sub,t,n)},s={...z(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=Pt(l,{line:0,item:0});if(u.type!==vt.ident)throw new p(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${St(s)}`);if(o.var=u.string,Ft(l,{line:0,item:0},1)===void 0)return s;let d=jt(l);return d.tokens[0].splice(0,1),Ot(d),o.sub.tokens.length===0?o.sub=d:Mt(o.sub,d,0),s},xe=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return xe(e.unlabThen,t),xe(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>xe(e.unlabOr,t)),[e];case`With`:return xe(e.Do,t),[e];case`While`:return xe(e.unlabDo,t),[e];case`MacroCall`:return Se(e,t);default:return[e]}});e.splice(0,e.length,...n)},Se=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new p(`Macro ${e.name} undefined,\n at ${St(e)}`);if(n.params.length!==e.args.length)throw new p(`Macro ${e.name} called with wrong number of arguments at \n ${St(e)}`);let r=n.body.map(t=>ye(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},Ce=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new p(`Multiple definitions of macro name \`${t.name}'`)})},we=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1,o.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`||!Nt(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},Te=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new p([e,...o.addedLabelsLocs].join(`
19
+ `))},Ee=()=>{r.reportLabelsFlag?(e.log(o.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),o.addedLabels.forEach((t,n)=>e.log(` ${t} at ${o.addedLabelsLocs[n]}`))):e.log(`Labels added.`)},De=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,xe(t.body,e),t.body=ve(t.body)}),Oe=()=>{n&&(l()!==`algorithm`&&c("`--fair' not followed by `algorithm'"),r.fairAlgorithm=!0);let t=l();o.cSyntax=u(1)===`{`,o.pSyntax=!o.cSyntax,o.cSyntax&&g(`{`);let i=u(1)===`variable`||u(1)===`variables`?C():[],a={value:Dt()};u(1)===`define`&&(g(`define`),o.cSyntax&&h(`{`),a.value=f(!0),b(`define`),h(`;`));let s=[];for(;u(1)===`macro`;)s.push(le(s));for(;u(1)===`procedure`;)o.procedures.push(ue()),o.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let e=[];for(;u(1)===`fair`||u(1)===`process`;){let t=u(1)===`fair`;t&&g(`fair`);let n=t&&u(1)===`+`;n&&g(`+`);let i=n||!t&&r.fairnessOption===`sf`?2:t||r.fairnessOption===`wf`?1:0;e.push({...de(),fairness:i})}b(`algorithm`),Ce(s);let n=e.map(e=>(xe(e.body,s),e.body=ve(e.body),o.omitStutteringWhenDone=!0,we(e.body),o.omitStutteringWhenDone));return o.omitStutteringWhenDone=n.includes(!0),De(s),o.addedLabels.length>0&&(r.labelFlag||Te(),Ee()),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),o.gotoUsed&&(o.omitPC=!1),{...z(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,procs:e}}r.inputVersionNumber===1500&&u(1)===`fair`&&(h(`fair`),u(1)===`+`&&h(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),y();let d=D();Ce(s),xe(d,s),De(s),o.cSyntax&&h(`}`),b(`algorithm`);let p=ve(d);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&Te(),Ee()),o.gotoUsed&&(o.omitPC=!1),o.gotoDoneUsed||we(p),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),{...z(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,body:p}};try{return{ast:Oe(),omitPC:o.omitPC,omitStutteringWhenDone:o.omitStutteringWhenDone,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof m))throw e;return c(`Unknown error at or before`)}},V={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},pn=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],mn=/* @__PURE__ */ new Set([V.global,V.processVar,V.procedureVar,V.parameter]),hn=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),gn=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),_n=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},vn=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},yn=(e,t,n,r,i,a,o)=>!(t===V.procedureVar||t===V.processVar||t===V.parameter?hn(e,V.global,n,``)!==void 0||gn(e,n,r)!==void 0:hn(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),bn=(e,t,n,r)=>hn(e,t,n,r)?.useThis??n,xn=(e,t,n)=>{let r=gn(e,t,n);return r===void 0?t:mn.has(r.type)?r.useThis:t},Sn=e=>{let t={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},n=(e,n,i)=>{yn(t,V.label,e.label,n,i,e.line,e.col)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n,i))},r=(e,t,i)=>{let a=e=>e.forEach(e=>r(e,t,i)),o=e=>e.forEach(e=>n(e,t,i));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(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 s(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=`process`,i=n===``?V.global:V.processVar)=>{yn(t,i,e.var,n,r,e.line,e.col)||(t.errorReport+=`\n${pn[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(yn(t,V.global,`pc`,``,``,0,0),e.prcds.length>0&&yn(t,V.global,`stack`,``,``,0,0),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=_n(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Ct(e.body[0]).label}),yn(t,V.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>i(t,e.name,`procedure`,V.procedureVar)),e.params.forEach(t=>i(t,e.name,`procedure`,V.parameter)),e.body.forEach(t=>n(Ct(t),e.name,`procedure`))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=vn(t,e.name)<t.processes.length;r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processes.push({name:e.name,initialPC:e.body.length===0?void 0:Ct(e.body[0]).label}),yn(t,V.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Ct(t),e.name,`process`))}),e.kind===`Uniprocess`&&(e.body.length>0&&(t.initialPC=Ct(e.body[0]).label),e.body.forEach(e=>n(Ct(e),``,``))),t.errorReport.length>0)throw new p(t.errorReport);return t},Cn=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(`\\* ${pn[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},wn=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${pn[e.type]} name`);if(t.length>0)throw new p(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},Tn=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==vt.ident)return;let a=xn(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(kt([[On(a)]])))})),i.length>0&&Rt(e,i,r,!1)},i=(e,n)=>{e.var=xn(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=bn(t,V.label,r,n)}),o=(e,n)=>e===void 0?void 0:bn(t,V.procedure,e,n),c=(e,n)=>{e.label=bn(t,V.label,e.label,n),e.stmts.forEach(e=>l(e,n))},l=(e,n)=>{let i=e=>e.forEach(e=>l(e,n)),a=e=>e.forEach(e=>c(e,n)),u=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:c(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=xn(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=bn(t,V.procedure,e.returnTo,n),e.to=bn(t,V.procedure,e.to,n),u(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=bn(t,V.procedure,e.to,n),u(e.args);return;case`CallGoto`:e.after=bn(t,V.procedure,e.after,n),e.to=bn(t,V.procedure,e.to,n),u(e.args);return;case`Goto`:if(hn(t,V.label,e.to,n)===void 0&&e.to!==`Done`)throw new p(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=bn(t,V.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new s(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Ct(t),e.name));let n=wt(t.procedures,_n(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=bn(t,V.label,n.initialPC,e.name)),e.name=bn(t,V.procedure,e.name,``),n.name=e.name},d=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Ct(t),e.name));let n=wt(t.processes,vn(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=bn(t,V.label,n.initialPC,e.name)),e.name=bn(t,V.process,e.name,``),n.name=e.name};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.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=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(Ct(e),``))),t.initialPC!==void 0&&(t.initialPC=bn(t,V.label,t.initialPC,``))},En=e=>Tt(e,0,vt.string),Dn=e=>Tt(e,0,vt.added),H=e=>Tt(e,0,vt.builtin),On=e=>Tt(e,0,vt.ident),kn=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Et(r)+t;n.push(Tt(e.string,i,e.type))}),kt([n])},An=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+=Et(e),e.type===vt.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}})}),jn=(e,t,n,r=0,i=0)=>({...z(),kind:`SingleAssign`,line:r,col:i,lhs:{...z(),kind:`Lhs`,var:e,sub:t},rhs:n}),Mn=(e,t=0,n=0)=>({...z(),kind:`Assign`,line:t,col:n,ass:e}),Nn=(e,t,n=0,r=0)=>Mn([jn(e,kt([]),t,n,r)],n,r),Pn=e=>{if(e.tokens.length>1)return!1;let t=wt(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Fn=e=>({...z(),kind:`When`,exp:kn([Dn(`pc`),H(`=`),En(e)],1)}),In=e=>Nn(`pc`,kt([[En(e??`null`)]])),Ln=e=>[On(`Head`),H(`(`),Dn(`stack`),H(`)`),H(`.`),On(e)],Rn=()=>[On(`Tail`),H(`(`),Dn(`stack`),H(`)`)],zn=e=>kt([Ln(e)]),Bn=(e,t,n,r)=>{let i=[[H(`<<`),H(`[`),On(`procedure`),H(`|->`),En(e),H(`,`)],[On(`pc`),H(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(H(`,`)),i.push([On(e.var),H(`|->`),On(e.var)])}),i[i.length-1].push(H(`]`),H(`>>`)),i.push(r);let a=Dt(i);return An(a),Ot(a),a},Vn=(e,t,n)=>{if(t.params.length!==n.args.length)throw new p(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(jn(t.var,kt([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>Nn(e.var,e.val,n.line,n.col)),In(t.initialPC)]},Hn=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=_n(t,e.to);if(r===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=Bn(e.to,[En(n)],[...i.decls,...i.params],[H(`\\o`),Dn(`stack`)]);return Vn(Nn(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new p("`return' statement not in procedure",e);let i=_n(t,n);if(i>=t.procedures.length)throw new p(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>Mn([jn(t,Dt(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,zn(`pc`)),...a.decls.map(e=>o(e.var,zn(e.var))),...a.params.map(e=>o(e.var,zn(e.var))),o(`stack`,kt([Rn()]))]},o=e=>{let n=e.from;if(n===void 0)throw new p(`\`return' statement following \`call' at ${St(e)} not in a procedure`);let r=wt(t.procedures,_n(t,n)),i=_n(t,e.to);if(i===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=Mn([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(jn(t.var,Dt(),zn(t.var),e.line,e.col)));let t=Bn(e.to,Ln(`pc`),[...a.decls,...a.params],[H(`\\o`),...Rn()]);o.ass.push(jn(`stack`,kt([]),t,e.line,e.col))}return Vn(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):m(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(In(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...z(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(In(t)),i.needsGoto&&c.Else.push(In(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(In(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(In(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(Fn(e.label)),a.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=Pn(t.test),l=s?a.stmts:[{...z(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[Fn(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...z(),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=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...z(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>u(e.map(Ct),t),g=e=>{r.procedure=e.name;let n=h(e.body,bn(t,V.label,`Error`,``));return r.procedure=void 0,{...z(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},_=e=>({...z(),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`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...z(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...z(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},Un=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new p(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new p(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new p(`Multiple assignment to ${t}`,e)}),i(t,o)},c=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>c(e,n)),e.Else.forEach(e=>c(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>c(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>c(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new s(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=n.map(()=>0);Ct(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},Wn=(e,t,n,r)=>{let i=Sn(e);Cn(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),Tn(e,i,r),Un(Hn(e,i,t),t),n&&wn(i)},Gn=`[ \\t\\n\\x0B\\f\\r]`,Kn=RegExp(`\\\\\\* BEGIN TRANSLATION${Gn}+\\(${Gn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Gn}*(=${Gn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Gn}*STRING)${Gn}*\\/\\\\${Gn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Gn}*(=${Gn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Gn}*STRING)${Gn}*\\)`),qn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Jn=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),Yn=(e,t)=>Jn(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${St(t.node)}`),Xn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),Zn=(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},Qn=(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``},$n=(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},er=e=>/^[\p{L}\p{Nd}_]$/u.test(e),tr=(e,t,n)=>{for(;t.line<e.length;){let r=Qn(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=$n(r,e,` `),!0}t.column=$n(r,t.column,` `)}return!1},nr=(e,t)=>Jn(e,`Command-line error: ${t}`),rr=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(nr(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){nr(e,`
20
+ Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){nr(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){nr(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){nr(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){nr(e,"Version number must follow `-version' option");return}let t=bt(s);if(t<0||t>1903){Jn(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),nr(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){nr(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:nr(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},ir=(e,t,n)=>{if(Qn(t,n),n.column+=7,!Qn(t,n).slice(n.column).startsWith(`(`)){Jn(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Qn(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=$n(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Jn(e,`No closing ')' found in options statement`):rr(e,r)},ar=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new p(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},or=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new m(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},sr=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=Xn(t),i={line:0,column:0};for(;tr(r,i,`PlusCal`);){let t=Qn(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!er(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){e.params.optionsInFile=!0,ir(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=Zn(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=Zn(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=ar(r,a.line,a.column);if(l!==void 0)return Yn(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let n=Ut(r,a.line,a.column,t.length,0),i=fn(e,n,a.isFair);u.ast=i.ast,Wn(i.ast,i.omitPC,i.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof p))throw t;Yn(e,t)}s===-1&&or(-1,r.length);let d=Kn.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,h=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:Ht(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(h===void 0||f!==qn(h))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let g=d.groups?.tla;if(g!==void 0){if(c===-1)throw new m(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);g!==qn(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},cr=[[`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]]],lr={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},U=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}),ur=e=>cr.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...U(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{...U(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:lr,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}}),dr=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},fr=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}`,pr=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,mr=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},hr=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),gr=(e,t)=>(e&2147483647)%t,_r=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[gr(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},vr=(e,t,n=t)=>e.buckets[gr(mr(n),e.buckets.length)].find(e=>e.key===t)?.value,yr=(e,t,n,r=t)=>{let i=mr(r),a=e.buckets[gr(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&_r(e),e.buckets[gr(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},br=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),xr=`\0module `,W=()=>({table:hr(),symbols:[]}),Sr=e=>e.kind===`Module`?xr+e.name:e.name,Cr=(e,t)=>{yr(e.table,Sr(t),t,t.name),e.symbols.push(t)},wr=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Tr=(e,t)=>vr(e.table,t),Er=(e,t)=>vr(e.table,xr+t,t),Dr=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Or=(e,t)=>br(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),kr=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Ar=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),jr=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Mr=e=>{switch(e.kind){case`Identifier`:return jr(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=jr(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}}})}},Nr=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Pr=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Fr=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Ir=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Lr=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Rr=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],zr=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Br=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):Tr(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=zr(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: \`${Pr(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=zr(u.nameLocation,l(u.index)),u.name=p,Ir(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=wr(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 \`${Pr(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(Fr(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=Fr(f.op,a.length);if(o){let e=Fr(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=Fr(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=Rr(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=Fr(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(Fr(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=Fr(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`?wr(f.op):u.previousMode===`FindingOpName`&&Lr(f)?wr(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:wr(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=Ar.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}.`)},Vr=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Hr=(e,t)=>`${e}:${t}`,Ur=(e,t)=>{let n=se(t).filter(e=>e.kind!==`End`).map(le),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
23
+ `&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Hr(e.line,e.column),t]))}},G=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Wr=(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},Gr=(e,t)=>e.tokenIndexes.get(Hr(t.line,t.column))??Math.min(Wr(e,t,!1),e.tokens.length-1),Kr=(e,t)=>Math.max(Wr(e,t,!0)-1,0),qr=(e,t)=>{let n=e.tokens[t].text,r=Vr.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(G(e,a,n))i++;else if(G(e,a,r)&&(i--,i===0))return a;return t},Jr=(e,t)=>({start:Gr(e,t.start),end:Kr(e,t.end)}),K=(e,t)=>{let n=t.location.range;if(n)return Jr(e,n);let r=Gr(e,t.location);return{start:r,end:qr(e,r)}},Yr=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&G(e,r,`)`)&&qr(e,n)===r?Yr(e,{start:n,end:r}):t},Xr=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&qr(e,n)===r&&(G(e,n-1,`(`)||G(e,n-1,`,`))?Xr(e,{start:n,end:r}):t},q=(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}),J=(e,t)=>q(e,{start:t,end:t}),Zr=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?re(r):r+1,r>=n)return i;i++}return i},Qr=(e,t)=>{let n=e.tokens[t],r=Zr(e,n.line,n.column);return e.source.slice(r,Zr(e,n.line,n.endColumn)+1)},$r=(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},ei=e=>{let n=Ur(``,e),r=n.tokens.reduce((e,t,r)=>{if(!$r(n,r))return e;let i=Zr(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(r!==e&&ae(e)!==void 0)throw new t(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},ti=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Zr(e,n.line,n.endColumn)+1,a=e.source.slice(i,Zr(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},ni=(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},ri=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(G(e,i,r))return i;return-1},ii=new Map(ee.flatMap(([e,...t])=>t.map(t=>[t,e]))),ai=e=>e.split(`!`).map(e=>ii.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),oi={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}},si=e=>/^[A-Za-z0-9_]+$/.test(e),ci=e=>e!==`!!`&&e.includes(`!`),li=e=>e.contexts[e.contexts.length-1],ui=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Tr(e.contexts[n],t);if(r)return r}},di=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,fi=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,pi=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||mi(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&mi(n.module)}return!1},mi=e=>Or(e,2).length===0&&Or(e,3).length===0,hi=e=>[...e.kind===`Let`?e.instances??[]:[],...S(e).flatMap(hi)],gi=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:gi(e)):hi(e),_i=(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},vi=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`?hi(e.definition.body):e.kind===`Theorem`&&s?gi(e.theorem.statement):e.kind===`Assumption`&&s?hi(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!_i(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}},yi=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),bi=e=>{let t=e.kind===`Apply`?Mr(e):void 0;return yi.has(e.kind)||t!==void 0&&Nr(t)},xi=/* @__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`]]),Si=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Ci=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),wi=(e,t)=>Ci.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Ti=(e,n,r={})=>{let a=[],o=(e,t)=>dr(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>dr(a,{location:e,text:t,isWarning:!0}),c={value:r.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},f=(e,t)=>{let n=ui(e,t.name);if(n===t)return;if(n===void 0){Cr(li(e),t);return}let i=t.kind===`FormalParam`||di(n)!==di(t)||wr(n)!==wr(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${fr(n.location)}.`):pi(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${fr(n.location)}.`)};r.version!==`1.7.4`&&ur(l);let p=ur(l);l();let m=new Map(p.map(e=>[e.name,e])),g=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,y=(e,n)=>{let a=e===r.rootFileName&&r.rootFilePath||`${e}.tla`,o=t=>new i(`Could not parse module ${e} from file ${a}`,e,t),s=r.version===`1.7.4`?_(n):void 0;if(s!==void 0)throw o(s);try{return oe(ei(n))}catch(e){throw e instanceof t?o(ae(n)??`***Parse Error***\n${e.message}`):e}},b=(e,t,n)=>{let a=v.get(e);if(a)return a;if(t===void 0)throw new h(e,n,r.version!==`1.7.4`);r.onParse?.(e);let o=y(e,t);if(o.name!==e)throw new i(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Ur(o.name,t),module:o};return v.set(e,s),s},x=[],S=/* @__PURE__ */ new Set,C=[],w=(e,t,r)=>{let a=C.indexOf(e);if(a!==-1)throw new i(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...C.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(S.has(e))return;S.add(e),C.push(e);let o=k(e,b(e,t,r).module);[...o.extendees,...o.instancees].forEach(t=>w(t,n(t),e)),C.pop(),x.push(e)},ee=/* @__PURE__ */ new Set,T=(e,t)=>ee.has(`${e} ${t}`),E=(e,t,n)=>{let r=v.get(e);if(!r||n.has(e))return;n.add(e);let i=k(e,r.module),a=i[t].find(t=>!T(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=T(e,r)?E(r,t,n):void 0;if(i)return i}},D=t=>{b(t,e);let r=()=>E(t,`extendees`,/* @__PURE__ */ new Set)??E(t,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())v.has(e.name)||b(e.name,n(e.name),e.namingModule),ee.add(`${e.importer} ${e.name}`)},O=r.rootFileName??y(``,e).name,k=(e,t)=>{let n=vi(t);return e!==O||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};D(O),w(O,e);let te=(e,n,i,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},p=[],h=[],_=[],v=[],y=/* @__PURE__ */ new WeakSet,b=()=>v.push({labels:/* @__PURE__ */ new Map,params:[]}),x=()=>v.pop()?.labels??/* @__PURE__ */ new Map,S={depth:0,isDeclared:[],goal:void 0,goalClause:0},C=/* @__PURE__ */ new WeakMap,w=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?C.get(e):void 0;t&&(t.isInProof=!1)},T=e=>q(n,K(n,e)),E=e=>e.range?Jr(n,e.range):{start:Gr(n,e),end:Gr(n,e)},D={kind:`Module`,id:l(),name:e.name,location:q(n,E(e.location)),extendees:[],context:li(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let O=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Er(a.contexts[t],e);if(n?.kind===`Module`)return n}return g.get(e)},k=e=>{let n=O(e);if(n===void 0)throw new t(`Could not find module ${e}`);return n},A=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},j=(e,t,n,r)=>{let i={...U(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&f(a,i),i},ne=e=>({...U(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}),re=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},ie=(e,t,n,r={},i=l())=>({...U(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),ae=()=>({...ie(oe(`$Nop`),[],lr,{},u.id),isNull:!0}),oe=e=>{let t=m.get(e);if(!t)throw new d(`SANY has no builtin operator ${e}`);return t},M=(e,t,n,r={})=>ie(oe(e),t,n,r),se=(e,t)=>({...U(l()),kind:`String`,value:e,location:t}),ce=(e,t)=>({...U(l()),kind:`OpArg`,op:e,location:t}),le=(e,n)=>{let r=ui(a,ai(e));if(r===void 0||r.kind===`Module`)throw new t(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},ue=(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`&&wr(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.`)},de=Br({version:r.version,resolveSymbol:e=>ui(a,e),resolveSynonym:ai,generateExpression:e=>F(e),generateArgument:(e,t,n,r)=>xe(e,t,n,r),createOpAppl:(e,t,n)=>{let r=ie(e,t,n);return ue(e,t,n),r},createOpArg:ce,createFormalParam:(e,t,n)=>j(e,t,n,!1),createLambda:(e,t,r)=>ne({name:`LAMBDA`,params:e,body:t,location:r,preComments:ti(n,Gr(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>We(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:oe,addError:(e,t)=>(o(e,t),ae()),isOutOfLabelScope:e=>{let t=w.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=C.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),fe=(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=ri(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=qr(n,a);return r.value=t+1,{...e,location:q(n,{start:a,end:t})}}r.value=a+1;let o=J(n,a);if(e.args===void 0||!G(n,a+1,`(`))return{...e,location:o};let s=qr(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:q(n,{start:a+1,end:s})}})},pe=(e,r,i,a)=>{let o=Mr(e);if(o===void 0)throw new t(`Expected a name, found ${e.kind}`);return de(fe(o,K(n,e)),r,i,a,T(e))},me=e=>{let n=pe(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t(`Expected an expression`);return n},he=e=>{if(e.kind!==`OpAppl`)return;let t=p.find(t=>t.name===e.operator.name);t&&(t.node.operator=oe(`$RecursiveFcnSpec`))},ge=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},[]),_e=(e,t)=>Ne(e,t,ge(e).map(e=>F(e[0].set))),N=(e,t)=>{let n=v.at(-1);n?.params.push(e);let r=F(t);return n?.params.pop(),r},ve=e=>{let t=K(n,e),r=ni(n,t.start,t.end,e.params);return A(W(),()=>{let i=e.params.map((e,t)=>j(e,0,J(n,r[t]),!0)),a=N(i,e.body);return ne({name:`LAMBDA`,params:i,body:a,location:q(n,t),preComments:ti(n,t.start)})})},ye=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Gr(n,e.location)].text,be=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?ce(le(ye(e),r),r):ce(ve(e),r);if(!bi(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),ae();if(e.kind===`OperatorReference`)return ce(le(e.operator,r),r);let i=pe(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},xe=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return F(i);let l=K(n,i),u=q(n,l),d=`${r+1} (counting from 1)`,f=Xr(n,l);if(f!==l||!bi(i))return o(q(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),ae();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=pe(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t(`Expected an operator argument at ${fr(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=ve(i),n=wr(t);return n===c?ce(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),ae())}let p=ye(i),m=ui(a,ai(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),ae();let h=wr(m);return h===c?ce(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${fr(e.location)}', \nbut an operator of arity ${c} was expected.`),ae())},Se=e=>{let t=T(e);if(e.isBulleted)return M(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(F),t);let r=K(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=Yr(n,K(n,t)),c=a===o.length-1?r.end:s.end;return M(i,[e,F(t)],q(n,{start:r.start,end:c}))},F(a))},Ce=e=>{let t=K(n,e),r=e.arms.map((r,i)=>{let a=Yr(n,K(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Yr(n,K(n,r.body)),c=[F(r.condition),F(r.body)];return M(`$Pair`,c,q(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=Yr(n,K(n,i)),a=we(e.start,`OTHER`);r.push(M(`$Pair`,[void 0,F(i)],q(n,{start:a,end:t.end})))}return M(`$Case`,r,q(n,t))},we=(e,t)=>{for(let r=e;r>=0;r--)if(G(n,r,t))return r;return e},Te=e=>{let t=K(n,e),r=q(n,t),i=[F(e.function)],a=M(`$Except`,i,r),o=K(n,e.function),s={value:ri(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=ri(n,s.value,t.end,`!`),o=Yr(n,K(n,e.value)),c=q(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Ee(l.value,e.name);return l.value=t+1,se(e.name,J(n,t))}let r=ri(n,l.value,t.end,`[`),i=qr(n,r);return l.value=i+1,e.args.length===1?F(e.args[0]):M(`$Tuple`,e.args.map(F),q(n,{start:r,end:i}))}),d=M(`$Seq`,u,c),f=M(`$Pair`,[d],c);_.push(f),h.push(a),f.operands.push(F(e.value)),_.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Ee=(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},De=(e,t)=>{let r=K(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Ee(i.value,e.name),s=Yr(n,K(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(J(n,a),`Non-unique fields in constructor.`),M(`$Pair`,[se(e.name,J(n,a)),F(e.value)],q(n,{start:a,end:s.end}))}),s=M(e,a,q(n,r));return D.records.push(s),s},Oe=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),ke=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=G(n,r+1,`(`)?qr(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:{...Oe(r),range:{module:n.name,start:Oe(r),end:Oe(e)}}}),!G(n,e+1,`,`))break;r=e+2}return t},Ae=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Ie(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Ie(e)}))],r=K(n,e).start,i=Yr(n,K(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);G(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:ke(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},je=e=>{let t=W();return A(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];Ae(e).forEach(e=>{e.kind===`Recursive`?Ve(e.declarations):e.kind===`Instance`?Ge(e.instance,n,r):e.definition.kind===`Function`?ze(e.definition,n):Le(e.definition,n)}),He(),c.curLevel=Math.max(c.curLevel-1,0);let i=F(e.body);return{...U(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},Me=e=>{let t=K(n,e),r=q(n,t);return A(W(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=ni(n,t.start,t.end,a),s=a.map((e,r)=>j(e,0,J(n,i.kind===`Name`?t.start:o[r]),!0)),c=N(s,e.body);return M(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=F(e.set),s=K(n,e.set),c=ni(n,t.start,s.start,a),l=a.map((e,t)=>j(e,0,J(n,c[t]),!0)),u=N(l,e.body);return M(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},P=e=>{if(si(e.operator)||ci(e.operator)||e.args.length>2||ui(a,ai(e.operator))!==void 0)return;let t=K(n,e);if(n.tokens[t.start].text===e.operator&&G(n,t.start+1,`(`))return;let r=Yr(n,K(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=Qr(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},F=e=>{let t=T(e);switch(e.kind){case`Number`:return{...U(l()),kind:`Numeral`,value:Ei(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...U(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return se(e.value,t);case`Identifier`:{let t=me(e);return he(t),t}case`Apply`:{let r=P(e);if(r!==void 0)return o(J(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...ae(),isAbsent:!0};let i=me(e);return(ci(e.operator)||si(e.operator))&&he(i),i}case`Bracket`:return o(J(n,K(n,e).start),"Unsupported expression type `['."),{...ae(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[K(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${wi(e,r)}'.`),{...ae(),isAbsent:!0}}case`And`:case`Or`:return Se(e);case`Prime`:return M(`'`,[F(e.expression)],t);case`Unchanged`:return M(`UNCHANGED`,[F(e.expression)],t);case`Enabled`:return M(`ENABLED`,[F(e.expression)],t);case`Always`:return M(`[]`,[F(e.expression)],t);case`Eventually`:return M(`<>`,[F(e.expression)],t);case`If`:return M(`$IfThenElse`,[F(e.condition),F(e.consequent),F(e.alternative)],t);case`Case`:return Ce(e);case`Let`:return je(e);case`Forall`:case`Exists`:{let r=K(n,e);return A(W(),()=>{let n=_e(e.bounds,r.start),i=N(n.bounded.flat(),e.body);return M(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=K(n,e),i=K(n,e.body),a=ni(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return A(W(),()=>{let r=e.names.map((e,t)=>j(e,0,J(n,a[t]),!0)),i=N(r,e.body);return M(o,[i],t,{unbounded:r})})}case`Choose`:return Me(e);case`SetEnumeration`:return M(`$SetEnumerate`,e.elements.map(F),t);case`Tuple`:return M(`$Tuple`,e.elements.map(F),t);case`SetFilter`:{let r=F(e.bound.set),i=K(n,e);return A(W(),()=>{let n=Ne([e.bound],i.start,[r]),a=N(n.bounded.flat(),e.predicate);return M(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=K(n,e.expression);return A(W(),()=>{let n=_e(e.bounds,r.end+1),i=N(n.bounded.flat(),e.expression);return M(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=K(n,e);return A(W(),()=>{let n=_e(e.bounds,r.start),i=N(n.bounded.flat(),e.body);return M(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return M(`$SetOfFcns`,[F(e.domain),F(e.range)],t);case`Record`:return De(`$RcdConstructor`,e);case`RecordSet`:return De(`$SetOfRcds`,e);case`Except`:return Te(e);case`ExceptAt`:{let e=h[h.length-1],n=_[_.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),ae()):{...U(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=F(e.function);if(pr(n))return n;he(n);let r=e.args.length===1?F(e.args[0]):M(`$Tuple`,e.args.map(F),t);return M(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=F(e.record),i=K(n,e);return M(`$RcdSelect`,[r,se(e.field,J(n,i.end))],t)}case`Product`:return M(`$CartesianProd`,e.factors.map(F),t);case`BoxAction`:case`AngleAction`:return M(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[F(e.action),F(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return M(e.kind===`WeakFairness`?`$WF`:`$SF`,[F(e.subscript),F(e.action)],t);case`Label`:return Pe(e);case`Subexpression`:return me(e)}},Ne=(e,t,r)=>{let i=ge(e),a={value:t};return{bounded:i.map(e=>{let t=K(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=ni(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>j(e,0,J(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Pe=e=>{let t=T(e),r=v.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),ae();if(S.isDeclared.slice(2,S.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),ae();if(h.length>0&&_.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),ae();b();let i=F(e.body),s=x(),c=ni(n,K(n,e).start,K(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=ui(a,t);if(i?.kind===`FormalParam`)return i;let s=J(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),j(t,0,s,!1)}),d={...U(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=S.goal;return p&&w.set(d,{scope:p,clause:S.goalClause}),d},Fe=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Gr(n,e.location):Ee(i.value,e.name),a=dt(t,e.arity);return i.value=a.end+1,j(ai(e.name),e.arity,q(n,a),r)})},Ie=e=>{let t=E(e.location);return e.isLocal&&!G(n,t.start,`LOCAL`)&&G(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Le=(e,t)=>{let r=Ie(e),i=q(n,r),s=ai(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=A(W(),()=>{let t=Fe(e,l,!0),n=ui(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 b(),{params:t,body:F(e.body),existing:n}}),d=x(),p=u.existing,m=u.params,h=ti(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=d,Re(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=ne({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:d});f(a,g),re(g),D.definitions.push(g),t?.push(g)},Re=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},ze=(e,t)=>{let r=Ie(e),i=q(n,r),s=W(),l=e.isLocal?r.start+1:r.start,u=A(s,()=>_e(e.bounds,l+1)),d=ui(a,e.name),m=A(s,()=>j(e.name,0,i,d===void 0)),h=M(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=d?.kind===`OpDef`&&d.inRecursive&&!d.isDefined,_=g&&d.letInLevel===c.curLevel;_?d.arity!==0&&o(i,`Function ${d.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):d!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=ti(n,r.start),y=d===void 0?ne({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):d.kind===`OpDef`&&(_||!g)?d:void 0;_?d.arity===0&&Re(d,h,i,v):d===void 0&&y!==void 0&&(f(a,y),re(y)),y!==void 0&&(D.definitions.push(y),t?.push(y)),p.unshift({name:e.name,node:h}),b();let S=()=>N(u.bounded.flat(),e.body),C=y===void 0?S():A(s,S),w=x();y!==void 0&&(y.labels=w),p.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Be=[],Ve=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ft(e);l();let r=Array.from({length:e.arity},()=>j(``,0,void 0,!1)),i=ne({name:ai(e.name),params:r,location:q(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});f(a,i),Be.push(i),D.opDefsInRecursiveSection.push(i)})},He=()=>{c.unresolvedCount[c.curLevel]!==0&&(Be.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])},Ue=(e,t,i)=>{l();let s=br(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=ui(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?ie(t,[],i):ce(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?wr(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=Ie(e),f={value:ri(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=ri(n,f.value,d.end,e.name);r!==-1&&(f.value=K(n,e.expression).end+1);let a=Tr(t,ai(e.name));if(a?.kind!==`OpDecl`){o(r===-1?i:J(n,r),`Identifier '${r===-1?e.name:Qr(n,r)}' 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?F(e.expression):be(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&&r.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(i,`Substitution missing for symbol ${e.name} declared at ${fr(e.location)} \nand instantiated in module ${D.name}.`)),c},We=(e,t,n,r,i,a=D)=>(pr(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.`),{...U(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),Ge=(e,t,i)=>{let o=Ie(e),s=q(n,o),c=ti(n,o.start),u=e.name??``,d=W(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(d);let m=Fe(e,{start:p,end:o.end},e.params.length>0),h=k(e.module),g=h.context,_=Ue(e,g,s);e.params.length>0&&a.contexts.pop(),br(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`?ne({name:i,params:r,body:_.length>0&&n.body?We(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):ne({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});f(a,o),n.defKind===`UserDefined`&&re(o),(t??D.definitions).push(o)}),br(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?We(`APSubstIn`,_,n.body,h,s):n.body,i={...U(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:[]};f(a,i),(t??D.definitions).push(i)});let v={...U(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(i??D.topLevel).push(v);let y=ne({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});f(a,y),r.version!==`1.7.4`&&t?.push(y)},Ke=(e,t=!0,r)=>{let i=Ie(e),o=r??q(n,i),s=ti(n,i.start),c=k(e.module),u=c.context,d=Ue(e,u,o),p=e.isLocal,m=mi(c);br(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=ne({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return f(a,r),r},n=()=>(f(a,e),e),r=e.module===void 0||mi(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&We(`SubstIn`,d,e.body,c,o));D.definitions.push(i),re(i)}),br(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...U(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return f(a,r),r},r=m?p?n(e.module,e.body):(f(a,e),e):mi(e.module)?p?n(D,e.body):e:n(D,We(`APSubstIn`,d,e.body,c,o));t&&D.definitions.push(r)});let h={...U(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:d,location:o};return t&&D.topLevel.push(h),h},qe=e=>{let t=O(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(J(n,Gr(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},Je=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);let n=Mr(e);if(n===void 0||!Nr(n))return[F(e)];let r=pe(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t(`Expected a fact`);return[r]}),Ye=e=>G(n,e.start,`(`)&&qr(n,e.start)===e.end,Xe=e=>Yr(n,K(n,e)),Ze=(e,t)=>Xe(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Qe=(e,t)=>Ye(t)?`N_ParenExpr`:e.kind===`String`?Qr(n,t.start):e.kind===`Apply`?Ze(e,t):xi.get(e.kind),I=(e,t)=>{if(e.kind===`String`&&!Ye(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Qe(e,t);return n===void 0||Si.has(n)?void 0:!0},$e=(e,t)=>{let r=(e,t=Xe(e))=>({last:t,lastKind:Qe(e,t)});if(Ye(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:I(e.expression,Xe(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=Xe(t),i=r.end+1;return{hasChildlessFirstChild:I(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=Ze(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=Xe(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:I(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},L=e=>{let t=Yr(n,K(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ye(t))return!1;let r=$e(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=q(n,r.last);return r.hasChildlessFirstChild&&o(q(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(q(n,t),`DEF clause entry should describe a defined operator.`),!0},et=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);if(L(e))return[];let t=pe(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.`),[])}),tt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},nt=e=>{let t=q(n,E(e.location));tt(e,t);let r=Je(e.facts),i=et(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.`)),{...U(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},rt=e=>{let t=E(e.location),r=e.set&&F(e.set),i=Ee(t.start,e.name),o=oi[e.level],s={...U(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:ai(e.name),arity:e.arity,declKind:o.declKind,location:q(n,dt(i,e.arity)),module:D};return f(a,s),{...U(l()),kind:`NewSymb`,declaration:s,set:r,location:q(n,t)}},it=(e,t,r)=>{let i=E(e.location),s=$r(n,i.start-1),c=K(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=q(n,{start:s?i.start-1:i.start,end:i.start});s!==$r(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(W()),s&&a.contexts.some(e=>y.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||y.add(li(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};S.depth=t,S.isDeclared[t]=!1,t===1&&(S.goal=r&&p,S.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?it(e,t+1):r?rt(e):F(e);return S.depth=t,r&&(S.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&S.goalClause++,i}),h=F(e.conclusion);t>1&&a.contexts.pop(),S.depth=t-1,t===1&&(S.goal=void 0);let g={...U(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:q(n,{start:s?i.start-1:i.start,end:i.end})};return C.set(g,p),g},at=(e,t,n,r,i,a=!0)=>({...U(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:[]}),ot=e=>{let t=q(n,E(e.location));e.kind===`By`&&tt(e,t);let r=e.kind===`By`?Je(e.facts):[],i=e.kind===`By`?et(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...U(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},st=(e,t)=>{let r=e.body,i=q(n,t);switch(r.kind){case`Have`:return{node:M(`$Have`,[F(r.expression)],i),isPick:!1};case`Case`:return{node:M(`$Pfcase`,[F(r.expression)],i),isPick:!1};case`Witness`:return{node:M(`$Witness`,r.expressions.map(F),i),isPick:!1};case`Qed`:return{node:M(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(W());let s=e=>r.kind===`Pick`?[N(e,r.body)]:[];if(r.bounds.length>0){let n=_e(r.bounds,t.start),a=s(n.bounded.flat());return{node:M(o,a,i,n),isPick:e}}let c=ni(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>j(e,0,J(n,c[t]),!0)),u=s(l);return{node:M(o,u,i,{unbounded:l}),isPick:e}}}},R=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=Yr(n,K(n,e.args[0])),r=K(n,e).start;return t.start===r&&!G(n,t.end+1,`(`)},ct=e=>{if(e.kind!==`Steps`)return ot(e);let r=W();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?Ge(e,n,i):e.kind===`Function`?ze(e,n):Le(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t(`A DEFINE step defines no operator`);return r});return{...U(l()),kind:`DefStep`,defs:r,location:q(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...nt(e),location:q(n,r)};if(e.kind===`Instance`)return Ke(e,!1,q(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=Jr(n,e.head),u={start:i.start+1,end:i.end},d=e.body;e.name!==void 0&&b();let p=e.name===void 0?void 0:l();d.kind!==`Assert`&&(s.previousRight=void 0);let m=c(d,r,u);if(m!==void 0)return e.name!==void 0&&f(a,ne({defKind:`NumberedProofStep`,name:e.name,location:q(n,r),labels:x(),step:m})),m;let h=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=d.kind===`Assert`&&d.isSuffices,_=W(),v=d.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=A(_,()=>it(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=F(t);return M(`$Suffices`,[e],q(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&R(t)&&t.args[0].kind===`ExceptAt`,a=i?F(t.args[1]):void 0,o=i?ie(le(t.operator,T(t)),[M(`$Nop`,[r],T(t.args[0])),a],T(t)):F(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=R(t)?c:void 0,o})(d.statement),isPick:!1}:st(e,u);if(v===void 0)throw new t(`Unexpected proof step ${d.kind}`);let y=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:at(p,e.name,v.node,J(n,Gr(n,e.location)),x());S&&f(a,S);let C=h&&!g;C&&a.contexts.push(_);let w=e.proof&&ct(e.proof);return C&&a.contexts.pop(),ee(v.node),h&&g&&(o.push(_),a.contexts.push(_)),y?.symbols.forEach(e=>f(a,e)),{...U(l()),kind:`Theorem`,definition:S,body:v.node,proof:w,isSuffices:g,location:q(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>Cr(r,e))}),a.contexts.pop(),{...U(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:q(n,E(e.location))}},lt=e=>{let t=q(n,E(e.location)),r=e.statement,i=W();e.name!==void 0&&b();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?it(r,1,e.name===void 0?void 0:{isSuffices:!1}):F(r),c=e.name===void 0||o===void 0?void 0:at(o,e.name,s,t,x());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),f(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&ct(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),ee(s);let d={...U(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(d)},ut=e=>{let t=E(e.location),r=q(n,t);e.name!==void 0&&b();let i=F(e.expression),o=e.name===void 0?void 0:at(l(),e.name,i,r,x(),!1);o&&(f(a,o),D.definitions.push(o));let s={...U(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},dt=(e,t)=>t===0?{start:e,end:e}:G(n,e,`_`)?{start:e,end:G(n,e+2,`_`)?e+2:e+1}:G(n,e+1,`(`)?{start:e,end:qr(n,e+1)}:{start:e,end:G(n,e+1,`_`)?e+1:e},ft=e=>dt(E(e.location).start,e.arity),pt=(e,t)=>{let r=ft(e);e.name===`@`&&t===3&&o(q(n,r),`Attempted to declare '@' as a variable.`);let i={...U(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:ai(e.name),arity:e.arity,declKind:t,location:q(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),f(a,i),i};e.extends.forEach(e=>{let t=k(e);D.extendees.push(t);let n=li(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Er(n,e.name):Tr(n,e.name);t===void 0?Cr(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${fi(e)} of '${e.name}' conflicts with \nits ${fi(t)} at ${fr(t.location)}.`):t!==e&&!pi(t,e)&&s(e.location,`Warning: the ${fi(t)} of '${e.name}' conflicts with \nits ${fi(t)} at ${fr(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let mt=(e,t)=>{c.unresolvedSum!==0&&o(q(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Ve(e.declarations);break;case`Definition`:e.definition.kind===`Function`?ze(e.definition,void 0):Le(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Ke(e.instance):Ge(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),ut(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),lt(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),D.topLevel.push(nt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,W()]},r=te(e.module,n,D,t),i=O(r.name);i===void 0?Cr(li(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${fr(i.location)}.`);break}}}),He(),D},A=x.map(e=>{r.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=b(e,void 0),n=W();p.toReversed().forEach(e=>Cr(n,e));let i=te(t.module,t.file,void 0,{contexts:[n]});return g.set(e,i),r.onModule?.(i,a),i});return{root:A[A.length-1],modules:A,messages:a}},Ei=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()},Di=(e,t,n,r)=>dr(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)},Oi=(e,t,n)=>`${e.id}:${t}:${n.id}`,ki=(e,t,n,r)=>{e.set(Oi(t,n,r),{op:t,index:n,param:r})},Ai=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},ji=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Mi=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&ji(e,r,t)})},Ni=(e,t)=>`${e.id}:${t}`,Pi=(e,t,n,r)=>{let i=Ni(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Fi=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Pi(e,t.param,t.position,t.level)})},Ii=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Li=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Mi(e.levelConstraints,t.levelConstraints),Fi(e.argLevelConstraints,t.argLevelConstraints),Ai(e.argLevelParams,t.argLevelParams)},Ri=(e,t)=>t.includes(e.op)||t.includes(e.param),zi=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Bi=e=>e.kind!==`Module`,Vi=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Hi=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Ui=(e,t)=>e.kind===`OpDef`?e.weights[Hi(e,t)]??0:0,Wi=(e,t)=>e.maxLevels[Hi(e,t)]??3,Gi=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Ki=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Hi(e,t)]??!0:e.isLeibnizArg[t]??!0,qi=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Ji=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Yi=(e,t)=>t.find(t=>t.op===e)?.expr,Xi=(e,t,n)=>{let r=Yi(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},Zi=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Yi(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!zi(i.op))return;let a=i.op;Xi(e.param,t,!1).forEach(t=>ki(n,a,e.index,t))}),n},Qi=(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;Xi(r,t,!1).forEach(e=>ji(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Yi(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Wi(n.op,e.index);Xi(e.param,t,!1).forEach(e=>ji(a,e,o))}),a},$i=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Yi(e.param,t);n===void 0?Pi(i,e.param,e.position,e.level):n.kind===`OpArg`&&zi(n.op)&&Pi(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Yi(e.param,t);if(a===void 0)return;let o=Yi(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&zi(s)&&(X(a,n,r),Pi(i,s,e.index,a.level))}),i},ea=(e,t)=>Or(e,3).length>0||(la(e,t),Dr(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ta=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Ni(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Oi(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(Ni(t,n))}),Ai(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},na=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Wi(t,o)&&(n&&X(a,r,i)&&Di(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`||!Vi(a.op)))return;let s=a.op;X(s,r,i);let c=wr(s);for(let l=0;l<c;l++){let c=Gi(t,o,l);Wi(s,l)>=c||(n&&X(a,r,i)&&Di(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||!qi(t,o,l,u)||n.level<=Wi(s,u)||(X(a,r,i)&&X(n,r,i)&&Di(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&&Di(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${fr(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},ra=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Mi(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Mi(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Mi(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Wi(t,r);n?.levelParams.forEach(t=>ji(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Vi(n.op))return;let o=n.op;X(o,r,i);let s=wr(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!qi(t,a,r,i))continue;let s=Wi(o,i);n?.levelParams.forEach(t=>ji(e.levelConstraints,t,s)),!o.isLeibniz&&!Ki(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Vi(n.op)&&(X(n.op,r,i),ji(e.levelConstraints,t.param,Wi(n.op,t.index)))}),Fi(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Fi(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Fi(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!zi(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Pi(e.argLevelConstraints,i,n,Gi(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&qi(t,r,a,o)&&Pi(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Pi(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Ai(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Ai(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=>ki(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&zi(a.op)&&ki(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!zi(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&qi(t,r,a,o)&&n.levelParams.forEach(t=>ki(e.argLevelParams,i,o,t))})})},ia=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),aa=(e,t)=>{let n=(n,r)=>{Di(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=ia.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.`)})},oa=(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(Vi(i)){let r=X(i,t,n);na(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Ui(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&&(Ui(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Ki(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(Ji(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),ra(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),Mi(e.levelConstraints,t.levelConstraints),Pi(e.argLevelConstraints,i,n,t.level),Fi(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>ki(e.argLevelParams,i,n,t)),Ai(e.argLevelParams,t.argLevelParams)});return aa(e,n),e.levelCorrect},sa=(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))}),ta(e,i,r),e.levelCorrect},ca=(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)}),ta(e,e.params,e.body)),e.levelCorrect),la=(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),sa(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Di(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),sa(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(la(e,t)));let a=Dr(e);return a.forEach(e=>i(sa(e,1,t))),kr(e).forEach(e=>i(ca(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),ea(e,t)||Or(e,2).forEach(t=>ji(e.levelConstraints,t,0)),a.forEach(t=>{Mi(e.levelConstraints,t.levelConstraints),Fi(e.argLevelConstraints,t.argLevelConstraints),Ai(e.argLevelParams,t.argLevelParams,e=>!Ri(e,t.params??[]))}),e.topLevel.forEach(t=>{Mi(e.levelConstraints,t.levelConstraints),Fi(e.argLevelConstraints,t.argLevelConstraints),Ai(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},ua=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Bi(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Li(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),da=(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&&Di(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Di(t,e.body.location,`Non-constant CASE for temporal goal.`),da(e.proof,t)):n===`$Qed`&&da(e.proof,t)})},fa=(e,t,n,r,i,a)=>{e.levelConstraints=Qi(t,n,r,i,a),e.argLevelConstraints=$i(t,n,i,a),e.argLevelParams=Zi(t.argLevelParams,n)},pa=(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;la(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=ea(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Di(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||Di(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)&&Di(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(Ni(i.op,t))?.level;a===void 0||Wi(o,t)>=a||(s&&Di(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=Wi(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Di(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 Mi(e.levelConstraints,Qi(r,e.substs,i,t,n),a),e.substs.forEach(t=>Mi(e.levelConstraints,t.expr.levelConstraints,a)),Fi(e.argLevelConstraints,$i(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Fi(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Ai(e.argLevelParams,Zi(r.argLevelParams,e.substs),t=>!Ri(t,e.params)),e.substs.forEach(t=>Ai(e.argLevelParams,t.expr.argLevelParams,t=>!Ri(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Bi(e))return la(e,n);switch(e.kind){case`OpAppl`:return oa(e,t,n);case`OpDef`:return sa(e,t,n);case`ThmOrAssumpDef`:return ca(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,Ii(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),Mi(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Mi(e.levelConstraints,t.levelConstraints)),Fi(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Fi(e.argLevelConstraints,t.argLevelConstraints)),Ai(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Ai(e.argLevelParams,t.argLevelParams,e=>!Ri(e,n))}),e.instances.forEach(t=>Ai(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,Ii(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=>Li(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,Xi(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,Xi(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=ea(e.instantiatedModule,n);return fa(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return pa(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,Ii(e,e.body),e.level!==0&&Di(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=ua(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&&Di(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&da(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return ua(e,e.facts,t,n);case`NonLeafProof`:return ua(e,[...e.steps,...e.instances],t,n);case`DefStep`:return ua(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,Di(n,e.location,`Level error:
27
+ Temporal formula used as set.`)),Ii(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=>Li(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&ji(e.levelConstraints,t,2)})),e.levelCorrect}},ma=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[]}},ha=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),ga=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&&ha.get(e)===t.name||n(t))return!0}}return ma(e).some(n)};return n(e)},_a=e=>e.operands.filter(e=>e?.kind===`OpAppl`),va=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},ya=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(_a(t).map(e=>va(e)?.value));return _a(e).every(e=>n.has(va(e)?.value))},ba=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),ba(e,t))}),t),xa=e=>{let t=[...[...ba(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>ya(e,n)).flatMap(_a).some(ga)?[]:_a(n).flatMap(t=>{let n=va(t),r=n&&Tr(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 ${fr(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}]}))},Sa=e=>`${fr(e.location)}\n\n${e.text}`,Ca=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=>`${Sa(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Sa(e)}\n\n\n`)].join(``)},wa=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ta=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))},Ea=e=>{try{return oe(ei(e))}catch(e){if(e instanceof t)return;throw e}},Da=(e,t)=>t===`1.7.4`&&_(e)!==void 0?void 0:Ea(e)?.name,Oa=(e,t=()=>void 0,n={})=>{let r=Ee(e,`.tla`),a=k(n.version),o=n.fileName??r,s=P(e)?Pe(e,`utf8`):a.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,P(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},x=sn(yt(),u),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),ee=e=>{let t=S.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=sr(x,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},T=(e,t)=>{if(n.isXmlExport||S.has(e))return;let r=Ea(t);if(r===void 0||r.name!==e)return;let i=[...S.values()].filter(t=>Ta(t.module).includes(e));S.set(e,{text:t,module:r}),i.forEach(()=>ee(e)),Ta(r).filter(t=>t!==e&&S.has(t)).forEach(ee)},E=()=>{if(w(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${Sa(e)}\n\n\n`))),e.length!==v.length&&(u(Ca(v)),_.value=!0,y.isAborted=!0)},D=e=>{let n=a.get(e),r=t(e),i=r===void 0&&n===void 0&&s!==void 0&&!d?b(s,e):void 0,o=r??i;return g.set(e,r===void 0?i===void 0?`standard`:`root file`:`file`),o!==void 0&&T(e,o),o??n},O=(()=>{try{if(s===void 0)throw new i(`Cannot find source file for module ${o}`,void 0);return T(r,s),Ti(s,D,{rootFileName:r,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&ee(r),w()},onAnalyze:e=>{E(),(h||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&la(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${Ca(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Sa(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Sa(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof m){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Ca(v));return}if(!(e instanceof i))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Sa(t)}\n\n\n`);return}u(Sa(t)),u(Ca(y.isReported?[t]:[...v,t]))}})();if(O!==void 0&&E(),O!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=O.modules.filter(e=>!wa.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(xa).forEach(e=>u(`${Sa(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:O}},ka={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Aa=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:[]}),ja={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},Ma=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:ja[e]),Na=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Pa=e=>{let t=(e.cdata??e.text)?.match(Na)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Pa(t);if(e)return e}},Fa=(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}>${Ma(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)Fa(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Ia=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)]),La=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)`}},Ra={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)`}}},za={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ba=fr(`--TLA+ BUILTINS--`),Va=(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}]},Ha=(e,t=16)=>e>t*.75?Ha(e,t*2):t,Ua=(e,t)=>(e^e>>>16)&t-1,Wa=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Ga=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Ka=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,qa=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Wa(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(Ka,``)}).join(`
28
+ `)},Ja=e=>{let t=Wa(e),n=e=>Ga(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
+ `)},Ya=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},l=[],u=(e,t)=>{if(!r)return t();l.push(...e);let n=t();return l.length-=e.length,n},f=(e,t)=>{let n=[...l,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
30
+ `),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return a(new c(r,i),ka.uncaughtException)},p=e=>f(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),m=(e,t)=>(i.has(e.id)||(i.add(e.id),o.set(e.id,u([...t?[t]:[],...Va(e.kind,fr(e.location))],()=>v(e)))),Z(La(e),[Q(`UID`,e.id)])),h=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Ia(n),...r]:r;return{...e,children:[...i,...e.children]}},g=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[m(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),_=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
31
+ `),r=n.isUncommented?Ja(qa(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},v=e=>{switch(e.kind){case`FormalParam`:return h(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return h(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?f(Aa(37),[za]):a(new d(Aa(37)),ka.uncaughtException);if(e.defKind===`ModuleInstance`)return h(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return h(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[g(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,i=e.module;if(n===void 0&&r)throw p($.body);if(n===void 0||i===void 0)throw Error(`The definition of ${e.name} has no body`);return h(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[C(n,$.body)]),...e.params?[g(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[m(e.source??e)]),Z(`originallyDefinedInModule`,[m(i)]),Z(`body`,[C(n,$.body)]),g(t,e.isLeibnizArg,$.param),..._(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return h(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),C(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[Ia(e.location),...y(e)]);case`Theorem`:return h(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[m(e.definition,$.theoremDefinition)])]:[],Z(`body`,[C(e.body,$.theorem)]),...e.proof?[C(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[Ia(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[m(e.definition,$.assumeDefinition)])]:[],Z(`body`,[C(e.body,$.assume)])])}},y=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Or(e,2).filter(t).map(e=>m(e,$.constant)),...Or(e,3).filter(t).map(e=>m(e,$.variable)),...Dr(e).filter(t).map(e=>m(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?C(e,$.topLevel):m(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>m(e))]},b=(e,t)=>u([t],()=>Z(`Subst`,[m(e.op,$.substOperator),C(e.expr,$.substExpression)])),x=e=>{if(e.isNull&&r)throw f(Aa(0),[$.operator,...Va(`OpDef`,Ba),za]);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=m(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&pr(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):C(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[m(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>m(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],C(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...o])},S=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?m(e,t):C(e,t),C=(e,t)=>{if(!r)return w(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw p(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:fr(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return u(n,()=>w(e))},w=e=>{switch(e.kind){case`OpAppl`:return h(x(e),e,e.location);case`Numeral`:return h(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return h(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return h(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=C(e.body,$.letBody);return h(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>m(e,$.letDefinition)))]),e,e.location)}case`Label`:return h(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[C(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>m(e,$.labelParam)))]),e,e.location);case`OpArg`:return h(Z(`OpArgNode`,[Z(`argument`,[m(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 h(Z(`AtNode`,[C(t,$.exceptObject),C(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=Ra[e.kind],n=e.substs.map(e=>b(e,t.subst)),r=C(e.body,t.body);return h(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[m(e.instantiatingModule,t.from)]),Z(`instTo`,[m(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>b(e,$.instanceSubst)),n=e.params.map(e=>m(e,$.instanceParam));return Z(`InstanceNode`,[Ia(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&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return h(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>S(e,$.useFact))),Z(`defs`,e.defs.map(e=>m(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return h(Z(`NewSymbNode`,[m(e.declaration,$.newDeclaration),...e.set&&!(r&&pr(e.set))?[C(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return h(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>C(e,$.assumption))),Z(`prove`,[C(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=>S(e,$.byFact))),Z(`defs`,e.defs.map(e=>m(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return h(n,e,e.location)}case`NonLeafProof`:return h(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?m(e,$.step):C(e,$.step))]),e,e.location);case`DefStep`:return h(Z(`DefStepNode`,e.defs.map(e=>m(e,$.defStep))),e,e.location)}},ee=(n.isRestricted?[t]:e).map(e=>m(e,$.main)),T=Ha(o.size),E=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Ua(e,T)-Ua(t,T)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),E,...ee])},Xa=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=Ya(e.modules,e.root,t),r=Pa(n);if(r){let e=r.character.codePointAt(0)??0;throw a(new d(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.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.`),ka.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Fa(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
32
+ `)}\n`},Za=`META-INF/MANIFEST.MF`,Qa=async e=>{if(e===void 0||!P(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(Pe(e),{filter:e=>e.name===Za})[Za];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},$a={success:o.success,"assumption-violation":o.assumptionViolation,deadlock:o.deadlock,"invariant-violation":o.safetyViolation,"property-violation":o.safetyViolation,"liveness-violation":o.livenessViolation,"postcondition-violation":o.assumptionViolation,error:o.error},eo=Ze(`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>`}]),to=Ze(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`}]),no=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),ro=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),io=/* @__PURE__ */ new Set([`-o`]),ao=(()=>{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
+ `)})(),oo=[`Usage: ${eo.usage}`,` ${to.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
+ `),so=/[*?[{]/,co=e=>e.flatMap(e=>so.test(e)?F(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),lo=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),uo=e=>e?e[0]===`auto`?Ue():Math.max(1,Number.parseInt(e[0],10)||1):1,fo=[`constrained`,`stuttering`,`strict`],po=(e,t)=>e.endsWith(t)?e:`${e}${t}`,mo=e=>{if(e.length===1)return{path:po(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:po(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},ho=(e,t)=>e.print(w.computingInitProgress,O.none,`Computed ${t} initial states...`),go=(e,t)=>e===`invariant-violation`?{code:w.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:w.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},_o=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return ho(e,t.count);let n=go(t.status,t.name);e.print(n.code,O.error,`${n.text}\n${ce(t.state)}`)}),vo=(e,t,n={code:w.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,O.error,n.text),t.forEach((t,n)=>{(n>0||r)&&_o(e,t.output),e.print(w.statePrint2,O.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${ce(t.state)}`)})},yo={code:w.counterExample,text:`The following behavior constitutes a counter-example:
35
+ `},bo=(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`,xo=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${T(e)}\n`).toReversed().join(``),So=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`},Co=(e,t)=>{let n=t.generated,r=t.distinct,i=C(/* @__PURE__ */ new Date);n===r?e.print(w.initGenerated1,O.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(w.initGenerated2,O.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},wo=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(w.progress,O.none,`Progress(${Math.max(t.depth,1)}) at ${C(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},To=(e,t)=>Ae(e,`${t}.class`),Eo=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(w.sanyFinished,O.none,`SANY finished.`),i(w.starting,O.none,`Starting... (${C(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(w.constantLevelInvariant,O.warning,`The invariant ${t.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;i(w.stateLevelProperty,O.warning,`The formula ${t.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 ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(w.livenessSymmetry,O.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.`),t.isConstrained&&e.version===`1.7.4`&&i(w.livenessConstraints,O.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`:i(w.temporalBranches,O.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=qe(je(To(r,t.module))).href;i(t.isMatched?w.javaOverrideLoaded:w.javaOverrideMismatch,t.isMatched?O.none:O.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(w.computingInit,O.none,`Computing initial states...`);return;case`initial-states-progress`:ho(e,t.count);return;case`initial-states-computed`:Co(e,t.initialStates);return;case`progress`:wo(e,t.statistics,n.start);return;case`liveness-started`:{n.liveness=Date.now(),t.isComplete&&wo(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(w.checkingTemporal,O.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${C(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Do(e,n);return;case`warning`:i(t.code,O.warning,t.text)}},Do=(e,t)=>{t.liveness!==void 0&&(e.print(w.checkingTemporalEnd,O.none,`Finished checking temporal properties in ${te(Date.now()-t.liveness)} at ${C(/* @__PURE__ */ new Date)}`),t.liveness=void 0)},Oo=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),s={code:w.temporalPropertyViolated,text:bo(t.properties??[i],n.version)},c={success:void 0,error:void 0,"assumption-violation":t.message?{code:w.assumptionEvaluationError,text:v(w.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:w.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:w.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?go(`invariant-violation`,i):{code:w.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":s,"liveness-violation":a===void 0?o?go(`liveness-violation`,i):{code:w.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:s,"postcondition-violation":{code:t.postcondition?.code??w.general,text:t.message??`Postcondition ${i} is false.`}}[e],l=e===`property-violation`,u=a!==void 0&&!l,d=l||u,f=d&&n.version!==`1.7.4`;if(f&&_o(n,t.trace[0]?.output),t.counts&&console.log(t.counts),c){let e=o?`${c.text}\n${ce(t.trace[0].state)}`:c.text;r(c.code,O.error,e)}if(o||(d||_o(n,t.trace[0]?.output),vo(n,t.trace,d?yo:void 0,d&&!f),_o(n,t.traceOutput)),u){let e=t.loopLabel;a===t.trace.length-1?r(w.statePrint3,O.state,`${a+2}: Stuttering`):n.isTool?r(w.backToState,O.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,O.warning,t.warning.text);let p=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return p?.counts&&console.log(p.counts),p&&r(p.code,O.error,p.message),!o&&e!==`assumption-violation`},ko=(e,t)=>e.print(w.nestedExpression,O.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${So(t)}`),Ao=(e,t,r)=>{let i=t.print;if(e.failure){let r=e.failure,s=t.isTool?r.toolMessage:r.message,c=()=>{let e=r.fingerprint;if(e){let n=r.callStack?.length&&t.version!==`1.7.4`?So(r.callStack):xo(e.sources);i(w.fingerprintFailed,O.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${A(e.reason,t.isTool)}`)}else r.callStack&&ko(t,r.callStack)};r.isCallStackFirst&&c();let u=r.initialState&&(()=>{try{return`While working on the initial state:\n${ce(r.initialState)}`}catch(e){throw e instanceof l?a(new l(`${n}${e.message}`),o.error):e}})();i(u?w.initialState:r.code,O.error,u?`${s}\n${u}`:s),_o(t,r.trace[0]?.output),vo(t,r.trace);let d=r.traceFailure;d&&i(d.code,O.error,t.isTool?d.toolMessage:d.message),_o(t,r.traceOutput);let f=r.postcondition;f?.counts&&console.log(f.counts),f&&i(f.code,O.error,f.message),r.isCallStackFirst||c()}else if(e.violation){if(!Oo(e.status,e.violation,t))return;let n=e.additionalViolation;n&&Oo(`property-violation`,n,t),e.liveCallStack&&ko(t,e.liveCallStack)}else{Do(t,r);let n=ne(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${M(ie(e.fingerprintDistance))}`];i(w.success,O.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 = ${M(n)}`,...a].join(`
38
+ `))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Do(t,r),t.isTool&&wo(t,e,r.start),i(w.stats,O.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let s=t.version===`1.7.4`,c=s?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!s||c)&&i(w.searchDepth,O.none,`The depth of the complete state graph search is ${s?Math.max(e.depth,1):e.depth}.`);let u=c&&ue(c);u&&i(w.stateGraphOutdegree,O.none,u)},jo=(e,t)=>e.map(e=>Ae(e,`${t}.tla`)).find(P),Mo=e=>t=>{let n=jo(e,t);return n===void 0?void 0:Pe(n,`utf8`)},No=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),Po=e=>`jar:file:${qe(je(e)).pathname}!/tla2sany/StandardModules/`,Fo=e=>x([e]).toString(),Io=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Ge(),o=P(a)?Le(a):je(a),s=Ae(o,`tlc-${Fo(je(e))}`),c=_s(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return Le(jo(t,n)??e);if(i===`1.7.4`)return Ae(o,l);if(a===`root file`){let t=r===void 0?o:je(r),i=Le(e);return`${Ae(t,Fo(`${i} ${n}`),l)} (${i})`}let u=Ae(s,l);return c===void 0?u:`${u} (${Po(c)}${l})`}},Lo=e=>e.print(w.version,O.none,`TLC2 Version ${Ye} (rev: tla-ts)`),Ro=(e,t)=>(Lo(e),e.print(w.commandLineError,O.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),zo=(e,t,n)=>e.print(w.modelChecking,O.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${Ue()} cores with ${Math.floor(Je().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Ke()} ${We()} ${He()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Bo=(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`)},Vo=async(e,n,a,s)=>{let c=n.has(`-seed`)?n.get(`-seed`)?.[0]:`0`;if(c===void 0)return Ro(s,`Error: seed required.`);if(!lo(c))return Ro(s,`Error: An integer for seed required. But encountered ${c}`);let l=n.has(`-lncheck`)?n.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(l===void 0)return Ro(s,`Error: expect a strategy such as final for -lncheck option.`);let d=n.get(`-dump`);if(d?.length===0)return Ro(s,`Error: A file name for dumping states required.`);let p=d?.length===2&&fo.find(e=>d[0].toLowerCase().includes(e));if(p)return console.error(`Error: tla-ts does not support the -dump format ${p}.`),1;let m=n.get(`-fp`)?.[0];if(m!==void 0&&Number(m)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${m}.`),1;let h=uo(n.get(`-workers`)),_=s.version;Lo(s),zo(s,c,h);let v=n.get(`-config`)?.[0]??(n.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!v||!P(v))return s.print(w.configFileError,O.error,`TLC encountered the following error when trying to read the configuration file ${v??``}:\nFile not found.`),o.configParseError;let b=Ee(e,`.tla`),x={start:Date.now(),liveness:void 0,isParsed:!1},S=()=>{let e=Date.now()-x.start;s.print(w.finished,O.none,`Finished in ${s.isTool?`${e}ms`:te(e)} at (${C(/* @__PURE__ */ new Date)})`)},ee=()=>s.print(w.parsingFailed,O.error,`Parsing or semantic analysis failed.`),T=e=>(e instanceof t?ee():Uo(e,s),S(),r(e)),k=(()=>{try{return D(Pe(v,`utf8`),_)}catch(e){if(!(e instanceof f))throw e;return e}})();if(k instanceof f&&_===`1.7.4`)return s.print(w.general,O.error,`${g(`tlc2.tool.ConfigFileException`)}${A(k.message,s.isTool)}`),S(),o.error;if(k instanceof f)return T(k);n.has(`-deadlock`)&&(k.checkDeadlock=!1);let j=Oe(e),ne=[j,...a.libraries],re=Mo(ne),ie=Bo(n,_),ae=async()=>{let t=Pe(e,`utf8`),r=E(t).name;if(r!==b)throw new i(`File name '${b}' does not match the name '${r}' of the top level module it contains.`,void 0);let a=await ve({workers:h,livenessCheck:[`final`,`seqfinal`,`off`].includes(l)?`final`:`default`,seed:BigInt(c),dump:d&&mo(d),isTool:s.isTool,isTraceRecorded:ie,isSanyReported:!0,isWarningEnabled:!n.has(`-nowarning`),version:_,onProgress:e=>Eo(s,e,x,j),source:t,config:k,onPause:()=>Fe(0,Buffer.alloc(1)),loadModule:re,loadClass:e=>{let t=To(j,e);return P(t)?Pe(t):void 0},readFile:e=>P(e)?Pe(e,`utf8`):void 0,writeFile:(e,t)=>{Ne(Oe(je(e)),{recursive:!0}),Ve(e,t)}});return Ao(a,s,x),S(),a.failure?.exitCode??$a[a.status]};s.isTool&&s.print(w.startingSany,O.none,`Starting SANY...`);let oe=ke(e),M=oe?b:e.replace(/\.tla$/,``),se=_s(a),ce=_===`1.7.4`?fs(e,a,se):void 0;if(ce?!P(e)&&!y.has(b)&&ce(`${b}.tla`):!P(e)&&!de.has(b)&&No(oe?j:process.cwd(),oe?`${b}.tla`:`./${M}.tla`,[...oe||j===`.`?[]:[j],...a.libraries]),Oa(e,ce?ps(re,ce):re,{fileName:M,describeFile:Io(e,ne,a,n.get(`-metadir`)?.[0],_),version:_,rootExtendees:ie?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Eo(s,{kind:`parsed`},x,j),ee(),S(),o.specParseError;try{return await ae()}catch(e){if(!(e instanceof u))throw e;return e instanceof t&&console.log(Ho(e,b)),x.isParsed||Eo(s,{kind:`parsed`},x,j),T(e)}},Ho=(e,t)=>{let n=e instanceof i;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},Uo=(e,t)=>{if(e instanceof f||e instanceof l){let n=j(e.message),r=n&&!n.isEvalException?n.code:w.general;return t.print(r,O.error,v(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},Wo=async(e,t=fe(!1))=>{try{return await e()}catch(e){if(!(e instanceof u))throw e;return Uo(e,t),r(e)}},Go=async(e,t,n)=>{let r=[];for(let[i,a]of e.entries()){i>0&&console.log(``);let e=n();r.push(await Wo(()=>t(a,e),e))}return r.find(e=>e!==o.success)??o.success},Ko=e=>[`.`,...Te().map(e=>Ae(Oe(Oe(Le(e))),`lib/tlapm/stdlib`)).filter(e=>P(e)).slice(0,1),...e.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],qo=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Jo=(e,t,n)=>qo([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),Yo=`9ed0376`,Xo=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Zo=e=>console.log(`\n\\* TLAPM version ${Yo}\n\\* launched at ${C(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...e].map(Xo).join(` `)}\n`),Qo={failed:10,incomplete:11,emptyTarget:12},$o=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${xe(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${xe(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${ge(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${ge(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[Qo.incomplete]:[],...a?[Qo.emptyTarget]:[]]},es=t=>{try{return t()}catch(t){if(!(t instanceof e))throw t;console.error(` tlapm ending abnormally with ${t.exception}\n`);return}},ts=(e,t)=>{let n=t.method.timeLimitMs,r=t.timeUsedMs===void 0?``:`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/n)}%)`,i=n===0?``:`time-limit: ${n===1/0?`inf`:Number((n/1e3).toPrecision(6))}${r}`,a=[t.method.tactic,i].filter(Boolean).join(`; `),o=(t.method.prover===`smt`||t.method.prover===`z3`)&&t.reason===`false`&&t.verdict?`(* SMT failed with status = ${t.verdict}\n *)\n`:``;Jo(e,t.isProved?`proved`:`failed`,[`prover:${t.method.prover}`,...a===``?[]:[`meth:${a}`],...t.reason===void 0?[]:[`reason:${t.reason}`],`already:${t.isReused}`,...t.isProved?[]:[`obl:${t.isReused?``:`\n${o}`}${ye(e,t.isReused)}`]])},ns=(e,t)=>Jo(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),rs=async(e,t,n,r)=>{let i=_t(r.fingerprints),a=await _e(e.obligations,{workers:r.workers,results:i.results,isFingerprinted:r.isFingerprinted,isProving:r.isProving,onReport:(e,t)=>{if(r.isToolbox){if(e.obligation.status===`trivial`)return Jo(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return ns(t,`user error`);e.attempts.forEach(e=>ts(t,e))}}});if(Ve(t,Ce(e.name,a,e.obligations)),console.log(`(* created new ${JSON.stringify(t)} *)`),i.save(n),console.log(`(* fingerprints written in ${JSON.stringify(n)} *)`),!r.isProving)return!1;let o=a.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);r.isToolbox&&o.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>ns(e.obligation,`unexpected error`)),o.toReversed().forEach(e=>console.error(`${ge(e.obligation.locus)}${he(we(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,N(e.obligation.sequent)),35)}`));let s=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(o.length===0?`${ge(e.location)}[INFO]: All ${s} proved.`:`${ge(e.location)}[ERROR]: ${o.length}/${s} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),o.length>0},is=async t=>{let n=to.parse(t),r=!n.has(`-N`)&&!n.has(`--summary`),i=n.unknown[0]??(r&&n.has(`--printallobs`)?`--printallobs`:void 0);if(i!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${i}.`),1;if(n.incomplete)return console.error(`Error: option '${n.incomplete.name}' needs an argument.`),1;let a=n.options.find(e=>no.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(a)return console.error(`Error: option '${a.name}' expects an integer.`),1;if(n.has(`--version`))return console.log(Yo),o.success;let s=co(n.positionals).map(e=>e.path),c=s.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(c.length===0)return console.error(oo),1;let l=n.has(`--toolbox`)||n.has(`--line`);l&&Zo(t);let u=n.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?be:{start:n,end:n}:e},be),d=c.reduce((e,t)=>e.includes(Oe(t))?e:[Oe(t),...e],Ko(n)),f=/* @__PURE__ */ new Set,p=es(()=>{let t=c.findIndex(e=>!P(e));if(t!==-1){let n=s[t];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new e(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return me(c.map(e=>({file:`./${e}`,source:Pe(e,`utf8`)})),e=>{f.add(e);let t=d.map(t=>`${t}/${e}.tla`).find(e=>P(e));return t===void 0?e===`TLAPS`?{file:`TLAPS.tla`,source:pe}:void 0:{file:t,source:Pe(t,`utf8`)}},{lines:u,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(l&&t)return qo([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!p)return 3;let m=n.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,h=n.get(`--nofpl`)?.map(Number)??[0,0],g={isToolbox:l,isProving:!n.has(`--noproving`),workers:Math.max(1,Number(n.get(`--threads`)?.[0]??Ue())),isFingerprinted:e=>!n.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=h[0]&&e.locus.endLine<=h[1]),fingerprints:/* @__PURE__ */ new Map},_=[];for(let[e,t]of p.entries()){let i=`${m}/${t.name}.tlaps`,a=`${i}/fingerprints`,o=n.get(`--usefp`)?.[0]??a;if(Ne(i,{recursive:!0}),n.has(`--cleanfp`)&&P(a)&&(ze(a),console.log(`(* fingerprints file ${JSON.stringify(a)} removed *)`)),!n.has(`--cleanfp`)&&P(o)&&t.summary.total!==0&&(console.log(n.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${o}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(o)} *)`),dt(g.fingerprints,o,n.has(`--safefp`))),n.has(`--summary`)&&console.log(Se(t)),l&&(t.obligations.forEach(e=>Jo(e,`to be proved`,n.has(`--printallobs`)?[`obl:${e.text}`]:[])),qo([`type:obligationsnumber`,`count:${t.obligations.length}`])),n.has(`--strict`)&&_.push(...$o(t,u.start>0||u.end<1/0,n.has(`--summary`))),!r)continue;gt(a,[...f,...p.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`));let s=await rs(t,`${i}/${t.name}.thy`,a,g);if(s&&n.has(`--strict`)&&_.push(Qo.failed),s&&!n.has(`--strict`)&&!l)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
39
+ Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
40
+ Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
41
+ Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
42
+ Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
43
+ Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
44
+ Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
45
+ `),3}return Object.values(Qo).find(e=>_.includes(e))??o.success},as=async(e,t)=>{let n=eo.parse(e),r=co(n.positionals),i=n.has(`-config`),a=r.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||i||P(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(oo),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>P(e)||ke(e)?e:t.libraries.map(t=>Ae(t,e)).find(P)??e))],s=t.tlcVersion??`master`;return Go(o,(e,r)=>(o.length>1&&console.log(`Checking ${Ee(e)} with ${Ee(e,`.tla`)}.cfg`),Vo(e,n,t,r)),()=>fe(n.has(`-tool`),!n.has(`-nowarning`),s))},os=e=>(process.stderr.write(`ERROR: ${e}\n${ao}`),ka.argsParsingFailure),ss=(e,t)=>{try{return process.stdout.write(Xa(e,t)),o.success}catch(e){if(!(e instanceof d))throw e;let t=r(e),n=e instanceof c?e.unwound:``;return console.error(t===ka.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},cs=(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`}},ls=e=>{if(e.length===0)return os(`at least one .tla file must be given`);let t=cs(e,ro);if(t.error===`missing-include`)return os(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return os(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(ao),o.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>je(e,r)).find(P);a===void 0&&!de.has(r.slice(0,-4))&&No(process.cwd(),`./${r}`,t.includes);let s=Oa(a??r,Mo(i),{fileName:n,isXmlExport:!0});return process.stderr.write(s.text),s.isFailed||s.specification===void 0?(console.error(`ERROR: Failed to parse module.`),ka.specParsingFailure):ss(s.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},us=(e,t,n)=>console.error(`File does not exist: ${ke(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[Po(n)]].join(`, `)}`),ds=e=>e.endsWith(`/`)?e:`${e}/`,fs=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!ke(e)&&r!==``?[r]:t.libraries).map(ds),a=i.length>0?i[i.length-1]:ke(e)?r:``;return e=>us(`${a}${e}`,i,n)},ps=(e,t)=>n=>{let r=e(n);return r===void 0&&!y.has(n)&&t(`${n}.tla`),r},ms=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),ka.uncaughtException),hs=(e,t)=>{if(e.length===0)return ms(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=cs(e,io);if(n.error===`missing-include`)return ms(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return ms(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(ds),s=[`.`,...a],c=e=>us(`${a[a.length-1]}${e}`,a,t),l=s.map(e=>je(e,i)).find(P);if(l===void 0&&!y.has(Ee(i,`.tla`)))return c(i),o.success;let u=Oa(l??i,ps(Mo(s),c),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?ms(`tla2sany.xml.XMLExportingException: spec ${(l&&Da(Pe(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):ss(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},gs=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],_s=e=>e.classPath?.split(De).find(e=>e.endsWith(`.jar`)),vs=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(De));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||gs.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},ys=e=>e.mainClass===`tlc2.TLC`?as(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?Wo(()=>e.java.tlcVersion===`1.7.4`?hs(e.args,_s(e.java)):ls(e.args)):(console.error(`Error: tla-ts runs the Java classes ${gs.join(` and `)}, not ${e.mainClass}.`),1),bs=async e=>{if(e[0]===`tlapm`)return Wo(()=>is(e.slice(1)));let t=vs(e);return t===void 0?as(e,{libraries:[]}):(t.java.tlcVersion??=await Qa(_s(t.java)),ys(t))},xs=async()=>{process.exitCode=await bs(process.argv.slice(2))};export{xs as runCli};