tla-ts 0.0.10-dev.6232a1403 → 0.0.10-dev.68b2c4968

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 (147) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +35 -35
  4. package/dist/deciders.js +54 -54
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.js +1 -1
  7. package/dist/prove-worker.cjs +1 -1
  8. package/dist/prove-worker.js +1 -1
  9. package/dist/prove.cjs +23 -23
  10. package/dist/prove.js +77 -77
  11. package/dist/run.cjs +32 -32
  12. package/dist/run.js +41 -41
  13. package/dist/tlapm.cjs +1 -1
  14. package/dist/tlapm.js +2 -2
  15. package/dist/transfer.cjs +34 -34
  16. package/dist/transfer.js +42 -42
  17. package/dist/worker.cjs +5 -5
  18. package/dist/worker.js +5 -5
  19. package/package.json +1 -1
  20. package/src/bags.ts +7 -8
  21. package/src/check.ts +16 -10
  22. package/src/codegen.ts +6 -2
  23. package/src/dependencies.ts +49 -9
  24. package/src/environment.ts +0 -1
  25. package/src/errors.ts +8 -0
  26. package/src/evaluate.ts +83 -29
  27. package/src/exit-codes.ts +2 -2
  28. package/src/instances.ts +1 -1
  29. package/src/levels.ts +134 -86
  30. package/src/liveness-checker.ts +0 -2
  31. package/src/liveness.ts +1 -1
  32. package/src/parser.ts +73 -40
  33. package/src/prover/isabelle/isar/rule-cases.ts +8 -6
  34. package/src/prover/isabelle/provers/clasimp.ts +1 -1
  35. package/src/prover/isabelle/provers/hypsubst.ts +2 -2
  36. package/src/prover/smt/rewrite.ts +2 -7
  37. package/src/prover/smt/simplify.ts +1 -1
  38. package/src/prover/smt/solver/asserted-formulas.ts +8 -1
  39. package/src/prover/smt/solver/ast-lt.ts +1 -1
  40. package/src/prover/smt/solver/ast.ts +3 -3
  41. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
  42. package/src/prover/smt/solver/bv-rewriter.ts +1 -1
  43. package/src/prover/smt/solver/card2bv.ts +1 -2
  44. package/src/prover/smt/solver/context.ts +15 -1
  45. package/src/prover/smt/solver/ctx-simplify.ts +1 -2
  46. package/src/prover/smt/solver/diff-neq.ts +1 -2
  47. package/src/prover/smt/solver/elim-uncnstr.ts +4 -7
  48. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
  49. package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
  50. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
  51. package/src/prover/smt/solver/euf/egraph.ts +3 -9
  52. package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
  53. package/src/prover/smt/solver/euf/mam.ts +1 -5
  54. package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
  55. package/src/prover/smt/solver/euf/th-solver.ts +0 -7
  56. package/src/prover/smt/solver/expr2polynomial.ts +204 -79
  57. package/src/prover/smt/solver/factor.ts +36 -14
  58. package/src/prover/smt/solver/fd-solver.ts +2 -0
  59. package/src/prover/smt/solver/fix-dl-var.ts +1 -2
  60. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
  61. package/src/prover/smt/solver/goal.ts +1 -1
  62. package/src/prover/smt/solver/goal2nlsat.ts +57 -30
  63. package/src/prover/smt/solver/lp/nla-core.ts +1 -1
  64. package/src/prover/smt/solver/lp/nla-grobner.ts +2 -2
  65. package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
  66. package/src/prover/smt/solver/lp/pdd.ts +2 -3
  67. package/src/prover/smt/solver/lp/union-find.ts +1 -1
  68. package/src/prover/smt/solver/mam-compiler.ts +1 -1
  69. package/src/prover/smt/solver/model-based-opt.ts +1 -1
  70. package/src/prover/smt/solver/model-generator.ts +3 -1
  71. package/src/prover/smt/solver/mpf.ts +2 -4
  72. package/src/prover/smt/solver/mus.ts +1 -2
  73. package/src/prover/smt/solver/muz/dl-context.ts +2 -2
  74. package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
  75. package/src/prover/smt/solver/muz/dl-rule.ts +2 -2
  76. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
  77. package/src/prover/smt/solver/muz/horn-tactic.ts +1 -1
  78. package/src/prover/smt/solver/muz/spacer-context.ts +1 -4
  79. package/src/prover/smt/solver/nlsat/algebraic.ts +193 -89
  80. package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
  81. package/src/prover/smt/solver/nlsat/explain.ts +375 -217
  82. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
  83. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
  84. package/src/prover/smt/solver/nlsat/solver.ts +74 -64
  85. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
  86. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
  87. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
  88. package/src/prover/smt/solver/opt-context.ts +5 -0
  89. package/src/prover/smt/solver/opt-nlsat.ts +29 -18
  90. package/src/prover/smt/solver/opt-solver.ts +6 -3
  91. package/src/prover/smt/solver/optsmt.ts +1 -1
  92. package/src/prover/smt/solver/pb-rewriter.ts +1 -4
  93. package/src/prover/smt/solver/probes.ts +16 -17
  94. package/src/prover/smt/solver/proto-model.ts +2 -2
  95. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
  96. package/src/prover/smt/solver/qe.ts +3 -2
  97. package/src/prover/smt/solver/quantifier-manager.ts +14 -9
  98. package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
  99. package/src/prover/smt/solver/sat/config.ts +1 -1
  100. package/src/prover/smt/solver/sat/model-converter.ts +1 -1
  101. package/src/prover/smt/solver/sat/pb-solver.ts +1 -1
  102. package/src/prover/smt/solver/sat/simplifier.ts +1 -1
  103. package/src/prover/smt/solver/sat/solver.ts +25 -47
  104. package/src/prover/smt/solver/seq-axioms.ts +20 -35
  105. package/src/prover/smt/solver/seq-derive.ts +1 -1
  106. package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
  107. package/src/prover/smt/solver/seq-monadic.ts +7 -5
  108. package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
  109. package/src/prover/smt/solver/seq-re-util.ts +1 -1
  110. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
  111. package/src/prover/smt/solver/seq-regex-live.ts +2 -2
  112. package/src/prover/smt/solver/seq-rewriter.ts +30 -28
  113. package/src/prover/smt/solver/seq-skolem.ts +0 -23
  114. package/src/prover/smt/solver/seq-view-witness.ts +4 -4
  115. package/src/prover/smt/solver/smt-kernel.ts +8 -1
  116. package/src/prover/smt/solver/smt-setup.ts +50 -2
  117. package/src/prover/smt/solver/smtlib-parser.ts +132 -57
  118. package/src/prover/smt/solver/smtlib-script.ts +203 -54
  119. package/src/prover/smt/solver/solve-eqs.ts +11 -17
  120. package/src/prover/smt/solver/tactic.ts +75 -58
  121. package/src/prover/smt/solver/theory-bv.ts +2 -2
  122. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
  123. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -2
  124. package/src/prover/smt/solver/theory-lra.ts +0 -1
  125. package/src/prover/smt/solver/theory-pb.ts +2 -3
  126. package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
  127. package/src/prover/smt/solver/theory-seq-state.ts +2 -21
  128. package/src/prover/zenon/index-table.ts +5 -2
  129. package/src/prover/zenon/isar-case.ts +1 -1
  130. package/src/prover/zenon/isar.ts +2 -2
  131. package/src/prover/zenon/phrase.ts +1 -1
  132. package/src/resolve.ts +262 -74
  133. package/src/sany/generation.ts +1 -13
  134. package/src/sany/generator-definitions.ts +2 -1
  135. package/src/sany/generator-expressions.ts +27 -17
  136. package/src/sany/generator-proofs.ts +1 -1
  137. package/src/sany/generator.ts +2 -1
  138. package/src/sany/nodes.ts +1 -1
  139. package/src/sany/selectors.ts +6 -5
  140. package/src/search.ts +11 -11
  141. package/src/spec-description.ts +2 -2
  142. package/src/subexpressions.ts +165 -78
  143. package/src/successors.ts +1 -0
  144. package/src/tlc/jar-data.ts +12 -0
  145. package/src/typed-tier.ts +29 -23
  146. package/src/typescript/types.ts +2 -2
  147. package/src/values.ts +42 -23
package/dist/compile.cjs CHANGED
@@ -12,12 +12,12 @@ var e=Object.create,t=Object.defineProperty,n=Object.getOwnPropertyDescriptor,r=
12
12
  `),t===0?`LET `:` `,` `)),...C(w(e.body),`IN `,` `)],ae=e=>w(e).join(`
13
13
  `),oe=/* @__PURE__ */ new Set([`(`,`[`,`{`]),se=/* @__PURE__ */ new Set([`)`,`]`,`}`]),ce=e=>[...e].reduce((t,n,r)=>{if(t.isSkipped)return{...t,isSkipped:!1};if(t.isQuoted)return{...t,isQuoted:t.isEscaped||n!==`"`,isEscaped:!t.isEscaped&&n===`\\`};let i=e.slice(r,r+2);return i===`<<`?{...t,depth:t.depth+1,isSkipped:!0}:i===`>>`&&t.depth>0?{...t,depth:t.depth-1,isSkipped:!0}:n===`"`?{...t,isQuoted:!0}:oe.has(n)?{...t,depth:t.depth+1}:se.has(n)?{...t,depth:t.depth-1}:t.depth===0?{...t,surface:t.surface+n}:t},{depth:0,isQuoted:!1,isEscaped:!1,isSkipped:!1,surface:``}).surface,le=e=>e!==``&&!/^[~-]/.test(e)&&!e.includes(`
14
14
  `)&&!ce(e).includes(` `),T=e=>le(e)?e:`(${e})`,ue=[` = `,` # `,` < `,` > `,` <= `,` >= `,` \\in `,` \\notin `,` \\subseteq `,` /\\ `,` \\/ `,` => `,` ~> `],E=e=>{if(e.startsWith(`~`))return`(${e})`;let t=ce(e);return ue.some(e=>t.includes(e))?`(${e})`:e},D=(e,t)=>e.split(`
15
- `).join(`\n${t}`),O=e=>({bindings:new Map(e.variables),previous:void 0}),k=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),de=(e,t)=>{if(!d.default.isIdentifier(e.name)||e.initializer!==void 0||e.questionToken!==void 0||e.dotDotDotToken!==void 0)throw new l.L(`Use a plain parameter here: ${e.getText()}`,e);return{node:e,name:t.names.getFresh(e.name.text),symbol:h(e.name,t.checker)}},fe=(e,t)=>e.map(e=>de(e,t)),A=(e,t,n,r)=>d.default.isIdentifier(e)?k(n,[{name:t,symbol:h(e,r.checker)}]):e.elements.reduce((n,i,a)=>{if(d.default.isOmittedExpression(i))return n;if(i.dotDotDotToken!==void 0||i.initializer!==void 0)throw new l.L(`Rest elements and default values aren't supported`,i);let o=d.default.isArrayBindingPattern(e)?`${T(t)}[${a+1}]`:`${T(t)}.${(i.propertyName??i.name).getText()}`;return A(i.name,o,n,r)},n),pe=(e,t,n,r)=>{let i=r.names.getFresh(d.default.isIdentifier(e)?e.text:`value`);return{definitions:[`${i} == ${D(t,` `)}`],scope:A(e,i,n,r)}},me=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=pe(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),he=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),ge=(e,t,n)=>{if(d.default.isIdentifier(e)){let r=h(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=_(r);if(i!==void 0&&!n.has(i))return n.add(i),ge(i,t,n)}return d.default.forEachChild(e,e=>ge(e,t,n)||void 0)??!1},_e=e=>d.default.isVariableDeclaration(e)?e.initializer:void 0,j=(e,t)=>{let n=t.definitions.get(e);if(n!==void 0)return t.inProgress.has(e)&&t.recursive.add(e),n;if(e.name===void 0)throw new l.L(`Name this function`,e);let r=v(e),i=fe(r?.parameters??[],t),a=i.map(e=>{let n=t.checker.getTypeAtLocation(e.node.name).getCallSignatures();return n.length===0?e.name:`${e.name}(${n[0].parameters.map(()=>`_`).join(`, `)})`}),o={name:t.names.getFresh(e.name.getText()),parameters:a,readsState:ge(e,t,/* @__PURE__ */ new Set([e]))};t.definitions.set(e,o),t.inProgress.add(e);let s=r===void 0?_e(e):r.body;if(s===void 0)throw new l.L(`Give this a value`,e);let c=M(s,k(O(t),i),t);t.inProgress.delete(e);let u=a.length===0?o.name:`${o.name}(${a.join(`, `)})`;return t.output.push(`${u} ==\n ${D(c,` `)}`),o},ve=(e,t,n,r)=>{if(e.body===void 0)throw new l.L(`Give this a body`,e);let i=me(e.parameters.map(e=>e.name),t.map(e=>H(e,n,r)),n,r),a=M(e.body,i.scope,r);return i.definitions.length===0?a:ae(S(i.definitions,b(a)))},ye=(e,t,n)=>{if(d.default.isArrowFunction(e)||d.default.isFunctionExpression(e)){let r=fe(e.parameters,n),i=M(e.body,k(t,r),n);return`LAMBDA ${r.map(e=>e.name).join(`, `)} : ${i}`}let r=h(e,n.checker),i=_(r);if(i!==void 0)return j(i,n).name;let a=r===void 0?void 0:t.bindings.get(r);if(a===void 0)throw new l.L(`Pass a function here`,e);return a},be=(e,t,n,r)=>{let i=j(e,r),a=t?.arguments??[];if(i.readsState&&he(n,r)){let t=v(e);if(t!==void 0)return ve(t,a,n,r);let i=_e(e);if(i===void 0)throw new l.L(`Give this a body`,e);return H(i,n,r)}if(i.parameters.length===0)return i.name;let o=a.map((e,t)=>i.parameters[t].includes(`(`)?ye(e,n,r):H(e,n,r));return`${i.name}(${o.join(`, `)})`},xe=(e,t,n)=>{let r=ee(e.expression,n);if(r===void 0)throw new l.L(`Unsupported call: ${e.expression.getText()}`,e);if(n.inProgress.has(r))throw new l.L(`A local function can't call itself, so declare it at the top level`,e);n.inProgress.add(r);let i=ve(r,e.arguments,t,n);return n.inProgress.delete(r),i},M=(e,t,n)=>d.default.isBlock(e)?ae(N(e.statements,t,n,()=>{throw new l.L(`This function must return a value on every path`,e)})):H(e,t,n),N=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=t=>N(e.slice(1),t,n,r);if(d.default.isBlock(i))return N(i.statements,t,n,a);if(d.default.isVariableStatement(i)){let e=i.declarationList.declarations.reduce((e,t)=>{if(t.initializer===void 0)throw new l.L(`Declare locals with a value`,t);if(v(t.initializer)!==void 0)return e;let r=H(t.initializer,e.scope,n),i=pe(t.name,r,e.scope,n);return{definitions:[...e.definitions,...i.definitions],scope:i.scope}},{definitions:[],scope:t});return S(e.definitions,a(e.scope))}if(d.default.isIfStatement(i))return Ce(i,t,n,e=>N([e],t,n,a),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression===void 0)throw new l.L(`Return a value`,i);return b(H(i.expression,t,n))}if(d.default.isThrowStatement(i))return b(Se(i,t,n));if(d.default.isSwitchStatement(i))return we(i,t,n,e=>N(e,t,n,a),()=>a(t));throw new l.L(`Unsupported statement: ${i.getText()}`,i)},Se=(e,t,n)=>{let r=e.expression;return`Assert(FALSE, ${d.default.isNewExpression(r)&&r.arguments?.[0]!==void 0?H(r.arguments[0],t,n):JSON.stringify(r.getText())})`},Ce=(e,t,n,r,i)=>{let a=B(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return ie(a,o,s,V(e.expression,t,n))},we=(e,t,n,r,i)=>{let a=T(H(e.expression,t,n)),o=e.caseBlock.clauses,s=e=>{if(e===o.length)return i();let c=o.findIndex((t,n)=>n>=e&&t.statements.length>0),u=o.slice(e,c===-1?o.length:c+1),f=u[u.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(d.default.isBreakStatement(m)||d.default.isReturnStatement(m)||d.default.isThrowStatement(m)),g=e+u.length===o.length;if(p.length>0&&!h&&!g)throw new l.L(`End each case with break, return, or throw`,f);let _=r(m!==void 0&&d.default.isBreakStatement(m)?p.slice(0,-1):p);if(u.some(d.default.isDefaultClause))return _;let v=u.filter(d.default.isCaseClause).map(e=>`${a} = ${T(H(e.expression,t,n))}`).join(` \\/ `);return ie(v,_,s(e+u.length))};return s(0)},Te=e=>(e.flags&d.default.TypeFlags.Object)!==0&&(e.objectFlags&d.default.ObjectFlags.Reference)!==0,Ee=e=>e.getSymbol()?.getName()??``,P=e=>[`Set`,`ReadonlySet`].includes(Ee(e)),De=e=>[`Map`,`ReadonlyMap`].includes(Ee(e)),Oe=(e,t)=>e.isUnion()?e.types.every(e=>Oe(e,t)):t.isArrayType(e)||t.isTupleType(e),ke=(e,t)=>e.isUnion()?e.types.every(e=>ke(e,t)):(e.flags&t)!==0,F=(e,t)=>{let n=t.checker,r=n.getNonNullableType(n.getTypeAtLocation(e));return Oe(r,n)?`sequence`:P(r)?`set`:De(r)?`map`:ke(r,d.default.TypeFlags.StringLike)?`string`:`other`},I=(e,t)=>ke(t.checker.getTypeAtLocation(e),d.default.TypeFlags.BooleanLike),Ae=(e,t)=>P(t.checker.getTypeAtLocation(e)),L=e=>/^-?\d+$/.test(e),je=(e,t)=>{if(e.isStringLiteral())return te(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&d.default.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&d.default.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(d.default.TypeFlags.Undefined|d.default.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},R=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),Me=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=Ne(n,t);return typeof r==`string`?[...e,r]:r},[]),Ne=(e,t)=>{let n=t.checker;if(e.flags&d.default.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>je(e,t)),r=Me(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>L(e)&&L(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?T(e):e).join(` \\cup `)}let r=je(e,t);if(r!==void 0)return`{${r}}`;if(P(e)||De(e)||n.isTupleType(e)){let r=Me(Te(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(r))return r;if(P(e))return`SUBSET ${T(r[0])}`;if(De(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${r[1]}] : ${e} \\in SUBSET ${T(r[0])}}`}if(!(Te(e)&&e.target.elementFlags.every(e=>(e&d.default.ElementFlags.Required)!==0)))return R(e,`tuples with optional or rest elements can have any length`,t);if(r.length===0)return`{<<>>}`;if(r.length>1)return r.map(T).join(` \\X `);let i=t.names.getFresh(`element`);return`{<<${i}>> : ${i} \\in ${r[0]}}`}if(n.isArrayType(e))return R(e,`arrays can have any length, so use a tuple`,t);let i=e.getProperties();if(!(e.flags&d.default.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&i.length>0))return R(e,`use a union of literals, or records, tuples, and sets of them`,t);let a=i.find(e=>e.flags&d.default.SymbolFlags.Optional);if(a!==void 0)return R(e,`the optional field ${a.name} may be missing`,t);let o=Me(i.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(o))return o;let s=i.map(e=>e.name);return s.some(L)?!s.every(L)||o.some(e=>e!==o[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${s.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${o[0]}]`:`[${s.map((e,t)=>`${e} : ${o[t]}`).join(`, `)}]`},Pe=(e,t,n)=>{let r=Ne(e,n);if(typeof r!=`string`)throw new l.L(r.message,t);return r},Fe=/* @__PURE__ */ new Map([[d.default.SyntaxKind.MinusToken,`-`],[d.default.SyntaxKind.AsteriskToken,`*`],[d.default.SyntaxKind.AsteriskAsteriskToken,`^`],[d.default.SyntaxKind.EqualsEqualsEqualsToken,`=`],[d.default.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[d.default.SyntaxKind.LessThanToken,`<`],[d.default.SyntaxKind.LessThanEqualsToken,`<=`],[d.default.SyntaxKind.GreaterThanToken,`>`],[d.default.SyntaxKind.GreaterThanEqualsToken,`>=`]]),Ie=/* @__PURE__ */ new Set([d.default.SyntaxKind.LessThanToken,d.default.SyntaxKind.LessThanEqualsToken,d.default.SyntaxKind.GreaterThanToken,d.default.SyntaxKind.GreaterThanEqualsToken]),Le=/* @__PURE__ */ new Map([[d.default.SyntaxKind.AmpersandAmpersandToken,`/\\`],[d.default.SyntaxKind.BarBarToken,`\\/`]]),Re=(e,t,n)=>{let r=e.argumentExpression;return F(e.expression,n)===`sequence`?d.default.isNumericLiteral(r)?String(Number(r.text)+1):`${T(H(r,t,n))} + 1`:H(r,t,n)},ze=(e,t,n)=>{let r=e.elements.reduce((e,r)=>{if(!d.default.isSpreadElement(r)){let i=H(r,t,n),a=e.at(-1);return Array.isArray(a)?[...e.slice(0,-1),[...a,i]]:[...e,[i]]}if(F(r.expression,n)!==`sequence`)throw new l.L(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,r);return[...e,H(r.expression,t,n)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return r.length===0?`<<>>`:r.length===1?r[0]:r.map(T).join(` \\o `)},Be=e=>L(e)?`[${e}]`:`.${e}`,z=e=>e.every(e=>L(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Ve=(e,t,n)=>{let r=n.checker,i=e=>e.name===void 0||d.default.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),a=e=>{if(d.default.isPropertyAssignment(e))return H(e.initializer,t,n);if(d.default.isShorthandPropertyAssignment(e))return H(e.name,t,n);throw new l.L(`Unsupported object member`,e)},o=e.properties.filter(d.default.isSpreadAssignment);if(o.length===0){if(e.properties.length===0)throw new l.L(`TLA+ has no empty record, so use a Map`,e);return z(e.properties.map(e=>{let t=i(e);if(t===void 0)throw new l.L(`Computed keys need a spread base`,e);return{key:t,value:a(e)}}))}let s=e.properties[0],c=e.properties.slice(1);if(d.default.isSpreadAssignment(s)&&o.length===1){let e=r.getTypeAtLocation(s.expression),o=H(s.expression,t,n);if(c.length===0)return o;if(c.every(t=>{let n=i(t);return n===void 0||e.getProperty(n)!==void 0})){let e=c.map(e=>{let r=i(e);if(r!==void 0)return`!${Be(r)} = ${E(a(e))}`;if(e.name===void 0||!d.default.isComputedPropertyName(e.name))throw new l.L(`Unsupported object member`,e);return`![${H(e.name.expression,t,n)}] = ${E(a(e))}`});return`[${T(o)} EXCEPT ${e.join(`, `)}]`}}return z(r.getTypeAtLocation(e).getProperties().map(o=>{let s=o.name,c=e.properties.findLast(e=>d.default.isSpreadAssignment(e)?r.getTypeAtLocation(e.expression).getProperty(s)!==void 0:i(e)===s);if(c===void 0||!d.default.isSpreadAssignment(c)&&i(c)===void 0)throw new l.L(`Can't tell which value ${s} takes`,e);return{key:s,value:d.default.isSpreadAssignment(c)?`${T(H(c.expression,t,n))}${Be(s)}`:a(c)}}))},He=(e,t,n,r)=>{let i=e=>T(H(e,n,r)),a=e.arguments[0];if((t===`floor`||t===`trunc`)&&e.arguments.length===1){let n=d.default.isParenthesizedExpression(a)?a.expression:a;if(!d.default.isBinaryExpression(n)||n.operatorToken.kind!==d.default.SyntaxKind.SlashToken)throw new l.L(`Math.${t} only takes a division, as in Math.${t}(a / b)`,e);let o=i(n.left),s=i(n.right);return t===`floor`?`${o} \\div ${s}`:(r.prelude.add(`Quot`),`Quot(${o}, ${s})`)}if(t===`abs`&&e.arguments.length===1)return y(i(a),`value`,r,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((t===`min`||t===`max`)&&e.arguments.length>0){let o=t===`min`?`<=`:`>=`;if(e.arguments.length===1&&d.default.isSpreadElement(a)){let e=T(at(a.expression,n,r)),t=r.names.getFresh(`candidate`),i=r.names.getFresh(`other`);return`CHOOSE ${t} \\in ${e} : \\A ${i} \\in ${e} : ${t} ${o} ${i}`}return e.arguments.map(i).reduce((e,t)=>y(e,`best`,r,e=>y(t,`value`,r,t=>`IF ${e} ${o} ${t} THEN ${e} ELSE ${t}`)))}throw new l.L(`Unsupported call: Math.${t}`,e)},Ue=(e,t,n,r)=>{let i=h(e.expression,n.checker),a=_(i);if(a!==void 0)return be(a,e,t,n);if(!g(e)){let r=i===void 0?void 0:t.bindings.get(i);return r===void 0?xe(e,t,n):`${r}(${e.arguments.map(e=>H(e,t,n)).join(`, `)})`}let o=e.expression.expression,s=e.expression.name.text,c=d.default.isIdentifier(o)?o.text:void 0;return c===`Math`?He(e,s,t,n):(c===`Object`&&s===`fromEntries`?st(e.arguments[0],t,n):ct(e,t,n))??vt(e,t,n,r)},We=(e,t,n)=>{let r=H(e,t,n);return F(e,n)===`string`?r:`ToString(${r})`},Ge=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=We(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(T).join(` \\o `)},Ke=(e,t,n)=>{let r=e.operatorToken.kind,i=e=>T(H(e,t,n)),a=F(e.left,n)===`string`||F(e.right,n)===`string`,o=Le.get(r);if(o!==void 0){if(!I(e.left,n)||!I(e.right,n))throw new l.L(`${e.operatorToken.getText()} needs booleans, so compare explicitly`,e);return`${i(e.left)} ${o} ${i(e.right)}`}if(r===d.default.SyntaxKind.PlusToken&&a)return`${T(We(e.left,t,n))} \\o ${T(We(e.right,t,n))}`;if(r===d.default.SyntaxKind.PlusToken)return`${i(e.left)} + ${i(e.right)}`;if(r===d.default.SyntaxKind.PercentToken)return n.prelude.add(`Rem`),`Rem(${H(e.left,t,n)}, ${H(e.right,t,n)})`;if(r===d.default.SyntaxKind.QuestionQuestionToken)return n.prelude.add(`Null`),n.prelude.add(`Undefined`),y(i(e.left),`value`,n,t=>`IF ${t} \\in {Null, Undefined} THEN ${i(e.right)} ELSE ${t}`);if(r===d.default.SyntaxKind.InKeyword)return`${i(e.left)} \\in DOMAIN ${i(e.right)}`;if(r===d.default.SyntaxKind.SlashToken)throw new l.L(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,e);if(Ie.has(r)&&a)throw new l.L(`TLA+ strings have no order, so compare them with === only`,e);let s=Fe.get(r);if(s===void 0)throw new l.L(`Unsupported operator: ${e.operatorToken.getText()}`,e.operatorToken);return`${i(e.left)} ${s} ${i(e.right)}`},qe=(e,t,n)=>{let r=[...n.variables].find(t=>t[0].name===e);if(r===void 0)throw new l.L(`Unknown variable: ${e}`,t);return r[1]},Je=(e,t,n)=>{let r=t.valueDeclaration,i=r!==void 0&&d.default.isEnumMember(r)?n.checker.getConstantValue(r):void 0;if(typeof i==`string`)return te(i,n);if(typeof i==`number`&&Number.isInteger(i))return String(i);throw new l.L(`Unsupported enum member`,e)},Ye=(e,t,n,r)=>{if(t!==void 0&&t.flags&d.default.SymbolFlags.EnumMember)return Je(e,t,r);let i=_(t);if(i!==void 0)return v(i)===void 0?be(i,void 0,n,r):j(i,r).name},Xe=(e,t,n)=>{if(e.text===`undefined`)return n.prelude.add(`Undefined`),`Undefined`;let r=h(e,n.checker),i=r===void 0?void 0:t.bindings.get(r);if(i!==void 0)return i;if(r!==void 0&&r===t.previous)return z(n.checker.getTypeAtLocation(e).getProperties().map(t=>({key:t.name,value:qe(t.name,e,n)})));let a=Ye(e,r,t,n);if(a!==void 0)return a;throw r!==void 0&&n.variables.has(r)?new l.L(`${e.text} can't be read here`,e):new l.L(`Unknown name: ${e.text}`,e)},Ze=(e,t,n)=>{if(e.questionDotToken!==void 0)throw new l.L(`Optional chaining isn't supported`,e);let r=Ye(e,h(e,n.checker),t,n);if(r!==void 0)return r;let i=e.expression,a=e.name.text;return t.previous!==void 0&&d.default.isIdentifier(i)&&h(i,n.checker)===t.previous?qe(a,e,n):(a===`length`||a===`size`?ot(i,t,n):void 0)??`${T(H(i,t,n))}.${a}`},Qe=(e,t,n)=>`${T(H(e.expression,t,n))}[${Re(e,t,n)}]`,B=(e,t,n)=>{if(!I(e,n))throw new l.L(`Conditions must be booleans, so compare explicitly`,e);return H(e,t,n)},V=(e,t,n)=>{if(d.default.isParenthesizedExpression(e))return V(e.expression,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken)return B(e.operand,t,n);if(d.default.isBinaryExpression(e)&&e.operatorToken.kind===d.default.SyntaxKind.BarBarToken){let r=V(e.left,t,n),i=V(e.right,t,n);return`${T(r)} /\\ ${T(i)}`}return`~${T(B(e,t,n))}`},H=(e,t,n,r=!1)=>{if(d.default.isParenthesizedExpression(e)||d.default.isAsExpression(e)||d.default.isSatisfiesExpression(e)||d.default.isTypeAssertionExpression(e))return H(e.expression,t,n,r);if(d.default.isNonNullExpression(e))return H(e.expression,t,n,!0);if(d.default.isNumericLiteral(e)){if(!Number.isInteger(Number(e.text)))throw new l.L(`Only integers are supported: ${e.text}`,e);return String(Number(e.text))}if(d.default.isStringLiteral(e)||d.default.isNoSubstitutionTemplateLiteral(e))return te(e.text,n);if(d.default.isTemplateExpression(e))return Ge(e,t,n);if(e.kind===d.default.SyntaxKind.TrueKeyword)return`TRUE`;if(e.kind===d.default.SyntaxKind.FalseKeyword)return`FALSE`;if(e.kind===d.default.SyntaxKind.NullKeyword)return n.prelude.add(`Null`),`Null`;if(d.default.isIdentifier(e))return Xe(e,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken){if(!I(e.operand,n))throw new l.L(`! needs a boolean, so compare explicitly`,e);return`~${T(H(e.operand,t,n))}`}if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken)return`-${T(H(e.operand,t,n))}`;if(d.default.isBinaryExpression(e))return Ke(e,t,n);if(d.default.isConditionalExpression(e))return`IF ${B(e.condition,t,n)} THEN ${H(e.whenTrue,t,n)} ELSE ${H(e.whenFalse,t,n)}`;if(d.default.isArrayLiteralExpression(e))return ze(e,t,n);if(d.default.isObjectLiteralExpression(e))return Ve(e,t,n);if(d.default.isPropertyAccessExpression(e))return Ze(e,t,n);if(d.default.isElementAccessExpression(e))return Qe(e,t,n);if(d.default.isCallExpression(e))return Ue(e,t,n,r);if(d.default.isNewExpression(e))return yt(e,t,n);throw new l.L(`Unsupported expression: ${e.getText()}`,e)},$e=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),U=(e,t)=>{let n=ee(e,t);if(n?.body===void 0)throw new l.L(`Pass a function here`,e);return{parameters:n.parameters,body:n.body}},W=(e,t,n)=>M(U(e,n).body,t,n),et=(e,t,n)=>{if(U(e,n).parameters[1]!==void 0)throw new l.L(t,e)},G=(e,t,n)=>{let r=U(e,n).parameters[0];if(r===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!d.default.isIdentifier(r.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:A(r.name,e,t,n)}}let i=n.names.getFresh(r.name.text),a=h(r.name,n.checker);return{variable:i,scope:k(t,[{name:i,symbol:a}])}},tt=(e,t,n,r,i)=>{let a=U(e,i).parameters,o=t===void 0||a[0]===void 0?r:A(a[0].name,t,r,i);return a[1]===void 0?o:A(a[1].name,`(${n} - 1)`,o,i)},nt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),rt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),it=(e,t)=>y(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),K=(e,t,n)=>{let r=e=>H(e,t,n);if(d.default.isParenthesizedExpression(e))return K(e.expression,t,n);if(d.default.isArrayLiteralExpression(e)&&e.elements.length===1&&d.default.isSpreadElement(e.elements[0])){let i=e.elements[0].expression,a=F(i,n);return a===`set`?{set:r(i),isMapped:!1}:a===`map`?rt(r(i),n):K(i,t,n)}if(!g(e))return;let i=e.expression.expression,a=e.expression.name.text;if(d.default.isIdentifier(i)&&i.text===`Object`){let t=r(e.arguments[0]);return a===`keys`?{set:`DOMAIN ${T(t)}`,isMapped:!1}:a===`values`?nt(t,n):a===`entries`?rt(t,n):void 0}let o=F(i,n);if(o===`set`&&(a===`values`||a===`keys`))return{set:r(i),isMapped:!1};if(o===`set`&&a===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${T(r(i))}}`,isMapped:!1}}if(o===`map`&&a===`keys`)return{set:`DOMAIN ${T(r(i))}`,isMapped:!1};if(o===`map`&&a===`values`)return nt(r(i),n);if(o===`map`&&a===`entries`)return rt(r(i),n);if(a===`toArray`)return K(i,t,n);if(a!==`filter`&&a!==`map`)return;let s=K(i,t,n);if(s===void 0)return;let c=e.arguments[0];et(c,`Elements of a set have no index`,n);let l=G(c,t,n),u=W(c,l.scope,n);return a===`filter`?{set:`{${l.variable} \\in ${T(s.set)} : ${u}}`,isMapped:s.isMapped}:{set:`{${u} : ${l.variable} \\in ${T(s.set)}}`,isMapped:!0}},at=(e,t,n)=>{let r=K(e,t,n);if(r!==void 0)return r.set;let i=F(e,n),a=H(e,t,n);if(i===`set`)return a;if(i!==`sequence`)throw new l.L(`Expected a Set or an array`,e);return it(a,n)},ot=(e,t,n)=>{let r=K(e,t,n);if(r?.isMapped)throw new l.L(`map() can merge equal elements, so count before mapping`,e.parent);if(r!==void 0)return`Cardinality(${r.set})`;let i=F(e,n),a=H(e,t,n);if(i===`sequence`||i===`string`)return`Len(${a})`;if(i===`set`)return`Cardinality(${a})`;if(i===`map`)return`Cardinality(DOMAIN ${T(a)})`},st=(e,t,n)=>{if(!g(e)||e.expression.name.text!==`map`)return;let r=e.expression.expression,i=K(r,t,n)?.set??(F(r,n)===`sequence`?it(H(r,t,n),n):void 0),a=e.arguments[0],o=U(a,n).parameters[0],s=(d.default.isArrowFunction(a)||d.default.isFunctionExpression(a))&&!d.default.isBlock(a.body)?a.body:void 0,c=s!==void 0&&d.default.isParenthesizedExpression(s)?s.expression:s,u=c!==void 0&&d.default.isArrayLiteralExpression(c)&&c.elements.length===2&&o!==void 0&&d.default.isIdentifier(o.name)&&d.default.isIdentifier(c.elements[0])&&c.elements[0].text===o.name.text;if(i===void 0||!u)throw new l.L(`Build a Map or record from a set with set.values().map((key) => [key, value])`,e);let f=G(a,t,n),p=H(c.elements[1],f.scope,n);return`[${f.variable} \\in ${i} |-> ${p}]`},ct=(e,t,n)=>{let r=e.expression.expression,i=e.expression.name.text,a=e=>T(H(e,t,n)),o=e.arguments[1],s=e.arguments[0];if(d.default.isIdentifier(r)&&r.text===`Array`&&i===`from`&&e.arguments.length===2&&d.default.isObjectLiteralExpression(s)){let r=s.properties.find(e=>e.name?.getText()===`length`);if(r===void 0||!d.default.isPropertyAssignment(r))throw new l.L(`Array.from needs { length: n }`,e);let i=n.names.getFresh(`index`),c=tt(o,void 0,i,t,n);return`[${i} \\in 1..${a(r.initializer)} |-> ${W(o,c,n)}]`}if(i!==`fill`||e.arguments.length!==1)return;let c=d.default.isNewExpression(r)||d.default.isCallExpression(r)?r:void 0,u=c!==void 0&&d.default.isIdentifier(c.expression)&&c.expression.text===`Array`&&c.arguments?.length===1?c.arguments[0]:void 0;if(u!==void 0)return`[${n.names.getFresh(`index`)} \\in 1..${a(u)} |-> ${H(e.arguments[0],t,n)}]`},lt=(e,t,n,r)=>{let i=i=>W(t,tt(t,`${T(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${T(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${T(e)} : ${T(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${T(i(o))}`}},q=(e,t,n,r)=>n?t:(r.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),ut=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e=>H(e,n,r),s=e.arguments[0],c=T(t),u=e=>d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken,f=e=>u(e)?`Len(${t}) - ${T(o(e.operand))}`:o(e),p=e=>()=>{let t=r.names.getFresh(`index`),i=tt(s,`${c}[${t}]`,t,n,r);return e(t,W(s,i,r))},m=(/* @__PURE__ */ new Map([[`at`,()=>{let e=u(s)?`${f(s)} + 1`:`${T(o(s))} + 1`;return q(`${e} \\in DOMAIN ${c}`,`${c}[${e}]`,i,r)}],[`includes`,()=>{let e=r.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${c} : ${c}[${e}] = ${T(o(s))}`}],[`indexOf`,()=>y(o(s),`value`,r,e=>{let t=r.names.getFresh(`index`),n=r.names.getFresh(`earlier`),i=`${c}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${c} : ${i} THEN (CHOOSE ${t} \\in DOMAIN ${c} : ${i} /\\ \\A ${n} \\in 1..(${t} - 1) : ${c}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let n=s===void 0?`0`:f(s),r=e.arguments[1]===void 0?void 0:T(f(e.arguments[1])),i=r===void 0?`Len(${t})`:`IF ${r} < Len(${t}) THEN ${r} ELSE Len(${t})`;return`SubSeq(${t}, ${/^\d+$/.test(n)?String(Number(n)+1):`${T(n)} + 1`}, ${i})`}],[`concat`,()=>[t,...e.arguments.map(e=>F(e,r)===`sequence`?o(e):`<<${o(e)}>>`)].map(T).join(` \\o `)],[`with`,()=>`[${c} EXCEPT ![${T(o(s))} + 1] = ${E(o(e.arguments[1]))}]`],[`toReversed`,()=>{let e=r.names.getFresh(`index`);return`[${e} \\in DOMAIN ${c} |-> ${c}[Len(${t}) - ${e} + 1]]`}],[`map`,p((e,t)=>`[${e} \\in DOMAIN ${c} |-> ${t}]`)],[`every`,p((e,t)=>`\\A ${e} \\in DOMAIN ${c} : ${t}`)],[`some`,p((e,t)=>`\\E ${e} \\in DOMAIN ${c} : ${t}`)],[`filter`,()=>{et(s,`filter() can't take an index`,r);let e=G(s,n,r);return`SelectSeq(${t}, LAMBDA ${e.variable} : ${W(s,e.scope,r)})`}],[`find`,()=>{let e=lt(t,s,n,r);return q(e.exists,`${c}[${e.first}]`,i,r)}],[`findIndex`,()=>{let e=lt(t,s,n,r);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(a);if(m===void 0)throw new l.L(`Unsupported array method: ${a}`,e);return m()},dt=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e.arguments[0];if(a===`includes`||a===`has`)return`${T(H(o,n,r))} \\in ${T(t.set)}`;if(a!==`every`&&a!==`some`&&a!==`find`)throw new l.L(`Unsupported method on a set's elements: ${a}`,e);et(o,`Elements of a set have no index`,r);let s=G(o,n,r),c=W(o,s.scope,r),u=`${s.variable} \\in ${T(t.set)} : ${c}`;return a===`every`?`\\A ${u}`:a===`some`?`\\E ${u}`:q(`\\E ${u}`,`CHOOSE ${u}`,i,r)},ft=(e,t,n)=>{let r=e.expression.name.text,i=T(H(e.expression.expression,t,n)),a=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n)),o=(/* @__PURE__ */ new Map([[`has`,`${a} \\in ${i}`],[`union`,`${i} \\cup ${a}`],[`intersection`,`${i} \\cap ${a}`],[`difference`,`${i} \\ ${a}`],[`symmetricDifference`,`(${i} \\ ${a}) \\cup (${a} \\ ${i})`],[`isSubsetOf`,`${i} \\subseteq ${a}`],[`isSupersetOf`,`${a} \\subseteq ${i}`],[`isDisjointFrom`,`${i} \\cap ${a} = {}`]])).get(r);if(o===void 0)throw new l.L(`Unsupported Set method: ${r}`,e);if(e.arguments[0]===void 0)throw new l.L(`Set method needs an argument: ${r}`,e);return o},pt=(e,t,n,r)=>{let i=e.expression.name.text,a=T(H(e.expression.expression,t,n)),o=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n));if(i!==`has`&&i!==`get`)throw new l.L(`Unsupported Map method: ${i}`,e);if(e.arguments[0]===void 0)throw new l.L(`Map method needs a key: ${i}`,e);return i===`has`?`${o} \\in DOMAIN ${a}`:r?`${a}[${o}]`:y(a,`map`,n,e=>y(o,`key`,n,t=>q(`${t} \\in DOMAIN ${e}`,`${e}[${t}]`,r,n)))},mt={pop:e=>`SubSeq(${e}, 1, Len(${e}) - 1)`,shift:e=>`Tail(${e})`},ht=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${T(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${T(e)}`],[`pop`,mt.pop],[`shift`,mt.shift]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${T(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${T(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${T(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${T(e)} \\ {${t[0]}} |-> ${T(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),gt=new Set([...ht.values()].flatMap(e=>[...e.keys()])),_t=(e,t,n,r,i)=>{let a=n.arguments.map(e=>H(e,r,i));return ht.get(t)?.get(n.expression.name.text)?.(e,a,i)},vt=(e,t,n,r)=>{let i=e.expression.expression,a=K(i,t,n);if(a!==void 0)return dt(e,a,t,n,r);let o=d.default.isNewExpression(i)&&i.arguments?.length===1&&d.default.isIdentifier(i.expression)&&(i.expression.text===`Set`||i.expression.text===`Map`),s=F(i,n),c=o?_t(H(i,t,n),s,e,t,n):void 0;if(c!==void 0)return c;if(s===`sequence`){let a=e.expression.name.text,o=H(i,t,n),s=i=>ut(e,i,t,n,r);return $e.has(a)?s(o):y(o,`sequence`,n,s)}if(s===`set`)return ft(e,t,n);if(s===`map`)return pt(e,t,n,r);throw new l.L(`Unsupported call: ${e.expression.getText()}`,e)},yt=(e,t,n)=>{let r=e.expression.getText(),i=e.arguments?.[0];if(r===`Set`)return i===void 0?`{}`:d.default.isArrayLiteralExpression(i)&&!i.elements.some(d.default.isSpreadElement)?`{${i.elements.map(e=>H(e,t,n)).join(`, `)}}`:at(i,t,n);if(r!==`Map`)throw new l.L(`Unsupported constructor: new ${r}`,e);if(i===void 0)return`<<>>`;if(d.default.isArrayLiteralExpression(i))return i.elements.length===0?`<<>>`:i.elements.toReversed().map(e=>{if(!d.default.isArrayLiteralExpression(e)||e.elements.length!==2)throw new l.L(`Write each Map entry as [key, value]`,e);return`(${H(e.elements[0],t,n)} :> ${H(e.elements[1],t,n)})`}).join(` @@ `);if(F(i,n)===`map`)return H(i,t,n);let a=st(i,t,n);if(a===void 0)throw new l.L(`Unsupported constructor: new ${r}`,e);return a},bt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusEqualsToken,`+`],[d.default.SyntaxKind.MinusEqualsToken,`-`],[d.default.SyntaxKind.AsteriskEqualsToken,`*`]]),xt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusPlusToken,`+`],[d.default.SyntaxKind.MinusMinusToken,`-`]]),J=(e,t,n)=>{if(d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e))return J(e.expression,t,n);if(d.default.isIdentifier(e)){let r=h(e,n.checker),i=r===void 0?void 0:t.scope.bindings.get(r);if(r===void 0||i===void 0||!t.mutable.has(r))throw new l.L(`Only state variables and local lets can change: ${e.text}`,e);return{symbol:r,current:i,selector:``}}if(d.default.isPropertyAccessExpression(e)){if(F(e.expression,n)!==`other`)throw new l.L(`Can't assign to ${e.getText()}`,e);let r=J(e.expression,t,n);return{...r,selector:`${r.selector}.${e.name.text}`}}if(d.default.isElementAccessExpression(e)){let r=J(e.expression,t,n),i=Re(e,t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}if(g(e)&&e.expression.name.text===`get`&&e.arguments.length===1&&F(e.expression.expression,n)===`map`){let r=J(e.expression.expression,t,n),i=H(e.arguments[0],t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}throw new l.L(`Can't assign to ${e.getText()}`,e)},Y=(e,t,n,r)=>{let i=J(e,t,n),a=i.selector===``?r(i.current):`[${T(i.current)} EXCEPT !${i.selector} = ${E(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},X=(e,t,n,r,i)=>d.default.isArrayLiteralExpression(e)?e.elements.reduce((e,a,o)=>{if(d.default.isOmittedExpression(a))return e;if(d.default.isSpreadElement(a))throw new l.L(`Rest elements can't be assigned`,a);let s=t!==void 0&&d.default.isArrayLiteralExpression(t)?t.elements[o]:void 0;return s!==void 0&&!d.default.isSpreadElement(s)?X(a,s,H(s,r.scope,i),e,i):X(a,void 0,`${T(n)}[${o+1}]`,e,i)},r):d.default.isObjectLiteralExpression(e)?e.properties.reduce((e,t)=>{if(d.default.isShorthandPropertyAssignment(t))return X(t.name,void 0,`${T(n)}.${t.name.text}`,e,i);if(d.default.isPropertyAssignment(t)&&d.default.isIdentifier(t.name))return X(t.initializer,void 0,`${T(n)}.${t.name.text}`,e,i);throw new l.L(`Can't assign to ${t.getText()}`,t)},r):Y(e,r,i,()=>n),St=(e,t,n)=>{if(d.default.isNonNullExpression(e)||d.default.isParenthesizedExpression(e))return St(e.expression,t,n);if(!g(e))return;let r=e.expression.name.text;if(r!==`shift`&&r!==`pop`)return;let i=e.expression.expression;if(F(i,n)!==`sequence`)return;let a=H(i,t.scope,n);return{value:r===`shift`?`Head(${a})`:`${T(a)}[Len(${a})]`,path:Y(i,t,n,mt[r])}},Ct=(e,t,n)=>{if(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e)){let r=xt.get(e.operator);return r===void 0?void 0:Y(e.operand,t,n,e=>`${T(e)} ${r} 1`)}if(!d.default.isBinaryExpression(e))return;let r=e.operatorToken.kind;if(r===d.default.SyntaxKind.EqualsToken){let r=H(e.right,t.scope,n);return X(e.left,e.right,r,t,n)}let i=r===d.default.SyntaxKind.PlusEqualsToken&&F(e.left,n)===`string`?`\\o`:bt.get(r);if(i===void 0)return;let a=T(H(e.right,t.scope,n));return Y(e.left,t,n,e=>`${T(e)} ${i} ${a}`)},wt=(e,t,n,r,i)=>{let a=e.arguments.map(e=>H(e,t.scope,n));if(g(e)){let r=e.expression.expression,o=e.expression.name.text,s=r.getText()===`console`;if(s&&o===`log`){let e=a.length===1?a[0]:`<<${a.join(`, `)}>>`;return x([b(`PrintT(${e})`),i(t)])}if(s&&o===`assert`){let e=a[1]??JSON.stringify(`Assertion failed`);return x([b(`Assert(${a[0]}, ${e})`),i(t)])}if(gt.has(o)){let a=F(r,n);return i(Y(r,t,n,r=>{let i=_t(r,a,e,t.scope,n);if(i===void 0)throw new l.L(`Unsupported method: ${o}`,e);return i}))}}let o=_(h(e.expression,n.checker)),s=v(o);if(o===void 0||s?.body===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);if(r.inlining.has(o))throw new l.L(`Helpers that change state can't call themselves`,e);let c=me(s.parameters.map(e=>e.name),a,t.scope,n),u=d.default.isBlock(s.body)?s.body.statements:[d.default.factory.createExpressionStatement(s.body)],f=e=>i({...e,scope:{...e.scope,previous:t.scope.previous}});return S(c.definitions,Z(u,{...t,scope:c.scope},n,{next:f,exit:f,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...r.inlining,o])}))},Tt=(e,t,n,r,i)=>{if(d.default.isParenthesizedExpression(e))return Tt(e.expression,t,n,r,i);if(d.default.isCallExpression(e))return wt(e,t,n,r,i);let a=Ct(e,t,n);if(a===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);return i(a)},Et=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=e.slice(1);if(i.initializer===void 0)throw new l.L(`Declare locals with a value`,i);if(v(i.initializer)!==void 0)return Et(a,t,n,r);let o=St(i.initializer,t,n),s=o?.value??H(i.initializer,t.scope,n),c=o?.path??t,u=pe(i.name,s,c.scope,n),f=d.default.isIdentifier(i.name)?h(i.name,n.checker):void 0,p=(i.parent.flags&d.default.NodeFlags.Let)!==0&&f!==void 0?/* @__PURE__ */ new Set([...t.mutable,f]):t.mutable;return S(u.definitions,Et(a,{...c,scope:u.scope,mutable:p},n,r))},Z=(e,t,n,r)=>{if(e.length===0)return r.next(t);let i=e[0],a=t=>Z(e.slice(1),t,n,r);if(d.default.isBlock(i))return Z(i.statements,t,n,{...r,next:a});if(d.default.isEmptyStatement(i))return a(t);if(d.default.isVariableStatement(i))return Et(i.declarationList.declarations,t,n,a);if(d.default.isIfStatement(i))return Ce(i,t.scope,n,e=>Z([e],t,n,{...r,next:a}),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression!==void 0)throw new l.L(`Actions can't return a value`,i);return r.exit(t)}if(d.default.isBreakStatement(i)){if(r.breakTo===void 0)throw new l.L(`Unsupported break`,i);return r.breakTo(t)}if(d.default.isThrowStatement(i))return b(Se(i,t.scope,n));if(d.default.isSwitchStatement(i))return we(i,t.scope,n,e=>Z(e,t,n,{...r,next:a,breakTo:a}),()=>a(t));if(d.default.isExpressionStatement(i))return Tt(i.expression,t,n,r,a);throw d.default.isIterationStatement(i,!1)?new l.L(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,i):new l.L(`Unsupported statement: ${i.getText()}`,i)},Dt=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return re;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return x([...t.filter(e=>e.value!==e.name).map(e=>b(`${e.name}' = ${E(e.value)}`)),...r.length>0?[b(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return Z(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},Ot=e=>g(e)&&e.expression.name.text===`get`?Ot(e.expression.expression):d.default.isPropertyAccessExpression(e)||d.default.isElementAccessExpression(e)||d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e)?Ot(e.expression):e,kt=(e,t,n=/* @__PURE__ */ new Set)=>{let r=e=>{let n=Ot(e),r=d.default.isIdentifier(n)?h(n,t.checker):void 0;return r!==void 0&&t.variables.has(r)},i=d.default.isBinaryExpression(e)&&e.operatorToken.kind>=d.default.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=d.default.SyntaxKind.LastAssignment&&r(e.left),a=(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e))&&xt.has(e.operator)&&r(e.operand),o=g(e)&&gt.has(e.expression.name.text)&&r(e.expression.expression);if(i||a||o)return!0;if(d.default.isCallExpression(e)){let r=_(h(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),kt(r,t,n)))return!0}return d.default.forEachChild(e,e=>kt(e,t,n)||void 0)??!1},At=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),jt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
15
+ `).join(`\n${t}`),O=e=>({bindings:new Map(e.variables),previous:void 0}),k=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),de=(e,t)=>{if(!d.default.isIdentifier(e.name)||e.initializer!==void 0||e.questionToken!==void 0||e.dotDotDotToken!==void 0)throw new l.R(`Use a plain parameter here: ${e.getText()}`,e);return{node:e,name:t.names.getFresh(e.name.text),symbol:h(e.name,t.checker)}},fe=(e,t)=>e.map(e=>de(e,t)),A=(e,t,n,r)=>d.default.isIdentifier(e)?k(n,[{name:t,symbol:h(e,r.checker)}]):e.elements.reduce((n,i,a)=>{if(d.default.isOmittedExpression(i))return n;if(i.dotDotDotToken!==void 0||i.initializer!==void 0)throw new l.R(`Rest elements and default values aren't supported`,i);let o=d.default.isArrayBindingPattern(e)?`${T(t)}[${a+1}]`:`${T(t)}.${(i.propertyName??i.name).getText()}`;return A(i.name,o,n,r)},n),pe=(e,t,n,r)=>{let i=r.names.getFresh(d.default.isIdentifier(e)?e.text:`value`);return{definitions:[`${i} == ${D(t,` `)}`],scope:A(e,i,n,r)}},me=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=pe(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),he=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),ge=(e,t,n)=>{if(d.default.isIdentifier(e)){let r=h(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=_(r);if(i!==void 0&&!n.has(i))return n.add(i),ge(i,t,n)}return d.default.forEachChild(e,e=>ge(e,t,n)||void 0)??!1},_e=e=>d.default.isVariableDeclaration(e)?e.initializer:void 0,j=(e,t)=>{let n=t.definitions.get(e);if(n!==void 0)return t.inProgress.has(e)&&t.recursive.add(e),n;if(e.name===void 0)throw new l.R(`Name this function`,e);let r=v(e),i=fe(r?.parameters??[],t),a=i.map(e=>{let n=t.checker.getTypeAtLocation(e.node.name).getCallSignatures();return n.length===0?e.name:`${e.name}(${n[0].parameters.map(()=>`_`).join(`, `)})`}),o={name:t.names.getFresh(e.name.getText()),parameters:a,readsState:ge(e,t,/* @__PURE__ */ new Set([e]))};t.definitions.set(e,o),t.inProgress.add(e);let s=r===void 0?_e(e):r.body;if(s===void 0)throw new l.R(`Give this a value`,e);let c=M(s,k(O(t),i),t);t.inProgress.delete(e);let u=a.length===0?o.name:`${o.name}(${a.join(`, `)})`;return t.output.push(`${u} ==\n ${D(c,` `)}`),o},ve=(e,t,n,r)=>{if(e.body===void 0)throw new l.R(`Give this a body`,e);let i=me(e.parameters.map(e=>e.name),t.map(e=>H(e,n,r)),n,r),a=M(e.body,i.scope,r);return i.definitions.length===0?a:ae(S(i.definitions,b(a)))},ye=(e,t,n)=>{if(d.default.isArrowFunction(e)||d.default.isFunctionExpression(e)){let r=fe(e.parameters,n),i=M(e.body,k(t,r),n);return`LAMBDA ${r.map(e=>e.name).join(`, `)} : ${i}`}let r=h(e,n.checker),i=_(r);if(i!==void 0)return j(i,n).name;let a=r===void 0?void 0:t.bindings.get(r);if(a===void 0)throw new l.R(`Pass a function here`,e);return a},be=(e,t,n,r)=>{let i=j(e,r),a=t?.arguments??[];if(i.readsState&&he(n,r)){let t=v(e);if(t!==void 0)return ve(t,a,n,r);let i=_e(e);if(i===void 0)throw new l.R(`Give this a body`,e);return H(i,n,r)}if(i.parameters.length===0)return i.name;let o=a.map((e,t)=>i.parameters[t].includes(`(`)?ye(e,n,r):H(e,n,r));return`${i.name}(${o.join(`, `)})`},xe=(e,t,n)=>{let r=ee(e.expression,n);if(r===void 0)throw new l.R(`Unsupported call: ${e.expression.getText()}`,e);if(n.inProgress.has(r))throw new l.R(`A local function can't call itself, so declare it at the top level`,e);n.inProgress.add(r);let i=ve(r,e.arguments,t,n);return n.inProgress.delete(r),i},M=(e,t,n)=>d.default.isBlock(e)?ae(N(e.statements,t,n,()=>{throw new l.R(`This function must return a value on every path`,e)})):H(e,t,n),N=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=t=>N(e.slice(1),t,n,r);if(d.default.isBlock(i))return N(i.statements,t,n,a);if(d.default.isVariableStatement(i)){let e=i.declarationList.declarations.reduce((e,t)=>{if(t.initializer===void 0)throw new l.R(`Declare locals with a value`,t);if(v(t.initializer)!==void 0)return e;let r=H(t.initializer,e.scope,n),i=pe(t.name,r,e.scope,n);return{definitions:[...e.definitions,...i.definitions],scope:i.scope}},{definitions:[],scope:t});return S(e.definitions,a(e.scope))}if(d.default.isIfStatement(i))return Ce(i,t,n,e=>N([e],t,n,a),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression===void 0)throw new l.R(`Return a value`,i);return b(H(i.expression,t,n))}if(d.default.isThrowStatement(i))return b(Se(i,t,n));if(d.default.isSwitchStatement(i))return we(i,t,n,e=>N(e,t,n,a),()=>a(t));throw new l.R(`Unsupported statement: ${i.getText()}`,i)},Se=(e,t,n)=>{let r=e.expression;return`Assert(FALSE, ${d.default.isNewExpression(r)&&r.arguments?.[0]!==void 0?H(r.arguments[0],t,n):JSON.stringify(r.getText())})`},Ce=(e,t,n,r,i)=>{let a=B(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return ie(a,o,s,V(e.expression,t,n))},we=(e,t,n,r,i)=>{let a=T(H(e.expression,t,n)),o=e.caseBlock.clauses,s=e=>{if(e===o.length)return i();let c=o.findIndex((t,n)=>n>=e&&t.statements.length>0),u=o.slice(e,c===-1?o.length:c+1),f=u[u.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(d.default.isBreakStatement(m)||d.default.isReturnStatement(m)||d.default.isThrowStatement(m)),g=e+u.length===o.length;if(p.length>0&&!h&&!g)throw new l.R(`End each case with break, return, or throw`,f);let _=r(m!==void 0&&d.default.isBreakStatement(m)?p.slice(0,-1):p);if(u.some(d.default.isDefaultClause))return _;let v=u.filter(d.default.isCaseClause).map(e=>`${a} = ${T(H(e.expression,t,n))}`).join(` \\/ `);return ie(v,_,s(e+u.length))};return s(0)},Te=e=>(e.flags&d.default.TypeFlags.Object)!==0&&(e.objectFlags&d.default.ObjectFlags.Reference)!==0,Ee=e=>e.getSymbol()?.getName()??``,P=e=>[`Set`,`ReadonlySet`].includes(Ee(e)),De=e=>[`Map`,`ReadonlyMap`].includes(Ee(e)),Oe=(e,t)=>e.isUnion()?e.types.every(e=>Oe(e,t)):t.isArrayType(e)||t.isTupleType(e),ke=(e,t)=>e.isUnion()?e.types.every(e=>ke(e,t)):(e.flags&t)!==0,F=(e,t)=>{let n=t.checker,r=n.getNonNullableType(n.getTypeAtLocation(e));return Oe(r,n)?`sequence`:P(r)?`set`:De(r)?`map`:ke(r,d.default.TypeFlags.StringLike)?`string`:`other`},I=(e,t)=>ke(t.checker.getTypeAtLocation(e),d.default.TypeFlags.BooleanLike),Ae=(e,t)=>P(t.checker.getTypeAtLocation(e)),L=e=>/^-?\d+$/.test(e),je=(e,t)=>{if(e.isStringLiteral())return te(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&d.default.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&d.default.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(d.default.TypeFlags.Undefined|d.default.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},R=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),Me=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=Ne(n,t);return typeof r==`string`?[...e,r]:r},[]),Ne=(e,t)=>{let n=t.checker;if(e.flags&d.default.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>je(e,t)),r=Me(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>L(e)&&L(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?T(e):e).join(` \\cup `)}let r=je(e,t);if(r!==void 0)return`{${r}}`;if(P(e)||De(e)||n.isTupleType(e)){let r=Me(Te(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(r))return r;if(P(e))return`SUBSET ${T(r[0])}`;if(De(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${r[1]}] : ${e} \\in SUBSET ${T(r[0])}}`}if(!(Te(e)&&e.target.elementFlags.every(e=>(e&d.default.ElementFlags.Required)!==0)))return R(e,`tuples with optional or rest elements can have any length`,t);if(r.length===0)return`{<<>>}`;if(r.length>1)return r.map(T).join(` \\X `);let i=t.names.getFresh(`element`);return`{<<${i}>> : ${i} \\in ${r[0]}}`}if(n.isArrayType(e))return R(e,`arrays can have any length, so use a tuple`,t);let i=e.getProperties();if(!(e.flags&d.default.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&i.length>0))return R(e,`use a union of literals, or records, tuples, and sets of them`,t);let a=i.find(e=>e.flags&d.default.SymbolFlags.Optional);if(a!==void 0)return R(e,`the optional field ${a.name} may be missing`,t);let o=Me(i.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(o))return o;let s=i.map(e=>e.name);return s.some(L)?!s.every(L)||o.some(e=>e!==o[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${s.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${o[0]}]`:`[${s.map((e,t)=>`${e} : ${o[t]}`).join(`, `)}]`},Pe=(e,t,n)=>{let r=Ne(e,n);if(typeof r!=`string`)throw new l.R(r.message,t);return r},Fe=/* @__PURE__ */ new Map([[d.default.SyntaxKind.MinusToken,`-`],[d.default.SyntaxKind.AsteriskToken,`*`],[d.default.SyntaxKind.AsteriskAsteriskToken,`^`],[d.default.SyntaxKind.EqualsEqualsEqualsToken,`=`],[d.default.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[d.default.SyntaxKind.LessThanToken,`<`],[d.default.SyntaxKind.LessThanEqualsToken,`<=`],[d.default.SyntaxKind.GreaterThanToken,`>`],[d.default.SyntaxKind.GreaterThanEqualsToken,`>=`]]),Ie=/* @__PURE__ */ new Set([d.default.SyntaxKind.LessThanToken,d.default.SyntaxKind.LessThanEqualsToken,d.default.SyntaxKind.GreaterThanToken,d.default.SyntaxKind.GreaterThanEqualsToken]),Le=/* @__PURE__ */ new Map([[d.default.SyntaxKind.AmpersandAmpersandToken,`/\\`],[d.default.SyntaxKind.BarBarToken,`\\/`]]),Re=(e,t,n)=>{let r=e.argumentExpression;return F(e.expression,n)===`sequence`?d.default.isNumericLiteral(r)?String(Number(r.text)+1):`${T(H(r,t,n))} + 1`:H(r,t,n)},ze=(e,t,n)=>{let r=e.elements.reduce((e,r)=>{if(!d.default.isSpreadElement(r)){let i=H(r,t,n),a=e.at(-1);return Array.isArray(a)?[...e.slice(0,-1),[...a,i]]:[...e,[i]]}if(F(r.expression,n)!==`sequence`)throw new l.R(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,r);return[...e,H(r.expression,t,n)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return r.length===0?`<<>>`:r.length===1?r[0]:r.map(T).join(` \\o `)},Be=e=>L(e)?`[${e}]`:`.${e}`,z=e=>e.every(e=>L(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Ve=(e,t,n)=>{let r=n.checker,i=e=>e.name===void 0||d.default.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),a=e=>{if(d.default.isPropertyAssignment(e))return H(e.initializer,t,n);if(d.default.isShorthandPropertyAssignment(e))return H(e.name,t,n);throw new l.R(`Unsupported object member`,e)},o=e.properties.filter(d.default.isSpreadAssignment);if(o.length===0){if(e.properties.length===0)throw new l.R(`TLA+ has no empty record, so use a Map`,e);return z(e.properties.map(e=>{let t=i(e);if(t===void 0)throw new l.R(`Computed keys need a spread base`,e);return{key:t,value:a(e)}}))}let s=e.properties[0],c=e.properties.slice(1);if(d.default.isSpreadAssignment(s)&&o.length===1){let e=r.getTypeAtLocation(s.expression),o=H(s.expression,t,n);if(c.length===0)return o;if(c.every(t=>{let n=i(t);return n===void 0||e.getProperty(n)!==void 0})){let e=c.map(e=>{let r=i(e);if(r!==void 0)return`!${Be(r)} = ${E(a(e))}`;if(e.name===void 0||!d.default.isComputedPropertyName(e.name))throw new l.R(`Unsupported object member`,e);return`![${H(e.name.expression,t,n)}] = ${E(a(e))}`});return`[${T(o)} EXCEPT ${e.join(`, `)}]`}}return z(r.getTypeAtLocation(e).getProperties().map(o=>{let s=o.name,c=e.properties.findLast(e=>d.default.isSpreadAssignment(e)?r.getTypeAtLocation(e.expression).getProperty(s)!==void 0:i(e)===s);if(c===void 0||!d.default.isSpreadAssignment(c)&&i(c)===void 0)throw new l.R(`Can't tell which value ${s} takes`,e);return{key:s,value:d.default.isSpreadAssignment(c)?`${T(H(c.expression,t,n))}${Be(s)}`:a(c)}}))},He=(e,t,n,r)=>{let i=e=>T(H(e,n,r)),a=e.arguments[0];if((t===`floor`||t===`trunc`)&&e.arguments.length===1){let n=d.default.isParenthesizedExpression(a)?a.expression:a;if(!d.default.isBinaryExpression(n)||n.operatorToken.kind!==d.default.SyntaxKind.SlashToken)throw new l.R(`Math.${t} only takes a division, as in Math.${t}(a / b)`,e);let o=i(n.left),s=i(n.right);return t===`floor`?`${o} \\div ${s}`:(r.prelude.add(`Quot`),`Quot(${o}, ${s})`)}if(t===`abs`&&e.arguments.length===1)return y(i(a),`value`,r,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((t===`min`||t===`max`)&&e.arguments.length>0){let o=t===`min`?`<=`:`>=`;if(e.arguments.length===1&&d.default.isSpreadElement(a)){let e=T(at(a.expression,n,r)),t=r.names.getFresh(`candidate`),i=r.names.getFresh(`other`);return`CHOOSE ${t} \\in ${e} : \\A ${i} \\in ${e} : ${t} ${o} ${i}`}return e.arguments.map(i).reduce((e,t)=>y(e,`best`,r,e=>y(t,`value`,r,t=>`IF ${e} ${o} ${t} THEN ${e} ELSE ${t}`)))}throw new l.R(`Unsupported call: Math.${t}`,e)},Ue=(e,t,n,r)=>{let i=h(e.expression,n.checker),a=_(i);if(a!==void 0)return be(a,e,t,n);if(!g(e)){let r=i===void 0?void 0:t.bindings.get(i);return r===void 0?xe(e,t,n):`${r}(${e.arguments.map(e=>H(e,t,n)).join(`, `)})`}let o=e.expression.expression,s=e.expression.name.text,c=d.default.isIdentifier(o)?o.text:void 0;return c===`Math`?He(e,s,t,n):(c===`Object`&&s===`fromEntries`?st(e.arguments[0],t,n):ct(e,t,n))??vt(e,t,n,r)},We=(e,t,n)=>{let r=H(e,t,n);return F(e,n)===`string`?r:`ToString(${r})`},Ge=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=We(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(T).join(` \\o `)},Ke=(e,t,n)=>{let r=e.operatorToken.kind,i=e=>T(H(e,t,n)),a=F(e.left,n)===`string`||F(e.right,n)===`string`,o=Le.get(r);if(o!==void 0){if(!I(e.left,n)||!I(e.right,n))throw new l.R(`${e.operatorToken.getText()} needs booleans, so compare explicitly`,e);return`${i(e.left)} ${o} ${i(e.right)}`}if(r===d.default.SyntaxKind.PlusToken&&a)return`${T(We(e.left,t,n))} \\o ${T(We(e.right,t,n))}`;if(r===d.default.SyntaxKind.PlusToken)return`${i(e.left)} + ${i(e.right)}`;if(r===d.default.SyntaxKind.PercentToken)return n.prelude.add(`Rem`),`Rem(${H(e.left,t,n)}, ${H(e.right,t,n)})`;if(r===d.default.SyntaxKind.QuestionQuestionToken)return n.prelude.add(`Null`),n.prelude.add(`Undefined`),y(i(e.left),`value`,n,t=>`IF ${t} \\in {Null, Undefined} THEN ${i(e.right)} ELSE ${t}`);if(r===d.default.SyntaxKind.InKeyword)return`${i(e.left)} \\in DOMAIN ${i(e.right)}`;if(r===d.default.SyntaxKind.SlashToken)throw new l.R(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,e);if(Ie.has(r)&&a)throw new l.R(`TLA+ strings have no order, so compare them with === only`,e);let s=Fe.get(r);if(s===void 0)throw new l.R(`Unsupported operator: ${e.operatorToken.getText()}`,e.operatorToken);return`${i(e.left)} ${s} ${i(e.right)}`},qe=(e,t,n)=>{let r=[...n.variables].find(t=>t[0].name===e);if(r===void 0)throw new l.R(`Unknown variable: ${e}`,t);return r[1]},Je=(e,t,n)=>{let r=t.valueDeclaration,i=r!==void 0&&d.default.isEnumMember(r)?n.checker.getConstantValue(r):void 0;if(typeof i==`string`)return te(i,n);if(typeof i==`number`&&Number.isInteger(i))return String(i);throw new l.R(`Unsupported enum member`,e)},Ye=(e,t,n,r)=>{if(t!==void 0&&t.flags&d.default.SymbolFlags.EnumMember)return Je(e,t,r);let i=_(t);if(i!==void 0)return v(i)===void 0?be(i,void 0,n,r):j(i,r).name},Xe=(e,t,n)=>{if(e.text===`undefined`)return n.prelude.add(`Undefined`),`Undefined`;let r=h(e,n.checker),i=r===void 0?void 0:t.bindings.get(r);if(i!==void 0)return i;if(r!==void 0&&r===t.previous)return z(n.checker.getTypeAtLocation(e).getProperties().map(t=>({key:t.name,value:qe(t.name,e,n)})));let a=Ye(e,r,t,n);if(a!==void 0)return a;throw r!==void 0&&n.variables.has(r)?new l.R(`${e.text} can't be read here`,e):new l.R(`Unknown name: ${e.text}`,e)},Ze=(e,t,n)=>{if(e.questionDotToken!==void 0)throw new l.R(`Optional chaining isn't supported`,e);let r=Ye(e,h(e,n.checker),t,n);if(r!==void 0)return r;let i=e.expression,a=e.name.text;return t.previous!==void 0&&d.default.isIdentifier(i)&&h(i,n.checker)===t.previous?qe(a,e,n):(a===`length`||a===`size`?ot(i,t,n):void 0)??`${T(H(i,t,n))}.${a}`},Qe=(e,t,n)=>`${T(H(e.expression,t,n))}[${Re(e,t,n)}]`,B=(e,t,n)=>{if(!I(e,n))throw new l.R(`Conditions must be booleans, so compare explicitly`,e);return H(e,t,n)},V=(e,t,n)=>{if(d.default.isParenthesizedExpression(e))return V(e.expression,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken)return B(e.operand,t,n);if(d.default.isBinaryExpression(e)&&e.operatorToken.kind===d.default.SyntaxKind.BarBarToken){let r=V(e.left,t,n),i=V(e.right,t,n);return`${T(r)} /\\ ${T(i)}`}return`~${T(B(e,t,n))}`},H=(e,t,n,r=!1)=>{if(d.default.isParenthesizedExpression(e)||d.default.isAsExpression(e)||d.default.isSatisfiesExpression(e)||d.default.isTypeAssertionExpression(e))return H(e.expression,t,n,r);if(d.default.isNonNullExpression(e))return H(e.expression,t,n,!0);if(d.default.isNumericLiteral(e)){if(!Number.isInteger(Number(e.text)))throw new l.R(`Only integers are supported: ${e.text}`,e);return String(Number(e.text))}if(d.default.isStringLiteral(e)||d.default.isNoSubstitutionTemplateLiteral(e))return te(e.text,n);if(d.default.isTemplateExpression(e))return Ge(e,t,n);if(e.kind===d.default.SyntaxKind.TrueKeyword)return`TRUE`;if(e.kind===d.default.SyntaxKind.FalseKeyword)return`FALSE`;if(e.kind===d.default.SyntaxKind.NullKeyword)return n.prelude.add(`Null`),`Null`;if(d.default.isIdentifier(e))return Xe(e,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken){if(!I(e.operand,n))throw new l.R(`! needs a boolean, so compare explicitly`,e);return`~${T(H(e.operand,t,n))}`}if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken)return`-${T(H(e.operand,t,n))}`;if(d.default.isBinaryExpression(e))return Ke(e,t,n);if(d.default.isConditionalExpression(e))return`IF ${B(e.condition,t,n)} THEN ${H(e.whenTrue,t,n)} ELSE ${H(e.whenFalse,t,n)}`;if(d.default.isArrayLiteralExpression(e))return ze(e,t,n);if(d.default.isObjectLiteralExpression(e))return Ve(e,t,n);if(d.default.isPropertyAccessExpression(e))return Ze(e,t,n);if(d.default.isElementAccessExpression(e))return Qe(e,t,n);if(d.default.isCallExpression(e))return Ue(e,t,n,r);if(d.default.isNewExpression(e))return yt(e,t,n);throw new l.R(`Unsupported expression: ${e.getText()}`,e)},$e=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),U=(e,t)=>{let n=ee(e,t);if(n?.body===void 0)throw new l.R(`Pass a function here`,e);return{parameters:n.parameters,body:n.body}},W=(e,t,n)=>M(U(e,n).body,t,n),et=(e,t,n)=>{if(U(e,n).parameters[1]!==void 0)throw new l.R(t,e)},G=(e,t,n)=>{let r=U(e,n).parameters[0];if(r===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!d.default.isIdentifier(r.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:A(r.name,e,t,n)}}let i=n.names.getFresh(r.name.text),a=h(r.name,n.checker);return{variable:i,scope:k(t,[{name:i,symbol:a}])}},tt=(e,t,n,r,i)=>{let a=U(e,i).parameters,o=t===void 0||a[0]===void 0?r:A(a[0].name,t,r,i);return a[1]===void 0?o:A(a[1].name,`(${n} - 1)`,o,i)},nt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),rt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),it=(e,t)=>y(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),K=(e,t,n)=>{let r=e=>H(e,t,n);if(d.default.isParenthesizedExpression(e))return K(e.expression,t,n);if(d.default.isArrayLiteralExpression(e)&&e.elements.length===1&&d.default.isSpreadElement(e.elements[0])){let i=e.elements[0].expression,a=F(i,n);return a===`set`?{set:r(i),isMapped:!1}:a===`map`?rt(r(i),n):K(i,t,n)}if(!g(e))return;let i=e.expression.expression,a=e.expression.name.text;if(d.default.isIdentifier(i)&&i.text===`Object`){let t=r(e.arguments[0]);return a===`keys`?{set:`DOMAIN ${T(t)}`,isMapped:!1}:a===`values`?nt(t,n):a===`entries`?rt(t,n):void 0}let o=F(i,n);if(o===`set`&&(a===`values`||a===`keys`))return{set:r(i),isMapped:!1};if(o===`set`&&a===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${T(r(i))}}`,isMapped:!1}}if(o===`map`&&a===`keys`)return{set:`DOMAIN ${T(r(i))}`,isMapped:!1};if(o===`map`&&a===`values`)return nt(r(i),n);if(o===`map`&&a===`entries`)return rt(r(i),n);if(a===`toArray`)return K(i,t,n);if(a!==`filter`&&a!==`map`)return;let s=K(i,t,n);if(s===void 0)return;let c=e.arguments[0];et(c,`Elements of a set have no index`,n);let l=G(c,t,n),u=W(c,l.scope,n);return a===`filter`?{set:`{${l.variable} \\in ${T(s.set)} : ${u}}`,isMapped:s.isMapped}:{set:`{${u} : ${l.variable} \\in ${T(s.set)}}`,isMapped:!0}},at=(e,t,n)=>{let r=K(e,t,n);if(r!==void 0)return r.set;let i=F(e,n),a=H(e,t,n);if(i===`set`)return a;if(i!==`sequence`)throw new l.R(`Expected a Set or an array`,e);return it(a,n)},ot=(e,t,n)=>{let r=K(e,t,n);if(r?.isMapped)throw new l.R(`map() can merge equal elements, so count before mapping`,e.parent);if(r!==void 0)return`Cardinality(${r.set})`;let i=F(e,n),a=H(e,t,n);if(i===`sequence`||i===`string`)return`Len(${a})`;if(i===`set`)return`Cardinality(${a})`;if(i===`map`)return`Cardinality(DOMAIN ${T(a)})`},st=(e,t,n)=>{if(!g(e)||e.expression.name.text!==`map`)return;let r=e.expression.expression,i=K(r,t,n)?.set??(F(r,n)===`sequence`?it(H(r,t,n),n):void 0),a=e.arguments[0],o=U(a,n).parameters[0],s=(d.default.isArrowFunction(a)||d.default.isFunctionExpression(a))&&!d.default.isBlock(a.body)?a.body:void 0,c=s!==void 0&&d.default.isParenthesizedExpression(s)?s.expression:s,u=c!==void 0&&d.default.isArrayLiteralExpression(c)&&c.elements.length===2&&o!==void 0&&d.default.isIdentifier(o.name)&&d.default.isIdentifier(c.elements[0])&&c.elements[0].text===o.name.text;if(i===void 0||!u)throw new l.R(`Build a Map or record from a set with set.values().map((key) => [key, value])`,e);let f=G(a,t,n),p=H(c.elements[1],f.scope,n);return`[${f.variable} \\in ${i} |-> ${p}]`},ct=(e,t,n)=>{let r=e.expression.expression,i=e.expression.name.text,a=e=>T(H(e,t,n)),o=e.arguments[1],s=e.arguments[0];if(d.default.isIdentifier(r)&&r.text===`Array`&&i===`from`&&e.arguments.length===2&&d.default.isObjectLiteralExpression(s)){let r=s.properties.find(e=>e.name?.getText()===`length`);if(r===void 0||!d.default.isPropertyAssignment(r))throw new l.R(`Array.from needs { length: n }`,e);let i=n.names.getFresh(`index`),c=tt(o,void 0,i,t,n);return`[${i} \\in 1..${a(r.initializer)} |-> ${W(o,c,n)}]`}if(i!==`fill`||e.arguments.length!==1)return;let c=d.default.isNewExpression(r)||d.default.isCallExpression(r)?r:void 0,u=c!==void 0&&d.default.isIdentifier(c.expression)&&c.expression.text===`Array`&&c.arguments?.length===1?c.arguments[0]:void 0;if(u!==void 0)return`[${n.names.getFresh(`index`)} \\in 1..${a(u)} |-> ${H(e.arguments[0],t,n)}]`},lt=(e,t,n,r)=>{let i=i=>W(t,tt(t,`${T(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${T(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${T(e)} : ${T(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${T(i(o))}`}},q=(e,t,n,r)=>n?t:(r.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),ut=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e=>H(e,n,r),s=e.arguments[0],c=T(t),u=e=>d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken,f=e=>u(e)?`Len(${t}) - ${T(o(e.operand))}`:o(e),p=e=>()=>{let t=r.names.getFresh(`index`),i=tt(s,`${c}[${t}]`,t,n,r);return e(t,W(s,i,r))},m=(/* @__PURE__ */ new Map([[`at`,()=>{let e=u(s)?`${f(s)} + 1`:`${T(o(s))} + 1`;return q(`${e} \\in DOMAIN ${c}`,`${c}[${e}]`,i,r)}],[`includes`,()=>{let e=r.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${c} : ${c}[${e}] = ${T(o(s))}`}],[`indexOf`,()=>y(o(s),`value`,r,e=>{let t=r.names.getFresh(`index`),n=r.names.getFresh(`earlier`),i=`${c}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${c} : ${i} THEN (CHOOSE ${t} \\in DOMAIN ${c} : ${i} /\\ \\A ${n} \\in 1..(${t} - 1) : ${c}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let n=s===void 0?`0`:f(s),r=e.arguments[1]===void 0?void 0:T(f(e.arguments[1])),i=r===void 0?`Len(${t})`:`IF ${r} < Len(${t}) THEN ${r} ELSE Len(${t})`;return`SubSeq(${t}, ${/^\d+$/.test(n)?String(Number(n)+1):`${T(n)} + 1`}, ${i})`}],[`concat`,()=>[t,...e.arguments.map(e=>F(e,r)===`sequence`?o(e):`<<${o(e)}>>`)].map(T).join(` \\o `)],[`with`,()=>`[${c} EXCEPT ![${T(o(s))} + 1] = ${E(o(e.arguments[1]))}]`],[`toReversed`,()=>{let e=r.names.getFresh(`index`);return`[${e} \\in DOMAIN ${c} |-> ${c}[Len(${t}) - ${e} + 1]]`}],[`map`,p((e,t)=>`[${e} \\in DOMAIN ${c} |-> ${t}]`)],[`every`,p((e,t)=>`\\A ${e} \\in DOMAIN ${c} : ${t}`)],[`some`,p((e,t)=>`\\E ${e} \\in DOMAIN ${c} : ${t}`)],[`filter`,()=>{et(s,`filter() can't take an index`,r);let e=G(s,n,r);return`SelectSeq(${t}, LAMBDA ${e.variable} : ${W(s,e.scope,r)})`}],[`find`,()=>{let e=lt(t,s,n,r);return q(e.exists,`${c}[${e.first}]`,i,r)}],[`findIndex`,()=>{let e=lt(t,s,n,r);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(a);if(m===void 0)throw new l.R(`Unsupported array method: ${a}`,e);return m()},dt=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e.arguments[0];if(a===`includes`||a===`has`)return`${T(H(o,n,r))} \\in ${T(t.set)}`;if(a!==`every`&&a!==`some`&&a!==`find`)throw new l.R(`Unsupported method on a set's elements: ${a}`,e);et(o,`Elements of a set have no index`,r);let s=G(o,n,r),c=W(o,s.scope,r),u=`${s.variable} \\in ${T(t.set)} : ${c}`;return a===`every`?`\\A ${u}`:a===`some`?`\\E ${u}`:q(`\\E ${u}`,`CHOOSE ${u}`,i,r)},ft=(e,t,n)=>{let r=e.expression.name.text,i=T(H(e.expression.expression,t,n)),a=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n)),o=(/* @__PURE__ */ new Map([[`has`,`${a} \\in ${i}`],[`union`,`${i} \\cup ${a}`],[`intersection`,`${i} \\cap ${a}`],[`difference`,`${i} \\ ${a}`],[`symmetricDifference`,`(${i} \\ ${a}) \\cup (${a} \\ ${i})`],[`isSubsetOf`,`${i} \\subseteq ${a}`],[`isSupersetOf`,`${a} \\subseteq ${i}`],[`isDisjointFrom`,`${i} \\cap ${a} = {}`]])).get(r);if(o===void 0)throw new l.R(`Unsupported Set method: ${r}`,e);if(e.arguments[0]===void 0)throw new l.R(`Set method needs an argument: ${r}`,e);return o},pt=(e,t,n,r)=>{let i=e.expression.name.text,a=T(H(e.expression.expression,t,n)),o=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n));if(i!==`has`&&i!==`get`)throw new l.R(`Unsupported Map method: ${i}`,e);if(e.arguments[0]===void 0)throw new l.R(`Map method needs a key: ${i}`,e);return i===`has`?`${o} \\in DOMAIN ${a}`:r?`${a}[${o}]`:y(a,`map`,n,e=>y(o,`key`,n,t=>q(`${t} \\in DOMAIN ${e}`,`${e}[${t}]`,r,n)))},mt={pop:e=>`SubSeq(${e}, 1, Len(${e}) - 1)`,shift:e=>`Tail(${e})`},ht=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${T(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${T(e)}`],[`pop`,mt.pop],[`shift`,mt.shift]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${T(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${T(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${T(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${T(e)} \\ {${t[0]}} |-> ${T(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),gt=new Set([...ht.values()].flatMap(e=>[...e.keys()])),_t=(e,t,n,r,i)=>{let a=n.arguments.map(e=>H(e,r,i));return ht.get(t)?.get(n.expression.name.text)?.(e,a,i)},vt=(e,t,n,r)=>{let i=e.expression.expression,a=K(i,t,n);if(a!==void 0)return dt(e,a,t,n,r);let o=d.default.isNewExpression(i)&&i.arguments?.length===1&&d.default.isIdentifier(i.expression)&&(i.expression.text===`Set`||i.expression.text===`Map`),s=F(i,n),c=o?_t(H(i,t,n),s,e,t,n):void 0;if(c!==void 0)return c;if(s===`sequence`){let a=e.expression.name.text,o=H(i,t,n),s=i=>ut(e,i,t,n,r);return $e.has(a)?s(o):y(o,`sequence`,n,s)}if(s===`set`)return ft(e,t,n);if(s===`map`)return pt(e,t,n,r);throw new l.R(`Unsupported call: ${e.expression.getText()}`,e)},yt=(e,t,n)=>{let r=e.expression.getText(),i=e.arguments?.[0];if(r===`Set`)return i===void 0?`{}`:d.default.isArrayLiteralExpression(i)&&!i.elements.some(d.default.isSpreadElement)?`{${i.elements.map(e=>H(e,t,n)).join(`, `)}}`:at(i,t,n);if(r!==`Map`)throw new l.R(`Unsupported constructor: new ${r}`,e);if(i===void 0)return`<<>>`;if(d.default.isArrayLiteralExpression(i))return i.elements.length===0?`<<>>`:i.elements.toReversed().map(e=>{if(!d.default.isArrayLiteralExpression(e)||e.elements.length!==2)throw new l.R(`Write each Map entry as [key, value]`,e);return`(${H(e.elements[0],t,n)} :> ${H(e.elements[1],t,n)})`}).join(` @@ `);if(F(i,n)===`map`)return H(i,t,n);let a=st(i,t,n);if(a===void 0)throw new l.R(`Unsupported constructor: new ${r}`,e);return a},bt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusEqualsToken,`+`],[d.default.SyntaxKind.MinusEqualsToken,`-`],[d.default.SyntaxKind.AsteriskEqualsToken,`*`]]),xt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusPlusToken,`+`],[d.default.SyntaxKind.MinusMinusToken,`-`]]),J=(e,t,n)=>{if(d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e))return J(e.expression,t,n);if(d.default.isIdentifier(e)){let r=h(e,n.checker),i=r===void 0?void 0:t.scope.bindings.get(r);if(r===void 0||i===void 0||!t.mutable.has(r))throw new l.R(`Only state variables and local lets can change: ${e.text}`,e);return{symbol:r,current:i,selector:``}}if(d.default.isPropertyAccessExpression(e)){if(F(e.expression,n)!==`other`)throw new l.R(`Can't assign to ${e.getText()}`,e);let r=J(e.expression,t,n);return{...r,selector:`${r.selector}.${e.name.text}`}}if(d.default.isElementAccessExpression(e)){let r=J(e.expression,t,n),i=Re(e,t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}if(g(e)&&e.expression.name.text===`get`&&e.arguments.length===1&&F(e.expression.expression,n)===`map`){let r=J(e.expression.expression,t,n),i=H(e.arguments[0],t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}throw new l.R(`Can't assign to ${e.getText()}`,e)},Y=(e,t,n,r)=>{let i=J(e,t,n),a=i.selector===``?r(i.current):`[${T(i.current)} EXCEPT !${i.selector} = ${E(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},X=(e,t,n,r,i)=>d.default.isArrayLiteralExpression(e)?e.elements.reduce((e,a,o)=>{if(d.default.isOmittedExpression(a))return e;if(d.default.isSpreadElement(a))throw new l.R(`Rest elements can't be assigned`,a);let s=t!==void 0&&d.default.isArrayLiteralExpression(t)?t.elements[o]:void 0;return s!==void 0&&!d.default.isSpreadElement(s)?X(a,s,H(s,r.scope,i),e,i):X(a,void 0,`${T(n)}[${o+1}]`,e,i)},r):d.default.isObjectLiteralExpression(e)?e.properties.reduce((e,t)=>{if(d.default.isShorthandPropertyAssignment(t))return X(t.name,void 0,`${T(n)}.${t.name.text}`,e,i);if(d.default.isPropertyAssignment(t)&&d.default.isIdentifier(t.name))return X(t.initializer,void 0,`${T(n)}.${t.name.text}`,e,i);throw new l.R(`Can't assign to ${t.getText()}`,t)},r):Y(e,r,i,()=>n),St=(e,t,n)=>{if(d.default.isNonNullExpression(e)||d.default.isParenthesizedExpression(e))return St(e.expression,t,n);if(!g(e))return;let r=e.expression.name.text;if(r!==`shift`&&r!==`pop`)return;let i=e.expression.expression;if(F(i,n)!==`sequence`)return;let a=H(i,t.scope,n);return{value:r===`shift`?`Head(${a})`:`${T(a)}[Len(${a})]`,path:Y(i,t,n,mt[r])}},Ct=(e,t,n)=>{if(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e)){let r=xt.get(e.operator);return r===void 0?void 0:Y(e.operand,t,n,e=>`${T(e)} ${r} 1`)}if(!d.default.isBinaryExpression(e))return;let r=e.operatorToken.kind;if(r===d.default.SyntaxKind.EqualsToken){let r=H(e.right,t.scope,n);return X(e.left,e.right,r,t,n)}let i=r===d.default.SyntaxKind.PlusEqualsToken&&F(e.left,n)===`string`?`\\o`:bt.get(r);if(i===void 0)return;let a=T(H(e.right,t.scope,n));return Y(e.left,t,n,e=>`${T(e)} ${i} ${a}`)},wt=(e,t,n,r,i)=>{let a=e.arguments.map(e=>H(e,t.scope,n));if(g(e)){let r=e.expression.expression,o=e.expression.name.text,s=r.getText()===`console`;if(s&&o===`log`){let e=a.length===1?a[0]:`<<${a.join(`, `)}>>`;return x([b(`PrintT(${e})`),i(t)])}if(s&&o===`assert`){let e=a[1]??JSON.stringify(`Assertion failed`);return x([b(`Assert(${a[0]}, ${e})`),i(t)])}if(gt.has(o)){let a=F(r,n);return i(Y(r,t,n,r=>{let i=_t(r,a,e,t.scope,n);if(i===void 0)throw new l.R(`Unsupported method: ${o}`,e);return i}))}}let o=_(h(e.expression,n.checker)),s=v(o);if(o===void 0||s?.body===void 0)throw new l.R(`Unsupported statement: ${e.getText()}`,e);if(r.inlining.has(o))throw new l.R(`Helpers that change state can't call themselves`,e);let c=me(s.parameters.map(e=>e.name),a,t.scope,n),u=d.default.isBlock(s.body)?s.body.statements:[d.default.factory.createExpressionStatement(s.body)],f=e=>i({...e,scope:{...e.scope,previous:t.scope.previous}});return S(c.definitions,Z(u,{...t,scope:c.scope},n,{next:f,exit:f,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...r.inlining,o])}))},Tt=(e,t,n,r,i)=>{if(d.default.isParenthesizedExpression(e))return Tt(e.expression,t,n,r,i);if(d.default.isCallExpression(e))return wt(e,t,n,r,i);let a=Ct(e,t,n);if(a===void 0)throw new l.R(`Unsupported statement: ${e.getText()}`,e);return i(a)},Et=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=e.slice(1);if(i.initializer===void 0)throw new l.R(`Declare locals with a value`,i);if(v(i.initializer)!==void 0)return Et(a,t,n,r);let o=St(i.initializer,t,n),s=o?.value??H(i.initializer,t.scope,n),c=o?.path??t,u=pe(i.name,s,c.scope,n),f=d.default.isIdentifier(i.name)?h(i.name,n.checker):void 0,p=(i.parent.flags&d.default.NodeFlags.Let)!==0&&f!==void 0?/* @__PURE__ */ new Set([...t.mutable,f]):t.mutable;return S(u.definitions,Et(a,{...c,scope:u.scope,mutable:p},n,r))},Z=(e,t,n,r)=>{if(e.length===0)return r.next(t);let i=e[0],a=t=>Z(e.slice(1),t,n,r);if(d.default.isBlock(i))return Z(i.statements,t,n,{...r,next:a});if(d.default.isEmptyStatement(i))return a(t);if(d.default.isVariableStatement(i))return Et(i.declarationList.declarations,t,n,a);if(d.default.isIfStatement(i))return Ce(i,t.scope,n,e=>Z([e],t,n,{...r,next:a}),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression!==void 0)throw new l.R(`Actions can't return a value`,i);return r.exit(t)}if(d.default.isBreakStatement(i)){if(r.breakTo===void 0)throw new l.R(`Unsupported break`,i);return r.breakTo(t)}if(d.default.isThrowStatement(i))return b(Se(i,t.scope,n));if(d.default.isSwitchStatement(i))return we(i,t.scope,n,e=>Z(e,t,n,{...r,next:a,breakTo:a}),()=>a(t));if(d.default.isExpressionStatement(i))return Tt(i.expression,t,n,r,a);throw d.default.isIterationStatement(i,!1)?new l.R(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,i):new l.R(`Unsupported statement: ${i.getText()}`,i)},Dt=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return re;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return x([...t.filter(e=>e.value!==e.name).map(e=>b(`${e.name}' = ${E(e.value)}`)),...r.length>0?[b(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return Z(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},Ot=e=>g(e)&&e.expression.name.text===`get`?Ot(e.expression.expression):d.default.isPropertyAccessExpression(e)||d.default.isElementAccessExpression(e)||d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e)?Ot(e.expression):e,kt=(e,t,n=/* @__PURE__ */ new Set)=>{let r=e=>{let n=Ot(e),r=d.default.isIdentifier(n)?h(n,t.checker):void 0;return r!==void 0&&t.variables.has(r)},i=d.default.isBinaryExpression(e)&&e.operatorToken.kind>=d.default.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=d.default.SyntaxKind.LastAssignment&&r(e.left),a=(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e))&&xt.has(e.operator)&&r(e.operand),o=g(e)&&gt.has(e.expression.name.text)&&r(e.expression.expression);if(i||a||o)return!0;if(d.default.isCallExpression(e)){let r=_(h(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),kt(r,t,n)))return!0}return d.default.forEachChild(e,e=>kt(e,t,n)||void 0)??!1},At=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),jt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
16
16
  `)}`,Mt=e=>e.length===0?` FALSE`:e.length===1?` ${e[0]}`:`\n${e.map(e=>` \\/ ${e}`).join(`
17
- `)}`,Q=(e,t)=>t.length>0?[`${e} ${t.join(` `)}`]:[],Nt=(e,t,n,r)=>{if(n.views.length>1)throw new l.L(`Tag only one function @view`);let i=[...r.recursive].map(e=>{let t=r.definitions.get(e);if(t===void 0||t.parameters.length===0)throw new l.L(`A constant can't refer to itself`,e);return`${t.name}(${t.parameters.map(()=>`_`).join(`, `)})`}),a=r.prelude,o=[...a.has(`Null`)?[`Null`]:[],...a.has(`Undefined`)?[`Undefined`]:[],...r.modelValues.values()],s=t.variables.map(e=>e.name),c=t.symmetrySets;return{name:e,source:[`---- MODULE ${e} ----`,`EXTENDS Integers, Sequences, FiniteSets, TLC`,...o.length>0?[`CONSTANTS ${o.join(`, `)}`]:[],...s.length>0?[`VARIABLES ${s.join(`, `)}`]:[],`vars == <<${s.join(`, `)}>>`,...i.length>0?[`RECURSIVE ${i.join(`, `)}`]:[],...a.has(`Rem`)?[`Rem(a, b) ==
17
+ `)}`,Q=(e,t)=>t.length>0?[`${e} ${t.join(` `)}`]:[],Nt=(e,t,n,r)=>{if(n.views.length>1)throw new l.R(`Tag only one function @view`);let i=[...r.recursive].map(e=>{let t=r.definitions.get(e);if(t===void 0||t.parameters.length===0)throw new l.R(`A constant can't refer to itself`,e);return`${t.name}(${t.parameters.map(()=>`_`).join(`, `)})`}),a=r.prelude,o=[...a.has(`Null`)?[`Null`]:[],...a.has(`Undefined`)?[`Undefined`]:[],...r.modelValues.values()],s=t.variables.map(e=>e.name),c=t.symmetrySets;return{name:e,source:[`---- MODULE ${e} ----`,`EXTENDS Integers, Sequences, FiniteSets, TLC`,...o.length>0?[`CONSTANTS ${o.join(`, `)}`]:[],...s.length>0?[`VARIABLES ${s.join(`, `)}`]:[],`vars == <<${s.join(`, `)}>>`,...i.length>0?[`RECURSIVE ${i.join(`, `)}`]:[],...a.has(`Rem`)?[`Rem(a, b) ==
18
18
  LET m == IF b < 0 THEN -b ELSE b
19
19
  IN IF a >= 0 THEN a % m ELSE -((-a) % m)`]:[],...a.has(`Quot`)?[`Quot(a, b) ==
20
20
  LET q == (IF a < 0 THEN -a ELSE a) \\div (IF b < 0 THEN -b ELSE b)
21
21
  IN IF (a < 0) = (b < 0) THEN q ELSE -q`]:[],...r.output,`Init ==${jt(n.init.length>0?n.init:[`TRUE`])}`,...n.actions,`Next ==${Mt(n.next)}`,`Spec ==${jt([`Init`,`[][Next]_vars`,...n.fairness])}`,...n.predicates,...n.temporal,...n.assumptions.map(e=>`ASSUME ${e}`),...c.length>0?[`Perms == ${c.map(e=>`Permutations(${e})`).join(` \\cup `)}`]:[],`====`].join(`
22
22
  `),config:[`SPECIFICATION Spec`,...o.length>0?[`CONSTANTS`,...o.map(e=>` ${e} = ${e}`)]:[],...Q(`INVARIANTS`,n.invariants),...Q(`PROPERTIES`,n.properties),...Q(`CONSTRAINTS`,n.constraints),...Q(`ACTION_CONSTRAINTS`,n.actionConstraints),...Q(`VIEW`,n.views),...Q(`POSTCONDITIONS`,n.postconditions),...c.length>0?[`SYMMETRY Perms`]:[],...t.isDeadlockChecked?[]:[`CHECK_DEADLOCK FALSE`]].join(`
23
- `)}},Pt=/* @__PURE__ */ new Map([[`eventually`,`<>`],[`alwaysEventually`,`[]<>`],[`eventuallyAlways`,`<>[]`]]),Ft=/* @__PURE__ */ new Map([[`constraint`,`constraints`],[`actionConstraint`,`actionConstraints`],[`view`,`views`],[`postcondition`,`postconditions`],[`assume`,`assumptions`]]),It=/* @__PURE__ */ new Set([...Pt.keys(),...Ft.keys(),`initially`,`always`,`leadsTo`,`terminating`]),Lt=(e,t)=>{let n=e.node.parameters;if(n.length===0)return O(t);if(n.length>1||!d.default.isIdentifier(n[0].name))throw new l.L(`Take the state before the step as one parameter`,n[0]);return{bindings:new Map([...t.variables].map(e=>[e[0],`${e[1]}'`])),previous:h(n[0].name,t.checker)}},Rt=(e,t,n,r)=>{let i=(e.tags.get(`leadsTo`)??``).split(/\s/)[0],a=n.topLevel.get(i);if(a===void 0)throw new l.L(`@leadsTo names an unknown function: ${i}`,e.node);let o=n.exported.find(e=>e.declaration===a);if(o!==void 0)return o.name;let s=j(a,r),c=t.slice(0,s.parameters.length);return c.length===0?s.name:`${s.name}(${c.join(`, `)})`},zt=(e,t,n,r,i)=>{let a=e.name,o=e.node,s=t===`always`||t===`actionConstraint`,c=Pt.has(t)||t===`leadsTo`;if(!s&&!c&&o.parameters.length>0)throw new l.L(`@${t} functions can't take parameters`,o.parameters[0]);let u=(c?o.parameters:[]).map(e=>({...de(e,i),domain:Pe(i.checker.getTypeAtLocation(e.name),e,i)})),d=s?Lt(e,i):k(O(i),u),f=u.length===0?``:`\\A ${u.map(e=>`${e.name} \\in ${e.domain}`).join(`, `)} : `,p=D(M(e.body,d,i),` `),m=Pt.get(t),h=Ft.get(t);if(m!==void 0&&(r.temporal.push(`${a} ==\n ${f}${m}(${p})`),r.properties.push(a)),t===`leadsTo`){let t=u.map(e=>e.name),o=Rt(e,t,n,i);r.temporal.push(`${a} ==\n ${f}(${p}) ~> ${o}`),r.properties.push(a)}t===`always`&&(r.temporal.push(o.parameters.length===0?`${a} ==\n [](${p})`:`${a} ==\n [][${p}]_vars`),r.properties.push(a)),t===`terminating`&&(r.actions.push(`${a} ==\n ${p}`),r.next.push(`${a} /\\ UNCHANGED vars`)),t===`initially`&&r.init.push(p),h!==void 0&&(r.predicates.push(`${a} ==\n ${p}`),r[h].push(a))},Bt=(e,t,n)=>{let r=e.node.parameters;if(r.length>0)throw new l.L(`Invariants can't take parameters`,r[0]);let i=e.body,a=O(n),o=d.default.isBlock(i)?M(i,a,n):B(i,a,n);t.predicates.push(`${e.name} ==\n ${D(o,` `)}`),t.invariants.push(e.name)},Vt=/* @__PURE__ */ new Set([...It,`fair`,`strongFair`,`symmetric`,`noDeadlock`,`param`,`returns`,`return`,`example`,`see`,`deprecated`,`remarks`,`throws`,`link`,`description`]),Ht=e=>new Map(d.default.getJSDocTags(e).map(e=>{if(!Vt.has(e.tagName.text))throw new l.L(`Unknown tag: @${e.tagName.text}`,e);return[e.tagName.text,d.default.getTextOfJSDocComment(e.comment)?.trim()??``]})),Ut=e=>(d.default.getCombinedModifierFlags(e)&d.default.ModifierFlags.Export)!==0,Wt=e=>d.default.isVariableDeclaration(e)&&(e.parent.flags&d.default.NodeFlags.Let)!==0,Gt=(e,t)=>{let n=t.checker.getTypeAtLocation(e.name);return`{${(n.isUnion()?n.types:[n]).map(n=>{if(!n.isStringLiteral())throw new l.L(`A @symmetric type must be a union of strings`,e);let r=t.names.getFresh(n.value);if(r!==n.value)throw new l.L(`"${n.value}" can't name a TLA+ model value`,e);return t.modelValues.set(n.value,r),r}).join(`, `)}}`},Kt=e=>{if(d.default.isImportDeclaration(e)||d.default.isTypeAliasDeclaration(e)||d.default.isInterfaceDeclaration(e)||d.default.isEnumDeclaration(e)||d.default.isExportDeclaration(e)&&e.isTypeOnly)return[];if(d.default.isFunctionDeclaration(e)&&e.name!==void 0&&e.body)return[{name:e.name.text,declaration:e}];if(!d.default.isVariableStatement(e))throw new l.L(`Unsupported statement: ${e.getText()}`,e);let t=e.declarationList.flags;return e.declarationList.declarations.map(e=>{if(!d.default.isIdentifier(e.name))throw new l.L(`Declare one name at a time`,e);if((t&(d.default.NodeFlags.Let|d.default.NodeFlags.Const))===0)throw new l.L(`Use let for state and const for everything else`,e);return{name:e.name.text,declaration:e}})},qt=(e,t)=>{let n=e.statements,r=new Map(n.map(e=>[e,Ht(e)])),i=n.filter(e=>d.default.isTypeAliasDeclaration(e)&&r.get(e)?.has(`symmetric`)===!0).map(e=>Gt(e,t)),a=n.flatMap(Kt),o=a.flatMap(e=>{let n=e.declaration;if(!Wt(n))return[];let r=h(n.name,t.checker);if(Ut(n)||r===void 0)throw new l.L(`State variables can't be exported`,n);let i=t.names.getFresh(e.name);return t.variables.set(r,i),[{name:i,declaration:n}]}),s=a.filter(e=>!Wt(e.declaration));return{variables:o,exported:s.flatMap(e=>{let n=e.declaration,i=v(n);if(!Ut(n)||i?.body===void 0)return[];let a=d.default.isVariableDeclaration(n)?n.parent.parent:n;return[{name:t.names.getFresh(e.name),declaration:n,node:i,body:i.body,tags:r.get(a)??/* @__PURE__ */ new Map}]}),topLevel:new Map(s.map(e=>[e.name,e.declaration])),symmetrySets:i,isDeadlockChecked:![...r.values()].some(e=>e.has(`noDeadlock`))}},$={strict:!0,noEmit:!0,target:d.default.ScriptTarget.ESNext,module:d.default.ModuleKind.ESNext,moduleResolution:d.default.ModuleResolutionKind.Bundler,moduleDetection:d.default.ModuleDetectionKind.Force,allowImportingTsExtensions:!0,resolveJsonModule:!0,skipLibCheck:!0,lib:[`lib.esnext.d.ts`],types:[]},Jt=(0,u.dirname)(d.default.getDefaultLibFilePath($)),Yt=/* @__PURE__ */ new Map,Xt=(e,t)=>{let n=d.default.createSourceFile(t,e,d.default.ScriptTarget.ESNext,!0),r=d.default.createCompilerHost($),i=d.default.createProgram({rootNames:[t],options:$,host:{...r,getSourceFile:(e,i)=>{if(e===t)return n;let a=Yt.get(e);if(a!==void 0)return a;let o=r.getSourceFile(e,i);return o!==void 0&&e.startsWith(Jt)&&Yt.set(e,o),o},fileExists:e=>e===t||r.fileExists(e),readFile:n=>n===t?e:r.readFile(n)}}),a=d.default.getPreEmitDiagnostics(i);if(a.length>0)throw new l.L(d.default.formatDiagnostics(a,r));return{sourceFile:n,checker:i.getTypeChecker()}},Zt=e=>d.default.isReturnStatement(e)?e.expression===void 0:d.default.isBlock(e)&&e.statements.length===1&&Zt(e.statements[0]),Qt=(e,t,n,r)=>{if(!d.default.isIfStatement(e)||e.elseStatement!==void 0||!Zt(e.thenStatement))return;let i=e.expression;if(!d.default.isPrefixUnaryExpression(i)||i.operator!==d.default.SyntaxKind.ExclamationToken)return;let a=d.default.isParenthesizedExpression(i.operand)?i.operand.expression:i.operand;if(!g(a)||a.expression.name.text!==`has`||a.arguments.length!==1)return;let o=e=>[...t.filter(t=>d.default.isIdentifier(e)&&t.symbol===h(e,r.checker)),...e.getChildren().flatMap(o)],s=a.arguments[0],c=t.find(e=>e.symbol===h(s,r.checker)),l=a.expression.expression,u=o(l);if(c!==void 0&&!n.has(c)&&u.every(e=>n.has(e))&&Ae(l,r))return{parameter:c,set:l,isDependent:u.length>0}},$t=(e,t,n,r)=>{let i=e.length===0?void 0:Qt(e[0],t,n,r);if(i===void 0)return{chosen:n,remaining:e};let a=k(O(r),[...n.keys()]),o=H(i.set,a,r);return $t(e.slice(1),t,new Map([...n,[i.parameter,{domain:o,isDependent:i.isDependent}]]),r)},en=(e,t,n)=>{let r=e.name,i=e.body,a=fe(e.node.parameters,n),o=$t(d.default.isBlock(i)?i.statements:[d.default.factory.createExpressionStatement(i)],a,/* @__PURE__ */ new Map,n),s=Dt(o.remaining,k(O(n),a),n),c=a.length===0?r:`${r}(${a.map(e=>e.name).join(`, `)})`;t.actions.push(`${c} ==\n ${D(ae(s),` `)}`);let l=e.tags.has(`strongFair`)?`SF_vars`:e.tags.has(`fair`)?`WF_vars`:void 0;if(a.length===0){t.next.push(r),l!==void 0&&t.fairness.push(`${l}(${r})`);return}let u=e=>n.checker.getTypeAtLocation(e.node.name),f=a.map(e=>{let t=o.chosen.get(e);return{parameter:e,chosen:t,domain:t?.domain??Pe(u(e),e.node,n)}}),p=f.flatMap(e=>e.chosen?.isDependent===!0?[]:[`${e.parameter.name} \\in ${e.domain}`]),m=[...o.chosen].filter(e=>e[1].isDependent).map(e=>`\\E ${e[0].name} \\in ${e[1].domain} : `),h=`\\E ${p.join(`, `)} : ${m.join(``)}${c}`;if(t.next.push(h),l===void 0)return;let g=f.map(e=>{let t=e.chosen===void 0?e.domain:Ne(u(e.parameter),n);return typeof t==`string`?`${e.parameter.name} \\in ${t}`:void 0});if(!g.every(e=>e!==void 0)){t.fairness.push(`${l}(${h})`);return}let _=f.flatMap(e=>e.chosen===void 0?[]:[`${e.parameter.name} \\in ${T(e.domain)}`]);t.fairness.push(`\\A ${g.join(`, `)} : ${l}(${[..._,c].join(` /\\ `)})`)},tn=(e,t)=>{let n=e.declaration.initializer;if(n===void 0){let n=t.checker.getTypeAtLocation(e.declaration.name);return`${e.name} \\in ${Pe(n,e.declaration,t)}`}let r=M(n,O(t),t);return`${e.name} = ${D(E(r),` `)}`},nn=(e,t,n,r)=>{let i=[...e.tags.keys()].find(e=>It.has(e));if(i!==void 0)return zt(e,i,t,n,r);let a=r.checker.getSignatureFromDeclaration(e.node)?.getReturnType();if(kt(e.body,r)||a===void 0||(a.flags&(d.default.TypeFlags.Void|d.default.TypeFlags.Undefined))!==0)return en(e,n,r);if(!(a.flags&d.default.TypeFlags.BooleanLike))throw new l.L(`An exported function that returns a value must return a boolean, or be tagged, such as @view`,e.node);return Bt(e,n,r)},rn=(e,t=`spec.ts`)=>{let n=Xt(e,t.replaceAll(`\\`,`/`)),r=m(n.checker),i=qt(n.sourceFile,r),a=At();a.init.push(...i.variables.map(e=>tn(e,r)));for(let e of i.exported)nn(e,i,a,r);let o=(0,u.basename)(t,`.ts`).split(/[^A-Za-z0-9]+/).map(e=>e.charAt(0).toUpperCase()+e.slice(1)).join(``);return Nt(o,i,a,r)};exports.compile=rn,exports.t=o;
23
+ `)}},Pt=/* @__PURE__ */ new Map([[`eventually`,`<>`],[`alwaysEventually`,`[]<>`],[`eventuallyAlways`,`<>[]`]]),Ft=/* @__PURE__ */ new Map([[`constraint`,`constraints`],[`actionConstraint`,`actionConstraints`],[`view`,`views`],[`postcondition`,`postconditions`],[`assume`,`assumptions`]]),It=/* @__PURE__ */ new Set([...Pt.keys(),...Ft.keys(),`initially`,`always`,`leadsTo`,`terminating`]),Lt=(e,t)=>{let n=e.node.parameters;if(n.length===0)return O(t);if(n.length>1||!d.default.isIdentifier(n[0].name))throw new l.R(`Take the state before the step as one parameter`,n[0]);return{bindings:new Map([...t.variables].map(e=>[e[0],`${e[1]}'`])),previous:h(n[0].name,t.checker)}},Rt=(e,t,n,r)=>{let i=(e.tags.get(`leadsTo`)??``).split(/\s/)[0],a=n.topLevel.get(i);if(a===void 0)throw new l.R(`@leadsTo names an unknown function: ${i}`,e.node);let o=n.exported.find(e=>e.declaration===a);if(o!==void 0)return o.name;let s=j(a,r),c=t.slice(0,s.parameters.length);return c.length===0?s.name:`${s.name}(${c.join(`, `)})`},zt=(e,t,n,r,i)=>{let a=e.name,o=e.node,s=t===`always`||t===`actionConstraint`,c=Pt.has(t)||t===`leadsTo`;if(!s&&!c&&o.parameters.length>0)throw new l.R(`@${t} functions can't take parameters`,o.parameters[0]);let u=(c?o.parameters:[]).map(e=>({...de(e,i),domain:Pe(i.checker.getTypeAtLocation(e.name),e,i)})),d=s?Lt(e,i):k(O(i),u),f=u.length===0?``:`\\A ${u.map(e=>`${e.name} \\in ${e.domain}`).join(`, `)} : `,p=D(M(e.body,d,i),` `),m=Pt.get(t),h=Ft.get(t);if(m!==void 0&&(r.temporal.push(`${a} ==\n ${f}${m}(${p})`),r.properties.push(a)),t===`leadsTo`){let t=u.map(e=>e.name),o=Rt(e,t,n,i);r.temporal.push(`${a} ==\n ${f}(${p}) ~> ${o}`),r.properties.push(a)}t===`always`&&(r.temporal.push(o.parameters.length===0?`${a} ==\n [](${p})`:`${a} ==\n [][${p}]_vars`),r.properties.push(a)),t===`terminating`&&(r.actions.push(`${a} ==\n ${p}`),r.next.push(`${a} /\\ UNCHANGED vars`)),t===`initially`&&r.init.push(p),h!==void 0&&(r.predicates.push(`${a} ==\n ${p}`),r[h].push(a))},Bt=(e,t,n)=>{let r=e.node.parameters;if(r.length>0)throw new l.R(`Invariants can't take parameters`,r[0]);let i=e.body,a=O(n),o=d.default.isBlock(i)?M(i,a,n):B(i,a,n);t.predicates.push(`${e.name} ==\n ${D(o,` `)}`),t.invariants.push(e.name)},Vt=/* @__PURE__ */ new Set([...It,`fair`,`strongFair`,`symmetric`,`noDeadlock`,`param`,`returns`,`return`,`example`,`see`,`deprecated`,`remarks`,`throws`,`link`,`description`]),Ht=e=>new Map(d.default.getJSDocTags(e).map(e=>{if(!Vt.has(e.tagName.text))throw new l.R(`Unknown tag: @${e.tagName.text}`,e);return[e.tagName.text,d.default.getTextOfJSDocComment(e.comment)?.trim()??``]})),Ut=e=>(d.default.getCombinedModifierFlags(e)&d.default.ModifierFlags.Export)!==0,Wt=e=>d.default.isVariableDeclaration(e)&&(e.parent.flags&d.default.NodeFlags.Let)!==0,Gt=(e,t)=>{let n=t.checker.getTypeAtLocation(e.name);return`{${(n.isUnion()?n.types:[n]).map(n=>{if(!n.isStringLiteral())throw new l.R(`A @symmetric type must be a union of strings`,e);let r=t.names.getFresh(n.value);if(r!==n.value)throw new l.R(`"${n.value}" can't name a TLA+ model value`,e);return t.modelValues.set(n.value,r),r}).join(`, `)}}`},Kt=e=>{if(d.default.isImportDeclaration(e)||d.default.isTypeAliasDeclaration(e)||d.default.isInterfaceDeclaration(e)||d.default.isEnumDeclaration(e)||d.default.isExportDeclaration(e)&&e.isTypeOnly)return[];if(d.default.isFunctionDeclaration(e)&&e.name!==void 0&&e.body)return[{name:e.name.text,declaration:e}];if(!d.default.isVariableStatement(e))throw new l.R(`Unsupported statement: ${e.getText()}`,e);let t=e.declarationList.flags;return e.declarationList.declarations.map(e=>{if(!d.default.isIdentifier(e.name))throw new l.R(`Declare one name at a time`,e);if((t&(d.default.NodeFlags.Let|d.default.NodeFlags.Const))===0)throw new l.R(`Use let for state and const for everything else`,e);return{name:e.name.text,declaration:e}})},qt=(e,t)=>{let n=e.statements,r=new Map(n.map(e=>[e,Ht(e)])),i=n.filter(e=>d.default.isTypeAliasDeclaration(e)&&r.get(e)?.has(`symmetric`)===!0).map(e=>Gt(e,t)),a=n.flatMap(Kt),o=a.flatMap(e=>{let n=e.declaration;if(!Wt(n))return[];let r=h(n.name,t.checker);if(Ut(n)||r===void 0)throw new l.R(`State variables can't be exported`,n);let i=t.names.getFresh(e.name);return t.variables.set(r,i),[{name:i,declaration:n}]}),s=a.filter(e=>!Wt(e.declaration));return{variables:o,exported:s.flatMap(e=>{let n=e.declaration,i=v(n);if(!Ut(n)||i?.body===void 0)return[];let a=d.default.isVariableDeclaration(n)?n.parent.parent:n;return[{name:t.names.getFresh(e.name),declaration:n,node:i,body:i.body,tags:r.get(a)??/* @__PURE__ */ new Map}]}),topLevel:new Map(s.map(e=>[e.name,e.declaration])),symmetrySets:i,isDeadlockChecked:![...r.values()].some(e=>e.has(`noDeadlock`))}},$={strict:!0,noEmit:!0,target:d.default.ScriptTarget.ESNext,module:d.default.ModuleKind.ESNext,moduleResolution:d.default.ModuleResolutionKind.Bundler,moduleDetection:d.default.ModuleDetectionKind.Force,allowImportingTsExtensions:!0,resolveJsonModule:!0,skipLibCheck:!0,lib:[`lib.esnext.d.ts`],types:[]},Jt=(0,u.dirname)(d.default.getDefaultLibFilePath($)),Yt=/* @__PURE__ */ new Map,Xt=(e,t)=>{let n=d.default.createSourceFile(t,e,d.default.ScriptTarget.ESNext,!0),r=d.default.createCompilerHost($),i=d.default.createProgram({rootNames:[t],options:$,host:{...r,getSourceFile:(e,i)=>{if(e===t)return n;let a=Yt.get(e);if(a!==void 0)return a;let o=r.getSourceFile(e,i);return o!==void 0&&e.startsWith(Jt)&&Yt.set(e,o),o},fileExists:e=>e===t||r.fileExists(e),readFile:n=>n===t?e:r.readFile(n)}}),a=d.default.getPreEmitDiagnostics(i);if(a.length>0)throw new l.R(d.default.formatDiagnostics(a,r));return{sourceFile:n,checker:i.getTypeChecker()}},Zt=e=>d.default.isReturnStatement(e)?e.expression===void 0:d.default.isBlock(e)&&e.statements.length===1&&Zt(e.statements[0]),Qt=(e,t,n,r)=>{if(!d.default.isIfStatement(e)||e.elseStatement!==void 0||!Zt(e.thenStatement))return;let i=e.expression;if(!d.default.isPrefixUnaryExpression(i)||i.operator!==d.default.SyntaxKind.ExclamationToken)return;let a=d.default.isParenthesizedExpression(i.operand)?i.operand.expression:i.operand;if(!g(a)||a.expression.name.text!==`has`||a.arguments.length!==1)return;let o=e=>[...t.filter(t=>d.default.isIdentifier(e)&&t.symbol===h(e,r.checker)),...e.getChildren().flatMap(o)],s=a.arguments[0],c=t.find(e=>e.symbol===h(s,r.checker)),l=a.expression.expression,u=o(l);if(c!==void 0&&!n.has(c)&&u.every(e=>n.has(e))&&Ae(l,r))return{parameter:c,set:l,isDependent:u.length>0}},$t=(e,t,n,r)=>{let i=e.length===0?void 0:Qt(e[0],t,n,r);if(i===void 0)return{chosen:n,remaining:e};let a=k(O(r),[...n.keys()]),o=H(i.set,a,r);return $t(e.slice(1),t,new Map([...n,[i.parameter,{domain:o,isDependent:i.isDependent}]]),r)},en=(e,t,n)=>{let r=e.name,i=e.body,a=fe(e.node.parameters,n),o=$t(d.default.isBlock(i)?i.statements:[d.default.factory.createExpressionStatement(i)],a,/* @__PURE__ */ new Map,n),s=Dt(o.remaining,k(O(n),a),n),c=a.length===0?r:`${r}(${a.map(e=>e.name).join(`, `)})`;t.actions.push(`${c} ==\n ${D(ae(s),` `)}`);let l=e.tags.has(`strongFair`)?`SF_vars`:e.tags.has(`fair`)?`WF_vars`:void 0;if(a.length===0){t.next.push(r),l!==void 0&&t.fairness.push(`${l}(${r})`);return}let u=e=>n.checker.getTypeAtLocation(e.node.name),f=a.map(e=>{let t=o.chosen.get(e);return{parameter:e,chosen:t,domain:t?.domain??Pe(u(e),e.node,n)}}),p=f.flatMap(e=>e.chosen?.isDependent===!0?[]:[`${e.parameter.name} \\in ${e.domain}`]),m=[...o.chosen].filter(e=>e[1].isDependent).map(e=>`\\E ${e[0].name} \\in ${e[1].domain} : `),h=`\\E ${p.join(`, `)} : ${m.join(``)}${c}`;if(t.next.push(h),l===void 0)return;let g=f.map(e=>{let t=e.chosen===void 0?e.domain:Ne(u(e.parameter),n);return typeof t==`string`?`${e.parameter.name} \\in ${t}`:void 0});if(!g.every(e=>e!==void 0)){t.fairness.push(`${l}(${h})`);return}let _=f.flatMap(e=>e.chosen===void 0?[]:[`${e.parameter.name} \\in ${T(e.domain)}`]);t.fairness.push(`\\A ${g.join(`, `)} : ${l}(${[..._,c].join(` /\\ `)})`)},tn=(e,t)=>{let n=e.declaration.initializer;if(n===void 0){let n=t.checker.getTypeAtLocation(e.declaration.name);return`${e.name} \\in ${Pe(n,e.declaration,t)}`}let r=M(n,O(t),t);return`${e.name} = ${D(E(r),` `)}`},nn=(e,t,n,r)=>{let i=[...e.tags.keys()].find(e=>It.has(e));if(i!==void 0)return zt(e,i,t,n,r);let a=r.checker.getSignatureFromDeclaration(e.node)?.getReturnType();if(kt(e.body,r)||a===void 0||(a.flags&(d.default.TypeFlags.Void|d.default.TypeFlags.Undefined))!==0)return en(e,n,r);if(!(a.flags&d.default.TypeFlags.BooleanLike))throw new l.R(`An exported function that returns a value must return a boolean, or be tagged, such as @view`,e.node);return Bt(e,n,r)},rn=(e,t=`spec.ts`)=>{let n=Xt(e,t.replaceAll(`\\`,`/`)),r=m(n.checker),i=qt(n.sourceFile,r),a=At();a.init.push(...i.variables.map(e=>tn(e,r)));for(let e of i.exported)nn(e,i,a,r);let o=(0,u.basename)(t,`.ts`).split(/[^A-Za-z0-9]+/).map(e=>e.charAt(0).toUpperCase()+e.slice(1)).join(``);return Nt(o,i,a,r)};exports.compile=rn,exports.t=o;
package/dist/compile.js CHANGED
@@ -6,7 +6,7 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- import{L as e}from"./worker.js";import{basename as t,dirname as n}from"node:path";import r from"@typescript/typescript6";const i=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ASSUME.ASSUMPTION.AXIOM.BOOLEAN.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.FALSE.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.SF_.STATE.STRING.SUBSET.SUFFICES.TAKE.TEMPORAL.THEN.THEOREM.TRUE.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WF_.WITH.WITNESS.Nat.Int.Seq.Len.Append.Head.Tail.SubSeq.SelectSeq.Cardinality.IsFiniteSet.Print.PrintT.Assert.JavaTime.TLCGet.TLCSet.Permutations.SortSeq.RandomElement.Any.ToString.TLCEval.Init.Next.Spec.vars.Null.Undefined.Perms.Rem.Quot`.split(`.`)),a=()=>{let e=/* @__PURE__ */ new Set;return{getFresh:t=>{let n=t.replace(/[^A-Za-z0-9_]/g,`_`),r=/[A-Za-z]/.test(n)?n:`v${n}`,a=t=>{let n=t===0?r:`${r}_${t}`;return e.has(n)||i.has(n)?a(t+1):n},o=a(0);return e.add(o),o}}},o=e=>({checker:e,names:a(),variables:/* @__PURE__ */ new Map,definitions:/* @__PURE__ */ new Map,inProgress:/* @__PURE__ */ new Set,recursive:/* @__PURE__ */ new Set,output:[],modelValues:/* @__PURE__ */ new Map,prelude:/* @__PURE__ */ new Set}),s=(e,t)=>{let n=r.isShorthandPropertyAssignment(e.parent)&&e.parent.name===e?t.getShorthandAssignmentValueSymbol(e.parent):t.getSymbolAtLocation(e);return n!==void 0&&n.flags&r.SymbolFlags.Alias?t.getAliasedSymbol(n):n},c=e=>r.isCallExpression(e)&&r.isPropertyAccessExpression(e.expression),l=e=>{let t=e?.valueDeclaration;if(t!==void 0)return r.isFunctionDeclaration(t)&&r.isSourceFile(t.parent)||r.isVariableDeclaration(t)&&r.isVariableStatement(t.parent.parent)&&r.isSourceFile(t.parent.parent.parent)&&(t.parent.flags&r.NodeFlags.Const)!==0?t:void 0},u=e=>{if(e!==void 0)return r.isFunctionDeclaration(e)||r.isArrowFunction(e)||r.isFunctionExpression(e)?e:r.isVariableDeclaration(e)?u(e.initializer):void 0},d=(e,t)=>u(e)??u(s(e,t.checker)?.valueDeclaration),f=(e,t)=>t.modelValues.get(e)??JSON.stringify(e),p=e=>/^(@|[A-Za-z_]\w*'?|-?\d+|"[^"\\]*")$/.test(e),m=(e,t,n,r)=>{if(p(e))return r(e);let i=n.names.getFresh(t);return`(LET ${i} == ${e} IN ${r(i)})`},h={kind:`disabled`},g=e=>({kind:`text`,text:e}),_=e=>{let t=e.flatMap(e=>e.kind===`and`?e.items:[e]);if(t.some(e=>e.kind===`disabled`))return h;let n=t.filter(e=>e.kind!==`text`||e.text!==`TRUE`);return n.length===0?g(`TRUE`):n.length===1?n[0]:{kind:`and`,items:n}},v=(e,t,n,r=`~${S(e)}`)=>t.kind===`disabled`&&n.kind===`disabled`?h:n.kind===`disabled`?_([g(e),t]):t.kind===`disabled`?_([g(r),n]):{kind:`if`,condition:e,whenTrue:t,whenFalse:n},y=(e,t)=>t.kind===`disabled`||e.length===0?t:t.kind===`let`?y([...e,...t.definitions],t.body):{kind:`let`,definitions:e,body:t},b=(e,t,n)=>e.map((e,r)=>`${r===0?t:n}${e}`),x=e=>e.kind===`disabled`?[`FALSE`]:e.kind===`text`?e.text.split(`
9
+ import{R as e}from"./worker.js";import{basename as t,dirname as n}from"node:path";import r from"@typescript/typescript6";const i=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ASSUME.ASSUMPTION.AXIOM.BOOLEAN.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.FALSE.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.SF_.STATE.STRING.SUBSET.SUFFICES.TAKE.TEMPORAL.THEN.THEOREM.TRUE.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WF_.WITH.WITNESS.Nat.Int.Seq.Len.Append.Head.Tail.SubSeq.SelectSeq.Cardinality.IsFiniteSet.Print.PrintT.Assert.JavaTime.TLCGet.TLCSet.Permutations.SortSeq.RandomElement.Any.ToString.TLCEval.Init.Next.Spec.vars.Null.Undefined.Perms.Rem.Quot`.split(`.`)),a=()=>{let e=/* @__PURE__ */ new Set;return{getFresh:t=>{let n=t.replace(/[^A-Za-z0-9_]/g,`_`),r=/[A-Za-z]/.test(n)?n:`v${n}`,a=t=>{let n=t===0?r:`${r}_${t}`;return e.has(n)||i.has(n)?a(t+1):n},o=a(0);return e.add(o),o}}},o=e=>({checker:e,names:a(),variables:/* @__PURE__ */ new Map,definitions:/* @__PURE__ */ new Map,inProgress:/* @__PURE__ */ new Set,recursive:/* @__PURE__ */ new Set,output:[],modelValues:/* @__PURE__ */ new Map,prelude:/* @__PURE__ */ new Set}),s=(e,t)=>{let n=r.isShorthandPropertyAssignment(e.parent)&&e.parent.name===e?t.getShorthandAssignmentValueSymbol(e.parent):t.getSymbolAtLocation(e);return n!==void 0&&n.flags&r.SymbolFlags.Alias?t.getAliasedSymbol(n):n},c=e=>r.isCallExpression(e)&&r.isPropertyAccessExpression(e.expression),l=e=>{let t=e?.valueDeclaration;if(t!==void 0)return r.isFunctionDeclaration(t)&&r.isSourceFile(t.parent)||r.isVariableDeclaration(t)&&r.isVariableStatement(t.parent.parent)&&r.isSourceFile(t.parent.parent.parent)&&(t.parent.flags&r.NodeFlags.Const)!==0?t:void 0},u=e=>{if(e!==void 0)return r.isFunctionDeclaration(e)||r.isArrowFunction(e)||r.isFunctionExpression(e)?e:r.isVariableDeclaration(e)?u(e.initializer):void 0},d=(e,t)=>u(e)??u(s(e,t.checker)?.valueDeclaration),f=(e,t)=>t.modelValues.get(e)??JSON.stringify(e),p=e=>/^(@|[A-Za-z_]\w*'?|-?\d+|"[^"\\]*")$/.test(e),m=(e,t,n,r)=>{if(p(e))return r(e);let i=n.names.getFresh(t);return`(LET ${i} == ${e} IN ${r(i)})`},h={kind:`disabled`},g=e=>({kind:`text`,text:e}),_=e=>{let t=e.flatMap(e=>e.kind===`and`?e.items:[e]);if(t.some(e=>e.kind===`disabled`))return h;let n=t.filter(e=>e.kind!==`text`||e.text!==`TRUE`);return n.length===0?g(`TRUE`):n.length===1?n[0]:{kind:`and`,items:n}},v=(e,t,n,r=`~${S(e)}`)=>t.kind===`disabled`&&n.kind===`disabled`?h:n.kind===`disabled`?_([g(e),t]):t.kind===`disabled`?_([g(r),n]):{kind:`if`,condition:e,whenTrue:t,whenFalse:n},y=(e,t)=>t.kind===`disabled`||e.length===0?t:t.kind===`let`?y([...e,...t.definitions],t.body):{kind:`let`,definitions:e,body:t},b=(e,t,n)=>e.map((e,r)=>`${r===0?t:n}${e}`),x=e=>e.kind===`disabled`?[`FALSE`]:e.kind===`text`?e.text.split(`
10
10
  `):e.kind===`and`?e.items.flatMap(e=>b(x(e),`/\\ `,` `)):e.kind===`if`?[...b(e.condition.split(`
11
11
  `),`IF `,` `),...b(x(e.whenTrue),`THEN `,` `),...b(x(e.whenFalse),`ELSE `,` `)]:[...e.definitions.flatMap((e,t)=>b(e.split(`
12
12
  `),t===0?`LET `:` `,` `)),...b(x(e.body),`IN `,` `)],ee=e=>x(e).join(`