tla-ts 0.0.4-dev.2be6058 → 0.0.4-dev.43f28be

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 (313) hide show
  1. package/README.md +27 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +37 -1
  6. package/dist/index.d.ts +37 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +517 -47
  17. package/dist/run-cli.js +517 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +255 -56
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  37. package/src/{obligations.ts → obligations/index.ts} +28 -12
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  39. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  40. package/src/obligations/pickle.ts +100 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  44. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  45. package/src/obligations/temporal.ts +319 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +100 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +508 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +520 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +552 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +27 -0
  117. package/src/prove/prove.ts +518 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +256 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +210 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +665 -0
  126. package/src/prove/smt/encode.ts +169 -0
  127. package/src/prove/smt/extensionality.ts +63 -0
  128. package/src/prove/smt/flatten.ts +127 -0
  129. package/src/prove/smt/format.ts +143 -0
  130. package/src/prove/smt/instances.ts +182 -0
  131. package/src/prove/smt/rewrite.ts +784 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +97 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +444 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +338 -62
  305. package/src/standard-modules.ts +5 -2
  306. package/src/successors.ts +25 -6
  307. package/src/tlapm-cache.ts +244 -0
  308. package/src/tlc-random.ts +55 -32
  309. package/src/tlc-version.ts +8 -7
  310. package/src/values.ts +97 -47
  311. package/src/worker.ts +65 -0
  312. package/dist/parallel.cjs +0 -12
  313. package/dist/parallel.js +0 -12
package/dist/transfer.cjs CHANGED
@@ -6,30 +6,24 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
-
11
- `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
- `)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
13
- of an incorrect recursive function definition that caused TLC to enter
14
- an infinite loop when trying to compute the function or its application
15
- to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),D=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>ue.has(e));if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ue.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=e=>e!==void 0&&e>=`0`&&e<=`9`,ye=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},be=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ye(e,t+1,ve);if(n===t+1||e[n]!==`>`)return 0;let r=ye(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ye(e,i?r+1:r,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se=(e,t)=>t===` `?e+8-e%8:e+1,Ce=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
- `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=Se(o.width,e[o.position]);return Se(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
17
- `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
18
- `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
19
- `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ye(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ye(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
20
- \r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
21
- `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,ye(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=be(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},we=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],k=we.map(e=>e[0]),Te=new Map(k.map((e,t)=>[e,t]).reverse()),A=e=>{let t=Te.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Ee=new Map(we.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),De=Math.max(...[...Ee.keys()].map(e=>e.length)),Oe=Array.from({length:De},(e,t)=>De-t),ke=/----+ *MODULE/y,Ae=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],je=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Me=je(String.raw`\.\/\\`),Ne=je(String.raw`\.\\\/`),Pe=String.raw`<(?:[0-9]+|\+|\*)>`,Fe=[[`_BM0`,[ke]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Pe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Pe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Pe}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ie=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ke]]],Le=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ke]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae]],j=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Re=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>j(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ze=(e,t)=>{let n=Oe.find(n=>Ee.has(e.slice(t,t+n))),r=Re(Fe,e,t);if(n===void 0)return r;let i={kind:Ee.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Be=e=>e+8-e%8,Ve=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
9
+ const e=require("./worker.cjs"),t=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),n=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),r=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),i=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),a=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),o=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,}[ \t]*MODULE\b/,u=e=>/[A-Za-z0-9_]/.test(e),d=(e,t)=>{let o=e[t];if(o===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let r=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,i={value:r.length};for(;i.value>0&&!n.has(r.slice(0,i.value));)i.value--;let a=n.get(r.slice(0,i.value));return{text:a??`\\`,length:a===void 0?1:i.value+1}}let s=[e.slice(t,t+2),o].find(e=>a.has(e));if(s!==void 0)return{text:a.get(s)??``,length:s.length};let c=i.find(n=>e.startsWith(n,t));return c?{text:r.get(c)??c,length:c.length}:o===`\\`?{text:`\\`,length:1}:void 0},f=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),p=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>a.has(e)||f.has(e));return n===void 0?void 0:{text:n,length:n.length}},m=e=>e!==void 0&&e>=`0`&&e<=`9`,h=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},g=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:h(e,t+1,m);if(n===t+1||e[n]!==`>`)return 0;let r=h(e,n+1,u),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return h(e,i?r+1:r,e=>e===`.`)-t},_=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,v=(e,t)=>t===` `?e+8-e%8:e+1,ee=n=>{let r=l.exec(n);if(!r)throw new e.D(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,s=n.slice(0,r.index).split(`
10
+ `),c={index:r.index,line:s.length,lineStart:r.index-s[s.length-1].length,moduleDepth:0},f={lineStart:-1,position:0,width:0},p=()=>{for((f.lineStart!==c.lineStart||f.position>c.index)&&(f.lineStart=c.lineStart,f.position=c.lineStart,f.width=0);f.position<c.index;f.position++)f.width=v(f.width,n[f.position]);return v(f.width,n[c.index])},m=(e,t,n,r)=>{let a=p();i.push({kind:e,text:t,spelling:r,line:c.line,column:a,endColumn:a+n-1}),c.index+=n},_=e=>{for(let t=0;t<e;t++)n[c.index]===`
11
+ `&&(c.line++,c.lineStart=c.index+1),c.index++},ee=t=>new e.D(`${t} at line ${c.line}, column ${p()}`,void 0,{reason:t,line:c.line,column:p(),isEnd:c.index>=n.length});for(;c.index<n.length;){let e=n[c.index];if(e===`
12
+ `||e===` `||e===` `||e===`\r`){_(1);continue}if(n.startsWith(`\\*`,c.index)){let e=n.indexOf(`
13
+ `,c.index);_((e===-1?n.length:e)-c.index);continue}if(n.startsWith(`(*`,c.index)){let e={value:0};do{if(c.index>=n.length)throw ee(`Unterminated comment`);n.startsWith(`(*`,c.index)?(e.value++,_(2)):n.startsWith(`*)`,c.index)?(e.value--,_(2)):_(1)}while(e.value>0);continue}if(n.startsWith(`----`,c.index)){let e=h(n,c.index,e=>e===`-`)-c.index;n.slice(c.index+e).trimStart().startsWith(`MODULE`)&&c.moduleDepth++,m(`Separator`,`----`,e);continue}if(n.startsWith(`====`,c.index)){if(m(`ModuleEnd`,`====`,h(n,c.index,e=>e===`=`)-c.index),c.moduleDepth--,c.moduleDepth<=0)break;continue}if(e===`"`){let e=c.line,t=p(),r=[];for(_(1);n[c.index]!==`"`;){if(c.index>=n.length||`
14
+ \r`.includes(n[c.index]))throw ee(`Unterminated string`);if(n[c.index]===`\\`){let e=n[c.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ee(`Invalid escape in string`);r.push({n:`
15
+ `,t:` `,r:`\r`,f:`\f`}[e]??e),_(2)}else r.push(n[c.index]),_(1)}_(1),i.push({kind:`String`,text:r.join(``),line:e,column:t,endColumn:p()-1});continue}let r=o.exec(n.slice(c.index,c.index+64));if(r){m(`Number`,r[0],r[0].length);continue}if(u(e)){let e=n.slice(c.index,h(n,c.index,u));if(/^\d+$/.test(e)){let t=/^\d+(\.\d+)?/.exec(n.slice(c.index))?.[0]??e;m(t.includes(`.`)?`Decimal`:`Number`,t,t.length);continue}let r=/^(_|\d+)/.exec(e)?.[0];if(r!==void 0&&!/[A-Za-z]/.test(e)){m(r===`_`?`Operator`:`Number`,r,r.length);continue}if(e.startsWith(`WF_`)||e.startsWith(`SF_`)){m(`Keyword`,e.slice(0,3),3);continue}let i=a.get(e)??e;a.set(i,i),m(t.has(e)?`Keyword`:`Identifier`,i,e.length);continue}if(`ℕℤℝ`.includes(e)){m(`Identifier`,a.get(e)??e,1),a.set(e,e);continue}let s=g(n,c.index);if(s>0){m(`Step`,n.slice(c.index,c.index+s),s);continue}let l=d(n,c.index);if(l){let e=n.slice(c.index,c.index+l.length);m(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw ee(`Unexpected character ${JSON.stringify(e)}`)}let y=p();return i.push({kind:`End`,text:``,line:c.line,column:y,endColumn:y}),i},y=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],b=y.map(e=>e[0]),x=new Map(b.map((e,t)=>[e,t]).reverse()),S=t=>{let n=x.get(t);if(n===void 0)throw new e.h(`Unknown SANY token kind ${t}`);return n},te=new Map(y.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),ne=Math.max(...[...te.keys()].map(e=>e.length)),re=Array.from({length:ne},(e,t)=>ne-t),ie=/----+ *MODULE/y,ae=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],C=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),oe=C(String.raw`\.\/\\`),se=C(String.raw`\.\\\/`),ce=String.raw`<(?:[0-9]+|\+|\*)>`,w=[[`_BM0`,[ie]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,oe],[`BOR`,se],[`IDENTIFIER`,ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${ce}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(ce,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${ce}(?:\*\.*|-\.*|\.+)`,`y`)]]],T=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ie]]],E=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ie]],[`BAND`,oe],[`BOR`,se],[`IDENTIFIER`,ae]],D=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),le=(e,t,n)=>e.map(([e,r])=>({kind:S(e),length:Math.max(...r.map(e=>D(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ue=(e,t)=>{let n=re.find(n=>te.has(e.slice(t,t+n))),r=le(w,e,t);if(n===void 0)return r;let i={kind:te.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},de=e=>e+8-e%8,fe=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
22
16
  `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
23
- `?r.isAfterLf=!0:i===` `&&(r.column=Be(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},He=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ue=new Set([...Ee.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),We=(e,t)=>{let n=0;for(;Ue.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,j(He,e,t)))},Ge=e=>{let t=Ve(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(A(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Je(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
- `||e[a]===`\r`?Je(o+1,0,void 0,i):Je(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Re(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,k[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),k[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ie);if(n.mode===`PRAGMA`)return s(Le);for(;n.offset<e.length;){let t=n.offset;if(`
25
- \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=ze(e,t);if(i.length===0){let n=We(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Ke=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ke.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Je=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${qe(n)}" (${n.charCodeAt(0)}), `}after : "${qe(r)}"`,Ye=e=>{let t=Ge(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Be(e):e+1,e.beginColumn);return Je(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Xe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ze=/* @__PURE__ */ new Set([...Xe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Qe=[`TYPE`,`TYPE_CONSTRAINT`],$e=/* @__PURE__ */ new Set([...Xe,...Qe]),et=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],tt=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Je(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Je(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
17
+ `?r.isAfterLf=!0:i===` `&&(r.column=de(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},pe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,O=new Set([...te.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),me=(e,t)=>{let n=0;for(;O.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,D(pe,e,t)))},k=e=>{let t=fe(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(S(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?_e(o,s,e[a],i):t.lines[n]===o?e[a]===`
18
+ `||e[a]===`\r`?_e(o+1,0,void 0,i):_e(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,b[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),b[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(T);if(n.mode===`PRAGMA`)return s(E);for(;n.offset<e.length;){let t=n.offset;if(`
19
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=ue(e,t);if(i.length===0){let n=me(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},he=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
20
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>he.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),_e=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${ge(n)}" (${n.charCodeAt(0)}), `}after : "${ge(r)}"`,ve=e=>{let t=k(e);for(let e=t();typeof e!=`string`&&e.kind!==S(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?de(e):e+1,e.beginColumn);return _e(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ye=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],be=/* @__PURE__ */ new Set([...ye,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),xe=[`TYPE`,`TYPE_CONSTRAINT`],Se=/* @__PURE__ */ new Set([...ye,...xe]),Ce=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],we=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:_e(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:_e(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
27
21
  `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
28
- `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=_e(e,n.index)??O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},nt=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),rt=(e,t)=>nt(e,`The keyword ${t} appeared twice.`),M=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),it=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),at=(e,t=`master`)=>{let n=t===`1.7.4`?$e:Ze,r=tt(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw nt(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw nt(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw nt(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw nt(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw nt(e,``);r.token=c()}if(r.token.text!==`=`)throw nt(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?M.get(e):void 0,i=n.has(e)?it.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw nt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw rt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw nt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw rt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Qe.includes(e))throw nt(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw rt(t,e);s.add(e),p.token=c()}}return a},ot={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},st=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ct=e=>e!==void 0&&/^\p{Nd}$/u.test(e),lt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ut=e=>{let t=t=>{let n=ye(e,t,st);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,ct);if(e.startsWith(`..`,n)&&ct(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ct)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ct(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,ct)-1,children:[]};if(lt(n))return{kind:`Constant`,first:t,last:ye(e,t,lt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},dt=e=>{let t=e.length===0?void 0:ut(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=ot[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),F=e=>typeof e==`object`&&e.kind===`ModelValue`,pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,mt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ht={isUsed:!1},gt=(e,t)=>(ht.isUsed=!0,e.writtenKeys=t,e),_t=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Sr(e.domain,t)]]),vt=(e,t,n)=>gt(tn(e,t),n),yt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(yt);e.writtenKeys=void 0,e.range.forEach(yt)}},bt=e=>e.every(e=>typeof e==`string`),xt=(e,t)=>e.length>0&&t.length>0&&bt(e)!==bt(t),St=(e,t)=>{ht.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xt(n,r)?Cn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=zt(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=zt(i[e],a[e]);if(t!==0)return t}return 0},Ct=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=zt(n[e],r[e]);if(t!==0)return t}return 0},wt=e=>F(e)?e.type:void 0,Tt=(e,t,n)=>{let r=wt(e),i=wt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(F(e)&&F(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Et={ranks:Object.create(null),size:0},Dt=e=>{Et.ranks=Object.create(null),Et.size=0,Bt.clear();for(let t of e)At(t)},Ot={is174:!1},kt=e=>{Ot.is174=e===`1.7.4`},At=e=>(Et.ranks[e]===void 0&&(Et.ranks[e]=Et.size++),e),jt=()=>Et.size,Mt=e=>Et.ranks[At(e)],Nt=(e,t)=>{if(e===t)return 0;let n=Et.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Pt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ft=(e,t)=>(Pt(e)||Pt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),It=(e,t,n)=>{if(!Pt(e))throw new y(`Attempted to ${n} the set ${z(I(e)?L(e):e,!0)} with the value:\n${z(t,!0)}`);if(!Pt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Lt={kind:`InfiniteSet`,name:`Any`},Rt=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},zt=(e,t)=>{if(e===t)return ht.isUsed&&yt(e),e===Lt?Rt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return St(e,t);if(n===`Set`&&r===`Set`)return Ct(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Tt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tt(e,t,!1),n===`ModelValue`?-1:1;if(e===Lt||t===Lt)return Rt(e===Lt?t:e);if(N(e)&&N(t)&&Ft(e,t))return It(e,t,`compare`);let i=N(e);if(i!==N(t))throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`);return i?Ct(L(e),L(t)):St(Ar(e),Ar(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tt(e,t,!1),F(e))return-1;if(F(t))return 1;throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`)},Bt=/* @__PURE__ */ new Map,Vt=e=>{let t=Bt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Mt(e)};return Bt.set(e,n),n},Ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Wt={isPresent:!1},Gt=(e,t)=>(t===`lambda`&&(Wt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Kt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,qt=e=>Gt(e,`lambda`),Jt=/* @__PURE__ */ new WeakSet,Yt=/* @__PURE__ */ new WeakSet,Xt={isPresent:!1},Zt=e=>(Xt.isPresent=!0,e),Qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),$t=e=>{Xt.isPresent&&typeof e==`object`&&Qt.has(e.kind)&&Yt.add(e)},en=e=>{!Wt.isPresent&&!Xt.isPresent||typeof e!=`object`||Jt.has(e)||(Jt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(en),e.range.forEach(en)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(en):N(e)&&I(e)&&($t(e),L(e).elements.forEach(en)))},tn=(e,t)=>Gt(Ut(e,t),`record`),nn=(e,t)=>{if($t(e),e===t)return ht.isUsed&&yt(e),e!==Lt||Rt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tt(e,t,!0),zt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return St(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ct(e,t)===0;if(F(e)||F(t))return Tt(e,t,!0),F(e)&&F(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:nn(e.domain,t.domain)&&nn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&nn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nn(e,t.factors[n]));let n=N(e)&&N(t)&&!(I(e)&&I(t));if(n&&Ft(e,t))return It(e,t,`check equality of`)===0;if(n){if(!Pt(e)){let n=L(e);if(!Pt(t))return Ct(n,L(t))===0}return oi(e)===oi(t)}return zt(e,t)===0},rn=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):oi(n)===oi(r);return n},an=rn(!1),on=rn(!0),sn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},cn=e=>{if(!P(e))return;let t=Ar(e);return{domain:t.domain,range:t.range,low:sn(t.domain)}},ln=e=>{if(!P(e))return;let t=Ar(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},un=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},dn=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},fn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)?e.rank-t.rank:-1;if(!F(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},pn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)&&e.name===t.name;if(!F(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},mn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},hn=(e,t,n)=>{let r=mn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},gn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return un(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>_n(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return _n(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},_n=(e,t)=>{for(let n=0;n<e.length;n++){let r=Cn(e[n],t[n]);if(r!==0)return r}return 0},vn=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length-r.length||_n(n.range,r):gn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return un(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||_n(n.domain,r.domain)||_n(n.range,r.range)}return gn({...n,low:sn(n.domain)},e,t)},yn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),bn=(e,t)=>Pt(e)||Pt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),xn=(e,t)=>{let n=yn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Sn=(e,t)=>{if(bn(e,t))return zt(e,t);if(!yn(e))return Sn(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length-n.otherElements.length||_n(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return un(t,e);throw new y(hn(e,t,!1))}return e.kind===`ModelValue`?fn(e,t):P(e)?vn(e,t):Sn(e,t)},wn=(e,t)=>e.every((e,n)=>On(e,t[n])),Tn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return dn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&wn(e.range,r.range);let i=e.low??r.low;return i===void 0?wn(e.domain,r.domain)&&wn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&wn(e.range,r.range)},En=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length===r.length&&wn(n.range,r):Tn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&wn(n.domain,r.domain)&&wn(n.range,r.range)}return Tn({...n,low:sn(n.domain)},e,t)},Dn=(e,t)=>{if(bn(e,t))return nn(e,t);if(!yn(e))return Dn(L(e),t);if(!N(t)){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length===n.otherElements.length&&wn(n.elements,n.otherElements)},On=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return dn(t,e);throw new y(hn(e,t,!0))}return e.kind===`ModelValue`?pn(e,t):P(e)?En(e,t):Dn(e,t)},kn=e=>{let t=[];for(let n of e){let e=jn(n,t);e.isFound||t.splice(e.index,0,n)}return t},An=(e,t)=>{let n=Tr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},jn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=An(e,()=>Cn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Mn=(e,t)=>t.some(t=>An(t,()=>On(t,e))),Nn=/* @__PURE__ */ new WeakSet,Pn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Nn.add(e),e.elements.forEach(Pn)),e.kind===`Function`&&(e.domain.forEach(Pn),e.range.forEach(Pn)))},Fn=(e,t)=>Er(()=>nn(e,t),()=>On(e,t)),In=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},Ln=e=>{for(let t=1;t<e.length;t++)$t(e[t]);if(e.length<2||In(e))return Ht(e);let t=[...e].sort(zt),n=[t[0]];for(let e=1;e<t.length;e++)zt(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ht(n)},Rn=e=>Er(()=>Ln(e),()=>({kind:`MixedSet`,elements:e})),zn=Ht([]),Bn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ht(i)},Vn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ht(i)},Hn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=zt(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Ht(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ti(a[e])|0;c.fingerprint=t}return c},Un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>zt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&zt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ut(n,r)},Wn=e=>{let t=Un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:gt(t,e.map(e=>e[0]))},Gn=[],Kn=[],qn=/* @__PURE__ */ new WeakMap,Jn=e=>{let t=Gn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Gn[e]=n,n},Yn=e=>{if(yr(e),e.low===1&&e.high>=1)return Jn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Xn=e=>e.length>0&&(e===Gn[e.length]||qn.has(e)),Zn=e=>{let t=L(e).elements;return Xn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Qn=e=>{let t=Kn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Kn[e]=n,n},$n=e=>Gt(Ut(Jn(e.length),e),`tuple`),er=e=>Gt(Un(e),`record`),tr=e=>N(e)&&!Pt(e),nr=(e,t=!1)=>`UNION(${z(e.base,t)})`,rr=(e,t=e=>L(e).elements)=>{if(!tr(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${nr(e)}`);return t(e.base)},ir=(e,t,n)=>{if(tr(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${nr(n)}`)},I=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||ar(e.domain)===!0||ar(e)===!0;case`RecordSet`:return e.sets.every(I)||ar(e)===!0;case`ProductSet`:return e.factors.every(I)||ar(e)===!0;case`Union`:return I(e.base)&&pr(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},ar=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=ar(e.domain);return t===void 0?void 0:!t&&ar(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ar(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},or=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},sr=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},cr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Pt(e.base))return;let t=L(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:sr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Ht(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},lr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ht(r.map(t=>e[t])));while(sr(r,e.length))}return t},ur=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Pt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},dr=(e,t=e=>L(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return kn(e.elements);case`Interval`:{let t=Yn(e);return t!==Gn[t.length]&&qn.set(t,e),t}case`Subset`:{if(yr(e.base)===0)return lr([]);if(!N(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${dt(z(e.base))}`);let t=L(e.base).elements;if(t.length>30)throw new y(vr(e));return lr(t)}case`FunctionSet`:{if(!Ot.is174&&R(e))return[];if(Pt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=Zn(e.domain);if((n.length>0||Ot.is174)&&Pt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return or(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${z(t)}`);return or(n).map(t=>er(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return or(n).map($n)}case`FilteredSet`:if(!N(e.base)||Pt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return L(e.base).elements.filter(e.test);case`Union`:{let t=rr(e).flatMap((t,n)=>L(ir(t,n,e)).elements);return L(Rn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!tr(e.left)||!tr(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!tr(e.left)&&!tr(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!tr(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Hn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Dr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},fr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(dr(e));let t=typeof e==`object`?fr.get(e):void 0;if(t)return t;let n=Tr.sets;n?.push(e);let r=dr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ht(r):Ln(r);return typeof e==`object`&&fr.set(e,i),i},pr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=Tr.sets;t?.push(e);let n=gr(e);return t?.pop(),n},mr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,hr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?hr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||hr(e.left)||hr(e.right):mr(e)?.some(hr)??!1,gr=e=>{if(e.kind===`Union`)return rr(e,pr).flatMap((t,n)=>pr(ir(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return pr(e.base).filter(e.test);if(mr(e)?.some(hr))return dr(e,pr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!tr(e.left)||!tr(e.right)?L(e).elements:[...pr(e.left),...pr(e.right)];let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return tr(n)?pr(n).filter(t=>Dr(t,r)===(e.operator===`\\cap`)):L(e).elements},R=e=>{if(typeof e!=`object`||!N(e))throw new y(`Shouldn't call isEmpty() on value ${z(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(R);case`RecordSet`:return e.sets.some(R);case`FunctionSet`:return!R(e.domain)&&R(e.range);case`Union`:return rr(e).every((t,n)=>R(ir(t,n,e)));default:return L(e).elements.length===0}},_r=(e,t,n)=>e.reduce((e,r)=>{let i=e*yr(r,t);if(i>2147483647)throw new y(n());return i},1),vr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,yr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return yr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=yr(e.base,t);if(n>=31)throw new y(vr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(yr(e.range,t)===1)return 1}let n=yr(e.domain,t),r=yr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(vr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:_r(e.sets,t,()=>vr(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:_r(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return $t(e),L(e).elements.length}},br=e=>`Attempted to check if the set ${z(e)}is finite.`,xr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pt(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return xr(e.base)&&R(e.base);case`Subset`:return xr(e.base);case`FunctionSet`:{let t=xr(e.domain);if(t&&R(e.domain))return!0;let n=xr(e.range);return n&&R(e.range)?!0:n&&(t||yr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!xr(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!tr(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${nr(e)}\nis a finite set.`);return L(e.base).elements.every(xr);case`SetOperation`:if(e.operator===`\\cup`)return xr(e.left)&&xr(e.right);if(e.operator===`\\cap`){if(!xr(e.left)&&!xr(e.right))throw new y(br(e));return!0}if(xr(e.left))return!0;if(!xr(e.right))throw new y(br(e));return!1;case`FilteredSet`:if(!xr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},Sr=(e,t,n=zt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Cr=e=>{if(typeof e!=`object`||!P(e))return;let t=Ar(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},wr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!P(t))return`${n} ${pt(t)} ${z(t)}`;let r=Kt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Tr={sets:void 0},Er=(e,t)=>{let n=Tr.sets,r=Tr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},Dr=(e,t)=>{let n=Tr.sets;if(n===void 0)return Or(e,t);n.push(t);let r=Or(e,t);return n.pop(),r},Or=(e,t)=>{if(!N(t))throw new y(wr(e,t));switch(t.kind){case`Set`:return $t(e),Er(()=>Sr(t.elements,e)!==-1,()=>Nn.has(t)?jn(e,t.elements).isFound:Mn(e,t.elements));case`MixedSet`:return Mn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!F(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(F(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!N(e)||Pt(e))throw new y(`Attempted to check if the non-enumerable value\n${dt(z(e))}\nis element of\n${dt(z(t))}`);return L(e).elements.every(e=>Dr(e,t.base));case`FunctionSet`:{if(!P(e)){if(F(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${dt(z(t))}`)}let n=Ar(e),r=sn(n.domain);return(r===void 0?Fn(t.domain,Ht(n.domain)):Fn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Dr(e,t.range))}case`RecordSet`:{let n=P(e)?Ar(e):void 0;if(!n||!bt(n.domain)){if(F(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Sr(n.domain,e);return i!==-1&&Dr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?Cr(e):void 0;if(n===void 0){if(P(e)&&Ar(e).domain.every(e=>typeof e==`number`)||F(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Dr(e,t.factors[n]))}case`FilteredSet`:return Dr(e,t.base)&&t.test(e);case`Union`:if(!tr(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${nr(t)}`);return L(t.base).elements.some(t=>Dr(e,t));case`SetOperation`:return t.operator===`\\cup`?Dr(e,t.left)||Dr(e,t.right):Dr(e,t.left)&&Dr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Cr(e);if(n===void 0){if(F(e))return!1;throw new y(`Attempted to check if the value:\n${dt(z(e))}\nis an element of ${dt(z(t))}.`)}return n.every(e=>Dr(e,t.base))}default:throw new y(wr(e,t))}},kr=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Dr(e,n):e.range.every((e,r)=>kr(e,t.range[r],n.range)),Ar=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||yr(e.domain);let t=Zn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},jr=(e,t,n)=>{let r=dt(z(e)),i=dt(z(t)),a=n===`1.7.4`;switch(Kt(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Mr=(e,t)=>{if(!Ot.is174)return jr(e,t);let n=dt(z(t));return Kt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Sr(e,t)},Pr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Fr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Kt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Ot.is174&&Xn(r))throw Pr(t)}return Er(()=>Nr(r,t),e=>{throw Ot.is174||r.length<32?r.forEach(e=>On(e,t)):Sr(r,t,Cn),e})},Ir=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Dr(t,e.domain))throw new y(Kt(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??jr,i=Fr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Lr=e=>Xn(e)?qn.get(e)??Qn(e.length):void 0,Rr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Ar(e).domain;return Lr(t)??Ht(t)},zr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Dr(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Fn(t,n)?r:e.apply(n),source:e.source},Kt(e))}if(!P(e))throw new y(`Attempted to apply EXCEPT construct to the value ${dt(z(e))}.`);let i=Ar(e),a=Fr(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Gt(Ut(i.domain,o),Kt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ni(e,s)+ni(e,c)|0}return l},Br=/* @__PURE__ */ new WeakMap,Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`ModelValue`)return Vr(Hr(Ur(e.name),109));if(N(e)){if(!I(e))return Kr;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return Kr;let t=Ar(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Zr(t.domain[e]),i=Zr(t.range[e]);if(r===Kr||i===Kr)return Kr;n=n+Gr(r,i)|0}return n},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(N(e)){L(e).elements.forEach(Jr);return}let t=Ar(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},Xr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Zr=e=>{if(typeof e==`number`)return Vr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Ur(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=qr(e)),e.hash;let t=Br.get(e);if(t!==void 0)return t;let n=qr(e);return Br.set(e,n),n},Qr=/* @__PURE__ */ new WeakMap,$r=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ei=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return $r(t)},ti=e=>$r(ii(e)+2135587861|0),ni=(e,t)=>$r(Math.imul(ii(e),374761393)+ii(t)|0),ri=e=>{if(e.kind===`ModelValue`)return $r(ei(e.name)^60);if(N(e)){if(!I(e))return ei(oi(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ti(t[e])|0;return n}let t=Ar(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+ni(t.domain[e],t.range[e])|0;return n},ii=e=>{if(typeof e==`number`)return $r(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return ei(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ri(e)),e.fingerprint;let t=Qr.get(e);if(t!==void 0)return t;let n=ri(e);return Qr.set(e,n),n},ai=/* @__PURE__ */ new WeakMap,oi=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ai.get(e);if(t!==void 0)return t;let n=si(e);return ai.set(e,n),n},si=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${oi(e.base)}>`;if(e.kind===`FilteredSet`&&!I(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(N(e))return I(e)?`{${L(e).elements.map(oi).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Ar(e);return`(${t.domain.map((e,n)=>`${oi(e)}:${oi(t.range[n])}`).join(`,`)})`},ci=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,li=e=>e.reduce((e,t)=>e===0?0:e*yr(t),1),ui=e=>{if(e.kind===`Subset`)return yr(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&yr(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?yr(e.range)**yr(e.domain):li(e.kind===`RecordSet`?e.sets:e.factors);return t===0?zn:t<=1999?L(e):void 0},di=(e,t)=>{if(t)return ui(e);if(I(e))try{return ui(e)}catch(e){if(e instanceof y)return;throw e}},fi=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return nr(e,t)}},pi=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),mi=e=>{if(I(e.domain))try{return Ar(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ci(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=di(e,t);return n?r(n):fi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?mi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ot.is174&&Kt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Kt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Kt(e)===`record`||i.domain.every(e=>typeof e==`string`&&pi(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):_t(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},hi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},gi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_i=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||on(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||on(i[e],n))return i[e]}return n.kind===`Set`?gi(n.elements,t):(gi(n.domain,t),gi(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},vi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,yi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),bi=(e,t)=>yi.has(e)?new y(t):new S(t),xi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||xi(r))throw bi(n,`${n} expects a value as argument ${t+1}`);return r},Si=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw bi(n,`${n} expects an integer but received ${z(r)}`);return r},Ci=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw bi(n,`${n} expects a boolean but received ${z(r)}`);return r},wi=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw bi(n,`${n} expects a set but received ${z(r)}`);return r},Ti=(e,t,n)=>{let r=wi(e,t,n);if(!I(r))throw bi(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ei=(e,t,n)=>L(Ti(e,t,n)),Di=(e,t,n)=>Ei(e,t,n).elements,Oi=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw bi(n,`${n} expects a sequence but received ${z(r)}`);return i},ki=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw bi(n,`${n} expects a function but received ${z(r)}`);return Ar(r)},Ai=(e,t,n)=>{let r=e[t];if(r===void 0||!xi(r))throw bi(n,`${n} expects an operator as argument ${t+1}`);return r},ji=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Mi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ni=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Pi=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Fi=e=>e>2147483647||e<-2147483648,Ii=e=>new S(`Overflow when computing ${e}`),Li={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Ri={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},zi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Bi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Vi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ri[e.operator];if(e.kind!==`Function`)return Li[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:Bi[t]},Hi=e=>zi[Vi(e)],Ui=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Wi=(e,t)=>{let n=n=>(...r)=>{let i=Tr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Tr.sets&&(Tr.sets.length=i),Ui(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Gi=(e,t)=>{if(typeof e!=`number`)throw Ui(t,`Cannot cast tlc2.value.impl.${Vi(e)} to tlc2.value.impl.IntValue`);return e},Ki=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,qi=(e,t,n,r)=>{let i=Ki(e,n,`IntValue`,2);return Pi(t,(e,n)=>{let a=Gi(e,i),o=Gi(n,i),s=r(a,o);if(Fi(s))throw Ii(`${a}${t}${o}`);return s})},Ji=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Yi=(e,t,n=e)=>Pi(e,(e,r)=>t(Ji(e,`first`,n),Ji(r,`second`,n))),Xi=(e,t,n)=>({...Ni(e,t,n),isLazy:!0}),Zi=(e,t,n)=>{let r=Ai(e,t,n);return()=>r.call([])},Qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),$i=()=>({bool:gl,condition:(e,t)=>{if(typeof e!=`boolean`)throw nl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw rl(t,n,e);return e},apply:Ir,expectFunction:pl,tuple:$n,set:Rn,record:tn,writtenRecord:vt,equal:nn,enumerate:Dl,unassigned:(e,t)=>{throw _d(e,t)},primeOutsideAction:e=>{throw yd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:ml,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>dl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ea={value:void 0},ta=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),na=e=>`local${e.counter++}`,ra=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),vi(e).forEach(e=>ra(e,t)),t),ia=(e,t,n)=>{let r=ta(e,Wu(t,e.environment)),i=ra(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ta(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},aa=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>na(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${ca(e,t.set,s)}, ${ta(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=na(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${ca(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=na(e),a=na(e),o=na(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},oa=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${ca(e,r[0],n)}, "the left side of =>") ? bool(${ca(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ia(e,t,n);let i=$l(t.operator,e.environment);if(i?.kind!==`Builtin`)return ia(e,t,n);if(i.name===`DOMAIN`)return`${ta(e,ol(t))}(${ca(e,r[0],n)})`;if(i.name===`TLCEval`)return ia(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ta(e,sl(t,i))}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Zu(r[0],a))return`${ta(e,i.evaluateUnary)}(${ca(e,r[0],n)})`;let o=r.length===2&&Zu(r[0],a)&&Zu(r[1],a);return i.evaluateBinary&&o?`${ta(e,i.evaluateBinary)}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`:ia(e,t,n)},sa=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=lu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return sa(e.expression,t,n);case`FieldAccess`:return sa(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>sa(e,t,n));default:return!1}},ca=(e,t,n)=>{let r=(t,r=n)=>ca(e,t,r);if(Fu(t)&&Au(t,e.environment))return ia(e,t,n);switch(t.kind){case`Number`:return _u(t.value)?String(t.value):ia(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ia(e,t,n);let i=lu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ta(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ta(e,i.value):ia(e,t,n)}case`Apply`:return oa(e,t,n);case`And`:case`Or`:{let n=ta(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ta(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{dd(t.function);let i=`expectFunction(${sa(t.function,n,e.environment)?r(t.function):ia(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${ta(e,t)})`,a=al(e.environment.runtime.version),o=a?`, ${ta(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${ta(e,il(t))}(${r(t.record)})`;case`Record`:{let i=hd(t.fields);if(gd(i))return ia(e,t,n);let a=ta(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ta(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=ta(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?aa(e,t,n):ia(e,t,n);default:return ia(e,t,n)}},la=(e,t)=>{if(!Qi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=ca(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
29
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;ea.value??=$i();let o=ea.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ua={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},da={none:0,error:1,warning:3,state:4},fa={0:``,1:`Error: `,3:`Warning: `,4:`State `},pa=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===da.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${fa[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ma=`The configuration file did not specify the initial state predicate.
22
+ `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let f=Ce.find(e=>o.startsWith(e));if(f){t.push({kind:`Symbol`,text:f,line:c}),a(f);continue}let m=p(e,n.index)??d(e,n.index);if(!m)return r(n.index,``),t;t.push({kind:`Word`,text:m.text,line:c}),a(e.slice(n.index,n.index+m.length))}return t.push({kind:`End`,text:``,line:n.line}),t},Te=(t,n)=>new e.m(`TLC found an error in the configuration file at line ${t}\n${n}`),Ee=(e,t)=>Te(e,`The keyword ${t} appeared twice.`),De=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Oe=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ke=(t,n=`master`)=>{let r=n===`1.7.4`?Se:be,i=we(t),a={index:0},o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s={isSet:!1},c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a.index++,i.length-1)];if(t.kind===`Error`)throw new e.m(`TLC found an error in the configuration file:\n${t.text}`);return t},u=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:l()};if(t.token.text!==`}`)for(;e.push(u(t.token)),t.token=l(),t.token.text===`,`;)t.token=l();if(t.token.text!==`}`)throw Te(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw Te(e.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Te(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Te(n.line,`It was expecting ], but did not find it.`);return t.text},f=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n={token:l(),name:t.text};for(;n.token.text===`!`;)n.name=`${n.name}!${l().text}`,n.token=l();let i=n.name;if(n.token.text===`<-`){if(n.token=l(),n.token.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Te(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:i,target:t.text,module:e});continue}if(n.token.kind===`End`)throw Te(n.token.line,`Expected an identifier after <-.`);o.substitutions.push({name:i,target:n.token.text});continue}let a=[],s=n.token.text===`(`;if(s){for(;a.push(u(l())),n.token=l(),n.token.text===`,`;);if(n.token.text!==`)`)throw Te(e,``);n.token=l()}if(n.token.text!==`=`)throw Te(n.token.line,`It was expecting = or <-, but did not find it.`);n.token=l();let c=n.token.text===`[`?d(`=`):void 0,f=u(c===void 0?n.token:l());o.constants.push({name:i,value:f,...s&&{args:a},...c!==void 0&&{module:c}})}},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},m={token:l()};for(;m.token.kind!==`End`;){let e=m.token.text,t=m.token.line,n=r.has(e)?De.get(e):void 0,i=r.has(e)?Oe.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Te(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Ee(t,e);o[n]=r.text,m.token=l()}else if(i!==void 0)m.token=p(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)m.token=f(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Te(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s.isSet)throw Ee(t,e);s.isSet=!0,o.checkDeadlock=n.text===`TRUE`,m.token=l()}else{if(!r.has(e)||!xe.includes(e))throw Te(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ee(t,e);c.add(e),m.token=l()}}return o},Ae={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},je=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Me=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ne=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Pe=e=>{let t=t=>{let n=h(e,t,je);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=h(e,t,Me);if(e.startsWith(`..`,n)&&Me(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Me)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Me(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,Me)-1,children:[]};if(Ne(n))return{kind:`Constant`,first:t,last:h(e,t,Ne)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},A=e=>{let t=e.length===0?void 0:Pe(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Ae[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},j=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,M=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),N=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:j(e)?`set`:`function`,Ie=t=>{if(!Number.isInteger(t)||t>2147483647||t<-2147483648)throw new e.S(`Integer overflow: ${t} is outside TLC's 32-bit range`);return t},Le={isUsed:!1},Re=(e,t)=>(Le.isUsed=!0,e.writtenKeys=t,e),ze=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Wn(e.domain,t)]]),Be=(e,t,n)=>Re(St(e,t),n),Ve=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Ve);e.writtenKeys=void 0,e.range.forEach(Ve)}},He=e=>e.every(e=>typeof e==`string`),Ue=(e,t)=>e.length>0&&t.length>0&&He(e)!==He(t),F=(e,t)=>{Le.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ue(n,r)?Ut(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=ot(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:ot(t,n);if(r!==0)return r}return 0},We=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=ot(n[e],r[e]);if(t!==0)return t}return 0},Ge=e=>P(e)?e.type:void 0,Ke=(t,n,r)=>{let i=Ge(t),a=Ge(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(P(t)&&P(n)){if(i===void 0||a===void 0||i===a)return;throw new e.g(`Attempted to ${o} the differently-typed model values ${z(t)} and ${z(n)}`)}throw i===void 0?new e.g(`Attempted to ${o} the typed model value ${z(n)} and the non-model value\n${z(t)}`):new e.g(`Attempted to ${o}${r?``:` the`} typed model value ${z(t)} and non-model value\n${z(n)}`)},qe={ranks:Object.create(null),size:0},Je=e=>{qe.ranks=Object.create(null),qe.size=0,st.clear();for(let t of e)Ze(t)},Ye={is174:!1},Xe=e=>{Ye.is174=e===`1.7.4`},Ze=e=>(qe.ranks[e]===void 0&&(qe.ranks[e]=qe.size++),e),Qe=()=>qe.size,$e=e=>qe.ranks[Ze(e)],et=(e,t)=>{if(e===t)return 0;let n=qe.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},tt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),nt=(e,t)=>(tt(e)||tt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),rt=(t,n,r)=>{if(!tt(t))throw new e.g(`Attempted to ${r} the set ${z(I(t)?L(t):t,!0)} with the value:\n${z(n,!0)}`);if(!tt(n))throw new e.g(`Attempted to compare overridden value ${z(t,!0)} with non-overridden value:\n${z(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.g(`Attempted to compare ${z(t,!0)} with the value\n${z(n,!0)}`)},it={kind:`InfiniteSet`,name:`Any`},at=t=>{throw new e.g(`Attempted to compare ANY with the value\n${z(t)}`)},ot=(t,n)=>{if(t===n)return Le.isUsed&&Ve(t),t===it?at(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return F(t,n);if(r===`Set`&&i===`Set`)return We(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&Ke(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return Ke(t,n,!1),r===`ModelValue`?-1:1;if(t===it||n===it)return at(t===it?n:t);if(j(t)&&j(n)&&nt(t,n))return rt(t,n,`compare`);let a=j(t);if(a!==j(n))throw new e.g(`Attempted to compare ${Fe(t)} ${z(t)} with ${Fe(n)} ${z(n)}`);return a?We(L(t),L(n)):F(er(t),er(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return et(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(Ke(t,n,!1),P(t))return-1;if(P(n))return 1;throw new e.g(`Attempted to compare ${Fe(t)} ${z(t)} with ${Fe(n)} ${z(n)}`)},st=/* @__PURE__ */ new Map,ct=e=>{let t=st.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:$e(e)};return st.set(e,n),n},lt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),dt={isPresent:!1},ft=(e,t)=>(t===`lambda`&&(dt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),pt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,mt=e=>ft(e,`lambda`),ht=/* @__PURE__ */ new WeakSet,gt=/* @__PURE__ */ new WeakSet,_t={isPresent:!1},vt=e=>(_t.isPresent=!0,e),yt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),bt=e=>{_t.isPresent&&typeof e==`object`&&yt.has(e.kind)&&gt.add(e)},xt=e=>{if((dt.isPresent||_t.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(ht.has(e))return;ht.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(xt),e.range.forEach(xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(xt):j(e)&&I(e)&&(bt(e),L(e).elements.forEach(xt))}},St=(e,t)=>ft(ut(e,t),`record`),Ct=(e,t)=>{if(bt(e),e===t)return Le.isUsed&&Ve(e),e!==it||at(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ke(e,t,!0),ot(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return F(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return We(e,t)===0;if(P(e)||P(t))return Ke(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ct(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:Ct(e.domain,t.domain)&&Ct(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Ct(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ct(e,t.factors[n]));let n=j(e)&&j(t)&&!(I(e)&&I(t));if(n&&nt(e,t))return rt(e,t,`check equality of`)===0;if(n){if(!tt(e)){let n=L(e);if(!tt(t))return We(n,L(t))===0}return jr(e)===jr(t)}return ot(e,t)===0},wt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):jr(n)===jr(r);return n},Tt=wt(!1),Et=wt(!0),Dt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ot=e=>{if(!N(e))return;let t=er(e);return{domain:t.domain,range:t.range,low:Dt(t.domain)}},kt=e=>{if(!N(e))return;let t=er(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},At=(t,n)=>{if(Ge(t)!==void 0)throw new e.g(`Attempted to compare the typed model value ${z(t)} and the non-model value\n${z(n)}`);return 1},jt=(t,n)=>{if(Ge(t)!==void 0)throw new e.g(`Attempted to check equality of the typed model value ${z(t)} and the non-model value\n${z(n)}`);return!1},Mt=(t,n)=>{let r=Ge(t);if(r===void 0)return P(n)?t.rank-n.rank:-1;if(!P(n))throw new e.g(`Attempted to compare the typed model value ${z(t)} and non-model value\n${z(n)}`);let i=Ge(n);if(i!==void 0&&i!==r)throw new e.g(`Attempted to compare the differently-typed model values ${z(t)} and ${z(n)}`);return t.rank-n.rank},Nt=(t,n)=>{let r=Ge(t);if(r===void 0)return P(n)&&t.name===n.name;if(!P(n))throw new e.g(`Attempted to check equality of typed model value ${z(t)} and non-model value\n${z(n)}`);let i=Ge(n);if(i!==void 0&&i!==r)throw new e.g(`Attempted to check equality of the differently-typed model values ${z(t)} and ${z(n)}`);return t.name===n.name},Pt={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Ft=(e,t,n)=>{let r=Pt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},It=(t,n,r)=>{let i=Ot(r);if(!i){if(P(r))return At(r,n);throw new e.g(`Attempted to compare the function ${z(n)} with the value:\n${z(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Lt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Lt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.g(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${z(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Lt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Ut(e[n],t[n]);if(r!==0)return r}return 0},Rt=(t,n)=>{let r=er(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=N(n)?Gn(n):void 0;return e?r.range.length-e.length||Lt(r.range,e):It({...r,low:1},t,n)}if(pt(t)===`record`){let i=kt(n);if(!i){if(P(n))return At(n,t);throw new e.g(`Attempted to compare record:\n${z(t)}\nwith non-record\n${z(n)}`)}return r.domain.length-i.domain.length||Lt(r.domain,i.domain)||Lt(r.range,i.range)}return It({...r,low:Dt(r.domain)},t,n)},zt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Bt=(e,t)=>tt(e)||tt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Vt=(e,t)=>{let n=zt(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Ht=(t,n)=>{if(Bt(t,n))return ot(t,n);if(!zt(t))return Ht(L(t),n);if(!j(n)){if(P(n))return At(n,t);throw new e.g(`Attempted to compare the set ${z(t)} with the value:\n${z(n)}`)}let r=Vt(t,n);return r.elements.length-r.otherElements.length||Lt(r.elements,r.otherElements)},Ut=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return ot(t,n);if(P(n))return At(n,t);throw new e.g(Ft(t,n,!1))}return t.kind===`ModelValue`?Mt(t,n):N(t)?Rt(t,n):Ht(t,n)},Wt=(e,t)=>e.every((e,n)=>Jt(e,t[n])),Gt=(t,n,r)=>{let i=Ot(r);if(!i){if(P(r))return jt(r,n);throw new e.g(`Attempted to check equality of the function ${z(n)} with the value:\n${z(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Wt(t.range,i.range);let a=t.low??i.low;return a===void 0?Wt(t.domain,i.domain)&&Wt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.g(`Attempted to compare an integer with non-integer:\n${z(t)}.`);return t===a+n})&&Wt(t.range,i.range)},Kt=(t,n)=>{let r=er(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=N(n)?Gn(n):void 0;return e?r.range.length===e.length&&Wt(r.range,e):Gt({...r,low:1},t,n)}if(pt(t)===`record`){let i=kt(n);if(!i){if(P(n))return jt(n,t);throw new e.g(`Attempted to check equality of record:\n${z(t)}\nwith non-record\n${z(n)}`)}return r.domain.length===i.domain.length&&Wt(r.domain,i.domain)&&Wt(r.range,i.range)}return Gt({...r,low:Dt(r.domain)},t,n)},qt=(t,n)=>{if(Bt(t,n))return Ct(t,n);if(!zt(t))return qt(L(t),n);if(!j(n)){if(P(n))return jt(n,t);throw new e.g(`Attempted to check equality of the set ${z(t)} with the value:\n${z(n)}`)}let r=Vt(t,n);return r.elements.length===r.otherElements.length&&Wt(r.elements,r.otherElements)},Jt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(P(n))return jt(n,t);throw new e.g(Ft(t,n,!0))}return t.kind===`ModelValue`?Nt(t,n):N(t)?Kt(t,n):qt(t,n)},Yt=e=>{let t=[];for(let n of e){let e=Zt(n,t);e.isFound||t.splice(e.index,0,n)}return t},Xt=(e,t)=>{let n=qn.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Zt=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Xt(e,()=>Ut(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Qt=(e,t)=>t.some(t=>Xt(t,()=>Jt(t,e))),$t=/* @__PURE__ */ new WeakSet,en=e=>{typeof e==`object`&&(e.kind===`Set`&&($t.add(e),e.elements.forEach(en)),e.kind===`Function`&&(e.domain.forEach(en),e.range.forEach(en)))},tn=(e,t)=>Jn(Ct,Jt,e,t),nn=e=>{for(let t=1;t<e.length;t++)if(ot(e[t-1],e[t])>=0)return!1;return!0},rn=e=>{for(let t=1;t<e.length;t++)bt(e[t]);if(e.length<2||nn(e))return lt(e);let t=[...e].sort(ot),n=[t[0]];for(let e=1;e<t.length;e++)ot(n[n.length-1],t[e])!==0&&n.push(t[e]);return lt(n)},an=e=>Jn(rn,e=>({kind:`MixedSet`,elements:e}),e,void 0),on=lt([]),sn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ot(r[a],t)<0;)a++;a<r.length&&ot(r[a],t)===0||i.push(t)}return i.length===n.length?e:lt(i)},cn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ot(r[a],t)<0;)a++;a<r.length&&ot(r[a],t)===0&&i.push(t)}return i.length===n.length?e:lt(i)},ln=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=ot(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=lt(i);if(e.hash!==0&&e.hash!==_r){let t=e.hash,n=0;for(;n<a.length;n++){let e=Sr(a[n]);if(e===_r)break;t=t+hr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Er(a[e])|0;c.fingerprint=t}return c},un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>ot(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&ot(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ut(n,r)},dn=e=>{let t=un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Re(t,e.map(e=>e[0]))},fn=[],pn=[],mn=/* @__PURE__ */ new WeakMap,hn=e=>{let t=fn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return fn[e]=n,n},gn=e=>{if(Vn(e),e.low===1&&e.high>=1)return hn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},_n=e=>e.length>0&&(e===fn[e.length]||mn.has(e)),vn=e=>{let t=L(e).elements;return _n(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},yn=e=>{let t=pn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return pn[e]=n,n},bn=e=>ft(ut(hn(e.length),e),`tuple`),xn=e=>ft(un(e),`record`),Sn=e=>j(e)&&!tt(e),Cn=(e,t=!1)=>`UNION(${z(e.base,t)})`,wn=(t,n=e=>L(e).elements)=>{if(!Sn(t.base))throw new e.g(`Attempted to enumerate the nonenumerable set:\n${Cn(t)}`);return n(t.base)},Tn=(t,n,r)=>{if(Sn(t))return t;throw new e.g(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(t)}\nwhen enumerating:\n${Cn(r)}`)},I=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||En(e.domain)===!0||En(e)===!0;case`RecordSet`:return e.sets.every(I)||En(e)===!0;case`ProductSet`:return e.factors.every(I)||En(e)===!0;case`Union`:return I(e.base)&&Pn(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},En=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=En(e.domain);return t===void 0?void 0:!t&&En(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=En(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},Dn=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},On=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},kn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||tt(e.base))return;let t=L(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:On(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return lt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},An=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(lt(r.map(t=>e[t])));while(On(r,e.length))}return t},jn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(tt(o))throw new e.g(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Mn=(t,n=e=>L(e).elements)=>{if(typeof t!=`object`)throw new e.g(`Expected a set but found ${z(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return Yt(t.elements);case`Interval`:{let e=gn(t);return e!==fn[e.length]&&mn.set(e,t),e}case`Subset`:{if(Vn(t.base)===0)return An([]);if(!j(t.base))throw new e.g(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${A(z(t.base))}`);let n=L(t.base).elements;if(n.length>30)throw new e.g(Bn(t));return An(n)}case`FunctionSet`:{if(!Ye.is174&&R(t))return[];if(tt(t.domain))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(t.domain)}\ncannot be enumerated.`);let r=vn(t.domain);if((r.length>0||Ye.is174)&&tt(t.range))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Dn(r.map(()=>i)).map(e=>ut(r,e))}case`RecordSet`:{if(!Ye.is174&&R(t))return[];let e=jn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${z(e)}`);return Dn(e).map(e=>xn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Ye.is174&&R(t))return[];let e=jn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return Dn(e).map(bn)}case`FilteredSet`:if(!j(t.base)||tt(t.base))throw new e.g(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(t.base)}\nis not enumerable`);return L(t.base).elements.filter(t.test);case`Union`:{let e=wn(t).flatMap((e,n)=>L(Tn(e,n,t)).elements);return L(an(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!Sn(t.left)||!Sn(t.right)))throw new e.g(`Attempted to enumerate S \\cup T when S:\n${z(t.left)}\nand T:\n${z(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!Sn(t.left)&&!Sn(t.right))throw new e.g(`Attempted to enumerate S \\cap T when neither S:\n${z(t.left)}\nnor T:\n${z(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Sn(t.left))throw new e.g(`Attempted to enumerate S \\ T when S:\n${z(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return ln(L(t.left),L(t.right)).elements;let n=t.operator===`\\`||Sn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return L(r).elements.filter(e=>Yn(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to enumerate the non-enumerable set ${z(t)}`);default:throw new e.g(`Expected a set but found ${z(t)}`)}},Nn=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return lt(Mn(e));let t=typeof e==`object`?Nn.get(e):void 0;if(t)return t;let n=qn.sets;n?.push(e);let r=Mn(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?lt(r):rn(r);return typeof e==`object`&&Nn.set(e,i),i},Pn=e=>{if(typeof e!=`object`||gt.has(e))return L(e).elements;let t=qn.sets;t?.push(e);let n=Rn(e);return t?.pop(),n},Fn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,In=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(In);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(In)&&e.range.every(In);case`SetOperation`:return e.operator!==`\\cup`&&In(e.left)&&In(e.right);case`FilteredSet`:return In(e.base);case`ProductSet`:return e.factors.every(In);default:return!1}},Ln=e=>typeof e!=`object`||gt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ln(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ln(e.left)||Ln(e.right):Fn(e)?.some(Ln)??!1,Rn=e=>{if(e.kind===`Union`)return wn(e,Pn).flatMap((t,n)=>Pn(Tn(t,n,e)));if(e.kind===`FilteredSet`&&!tt(e.base))return Pn(e.base).filter(e.test);if(Fn(e)?.some(Ln))return Mn(e,Pn);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!Sn(e.left)||!Sn(e.right)?L(e).elements:[...Pn(e.left),...Pn(e.right)];let t=e.operator===`\\`||Sn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Sn(n)?Pn(n).filter(t=>Yn(t,r)===(e.operator===`\\cap`)):L(e).elements},R=t=>{if(typeof t!=`object`||!j(t))throw new e.g(`Shouldn't call isEmpty() on value ${z(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.g(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(R);case`RecordSet`:return t.sets.some(R);case`FunctionSet`:return!R(t.domain)&&R(t.range);case`Union`:return wn(t).every((e,n)=>R(Tn(e,n,t)));default:return L(t).elements.length===0}},zn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Vn(i,n);if(a>2147483647)throw new e.g(r());return a},1),Bn=e=>`Overflow when computing the number of elements in:\n${z(e)}`,Vn=(t,n)=>{if(typeof t!=`object`)throw new e.g(`Attempted to compute the number of elements in the ${typeof t==`number`?`integer`:typeof t==`string`?`string`:`boolean`} ${z(t)}.`);switch(t.kind){case`ModelValue`:throw new e.g(`Attempted to compute the number of elements in the model value ${z(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Vn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.g(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to compute the number of elements in the overridden value ${z(t)}.`);case`Subset`:{let r=Vn(t.base,n);if(r>=31)throw new e.g(Bn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(R(t.domain))return 1;if(R(t.range))return 0;if(Vn(t.range,n)===1)return 1}let r=Vn(t.domain,n),i=Vn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e.g(Bn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&R(t)?0:zn(t.sets,n,()=>Bn(t));case`ProductSet`:return n!==`1.7.4`&&R(t)?0:zn(t.factors,n,()=>`Overflow when computing the number of elements in ${z(t)}`);default:return bt(t),L(t).elements.length}},Hn=e=>`Attempted to check if the set ${z(e)}is finite.`,Un=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.g(`Attempted to check if the ${Fe(t)} ${z(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.g(`Attempted to check if the function:\n${z(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Un(t.base)&&R(t.base);case`Subset`:return Un(t.base);case`FunctionSet`:{let e=Un(t.domain);if(e&&R(t.domain))return!0;let n=Un(t.range);return n&&R(t.range)?!0:n&&(e||Vn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!Un(t))n.isAllFinite=!1;else if(R(t))return!0;return n.isAllFinite}case`Union`:if(!Sn(t.base))throw new e.g(`Attempted to check if the nonenumerable set:\n${Cn(t)}\nis a finite set.`);return L(t.base).elements.every(Un);case`SetOperation`:if(t.operator===`\\cup`)return Un(t.left)&&Un(t.right);if(t.operator===`\\cap`){if(!Un(t.left)&&!Un(t.right))throw new e.g(Hn(t));return!0}if(Un(t.left))return!0;if(!Un(t.right))throw new e.g(Hn(t));return!1;case`FilteredSet`:if(!Un(t.base))throw new e.g(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(t.base)}\nis finite.`);return!0}},Wn=(e,t,n=ot)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Gn=e=>{if(typeof e!=`object`||!N(e))return;let t=er(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Kn=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!N(t))return`${n} ${Fe(t)} ${z(t)}`;let r=pt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},qn={sets:void 0},Jn=(t,n,r,i)=>{let a=qn.sets,o=qn.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.g))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},Yn=(e,t)=>{let n=qn.sets;if(n===void 0)return Qn(e,t);n.push(t);let r=Qn(e,t);return n.pop(),r},Xn=(e,t)=>Wn(t.elements,e)!==-1,Zn=(e,t)=>$t.has(t)?Zt(e,t.elements).isFound:Qt(e,t.elements),Qn=(t,n)=>{if(!j(n))throw new e.g(Kn(t,n));switch(n.kind){case`Set`:return bt(t),Jn(Xn,Zn,t,n);case`MixedSet`:return Qt(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!P(t))throw new e.g(`Attempted to check if the value:\n${z(t)}\nis in the integer interval ${z(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(P(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.g(`Attempted to check if the value:\n${z(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!j(t)||tt(t))throw new e.g(`Attempted to check if the non-enumerable value\n${A(z(t))}\nis element of\n${A(z(n))}`);return L(t).elements.every(e=>Yn(e,n.base));case`FunctionSet`:{if(!N(t)){if(P(t))return!1;throw new e.g(`Attempted to check if \n${z(t)}\nwhich is not a TLC function value, is in the set of functions:\n${A(z(n))}`)}let r=er(t),i=Dt(r.domain);return(i===void 0?tn(n.domain,lt(r.domain)):tn({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Yn(e,n.range))}case`RecordSet`:{let r=N(t)?er(t):void 0;if(!r||!He(r.domain)){if(P(t))return!1;throw new e.g(`Attempted to check if non-record\n${z(t)}\nis in the set of records:\n${z(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Wn(r.domain,e);return i!==-1&&Yn(r.range[i],n.sets[t])})}case`ProductSet`:{let r=N(t)?Gn(t):void 0;if(r===void 0){if(N(t)&&er(t).domain.every(e=>typeof e==`number`)||P(t))return!1;throw new e.g(`Attempted to check if non-tuple\n${z(t)}\nis in the set of tuples:\n${z(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>Yn(e,n.factors[t]))}case`FilteredSet`:return Yn(t,n.base)&&n.test(t);case`Union`:if(!Sn(n.base))throw new e.g(`Attempted to check if:\n ${z(t)}\nis an element of the non-enumerable set:\n ${Cn(n)}`);return L(n.base).elements.some(e=>Yn(t,e));case`SetOperation`:return n.operator===`\\cup`?Yn(t,n.left)||Yn(t,n.right):Yn(t,n.left)&&Yn(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Gn(t);if(r===void 0){if(P(t))return!1;throw new e.g(`Attempted to check if the value:\n${A(z(t))}\nis an element of ${A(z(n))}.`)}return r.every(e=>Yn(e,n.base))}default:throw new e.g(Kn(t,n))}},$n=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Yn(e,n):e.range.every((e,r)=>$n(e,t.range[r],n.range)),er=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){I(t.domain)||Vn(t.domain);let e=vn(t.domain);return ft(ut(e,e.map(e=>t.apply(e))),pt(t))}throw new e.g(`Expected a function but found ${z(t)}`)},tr=(e,t,n)=>{let r=A(z(e)),i=A(z(t)),a=n===`1.7.4`;switch(pt(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},nr=(e,t)=>{if(!Ye.is174)return tr(e,t);let n=A(z(t));return pt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},rr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ir=t=>new e.g(`Attempted to apply function with integer domain to the non-integer argument ${A(z(t))}`),ar=(e,t,n)=>{throw Ye.is174||e.length<32?e.forEach(e=>Jt(e,t)):Wn(e,t,Ut),n},or=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=pt(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.g(r(t,n));if(o===void 0&&!Ye.is174&&_n(i))throw ir(n)}let a=rr(i,n);return a===-1?Jn(Wn,ar,i,n):a},sr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!Yn(n,t.domain))throw new e.g(pt(t)===`lambda`?tr(t,n):`Attempted to apply a function to ${z(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.g(`Attempted to apply ${z(t)}, which is not a function`);let i=r??tr,a=or(t,n,i);if(a===-1)throw new e.g(i(t,n));return t.range[a]},cr=e=>_n(e)?mn.get(e)??yn(e.length):void 0,lr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=er(e).domain;return cr(t)??lt(t)},ur=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!I(t.domain))){if(!Yn(n,t.domain))return t;let e=r(t.apply(n));return ft({kind:`LazyFunction`,domain:t.domain,apply:r=>tn(n,r)?e:t.apply(r),source:t.source},pt(t))}if(!N(t))throw new e.g(`Attempted to apply EXCEPT construct to the value ${A(z(t))}.`);let a=er(t),o=or(a,n,nr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=ft(ut(a.domain,s),pt(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==_r){let e=Sr(l);if(e!==_r){let t=Sr(a.domain[o]);u.hash=c===l?a.hash:a.hash-gr(t,Sr(c))+gr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Dr(e,c)+Dr(e,l)|0}return u},dr=/* @__PURE__ */ new WeakMap,fr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pr=(e,t)=>Math.imul(e^t,16777619),mr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fr(t)},hr=e=>fr(e+2654435769|0),gr=(e,t)=>fr(Math.imul(e,668265261)+t|0),_r=795548749,vr=e=>{if(e.kind===`ModelValue`)return fr(pr(mr(e.name),109));if(j(e)){if(!I(e))return _r;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Sr(t[e]);if(r===_r)return _r;n=n+hr(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return _r;let t=er(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Sr(t.domain[e]),i=Sr(t.range[e]);if(r===_r||i===_r)return _r;n=n+gr(r,i)|0}return n},yr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.g(`TLC has found a state in which the value of a variable contains ${z(t)}`);if(j(t)){L(t).elements.forEach(yr);return}let n=er(t);n.domain.forEach(yr),n.range.forEach(yr)},br=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Sr(t)===_r&&yr(t);return}catch(t){if(!(t instanceof e.g))throw t;return t}},xr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Sr=e=>{if(typeof e==`number`)return fr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return mr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=vr(e)),e.hash;let t=dr.get(e);if(t!==void 0)return t;let n=vr(e);return dr.set(e,n),n},Cr=/* @__PURE__ */ new WeakMap,wr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Tr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return wr(t)},Er=e=>wr(kr(e)+2135587861|0),Dr=(e,t)=>wr(Math.imul(kr(e),374761393)+kr(t)|0),Or=e=>{if(e.kind===`ModelValue`)return wr(Tr(e.name)^60);if(j(e)){if(!I(e))return Tr(jr(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Er(t[e])|0;return n}let t=er(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Dr(t.domain[e],t.range[e])|0;return n},kr=e=>{if(typeof e==`number`)return wr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Tr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Or(e)),e.fingerprint;let t=Cr.get(e);if(t!==void 0)return t;let n=Or(e);return Cr.set(e,n),n},Ar=/* @__PURE__ */ new WeakMap,jr=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Ar.get(e);if(t!==void 0)return t;let n=Mr(e);return Ar.set(e,n),n},Mr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${jr(t.base)}>`;if(t.kind===`FilteredSet`&&!I(t))throw new e.g(`Attempted to compare the non-enumerable set ${z(t)} with another value`);if(j(t))return I(t)?`{${L(t).elements.map(jr).join(`,`)}}`:`<${t.kind} ${z(t)}>`;let n=er(t);return`(${n.domain.map((e,t)=>`${jr(e)}:${jr(n.range[t])}`).join(`,`)})`},Nr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Pr=e=>e.reduce((e,t)=>e===0?0:e*Vn(t),1),Fr=e=>{if(e.kind===`Subset`)return Vn(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&Vn(e.domain)===0)return lt([ut([],[])]);let t=e.kind===`FunctionSet`?Vn(e.range)**Vn(e.domain):Pr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?on:t<=1999?L(e):void 0},Ir=(t,n)=>{if(n)return Fr(t);if(I(t))try{return Fr(t)}catch(t){if(t instanceof e.g)return;throw t}},Lr=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Cn(e,t)}},Rr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),zr=t=>{if(I(t.domain))try{return er(t)}catch(t){if(t instanceof e.g)return;throw t}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Nr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Ir(e,t);return n?r(n):Lr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?zr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ye.is174&&pt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&pt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:pt(e)===`record`||i.domain.every(e=>typeof e==`string`&&Rr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ze(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Br=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${A(z(n))}\n`).join(``)},Vr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Hr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Sr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Et(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Et(i[e],n))return i[e]}return n.kind===`Set`?Vr(n.elements,t):(Vr(n.domain,t),Vr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Ur=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Wr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Gr=(t,n)=>Wr.has(t)?new e.g(n):new e.S(n),Kr=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||Kr(r))throw Gr(n,`${n} expects a value as argument ${t+1}`);return r},qr=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw Gr(n,`${n} expects an integer but received ${z(r)}`);return r},Jr=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw Gr(n,`${n} expects a boolean but received ${z(r)}`);return r},Yr=(e,t,n)=>{let r=V(e,t,n);if(!j(r))throw Gr(n,`${n} expects a set but received ${z(r)}`);return r},Xr=(e,t,n)=>{let r=Yr(e,t,n);if(!I(r))throw Gr(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Zr=(e,t,n)=>L(Xr(e,t,n)),Qr=(e,t,n)=>Zr(e,t,n).elements,$r=(e,t,n)=>{let r=V(e,t,n),i=Gn(r);if(!i)throw Gr(n,`${n} expects a sequence but received ${z(r)}`);return i},ei=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw Gr(n,`${n} expects a function but received ${z(r)}`);return er(r)},ti=(e,t,n)=>{let r=e[t];if(r===void 0||!Kr(r))throw Gr(n,`${n} expects an operator as argument ${t+1}`);return r},ni=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ri=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ii=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ai=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),oi=e=>e>2147483647||e<-2147483648,si=t=>new e.S(`Overflow when computing ${t}`),ci={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},li={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ui={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},di={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},fi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return li[e.operator];if(e.kind!==`Function`)return ci[e.kind];let t=pt(e);return t===void 0?`FcnRcdValue`:di[t]},pi=e=>ui[fi(e)],mi=(t,n)=>new e.g(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),hi=(t,n)=>{let r=r=>(...i)=>{let a=qn.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e.g&&(t.isLazy===!0||!(r instanceof e.S))?(qn.sets&&(qn.sets.length=a),mi(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},gi=(e,t)=>{if(typeof e!=`number`)throw mi(t,`Cannot cast tlc2.value.impl.${fi(e)} to tlc2.value.impl.IntValue`);return e},_i=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,vi=(e,t,n,r)=>{let i=_i(e,n,`IntValue`,2);return ai(t,(e,n)=>{let a=gi(e,i),o=gi(n,i),s=r(a,o);if(oi(s))throw si(`${a}${t}${o}`);return s})},yi=(t,n,r)=>{if(typeof t!=`number`)throw new e.S(`The ${n} argument of ${r} should be an integer, but instead it is:\n${z(t)}`);return t},bi=(e,t,n=e)=>ai(e,(e,r)=>t(yi(e,`first`,n),yi(r,`second`,n))),xi=(e,t,n)=>({...ii(e,t,n),isLazy:!0}),Si=(e,t,n)=>{let r=ti(e,t,n);return()=>r.call([])},Ci=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),wi=()=>({bool:Wc,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ac(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw jc(t,n,e);return e},apply:sr,expectFunction:Vc,tuple:bn,set:an,record:St,writtenRecord:Be,equal:Ct,enumerate:tl,unassigned:(e,t)=>{throw td(e,t)},primeOutsideAction:e=>{throw rd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Hc,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>zc(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Ti={value:void 0},Ei=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Di=e=>`local${e.counter++}`,Oi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ur(e).forEach(e=>Oi(e,t)),t),ki=(e,t,n)=>{let r=Ei(e,vu(t,e.environment)),i=Oi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Ei(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ai=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Di(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Pi(e,t.set,s)}, ${Ei(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Di(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Pi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Di(e),a=Di(e),o=Di(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ji=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Pi(e,r[0],n)}, "the left side of =>") ? bool(${Pi(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ki(e,t,n);let i=Dl(t.operator,e.environment);if(i?.kind!==`Builtin`)return ki(e,t,n);if(i.name===`DOMAIN`)return`${Ei(e,Pc(t))}(${Pi(e,r[0],n)})`;if(i.name===`TLCEval`)return ki(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ei(e,Fc(t,i))}(${Pi(e,r[0],n)}, ${Pi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Tu(r[0],a))return`${Ei(e,i.evaluateUnary)}(${Pi(e,r[0],n)})`;let o=r.length===2&&Tu(r[0],a)&&Tu(r[1],a);return i.evaluateBinary&&o?`${Ei(e,i.evaluateBinary)}(${Pi(e,r[0],n)}, ${Pi(e,r[1],n)})`:ki(e,t,n)},Mi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=Ll(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Mi(e.expression,t,n);case`FieldAccess`:return Mi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Mi(e,t,n));default:return!1}},Ni=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ni(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ni);default:return!1}},Pi=(e,t,n)=>{let r=(t,r=n)=>Pi(e,t,r);if(lu(t)&&iu(t,e.environment))return ki(e,t,n);switch(t.kind){case`Number`:return Gl(t.value)?String(t.value):ki(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ki(e,t,n);let i=Ll(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ei(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ei(e,i.value):ki(e,t,n)}case`Apply`:return ji(e,t,n);case`And`:case`Or`:{let n=Ei(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Ei(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Yu(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Mi(t.function,n,e.environment)?r(t.function):Ni(t.function)?r(t.function,i):ki(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ei(e,t)}))`,o=Nc(e.environment.runtime.version),s=o?`, ${Ei(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Ei(e,Mc(t))}(${r(t.record)})`;case`Record`:{let i=$u(t.fields);if(ed(i))return ki(e,t,n);let a=Ei(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Ei(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Ei(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Ai(e,t,n):ki(e,t,n);default:return ki(e,t,n)}},Fi=(e,t)=>{if(!Ci.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Pi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
23
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Ti.value??=wi();let o=Ti.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Ii={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Li={none:0,error:1,warning:3,state:4},Ri={0:``,1:`Error: `,3:`Warning: `,4:`State `},zi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Li.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
24
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Ri[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Bi=`The configuration file did not specify the initial state predicate.
31
25
  Can also be caused by trying to run TLC on a specification from
32
- a module imported with a parameterized INSTANCE statement.`,ha=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
26
+ a module imported with a parameterized INSTANCE statement.`,Vi=[[1005,e.l,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
33
27
  %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
34
28
  %1%,
35
29
  but it produced the following error:
@@ -52,7 +46,7 @@ element is not a bag:
52
46
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
53
47
  on the right-hand side of a <- after already appearing on the
54
48
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
55
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,ma,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
49
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Bi,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
56
50
  %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
57
51
  %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
58
52
  but instead found %3%.
@@ -70,14 +64,14 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
70
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
71
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
72
66
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
73
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],ga={value:void 0},_a=()=>ga.value??=ha.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),va=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ya=e=>va.test(e)?void 0:_a().find(t=>t.pattern.test(e))?.message,ba=e=>e instanceof S||ya(e.message)?.isEvalException===!0,xa=/* @__PURE__ */ new Map([[1e3,`
67
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],Hi={value:void 0},Ui=()=>Hi.value??=Vi.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Wi=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Gi=e=>Wi.test(e)?void 0:Ui().find(t=>t.pattern.test(e))?.message,Ki=t=>t instanceof e.S||Gi(t.message)?.isEvalException===!0,qi=/* @__PURE__ */ new Map([[1e3,`
74
68
  : `],[2105,`failed.
75
69
  `],[2154,`but it produced the following error:
76
70
  `],[2213,`:
77
- `],[2281,` - specifically: `]]),Sa=(e,t,n)=>{let r=n?xa.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${Ca(t.slice(a),n)}`},Ca=(e,t)=>{let n=t?ya(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${da.none} @!@!@\n${Sa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},wa=e=>String(e).padStart(2,`0`),Ta=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${wa(r%24)}h`:e>36e5?`${wa(r%24)}h ${wa(n)}min`:e>6e4?`${wa(n)}min ${wa(t)}s`:`${wa(t)}s`},Ea=e=>`${e.getFullYear()}-${wa(e.getMonth()+1)}-${wa(e.getDate())} ${wa(e.getHours())}:${wa(e.getMinutes())}:${wa(e.getSeconds())}`,Da={kind:`Local`},Oa=/* @__PURE__ */ new WeakSet,ka=/* @__PURE__ */ new WeakMap,Aa=/* @__PURE__ */ new WeakMap,ja=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ma=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Na=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Pa=e=>e.kind===`Operator`?e.params.length:0,Fa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ia=e=>e.name.includes(`!`),La=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ra=(e,t,n)=>{let r=t.bindings.get(e);return r&&Na(r.position,t.location)&&(!n||Na(r.position,n.start))?r:void 0},za=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Ba=(e,t,n,r)=>{if(t===void 0)return!0;if(za(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Va=(e,t,n,r)=>Ba(t,La(e,t)??Ra(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ha=(e,t,n)=>{Ba(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ua=(e,t,n,r)=>t.reduce((e,t,i)=>Va(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Wa=(e,t,n)=>t.reduce((e,t)=>Va(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ga=e=>e.kind===`Name`?[e.name]:e.names,Ka=e=>e.flatMap(e=>Ga(e.pattern)),qa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Na(n.location,t.location))?n:void 0},Ja=(e,t)=>{let n=qa(e,t);return n?{key:t.getKey(n),arity:Pa(n),params:Fa(n),kind:`Definition`}:t.imported.get(e)},Ya=(e,t,n)=>La(t,e)??Ja(e,n),Xa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Za=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xa(e.location,e.spelling??t)},Qa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Na(e.location,e.args[0].location)?`prefix`:`postfix`}},$a=e=>!/^[\p{L}\d_]/u.test(e),eo=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),to=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,no=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},ro=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?no(e.name,[],void 0):no(e.operator,e.args,e.argumentCounts),io=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ao=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ka(e.bounds),body:e.body,sets:io(e.bounds)};case`SetMap`:return{names:Ka(e.bounds),body:e.expression,sets:io(e.bounds)};case`SetFilter`:return{names:Ga(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ga(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},oo=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},so=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,co=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),lo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?lo(e.body,t):vi(e).reduce((e,n)=>e??lo(n,t),void 0)},uo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??uo(i,t,n||co(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&lo(e.set,t):lo(e,t)},fo=e=>e.kind===`Label`?fo(e.body):e,po=e=>typeof e==`number`?`argument selector ${e}`:e,mo=`within the scope of a declaration
78
- from outside that declaration's scope.`,ho=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&fo(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:uo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?lo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&co(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${mo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=po(n.operand);if(l.isSufficesOpen){if(to(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=fo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ya(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=ao(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:oo(e);if(!c)return;let f=to(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=to(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(co(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${mo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},go=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},_o=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=La(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},vo=(e,t,n,r)=>{if(!so(e))return!1;let i=ro(e),a=i[0],o=i.length>1&&a.kind===`Name`?La(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ho(e,i,o,t,n,r),o!==void 0},yo=(e,t,n,r)=>{let i=e.location;if(ko(e,n,r))return;let a=Aa.get(e);if(a!==void 0)return a;if(ja(t))return e.kind===`Apply`?e.args.length:0;let o=La(n,t);if(o?.isNonFact){r.errors.push({location:g(Za(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(vo(e,n,r,!1)||eo(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Da),o)return o.arity;let s=Ja(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Aa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(La(n,c)!==void 0||Ja(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(e.kind===`Apply`&&l===`-.`?Xa(i,`-`):Za(e,t));if(!$a(t)||eo(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Qa(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},bo=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ua(e,Ga(t.pattern),t.pattern.ranges,n),t)),xo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||vi(e).some(e=>xo(e,t)),So=(e,t)=>{e.kind===`FunctionConstruction`&&xo(e.body,t)&&(e.isRecursive=!0),vi(e).forEach(e=>So(e,t))},Co=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ka(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?bo(e.bounds,t,i):Wa(t,e.params,i),l=La(c,a)??Ra(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),So(e.body,a),e.isSelfReferential=xo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ba(a,La(t,a)??Ra(a,i,o),{kind:`Definition`,arity:Pa(e),range:o},i)},wo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(La(e,t.name)?.isPending)return e;let n={name:t.name,arity:Pa(t),params:Fa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Fo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ja(t.name)?e:s(e,e=>!Na(t.location,e.location)),o={name:t.name,arity:Pa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ia(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ja(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Co(t,a,u,i)?{...o,params:Fa(t)}:a},a),()=>!0)},To=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:La(t,r)??Ra(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Eo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=To(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Do=(e,t,n)=>{if(Eo(e,t,n))return;let r=e.operator,i=Ya(r,t,n),a=yo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Za(e,r)),message:`The operator ${r} requires ${a-(To(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Oo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=yo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Oa.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??Za(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ya(u,t,n)?.params??[],f=yo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Za(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Oo=(e,t,n)=>{e.kind===`Identifier`?yo(e,e.name,t,n):U(e,t,n)},ko=(e,t,n)=>{let r=ka.get(e);return r?(r.args.forEach(e=>Oo(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Oa.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Eo(e,t,n))return;let r=e.name,i=yo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(Za(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:yo(e,e.operator,t,n);return;case`Apply`:Do(e,t,n);return;case`Lambda`:U(e.body,Ua(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&U(e.other,t,n);return;case`Let`:U(e.body,wo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,bo(e.bounds,t,n),i(Ka(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ua(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ua(t,Ga(e.pattern),e.pattern.ranges,n),i(Ga(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,bo([e.bound],t,n),i(Ga(e.bound.pattern)));return;case`SetMap`:U(e.expression,bo(e.bounds,t,n),i(Ka(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??Xa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(go(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),_o(e,t,n);return;case`Subexpression`:if(ko(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Oo(e,t,n)),vo(e,t,n,!1)}},Ao=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Eo(e,t,n)||vo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&La(t,r)?.isNonFact?n.errors.push({location:g(Za(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),jo=(e,t,n)=>(e.set&&U(e.set,t,n),Va(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:jo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Mo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},No=(e,t,n)=>e.kind===`AssumeProve`?Mo(e,t,n):(U(e,t,n),t),Po=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ao(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Io(t,e,r),t)},Fo=(e,t,n)=>{let r=Ho(e,t,n);return e.name===void 0?r:Va(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Io=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=No(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Po(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Po(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Ao(r.facts,t,n),o(t);case`Instance`:return o(Fo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Fo(t,e,i):wo([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),Po(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Ka(r.bounds),...r.names]}),Po(e.proof,a(t),n),a(o)}default:return Po(e.proof,a(t),n),a(t)}},Lo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:No(e.statement,void 0,t);e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Po(e.proof,n,t),r&&(r.isInProof=!1)},Ro={line:0,column:0},zo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Bo=(e,t)=>{let n=new Map([...Ma,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Vo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=yo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' 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 a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!La(a,e.name)&&!Ja(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Ho=(e,t,n)=>{let r=n.getInstance(e);return Vo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Va(e,t,r,n),t)},Uo=(e,t,n,r)=>{let i=Bo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Vo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Ro}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Wo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Go=(e,t)=>{let n=Bo(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...Ma,...t.bound].map(([e,t])=>[e,{...t,position:Ro}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ha(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Wo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Ba(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);zo(e,t)?U(t.body,void 0,i):Co(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Pa(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Wa(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ha(t,e,i)),e.name!==void 0&&Ha(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Lo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Ao(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Ko=/* @__PURE__ */ new WeakSet,qo=/* @__PURE__ */ new WeakSet,Jo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=es(e,(e,r)=>Jo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Yo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Xo=/* @__PURE__ */ new WeakMap,Zo=e=>Xo.get(e)??e.name,Qo=(e,t)=>(Zo(t)!==e.name&&Xo.set(e,Zo(t)),e),$o=(e,t)=>Qo(e.kind===`Function`?{...e,bounds:Yo(e.bounds,e=>t(e,[])),body:t(e.body,Ka(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),es=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>$o(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Yo(e.bounds,n),body:t(e.body,Ka(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Ga(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Ga(e.bound.pattern))};case`SetMap`:return{...e,bounds:Yo(e.bounds,n),expression:t(e.expression,Ka(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},ts=`LAMBDA`,ns=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return es(e,(e,n)=>(r.push(...ns(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},rs=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},is=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),as=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},os=(e,t)=>e.map(e=>({pattern:as(e.pattern,t),set:e.set})),ss=(e,t)=>e.kind===`Function`?{...e,bounds:os(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},cs=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Qo({...ss(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:os(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:as(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:as(e.bound.pattern,n),set:e.bound.set}};default:return e}},ls=e=>`${e}@ENABLED`,us=(e,t)=>e.modes.get(t)??e,ds=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),fs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ds(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?fs(r.body,t,/* @__PURE__ */ new Map):void 0},ps=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ds(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ls(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:vs(e.expression,us(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[vs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:vs(e.subscript,us(t,`Primed`),n),location:r},vs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=fs(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:ls(r),location:e.location},location:e.location},vs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ms=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),hs=(e,t)=>e.map(e=>ms(e.name,t)),gs=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...hs(t,r),...i.map(e=>ms(e,r))],location:r},location:r}},_s=(e,t)=>e.instantiation.isParameterized(t)?bs(e,t):void 0,vs=(e,t,n)=>{let r=e=>vs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:vs(e.expression,us(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:vs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},us(t,`Enabled`),n)};let s=ps(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ko.add(n),n;let r=_s(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&Pa(o)>0?gs(r,a,Pa(o),e.location):{kind:`Apply`,operator:r,args:hs(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||qo.has(e),c=e=>(s&&qo.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:ts,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ts,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=_s(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...hs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=_s(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?gs(n,a,Pa(r),e.location):{...e,operator:n}}let c=rs(t),l=es(e,(e,i)=>i.length===0?r(e):vs(e,t,is(n,i,c)));return cs(l,n,c)},ys=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:ms(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},bs=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=rs(e),o=ss($o(i,(t,n)=>vs(t,e,is(/* @__PURE__ */ new Map,n,a))),a);return ys(o,r.params,i.location)}):t},xs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ns(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>_s(i,e)??e,getQualifiedKey:t=>{let n=_s(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ys(r,e.params,r.location)):t}}},Ss=e=>e.kind===`Let`&&e.instances!==void 0||vi(e).some(Ss),Cs=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=es(e,e=>Cs(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Na(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},ws=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ts=(e,t)=>e.definitions.some(e=>Ss(e.body))||e.assumptions.some(e=>Ss(e.expression))||e.theorems.some(e=>{let t=ws(e);return t!==void 0&&Ss(t)})?{...e,definitions:e.definitions.map(e=>$o(e,e=>Cs(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Cs(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ws(e);return n===void 0?e:{...e,statement:Cs(n,t,[])}})}:e,Es=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Tr.sets,a=i??[],o=a.length;Tr.sets=a;try{return n()}catch(e){throw Vu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Tr.sets=i}},Ds=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Os=e=>!e.includes(void 0),ks=e=>e.variables.map(()=>void 0),As=(e,t,n)=>{let r=[...e];return r[t]=n,r},js=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Ms=e=>e.kind===`Identifier`?e.name:void 0,Ns=(e,t,n)=>{if(t.kind===`Label`)return Ns(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ns(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=$l(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ns(e,o.body,o.scope):void 0},Ps=(e,t,n)=>{if(t.kind===`Prime`)return Ns(e,t.expression,n);if(t.kind===`Label`)return Ps(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ps(e,i.expression,i.scope);if(i)return;let a=$l(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Ps(e,a.body,a.scope):void 0},Fs=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Is=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ls=(e,t,n)=>{t===void 0?Os(n)&&e.onState(n):Os(n)&&Is(e)?zs(e,t,n):t.kind===`Predicate`?Bs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Ys(e,t.expression,t.rest,t.scope,n):Rs(e,t,n)&&Ls(e,t.rest,n)},Rs=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?vd(t,r.runtime.version):t}})();return!nn(i,a)},zs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Ys(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Rs(e,r,n):!Fs(W(r.expression,Ds(e,r.scope,n))))return}e.onState(n)},Bs=(e,t,n,r,i)=>Es(e,t,()=>{switch(t.kind){case`Let`:Bs(e,t.body,n,hu(t.definitions,Ds(e,r,i)),i);return;case`Label`:Bs(e,t.body,n,r,i);return;default:if(qs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Es(e,t,()=>Js(e,t,n,r,i))}}),Vs=(e,t,n,r)=>{Fs(t)&&Ls(e,n,r)},Hs=(e,t,n,r,i)=>{let a=Ds(e,r,i);if(t.kind===`Identifier`){let o=ul(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Bs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Bs(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:$l(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&xl(s,e.environment))){Bs(e,c.body,n,c.scope,i);return}Vs(e,W(t,a),n,i);return}let o=tu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Bs(e,o.body,n,pu(o,t.args,a),i):Vs(e,W(t,a),n,i)},Us=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ls(e,t,As(n,r,i)):nn(a,i)&&Ls(e,t,n)},Ws=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Gs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ns(e,a,r):Ps(e,a,r),c=Ds(e,r,i);if(s===void 0){W(t,c)===!0&&Ls(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Us(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Ls(e,n,i);else{if(!tr(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of pr(d))Ls(e,n,As(i,s,t))}},Ks=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),qs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Js=(e,t,n,r,i)=>{let a=Ds(e,r,i);switch(t.kind){case`Identifier`:Hs(e,t,n,r,i);return;case`Apply`:if(Ks.has(t.operator)&&t.args.length===2){Gs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Fs(W(t.args[0],a))){Bs(e,t.args[1],n,r,i);return}Ls(e,n,i);return}Hs(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Ws(`Predicate`,t,r,e),n);Bs(e,a[0],t,r,i);return}let o=a[a.length-1];Bs(e,js(t,a.length-1),Ws(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Bs(e,t,n,r,i));return}Bs(e,js(t,a.length-1),n,r,i),Bs(e,a[a.length-1],n,r,i);return}case`Exists`:Ml(t.bounds,a,r=>(Bs(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ml(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ls(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Ws(`Predicate`,t.body,n,e),n);Bs(e,t.body,o,r[0],i);return}case`If`:Bs(e,Fs(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Fs(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Bs(e,o,n,r,i);return}case`FunctionApplication`:{let r=Ll(W(t.function,e.isInit?a:ml(a)));if(r){Bs(e,r.body,n,Rl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Ys(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Bs(e,t.action,n,r,i),Ys(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Bs(e,t.action,Ws(`Changed`,t.subscript,r,n),r,i);return}}Vs(e,W(t,a),n,i)},Ys=(e,t,n,r,i)=>Es(e,t,()=>{let a=Ns(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Us(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ls(e,n,i);return}let s=o.reduceRight((e,t)=>Ws(`Unchanged`,t,r,e),n);Ys(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ul(r,t.name);if(a?.kind===`Thunk`){Ys(e,a.expression,n,a.scope,i);return}let o=a?void 0:$l(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Ys(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});nn(s,c)&&Ls(e,n,i)}),Xs=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Zs=/* @__PURE__ */ Error(`The replay found a successor`),Qs=(e,t,n,r)=>{let i=Xs(r,!1,n,()=>{throw Zs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Ws(`Changed`,e.subscript,t,void 0);Bs(i,e.action,n,t,ks(r))}else Bs(i,e,void 0,t,ks(r));return!1}catch(e){if(e!==Zs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},$s=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Xs(t,!0,void 0,n),o=i.reduceRight((e,t)=>Ws(`Predicate`,t.expression,t.scope,e),void 0);Bs(a,r.expression,o,r.scope,ks(t))},ec=(e,t,n,r)=>{e.some(e=>qs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Xs(n,!1,t,e=>i.push(e));Bs(a,e.expression,void 0,e.scope,ks(n)),i.forEach(t=>r(t,e))})},tc=/* @__PURE__ */ new WeakMap,nc=/* @__PURE__ */ new WeakMap,rc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},ic=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ac=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,oc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},sc=(e,t,n,r)=>{let i=tl(n);return r&&qs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${ac(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},cc=(e,t,n)=>{let r=Hi(t),i=el(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${ac(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
- `:``}${i}`},lc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw oc(e,sc(e,i,t,r))},uc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,dc=(e,t,n)=>{let r=n?tc:nc,i=r.get(e);if(i)return i;let a=Rc(e,t,n);return r.set(e,a),a},fc=(e,t)=>{if(t.constants.has(e))return;let n=_l(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},pc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return pc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=fc(e.name,t);if(a&&!r.has(a))return r.add(a),pc(a.body,t,n,r)},mc=(e,t,n)=>pc(e,t,!n),hc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return hc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=hu(e.definitions,rc(r,t,n));return hc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ul(t,e.name);if(a?.kind===`Thunk`)return hc(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=fc(e.name,r.environment);if(s)return hc(s.body,void 0,n,r,i)},gc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,_c=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_c(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=fc(e.name,t);if(i)return n.add(e.name),_c(i.body,t,n)},vc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),yc=(e,t,n)=>vc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||uc(e.operator)&&(gc(e.args[0],n)||mc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,bc=/* @__PURE__ */ new Set,xc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return es(e,(e,i)=>{let a=r.isReadOnly?xc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Sc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:_l(r,t);return i&&!n.has(i)&&(n.add(i),Sc(i.body,t,n))?!0:vi(e).some(e=>Sc(e,t,n))},Cc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=mc(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=_c(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return yc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:dc(e,t,n)}},wc=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(wd(e,t)===void 0||Sc(e,t,/* @__PURE__ */ new Set))return!0;let n=xc(e,bc);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},Tc=(e,t,n)=>{let r=e.map(e=>Cc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Is(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Hc(c)){l??=rc(t,n,c);for(let e=a;e<r.length;e++)if(!lc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=rc(t,n,c),!lc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=rc(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=ic(c,e.index,r),l=void 0;else if(!nn(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=ic(c,t,n[t]),l=void 0;else if(!nn(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Ec=e=>(t,n,r,i,a,o)=>{lc(t,e,rc(t,n,r))&&o(r,i)},Dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=rc(r,i,a);if(a[l]!==void 0){lc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!tr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${ac(r)}, the right side of \\IN is not enumerable.`;throw oc(r,`${t}\n${el(e)}`)}let p=pr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ic(a,l,p[e]),o)}},Oc=/* @__PURE__ */ new WeakMap,kc=e=>{let t=Oc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(kc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Oc.set(e,n),n},Ac=(e,t)=>{let n=e.args[0],r=Ec(e),i=(e,r,i)=>hc(n,r,i,e,!t)??-1,a=Dc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],rc(t,n,o));l(ic(o,u,d),s)}},jc=(e,t,n)=>{let r=el(e);return(i,a,o,s,c,l)=>{let u=rc(i,a,o),d=W(e.function,n?u:ml(u)),f=Ll(d);if(f!==void 0){dc(f.body,t,n)(i,Rl(f,e,u),o,s,c,l);return}if(!P(d))throw oc(i,`In computing ${ac(i)}, a non-function (${Hi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw oc(i,`In computing ${ac(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Mc=(e,t)=>{if(_c(e,t))return Tc([kc(e)],t,!1);if(e.kind===`Tuple`)return dc(kc(e),t,!1);let n=kc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ul(i,e.name):void 0;l?.kind===`Thunk`?dc(kc(l.expression),t,!1)(r,l.scope,a,o,s,c):lc(r,n,rc(r,i,a))&&c(a,o)}},Nc=(e,t,n)=>{let r=e.operator,i=Ec(e),a=B(e)?void 0:$l(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=ed(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=dc(a.body,t,n),o.body(e,i(rc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=rc(a,o,s),f=tu(e,d);f?.kind===`Closure`?dc(f.body,t,n)(a,pu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Pc=(e,t,n)=>{let r=Ec(e),i=B(e)?void 0:fc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ul(s,e.name);f?.kind===`Thunk`?dc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=dc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Fc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=pc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Fc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=$l(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Fc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ic=(e,t,n)=>{let r=ul(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Lc=(e,t,n)=>{let r=e.map(e=>dc(e,t,n)),i=n?[]:e.map(e=>Fc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ic(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Rc=(e,t,n)=>{let r=e=>dc(e,t,n);switch(e.kind){case`And`:return Tc(e.operands,t,n);case`Or`:return Lc(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Tl(W(a.set,rc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,dl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:wc(e,t);if(o){let r=Tc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=rc(n,i,a),d=e.bounds.map(e=>Tl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=dl(t,o.names[e],r);if(e===d.length-1){let e=rc(n,i,a);if(!o.guards.every(t=>lc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ml(e.bounds,rc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&wd(e,t)!==void 0&&!Sc(e.body,t,/* @__PURE__ */ new Set)?xc(e,bc):void 0;return(t,n,r,o,s,c)=>{let l=[];Ml(e.bounds,rc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ul(n,e)?.kind===`Value`)){u.every(n=>lc(t,e.body,rc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Hc(r)?u.slice(n).every(n=>lc(t,e.body,rc(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,rc(r,i,a));if(typeof l!=`boolean`)throw oc(r,cc(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=rc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw oc(r,`In computing ${ac(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Hi(t)}) was used as a guard condition of a CASE.\n${tl(e.source)}`)})?.body??n;if(!u)throw oc(r,`In computing ${ac(r)}, TLC encountered a CASE with no conditions true.\n${el(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Eu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,hu(e.definitions,rc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Qc(e)}`)}:Mc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=kc(e.subscript),a=(e,n,r)=>{try{return lc(e,i,rc(e,n,r))}catch(n){throw e.isEnabled?vd(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,kc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Pc(e,t,n);case`FunctionApplication`:return jc(e,t,n);case`Apply`:{let i=e.args;if(uc(e.operator)){let r=mc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Tc([e],t,n):Dc(e,()=>r);if(gc(i[0],n))return Ac(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],rc(t,n,r));(typeof c==`boolean`?c:gl(c,`the left side of => at ${Qc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Nc(e,t,n)}default:return Ec(e)}},zc=/* @__PURE__ */ new WeakMap,Bc=e=>{let t=zc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return zc.set(e,n),n},Vc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Hc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Uc=(e,t)=>{let n=t.state;if(!n||!Hc(n))throw new y(`ENABLED needs a complete state at ${Qc(e)}`);let r=t.environment;if(r.callStack)return Qs(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return dc(e,r,!1)(i,t.scope,Bc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Wc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};dc(t,r,!0)(o,a,Bc(r),void 0,!1,t=>{if(!o.isStopped){if(!Hc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Gc=(e,t,n)=>{let r=[];return Wc(e,t,e=>(r.push(e),!1),n),r},Kc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return dc(e,n,!1)(a,i,Bc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Hc(e)){let r=Vc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},qc=(e,t,n,r)=>{let i=[];return Kc(e,t,n,e=>(i.push(e),!1),r),i},Jc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Yc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Xc=e=>Yc.has(e.kind)||e.kind===`Apply`&&Jc.has(e.operator),Zc=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Qc=e=>`line ${e.location.line}, column ${e.location.column}`,$c=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,el=e=>{let t=e.location.range;return t?$c(t):Qc(e)},tl=e=>e.kind===`Number`?e.text??String(e.value):el(e),nl=(e,t)=>new y(`A non-boolean expression (${Hi(t)}) was used as the condition of an IF.\n${el(e)}`),rl=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${Hi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${tl(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Hi(n)}.\n${el({...e,location:{...e.location,range:{...r,end:i}}})}`)},il=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${el(e)}`,r=e=>`Attempted to apply function:\n${dt(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!P(i))throw new y(`Attempted to select field "${t}" from a non-record value ${dt(z(i))}\n${el(e)}`);let a=Kt(i);if(a===`tuple`)throw Pr(t);return Ir(i,t,a===`record`?n:r)}},al=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,ol=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Hi(t)})\n${el(e)}`);return Rr(t)},sl=(e,t)=>(n,r)=>{if(!N(n)||Pt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${el(e)}`);return t.evaluate([n,r])},cl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Qc(t)}`),e.configParseError),ll=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Qc(t)}`),e.error),ul=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},dl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),fl=(e,t,n)=>{if(t.kind===`Name`)return dl(e,t.name,n);let r=Cr(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>dl(e,t,r[n]),e)},pl=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Hi(e)}) was applied as a function.\n${el(t)}`)},ml=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},hl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),gl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},_l=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),vl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),bl=(e,t)=>{if(vl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&yl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=_l(n,t);if(e&&!t.constants.has(n)&&!xl(e,t))return!0}return vi(e).some(e=>bl(e,t))},xl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!bl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>bl(e.set,t)));return t.constantLevels.set(e,r),r},Sl=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Cl=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:Sl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${tl(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${tl(t)}\n${i}`)}},wl=(e,t,n)=>(Cl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Yn(e):cr(e)??L(e).elements),Tl=(e,t,n)=>n===`1.7.4`?(Cl(e,t,n),cr(e)??pr(e)):wl(e,t,n),El=e=>{if(typeof e==`object`&&e.kind===`Interval`)return yr(e),e},Dl=(e,t,n)=>El(e)??Tl(e,t,n),Ol=(e,t,n)=>El(e)??wl(e,t,n),kl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Al=(e,t)=>e.map(e=>Dl(W(e.set,t),e.set,t.environment.runtime.version)),jl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):kl(t[n],t=>i(n-1,fl(a,e[n].pattern,t)));return i(e.length-1,n)},Ml=(e,t,n)=>jl(e,Al(e,t),t.scope,n),Nl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Pl=(e,t,n)=>{if(e.length===1)return fl(t,e[0].pattern,n);let r=Cr(n)??[];return e.reduce((e,t,n)=>fl(e,t.pattern,r[n]),t)},Fl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Il=e=>Object.assign(e.value,{lambda:e}),Ll=e=>Fl(e)?e.lambda:void 0,Rl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:$n(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${el(t.function)}`,s=e.bounds;if(s.length===1){if(!Dr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Pl(s,e.scope,a)}let c=Cr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${el(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Dr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Cr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Pl(s,e.scope,$n(c.slice(0,s.length)))},zl=/* @__PURE__ */ new WeakMap,Bl=(e,t)=>{let n=zl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:$c(r)};return zl.set(t,i),i},Vl=(e,t,n)=>{let r=Bl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Hl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Zr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(an(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Ul=/* @__PURE__ */ new WeakMap,Wl=e=>{let t=Ul.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Ul.set(e,n),n},Gl=(e,t)=>{let n=Nl(e.bounds,t),r=Hl(n,(n,r)=>W(e.body,hl(t,Pl(e.bounds,dl(void 0,e.name,r),n))),Vl(e.bounds,e.body,n));return Il({value:r,bounds:e.bounds,body:e.body,scope:dl(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},Kl=(e,t)=>{if(typeof t!=`object`||Kt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ft(t.domain))return t;try{let e=Ar(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},ql=(e,t)=>e.kind===`Function`?e.isSelfReferential?Gl(e,t):W(Wl(e),t):W(e.body,t),Jl=(e,t)=>{let n=xl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=hl(t,void 0);if(!n)return ql(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Kl(e,ql(e,i)));return t.environment.definitionValues.set(e,a),a},Yl=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&xl(e,t))try{Pn(Jl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Xl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,hl(t,e.scope));return n&&(e.cache=r),r},Zl=/* @__PURE__ */ new WeakMap,Ql=e=>{let t=Zl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Zl.set(e,n),n},$l=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return $l(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ql(r):t.builtins.get(e)},eu=/* @__PURE__ */ new WeakMap,tu=(e,t)=>{if(B(e))return nu(e.operator,t);let n=eu.get(e),r=n===void 0?$l(e.operator,t.environment)??null:n;return n===void 0&&eu.set(e,r),r??nu(e.operator,t)},nu=(e,t)=>{let n=ul(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return $l(e,t.environment)},ru=e=>e.kind===`Closure`?e.params.length:e.arity,iu=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:nu(n,t);if(!r)throw new y(`Expected an operator argument at ${Qc(e)}`);return r},au=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>dl(e,n.name,t[r]),e.scope);return W(e.body,hl(n,r))},ou=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ru(e),call:n=>au(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},su=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=nu(e.name,t);return n!==void 0&&ru(n)>0},cu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),lu=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return lu(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},uu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_u(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:lu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ul(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:cu(e,t)}}return t=>cu(e,t)},du=/* @__PURE__ */ new WeakMap,fu=(e,t)=>{let n=du.get(e);if(n)return n;let r=uu(e,t);return du.set(e,r),r},pu=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:iu(t[i],n)}:fu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},mu=(e,t,n)=>e.kind===`Closure`?W(e.body,hl(n,pu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Qu(t,n),n):e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n),hu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),gu=(e,t,n)=>{let r=ul(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Xl(r,n);if(r?.kind===`Operator`){if(ru(r.operator)===0)return au(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=lu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw _d(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Jl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Qc(t)}`)},_u=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,vu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),yu=(e,t)=>vu.has(e)||t.builtins.get(e)?.isStateLevel===!0,bu={builtins:vu,definitions:/* @__PURE__ */ new WeakMap},xu={builtins:new Set([...vu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Su=(e,t)=>e.kind===`Operator`&&e.params.length===0&&xl(e,t),Cu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=_l(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Su(e,t)&&wu(e,t,n))return!0}return vi(e).some(e=>Cu(e,t,n))},wu=(e,t,n=bu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Cu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Cu(e.set,t,n));return n.definitions.set(e,i),i},Tu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Eu=(e,t)=>new Set(e.filter(e=>wu(e,t)||wu(e,t,Tu))),Du=e=>[...e.definitions.values()].some(t=>wu(t,e)),Ou=e=>[...e.definitions.values()].some(t=>wu(t,e,xu)),ku=/* @__PURE__ */ new WeakMap,Au=(e,t)=>{let n=ku.get(e);if(n!==void 0)return n;let r=Pu(e,t,Mu);return ku.set(e,r),r},ju=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Mu=/* @__PURE__ */ new Set,Nu=(e,t,n)=>n.size===0?Au(e,t):Pu(e,t,n),Pu=(e,t,n)=>{if(!ju.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=lu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Su(n.definition,t)}if(e.kind===`Apply`){if(yu(e.operator,t)||Tu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=$l(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=_l(e.operator,t);if(!n||!xl(n,t)||wu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Nu(e,t,n))}let r={value:!0};return es(e,(e,i)=>(r.value&&=Nu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Fu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Iu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Lu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return es(e,(e,r)=>(n.value||=Lu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Ru=(e,t)=>Ko.has(e)&&Fu(e)&&wd(e,t)!==void 0&&!Lu(e,Mu),zu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Bu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Tr.sets,o=Tr.callStack,s=a??[],c=s.length;Tr.sets=s,Tr.callStack=r;try{let a=t(i),o=zu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Xc(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Zc(e,r.values),a=i&&!vi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Vu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Tr.sets=a,Tr.callStack=o}},Vu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Hu=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Uu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Wu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=xd(e,t),i=t.callStack,a=i?Bu(e,r,t,i):Fu(e)&&Au(e,t)?Iu(r):Ru(e,t)?Yu(r):r;return t.evaluators.set(e,a),a},Gu=/* @__PURE__ */ new WeakMap,Ku=(e,t)=>{if(t.callStack)return Wu(e,t);let n=Gu.get(e);if(n)return n;let r=(Fu(e)&&Au(e,t)?void 0:la(e,t))??Wu(e,t);return Gu.set(e,r),r},W=(e,t)=>Ku(e,t.environment)(t),qu=(e,t)=>{let n=e.name,r=B(e)?void 0:lu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw _d(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&xl(e,t))return t=>Jl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Ku(e.body,t),n.body(hl(r,void 0)));return Ju(e,t)?Yu(r):r}return t=>Jl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Jl(e,t);return xl(e,t)||!Ju(e,t)?n:Yu(n)}return t=>gu(n,e,t)},Ju=(e,t)=>wd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>wd(e.set,t)!==void 0)),Yu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Xu=(e,t)=>{let n=$l(e,t);return n!==void 0&&ru(n)>0},Zu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Xu(e.name,t)),Qu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),$u=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Qu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Zu(t[0],n)){let e=Wu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Zu(t[0],n)&&Zu(t[1],n);if(i&&a){let e=Wu(t[0],n),r=Wu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n)},ed=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:fu(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:iu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},td=/* @__PURE__ */ new WeakMap,nd=e=>{let t=td.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return td.set(e,n),n},rd=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},id=(e,t)=>e.every((e,n)=>an(e,t[n])),ad=(e,t)=>{let n=_l(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&xl(n,t)&&!wu(n,t)},od=(e,t,n,r)=>{let i=ed(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Ku(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=nd(e);return e=>{let n=i(e),r=rd(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=Hr(a,Zr(e));let c=s.calls.get(a),l=c?.find(e=>id(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},sd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Wu(n[0],t),r=Wu(n[1],t);return t=>!gl(e(t),`the left side of =>`)||gl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:$l(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&ad(e,t);return od(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Wu(n[0],t),i=ol(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Wu(n[0],t);return qo.has(e)||bl(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Wu(n[0],t),a=Wu(n[1],t),o=sl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?$u(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=nu(e.operator,r);if(i)return mu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Qc(e)}`)}},cd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Wu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Wu(a.set,t);return s=>kl(Dl(o(s),a.set,t.runtime.version),t=>gl(i(hl(s,dl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Wu(e.set,t));return s=>{let c=a.map((e,n)=>Dl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?gl(i(hl(s,a)),r)!==n:kl(c[t],n=>l(t-1,dl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ml(o,e,t=>gl(i(hl(e,t)),r)!==n)?!n:n},ld=(e,t)=>{if(e.kind===`Tuple`)return $n(e.names.map(e=>{let n=ul(t,e);return n?.kind===`Value`&&n.value}));let n=ul(t,e.name);return n?.kind===`Value`?n.value:void 0},ud=/* @__PURE__ */ new WeakSet,dd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&ud.add(e)},fd=(e,t)=>{let n=ud.has(e),r=Wu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Wu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Zn(e),o=Ut(i,i.map(e=>r(hl(t,dl(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Ol(W(e.set,t),e.set,t.environment.runtime.version));return jl(i,s,t.scope,e=>{let o=i.length===1?ld(a.pattern,e)??!1:$n(i.map(t=>ld(t.pattern,e)??!1));return n.push([o,r(hl(t,e))]),!1}),Un(n)},l=(t,n)=>{let a=Il({value:Hl(t,e=>r(hl(n,Pl(i,n.scope,e))),Vl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?qt(a):a},u=t.callStack;return t=>{let r=o?s(t):Nl(i,t);if(e.isRecursive||n||t.isKeepLazy||!I(r))return l(r,t);if(!ft(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Hu(u,e,t),t}}},pd=(e,t)=>{let n=ud.has(e);n&&dd(e.function);let r=Wu(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Wu(e,t))}),value:Wu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):$n(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(hl(i,dl(i.scope,`@`,e))):zr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ua.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${el(e.function)}`)}return n}},md=(e,t)=>{if(e.kind===`SetFilter`){let n=Wu(e.predicate,t),r=Wu(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:$c(a)},s=(e,t)=>n=>gl(e(hl(t,fl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},Wu(e.predicate,r))});return e=>{let t=r(e);return ft(t)?Ht(L(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Wu(e.expression,t);return t=>{let r=[];return Ml(e.bounds,t,e=>(r.push(n(hl(t,e))),!1)),Rn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Qc(e)}`)};let r=Wu(e.body,t),i=Wu(n,t);return t=>{let a=i(t);if(!N(a)||Pt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${el(e)}`);let o={value:void 0},s=Ol(a,n,t.environment.runtime.version);if(kl(s,n=>{let i=fl(t.scope,e.pattern,n);return gl(r(hl(t,i)),`the body of CHOOSE`)?(o.value=ld(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${el(e)}`);return o.value}},hd=e=>[...e].sort((e,t)=>zt(e.name,t.name)),gd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),_d=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${el(t)}`,e),vd=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,yd=e=>new y(`A primed expression appears outside an action at ${Qc(e)}`),bd=(e,t)=>{let n=hd(e),r=gd(n),i=n.map(e=>Wu(e.value,t));if(r)return e=>er(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>vt(a,i.map(t=>t(e)),o):e=>tn(a,i.map(t=>t(e)))},xd=(e,t)=>{let n=e=>Wu(e,t);switch(e.kind){case`Number`:{let t=e.value;return _u(t)?()=>t:()=>{throw ll(e)}}case`Decimal`:return()=>{throw cl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return qu(e,t);case`Apply`:return sd(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Qc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Qc(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw rl(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw rl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw yd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>nn(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw nl(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${Hi(t)}) was used as a condition of a CASE. ${tl(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${el(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(hl(n,hu(e.definitions,n)))}case`Forall`:case`Exists`:return cd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Qc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return md(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Rn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>$n(t.map(t=>t(e)))}case`FunctionConstruction`:return fd(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return bd(e.fields,t);case`RecordSet`:{let t=hd(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return pd(e,t);case`ExceptAt`:return t=>{let n=ul(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Qc(e)}`);return n.value};case`FunctionApplication`:{dd(e.function);let r=n(e.function),i=t=>pl(r(ml(t)),e),a=e.args.map(n),o=al(t.runtime.version);if(a.length===1){let e=a[0];return t=>Ir(i(t),e(t),o)}return e=>Ir(i(e),$n(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=il(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?gl(t(e),`an action`)||r(e):gl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Uc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Qc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Qc(e)}`)}}},Sd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Cd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},wd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Sd.has(e.kind))return!1;let a=Cd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&yu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return vi(e).every(i)};return i(e)?[...n]:void 0},Td=`-------------------------------- MODULE Reals -------------------------------
71
+ `],[2281,` - specifically: `]]),Ji=(e,t,n)=>{let r=n?qi.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${Yi(t.slice(a),n)}`},Yi=(e,t)=>{let n=t?Gi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Li.none} @!@!@\n${Ji(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Xi=e=>String(e).padStart(2,`0`),Zi=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Xi(r%24)}h`:e>36e5?`${Xi(r%24)}h ${Xi(n)}min`:e>6e4?`${Xi(n)}min ${Xi(t)}s`:`${Xi(t)}s`},Qi=e=>`${e.getFullYear()}-${Xi(e.getMonth()+1)}-${Xi(e.getDate())} ${Xi(e.getHours())}:${Xi(e.getMinutes())}:${Xi(e.getSeconds())}`,$i={kind:`Local`},ea=/* @__PURE__ */ new WeakSet,ta=/* @__PURE__ */ new WeakMap,na=/* @__PURE__ */ new WeakMap,ra=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ia=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,oa=e=>e.kind===`Operator`?e.params.length:0,sa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ca=e=>e.name.includes(`!`),la=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ua=(e,t,n)=>{let r=t.bindings.get(e);return r&&aa(r.position,t.location)&&(!n||aa(r.position,n.start))?r:void 0},da=(t,n)=>t!==void 0&&n!==void 0&&e.I(t)===e.I(n),fa=(t,n,r,i)=>{if(n===void 0)return!0;if(da(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.I(a),s=n.range&&e.I(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},pa=(e,t,n,r)=>fa(t,la(e,t)??ua(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,ma=(e,t,n)=>{fa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},ha=(e,t,n,r)=>t.reduce((e,t,i)=>pa(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),ga=(e,t,n)=>t.reduce((e,t)=>pa(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),_a=e=>e.kind===`Name`?[e.name]:e.names,va=e=>e.flatMap(e=>_a(e.pattern)),ya=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||aa(n.location,t.location))?n:void 0},ba=(e,t)=>{let n=ya(e,t);return n?{key:t.getKey(n),arity:oa(n),params:sa(n),kind:`Definition`}:t.imported.get(e)},xa=(e,t,n)=>la(t,e)??ba(e,n),Sa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ca=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Sa(e.location,e.spelling??t)},wa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return aa(e.location,e.args[0].location)?`prefix`:`postfix`}},Ta=e=>!/^[\p{L}\d_]/u.test(e),Ea=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Da=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Oa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},ka=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Oa(e.name,[],void 0):Oa(e.operator,e.args,e.argumentCounts),Aa=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ja=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:va(e.bounds),body:e.body,sets:Aa(e.bounds)};case`SetMap`:return{names:va(e.bounds),body:e.expression,sets:Aa(e.bounds)};case`SetFilter`:return{names:_a(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:_a(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Ma=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Na=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Pa=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Fa=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Fa(e.body,t):Ur(e).reduce((e,n)=>e??Fa(n,t),void 0)},Ia=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ia(i,t,n||Pa(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Fa(e.set,t):Fa(e,t)},La=e=>e.kind===`Label`?La(e.body):e,Ra=e=>typeof e==`number`?`argument selector ${e}`:e,za=`within the scope of a declaration
72
+ from outside that declaration's scope.`,Ba=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.I(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&La(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:Ia(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Fa(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Pa(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${za}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=Ra(t.operand);if(u.isSufficesOpen){if(Da(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=La(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?xa(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=ja(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ma(e);if(!l)return;let f=Da(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Da(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Pa(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${za}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},Va=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.I(t.location.range),message:r}),!0)},Ha=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.I(i),o=t.params.filter((i,a)=>{let o=la(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.I(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},Ua=(e,t,n,r)=>{if(!Na(e))return!1;let i=ka(e),a=i[0],o=i.length>1&&a.kind===`Name`?la(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Ba(e,i,o,t,n,r),o!==void 0},Wa=(t,n,r,i)=>{let a=t.location;if(eo(t,r,i))return;let o=na.get(t);if(o!==void 0)return o;if(ra(n))return t.kind===`Apply`?t.args.length:0;let s=la(r,n);if(s?.isNonFact){i.errors.push({location:e.I(Ca(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(Ua(t,r,i,!1)||Ea(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=$i),s)return s.arity;let c=ba(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,na.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(la(r,l)!==void 0||ba(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.I(t.kind===`Apply`&&u===`-.`?Sa(a,`-`):Ca(t,n));if(!Ta(n)||Ea(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=wa(t);f&&a.range&&i.errors.push({location:e.I(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},Ga=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>ha(e,_a(t.pattern),t.pattern.ranges,n),t)),Ka=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||Ur(e).some(e=>Ka(e,t)),qa=(e,t)=>{e.kind===`FunctionConstruction`&&Ka(e.body,t)&&(e.isRecursive=!0),Ur(e).forEach(e=>qa(e,t))},Ja=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?va(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.I(s),message:t})},l=t.kind===`Function`?Ga(t.bounds,n,a):ga(n,t.params,a),u=la(l,o)??ua(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(U(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),qa(t.body,o),t.isSelfReferential=Ka(t.body,o)):U(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:fa(o,la(n,o)??ua(o,a,s),{kind:`Definition`,arity:oa(t),range:s},a)},Ya=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(la(e,t.name)?.isPending)return e;let n={name:t.name,arity:oa(t),params:sa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>oo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ra(t.name)?e:s(e,e=>!aa(t.location,e.location)),o={name:t.name,arity:oa(t),kind:`Definition`,range:t.location.range,parent:a};if(ca(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ra(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Ja(t,a,u,i)?{...o,params:sa(t)}:a},a),()=>!0)},Xa=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:la(t,r)??ua(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Za=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=Xa(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.I(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},Qa=(t,n,r)=>{if(Za(t,n,r))return;let i=t.operator,a=xa(i,n,r),o=Wa(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.I(t.argumentsRange??Ca(t,i)),message:`The operator ${i} requires ${o-(Xa(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>$a(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.I(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=Wa(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else U(e,n,r);return!0}if(e.kind===`Lambda`){U(e,n,r);let s=e.params.length===o;return!s&&ea.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Ca(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return U(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=xa(u,n,r)?.params??[],f=Wa(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Ca(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},$a=(e,t,n)=>{e.kind===`Identifier`?Wa(e,e.name,t,n):U(e,t,n)},eo=(e,t,n)=>{let r=ta.get(e);return r?(r.args.forEach(e=>$a(e,t,n)),n.errors.push(r.error),!0):!1},U=(t,n,r)=>{if(ea.has(t)&&!r.isGenerated){U(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>U(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Za(t,n,r))return;let i=t.name,a=Wa(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.I(Ca(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:Wa(t,t.operator,n,r);return;case`Apply`:Qa(t,n,r);return;case`Lambda`:U(t.body,ha(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&U(t.other,n,r);return;case`Let`:U(t.body,Ya(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(t.body,Ga(t.bounds,n,r),a(va(t.bounds)));return;case`UnboundedQuantifier`:U(t.body,ha(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&U(t.set,n,r),U(t.body,ha(n,_a(t.pattern),t.pattern.ranges,r),a(_a(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:U(t.predicate,Ga([t.bound],n,r),a(_a(t.bound.pattern)));return;case`SetMap`:U(t.expression,Ga(t.bounds,n,r),a(va(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.I(i.location.range??Sa(i.location,i.name)),message:`Non-unique fields in constructor.`}),U(i.value,n,r)});return;case`Except`:U(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:U(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(Va(t,r))return;U(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Ha(t,n,r);return;case`Subexpression`:if(eo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>$a(e,n,r)),Ua(t,n,r,!1)}},to=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||Za(t,n,r)||Ua(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&la(n,i)?.isNonFact?r.errors.push({location:e.I(Ca(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||U(t,n,r)}),no=(e,t,n)=>(e.set&&U(e.set,t,n),pa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),ro=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:no(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?ro(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},io=(e,t,n)=>e.kind===`AssumeProve`?ro(e,t,n):(U(e,t,n),t),ao=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&to(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>so(t,e,r),t)},oo=(e,t,n)=>{let r=mo(e,t,n);return e.name===void 0?r:pa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},so=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=io(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return ao(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return ao(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return to(r.facts,t,n),o(t);case`Instance`:return o(oo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?oo(t,e,i):Ya([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),ao(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(ha(Ga(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=ha(Ga(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...va(r.bounds),...r.names]}),ao(e.proof,a(t),n),a(o)}default:return ao(e.proof,a(t),n),a(t)}},co=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:io(e.statement,void 0,t);e.name!==void 0&&ma(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),ao(e.proof,n,t),r&&(r.isInProof=!1)},lo={line:0,column:0},uo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),fo=(e,t)=>{let n=new Map([...ia,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},po=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){U(r,o,a);return}let i=Wa(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.D(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.I(t.nameRange),message:`Identifier '${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 o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.I(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!la(o,e.name)&&!ba(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.I(i),message:`Substitution missing for symbol ${n.name} declared at ${e.I(o)} \nand instantiated in module ${r}.`})}),c},mo=(e,t,n)=>{let r=n.getInstance(e);return po(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>pa(e,t,r,n),t)},ho=(e,t,n,r)=>{let i=fo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),po(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:lo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},go=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>aa(e.location,t.location)?-1:+!!aa(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.D)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},_o=(t,n)=>{let r=fo(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ia,...n.bound].map(([e,t])=>[e,{...t,position:lo}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>ma(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return go([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=fa(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);uo(t,e)?U(e.body,void 0,i):Ja(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:oa(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);ga(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>ma(t,e,i)),e.name!==void 0&&ma(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&ma(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>co(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>to(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.I(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},vo=/* @__PURE__ */ new WeakSet,yo=/* @__PURE__ */ new WeakSet,bo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Eo(e,(e,r)=>bo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},xo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),So=/* @__PURE__ */ new WeakMap,Co=e=>So.get(e)??e.name,wo=(e,t)=>(Co(t)!==e.name&&So.set(e,Co(t)),e),To=(e,t)=>wo(e.kind===`Function`?{...e,bounds:xo(e.bounds,e=>t(e,[])),body:t(e.body,va(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Eo=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>To(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:xo(e.bounds,n),body:t(e.body,va(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,_a(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,_a(e.bound.pattern))};case`SetMap`:return{...e,bounds:xo(e.bounds,n),expression:t(e.expression,va(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Do=`LAMBDA`,Oo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Eo(e,(e,n)=>(r.push(...Oo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ko=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Ao=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),jo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Mo=(e,t)=>e.map(e=>({pattern:jo(e.pattern,t),set:e.set})),No=(e,t)=>e.kind===`Function`?{...e,bounds:Mo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Po=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>wo({...No(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Mo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:jo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:jo(e.bound.pattern,n),set:e.bound.set}};default:return e}},Fo=e=>`${e}@ENABLED`,Io=(e,t)=>e.modes.get(t)??e,Lo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),Ro=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ro(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Lo(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ro(r.body,t,/* @__PURE__ */ new Map):void 0},zo=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Lo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Fo(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Wo(e.expression,Io(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Wo(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Wo(e.subscript,Io(t,`Primed`),n),location:r},Wo(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ro(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Fo(r),location:e.location},location:e.location},Wo({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Bo=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Vo=(e,t)=>e.map(e=>Bo(e.name,t)),Ho=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Vo(t,r),...i.map(e=>Bo(e,r))],location:r},location:r}},Uo=(e,t)=>e.instantiation.isParameterized(t)?Ko(e,t):void 0,Wo=(t,n,r)=>{let i=e=>Wo(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!B(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:Wo(t.expression,Io(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:Wo(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Io(n,`Enabled`),r)};let c=zo(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return vo.add(e),e;let r=Uo(n,t.name);if(r===void 0)return t;if(o.length===0)return{...t,name:r};let i=a.getDefinition(t.name);return i&&oa(i)>0?Ho(r,o,oa(i),t.location):{kind:`Apply`,operator:r,args:Vo(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||yo.has(t),l=e=>(c&&yo.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Do,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Do,args:r,resolution:{kind:`Local`}},location:t.location};if(s)throw new e.D(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=Uo(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...Vo(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=Uo(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?Ho(e,o,oa(r),t.location):{...t,operator:e}}let l=ko(n),u=Eo(t,(e,t)=>t.length===0?i(e):Wo(e,n,Ao(r,t,l)));return Po(u,r,l)},Go=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Bo(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ko=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=ko(e),o=No(To(i,(t,n)=>Wo(t,e,Ao(/* @__PURE__ */ new Map,n,a))),a);return Go(o,r.params,i.location)}):t},qo=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Oo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Uo(i,e)??e,getQualifiedKey:t=>{let n=Uo(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Go(r,e.params,r.location)):t}}},Jo=e=>e.kind===`Let`&&e.instances!==void 0||Ur(e).some(Jo),Yo=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Eo(e,e=>Yo(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Xo=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Zo=(e,t)=>e.definitions.some(e=>Jo(e.body))||e.assumptions.some(e=>Jo(e.expression))||e.theorems.some(e=>{let t=Xo(e);return t!==void 0&&Jo(t)})?{...e,definitions:e.definitions.map(e=>To(e,e=>Yo(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Yo(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Xo(e);return n===void 0?e:{...e,statement:Yo(n,t,[])}})}:e,Qo=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=qn.sets,a=i??[],o=a.length;qn.sets=a;try{return n()}catch(e){throw hu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,qn.sets=i}},$o=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},es=e=>!e.includes(void 0),ts=e=>e.variables.map(()=>void 0),ns=(e,t,n)=>{let r=[...e];return r[t]=n,r},rs=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},is=e=>e.kind===`Identifier`?e.name:void 0,as=(e,t,n)=>{if(t.kind===`Label`)return as(e,t.body,n);let r=is(t);if(r===void 0)return;let i=Rc(n,r);if(i?.kind===`Thunk`)return as(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Dl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?as(e,o.body,o.scope):void 0},os=(e,t,n)=>{if(t.kind===`Prime`)return as(e,t.expression,n);if(t.kind===`Label`)return os(e,t.body,n);let r=is(t);if(r===void 0)return;let i=Rc(n,r);if(i?.kind===`Thunk`)return os(e,i.expression,i.scope);if(i)return;let a=Dl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?os(e,a.body,a.scope):void 0},ss=t=>{if(typeof t!=`boolean`)throw new e.g(`TLC expected a boolean expression.`);return t},cs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ls=(e,t,n)=>{t===void 0?es(n)&&e.onState(n):es(n)&&cs(e)?ds(e,t,n):t.kind===`Predicate`?fs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?xs(e,t.expression,t.rest,t.scope,n):us(e,t,n)&&ls(e,t.rest,n)},us=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?nd(t,r.runtime.version):t}})();return!Ct(i,a)},ds=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){xs(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!us(e,r,n):!ss(W(r.expression,$o(e,r.scope,n))))return}e.onState(n)},fs=(t,n,r,i,a)=>Qo(t,n,()=>{switch(n.kind){case`Let`:fs(t,n.body,r,Ul(n.definitions,$o(t,i,a)),a);return;case`Label`:fs(t,n.body,r,i,a);return;default:if(ys.has(n.kind))throw new e.g(`The state relation is not a boolean expression.`);Qo(t,n,()=>bs(t,n,r,i,a))}}),ps=(e,t,n,r)=>{ss(t)&&ls(e,n,r)},ms=(e,t,n,r,i)=>{let a=$o(e,r,i);if(t.kind===`Identifier`){let o=Rc(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){fs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){fs(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Dl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Yc(s,e.environment))){fs(e,c.body,n,c.scope,i);return}ps(e,W(t,a),n,i);return}let o=kl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?fs(e,o.body,n,Vl(o,t.args,a),i):ps(e,W(t,a),n,i)},hs=(e,t,n,r,i)=>{let a=n[r];a===void 0?ls(e,t,ns(n,r,i)):Ct(a,i)&&ls(e,t,n)},gs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),_s=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?as(t,o,i):os(t,o,i),l=$o(t,i,a);if(c===void 0){W(n,l)===!0&&ls(t,r,a);return}let u=W(s,l),d=a[c];if(n.operator===`=`){hs(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)W(n,l)===!0&&ls(t,r,a);else{if(!Sn(f))throw new e.g(`The right side of \\IN is not enumerable.`);for(let e of Pn(f))ls(t,r,ns(a,c,e))}},vs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),ys=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),bs=(t,n,r,i,a)=>{let o=$o(t,i,a);switch(n.kind){case`Identifier`:ms(t,n,r,i,a);return;case`Apply`:if(vs.has(n.operator)&&n.args.length===2){_s(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(ss(W(n.args[0],o))){fs(t,n.args[1],r,i,a);return}ls(t,r,a);return}ms(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>gs(`Predicate`,t,i,e),r);fs(t,e[0],n,i,a);return}let o=e[e.length-1];fs(t,rs(n,e.length-1),gs(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>fs(t,e,r,i,a));return}fs(t,rs(n,e.length-1),r,i,a),fs(t,e[e.length-1],r,i,a);return}case`Exists`:ol(n.bounds,o,e=>(fs(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(ol(n.bounds,o,t=>(e.push(t),!1)),e.length===0){ls(t,r,a);return}let i=e.slice(1).reduce((e,t)=>gs(`Predicate`,n.body,t,e),r);fs(t,n.body,i,e[0],a);return}case`If`:fs(t,ss(W(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>ss(W(e.condition,o)))?.body??n.other;if(s===void 0)throw new e.g(`TLC encountered a CASE with no conditions true.`);fs(t,s,r,i,a);return}case`FunctionApplication`:{let e=dl(W(n.function,t.isInit?o:Hc(o)));if(e){fs(t,e.body,r,fl(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){xs(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){fs(t,n.action,r,i,a),xs(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){fs(t,n.action,gs(`Changed`,n.subscript,i,r),i,a);return}}ps(t,W(n,o),r,a)},xs=(e,t,n,r,i)=>Qo(e,t,()=>{let a=as(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&hs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){ls(e,n,i);return}let s=o.reduceRight((e,t)=>gs(`Unchanged`,t,r,e),n);xs(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Rc(r,t.name);if(a?.kind===`Thunk`){xs(e,a.expression,n,a.scope,i);return}let o=a?void 0:Dl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){xs(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});Ct(s,c)&&ls(e,n,i)}),Ss=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Cs=/* @__PURE__ */ Error(`The replay found a successor`),ws=(e,t,n,r)=>{let i=Ss(r,!1,n,()=>{throw Cs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=gs(`Changed`,e.subscript,t,void 0);fs(i,e.action,n,t,ts(r))}else fs(i,e,void 0,t,ts(r));return!1}catch(e){if(e!==Cs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Ts=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ss(t,!0,void 0,n),o=i.reduceRight((e,t)=>gs(`Predicate`,t.expression,t.scope,e),void 0);fs(a,r.expression,o,r.scope,ts(t))},Es=(e,t,n,r)=>{e.some(e=>ys.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ss(n,!1,t,e=>i.push(e));fs(a,e.expression,void 0,e.scope,ts(n)),i.forEach(t=>r(t,e))})},Ds=/* @__PURE__ */ new WeakMap,Os=/* @__PURE__ */ new WeakMap,ks=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},As=(e,t,n)=>{let r=e.slice();return r[t]=n,r},js=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Ms=(t,n)=>{let r=new e.g(n);return t.isInit?r:e.U(r,e.V.error)},Ns=(e,t,n,r)=>{let i=kc(n);return r&&ys.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${js(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},Ps=(e,t,n)=>{let r=pi(t),i=Oc(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${js(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
73
+ `:``}${i}`},Fs=(e,t,n,r=!0)=>Is(e,t,W(t,n),r),Is=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Ms(e,Ns(e,n,t,r))},Ls=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=bu(n,r.environment))(r),Rs=e=>e===`=`||e===`\\in`||e===`\\subseteq`,zs=(e,t,n)=>{let r=n?Ds:Os,i=r.get(e);if(i)return i;let a=fc(e,t,n);return r.set(e,a),a},Bs=(e,t)=>{if(t.constants.has(e))return;let n=Gc(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Vs=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Vs(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Bs(e.name,t);if(a&&!r.has(a))return r.add(a),Vs(a.body,t,n,r)},Hs=(e,t,n)=>Vs(e,t,!n),Us=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Us(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Ul(e.definitions,ks(r,t,n));return Us(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Rc(t,e.name);if(a?.kind===`Thunk`)return Us(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Bs(e.name,r.environment);if(s)return Us(s.body,void 0,n,r,i)},Ws=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,Gs=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Gs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=Bs(e.name,t);if(i)return n.add(e.name),Gs(i.body,t,n)},Ks=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),qs=(e,t,n)=>Ks.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Rs(e.operator)&&(Ws(e.args[0],n)||Hs(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Js=/* @__PURE__ */ new Set,Ys=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Eo(e,(e,i)=>{let a=r.isReadOnly?Ys(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Xs=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:Gc(r,t);return i&&!n.has(i)&&(n.add(i),Xs(i.body,t,n))?!0:Ur(e).some(e=>Xs(e,t,n))},Zs=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Hs(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=Gs(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return qs(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:zs(e,t,n)}},Qs=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(cd(e,t)===void 0||Xs(e,t,/* @__PURE__ */ new Set))return!0;let n=Ys(e,Js);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},$s=(e,t,n)=>{let r=e.map(e=>Zs(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=cs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&gc(u)){d??=ks(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Ls(a,e,n,d);if(!Is(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=ks(t,n,u);let r=Ls(i,s,e.expression,d);if(!Is(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=ks(t,n,u);let r=Ls(i,s,e.value,d),a=u[e.index];if(a===void 0)u=As(u,e.index,r),d=void 0;else if(!Ct(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=As(u,t,n[t]),d=void 0;else if(!Ct(e,n[t]))return}continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},ec=e=>(t,n,r,i,a,o)=>{Fs(t,e,ks(t,n,r))&&o(r,i)},tc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=ks(r,i,a);if(a[l]!==void 0){Fs(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Sn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${js(r)}, the right side of \\IN is not enumerable.`;throw Ms(r,`${t}\n${Oc(e)}`)}let p=Pn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(As(a,l,p[e]),o)}},nc=/* @__PURE__ */ new WeakMap,rc=e=>{let t=nc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(rc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return nc.set(e,n),n},ic=(e,t)=>{let n=e.args[0],r=ec(e),i=(e,r,i)=>Us(n,r,i,e,!t)??-1,a=tc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],ks(t,n,o));l(As(o,u,d),s)}},ac=(e,t,n)=>{let r=Oc(e);return(i,a,o,s,c,l)=>{let u=ks(i,a,o),d=W(e.function,n?u:Hc(u)),f=dl(d);if(f!==void 0){zs(f.body,t,n)(i,fl(f,e,u),o,s,c,l);return}if(!N(d))throw Ms(i,`In computing ${js(i)}, a non-function (${pi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Ms(i,`In computing ${js(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},oc=(e,t)=>{if(Gs(e,t))return $s([rc(e)],t,!1);if(e.kind===`Tuple`)return zs(rc(e),t,!1);let n=rc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Rc(i,e.name):void 0;l?.kind===`Thunk`?zs(rc(l.expression),t,!1)(r,l.scope,a,o,s,c):Fs(r,n,ks(r,i,a))&&c(a,o)}},sc=(e,t,n)=>{let r=e.operator,i=ec(e),a=B(e)?void 0:Dl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ou(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=zs(a.body,t,n),o.body(e,i(ks(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=ks(a,o,s),f=kl(e,d);f?.kind===`Closure`?zs(f.body,t,n)(a,Vl(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},cc=(e,t,n)=>{let r=ec(e),i=B(e)?void 0:Bs(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Rc(s,e.name);f?.kind===`Thunk`?zs(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=zs(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},lc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=Vs(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>lc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=Dl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=lc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},uc=(e,t,n)=>{let r=Rc(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},dc=(e,t,n)=>{let r=e.map(e=>zs(e,t,n)),i=n?[]:e.map(e=>lc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&uc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},fc=(t,n,r)=>{let i=e=>zs(e,n,r);switch(t.kind){case`And`:return $s(t.operands,n,r);case`Or`:return dc(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=$c(W(a.set,ks(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,zc(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Qs(t,n);if(o){let e=$s(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=ks(r,i,a),d=t.bounds.map(e=>$c(W(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=zc(n,o.names[t],e);if(t===d.length-1){let e=ks(r,i,a);if(!o.guards.every(t=>Fs(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{ol(t.bounds,ks(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&cd(t,n)!==void 0&&!Xs(t.body,n,/* @__PURE__ */ new Set)?Ys(t,Js):void 0;return(n,r,i,o,s,c)=>{let l=[];ol(t.bounds,ks(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Rc(r,e)?.kind===`Value`)){u.every(e=>Fs(n,t.body,ks(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&gc(i)?u.slice(r).every(e=>Fs(n,t.body,ks(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,ks(r,i,a));if(typeof l!=`boolean`)throw Ms(r,Ps(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=ks(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Ms(r,`In computing ${js(r)}, a non-boolean expression${r.isEnabled?``:` `}(${pi(t)}) was used as a guard condition of a CASE.\n${kc(e.source)}`)})?.body??n;if(!u)throw Ms(r,`In computing ${js(r)}, TLC encountered a CASE with no conditions true.\n${Oc(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=eu(t.definitions,n);return(n,i,a,o,s,c)=>e(n,Ul(t.definitions,ks(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.g(`UNCHANGED appears in an initial predicate at ${Ec(t)}`)}:oc(t.expression,n);case`AngleAction`:{let e=i(t.action),r=rc(t.subscript),a=(e,t,i)=>{try{return Fs(e,r,ks(e,t,i))}catch(t){throw e.isEnabled?nd(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,rc(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return cc(t,n,r);case`FunctionApplication`:return ac(t,n,r);case`Apply`:{let e=t.args;if(Rs(t.operator)){let i=Hs(e[0],n,r);if(i!==void 0)return t.operator===`=`?$s([t],n,r):tc(t,()=>i);if(Ws(e[0],r))return ic(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=W(e[0],ks(n,r,i));(typeof c==`boolean`?c:Wc(c,`the left side of => at ${Ec(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return sc(t,n,r)}default:return ec(t)}},pc=/* @__PURE__ */ new WeakMap,mc=e=>{let t=pc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return pc.set(e,n),n},hc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),gc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},_c=(t,n)=>{let r=n.state;if(!r||!gc(r))throw new e.g(`ENABLED needs a complete state at ${Ec(t)}`);let i=n.environment;if(i.callStack)return ws(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return zs(t,i,!1)(a,n.scope,mc(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},vc=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};zs(t,n,!0)(a,i,mc(n),void 0,!1,t=>{if(!a.isStopped){if(!gc(t))throw e.U(new e._([...t]),e.V.error);a.isStopped=r(t)}})},yc=(e,t,n)=>{let r=[];return vc(e,t,e=>(r.push(e),!1),n),r},bc=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return zs(t,r,!1)(o,a,mc(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!gc(t)){let i=hc(t,r);throw new e.v(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},xc=(e,t,n,r)=>{let i=[];return bc(e,t,n,e=>(i.push(e),!1),r),i},Sc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Cc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),wc=e=>Cc.has(e.kind)||e.kind===`Apply`&&Sc.has(e.operator),Tc=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&M(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ec=e=>`line ${e.location.line}, column ${e.location.column}`,Dc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Oc=e=>{let t=e.location.range;return t?Dc(t):Ec(e)},kc=e=>e.kind===`Number`?e.text??String(e.value):Oc(e),Ac=(t,n)=>new e.g(`A non-boolean expression (${pi(n)}) was used as the condition of an IF.\n${Oc(t)}`),jc=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.g(`A non-boolean expression (${pi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${kc(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.g(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${pi(r)}.\n${Oc({...t,location:{...t.location,range:{...i,end:a}}})}`)},Mc=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${z(e)}\n${Oc(t)}`,i=e=>`Attempted to apply function:\n${A(z(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!N(a))throw new e.g(`Attempted to select field "${n}" from a non-record value ${A(z(a))}\n${Oc(t)}`);let o=pt(a);if(o===`tuple`)throw ir(n);return sr(a,n,o===`record`?r:i)}},Nc=e=>e===`1.7.4`?(t,n)=>tr(t,n,e):void 0,Pc=t=>n=>{if(!N(n))throw new e.g(`Attempted to apply the operator DOMAIN to a non-function\n(${pi(n)})\n${Oc(t)}`);return lr(n)},Fc=(t,n)=>(r,i)=>{if(!j(r)||tt(r))throw new e.g(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Oc(t)}`);return n.evaluate([r,i])},Ic=t=>e.U(new e.g(`TLC can't handle real numbers: ${t.text} at ${Ec(t)}`),e.V.configParseError),Lc=t=>e.U(new e.g(`TLC can't handle a number this big: ${t.text??t.value} at ${Ec(t)}`),e.V.error),Rc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},zc=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Bc=(t,n,r)=>{if(n.kind===`Name`)return zc(t,n.name,r);let i=Gn(r);if(!i||i.length!==n.names.length)throw new e.g(`Cannot bind <<${n.names.join(`, `)}>> to ${z(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>zc(e,t,i[n]),t)},Vc=(t,n)=>{if(N(t))return t;throw new e.g(`A non-function (${pi(t)}) was applied as a function.\n${Oc(n)}`)},Hc=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Uc=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Wc=(t,n)=>{if(typeof t!=`boolean`)throw new e.g(`Expected ${n} to be a boolean but found ${z(t)}`);return t},Gc=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Kc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),qc=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),Jc=(e,t)=>{if(Kc.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&qc.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Gc(n,t);if(e&&!t.constants.has(n)&&!Yc(e,t))return!0}return Ur(e).some(e=>Jc(e,t))},Yc=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Jc(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Jc(e.set,t)));return t.constantLevels.set(e,r),r},Xc=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Zc=(t,n,r)=>{if(!j(t)||tt(t)){let i=z(t),a=r===`1.7.4`?void 0:Xc(t,i);throw new e.g(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${kc(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${kc(n)}\n${a}`)}},Qc=(e,t,n)=>(Zc(e,t,n),typeof e==`object`&&e.kind===`Interval`?gn(e):kn(e)??L(e).elements),$c=(e,t,n)=>n===`1.7.4`?(Zc(e,t,n),kn(e)??Pn(e)):Qc(e,t,n),el=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Vn(e),e},tl=(e,t,n)=>el(e)??$c(e,t,n),nl=(e,t,n)=>el(e)??Qc(e,t,n),rl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},il=(e,t)=>e.map(e=>tl(W(e.set,t),e.set,t.environment.runtime.version)),al=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):rl(t[n],t=>i(n-1,Bc(a,e[n].pattern,t)));return i(e.length-1,n)},ol=(e,t,n)=>al(e,il(e,t),t.scope,n),sl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},cl=(e,t,n)=>{if(e.length===1)return Bc(t,e[0].pattern,n);let r=Gn(n)??[];return e.reduce((e,t,n)=>Bc(e,t.pattern,r[n]),t)},ll=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,ul=e=>Object.assign(e.value,{lambda:e}),dl=e=>ll(e)?e.lambda:void 0,fl=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:bn(a),s=(e,t,r)=>`In applying the function\n${A(z(i))},\nthe ${e} is:\n${A(z(t))}${r}.\n${Oc(n.function)}`,c=t.bounds;if(c.length===1){if(!Yn(o,i.domain))throw new e.g(s(`first argument`,o,`which is not in its domain`));return cl(c,t.scope,o)}let l=Gn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e.g(`Attempted to apply a function to an argument not in its domain.\n${Oc(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!Yn(r,u[n]))throw new e.g(s(i,r,`${t.pattern.kind===`Name`?``:`
74
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Gn(r)?.length!==t.pattern.names.length)throw new e.g(s(i,r,`which does not match its formal parameter`))}),cl(c,t.scope,bn(l.slice(0,c.length)))},pl=/* @__PURE__ */ new WeakMap,ml=(e,t)=>{let n=pl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Dc(r)};return pl.set(t,i),i},hl=(e,t,n)=>{let r=ml(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},gl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Sr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Tt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},_l=/* @__PURE__ */ new WeakMap,vl=e=>{let t=_l.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return _l.set(e,n),n},yl=(e,t)=>{let n=sl(e.bounds,t),r=gl(n,(n,r)=>W(e.body,Uc(t,cl(e.bounds,zc(void 0,e.name,r),n))),hl(e.bounds,e.body,n));return ul({value:r,bounds:e.bounds,body:e.body,scope:zc(void 0,e.name,r)}),e.bounds.length===1?mt(r):r},bl=(t,n)=>{if(typeof n!=`object`||pt(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!M(n.domain))return n;try{let e=er(n);return ut(e.domain,e.range)}catch(t){if(t instanceof e.g)return n;throw t}},xl=(e,t)=>e.kind===`Function`?e.isSelfReferential?yl(e,t):W(vl(e),t):W(e.body,t),Sl=(t,n)=>{let r=Yc(t,n.environment),i=r?n.environment.definitionValues.get(t):void 0;if(i!==void 0)return i;if(t.kind===`Operator`&&t.params.length>0)throw new e.g(`Operator ${t.name} requires ${t.params.length} arguments`);let a=Uc(n,void 0);if(!r)return xl(t,a);let o=n.environment.runtime.evaluateAtStartup(()=>bl(t,xl(t,a)));return n.environment.definitionValues.set(t,o),o},Cl=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(!(n.constants.has(r)||n.substitutions.has(r))&&Yc(t,n))try{en(Sl(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof e.g)&&!e.B(t))throw t}}),wl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,Uc(t,e.scope));return n&&(!e.isStreamed||In(r))&&(e.cache=r),r},Tl=/* @__PURE__ */ new WeakMap,El=e=>{let t=Tl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Tl.set(e,n),n},Dl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Dl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?El(r):t.builtins.get(e)},Ol=/* @__PURE__ */ new WeakMap,kl=(e,t)=>{if(B(e))return Al(e.operator,t);let n=Ol.get(e),r=n===void 0?Dl(e.operator,t.environment)??null:n;return n===void 0&&Ol.set(e,r),r??Al(e.operator,t)},Al=(e,t)=>{let n=Rc(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Dl(e,t.environment)},jl=e=>e.kind===`Closure`?e.params.length:e.arity,Ml=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Al(r,n);if(!i)throw new e.g(`Expected an operator argument at ${Ec(t)}`);return i},Nl=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>zc(e,n.name,t[r]),e.scope);return W(e.body,Uc(n,r))},Pl=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:jl(e),call:n=>Nl(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Fl=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Al(e.name,t);return n!==void 0&&jl(n)>0},Il=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Ll=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return Ll(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},Rl=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Gl(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:Ll(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Rc(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Il(e,t)}}return t=>Il(e,t)},zl=/* @__PURE__ */ new WeakMap,Bl=(e,t)=>{let n=zl.get(e);if(n)return n;let r=Rl(e,t);return zl.set(e,r),r},Vl=(t,n,r,i)=>{if(n.length!==t.params.length)throw new e.g(`Operator ${t.name} expects ${t.params.length} arguments but received ${n.length}`);let a=t.scope;for(let e=0;e<n.length;e++){let o=t.params[e],s=o.arity>0?{kind:`Operator`,operator:Ml(n[e],r)}:(i?.[e]??Bl(n[e],r.environment))(r);a={name:o.name,binding:s,parent:a}}return a},Hl=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=Uc(n,Vl(e,t,n,i));return n.environment.callStack?W(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:bu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Eu(t,n),n):e.evaluate(t.map(e=>Fl(e,n)?Pl(Ml(e,n),n):W(e,n)),n)},Ul=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Wl=(t,n,r)=>{let i=Rc(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return wl(i,r);if(i?.kind===`Operator`){if(jl(i.operator)===0)return Nl(i.operator,[],r);throw new e.g(`Operator ${t} is used without arguments`)}let a=Ll(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw td(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Sl(a.definition,r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.g(`Unknown identifier ${t} at ${Ec(n)}`)},Gl=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Kl=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ql=(e,t)=>Kl.has(e)||t.builtins.get(e)?.isStateLevel===!0,Jl={builtins:Kl,definitions:/* @__PURE__ */ new WeakMap},Yl={builtins:new Set([...Kl].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Xl=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Yc(e,t),Zl=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=Gc(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Xl(e,t)&&Ql(e,t,n))return!0}return Ur(e).some(e=>Zl(e,t,n))},Ql=(e,t,n=Jl)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Zl(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Zl(e.set,t,n));return n.definitions.set(e,i),i},$l={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},eu=(e,t)=>({impure:new Set(e.filter(e=>Ql(e,t))),streamed:new Set(e.filter(e=>Ql(e,t,$l)))}),tu=e=>[...e.definitions.values()].some(t=>Ql(t,e)),nu=e=>[...e.definitions.values()].some(t=>Ql(t,e,Yl)),ru=/* @__PURE__ */ new WeakMap,iu=(e,t)=>{let n=ru.get(e);if(n!==void 0)return n;let r=cu(e,t,ou);return ru.set(e,r),r},au=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),ou=/* @__PURE__ */ new Set,su=(e,t,n)=>n.size===0?iu(e,t):cu(e,t,n),cu=(e,t,n)=>{if(!au.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=Ll(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Xl(n.definition,t)}if(e.kind===`Apply`){if(ql(e.operator,t)||$l.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Dl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Gc(e.operator,t);if(!n||!Yc(n,t)||Ql(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&su(e,t,n))}let r={value:!0};return Eo(e,(e,i)=>(r.value&&=su(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},lu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,uu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},du=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return Eo(e,(e,r)=>(n.value||=du(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},fu=(e,t)=>vo.has(e)&&lu(e)&&cd(e,t)!==void 0&&!du(e,ou),pu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,mu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=qn.sets,o=qn.callStack,s=a??[],c=s.length;qn.sets=s,qn.callStack=r;try{let a=t(i),o=pu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&wc(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Tc(e,r.values),a=i&&!Ur(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!N(a)?void 0:a;throw hu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,qn.sets=a,qn.callStack=o}},hu=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.g){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},gu=(t,n,r)=>{if(!(r instanceof e.g))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},_u=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),vu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=ad(e,t),i=t.callStack,a=i?mu(e,r,t,i):lu(e)&&iu(e,t)?uu(r):fu(e,t)?Cu(r):r;return t.evaluators.set(e,a),a},yu=/* @__PURE__ */ new WeakMap,bu=(e,t)=>{if(t.callStack)return vu(e,t);let n=yu.get(e);if(n)return n;let r=(lu(e)&&iu(e,t)?void 0:Fi(e,t))??vu(e,t);return yu.set(e,r),r},W=(e,t)=>bu(e,t.environment)(t),xu=(e,t)=>{let n=e.name,r=B(e)?void 0:Ll(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw td(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&Yc(e,t))return t=>Sl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=bu(e.body,t),n.body(Uc(r,void 0)));return Su(e,t)?Cu(r):r}return t=>Sl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Sl(e,t);return Yc(e,t)||!Su(e,t)?n:Cu(n)}return t=>Wl(n,e,t)},Su=(e,t)=>cd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>cd(e.set,t)!==void 0)),Cu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},wu=(e,t)=>{let n=Dl(e,t);return n!==void 0&&jl(n)>0},Tu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&wu(e.name,t)),Eu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Du=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Eu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Tu(t[0],n)){let e=vu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Tu(t[0],n)&&Tu(t[1],n);if(i&&a){let e=vu(t[0],n),r=vu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Fl(e,n)?Pl(Ml(e,n),n):W(e,n)),n)},Ou=(t,n,r)=>{if(n.length!==t.params.length)return()=>{throw new e.g(`Operator ${t.name} expects ${t.params.length} arguments but received ${n.length}`)};let i=t.params,a=n.map((e,t)=>i[t].arity>0?void 0:Bl(e,r));return e=>{let r=t.scope;for(let t=0;t<n.length;t++){let o=a[t],s=o?o(e):{kind:`Operator`,operator:Ml(n[t],e)};r={name:i[t].name,binding:s,parent:r}}return r}},ku=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),Au=/* @__PURE__ */ new WeakMap,ju=e=>{let t=Au.get(e);if(t)return t;let n={constant:ku(),state:ku()};return Au.set(e,n),n},Mu=e=>e.kind===`ExceptAt`||Ur(e).some(Mu),Nu=/* @__PURE__ */ new WeakMap,Pu=(e,t)=>{let n=Nu.get(e);if(n!==void 0)return n;let r=cd(e,t)!==void 0&&Ys(e,ou),i=r&&[...new Set(Mu(e)?[...r,`@`]:r)];return Nu.set(e,i??!1),i??!1},Fu=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,Iu={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},Lu=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Sr(e),Ru=e=>Fu(e)?(Iu.sources[Iu.sourceCount++]=void 0,Iu.args[Iu.argCount++]=e,Iu.hash=pr(Iu.hash,Lu(e)),!0):!1,zu=(e,t,n)=>{if(!t)return!1;Iu.sources[Iu.sourceCount++]=e,Iu.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=Rc(n,t[e]);if(r?.kind!==`Value`||!Fu(r.value))return!1;Iu.args[Iu.argCount++]=r.value,Iu.hash=pr(Iu.hash,Lu(r.value))}return!0},Bu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Gl(e.value))return()=>Ru(e.value);if(e.kind===`Identifier`){let n=B(e)?void 0:Ll(e.name,t);if(n?.kind===`Value`)return()=>Ru(n.value);if(n===void 0)return n=>{let r=Rc(n.scope,e.name);return r?.kind===`Value`?Ru(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:zu(r.expression,Pu(r.expression,t),r.scope)}}let n=Pu(e,t);return t=>zu(e,n,t.scope)},Vu=e=>{if(e.args.length!==Iu.argCount||e.sources.length!==Iu.sourceCount)return!1;for(let t=0;t<Iu.sourceCount;t++)if(e.sources[t]!==Iu.sources[t])return!1;for(let t=0;t<Iu.argCount;t++)if(!Tt(e.args[t],Iu.args[t]))return!1;return!0},Hu=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(Vu(e[t]))return e[t]}},Uu=(e,t)=>{let n=Gc(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!Ql(n,t))return Yc(n,t)?`constant`:Su(n,t)?`state`:void 0},Wu=(e,t,n,r)=>{let i=Ou(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=bu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=ju(e),c=t.map(e=>Bu(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);Iu.sourceCount=0,Iu.argCount=0,Iu.hash=t.length,Iu.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||Iu.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=Iu.hash&1073741823,d=a.calls.get(u),f=Hu(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=Iu.sources.slice(0,Iu.sourceCount),m=Iu.args.slice(0,Iu.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},Gu=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=vu(r[0],n),t=vu(r[1],n);return n=>!Wc(e(n),`the left side of =>`)||Wc(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e.g(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=B(t)?void 0:Dl(t.operator,n);if(i?.kind===`Closure`){let e=n.callStack?void 0:Uu(t,n);return Wu(i,r,n,e)}if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=vu(r[0],n),i=Pc(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=vu(r[0],n);return yo.has(t)||Jc(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=vu(r[0],n),a=vu(r[1],n),o=Fc(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Du(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.g(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a={entry:void 0},o=r.map(e=>Bl(e,n));return i=>{let s=Al(t.operator,i);if(s)return Hl(s,r,i,a,o);throw n.definitions.get(t.operator)?.kind===`Function`?new e.g(`${t.operator} is a function; apply it with brackets`):new e.g(`Unknown operator ${t.operator} at ${Ec(t)}`)}},Ku=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=vu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=vu(a.set,t);return s=>rl(tl(o(s),a.set,t.runtime.version),t=>Wc(i(Uc(s,zc(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>vu(e.set,t));return s=>{let c=a.map((e,n)=>tl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Wc(i(Uc(s,a)),r)!==n:rl(c[t],n=>l(t-1,zc(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>ol(o,e,t=>Wc(i(Uc(e,t)),r)!==n)?!n:n},qu=(e,t)=>{if(e.kind===`Tuple`)return bn(e.names.map(e=>{let n=Rc(t,e);return n?.kind===`Value`&&n.value}));let n=Rc(t,e.name);return n?.kind===`Value`?n.value:void 0},Ju=/* @__PURE__ */ new WeakSet,Yu=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ju.add(e)},Xu=(t,n)=>{let r=Ju.has(t),i=vu(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=vu(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=vn(e),a=ut(r,r.map(e=>i(Uc(t,zc(t.scope,n,e)))));return M(e)?a:mt(a)}let n=[],r=a.map(e=>nl(W(e.set,t),e.set,t.environment.runtime.version));return al(a,r,t.scope,e=>{let r=a.length===1?qu(o.pattern,e)??!1:bn(a.map(t=>qu(t.pattern,e)??!1));return n.push([r,i(Uc(t,e))]),!1}),un(n)},u=(e,n)=>{let r=ul({value:gl(e,e=>i(Uc(n,cl(a,n.scope,e))),hl(a,t.body,e)),bounds:a,body:t.body,scope:n.scope});return a.length===1?mt(r):r},d=n.callStack;return n=>{let i=s?c(n):sl(a,n);if(t.isRecursive||r||n.isKeepLazy||!I(i))return u(i,n);if(!M(i)){if(d)return u(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e.g))throw t;return u(i,n)}}if(!d)return l(i,n);try{return l(i,n)}catch(e){throw gu(d,t,e),e}}},Zu=(e,t)=>{let n=Ju.has(e);n&&Yu(e.function);let r=vu(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>vu(e,t))}),value:vu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):bn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Uc(i,zc(i.scope,`@`,e))):ur(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Ii.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Oc(e.function)}`)}return n}},Qu=(t,n)=>{if(t.kind===`SetFilter`){let e=vu(t.predicate,n),r=vu(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Dc(a)},s=(e,t)=>n=>Wc(e(Uc(t,Bc(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},vu(t.predicate,r))});return t=>{let n=r(t);return M(n)?lt(L(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=vu(t.expression,n);return n=>{let r=[];return ol(t.bounds,n,t=>(r.push(e(Uc(n,t))),!1)),an(r)}}let r=t.set;if(!r)return()=>{throw new e.g(`TLC cannot evaluate an unbounded CHOOSE at ${Ec(t)}`)};let i=vu(t.body,n),a=vu(r,n);return n=>{let o=a(n);if(!j(o)||tt(o))throw new e.g(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Oc(t)}`);let s={value:void 0},c=nl(o,r,n.environment.runtime.version);if(rl(c,e=>{let r=Bc(n.scope,t.pattern,e);return Wc(i(Uc(n,r)),`the body of CHOOSE`)?(s.value=qu(t.pattern,r),!0):!1}),s.value===void 0)throw new e.g(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Oc(t)}`);return s.value}},$u=e=>[...e].sort((e,t)=>ot(e.name,t.name)),ed=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),td=(t,n)=>new e.O(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Oc(n)}`,t),nd=(t,n)=>t instanceof e.O&&n!==`1.7.4`?new e.g(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,rd=t=>new e.g(`A primed expression appears outside an action at ${Ec(t)}`),id=(e,t)=>{let n=$u(e),r=ed(n),i=n.map(e=>vu(e.value,t));if(r)return e=>xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Be(a,i.map(t=>t(e)),o):e=>St(a,i.map(t=>t(e)))},ad=(t,n)=>{let r=e=>vu(e,n);switch(t.kind){case`Number`:{let e=t.value;return Gl(e)?()=>e:()=>{throw Lc(t)}}case`Decimal`:return()=>{throw Ic(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return xu(t,n);case`Apply`:return Gu(t,n);case`Bracket`:return()=>{throw new e.g(`A bracket without a function or subscript is not an expression at ${Ec(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.g(`An operator cannot be used as a value at ${Ec(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw jc(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw jc(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw rd(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>Ct(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Ac(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.g(`A non-boolean expression (${pi(n)}) was used as a condition of a CASE. ${kc(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.g(`Attempted to evaluate a CASE with no conditions true.\n${Oc(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Uc(n,Ul(t.definitions,n)))}case`Forall`:case`Exists`:return Ku(t,n);case`UnboundedQuantifier`:return()=>{throw new e.g(`TLC cannot evaluate an unbounded quantifier at ${Ec(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Qu(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>an(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>bn(e.map(e=>e(t)))}case`FunctionConstruction`:return Xu(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return id(t.fields,n);case`RecordSet`:{let e=$u(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return Zu(t,n);case`ExceptAt`:return n=>{let r=Rc(n.scope,`@`);if(r?.kind!==`Value`)throw new e.g(`@ appears outside an EXCEPT at ${Ec(t)}`);return r.value};case`FunctionApplication`:{Yu(t.function);let e=r(t.function),i=n=>Vc(e(Hc(n)),t),a=t.args.map(r),o=Nc(n.runtime.version);if(a.length===1){let e=a[0];return t=>sr(i(t),e(t),o)}return e=>sr(i(e),bn(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Mc(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?Wc(e(t),`an action`)||n(t):Wc(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>_c(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.g(`The subexpression reference at ${Ec(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e.g(`TLC cannot evaluate a temporal formula in a state at ${Ec(t)}`)}}},od=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),sd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},cd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(od.has(e.kind))return!1;let a=sd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&ql(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Ur(e).every(i)};return i(e)?[...n]:void 0},ld=`-------------------------------- MODULE Reals -------------------------------
81
75
  (***************************************************************************)
82
76
  (* This module provides dummy definitions of the operators that are *)
83
77
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -94,7 +88,7 @@ EXTENDS Integers
94
88
  Real == "Reals"
95
89
  a / b == CHOOSE m \\in Real : m * b = a
96
90
  Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
97
- =============================================================================`,Ed=`----------------------------- MODULE RealTime -------------------------------
91
+ =============================================================================`,ud=`----------------------------- MODULE RealTime -------------------------------
98
92
  (***************************************************************************)
99
93
  (* This standard module is described in Chapter 9 of the book "Specifying *)
100
94
  (* Systems". The type of specification described there cannot be handled *)
@@ -120,7 +114,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
120
114
  IN /\\ now \\in Real
121
115
  /\\ [][NowNext]_now
122
116
  /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
123
- =============================================================================`,Dd=`----------------------------- MODULE Toolbox --------------------------------
117
+ =============================================================================`,dd=`----------------------------- MODULE Toolbox --------------------------------
124
118
  (***************************************************************************)
125
119
  (* *)
126
120
  (***************************************************************************)
@@ -146,7 +140,7 @@ _TEPosition ==
146
140
  THEN _TETraceLength
147
141
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
148
142
 
149
- =============================================================================`,Od=/* @__PURE__ */ new Map([[`Reals`,Td],[`RealTime`,Ed],[`Toolbox`,Dd]]),kd=`tlc2/value/impl/`,Ad=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},jd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Md=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Nd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??jd.get(e[3])}${`[]`.repeat(e[1].length)}`),Pd=(e,t)=>e[e[t].first].text,Fd=(e,t)=>Pd(e,t).replaceAll(`/`,`.`),Id=e=>{let t=Ad(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Fd(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=Nd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Ad(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Fd(n,d.readUint16())):[],p=Md.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Nd(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Ld=(e,t)=>{let n=e[t],r=e[n.second];return{className:Pd(e,n.first),name:e[r.first].text}},Rd=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Ld(t,l());if(n.className!==`${kd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=Ld(t,l()),a=s();if(n.className!==`${kd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Pd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Ld(t,l()),a=s(),o=s();if(!(n.className===`${kd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},zd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Id(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Rd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Bd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Vd=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Hd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Ud=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Wd=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Gd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Kd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
143
+ =============================================================================`,fd=/* @__PURE__ */ new Map([[`Reals`,ld],[`RealTime`,ud],[`Toolbox`,dd]]),pd=`tlc2/value/impl/`,md=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},hd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),gd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],_d=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??hd.get(e[3])}${`[]`.repeat(e[1].length)}`),vd=(e,t)=>e[e[t].first].text,yd=(e,t)=>vd(e,t).replaceAll(`/`,`.`),bd=t=>{let n=md(t);if(n.readUint32()!==3405691582)throw new e.D(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===1?i.text=a.decode(n.readBytes(n.readUint16())):t===3?i.value=n.readInt32():t===4?n.readUint32():t===5||t===6?(n.readBytes(8),e++):t===7||t===8||t===16||t===19||t===20?i.first=n.readUint16():t===15?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=yd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=_d(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:md(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>yd(r,d.readUint16())):[],p=gd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=_d(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},xd=(e,t)=>{let n=e[t],r=e[n.second];return{className:vd(e,n.first),name:e[r.first].text}},Sd=(t,n,r,i)=>{let a=()=>new e.k(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===3)return t.value;if(t.tag===8)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=2&&t<=8)s.push(t-3),e+=1;else if(t===16)s.push(o[e+1]<<24>>24),e+=2;else if(t===17)s.push(r()<<16>>16),e+=3;else if(t===18)s.push(l(o[e+1])),e+=2;else if(t===19)s.push(l(r())),e+=3;else if(t===89){let t=c();s.push(t,t),e+=1}else if(t===178){let t=xd(n,r());if(t.className!==`${pd}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===184){let t=xd(n,r()),o=c();if(t.className!==`${pd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===187)s.push({className:vd(n,r()),value:void 0}),e+=3;else if(t===183){let t=xd(n,r()),o=c(),s=c();if(!(t.className===`${pd}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===176){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},Cd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=bd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Sd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},wd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Td=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Ed=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Dd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Od=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),kd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Ad=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
150
144
  Nat == { }
151
145
  a+b == {a, b}
152
146
  a-b == CHOOSE n : b + n = a
@@ -462,9 +456,9 @@ _CheckName(name) ==
462
456
  => (PrintT(counts) /\\ FALSE)
463
457
  _PrintCounts == PrintT(_Counts)
464
458
  =============================================================================
465
- `]]),qd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Jd=A(`EOF`),Yd=A(`IDENTIFIER`),Xd=A(`DEFBREAK`),Zd=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Qd=new Set(Zd(`op_57`,`op_119`)),$d=new Set(Zd(`op_1`,`op_119`)),ef=new Set(Zd(`op_57`,`op_70`)),tf=/* @__PURE__ */ new Set([...Zd(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Zd(`IF`,`SF`),A(`STATE`),...Zd(`THEN`,`WITH`),A(`US`),...Zd(`op_112`,`op_116`)]),nf=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),rf=new Map([...nf(`postfix`,160,160,!0,`[`),...nf(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...nf(`prefix`,120,120,!1,`-.`),...nf(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...nf(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...nf(`prefix`,40,40,!0,`\\lnot`),...nf(`nfix`,100,130,!0,`\\times`),...nf(`infix`,140,140,!1,`^`,`^^`),...nf(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...nf(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...nf(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...nf(`infix`,100,110,!0,`|`,`||`,`%%`),...nf(`infix`,100,110,!1,`%`),...nf(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...nf(`infix`,90,140,!1,`\\wr`),...nf(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...nf(`infix`,90,130,!1,`!!`),...nf(`infix`,90,90,!1,`...`,`..`),...nf(`infix`,80,80,!0,`\\intersect`,`\\union`),...nf(`infix`,80,80,!1,`\\`),...nf(`infix`,70,70,!1,`<:`,`:>`),...nf(`infix`,60,60,!0,`@@`),...nf(`infix`,50,140,!0,`\\cdot`),...nf(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...nf(`infix`,30,30,!0,`\\land`,`\\lor`),...nf(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...nf(`infix`,10,10,!1,`=>`)]),af=new Map([...rf,...Vd.flatMap(e=>e.slice(1).map(t=>[t,rf.get(e[0])]))]),of=af.get(`[`),sf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},cf=e=>({type:`tokens`,kinds:new Set(e)}),lf=e=>typeof e==`string`?e.startsWith(`<`)?cf([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(lf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),uf=e=>(...t)=>({type:e,body:G(...t)}),q=uf(`zeroOrMore`),df=uf(`oneOrMore`),J=uf(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),ff=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),pf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=ff(e,n);return n},mf=(...e)=>{let t=e.map(A);return e=>t.includes(pf(e,1).kind)},hf=(e,t=pf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},gf=e=>{let t=pf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},_f=e=>mf(`CASESEP`)(e)&&hf(e),vf=e=>{let t=pf(e,1);tf.has(t.kind)&&(t.kind=Yd)},yf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,bf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),xf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Sf=e=>e.operatorStacks[e.operatorStacks.length-1],Cf=(e,t)=>e.low>t.high,wf=(e,t)=>e.high<t.low,Tf=e=>e.fix===`prefix`?e:af.get(`${e.name}.`),Ef=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===of?bf(`FcnAppl`,[n,...r.node.heirs]):bf(`PostfixExpr`,[n,r.node]),operator:void 0})},Df=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:bf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:bf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Of=e=>{let t=Sf(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Ef(t,n),Of(e);if(i.operator!==void 0){let t=Tf(r.operator);return t!==void 0&&Cf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${yf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${yf(e,a.node.first,a.node.last)} and expression at location ${yf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return wf(a.operator,r.operator)?void 0:Cf(a.operator,r.operator)?(Df(t,a.operator),Of(e)):`Precedence conflict between ops ${a.operator.name} in block ${yf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Tf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(wf(s,r.operator))return;if(!Cf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${yf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Df(t,s),Of(e);let c=yf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===sf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},kf=e=>Y(t=>{let n=Sf(t),r=xf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Of(t)}),Af=kf(()=>!1),jf=kf(()=>!0),Mf=Y(e=>{e.lastOperator=af.get(e.token.image)}),Nf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Pf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Nf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Ff=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!hf(e,n.first.beginColumn))return n;let t=Ff(e,n);if(t!==void 0)return t}},If=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Qd.has(e.kind),i=e.token,a=ff(e,i);i.next=void 0;let o=ff(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Yd&&(e=e.next)}else if(e.kind===Yd){let t=e.next;!r(t)||ef.has(t.kind)||$d.has(t.kind)&&t.next?.kind!==Yd||(e=t.next?.kind===A(`SUBSTITUTE`)?i:$d.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Xd&&(e.next={kind:Xd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=ff(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Lf=e=>{let t=pf(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=ff(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Jd)return!1;return ff(e,t).kind===A(`IN`)}if(t.kind!==Yd)return!1;for(t=ff(e,t);t.kind===A(`COMMA`);){if(t=ff(e,t),t.kind!==Yd)return!1;t=ff(e,t)}return t.kind===A(`IN`)},Rf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),zf=e=>e.proofLevels.at(-1)??-1,Bf=e=>{let t=pf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:mf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||zf(e)>=0&&Rf(t)>zf(e):mf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Vf=(e,t)=>{let n=Rf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Hf=e=>Y(t=>Vf(t,t.token)?void 0:`${yf(t,t.token)}: ${e}`),Uf=cf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),Wf=cf([...Uf.kinds,A(`op_76`)]),Gf=cf($d),Kf=cf(ef),qf=cf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),Jf=()=>q(Z({expansion:[K(Uf,`<op_77>`)],semantic:hf}),K(`PrefixOp`,`InfixOp`),jf),Yf=()=>K(G(Z({expansion:[`OpenStart`],semantic:hf}),`OpenExpression`,Af),G(Z({semantic:hf}),`ExtendableExpr`)),Xf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Zf=()=>K(G(Z({semantic:e=>mf(`ASSUME`,`BOXASSUME`)(e)||pf(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(pf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Qf=()=>[`JuncItem`,q(Z({semantic:gf}),`JuncItem`)],$f=e=>Y(t=>{t.expecting=e,vf(t)}),ep=e=>Y(t=>{t.isTerminalProof=e}),tp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{If(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),np={CompilationUnit:Q(void 0,[Y(If),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),$f(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,$f(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,$f(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(If)),G(Z({semantic:e=>mf(`USE`)(e)&&pf(e,2).kind!==A(`ONLY`)||mf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,Kf]}),`PostfixLHS`,`Expression`),tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,Gf]}),`InfixLHS`,`Expression`),tp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),tp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Wf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Gf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Kf]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,$f(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Uf,Mf]),NonExpPrefixOp:Q(void 0,[Wf,Mf]),InfixOp:Q(`Infix Op`,[Gf,Mf]),PostfixOp:Q(void 0,[Kf,Mf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{If(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Zf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Zf(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=xf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${yf(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(If),K(G(Z({amount:3}),Z({semantic:mf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Bf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>mf(`BY`)(e)||pf(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>pf(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,ep(!0),J(`<ONLY>`)),G(`<USE>`,ep(!1),J(`<ONLY>`)),G(`<HIDE>`,ep(!1))),X("an expression, `MODULE' or `DEF'"),J(Xf(),q(`<COMMA>`,X(`MODULE or expression`),Xf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Xf(),q(`<COMMA>`,X(`MODULE or expression`),Xf(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),qf,Hf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Bf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),qf,Hf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:mf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:mf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:mf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Bf}),Y(e=>{let t=xf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${yf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),df(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:mf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Wf,Gf,Kf),cf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:hf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${yf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:hf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Lf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),df(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=xf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),df(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Lf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>pf(e,2).kind===A(`MAPTO`)&&tf.has(pf(e,1).kind)}),Y(e=>{pf(e,1).kind=Yd}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=bf(`FcnAppl`,t.heirs),e.lastOperator=of})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,df(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(vf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>_f(e)&&pf(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:_f}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[df(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=pf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Qf()),G(Z({expansion:[`<AND>`]}),...Qf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Ff(t,e.heirs[1]);return n&&`Item at ${yf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${yf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Jf(),Yf()],(e,t)=>{let n=Sf(t);n.push({node:e.heirs[0],operator:sf});let r=Of(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Af,q(K(G(Z({expansion:[`PostfixOp`],semantic:hf}),`PostfixOp`,jf),G(Z({expansion:[`<DOT>`],semantic:hf}),`<DOT>`,Y(vf),Z({semantic:hf}),`Identifier`,Y(e=>{let t=Sf(e);t[t.length-1].operator!==void 0&&Ef(t,t.length),t[t.length-1]={node:bf(`RecordComponent`,[t[t.length-1].node,xf(e,2),xf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:hf}),X(`function argument`),`SBracketCases`,kf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:hf}),`InfixOp`,jf,Jf(),Yf()),G(Z({expansion:[`<COLONCOLON>`],semantic:hf}),`<COLONCOLON>`,Y(e=>{let t=Sf(e);if(!Pf(t[t.length-1].node))return`\`::' at ${yf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Sf(e),n=xf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!wf(r,e.lastOperator)){let t=xf(e,3);return`Removing label at ${yf(e,t.first,t.last)} would change expression parsing.`}t.push({node:bf(`Label`,[xf(e,3),xf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:hf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:hf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>zf(e)<0&&e.proofLevels.length<=1?`${yf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${yf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Nf(e.heirs)===void 0?e.heirs.length===1?bf(`GeneralId`,e.heirs):void 0:bf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>pf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>pf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${yf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},rp=/* @__PURE__ */ new Map,ip=e=>{let t=rp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ip(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,ip(np[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return rp.set(e,n),n},ap=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},op=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=ff(e,e.scanPosition)),e.scanPosition=ff(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},sp=(e,t)=>{if(t.type===`tokens`)return op(e,t.kinds);if(t.type===`call`)return sp(e,np[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||ap(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=sp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||ap(e,t.semantic)?sp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=sp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=sp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},cp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=sp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},lp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||ip(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ip(a).hasSemanticStart?ip(a).first.has(pf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):cp(e,i,a)&&(o===void 0||o(e))}),up=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,sp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=ff(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Jd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=ff(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},dp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??up(e)}\n\nResidual stack trace follows:\n${r}`,!1},fp=(e,t)=>{let n=ff(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,dp(e))},pp=(e,t)=>{let n=np[t];n.message!==void 0&&(e.messages.push({name:n.message,token:pf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!mp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return dp(e,i);let a=r.node??(r.heirs.length===0?void 0:bf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},mp=(e,t)=>{if(t.type===`tokens`)return fp(e,t.kinds);if(t.type===`call`)return pp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||dp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||dp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||mp(e,t));if(t.type===`choice`){let n=lp(e,t.alternatives);return n===-1?dp(e):mp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!mp(e,t.body))return!1;if(t.type===`optional`)return lp(e,[t.body])===-1||mp(e,t.body);for(;lp(e,[t.body])===0;)if(!mp(e,t.body))return!1;return!0},hp=e=>{let t=Ge(e),n={kind:Jd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=mp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},gp={low:15,high:15},_p={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),vp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),yp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),bp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),xp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Sp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Cp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),wp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...yp]),Tp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?vp.has(e.operator):yp.has(e.operator)),Ep=e=>vp.has(e)||yp.has(e)||e===`-.`,Dp=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},Op=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),kp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Ap=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),jp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Mp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Np=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Pp=/* @__PURE__ */ new Set([``,`*`,`-`]),Fp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Ip=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Lp=/* @__PURE__ */ new Set([`NEW`,...Ip.keys()]),Rp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),zp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Bp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Vp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
- `)}\n`},Hp=(e,t)=>{let n=t===`tlapm`,r=n?Ce(e):Ce(e).map(xe),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Bp.has(e.text)),re=e=>{let t=r.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Np.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(xp.has(e.text)||vp.has(e.text)||yp.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ye=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),be=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Se=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,yp.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&kp.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(vp.has(e.text)||bp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(bp.has(e.text)||wp.has(e.text)&&e.text!==`'`&&!yp.has(e.text)||Cp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&wp.has(e.text)&&we(e)){i.index++;let t=f(e);if(yp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Dp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=ye();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:be(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=ye();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:be(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=ye();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Op.has(e.text)||e.kind===`Operator`&&(vp.has(e.text)||yp.has(e.text)||bp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&Tp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Ep(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Ep(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=be(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||yp.has(o.text)?gp.high:vp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=gp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(yp.has(n.text)&&e<=15){T(),a.last=gp,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=_p,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=vp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&vp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&xp.has(t.text),o=t.kind===`Identifier`&&yp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>ye());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Rp.has(e.text)&&t.value++,e.kind===`Operator`&&zp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&yp.has(t.text)?w(`==`,2):t.kind===`Operator`&&vp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&xp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Pp.has($e(e)),tt=e=>{let t=$e(e);if(Pp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return jp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},M=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Bp.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Fp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!Sp.has(t.text)&&Ep(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(n)return O(ut);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},N=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?dt():[]}),ft=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...N(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!it(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
467
- the name of a theorem, assumption, or step.`})));return y(o,e)},P=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?Ip.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},F=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(F):x().kind===`Keyword`&&Lp.has(x().text)?P():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},pt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},mt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},ht=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ft();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?ye():[];return mt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=pt(`:`),t=ue(e?O(le):[]),n=e?[]:ye();return mt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?F():j()}},gt=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},_t=()=>{let e=i.index,t=gt(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:ht(),o=v(e),s=v(n),l=nt(x());if(l&&!Mp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?yt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},vt=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...N(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[_t()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(_t());return{kind:`Steps`,level:Ze(),steps:n,location:e}},yt=()=>{let e=i.index;Xe.push(-1);let t=ct(vt);return Xe.pop(),y(t,e)},bt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},xt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?F():j(),proof:nt(x())?yt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&bt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},St=()=>{let e=i.index;return y(Ct(),e)},Ct=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},wt=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=St();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&bt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=ft();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Tt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Tt(n,y(Ue(void 0,[],!0,f(r)),t));continue}Tt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Ap.has(r.text)?xt(n):Tt(n,Be(!1))}}},Tt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Et=wt(),Dt=fe.isUsed?hp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},Up=e=>Hp(e,`tlc`),Wp=e=>Hp(e,`tlapm`),Gp=e=>Hp(e,`sany`),Kp=25214903917n,qp=(1n<<48n)-1n,Jp=2147483647,Yp=e=>{let t={value:(BigInt.asUintN(64,e)^Kp)&qp},n=e=>(t.value=t.value*Kp+11n&qp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Kp)&qp},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Jp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Xp=10454148508367108822n,Zp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Xp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Qp=Int32Array.from(Zp,e=>Number(BigInt.asIntN(32,e>>32n))),$p=Int32Array.from(Zp,e=>Number(BigInt.asIntN(32,e))),em=Number(BigInt.asIntN(32,Xp>>32n)),tm=Number(BigInt.asIntN(32,Xp));let nm=em,rm=tm;const im=e=>{let t=(e^rm)&255;rm=(rm>>>8|nm<<24)^$p[t],nm=nm>>>8^Qp[t]},am=e=>{for(let t=0;t<32;t+=8)im(e>>>t)},om=e=>{if(typeof e==`boolean`)im(0),im(e?116:102);else if(typeof e==`number`)im(1),am(e);else if(typeof e==`string`){im(3),am(e.length);for(let t=0;t<e.length;t++)im(e.charCodeAt(t))}else if(F(e))im(21),am(Mt(e.name)+1);else if(P(e)){let t=Ar(e);im(9),am(t.domain.length);for(let e=0;e<t.domain.length;e++)om(t.domain[e]),om(t.range[e])}else{let t=L(e).elements;im(5),am(t.length);for(let e of t)om(e)}},sm=e=>{let t={high:nm,low:rm};nm=em,rm=tm;for(let t of e)om(t);let n=BigInt(nm>>>0)<<32n|BigInt(rm>>>0);return nm=t.high,rm=t.low,n},cm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||F(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=Ar(e);return t.domain.reduce((e,n,r)=>e+cm(n)+cm(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+cm(t),5)},lm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){nm=n<32?0:1<<n-32,rm=n<32?1<<n:0;for(let t=0;t<e;t++)im(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^nm,t[n+1]=t[a+1]^rm}}return t},um=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=cm(e);return nm=0,rm=0,om(e),r.set(e,i.length),i.push(n,nm,rm),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=lm(e);return n.set(e,r),r};return(n,r)=>{let s={high:nm,low:rm},c={high:em,low:tm};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}nm=s.high,rm=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},dm=[],fm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},pm=()=>{for(let e=1277011;dm.length<1341;e++)fm(e)&&dm.push(e);return dm},mm=e=>{let t=pm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},hm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},gm=e=>{for(let t=Math.max(e,9);;t++){let e=hm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},_m=(e,t,n)=>{if(t<=0)return[];let r=gm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(mm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},vm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Jp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},ym=(1n<<63n)-1n-24n,bm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(ym*BigInt(n)+i)%t;return r<0n?r+t:r})},xm=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Sm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Zn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>Ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>er(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:$n}}},Cm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,wm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?vm:_m;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Cm(t,r)?void 0:Sm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Jp)?bm(e,t,n):i(e,Number(t),n)).map(e=>a.create(xm(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Tm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Em=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zn(e.domain)];return Ut(n,n.map(()=>Em(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return er(e.names.map((n,r)=>[n,Em(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return $n(e.factors.map(e=>Em(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`RandomElement of the empty set`);return e.low+r}return Tm(L(e).elements,t)},Dm=(e,t=0n)=>{let n=Yp(t),r={random:Yp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>er([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:sm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Om=e=>Un([...e.possibleCounts].map(([e,t])=>[e,t])),km=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Om(e)]]),Am=`----------------------------- MODULE Bags --------------------------------
459
+ `]]),jd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Md=S(`EOF`),Nd=S(`IDENTIFIER`),Pd=S(`DEFBREAK`),Fd=(e,t)=>Array.from({length:S(t)-S(e)+1},(t,n)=>S(e)+n),Id=new Set(Fd(`op_57`,`op_119`)),Ld=new Set(Fd(`op_1`,`op_119`)),Rd=new Set(Fd(`op_57`,`op_70`)),zd=/* @__PURE__ */ new Set([...Fd(`ACTION`,`EXCEPT`),S(`EXTENDS`),...Fd(`IF`,`SF`),S(`STATE`),...Fd(`THEN`,`WITH`),S(`US`),...Fd(`op_112`,`op_116`)]),Bd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Vd=new Map([...Bd(`postfix`,160,160,!0,`[`),...Bd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Bd(`prefix`,120,120,!1,`-.`),...Bd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Bd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Bd(`prefix`,40,40,!0,`\\lnot`),...Bd(`nfix`,100,130,!0,`\\times`),...Bd(`infix`,140,140,!1,`^`,`^^`),...Bd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Bd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Bd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Bd(`infix`,100,110,!0,`|`,`||`,`%%`),...Bd(`infix`,100,110,!1,`%`),...Bd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Bd(`infix`,90,140,!1,`\\wr`),...Bd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Bd(`infix`,90,130,!1,`!!`),...Bd(`infix`,90,90,!1,`...`,`..`),...Bd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Bd(`infix`,80,80,!1,`\\`),...Bd(`infix`,70,70,!1,`<:`,`:>`),...Bd(`infix`,60,60,!0,`@@`),...Bd(`infix`,50,140,!0,`\\cdot`),...Bd(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Bd(`infix`,30,30,!0,`\\land`,`\\lor`),...Bd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Bd(`infix`,10,10,!1,`=>`)]),Hd=new Map([...Vd,...Td.flatMap(e=>e.slice(1).map(t=>[t,Vd.get(e[0])]))]),Ud=Hd.get(`[`),Wd={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Gd=e=>({type:`tokens`,kinds:new Set(e)}),Kd=e=>typeof e==`string`?e.startsWith(`<`)?Gd([S(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Kd)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),qd=e=>(...t)=>({type:e,body:G(...t)}),q=qd(`zeroOrMore`),Jd=qd(`oneOrMore`),J=qd(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Yd=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Xd=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Yd(e,n);return n},Zd=(...e)=>{let t=e.map(S);return e=>t.includes(Xd(e,1).kind)},Qd=(e,t=Xd(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},$d=e=>{let t=Xd(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},ef=e=>Zd(`CASESEP`)(e)&&Qd(e),tf=e=>{let t=Xd(e,1);zd.has(t.kind)&&(t.kind=Nd)},nf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,rf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),af=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},of=e=>e.operatorStacks[e.operatorStacks.length-1],sf=(e,t)=>e.low>t.high,cf=(e,t)=>e.high<t.low,lf=e=>e.fix===`prefix`?e:Hd.get(`${e.name}.`),uf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Ud?rf(`FcnAppl`,[n,...r.node.heirs]):rf(`PostfixExpr`,[n,r.node]),operator:void 0})},df=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:rf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:rf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},ff=e=>{let t=of(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return uf(t,n),ff(e);if(i.operator!==void 0){let t=lf(r.operator);return t!==void 0&&sf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${nf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${nf(e,a.node.first,a.node.last)} and expression at location ${nf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return cf(a.operator,r.operator)?void 0:sf(a.operator,r.operator)?(df(t,a.operator),ff(e)):`Precedence conflict between ops ${a.operator.name} in block ${nf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=lf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(cf(s,r.operator))return;if(!sf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${nf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return df(t,s),ff(e);let c=nf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Wd?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},pf=e=>Y(t=>{let n=of(t),r=af(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:ff(t)}),mf=pf(()=>!1),hf=pf(()=>!0),gf=Y(e=>{e.lastOperator=Hd.get(e.token.image)}),_f=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},vf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?_f(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},yf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Qd(e,n.first.beginColumn))return n;let t=yf(e,n);if(t!==void 0)return t}},bf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(S),n=(e,...t)=>t.some(t=>e.kind===S(t)),r=e=>e!==void 0&&Id.has(e.kind),i=e.token,a=Yd(e,i);i.next=void 0;let o=Yd(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Nd&&(e=e.next)}else if(e.kind===Nd){let t=e.next;!r(t)||Rd.has(t.kind)||Ld.has(t.kind)&&t.next?.kind!==Nd||(e=t.next?.kind===S(`SUBSTITUTE`)?i:Ld.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Pd&&(e.next={kind:Pd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Yd(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},xf=e=>{let t=Xd(e,1);if(t.kind===S(`LAB`)){let n=1;for(;n!==0;)if(t=Yd(e,t),t.kind===S(`LAB`)&&n++,t.kind===S(`RAB`)&&n--,t.kind===Md)return!1;return Yd(e,t).kind===S(`IN`)}if(t.kind!==Nd)return!1;for(t=Yd(e,t);t.kind===S(`COMMA`);){if(t=Yd(e,t),t.kind!==Nd)return!1;t=Yd(e,t)}return t.kind===S(`IN`)},Sf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Cf=e=>e.proofLevels.at(-1)??-1,wf=e=>{let t=Xd(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Zd(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Cf(e)>=0&&Sf(t)>Cf(e):Zd(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Tf=(e,t)=>{let n=Sf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Ef=e=>Y(t=>Tf(t,t.token)?void 0:`${nf(t,t.token)}: ${e}`),Df=Gd([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(S)),Of=Gd([...Df.kinds,S(`op_76`)]),kf=Gd(Ld),Af=Gd(Rd),jf=Gd([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(S)),Mf=()=>q(Z({expansion:[K(Df,`<op_77>`)],semantic:Qd}),K(`PrefixOp`,`InfixOp`),hf),Nf=()=>K(G(Z({expansion:[`OpenStart`],semantic:Qd}),`OpenExpression`,mf),G(Z({semantic:Qd}),`ExtendableExpr`)),Pf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Ff=()=>K(G(Z({semantic:e=>Zd(`ASSUME`,`BOXASSUME`)(e)||Xd(e,2).kind===S(`COLONCOLON`)&&[S(`ASSUME`),S(`BOXASSUME`)].includes(Xd(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),If=()=>[`JuncItem`,q(Z({semantic:$d}),`JuncItem`)],Lf=e=>Y(t=>{t.expecting=e,tf(t)}),Rf=e=>Y(t=>{t.isTerminalProof=e}),zf=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{bf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Bf={CompilationUnit:Q(void 0,[Y(bf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Lf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Lf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Lf(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(bf)),G(Z({semantic:e=>Zd(`USE`)(e)&&Xd(e,2).kind!==S(`ONLY`)||Zd(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Af]}),`PostfixLHS`,`Expression`),zf(`Expression`,Z({expansion:[`<IDENTIFIER>`,kf]}),`InfixLHS`,`Expression`),zf(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),zf(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Of,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,kf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Af]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Lf(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Df,gf]),NonExpPrefixOp:Q(void 0,[Of,gf]),InfixOp:Q(`Infix Op`,[kf,gf]),PostfixOp:Q(void 0,[Af,gf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{bf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Ff(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Ff(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=af(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${nf(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(bf),K(G(Z({amount:3}),Z({semantic:Zd(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:wf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Zd(`BY`)(e)||Xd(e,2).kind===S(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Xd(e,2).kind!==S(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Rf(!0),J(`<ONLY>`)),G(`<USE>`,Rf(!1),J(`<ONLY>`)),G(`<HIDE>`,Rf(!1))),X("an expression, `MODULE' or `DEF'"),J(Pf(),q(`<COMMA>`,X(`MODULE or expression`),Pf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Pf(),q(`<COMMA>`,X(`MODULE or expression`),Pf(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),jf,Ef(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:wf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),jf,Ef(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Zd(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Zd(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Zd(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:wf}),Y(e=>{let t=af(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${nf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Jd(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Zd(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Of,kf,Af),Gd([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(S))],semantic:Qd}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${nf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Qd}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:xf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Jd(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=af(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Jd(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:xf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Xd(e,2).kind===S(`MAPTO`)&&zd.has(Xd(e,1).kind)}),Y(e=>{Xd(e,1).kind=Nd}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=rf(`FcnAppl`,t.heirs),e.lastOperator=Ud})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Jd(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(tf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===S(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>ef(e)&&Xd(e,2).kind!==S(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:ef}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Jd(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Xd(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...If()),G(Z({expansion:[`<AND>`]}),...If())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=yf(t,e.heirs[1]);return n&&`Item at ${nf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${nf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Mf(),Nf()],(e,t)=>{let n=of(t);n.push({node:e.heirs[0],operator:Wd});let r=ff(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),mf,q(K(G(Z({expansion:[`PostfixOp`],semantic:Qd}),`PostfixOp`,hf),G(Z({expansion:[`<DOT>`],semantic:Qd}),`<DOT>`,Y(tf),Z({semantic:Qd}),`Identifier`,Y(e=>{let t=of(e);t[t.length-1].operator!==void 0&&uf(t,t.length),t[t.length-1]={node:rf(`RecordComponent`,[t[t.length-1].node,af(e,2),af(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Qd}),X(`function argument`),`SBracketCases`,pf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Qd}),`InfixOp`,hf,Mf(),Nf()),G(Z({expansion:[`<COLONCOLON>`],semantic:Qd}),`<COLONCOLON>`,Y(e=>{let t=of(e);if(!vf(t[t.length-1].node))return`\`::' at ${nf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=of(e),n=af(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!cf(r,e.lastOperator)){let t=af(e,3);return`Removing label at ${nf(e,t.first,t.last)} would change expression parsing.`}t.push({node:rf(`Label`,[af(e,3),af(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Qd}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Qd}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Cf(e)<0&&e.proofLevels.length<=1?`${nf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${nf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:_f(e.heirs)===void 0?e.heirs.length===1?rf(`GeneralId`,e.heirs):void 0:rf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Xd(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Xd(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${nf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Vf=/* @__PURE__ */ new Map,Hf=e=>{let t=Vf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Hf(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Hf(Bf[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Vf.set(e,n),n},Uf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Wf=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Yd(e,e.scanPosition)),e.scanPosition=Yd(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Gf=(e,t)=>{if(t.type===`tokens`)return Wf(e,t.kinds);if(t.type===`call`)return Gf(e,Bf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Uf(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Gf(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Uf(e,t.semantic)?Gf(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Gf(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Gf(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Kf=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Gf(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},qf=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Hf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Hf(a).hasSemanticStart?Hf(a).first.has(Xd(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Kf(e,i,a)&&(o===void 0||o(e))}),Jf=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Gf(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Yd(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Md){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Yd(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${ge(e.token.image)}" `},Yf=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Jf(e)}\n\nResidual stack trace follows:\n${r}`,!1},Xf=(e,t)=>{let n=Yd(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Yf(e))},Zf=(e,t)=>{let n=Bf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Xd(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Qf(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Yf(e,i);let a=r.node??(r.heirs.length===0?void 0:rf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Qf=(e,t)=>{if(t.type===`tokens`)return Xf(e,t.kinds);if(t.type===`call`)return Zf(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Yf(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Yf(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Qf(e,t));if(t.type===`choice`){let n=qf(e,t.alternatives);return n===-1?Yf(e):Qf(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Qf(e,t.body))return!1;if(t.type===`optional`)return qf(e,[t.body])===-1||Qf(e,t.body);for(;qf(e,[t.body])===0;)if(!Qf(e,t.body))return!1;return!0},$f=e=>{let t=k(e),n={kind:Md,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Qf(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},ep={low:15,high:15},tp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),np=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),rp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),ip=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),ap=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),op=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),sp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),cp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...rp]),lp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?np.has(e.operator):rp.has(e.operator)),up=e=>np.has(e)||rp.has(e)||e===`-.`,dp=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},fp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),pp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),mp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),hp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),gp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),_p=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),vp=/* @__PURE__ */ new Set([``,`*`,`-`]),yp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),bp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),xp=/* @__PURE__ */ new Set([`NEW`,...bp.keys()]),Sp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Cp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),wp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Tp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
460
+ `)}\n`},Ep=(t,n)=>{let r=n===`tlapm`,i=r?ee(t):ee(t).map(_),a={index:0,offsideColumns:[]},o={},s=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>s[s.length-1].has(e),p=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],g=[],v=(e,t=a.index-1)=>{let n=e===t?g[e]:void 0;if(n)return n;let r=i[t];m[e]??=p(i[e]),h[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:m[e],end:h[t]};return e===t&&(g[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>i[Math.min(a.index+e,i.length-1)],x=(e=0)=>{let t=b(e),n=a.offsideColumns[a.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},S=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},ne=e=>{let t=i.slice(te.index,a.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},re=e=>r&&(e.kind===`Keyword`||wp.has(e.text)),ie=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:_p.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):re(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(t,n=b(),r)=>{let a=i[i.length-1],o=n.line===a.line&&n.column===a.column;return new e.D(`${t} at line ${n.line}, column ${n.column}`,void 0,oe(t,n,o,r))},oe=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ne(ie(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${ae(a)}`,...ie(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},se=(e,t=b())=>C(e,t,t),ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!re(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return a.index++,e},E=e=>w(e)?(a.index++,!0):!1,D=e=>{if(!w(e))throw se(`Expected ${JSON.stringify(e)} but found ${S(x())}`);return T()},le=()=>{let e=x();if(e.kind!==`Identifier`)throw se(`Expected an identifier but found ${S(e)}`);if(re(e))throw se(`Unexpected keyword ${e.text}`);return a.index++,e.text},ue=()=>{let e=a.index;return{name:le(),range:v(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=x();return e.kind!==`String`&&(ap.has(e.text)||np.has(e.text)||rp.has(e.text)||e.text===`'`)?(a.index++,e.text):le()},pe={isUsed:!1},O=()=>x().kind===`Identifier`||!ce(x())?le():(pe.isUsed=!0,T().text),me=e=>{if(!r)return e();a.offsideColumns.push(-1);let t=e();return a.offsideColumns.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},he=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ge=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},_e=()=>{if(!E(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(k(ue));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ve=()=>k(()=>{let e=k(_e);D(`\\in`);let t=M();return e.map(e=>({pattern:e,set:t}))}).flat(),ye=()=>{let e=x();if(e.kind===`Identifier`){let t=a.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(le());return y({kind:`Identifier`,name:n.join(`!`),location:p(e)},t)}if(w(`<<`)||w(`(`))return Pe();throw se(`Expected a subscript but found ${S(e)}`)},be=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,rp.has(n.text)?3:4))},xe=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&pp.has(t.text)||be(e)},Se=()=>{let e=x(),t=e.kind===`Operator`&&(np.has(e.text)||ip.has(e.text))&&xe(e);if(r&&e.kind!==`String`&&(ip.has(e.text)||cp.has(e.text)&&e.text!==`'`&&!rp.has(e.text)||sp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&xe(e))throw C(`incomplete expression`,e);if(t)return a.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},a.index-1);if(e.kind!==`String`&&cp.has(e.text)&&xe(e)){a.index++;let t=p(e);if(rp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:dp(e.text,n,t),operator:e.text,location:p(e)},a.index-1)}if(w(`LAMBDA`)){let t=a.index;T();let n=de(k(ue));D(`:`);let r=M();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return M()},Ce={range:void 0},we=()=>me(()=>{let e=a.index;D(`(`);let t=k(Se);return D(`)`),Ce.range=v(e),t}),Te=()=>{let e=T();a.offsideColumns.push(e.column);let t=[M()];for(;b().text===e.text&&b().column===e.column;)a.index++,t.push(M());return a.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Ee=e=>me(()=>{let t=p(e),n=x().kind===`Identifier`,i=w(`|->`,1)&&(n||ce(x()));if(i||n&&w(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a.index,n=p(x()),r=e();return n.range=v(t),D(i?`|->`:`:`),{name:r,value:M(),location:n}},o=[r(()=>n?le():T().text),...E(`,`)?k(()=>r(le)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(he()){let e=ve();D(`|->`);let n=M();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=M();if(E(`->`)){let e=M();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ce(x()))throw se(`Expected a field name but found ${S(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>M())}),D(`]`);return D(`=`),{path:e,value:M()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(M());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:ye(),location:t}}),De=()=>{let e=a.index,t=y(j(),e),n=p(T());return y({kind:`Apply`,operator:`\\in`,args:[t,M()],location:n},e)},Oe=e=>me(()=>{let t=p(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(he()&&(x(1).text===`\\in`||w(`<<`))){let e=a.index,n=_e();D(`\\in`);let r=M();if(E(`:`)){let e=M();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?De():M();if(E(`:`)){let e=ve();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(M());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),ke=e=>{let t=p(e),n=me(()=>w(`>>`)||w(`>>_`)?[]:k(()=>M()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:ye(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},Ae=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&he()){let e=ve();return D(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=de(k(ue));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:M(),isTemporal:r,location:t}},je=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:M(),location:p(e)};let n=M();D(`->`),t.push({condition:n,body:M()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Me=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||fp.has(e.text)||e.kind===`Operator`&&(np.has(e.text)||rp.has(e.text)||ip.has(e.text)))},Ne=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a.index--,{kind:`Bound`,args:we()}}return{kind:`Name`,name:e.text,args:w(`(`)?we():[]}},Pe=e=>{let t=a.index,n=T(),i=p(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(le);return D(`:`),{kind:`Lambda`,params:e,body:M(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw C(`incomplete expression`,n);return{kind:`Number`,value:c(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let l=n.kind===`Step`&&Je(n);if(l&&Ge()<0&&We.length<=1)throw C(`Step number used outside proof`,n);if(l&&n.text[1]===`+`)throw C(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||l){let s=l?Ye(n)??n.text:n.text;if(ge()){let t=de(E(`(`)?k(ue):[]);t.names.length>0&&D(`)`),D(`::`);let a=M();if(!r&&e!==void 0&&o.last!==void 0&&lp(a)&&e.high>=o.last.low)throw C(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:i}}let c=w(`(`);if(s===`@`&&!c&&!Me())return{kind:`ExceptAt`,location:i};let u=c?we():[],d=[c?Ce.range:void 0];if(!Me())return c?{kind:`Apply`,operator:s,args:u,argumentsRange:Ce.range,location:i}:{kind:`Identifier`,name:s,location:i};let f=[{kind:`Name`,name:s,args:u}],p=[v(t,t)];for(;Me();)T(),p.push(v(a.index,a.index)),Ce.range=void 0,f.push(Ne()),d.push(Ce.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),ee=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:ee,selectorRanges:p,argumentRanges:d,location:i}:{kind:`Apply`,operator:h,args:g,argumentsRange:ee,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&up(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:we(),location:i};if(n.kind===`Operator`&&up(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=me(()=>M());return D(`)`),e}case`[`:return Ee(n);case`{`:return Oe(n);case`<<`:return ke(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ae(n);case`IF`:{let e=M();D(`THEN`);let t=M();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:i}}case`CASE`:return je(n);case`LET`:{let e=[],t=[];for(s.push(/* @__PURE__ */ new Set);!E(`IN`);){if(r&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,ne(b()));if(E(`RECURSIVE`)){He();continue}let n=Fe(!1);n.kind===`Instance`?t.push(n):e.push(n)}s.pop();let n=M();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=_e(),t=E(`\\in`)?M():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:i}}case`WF_`:case`SF_`:{let e=ye(),t=me(()=>{D(`(`);let e=M();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw se(`Unexpected ${S(n)}`,n)},A=(e,t,n)=>{o.last=o.preceding={low:t,high:n};let i=M(n+1),a=x(),s=a.text===`'`||rp.has(a.text)?ep.high:np.get(a.text)?.high;if(!r&&a.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},j=()=>{let e=o.preceding;o.preceding=void 0;let t=x(),n=p(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Te();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[A(t,4,4)],location:n};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[A(t,12,12)],location:n};case`[]`:return T(),{kind:`Always`,expression:A(t,4,15),location:n};case`<>`:return T(),{kind:`Eventually`,expression:A(t,4,15),location:n};case`ENABLED`:return T(),{kind:`Enabled`,expression:A(t,4,15),location:n};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:A(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[r?M(9):A(t,10,13)],location:n}}return Pe(e)},M=(e=0)=>{let t=a.index,n=j(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=p(n);if(n.text===`'`&&e<=15){T(),o.last=ep,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(rp.has(n.text)&&e<=15){T(),o.last=ep,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=me(()=>k(()=>M()));me(()=>D(`]`)),o.last=tp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&ce(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=np.get(n.text);if(!a||a.low<e)break;let s=r.previous;if(s){let e=!(s.low>a.high||s.high<a.low),t=s.text===n.text&&a.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());o.last=o.preceding=a;let c=M(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...a,text:n.text}}return r.left},N=()=>{if(!E(`(`))return[];let e=Ve();return D(`)`),e},P=()=>{let e=p(x()),t=M(),n=i[a.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},Fe=e=>{let t=a.index;return y(Le(e),t)},Ie=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Le=e=>{let t=x(),n=p(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...P(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&np.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=ue(),t=T().text,n=ue();return D(`==`),r(t,[Ie(e),Ie(n)])}let i=t.kind!==`String`&&ap.has(t.text),o=t.kind===`Identifier`&&rp.has(x(1).text)&&w(`==`,2);if(i||o){let e=i?t.text:x(1).text;i&&T();let n=ue();return o&&T(),D(`==`),r(e,[Ie(n)])}let s=le();if(E(`[`)){let t=me(()=>ve());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:M(),isLocal:e,isRecursive:f(s),location:n}}let c=a.index,l=N();return D(`==`),w(`INSTANCE`)?{...Re(s,l,e,n),definitionRange:v(c)}:r(s,l)},Re=(e,t,n,r)=>{let i=a.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=a.index,t=fe(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:Se()}}):[],isLocal:n,location:r,instanceRange:v(i)}},ze=()=>{let e=a.index;return y(Be(),e)},Be=()=>{let e=p(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ve=()=>k(ze),He=()=>{let e=Ve();return e.forEach(e=>s[s.length-1].add(e.name)),e},Ue=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Sp.has(e.text)&&t.value++,e.kind===`Operator`&&Cp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},F=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Ue(1)):t.kind===`Operator`&&rp.has(t.text)?w(`==`,2):t.kind===`Operator`&&np.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&ap.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},We=[],Ge=()=>We[We.length-1]??-1,Ke=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),qe=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},Je=e=>!e.text.endsWith(`.`)&&!vp.has(qe(e)),Ye=e=>{let t=qe(e);if(vp.has(t))return;let n=Ke(e);if(n>=0)return`<${n}>${t}`;let r=Ge(),i=We[We.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Xe=e=>{if(e.kind===`Keyword`)return hp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return We.length===0;if(e.text[1]===`+`||We.length===0)return!0;let t=Ge();return t>=0&&Ke(e)>t},Ze=e=>{let t=Ke(e),n=We.length-1,r=We[n-1]??-1,i=We[n]<0;return i&&(We[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:We[n]===t},Qe=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),$e=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!wp.has(e.name)&&!Qe(e.name):!1,et=()=>{let e=x();return e.kind===`Step`?Je(e):e.kind===`Keyword`?yp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!F()},tt=()=>{let e=a.index,t=x();return t.kind===`Operator`&&!op.has(t.text)&&up(t.text)?(a.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:le(),location:p(t)},e):M()},nt=e=>u[u.length-1]?.add(e),rt=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},it=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),at=()=>{let e=a.index,t=x(),n=k(()=>{let e=x();if((e.kind!==`Identifier`||re(e))&&e.kind!==`Operator`)throw se(`Expected a definition name but found ${S(e)}`,e);return a.index++,e.text},`!`),r=p(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ot=()=>{if(r)return k(at);let e=k(tt),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&it(e.name)):void 0;if(t)throw C(`DEF clause entry should describe a defined operator`,t.location);return e},st=()=>({facts:et()?k(tt):[],defs:E(`DEF`)||E(`DEFS`)?ot():[]}),ct=()=>{let t=a.index,r=T(),i=r.text===`USE`&&E(`ONLY`),o=v(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...st(),keyword:o,location:p(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!$e(e)):[];if(c.length>0)throw e.P(c.map(n=>({location:e.I(n.location.range??v(t)),message:`The only expression allowed as a fact in a HIDE is
461
+ the name of a theorem, assumption, or step.`})));return y(s,t)},lt=()=>{let e=a.index,t=p(x()),n=E(`NEW`),r=x().kind===`Keyword`?bp.get(x().text):void 0;if(!n&&r===void 0)throw se(`Expected a declaration but found ${S(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=ue();return nt(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=ze();nt(i.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&i.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:o?M():void 0,nameRange:i.location.range,location:t},e)},ut=()=>{let e=a.index,t=p(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?rt(ut):x().kind===`Keyword`&&xp.has(x().text)?lt():M());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)},dt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},ft=(e,t)=>{e.forEach(nt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(nt))},pt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ct();if(w(`INSTANCE`)){let t=a.index;return y(Re(void 0,[],!1,p(e)),t)}if(w(`DEFINE`)||F()){let t=a.index;E(`DEFINE`);let n=[Fe(!1)];for(;F();)n.push(Fe(!1));let r={kind:`Define`,definitions:n,location:p(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:M()};if(E(`TAKE`)){let e=he(),t=de(e?[]:k(ue)),n=e?ve():[];return ft(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>M())};if(E(`PICK`)){let e=dt(`:`),t=de(e?k(ue):[]),n=e?[]:ve();return ft(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return E(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?ut():M()}},mt=e=>{let t=x();if(t.kind!==`Step`)throw se(`Expected a step number but found ${S(t)}`,t);if(!Ze(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ke(t)<0&&Ye(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return a.index++,{name:Ye(t),token:t.text,location:p(t)}},ht=()=>{let e=a.index,t=mt(w(`QED`,1)),n=a.index,r=/* @__PURE__ */ new Set;u.push(r);let i=E(`QED`)?{kind:`Qed`}:pt(),o=v(e),s=v(n),c=Xe(x());if(c&&!gp.has(i.kind))throw C(`Proof of a step that does not take a proof`);let l=c?_t():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(nt),y({...t,body:i,head:o,statement:s,proof:l},e)},gt=()=>{let e=p(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(a.index-1);return{kind:`By`,isOnly:E(`ONLY`),...st(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(a.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[ht()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(ht());return{kind:`Steps`,level:Ge(),steps:n,location:e}},_t=()=>{let e=a.index;We.push(-1);let t=rt(gt);return We.pop(),y(t,e)},vt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},yt=e=>{let t=a.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?le():void 0;r!==void 0&&(l.add(r),T());let i=rt(()=>({statement:w(`ASSUME`)?ut():M(),proof:Xe(x())?_t():void 0})),o=i.statement,s=y({name:r,statement:o,proof:i.proof,location:p(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&o.kind!==`AssumeProve`&&vt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:p(n)},t))},bt=()=>{let e=a.index;return y(xt(),e)},xt=()=>{let e=T(),t=p(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=le();return l.add(e),T(),{name:e,expression:M(),isAxiom:n,location:t}}return{name:void 0,expression:M(),isAxiom:n,location:t}},St=()=>{let e=p(D(`----`));D(`MODULE`);let t=O();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),s.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&k(()=>{let e=a.index;n.extends.push(O()),n.extendsRanges.push(v(e))});;){let t=a.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),s.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=St();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(T()),r=Ve();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(T()),r=k(()=>{let e=a.index,t=p(x());return y({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=bt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&vt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw se(`Expected a module unit but found ${S(r)}`);let e=ct();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:He()});continue;case`INSTANCE`:Ct(n,y(Re(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Ct(n,y(Re(void 0,[],!0,p(r)),t));continue}Ct(n,y(Le(!0),t));continue}r.kind===`Keyword`&&mp.has(r.text)?yt(n):Ct(n,Fe(!1))}}},Ct=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},wt=St(),Tt=pe.isUsed?$f(t):void 0;if(Tt!==void 0)throw new e.D(Tt);return wt},Dp=e=>Ep(e,`tlc`),Op=e=>Ep(e,`tlapm`),kp=e=>Ep(e,`sany`),Ap=25214903917n,jp=(1n<<48n)-1n,Mp=2147483647,Np=e=>{let t={value:(BigInt.asUintN(64,e)^Ap)&jp},n=e=>(t.value=t.value*Ap+11n&jp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Ap)&jp},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Mp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Pp=10454148508367108822n,Fp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Pp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Ip=Int32Array.from(Fp,e=>Number(BigInt.asIntN(32,e>>32n))),Lp=Int32Array.from(Fp,e=>Number(BigInt.asIntN(32,e))),Rp=Number(BigInt.asIntN(32,Pp>>32n)),zp=Number(BigInt.asIntN(32,Pp));let Bp=Rp,Vp=zp;const Hp=e=>{let t=(e^Vp)&255;Vp=(Vp>>>8|Bp<<24)^Lp[t],Bp=Bp>>>8^Ip[t]},Up=e=>{for(let t=0;t<32;t+=8)Hp(e>>>t)},Wp=e=>{if(typeof e==`boolean`)Hp(0),Hp(e?116:102);else if(typeof e==`number`)Hp(1),Up(e);else if(typeof e==`string`){Hp(3),Up(e.length);for(let t=0;t<e.length;t++)Hp(e.charCodeAt(t))}else if(P(e))Hp(21),Up($e(e.name)+1);else if(N(e)){let t=er(e);Hp(9),Up(t.domain.length);for(let e=0;e<t.domain.length;e++)Wp(t.domain[e]),Wp(t.range[e])}else{let t=L(e).elements;Hp(5),Up(t.length);for(let e of t)Wp(e)}},Gp=e=>{let t={high:Bp,low:Vp};Bp=Rp,Vp=zp;for(let t of e)Wp(t);let n=BigInt(Bp>>>0)<<32n|BigInt(Vp>>>0);return Bp=t.high,Vp=t.low,n},Kp=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(N(e)){let t=er(e);return t.domain.reduce((e,n,r)=>e+Kp(n)+Kp(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+Kp(t),5)},qp=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Bp=n<32?0:1<<n-32,Vp=n<32?1<<n:0;for(let t=0;t<e;t++)Hp(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Bp,t[n+1]=t[a+1]^Vp}}return t},Jp=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=qp(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||P(e))return Wp(e),Kp(e);let t=s(e),n={high:Bp,low:Vp},r=a(i[t]);Bp=i[t+1],Vp=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;Bp^=r[i],Vp^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:Bp,low:Vp};Bp=0,Vp=0;let a={value:5};if(N(e)){let t=er(e);Hp(9),Up(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=L(e).elements;Hp(5),Up(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,Bp,Vp),Bp=n.high,Vp=n.low,s};return(n,r)=>{let i={high:Bp,low:Vp};Bp=Rp,Vp=zp;for(let t of e)o(n[t]);t[2*r]=Vp,t[2*r+1]=Bp,Bp=i.high,Vp=i.low}},Yp=[],Xp=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Zp=()=>{for(let e=1277011;Yp.length<1341;e++)Xp(e)&&Yp.push(e);return Yp},Qp=e=>{let t=Zp(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},$p=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},em=e=>{for(let t=Math.max(e,9);;t++){let e=$p(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},tm=(e,t,n)=>{if(t<=0)return[];let r=em(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Qp(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},nm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Mp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},rm=(1n<<63n)-1n-24n,im=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(rm*BigInt(n)+i)%t;return r<0n?r+t:r})},am=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,om=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=vn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:bn}}},sm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,cm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?nm:tm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=sm(t,r)?void 0:om(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Mp)?im(e,t,n):i(e,Number(t),n)).map(e=>a.create(am(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},lm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e.g(`RandomElement of the empty set`);return r},um=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...vn(t.domain)];return ut(e,e.map(()=>um(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return xn(t.names.map((e,r)=>[e,um(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return bn(t.factors.map(e=>um(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.g(`RandomElement of the empty set`);return t.low+i}return lm(L(t).elements,n)},dm=(e,t=0n)=>{let n=Np(t),r={random:Np(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Gp,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},fm=e=>un([...e.possibleCounts].map(([e,t])=>[e,t])),pm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,fm(e)]]),mm=`----------------------------- MODULE Bags --------------------------------
468
462
  (**************************************************************************)
469
463
  (* A bag, also called a multiset, is a set that can contain multiple *)
470
464
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -617,7 +611,7 @@ CopiesIn(e, B) ==
617
611
  7 Dec 98 : Corrected error found by Stephan Merz.
618
612
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
619
613
  5 Dec 98 : Initial version.
620
- `,jm=/* @__PURE__ */ new Map([[`Bags`,Am],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
614
+ `,hm=/* @__PURE__ */ new Map([[`Bags`,mm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
621
615
  (***************************************************************************)
622
616
  (* The two definitions in this standard module are overridden by TLC in *)
623
617
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -873,7 +867,7 @@ TestRandomSetOfSubsets(k, n, S) ==
873
867
  [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
874
868
 
875
869
  =============================================================================
876
- `],[`RealTime`,`${Ed}\n`],[`Reals`,`${Td}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
870
+ `],[`RealTime`,`${ud}\n`],[`Reals`,`${ld}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
877
871
  (***************************************************************************)
878
872
  (* Defines operators on finite sequences, where a sequence of length n is *)
879
873
  (* represented as a function whose domain is the set 1..n (the set *)
@@ -1277,7 +1271,7 @@ TLCEvalDefinition(definitionName) ==
1277
1271
  TRUE \\* TODO
1278
1272
 
1279
1273
  ============================================================================
1280
- `],[`Toolbox`,`${Dd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1274
+ `],[`Toolbox`,`${dd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1281
1275
  LOCAL INSTANCE TLC
1282
1276
  LOCAL INSTANCE TLCExt
1283
1277
  LOCAL INSTANCE GraphViz
@@ -1677,7 +1671,7 @@ _TLCTrace ==
1677
1671
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1678
1672
 
1679
1673
  =============================================================================
1680
- `]]),Mm=new Map([...[...jm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Am.replace(`
1674
+ `]]),gm=new Map([...[...hm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,mm.replace(`
1681
1675
  LOCAL INSTANCE Naturals
1682
1676
  `,`
1683
1677
  EXTENDS TLC
@@ -1769,16 +1763,16 @@ _TEPosition ==
1769
1763
  ELSE TLCGet("level") + 1
1770
1764
 
1771
1765
  =============================================================================
1772
- `]]),Nm=(e=`master`)=>e===`1.7.4`?Mm:jm,Pm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Fm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Im=e=>P(e)?Ar(e):void 0,Lm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Pm(n,`a function with a finite domain`,r);return i},Rm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Fm(t===0?`first`:`second`,n,`bag`,r);return i},zm=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Bm=e=>e.range.every(e=>typeof e==`number`&&e>0),Vm=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},Hm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Um=Hm(`BagDiff`,`tlc2.value.impl.Value`,2),Wm=Hm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Gm=Hm(`BagUnion`,`tlc2.value.impl.Value`,1),Km=Hm(`BagOfAll`,`tlc2.value.impl.Value`,2),qm=Hm(`BagCup`,`tlc2.value.impl.Value`,2),Jm=Hm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ym=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Vi(e)}`;throw Ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Xm=(e,t,n)=>{let r=Ym(e,n)+Ym(t,n);if(Fi(r))throw Ii(`${e}+${t}`);return r},Zm=(e,t,n,r)=>{let i=Vm(n,e.domain[t]),a=Ym(e.range[t],r);return i===void 0?a:a-Ym(i,r)|0},Qm=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=Xm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),$m=Ut([],[]),eh=e=>[ji(`EmptyBag`,$m),H(`IsABag`,1,e=>{let t=Im(V(e,0,`IsABag`));return t!==void 0&&Bm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Lm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Pm(`BagCardinality`,`a bag`,t);return Xm(e,n,Jm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Vm(Lm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Fm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Vm(Lm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Fm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Rm(e,t,`(+)`);if(!Bm(n))throw Fm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Qm(t,qm)}),H(`\\ominus`,2,e=>{let t=Rm(e,0,`(-)`),n=Rm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=Zm(t,r,n,Um);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=zm(t,()=>Pm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??$m;let r=n.map(e=>{let n=Im(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Qm(r,Gm)}),H(`\\sqsubseteq`,2,e=>{let t=Lm(e,0,`\\sqsubseteq`),n=Lm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Zm(t,r,n,Wm)<=0)}),Mi(`BagOfAll`,2,e=>{let t=Ai(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Im(n);if(!r)throw Fm(`second`,`BagOfAll`,`function with a finite domain`,n);return Qm(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),Km)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Ar(n),i=Ln(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Rr(Lm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=zm(t,()=>Pm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],th=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,nh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ih=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ah=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,oh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,sh=e=>{if(!P(e))return!1;let t=Ar(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},ch=(e,t)=>Ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Vi(t)}`),lh=(e,t)=>Ui(e,`Cannot cast tlc2.value.impl.${Vi(t)} to tlc2.value.impl.StringValue`),uh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),dh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw ch(t,e);return`[${L(e).elements.map(e=>ph(e,t)).join(`,`)}]`},fh=(e,t)=>{let n=Ar(e),r=Cr(n);return r?`[${r.map(e=>ph(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${uh(typeof e==`string`?e:z(e))}:${ph(n.range[r],t)}`).join(`,`)}}`},ph=(e,t)=>typeof e==`string`?uh(e):typeof e==`object`?e.kind===`ModelValue`?uh(e.name):N(e)?dh(e,t):fh(e,t):String(e),mh=e=>{if(N(e))return dh(e,th);if(!P(e)||sh(e))throw ch(th,e);return fh(e,th)},hh=e=>{if(!P(e))throw ch(nh,e);return fh(e,nh)},gh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},_h=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>_h(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),_h(n,t)]));throw Ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},vh=(e,t)=>{if(e.trim()===``)return _h(null,t);try{return _h(JSON.parse(e,(e,t,n)=>typeof t==`number`?gh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ui(t,e.message):e}},yh=(e,t)=>{if(typeof e!=`string`)throw lh(t,e);return e},bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ui(n,`${t} (No such file or directory)`);return r},xh=e=>[Ni(`ToJson`,1,e=>At(ph(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ni(`ToJsonArray`,1,e=>At(mh(V(e,0,`ToJsonArray`)))),Ni(`ToJsonObject`,1,e=>At(hh(V(e,0,`ToJsonObject`)))),Ni(`JsonSerialize`,2,t=>{let n=yh(V(t,0,`JsonSerialize`),rh),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!sh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ph(r,rh)),!0}),Ni(`ndJsonSerialize`,2,t=>{let n=yh(V(t,0,`ndJsonSerialize`),ih),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ph(e,ih)}\n`).join(``)),!0}),Ni(`JsonDeserialize`,1,t=>{let n=yh(V(t,0,`JsonDeserialize`),ah);return vh(bh(e,n,ah),ah)}),Ni(`ndJsonDeserialize`,1,t=>{let n=yh(V(t,0,`ndJsonDeserialize`),oh);return $n(bh(e,n,oh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>vh(e,oh)))})],Sh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Ch=1e6,wh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Th=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wh(t,n,`nonnegative integer`,z(e));return e},Eh=(e,t,n,r)=>{if(!N(e)||!I(e))throw wh(t,n,r,z(e));return L(e).elements},Dh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Oh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Th(V(e,0,n),`first`,n),i=Th(V(e,1,n),`second`,n),a=Eh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw wh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw wh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Dh(a,r,a.length===0?0:i/a.length,t.getRandom())},kh=e=>[Ni(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw wh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ui(Sh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw wh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Cm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Ch)throw Ui(Sh,`Attempted to construct a set with too many elements (>${Ch}).`);return Ln(wm(n,r,e.getRandom(),e.version))}),Ni(`RandomSetOfSubsets`,3,t=>Oh(t,e)),Ni(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Oh(t,e)).elements.length)))],Ah=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,jh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ah})`,Mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ah}) throws java.io.IOException`,Nh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ah})`,Ph=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Fh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ih=e=>er([[`name`,e??`UnnamedAction`],[`location`,Fh()]]),Lh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Rh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return km(e).get(t)},zh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Bh=e=>e.every(e=>e!==void 0),Vh=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),Hh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=_l(r,t);if(e&&!n.has(e)&&(n.add(e),Hh(e.body,t,n)))return!0}return vi(e).some(e=>Hh(e,t,n))},Uh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Xi(`AssertError`,2,e=>{let n=Ai(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ui(jh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Zi(e,0,`AssertError`)();try{Zi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ca(e.message,t.isTool)===r;throw e}return!1}),Ni(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Rh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Mi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Rh(t,r)??V(n,3,`TLCGetAndSet`),a=Ai(n,1,`TLCGetAndSet`);return zh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ni(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Bh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ui(Mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>Vh(e,n.environment)))}),Ni(`CounterExample`,0,()=>t.counterExample??Ph()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Rr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Ir(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),Xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Xi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Bh(r))throw Ui(Nh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||gl(Zi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Xi(`TLCCache`,2,(e,t)=>{let r=Ai(e,0,`TLCCache`),a=oi(Zi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Hh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,sm([V(e,0,`TLCFP`)])))),Ni(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?_l(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Wh=(e,t)=>[Ni(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ni(`_Counts`,0,()=>Om(t)),Ni(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Om(t),!0)),!1)}),Ni(`_PrintCounts`,0,()=>(e(z(Om(t),!0)),!0))],Gh=e=>String(e).padStart(2,`0`),Kh=e=>`${e.getUTCFullYear()}.${Gh(e.getUTCMonth()+1)}.${Gh(e.getUTCDate())}.${Gh(e.getUTCHours())}${Gh(e.getUTCMinutes())}${Gh(e.getUTCSeconds())}`,qh=e=>Un([...e].map(([e,t])=>[e,$n([t])])),Jh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Yh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Xh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Zh=(e,t,n)=>{if(e.version===`1.7.4`?!Yh.has(t)||!e.isStarted&&Xh.has(t):!e.isStarted&&Jh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(Kh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ih(void 0);case`all`:return qh(e.registers);case`all:named`:return qh(km(e))}if(t.startsWith(`s:`)){let n=km(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Qh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Zh(e,t,n?.state)},$h=e=>e.length===0?[[]]:e.flatMap((t,n)=>$h([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),eg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(eg),e.kind===`Function`&&e.range.forEach(eg))},tg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ki(e,0,`@@`),n=ki(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return eg(t),t}),H(`Permutations`,1,e=>{let t=Di(e,0,`Permutations`);return Ln($h(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Mi(`SortSeq`,2,e=>{let t=Ai(e,1,`SortSeq`);return $n(Oi(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Wi({...Ni(`TLCGet`,1,(e,t)=>Qh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Wi(Xi(`TLCGet`,1,(e,t)=>Qh(n,Zi(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ni(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return zh(n,t,r,V(e,1,`TLCSet`)),!0}),ji(`Any`,Lt),H(`RandomElement`,1,e=>Em(Ti(e,0,`RandomElement`),n.getRandom()))],ng=(e,t)=>e.every(e=>Dr(e,t)),rg=Ln([!1,!0]),ig=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(ig(e,t,r),ig(e,r,n))},ag=[`\\cup`,`\\cap`,`\\`],og=e=>typeof e==`object`&&e.kind===`MixedSet`,sg=e=>e.kind===`Interval`?L(e).elements:e.elements,cg=(e,t,n)=>{let r=sg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},lg=[ji(`TRUE`,!0),ji(`FALSE`,!1),ji(`BOOLEAN`,rg),ji(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Pi(`=`,Fn),Pi(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ci(e,0,`~`)),H(`<=>`,2,e=>Ci(e,0,`<=>`)===Ci(e,1,`<=>`)),H(`/\\`,2,e=>Ci(e,0,`/\\`)&&Ci(e,1,`/\\`)),H(`\\/`,2,e=>Ci(e,0,`\\/`)||Ci(e,1,`\\/`)),H(`=>`,2,e=>!Ci(e,0,`=>`)||Ci(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=wi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?ng(L(t.base).elements,n.base):ng(L(t).elements,n)}),...ag.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!og(n)&&!og(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er(()=>t(L(n),L(r)),()=>cg(e,n,r))}return ft(n)?cg(e,n,r):e!==`\\`&&ft(r)?cg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=wi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(og(t)||n.some(og)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:ig(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Rr(t)})],ug=Ki(`Integers`,`Neg`,`IntValue`,1),dg=e=>{let t=Ki(e,`DotDot`,`IntervalValue`,2);return[qi(e,`+`,`Plus`,(e,t)=>e+t),qi(e,`-`,`Minus`,(e,t)=>e-t),qi(e,`*`,`Times`,(e,t)=>e*t),qi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),qi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Fi(r))throw Ii(`${t} \\div ${n}`);return r}),qi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Gi(V(e,0,`..`),t),high:Gi(V(e,1,`..`),t)}))]},fg=dg(`Naturals`),pg=dg(`Integers`),mg=e=>{let t=fg.indexOf(e);return t===-1?void 0:pg[t]},hg=[ji(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...fg,Yi(`<`,(e,t)=>e<t),Yi(`>`,(e,t)=>e>t),Yi(`<=`,(e,t)=>e<=t),Yi(`>=`,(e,t)=>e>=t,`>`)],gg=[ji(`Int`,{kind:`InfiniteSet`,name:`Int`}),...pg,Yi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Gi(V(e,0,`-`),ug);if(Fi(-t))throw Ii(`-${t}`);return-t})],_g=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},vg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:_g(e,t,n)},yg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),bg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Sg=(e,t)=>{let n=qd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Wi(e,t):e}):t},Cg=e=>Sg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>vg(e,0,bg(``,`Len`)).length),H(`\\o`,2,e=>{let t=vg(e,0,xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=_g(e,1,xg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${xg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([..._g(t,0,xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=_g(e,0,bg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=vg(e,0,bg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return yg(t,1)}),H(`SubSeq`,3,e=>{let t=vg(e,0,bg(`first `,`SubSeq`)),n=Si(e,1,`SubSeq`),r=Si(e,2,`SubSeq`);if(n>r)return yg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return yg(t,n-1,r)}),Mi(`SelectSeq`,2,e=>{let t=Ai(e,1,`SelectSeq`);return $n(_g(e,0,bg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),wg=e=>Sg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),Tg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Eg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:hg};case`Integers`:return{extends:[`Naturals`],operators:gg};case`Sequences`:return{extends:[],operators:Cg(n.version)};case`FiniteSets`:return{extends:[],operators:wg(n.version)};case`TLC`:return{extends:[],operators:Sg(`TLC`,tg(t,n))};case`Randomization`:return{extends:[],operators:kh(n)};case`_Possible`:return{extends:[],operators:Wh(t,n)};case`Json`:return{extends:[],operators:xh(r)};case`Bags`:return{extends:[],operators:eh(i)};case`TLCExt`:return{extends:[],operators:Uh(t,n)};default:return}},Dg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Og={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},kg=(e,t)=>{let n=Og[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ag=`$subexpression`,jg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Mg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Mg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of vi(e)){let e=Mg(r,t,n);if(e)return e}},Ng=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Pg=(e,t)=>{let n=e.location,r=Ng(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw jg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw jg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ag,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ag,args:e.args,location:n,resolution:Da},location:n}},Fg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Da};return Pg({...t,params:[...t.params,...r]},a)},Ig=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw jg(r,i);ka.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw jg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Zo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw jg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Pa(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw jg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Mg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw jg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||to(t.operand,1)!==0)throw jg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ao(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[to(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw jg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=to(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw jg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw jg(`Unexpected subexpression selector`,i);let s=r?r.sets:oo(n),c=s?.[to(t.operand,s.length)];if(!c)throw jg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Fg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw jg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Fg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw jg(`Subexpression selection failed`,i);return Pg(a,o.current)},Lg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return no(e,t,n)},Rg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||vi(e).some(Rg),zg=(e,t,n,r=!1)=>{if(!Rg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=es(e,e=>zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Bg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>zg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:es(e,e=>zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Lg(a.name,[],void 0,t):a.kind===`Apply`?Lg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ig(o,t,a,r);return c!==a&&Oa.add(c),c},Bg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zg(e.expression,t,n,!0)}))}),Vg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hg=(e,t)=>Bg(e,Vg(t.definitions),()=>!1),Ug=(e,t)=>{let n=Vg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>zg(e,n,i),o=e=>i(e)||!n(e),s=e=>zg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Bg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Bg(e,n,o):$o(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Rg(e.body))||e.assumptions.some(e=>Rg(e.expression))?{...p,definitions:e.definitions.map(e=>$o(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Wg=(e,t)=>`${e}${t}`,Gg=(e,t,n)=>`${e}${t}${n}`,Kg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},qg=(e,t,n)=>`${e},${t},${n}`,Jg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Yg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Xg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Zg=(e,t,n,r)=>({...Jg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Qg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,$g=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,e_=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Zg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),t_=Zg(`$Set`,0,[2],[1]),n_=Zg(`$Junction`,0,[3],[1]),r_=Zg(`$Choose`,0,[2],[1]),i_=Zg(`$Function`,0,[3],[1]),a_=Zg(`$FcnApply`,0,[2,2],[1,1]),o_=Zg(`$RcdSelect`,0,[2,0],[1,1]),s_=Zg(`'`,2,[1],[0]),c_=Zg(`ENABLED`,1,[2],[0]),l_=Zg(`[]`,3,[3],[0]),u_=Zg(`$SquareAct`,2,[2,1],[0,0]),d_=Zg(`$WF`,3,[1,2],[0,0]),f_=Zg(`$TemporalExists`,3,[3],[0]),p_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),m_=e=>e.map(e=>({name:e,arity:0})),h_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),g_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),__=e=>e.kind!==`Let`&&e.kind!==`Label`,v_=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=e_.get(t)??Dg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Jg(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Gg(e,n,t))}),t.data.constraints.forEach((e,t)=>Yg(r.constraints,t,e)),Xg(r.argConstraints,Wg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Xg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Qg(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(qg(t,n,r)),s=Jg(Math.max(e.level,...t.filter((t,n)=>$g(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{$g(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Yg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Yg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Yg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Yg(s.constraints,t,Qg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Yg(s.constraints,e,Qg(r,a)))}))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator)?.operator;n&&Yg(s.constraints,t.param,Qg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Xg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Xg(s.argConstraints,Wg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Xg(s.argConstraints,Wg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);n&&Xg(s.argConstraints,Wg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Kg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Gg(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Gg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Gg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,m_(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Jg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=p_(n,m_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw h_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw h_(`Action used where only temporal formula or state predicate allowed`,e);g_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&__(n)&&n.kind!==r)throw h_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Yg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Xg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:h_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Jg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(n_,n)}case`Prime`:case`Unchanged`:return s(s_,[e.expression],t);case`Enabled`:return s(c_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(l_,[n])}case`If`:return s(n_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(n_,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(n_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw h_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?f_:n_,[e.body],t,[],e.names);case`Choose`:return s(r_,[e.body],t,e.set?[e.set]:[],Ga(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(t_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(t_,[e.predicate],t,[e.bound.set],Ga(e.bound.pattern));case`SetMap`:return s(t_,[e.expression],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`FunctionConstruction`:return s(i_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`Record`:return s(i_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(t_,e.fields.map(e=>e.value),t);case`Except`:return s(t_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(a_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(t_,e.args,t)}]);case`Bracket`:return Jg();case`FieldAccess`:return i(o_,[a(e.record,t),{data:Jg()}]);case`BoxAction`:case`AngleAction`:return s(u_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(d_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Jg()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return vi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,p_(t,m_(e.names))),i;default:return es(e,(e,n)=>(a(e,r,p_(t,m_(n))),e)),i}},_=(e,t,n,r)=>{let i=p_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Jg(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Wg(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(Gg(e.name,n,t.name))).map(e=>qg(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Kg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Kg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Jg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},y_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?y_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Jg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Yg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},b_=(e,t,n,r)=>{let i=v_(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?y_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Wo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?y_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},x_=(e,t)=>e.maxLevels[t]??3,S_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=v_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Yg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Yg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Kg(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Yg(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(y_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Wg(e.name,i));a!==void 0&&x_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Kg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=x_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},C_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],w_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),T_=new Map(Vd.flatMap(e=>e.map(t=>[t,e[0]]))),E_=e=>T_.get(e)??e,D_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},O_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(D_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},k_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),A_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:E_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:E_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},j_=(e,t)=>{let n=[];for(let r=t;;){let t=A_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},M_=e=>({line:e.line,column:e.column}),N_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=j_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},P_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,F_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},I_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&P_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&P_(e[n+1],e[n+2])?n+=P_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>F_[e])}"`:r.text)}return t},L_=e=>e[2]?.text,R_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},z_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>z_(e.modules,t)).find(Boolean),B_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Gd.has(i)?t?.(i):void 0)??Kd.get(i)??t?.(i)??Vp(e,i),s=o===void 0?[]:Ce(o),c=R_(s),l=c.get(L_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Up(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>z_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},V_=(e,t)=>{let n=B_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=j_(t,e+1);r.push({location:M_(t[e]),apply:e=>i.forEach(t=>e.put(k_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:M_(u),apply:t=>t.put(k_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&j_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),w_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(M_(u)),r.push({location:M_(u),apply:e=>e.put(k_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(k_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=E_(e.name);r.push({location:e.location,apply:n=>n.put(k_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(k_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(k_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=O_();i.set(e??``,s),Bd.toReversed().forEach(e=>s.put(k_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},H_=(e,t,n)=>V_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),U_=(e,t)=>{let n=V_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},W_=(e,t)=>H_(e,t,`variable`),G_=(e,t,n)=>{let r=B_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Hd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=N_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;I_(s(void 0)).forEach((e,t)=>{t===3&&Wd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??L_(r(void 0).tokens);throw m(n,e)}I_(s(n)).forEach(a)}}C_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),Ud.forEach(a),[...i]},K_=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(K_))}},q_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],J_=(e,t)=>{try{return Up(e)}catch(n){if(!(n instanceof u))throw n;let r=hp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Y_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),X_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Z_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Q_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Z_(e),$_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Da},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),ev=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},tv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||vi(e).some(e=>tv(e,t)),nv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ls(e),n.get(e)??n.size)),n},rv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),iv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw cl(e);if(e.kind===`Number`&&!_u(e.value))throw ll(e);iv(e.kind===`Let`?[...vi(e),...rv(e.instances??[])]:vi(e))}),av=(e,t)=>{let n=Up(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(lg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Dm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=S_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Eg(e,t.print,l,t.files,s);if(!r)return;Tg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Dg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:kg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(Gd.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Tg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(iv([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...rv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Od.get(e)??Vp(t.source,e);if(r===void 0)throw m(e,n);let i=J_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&X_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw Y_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Nm(l.version).has(e)?Eg(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=q_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Uo(Hg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=xs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Jo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Da})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=q_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>tv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=xs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Da}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Da}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:$_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=zd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...lg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ro,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Q_(n.kind)===Q_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Z_(n.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Z_(e.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Pa(e),params:Fa(e),kind:zo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Na(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=q_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Na(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Na(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&X_(e,n.module);if(n&&!r)throw Y_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Na(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Ug(Ts(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Go(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Na(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>b_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=K_(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(K_),K_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,ev(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${H_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=mg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:nv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=v_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>_l(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${ba(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=U_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||q_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},ov={kind:`Boolean`,value:!0},sv={kind:`Boolean`,value:!1},cv=e=>e?ov:sv,lv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,dv=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?cv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?dv(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return dv(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return cv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return dv(`Eventually`,Cv(e.body));case`Eventually`:return dv(`Always`,Cv(e.body));default:return dv(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return cv(t)}return n.length===0?cv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?cv(!t.value):dv(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return dv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push(dv(`Always`,dv(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return lv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):dv(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(uv),n=e.flatMap(e=>e.kind===`Not`&&uv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,dv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:dv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Wv=()=>n(new x,e.error),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakMap,qv=/* @__PURE__ */ new WeakSet,Jv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yv=(e,t)=>new y(`TLC cannot handle the temporal formula ${el(e)}${t===void 0?``:`:\n${t}`}`),Xv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ul(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Xv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Xv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_l(e,n);if(t)return Zv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return es(e,(e,a)=>(i.value=Math.max(i.value,Xv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Zv=(e,t)=>{let n=Kv.get(e);if(n!==void 0)return n;Kv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Xv(e.body,void 0,t),...r.map(e=>Xv(e.set,void 0,t)));return Kv.set(e,i),i},Qv=(t,r)=>{try{return Al(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ba(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},$v=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>$v(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,el(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,ey(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ul(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:_l(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Zv(a,n)>0){if(i.has(a))throw Wv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Jv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xv(e,t,n)===3)){let t=tu(e,c),r=B(e)?void 0:_l(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,pu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Xv(e.set,t,n)===0),u=l?Qv(e.bounds,c):void 0;if(l&&u){let n=[];if(jl(e.bounds,u,t,t=>(n.push(...s(e.body,t,el(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},ey=(e,t,n)=>{let r=hu(e.definitions,Jv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&qv.add(e.binding);return r},ty=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ny=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xv(e,t,n):i;if(a===0){let r=W(e,Jv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${tl(e)}`);return cv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Wv();a.depth++;let o=f(e,t);a.depth--;let s=mv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jv(n,t),s=B(e)||_l(i,n)===void 0?ul(t,i):void 0;if(s?.kind===`Thunk`&&qv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?nu(i,a):$l(i,n);if(l?.kind!==`Closure`)throw Yv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&_l(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,pu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Yv(e)}},l=(e,t)=>{let r=Xv(e,t,n);if(!e.bounds.every(e=>Xv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Yv(e)}let a=[],o=e.kind===`Forall`;try{Ml(e.bounds,Jv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Yv(e,o&&!ba(n)?n.message:void 0)}return a.length===0?cv(o):u(e,t,pv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=mv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Xv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ey(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?dv(`Always`,fv(`Or`,dv(`Not`,f(n[0],t)),dv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,dv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,fv(`Or`,dv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,pv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Xv(e.condition,t,n)===0){let r=W(e.condition,Jv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,fv(`Or`,fv(`And`,i,f(e.consequent,t)),fv(`And`,dv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return dv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=ty(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=dv(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?dv(`Always`,dv(`Eventually`,fv(`Or`,i,a))):fv(`Or`,dv(`Eventually`,dv(`Always`,i)),dv(`Always`,dv(`Eventually`,a)))}default:throw Yv(e)}};return f(e,t)},ry=(e,t,n,r,i)=>{let a=e=>ry(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?gl(W(e.expression,a),`a temporal property predicate`):Uc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&gl(W(e.unchanged,a),`a subscript`)?!1:gl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ry(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},iy=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>iy(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return ry(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ay=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return ay(e.body);case`And`:case`Or`:return e.operands.some(ay);default:return!1}},oy=e=>e.promises.some(e=>ay(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),sy=(e,t)=>e.every((e,n)=>an(e,t[n])),cy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ly=e=>({data:e(1024),length:0,create:e}),uy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},dy=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},fy=e=>new Int32Array(e).fill(-1),py=(e,t)=>(e.edgeStarts[t]??-1)!==-1,my=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},hy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,gy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),_y=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},vy=2**53-1,yy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>ny(e.expression,e.scope,n)),a=e.map(e=>dv(`Not`,ny(e.expression,e.scope,n))),o=a.length===1?a[0]:pv(`Or`,a),s=i.length===0?o:pv(`And`,[...i,o]),c=Hv(s);if(c.length===0)throw Uv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=vv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ly(e=>new Int32Array(e)),edgeActions:ly(e=>new Uint8Array(e)),stateResults:ly(e=>new Uint8Array(e)),initial:[],firstNodes:ly(fy),lastNodes:ly(fy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Ou(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>ry(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!ry(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!ry(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=dy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=gy(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),dy(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],dy(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?uy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,uy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;uy(e.edgeTargets,a,n),r.forEach((t,n)=>uy(e.edgeActions,(a+n)*o,t)),uy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&sy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of _y(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return cy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)gy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{py(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)py(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of my(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}py(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>py(e,t)),c=[],l=t=>{let n=my(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&zv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=vy;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=vy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>hy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>my(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=cy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&hy(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(my(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=my(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:oy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of my(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};my(e,l).forEach((t,r)=>{py(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!iy(a[i].body,t,r,0,n)).map(e=>e.name))]}},by=`UnnamedAction`,xy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Sy=e=>{let t=e.range??xy;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Cy=e=>{let t=[[`name`,e.name],[`location`,Sy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},wy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Ty=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ey=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Dy=e=>e.kind===`Apply`?e.args:[],Oy=(e,t,n)=>{let r=Ey(e);if(r===void 0)return;if(B(e)){let e=ul(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=$l(r,n);return i?.kind===`Closure`?i:void 0},ky=(e,t)=>{try{return W(e,Ty(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},Ay=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&xl(e,t)&&ky(e.body,t),jy=(e,t)=>{let n=_l(e.name,t);return n?.body===e.body&&Ay(n,t)},My=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ul(t,e.name);return n?.kind===`Thunk`?n:void 0},Ny=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ul(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Py=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Fy=(e,t,n,r,i)=>{let a=Dy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Xv(e,n,i)!==0)?o():Py(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Ty(i,n))]),expression:t,scope:n}],o)},Iy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??by,location:e.location,parameters:Ny(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Iy(e.body,hu(e.definitions,Ty(r,t)),n,r,i);case`Label`:return Iy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Iy(e,t,n,r,i));case`Exists`:return Py(()=>{let o=[];return Ml(e.bounds,Ty(r,t),t=>(o.push(...Iy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Ey(e)??``),s=Oy(e,t,r);if(o)return Fy(o,e,t,s,r);if(!s)return[a()];let c=Dy(e),l=B(e)?s.name:r.instanceNames.get(Ey(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return jy(s,r)||c.some(e=>Xv(e,t,r)!==0)?u():Py(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,Ty(r,t))},parent:e}),s.scope);return Iy(s.body,e,{...s,name:l},r,i)},u)},Ly=(e,t,n,r,i)=>{let a=(e,t)=>Ly(e,t,n,r,i);if(e.kind===`Let`){a(e.body,hu(e.definitions,Ty(n,t)));return}let o=My(e,t);if(o){a(o.expression,o.scope);return}let s=Oy(e,t,n);if(s&&jy(s,n))return;if(s&&s.params.length===0){if(Xv(s.body,s.scope,n)===1){r.inits.push(wy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,pu(s,e.args,Ty(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(wy(by,e));return}let c=Xv(e,t,n);c<=1?r.inits.push(wy(by,e)):c===3&&r.temporals.push(wy(by,e))},Ry=(e,t,n,r,i)=>{let a=(t,n)=>Ry(e,t,n,r,i);if(t.kind===`Let`){a(t.body,hu(t.definitions,Ty(r,n)));return}let o=My(t,n);if(o){a(o.expression,o.scope);return}let s=Oy(t,n,r);if(s&&jy(s,r))return;if(s&&s.params.length===Dy(t).length){a(s.body,t.kind===`Apply`?pu(s,t.args,Ty(r,n)):s.scope);return}if(t.kind===`Forall`&&Py(()=>(Ml(t.bounds,Ty(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(wy(e,a)):Xv(a,n,r)<2?i.invariants.push(wy(e,a)):i.impliedTemporals.push(wy(e,t));return}let c=Xv(t,n,r);c<=1?i.impliedInits.push(wy(e,t)):c===3&&i.impliedTemporals.push(wy(e,t))},zy=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`&&!Ay(n,t)?n:void 0},By=e=>er([[`name`,e.name],[`location`,Sy(e.location)]]),Vy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:zy(e.specification,t);a&&(Ly(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Iy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$l(e.init,t);o?.kind===`Closure`&&r.inits.push(wy(e.init??``,o.body));let s=e.next===void 0?void 0:$l(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Iy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=zy(e,t);n&&r.invariants.push(wy(e,n.body))}),e.properties.forEach(e=>{let n=zy(e,t);n&&Ry(e,n.body,void 0,t,r)}),r},Hy=(e,t,n)=>Vy(e,t,n).inits,Uy=(e,t,n)=>Vy(e,t,n).actions,Wy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Gy=(e,t)=>`${e.name===by?`Action`:e.name}${t===`1.7.4`?``:Wy(e)} ${g(e.location.range??xy)}`,Ky=e=>`${e.name}${Wy(e)}`,qy=(e,t,n,r)=>{let i=Vy(e,t,r),a=e=>Ln(e.map(Cy)),o=e=>Ln(e.flatMap(e=>{let n=zy(e,t);return n?[By(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,Sy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Jy=`paired12`,Yy=(e,t=16)=>e<=t*.75?t:Yy(e,t*2),Xy=(e,t)=>{let n=Yy(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Zy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Qy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),$y=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),eb=e=>$y(e).replaceAll(`
1773
- `,`\\n`),tb=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},nb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
1766
+ `]]),_m=(e=`master`)=>e===`1.7.4`?gm:hm,vm=(t,n,r)=>new e.S(`Applying ${t} to the following value,\nwhich is not ${n}:\n${z(r)}`),ym=(t,n,r,i)=>new e.S(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${z(i)}`),bm=e=>N(e)?er(e):void 0,xm=(e,t,n)=>{let r=V(e,t,n),i=bm(r);if(!i)throw vm(n,`a function with a finite domain`,r);return i},Sm=(e,t,n)=>{let r=V(e,t,n),i=bm(r);if(!i)throw ym(t===0?`first`:`second`,n,`bag`,r);return i},Cm=(e,t)=>{if(!j(e)||!I(e))throw t();return L(e).elements},wm=e=>e.range.every(e=>typeof e==`number`&&e>0),Tm=(e,t)=>{let n=e.domain.findIndex(e=>Ct(e,t));return n===-1?void 0:e.range[n]},Em=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Dm=Em(`BagDiff`,`tlc2.value.impl.Value`,2),Om=Em(`SqSubseteq`,`tlc2.value.IBoolValue`,2),km=Em(`BagUnion`,`tlc2.value.impl.Value`,1),Am=Em(`BagOfAll`,`tlc2.value.impl.Value`,2),jm=Em(`BagCup`,`tlc2.value.impl.Value`,2),Mm=Em(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Nm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${fi(e)}`;throw mi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Pm=(e,t,n)=>{let r=Nm(e,n)+Nm(t,n);if(oi(r))throw si(`${e}+${t}`);return r},Fm=(e,t,n,r)=>{let i=Tm(n,e.domain[t]),a=Nm(e.range[t],r);return i===void 0?a:a-Nm(i,r)|0},Im=(e,t)=>un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ct(e[0],r));a?a[1]=Pm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Lm=ut([],[]),Rm=t=>[ni(`EmptyBag`,Lm),H(`IsABag`,1,e=>{let t=bm(V(e,0,`IsABag`));return t!==void 0&&wm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return xm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw vm(`BagCardinality`,`a bag`,t);return Pm(e,n,Mm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Tm(xm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ym(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Tm(xm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ym(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Sm(e,t,`(+)`);if(!wm(n))throw ym(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Im(t,jm)}),H(`\\ominus`,2,e=>{let t=Sm(e,0,`(-)`),n=Sm(e,1,`(-)`);return un(t.domain.flatMap((e,r)=>{let i=Fm(t,r,n,Dm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,t=>{let n=V(t,0,`BagUnion`),r=Cm(n,()=>vm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Lm;let i=r.map(t=>{let r=bm(t);if(!r)throw new e.S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(n)}`);return r});return Im(i,km)}),H(`\\sqsubseteq`,2,e=>{let t=xm(e,0,`\\sqsubseteq`),n=xm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Fm(t,r,n,Om)<=0)}),ri(`BagOfAll`,2,t=>{let n=ti(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(n.literalBody)}`);let r=V(t,1,`BagOfAll`),i=bm(r);if(!i)throw ym(`second`,`BagOfAll`,`function with a finite domain`,r);return Im(i.domain.map((e,t)=>ut([n.call([e])],[i.range[t]])),Am)}),H(`SubBag`,1,n=>{let r=V(n,0,`SubBag`);if(!N(r))throw new e.g(`DOMAIN expects a function but received ${z(r)}`);let i=er(r),a=rn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.g(`Attempted to apply a function to ${z(i)}, which is not in its domain`);return rn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>lr(xm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Cm(t,()=>vm(`BagToSet`,`a function with a finite domain`,t));return ut([...n],n.map(()=>1))})],zm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Bm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Vm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Hm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Um=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Wm=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Gm=e=>{if(!N(e))return!1;let t=er(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Km=(e,t)=>mi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${fi(t)}`),qm=(e,t)=>mi(e,`Cannot cast tlc2.value.impl.${fi(t)} to tlc2.value.impl.StringValue`),Jm=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ym=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Km(t,e);return`[${L(e).elements.map(e=>Zm(e,t)).join(`,`)}]`},Xm=(e,t)=>{let n=er(e),r=Gn(n);return r?`[${r.map(e=>Zm(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Jm(typeof e==`string`?e:z(e))}:${Zm(n.range[r],t)}`).join(`,`)}}`},Zm=(e,t)=>typeof e==`string`?Jm(e):typeof e==`object`?e.kind===`ModelValue`?Jm(e.name):j(e)?Ym(e,t):Xm(e,t):String(e),Qm=e=>{if(j(e))return Ym(e,zm);if(!N(e)||Gm(e))throw Km(zm,e);return Xm(e,zm)},$m=e=>{if(!N(e))throw Km(Bm,e);return Xm(e,Bm)},eh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},th=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ze(e);if(Array.isArray(e))return bn(e.map(e=>th(e,t)));if(typeof e==`object`&&e)return xn(Object.entries(e).map(([e,n])=>[Ze(e),th(n,t)]));throw mi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},nh=(e,t)=>{if(e.trim()===``)return th(null,t);try{return th(JSON.parse(e,(e,t,n)=>typeof t==`number`?eh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?mi(t,e.message):e}},rh=(e,t)=>{if(typeof e!=`string`)throw qm(t,e);return e},ih=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw mi(n,`${t} (No such file or directory)`);return r},ah=t=>[ii(`ToJson`,1,e=>Ze(Zm(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ii(`ToJsonArray`,1,e=>Ze(Qm(V(e,0,`ToJsonArray`)))),ii(`ToJsonObject`,1,e=>Ze($m(V(e,0,`ToJsonObject`)))),ii(`JsonSerialize`,2,n=>{let r=rh(V(n,0,`JsonSerialize`),Vm),i=V(n,1,`JsonSerialize`);if(!Gn(i)&&!Gm(i))throw new e.S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(i)}`);return t.writeFile?.(r,Zm(i,Vm)),!0}),ii(`ndJsonSerialize`,2,n=>{let r=rh(V(n,0,`ndJsonSerialize`),Hm),i=V(n,1,`ndJsonSerialize`),a=Gn(i);if(!a)throw new e.S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(i)}`);return t.writeFile?.(r,a.map(e=>`${Zm(e,Hm)}\n`).join(``)),!0}),ii(`JsonDeserialize`,1,e=>{let n=rh(V(e,0,`JsonDeserialize`),Um);return nh(ih(t,n,Um),Um)}),ii(`ndJsonDeserialize`,1,e=>{let n=rh(V(e,0,`ndJsonDeserialize`),Wm);return bn(ih(t,n,Wm).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>nh(e,Wm)))})],oh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,sh=1e6,ch=(t,n,r,i)=>new e.S(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${i}`),lh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ch(t,n,`nonnegative integer`,z(e));return e},uh=(e,t,n,r)=>{if(!j(e)||!I(e))throw ch(t,n,r,z(e));return L(e).elements},dh=(e,t,n,r)=>rn(Array.from({length:t},()=>rn(e.filter(()=>r.nextDouble()<n)))),fh=(e,t)=>{let n=`RandomSetOfSubsets`,r=lh(V(e,0,n),`first`,n),i=lh(V(e,1,n),`second`,n),a=uh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw ch(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw ch(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return dh(a,r,a.length===0?0:i/a.length,t.getRandom())},ph=e=>[ii(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw ch(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw mi(oh,String(n));let r=V(t,1,`RandomSubset`);if(!j(r)||!R(r)&&!I(r))throw ch(`second`,`RandomSubset`,`a finite set`,z(r));let i=sm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>sh)throw mi(oh,`Attempted to construct a set with too many elements (>${sh}).`);return rn(cm(n,r,e.getRandom(),e.version))}),ii(`RandomSetOfSubsets`,3,t=>fh(t,e)),ii(`TestRandomSetOfSubsets`,3,t=>bn(Array.from({length:5},()=>L(fh(t,e)).elements.length)))],mh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,hh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${mh})`,gh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${mh}) throws java.io.IOException`,_h=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${mh})`,vh=()=>xn([[`action`,rn([])],[`state`,rn([])]]),yh=()=>xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),bh=e=>xn([[`name`,e??`UnnamedAction`],[`location`,yh()]]),xh=(e,t,n)=>{let r=e.map((e,t)=>bn([t+1,xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>bn([r[n],t[n],e])),a=n?[bn([r[r.length-1],n.action,r[n.start]])]:[];return xn([[`action`,rn([...i,...a])],[`state`,rn(r)]])},Sh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return pm(e).get(t)},Ch=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),z(i));else throw new e.S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(r)}`)},wh=e=>e.every(e=>e!==void 0),Th=(e,t)=>xn(t.variables.map((t,n)=>[t,e[n]])),Eh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=Gc(r,t);if(e&&!n.has(e)&&(n.add(e),Eh(e.body,t,n)))return!0}return Ur(e).some(e=>Eh(e,t,n))},Dh=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[H(`AssertEq`,2,e=>{let n=V(e,0,`AssertEq`),r=V(e,1,`AssertEq`),i=Ct(n,r);return i||(t(z(`Assertion failed`,!0)),t(z(n,!0)),t(z(r,!0))),i}),xi(`AssertError`,2,t=>{let r=ti(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw mi(hh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=Si(t,0,`AssertError`)();try{Si(t,1,`AssertError`)()}catch(t){if(t instanceof e.g)return Yi(t.message,n.isTool)===i;throw t}return!1}),ii(`TLCGetOrDefault`,2,e=>{let t=V(e,0,`TLCGetOrDefault`);return Sh(n,t)??V(e,1,`TLCGetOrDefault`)}),{...ri(`TLCGetAndSet`,4,e=>{let r=V(e,0,`TLCGetAndSet`),i=Sh(n,r)??V(e,3,`TLCGetAndSet`),a=ti(e,1,`TLCGetAndSet`);return Ch(n,t,r,a.call([i,V(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ii(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!wh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw mi(gh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return bn(n.getBehavior(r).map(e=>Th(e,t.environment)))}),ii(`CounterExample`,0,()=>n.counterExample??vh()),H(`ToTrace`,1,t=>{let n=V(t,0,`ToTrace`);if(!N(n)||!Ct(lr(n),rn([`action`,`state`])))throw new e.g(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(n)}`);let r=L(sr(n,`state`)).elements.map(e=>Gn(e)??[]);return bn(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,t=>{let n=V(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.S(`The argument of ModelValue should be a string, but instead it is:\n${z(n)}`);return ct(n)}),xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),xi(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!wh(i))throw mi(_h,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||Wc(Si(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.k(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),xi(`TLCCache`,2,(e,t)=>{let n=ti(e,0,`TLCCache`),i=jr(Si(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Gp([V(e,0,`TLCFP`)])))),ii(`TLCEvalDefinition`,1,(t,n)=>{let r=V(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?Gc(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return W({kind:`Identifier`,name:r,location:i.location},n)})]},Oh=(e,t)=>[ii(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),ii(`_Counts`,0,()=>fm(t)),ii(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(fm(t),!0)),!1)}),ii(`_PrintCounts`,0,()=>(e(z(fm(t),!0)),!0))],kh=e=>String(e).padStart(2,`0`),Ah=e=>`${e.getUTCFullYear()}.${kh(e.getUTCMonth()+1)}.${kh(e.getUTCDate())}.${kh(e.getUTCHours())}${kh(e.getUTCMinutes())}${kh(e.getUTCSeconds())}`,jh=e=>un([...e].map(([e,t])=>[e,bn([t])])),Mh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Nh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Ph=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fh=(t,n,r)=>{if(t.version===`1.7.4`?!Nh.has(n)||!t.isStarted&&Ph.has(n):!t.isStarted&&Mh.has(n))throw new e.S(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return xn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return xn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return xn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Ze(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ze(Ah(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return bh(void 0);case`all`:return jh(t.registers);case`all:named`:return jh(pm(t))}if(n.startsWith(`s:`)){let r=pm(t).get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Ze(t.properties.get(n.slice(2))??n);throw new e.S(`TLCGet(${n}) was undefined.`)},Ih=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(n)}`);return Fh(t,n,r?.state)},Lh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(Rh),e.kind===`Function`&&e.range.forEach(Rh))},zh=(t,n)=>[H(`Print`,2,e=>(t(`${A(z(V(e,0,`Print`),!0,!0))} ${A(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(A(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new e.S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${A(z(V(t,1,`Assert`)))}`,e.V.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ei(e,0,`@@`),n=ei(e,1,`@@`);return dn([...ze(t),...ze(n)])}),H(`ToString`,1,e=>Ze(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return Rh(t),t}),H(`Permutations`,1,e=>{let t=Qr(e,0,`Permutations`);return rn(Lh(t).map(e=>un(t.map((t,n)=>[t,e[n]]))))}),ri(`SortSeq`,2,e=>{let t=ti(e,1,`SortSeq`);return bn($r(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?hi({...ii(`TLCGet`,1,(e,t)=>Ih(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):hi(xi(`TLCGet`,1,(e,t)=>Ih(n,Si(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ii(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Ch(n,t,r,V(e,1,`TLCSet`)),!0}),ni(`Any`,it),H(`RandomElement`,1,e=>um(Xr(e,0,`RandomElement`),n.getRandom()))],Bh=(e,t)=>e.every(e=>Yn(e,t)),Vh=rn([!1,!0]),Hh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ln(Hh(e,t,r),Hh(e,r,n))},Uh=[`\\cup`,`\\cap`,`\\`],Wh=e=>typeof e==`object`&&e.kind===`MixedSet`,Gh=e=>e.kind===`Interval`?L(e).elements:e.elements,Kh=(e,t,n)=>{let r=Gh(t);if(e!==`\\cup`){let t=e===`\\cap`;return an(r.filter(e=>Yn(e,n)===t))}if(r.length===0)return n;if(!M(n))return vt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Yn(e,t));return an([...r,...i])},qh=[ni(`TRUE`,!0),ni(`FALSE`,!1),ni(`BOOLEAN`,Vh),ni(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ai(`=`,tn),ai(`#`,(e,t)=>!tn(e,t)),H(`~`,1,e=>!Jr(e,0,`~`)),H(`<=>`,2,e=>Jr(e,0,`<=>`)===Jr(e,1,`<=>`)),H(`/\\`,2,e=>Jr(e,0,`/\\`)&&Jr(e,1,`/\\`)),H(`\\/`,2,e=>Jr(e,0,`\\/`)||Jr(e,1,`\\/`)),H(`=>`,2,e=>!Jr(e,0,`=>`)||Jr(e,1,`=>`)),H(`\\in`,2,e=>Yn(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Yn(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=Yr(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?Bh(L(t.base).elements,n.base):Bh(L(t).elements,n)}),...Uh.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(M(n)&&M(r)&&!Wh(n)&&!Wh(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?ln:e===`\\cap`?cn:sn;return Jn((e,n)=>t(L(e),L(n)),(t,n)=>Kh(e,t,n),n,r)}return M(n)?Kh(e,n,r):e!==`\\`&&M(r)?Kh(e,r,n):vt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=Yr(e,0,`UNION`),n=zt(t)?t.elements.filter(zt):[];if(!zt(t)||n.length!==t.elements.length)return vt({kind:`Union`,base:t});if(Wh(t)||n.some(Wh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Yn(t,e)||e.elements.push(t)})),an(e.elements)}return n.length===0?on:Hh(n.map(L),0,n.length)}),H(`DOMAIN`,1,t=>{let n=V(t,0,`DOMAIN`);if(!N(n))throw new e.g(`DOMAIN expects a function but received ${z(n)}`);return lr(n)})],Jh=_i(`Integers`,`Neg`,`IntValue`,1),Yh=t=>{let n=_i(t,`DotDot`,`IntervalValue`,2);return[vi(t,`+`,`Plus`,(e,t)=>e+t),vi(t,`-`,`Minus`,(e,t)=>e-t),vi(t,`*`,`Times`,(e,t)=>e*t),vi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.S(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.S(`0^0 is undefined.`);return t**n}),vi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.S(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(oi(i))throw si(`${n} \\div ${r}`);return i}),vi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.S(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),H(`..`,2,e=>({kind:`Interval`,low:gi(V(e,0,`..`),n),high:gi(V(e,1,`..`),n)}))]},Xh=Yh(`Naturals`),Zh=Yh(`Integers`),Qh=e=>{let t=Xh.indexOf(e);return t===-1?void 0:Zh[t]},$h=[ni(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Xh,bi(`<`,(e,t)=>e<t),bi(`>`,(e,t)=>e>t),bi(`<=`,(e,t)=>e<=t),bi(`>=`,(e,t)=>e>=t,`>`)],eg=[ni(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Zh,bi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=gi(V(e,0,`-`),Jh);if(oi(-t))throw si(`-${t}`);return-t})],tg=(t,n,r)=>{let i=V(t,n,r),a=Gn(i);if(!a)throw new e.S(`${r}\n${z(i)}`);return a},ng=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:tg(e,t,n)},rg=(e,t,n)=>typeof e==`string`?Ze(e.slice(t,n)):bn(e.slice(t,n)),ig=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ag=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,og=(e,t)=>{let n=jd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?hi(e,t):e}):t},sg=t=>og(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>ng(e,0,ig(``,`Len`)).length),H(`\\o`,2,t=>{let n=ng(t,0,ag(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=tg(t,1,ag(`t \\o s`,`sequence`));return bn([...n,...e])}let r=V(t,1,`\\o`);if(typeof r!=`string`)throw new e.S(`${ag(`t \\o s`,`string`)}\n${z(r)}`);return Ze(n+r)}),H(`Append`,2,e=>bn([...tg(e,0,ag(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(e,1,`Append`)])),H(`Head`,1,t=>{let n=tg(t,0,ig(``,`Head`));if(n.length===0)throw new e.S(`Attempted to apply Head to the empty sequence.`);return n[0]}),H(`Tail`,1,t=>{let n=ng(t,0,ig(``,`Tail`));if(n.length===0)throw new e.S(`Attempted to apply Tail to the empty sequence.`);return rg(n,1)}),H(`SubSeq`,3,t=>{let n=ng(t,0,ig(`first `,`SubSeq`)),r=qr(t,1,`SubSeq`),i=qr(t,2,`SubSeq`);if(r>i)return rg(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.S(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return rg(n,r-1,i)}),ri(`SelectSeq`,2,t=>{let n=ti(t,1,`SelectSeq`);return bn(tg(t,0,ig(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(r)}`);return r}))})]),cg=t=>og(`FiniteSets`,[H(`IsFiniteSet`,1,t=>{let n=V(t,0,`IsFiniteSet`);if(j(n))return Un(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.g(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${z(n)}\nis a finite set.`:`Attempted to check if the ${Fe(n)} ${z(n)} is a finite set.`)}),H(`Cardinality`,1,n=>{let r=V(n,0,`Cardinality`);if(!j(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.S(`Attempted to compute cardinality of the value\n${z(r)}`);return Vn(r,t)})]),lg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),ug=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:$h};case`Integers`:return{extends:[`Naturals`],operators:eg};case`Sequences`:return{extends:[],operators:sg(n.version)};case`FiniteSets`:return{extends:[],operators:cg(n.version)};case`TLC`:return{extends:[],operators:og(`TLC`,zh(t,n))};case`Randomization`:return{extends:[],operators:ph(n)};case`_Possible`:return{extends:[],operators:Oh(t,n)};case`Json`:return{extends:[],operators:ah(r)};case`Bags`:return{extends:[],operators:Rm(i)};case`TLCExt`:return{extends:[],operators:Dh(t,n)};default:return}},dg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),fg={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},pg=(e,t)=>{let n=fg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},mg=`$subexpression`,hg=(t,n)=>new e.D(`${t} at line ${n.line}, column ${n.column}`),gg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return gg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ur(e)){let e=gg(r,t,n);if(e)return e}},_g=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),vg=(e,t)=>{let n=e.location,r=_g(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw hg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw hg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:mg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:mg,args:e.args,location:n,resolution:$i},location:n}},yg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:$i})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:$i}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:$i};return vg({...t,params:[...t.params,...r]},a)},bg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw hg(i,a);ta.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.I(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw hg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Co(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw hg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=oa(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw hg(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&gg(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw hg(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Da(e.operand,1)!==0)throw hg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=ja(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Da(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw hg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Da(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw hg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw hg(`Unexpected subexpression selector`,a);let i=r?r.sets:Ma(n),c=i?.[Da(e.operand,i.length)];if(!c)throw hg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return yg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw hg(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return yg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw hg(`Subexpression selection failed`,a);return vg(o,s.current)},xg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Oa(e,t,n)},Sg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ur(e).some(Sg),Cg=(e,t,n,r=!1)=>{if(!Sg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Eo(e,e=>Cg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>wg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Cg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Eo(e,e=>Cg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?xg(a.name,[],void 0,t):a.kind===`Apply`?xg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=bg(o,t,a,r);return c!==a&&ea.add(c),c},wg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Cg(e.expression,t,n,!0)}))}),Tg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Eg=(e,t)=>wg(e,Tg(t.definitions),()=>!1),Dg=(e,t)=>{let n=Tg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Cg(e,n,i),o=e=>i(e)||!n(e),s=e=>Cg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return wg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?wg(e,n,o):To(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Sg(e.body))||e.assumptions.some(e=>Sg(e.expression))?{...p,definitions:e.definitions.map(e=>To(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Og=(e,t)=>`${e}${t}`,kg=(e,t,n)=>`${e}${t}${n}`,Ag=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},jg=(e,t,n)=>`${e},${t},${n}`,Mg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ng=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Pg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Fg=(e,t,n,r)=>({...Mg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ig=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Lg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Rg=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Fg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),zg=Fg(`$Set`,0,[2],[1]),Bg=Fg(`$Junction`,0,[3],[1]),Vg=Fg(`$Choose`,0,[2],[1]),Hg=Fg(`$Function`,0,[3],[1]),Ug=Fg(`$FcnApply`,0,[2,2],[1,1]),Wg=Fg(`$RcdSelect`,0,[2,0],[1,1]),Gg=Fg(`'`,2,[1],[0]),Kg=Fg(`ENABLED`,1,[2],[0]),qg=Fg(`[]`,3,[3],[0]),Jg=Fg(`$SquareAct`,2,[2,1],[0,0]),Yg=Fg(`$WF`,3,[1,2],[0,0]),Xg=Fg(`$TemporalExists`,3,[3],[0]),Zg=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Qg=e=>e.map(e=>({name:e,arity:0})),$g=(t,n)=>n.location.range?e.F(`${t}.`,n.location.range):new e.D(`${t} at line ${n.location.line}, column ${n.location.column}`),e_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),t_=e=>e.kind!==`Let`&&e.kind!==`Label`,n_=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Rg.get(e)??dg.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Mg(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(kg(e,n,t))}),t.data.constraints.forEach((e,t)=>Ng(r.constraints,t,e)),Pg(r.argConstraints,Og(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Pg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>Ig(t,r))throw new e.D(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.D(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(jg(e,n,r)),c=Mg(Math.max(t.level,...n.filter((e,n)=>Lg(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Lg(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Ng(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ng(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ng(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ng(c.constraints,e,Ig(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ng(c.constraints,e,Ig(r,a)))}))}),t.argParams.forEach(e=>{let t=Ag(e),n=o(t.operator)?.operator;n&&Ng(c.constraints,t.param,Ig(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Pg(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Pg(c.argConstraints,Og(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Pg(c.argConstraints,Og(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Ag(e),n=o(t.operator);n&&Pg(c.argConstraints,Og(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Ag(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Ag(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(kg(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(kg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(kg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Qg(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Mg();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Zg(n,Qg(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw $g(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw $g(`Action used where only temporal formula or state predicate allowed`,e);e_.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&t_(n)&&n.kind!==r)throw $g(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Ng(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Pg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.D)||n.sany?n:$g(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Mg();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Bg,n)}case`Prime`:case`Unchanged`:return c(Gg,[e.expression],t);case`Enabled`:return c(Kg,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(qg,[n])}case`If`:return c(Bg,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Bg,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Bg,[e.body],t,e.bounds.map(e=>e.set),va(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw $g(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Xg:Bg,[e.body],t,[],e.names);case`Choose`:return c(Vg,[e.body],t,e.set?[e.set]:[],_a(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(zg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(zg,[e.predicate],t,[e.bound.set],_a(e.bound.pattern));case`SetMap`:return c(zg,[e.expression],t,e.bounds.map(e=>e.set),va(e.bounds));case`FunctionConstruction`:return c(Hg,[e.body],t,e.bounds.map(e=>e.set),va(e.bounds));case`Record`:return c(Hg,e.fields.map(e=>e.value),t);case`RecordSet`:return c(zg,e.fields.map(e=>e.value),t);case`Except`:return c(zg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Ug,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(zg,e.args,t)}]);case`Bracket`:return Mg();case`FieldAccess`:return a(Wg,[o(e.record,t),{data:Mg()}]);case`BoxAction`:case`AngleAction`:return c(Jg,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Yg,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Mg()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ur(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Zg(t,Qg(e.names))),i;default:return Eo(e,(e,r)=>(a(e,n,Zg(t,Qg(r))),e)),i}},_=(e,t,n,r)=>{let i=Zg(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Mg(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Og(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(kg(e.name,n,t.name))).map(e=>jg(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Ag(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Ag(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Mg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},r_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?r_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Mg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ng(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Pg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},i_=(t,n,r,i)=>{let a=n_(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?r_(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.I(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.I(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=go([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?r_(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.P(r)}})),...r],i);if(u.length>0)throw e.P(u,!1,void 0,i)},a_=(e,t)=>e.maxLevels[t]??3,o_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=n_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ng(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ng(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Pg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Ag(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Ng(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(r_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.I(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Og(e.name,i));a!==void 0&&a_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Ag(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=a_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.P([...i.values()])}},s_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],c_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),l_=new Map(Td.flatMap(e=>e.map(t=>[t,e[0]]))),u_=e=>l_.get(e)??e,d_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},f_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(d_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},p_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),m_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:u_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:u_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},h_=(e,t)=>{let n=[];for(let r=t;;){let t=m_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},g_=e=>({line:e.line,column:e.column}),__=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=h_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},v_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,y_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},b_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&v_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&v_(e[n+1],e[n+2])?n+=v_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>y_[e])}"`:r.text)}return t},x_=e=>e[2]?.text,S_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},C_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>C_(e.modules,t)).find(Boolean),w_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(kd.has(i)?t?.(i):void 0)??Ad.get(i)??t?.(i)??Tp(e,i),s=o===void 0?[]:ee(o),c=S_(s),l=c.get(x_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Dp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>C_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},T_=(e,t)=>{let n=w_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=h_(t,e+1);r.push({location:g_(t[e]),apply:e=>i.forEach(t=>e.put(p_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:g_(u),apply:t=>t.put(p_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&h_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),c_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(g_(u)),r.push({location:g_(u),apply:e=>e.put(p_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(p_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=u_(e.name);r.push({location:e.location,apply:n=>n.put(p_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(p_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(p_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>aa(e.location,t.location)?-1:+!!aa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=f_();i.set(e??``,s),wd.toReversed().forEach(e=>s.put(p_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},E_=(e,t,n)=>T_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),D_=(e,t)=>{let n=T_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},O_=(e,t)=>E_(e,t,`variable`),k_=(t,n,r)=>{let i=w_(t,r),a=/* @__PURE__ */ new Set,o=e=>{a.add(e)},s=e=>{e.kind===`ModelValue`&&o(e.name),e.kind===`String`&&o(e.value),e.kind===`Set`&&e.elements.forEach(s)};n.constants.forEach(e=>{e.args?.forEach(s),s(e.value)}),Ed.forEach(o);let c=e=>{let t=i(e);return t.tokens.slice(t.start,t.end)},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t)return t;let n=__(c(e),e,l);return u.set(e,n),n},f=e=>l.get(e)??d(e),p=/* @__PURE__ */ new Set,m=(e,t)=>l.has(t)||p.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),ee=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;b_(c(void 0)).forEach((e,t)=>{t===3&&Od.forEach(o),o(e)});let b=d(void 0);for(;;){let t=_(b,/* @__PURE__ */ new Set)??v(b,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(p.add(`${n.key}>${r}`),y.set(n.unit,[...y.get(n.unit)??[],r]),!ee.has(r)){if(ee.add(r),i(r).tokens.length===0){let t=n.unit??x_(i(void 0).tokens);throw e.N(r,t)}b_(c(r)).forEach(o)}}s_.forEach(o);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=d(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),c(e).forEach(e=>{e.kind===`String`&&o(e.text)})};return S(void 0),Dd.forEach(o),[...a]},A_=t=>{switch(t.kind){case`Number`:try{return Ie(t.value)}catch(t){throw e.U(t,e.V.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return ct(t.name);case`Set`:return rn(t.elements.map(A_))}},j_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],M_=(t,n)=>{try{return Dp(t)}catch(r){if(!(r instanceof e.D))throw r;let i=$f(t);throw i===void 0?r:e.P([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},N_=t=>new e.D(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),P_=(t,n)=>t.location.range&&n.location.range&&{location:e.I(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.I(n.location.range)}.`},F_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,I_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:F_(e),L_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:$i},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),R_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.g(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Ct(e,r)})});if(n)return n[1];throw new e.g(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},z_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ur(e).some(e=>z_(e,t)),B_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Fo(e),n.get(e)??n.size)),n},V_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),H_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ic(e);if(e.kind===`Number`&&!Gl(e.value))throw Lc(e);H_(e.kind===`Let`?[...Ur(e),...V_(e.instances??[])]:Ur(e))}),U_=(t,n)=>{let r=Dp(n.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set,c=new Map(qh.map(e=>[e.name,e])),l=/* @__PURE__ */ new Map,u=dm(t.checkDeadlock,n.seed);u.isWarningEnabled=n.isWarningEnabled??!0,u.isTool=n.isTool??!1,u.version=n.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ee={value:0},y=e=>`${e}#${ee.value++}`,b=[],x=[],S=o_(e=>{let t=p.get(e)??ce(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),te=/* @__PURE__ */ new Map,ne=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,ie=e=>{let t=l.get(e);if(t)return t;let r=ug(e,n.print,u,n.files,c);if(!r)return;lg.get(e)?.forEach(ie);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ie(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{c.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:dg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:pg(e,t.name)??i.get(t.name)?.range})}),l.set(e,i),i},ae=e=>{if(kd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ie(e),r=lg.get(e)??[];return t&&v(e,r),t&&r.includes(`Integers`)&&ie(`Integers`),t},C=e=>(H_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...V_(e.instances)]),e.modules.forEach(C),e);C(r);let oe=(t,r)=>{let i=n.loadModule?.(t)??fd.get(t)??Tp(n.source,t);if(i===void 0)throw e.N(t,r);let a=M_(i,t);if(a.name!==t)throw e.P([{location:`Unknown location`,message:`File name '${t}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return C(a)},se=t=>{let n=_.indexOf(t.name);if(n!==-1){let r=[..._.slice(n),t.name].map(e=>`${e}.tla`);throw new e.D(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];_.push(t.name),g.push(r);let s=me(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:x,levelChecks:o});if(g.pop(),_.pop(),a.length>0)throw e.P(a,!1,void 0,x);let c=i.find(e=>r.has(e.name)),l=c&&d.get(c.name),u=l&&P_(c,l.module);if(u)throw e.P([u],!1,void 0,x);if(c)throw N_(c);return o.forEach(e=>e()),{linked:s,closure:r}},ce=(e,t)=>{let r=d.get(e);if(r)return v(e,h.get(e)??[]),r;let a=se(oe(e,t));return(_m(u.version).has(e)?ug(e,n.print,u,n.files,c):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(c.set(t.key,e),i.delete(t.key))}),d.set(e,a.linked),h.set(e,a.closure),v(e,a.closure),a.linked},w=(e,t,n,r,c)=>{let l=c?void 0:ae(e.module);if(l)return T(e,l);let u=c??ce(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=j_(u),f=`#${ee.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=ho(Eg(e,t),d,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=qo({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,bo(t,p)])),variables:new Set(u.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,c,l)=>{let u=y(`${c}@${t.name}`),f=l(u);return i.set(u,f),d.length>0&&s.add(f),e.name!==void 0&&ne.set(u,`${e.name}!${ne.get(n)??c}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:y});return E(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&te.set(r,{name:n,location:e.location}),e.name!==void 0&&re.set(r,n),r})},T=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),E=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:a.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},D=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:$i})),le=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:D(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ue=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),de=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ue(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:D(r,n),location:n}}},fe=(e,t,n,r)=>{let o=e.location,s=r?void 0:ae(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ue(n.arity);return le(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=r??ce(e.module,n),l=`#${ee.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=j_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>z_(f(e),p),h=d.map(t=>{let n=de(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=qo({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:D(e.params,o),location:o,resolution:$i}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:$i}])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:L_(a,i)),i},createName:y}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=ue(n.arity),a=[...e.params,...i];return le(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},pe=e=>[...e].flatMap(([e,t])=>{let n=i.get(t.key);return n?[{...n,name:e}]:[]}),O=/* @__PURE__ */ new Map,me=(t,o)=>{let s=Cd(t,n.loadClass?.(t.name),t===r);O.set(t.name,s.overrides);let c=s.module,l=b.length,u=new Map([...qh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...o.symbols]),d=/* @__PURE__ */ new Map,h={location:lo,errors:[],warnings:[]},g=[h],_=t=>t.forEach((t,n)=>{let r=v.get(n);if(!r){u.set(n,t),v.set(n,t);return}if(!r.range||!t.range||e.I(r.range)===e.I(t.range))return;let i=e.I(t.range),a=e.I(r.range);I_(r.kind)===I_(t.kind)?h.warnings.push({location:i,message:`Warning: the ${F_(r.kind)} of '${n}' conflicts with \nits ${F_(r.kind)} at ${a}.`}):h.errors.push({location:i,message:`The ${F_(t.kind)} of '${n}' conflicts with \nits ${F_(r.kind)} at ${a}.`})}),v=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,te=[],ne=[...c.constants],ie=c.variables.map(e=>e.name),C=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=o.modules.get(e),n=t?void 0:ae(e);if(n){_(n);return}let r=t??ce(e,c.name);ne.push(...r.constants.filter(e=>ne.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{ie.includes(e)||(ie.push(e),C.push(r.variableLocations[t]))}),_(r.exported),r.facts.forEach(e=>ee.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),te.push(r)});let oe=new Map(u),se=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],D=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});se.forEach(e=>v.set(e.name,D(e)));let le=e=>({key:de(e),arity:oa(e),params:sa(e),kind:uo(c,e)?`Theorem`:`Definition`,range:e.location.range}),ue=ne.length===0&&ie.length===0,de=e=>c===r?e.name:`${e.name}@${o.id}`,k=/* @__PURE__ */ new Map,he=()=>new Map([...o.modules,...y]),ge=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&aa(e.location,t.location)},_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ge(t)?y.get(t.name):void 0:he().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:ae(e.module);if(n)return{declarations:[],symbols:T(e,n),instancer:c.name};let r=t??ce(e.module,c.name),i=j_(r);return{declarations:i,symbols:E(e,r.exported,i,e=>e),instancer:c.name}},bound:oe,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:de,instanced:k,facts:ee,reports:g,warnings:o.warnings}),ye=e=>[...se.filter(t=>aa(t.location,e)).map(e=>[e.name,D(e)]),...c.definitions.filter(t=>aa(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),be=e=>{let t=he(),n=t.get(e.name),r=n&&P_(e,n.module);if(n&&!r)throw N_(e);o.nested.push(e);let i={location:e.location,errors:[],warnings:[]};g.push(i);let a=me(e,{id:`${o.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:o.nested,errors:i.errors,warnings:i.warnings,levelChecks:o.levelChecks});r&&i.errors.push(r),n||y.set(e.name,a),f.has(e.name)||f.set(e.name,a)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=w(e,c,ve(c),ue,he().get(e.module));k.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||v.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>be(e)}))].sort((e,t)=>aa(e.location,t.location)?-1:1).forEach(e=>e.link());let xe=Dg(Zo(c,(e,t)=>fe(e,t,c.name,_e(e))),pe(u));o.errors.push(..._o(xe,ve(xe))),xe.definitions.forEach(e=>{let t=de(e);i.set(t,e),a.set(t,!ue);let n=le(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!aa(r,e.location))&&(u.set(e.name,n),e.isLocal||v.set(e.name,n))});let Se={module:xe,constants:ne,variables:ie,variableLocations:C,visible:u,exported:v,modules:y,extended:te,facts:/* @__PURE__ */ new Set([...ee,...[...xe.theorems,...xe.assumptions].flatMap(e=>e.name??[])])};p.has(c.name)||p.set(c.name,Se);let Ce=b.splice(l).map(e=>({location:e.location,check:()=>S(e)}));return o.levelChecks.push(()=>i_(xe,{constants:new Set(ne.map(e=>e.name)),variables:new Set(ie),getDefinition:e=>i.get(u.get(e)?.key??e),getQualifiedName:e=>re.get(u.get(e)?.key??e)},Ce,x)),m.push(Se),Se},k=se(r).linked;x.length>0&&!n.isSanyReported&&n.print(e.L(x));let he=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)});let ge=[],_e=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>_e(e,t)),ge.push(...e.module.assumptions))};_e(k,/* @__PURE__ */ new Set);let ve=k.constants.map(e=>e.name),ye=k.variables,be=e=>e.module===void 0?[e.name,he(e.name)]:e.module===r.name||ve.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],xe=e=>{let t=i.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},Se=/* @__PURE__ */ new Map,Ce=/* @__PURE__ */ new Set,we=(e,t)=>{c.set(e,t),i.delete(e),Se.delete(e),Ce.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=A_(e.value);en(t),be(e).forEach(e=>{let n=xe(e);n===0?Se.set(e,t):we(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Te=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=Te.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.m(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(A_),A_(t.value)]),Te.set(n,r)}),Te.forEach(e=>be(e).forEach(t=>we(t,R_(e.name,xe(t)||e.rows[0][0].length,e.rows))));let Ee=new Map(t.substitutions.flatMap(e=>be(e).map(t=>[t,he(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,a=n.target;if(!ve.includes(r)&&!k.visible.has(r))throw new e.m(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===a))throw new e.m(`In the configuration file, the identifier ${a} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=he(a),s=i.get(o);if(!(s!==void 0||c.has(o)||Se.has(o)||ve.includes(a)||ye.includes(a)))throw new e.m(`The configuration file substitutes for ${r} with the undefined identifier ${a}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===r)?.arity??k.visible.get(r)?.arity))throw new e.m(`The configuration file substitutes for ${r} with ${a} of different number of arguments.`)});let De=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(be)),Oe=(e,t)=>{if(De.has(e))return{key:e,prefix:t};let n=o.get(e);return n&&Oe(n.source,t+n.prefix)};o.forEach((e,t)=>{let n=Oe(e.source,e.prefix),r=i.get(t);if(!n||!r)return;let a=r.kind===`Operator`?r.params:[],o=le(t,n.key,a,a.slice(n.prefix),r.location);i.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&i.set(n,o)})});let ke=ve.filter(e=>!Se.has(e)&&!Ee.has(e)&&!Ce.has(e));if(ke.length>0&&!n.isUnconfigured){let t=E_(n.source,n.loadModule,`constant`).find(e=>ke.includes(e))??ke[0];throw new e.m(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&c.forEach((e,t)=>{let n=Qh(e);n&&c.set(t,n)});let Ae={runtime:u,definitions:i,builtins:c,constants:Se,substitutions:Ee,instanceNames:ne,variables:ye,variableIndex:B_(ye,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:s,evaluators:/* @__PURE__ */ new WeakMap},je=n_({constants:new Set(Se.keys()),variables:/* @__PURE__ */ new Set([...ye,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>c.has(e))]),getDefinition:e=>Gc(e,Ae)}),Me=t=>{try{W(t,{environment:Ae,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.g)return t;throw t}};Ee.forEach((t,n)=>{let r=i.get(t),a=ve.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&je.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Me(r.body):void 0;if(a){let r=Ki(a)?``:` - specifically: ${a.message}`;throw new e.m(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),u.version!==`1.7.4`&&(u.isStarted=!0);let Ne=new Set(m.flatMap(e=>e.module.instances.map(e=>e.module))),Pe=D_(n.source,n.loadModule);return{environment:Ae,assumptions:ge,variableLocations:k.variableLocations,instanceActions:te,startupDefinitions:m.filter(e=>!Ne.has(e.module.name)||j_(e).length===0).flatMap(e=>Pe(e===k?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:k.constants,rootSymbols:k.visible,javaOverrides:m.flatMap(e=>O.get(e.module.name)??[])}},W_={kind:`Boolean`,value:!0},G_={kind:`Boolean`,value:!1},K_=e=>e?W_:G_,q_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,J_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Y_=(e,t)=>({kind:e,body:t}),X_=(e,t,n)=>({kind:e,operands:[t,n]}),Z_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Z_(e,t.operands).operands:[t])}),Q_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Q_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Q_(t)),0)}},$_=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return $_(e.body);case`And`:case`Or`:return e.operands.some($_)}},ev=/* @__PURE__ */ new WeakMap,tv={count:0},nv=e=>{let t=ev.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${tv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(nv).join(`,`)})`;default:return`${e.kind}(${nv(e.body)})`}})();return ev.set(e,n),n},rv=(e,t)=>e===t||nv(e)===nv(t),iv=(e,t)=>{let n=nv(t);return e.some(e=>e===t||nv(e)===n)},av=e=>e===`And`?`Or`:`And`,ov=(e,t)=>{switch(e.kind){case`Boolean`:return t?K_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Y_(`Not`,e):e;case`Not`:return ov(e.body,!t);case`And`:case`Or`:return Z_(t?av(e.kind):e.kind,e.operands.map(e=>ov(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Y_(n,ov(e.body,t))}}},sv=e=>{switch(e.kind){case`Boolean`:return K_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Z_(av(e.kind),e.operands.map(sv));case`Always`:return Y_(`Eventually`,sv(e.body));case`Eventually`:return Y_(`Always`,sv(e.body));default:return Y_(`Not`,e)}},cv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=cv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return K_(t)}return n.length===0?K_(!t):n.length===1?n[0]:Z_(e.kind,n)}case`Not`:{let t=cv(e.body);return t.kind===`Boolean`?K_(!t.value):Y_(`Not`,t)}case`Always`:case`Eventually`:{let t=cv(e.body);return Y_(e.kind,t.kind===e.kind?t.body:t)}default:return e}},lv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,uv=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=uv(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e.g(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Z_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=uv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=lv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Z_(`Or`,e);n.push(Y_(`Always`,Y_(`Eventually`,t)))}return Z_(`Or`,n)}case`Not`:return q_(t.body)?t:uv(sv(t.body));default:return t}},dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?dv(e.operands[0]):Z_(e.kind,e.operands.map(dv));case`Not`:return e.body.kind===`Not`?dv(e.body.body):Y_(`Not`,dv(e.body));case`Always`:case`Eventually`:case`Next`:return Y_(e.kind,dv(e.body));default:return e}},fv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return fv(e.operands[0]);let t=Math.floor(e.operands.length/2);return X_(e.kind,fv(Z_(e.kind,e.operands.slice(0,t))),fv(Z_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Y_(e.kind,fv(e.body));default:return e}},pv=(e,t)=>{e.kind===`Eventually`&&!iv(t,e)&&t.push(e),`body`in e&&pv(e.body,t),`operands`in e&&e.operands.forEach(e=>pv(e,t))},mv=e=>{let t=e.filter(J_),n=e.flatMap(e=>e.kind===`Not`&&J_(e.body)?[e.body]:[]);return!t.some(e=>iv(n,e))},hv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Y_(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.g(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},gv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Y_(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},_v=(e,t,n)=>e.flatMap(e=>{let r=gv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),vv=e=>[...new Set(e.map(nv))].sort().join(`|`),yv=(e,t)=>{let n=new Set(t.map(vv));return[...e.filter(e=>!n.has(vv(e))),...t]},bv=e=>{let t=hv(e),n=_v(t,`Always`,`And`),r=_v(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=gv(t,`Eventually`,`Or`);if(n&&!(iv(e,n.first)||iv(e,n.second)))return yv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(iv(e,t.first)||iv(e,t.second))&&!iv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!mv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=gv(t[e],`Always`,`And`);n&&(iv(t,n.first)||t.push(n.first),iv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)iv(t,e.first)&&iv(t,e.second)&&!iv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!mv(t)?[]:i(t)};return a(e)},xv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Q_(e)<=1)}),Sv=e=>{let t=bv([e]).map(xv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=vv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of bv(n)){let n=vv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(xv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Cv=(e,t)=>!iv(e,t)||iv(e,t.body),wv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Q_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=lv(t);if(r){let e=Q_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if($_(t))throw new e.g(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},Tv=(e,t)=>{let n=e.findIndex(e=>rv(e,t));return n===-1?(e.push(t),e.length-1):n},Ev=e=>{let t=uv(cv(ov(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])wv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Z_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:rv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&fv(e.formula),n=[];t&&pv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Tv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Tv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Tv(i,e))}));return{tableau:t&&Sv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Dv=()=>e.U(new e.g(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.V.livenessEvaluationFailure),Ov=()=>e.U(new e.E,e.V.error),kv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Av=/* @__PURE__ */ new WeakMap,jv=/* @__PURE__ */ new WeakSet,Mv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Nv=(t,n)=>new e.g(`TLC cannot handle the temporal formula ${Oc(t)}${n===void 0?``:`:\n${n}`}`),Pv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Rc(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Pv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Pv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Gc(e,n);if(t)return Fv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Eo(e,(e,a)=>(i.value=Math.max(i.value,Pv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return kv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Fv=(e,t)=>{let n=Av.get(e);if(n!==void 0)return n;Av.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Pv(e.body,void 0,t),...r.map(e=>Pv(e.set,void 0,t)));return Av.set(e,i),i},Iv=(t,n)=>{try{return il(t,n)}catch(t){if(!(t instanceof e.g))throw t;if(!Ki(t))return;throw e.U(new e.g(`${e.z(`tlc2.tool.EvalException`)}${t.message}`),e.V.error)}},Lv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Lv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,Oc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Rv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?Rc(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Gc(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Fv(a,n)>0){if(i.has(a))throw Ov();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Mv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Pv(e,t,n)===3)){let t=kl(e,c),r=B(e)?void 0:Gc(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,Vl(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Pv(e.set,t,n)===0),u=l?Iv(e.bounds,c):void 0;if(l&&u){let n=[];if(al(e.bounds,u,t,t=>(n.push(...s(e.body,t,Oc(e.body))),!1)),n.length===0)throw Dv();return n}return[{expression:e,scope:t,name:o}]},Rv=(e,t,n)=>{let r=Ul(e.definitions,Mv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&jv.add(e.binding);return r},zv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Bv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Pv(t,n,r):a;if(o===0){let i=W(t,Mv(r,n));if(typeof i!=`boolean`)throw new e.g(`TLC expected a boolean value, but did not find one. ${kc(t)}`);return K_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw Ov();o.depth++;let i=p(e,t);o.depth--;let s=Q_(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Mv(r,t),o=B(e)||Gc(n,r)===void 0?Rc(t,n):void 0;if(o?.kind===`Thunk`&&jv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:B(e)?Al(n,a):Dl(n,r);if(c?.kind!==`Closure`)throw Nv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&Gc(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,Vl(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.E||r&&!i;throw!(n instanceof e.g)||a?n:Nv(t)}},u=(t,n)=>{let i=Pv(t,n,r);if(!t.bounds.every(e=>Pv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Nv(t)}let o=[],s=t.kind===`Forall`;try{ol(t.bounds,Mv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.g)||r instanceof e.E)throw r;if(i<=2)return a(t,n,i);throw Nv(t,s&&!Ki(r)?r.message:void 0)}return o.length===0?K_(s):d(t,n,Z_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Q_(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),p=(e,t)=>{let n=Pv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Rv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Y_(`Always`,X_(`Or`,Y_(`Not`,p(n[0],t)),Y_(`Eventually`,p(n[1],t)))):e.operator===`~`&&!B(e)?d(e,t,Y_(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,X_(`Or`,Y_(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Z_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Pv(e.condition,t,r)===0){let n=W(e.condition,Mv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,X_(`Or`,X_(`And`,n,p(e.consequent,t)),X_(`And`,Y_(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return Y_(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=zv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Y_(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Y_(`Always`,Y_(`Eventually`,X_(`Or`,i,a))):X_(`Or`,Y_(`Eventually`,Y_(`Always`,i)),Y_(`Always`,Y_(`Eventually`,a)))}default:throw Nv(e)}};return p(t,n)},Vv=(t,n,r,i,a)=>{let o=e=>Vv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?Wc(W(t.expression,r),`a temporal property predicate`):_c(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&Wc(W(t.unchanged,e),`a subscript`)?!1:Wc(W(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Vv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.g(`TLC cannot evaluate a temporal formula in a single step`)}},Hv=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Hv(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Vv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Uv=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Uv(e.body);case`And`:case`Or`:return e.operands.some(Uv);default:return!1}},Wv=e=>e.promises.some(e=>Uv(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),Gv=(e,t)=>e.every((e,n)=>Tt(e,t[n])),Kv=e=>e.filter((t,n)=>n===0||e[n-1]!==t),qv=e=>({data:e(1024),length:0,create:e}),Jv=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},Yv=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Xv=e=>new Int32Array(e).fill(-1),Zv=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Qv=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},$v=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,ey=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),ty=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},ny=2**53-1,ry=(t,n,r,i)=>{if(t.length===0)return;let a=n.map(e=>Bv(e.expression,e.scope,r)),o=t.map(e=>Y_(`Not`,Bv(e.expression,e.scope,r))),s=o.length===1?o[0]:Z_(`Or`,o),c=a.length===0?s:Z_(`And`,[...a,s]),l=Ev(c);if(l.length===0)throw Dv();let u=/* @__PURE__ */ new Map,d=l.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=nv(e),n=u.get(t)??u.size;return u.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:qv(e=>new Int32Array(e)),edgeActions:qv(e=>new Uint8Array(e)),stateResults:qv(e=>new Uint8Array(e)),initial:[],firstNodes:qv(Xv),lastNodes:qv(Xv),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),f={multiplier:1},p=!nu(r),m={environment:r},h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{r.runtime.setLivenessSource(e);let n=t();return r.runtime.setLivenessSource(void 0),n},v=(e,t)=>Vv(e,t,void 0,m.environment,p?g(t):/* @__PURE__ */ new Map),ee=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),y=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!Vv(e,n,r,m.environment,/* @__PURE__ */ new Map));let i=g(n),a=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,a);let o=a.get(r)??new Int8Array(u.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!Vv(t[a],n,r,m.environment,i)),o[e]))}),b=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),x=(e,t)=>{if(r.runtime.version===`1.7.4`)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},S=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Yv(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=ey(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Yv(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],Yv(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?Jv(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Jv(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;Jv(e.edgeTargets,a,n),r.forEach((t,n)=>Jv(e.edgeActions,(a+n)*o,t)),Jv(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let r={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(i.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Gv(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(r.slots,t)}a(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*f.multiplier&&f.multiplier++,r.slots.filter(e=>e!==void 0)},ae=(e,t,n,r,a)=>{let o=ee(e,r,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?y(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let i of s.successors){if(!b(t,i,r,n))continue;if(x(t,i)&&e.errorNode===void 0&&S(e)){e.errorNode=a;return}let o=te(e,r,i);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,r,i);l.push(s),c.push(u),o===void 0&&ae(e,t,n,r,s)}for(let a of i.getSuccessors(r,n)){let i=y(e,r,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!b(t,n,r,a.state)||a.index===-1)continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(i),s===void 0&&o&&ae(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},C=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>b(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ty(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ae(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return Kv(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ey(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{Zv(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)Zv(t,e)&&(i.push(e),r.set(e,-1));for(let e=0;e<i.length;e++){let a=i[e];for(let e of Qv(t,a))if(!(e===a&&t.solution.tableau)){if(e===n){let e=[n];for(let t=a;t!==-1;t=r.get(t)??-1)e.push(t);return e}Zv(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.g(`Couldn't re-create liveness trace (path) starting at: ${n}`)},ce=(t,n)=>{let r=t.solution,i=r.actionChecks.length,a=(e,n,r)=>t.edgeActions.data[(t.edgeStarts[e]+n)*i+r]===1,o=(e,t)=>n.eventuallyAlways.every(n=>a(e,t,n)),s=new Float64Array(t.nodeStates.length).fill(-1),c=t.initial.filter(e=>Zv(t,e)),l=[],u=e=>{let n=Qv(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&Cv(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=ny;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let n=i;;n=l.pop()??e){c.add(n);let r=f.get(t.nodeStates[n]);if(r?r.push(n):f.set(t.nodeStates[n],[n]),s[n]=ny,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>$v(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>Qv(t,n).some((t,r)=>c.has(t)&&o(n,r)&&a(n,r,e)))),g=r.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(e,c,f)},p=(i,s,c)=>{let l=Kv(se(t,i).reverse().map(e=>t.nodeStates[e])),u=[],f=/* @__PURE__ */ new Set([i]),p=n.infinitelyOftenStates.map(()=>!1),h=n.infinitelyOftenActions.map(()=>!1),g=r.promises.map(()=>!1),_={count:p.length+h.length+g.length},v={node:i},ee=e=>s.has(e),y=e=>{u.push(v.node),v.node=e};for(;_.count>0;){let i=_.count;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&$v(t,v.node,e)&&(p[n]=!0,_.count--)}),r.promises.forEach((e,t)=>{!g[t]&&d(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let r={last:-1,unvisited:-1},s=_.count;if(Qv(t,v.node).some((e,i)=>{if(c.has(t.nodeStates[e])){if(!ee(e)||!o(v.node,i))return!1;r.last=e,n.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&a(v.node,i,e)&&(h[t]=!0,_.count--)})}return _.count<s?(y(e),f.clear(),!0):(ee(e)&&!f.has(e)&&(r.unvisited=e),!1)}))break;if(_.count<i){y(r.last),f.clear();break}for(;r.unvisited===-1;){let n=u.pop();if(n===void 0)throw new e.g(`TLC failed to build the counterexample of a liveness property`);v.node=n,r.unvisited=Qv(t,n).find(e=>ee(e)&&!f.has(e))??-1}y(r.unvisited),f.add(r.unvisited)}}let b=m(i,v.node,c,o);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];b[b.length-1]!==n&&b.push(n)}let x=l[l.length-1];return b[b.length-1]===x&&b.pop(),{prefix:l.slice(0,-1),cycle:[x,...b.reverse()],isCycleConstrained:Wv(r)}},m=(n,r,i,a)=>{if(r===n)return[];let o=t.nodeStates[r],s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set([o]),l=[];for(let r=o,u=-1,d=0;;d++){for(let e of i.get(r)??[])for(let[d,f]of Qv(t,e).entries()){if(f===e||!a(e,d))continue;if(f===n){let e=[];for(let t=r,n=u;t!==o;)e.push(t),t=n,n=s.get(t)??-1;return e.push(o),e}let p=t.nodeStates[f];i.has(p)&&!c.has(p)&&(c.add(p),l.push([p,r]))}s.set(r,u);let f=l[d];if(f===void 0)throw new e.g(`TLC failed to build the counterexample of a liveness property`);r=f[0],u=f[1]}};for(let e=0;e<c.length;e++){let n=[c[e],-1,0],r={link:0};for(;n.length>=3;){let e=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===e){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??e,e));continue}if(s[a]!==-1){n.push(Math.min(e,s[a]));continue}s[a]=r.link,n.push(e,a,-42),l.push(a);let u={value:r.link++};Qv(t,a).forEach((e,r)=>{Zv(t,e)&&(o(a,r)?s[e]===-1?n.push(e,-1):u.value=Math.min(u.value,s[e]):s[e]===-1&&c.push(e))}),n.push(u.value)}}};return{branches:d.length,addInitialState:(e,t,n)=>{m.environment=n??r,h.states.clear(),h.actions.clear();try{for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)b(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}}finally{m.environment=r}},addState:(e,t,n,i)=>{m.environment=i??r,h.states.clear(),h.actions.clear();try{let r=ie(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=ee(n,e,t),o=n.solution.tableau,s=o?C(n,o,r,i,a,e):oe(n,r,i,a,e);if(s)return s}return}finally{m.environment=r}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,i)=>!Hv(o[i].body,e,n,0,r)).map(e=>e.name))]}},iy=`UnnamedAction`,ay={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},oy=e=>{let t=e.range??ay;return xn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},sy=e=>{let t=[[`name`,e.name],[`location`,oy(e.location)]];return e.parameters.length===0?xn(t):xn([...t,[`context`,xn(e.parameters)],[`parameters`,bn(e.parameters.map(e=>e[0]))]])},cy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),ly=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),uy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,dy=e=>e.kind===`Apply`?e.args:[],fy=(e,t,n)=>{let r=uy(e);if(r===void 0)return;if(B(e)){let e=Rc(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Dl(r,n);return i?.kind===`Closure`?i:void 0},py=(t,n)=>{try{return W(t,ly(n,void 0)),!0}catch(t){if(t instanceof e.h)return!1;throw t}},my=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Yc(e,t)&&py(e.body,t),hy=(e,t)=>{let n=Gc(e.name,t);return n?.body===e.body&&my(n,t)},gy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=Rc(t,e.name);return n?.kind===`Thunk`?n:void 0},_y=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Rc(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),vy=(t,n)=>{try{return t()}catch(t){if(t instanceof e.h)return n();throw t}},yy=(e,t,n,r,i)=>{let a=dy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Pv(e,n,i)!==0)?o():vy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,ly(i,n))]),expression:t,scope:n}],o)},by=(e,t,n,r,i)=>{let a=()=>({name:n?.name??iy,location:e.location,parameters:_y(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return by(e.body,Ul(e.definitions,ly(r,t)),n,r,i);case`Label`:return by(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>by(e,t,n,r,i));case`Exists`:return vy(()=>{let o=[];return ol(e.bounds,ly(r,t),t=>(o.push(...by(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(uy(e)??``),s=fy(e,t,r);if(o)return yy(o,e,t,s,r);if(!s)return[a()];let c=dy(e),l=B(e)?s.name:r.instanceNames.get(uy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return hy(s,r)||c.some(e=>Pv(e,t,r)!==0)?u():vy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,ly(r,t))},parent:e}),s.scope);return by(s.body,e,{...s,name:l},r,i)},u)},xy=(e,t,n,r,i)=>{let a=(e,t)=>xy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Ul(e.definitions,ly(n,t)));return}let o=gy(e,t);if(o){a(o.expression,o.scope);return}let s=fy(e,t,n);if(s&&hy(s,n))return;if(s&&s.params.length===0){if(Pv(s.body,s.scope,n)===1){r.inits.push(cy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Vl(s,e.args,ly(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(cy(iy,e));return}let c=Pv(e,t,n);c<=1?r.inits.push(cy(iy,e)):c===3&&r.temporals.push(cy(iy,e))},Sy=(e,t,n,r,i)=>{let a=(t,n)=>Sy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Ul(t.definitions,ly(r,n)));return}let o=gy(t,n);if(o){a(o.expression,o.scope);return}let s=fy(t,n,r);if(s&&hy(s,r))return;if(s&&s.params.length===dy(t).length){a(s.body,t.kind===`Apply`?Vl(s,t.args,ly(r,n)):s.scope);return}if(t.kind===`Forall`&&vy(()=>(ol(t.bounds,ly(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(cy(e,a)):Pv(a,n,r)<2?i.invariants.push(cy(e,a)):i.impliedTemporals.push(cy(e,t));return}let c=Pv(t,n,r);c<=1?i.impliedInits.push(cy(e,t)):c===3&&i.impliedTemporals.push(cy(e,t))},Cy=(e,t)=>{let n=Gc(e,t);return n?.kind===`Operator`&&!my(n,t)?n:void 0},wy=e=>xn([[`name`,e.name],[`location`,oy(e.location)]]),Ty=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Cy(e.specification,t);a&&(xy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...by(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Dl(e.init,t);o?.kind===`Closure`&&r.inits.push(cy(e.init??``,o.body));let s=e.next===void 0?void 0:Dl(e.next,t);return s?.kind===`Closure`&&r.actions.push(...by(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Cy(e,t);n&&r.invariants.push(cy(e,n.body))}),e.properties.forEach(e=>{let n=Cy(e,t);n&&Sy(e,n.body,void 0,t,r)}),r},Ey=(e,t,n)=>Ty(e,t,n).inits,Dy=(e,t,n)=>Ty(e,t,n).actions,Oy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,ky=(t,n)=>`${t.name===iy?`Action`:t.name}${n===`1.7.4`?``:Oy(t)} ${e.I(t.location.range??ay)}`,Ay=e=>`${e.name}${Oy(e)}`,jy=(e,t,n,r)=>{let i=Ty(e,t,r),a=e=>rn(e.map(sy)),o=e=>rn(e.flatMap(e=>{let n=Cy(e,t);return n?[wy(n)]:[]}));return xn([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,rn(t.variables.map((e,t)=>xn([[`name`,e],[`location`,oy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},My=`paired12`,Ny=(e,t=16)=>e<=t*.75?t:Ny(e,t*2),Py=(e,t)=>{let n=Ny(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Fy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Iy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Ly=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Ry=e=>Ly(e).replaceAll(`
1767
+ `,`\\n`),zy=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},By=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
1774
1768
  `,r?``:`node [shape=box,style=rounded]
1775
- `,e.colorize?`edge [colorscheme="${Jy}"]\n`:``,`nodesep=0.35;
1769
+ `,e.colorize?`edge [colorscheme="${My}"]\n`:``,`nodesep=0.35;
1776
1770
  `,`subgraph cluster_graph {
1777
1771
  `,`color="white";
1778
1772
  `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
1779
- `,`node [ labeljust="l",colorscheme="${Jy}",style=filled,shape=record ]\n`,...Xy([...o.keys()],Qy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Xy([...a],e=>e[0]).map(e=>`{rank = same; ${Xy([...e[1]],Zy).map(e=>`${e};`).join(``)}}\n`),`}
1780
- `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${eb(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?$y(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${eb(n.getText())}"`;i.push(`${n.fingerprint} [label="${eb(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},rb=(e,t,n)=>e.dot?nb(e,t,n):tb(e,t),ib=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ab=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},ob=t=>n(new y(`${s}${t}`),e.error),sb=e=>{let t=Ar(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw ob(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},cb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(cb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},lb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ub=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw ob(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!N(a)||!I(a))throw ob(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw ob(`The symmetry values must be function records.`);let s=o.map(sb),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=cb(lb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ua.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ib(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ab(n,e),r=ib(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!lb(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},db=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=mb(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(mb(e[r],t));return a}},fb=(e,t)=>{let n=[],r=[];for(let i of e){let e=mb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},pb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,mb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=pb(e);if(n===0||n>64)return hb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=hb(e,t),a=i!==e&&an(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},hb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=fb(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Ar(e),r=db(n.domain,t),i=db(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=db(r.elements,t);return i?Ln(i):r},gb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},_b=(e,t,n)=>e.images[t]??=mb(e.images[0],n.permutations[t-1]),vb=(e,t,n,r)=>{let i=gb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(_b(i,t,r),_b(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},yb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?vb(i,t,n,r):0;if(o!==0)return o<0}return!1},bb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>yb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?_b(gb(e,t),r,t):e)},xb=(e,t)=>e*((t-e)/2**64),Sb=e=>e.includes(`.`)?e:`${e}.0`,Cb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Sb(String(e));let[n,r]=e.toExponential().split(`e`);return`${Sb(n)}E${r.replace(`+`,``)}`},wb=e=>e!==void 0&&e>=`0`&&e<=`9`,Tb=e=>{if(e===0)return`0.0`;let t=Cb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;wb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;wb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;wb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(wb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Eb(n.result));wb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Eb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Eb(r)}.`:n===`9`?`${Eb(r)}0`:`${r}${Number(n)+1}`},Db=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Ob=(e,t,n)=>{if(xb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},kb=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Ab=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),jb={line:0,column:0},Mb=`Failed to recover the initial state from its fingerprint.`,Nb=`Failed to recover the next state from its fingerprint.`,Pb=e=>({kind:`Identifier`,name:e,location:jb}),Fb=/* @__PURE__ */ new Set([`name`,`property`]),Ib=(e,t,n)=>{let r=_l(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Fb.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},Lb=(e,t,n)=>{if(xl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Pb(e),ox(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Rb=(e,t,n)=>{let r=Ib(e,t,n);if(Lb(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},zb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Ib(e,t,n),i=r?Lb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},Bb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Vb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Yl(e.startupDefinitions,r),t.invariants.forEach(e=>{zb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Hb=(t,r)=>{let i=v_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>_l(e,r)});return t.flatMap(t=>{let a=zb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
1773
+ `,`node [ labeljust="l",colorscheme="${My}",style=filled,shape=record ]\n`,...Py([...o.keys()],Iy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Py([...a],e=>e[0]).map(e=>`{rank = same; ${Py([...e[1]],Fy).map(e=>`${e};`).join(``)}}\n`),`}
1774
+ `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Ry(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Ly(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Ry(n.getText())}"`;i.push(`${n.fingerprint} [label="${Ry(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},Vy=(e,t,n)=>e.dot?By(e,t,n):zy(e,t),Hy=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Uy=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Wy=t=>e.U(new e.g(`${e.M}${t}`),e.V.error),Gy=e=>{let t=er(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw Wy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Ky=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Ky);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},qy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Jy=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.m(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Wy(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!j(o)||!I(o))throw Wy(`The symmetry operator must specify a set of functions.`);let s=L(o).elements;if(!s.every(N))throw Wy(`The symmetry values must be function records.`);let c=s.map(Gy),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=Ky(qy(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ii.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Hy(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Uy(n,e),r=Hy(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!qy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>P(e)&&h.has(e.name))})),f.size===0)return;let _=Math.max(256,Math.floor(4194304/f.size));return{permutations:[...f.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:_})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:_}},Yy=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Qy(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(Qy(e[r],t));return a}},Xy=(e,t)=>{let n=[],r=[];for(let i of e){let e=Qy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(ot);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(ot(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Zy=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Qy=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Zy(e);if(n===0||n>64)return $y(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=$y(e,t),a=i!==e&&Tt(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},$y=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Xy(e.elements,t);return n?lt(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=er(e),r=Yy(n.domain,t),i=Yy(n.range,t)??n.range;if(r){let e=un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?ut(n.domain,e.range):e}return i===n.range?n:ut(n.domain,i)}if(n===`Interval`||!j(e)||!I(e))return e;let r=L(e),i=Yy(r.elements,t);return i?rn(i):r},eb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},tb=(e,t,n)=>e.images[t]??=Qy(e.images[0],n.permutations[t-1]),nb=(e,t,n,r)=>{let i=eb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=ot(tb(i,t,r),tb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},rb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?nb(i,t,n,r):0;if(o!==0)return o<0}return!1},ib=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>rb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?tb(eb(e,t),r,t):e)},ab=(e,t)=>e*((t-e)/2**64),ob=e=>e.includes(`.`)?e:`${e}.0`,sb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ob(String(e));let[n,r]=e.toExponential().split(`e`);return`${ob(n)}E${r.replace(`+`,``)}`},cb=e=>e!==void 0&&e>=`0`&&e<=`9`,lb=e=>{if(e===0)return`0.0`;let t=sb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;cb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;cb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;cb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(cb(t[n.next])&&Number(t[n.next])>=5&&(n.result=ub(n.result));cb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},ub=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${ub(r)}.`:n===`9`?`${ub(r)}0`:`${r}${Number(n)+1}`},db=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},fb=(e,t,n)=>{if(ab(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},pb=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},mb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),hb={line:0,column:0},gb=`Failed to recover the initial state from its fingerprint.`,_b=`Failed to recover the next state from its fingerprint.`,vb=e=>({kind:`Identifier`,name:e,location:hb}),yb=/* @__PURE__ */ new Set([`name`,`property`]),bb=(t,n,r)=>{let i=Gc(n,r);if(!i)throw new e.m(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.m(yb.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},xb=(t,n,r)=>{if(Yc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return W(vb(t),Wb(r,void 0,void 0))}catch(t){if(t instanceof e.g||e.B(t))return;throw t}},Sb=(t,n,r)=>{let i=bb(t,n,r);if(xb(n,i,r)!==void 0)throw new e.m(`The ${t} ${n} cannot be a constant.`);return i},Cb=(t,n,r)=>{let i=r.constants.has(n)?void 0:bb(t,n,r),a=i?xb(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.m(`The ${t} of ${n} is equal to ${z(a)}`);return a===void 0?i:void 0},wb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Tb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Cl(e.startupDefinitions,r),t.invariants.forEach(e=>{Cb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Eb=(t,n)=>{let r=n_({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>Gc(e,n)});return t.flatMap(t=>{let i=Cb(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1781
1775
  Note that a bug can cause TLC to incorrectly report this error.
1782
1776
  If you believe your TLA+ or PlusCal specification to be correct,
1783
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Pb(t),scope:void 0}]})},Ub=(e,t)=>{if(!P(e))return;let n=Ar(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Wb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Wb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_l(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Wb(n.body,t)}return[e]},Gb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xv(r,e.scope,t)>0)return!1;let i=W(r,ox(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Kb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Rb(t,e,r),Pb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Ib(`name`,t.specification,r),c=Lb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if($v(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Gb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Xv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${el(c.expression)}`),e.error);let l=Xv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:jb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},qb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=zb(`property`,e,t);if(!i)return;Xv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;$v(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Gb(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Xv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?_l(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Xv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Jb=(e,t,n)=>t.flatMap(t=>zb(e,t,n)?[{name:t,expression:Pb(t),scope:void 0}]:[]),Yb=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Xb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Rb(`possible`,n,t);let i=Pb(n);if(Xv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Zb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Qb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_l(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},$b=(e,t)=>e.flatMap(e=>Wb(e.expression,t).map(n=>{let r=e.scope===void 0?wd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Zb(n,r,t),predicate:Qb(e.expression,t)}})),ex=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},tx=/[\u0100-\uffff]/,nx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),rx=e=>e.kind===`String`?tx.test(e.value):e.kind===`Set`&&e.elements.some(rx),ix=e=>e.kind===`String`&&tx.test(e.value)||e.kind===`Apply`&&nx.has(e.operator)||vi(e).some(ix),ax=(e,t)=>e.constants.some(e=>rx(e.value)||(e.args??[]).some(rx))||[...t.definitions.values()].some(e=>ix(e.body)||e.kind===`Function`&&e.bounds.some(e=>ix(e.set))),ox=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),sx=(e,t,n)=>gl(W(e,t),n),cx=(e,t,n=lx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},lx=(e,t)=>{let n=e.kind===`Identifier`?_l(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?$c(i):tl(r)}`},ux=(e,t)=>cx(e.expression,t,(n,r)=>(cx(e.predicate,t),lx(n,r))),dx=()=>{},fx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=sx(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),px=(e,t,n)=>{try{return sx(e,ox(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},mx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=px(n.expression,t,`an assumption`);if(e)return{name:el(n.expression),trace:[],message:e.message}}},hx=(t,r,i,a)=>{let o=Hb(t.invariants,r),c=Kb(t,r),l=qb(t,r,a),u=$b([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ma:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=$b(Jb(`constraint`,t.constraints,r),r),m=Jb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Ib(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Ib(`periodic`,t.periodic,r);let h=Xb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:ub(t.symmetry,r,t.substitutions);t.view!==void 0&&Ib(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Pb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:jb};return{...e,unchanged:t}}),x=e=>Xv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,ox(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:bb(e,g,t);return sm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=ax(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Yb(e.name,r),n=t?` at ${$c(t)}`:``;return{name:e.name,code:ua.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:dt(z(Om(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=um(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:bb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(ex(a,t,i))return!1;try{let e=ox(r,t,void 0,a.scope),n=a.membership;return i&&n?!kr(t[n.variable],i[n.variable],W(n.set,e)):!ux(a,e)}catch(t){throw i?Sx(n(t,e.safetyEvaluationFailure),ua.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>cx(n,ox(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>cx(e.predicate,ox(n,t,void 0,e.scope)))&&m.every(r=>cx(r.expression,ox(n,e,t,r.scope))))||r())||d.every(e=>cx(e.predicate,ox(n,t,void 0,e.scope))))&&b.every(r=>cx(r.box,ox(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>ex(n,e,t)||ux(n,ox(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!cx(t.expression,ox(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!cx(n.action,ox(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${el(n.box)}`)&&!sx(n.unchanged,ox(r,e,t,n.scope),`a subscript`)}catch(e){throw Sx(gx(e),ua.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>cx(n.expression,ox(r,e,t),e=>`${s}${lx(e,r)}`)),trackStatePossible:ee.length===0?dx:e=>fx(ee,S,ox(r,e,void 0)),trackActionPossible:te.length===0?dx:(e,t)=>fx(te,S,ox(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=_l(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=px(Pb(e),r,`a postcondition`);if(!t)continue;let n=Yb(e,r),i=n?` at ${$c(n)}`:``;return t.message===void 0?{name:e,code:ua.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ua.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},gx=e=>e instanceof S?n(e,e.exitCode):e,_x=/* @__PURE__ */ Error(`The replay stopped`),vx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),yx=t=>{let n=ya(t.message);return n&&!n.isEvalException&&vx.has(n.code)?e.configParseError:oe(t)},bx=t=>{let n=t.cause;return n instanceof y?bx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},xx=/* @__PURE__ */ new WeakMap,Sx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return xx.set(i,{code:t,headline:r,inner:e}),i},Cx=s.slice(0,s.indexOf(`
1784
- `)),wx=`${s}tlc2.tool.EvalException: `,Tx=`${s}util.Assert$TLCRuntimeException: `,Ex=o(`tlc2.tool.EvalException`),Dx=e=>ba(e)?wx:Tx,Ox=e=>{try{return e()}catch(e){throw e instanceof y?ba(e)?new y(`${Ex}${e.message}`):ya(e.message)?e:new y(`${s}${e.message}`):e}},kx=[wx,Tx,s,Ex],Ax=(e,t)=>{let n=xx.get(e);if(n)return`${n.headline}\n${Ax(n.inner,t)}`;let r=e.message,i=kx.find(e=>r.startsWith(e))??``;return`${i}${Ca(r.slice(i.length),t)}`},jx=(e,t)=>{let n=xx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Ax(e,!0)};if(t&&ba(e))return{code:ya(r)?.code??ua.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Cx)?s:``;return{code:ua.general,message:`${i}${r}`,toolMessage:`${i}${Ax(e,!0)}`}},Mx=e=>{let t=e.dump&&rb(e.dump,e.writeFile,e.version);try{return Px(e,t)}catch(e){throw c(e)?Nx():e}finally{t?.close()}},Nx=()=>n(new x,e.error),Px=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(G_(t.source,o,t.loadModule)),kt(t.version);let p=av(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Vb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>qy(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Ob(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=hx(o,m,()=>W_(t.source,t.loadModule),t.onProgress),D=()=>mx(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Cy(t):Ih(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Lh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Uy(o,m,p.instanceActions),_e=e=>{let t=Uu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Xr(e).find(e=>Yr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Yr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if($s(Hy(o,m,p.instanceActions),r,i=>{if(Bb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),_x}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ec(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:Ky(s)}:void 0),n}))throw _x})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Ox(()=>yy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Kc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=_i(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Rb(`alias`,e,m).body,i=W(Pb(e),ox(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Ub(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Ca(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>qc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Gy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Gc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=qc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Du(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Mb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Mb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:bx(t):n.isInitial?yx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...jx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ua.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Gy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Nb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Nb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hr(t,Zr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Yr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>hi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>hi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Ky(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,Ab(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Wc(me.init,m,e=>{Bb(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Kc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Kc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Nx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(gx(e),Ab(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!xx.has(n))return lt.result=Ge(new y(`${Dx(n)}${n.message}`,n),Ab({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Yr(e)!==void 0)&&n instanceof y?jx(ba(n)?new y(`${Ex}${n.message}`):n,!0):void 0;lt.result=Ge(n,Ab(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:Ab(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:Ab(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${ba(i)?Ex:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ua.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=_l(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ua.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${$c(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Gy(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Cy(d.result):Ih(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Fx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ix=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ii(e[t]),1540483477);t[0]=Fx(n)||1,t[1]=Fx(r)},Lx=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Rx=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},zx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Bx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Rx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Vx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Hx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Rx(t,n);return{slots:t,used:e.used}},Ux=[void 0,`lambda`,`tuple`,`record`],Wx=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Lr(e.domain);return t?(r(7),r(Ux.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Ux.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Gx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=Ux[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return hp}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Ca}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Mm}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Vp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return qc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return _i}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Ta}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return hi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return da}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return el}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Du}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Gp}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Gc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return pa}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return W_}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Nm}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ya}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ea}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return vi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return xb}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Hx}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return H_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ix}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return mx}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Bb}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Ob}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Db}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return zx}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Vd}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Wp}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Mx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Tb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Wx}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Bx}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Vb}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return C}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Lx}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Vx}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Gx}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Ce}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return hx}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return kb}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return jm}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return G_}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return av}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Sa}});
1777
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.U(new e.m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.V.safetyEvaluationFailure)}return[{name:t,expression:vb(t),scope:void 0}]})},Db=(e,t)=>{if(!N(e))return;let n=er(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Ob=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ob(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Gc(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ob(n.body,t)}return[e]},kb=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Pv(i,t.scope,n)>0)return!1;let a=W(i,Wb(n,void 0,void 0,t.scope));if(a===!1)throw new e.m(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.m(`The operator ${i.name}, which equals ${z(a)},\ncannot be used as a ${r}`);return!0},Ab=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Sb(t,e,n),vb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new e.m(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=bb(`name`,t.specification,n),s=xb(t.specification,o,n);if(s!==void 0)throw new e.m(`The value of ${t.specification} is equal to ${z(s)}`);if(Lv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(kb(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.U(new e.m(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.V.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Pv(s.expression,o.scope,n)<2)throw e.U(new e.g(`TLC cannot handle the temporal formula ${Oc(s.expression)}`),e.V.error);let c=Pv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.m(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:hb},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},jb=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Cb(`property`,t,n);if(!a)return;Pv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Lv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(kb(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Pv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!B(e)?Gc(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Pv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.m(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Mb=(e,t,n)=>t.flatMap(t=>Cb(e,t,n)?[{name:t,expression:vb(t),scope:void 0}]:[]),Nb=(e,t)=>{let n=Gc(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Pb=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.m(`_POSSIBLE lists ${r} more than once`);Sb(`possible`,r,n);let a=vb(r);if(Pv(a,void 0,n)===3)throw new e.m(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),Fb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Ib=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Gc(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Lb=(e,t)=>e.flatMap(e=>Ob(e.expression,t).map(n=>{let r=e.scope===void 0?cd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Fb(n,r,t),predicate:Ib(e.expression,t)}})),Rb=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},zb=/[\u0100-\uffff]/,Bb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Vb=e=>e.kind===`String`?zb.test(e.value):e.kind===`Set`&&e.elements.some(Vb),Hb=e=>e.kind===`String`&&zb.test(e.value)||e.kind===`Apply`&&Bb.has(e.operator)||Ur(e).some(Hb),Ub=(e,t)=>e.constants.some(e=>Vb(e.value)||(e.args??[]).some(Vb))||[...t.definitions.values()].some(e=>Hb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Hb(e.set))),Wb=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Gb=(e,t,n)=>Wc(W(e,t),n),Kb=(t,n,r=qb)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.g(r(t,n.environment));return i},qb=(e,t)=>{let n=e.kind===`Identifier`?Gc(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Dc(i):kc(r)}`},Jb=(e,t)=>Kb(e.expression,t,(n,r)=>(Kb(e.predicate,t),qb(n,r))),Yb=()=>{},Xb=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Gb(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Zb=(t,n,r)=>{try{return Gb(t,Wb(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e.g)return{message:t.message};throw t}},Qb=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Zb(n.expression,t,`an assumption`);if(e)return{name:Oc(n.expression),trace:[],message:e.message}}},$b=(t,n,r,i)=>{let a=Eb(t.invariants,n),o=Ab(t,n),s=jb(t,n,i),c=Lb([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.m(n.runtime.version===`1.7.4`?Bi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.m(`The configuration file did not specify the next state predicate.`);let d=Lb(Mb(`constraint`,t.constraints,n),n),f=Mb(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&bb(`rlreward`,t.rlReward,n),t.periodic!==void 0&&bb(`periodic`,t.periodic,n);let p=Pb(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Jy(t.symmetry,n,t.substitutions);t.view!==void 0&&bb(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:vb(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:hb};return{...e,unchanged:t}}),_=e=>Pv(e.expression,void 0,n)>=2,v=p.filter(e=>!_(e)),ee=p.filter(_),y=n.runtime,b={indices:void 0},x=()=>{if(b.indices)return b.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return b.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),b.indices},S=(e,t)=>W(e,Wb(n,t,void 0)),te=e=>{let t=x(),n=m===void 0?e:ib(e,m,t);return Gp(h===void 0?t.map(e=>n[e]):[S(h.expression,n)])},ne=Ub(t,n);y.getFingerprint=te;let re=()=>{let e=p.find(e=>!y.possibleCounts.get(e.name));if(!e)return;let t=Nb(e.name,n),r=t?` at ${Dc(t)}`:``;return{name:e.name,code:Ii.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(z(fm(y),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:x,getStoredFingerprints:(e,t)=>{if(h!==void 0||ne)return BigInt64Array.from(e,te);let n=new BigInt64Array(t.length),r=Jp(x(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ne)return[String(te(e))];let t=m===void 0?e:ib(e,m,x());return h===void 0?t:[S(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(Rb(i,t,r))return!1;try{let e=Wb(n,t,void 0,i.scope),a=i.membership;return r&&a?!$n(t[a.variable],r[a.variable],W(a.set,e)):!Jb(i,e)}catch(t){throw r?ox(e.U(t,e.V.safetyEvaluationFailure),Ii.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Kb(n,Wb(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>Kb(e.predicate,Wb(n,t,void 0,e.scope)))&&f.every(r=>Kb(r.expression,Wb(n,e,t,r.scope))))||r())||l.every(e=>Kb(e.predicate,Wb(n,t,void 0,e.scope))))&&g.every(r=>Kb(r.box,Wb(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>Rb(r,e,t)||Jb(r,Wb(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Kb(t.expression,Wb(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(r=>{try{return!Kb(r.action,Wb(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Oc(r.box)}`)&&!Gb(r.unchanged,Wb(n,e,t,r.scope),`a subscript`)}catch(e){throw ox(ex(e),Ii.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>Kb(i.expression,Wb(n,t,r),t=>`${e.M}${qb(t,n)}`)),trackStatePossible:v.length===0?Yb:e=>Xb(v,y,Wb(n,e,void 0)),trackActionPossible:ee.length===0?Yb:(e,t)=>Xb(ee,y,Wb(n,e,t)),findUnwitnessedPossible:re,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=Gc(e,n);return t!==void 0&&n.definitionValues.has(t)});if(i!==void 0){if(r)return;throw e.U(new e.g(`${e.M}The post condition ${i} cannot be a constant.`),e.V.error)}let a=re();if(a)return a;for(let e of t.postconditions){let t=Zb(vb(e),n,`a postcondition`);if(!t)continue;let r=Nb(e,n),i=r?` at ${Dc(r)}`:``;return t.message===void 0?{name:e,code:Ii.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Ii.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},ex=t=>t instanceof e.S?e.U(t,t.exitCode):t,tx=/* @__PURE__ */ Error(`The replay stopped`),nx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),rx=t=>{let n=Gi(t.message);return n&&!n.isEvalException&&nx.has(n.code)?e.V.configParseError:e.R(t)},ix=t=>{let n=t.cause;return n instanceof e.g?ix(n):t instanceof e.S?t.exitCode:e.V.specEvaluationFailure},ax=/* @__PURE__ */ new WeakMap,ox=(t,n,r)=>{if(!(t instanceof e.g))return t;let i=e.U(new e.g(`${r}\n${t.message}`,t),e.R(t));return ax.set(i,{code:n,headline:r,inner:t}),i},sx=e.M.slice(0,e.M.indexOf(`
1778
+ `)),cx=`${e.M}tlc2.tool.EvalException: `,lx=`${e.M}util.Assert$TLCRuntimeException: `,ux=e.z(`tlc2.tool.EvalException`),dx=e=>Ki(e)?cx:lx,fx=t=>{try{return t()}catch(t){throw t instanceof e.g?Ki(t)?new e.g(`${ux}${t.message}`):Gi(t.message)?t:new e.g(`${e.M}${t.message}`):t}},px=[cx,lx,e.M,ux],mx=(e,t)=>{let n=ax.get(e);if(n)return`${n.headline}\n${mx(n.inner,t)}`;let r=e.message,i=px.find(e=>r.startsWith(e))??``;return`${i}${Yi(r.slice(i.length),t)}`},hx=(t,n)=>{let r=ax.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:mx(t,!0)};if(n&&Ki(t))return{code:Gi(i)?.code??Ii.general,message:i,toolMessage:i};let a=n&&!i.startsWith(sx)?e.M:``;return{code:Ii.general,message:`${a}${i}`,toolMessage:`${a}${mx(t,!0)}`}},gx=t=>{let n=t.dump&&Vy(t.dump,t.writeFile,t.version);try{return vx(t,n)}catch(t){throw e.B(t)?_x():t}finally{n?.close()}},_x=()=>e.U(new e.E,e.V.error),vx=(t,n)=>{let r=typeof t.config==`string`?ke(t.config,t.version):t.config,i=t.onPrint??console.log,a={lines:void 0},o=e=>{a.lines?a.lines.push(e):i(e)},s=e=>{let t=a.lines,n=[];a.lines=n;try{return{result:e(),lines:n}}finally{a.lines=t}};Je(k_(t.source,r,t.loadModule)),Xe(t.version);let c=U_(r,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:o,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Tb(c,r,t.onProgress);let l=c.environment,u=l.runtime,d=u.version===`1.7.4`;u.pause=t.onPause??(()=>{}),u.getSpecification=()=>jy(r,l,c.variableLocations,c.instanceActions);let f={depth:0,initialStates:void 0},p=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:u.generatedStates,distinctStates:u.distinctStates,queuedStates:u.queueSize,depth:u.generatedStates===0?0:Math.max(f.depth,1),initialStates:f.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),m=Array.from({length:32},()=>0),h={newStates:0},g=()=>Math.min(h.newStates,31),_=()=>m.map((e,t)=>t===g()?e+1:e),v=()=>d?[...m]:_(),ee=(e,t,n)=>d?[]:e.getViolatedProperties(t,n),y=(e,t=[...m])=>({...e,violationOutDegrees:t}),b=()=>({...p(`success`),outDegrees:[...m],fingerprintDistance:fb(u.distinctStates,u.generatedStates,()=>x?x.getStoredFingerprints(k,he):BigInt64Array.from(k,u.getFingerprint))}),x=$b(r,l,()=>O_(t.source,t.loadModule),t.onProgress),S=()=>Qb(c.assumptions,l);if(!x){u.isStarted=!0;let e=S();return e?p(`assumption-violation`,e):(f.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:f.initialStates}),b())}let te=r.postconditions.length>0||r.possible.length>0,ne=/* @__PURE__ */ new WeakMap,re=e=>ne.get(e)?.state??e.state,ie=e=>{let t=ne.get(e)?.action;return t?sy(t):bh(e.action)},ae=(e,t)=>{te&&(u.counterExample=xh(e.map(re),e.slice(1).map(ie),t));let n=x.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:s(()=>x.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},C=(e,t,n)=>{let r=t.loopStart,i=ae(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return p(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},oe=x.spec,se=x.getFingerprintState,ce={value:void 0},w=()=>ce.value??=Dy(r,l,c.instanceActions),T=t=>{let n=_u(l),r=n.callStack;try{t(n);return}catch(t){return e.B(t)?{callStack:[],fingerprint:void 0}:!(t instanceof e.g)||!r?void 0:{callStack:r.expressions,fingerprint:r.fingerprint}}},E=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=xr(e).find(e=>br(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:E(r,t)]},D=(e,t)=>{for(let n of se(e)){let e=br(n);if(!e)continue;let r=t?E(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(xt)},le=()=>{let e=Ve.fingerprint?[Ve.fingerprint]:[];return(t,n)=>{D(t,n);let r=se(t);return Re(P(r),r)!==-1||e.some(e=>Ie(e,r))?!1:(e.push(r),u.distinctStates++,!0)}},ue=()=>{let t={count:0},n=[],i=le();return T(o=>{if(Ts(Ey(r,l,c.instanceActions),o,r=>{if(wb(t.count,e=>a.lines?.push(e)),t.count++,u.generatedStates=t.count,!(n.length>0))try{let e=x.checkReplayedInitialState(r,o,()=>{i(r,o.callStack)&&(u.queueSize++,O?.addInitialState(k.length,r,o))});if(e){let t=Te([{action:void 0,state:r}],[]).trace[0].state;throw a.lines?.push({kind:`initial-state-violation`,...e,state:t}),tx}}catch(t){if(!(t instanceof e.g)||!o.callStack?.fingerprint)throw t;n.push(t)}}),n.length>0)throw n[0]})},de=e=>T(t=>{let r=k[e],i=n&&Ge(r,ve[e]),a=le();Es(w(),r,t,(o,s)=>{if(!x.checkReplayedSuccessor(r,o,t,()=>{let r=a(o,t.callStack);return i&&n?.writeSuccessor(i,Ge(o,ve[e]+1),!r,$e?{name:s.name,signature:Ay(s)}:void 0),r}))throw tx})}),fe=r.view!==void 0||r.symmetry!==void 0,pe=[];x.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:x.isSymmetric,isConstrained:x.isConstrained});let O=e.W(()=>fx(()=>ry(x.properties.liveness,oe.temporals,l,{getFingerprint:({index:e,state:t})=>pe[e]??=Number(BigInt.asIntN(32,u.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(oe.next===void 0)return n;let r=F.livenessSource;return F.livenessSource=e,bc(oe.next,t,l,e=>{if(be(e.state),!(x.satisfiesConstraints(e.state,t)&&x.satisfiesActionConstraints(t,e.state)))return!1;let r=se(e.state),i=Re(P(r),r);return n.push({index:i,state:e.state}),!1},oe.scope),F.livenessSource=r,n}})));u.isStarted=!0;let me=x.isSymmetric||O!==void 0,k=[],he=[],ge=[],_e=[],ve=[],ye={slots:new Int32Array(1<<17),size:0,shift:16},be=Hr(),xe=e=>Object.fromEntries(x.getTlcOrder().map(t=>[l.variables[t],e[t]])),Se=(e,t,n,r)=>(u.getLevel=()=>n+1,u.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(n,r,i)=>{try{let e=Sb(`alias`,n,l).body,t=W(vb(n),Wb(l,r,i)),a=e.kind===`Record`?e.fields.map(e=>e.name):[];return Db(t,a)??xe(r)}catch(n){if(!(n instanceof e.m||n instanceof e.g))throw n;return{...xe(r),_ALIASEvalError:Yi(n.message,t.isTool??!1)}}},we=(e,t,n,r)=>{let i=w(),a={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:se,s=o(n),c=i.find(e=>xc(e.expression,t,l,e.scope).some(e=>Ie(o(e.state),s)));return Object.assign(F,a),c},Te=(e,n,i={})=>{let a=r.alias,o=i.known??1,c=e.length>1?s(Ee).lines:[],l=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:s(()=>we(n[r-1],e[r-1].state,t.state,o===2&&r===e.length-1))),u=l.map(e=>e.lines),f=i.loopStart,p=d&&f!==void 0?f+1:e.length-o,m=p>0?[c,...u.slice(1,p)].flat():[];return{trace:e.map((n,r)=>{let i=l[r].result,o={action:n.action,label:i&&ky(i,t.version),state:a===void 0?xe(n.state):Se(a,e,r,f),output:r===0?m:r<p?[]:u[r]};return(a!==void 0||i)&&ne.set(o,{state:xe(n.state),action:i}),o}),traceOutput:o>0&&!d?[c,...u].flat():[]}},Ee=()=>oe.init===void 0?[]:yc(oe.init,l,oe.scope),De=(e,t)=>s(()=>{for(let n of w()){let r=xc(n.expression,e,l,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Oe=(e,t)=>Ie(se(e),he[t]),Ae=(e,t)=>De(e,e=>Oe(e.state,t)),je=(t,n)=>{let r=s(()=>fe||tu(l)?Ee().find(e=>Oe(e,t[0])):k[t[0]]).result;if(!r)throw new e.g(gb);let i=[{state:r,action:void 0}];for(let r=1;r<t.length;r++){let a=i[r-1].state;if(t[r-1]===t[r]){i.push({state:a,action:`Stuttering`});continue}let o=Ae(a,t[r]);if(!o)throw new e.g(n);i.push(o)}return i},Me=(e,t)=>{let n=[];for(let t=e;t!==-1;t=ge[t])n.unshift(t);let r=fe&&n.length>1?je(n,gb):n.map(e=>({state:k[e],action:_e[e]}));if(!t)return Te(r,n);let i=fe?De(k[e],e=>Ie(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n,{known:2})},Ne=e=>ge[e]===-1?{trace:[{action:void 0,label:void 0,state:xe(k[e])}],traceOutput:d?[]:s(Ee).lines}:Me(e),Pe=(e,t)=>({trace:Me(e,t).trace}),A=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&d?e.V.success:n.callStack?n.isCallStackFirst?e.R(t):n.isLiveCallStack?e.H(t)??(t instanceof e.S?t.exitCode:e.V.error):n.isInitial||n.fingerprint?e.V.specEvaluationFailure:ix(t):n.isInitial?rx(t):e.R(t),j=(t,n,r={})=>{let i=e.B(t)?new e.E:t;if(!(i instanceof e.g))throw i;let a=n.trace.length>0&&!r.traceFailure?ae(n.trace,void 0):void 0,o=a?.unwitnessed??a?.postcondition,s=[...n.traceOutput??[],...a?.lines??[]];return{...p(`error`,void 0,{...hx(i,r.isNextState??!1),...n,...s.length>0&&{traceOutput:s},...o&&{postcondition:o},initialState:r.initialState&&!(i instanceof e.S)?xe(r.initialState):void 0,exitCode:A(i,r),callStack:r.callStack,...r.isCallStackFirst&&{isCallStackFirst:!0},...r.fingerprint&&{fingerprint:r.fingerprint},...r.traceFailure&&{traceFailure:r.traceFailure}}),outDegrees:r.outDegrees}},M=(n,r)=>{u.generatedStates++;let i=w(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=d?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,f=ct(`null`),p=r.state.map(e=>e??f),m=j(r,Ne(n));return y({...m,failure:m.failure&&{...m.failure,code:Ii.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.V.specEvaluationFailure,trace:[...m.failure.trace,{action:r.action,label:a&&ky(a,t.version),state:xe(p)}]}})},N=(t,n)=>{let r=je(t,_b),i=r[r.length-1].state;if(fe&&n!==void 0&&n!==t.length-1&&Ae(i,t[n])===void 0)throw new e.g(_b);return r},P=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pr(t,Sr(e[n]));return t&1073741823},Fe=e=>{for(let t of e){let e=br(t);if(e)throw e}},Ie=(e,t)=>{for(let n=0;n<t.length;n++)if(!Tt(e[n],t[n]))return!1;return!0},Le=e=>Math.imul(e,2654435761)>>>ye.shift<<1,Re=(e,t)=>{let n=ye.slots.length-1;for(let r=Le(e);;r=r+2&n){let n=ye.slots[r+1];if(n===0)return-1;if(ye.slots[r]===e&&Ie(he[n-1],t))return n-1}},ze=(e,t)=>{let n=ye.slots.length-1,r=Le(e);for(;ye.slots[r+1]!==0;)r=r+2&n;ye.slots[r]=e,ye.slots[r+1]=t},Be=(e,t)=>{if(ye.size++,ye.size*4>ye.slots.length){let e=ye.slots;ye.slots=new Int32Array(e.length*2),ye.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&ze(e[t],e[t+1])}ze(e,t+1)},Ve={fingerprint:void 0},He=e=>{u.distinctStates=k.length+1,f.depth=Math.max(f.depth,e),u.diameter=Math.max(u.diameter,e)},Ue=(e,t,n,r)=>{let i=n===-1?1:ve[n]+1;k.push(e),he.push(t),ge.push(n),_e.push(r),ve.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},We=e=>e===-1?[]:[...We(ge[e]),k[e]];u.isSeen=e=>{let t=se(e);return Re(P(t),t)!==-1},u.getBehavior=e=>{let t=e===F.candidate?-1:k.indexOf(e);return t===-1?[...We(F.index),e]:We(t)},u.getCurrentState=()=>F.index===-1?void 0:k[F.index],u.setLivenessSource=e=>{F.livenessSource=e??-1},u.getLevel=e=>{let t=F.livenessSource;if(d){let e=t===-1?F.isExpanding?F.index:-1:t;return e===-1?0:ve[e]}return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===k[F.index]?ve[F.index]:F.isExpanding?ve[F.index]+1:0:e===k[t]?ve[t]:ve[t]+1};let Ge=(e,t)=>({fingerprint:BigInt.asIntN(64,u.getFingerprint(e)),level:t,getLabel:()=>Br(r.alias===void 0?xe(e):Ce(r.alias,e,void 0)),getText:()=>Br(xe(e))}),Ke=e=>{be(e),u.generatedStates++,u.initialStates++,F.candidate=e,F.candidateLevel=1;let t=se(e),r=P(t),i=x.satisfiesConstraints(e);if(i&&(x.trackStatePossible(e),Fe(t),e.forEach(xt)),i&&Re(r,t)!==-1)return;Ve.fingerprint=i?t:void 0,i&&(He(1),u.queueSize++,O?.addInitialState(k.length,e),n?.writeInitialState(Ge(e,1)));let a=x.findViolatedInvariant(e);if(a)return C(`invariant-violation`,{name:a.name,...Te([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return C(`liveness-violation`,{name:o.name,...Te([{action:void 0,state:e}],[])});i&&(Be(r,k.length),Ue(e,t,-1,void 0))},qe=(t,r,i,a,o)=>{let c=k[t];u.generatedStates++,F.candidate=r.state,F.candidateLevel=ve[t]+1,me&&be(r.state);let l=se(r.state),d=P(l),f=Re(d,l),p=x.satisfiesConstraints(r.state,c);p&&x.trackStatePossible(r.state);let m=p&&x.satisfiesActionConstraints(c,r.state);m&&(x.trackActionPossible(c,r.state),Fe(l),r.state.forEach(xt));let g=m?f:-1;if(a&&m&&n?.writeSuccessor(a,Ge(r.state,ve[t]+1),g!==-1,o&&{name:o.name,signature:Ay(o)}),g!==-1&&O){let e=k[g],t=e.every((e,t)=>e===r.state[t]);i.push({index:g,state:t?e:r.state})}let _=m&&g===-1;if(_&&O&&i.push({index:k.length,state:r.state}),Ve.fingerprint=_?l:void 0,_&&(He(ve[t]+1),h.newStates++),g===-1)try{let e=x.findViolatedInvariant(r.state,c);if(e)return y(C(`invariant-violation`,{name:e.name,...Me(t,r)}))}catch(n){if(e.B(n))throw n;let i=s(()=>de(t));return j(n,mb(Pe(t,r),i.lines),i.result??{outDegrees:v()})}let ee=x.findViolatedActionProperty(c,r.state);if(ee)return y(C(`liveness-violation`,{name:ee.name,...Me(t,r)}));_&&(me||be(r.state),Be(d,k.length),Ue(r.state,l,t,r.action),u.queueSize++)},Ye={result:void 0};O&&t.onProgress?.({kind:`liveness-prepared`,branches:O.branches});let Ze=S();if(Ze)return p(`assumption-violation`,Ze);if(t.onProgress?.({kind:`initial-states-started`}),oe.init!==void 0)try{vc(oe.init,l,e=>{wb(u.initialStates,t.onProgress);try{Ye.result=Ke(e)}catch(t){let n=s(ue);Ye.result=j(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return Ye.result!==void 0},oe.scope)}catch(t){if(t instanceof e._){let e=j(t,{trace:[]},{initialState:t.state.map(e=>e??ct(`null`))});return{...e,failure:e.failure&&{...e.failure,isWithoutStatistics:!0}}}let n=s(ue);return j(t,{trace:[],traceOutput:n.lines},{...n.result,isInitial:!0})}if(Ye.result)return Ye.result;f.initialStates={generated:u.initialStates,distinct:u.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:f.initialStates});let Qe=oe.next;if(Qe===void 0){if(k.length>0)throw new e.g(`No next state actions defined to generate successor states from.`);return b()}let $e=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),et=(e,t)=>{if(!$e)return bc(Qe,e,l,e=>t(e,void 0),oe.scope);let n={isStopped:!1};return w().reduce((r,i)=>n.isStopped?r:r+bc(i.expression,e,l,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},tt=(e,t)=>{if(!O||d)return;let n=T(n=>O.addState(e,k[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},nt=(t,n)=>{try{O?.addState(t,k[t],n);return}catch(r){if(!(r instanceof e.g))throw r;return tt(t,n)}},rt=(e,t)=>{let n=s(()=>nt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=s(()=>de(e));return{result:r.result,lines:[...n.lines,...r.lines]}},it=e=>j(_x(),Ne(e)),at=(t,n,r)=>{if(e.B(t))return it(n);let i=rt(n,r);return j(ex(t),mb(Ne(n),i.lines),{isNextState:!0,...i.result})},ot=(t,i)=>{let a=k[t],o=n&&Ge(a,ve[t]),c=et(a,(n,r)=>{try{Ye.result=qe(t,n,i,o,r)}catch(r){if(e.B(r))return Ye.result=it(t),!0;let a=d?s(()=>de(t)):rt(t,i);if(d&&r instanceof e.g&&!ax.has(r))return Ye.result=j(new e.g(`${dx(r)}${r.message}`,r),mb({trace:[]},a.lines),{isNextState:!0,...a.result}),!0;let o=se(n.state).some(e=>br(e)!==void 0)&&r instanceof e.g?hx(Ki(r)?new e.g(`${ux}${r.message}`):r,!0):void 0;Ye.result=j(r,mb(o?Ne(t):Pe(t,n),a.lines),{isNextState:!0,...a.result,traceFailure:o})}return Ye.result!==void 0});F.isExpanding=!1;let l=Ye.result;if(l?.violation&&!d){let e=s(()=>nt(t,i));return{...l,violation:mb(l.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(l)return l;let u=()=>{O&&o&&d&&n?.writeStuttering(o);let e=O?.addState(t,a,i);if(!O||!e)return;let r=N(e),s=ee(O,r.map(e=>e.state),r.length-1);return C(`property-violation`,{name:s[0],properties:s,...Te(r,e,{known:0})})};if(c===0&&r.checkDeadlock){let n=C(`deadlock`,{name:`deadlock`,...Ne(t)}),r=s(()=>{try{return{additional:u()?.violation}}catch(n){if(!(n instanceof e.g))throw n;return{isFailed:!0,callStack:tt(t,i)}}}),a=n.violation?{...n,violation:mb(n.violation,r.lines)}:n,o=y(a,r.result.isFailed?v():_());return r.result.additional?{...o,additionalViolation:r.result.additional}:r.result.callStack?{...o,liveCallStack:r.result.callStack}:o}try{return u()}catch(n){if(d&&n instanceof e.g){let t=new e.g(`${Ki(n)?ux:e.M}${n.message}`);return j(e.U(t,e.V.error),{trace:[]},{outDegrees:v()})}let r=T(e=>O?.addState(t,a,i,e));return j(n,Ne(t),{outDegrees:v(),callStack:r?.callStack.length?r.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},st=()=>{let e=r.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:Ii.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=Gc(e,l)?.location.range;if(!(oe.temporals.length>0||!n))return{code:Ii.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${Dc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},lt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=N(r,i),o=Te(a,r,{loopStart:i,known:0}).trace,c=ee(e,a.map(e=>e.state),i),l=r[i],u=r[r.length-1],d=a[a.length-1].state,f=l===u?{result:void 0,lines:[]}:s(()=>we(u,d,k[l],!1)),p=l===u&&n.isCycleConstrained;return C(`liveness-violation`,{name:c[0],properties:c,trace:o,traceOutput:f.lines,loopStart:i,loopLabel:f.result&&ky(f.result,t.version),warning:p?st():void 0},()=>l===u?ie(o[o.length-1]):f.result?sy(f.result):bh(Ae(d,l)?.action))},ut=O!==void 0&&t.livenessCheck!==`final`,dt=performance.now(),ft={at:dt+3e3,size:1,time:0},pt=e=>{let n=performance.now();if(!((e-ft.size)/ft.size>.1)||ft.time>(n-dt)*.2||(ft.size=e,!O))return;t.onProgress?.({kind:`liveness-started`,branches:O.branches,isComplete:!1,states:e,statistics:p(`success`)});let r=O.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),ft.time+=performance.now()-n,r};for(let n=0;n<k.length&&!u.isStopped;n++){F.index=n,F.candidate=void 0,u.queueSize=k.length-n-1,F.isExpanding=!0;let r=[];try{Ye.result=ot(n,r)}catch(t){Ye.result=t instanceof e.v?M(n,t):at(t,n,r)}if(Ye.result)return Ye.result;if(m[g()]++,h.newStates=0,(ut||t.onProgress)&&performance.now()>=ft.at){ft.at=performance.now()+6e4;let e=ut?pt(n+1):void 0;if(O&&e)return lt(O,e);t.onProgress?.({kind:`progress`,statistics:p(`success`)})}}F.index=-1,F.candidate=void 0,O&&t.onProgress?.({kind:`liveness-started`,branches:O.branches,isComplete:!0,states:u.distinctStates,statistics:p(`success`)});let mt=O?.findViolation();if(O&&mt)return lt(O,mt);O&&t.onProgress?.({kind:`liveness-finished`});try{let e=x.findPostconditionViolation();if(e)return p(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return j(e,{trace:[]})}return b()},yx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},bx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Sr(e[t]),16777619),r=Math.imul(r^kr(e[t]),1540483477);t[0]=yx(n)||1,t[1]=yx(r)},xx=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Sx=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},Cx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),wx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Sx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Tx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Ex=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Sx(t,n);return{slots:t,used:e.used}},Dx=[void 0,`lambda`,`tuple`,`record`],Ox=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=cr(e.domain);return t?(r(7),r(Dx.indexOf(pt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Dx.indexOf(pt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},kx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return ct(t.strings[n[r.index++]]);if(e===5)return lt(i(n[r.index++]));let a=Dx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=vn({kind:`Interval`,low:e,high:e+t-1});return ft(ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return ft(ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ve}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Op}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Ji}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return gm}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Tp}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Gp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return yc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Ur}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return xc}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return Hr}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Ii}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Td}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Oc}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Dp}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return tu}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Li}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return _m}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Qe}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return ab}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Ex}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return E_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return bx}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Qb}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return de}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return wb}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return fb}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Cx}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return $f}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return kp}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return gx}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ox}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Tb}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Br}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return xx}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return _}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return $b}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return hm}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return U_}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return zi}});