tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.702eb98
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.
- package/README.md +26 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +515 -0
- package/dist/prove.js +515 -0
- package/dist/run-cli.cjs +30 -47
- package/dist/run-cli.js +30 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +28 -7
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +26 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +27 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +477 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +27 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +29 -0
- package/src/prove/prove.ts +417 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +13 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +68 -25
- package/src/values.ts +8 -3
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
package/dist/run-cli.js
CHANGED
|
@@ -6,50 +6,33 @@
|
|
|
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{$ as e,A as t,B as n,C as r,D as i,E as a,G as o,H as s,L as c,M as l,N as u,O as d,Q as f,R as p,T as m,U as h,V as g,W as _,_ as v,_t as y,at as b,bt as x,ct as S,dt as C,et as w,ft as T,gt as E,h as ee,ht as D,it as O,j as te,k as ne,lt as re,m as ie,mt as ae,nt as oe,ot as se,pt as ce,q as le,rt as k,st as ue,tt as de,ut as fe,v as pe,vt as me,w as he,yt as A,z as ge}from"./transfer.js";import{t as _e}from"./parallel.js";import{basename as ve,delimiter as ye,dirname as j,isAbsolute as be,join as xe,resolve as Se}from"node:path";import{existsSync as M,globSync as Ce,mkdirSync as we,readFileSync as Te,readSync as Ee,realpathSync as De,writeFileSync as Oe}from"node:fs";import{spawnSync as ke}from"node:child_process";import{arch as Ae,availableParallelism as je,release as Me,tmpdir as Ne,type as Pe}from"node:os";import{pathToFileURL as N}from"node:url";import{getHeapStatistics as Fe}from"node:v8";var Ie=`0.0.4-dev.6dec595`;const Le=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Re=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(Le).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},ze=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},Be=e=>`File ${JSON.stringify(e.file)}, ${ze(e)}`,Ve=e=>`${e?Be(e):`<unknown location>`}:\n`,P=(e,t)=>({text:`${Ve(e)}Error: ${t}`,channel:`stderr`}),He=e=>e?`${Be(e)} :\n`:``,F=e=>({kind:`Shift`,amount:e}),Ue=(e,t)=>({kind:`Cons`,expression:e,rest:t}),We=(e,t)=>e.reduce((e,t)=>Ue(t,e),t),Ge=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},I=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},Ke=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},qe=(e,t,n)=>I({kind:`Apply`,operator:I({kind:`Internal`,builtin:e},n),args:t},n),Je=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},Ye=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),Xe=(e,t)=>t.reduce(Ye,e),Ze=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},Qe=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(Ke(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},$e=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},et=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},tt=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),nt=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),rt=(e,t,n)=>{switch(e.kind){case`Shift`:return I({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?I(ot(e.expression),n):rt(e.rest,t-1,n);case`Compose`:return L(e.outer,rt(e.inner,t,n));case`Bump`:return t<=e.amount?I({kind:`Ix`,index:t},n):L(F(e.amount),rt(e.rest,t-e.amount,n))}},it=(e,t)=>t.map(t=>L(e,t)),at=(e,t)=>{if(e.kind===`Lambda`){if(e.params.length!==t.length)throw new C(`Arity mismatch`);return ot(L(We(t,F(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...t]}:t.length===0?ot(e):{kind:`Apply`,operator:e,args:t}},ot=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},st=(e,t)=>[Ge(t.length,e),vt(t,t=>L(e,t))],ct=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return xt(t,t=>L(e,t));case`Instance`:{let n=Ge(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:L(n,e.expression)}))}}}}},lt=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:L(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ct(e,t.definition)};case`Fact`:return{...t,expression:L(e,t.expression)}}},ut=(e,t)=>{let[n,r]=et(e,t.context,(e,t)=>[Ge(1,e),lt(e,t)]);return{context:r,active:L(n,t.active)}},L=(e,t)=>{let n=t=>L(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return rt(e,t.index,t);case`Apply`:return I(at(n(t.operator),it(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>yt(e,n))};case`Lambda`:return{...t,body:L(Ge(t.params.length,e),t.body)};case`Let`:{let[n,r]=et(e,t.definitions,(e,t)=>[Ge(1,e),ct(e,t)]);return{...t,definitions:r,body:L(n,t.body)}}case`Sequent`:return{...t,sequent:ut(e,t.sequent)};case`With`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:it(e,t.items)};case`Quant`:{let[n,r]=st(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`Tquant`:return{...t,body:L(Ge(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:L(Ge(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:L(Ge(1,e),t.body)};case`SetOf`:{let[n,r]=st(e,t.bounds);return{...t,bounds:r,element:L(n,t.element)}}case`SetEnum`:return{...t,elements:it(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=st(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:it(e,t.args)};case`Product`:return{...t,factors:it(e,t.factors)};case`Tuple`:return{...t,elements:it(e,t.elements)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:bt(t.specs,n)};case`Dot`:return{...t,expression:n(t.expression)};case`Sub`:case`Tsub`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Fair`:return{...t,subscript:n(t.subscript),action:n(t.action)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)};case`Parens`:return{...t,expression:n(t.expression)}}},R=(e,t)=>e===0?t:L(F(e),t),dt=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),ft=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!z(t,n))return!1}return!0},pt=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&z(e.domain.expression,t.domain.expression)),mt=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&dt(e.args,t.args,z);case`Label`:return t.kind===`Label`&&e.label===t.label&&dt(e.args,t.args,z);default:return!0}},ht=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return z(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return dt(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&ft(n,r)}return!1},gt=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level!==t.level||e.shape!==t.shape?!1:!e.domain||!t.domain?!e.domain&&!t.domain:z(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?ht(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&z(e.expression,t.expression),_t=(e,t)=>dt(e.context,t.context,gt)&&z(e.active,t.active),z=(e,t)=>{if(e.kind===`Parens`)return z(e.expression,t);if(t.kind===`Parens`)return z(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&z(e.body,t.body);case`Apply`:return t.kind===`Apply`&&z(e.operator,t.operator)&&dt(e.args,t.args,z);case`Sequent`:return t.kind===`Sequent`&&_t(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&z(e.expression,t.expression)&&dt(e.selectors,t.selectors,mt);case`With`:return t.kind===`With`&&z(e.expression,t.expression);case`Let`:return t.kind===`Let`&&dt(e.definitions,t.definitions,ht)&&z(e.body,t.body);case`If`:return t.kind===`If`&&z(e.condition,t.condition)&&z(e.consequent,t.consequent)&&z(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&dt(e.items,t.items,z);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&dt(e.bounds,t.bounds,pt)&&z(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&dt(e.names,t.names,(e,t)=>e===t)&&z(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?z(e.domain,t.domain)&&z(e.body,t.body):!e.domain&&!t.domain&&z(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&z(e.domain,t.domain)&&z(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&z(e.element,t.element)&&dt(e.bounds,t.bounds,pt);case`SetEnum`:return t.kind===`SetEnum`&&dt(e.elements,t.elements,z);case`Arrow`:return t.kind===`Arrow`&&z(e.domain,t.domain)&&z(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&dt(e.bounds,t.bounds,pt)&&z(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&dt([e.function,...e.args],[t.function,...t.args],z);case`Tuple`:return t.kind===`Tuple`&&dt(e.elements,t.elements,z);case`Product`:return t.kind===`Product`&&dt(e.factors,t.factors,z);case`Rect`:return t.kind===`Rect`&&ft(e.fields,t.fields);case`Record`:return t.kind===`Record`&&ft(e.fields,t.fields);case`Except`:return t.kind===`Except`&&z(e.function,t.function)&&dt(e.specs,t.specs,(e,t)=>dt(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression))&&z(e.value,t.value));case`Dot`:return t.kind===`Dot`&&z(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&z(e.action,t.action)&&z(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&z(e.subscript,t.subscript)&&z(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:z(e.arms[0].condition,t.arms[0].condition)&&z(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?z(e.other,t.other):!e.other&&!t.other;case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},vt=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),yt=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,bt=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),xt=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,St=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:xt(e.definition,t)}:{...e,expression:t(e.expression)},Ct=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,tt(t.name,t.level)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=tt(t.name,`Unknown`,t.shape);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=et(e,t.sequent.context,(e,t)=>{let a=St(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=et(e,t.definitions,(e,t)=>{let i=xt(t,t=>n(e,t));return[r(e,{kind:`Defn`,definition:i,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=vt(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=vt(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?nt(t.name,i):tt(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=nt(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>yt(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=bt(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},wt=(e,t)=>Ct(void 0,e,(e,n)=>t(n),()=>void 0,`all`),Tt=e=>{let t=[];return wt(e,e=>(t.push(e),e)),t},Et={kind:`Opaque`,name:`$Bad`},Dt=e=>e.kind===`Opaque`&&e.name===Et.name,Ot=e=>{let t=e.kind===`Parens`?Ot(e.expression):wt(e,Ot);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},kt=e=>e.kind===`Let`?I({kind:`Let`,definitions:e.definitions,body:kt(e.body)},e.body):e.kind===`Parens`?kt(e.expression):wt(e,kt),At=e=>e.kind===`Ix`?e.index<=0:Tt(e).some(At),jt=(e,t,n)=>{let r=(e,r=n)=>jt(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(e=>tt(e.name,e.level))]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(e=>tt(e.name,`Unknown`,e.shape))]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,tt(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of Tt(e)){let e=r(t);if(e)return e}return}},Mt=(e,t)=>We(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),F(e+t)),Nt=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),Pt=(e,t,n)=>{switch(t.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(t.bounds.length!==n.length){let r=t.bounds.length,i=`Arity mismatch in subexpression instance.\nExpected ${r} argument${r===1?``:`s`}, but found${n.length<r?` only`:``} ${n.length}.`;throw e(P(t.location,i)),new C(i,{failure:`Expr.Deref.deref_inst`})}let r=t.kind===`SetOf`?t.element:t.body;return L(We(n,F(0)),r)}case`Tquant`:return Pt(e,I({kind:`Quant`,quantifier:t.quantifier,bounds:t.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`Lambda`:return Pt(e,I({kind:`Quant`,quantifier:`Forall`,bounds:t.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`SetSt`:case`Choose`:if(n.length!==1){let r=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${n.length}.`;throw e(P(t.location,r)),new C(r,{failure:`Expr.Deref.deref_inst`})}return L(We(n,F(0)),t.body);default:{let n=`Cannot instantiate non-binding expression`;throw e(P(t.location,n)),new C(n,{failure:`Expr.Deref.deref_inst`})}}},Ft=(e,t,n)=>{let r=(()=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:return n.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return n.names.map(e=>({name:e,shape:0}));case`Lambda`:return n.params;case`SetSt`:case`Choose`:return[{name:n.name,shape:0}];default:{let t=`Cannot abstract over bound variables in a non-binding expression`;throw e(P(n.location,t)),new C(t,{failure:`Expr.Deref.deref_at`})}}})(),i=L(Mt(t,r.length),n);return[r,Pt(e,i,Nt(r.length))]},It=(e,t,n,r,i,a)=>{let o=t=>{if(!(r<=t))throw e(P(i.location,a)),new C(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]),c=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let t=`subexpression reference does not resolve to an expression`;throw e(P(n.location,t)),new C(t,{failure:`Expr.Deref.deref_num`})}let s=L(F(-(r-1)),a?a.expression:i.active);if(At(s))throw e(P(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
`),
|
|
15
|
-
|
|
16
|
-
`)
|
|
17
|
-
|
|
18
|
-
`:n.push({kind:`Newline`}),o++;break;case`.`:n.push({kind:`Flush`}),o++;break;case`;`:{let t=e.indexOf(`>`,o),r=e.slice(o+3,t).split(` `);n.push({kind:`Break`,width:Number(r[0]),offset:Number(r[1])}),o=t;break}case`<`:{let i=e.indexOf(`>`,o);n.push({kind:`Text`,text:String(t[r++]),size:Number(e.slice(o+2,i))}),o=i+2;break}}}return a(),n},V=(e,t,n=[yn(`,`),xn])=>e.flatMap((e,r)=>r===0?[t(e)]:[n,t(e)]),wn=(e,t)=>{for(let n of t)if(Array.isArray(n))wn(e,n);else switch(n.kind){case`Open`:dn(e,n.box,n.indent);break;case`Close`:fn(e);break;case`Text`:pn(e,n.size,n.text);break;case`Break`:mn(e,n.width,n.offset);break;case`Newline`:hn(e);break;case`Flush`:_n(e)}},Tn=e=>{let t=en();return wn(t,e),gn(t)},En=[[`=>`,1,1,`InfixNon`,[]],[`<=>`,2,2,`InfixNon`,[`\\equiv`]],[`/\\`,3,3,`InfixLeft`,[`\\land`]],[`\\/`,3,3,`InfixLeft`,[`\\lor`]],[`~`,4,4,`Prefix`,[`\\neg`,`\\lnot`]],[`=`,5,5,`InfixNon`,[]],[`#`,5,5,`InfixNon`,[`/=`]],[`SUBSET`,8,8,`Prefix`,[]],[`UNION`,8,8,`Prefix`,[]],[`DOMAIN`,9,9,`Prefix`,[]],[`\\subseteq`,5,5,`InfixNon`,[]],[`\\in`,5,5,`InfixNon`,[]],[`\\notin`,5,5,`InfixNon`,[]],[`\\`,8,8,`InfixNon`,[]],[`\\cap`,8,8,`InfixLeft`,[`\\intersect`]],[`\\cup`,8,8,`InfixLeft`,[`\\union`]],[`\\X`,10,13,`Prefix`,[`\\times`]],[`'`,15,15,`Postfix`,[]],[`~>`,2,2,`InfixNon`,[`\\leadsto`]],[`ENABLED`,4,15,`Prefix`,[]],[`UNCHANGED`,4,15,`Prefix`,[]],[`\\cdot`,5,14,`InfixLeft`,[]],[`-+->`,2,2,`InfixNon`,[]],[`[]`,4,15,`Prefix`,[]],[`<>`,4,15,`Prefix`,[]],[`^`,14,14,`InfixNon`,[]],[`/`,13,13,`InfixNon`,[]],[`*`,13,13,`InfixLeft`,[]],[`-.`,12,12,`Prefix`,[`-`]],[`-`,11,11,`InfixLeft`,[]],[`+`,10,10,`InfixLeft`,[]],[`^+`,15,15,`Postfix`,[]],[`^*`,15,15,`Postfix`,[]],[`^#`,15,15,`Postfix`,[]],[`<`,5,5,`InfixNon`,[]],[`=<`,5,5,`InfixNon`,[`<=`,`\\leq`]],[`>`,5,5,`InfixNon`,[]],[`>=`,5,5,`InfixNon`,[`\\geq`]],[`...`,9,9,`InfixNon`,[]],[`..`,9,9,`InfixNon`,[]],[`|`,10,11,`InfixLeft`,[]],[`||`,10,11,`InfixLeft`,[]],[`&&`,13,13,`InfixLeft`,[]],[`&`,13,13,`InfixLeft`,[]],[`$$`,9,13,`InfixLeft`,[]],[`$`,9,13,`InfixLeft`,[]],[`??`,9,13,`InfixLeft`,[]],[`%%`,10,11,`InfixLeft`,[]],[`%`,10,11,`InfixLeft`,[`\\mod`]],[`##`,9,13,`InfixLeft`,[]],[`++`,10,10,`InfixLeft`,[]],[`--`,11,11,`InfixLeft`,[]],[`**`,13,13,`InfixLeft`,[]],[`//`,13,13,`InfixNon`,[]],[`^^`,14,14,`InfixNon`,[]],[`@@`,6,6,`InfixLeft`,[]],[`!!`,9,13,`InfixNon`,[]],[`|-`,5,5,`InfixNon`,[]],[`|=`,5,5,`InfixNon`,[]],[`-|`,5,5,`InfixNon`,[]],[`=|`,5,5,`InfixNon`,[]],[`<:`,7,7,`InfixNon`,[]],[`:>`,7,7,`InfixNon`,[]],[`:=`,5,5,`InfixNon`,[]],[`::=`,5,5,`InfixNon`,[]],[`(+)`,10,10,`InfixLeft`,[`\\oplus`]],[`(-)`,11,11,`InfixLeft`,[`\\ominus`]],[`(.)`,13,13,`InfixLeft`,[`\\odot`]],[`(/)`,13,13,`InfixNon`,[`\\oslash`]],[`(\\X)`,13,13,`InfixLeft`,[`\\otimes`]],[`\\uplus`,9,13,`InfixLeft`,[]],[`\\sqcap`,9,13,`InfixLeft`,[]],[`\\sqcup`,9,13,`InfixLeft`,[]],[`\\div`,13,13,`InfixNon`,[]],[`\\wr`,9,14,`InfixNon`,[]],[`\\star`,13,13,`InfixLeft`,[]],[`\\o`,13,13,`InfixLeft`,[`\\circ`]],[`\\bigcirc`,13,13,`InfixLeft`,[]],[`\\bullet`,13,13,`InfixLeft`,[]],[`\\prec`,5,5,`InfixNon`,[]],[`\\succ`,5,5,`InfixNon`,[]],[`\\preceq`,5,5,`InfixNon`,[]],[`\\succeq`,5,5,`InfixNon`,[]],[`\\sim`,5,5,`InfixNon`,[]],[`\\simeq`,5,5,`InfixNon`,[]],[`\\ll`,5,5,`InfixNon`,[]],[`\\gg`,5,5,`InfixNon`,[]],[`\\asymp`,5,5,`InfixNon`,[]],[`\\subset`,5,5,`InfixNon`,[]],[`\\supset`,5,5,`InfixNon`,[]],[`\\supseteq`,5,5,`InfixNon`,[]],[`\\approx`,5,5,`InfixNon`,[]],[`\\cong`,5,5,`InfixNon`,[]],[`\\sqsubset`,5,5,`InfixNon`,[]],[`\\sqsubseteq`,5,5,`InfixNon`,[]],[`\\sqsupset`,5,5,`InfixNon`,[]],[`\\sqsupseteq`,5,5,`InfixNon`,[]],[`\\doteq`,5,5,`InfixNon`,[]],[`\\propto`,5,5,`InfixNon`,[]]],Dn=/* @__PURE__ */ new Map;for(let[e,t,n,r,i]of En){let a={name:e,low:t,high:n,fixity:r};for(let t of[e,...i])Dn.set(t,a)}const On=e=>({name:e,low:-1,high:-1,fixity:`Nonfix`}),kn=e=>Dn.get(e)??On(e),An={Implies:`=>`,Equiv:`<=>`,Conj:`/\\`,Disj:`\\/`,Neg:`~`,Eq:`=`,Neq:`#`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,Subseteq:`\\subseteq`,Mem:`\\in`,Notmem:`\\notin`,Setminus:`\\`,Cap:`\\cap`,Cup:`\\cup`,Prime:`'`,StrongPrime:`'`,Leadsto:`~>`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,Cdot:`\\cdot`,Actplus:`-+->`,BoxTrue:`[]`,BoxFalse:`[]`,Diamond:`<>`,Plus:`+`,Minus:`-`,Times:`*`,Ratio:`/`,Quotient:`\\div`,Remainder:`%`,Exp:`^`,Lteq:`=<`,Lt:`<`,Gteq:`>=`,Gt:`>`,Range:`..`,Cat:`\\o`,OneArg:`:>`,Extend:`@@`},jn=e=>{if(e===`Divides`)return{name:`?|`,low:10,high:11,fixity:`InfixNon`};if(e===`Uminus`)return{...kn(`-.`),name:`-`};let t=An[e];return t?kn(t):On(e)},Mn=e=>e.salt===0?e.rep:`${e.rep}_${e.salt}`,Nn=()=>({stack:[],idents:/* @__PURE__ */ new Map,defined:/* @__PURE__ */ new Map}),Pn=(e,t)=>{let n=e.idents.get(t)?.at(-1),r=n?{rep:t,salt:n.salt+1}:{rep:t,salt:0};for(;e.defined.has(Mn(r));)r={rep:t,salt:r.salt+1};e.stack.push(r);let i=e.idents.get(t);i?i.push(r):e.idents.set(t,[r]);let a=Mn(r);return e.defined.set(a,(e.defined.get(a)??0)+1),a},Fn=(e,t)=>{for(let n=0;n<t;n++){let t=e.stack.pop();if(!t)return;e.idents.get(t.rep)?.pop();let n=Mn(t),r=(e.defined.get(n)??1)-1;r===0?e.defined.delete(n):e.defined.set(n,r)}},In=(e,t,n)=>{let r=n(t.map(t=>Pn(e,t)));return Fn(e,t.length),r},Ln=(e,t)=>t.kind===`Atm`||t.kind===`Op`&&e<t.low,Rn=e=>[B(`(`),e,B(`)`)],zn=(e,t)=>t?Bn(e):Rn(Bn(e)),Bn=e=>{if(e.kind!==`Op`)return e.doc;let t=e.skeleton,n=t=>Ln(e.high,t);switch(t.kind){case`Prefix`:case`Postfix`:{let r=t.operand,i=zn(r,n(r)||r.kind===`Op`&&r.skeleton.kind===t.kind),a=t.kind===`Prefix`?[e.doc,i]:[i,e.doc];return[B(`@[<h>`),...a,B(`@]`)]}case`Infix`:{let r=t.left,i=t.right,a=n(r)||r.kind===`Op`&&r.name===e.name&&t.assoc===`Left`,o=n(i)||t.assoc===`Right`&&i.kind===`Op`&&i.skeleton.kind===`Infix`&&i.skeleton.assoc===`Right`;return[B(`@[<b0>`),zn(r,a),e.doc,zn(i,o),B(`@]`)]}}},H=e=>({kind:`Atm`,doc:e}),Vn=e=>({kind:`Big`,doc:e}),Hn=e=>e.kind===`Lambda`?Hn(e.body):e.kind===`Sequent`?Hn(e.sequent.active):e.kind===`With`,Un=e=>{if(e.kind===`Defn`){let t=e.definition,n=t.kind===`Operator`&&Hn(t.body);return e.visibility===`Hidden`||n||e.whereDefined!==`User`}return e.kind===`Fact`?e.visibility===`Hidden`||Hn(e.expression):!1},Wn=e=>e===0?[]:B(`@[<hov1>(%a)@]`,V(Array.from({length:e},()=>`_`),bn)),Gn=e=>B(`%s%a`,e.name,Wn(e.shape)),Kn={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`UNKNOWN`},qn=(e=[])=>{let t=Nn(),n=e=>Bn(l(e)),r=(e,r)=>In(t,e.map(e=>e.name),()=>B(`@[<b2>LAMBDA @[<hv0>%a@] :@ %a@]`,V(e,Gn),n(r))),i=(e,r)=>{let i=e.map(e=>e.domain.kind===`Domain`?n(e.domain.expression):void 0);return In(t,e.map(e=>e.name),t=>{let n=[];return e.forEach((e,r)=>{r>0&&e.domain.kind===`Ditto`?n.at(-1)?.names.push(t[r]):n.push({names:[t[r]],index:r})}),r(V(n,t=>{let n=V(t.names,bn),r=e[t.index].domain;return r.kind===`NoDomain`?n:r.kind===`Ditto`?B(`@[<hov0>%a@ \\in ??????@]`,n):B(`@[<hov0>%a@ \\in %a@]`,n,i[t.index]??[])}))})},a=e=>{switch(e.kind){case`Down`:return B(`:`);case`Left`:return B(`<<`);case`Right`:return B(`>>`);case`At`:return bn(`@`);case`Number`:return bn(String(e.value));case`Instance`:return B(`@[<b1>(%a)@]`,V(e.args,n));case`Label`:return e.args.length===0?bn(e.label):B(`@[<b2>%s@,@[<b1>(%a)@]@]`,e.label,V(e.args,n))}},o=e=>e.length===0?[]:[B(`!`),V(e,a,B(`!`))],s=n=>{if(n<0)return`#$$${Math.abs(n)}`;if(n===0)return`#$0`;if(n<=t.stack.length)return Mn(t.stack[t.stack.length-n]);let r=e[e.length-(n-t.stack.length)];return r?Ke(r)??`??? FACT ???`:`#$${n}`},c=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Op`,name:` `,doc:B(`@ `),low:20,high:20,skeleton:{kind:`Infix`,assoc:`Left`,left:Vn(r(e.params,e.body)),right:H(B(`(%a)`,V(t,n)))}};if(e.kind===`Bang`)return t.length===0?l(e):H(B(`@[<b2>%a@[<b1>(%a)@]@]`,n(e),V(t,n)));if(e.kind===`Internal`&&t.length===1){if(e.builtin===`BoxFalse`||e.builtin===`Unprimable`)return l(t[0]);if(e.builtin===`Irregular`)return H(B(`@[<h>@<1>%s%a@<1>%s@]`,`<[`,n(t[0]),`]>`))}let i=(()=>{switch(e.kind){case`Ix`:return kn(s(e.index));case`Opaque`:{let t=kn(e.name);return{...t,name:`?${t.name}`}}case`Internal`:return jn(e.builtin);default:throw new C(`Cannot print this operator`)}})(),a=(e,t)=>({kind:`Op`,name:i.name,doc:e,low:i.low,high:i.high,skeleton:t});if(t.length===0)return H(bn(i.name));if(i.fixity===`Nonfix`)return H(B(`@[<b2>%s@[<b1>(%a)@]@]`,i.name,V(t,n)));if(i.fixity===`Prefix`&&t.length===1)return a(/[A-Za-z]$/.test(i.name)?B(`%s@ `,i.name):bn(i.name),{kind:`Prefix`,operand:l(t[0])});if(i.fixity===`Postfix`&&t.length===1)return a(bn(i.name),{kind:`Postfix`,operand:l(t[0])});if(i.fixity.startsWith(`Infix`)&&t.length===2){let e=i.fixity===`InfixLeft`?`Left`:i.fixity===`InfixRight`?`Right`:`Non`;return a(i.name===`..`?bn(i.name):B(`@ %s `,i.name),{kind:`Infix`,assoc:e,left:l(t[0]),right:l(t[1])})}throw new C(`Arity mismatch for operator ${i.name}`)},l=e=>{switch(e.kind){case`Ix`:case`Opaque`:case`Internal`:return c(e,[]);case`Lambda`:return Vn(r(e.params,e.body));case`Bang`:return H([n(e.expression),o(e.selectors)]);case`Apply`:return c(e.operator,e.args);case`Sequent`:return Vn(f(e.sequent));case`With`:return l(e.expression);case`If`:return Vn(B(`@[<hv2>@[<b2>IF@ %a@]@ @[<b2>THEN %a@]@ @[<b2>ELSE %a@]@]`,n(e.condition),n(e.consequent),n(e.alternative)));case`List`:{if(e.bullet===`Refs`&&e.items.length===0)return H(B(`TRUE`));if(e.bullet===`Refs`&&e.items.length===1)return l(e.items[0]);let t=e.bullet===`Or`?`\\/`:`/\\`;return Vn(B(`@[<v0>%a@]`,V(e.items,e=>B(`@[<h>%s %a@]`,t,n(e)),B(`@,`))))}case`Let`:{let r=V(e.definitions,u,B(`@,`)),i=n(e.body);return Fn(t,e.definitions.length),Vn([B(`@[<hv0>LET @[<v0>`),r,B(`@]@
|
|
19
|
-
IN %a@]`,i)])}case`Quant`:return i(e.bounds,t=>Vn(B(`@[<b3>%s @[<b0>%a@] :@ %a@]`,e.quantifier===`Forall`?`\\A`:`\\E`,t,n(e.body))));case`Tquant`:return In(t,e.names,t=>Vn(B(`@[<b4>%s @[<b0>%a@] : %a@]`,e.quantifier===`Forall`?`\\AA`:`\\EE`,V(t,bn),n(e.body))));case`Choose`:{let r=e.domain&&n(e.domain);return In(t,[e.name],([t])=>Vn(r?B(`@[<b2>CHOOSE @[<b2>%s \\in@ %a@] :@ %a@]`,t,r,n(e.body)):B(`@[<b2>CHOOSE %s :@ %a@]`,t,n(e.body))))}case`SetSt`:{let r=n(e.domain);return In(t,[e.name],([t])=>H(B(`@[<b3>{@[<b2>%s \\in@ %a@] :@ %a}@]`,t,r,n(e.body))))}case`SetOf`:return i(e.bounds,t=>H(B(`@[<b3>{%a :@ %a}@]`,n(e.element),t)));case`SetEnum`:return H(B(`@[<h>{@[<b0>%a@]}@]`,V(e.elements,n)));case`Arrow`:return H(B(`@[<b3>[%a ->@ %a]@]`,n(e.domain),n(e.range)));case`Fcn`:return i(e.bounds,t=>H(B(`@[<b3>[%a |->@ %a]@]`,t,n(e.body))));case`FcnApp`:{let t=l(e.function),r=t.kind===`Atm`;return H(B(`@[<h>%s%a%s@[<b1>[%a]@]@]`,r?``:`(`,Bn(t),r?``:`)`,V(e.args,n)))}case`Product`:if(e.factors.length===1)return l(e.factors[0]);if(e.factors.length===0)throw new C(`Expr.Fmt.fmt_expr: PRODUCT []`);return{kind:`Op`,name:`\\X`,doc:B(`@ \\X `),low:10,high:13,skeleton:{kind:`Infix`,assoc:`Right`,left:l(e.factors[0]),right:l({...e,factors:e.factors.slice(1)})}};case`Tuple`:return H(B(`@[<b2><<%a>>@]`,V(e.elements,n)));case`Rect`:return H(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s : %a@]`,e.name,n(e.value)))));case`Record`:return H(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s |-> %a@]`,e.name,n(e.value)))));case`Except`:return H(B(`@[<b3>[%a EXCEPT@ @[<v0>%a@]]@]`,n(e.function),V(e.specs,e=>B(`!@[<h>%a = %a@]`,e.trail.map(e=>e.kind===`Dot`?B(`.%s`,e.field):B(`[%a]`,n(e.expression))),n(e.value)))));case`Dot`:return{kind:`Op`,name:`.`,doc:B(`.`),low:16,high:16,skeleton:{kind:`Infix`,assoc:`Left`,left:l(e.expression),right:H(bn(e.field))}};case`Sub`:case`Tsub`:{let t=e.modal===`Box`,r=e.kind===`Sub`?t?`[`:`<<`:t?`[][`:`<><<`;return H(B(`@[<h>%s@[<b2>%a@]%s%a@]`,r,n(e.action),t?`]_`:`>>_`,n(e.subscript)))}case`Fair`:return Vn(B(`@[<h>%s_%a (%a)@]`,e.fairness===`Weak`?`WF`:`SF`,Rn(n(e.subscript)),n(e.action)));case`Case`:return Vn(B(`@[<v2>CASE %a%a@]`,V(e.arms,e=>B(`@[<b2>%a ->@ %a@]`,n(e.condition),n(e.body)),B(`@,[] `)),e.other?B(`@,[] @[<b2>OTHER ->@ %a@]`,n(e.other)):[]));case`String`:return H(B(`"%s"`,e.value));case`Num`:return H(bn(e.fraction===``?e.integer:`${e.integer}.${e.fraction}`));case`At`:return H(bn(`@`));case`Parens`:{let n=e.form;if(n.kind===`Syntax`)return l(e.expression);let r=n.kind===`Nlabel`?n.names:n.indices.map(e=>e.index>=1&&e.index<=t.stack.length?s(e.index):`¶${e.index}`),i=l(e.expression);if(r.length===0){let e=i.kind===`Op`?`%s::(%a)`:`%s::%a`;return H(B(e,n.label,Bn(i)))}let a=V(r,bn);return i.kind===`Atm`?H(B(`%s(%a)::%a`,n.label,a,Bn(i))):i.kind===`Big`?H(B(`%s(%a)::(%a)`,n.label,a,Bn(i))):H(B(`(%s(%a):: %a)`,n.label,a,Bn(i)))}}},u=e=>{switch(e.kind){case`Operator`:case`Bpragma`:{let r=e.body;if(r.kind===`Lambda`){let i=In(t,r.params.map(e=>e.name),()=>n(r.body)),a=Pn(t,e.name);return B(`@[<b2>%s@[<b1>(%a)@] ==@ %a@]`,a,V(r.params,Gn),i)}let i=n(r);return B(`@[<b2>%s ==@ %a@]`,Pn(t,e.name),i)}case`Instance`:{let r=e.instance,i=In(t,r.args,e=>({doc:B(`@[<b2>INSTANCE %s%a@]`,r.module,r.substitutions.length===0?[]:B(`@ WITH@ %a`,V(r.substitutions,e=>B(`@[<b2>%s <- %a@]`,e.name,n(e.expression))))),args:e})),a=Pn(t,e.name),o=r.args.length===0?bn(a):B(`%s (@[<b0>%a@])`,a,V(i.args,bn));return B(`@[<b2>%a == %a@]`,o,i.doc)}case`Recursive`:{let n=Pn(t,e.name);return B(`@[<b2>NEW CONSTANT %s%a@]`,n,Wn(e.shape))}}},d=e=>{switch(e.kind){case`Fresh`:{let r=e.domain&&e.domainVisibility===`Visible`?n(e.domain):void 0,i=Pn(t,e.name);return[B(`NEW %s %s%a`,Kn[e.level],i,Wn(e.shape)),r?B(` \\in %a`,r):[]]}case`Flex`:return B(`NEW VARIABLE %s`,Pn(t,e.name));case`Defn`:return u(e.definition);case`Fact`:{let r=B(`@[<h>%a @]`,n(e.expression));return Pn(t,``),r}}},f=e=>{if(e.context.length===0)return n(e.active);let r=[];for(let n of e.context)Un(n)?Pn(t,Ke(n)??``):r.push(d(n));let i=n(e.active);return Fn(t,e.context.length),r.length===0?i:[B(`@[<v0>ASSUME @[<v0>`),V(r,e=>e),B(`@]@
|
|
20
|
-
PROVE %a@]`,i)]};return{printSequent:f,printExpr:n}},Jn=(e,t)=>qn(e).printExpr(t),Yn=e=>{let t=qn();return Tn(B(`@[<b0>%a@]`,t.printSequent(e))).trimEnd()},Xn={kind:`At`,isExcept:!1},Zn=e=>({location:e.location,step:e.step,isSuppressed:e.isSuppressed}),Qn=e=>e?.kind===`Named`&&e.isAnonymous,$n=e=>e?.level??0,er=e=>I({kind:`Internal`,builtin:`TRUE`},e),tr=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t&&e.args.length===2,nr=(e,...t)=>Tn(B(e,...t)),rr=e=>ir(e).map((e,t)=>{let n=e.domain.kind===`Domain`?R(t,e.domain.expression):void 0;return{kind:`Fresh`,name:e.name,shape:0,level:n?`Constant`:e.level,domain:n,domainVisibility:`Visible`}}),ir=e=>{let t={kind:`NoDomain`};return e.map(e=>e.domain.kind===`Ditto`?{...e,domain:t}:(t=e.domain,e))},ar=(e,t)=>t.context.flatMap((n,r)=>n.kind===`Fact`&&n.visibility===`Visible`?[R(e+t.context.length-1-r,n.expression)]:[]),or=(e,t)=>{if(!e.step)throw new D;return{kind:`Defn`,definition:{kind:`Operator`,name:Ut(e.step),body:t,location:e.location},whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:e.location}},sr=(e,t,n)=>{let r=Qn(n.step)?`Visible`:`Hidden`,i=t.context.map(e=>e.kind===`Fact`?{...e,visibility:r}:e),a=I({kind:`List`,bullet:`Refs`,items:ar(2,t)},n);return{context:[...e,...i,{kind:`Fact`,expression:er(n),visibility:`Hidden`,location:n.location},or(n,a),{kind:`Fact`,expression:I({kind:`Ix`,index:1},n),visibility:`Hidden`,location:n.location}],active:R(3,t.active)}},cr=(e,t,n,r,i)=>{let a=e||Qn(i.step)?`Visible`:`Hidden`;return{context:[...t,or(i,I(Je(r),i)),{kind:`Fact`,expression:I({kind:`Ix`,index:1},i),visibility:a,location:i.location}],active:R(2,n)}},lr=(e,t,n)=>{if(n.kind!==`Dx`)throw new C(`Unknown definition ${n.name}`);let r=t.length-n.index,i=t[r];if(!i)return t;if(i.kind!==`Defn`)throw new C(`Indicated point is not a definition`);return t.map((t,n)=>n===r?{...i,visibility:e}:t)},ur=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Mem`&&e.args[0]?.kind===`Ix`&&e.args[0].index===0&&z(t,e.args[1]),dr=(e,t,n,r)=>{let i=!1,a=n,o=[...r];for(let e=r.length-1;e>=0;e--){a=R(-1,a);let n=r[e];n.kind===`Fact`&&z(n.expression,a)?(i=!0,o[e]={...n,visibility:t}):n.kind===`Fresh`&&n.domain&&ur(a,n.domain)&&(i=!0,o[e]={...n,domainVisibility:t})}if(!i){let t=`This expression does not appear in the context and cannot be hidden.`;throw e(P(n.location,`${t}\n`)),new C(t,{failure:`proof.Gen.set_expr`})}return o},fr=(e,t)=>{let n=st(F(1),t)[1];return n[0].domain.kind===`Ditto`&&e.domain.kind===`Domain`?[{...n[0],domain:{kind:`Domain`,expression:R(1,e.domain.expression)}},...n.slice(1)]:n},pr=(e,t)=>{if(e.isSuppressed||t.length===0)return{kind:`Obvious`,...Zn(e)};let n=t.map((e,t)=>{let n=R(2*t+2,e);return{kind:`Assert`,sequent:{context:[],active:n},proof:{kind:`By`,usable:{facts:[R(3,n)],defs:[]},isOnly:!1,location:e.location},location:e.location}}),r={kind:`By`,usable:{facts:[I({kind:`Ix`,index:2*t.length+2},e),...t.map((n,r)=>I({kind:`Ix`,index:2*(t.length-r)},e))],defs:[]},isOnly:!0,...Zn(e)};return{kind:`Steps`,steps:n,qed:{proof:r,location:r.location},...Zn(e)}},mr=(e,t,n)=>({sequent:e,location:t.location,kind:n}),hr={total:0,absent:[],omitted:[]},gr=(e,t)=>({total:e.total+t.total,absent:[...e.absent,...t.absent],omitted:[...e.omitted,...t.omitted]}),_r=e=>{switch(e.kind){case`Use`:return{...hr,total:e.obligations?.length??0};case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return vr(e.proof);default:return hr}},vr=e=>e.kind===`Steps`?[...e.steps.map(_r),vr(e.qed.proof)].reduce(gr):e.kind!==`Omitted`||!e.obligations||!e.location?{...hr,total:e.obligations?.length??0}:{total:e.obligations.length,absent:e.omission===`Implicit`?[e.location]:[],omitted:e.omission===`Explicit`?[e.location]:[]},yr=(e,t)=>e.kind===`At`&&!e.isExcept?I(ot(t),e):wt(e,e=>yr(e,t)),br=(e,t,n,r)=>{let i=(e,r)=>{let o=r.location;if(!o||!t.has(o.file)||o.endLine<n.start||o.startLine>n.end)return r;switch(r.kind){case`Obvious`:return{...r,obligations:[mr(e,r,{kind:`Main`})]};case`Omitted`:return{...r,obligations:[mr(e,r,{kind:`Omitted`,omission:r.omission})]};case`Error`:return{...r,obligations:[mr(e,r,{kind:`Error`,message:r.message})]};case`By`:throw new C(`Proof.Gen.generate`);case`Steps`:{let[t,n]=et(e,r.steps,a),o=i(t,r.qed.proof);return{...r,steps:n,qed:{...r.qed,proof:o}}}}},a=(e,t)=>{switch(t.kind){case`Forget`:{let n=e.context.length,r=e.context.map((e,r)=>e.kind===`Fact`&&e.visibility===`Visible`&&t.count+r<n?{...e,visibility:`Hidden`}:e);return[{...e,context:r},t]}case`Use`:{let n=t.usable;if(n.defs.length===0&&n.facts.length===1){let r=n.facts[0],i=mr({...e,active:r},t,{kind:`Support`});return[{context:[...e.context,{kind:`Fact`,expression:r,visibility:`Visible`,location:r.location}],active:R(1,e.active)},{...t,obligations:[i]}]}if(n.facts.length>0)throw new C(`Proof.Gen.gen_step: USE with facts and definitions`);let r=n.defs.reduce((e,t)=>lr(`Visible`,e,t),e.context);return[{...e,context:r},t]}case`Hide`:{let n=t.usable.defs.reduce((e,t)=>lr(`Hidden`,e,t),e.context),i=t.usable.facts.reduceRight((e,t)=>dr(r,`Hidden`,t,e),n);return[{...e,context:i},t]}case`Define`:return[{context:[...e.context,...t.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0,location:e.location}))],active:R(t.definitions.length,e.active)},t];case`Assert`:{let n=i(sr(e.context,t.sequent,t),t.proof),r={...t,proof:n};return[cr(!1,e.context,e.active,t.sequent,r),r]}case`Suffices`:{let n=i(cr(!0,e.context,e.active,t.sequent,t),t.proof),r={...t,proof:n};return[sr(e.context,t.sequent,r),r]}default:throw new C(`Proof.Gen.gen_step`)}},o=(e,t,n,r)=>{let i={kind:`Unnamed`,level:0,id:0},[o,s]=a({context:e,active:{...Xn,location:r}},t===`Use`?{kind:`Use`,usable:n,isOnly:!1,location:r,step:i}:{kind:`Hide`,usable:n,location:r,step:i});return[o.context,s.obligations??[]]},s=(e,t,n,r)=>{if(n.defs.length===0&&n.facts.length===0)return[e,[]];let i=n.defs.length>0,[a,...c]=n.facts,[l,u]=o(e,t,i?{defs:n.defs,facts:[]}:{defs:[],facts:[a]},r),d=i?n.facts:c.map(e=>R(1,e)),[f,p]=s(l,t,{defs:[],facts:d},r);return[f,[...u,...p]]},c=e=>{let t=[],n=e=>{e.kind===`Steps`?(n(e.qed.proof),e.steps.forEach(r)):e.obligations&&!e.isSuppressed&&t.push(...e.obligations)},r=e=>{e.kind===`Use`&&e.obligations&&!e.isSuppressed&&t.push(...e.obligations),(e.kind===`Assert`||e.kind===`Suffices`||e.kind===`Pcase`||e.kind===`Pick`)&&n(e.proof)};return n(e),t},l=t=>({kind:`Named`,level:t,label:`_a${Wt(e)}`,isAnonymous:!0}),u=(e,t)=>t?.kind===`Named`?{...t,level:e}:l(e),d=(e,t)=>{let n={...t,step:u(e,t.step)};if(n.kind!==`Steps`)return n;let r=n.steps.map(t=>f(e,t));return{...n,steps:r,qed:{...n.qed,proof:d(e+1,n.qed.proof)}}},f=(e,t)=>{let n={...t,step:u(e,t.step)};switch(n.kind){case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return{...n,proof:d(e+1,n.proof)};default:return n}},p=(e,t)=>{let n=t.kind===`Apply`?t.operator:t;if(n.kind===`Ix`){let r=e[e.length-n.index];if(!r)throw new C(`expose_connective`);if(r.kind!==`Defn`||r.definition.kind!==`Operator`)return t;let i=R(n.index,r.definition.body);if(t.kind!==`Apply`)return p(e,i);let a={...i,location:t.location};return p(e,I(at(a,t.args),a))}if(t.kind===`Apply`&&t.operator.kind===`Internal`&&t.operator.builtin===`Prime`){let n=p(e,t.args[0]),r=e=>qe(`Prime`,[e],e);return n.kind===`Quant`?I({kind:`Quant`,quantifier:n.quantifier,bounds:n.bounds.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:r(e.domain.expression)}}:e),body:r(n.body)},t):tr(n,`Implies`)||tr(n,`Mem`)?I({kind:`Apply`,operator:n.operator,args:[r(n.args[0]),r(n.args[1])]},t):r(n)}return t.kind===`Parens`?p(e,t.expression):t},m=e=>{if(e.kind!==`Assert`)return;let t=e.sequent.active;return t.kind===`Apply`&&t.args.length===2?t.args[1]:void 0},h=e=>{if(e.kind!==`Steps`)return e;let t=[];return e.steps.forEach(e=>{let n=t.at(-1),r=n&&m(n);if(e.kind!==`Assert`||!r){t.push(e);return}let i=yr(e.sequent.active,R(2,r));t.push({...e,sequent:{...e.sequent,active:i}})}),{...e,steps:t}},g=(e,t,n)=>{let r=h(n);switch(r.kind){case`Obvious`:case`Omitted`:case`Error`:return r;case`By`:{let e=r.usable,t=e.defs.length===0?[]:[{kind:`Use`,usable:{facts:[],defs:e.defs},isOnly:!1,location:r.location}],n=e.facts.map((e,t)=>({kind:`Use`,usable:{facts:[R(t,e)],defs:[]},isOnly:!1,location:e.location,isSuppressed:r.isSuppressed})),i=r.isOnly?[{kind:`Forget`,count:e.facts.length,location:r.location}]:[],a=$n(r.step),o=[...t,...n,...i].map(e=>({...e,step:l(a)})),s={kind:`Obvious`,location:r.location,step:l(a),isSuppressed:r.isSuppressed};return{kind:`Steps`,steps:o,qed:{proof:s,location:s.location,step:s.step},location:r.location,step:r.step,isSuppressed:r.isSuppressed}}case`Steps`:{let n=e,i=t,a=r.steps.flatMap(e=>{let[t,r,a]=_(n,i,e);return n=t,i=r,a}),o=g(n,i,r.qed.proof);return{...r,steps:a,qed:{...r.qed,proof:o}}}}},_=(e,t,n)=>{let r=$n(n.step);switch(n.kind){case`Forget`:return[e,t,[n]];case`Assert`:{let r=sr(e,n.sequent,n),i={...n,proof:g(r.context,r.active,n.proof)},a=cr(!1,e,t,n.sequent,i);return[a.context,a.active,[i]]}case`Suffices`:{let r=cr(!0,e,t,n.sequent,n),i={...n,proof:g(r.context,r.active,n.proof)},a=sr(e,n.sequent,i);return[a.context,a.active,[i]]}case`Use`:{let r={kind:`By`,usable:n.usable,isOnly:n.isOnly,location:n.location,step:n.step,isSuppressed:n.isSuppressed},i=g(e,t,r);if(i.kind!==`Steps`)throw new C(`simplifying BY does not produce a non-leaf proof!`);let a=n.usable.facts.map(()=>({kind:`Fact`,expression:Xn,visibility:`Visible`,location:n.location}));return[[...e,...a],R(n.usable.facts.length,t),i.steps]}case`Hide`:return[n.usable.defs.reduce((e,t)=>{if(t.kind!==`Dx`)throw new C(`set_vis`);let r=e.length-t.index,i=e[r];if(i?.kind!==`Defn`){let e=i?i.kind===`Fact`?`??? FACT ???`:i.name:``;throw new C(`USE DEF ${e} invalid because ${e} is not a defined operator`)}return e.map((e,t)=>t===r?{...i,visibility:`Hidden`,location:n.location}:e)},e),t,[n]];case`Define`:return[[...e,...n.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:n.location}))],R(n.definitions.length,t),[n]];case`Have`:{let i=p(e,t),a={kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location},o=tr(i,`Implies`),s={context:[a],active:o?R(1,i.args[1]):i},c=o?{kind:`By`,usable:{facts:[I({kind:`Ix`,index:2},n)],defs:[]},isOnly:!0,...Zn(n)}:{kind:`Error`,message:nr(`@.@[<v2>@[%s@ %s@]@,%a@]@.`,`Error: this HAVE step is applied to the following goal,`,`which is not an implication:`,Jn(e,t)),...Zn(n)},l=f(r,{kind:`Suffices`,sequent:s,proof:c,location:n.location,step:n.step});return _(e,t,l)}case`Take`:return _(e,t,f(r,y(e,t,n)));case`Witness`:return _(e,t,f(r,b(e,t,n)));case`Pcase`:{let i={kind:`Assert`,sequent:{context:[{kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location}],active:R(1,t)},proof:n.proof,...Zn(n)};return _(e,t,f(r,i))}case`Pick`:{let r=I({kind:`Quant`,quantifier:`Exists`,bounds:n.bounds,body:n.expression},n),i=v(n.step,`ex`),[a,o,s]=_(e,t,{kind:`Assert`,sequent:{context:[],active:r},proof:n.proof,...Zn(n),step:i}),c=R(2,r);if(c.kind!==`Quant`)throw new C(`Proof.Simplify.simplify_step/PICK`);let l=[...rr(c.bounds),{kind:`Fact`,expression:c.body,visibility:`Visible`,location:c.body.location}],[u,d,f]=_(a,o,{kind:`Suffices`,sequent:{context:l,active:R(l.length,o)},proof:{kind:`Omitted`,omission:`Elsewhere`,...Zn(n)},...Zn(n)});return[u,d,[...s,...f]]}}},v=(t,n)=>({kind:`Named`,level:$n(t),label:`${t?.kind===`Named`?t.label:`_a`}${n}${Wt(e)}`,isAnonymous:!1}),y=(e,t,n)=>{let r=ir(n.bounds),i=(t,n,r,a)=>{let o=a[0];if(!o)return{aux:n,goal:r};let s=p(e,r);if(s.kind!==`Quant`||s.quantifier!==`Forall`||s.bounds.length===0)return nr(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this TAKE step is applied to the following goal,`,`which is not a universal formula:`,Jn(e,r));let c=s.bounds[0],l=ir(s.bounds).slice(1),u=o.domain,d=c.domain;if(u.kind===`NoDomain`&&d.kind===`Domain`)return nr(`@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.`,`Error: the TAKE argument`,o.name,`does not match the pattern`,c.name,Jn(e,d.expression));if(u.kind===`Domain`&&d.kind===`NoDomain`)return nr(`@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.`,`Error: the TAKE argument`,o.name,Jn(e,u.expression),`does not match the pattern`,c.name);let f=u.kind===`Domain`&&d.kind===`Domain`&&!z(u.expression,d.expression)?[{kind:`Apply`,operator:{kind:`Internal`,builtin:`Subseteq`},args:[d.expression,u.expression]},...n]:n;if(l.length===0)return i(1,f,s.body,a.slice(1));let m=a.length===1?l.map(e=>st(F(t),[e])[1][0]):l;return i(t+1,f,I({kind:`Quant`,quantifier:`Forall`,bounds:m,body:s.body},s),a.slice(1))},a=i(1,[],t,r);if(typeof a==`string`)return{kind:`Suffices`,sequent:{context:[{kind:`Fact`,expression:er(t),visibility:`Visible`,location:n.location}],active:t},proof:{kind:`Error`,message:a,...Zn(n)},...Zn(n)};let o=a.aux.filter((e,t)=>a.aux.findIndex(t=>z(e,t))===t),s=[I({kind:`Ix`,index:2},n),...o.map(e=>R(2,e))];return{kind:`Suffices`,sequent:{context:rr(r),active:a.goal},proof:{kind:`By`,usable:{facts:s,defs:[]},isOnly:!0,...Zn(n)},...Zn(n)}},b=(e,t,n)=>{let r=[],i=``,a=t;for(let t of n.expressions){let n=p(e,a);if(n.kind!==`Quant`||n.quantifier!==`Exists`||n.bounds.length===0){i||=nr(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this WITNESS step is applied to the following goal,`,`which is not an existential formula:`,Jn(e,n)),a=n;break}let[o,...s]=n.bounds,c=s.length===0?n.body:I({kind:`Quant`,quantifier:`Exists`,bounds:fr(o,s),body:n.body},n),l=t;if(o.domain.kind===`Domain`){let n=o.domain.expression,a=p(e,t);if(tr(a,`Mem`)){let[e,t]=a.args,i=z(t,n)?[]:[qe(`Subseteq`,[t,n],t)];r.push(...i,a),l=e}else i||=nr(`@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.`,`Error: the WITNESS argument`,Jn(e,a),`does not match the pattern`,o.name,Jn(e,n)),l=a}let u=qe(`Unprimable`,[l],l);a=L(Ue(u,F(0)),c)}let o=i===``?pr(n,r):{kind:`Error`,message:i,...Zn(n)};return{kind:`Suffices`,sequent:{context:[],active:a},proof:o,...Zn(n)}};return{generate:i,collect:c,mutate:s,simplify:g}},xr=(e,t=0)=>({level:e,weights:Array.from({length:t},()=>!0),params:/* @__PURE__ */ new Set}),Sr={TRUE:[0,0],FALSE:[0,0],Implies:[0,2],Equiv:[0,2],Conj:[0,2],Disj:[0,2],Neg:[0,1],Eq:[0,2],Neq:[0,2],STRING:[0,0],BOOLEAN:[0,0],SUBSET:[0,1],UNION:[0,1],DOMAIN:[0,1],Subseteq:[0,2],Mem:[0,2],Notmem:[0,2],Setminus:[0,2],Cap:[0,2],Cup:[0,2],Actplus:[3,2],BoxTrue:[3,1],BoxFalse:[3,1],Diamond:[3,1],Prime:[2,1],StrongPrime:[2,1],ENABLED:[1,1],UNCHANGED:[2,1],Leadsto:[3,2],Cdot:[2,2],Nat:[0,0],Int:[0,0],Real:[0,0],Infinity:[0,0],Plus:[0,2],Minus:[0,2],Times:[0,2],Ratio:[0,2],Quotient:[0,2],Remainder:[0,2],Exp:[0,2],Divides:[0,2],Lteq:[0,2],Lt:[0,2],Gteq:[0,2],Gt:[0,2],Range:[0,2],Uminus:[0,1],Seq:[0,1],Len:[0,1],BSeq:[0,2],Cat:[0,2],Append:[0,2],Head:[0,1],Tail:[0,1],SubSeq:[0,3],SelectSeq:[0,2],OneArg:[0,2],Extend:[0,2],Print:[0,2],PrintT:[0,1],Assert:[0,2],JavaTime:[0,0],TLCGet:[0,1],TLCSet:[0,2],Permutations:[0,1],SortSeq:[0,2],RandomElement:[0,1],Any:[0,0],ToString:[0,1],Unprimable:[0,1]},Cr={Constant:0,State:1,Action:2,Temporal:3,Unknown:0},wr=e=>new Set(e.flatMap(e=>[...e])),Tr=e=>({level:Math.max(0,...e.map(e=>e.level)),weights:[],params:wr(e.map(e=>e.params))}),Er=/* @__PURE__ */ new WeakMap,Dr=e=>{let t=e.hyp;switch(t.kind){case`Flex`:return xr(1);case`Fresh`:return{...xr(Cr[t.level],t.shape),params:/* @__PURE__ */ new Set([t.name])};case`Defn`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new D;return jr(e.rest,n.body)}case`Fact`:return jr(e.rest,t.expression)}},Or=e=>{let t=Er.get(e);if(t)return t;let n=Dr(e);return Er.set(e,n),n},kr=(e,t,n)=>{let r=t.flatMap(t=>t.domain.kind===`Domain`?[jr(e,t.domain.expression)]:[]),i=t.reduce((e,t)=>Ye(e,tt(t.name,t.level)),e);return Tr([jr(i,n),...r])},Ar=(e,t)=>{if(e.weights.length!==t.length)throw new C(`Invalid number of arguments`);let n=t.filter((t,n)=>e.weights[n]);return{level:Math.max(e.level,...n.map(e=>e.level)),weights:[],params:wr([e.params,...n.map(e=>e.params)])}},jr=(e,t)=>{let n=t=>jr(e,t);switch(t.kind){case`Ix`:{let n=$e(e,t.index-1);if(!n)throw new D;return Or(n)}case`Internal`:{let e=Sr[t.builtin];if(!e)throw new D;return xr(e[0],e[1])}case`Opaque`:case`String`:case`Num`:return xr(0);case`Lambda`:{let n=t.params.reduce((e,t)=>Ye(e,tt(t.name,`Unknown`,t.shape)),e),r=jr(n,t.body),i=new Set(t.params.map(e=>e.name));return{level:r.level,weights:t.params.map(e=>r.params.has(e.name)),params:new Set([...r.params].filter(e=>!i.has(e)))}}case`Apply`:{let e=t.operator;if(e.kind===`Opaque`)return Ar(xr(0,t.args.length),t.args.map(n));if(e.kind===`Internal`&&t.args.length===1){let r=t.args[0];switch(e.builtin){case`Prime`:case`StrongPrime`:if(n(r).level>1)throw new D;return xr(2,1);case`ENABLED`:{let e=n(r);if(e.level>2)throw new D;return{level:1,weights:[],params:e.params}}case`UNCHANGED`:{let e=n(r);if(e.level>1)throw new D;return{level:2,weights:[],params:e.params}}}}return e.kind===`Internal`&&e.builtin===`Cdot`?(t.args.forEach(n),xr(2)):e.kind===`Internal`&&e.builtin===`Leadsto`?(t.args.forEach(n),xr(3,2)):Ar(n(e),t.args.map(n))}case`Sequent`:{let[n,r]=et(e,t.sequent.context,(e,t)=>{let n=Ye(e,t);return[n,Or(n).level]});return xr(Math.max(0,...r,jr(n,t.sequent.active).level))}case`With`:case`Dot`:case`Parens`:return n(t.expression);case`Let`:{let n=t.definitions.reduce((e,t)=>Ye(e,{kind:`Defn`,definition:t,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),e);return jr(n,t.body)}case`If`:return Tr([t.condition,t.consequent,t.alternative].map(n));case`List`:return Tr(t.items.map(n));case`Quant`:case`Fcn`:return kr(e,t.bounds,t.body);case`SetOf`:return kr(e,t.bounds,t.element);case`Tquant`:return jr(t.names.reduce((e,t)=>Ye(e,{kind:`Flex`,name:t}),e),t.body),xr(3);case`Choose`:case`SetSt`:{let r=t.domain&&n(t.domain),i=t.domain?nt(t.name,t.domain):tt(t.name,`Constant`);return Tr([jr(Ye(e,i),t.body),...r?[r]:[]])}case`SetEnum`:case`Tuple`:return Tr(t.elements.map(n));case`Product`:return Tr(t.factors.map(n));case`FcnApp`:return Tr([t.function,...t.args].map(n));case`Arrow`:return Tr([n(t.domain),n(t.range)]);case`Rect`:case`Record`:return Tr(t.fields.map(e=>n(e.value)));case`Except`:return Tr([n(t.function),...t.specs.flatMap(e=>[...e.trail.flatMap(e=>e.kind===`Apply`?[n(e.expression)]:[]),n(e.value)])]);case`Sub`:return{...Tr([n(t.action),n(t.subscript)]),level:2};case`Tsub`:case`Fair`:return n(t.action),n(t.subscript),xr(3);case`Case`:return Tr([...t.arms.flatMap(e=>[n(e.condition),n(e.body)]),...t.other?[n(t.other)]:[]]);case`Bang`:case`At`:throw new D}},Mr=(e,t)=>{let n=$e(e,t-1)?.hyp;if(!n)throw new D;return n},Nr=e=>e.kind===`Internal`&&(e.builtin===`ENABLED`||e.builtin===`Cdot`),Pr=e=>e.kind===`Apply`&&e.args.length===1&&e.args[0].kind===`Lambda`&&(Nr(e.operator)||e.operator.kind===`Opaque`&&(e.operator.name===`EnabledWrapper`||e.operator.name===`CdotWrapper`)),Fr=e=>e===void 0?2:Math.min(2,e),Ir=e=>e===void 0?void 0:Math.max(1,e-1),Lr=(e,t,n,r)=>{let i=(n,i=r)=>Lr(e,t,n,i);if(Pr(n))return n;if(n.kind===`Sub`)return{...n,action:i(n.action),subscript:i(n.subscript,Ir(r))};if(n.kind===`Apply`&&n.operator.kind===`Internal`){let e=n.operator.builtin,[t,a]=n.args;if(e===`Cdot`&&n.args.length===2)return{...n,args:[i(t,Fr(r)),i(a,1)]};if(e===`ENABLED`&&n.args.length===1)return{...n,args:[i(t,Fr(r))]};if((e===`Prime`||e===`UNCHANGED`)&&n.args.length===1)return{...n,args:[i(t,Ir(r))]}}let a=n.kind===`Apply`&&n.operator.kind===`Ix`?n.operator:n;if(a.kind!==`Ix`)return Ct(t,n,(t,n)=>Lr(e,t,n,r),Ye);if(r===void 0)return n;let o=jr(t,n).level,s=Mr(t,a.index),c=e=>`The operator \`${e}\` is declared at:\n${s.location?Be(s.location):`<unknown location>`}`;if(s.kind===`Fresh`&&s.level===`Unknown`)throw e(P(n.location,`Declared operator \`${s.name}\` has unknown level and occurs within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}.\nIf a constant operator is substituted for this operator, then the expression that results from applying this declared operator has expression level ${o}.\n May need expansion. A declared operator cannot be expanded.\n${c(s.name)}\n and has arity: ${s.shape}`)),new D(`File "src/expr/e_action.ml", line 367, characters 20-26: Assertion failed`);if(o<r)return n;if(o>2||s.kind===`Fact`)throw new D;if(s.kind===`Flex`){if(n.kind!==`Ix`)throw new D;return n}if(s.kind===`Fresh`){let t=`The expression that results from applying the declared operator \`${s.name}\` has expression level ${o} within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}. A declared operator cannot be expanded.\n${c(s.name)}\n and has level: ${Cr[s.level]}\n and arity: ${s.shape}`;throw e(P(n.location,t)),new C(t)}let l=s.definition;if(l.kind!==`Operator`&&l.kind!==`Bpragma`)throw new D;e({text:`${Ve(n.location)}[INFO]: Auto-expanding the definition of operator: ${l.name}\n`,channel:`stdout`});let u=L(F(a.index),l.body);return i(ot(n.kind===`Apply`?at(u,n.args):u))},Rr=e=>qe(`Eq`,[qe(`Prime`,[e],e),e],e),zr=e=>{let t=e=>e.kind===`Tuple`?e.elements.flatMap(t):[e],n=t(e);return n.length===0?I({kind:`Internal`,builtin:`TRUE`},e):n.length===1?Rr(n[0]):I({kind:`List`,bullet:`And`,items:n.map(Rr)},e)},Br=e=>{if(e.kind===`Apply`&&e.args.length===1)return zr(e.args[0]);if(e.kind!==`Sub`)throw new D;let t=zr(e.subscript),n=e.modal===`Box`?t:qe(`Neg`,[t],e);return qe(e.modal===`Box`?`Disj`:`Conj`,[e.action,n],e)},Vr=e=>{let t=(e,t)=>e<<t|e>>>32-t,n=(e,n)=>{let r=Math.imul(t(Math.imul(n,3432918353),15),461845907);return Math.imul(t(e^r,13),5)+3864292196|0},r=new TextEncoder().encode(e),i=r.length-r.length%4,a=0;for(let e=0;e<i;e+=4)a=n(a,r[e]|r[e+1]<<8|r[e+2]<<16|r[e+3]<<24);let o=r.subarray(i).reduceRight((e,t)=>e<<8|t,0);return r.length>i&&(a=n(a,o)),a^=r.length,a=Math.imul(a^a>>>16,2246822507),a=Math.imul(a^a>>>13,3266489909),(a^a>>>16)&1073741823},Hr=e=>{let t=Array.from({length:16},()=>[]);return e.forEach((e,n)=>{if(t[Vr(e)&t.length-1].unshift(e),n+1<=t.length*2)return;let r=Array.from({length:t.length*2},()=>[]);t.flat().forEach(e=>r[Vr(e)&r.length-1].push(e)),t=r}),t.flat()},Ur=(e,t,n,r,i)=>{let a=i=>Ur(e,t,n,r,i),o=t!==void 0||n!==void 0,s=(a,o)=>{let s={names:[],depth:Math.max(t?.depth??0,n?.depth??0)+1},[c,l]=o,u=[Ur(e,t,s,r,c),...l?[Ur(e,s,n,r,l)]:[]],d=s.names.length===0?[`r#0`]:Hr(s.names);return I({kind:`Apply`,operator:a,args:[{kind:`Lambda`,params:[`_`,...d].map(e=>({name:e,shape:0})),body:u.length===1?u[0]:{kind:`List`,bullet:`And`,items:u}}]},i)};if(Pr(i))return i;if(i.kind===`Apply`&&i.operator.kind===`Internal`){let t=i.operator.builtin;if(t===`ENABLED`&&i.args.length===1||t===`Cdot`&&i.args.length===2)return s(i.operator,i.args);if(t===`Prime`&&i.args.length===1){let t=Ur(e,n,void 0,r,i.args[0]);return n?t:{...i,args:[t]}}if(t===`UNCHANGED`&&o)return a(Br(i))}if(i.kind===`Sub`&&o)return a(Br(i));if(i.kind===`Ix`){if(!t)return i;let e=Mr(r,i.index);if(e.kind===`Fact`)throw new D;if(e.kind!==`Flex`)return i;let n=`${e.name}#enabled#prime${t.depth}`;return t.names.includes(n)||t.names.push(n),I({kind:`Opaque`,name:n},i)}if(i.kind===`Apply`&&i.operator.kind===`Opaque`)throw e(P(i.location,`Named operator \`${i.operator.name}\` unexpected after anonymization.`)),new D(`File "src/expr/e_action.ml", line 1048, characters 12-18: Assertion failed`);return Ct(r,i,(r,i)=>Ur(e,t,n,r,i),Ye)},Wr=(e,t)=>{if(t.kind===`Apply`&&Nr(t.operator)){let[n]=t.args;if(t.args.length!==1||n.kind!==`Lambda`)throw new D;let[r,...i]=n.params;if(r.name!==`_`)return t;let a=Wr({kind:`Compose`,outer:e,inner:F(i.length)},n.body);return{kind:`Apply`,operator:t.operator,args:[{kind:`Lambda`,params:i,body:a}]}}return t.kind===`Ix`?L(e,t):t.kind===`Apply`?I(at(Wr(e,t.operator),t.args.map(t=>Wr(e,t))),t):Ct(e,t,Wr,e=>Ge(1,e))},Gr=e=>{if(e.kind===`Apply`&&Nr(e.operator)){let[t]=e.args;if(e.args.length!==1||t.kind!==`Lambda`||t.params[0].name===`_`)throw new D;let n=e.operator.builtin===`Cdot`?`CdotWrapper`:`EnabledWrapper`;return{kind:`Apply`,operator:I({kind:`Opaque`,name:n},e.operator),args:[{kind:`Lambda`,params:t.params.map((e,t)=>({name:`r#${t}`,shape:0})),body:Gr(t.body)}]}}return Ct(void 0,e,(e,t)=>Gr(t),()=>void 0)},Kr=e=>{if(e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Cdot`&&e.args.length===1&&e.args[0].kind!==`Lambda`)throw new D;return Ct(void 0,e,(e,t)=>Kr(t),()=>void 0)},qr=(e,t,n,r)=>{let i=Lr(t,n,r,void 0),a=Wr(F(0),Ur(t,void 0,void 0,n,i));return Kr(Gr(e.expr(n,a)))},Jr=(e,t)=>({kind:`Definition`,definition:{kind:`Operator`,name:e,body:{kind:`Internal`,builtin:t}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),U=(e,t,n)=>({kind:`Definition`,definition:{kind:`Operator`,name:t,body:{kind:`Lambda`,params:Array.from({length:e},(e,t)=>({name:`x${t+1}`,shape:0})),body:{kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n}))}}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),Yr=[Jr(`Nat`,`Nat`),U(2,`+`,`Plus`),U(2,`-`,`Minus`),U(2,`*`,`Times`),U(2,`^`,`Exp`),U(2,`<`,`Lt`),U(2,`>`,`Gt`),U(2,`=<`,`Lteq`),U(2,`>=`,`Gteq`),U(2,`%`,`Remainder`),U(2,`\\div`,`Quotient`),U(2,`..`,`Range`)],Xr=[...Yr,Jr(`Int`,`Int`),U(1,`-.`,`Uminus`)],Zr=[...Xr,Jr(`Real`,`Real`),U(2,`/`,`Ratio`),Jr(`Infinity`,`Infinity`)],Qr=[U(1,`Seq`,`Seq`),U(1,`Len`,`Len`),U(2,`BSeq`,`BSeq`),U(2,`\\o`,`Cat`),U(2,`Append`,`Append`),U(1,`Head`,`Head`),U(1,`Tail`,`Tail`),U(3,`SubSeq`,`SubSeq`),U(2,`SelectSeq`,`SelectSeq`)],$r=[U(2,`Print`,`Print`),U(1,`PrintT`,`PrintT`),U(2,`Assert`,`Assert`),Jr(`JavaTime`,`JavaTime`),U(1,`TLCGet`,`TLCGet`),U(2,`TLCSet`,`TLCSet`),U(2,`:>`,`OneArg`),U(2,`@@`,`Extend`),U(1,`Permutations`,`Permutations`),U(2,`SortSeq`,`SortSeq`),U(1,`RandomElement`,`RandomElement`),Jr(`Any`,`Any`),U(1,`ToString`,`ToString`)],ei=(e,t)=>({name:e,extendees:[],body:t,isImportant:!1,isStandard:!0}),ti=new Map([ei(`Naturals`,Yr),ei(`Integers`,Xr),ei(`Reals`,Zr),ei(`Sequences`,Qr),ei(`TLC`,$r)].map(e=>[e.name,e])),ni=e=>{let t=e.location;switch(e.kind){case`Constants`:return e.declarations.map(e=>({kind:`Fresh`,name:e.name,shape:e.shape,level:`Constant`,domain:void 0,domainVisibility:`Visible`,location:t}));case`Recursives`:return e.declarations.map(e=>({kind:`Defn`,definition:{kind:`Recursive`,name:e.name,shape:e.shape,location:t},whereDefined:`User`,visibility:`Hidden`,isLocal:!1,location:t}));case`Variables`:return e.names.map(e=>({kind:`Flex`,name:e,location:t}));case`Definition`:return[{kind:`Defn`,definition:e.definition,whereDefined:e.whereDefined,visibility:e.visibility,isLocal:e.isLocal,location:t}];case`Axiom`:return e.name===void 0?[{kind:`Fact`,expression:e.expression,visibility:`Hidden`,location:t}]:ii(e.name,e.expression,t);case`Theorem`:{let n=ut(F(-e.axiomCount),{...e.sequent,context:e.sequent.context.slice(e.axiomCount)}),r=I(Je(n),e);return e.name===void 0?[{kind:`Fact`,expression:r,visibility:`Hidden`,location:t}]:ii(e.name,r,t)}case`Mutate`:return e.mode===`Use`?e.usable.facts.map((e,n)=>({kind:`Fact`,expression:R(n,e),visibility:`Visible`,location:t})):[];case`Submod`:case`Anoninst`:return[]}},ri=e=>e.kind===`Axiom`||e.kind===`Theorem`?e.name===void 0?1:2:ni(e).length,ii=(e,t,n)=>[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:t,location:n},whereDefined:`User`,visibility:`Visible`,isLocal:!1,location:n},{kind:`Fact`,expression:{kind:`Ix`,index:1,location:n},visibility:`Hidden`,location:n}],ai=e=>e.body.flatMap(e=>{switch(e.kind){case`Definition`:return[{...e,whereDefined:e.isLocal?`Builtin`:e.whereDefined}];case`Mutate`:return[];case`Theorem`:return[{...e,proof:{kind:`Omitted`,omission:`Elsewhere`,location:e.location}}];case`Submod`:return[{...e,module:{...e.module,body:ai(e.module)}}];default:return[e]}}),oi=(e,t,n,r=/* @__PURE__ */ new Set([t.name]))=>{let i=[];for(let a of t.extendees){if(n.has(a))continue;if(r.has(a))throw new D(`Stack overflow`);let t=e.get(a);if(!t)throw new C(`Module "${a}" unknown`);i.push(...ai(oi(e,t,n,/* @__PURE__ */ new Set([...r,a])))),n.add(a)}return{...t,body:[...i,...t.body].map(t=>t.kind===`Submod`?{...t,module:oi(e,t.module,/* @__PURE__ */ new Set)}:t)}},si=e=>{let t=/* @__PURE__ */ new Map,n=(e,n)=>{t.has(e)||t.set(e,n)},r=e=>e.extendees.forEach((t,r)=>n(t,e.extendeeLocations?.[r])),i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o=e=>{typeof e==`object`&&e&&(`instance`in e&&ci(e.instance)&&n(e.instance.module,e.instance.location),Object.values(e).forEach(o))},s=e=>{e.kind===`Theorem`?o(e.sequent):e.kind!==`Submod`&&o(e),e.kind===`Submod`&&(i.add(e.module.name),a.set(e.module.name,e.module),r(e.module),e.module.body.forEach(s))};return e.body.forEach(s),i.forEach(e=>t.delete(e)),r(e),{dependencies:[...t.keys()].sort(li),locations:t,submodules:a}},ci=e=>typeof e==`object`&&!!e&&`module`in e&&typeof e.module==`string`&&`substitutions`in e,li=(e,t)=>e<t?-1:+(e>t),ui=(e,t)=>({facts:it(e,t.facts),defs:t.defs.map(t=>{if(t.kind===`Dvar`)return t;let n=L(e,{kind:`Ix`,index:t.index});if(n.kind!==`Ix`)throw new C(`substitution produced bad definition`);return{...t,index:n.index}})}),di=(e,t)=>{switch(t.kind){case`Constants`:case`Recursives`:return[Ge(t.declarations.length,e),t];case`Variables`:return[Ge(t.names.length,e),t];case`Definition`:return[Ge(1,e),{...t,definition:ct(e,t.definition)}];case`Axiom`:return[Ge(ri(t),e),{...t,expression:L(e,t.expression)}];case`Theorem`:return[Ge(ri(t),e),{...t,sequent:ut(e,t.sequent)}];case`Submod`:return[e,{...t,module:{...t.module,body:fi(e,t.module.body)}}];case`Mutate`:return[t.mode===`Hide`?e:Ge(t.usable.facts.length,e),{...t,usable:ui(e,t.usable)}];case`Anoninst`:return[e,{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(t=>({name:t.name,expression:L(e,t.expression)}))}}]}},fi=(e,t)=>et(e,t,di)[1],pi=(e,t,n,r)=>{try{let n=qr(e.anonymizer,e.onWarning,t,{kind:`Sequent`,sequent:r});if(n.kind!==`Sequent`)throw new D;return n.sequent}catch(t){if(!(t instanceof C)||t.failure===void 0)throw t;let i=r.active.location,a=`${t.failure}\nCould not instantiate the theorem ${n===void 0?``:`named: ${n}, `}at: ${i?Be(i):`<unknown location>`}`;return e.onWarning({text:`${Ve(i)}[ERROR]${a}`,channel:`stdout`}),e.onWarning({text:a,channel:`toolboxOnly`}),{context:[],active:I({kind:`Internal`,builtin:`TRUE`},r.active)}}},mi=(e,t,n)=>{if(n.kind===`Theorem`)return{...n,sequent:pi(e,t,n.name,n.sequent)};if(n.kind!==`Definition`)return n;let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)return n;let i=qr(e.anonymizer,e.onWarning,t,r.body);return{...n,definition:{...r,body:i}}},hi=(e,t,n)=>et(t,n,(t,n)=>{if(n.kind===`Submod`){let[r,i]=hi(e,t,n.module.body);return[r,{...n,module:{...n.module,body:i}}]}let r=mi(e,t,n);return[Xe(t,ni(r)),r]}),gi=(e,t)=>{let n=[],r=0,i=e;for(;i.length>0;){let[e,...a]=i,o=e.kind===`Constants`?{name:e.declarations[0].name,remaining:{...e,declarations:e.declarations.slice(1)}}:e.kind===`Variables`?{name:e.names[0],remaining:{...e,names:e.names.slice(1)}}:void 0;if(o){let e=t.get(o.name);if(!e)throw new C(`Parameter ${o.name} has no substitute`);let n=ri(o.remaining)===0;i=fi(Ue(R(r,e),F(0)),n?a:[o.remaining,...a])}else n.push(e),r+=ri(e),i=a}return n},_i=(e,t,n)=>{let r=Array.from({length:t},(e,r)=>I({kind:`Ix`,index:t-r},{location:n})),i=Array.from({length:t},(e,t)=>I({kind:`Ix`,index:t+1},{location:n})),a=Array.from({length:e},(e,i)=>{let a=I({kind:`Ix`,index:i+t+1},{location:n});return t>0?I({kind:`Apply`,operator:a,args:r},{location:n}):a});return We([...a,...i].reverse(),F(e+t))},vi=(e,t)=>{let n=t.map(e=>({name:e,shape:0}));return e.kind===`Lambda`?{...e,params:[...n,...e.params]}:t.length===0?e:I({kind:`Lambda`,params:n,body:e},e)},yi=(e,t,n,r,i,a)=>{let o=e=>n===``?e:`${n}!${e}`,s=r.args.length,c=[],l=0,u=t,d=s===0,f=t=>{d||(d=!0,e.onWarning({text:t,channel:`stderr`}))};for(;u.length>0;){let[t,...n]=u;u=n;let d=e=>vi(L(_i(l,s,a),e),r.args);switch(t.kind){case`Definition`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new C(`Module.Elab.localize`);let r=t.isLocal?`${n.name}$${Wt(e.salts)}`:n.name;c.push({...t,definition:{...n,name:o(r),body:d(n.body)},whereDefined:t.isLocal?`Builtin`:t.whereDefined,isLocal:t.isLocal||i}),l+=1;continue}case`Axiom`:{f(`${He(a)}Instancing produces parametric axioms.\nSuch axioms will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e={...t,name:t.name===void 0?void 0:o(t.name),expression:d(t.expression)};c.push(e),l+=ri(e);continue}case`Theorem`:{f(`${Ve(a)}Warning: Instancing produces parametric theorems.\nSuch theorems will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e=d(I(Je(t.sequent),t));c.push({...t,name:t.name===void 0?void 0:o(t.name),sequent:e.kind===`Sequent`?e.sequent:{context:[],active:e},proof:{kind:`Omitted`,omission:`Elsewhere`,location:t.location}}),l+=1;continue}case`Mutate`:t.mode===`Use`&&(u=fi(F(-t.usable.facts.length),u));continue;case`Submod`:continue;default:throw new C(`Module.Elab.localize`)}}return c},bi=e=>{let t=[],n=e;for(;n.length>0;){let[e,...r]=n;if(e.kind!==`Axiom`){t.push(e),n=r;continue}let i=e.location;e.name!==void 0&&t.push({kind:`Definition`,definition:{kind:`Operator`,name:e.name,body:e.expression,location:i},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:i});let a={kind:`Fact`,expression:e.name===void 0?R(1,e.expression):I({kind:`Ix`,index:2},e),visibility:`Visible`,location:i},o=0,s=r.map(e=>{let t=o;if(o+=ri(e),e.kind!==`Theorem`)return e;let n=ut(F(1),e.sequent);return{...e,sequent:{...n,context:[lt(F(t),a),...n.context]},axiomCount:e.axiomCount+1}});n=fi(F(-1),s)}return t},xi=e=>new Set(e.body.flatMap(e=>e.kind===`Constants`?e.declarations.map(e=>e.name):e.kind===`Variables`?e.names:[])),Si=(e,t,n,r,i,a,o)=>{let s=t.get(r.module);if(!s)throw new C(`Module "${r.module}" unknown`);let c=xi(s);for(let e of r.substitutions)if(!c.has(e.name))throw new C(`Parameter ${e.name} occurs in the statement \`INSTANCE ${r.module} WITH\`, and is not declared in the module ${r.module}`);let l=Xe(n,r.args.map(e=>tt(e,`Unknown`))),u=new Map(r.substitutions.map(e=>[e.name,e.expression]));for(let e of[...c].sort(li))if(!u.has(e)){if(!Qe(l,e))throw new C(`Required parameter ${e} for module ${r.module} could not be inferred.`);u.set(e,I({kind:`Opaque`,name:e},{location:o}))}let d=new Map([...u].map(([t,n])=>[t,e.anonymizer.expr(l,n)])),f=fi(F((l?.size??0)-(s.depth??0)),s.body.map(e=>e.kind===`Theorem`?{...e,proof:{kind:`Omitted`,omission:`Implicit`,location:e.proof.location}}:e)),[,p]=hi(e,l,f);return bi(yi(e,gi(p,d),a,r,i,o))},Ci=(e,t,n)=>e===void 0?{hyps:[],sequent:t}:{hyps:[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:I(Je(t),{location:n}),location:n},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:n}],sequent:ut(F(1),t)},wi=(e,t,n)=>{let r=n.instance.module;if(!e.latestModules.has(r))throw e.onWarning({text:`${He(n.instance.location)}Module ${JSON.stringify(r)} unknown\n`,channel:`toolbox`}),new C(`Module ${JSON.stringify(r)} unknown`,{failure:`Module.Elab.anon#defns`});let i=Si(e,e.latestModules,t,n.instance,!0,n.name,n.location),a=[],o=i;for(;o.length>0;){let[e,...t]=o;e.kind===`Definition`?(a.push(e.definition),o=t):o=fi(F(-ri(e)),t)}return a},Ti=(e,t,n,r)=>{let i=[],a=n,o=e=>{i.push(e),a=Xe(a,ni(e))},s=e=>e!==void 0&&Qe(a,e)!==void 0,c=r.body.map(e=>({unit:e,isAnonymized:!1}));for(let n=0;n<c.length;n++){let i=c[n].unit,l=(r,o,s)=>{let l=Si(e,t,a,r,o,s,i.location);c.splice(n+1,0,...l.map(e=>({unit:e,isAnonymized:!0})))};switch(i.kind){case`Anoninst`:l(i.instance,i.isLocal,``);continue;case`Definition`:{let t=i.definition;if(t.kind===`Instance`){l(t.instance,i.isLocal,t.name);continue}let r=t.kind===`Recursive`||c[n].isAnonymized?t:e.anonymizer.defn(a,t),s={...i,definition:r};if(t.kind===`Recursive`){o(s);continue}let u=ni(s)[0],d=Qe(a,t.name);if(d?.hyp.kind===`Defn`&&(d.hyp.definition.kind===`Recursive`||gt(lt(F(d.depth+1),d.hyp),u))){let e=c.slice(n+1),t=fi(Ue(I({kind:`Ix`,index:d.depth+1},i),F(0)),e.map(e=>e.unit));c.splice(n+1,e.length,...e.map((e,n)=>({...e,unit:t[n]})));continue}o(s);continue}case`Recursives`:case`Constants`:case`Variables`:o(i);continue;case`Axiom`:if(s(i.name))continue;e.latestModules=new Map(t),o({...i,expression:e.anonymizer.expr(a,i.expression)});continue;case`Theorem`:{let n=s(i.name),c=n?`(redundant)${i.name}`:i.name,l=n?{kind:`Obvious`,location:i.proof.location}:i.proof;e.latestModules=new Map(t);let u=e.anonymizer.sequent(a,i.sequent),d=Ci(c,u,i.location),f=Xe(Xe(a,d.hyps),d.sequent.context),p=e.anonymizer.proof(f,l),m=r.isImportant?e.generator.simplify(Ze(f),d.sequent.active,p):p;o({...i,name:c,sequent:u,proof:m});continue}case`Mutate`:e.latestModules=new Map(t),o({...i,usable:e.anonymizer.usable(a,i.usable)});continue;case`Submod`:o({...i,module:Ti(e,t,a,i.module)});continue}}let l={...r,body:i,depth:n?.size??0};return t.set(r.name,l),l},Ei=(e,t,n)=>{let r=[],i=[],a=hr,o=t;for(let t of n.body)switch(t.kind){case`Theorem`:{let n=Ci(t.name,t.sequent,t.location),s=[...o,...n.hyps],c=e.generator.generate({context:[...s,...n.sequent.context],active:n.sequent.active},t.proof);r.push(...e.generator.collect(c));let l=vr(c);i.push({...l,location:t.location}),a=gr(a,l);let u=t.name===void 0?I(Je(t.sequent),t):{kind:`Ix`,index:1,location:t.location};o=[...s,{kind:`Fact`,expression:u,visibility:`Hidden`,location:t.location}];continue}case`Submod`:{let n=Ei(e,o,t.module);r.push(...n.obligations),a=gr(a,n.summary);continue}case`Mutate`:{let[n,i]=e.generator.mutate(o,t.mode,t.usable,t.location);r.push(...i),o=n;continue}default:o=[...o,...ni(t)]}return{obligations:r,summary:{...a,theorems:i}}},Di=e=>({kind:`Opaque`,name:e}),Oi=e=>({kind:`Tuple`,elements:e.map(Di)}),ki=(e,t)=>({kind:`Apply`,operator:{kind:`Internal`,builtin:`Eq`},args:[e,t]}),Ai=e=>e.map(e=>({name:e,level:`Constant`,domain:{kind:`NoDomain`}})),ji=(e,t)=>e?.kind===`Product`&&e.factors.length===t.length?e.factors:void 0,Mi=(e,t)=>t.map((t,n)=>({kind:`Operator`,name:t,body:{kind:`FcnApp`,function:Di(e),args:[{kind:`Num`,integer:String(n+1),fraction:``}]}})),Ni=(e,t)=>e.map((e,n)=>({name:e,level:`Constant`,domain:{kind:`Domain`,expression:t[n]}})),Pi=e=>({name:e.name,level:`Constant`,domain:e.domain}),Fi=(e,t,n)=>{let r=[];return t.forEach(e=>{e.kind===`Name`&&e.domain.kind===`Ditto`?r.at(-1)?.push(e):r.push([e])}),r.reduceRight((t,n)=>{let r=n[0];if(r.kind===`Name`)return{kind:`Quant`,quantifier:e,bounds:n.flatMap(e=>e.kind===`Name`?[Pi(e)]:[]),body:t,location:t.location};let i=ji(r.domain,r.names);if(i)return{kind:`Quant`,quantifier:e,bounds:Ni(r.names,i),body:t,location:t.location};let a={kind:`Apply`,operator:{kind:`Internal`,builtin:e===`Exists`?`Mem`:`Notmem`},args:[Oi(r.names),r.domain]};return{kind:`Quant`,quantifier:e,bounds:Ai(r.names),body:{kind:`List`,bullet:e===`Exists`?`And`:`Or`,items:[a,t]},location:t.location}},n)},Ii=(e,t,n,r)=>ji(n,t)?{kind:`Let`,definitions:Mi(e,t),body:r}:{kind:`Quant`,quantifier:`Exists`,bounds:Ai(t),body:{kind:`List`,bullet:`And`,items:[ki(Di(e),Oi(t)),r]}},Li=(e,t,n)=>{let r=`choose#${e[0]}`;return{kind:`Choose`,name:r,domain:t,body:Ii(r,e,t,n)}},Ri=(e,t,n)=>{let r=`setst#${e[0]}`;return{kind:`SetSt`,name:r,domain:t,body:Ii(r,e,t,n)}},zi=(e,t,n)=>{let r=e.map(e=>{if(e.kind===`Name`)return{bounds:[Pi(e)],definitions:[]};let t=ji(e.domain,e.names);if(t&&n)return{bounds:Ni(e.names,t),definitions:[]};let r=`fcn#${e.names[0]}`,i={name:r,level:`Constant`,domain:{kind:`Domain`,expression:e.domain}};if(t)return{bounds:[i],definitions:Mi(r,e.names)};let a=`choose#${r}`;return{bounds:[i],definitions:[{kind:`Operator`,name:a,body:Li(e.names,void 0,ki(Di(r),Oi(e.names)))},...Mi(a,e.names)]}}),i=r.flatMap(e=>e.definitions);return{bounds:r.flatMap(e=>e.bounds),value:i.length===0?t:{kind:`Let`,definitions:i,body:t}}},Bi=(e,t)=>{let n=zi(t,e,!0);return{kind:`SetOf`,element:n.value,bounds:n.bounds}},Vi=(e,t)=>{let n=zi(e,t,!1);return{kind:`Fcn`,bounds:n.bounds,body:n.value}},Hi={"=>":`Implies`,"<=>":`Equiv`,"/\\":`Conj`,"\\/":`Disj`,"~":`Neg`,"=":`Eq`,"#":`Neq`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,"\\subseteq":`Subseteq`,"\\in":`Mem`,"\\notin":`Notmem`,"\\":`Setminus`,"\\cap":`Cap`,"\\cup":`Cup`,"'":`Prime`,"~>":`Leadsto`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,"\\cdot":`Cdot`,"-+->":`Actplus`,"[]":`BoxTrue`,"<>":`Diamond`,TRUE:`TRUE`,FALSE:`FALSE`,BOOLEAN:`BOOLEAN`,STRING:`STRING`},Ui=(e,t=!1)=>t&&e===`-`?`-.`:kn(e).name,Wi=/^<(\d+|\*|\+)>([A-Za-z0-9_]*)\.*$/,Gi=(e,t)=>{if(!e||!t)return e??t;let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return{file:e.file,startLine:n?e.startLine:t.startLine,startColumn:n?e.startColumn:t.startColumn,endLine:r?e.endLine:t.endLine,endColumn:r?e.endColumn:t.endColumn}},Ki={Always:`[]`,Eventually:`<>`,Enabled:`ENABLED`,Unchanged:`UNCHANGED`},qi=(e,t)=>e!==void 0&&t!==void 0&&e.line===t.line&&e.column===t.column,Ji=e=>e.location.range?.start,Yi=e=>e.location.range?.end,Xi=(e,t)=>{let n=e.location.range;return n&&t?{...e,location:{...e.location,range:{...n,end:t}}}:e},Zi=e=>{if(e.kind===`Apply`){let t=kn(e.operator),n=e.args.length===2&&t.fixity.startsWith(`Infix`),r=e.args.length===1&&t.fixity===`Prefix`;if(!n&&!r)return;let i=e.args.length-1;return{operator:t,isInfix:n,operand:e.args[i],replace:t=>({...e,args:[...e.args.slice(0,i),t]})}}let t=Ki[e.kind];if(t!==void 0&&`expression`in e)return{operator:kn(t),isInfix:!1,operand:e.expression,replace:t=>({...e,expression:t})}},Qi=(e,t)=>e.high<t.low,$i=e=>{let t=kn(e.operator),[n,r]=e.args,i=Yi(e),a=t=>{let n=e.location.range,i=Ji(t);return{...e,args:[t,r],location:n&&i?{...e.location,range:{...n,start:i}}:e.location}},o=(e,n)=>{let r=n?Zi(e):void 0;if(!r)return{kind:`Reduced`,isFinal:!1};let s=o(r.operand,qi(Yi(r.operand),Yi(e)));return s.kind===`Attached`?{kind:`Attached`,expression:Xi(r.replace(s.expression),i)}:!s.isFinal&&(Qi(t,r.operator)||r.isInfix&&t.fixity===`InfixLeft`&&r.operator.fixity===`InfixLeft`&&!Qi(r.operator,t))?{kind:`Reduced`,isFinal:!Qi(t,r.operator)}:{kind:`Attached`,expression:Xi(r.replace(a(r.operand)),i)}},s=o(n,qi(Ji(n),Ji(e)));return s.kind===`Attached`?s.expression:e},ea="use instead the class`E_visit.iter_concrete`",ta=(e,t,n,r)=>{let i=t.split(`
|
|
21
|
-
`),a=t=>({file:e,startLine:t.start.line,startColumn:t.start.column,endLine:t.end.line,endColumn:t.end.column+1}),o=e=>{let t={line:e.endLine-1,column:e.endColumn-1},n=e=>e===` `||e===`\r`;for(;t.line<i.length;){let e=i[t.line];for(;n(e[t.column]);)t.column++;if(t.column<e.length)break;t.line++,t.column=0}if(!(i[t.line]??``).startsWith(`(*{`,t.column))return e;for(let n=t.line;n<i.length;n++){let r=i[n].indexOf(`}*)`,n===t.line?t.column:0);if(r!==-1)return{...e,endLine:n+1,endColumn:r+4}}return e},s=(t,n)=>({file:e,startLine:n.line,startColumn:n.column,endLine:n.line,endColumn:n.column+t.length}),c=t=>t.range?a(t.range):{file:e,startLine:t.line,startColumn:t.column,endLine:t.line,endColumn:t.column+1},l=(e,t)=>{let n=Ui(e),r=Hi[n];return I(r?{kind:`Internal`,builtin:r}:{kind:`Opaque`,name:n},{location:t})},u=(e,t,n,r)=>{if(e.startsWith(`<`)){let t=I({kind:`Opaque`,name:e},{location:n});return I({kind:`Bang`,expression:t,selectors:[]},{location:n})}let i=Hi[e];if(i&&t.length===0)return I({kind:`Internal`,builtin:i},{location:n});let a=e.split(`!`);if(a.length===1){let r=I({kind:`Opaque`,name:e},{location:n});return t.length===0?r:I({kind:`Apply`,operator:r,args:t},{location:n})}let o=r??a.map((e,n)=>n===a.length-1?t.length:0),s=o.map((e,t)=>o.slice(0,t).reduce((e,t)=>e+t,0)),c=e=>t.slice(s[e],s[e]+o[e]),l=I({kind:`Opaque`,name:a[0]},{location:n});return I({kind:`Bang`,expression:o[0]===0?l:I({kind:`Apply`,operator:l,args:c(0)},{location:n}),selectors:a.slice(1).map((e,t)=>({kind:`Label`,label:Ui(e),args:c(t+1)}))},{location:n})},d=(e,t)=>e.map((n,r)=>{if(n.pattern.kind===`Tuple`)throw new C(`Unexpected tuple declaration`,{failure:ea});let i=r>0&&e[r-1].set===n.set;return{name:n.pattern.name,level:`Constant`,domain:i?{kind:`Ditto`}:{kind:`Domain`,expression:h(n.set,t)}}}),f=(e,t)=>e.map((n,r)=>{let i=h(n.set,t);if(n.pattern.kind===`Tuple`)return{kind:`Tuple`,names:n.pattern.names,domain:i};let a=r>0&&e[r-1].set===n.set;return{kind:`Name`,name:n.pattern.name,domain:a?{kind:`Ditto`}:{kind:`Domain`,expression:i}}}),p=(e,t)=>{if(!r)throw new C(`Unexpected tuple declaration`,{failure:ea});return I(e(),{location:t})},m=e=>e.some(e=>e.pattern.kind===`Tuple`),h=(e,t)=>{let n=c(e.location),r=e=>h(e,t),i=(e,t)=>e.length===2?Gi(e[0].location,e[1].location):e.length!==1||!e[0].location?n:t===`Prefix`?Gi({...n,endLine:n.startLine,endColumn:n.startColumn+1},e[0].location):t===`Postfix`?Gi({...n,startLine:n.endLine,startColumn:n.endColumn-1},e[0].location):n,a=(e,t)=>I({kind:`Apply`,operator:{kind:`Internal`,builtin:e},args:[t]},{location:i([t],`Prefix`)});switch(e.kind){case`Number`:return I({kind:`Num`,integer:e.text??String(e.value),fraction:``},{location:n});case`Decimal`:{let[t,r]=e.text.split(`.`);return I({kind:`Num`,integer:t,fraction:r},{location:n})}case`String`:return I({kind:`String`,value:e.value},{location:n});case`Identifier`:return u(e.name,[],n);case`Apply`:{if(e.args.length===2){let t=$i(e);if(t!==e)return r(t)}let t=e.args.map(r),a=kn(e.operator);return a.fixity===`Nonfix`?u(e.operator,t,n,e.argumentCounts):I({kind:`Apply`,operator:l(e.operator,void 0),args:t},{location:i(t,a.fixity)})}case`OperatorReference`:return l(e.operator,n);case`Lambda`:return I({kind:`Lambda`,params:e.params.map(e=>({name:e,shape:0})),body:r(e.body)},{location:n});case`And`:case`Or`:{let t=e.operands.map(r);if(e.isBulleted)return I({kind:`List`,bullet:e.kind,items:t},{location:n});let i=e.kind===`And`?`Conj`:`Disj`;return t.reduce((e,t)=>I({kind:`Apply`,operator:{kind:`Internal`,builtin:i},args:[e,t]},{location:Gi(e.location,t.location)}))}case`Prime`:{let t=r(e.expression);return I({kind:`Apply`,operator:{kind:`Internal`,builtin:`Prime`},args:[t]},{location:i([t],`Postfix`)})}case`Unchanged`:return a(`UNCHANGED`,r(e.expression));case`Enabled`:return a(`ENABLED`,r(e.expression));case`If`:return I({kind:`If`,condition:r(e.condition),consequent:r(e.consequent),alternative:r(e.alternative)},{location:n});case`Case`:return I({kind:`Case`,arms:e.arms.map(e=>({condition:r(e.condition),body:r(e.body)})),other:e.other&&r(e.other)},{location:n});case`Let`:return I({kind:`Let`,definitions:[...e.definitions,...e.instances??[]].sort((e,t)=>e.location.line-t.location.line||e.location.column-t.location.column).map(e=>_(e,t)),body:r(e.body)},{location:n});case`Forall`:case`Exists`:if(m(e.bounds)){let i=f(e.bounds,t),a=r(e.body);return p(()=>Fi(e.kind,i,a),n)}return I({kind:`Quant`,quantifier:e.kind,bounds:d(e.bounds,t),body:r(e.body)},{location:n});case`UnboundedQuantifier`:{let t=r(e.body),i=e.quantifier;return e.isTemporal?I({kind:`Tquant`,quantifier:i,names:e.names,body:t},{location:n}):I({kind:`Quant`,quantifier:i,bounds:Ai(e.names),body:t},{location:n})}case`Choose`:if(e.pattern.kind===`Tuple`){let t=e.pattern.names,i=e.set&&r(e.set),a=r(e.body);return p(()=>Li(t,i,a),n)}return I({kind:`Choose`,name:e.pattern.name,domain:e.set&&r(e.set),body:r(e.body)},{location:n});case`SetEnumeration`:return I({kind:`SetEnum`,elements:e.elements.map(r)},{location:n});case`SetFilter`:if(e.bound.pattern.kind===`Tuple`){let t=e.bound.pattern.names,i=r(e.bound.set),a=r(e.predicate);return p(()=>Ri(t,i,a),n)}return I({kind:`SetSt`,name:e.bound.pattern.name,domain:r(e.bound.set),body:r(e.predicate)},{location:n});case`SetMap`:if(m(e.bounds)){let i=r(e.expression),a=f(e.bounds,t);return p(()=>Bi(i,a),n)}return I({kind:`SetOf`,element:r(e.expression),bounds:d(e.bounds,t)},{location:n});case`Tuple`:return I({kind:`Tuple`,elements:e.elements.map(r)},{location:{...n,startLine:n.endLine,startColumn:n.endColumn-2}});case`FunctionConstruction`:if(m(e.bounds)){let i=f(e.bounds,t),a=r(e.body);return p(()=>Vi(i,a),n)}return I({kind:`Fcn`,bounds:d(e.bounds,t),body:r(e.body)},{location:n});case`FunctionSet`:return I({kind:`Arrow`,domain:r(e.domain),range:r(e.range)},{location:n});case`Record`:case`RecordSet`:return I({kind:e.kind===`Record`?`Record`:`Rect`,fields:e.fields.map(e=>({name:e.name,value:r(e.value)}))},{location:n});case`Except`:return I({kind:`Except`,function:r(e.function),specs:e.updates.map(e=>({trail:e.path.map(e=>e.kind===`Field`?{kind:`Dot`,field:e.name}:{kind:`Apply`,expression:e.args.length===1?r(e.args[0]):{kind:`Tuple`,elements:e.args.map(r)}}),value:h(e.value,!0)}))},{location:n});case`ExceptAt`:return I({kind:`At`,isExcept:t},{location:n});case`Bracket`:throw new C(`Unexpected [ without a function or subscript`);case`FunctionApplication`:return I({kind:`FcnApp`,function:r(e.function),args:e.args.map(r)},{location:n});case`FieldAccess`:return I({kind:`Dot`,expression:r(e.record),field:e.field},{location:n});case`Product`:return I({kind:`Product`,factors:e.factors.map(r)},{location:n});case`Always`:case`Eventually`:{let t=e.expression;return e.kind===`Always`&&t.kind===`BoxAction`?I({kind:`Tsub`,modal:`Box`,action:r(t.action),subscript:r(t.subscript)},{location:n}):e.kind===`Eventually`&&t.kind===`AngleAction`?I({kind:`Tsub`,modal:`Dia`,action:r(t.action),subscript:r(t.subscript)},{location:n}):a(e.kind===`Always`?`BoxTrue`:`Diamond`,r(t))}case`BoxAction`:case`AngleAction`:return I({kind:`Sub`,modal:e.kind===`BoxAction`?`Box`:`Dia`,action:r(e.action),subscript:r(e.subscript)},{location:n});case`WeakFairness`:case`StrongFairness`:return I({kind:`Fair`,fairness:e.kind===`WeakFairness`?`Weak`:`Strong`,subscript:r(e.subscript),action:r(e.action)},{location:n});case`Label`:return I({kind:`Parens`,expression:r(e.body),form:{kind:`Nlabel`,label:e.name,names:e.params}},{location:n});case`Subexpression`:{let[t,...i]=e.selectors;if(t.kind!==`Name`)throw new C(`Unexpected subexpression reference`);let a=I({kind:`Opaque`,name:t.name},{location:n}),o=t.args.length===0?a:I({kind:`Apply`,operator:a,args:t.args.map(r)},{location:n});return I({kind:`Bang`,expression:o,selectors:i.map(e=>{switch(e.kind){case`Name`:return{kind:`Label`,label:Ui(e.name),args:e.args.map(r)};case`Operand`:return e.operand===`<<`?{kind:`Left`}:e.operand===`>>`?{kind:`Right`}:{kind:`Number`,value:e.operand};case`Bound`:return{kind:`Instance`,args:e.args.map(r)};case`At`:return{kind:`At`};case`Colon`:return{kind:`Down`}}})},{location:n})}}},g=e=>({location:a(e.definitionRange??e.instanceRange),args:e.params.map(e=>e.name),module:e.module,substitutions:e.substitutions.map(e=>({name:Ui(e.name),expression:h(e.expression,!1)}))}),_=(e,t=!1)=>{let n=c(e.location);if(e.kind===`Instance`){if(e.name===void 0)throw new C(`Unexpected keyword INSTANCE`);return{kind:`Instance`,name:e.name,instance:g(e),location:n}}let r=Ui(e.name,e.kind===`Operator`&&e.params.length===1&&e.name===`-`),i=h(e.body,t);if(e.kind===`Function`&&m(e.bounds)){let a=f(e.bounds,t);return{kind:`Operator`,name:r,body:p(()=>Vi(a,i),n),location:n}}if(e.kind===`Function`){let a=d(e.bounds,t);return{kind:`Operator`,name:r,body:I({kind:`Fcn`,bounds:a,body:i},{location:n}),location:n}}return e.params.length===0?{kind:`Operator`,name:r,body:i,location:n}:{kind:`Operator`,name:r,body:I({kind:`Lambda`,params:e.params.map(e=>({name:Ui(e.name),shape:e.arity,...e.location&&{location:s(e.name,e.location)}})),body:i},{location:n}),location:n}},v=e=>{let t=c(e.location);return e.level===`Variable`?{kind:`Flex`,name:e.name,location:t}:{kind:`Fresh`,name:e.name,shape:e.arity,level:e.level,domain:e.set&&h(e.set,!1),domainVisibility:`Visible`,location:t}},y=e=>e.kind===`AssumeProve`?{context:e.assumptions.map(e=>{if(e.kind===`NewSymbol`)return v(e);if(e.kind===`AssumeProve`){let t=c(e.location);return{kind:`Fact`,expression:I({kind:`Sequent`,sequent:y(e)},{location:t}),visibility:`Visible`,location:t}}let t=b(e);return{kind:`Fact`,expression:t,visibility:`Visible`,location:t.location}}),active:h(e.conclusion,!1)}:{context:[],active:h(e,!1)},b=e=>{if(e.kind!==`Label`||e.params.length>0)return h(e,!1);let t=c(e.location);return I({kind:`Parens`,expression:h(e.body,!1),form:{kind:`Xlabel`,label:e.name,indices:[]}},{location:t})},x=e=>{if(e.kind===`ModuleFact`)throw new ae(`MODULE facts in proof obligations are not supported`);let t=h(e,!1);return t.kind===`Bang`&&t.selectors.length===0?t.expression:t},S=e=>{let t=c(e.location);if(e.kind===`ModuleFact`)return{kind:`Dvar`,name:e.name,location:t};if(e.kind===`Identifier`)return{kind:`Dvar`,name:Ui(e.name),location:t};if(e.kind===`OperatorReference`)return{kind:`Dvar`,name:Ui(e.operator),location:t};throw new ae(`This DEF clause in proof obligations is not supported`)},w=e=>({facts:e.facts.map(x),defs:e.defs.map(S)}),T=(e,t)=>{let r=e?e[2]:``;return r===``?{kind:`Unnamed`,level:t,id:Wt(n)}:{kind:`Named`,level:t,label:r,isAnonymous:!1}},E=(e,t,n)=>{if(!e)return{kind:`Omitted`,omission:`Implicit`,location:n};switch(e.kind){case`Obvious`:return{kind:`Obvious`,location:o(a(e.keyword))};case`Omitted`:return{kind:`Omitted`,omission:`Explicit`,location:a(e.keyword)};case`By`:return{kind:`By`,usable:w(e),isOnly:e.isOnly,location:a(e.keyword),step:{kind:`Unnamed`,level:t,id:0}};case`Steps`:{let n=e.steps.map(e=>Wi.exec(e.token)),r=n[0],i=r&&r[1]!==`*`&&r[1]!==`+`?Number(r[1]):t,o=e.steps.slice(0,-1).map((e,t)=>D(e,T(n[t],i),i)),s=e.steps[e.steps.length-1],c=T(n[n.length-1],i),l=a(s.head),u=E(s.proof,i+1,l),d={proof:u,location:Gi(l,u.location),step:c};return{kind:`Steps`,steps:o,qed:d,location:o.reduce((e,t)=>Gi(e,t.location),d.location),step:d.step}}}},ee=e=>Gi(a(e.keyword),e.defs.length>0?c(e.defs[e.defs.length-1].location):void 0),D=(e,t,n)=>{let r=a(e.head),i=e.body,o=i=>{let a=E(e.proof,n+1,r);return{...i(a),location:Gi(r,a.location),step:t}},s=e=>({...e,location:r,step:t});switch(i.kind){case`Use`:case`Hide`:{let n=Gi(a({...e.head,end:e.head.start}),ee(i)),r=w(i);return i.kind===`Use`?{kind:`Use`,usable:r,isOnly:i.isOnly,location:n,step:t}:{kind:`Hide`,usable:r,location:n,step:t}}case`Instance`:throw new C(`Unexpected keyword INSTANCE`);case`Define`:return s({kind:`Define`,definitions:i.definitions.map(e=>_(e))});case`Have`:return s({kind:`Have`,expression:h(i.expression,!1)});case`Take`:return s({kind:`Take`,bounds:i.names.length>0?Ai(i.names):d(i.bounds,!1)});case`Witness`:return s({kind:`Witness`,expressions:i.expressions.map(e=>h(e,!1))});case`Pick`:{let e=i.names.length>0?Ai(i.names):d(i.bounds,!1),t=h(i.body,!1);return o(n=>({kind:`Pick`,bounds:e,expression:t,proof:n}))}case`Case`:{let e=h(i.expression,!1);return o(t=>({kind:`Pcase`,expression:e,proof:t}))}case`Assert`:{let e=y(i.statement);return o(t=>i.isSuffices?{kind:`Suffices`,sequent:e,proof:t}:{kind:`Assert`,sequent:e,proof:t})}case`Qed`:throw new ae(`QED in the middle of a proof`)}},O=e=>({name:e.name,extendees:e.extends,extendeeLocations:e.extendsRanges.map(a),isImportant:!1,location:c(e.location),body:e.units.map(e=>{switch(e.kind){case`Constants`:case`Recursive`:return{kind:e.kind===`Constants`?`Constants`:`Recursives`,declarations:e.declarations.map(e=>({name:Ui(e.name),shape:e.arity})),location:c(e.declarations[0].location)};case`Variables`:return{kind:`Variables`,names:e.declarations.map(e=>e.name),location:c(e.declarations[0].location)};case`Definition`:return{kind:`Definition`,definition:_(e.definition),whereDefined:`User`,visibility:`Hidden`,isLocal:e.definition.isLocal,location:c(e.definition.location)};case`Instance`:{let t=e.instance,n=c(t.location);return t.name===void 0?{kind:`Anoninst`,instance:g(t),isLocal:t.isLocal,location:n}:{kind:`Definition`,definition:_(t),whereDefined:`User`,visibility:`Hidden`,isLocal:t.isLocal,location:a(t.instanceRange)}}case`Assumption`:return{kind:`Axiom`,name:e.assumption.name,expression:h(e.assumption.expression,!1),location:c(e.assumption.location)};case`Theorem`:{let t=e.theorem,n=c(t.location),r=o(n);return{kind:`Theorem`,name:t.name,sequent:y(t.statement),axiomCount:0,proof:E(t.proof,0,{...r,startLine:r.endLine,startColumn:r.endColumn}),location:n}}case`Use`:return{kind:`Mutate`,mode:e.use.kind,isSuppressed:!1,usable:w(e.use),location:ee(e.use)};case`Module`:return{kind:`Submod`,module:{...O(e.module),isImportant:!0}}}})});return{convertModule:O}},na={start:0,end:1/0},ra=/-{4,} *MODULE/,ia=`Unexpected EOF`,aa=e=>e?`${e.startLine}:${e.startColumn}:${e.endLine}:${e.endColumn}`:``,oa=e=>{let t=oe(e),n=e.split(`
|
|
22
|
-
|
|
23
|
-
`).length,
|
|
24
|
-
`,a-1),c=t.findLast(e=>e.kind!==`End`&&(e.line<o||e.line===o&&e.column<s));return{offset:a,line:o,column:s,end:{reason:ia,line:c?.line??o,column:c?c.endColumn+1:s,isEnd:!0}}},sa=e=>{try{return e()}catch(e){if(!(e instanceof ce)||!e.failure)throw e;return e.failure}},ca=e=>typeof e==`object`&&!!e&&`reason`in e,la=e=>{let n=sa(()=>oa(e));if(ca(n))return[n];let r=sa(()=>t(n?e.slice(0,n.offset):e));return n&&(!ca(r)||r.isEnd)?[{reason:`Unexpected TAB character. TLAPS does not handle TAB characters in source files.`,line:n.line,column:n.column,isEnd:!1},ca(r)&&r.reason===ia?r:n.end]:ca(r)?[r]:r},ua=(e,t,n,r,i)=>{if(!ra.test(e.source))throw new C(`No tokens in file`);let a=la(e.source);if(Array.isArray(a)){a.forEach(t=>{let n=`File ${JSON.stringify(e.file)}, line ${t.line}, character ${t.column}\n${t.reason}`;r({text:n,channel:`stderr`}),r({text:`${n}\n`,channel:`toolboxOnly`})});let t=`Could not parse ${JSON.stringify(e.file)} successfully.`;throw r({text:`${i}Error: ${t}`,channel:`stderr`}),new C(t,{failure:`Module.Parser.parse_file`})}let o=ta(e.file,e.source,t,n).convertModule(a),s=e.file.slice(e.file.lastIndexOf(`/`)+1),c=s.replace(/\.tla$/,``);return o.name===c?o:(r({text:`${He(o.location)}Warning: module name ${JSON.stringify(o.name)} does not match file name ${JSON.stringify(s)}.`,channel:`toolbox`}),{...o,name:c})},da=e=>{let t=new Map([...e].map(([e,t])=>[e,si(t).dependencies])),n=/* @__PURE__ */ new Set,r=[],i=a=>{if(n.has(a))return;n.add(a);let o=e.get(a);if(!o)throw new C(`Module "${a}" not found`);(t.get(a)??[]).forEach(i),r.push(o)};return[...e.keys()].sort(li).forEach(i),r},fa=(e,t,n)=>t.length===0?[]:[` ${e}_proofs_count = ${t.length}`,...t.map((t,r)=>` ${e}_proof_${n+r+1} at ${ze(t)}`)],pa=(e,t,n)=>{let r=e.location;return[` ---- incomplete proof of theorem at ${r?ze({...r,endLine:r.startLine,endColumn:r.startColumn}):`<unknown location>`} ----`,...fa(`missing`,e.absent,t),...fa(`omitted`,e.omitted,n),` ====`]},ma=e=>{let t=e.summary,n=t.theorems.reduce((e,t)=>t.absent.length+t.omitted.length===0?e:{lines:[...e.lines,...pa(t,e.missing,e.omitted)],missing:e.missing+t.absent.length,omitted:e.omitted+t.omitted.length},{lines:[],missing:0,omitted:0});return[`---- summary of module ${JSON.stringify(e.name)} ----`,` obligations_count = ${t.total}`,...t.absent.length>0?[` missing_proofs_count = ${t.absent.length}`]:[],...t.omitted.length>0?[` omitted_proofs_count = ${t.omitted.length}`]:[],...n.lines,`====`].join(`
|
|
25
|
-
|
|
26
|
-
`),isImportant:!0};o.set(t.name,t)});let s=[...o.values()].sort((e,t)=>li(e.name,t.name)),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set;for(let e=0;e<s.length;e++){let n=si(s[e]);n.submodules.forEach((e,t)=>{l.add(t),o.has(t)||o.set(t,e)});for(let e of n.dependencies){if(o.has(e)&&!ti.has(e))continue;let r=t(e);if(!r){!o.has(e)&&!c.has(e)&&c.set(e,n.locations.get(e));continue}let l=ua(r,a,!1,i,Ve(n.locations.get(e)));o.set(e,l),s.push(l)}}let u=[...c.keys()].filter(e=>!l.has(e)).sort(li);if(u.forEach(e=>i(P(c.get(e),`Unknown module ${JSON.stringify(e)}`))),u.length>0)throw new C(`Unknown module ${JSON.stringify(u[0])}`,{failure:`Module.Parser.load_module`});let d={anonymizer:Jt(a,(e,t)=>wi(d,e,t),i),generator:br(a,new Set(e.map(e=>e.file)),r,i),salts:{value:0},latestModules:/* @__PURE__ */ new Map,onWarning:i},f=da(o).map(e=>e.isStandard?e:oi(o,e,/* @__PURE__ */ new Set)),p=new Map(f.map(e=>[e.name,e]));return f.flatMap(e=>{if(e.isStandard)return[];let t=Ti(d,p,void 0,e);if(!e.isImportant)return[];let n=Ei(d,[],t),i=n.obligations.flatMap((e,t)=>{let n=e.location;if(e.kind.kind===`Omitted`||n&&(n.startLine<r.start||n.endLine>r.end))return[];let i=e.kind.kind===`Error`?e.kind.message:`${Yn(e.sequent)}\n`;return[{id:t+1,location:aa(n),text:i}]});return[{name:e.name,location:e.location,obligations:i,summary:n.summary}]})},ga={builtin:1,number:2,string:3,ident:4,added:5},_a=()=>({labelFlag:!1,reportLabelsFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,fairAlgorithm:!1,checkTermination:!1,noOld:!1,nocfg:!1,noDoneDisjunct:!1,specOption:!1,myspecOption:!1,specFile:``,optionsInFile:!1,inputVersionNumber:1903}),va=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},ya=[`unfair`,`wf`,`sf`],W=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),ba=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,xa=e=>{if(e.kind!==`LabeledStmt`)throw new b(`ClassCastException: ${e.kind}`);return e},Sa=(e,t)=>{if(t<0||t>=e.length)throw new b(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},Ca=(e,t,n)=>({string:e,column:t,type:n}),wa=e=>e.type===ga.string?e.string.length+2:e.string.length,Ta=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Ea=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},Da=e=>{let t=Ta(e);return Ea(t),t},Oa=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new b(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new O(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},ka=e=>Da(e.tokens.map(e=>e.map(e=>({...e})))),Aa=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+wa(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,Oa(e)},ja=e=>e.tokens.length===1&&e.tokens[0].length===1,Ma=(e,t)=>Sa(Sa(e.tokens,t.line),t.item),Na=(e,t,n)=>{if(e.tokens.length<=t.line)throw new k(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new k(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},Pa=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=Ma(e,r),i=n.type===ga.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Na(e,r,2):void 0,o=a===void 0?void 0:Ma(e,a),s=o!==void 0&&o.type!==ga.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Na(e,r,c)}},Fa=(e,t,n,r)=>{let i=Ma(e,n);if(ja(e)){let n=ka(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+wa(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(ja(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=ga.builtin);let n=ka(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Ca(`)`,e.column+wa(e),ga.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+wa(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return Oa(e),Na(e,d,1)},Ia=(e,t,n,r=!0)=>{let i=n.map(t=>Pa(e,t,{line:0,item:0}));for(;;){let a=i.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(a===void 0)return;let o=Na(e,a.position,1),s=Fa(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:Pa(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new b(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},La=(e,t,n)=>{let r=ka(e);return Ia(r,t,n),r},Ra=(e,t,n)=>e.map(e=>La(e,t,n)),za=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===ga.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
27
|
-
`)} >>`},Ba=(e,t,n)=>{let r=e=>za(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${ya[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},Va=(e,t,n,r,i)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).reduce((e,t)=>t===` `?(Math.floor(e/8)+1)*8:e+1,0):0,lastLine:r,lastColumn:i,isTabToSpaces:!1}),Ha=e=>{if(e.currentLine===void 0)return` `;if(e.isTabToSpaces)return e.vcolumn+=1,e.vcolumn%8==0&&(e.isTabToSpaces=!1),` `;if(e.line>e.lastLine||e.line===e.lastLine&&e.column>=e.lastColumn)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
|
|
28
|
-
|
|
29
|
-
`)
|
|
30
|
-
`)
|
|
31
|
-
`)return
|
|
32
|
-
|
|
33
|
-
`)
|
|
34
|
-
|
|
35
|
-
it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=io(e.tokenizer,t),o.lookaheadSize+=1;return Wa(t)},d=(n=!1)=>{if(o.lookaheadSize!==0)throw new k(`ParseAlgorithm: GetExpr called after lookahead`);let r=ro(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},f=(e,t)=>{if(e===`;`){let e=l(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new O(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=c();n!==e&&n!==t&&s(`Expected "${e}" but found "${n}"`)},p=e=>{let t=c();t!==e&&s(`Expected "${e}" but found "${t}"`)},m=()=>{let e=c();return e===`=`?!0:e===`\\in`||e===`∈`?!1:s(`Expected "=" or "\\in" but found "${e}"`)},h=()=>f(l(1)===`,`?`,`:`;`),g=()=>f(o.pSyntax?`begin`:`{`),_=e=>{o.cSyntax?f(`}`):(f(`end`),f(e))},v=()=>{l(1)===`variables`?p(`variables`):f(`variable`)},y=()=>{let e={...W(),kind:`VarDecl`,var:c(),col:a.column,line:a.line,isEq:!0,val:oo()};if(![`=`,`\\in`,`∈`].includes(l(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=m(),e.val=d(),e.val.tokens.length===0)throw new b(`NullPointerException`);return e},x=()=>{v();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(l(1));)e.push(y()),h();return e},S=()=>{let e={...W(),kind:`PVarDecl`,var:c(),col:a.column,line:a.line,val:oo()};if(l(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(f(`=`),e.val=d(),e.val.tokens.length===0)throw new b(`NullPointerException`);return e},C=()=>{v();let e=[];for(;l(1)!==`begin`&&l(1)!==`{`;)e.push(S()),h();return e},w=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(l(1)))return!1;let e=Wa(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},T=()=>{if(!w())return``;let t=c();e.isInMacro&&s(`A label may not appear in a macro.`),t===`Done`&&s("Cannot use `Done' as a label."),t===`Error`&&s("Cannot use `Error' as a label."),f(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=l(1);return n!==`+`&&n!==`-`||(f(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},E=()=>{let e=[],t=e=>o.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(l(1));)e.push(...D());return o.cSyntax&&e.length===0&&s(`Empty statement list`),e},ee=e=>{p(`{`);let t=E();if(f(`}`),f(`;`),e!==``){if(t[0].lbl!==``)throw new O(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},D=()=>{let e=T();if(o.cSyntax&&l(1)===`{`)return ee(e);let t=te();return t.lbl=e,[t]},te=()=>{let e=l(1);if(e===`if`)return re(0);if(e===`either`)return ie();if(e===`with`)return ae(0);if(e===`when`||e===`await`){p(e);let t=a.column,n=a.line,r=d();if(r.tokens.length===0)throw new b(`NullPointerException`);return f(`;`),{...W(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){p(e);let t=a.column,n=a.line,r=d();return r.tokens.length===0&&s(`Empty expression in ${e} statement at `),f(`;`),{...W(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){p(`skip`);let e={...W(),kind:`Skip`,col:a.column,line:a.line};return f(`;`),e}if(e===`call`)return ue();if(e===`return`){p(`return`);let e={...W(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return f(`;`),e}if(e===`goto`){p(`goto`);let e=a.column,t=a.line,n=c();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),f(`;`),{...W(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?ne():u(1)[0]===`(`?de():se()},ne=()=>{p(`while`);let e=a.column,t=a.line;o.cSyntax&&f(`(`);let n=d();o.cSyntax&&f(`)`),n.tokens.length===0&&s(`Empty while test at `),o.pSyntax&&f(`do`);let r=o.pSyntax?E():D();return o.pSyntax&&(f(`end`),f(`while`),f(`;`)),r.length===0&&s(`Missing body of while statement at`),{...W(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},re=e=>{p(e===0?`if`:`elsif`);let t={...W(),kind:`LabelIf`,col:a.column,line:a.line,test:Ta(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&f(`(`),t.test=d(),o.cSyntax&&f(`)`),t.test.tokens.length===0&&s(`Empty if test at `),o.pSyntax&&f(`then`),t.unlabThen=o.pSyntax?E():D();let n=l(1);return n===`else`&&(p(`else`),t.unlabElse=o.pSyntax?E():D()),o.pSyntax&&n===`elsif`&&(t.unlabElse=[re(e+1)]),o.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&s(`Expecting "else", "elsif", or "end"`),o.pSyntax&&e===0&&(f(`end`),f(`if`),f(`;`)),t.unlabElse.length===0&&Sa(t.unlabThen,t.unlabThen.length-1),t},ie=()=>{p(`either`);let e={...W(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...W(),kind:`Clause`,unlabOr:o.pSyntax?E():D(),labOr:[]};if(t.unlabOr.length===0)throw new O("`either' statement with empty `or' clause",e);if(e.clauses.push(t),l(1)!==`or`)break;p(`or`)}if(o.pSyntax&&(p(`end`),f(`either`),f(`;`)),e.clauses.length===1)throw new O("`either' statement has no `or'",e);return e},ae=e=>{e===0&&(f(`with`),o.cSyntax&&f(`(`));let t={...W(),kind:`With`,col:a.column,line:a.line,var:c(),isEq:!0,exp:Ta(),Do:[]};t.isEq=m(),t.exp=d(),(o.pSyntax||l(1)!==`)`)&&h(),t.exp.tokens.length===0&&s(`Empty with expression at `);let n=o.pSyntax&&l(1)===`do`,r=o.cSyntax&&l(1)===`)`;if(n&&f(`do`),r&&p(`)`),t.Do=n?E():r?D():[ae(e+1)],n&&(f(`end`),f(`with`),f(`;`)),t.Do.length===0)throw new O(`Missing body of with statement`,t);return t},oe=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...W(),kind:`Lhs`,col:e,line:t,var:c(),sub:d()};f(`:=`,`≔`);let r=d();return r.tokens.length===0&&s(`Empty right-hand side of assignment at `),{...W(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},se=()=>{let e={...W(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[oe()]};for(;l(1)===`||`||l(1)===`‖`;){c();try{e.ass.push(oe())}catch(e){if(!(e instanceof O))throw e;s(`Bad assignment statement at `)}}return f(`;`),e},ce=()=>{let e=[];if(u(0)[0]!==`)`)for(;;){let t=d();if(e.push(t),t.tokens.length===0&&s(`Empty argument in call statement at `),l(1)===`)`)break;f(`,`)}return f(`)`),f(`;`),e},le=()=>{p(`call`);let e={...W(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:c(),args:[]};return f(`(`),e.args=ce(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},ue=()=>{let e=le();if(l(1)===`return`)return p(`return`),f(`;`),{...W(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(l(1)!==`goto`)return e;p(`goto`);let t={...W(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:c(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),f(`;`),t},de=()=>{let e={...W(),kind:`MacroCall`,name:c(),col:a.column,line:a.line,args:[]};return p(`(`),e.args=ce(),e},fe=t=>{e.isInMacro=!0,p(`macro`);let n={...W(),kind:`Macro`,col:a.column,line:a.line,name:c(),params:[],body:[]};for(f(`(`);l(1)!==`)`;)n.params.length>0&&f(`,`),n.params.push(c());return p(`)`),g(),n.body=E(),_(`macro`),l(1)===`;`&&c(),M(n.body,t),e.isInMacro=!1,n},pe=()=>{f(`procedure`);let e={...W(),kind:`Procedure`,col:a.column,line:a.line,name:c(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],f(`(`);l(1)!==`)`;)e.params.length>0&&f(`,`),e.params.push(S());return p(`)`),l(1)!==`begin`&&l(1)!==`{`&&(e.decls=C()),g(),e.body=E(),_(`procedure`),l(1)===`;`&&c(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},me=()=>{f(`process`);let e=a.column,t=a.line;o.cSyntax&&f(`(`);let n=c(),r=m(),i=d();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&f(`)`),i.tokens.length===0&&s(`Empty process id at `);let u=l(1)===`begin`||l(1)===`{`?[]:x();g();let p=E();return _(`process`),l(1)===`;`&&c(),{...W(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:u,body:p}},he=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?he():e},A=e=>{e.lbl===``&&(e.lbl=he(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(ba(e)))},ge=(e,t,n,r,i)=>{lo(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{A(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new O("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new O("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=ge(e.unlabThen,!1,n,i,t);a.isNextLabeled=ge(e.unlabElse,!1,n,i,r)||o,lo(so(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=ge(e.unlabOr,!1,n,i,r)||a.isNextLabeled,lo(so(r,t),t)}),lo(t,i);return}case`While`:if(n)throw new O("`while' inside a `with' statement",e);s(e),ge(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=ge(e.Do,!1,!0,n?[...r]:[],t),lo(t,i),!n&&!co(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?so([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,co(i,l))lo(so(i,l),i);else{if(n)throw new O(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),lo(l,i)}}),a.hasLabel||a.isNextLabeled},_e=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return _e(n),{unlabeled:n,labeled:ve(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},ve=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new k(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...W(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>_e(e.stmts)),t},ye=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=j(n.unlabThen);n.labThen.forEach(e=>j(e.stmts));let i=j(n.unlabElse);return n.labElse.forEach(e=>j(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...W(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,j(t.unlabOr));return t.labOr.forEach(e=>j(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...W(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=j(n.Do);if(e===2)throw new O(`with statement at ${ba(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new k("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return j(n.unlabDo),n.labDo.forEach(e=>j(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new O(`return statement not in a procedure at ${ba(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new k(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},j=e=>{for(let t=0;t<e.length;t++){let n=ye(e,t);if(n!==0){if(t===e.length-1)return n;throw new k(`Translator discovered later than it should have that\n Statement at ${ba(e[t+1])} must have a label`)}}return 0},be=e=>{ge(e,!0,!1,[],[]);let t=ve(e);return t.forEach(e=>j(e.stmts)),t},xe=(e,t,n,r,i)=>{let a=e=>La(e,t,n),o=e=>e.map(e=>xe(e,t,n,r,i)),s=e=>e.map(e=>({...W(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>xe(e,t,n,-1,0))})),c={...W(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...c,kind:`Assign`,ass:e.ass.map(e=>Se(e,t,n,r,i))};case`If`:return{...c,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...c,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...c,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...c,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...c,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...c,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:s(e.labDo)};case`LabelIf`:return{...c,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:s(e.labThen),unlabElse:o(e.unlabElse),labElse:s(e.labElse)};case`LabelEither`:return{...c,kind:`LabelEither`,clauses:e.clauses.map(e=>({...W(),kind:`Clause`,labOr:s(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...c,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Ra(e.args,t,n)};case`Return`:return{...c,kind:`Return`,from:e.from};case`CallReturn`:return{...c,kind:`CallReturn`,to:e.to,from:e.from,args:Ra(e.args,t,n)};case`CallGoto`:return{...c,kind:`CallGoto`,to:e.to,after:e.after,args:Ra(e.args,t,n)};case`Goto`:return{...c,kind:`Goto`,to:e.to};default:throw new k(`Found unexpected statement type in macro at${ba(e)}`)}},Se=(e,t,n,r,i)=>{let a=La(e.rhs,t,n),o={...W(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:La(e.lhs.sub,t,n)},s={...W(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=Ma(l,{line:0,item:0});if(u.type!==ga.ident)throw new O(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${ba(s)}`);if(o.var=u.string,Na(l,{line:0,item:0},1)===void 0)return s;let d=ka(l);return d.tokens[0].splice(0,1),Ea(d),o.sub.tokens.length===0?o.sub=d:Aa(o.sub,d,0),s},M=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return M(e.unlabThen,t),M(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>M(e.unlabOr,t)),[e];case`With`:return M(e.Do,t),[e];case`While`:return M(e.unlabDo,t),[e];case`MacroCall`:return Ce(e,t);default:return[e]}});e.splice(0,e.length,...n)},Ce=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new O(`Macro ${e.name} undefined,\n at ${ba(e)}`);if(n.params.length!==e.args.length)throw new O(`Macro ${e.name} called with wrong number of arguments at \n ${ba(e)}`);let r=n.body.map(t=>xe(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},we=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new O(`Multiple definitions of macro name \`${t.name}'`)})},Te=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1,o.omitStutteringWhenDone=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!ja(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},Ee=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new O([e,...o.addedLabelsLocs].join(`
|
|
36
|
-
`))},De=()=>{r.reportLabelsFlag?(e.log(o.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),o.addedLabels.forEach((t,n)=>e.log(` ${t} at ${o.addedLabelsLocs[n]}`))):e.log(`Labels added.`)},Oe=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,M(t.body,e),t.body=be(t.body)}),ke=()=>{n&&(c()!==`algorithm`&&s("`--fair' not followed by `algorithm'"),r.fairAlgorithm=!0);let t=c();o.cSyntax=l(1)===`{`,o.pSyntax=!o.cSyntax,o.cSyntax&&p(`{`);let i=l(1)===`variable`||l(1)===`variables`?x():[],a={value:Ta()};l(1)===`define`&&(p(`define`),o.cSyntax&&f(`{`),a.value=d(!0),_(`define`),f(`;`));let u=[];for(;l(1)===`macro`;)u.push(fe(u));for(;l(1)===`procedure`;)o.procedures.push(pe()),o.omitPC=!1;if(l(1)===`fair`&&(l(2)===`process`||l(2)===`+`&&l(3)===`process`)||l(1)===`process`){let e=[];for(;l(1)===`fair`||l(1)===`process`;){let t=l(1)===`fair`;t&&p(`fair`);let n=t&&l(1)===`+`;n&&p(`+`);let i=n||!t&&r.fairnessOption===`sf`?2:t||r.fairnessOption===`wf`?1:0;e.push({...me(),fairness:i})}_(`algorithm`),we(u);let n=e.map(e=>(M(e.body,u),e.body=be(e.body),o.omitStutteringWhenDone=!0,Te(e.body),o.omitStutteringWhenDone));return o.omitStutteringWhenDone=n.includes(!0),Oe(u),o.addedLabels.length>0&&(r.labelFlag||Ee(),De()),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),o.gotoUsed&&(o.omitPC=!1),{...W(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:u,prcds:o.procedures,procs:e}}r.inputVersionNumber===1500&&l(1)===`fair`&&(f(`fair`),l(1)===`+`&&f(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),g();let m=E();we(u),M(m,u),Oe(u),o.cSyntax&&f(`}`),_(`algorithm`);let h=be(m);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&Ee(),De()),o.gotoUsed&&(o.omitPC=!1),o.gotoDoneUsed||Te(h),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),{...W(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:u,prcds:o.procedures,body:h}};try{return{ast:ke(),omitPC:o.omitPC,omitStutteringWhenDone:o.omitStutteringWhenDone,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof b))throw e;return s(`Unknown error at or before`)}},G={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},fo=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],po=/* @__PURE__ */ new Set([G.global,G.processVar,G.procedureVar,G.parameter]),mo=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),ho=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),go=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},_o=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},vo=(e,t,n,r,i,a,o)=>!(t===G.procedureVar||t===G.processVar||t===G.parameter?mo(e,G.global,n,``)!==void 0||ho(e,n,r)!==void 0:mo(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),yo=(e,t,n,r)=>mo(e,t,n,r)?.useThis??n,bo=(e,t,n)=>{let r=ho(e,t,n);return r===void 0?t:po.has(r.type)?r.useThis:t},xo=e=>{let t={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},n=(e,n,i)=>{vo(t,G.label,e.label,n,i,e.line,e.col)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n,i))},r=(e,t,i)=>{let a=e=>e.forEach(e=>r(e,t,i)),o=e=>e.forEach(e=>n(e,t,i));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new k(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=`process`,i=n===``?G.global:G.processVar)=>{vo(t,i,e.var,n,r,e.line,e.col)||(t.errorReport+=`\n${fo[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(vo(t,G.global,`pc`,``,``,0,0),e.prcds.length>0&&vo(t,G.global,`stack`,``,``,0,0),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=go(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:xa(e.body[0]).label}),vo(t,G.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>i(t,e.name,`procedure`,G.procedureVar)),e.params.forEach(t=>i(t,e.name,`procedure`,G.parameter)),e.body.forEach(t=>n(xa(t),e.name,`procedure`))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=_o(t,e.name)<t.processes.length;r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processes.push({name:e.name,initialPC:e.body.length===0?void 0:xa(e.body[0]).label}),vo(t,G.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(xa(t),e.name,`process`))}),e.kind===`Uniprocess`&&(e.body.length>0&&(t.initialPC=xa(e.body[0]).label),e.body.forEach(e=>n(xa(e),``,``))),t.errorReport.length>0)throw new O(t.errorReport);return t},So=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1;for(let n=0;n<=7;n+=1)e.symbols.forEach(r=>{if(r.type!==n)return;r.useThis=r.id;for(let e=1;n>0&&t(r.useThis);e+=1)r.useThis+=e===1?`_`:r.context[e-2]??String(n);if(r.id===r.useThis)return;let i=r.context.length===0?``:` of ${r.contextType} ${r.context}`;e.disambiguateReport.push(`\\* ${fo[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},Co=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${fo[e.type]} name`);if(t.length>0)throw new O(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},wo=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==ga.ident)return;let a=bo(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Da([[Oo(a)]])))})),i.length>0&&Ia(e,i,r,!1)},i=(e,n)=>{e.var=bo(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=yo(t,G.label,r,n)}),o=(e,n)=>e===void 0?void 0:yo(t,G.procedure,e,n),s=(e,n)=>{e.label=yo(t,G.label,e.label,n),e.stmts.forEach(e=>c(e,n))},c=(e,n)=>{let i=e=>e.forEach(e=>c(e,n)),a=e=>e.forEach(e=>s(e,n)),l=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:s(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=bo(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=yo(t,G.procedure,e.returnTo,n),e.to=yo(t,G.procedure,e.to,n),l(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=yo(t,G.procedure,e.to,n),l(e.args);return;case`CallGoto`:e.after=yo(t,G.procedure,e.after,n),e.to=yo(t,G.procedure,e.to,n),l(e.args);return;case`Goto`:if(mo(t,G.label,e.to,n)===void 0&&e.to!==`Done`)throw new O(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=yo(t,G.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new k(`Unexpected AST type${e.kind}`)}},l=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(xa(t),e.name));let n=Sa(t.procedures,go(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=yo(t,G.label,n.initialPC,e.name)),e.name=yo(t,G.procedure,e.name,``),n.name=e.name},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(xa(t),e.name));let n=Sa(t.processes,_o(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=yo(t,G.label,n.initialPC,e.name)),e.name=yo(t,G.process,e.name,``),n.name=e.name};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(l);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){u(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(l),e.body.forEach(e=>s(xa(e),``))),t.initialPC!==void 0&&(t.initialPC=yo(t,G.label,t.initialPC,``))},To=e=>Ca(e,0,ga.string),Eo=e=>Ca(e,0,ga.added),Do=e=>Ca(e,0,ga.builtin),Oo=e=>Ca(e,0,ga.ident),ko=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+wa(r)+t;n.push(Ca(e.string,i,e.type))}),Da([n])},Ao=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=wa(e),e.type===ga.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),jo=(e,t,n,r=0,i=0)=>({...W(),kind:`SingleAssign`,line:r,col:i,lhs:{...W(),kind:`Lhs`,var:e,sub:t},rhs:n}),Mo=(e,t=0,n=0)=>({...W(),kind:`Assign`,line:t,col:n,ass:e}),No=(e,t,n=0,r=0)=>Mo([jo(e,Da([]),t,n,r)],n,r),Po=e=>{if(e.tokens.length>1)return!1;let t=Sa(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Fo=e=>({...W(),kind:`When`,exp:ko([Eo(`pc`),Do(`=`),To(e)],1)}),Io=e=>No(`pc`,Da([[To(e??`null`)]])),Lo=e=>[Oo(`Head`),Do(`(`),Eo(`stack`),Do(`)`),Do(`.`),Oo(e)],Ro=()=>[Oo(`Tail`),Do(`(`),Eo(`stack`),Do(`)`)],zo=e=>Da([Lo(e)]),Bo=(e,t,n,r)=>{let i=[[Do(`<<`),Do(`[`),Oo(`procedure`),Do(`|->`),To(e),Do(`,`)],[Oo(`pc`),Do(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(Do(`,`)),i.push([Oo(e.var),Do(`|->`),Oo(e.var)])}),i[i.length-1].push(Do(`]`),Do(`>>`)),i.push(r);let a=Ta(i);return Ao(a),Ea(a),a},Vo=(e,t,n)=>{if(t.params.length!==n.args.length)throw new O(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(jo(t.var,Da([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>No(e.var,e.val,n.line,n.col)),Io(t.initialPC)]},Ho=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=go(t,e.to);if(r===t.procedures.length)throw new O(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=Bo(e.to,[To(n)],[...i.decls,...i.params],[Do(`\\o`),Eo(`stack`)]);return Vo(No(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new O("`return' statement not in procedure",e);let i=go(t,n);if(i>=t.procedures.length)throw new O(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>Mo([jo(t,Ta(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,zo(`pc`)),...a.decls.map(e=>o(e.var,zo(e.var))),...a.params.map(e=>o(e.var,zo(e.var))),o(`stack`,Da([Ro()]))]},o=e=>{let n=e.from;if(n===void 0)throw new O(`\`return' statement following \`call' at ${ba(e)} not in a procedure`);let r=Sa(t.procedures,go(t,n)),i=go(t,e.to);if(i===t.procedures.length)throw new O(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=Mo([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(jo(t.var,Ta(),zo(t.var),e.line,e.col)));let t=Bo(e.to,Lo(`pc`),[...a.decls,...a.params],[Do(`\\o`),...Ro()]);o.ass.push(jo(`stack`,Da([]),t,e.line,e.col))}return Vo(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):p(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(Io(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...W(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(Io(t)),i.needsGoto&&c.Else.push(Io(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(Io(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(Io(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(Fo(e.label)),a.push({...W(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=Po(t.test),l=s?a.stmts:[{...W(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...W(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[Fo(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...W(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},p=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...W(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},m=(e,t)=>u(e.map(xa),t),h=e=>{r.procedure=e.name;let n=m(e.body,yo(t,G.label,`Error`,``));return r.procedure=void 0,{...W(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},g=e=>({...W(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:m(e.body,`Done`)}),_=e.prcds.map(h);return e.kind===`Uniprocess`?{...W(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,body:m(e.body,`Done`)}:{...W(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,procs:e.procs.map(g)}},Uo=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new O(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new O(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new O(`Multiple assignment to ${t}`,e)}),i(t,o)},s=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>s(e,n)),e.Else.forEach(e=>s(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>s(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>s(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new k(`Unexpected AST type ${e.kind}`)}},c=e=>e.forEach(e=>{let t=n.map(()=>0);xa(e).stmts.forEach(e=>s(e,t))});e.prcds.forEach(e=>c(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(c)},Wo=(e,t,n,r)=>{let i=xo(e);So(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),wo(e,i,r),Uo(Ho(e,i,t),t),n&&Co(i)},Go=`[ \\t\\n\\x0B\\f\\r]`,Ko=RegExp(`\\\\\\* BEGIN TRANSLATION${Go}+\\(${Go}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Go}*(=${Go}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Go}*STRING)${Go}*\\/\\\\${Go}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Go}*(=${Go}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Go}*STRING)${Go}*\\)`),qo=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Jo=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),Yo=(e,t)=>Jo(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${ba(t.node)}`),Xo=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),Zo=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Qo=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},$o=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},es=e=>/^[\p{L}\p{Nd}_]$/u.test(e),ts=(e,t,n)=>{for(;t.line<e.length;){let r=Qo(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=$o(r,e,` `),!0}t.column=$o(r,t.column,` `)}return!1},ns=(e,t)=>Jo(e,`Command-line error: ${t}`),rs=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ns(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ns(e,`
|
|
37
|
-
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ns(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}n.specFile=s,a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:n.noOld=!0;continue;case`-nocfg`:n.nocfg=!0;continue;case`-noDoneDisjunct`:case`noDoneDisjunct`:n.noDoneDisjunct=!0;continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ns(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ns(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){ns(e,"Version number must follow `-version' option");return}let t=va(s);if(t<0||t>1903){Jo(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ns(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ns(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:ns(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},is=(e,t,n)=>{if(Qo(t,n),n.column+=7,!Qo(t,n).slice(n.column).startsWith(`(`)){Jo(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Qo(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=$o(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Jo(e,`No closing ')' found in options statement`):rs(e,r)},as=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new O(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},os=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new b(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},ss=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=Xo(t),i={line:0,column:0};for(;ts(r,i,`PlusCal`);){let t=Qo(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!es(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){e.params.optionsInFile=!0,is(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=Zo(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=Zo(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=as(r,a.line,a.column);if(l!==void 0)return Yo(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let n=Va(r,a.line,a.column,t.length,0),i=uo(e,n,a.isFair);u.ast=i.ast,Wo(i.ast,i.omitPC,i.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof O))throw t;Yo(e,t)}s===-1&&os(-1,r.length);let d=Ko.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,p=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:Ba(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(p===void 0||f!==qo(p))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let m=d.groups?.tla;if(m!==void 0){if(c===-1)throw new b(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);m!==qo(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},cs=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],ls={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},K=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),us=e=>cs.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...K(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...K(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:ls,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),ds=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},fs=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,ps=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,ms=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},hs=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),gs=(e,t)=>(e&2147483647)%t,_s=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[gs(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},vs=(e,t,n=t)=>e.buckets[gs(ms(n),e.buckets.length)].find(e=>e.key===t)?.value,ys=(e,t,n,r=t)=>{let i=ms(r),a=e.buckets[gs(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&_s(e),e.buckets[gs(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},bs=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),xs=`\0module `,Ss=()=>({table:hs(),symbols:[]}),Cs=e=>e.kind===`Module`?xs+e.name:e.name,ws=(e,t)=>{ys(e.table,Cs(t),t,t.name),e.symbols.push(t)},Ts=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Es=(e,t)=>vs(e.table,t),Ds=(e,t)=>vs(e.table,xs+t,t),Os=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),ks=(e,t)=>bs(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),As=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),js=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Ms=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Ns=e=>{switch(e.kind){case`Identifier`:return Ms(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Ms(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Ps=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Fs=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Is=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Ls=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Rs=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,zs=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Bs=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Vs=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Es(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Bs(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Fs(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Bs(u.nameLocation,l(u.index)),u.name=p,Ls(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=Ts(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Fs(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
|
|
38
|
-
operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Is(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Is(f.op,a.length);if(o){let e=Is(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Is(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=zs(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Is(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Is(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Is(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
39
|
-
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Ts(f.op):u.previousMode===`FindingOpName`&&Rs(f)?Ts(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Ts(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=js.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Hs=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Us=(e,t)=>`${e}:${t}`,Ws=(e,t)=>{let n=oe(t).filter(e=>e.kind!==`End`).map(de),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
40
|
-
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Us(e.line,e.column),t]))}},Gs=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Ks=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},qs=(e,t)=>e.tokenIndexes.get(Us(t.line,t.column))??Math.min(Ks(e,t,!1),e.tokens.length-1),Js=(e,t)=>Math.max(Ks(e,t,!0)-1,0),Ys=(e,t)=>{let n=e.tokens[t].text,r=Hs.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Gs(e,a,n))i++;else if(Gs(e,a,r)&&(i--,i===0))return a;return t},Xs=(e,t)=>({start:qs(e,t.start),end:Js(e,t.end)}),q=(e,t)=>{let n=t.location.range;if(n)return Xs(e,n);let r=qs(e,t.location);return{start:r,end:Ys(e,r)}},Zs=(e,t)=>{let n=t.start-1,r=t.end+1;return Gs(e,n,`(`)&&Gs(e,r,`)`)&&Ys(e,n)===r?Zs(e,{start:n,end:r}):t},Qs=(e,t)=>{let n=t.start-1,r=t.end+1;return Gs(e,n,`(`)&&Ys(e,n)===r&&(Gs(e,n-1,`(`)||Gs(e,n-1,`,`))?Qs(e,{start:n,end:r}):t},J=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),$s=(e,t)=>J(e,{start:t,end:t}),ec=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?w(r):r+1,r>=n)return i;i++}return i},tc=(e,t)=>{let n=e.tokens[t],r=ec(e,n.line,n.column);return e.source.slice(r,ec(e,n.line,n.endColumn)+1)},nc=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},rc=e=>{let t=Ws(``,e),n=t.tokens.reduce((e,n,r)=>{if(!nc(t,r))return e;let i=ec(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&te(e)!==void 0)throw new ce(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},ic=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:ec(e,n.line,n.endColumn)+1,a=e.source.slice(i,ec(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
41
|
-
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},ac=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},oc=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Gs(e,i,r))return i;return-1},sc=new Map(l.flatMap(([e,...t])=>t.map(t=>[t,e]))),cc=e=>e.split(`!`).map(e=>sc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),lc={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},uc=e=>/^[A-Za-z0-9_]+$/.test(e),dc=e=>e!==`!!`&&e.includes(`!`),fc=e=>e.contexts[e.contexts.length-1],pc=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Es(e.contexts[n],t);if(r)return r}},mc=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,hc=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,gc=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||_c(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&_c(n.module)}return!1},_c=e=>ks(e,2).length===0&&ks(e,3).length===0,vc=e=>[...e.kind===`Let`?e.instances??[]:[],...o(e).flatMap(vc)],yc=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:yc(e)):vc(e),bc=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},xc=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?vc(e.definition.body):e.kind===`Theorem`&&s?yc(e.theorem.statement):e.kind===`Assumption`&&s?vc(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!bc(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Sc=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Cc=e=>{let t=e.kind===`Apply`?Ns(e):void 0;return Sc.has(e.kind)||t!==void 0&&Ps(t)},wc=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Tc=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Ec=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Dc=(e,t)=>Ec.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Oc=(t,n,r={})=>{let i=[],a=(e,t)=>ds(i,{location:e,text:t,isWarning:!1}),o=(e,t)=>ds(i,{location:e,text:t,isWarning:!0}),s={value:r.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let n=pc(e,t.name);if(n===t)return;if(n===void 0){ws(fc(e),t);return}let i=t.kind===`FormalParam`||mc(n)!==mc(t)||Ts(n)!==Ts(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.version===`1.7.4`)?a(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?a(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${fs(n.location)}.`):gc(t,n)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${fs(n.location)}.`)};r.version!==`1.7.4`&&us(c);let d=us(c);c();let f=new Map(d.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=(t,n)=>{let i=t===r.rootFileName&&r.rootFilePath||`${t}.tla`,a=e=>new T(`Could not parse module ${t} from file ${i}`,t,e),o=r.version===`1.7.4`?e(n):void 0;if(o!==void 0)throw a(o);try{return ne(rc(n))}catch(e){throw e instanceof ce?a(te(n)??`***Parse Error***\n${e.message}`):e}},g=(e,t,n)=>{let i=m.get(e);if(i)return i;if(t===void 0)throw new fe(e,n,r.version!==`1.7.4`);r.onParse?.(e);let a=h(e,t);if(a.name!==e)throw new T(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let o={file:Ws(a.name,t),module:a};return m.set(e,o),o},_=[],v=/* @__PURE__ */ new Set,y=[],b=(e,t,r)=>{let i=y.indexOf(e);if(i!==-1)throw new T(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...y.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(v.has(e))return;v.add(e),y.push(e);let a=ee(e,g(e,t,r).module);[...a.extendees,...a.instancees].forEach(t=>b(t,n(t),e)),y.pop(),_.push(e)},x=/* @__PURE__ */ new Set,S=(e,t)=>x.has(`${e} ${t}`),C=(e,t,n)=>{let r=m.get(e);if(!r||n.has(e))return;n.add(e);let i=ee(e,r.module),a=i[t].find(t=>!S(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=S(e,r)?C(r,t,n):void 0;if(i)return i}},w=e=>{g(e,t);let r=()=>C(e,`extendees`,/* @__PURE__ */ new Set)??C(e,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())m.has(e.name)||g(e.name,n(e.name),e.namingModule),x.add(`${e.importer} ${e.name}`)},E=r.rootFileName??h(``,t).name,ee=(e,t)=>{let n=xc(t);return e!==E||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};w(E),b(E,t);let D=(e,t,n,i)=>{let s={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},d=[],m=[],h=[],g=[],_=/* @__PURE__ */ new WeakSet,v=()=>g.push({labels:/* @__PURE__ */ new Map,params:[]}),y=()=>g.pop()?.labels??/* @__PURE__ */ new Map,b={depth:0,isDeclared:[],goal:void 0,goalClause:0},x=/* @__PURE__ */ new WeakMap,S=/* @__PURE__ */ new WeakMap,C=e=>{let t=e.kind===`AssumeProve`?x.get(e):void 0;t&&(t.isInProof=!1)},w=e=>J(t,q(t,e)),T=e=>e.range?Xs(t,e.range):{start:qs(t,e),end:qs(t,e)},E={kind:`Module`,id:c(),name:e.name,location:J(t,T(e.location)),extendees:[],context:fc(i),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};n&&n.definitions.push(E);let ee=e=>{for(let t=i.contexts.length-1;t>=0;t--){let n=Ds(i.contexts[t],e);if(n?.kind===`Module`)return n}return p.get(e)},O=e=>{let t=ee(e);if(t===void 0)throw new ce(`Could not find module ${e}`);return t},te=(e,t)=>{i.contexts.push(e);let n=t();return i.contexts.pop(),n},ne=(e,t,n,r)=>{let a={...K(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(i,a),a},re=e=>({...K(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:E,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ie=e=>{e.letInLevel=s.curLevel,s.unresolvedSum>0&&(e.recursiveSection=s.recursiveSectionCount,e.inRecursiveSection=s.unresolvedCount[s.curLevel]>0,E.opDefsInRecursiveSection.push(e))},oe=(e,t,n,r={},i=c())=>({...K(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),se=()=>({...oe(le(`$Nop`),[],ls,{},l.id),isNull:!0}),le=e=>{let t=f.get(e);if(!t)throw new ae(`SANY has no builtin operator ${e}`);return t},k=(e,t,n,r={})=>oe(le(e),t,n,r),ue=(e,t)=>({...K(c()),kind:`String`,value:e,location:t}),de=(e,t)=>({...K(c()),kind:`OpArg`,op:e,location:t}),fe=(e,t)=>{let n=pc(i,cc(e));if(n===void 0||n.kind===`Module`)throw new ce(`Unknown operator: \`${e}' at line ${t.beginLine}, column ${t.beginColumn} of module ${t.file}`);return n},pe=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let o=t[i];r.arity===0&&o.kind===`OpArg`&&a(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Ts(o.op)===r.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&a(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):a(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},me=Vs({version:r.version,resolveSymbol:e=>pc(i,e),resolveSynonym:cc,generateExpression:e=>N(e),generateArgument:(e,t,n,r)=>M(e,t,n,r),createOpAppl:(e,t,n)=>{let r=oe(e,t,n);return pe(e,t,n),r},createOpArg:de,createFormalParam:(e,t,n)=>ne(e,t,n,!1),createLambda:(e,n,r)=>re({name:`LAMBDA`,params:e,body:n,location:r,preComments:ic(t,qs(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>We(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:le,addError:(e,t)=>(a(e,t),se()),isOutOfLabelScope:e=>{let t=S.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=x.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),he=(e,n)=>{let r={value:n.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=oc(t,r.value,n.end,i);if(a===-1)return e;if(e.op===`Null`){let n=Ys(t,a);return r.value=n+1,{...e,location:J(t,{start:a,end:n})}}r.value=a+1;let o=$s(t,a);if(e.args===void 0||!Gs(t,a+1,`(`))return{...e,location:o};let s=Ys(t,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(t,{start:a+1,end:s})}})},A=(e,n,r,i)=>{let a=Ns(e);if(a===void 0)throw new ce(`Expected a name, found ${e.kind}`);return me(he(a,q(t,e)),n,r,i,w(e))},ge=e=>{let t=A(e,0,!1,!1);if(t.kind!==`OpAppl`)throw new ce(`Expected an expression`);return t},_e=e=>{if(e.kind!==`OpAppl`)return;let t=d.find(t=>t.name===e.operator.name);t&&(t.node.operator=le(`$RecursiveFcnSpec`))},ve=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ye=(e,t)=>Fe(e,t,ve(e).map(e=>N(e[0].set))),j=(e,t)=>{let n=g.at(-1);n?.params.push(e);let r=N(t);return n?.params.pop(),r},be=e=>{let n=q(t,e),r=ac(t,n.start,n.end,e.params);return te(Ss(),()=>{let i=e.params.map((e,n)=>ne(e,0,$s(t,r[n]),!0)),a=j(i,e.body);return re({name:`LAMBDA`,params:i,body:a,location:J(t,n),preComments:ic(t,n.start)})})},xe=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:t.tokens[qs(t,e.location)].text,Se=(e,t)=>{let n=w(e);if(e.kind===`Lambda`)return e.location.range===void 0?de(fe(xe(e),n),n):de(be(e),n);if(!Cc(e))return a(n,`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${t.name}'.`),se();if(e.kind===`OperatorReference`)return de(fe(e.operator,n),n);let r=A(e,t.arity,!1,!1);if(r.kind===`OpArg`||r.kind===`OpAppl`&&r.isNull===!0)return r;throw new ce(`Expected an operator argument at line ${n.beginLine}, column ${n.beginColumn}`)},M=(e,n,r,o)=>{let s=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[n]?.arity??0:0;if(s===0)return N(r);let c=q(t,r),l=J(t,c),u=`${n+1} (counting from 1)`,d=Qs(t,c);if(d!==c||!Cc(r))return a(J(t,d),`An expression appears as argument number ${u} to operator '${e.name}', in a position an operator is required.`),se();if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let e=A(r,s,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new ce(`Expected an operator argument at ${fs(l)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0){let t=be(r),i=Ts(t);return i===s?de(t,l):(a(o,`Lambda expression with arity ${i} used as argument ${n+1} of operator \`${e.name}', \nbut an operator of arity ${s} is required.`),se())}let f=xe(r),p=pc(i,cc(f));if(p===void 0)return a(l,`Could not find declaration or definition of symbol '${f}'.`),se();let m=Ts(p);return m===s?de(p,l):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${p.name}' of arity ${m} is argument number ${u} to operator \`${fs(e.location)}', \nbut an operator of arity ${s} was expected.`),se())},Ce=e=>{let n=w(e);if(e.isBulleted)return k(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(N),n);let r=q(t,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,n,a)=>{let s=Zs(t,q(t,n)),c=a===o.length-1?r.end:s.end;return k(i,[e,N(n)],J(t,{start:r.start,end:c}))},N(a))},we=e=>{let n=q(t,e),r=e.arms.map((r,i)=>{let a=Zs(t,q(t,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Zs(t,q(t,r.body)),c=[N(r.condition),N(r.body)];return k(`$Pair`,c,J(t,{start:a.start,end:o?n.end:s.end}))}),i=e.other;if(i){let e=Zs(t,q(t,i)),a=Te(e.start,`OTHER`);r.push(k(`$Pair`,[void 0,N(i)],J(t,{start:a,end:n.end})))}return k(`$Case`,r,J(t,n))},Te=(e,n)=>{for(let r=e;r>=0;r--)if(Gs(t,r,n))return r;return e},Ee=e=>{let n=q(t,e),r=J(t,n),i=[N(e.function)],a=k(`$Except`,i,r),o=q(t,e.function),s={value:oc(t,o.end+1,n.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=oc(t,s.value,n.end,`!`),o=Zs(t,q(t,e.value)),c=J(t,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let n=De(l.value,e.name);return l.value=n+1,ue(e.name,$s(t,n))}let r=oc(t,l.value,n.end,`[`),i=Ys(t,r);return l.value=i+1,e.args.length===1?N(e.args[0]):k(`$Tuple`,e.args.map(N),J(t,{start:r,end:i}))}),d=k(`$Seq`,u,c),f=k(`$Pair`,[d],c);h.push(f),m.push(a),f.operands.push(N(e.value)),h.pop(),m.pop(),i.push(f),s.value=o.end+1}),a},De=(e,n)=>{for(let r=e;r<t.tokens.length;r++)if(t.tokens[r].text===n&&t.tokens[r].kind!==`String`)return r;return e},Oe=(e,n)=>{let r=q(t,n),i={value:r.start+1},o=n.fields.map((e,r)=>{let o=De(i.value,e.name),s=Zs(t,q(t,e.value));return i.value=s.end+1,n.fields.slice(0,r).some(t=>t.name===e.name)&&a($s(t,o),`Non-unique fields in constructor.`),k(`$Pair`,[ue(e.name,$s(t,o)),N(e.value)],J(t,{start:o,end:s.end}))}),s=k(e,o,J(t,r));return E.records.push(s),s},ke=e=>({line:t.tokens[e].line,column:t.tokens[e].column}),Ae=e=>{let n=[],r=e;for(;t.tokens[r]?.kind===`Identifier`;){let e=Gs(t,r+1,`(`)?Ys(t,r+1):r,i=t.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(n.push({name:t.tokens[r].text,arity:i,location:{...ke(r),range:{module:t.name,start:ke(r),end:ke(e)}}}),!Gs(t,e+1,`,`))break;r=e+2}return n},je=e=>{let n=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Re(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Re(e)}))],r=q(t,e).start,i=Zs(t,q(t,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=n.some(t=>t.span.start<=e&&e<=t.span.end);Gs(t,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ae(e+1)},span:{start:e,end:e}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Me=e=>{let t=Ss();return te(t,()=>{s.curLevel++,s.unresolvedCount[s.curLevel]=0;let n=[],r=[];je(e).forEach(e=>{e.kind===`Recursive`?He(e.declarations):e.kind===`Instance`?Ge(e.instance,n,r):e.definition.kind===`Function`?Ve(e.definition,n):ze(e.definition,n)}),F(),s.curLevel=Math.max(s.curLevel-1,0);let i=N(e.body);return{...K(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:w(e)}})},Ne=e=>{let n=q(t,e),r=J(t,n);return te(Ss(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=ac(t,n.start,n.end,a),s=a.map((e,r)=>ne(e,0,$s(t,i.kind===`Name`?n.start:o[r]),!0)),c=j(s,e.body);return k(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=N(e.set),s=q(t,e.set),c=ac(t,n.start,s.start,a),l=a.map((e,n)=>ne(e,0,$s(t,c[n]),!0)),u=j(l,e.body);return k(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Pe=e=>{if(uc(e.operator)||dc(e.operator)||e.args.length>2||pc(i,cc(e.operator))!==void 0)return;let n=q(t,e);if(t.tokens[n.start].text===e.operator&&Gs(t,n.start+1,`(`))return;let r=Zs(t,q(t,e.args[0])),a=e.args.length===1&&r.start!==n.start,o=a?n.start:r.end+1,s=tc(t,o);return{index:o,name:a&&s===`-`?`-.`:s,fixity:a?`prefix`:e.args.length===2?`infix`:`postfix`}},N=e=>{let n=w(e);switch(e.kind){case`Number`:return{...K(c()),kind:`Numeral`,value:kc(e.text??String(e.value)),location:n};case`Decimal`:{let[t,r]=e.text.split(`.`),i=BigInt(t+r),a=i<=9223372036854775807n;return{...K(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:t,fractionalPart:r,location:n}}case`String`:return ue(e.value,n);case`Identifier`:{let t=ge(e);return _e(t),t}case`Apply`:{let r=Pe(e);if(r!==void 0)return a($s(t,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...se(),isAbsent:!0};let i=ge(e);return(dc(e.operator)||uc(e.operator))&&_e(i),i}case`Bracket`:return a($s(t,q(t,e).start),"Unsupported expression type `['."),{...se(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=t.tokens[q(t,e).start].text;return a(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Dc(e,r)}'.`),{...se(),isAbsent:!0}}case`And`:case`Or`:return Ce(e);case`Prime`:return k(`'`,[N(e.expression)],n);case`Unchanged`:return k(`UNCHANGED`,[N(e.expression)],n);case`Enabled`:return k(`ENABLED`,[N(e.expression)],n);case`Always`:return k(`[]`,[N(e.expression)],n);case`Eventually`:return k(`<>`,[N(e.expression)],n);case`If`:return k(`$IfThenElse`,[N(e.condition),N(e.consequent),N(e.alternative)],n);case`Case`:return we(e);case`Let`:return Me(e);case`Forall`:case`Exists`:{let r=q(t,e);return te(Ss(),()=>{let t=ye(e.bounds,r.start),i=j(t.bounded.flat(),e.body);return k(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],n,t)})}case`UnboundedQuantifier`:{let r=q(t,e),i=q(t,e.body),a=ac(t,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return te(Ss(),()=>{let r=e.names.map((e,n)=>ne(e,0,$s(t,a[n]),!0)),i=j(r,e.body);return k(o,[i],n,{unbounded:r})})}case`Choose`:return Ne(e);case`SetEnumeration`:return k(`$SetEnumerate`,e.elements.map(N),n);case`Tuple`:return k(`$Tuple`,e.elements.map(N),n);case`SetFilter`:{let r=N(e.bound.set),i=q(t,e);return te(Ss(),()=>{let t=Fe([e.bound],i.start,[r]),a=j(t.bounded.flat(),e.predicate);return k(`$SubsetOf`,[a],n,t)})}case`SetMap`:{let r=q(t,e.expression);return te(Ss(),()=>{let t=ye(e.bounds,r.end+1),i=j(t.bounded.flat(),e.expression);return k(`$SetOfAll`,[i],n,t)})}case`FunctionConstruction`:{let r=q(t,e);return te(Ss(),()=>{let t=ye(e.bounds,r.start),i=j(t.bounded.flat(),e.body);return k(`$FcnConstructor`,[i],n,t)})}case`FunctionSet`:return k(`$SetOfFcns`,[N(e.domain),N(e.range)],n);case`Record`:return Oe(`$RcdConstructor`,e);case`RecordSet`:return Oe(`$SetOfRcds`,e);case`Except`:return Ee(e);case`ExceptAt`:{let e=m[m.length-1],t=h[h.length-1];return e===void 0||t===void 0?(a(n,`@ used where its meaning is not defined.`),se()):{...K(c()),kind:`At`,except:e,component:t,location:t.location}}case`FunctionApplication`:{let t=N(e.function);if(ps(t))return t;_e(t);let r=e.args.length===1?N(e.args[0]):k(`$Tuple`,e.args.map(N),n);return k(`$FcnApply`,[t,r],n)}case`FieldAccess`:{let r=N(e.record),i=q(t,e);return k(`$RcdSelect`,[r,ue(e.field,$s(t,i.end))],n)}case`Product`:return k(`$CartesianProd`,e.factors.map(N),n);case`BoxAction`:case`AngleAction`:return k(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[N(e.action),N(e.subscript)],n);case`WeakFairness`:case`StrongFairness`:return k(e.kind===`WeakFairness`?`$WF`:`$SF`,[N(e.subscript),N(e.action)],n);case`Label`:return Ie(e);case`Subexpression`:return ge(e)}},Fe=(e,n,r)=>{let i=ve(e),a={value:n};return{bounded:i.map(e=>{let n=q(t,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=ac(t,a.value,n.start,r);return a.value=n.end+1,r.map((e,n)=>ne(e,0,$s(t,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ie=e=>{let n=w(e),r=g.at(-1);if(r===void 0)return a(n,`Label not in definition or proof step.`),se();if(b.isDeclared.slice(2,b.depth+1).some(Boolean))return a(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),se();if(m.length>0&&h.length>0)return a(n,`Labels inside EXCEPT clauses are not yet implemented.`),se();v();let o=N(e.body),s=y(),l=ac(t,q(t,e).start,q(t,e.body).start,e.params),u=e.params.map((n,r)=>{let o=pc(i,n);if(o?.kind===`FormalParam`)return o;let s=$s(t,l[r]);return a(s,`Illegal parameter ${n} of label \`${e.name}'.`),ne(n,0,s,!1)}),d={...K(c()),kind:`Label`,name:e.name,params:u,body:o,labels:s,isAssumeProve:!1,location:n},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&a(n,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||a(n,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);a(n,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(n,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=b.goal;return p&&S.set(d,{scope:p,clause:b.goalClause}),d},Le=(e,n,r)=>{let i={value:n.start};return e.params.map(e=>{let n=e.location?qs(t,e.location):De(i.value,e.name),a=dt(n,e.arity);return i.value=a.end+1,ne(cc(e.name),e.arity,J(t,a),r)})},Re=e=>{let n=T(e.location);return e.isLocal&&!Gs(t,n.start,`LOCAL`)&&Gs(t,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},ze=(e,n)=>{let r=Re(e),o=J(t,r),c=cc(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},d=te(Ss(),()=>{let t=Le(e,l,!0),n=pc(i,c);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===s.curLevel?e||a(o,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(o,`Recursive operator ${c} defined at wrong LET/IN level.`)}else n!==void 0&&a(o,`Operator ${c} already defined or declared.`);return v(),{params:t,body:N(e.body),existing:n}}),f=y(),p=d.existing,m=d.params,h=ic(t,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===s.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Be(p,d.body,o,h),E.definitions.push(p),n?.push(p);return}let g=re({name:c,params:m,body:d.body,isLocal:e.isLocal,location:o,preComments:h,labels:f});u(i,g),ie(g),E.definitions.push(g),n?.push(g)},Be=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(s.unresolvedCount[s.curLevel]--,s.unresolvedSum--)},Ve=(e,n)=>{let r=Re(e),o=J(t,r),c=Ss(),l=e.isLocal?r.start+1:r.start,f=te(c,()=>ye(e.bounds,l+1)),p=pc(i,e.name),m=te(c,()=>ne(e.name,0,o,p===void 0)),h=k(`$NonRecursiveFcnSpec`,[],o,{unbounded:[m],...f}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===s.curLevel;_?p.arity!==0&&a(o,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?a(o,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&a(o,`Function name \`${e.name}' already defined or declared.`);let b=ic(t,r.start),x=p===void 0?re({name:e.name,params:[],body:h,isLocal:e.isLocal,location:o,preComments:b}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Be(p,h,o,b):p===void 0&&x!==void 0&&(u(i,x),ie(x)),x!==void 0&&(E.definitions.push(x),n?.push(x)),d.unshift({name:e.name,node:h}),v();let S=()=>j(f.bounded.flat(),e.body),C=x===void 0?S():te(c,S),w=y();x!==void 0&&(x.labels=w),d.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},P=[],He=e=>{s.unresolvedSum===0&&s.recursiveSectionCount++,s.unresolvedCount[s.curLevel]+=e.length,s.unresolvedSum+=e.length,e.forEach(e=>{let n=ft(e);c();let r=Array.from({length:e.arity},()=>ne(``,0,void 0,!1)),a=re({name:cc(e.name),params:r,location:J(t,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:s.recursiveSectionCount,letInLevel:s.curLevel});u(i,a),P.push(a),E.opDefsInRecursiveSection.push(a)})},F=()=>{s.unresolvedCount[s.curLevel]!==0&&(P.filter(e=>e.letInLevel===s.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),s.unresolvedSum-=s.unresolvedCount[s.curLevel])},Ue=(e,n,o)=>{c();let s=bs(n.table).filter(e=>e.kind===`OpDecl`),l=s.flatMap(e=>{let t=pc(i,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?oe(t,[],o):de(t,o),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?Ts(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&a(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Re(e),f={value:oc(t,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=oc(t,f.value,d.end,e.name);r!==-1&&(f.value=q(t,e.expression).end+1);let i=Es(n,cc(e.name));if(i?.kind!==`OpDecl`){a(r===-1?o:$s(t,r),`Identifier '${r===-1?e.name:tc(t,r)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=i.arity===0?N(e.expression):Se(e.expression,i);u(i,s);let c=l.find(e=>e.op.name===i.name);c&&!c.isImplicit?a(w(e.expression),`Multiple substitutions for symbol '${i.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:i,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(o,`Substitution missing for symbol ${e.name} declared at ${fs(e.location)} \nand instantiated in module ${E.name}.`)),l},We=(e,t,n,r,i,o=E)=>(ps(n)&&a(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
42
|
-
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...K(c()),kind:e,substs:t,body:n,instantiatingModule:o,instantiatedModule:r,location:i}),Ge=(e,n,a)=>{let o=Re(e),s=J(t,o),l=ic(t,o.start),d=e.name??``,f=Ss(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&i.contexts.push(f);let m=Le(e,{start:p,end:o.end},e.params.length>0),h=O(e.module),g=h.context,_=Ue(e,g,s);e.params.length>0&&i.contexts.pop(),bs(g.table).forEach(t=>{if(t.kind!==`OpDef`||t.isLocal||t.defKind!==`UserDefined`&&t.defKind!==`ModuleInstance`)return;let r=[...m,...t.params??[]],a=`${d}!${t.name}`,o=t.defKind===`UserDefined`?re({name:a,params:r,body:_.length>0&&t.body?We(`SubstIn`,_,t.body,h,s):t.body,isLocal:e.isLocal,location:s,source:t.source??t,preComments:l,labels:t.labels}):re({defKind:`ModuleInstance`,name:a,params:r,isLocal:e.isLocal,location:s,module:t.module,source:t.source??t,preComments:l});u(i,o),t.defKind===`UserDefined`&&ie(o),(n??E.definitions).push(o)}),bs(g.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let r=_.length>0?We(`APSubstIn`,_,t.body,h,s):t.body,a={...K(c()),kind:`ThmOrAssumpDef`,name:`${d}!${t.name}`,isTheorem:t.isTheorem,body:r,params:[...m,...t.params],isLocal:e.isLocal,location:s,module:E,source:t.source??t,labels:t.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};u(i,a),(n??E.definitions).push(a)});let v={...K(c()),kind:`Instance`,name:d,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(a??E.topLevel).push(v);let y=re({defKind:`ModuleInstance`,name:d,params:m,isLocal:e.isLocal,location:s,preComments:l});u(i,y),r.version!==`1.7.4`&&n?.push(y)},I=(e,n=!0,r)=>{let a=Re(e),o=r??J(t,a),s=ic(t,a.start),l=O(e.module),d=l.context,f=Ue(e,d,o),p=e.isLocal,m=_c(l);bs(d.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=re({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return u(i,r),r},n=()=>(u(i,e),e),r=e.module===void 0||_c(e.module),a=m||r?p?t(e.module,e.body):n():t(E,e.body&&We(`SubstIn`,f,e.body,l,o));E.definitions.push(a),ie(a)}),bs(d.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let t=(t,n)=>{let r={...e,...K(c()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return u(i,r),r},r=m?p?t(e.module,e.body):(u(i,e),e):_c(e.module)?p?t(E,e.body):e:t(E,We(`APSubstIn`,f,e.body,l,o));n&&E.definitions.push(r)});let h={...K(c()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:l,substs:f,location:o};return n&&E.topLevel.push(h),h},Ke=e=>{let n=ee(e.name)??(e.name===E.name?E:void 0);return n===void 0?(a($s(t,qs(t,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[n]},qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);let t=Ns(e);if(t===void 0||!Ps(t))return[N(e)];let n=A(e,0,!0,!1);if(n.kind===`ThmOrAssumpDef`)throw new ce(`Expected a fact`);return[n]}),Je=e=>Gs(t,e.start,`(`)&&Ys(t,e.start)===e.end,Ye=e=>Zs(t,q(t,e)),Xe=(e,n)=>Ye(e.args[0]).start===n.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:t.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ze=(e,n)=>Je(n)?`N_ParenExpr`:e.kind===`String`?tc(t,n.start):e.kind===`Apply`?Xe(e,n):wc.get(e.kind),Qe=(e,t)=>{if(e.kind===`String`&&!Je(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ze(e,t);return n===void 0||Tc.has(n)?void 0:!0},$e=(e,n)=>{let r=(e,t=Ye(e))=>({last:t,lastKind:Ze(e,t)});if(Je(n))return{hasChildlessFirstChild:!1,...r(e,{start:n.start+1,end:n.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:t.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Qe(e.expression,Ye(e.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=e.kind===`FunctionApplication`?e.function:e.record,r=Ye(n),i=r.end+1;return{hasChildlessFirstChild:Qe(n,r),last:{start:i,end:i},lastKind:t.tokens[i].text}}case`Apply`:{let t=Xe(e,n);if(t===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(t===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:n.start+1,end:n.end})};let i=Ye(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Qe(e.args[0],i),last:{start:a,end:a},lastKind:t===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},et=e=>{let n=Zs(t,q(t,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Je(n))return!1;let r=$e(e,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=J(t,r.last);return r.hasChildlessFirstChild&&a(J(t,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?a(i,"Selector `!(...)' should not have argument(s)."):(a(i,`Unexpected token found.`),a(i,`Need name or step number here, not \`${r.lastKind}'.`)),a(J(t,n),`DEF clause entry should describe a defined operator.`),!0},tt=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);if(et(e))return[];let t=A(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(a(w(e),`DEF clause entry should describe a defined operator.`),[])}),nt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||a(t,`Empty BY, USE, or HIDE`)},rt=e=>{let n=J(t,T(e.location));nt(e,n);let r=qe(e.facts),i=tt(e.defs);return r.length+i.length===0&&a(n,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>a(e.location,`The only expression allowed as a fact in a HIDE is
|
|
43
|
-
the name of a theorem, assumption, or step.`)),{...K(c()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:n}},it=e=>{let n=T(e.location),r=e.set&&N(e.set),a=De(n.start,e.name),o=lc[e.level],s={...K(c()),levelChecked:1,level:o.level,kind:`OpDecl`,name:cc(e.name),arity:e.arity,declKind:o.declKind,location:J(t,dt(a,e.arity)),module:E};return u(i,s),{...K(c()),kind:`NewSymb`,declaration:s,set:r,location:J(t,n)}},at=(e,n,r)=>{let o=T(e.location),s=nc(t,o.start-1),l=q(t,e.conclusion).start,u=t.tokens.findLastIndex((e,t)=>t<l&&e.kind===`Keyword`&&e.text===`PROVE`),d=J(t,{start:s?o.start-1:o.start,end:o.start});s!==nc(t,u-1)&&a(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=c();n>1&&i.contexts.push(Ss()),s&&i.contexts.some(e=>_.has(e))&&a(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||_.add(fc(i));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};b.depth=n,b.isDeclared[n]=!1,n===1&&(b.goal=r&&p,b.goalClause=0);let m=e.assumptions.map((e,t)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?at(e,n+1):r?it(e):N(e);return b.depth=n,r&&(b.isDeclared[n]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[t]||r),n===1&&b.goalClause++,i}),h=N(e.conclusion);n>1&&i.contexts.pop(),b.depth=n-1,n===1&&(b.goal=void 0);let g={...K(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:J(t,{start:s?o.start-1:o.start,end:o.end})};return x.set(g,p),g},ot=(e,t,n,r,i,a=!0)=>({...K(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:E,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),st=e=>{let n=J(t,T(e.location));e.kind===`By`&&nt(e,n);let r=e.kind===`By`?qe(e.facts):[],i=e.kind===`By`?tt(e.defs):[];return e.kind===`By`&&c(),e.kind===`By`&&r.length+i.length===0&&a(n,`Empty BY`),{...K(c()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:n}},ct=(e,n)=>{let r=e.body,a=J(t,n);switch(r.kind){case`Have`:return{node:k(`$Have`,[N(r.expression)],a),isPick:!1};case`Case`:return{node:k(`$Pfcase`,[N(r.expression)],a),isPick:!1};case`Witness`:return{node:k(`$Witness`,r.expressions.map(N),a),isPick:!1};case`Qed`:return{node:k(`$Qed`,[],a),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&i.contexts.push(Ss());let s=e=>r.kind===`Pick`?[j(e,r.body)]:[];if(r.bounds.length>0){let t=ye(r.bounds,n.start),i=s(t.bounded.flat());return{node:k(o,i,a,t),isPick:e}}let c=ac(t,n.start,n.end+1,r.names),l=r.names.map((e,n)=>ne(e,0,$s(t,c[n]),!0)),u=s(l);return{node:k(o,u,a,{unbounded:l}),isPick:e}}}},lt=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let n=Zs(t,q(t,e.args[0])),r=q(t,e).start;return n.start===r&&!Gs(t,n.end+1,`(`)},ut=e=>{if(e.kind!==`Steps`)return st(e);let n=Ss();i.contexts.push(n);let r=[],a=[],o={previousRight:void 0},s=(e,n,i)=>{if(e.kind===`Define`){let n=e.definitions.map(e=>{let t=[];e.kind===`Instance`?Ge(e,t,r):e.kind===`Function`?Ve(e,t):ze(e,t);let n=t[e.kind===`Instance`?t.length-1:0];if(n?.kind!==`OpDef`)throw new ce(`A DEFINE step defines no operator`);return n});return{...K(c()),kind:`DefStep`,defs:n,location:J(t,i)}}if(e.kind===`Use`||e.kind===`Hide`)return{...rt(e),location:J(t,n)};if(e.kind===`Instance`)return I(e,!1,J(t,i))},l=e.steps.map(e=>{let n=T(e.location),r=Xs(t,e.head),l={start:r.start+1,end:r.end},d=e.body;e.name!==void 0&&v();let f=e.name===void 0?void 0:c();d.kind!==`Assert`&&(o.previousRight=void 0);let p=s(d,n,l);if(p!==void 0)return e.name!==void 0&&u(i,re({defKind:`NumberedProofStep`,name:e.name,location:J(t,n),labels:y(),step:p})),p;let m=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;m&&(o.previousRight=void 0);let h=d.kind===`Assert`&&d.isSuffices,g=Ss(),_=d.kind===`Assert`?{node:(n=>{if(n.kind===`AssumeProve`){let t=te(g,()=>at(n,1,e.name===void 0?void 0:{isSuffices:h}));return t.isSuffices=h,t}if(h){let e=N(n);return k(`$Suffices`,[e],J(t,l))}let r=o.previousRight,i=r!==void 0&&n.kind===`Apply`&<(n)&&n.args[0].kind===`ExceptAt`,a=i?N(n.args[1]):void 0,s=i?oe(fe(n.operator,w(n)),[k(`$Nop`,[r],w(n.args[0])),a],w(n)):N(n),c=s.kind===`OpAppl`?s.operands[1]:void 0;return o.previousRight=lt(n)?c:void 0,s})(d.statement),isPick:!1}:ct(e,l);if(_===void 0)throw new ce(`Unexpected proof step ${d.kind}`);let b=_.isPick?i.contexts.pop():void 0,x=e.name===void 0||f===void 0?void 0:ot(f,e.name,_.node,$s(t,qs(t,e.location)),y());x&&u(i,x);let S=m&&!h;S&&i.contexts.push(g);let E=e.proof&&ut(e.proof);return S&&i.contexts.pop(),C(_.node),m&&h&&(a.push(g),i.contexts.push(g)),b?.symbols.forEach(e=>u(i,e)),{...K(c()),kind:`Theorem`,definition:x,body:_.node,proof:E,isSuffices:h,location:J(t,n)}});return a.forEach(()=>{i.contexts.pop()?.symbols.forEach(e=>ws(n,e))}),i.contexts.pop(),{...K(c()),kind:`NonLeafProof`,steps:l,instances:r,proofLevel:e.level,location:J(t,T(e.location))}},L=e=>{let n=J(t,T(e.location)),r=e.statement,a=Ss();e.name!==void 0&&v();let o=e.name===void 0?void 0:c();r.kind===`AssumeProve`&&i.contexts.push(a);let s=r.kind===`AssumeProve`?at(r,1,e.name===void 0?void 0:{isSuffices:!1}):N(r),l=e.name===void 0||o===void 0?void 0:ot(o,e.name,s,n,y());l&&(r.kind===`AssumeProve`&&i.contexts.pop(),u(i,l),E.definitions.push(l),r.kind===`AssumeProve`&&i.contexts.push(a));let d=e.proof&&ut(e.proof);r.kind===`AssumeProve`&&i.contexts.pop(),C(s);let f={...K(c()),kind:`Theorem`,definition:l,body:s,proof:d,isSuffices:!1,location:n};E.topLevel.push(f)},R=e=>{let n=T(e.location),r=J(t,n);e.name!==void 0&&v();let a=N(e.expression),o=e.name===void 0?void 0:ot(c(),e.name,a,r,y(),!1);o&&(u(i,o),E.definitions.push(o));let s={...K(c()),kind:`Assume`,definition:o,body:a,location:r};E.topLevel.push(s)},dt=(e,n)=>n===0?{start:e,end:e}:Gs(t,e,`_`)?{start:e,end:Gs(t,e+2,`_`)?e+2:e+1}:Gs(t,e+1,`(`)?{start:e,end:Ys(t,e+1)}:{start:e,end:Gs(t,e+1,`_`)?e+1:e},ft=e=>dt(T(e.location).start,e.arity),pt=(e,n)=>{let r=ft(e);e.name===`@`&&n===3&&a(J(t,r),`Attempted to declare '@' as a variable.`);let o={...K(c()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:cc(e.name),arity:e.arity,declKind:n,location:J(t,r),module:E};return n===2&&(o.levelParams.add(o),o.allParams.add(o)),u(i,o),o};e.extends.forEach(e=>{let t=O(e);E.extendees.push(t);let n=fc(i);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Ds(n,e.name):Es(n,e.name);t===void 0?ws(n,e):t!==e&&t.kind!==e.kind?a(e.location,`The ${hc(e)} of '${e.name}' conflicts with \nits ${hc(t)} at ${fs(t.location)}.`):t!==e&&!gc(t,e)&&o(e.location,`Warning: the ${hc(t)} of '${e.name}' conflicts with \nits ${hc(t)} at ${fs(t.location)}.`)}),E.topLevel.push(...t.topLevel)});let mt=(e,n)=>{s.unresolvedSum!==0&&a(J(t,T(e)),`${n} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:He(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Ve(e.definition,void 0):ze(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?I(e.instance):Ge(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),R(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),L(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),E.topLevel.push(rt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let n={contexts:[...i.contexts,Ss()]},r=D(e.module,t,E,n),o=ee(r.name);o===void 0?ws(fc(i),r):o!==r&&a(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${fs(o.location)}.`);break}}}),F(),E},O=_.map(e=>{r.onAnalyze?.(e),l.id=Array.from({length:4},c)[1];let t=g(e,void 0),n=Ss();d.toReversed().forEach(e=>ws(n,e));let a=D(t.module,t.file,void 0,{contexts:[n]});return p.set(e,a),r.onModule?.(a,i),a});return{root:O[O.length-1],modules:O,messages:i}},kc=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},Ac=(e,t,n,r)=>ds(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},jc=(e,t,n)=>`${e.id}:${t}:${n.id}`,Mc=(e,t,n,r)=>{e.set(jc(t,n,r),{op:t,index:n,param:r})},Nc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Pc=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Fc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Pc(e,r,t)})},Ic=(e,t)=>`${e.id}:${t}`,Lc=(e,t,n,r)=>{let i=Ic(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Rc=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Lc(e,t.param,t.position,t.level)})},zc=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Bc=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Fc(e.levelConstraints,t.levelConstraints),Rc(e.argLevelConstraints,t.argLevelConstraints),Nc(e.argLevelParams,t.argLevelParams)},Vc=(e,t)=>t.includes(e.op)||t.includes(e.param),Hc=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Uc=e=>e.kind!==`Module`,Wc=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Gc=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Kc=(e,t)=>e.kind===`OpDef`?e.weights[Gc(e,t)]??0:0,qc=(e,t)=>e.maxLevels[Gc(e,t)]??3,Jc=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Yc=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Gc(e,t)]??!0:e.isLeibnizArg[t]??!0,Xc=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Zc=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Qc=(e,t)=>t.find(t=>t.op===e)?.expr,$c=(e,t,n)=>{let r=Qc(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},el=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Qc(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Hc(i.op))return;let a=i.op;$c(e.param,t,!1).forEach(t=>Mc(n,a,e.index,t))}),n},tl=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;$c(r,t,!1).forEach(e=>Pc(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Qc(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=qc(n.op,e.index);$c(e.param,t,!1).forEach(e=>Pc(a,e,o))}),a},nl=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Qc(e.param,t);n===void 0?Lc(i,e.param,e.position,e.level):n.kind===`OpArg`&&Hc(n.op)&&Lc(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Qc(e.param,t);if(a===void 0)return;let o=Qc(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Hc(s)&&(X(a,n,r),Lc(i,s,e.index,a.level))}),i},rl=(e,t)=>ks(e,3).length>0||(fl(e,t),Os(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),il=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Ic(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(jc(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Ic(t,n))}),Nc(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},al=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>qc(t,o)&&(n&&X(a,r,i)&&Ac(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Wc(a.op)))return;let s=a.op;X(s,r,i);let c=Ts(s);for(let l=0;l<c;l++){let c=Jc(t,o,l);qc(s,l)>=c||(n&&X(a,r,i)&&Ac(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!Xc(t,o,l,u)||n.level<=qc(s,u)||(X(a,r,i)&&X(n,r,i)&&Ac(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&Ac(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${fs(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},ol=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Fc(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Fc(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Fc(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=qc(t,r);n?.levelParams.forEach(t=>Pc(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Wc(n.op))return;let o=n.op;X(o,r,i);let s=Ts(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!Xc(t,a,r,i))continue;let s=qc(o,i);n?.levelParams.forEach(t=>Pc(e.levelConstraints,t,s)),!o.isLeibniz&&!Yc(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Wc(n.op)&&(X(n.op,r,i),Pc(e.levelConstraints,t.param,qc(n.op,t.index)))}),Rc(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Rc(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Rc(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Hc(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Lc(e.argLevelConstraints,i,n,Jc(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xc(t,r,a,o)&&Lc(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Lc(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Nc(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Nc(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Mc(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Hc(a.op)&&Mc(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Hc(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xc(t,r,a,o)&&n.levelParams.forEach(t=>Mc(e.argLevelParams,i,o,t))})})},sl=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),cl=(e,t)=>{let n=(n,r)=>{Ac(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=sl.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},ll=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Wc(i)){let r=X(i,t,n);al(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Kc(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Kc(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Yc(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(Zc(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),ol(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Fc(e.levelConstraints,t.levelConstraints),Lc(e.argLevelConstraints,i,n,t.level),Rc(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Mc(e.argLevelParams,i,n,t)),Nc(e.argLevelParams,t.argLevelParams)});return cl(e,n),e.levelCorrect},ul=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),il(e,i,r),e.levelCorrect},dl=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),il(e,e.params,e.body)),e.levelCorrect),fl=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),ul(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Ac(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),ul(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(fl(e,t)));let a=Os(e);return a.forEach(e=>i(ul(e,1,t))),As(e).forEach(e=>i(dl(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),rl(e,t)||ks(e,2).forEach(t=>Pc(e.levelConstraints,t,0)),a.forEach(t=>{Fc(e.levelConstraints,t.levelConstraints),Rc(e.argLevelConstraints,t.argLevelConstraints),Nc(e.argLevelParams,t.argLevelParams,e=>!Vc(e,t.params??[]))}),e.topLevel.forEach(t=>{Fc(e.levelConstraints,t.levelConstraints),Rc(e.argLevelConstraints,t.argLevelConstraints),Nc(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},pl=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Uc(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Bc(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),ml=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&Ac(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Ac(t,e.body.location,`Non-constant CASE for temporal goal.`),ml(e.proof,t)):n===`$Qed`&&ml(e.proof,t)})},hl=(e,t,n,r,i,a)=>{e.levelConstraints=tl(t,n,r,i,a),e.argLevelConstraints=nl(t,n,i,a),e.argLevelParams=el(t.argLevelParams,n)},gl=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;fl(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=rl(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Ac(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||Ac(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&Ac(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Ic(i.op,t))?.level;a===void 0||qc(o,t)>=a||(s&&Ac(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=qc(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Ac(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Fc(e.levelConstraints,tl(r,e.substs,i,t,n),a),e.substs.forEach(t=>Fc(e.levelConstraints,t.expr.levelConstraints,a)),Rc(e.argLevelConstraints,nl(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Rc(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Nc(e.argLevelParams,el(r.argLevelParams,e.substs),t=>!Vc(t,e.params)),e.substs.forEach(t=>Nc(e.argLevelParams,t.expr.argLevelParams,t=>!Vc(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Uc(e))return fl(e,n);switch(e.kind){case`OpAppl`:return ll(e,t,n);case`OpDef`:return ul(e,t,n);case`ThmOrAssumpDef`:return dl(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,zc(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Fc(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Fc(e.levelConstraints,t.levelConstraints)),Rc(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Rc(e.argLevelConstraints,t.argLevelConstraints)),Nc(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Nc(e.argLevelParams,t.argLevelParams,e=>!Vc(e,n))}),e.instances.forEach(t=>Nc(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,zc(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Bc(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,$c(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,$c(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=rl(e.instantiatedModule,n);return hl(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return gl(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,zc(e,e.body),e.level!==0&&Ac(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=pl(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&Ac(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&ml(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return pl(e,e.facts,t,n);case`NonLeafProof`:return pl(e,[...e.steps,...e.instances],t,n);case`DefStep`:return pl(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,Ac(n,e.location,`Level error:
|
|
44
|
-
Temporal formula used as set.`)),zc(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Bc(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Pc(e.levelConstraints,t,2)})),e.levelCorrect}},_l=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},vl=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),yl=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&vl.get(e)===t.name||n(t))return!0}}return _l(e).some(n)};return n(e)},bl=e=>e.operands.filter(e=>e?.kind===`OpAppl`),xl=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Sl=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(bl(t).map(e=>xl(e)?.value));return bl(e).every(e=>n.has(xl(e)?.value))},Cl=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Cl(e,t))}),t),wl=e=>{let t=[...[...Cl(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Sl(e,n)).flatMap(bl).some(yl)?[]:bl(n).flatMap(t=>{let n=xl(t),r=n&&Es(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${fs(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Tl=e=>`${fs(e.location)}\n\n${e.text}`,El=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Tl(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Tl(e)}\n\n\n`)].join(``)},Dl=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ol=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},kl=e=>{try{return ne(rc(e))}catch(e){if(e instanceof ce)return;throw e}},Al=(t,n)=>n===`1.7.4`&&e(t)!==void 0?void 0:kl(t)?.name,jl=(e,t=()=>void 0,n={})=>{let r=ve(e,`.tla`),a=m(n.version),o=n.fileName??r,s=M(e)?Te(e,`utf8`):a.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,M(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},x=ao(_a(),u),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),E=e=>{let t=S.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=ss(x,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},ee=(e,t)=>{if(n.isXmlExport||S.has(e))return;let r=kl(t);if(r===void 0||r.name!==e)return;let i=[...S.values()].filter(t=>Ol(t.module).includes(e));S.set(e,{text:t,module:r}),i.forEach(()=>E(e)),Ol(r).filter(t=>t!==e&&S.has(t)).forEach(E)},D=()=>{if(w(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${Tl(e)}\n\n\n`))),e.length!==v.length&&(u(El(v)),_.value=!0,y.isAborted=!0)},O=e=>{let n=a.get(e),r=t(e),o=r===void 0&&n===void 0&&s!==void 0&&!d?i(s,e):void 0,c=r??o;return g.set(e,r===void 0?o===void 0?`standard`:`root file`:`file`),c!==void 0&&ee(e,c),c??n},te=(()=>{try{if(s===void 0)throw new T(`Cannot find source file for module ${o}`,void 0);return ee(r,s),Oc(s,O,{rootFileName:r,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&E(r),w()},onAnalyze:e=>{D(),(h||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&fl(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${El(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Tl(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Tl(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof b){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(El(v));return}if(!(e instanceof T))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Tl(t)}\n\n\n`);return}u(Tl(t)),u(El(y.isReported?[t]:[...v,t]))}})();if(te!==void 0&&D(),te!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=te.modules.filter(e=>!Dl.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(wl).forEach(e=>u(`${Tl(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:te}},Ml={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Nl=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Pl={"&":`&`,"<":`<`,">":`>`,"\r":` `},Fl=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Pl[e]),Il=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Ll=e=>{let t=(e.cdata??e.text)?.match(Il)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Ll(t);if(e)return e}},Rl=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Fl(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Rl(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},zl=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Bl=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Vl={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Hl={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ul=fs(`--TLA+ BUILTINS--`),Wl=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Gl=(e,t=16)=>e>t*.75?Gl(e,t*2):t,Kl=(e,t)=>(e^e>>>16)&t-1,ql=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Jl=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Yl=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Xl=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=ql(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Yl,``)}).join(`
|
|
45
|
-
`)},Zl=e=>{let t=ql(e),n=e=>Jl(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
46
|
-
`)},Ql=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o={isSet:!1},s=[],c=(e,t)=>{if(!r)return t();s.push(...e);let n=t();return s.length-=e.length,n},l=(e,t)=>{let n=[...s,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
47
|
-
`),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return x(new re(r,i),Ml.uncaughtException)},u=e=>l(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),d=(e,t)=>(i.has(e.id)||(i.add(e.id),a.set(e.id,c([...t?[t]:[],...Wl(e.kind,fs(e.location))],()=>h(e)))),Z(Bl(e),[Q(`UID`,e.id)])),f=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[zl(n),...r]:r;return{...e,children:[...i,...e.children]}},p=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[d(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),m=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
48
|
-
`),r=n.isUncommented?Zl(Xl(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},h=e=>{switch(e.kind){case`FormalParam`:return f(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return f(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?l(Nl(37),[Hl]):x(new ae(Nl(37)),Ml.uncaughtException);if(e.defKind===`ModuleInstance`)return f(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return f(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[p(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,i=e.module;if(n===void 0&&r)throw u($.body);if(n===void 0||i===void 0)throw Error(`The definition of ${e.name} has no body`);return f(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[b(n,$.body)]),...e.params?[p(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[d(e.source??e)]),Z(`originallyDefinedInModule`,[d(i)]),Z(`body`,[b(n,$.body)]),p(t,e.isLeibnizArg,$.param),...m(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return f(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),b(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[zl(e.location),...g(e)]);case`Theorem`:return f(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[d(e.definition,$.theoremDefinition)])]:[],Z(`body`,[b(e.body,$.theorem)]),...e.proof?[b(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[zl(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[d(e.definition,$.assumeDefinition)])]:[],Z(`body`,[b(e.body,$.assume)])])}},g=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...ks(e,2).filter(t).map(e=>d(e,$.constant)),...ks(e,3).filter(t).map(e=>d(e,$.variable)),...Os(e).filter(t).map(e=>d(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?b(e,$.topLevel):d(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>d(e))]},_=(e,t)=>c([t],()=>Z(`Subst`,[d(e.op,$.substOperator),b(e.expr,$.substExpression)])),v=e=>{if(e.isNull&&r)throw l(Nl(0),[$.operator,...Wl(`OpDef`,Ul),Hl]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(o.isSet=!0);let n=d(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&o.isSet&&ps(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):b(e,$.operand)),a=e.tupleOrs,s=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[d(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>d(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],b(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...s])},y=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?d(e,t):b(e,t),b=(e,t)=>{if(!r)return S(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw u(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:fs(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return c(n,()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return f(v(e),e,e.location);case`Numeral`:return f(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return f(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return f(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=b(e.body,$.letBody);return f(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>d(e,$.letDefinition)))]),e,e.location)}case`Label`:return f(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[b(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>d(e,$.labelParam)))]),e,e.location);case`OpArg`:return f(Z(`OpArgNode`,[Z(`argument`,[d(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return f(Z(`AtNode`,[b(t,$.exceptObject),b(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=Vl[e.kind],n=e.substs.map(e=>_(e,t.subst)),r=b(e.body,t.body);return f(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[d(e.instantiatingModule,t.from)]),Z(`instTo`,[d(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>_(e,$.instanceSubst)),n=e.params.map(e=>d(e,$.instanceParam));return Z(`InstanceNode`,[zl(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return f(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>y(e,$.useFact))),Z(`defs`,e.defs.map(e=>d(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return f(Z(`NewSymbNode`,[d(e.declaration,$.newDeclaration),...e.set&&!(r&&ps(e.set))?[b(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return f(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>b(e,$.assumption))),Z(`prove`,[b(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>y(e,$.byFact))),Z(`defs`,e.defs.map(e=>d(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return f(n,e,e.location)}case`NonLeafProof`:return f(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?d(e,$.step):b(e,$.step))]),e,e.location);case`DefStep`:return f(Z(`DefStepNode`,e.defs.map(e=>d(e,$.defStep))),e,e.location)}},C=(n.isRestricted?[t]:e).map(e=>d(e,$.main)),w=Gl(a.size),T=Z(`context`,[...a.entries()].toSorted(([e],[t])=>Kl(e,w)-Kl(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),T,...C])},$l=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=Ql(e.modules,e.root,t),r=Ll(n);if(r){let e=r.character.codePointAt(0)??0;throw x(new ae(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Ml.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Rl(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
|
|
49
|
-
`)}\n`},eu=`META-INF/MANIFEST.MF`,tu=async e=>{if(e===void 0||!M(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(Te(e),{filter:e=>e.name===eu})[eu];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},nu={success:A.success,"assumption-violation":A.assumptionViolation,deadlock:A.deadlock,"invariant-violation":A.safetyViolation,"property-violation":A.safetyViolation,"liveness-violation":A.livenessViolation,"postcondition-violation":A.assumptionViolation,error:A.error},ru=Re(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),iu=Re(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`-N`,isRequired:!0},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--summary`},{flag:`--strict`},{flag:`-I <directory>`,isRepeatable:!0}]),au=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),ou=/* @__PURE__ */ new Set([`-o`]),su=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
50
|
-
`)})(),cu=[`Usage: ${ru.usage}`,` ${iu.usage}`,` tla-ts prove [<tlapm option>]... <Module.tla|glob>...`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
51
|
-
`),lu=/[*?[{]/,uu=e=>e.flatMap(e=>lu.test(e)?Ce(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),du=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),fu=e=>e?e[0]===`auto`?je():Math.max(1,Number.parseInt(e[0],10)||1):1,pu=[`constrained`,`stuttering`,`strict`],mu=(e,t)=>e.endsWith(t)?e:`${e}${t}`,hu=e=>{if(e.length===1)return{path:mu(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:mu(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},gu=(e,t)=>e.print(c.computingInitProgress,p.none,`Computed ${t} initial states...`),_u=(e,t)=>e===`invariant-violation`?{code:c.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:c.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},vu=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return gu(e,t.count);let n=_u(t.status,t.name);e.print(n.code,p.error,`${n.text}\n${le(t.state)}`)}),yu=(e,t,n={code:c.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,p.error,n.text),t.forEach((t,n)=>{(n>0||r)&&vu(e,t.output),e.print(c.statePrint2,p.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${le(t.state)}`)})},bu={code:c.counterExample,text:`The following behavior constitutes a counter-example:
|
|
52
|
-
`},xu=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
|
|
53
|
-
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Su=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${u(e)}\n`).toReversed().join(``),Cu=e=>{if(e.length===0)return` The error call stack is empty.
|
|
54
|
-
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},wu=(e,t)=>{let n=t.generated,r=t.distinct,i=s(/* @__PURE__ */ new Date);n===r?e.print(c.initGenerated1,p.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(c.initGenerated2,p.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},Tu=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(c.progress,p.none,`Progress(${Math.max(t.depth,1)}) at ${s(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},Eu=(e,t)=>xe(e,`${t}.class`),Du=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(c.sanyFinished,p.none,`SANY finished.`),i(c.starting,p.none,`Starting... (${s(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(c.constantLevelInvariant,p.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(c.stateLevelProperty,p.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(c.livenessSymmetry,p.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(c.livenessConstraints,p.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(c.temporalBranches,p.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=N(Se(Eu(r,t.module))).href;i(t.isMatched?c.javaOverrideLoaded:c.javaOverrideMismatch,t.isMatched?p.none:p.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(c.computingInit,p.none,`Computing initial states...`);return;case`initial-states-progress`:gu(e,t.count);return;case`initial-states-computed`:wu(e,t.initialStates);return;case`progress`:Tu(e,t.statistics,n.start);return;case`liveness-started`:{n.liveness=Date.now(),t.isComplete&&Tu(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(c.checkingTemporal,p.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${s(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Ou(e,n);return;case`warning`:i(t.code,p.warning,t.text)}},Ou=(e,t)=>{t.liveness!==void 0&&(e.print(c.checkingTemporalEnd,p.none,`Finished checking temporal properties in ${h(Date.now()-t.liveness)} at ${s(/* @__PURE__ */ new Date)}`),t.liveness=void 0)},ku=(e,t,r)=>{let i=r.print,a=t.name,o=t.loopStart,s=o===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),l={code:c.temporalPropertyViolated,text:xu(t.properties??[a],r.version)},u={success:void 0,error:void 0,"assumption-violation":t.message?{code:c.assumptionEvaluationError,text:n(c.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${t.message}`,r.isTool)}:{code:c.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:c.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?_u(`invariant-violation`,a):{code:c.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":l,"liveness-violation":o===void 0?s?_u(`liveness-violation`,a):{code:c.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:l,"postcondition-violation":{code:t.postcondition?.code??c.general,text:t.message??`Postcondition ${a} is false.`}}[e],d=e===`property-violation`,f=o!==void 0&&!d,m=d||f,h=m&&r.version!==`1.7.4`;if(h&&vu(r,t.trace[0]?.output),t.counts&&console.log(t.counts),u){let e=s?`${u.text}\n${le(t.trace[0].state)}`:u.text;i(u.code,p.error,e)}if(s||(m||vu(r,t.trace[0]?.output),yu(r,t.trace,m?bu:void 0,m&&!h),vu(r,t.traceOutput)),f){let e=t.loopLabel;o===t.trace.length-1?i(c.statePrint3,p.state,`${o+2}: Stuttering`):r.isTool?i(c.backToState,p.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}t.warning&&r.version!==`1.7.4`&&i(t.warning.code,p.warning,t.warning.text);let g=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return g?.counts&&console.log(g.counts),g&&i(g.code,p.error,g.message),!s&&e!==`assumption-violation`},Au=(e,t)=>e.print(c.nestedExpression,p.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Cu(t)}`),ju=(e,t,n)=>{let r=t.print;if(e.failure){let n=e.failure,i=t.isTool?n.toolMessage:n.message,a=()=>{let e=n.fingerprint;if(e){let i=n.callStack?.length&&t.version!==`1.7.4`?Cu(n.callStack):Su(e.sources);r(c.fingerprintFailed,p.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${i}\nReason:\n${g(e.reason,t.isTool)}`)}else n.callStack&&Au(t,n.callStack)};n.isCallStackFirst&&a();let o=n.initialState&&(()=>{try{return`While working on the initial state:\n${le(n.initialState)}`}catch(e){throw e instanceof S?x(new S(`${E}${e.message}`),A.error):e}})();r(o?c.initialState:n.code,p.error,o?`${i}\n${o}`:i),vu(t,n.trace[0]?.output),yu(t,n.trace);let s=n.traceFailure;s&&r(s.code,p.error,t.isTool?s.toolMessage:s.message),vu(t,n.traceOutput);let l=n.postcondition;l?.counts&&console.log(l.counts),l&&r(l.code,p.error,l.message),n.isCallStackFirst||a()}else if(e.violation){if(!ku(e.status,e.violation,t))return;let n=e.additionalViolation;n&&ku(`property-violation`,n,t),e.liveCallStack&&Au(t,e.liveCallStack)}else{Ou(t,n);let i=v(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${ie(ee(e.fingerprintDistance))}`];r(c.success,p.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${ie(i)}`,...a].join(`
|
|
55
|
-
`))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Ou(t,n),t.isTool&&Tu(t,e,n.start),r(c.stats,p.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let i=t.version===`1.7.4`,a=i?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!i||a)&&r(c.searchDepth,p.none,`The depth of the complete state graph search is ${i?Math.max(e.depth,1):e.depth}.`);let o=a&&pe(a);o&&r(c.stateGraphOutdegree,p.none,o)},Mu=(e,t)=>e.map(e=>xe(e,`${t}.tla`)).find(M),Nu=e=>t=>{let n=Mu(e,t);return n===void 0?void 0:Te(n,`utf8`)},Pu=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),Fu=e=>`jar:file:${N(Se(e)).pathname}!/tla2sany/StandardModules/`,Iu=e=>a([e]).toString(),Lu=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Ne(),o=M(a)?De(a):Se(a),s=xe(o,`tlc-${Iu(Se(e))}`),c=_d(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return De(Mu(t,n)??e);if(i===`1.7.4`)return xe(o,l);if(a===`root file`){let t=r===void 0?o:Se(r),i=De(e);return`${xe(t,Iu(`${i} ${n}`),l)} (${i})`}let u=xe(s,l);return c===void 0?u:`${u} (${Fu(c)}${l})`}},Ru=e=>e.print(c.version,p.none,`TLC2 Version ${Ie} (rev: tla-ts)`),zu=(e,t)=>(Ru(e),e.print(c.commandLineError,p.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),Bu=(e,t,n)=>e.print(c.modelChecking,p.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${je()} cores with ${Math.floor(Fe().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Pe()} ${Me()} ${Ae()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Vu=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},Hu=async(e,t,n,i)=>{let a=t.has(`-seed`)?t.get(`-seed`)?.[0]:`0`;if(a===void 0)return zu(i,`Error: seed required.`);if(!du(a))return zu(i,`Error: An integer for seed required. But encountered ${a}`);let o=t.has(`-lncheck`)?t.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(o===void 0)return zu(i,`Error: expect a strategy such as final for -lncheck option.`);let l=t.get(`-dump`);if(l?.length===0)return zu(i,`Error: A file name for dumping states required.`);let u=l?.length===2&&pu.find(e=>l[0].toLowerCase().includes(e));if(u)return console.error(`Error: tla-ts does not support the -dump format ${u}.`),1;let m=t.get(`-fp`)?.[0];if(m!==void 0&&Number(m)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${m}.`),1;let _=fu(t.get(`-workers`)),v=i.version;Ru(i),Bu(i,a,_);let b=t.get(`-config`)?.[0]??(t.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!b||!M(b))return i.print(c.configFileError,p.error,`TLC encountered the following error when trying to read the configuration file ${b??``}:\nFile not found.`),A.configParseError;let x=ve(e,`.tla`),S={start:Date.now(),liveness:void 0,isParsed:!1},C=()=>{let e=Date.now()-S.start;i.print(c.finished,p.none,`Finished in ${i.isTool?`${e}ms`:h(e)} at (${s(/* @__PURE__ */ new Date)})`)},w=()=>i.print(c.parsingFailed,p.error,`Parsing or semantic analysis failed.`),E=e=>(e instanceof ce?w():Wu(e,i),C(),y(e)),ee=(()=>{try{return f(Te(b,`utf8`),v)}catch(e){if(!(e instanceof se))throw e;return e}})();if(ee instanceof se&&v===`1.7.4`)return i.print(c.general,p.error,`${me(`tlc2.tool.ConfigFileException`)}${g(ee.message,i.isTool)}`),C(),A.error;if(ee instanceof se)return E(ee);t.has(`-deadlock`)&&(ee.checkDeadlock=!1);let D=j(e),O=[D,...n.libraries],te=Nu(O),ne=Vu(t,v),re=async()=>{let n=Te(e,`utf8`),r=d(n).name;if(r!==x)throw new T(`File name '${x}' does not match the name '${r}' of the top level module it contains.`,void 0);let s=await _e({workers:_,livenessCheck:[`final`,`seqfinal`,`off`].includes(o)?`final`:`default`,seed:BigInt(a),dump:l&&hu(l),isTool:i.isTool,isTraceRecorded:ne,isSanyReported:!0,isWarningEnabled:!t.has(`-nowarning`),version:v,onProgress:e=>Du(i,e,S,D),source:n,config:ee,onPause:()=>Ee(0,Buffer.alloc(1)),loadModule:te,loadClass:e=>{let t=Eu(D,e);return M(t)?Te(t):void 0},readFile:e=>M(e)?Te(e,`utf8`):void 0,writeFile:(e,t)=>{we(j(Se(e)),{recursive:!0}),Oe(e,t)}});return ju(s,i,S),C(),s.failure?.exitCode??nu[s.status]};i.isTool&&i.print(c.startingSany,p.none,`Starting SANY...`);let ie=be(e),ae=ie?x:e.replace(/\.tla$/,``),oe=_d(n),le=v===`1.7.4`?fd(e,n,oe):void 0;if(le?!M(e)&&!r.has(x)&&le(`${x}.tla`):!M(e)&&!he.has(x)&&Pu(ie?D:process.cwd(),ie?`${x}.tla`:`./${ae}.tla`,[...ie||D===`.`?[]:[D],...n.libraries]),jl(e,le?pd(te,le):te,{fileName:ae,describeFile:Lu(e,O,n,t.get(`-metadir`)?.[0],v),version:v,rootExtendees:ne?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Du(i,{kind:`parsed`},S,D),w(),C(),A.specParseError;try{return await re()}catch(e){if(!(e instanceof ue))throw e;return e instanceof ce&&console.log(Uu(e,x)),S.isParsed||Du(i,{kind:`parsed`},S,D),E(e)}},Uu=(e,t)=>{let n=e instanceof T;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},Wu=(e,t)=>{if(e instanceof se||e instanceof S){let r=_(e.message),i=r&&!r.isEvalException?r.code:c.general;return t.print(i,p.error,n(i,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},Gu=async(e,t=ge(!1))=>{try{return await e()}catch(e){if(!(e instanceof ue))throw e;return Wu(e,t),y(e)}},Ku=async(e,t,n)=>{let r=[];for(let[i,a]of e.entries()){i>0&&console.log(``);let e=n();r.push(await Gu(()=>t(a,e),e))}return r.find(e=>e!==A.success)??A.success},qu=()=>(process.env.PATH??``).split(ye).map(e=>xe(e,`tlapm`)).filter(e=>M(e)),Ju=()=>qu().map(e=>xe(j(j(De(e))),`lib/tlapm/stdlib`)).find(e=>M(e)),Yu=e=>e.flatMap(e=>lu.test(e)?Ce(e).sort():[e]),Xu=e=>{let t=qu()[0];return t===void 0?(console.error(`Error: tla-ts prove runs tlapm to prove obligations, but tlapm isn't on your PATH. Install tlapm, or pass -N to only generate the obligations.`),1):ke(t,Yu(e),{stdio:`inherit`}).status??1},Zu=e=>M(e)?{file:e,source:Te(e,`utf8`)}:void 0,Qu=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),$u=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,ed=e=>console.log(`\n\\* TLAPM version 5f5037f\n\\* launched at ${s(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`prove`,...e].map($u).join(` `)}\n`),td={incomplete:11,emptyTarget:12},nd=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${Be(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${Be(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${Ve(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${Ve(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[td.incomplete]:[],...a?[td.emptyTarget]:[]]},rd=e=>{try{return e()}catch(e){if(!(e instanceof C))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},id=e=>{if(!e.includes(`-N`)&&!e.includes(`--summary`))return Xu(e);let t=iu.parse(e),n=t.unknown[0];if(n!==void 0)return console.error(`Error: tla-ts prove does not support the tlapm option ${n}.`),1;if(t.incomplete)return console.error(`Error: option '${t.incomplete.name}' needs an argument.`),1;let r=t.options.find(e=>e.name!==`-I`&&e.values.some(e=>!/^-?\d+$/.test(e)));if(r)return console.error(`Error: option '${r.name}' expects an integer.`),1;let i=Yu(t.positionals),a=i.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(a.length===0)return console.error(cu),1;let o=t.has(`--toolbox`)||t.has(`--line`);o&&ed(e);let s=t.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?na:{start:n,end:n}:e},na),c=Ju(),l=t.options.flatMap(e=>e.name===`-I`?e.values:[]),u=a.reduce((e,t)=>e.includes(j(t))?e:[j(t),...e],[`.`,...c?[c]:[],...l.toReversed()]),d=rd(()=>{let e=a.findIndex(e=>!M(e));if(e!==-1){let t=i[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(t)} not found`),new C(`File ${t} not found`,{failure:`Module.Parser.parse_file`})}return ha(a.map(e=>({file:`./${e}`,source:Te(e,`utf8`)})),e=>u.map(t=>Zu(`${t}/${e}.tla`)).find(Boolean),{lines:s,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(o&&t)return Qu([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!d)return 3;let f=d.flatMap(e=>(t.has(`--summary`)&&console.log(ma(e)),o&&(e.obligations.forEach(e=>Qu([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:to be proved`,...t.has(`--printallobs`)?[`obl:${e.text}`]:[]])),Qu([`type:obligationsnumber`,`count:${e.obligations.length}`])),t.has(`--strict`)?nd(e,s.start>0||s.end<1/0,t.has(`--summary`)):[]));return f.includes(td.incomplete)?td.incomplete:f[0]??A.success},ad=async(e,t)=>{let n=ru.parse(e),r=uu(n.positionals),i=n.has(`-config`),a=r.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||i||M(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(cu),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>M(e)||be(e)?e:t.libraries.map(t=>xe(t,e)).find(M)??e))],s=t.tlcVersion??`master`;return Ku(o,(e,r)=>(o.length>1&&console.log(`Checking ${ve(e)} with ${ve(e,`.tla`)}.cfg`),Hu(e,n,t,r)),()=>ge(n.has(`-tool`),!n.has(`-nowarning`),s))},od=e=>(process.stderr.write(`ERROR: ${e}\n${su}`),Ml.argsParsingFailure),sd=(e,t)=>{try{return process.stdout.write($l(e,t)),A.success}catch(e){if(!(e instanceof ae))throw e;let t=y(e),n=e instanceof re?e.unwound:``;return console.error(t===Ml.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},cd=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={flag:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.flag=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.flag=i}return r.flag===e.length-2?n:{...n,error:`several-files`}},ld=e=>{if(e.length===0)return od(`at least one .tla file must be given`);let t=cd(e,au);if(t.error===`missing-include`)return od(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return od(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(su),A.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>Se(e,r)).find(M);a===void 0&&!he.has(r.slice(0,-4))&&Pu(process.cwd(),`./${r}`,t.includes);let o=jl(a??r,Nu(i),{fileName:n,isXmlExport:!0});return process.stderr.write(o.text),o.isFailed||o.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Ml.specParsingFailure):sd(o.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},ud=(e,t,n)=>console.error(`File does not exist: ${be(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[Fu(n)]].join(`, `)}`),dd=e=>e.endsWith(`/`)?e:`${e}/`,fd=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!be(e)&&r!==``?[r]:t.libraries).map(dd),a=i.length>0?i[i.length-1]:be(e)?r:``;return e=>ud(`${a}${e}`,i,n)},pd=(e,t)=>n=>{let i=e(n);return i===void 0&&!r.has(n)&&t(`${n}.tla`),i},md=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Ml.uncaughtException),hd=(e,t)=>{if(e.length===0)return md(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=cd(e,ou);if(n.error===`missing-include`)return md(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return md(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let i=e[e.length-1],a=`${i.replace(/\.tla$/i,``)}.tla`,o=(n.includes.length===0?[`/`]:n.includes).map(dd),s=[`.`,...o],c=e=>ud(`${o[o.length-1]}${e}`,o,t),l=s.map(e=>Se(e,a)).find(M);if(l===void 0&&!r.has(ve(a,`.tla`)))return c(a),A.success;let u=jl(l??a,pd(Nu(s),c),{fileName:i,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?md(`tla2sany.xml.XMLExportingException: spec ${(l&&Al(Te(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):sd(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},gd=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],_d=e=>e.classPath?.split(ye).find(e=>e.endsWith(`.jar`)),vd=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(ye));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||gd.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},yd=e=>e.mainClass===`tlc2.TLC`?ad(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?Gu(()=>e.java.tlcVersion===`1.7.4`?hd(e.args,_d(e.java)):ld(e.args)):(console.error(`Error: tla-ts runs the Java classes ${gd.join(` and `)}, not ${e.mainClass}.`),1),bd=async e=>{if(e[0]===`prove`)return Gu(()=>id(e.slice(1)));let t=vd(e);return t===void 0?ad(e,{libraries:[]}):(t.java.tlcVersion??=await tu(_d(t.java)),yd(t))},xd=async()=>{process.exitCode=await bd(process.argv.slice(2))};export{xd as runCli};
|
|
9
|
+
import{C as e,D as t,M as n,R as r,T as i,U as a,V as o,a as s,b as c,g as l,h as u,k as d,m as f,o as p,s as m,x as h,z as g}from"./worker.js";import{$ as _,B as v,C as y,D as b,E as x,G as S,H as C,L as w,M as ee,N as T,O as E,Q as D,R as O,T as k,U as te,V as A,W as j,_ as ne,et as re,h as ie,j as M,k as ae,m as N,nt as oe,q as se,tt as ce,v as le,w as ue,z as de}from"./transfer.js";import{a as fe,c as pe,i as me,l as he,n as ge,o as P,r as _e,s as ve,t as ye}from"./prove.js";import{getTlapmPaths as be}from"./tlapm.js";import{basename as xe,delimiter as Se,dirname as Ce,isAbsolute as we,join as Te,resolve as Ee}from"node:path";import{existsSync as F,globSync as De,mkdirSync as Oe,readFileSync as ke,readSync as Ae,realpathSync as je,writeFileSync as I}from"node:fs";import{arch as Me,availableParallelism as Ne,release as Pe,tmpdir as Fe,type as Ie}from"node:os";import{pathToFileURL as Le}from"node:url";import{getHeapStatistics as Re}from"node:v8";var ze=`0.0.4-dev.702eb98`;const Be=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Ve=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(Be).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},L={builtin:1,number:2,string:3,ident:4,added:5},He=()=>({labelFlag:!1,reportLabelsFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,fairAlgorithm:!1,checkTermination:!1,noOld:!1,nocfg:!1,noDoneDisjunct:!1,specOption:!1,myspecOption:!1,specFile:``,optionsInFile:!1,inputVersionNumber:1903}),Ue=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},We=[`unfair`,`wf`,`sf`],R=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Ge=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,Ke=e=>{if(e.kind!==`LabeledStmt`)throw new m(`ClassCastException: ${e.kind}`);return e},qe=(e,t)=>{if(t<0||t>=e.length)throw new m(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},Je=(e,t,n)=>({string:e,column:t,type:n}),Ye=e=>e.type===L.string?e.string.length+2:e.string.length,Xe=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Ze=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},Qe=e=>{let t=Xe(e);return Ze(t),t},$e=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new m(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new p(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},et=e=>Qe(e.tokens.map(e=>e.map(e=>({...e})))),tt=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+Ye(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,$e(e)},nt=e=>e.tokens.length===1&&e.tokens[0].length===1,rt=(e,t)=>qe(qe(e.tokens,t.line),t.item),it=(e,t,n)=>{if(e.tokens.length<=t.line)throw new s(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new s(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},at=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=rt(e,r),i=n.type===L.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?it(e,r,2):void 0,o=a===void 0?void 0:rt(e,a),s=o!==void 0&&o.type!==L.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=it(e,r,c)}},ot=(e,t,n,r)=>{let i=rt(e,n);if(nt(e)){let n=et(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+Ye(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(nt(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=L.builtin);let n=et(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Je(`)`,e.column+Ye(e),L.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+Ye(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return $e(e),it(e,d,1)},st=(e,t,n,r=!0)=>{let i=n.map(t=>at(e,t,{line:0,item:0}));for(;;){let a=i.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(a===void 0)return;let o=it(e,a.position,1),s=ot(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:at(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new m(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},ct=(e,t,n)=>{let r=et(e);return st(r,t,n),r},lt=(e,t,n)=>e.map(e=>ct(e,t,n)),ut=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===L.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
10
|
+
`)} >>`},dt=(e,t,n)=>{let r=e=>ut(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${We[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},ft=(e,t,n,r,i)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).reduce((e,t)=>t===` `?(Math.floor(e/8)+1)*8:e+1,0):0,lastLine:r,lastColumn:i,isTabToSpaces:!1}),pt=e=>{if(e.currentLine===void 0)return` `;if(e.isTabToSpaces)return e.vcolumn+=1,e.vcolumn%8==0&&(e.isTabToSpaces=!1),` `;if(e.line>e.lastLine||e.line===e.lastLine&&e.column>=e.lastColumn)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
|
|
11
|
+
`;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t===` `?(e.vcolumn%8!=0&&(e.isTabToSpaces=!0),` `):t},mt=e=>{if(e.column>0){--e.column,--e.vcolumn;return}if(e.line===0)throw new s(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line;let t=Array.from(e.lines[e.line]);for(e.currentLine=t,e.column=0,e.vcolumn=0;e.column<t.length-1;)pt(e)},ht=e=>{for(;;){let t=pt(e);if(t===` `)return` `;if(t!==` `&&t!==`
|
|
12
|
+
`)break}return mt(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},gt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),_t=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),vt=/* @__PURE__ */ new Set([...gt,..._t,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),yt=e=>/^[A-Za-z_]$/.test(e),bt=e=>/^[0-9]$/.test(e),xt=e=>e===` `||e===`\f`||e===`\r`,St=new Set([...vt].filter(e=>!yt(e[0])&&!(e[0]===`\\`&&yt(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),Ct=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),wt=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),z={...L,dashes:6,endModule:7},Tt=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),Et=(e,t,n,r)=>{let i={lines:[],line:[],token:``,state:`start`,column:t.vcolumn,nextColumn:t.vcolumn,nextChar:pt(t),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},a=()=>{i.nextColumn=t.vcolumn,i.nextChar=pt(t)},o=()=>{i.token+=i.nextChar,a()},c=()=>{i.state=`start`,i.column=i.nextColumn},l=()=>{i.lines.push(i.line),i.line=[],i.column=0},u=e=>{throw new p(`${e} \`${i.token}' found at\n line ${t.line+1}, column ${i.column+1}`)},d=()=>{i.isExprEnd=!0,e.delimiter=i.token,e.delimiterCol=i.column,e.delimiterLine=t.line-+(i.nextChar===`
|
|
13
|
+
`)},f=e=>{if(!n){d(),i.token=``;return}e>z.ident&&u(`Illegal token in an expression`);let t=i.token;e!==z.string&&(wt.has(t)&&!(e===z.ident&&[`.`,`[`,`,`].includes(i.previousToken))||(t===`,`&&!i.isInQuantifier&&!r||t===`)`||t===`}`)&&i.parenDepth===0)?(i.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),i.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),i.line.length>0&&l()):(e===z.builtin&>.has(t)&&(i.parenDepth+=1),e===z.builtin&&_t.has(t)&&(--i.parenDepth,i.parenDepth<0&&u(`Extra (unmatching)`)),i.previousToken=e===z.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&i.parenDepth===0&&(i.isInQuantifier=!0),i.isInQuantifier&&t===`:`&&i.parenDepth===0&&(i.isInQuantifier=!1),(t!==``||e===z.string)&&i.line.push(Je(t,i.column,e)),i.token=``)},m=e=>{f(e),c()},h=e=>{o(),i.state=e},g=e=>{a(),i.state=e},_=n=>{switch(i.state){case`start`:if(xt(n))return a(),c();if(yt(n))return h(`id`);if(n===`ℕ`||n===`ℤ`||n===`ℝ`)return o(),m(z.ident);if(bt(n))return h(`numOrId`);if(n===`\\`)return h(`bs`);if(n===`-`)return h(`dash1`);if(n===`=`)return h(`eq1`);if(n===`(`)return g(`leftParen`);if(n===`"`)return g(`string`);if(n===`
|
|
14
|
+
`)return a(),l(),c();if(St.has(n))return h(`builtIn`);if(n===` `){i.state=`done`;return}return o(),u(`Illegal lexeme`);case`id`:return i.token===`WF_`||i.token===`SF_`?m(z.builtin):yt(n)||bt(n)?o():m(vt.has(i.token)?z.builtin:z.ident);case`numOrId`:return bt(n)?o():yt(n)?h(`id`):m(z.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(n))return h(`numOrBi`);if(yt(n)){i.state=`bsBuiltIn`;return}if(n===`*`){a(),i.token=``,i.state=`lineComment`;return}i.state=`builtIn`;return;case`numOrBi`:i.state=bt(n)?`num`:`bsBuiltIn`;return;case`num`:if(bt(n))return o();if(!yt(n))return m(z.number);o(),i.token.startsWith(`\\`)&&u(`Illegal lexeme`),i.state=`id`;return;case`bsBuiltIn`:return yt(n)&&n!==`_`?o():vt.has(i.token)?m(z.builtin):u(`Illegal lexeme `);case`builtIn`:if(St.has(i.token+n))return o();if(!vt.has(i.token)){for(mt(t);!vt.has(i.token);)mt(t),i.token.length===0&&u(`Illegal lexeme`),i.token=Array.from(i.token).slice(0,-1).join(``);a()}return m(z.builtin);case`dash1`:case`dash2`:if(n===`-`)return h(i.state===`dash1`?`dash2`:`dash3`);i.state=`builtIn`;return;case`dash3`:return n!==`-`&&u(`Illegal lexeme`),h(`dashes`);case`dashes`:return n===`-`?o():m(z.dashes);case`eq1`:case`eq2`:if(n===`=`)return h(i.state===`eq1`?`eq2`:`eq3`);i.state=`builtIn`;return;case`eq3`:return n!==`=`&&u(`Illegal lexeme`),h(`eqs`);case`eqs`:return n===`=`?o():m(z.endModule);case`leftParen`:if(n===`*`)return e.commentDepth=1,g(`comment`);i.token=`(`,i.state=`builtIn`;return;case`string`:if(n===`\\`)return h(`escString`);if(n===`"`)return a(),m(z.string);o(),Ct.has(n)||u(`Illegal character in string`);return;case`escString`:o(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(n)||u(`Illegal character following \\ in string`),i.state=`string`;return;case`lineComment`:return n===`(`?g(`lineComParen`):n===`*`&&e.commentDepth>0?g(`lineComStar`):n===`
|
|
15
|
+
`||n===` `?(i.token=``,e.commentDepth=0,c()):e.commentDepth===0?o():a();case`lineComParen`:if(n===`*`)return e.commentDepth+=1,g(`lineComment`);e.commentDepth===0&&(i.token+=`(`),i.state=`lineComment`;return;case`lineComStar`:if(n===`)`){if(--e.commentDepth,e.commentDepth<0)throw new s(`Failure of assertion: case LINE_COM_STAR`);return g(`lineComment`)}e.commentDepth===0&&(i.token+=`*`),i.state=`lineComment`;return;case`comment`:case`orComment`:{let t=i.state===`comment`;if(n===`*`)return g(t?`commentStar`:`orCommentStar`);if(n===`(`)return g(t?`commentParen`:`orCommentParen`);if(n===`
|
|
16
|
+
`){i.token=``,a(),l(),i.state=`orComment`;return}if(n===` `)throw new p(t?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?o():a()}case`commentStar`:case`orCommentStar`:{let t=i.state===`commentStar`?`comment`:`orComment`;if(n!==`)`){e.commentDepth===1&&(i.token+=`*`),i.state=t;return}if(a(),--e.commentDepth,t===`orComment`&&e.commentDepth<0)throw new s(`Assertion failure`);if(e.commentDepth!==0){i.state=t;return}return i.token=``,c()}case`commentParen`:case`orCommentParen`:{let t=i.state===`commentParen`?`comment`:`orComment`;if(n===`*`)return e.commentDepth+=1,g(t);e.commentDepth===1&&(i.token+=`(`),i.state=t;return}}};for(;i.state!==`done`&&!i.isExprEnd;)_(i.nextChar);return i.nextChar!==`
|
|
17
|
+
`&&mt(t),Qe(i.lines)},Dt=(e,t,n)=>Et(e,t,!0,n),Ot=(e,t)=>(Et(e,t,!1,!1),e.delimiter),kt=(e,t)=>({params:e,tokenizer:Tt(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),At=()=>Qe([[Je(`defaultInitValue`,0,0)]]),jt=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],Mt=(e,t)=>!t.some(t=>e.includes(t)),Nt=(e,t)=>{t.splice(0,t.length,...e)},Pt=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],pSyntax:!1,cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:r.inputVersionNumber>=1500,omitStutteringWhenDone:r.inputVersionNumber>=1500},c=e=>{throw new p(`${e}\n line ${a.line}, column ${a.column}`)},l=()=>{if(o.lookaheadSize===0)return ht(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=Ot(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o.lookaheadSize;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o.lookaheadSize,a.text=n,n},u=n=>{for(;o.lookaheadSize<n;){let n=o.lookaheadSize;if(ht(t)===` `)throw new p(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=Ot(e.tokenizer,t),o.lookaheadSize+=1}return i.tokens[n-1]},d=n=>{if(n<o.lookaheadSize)throw new s(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
|
|
18
|
+
it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=Ot(e.tokenizer,t),o.lookaheadSize+=1;return ht(t)},f=(n=!1)=>{if(o.lookaheadSize!==0)throw new s(`ParseAlgorithm: GetExpr called after lookahead`);let r=Dt(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},h=(e,t)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new p(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=l();n!==e&&n!==t&&c(`Expected "${e}" but found "${n}"`)},g=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},_=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},v=()=>h(u(1)===`,`?`,`:`;`),y=()=>h(o.pSyntax?`begin`:`{`),b=e=>{o.cSyntax?h(`}`):(h(`end`),h(e))},x=()=>{u(1)===`variables`?g(`variables`):h(`variable`)},S=()=>{let e={...R(),kind:`VarDecl`,var:l(),col:a.column,line:a.line,isEq:!0,val:At()};if(![`=`,`\\in`,`∈`].includes(u(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=_(),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},C=()=>{x();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(S()),v();return e},w=()=>{let e={...R(),kind:`PVarDecl`,var:l(),col:a.column,line:a.line,val:At()};if(u(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(h(`=`),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},ee=()=>{x();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(w()),v();return e},T=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=ht(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},E=()=>{if(!T())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),h(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(h(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},D=()=>{let e=[],t=e=>o.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...k());return o.cSyntax&&e.length===0&&c(`Empty statement list`),e},O=e=>{g(`{`);let t=D();if(h(`}`),h(`;`),e!==``){if(t[0].lbl!==``)throw new p(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},k=()=>{let e=E();if(o.cSyntax&&u(1)===`{`)return O(e);let t=te();return t.lbl=e,[t]},te=()=>{let e=u(1);if(e===`if`)return j(0);if(e===`either`)return ne();if(e===`with`)return re(0);if(e===`when`||e===`await`){g(e);let t=a.column,n=a.line,r=f();if(r.tokens.length===0)throw new m(`NullPointerException`);return h(`;`),{...R(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){g(e);let t=a.column,n=a.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),h(`;`),{...R(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){g(`skip`);let e={...R(),kind:`Skip`,col:a.column,line:a.line};return h(`;`),e}if(e===`call`)return oe();if(e===`return`){g(`return`);let e={...R(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return h(`;`),e}if(e===`goto`){g(`goto`);let e=a.column,t=a.line,n=l();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),{...R(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?A():d(1)[0]===`(`?se():M()},A=()=>{g(`while`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=f();o.cSyntax&&h(`)`),n.tokens.length===0&&c(`Empty while test at `),o.pSyntax&&h(`do`);let r=o.pSyntax?D():k();return o.pSyntax&&(h(`end`),h(`while`),h(`;`)),r.length===0&&c(`Missing body of while statement at`),{...R(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},j=e=>{g(e===0?`if`:`elsif`);let t={...R(),kind:`LabelIf`,col:a.column,line:a.line,test:Xe(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&h(`(`),t.test=f(),o.cSyntax&&h(`)`),t.test.tokens.length===0&&c(`Empty if test at `),o.pSyntax&&h(`then`),t.unlabThen=o.pSyntax?D():k();let n=u(1);return n===`else`&&(g(`else`),t.unlabElse=o.pSyntax?D():k()),o.pSyntax&&n===`elsif`&&(t.unlabElse=[j(e+1)]),o.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),o.pSyntax&&e===0&&(h(`end`),h(`if`),h(`;`)),t.unlabElse.length===0&&qe(t.unlabThen,t.unlabThen.length-1),t},ne=()=>{g(`either`);let e={...R(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...R(),kind:`Clause`,unlabOr:o.pSyntax?D():k(),labOr:[]};if(t.unlabOr.length===0)throw new p("`either' statement with empty `or' clause",e);if(e.clauses.push(t),u(1)!==`or`)break;g(`or`)}if(o.pSyntax&&(g(`end`),h(`either`),h(`;`)),e.clauses.length===1)throw new p("`either' statement has no `or'",e);return e},re=e=>{e===0&&(h(`with`),o.cSyntax&&h(`(`));let t={...R(),kind:`With`,col:a.column,line:a.line,var:l(),isEq:!0,exp:Xe(),Do:[]};t.isEq=_(),t.exp=f(),(o.pSyntax||u(1)!==`)`)&&v(),t.exp.tokens.length===0&&c(`Empty with expression at `);let n=o.pSyntax&&u(1)===`do`,r=o.cSyntax&&u(1)===`)`;if(n&&h(`do`),r&&g(`)`),t.Do=n?D():r?k():[re(e+1)],n&&(h(`end`),h(`with`),h(`;`)),t.Do.length===0)throw new p(`Missing body of with statement`,t);return t},ie=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...R(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};h(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...R(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},M=()=>{let e={...R(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[ie()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ie())}catch(e){if(!(e instanceof p))throw e;c(`Bad assignment statement at `)}}return h(`;`),e},ae=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;h(`,`)}return h(`)`),h(`;`),e},N=()=>{g(`call`);let e={...R(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:l(),args:[]};return h(`(`),e.args=ae(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},oe=()=>{let e=N();if(u(1)===`return`)return g(`return`),h(`;`),{...R(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;g(`goto`);let t={...R(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),t},se=()=>{let e={...R(),kind:`MacroCall`,name:l(),col:a.column,line:a.line,args:[]};return g(`(`),e.args=ae(),e},ce=t=>{e.isInMacro=!0,g(`macro`);let n={...R(),kind:`Macro`,col:a.column,line:a.line,name:l(),params:[],body:[]};for(h(`(`);u(1)!==`)`;)n.params.length>0&&h(`,`),n.params.push(l());return g(`)`),y(),n.body=D(),b(`macro`),u(1)===`;`&&l(),be(n.body,t),e.isInMacro=!1,n},le=()=>{h(`procedure`);let e={...R(),kind:`Procedure`,col:a.column,line:a.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],h(`(`);u(1)!==`)`;)e.params.length>0&&h(`,`),e.params.push(w());return g(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=ee()),y(),e.body=D(),b(`procedure`),u(1)===`;`&&l(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},ue=()=>{h(`process`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=l(),r=_(),i=f();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&h(`)`),i.tokens.length===0&&c(`Empty process id at `);let s=u(1)===`begin`||u(1)===`{`?[]:C();y();let d=D();return b(`process`),u(1)===`;`&&l(),{...R(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:s,body:d}},de=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?de():e},fe=e=>{e.lbl===``&&(e.lbl=de(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(Ge(e)))},pe=(e,t,n,r,i)=>{Nt(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{fe(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new p("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new p("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=pe(e.unlabThen,!1,n,i,t);a.isNextLabeled=pe(e.unlabElse,!1,n,i,r)||o,Nt(jt(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=pe(e.unlabOr,!1,n,i,r)||a.isNextLabeled,Nt(jt(r,t),t)}),Nt(t,i);return}case`While`:if(n)throw new p("`while' inside a `with' statement",e);s(e),pe(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=pe(e.Do,!1,!0,n?[...r]:[],t),Nt(t,i),!n&&!Mt(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?jt([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,Mt(i,l))Nt(jt(i,l),i);else{if(n)throw new p(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),Nt(l,i)}}),a.hasLabel||a.isNextLabeled},me=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return me(n),{unlabeled:n,labeled:he(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},he=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new s(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>me(e.stmts)),t},ge=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=P(n.unlabThen);n.labThen.forEach(e=>P(e.stmts));let i=P(n.unlabElse);return n.labElse.forEach(e=>P(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...R(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...R(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=P(n.Do);if(e===2)throw new p(`with statement at ${Ge(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new s("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(n.unlabDo),n.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new p(`return statement not in a procedure at ${Ge(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new s(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},P=e=>{for(let t=0;t<e.length;t++){let n=ge(e,t);if(n!==0){if(t===e.length-1)return n;throw new s(`Translator discovered later than it should have that\n Statement at ${Ge(e[t+1])} must have a label`)}}return 0},_e=e=>{pe(e,!0,!1,[],[]);let t=he(e);return t.forEach(e=>P(e.stmts)),t},ve=(e,t,n,r,i)=>{let a=e=>ct(e,t,n),o=e=>e.map(e=>ve(e,t,n,r,i)),c=e=>e.map(e=>({...R(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>ve(e,t,n,-1,0))})),l={...R(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>ye(e,t,n,r,i))};case`If`:return{...l,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...l,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:c(e.labThen),unlabElse:o(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...R(),kind:`Clause`,labOr:c(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:lt(e.args,t,n)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:lt(e.args,t,n)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:lt(e.args,t,n)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new s(`Found unexpected statement type in macro at${Ge(e)}`)}},ye=(e,t,n,r,i)=>{let a=ct(e.rhs,t,n),o={...R(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:ct(e.lhs.sub,t,n)},s={...R(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=rt(l,{line:0,item:0});if(u.type!==L.ident)throw new p(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${Ge(s)}`);if(o.var=u.string,it(l,{line:0,item:0},1)===void 0)return s;let d=et(l);return d.tokens[0].splice(0,1),Ze(d),o.sub.tokens.length===0?o.sub=d:tt(o.sub,d,0),s},be=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return be(e.unlabThen,t),be(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>be(e.unlabOr,t)),[e];case`With`:return be(e.Do,t),[e];case`While`:return be(e.unlabDo,t),[e];case`MacroCall`:return xe(e,t);default:return[e]}});e.splice(0,e.length,...n)},xe=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new p(`Macro ${e.name} undefined,\n at ${Ge(e)}`);if(n.params.length!==e.args.length)throw new p(`Macro ${e.name} called with wrong number of arguments at \n ${Ge(e)}`);let r=n.body.map(t=>ve(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},Se=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new p(`Multiple definitions of macro name \`${t.name}'`)})},Ce=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1,o.omitStutteringWhenDone=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!nt(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},we=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new p([e,...o.addedLabelsLocs].join(`
|
|
19
|
+
`))},Te=()=>{r.reportLabelsFlag?(e.log(o.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),o.addedLabels.forEach((t,n)=>e.log(` ${t} at ${o.addedLabelsLocs[n]}`))):e.log(`Labels added.`)},Ee=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,be(t.body,e),t.body=_e(t.body)}),F=()=>{n&&(l()!==`algorithm`&&c("`--fair' not followed by `algorithm'"),r.fairAlgorithm=!0);let t=l();o.cSyntax=u(1)===`{`,o.pSyntax=!o.cSyntax,o.cSyntax&&g(`{`);let i=u(1)===`variable`||u(1)===`variables`?C():[],a={value:Xe()};u(1)===`define`&&(g(`define`),o.cSyntax&&h(`{`),a.value=f(!0),b(`define`),h(`;`));let s=[];for(;u(1)===`macro`;)s.push(ce(s));for(;u(1)===`procedure`;)o.procedures.push(le()),o.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let e=[];for(;u(1)===`fair`||u(1)===`process`;){let t=u(1)===`fair`;t&&g(`fair`);let n=t&&u(1)===`+`;n&&g(`+`);let i=n||!t&&r.fairnessOption===`sf`?2:t||r.fairnessOption===`wf`?1:0;e.push({...ue(),fairness:i})}b(`algorithm`),Se(s);let n=e.map(e=>(be(e.body,s),e.body=_e(e.body),o.omitStutteringWhenDone=!0,Ce(e.body),o.omitStutteringWhenDone));return o.omitStutteringWhenDone=n.includes(!0),Ee(s),o.addedLabels.length>0&&(r.labelFlag||we(),Te()),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),o.gotoUsed&&(o.omitPC=!1),{...R(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,procs:e}}r.inputVersionNumber===1500&&u(1)===`fair`&&(h(`fair`),u(1)===`+`&&h(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),y();let d=D();Se(s),be(d,s),Ee(s),o.cSyntax&&h(`}`),b(`algorithm`);let p=_e(d);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&we(),Te()),o.gotoUsed&&(o.omitPC=!1),o.gotoDoneUsed||Ce(p),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),{...R(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,body:p}};try{return{ast:F(),omitPC:o.omitPC,omitStutteringWhenDone:o.omitStutteringWhenDone,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof m))throw e;return c(`Unknown error at or before`)}},B={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},Ft=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],It=/* @__PURE__ */ new Set([B.global,B.processVar,B.procedureVar,B.parameter]),Lt=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Rt=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),zt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Bt=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},Vt=(e,t,n,r,i,a,o)=>!(t===B.procedureVar||t===B.processVar||t===B.parameter?Lt(e,B.global,n,``)!==void 0||Rt(e,n,r)!==void 0:Lt(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),Ht=(e,t,n,r)=>Lt(e,t,n,r)?.useThis??n,Ut=(e,t,n)=>{let r=Rt(e,t,n);return r===void 0?t:It.has(r.type)?r.useThis:t},Wt=e=>{let t={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},n=(e,n,i)=>{Vt(t,B.label,e.label,n,i,e.line,e.col)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n,i))},r=(e,t,i)=>{let a=e=>e.forEach(e=>r(e,t,i)),o=e=>e.forEach(e=>n(e,t,i));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new s(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=`process`,i=n===``?B.global:B.processVar)=>{Vt(t,i,e.var,n,r,e.line,e.col)||(t.errorReport+=`\n${Ft[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Vt(t,B.global,`pc`,``,``,0,0),e.prcds.length>0&&Vt(t,B.global,`stack`,``,``,0,0),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=zt(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Ke(e.body[0]).label}),Vt(t,B.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>i(t,e.name,`procedure`,B.procedureVar)),e.params.forEach(t=>i(t,e.name,`procedure`,B.parameter)),e.body.forEach(t=>n(Ke(t),e.name,`procedure`))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=Bt(t,e.name)<t.processes.length;r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processes.push({name:e.name,initialPC:e.body.length===0?void 0:Ke(e.body[0]).label}),Vt(t,B.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Ke(t),e.name,`process`))}),e.kind===`Uniprocess`&&(e.body.length>0&&(t.initialPC=Ke(e.body[0]).label),e.body.forEach(e=>n(Ke(e),``,``))),t.errorReport.length>0)throw new p(t.errorReport);return t},Gt=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1;for(let n=0;n<=7;n+=1)e.symbols.forEach(r=>{if(r.type!==n)return;r.useThis=r.id;for(let e=1;n>0&&t(r.useThis);e+=1)r.useThis+=e===1?`_`:r.context[e-2]??String(n);if(r.id===r.useThis)return;let i=r.context.length===0?``:` of ${r.contextType} ${r.context}`;e.disambiguateReport.push(`\\* ${Ft[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},Kt=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${Ft[e.type]} name`);if(t.length>0)throw new p(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},qt=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==L.ident)return;let a=Ut(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Qe([[Xt(a)]])))})),i.length>0&&st(e,i,r,!1)},i=(e,n)=>{e.var=Ut(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=Ht(t,B.label,r,n)}),o=(e,n)=>e===void 0?void 0:Ht(t,B.procedure,e,n),c=(e,n)=>{e.label=Ht(t,B.label,e.label,n),e.stmts.forEach(e=>l(e,n))},l=(e,n)=>{let i=e=>e.forEach(e=>l(e,n)),a=e=>e.forEach(e=>c(e,n)),u=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:c(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=Ut(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=Ht(t,B.procedure,e.returnTo,n),e.to=Ht(t,B.procedure,e.to,n),u(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=Ht(t,B.procedure,e.to,n),u(e.args);return;case`CallGoto`:e.after=Ht(t,B.procedure,e.after,n),e.to=Ht(t,B.procedure,e.to,n),u(e.args);return;case`Goto`:if(Lt(t,B.label,e.to,n)===void 0&&e.to!==`Done`)throw new p(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Ht(t,B.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new s(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Ke(t),e.name));let n=qe(t.procedures,zt(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=Ht(t,B.label,n.initialPC,e.name)),e.name=Ht(t,B.procedure,e.name,``),n.name=e.name},d=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Ke(t),e.name));let n=qe(t.processes,Bt(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=Ht(t,B.label,n.initialPC,e.name)),e.name=Ht(t,B.process,e.name,``),n.name=e.name};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(Ke(e),``))),t.initialPC!==void 0&&(t.initialPC=Ht(t,B.label,t.initialPC,``))},Jt=e=>Je(e,0,L.string),Yt=e=>Je(e,0,L.added),V=e=>Je(e,0,L.builtin),Xt=e=>Je(e,0,L.ident),Zt=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Ye(r)+t;n.push(Je(e.string,i,e.type))}),Qe([n])},Qt=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=Ye(e),e.type===L.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),$t=(e,t,n,r=0,i=0)=>({...R(),kind:`SingleAssign`,line:r,col:i,lhs:{...R(),kind:`Lhs`,var:e,sub:t},rhs:n}),en=(e,t=0,n=0)=>({...R(),kind:`Assign`,line:t,col:n,ass:e}),tn=(e,t,n=0,r=0)=>en([$t(e,Qe([]),t,n,r)],n,r),nn=e=>{if(e.tokens.length>1)return!1;let t=qe(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},rn=e=>({...R(),kind:`When`,exp:Zt([Yt(`pc`),V(`=`),Jt(e)],1)}),an=e=>tn(`pc`,Qe([[Jt(e??`null`)]])),on=e=>[Xt(`Head`),V(`(`),Yt(`stack`),V(`)`),V(`.`),Xt(e)],sn=()=>[Xt(`Tail`),V(`(`),Yt(`stack`),V(`)`)],cn=e=>Qe([on(e)]),ln=(e,t,n,r)=>{let i=[[V(`<<`),V(`[`),Xt(`procedure`),V(`|->`),Jt(e),V(`,`)],[Xt(`pc`),V(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(V(`,`)),i.push([Xt(e.var),V(`|->`),Xt(e.var)])}),i[i.length-1].push(V(`]`),V(`>>`)),i.push(r);let a=Xe(i);return Qt(a),Ze(a),a},un=(e,t,n)=>{if(t.params.length!==n.args.length)throw new p(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push($t(t.var,Qe([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>tn(e.var,e.val,n.line,n.col)),an(t.initialPC)]},dn=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=zt(t,e.to);if(r===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=ln(e.to,[Jt(n)],[...i.decls,...i.params],[V(`\\o`),Yt(`stack`)]);return un(tn(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new p("`return' statement not in procedure",e);let i=zt(t,n);if(i>=t.procedures.length)throw new p(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>en([$t(t,Xe(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,cn(`pc`)),...a.decls.map(e=>o(e.var,cn(e.var))),...a.params.map(e=>o(e.var,cn(e.var))),o(`stack`,Qe([sn()]))]},o=e=>{let n=e.from;if(n===void 0)throw new p(`\`return' statement following \`call' at ${Ge(e)} not in a procedure`);let r=qe(t.procedures,zt(t,n)),i=zt(t,e.to);if(i===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=en([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push($t(t.var,Xe(),cn(t.var),e.line,e.col)));let t=ln(e.to,on(`pc`),[...a.decls,...a.params],[V(`\\o`),...sn()]);o.ass.push($t(`stack`,Qe([]),t,e.line,e.col))}return un(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):m(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(an(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...R(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(an(t)),i.needsGoto&&c.Else.push(an(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(an(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(an(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(rn(e.label)),a.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=nn(t.test),l=s?a.stmts:[{...R(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[rn(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...R(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...R(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>u(e.map(Ke),t),g=e=>{r.procedure=e.name;let n=h(e.body,Ht(t,B.label,`Error`,``));return r.procedure=void 0,{...R(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},_=e=>({...R(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...R(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...R(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},fn=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new p(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new p(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new p(`Multiple assignment to ${t}`,e)}),i(t,o)},c=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>c(e,n)),e.Else.forEach(e=>c(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>c(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>c(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new s(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=n.map(()=>0);Ke(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},pn=(e,t,n,r)=>{let i=Wt(e);Gt(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),qt(e,i,r),fn(dn(e,i,t),t),n&&Kt(i)},mn=`[ \\t\\n\\x0B\\f\\r]`,hn=RegExp(`\\\\\\* BEGIN TRANSLATION${mn}+\\(${mn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${mn}*(=${mn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${mn}*STRING)${mn}*\\/\\\\${mn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${mn}*(=${mn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${mn}*STRING)${mn}*\\)`),gn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),_n=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),vn=(e,t)=>_n(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Ge(t.node)}`),yn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),bn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},xn=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},Sn=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},Cn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),wn=(e,t,n)=>{for(;t.line<e.length;){let r=xn(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=Sn(r,e,` `),!0}t.column=Sn(r,t.column,` `)}return!1},Tn=(e,t)=>_n(e,`Command-line error: ${t}`),En=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(Tn(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){Tn(e,`
|
|
20
|
+
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){Tn(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}n.specFile=s,a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:n.noOld=!0;continue;case`-nocfg`:n.nocfg=!0;continue;case`-noDoneDisjunct`:case`noDoneDisjunct`:n.noDoneDisjunct=!0;continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){Tn(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){Tn(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){Tn(e,"Version number must follow `-version' option");return}let t=Ue(s);if(t<0||t>1903){_n(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),Tn(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){Tn(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:Tn(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},Dn=(e,t,n)=>{if(xn(t,n),n.column+=7,!xn(t,n).slice(n.column).startsWith(`(`)){_n(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=xn(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=Sn(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?_n(e,`No closing ')' found in options statement`):En(e,r)},On=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new p(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},kn=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new m(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},An=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=yn(t),i={line:0,column:0};for(;wn(r,i,`PlusCal`);){let t=xn(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!Cn(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){e.params.optionsInFile=!0,Dn(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=bn(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=bn(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=On(r,a.line,a.column);if(l!==void 0)return vn(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let n=ft(r,a.line,a.column,t.length,0),i=Pt(e,n,a.isFair);u.ast=i.ast,pn(i.ast,i.omitPC,i.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof p))throw t;vn(e,t)}s===-1&&kn(-1,r.length);let d=hn.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,h=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:dt(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(h===void 0||f!==gn(h))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let g=d.groups?.tla;if(g!==void 0){if(c===-1)throw new m(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);g!==gn(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},jn=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],Mn={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},H=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),Nn=e=>jn.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...H(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...H(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:Mn,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),Pn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Fn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,In=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,Ln=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Rn=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),zn=(e,t)=>(e&2147483647)%t,Bn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[zn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Vn=(e,t,n=t)=>e.buckets[zn(Ln(n),e.buckets.length)].find(e=>e.key===t)?.value,Hn=(e,t,n,r=t)=>{let i=Ln(r),a=e.buckets[zn(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Bn(e),e.buckets[zn(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Un=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Wn=`\0module `,U=()=>({table:Rn(),symbols:[]}),Gn=e=>e.kind===`Module`?Wn+e.name:e.name,Kn=(e,t)=>{Hn(e.table,Gn(t),t,t.name),e.symbols.push(t)},qn=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Jn=(e,t)=>Vn(e.table,t),Yn=(e,t)=>Vn(e.table,Wn+t,t),Xn=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Zn=(e,t)=>Un(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Qn=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),$n=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),er=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},tr=e=>{switch(e.kind){case`Identifier`:return er(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=er(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},nr=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},rr=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,ir=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,ar=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),or=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,sr=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],cr=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},lr=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Jn(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=cr(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${rr(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=cr(u.nameLocation,l(u.index)),u.name=p,ar(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=qn(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${rr(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
|
|
21
|
+
operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(ir(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=ir(f.op,a.length);if(o){let e=ir(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=ir(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=sr(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=ir(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(ir(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=ir(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
22
|
+
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?qn(f.op):u.previousMode===`FindingOpName`&&or(f)?qn(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:qn(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=$n.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},ur=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),dr=(e,t)=>`${e}:${t}`,fr=(e,t)=>{let n=oe(t).filter(e=>e.kind!==`End`).map(ce),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
23
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[dr(e.line,e.column),t]))}},W=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,pr=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},mr=(e,t)=>e.tokenIndexes.get(dr(t.line,t.column))??Math.min(pr(e,t,!1),e.tokens.length-1),hr=(e,t)=>Math.max(pr(e,t,!0)-1,0),gr=(e,t)=>{let n=e.tokens[t].text,r=ur.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(W(e,a,n))i++;else if(W(e,a,r)&&(i--,i===0))return a;return t},_r=(e,t)=>({start:mr(e,t.start),end:hr(e,t.end)}),G=(e,t)=>{let n=t.location.range;if(n)return _r(e,n);let r=mr(e,t.location);return{start:r,end:gr(e,r)}},vr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&W(e,r,`)`)&&gr(e,n)===r?vr(e,{start:n,end:r}):t},yr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&gr(e,n)===r&&(W(e,n-1,`(`)||W(e,n-1,`,`))?yr(e,{start:n,end:r}):t},K=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),q=(e,t)=>K(e,{start:t,end:t}),br=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?re(r):r+1,r>=n)return i;i++}return i},xr=(e,t)=>{let n=e.tokens[t],r=br(e,n.line,n.column);return e.source.slice(r,br(e,n.line,n.endColumn)+1)},Sr=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},Cr=e=>{let n=fr(``,e),r=n.tokens.reduce((e,t,r)=>{if(!Sr(n,r))return e;let i=br(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(r!==e&&M(e)!==void 0)throw new t(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},wr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:br(e,n.line,n.endColumn)+1,a=e.source.slice(i,br(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
24
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},Tr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},Er=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(W(e,i,r))return i;return-1},Dr=new Map(ee.flatMap(([e,...t])=>t.map(t=>[t,e]))),Or=e=>e.split(`!`).map(e=>Dr.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),kr={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},Ar=e=>/^[A-Za-z0-9_]+$/.test(e),jr=e=>e!==`!!`&&e.includes(`!`),Mr=e=>e.contexts[e.contexts.length-1],Nr=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Jn(e.contexts[n],t);if(r)return r}},Pr=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,Fr=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,Ir=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||Lr(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&Lr(n.module)}return!1},Lr=e=>Zn(e,2).length===0&&Zn(e,3).length===0,Rr=e=>[...e.kind===`Let`?e.instances??[]:[],...S(e).flatMap(Rr)],zr=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:zr(e)):Rr(e),Br=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Vr=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Rr(e.definition.body):e.kind===`Theorem`&&s?zr(e.theorem.statement):e.kind===`Assumption`&&s?Rr(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Br(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Hr=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Ur=e=>{let t=e.kind===`Apply`?tr(e):void 0;return Hr.has(e.kind)||t!==void 0&&nr(t)},Wr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Gr=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Kr=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),qr=(e,t)=>Kr.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Jr=(e,n,r={})=>{let a=[],o=(e,t)=>Pn(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>Pn(a,{location:e,text:t,isWarning:!0}),c={value:r.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},f=(e,t)=>{let n=Nr(e,t.name);if(n===t)return;if(n===void 0){Kn(Mr(e),t);return}let i=t.kind===`FormalParam`||Pr(n)!==Pr(t)||qn(n)!==qn(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${Fn(n.location)}.`):Ir(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${Fn(n.location)}.`)};r.version!==`1.7.4`&&Nn(l);let p=Nn(l);l();let m=new Map(p.map(e=>[e.name,e])),g=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,y=(e,n)=>{let a=e===r.rootFileName&&r.rootFilePath||`${e}.tla`,o=t=>new i(`Could not parse module ${e} from file ${a}`,e,t),s=r.version===`1.7.4`?_(n):void 0;if(s!==void 0)throw o(s);try{return ae(Cr(n))}catch(e){throw e instanceof t?o(M(n)??`***Parse Error***\n${e.message}`):e}},b=(e,t,n)=>{let a=v.get(e);if(a)return a;if(t===void 0)throw new h(e,n,r.version!==`1.7.4`);r.onParse?.(e);let o=y(e,t);if(o.name!==e)throw new i(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:fr(o.name,t),module:o};return v.set(e,s),s},x=[],S=/* @__PURE__ */ new Set,C=[],w=(e,t,r)=>{let a=C.indexOf(e);if(a!==-1)throw new i(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...C.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(S.has(e))return;S.add(e),C.push(e);let o=k(e,b(e,t,r).module);[...o.extendees,...o.instancees].forEach(t=>w(t,n(t),e)),C.pop(),x.push(e)},ee=/* @__PURE__ */ new Set,T=(e,t)=>ee.has(`${e} ${t}`),E=(e,t,n)=>{let r=v.get(e);if(!r||n.has(e))return;n.add(e);let i=k(e,r.module),a=i[t].find(t=>!T(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=T(e,r)?E(r,t,n):void 0;if(i)return i}},D=t=>{b(t,e);let r=()=>E(t,`extendees`,/* @__PURE__ */ new Set)??E(t,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())v.has(e.name)||b(e.name,n(e.name),e.namingModule),ee.add(`${e.importer} ${e.name}`)},O=r.rootFileName??y(``,e).name,k=(e,t)=>{let n=Vr(t);return e!==O||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};D(O),w(O,e);let te=(e,n,i,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},p=[],h=[],_=[],v=[],y=/* @__PURE__ */ new WeakSet,b=()=>v.push({labels:/* @__PURE__ */ new Map,params:[]}),x=()=>v.pop()?.labels??/* @__PURE__ */ new Map,S={depth:0,isDeclared:[],goal:void 0,goalClause:0},C=/* @__PURE__ */ new WeakMap,w=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?C.get(e):void 0;t&&(t.isInProof=!1)},T=e=>K(n,G(n,e)),E=e=>e.range?_r(n,e.range):{start:mr(n,e),end:mr(n,e)},D={kind:`Module`,id:l(),name:e.name,location:K(n,E(e.location)),extendees:[],context:Mr(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let O=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Yn(a.contexts[t],e);if(n?.kind===`Module`)return n}return g.get(e)},k=e=>{let n=O(e);if(n===void 0)throw new t(`Could not find module ${e}`);return n},A=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},j=(e,t,n,r)=>{let i={...H(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&f(a,i),i},ne=e=>({...H(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),re=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},ie=(e,t,n,r={},i=l())=>({...H(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),M=()=>({...ie(ae(`$Nop`),[],Mn,{},u.id),isNull:!0}),ae=e=>{let t=m.get(e);if(!t)throw new d(`SANY has no builtin operator ${e}`);return t},N=(e,t,n,r={})=>ie(ae(e),t,n,r),oe=(e,t)=>({...H(l()),kind:`String`,value:e,location:t}),se=(e,t)=>({...H(l()),kind:`OpArg`,op:e,location:t}),ce=(e,n)=>{let r=Nr(a,Or(e));if(r===void 0||r.kind===`Module`)throw new t(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},le=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&qn(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},ue=lr({version:r.version,resolveSymbol:e=>Nr(a,e),resolveSynonym:Or,generateExpression:e=>I(e),generateArgument:(e,t,n,r)=>be(e,t,n,r),createOpAppl:(e,t,n)=>{let r=ie(e,t,n);return le(e,t,n),r},createOpArg:se,createFormalParam:(e,t,n)=>j(e,t,n,!1),createLambda:(e,t,r)=>ne({name:`LAMBDA`,params:e,body:t,location:r,preComments:wr(n,mr(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>He(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:ae,addError:(e,t)=>(o(e,t),M()),isOutOfLabelScope:e=>{let t=w.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=C.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),de=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=Er(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=gr(n,a);return r.value=t+1,{...e,location:K(n,{start:a,end:t})}}r.value=a+1;let o=q(n,a);if(e.args===void 0||!W(n,a+1,`(`))return{...e,location:o};let s=gr(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:K(n,{start:a+1,end:s})}})},fe=(e,r,i,a)=>{let o=tr(e);if(o===void 0)throw new t(`Expected a name, found ${e.kind}`);return ue(de(o,G(n,e)),r,i,a,T(e))},pe=e=>{let n=fe(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t(`Expected an expression`);return n},me=e=>{if(e.kind!==`OpAppl`)return;let t=p.find(t=>t.name===e.operator.name);t&&(t.node.operator=ae(`$RecursiveFcnSpec`))},he=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ge=(e,t)=>Me(e,t,he(e).map(e=>I(e[0].set))),P=(e,t)=>{let n=v.at(-1);n?.params.push(e);let r=I(t);return n?.params.pop(),r},_e=e=>{let t=G(n,e),r=Tr(n,t.start,t.end,e.params);return A(U(),()=>{let i=e.params.map((e,t)=>j(e,0,q(n,r[t]),!0)),a=P(i,e.body);return ne({name:`LAMBDA`,params:i,body:a,location:K(n,t),preComments:wr(n,t.start)})})},ve=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[mr(n,e.location)].text,ye=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?se(ce(ve(e),r),r):se(_e(e),r);if(!Ur(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),M();if(e.kind===`OperatorReference`)return se(ce(e.operator,r),r);let i=fe(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},be=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return I(i);let l=G(n,i),u=K(n,l),d=`${r+1} (counting from 1)`,f=yr(n,l);if(f!==l||!Ur(i))return o(K(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),M();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=fe(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t(`Expected an operator argument at ${Fn(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=_e(i),n=qn(t);return n===c?se(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),M())}let p=ve(i),m=Nr(a,Or(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),M();let h=qn(m);return h===c?se(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${Fn(e.location)}', \nbut an operator of arity ${c} was expected.`),M())},xe=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(I),t);let r=G(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=vr(n,G(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,I(t)],K(n,{start:r.start,end:c}))},I(a))},Se=e=>{let t=G(n,e),r=e.arms.map((r,i)=>{let a=vr(n,G(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=vr(n,G(n,r.body)),c=[I(r.condition),I(r.body)];return N(`$Pair`,c,K(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=vr(n,G(n,i)),a=Ce(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,I(i)],K(n,{start:a,end:t.end})))}return N(`$Case`,r,K(n,t))},Ce=(e,t)=>{for(let r=e;r>=0;r--)if(W(n,r,t))return r;return e},we=e=>{let t=G(n,e),r=K(n,t),i=[I(e.function)],a=N(`$Except`,i,r),o=G(n,e.function),s={value:Er(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=Er(n,s.value,t.end,`!`),o=vr(n,G(n,e.value)),c=K(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Te(l.value,e.name);return l.value=t+1,oe(e.name,q(n,t))}let r=Er(n,l.value,t.end,`[`),i=gr(n,r);return l.value=i+1,e.args.length===1?I(e.args[0]):N(`$Tuple`,e.args.map(I),K(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);_.push(f),h.push(a),f.operands.push(I(e.value)),_.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Te=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},Ee=(e,t)=>{let r=G(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Te(i.value,e.name),s=vr(n,G(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(q(n,a),`Non-unique fields in constructor.`),N(`$Pair`,[oe(e.name,q(n,a)),I(e.value)],K(n,{start:a,end:s.end}))}),s=N(e,a,K(n,r));return D.records.push(s),s},F=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),De=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=W(n,r+1,`(`)?gr(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...F(r),range:{module:n.name,start:F(r),end:F(e)}}}),!W(n,e+1,`,`))break;r=e+2}return t},Oe=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Fe(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Fe(e)}))],r=G(n,e).start,i=vr(n,G(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);W(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:De(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},ke=e=>{let t=U();return A(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];Oe(e).forEach(e=>{e.kind===`Recursive`?Be(e.declarations):e.kind===`Instance`?Ue(e.instance,n,r):e.definition.kind===`Function`?Re(e.definition,n):Ie(e.definition,n)}),Ve(),c.curLevel=Math.max(c.curLevel-1,0);let i=I(e.body);return{...H(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},Ae=e=>{let t=G(n,e),r=K(n,t);return A(U(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=Tr(n,t.start,t.end,a),s=a.map((e,r)=>j(e,0,q(n,i.kind===`Name`?t.start:o[r]),!0)),c=P(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=I(e.set),s=G(n,e.set),c=Tr(n,t.start,s.start,a),l=a.map((e,t)=>j(e,0,q(n,c[t]),!0)),u=P(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},je=e=>{if(Ar(e.operator)||jr(e.operator)||e.args.length>2||Nr(a,Or(e.operator))!==void 0)return;let t=G(n,e);if(n.tokens[t.start].text===e.operator&&W(n,t.start+1,`(`))return;let r=vr(n,G(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=xr(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},I=e=>{let t=T(e);switch(e.kind){case`Number`:return{...H(l()),kind:`Numeral`,value:Yr(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...H(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return oe(e.value,t);case`Identifier`:{let t=pe(e);return me(t),t}case`Apply`:{let r=je(e);if(r!==void 0)return o(q(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...M(),isAbsent:!0};let i=pe(e);return(jr(e.operator)||Ar(e.operator))&&me(i),i}case`Bracket`:return o(q(n,G(n,e).start),"Unsupported expression type `['."),{...M(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[G(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${qr(e,r)}'.`),{...M(),isAbsent:!0}}case`And`:case`Or`:return xe(e);case`Prime`:return N(`'`,[I(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[I(e.expression)],t);case`Enabled`:return N(`ENABLED`,[I(e.expression)],t);case`Always`:return N(`[]`,[I(e.expression)],t);case`Eventually`:return N(`<>`,[I(e.expression)],t);case`If`:return N(`$IfThenElse`,[I(e.condition),I(e.consequent),I(e.alternative)],t);case`Case`:return Se(e);case`Let`:return ke(e);case`Forall`:case`Exists`:{let r=G(n,e);return A(U(),()=>{let n=ge(e.bounds,r.start),i=P(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=G(n,e),i=G(n,e.body),a=Tr(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return A(U(),()=>{let r=e.names.map((e,t)=>j(e,0,q(n,a[t]),!0)),i=P(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return Ae(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(I),t);case`Tuple`:return N(`$Tuple`,e.elements.map(I),t);case`SetFilter`:{let r=I(e.bound.set),i=G(n,e);return A(U(),()=>{let n=Me([e.bound],i.start,[r]),a=P(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=G(n,e.expression);return A(U(),()=>{let n=ge(e.bounds,r.end+1),i=P(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=G(n,e);return A(U(),()=>{let n=ge(e.bounds,r.start),i=P(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[I(e.domain),I(e.range)],t);case`Record`:return Ee(`$RcdConstructor`,e);case`RecordSet`:return Ee(`$SetOfRcds`,e);case`Except`:return we(e);case`ExceptAt`:{let e=h[h.length-1],n=_[_.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),M()):{...H(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=I(e.function);if(In(n))return n;me(n);let r=e.args.length===1?I(e.args[0]):N(`$Tuple`,e.args.map(I),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=I(e.record),i=G(n,e);return N(`$RcdSelect`,[r,oe(e.field,q(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(I),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[I(e.action),I(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[I(e.subscript),I(e.action)],t);case`Label`:return Ne(e);case`Subexpression`:return pe(e)}},Me=(e,t,r)=>{let i=he(e),a={value:t};return{bounded:i.map(e=>{let t=G(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=Tr(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>j(e,0,q(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ne=e=>{let t=T(e),r=v.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),M();if(S.isDeclared.slice(2,S.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),M();if(h.length>0&&_.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),M();b();let i=I(e.body),s=x(),c=Tr(n,G(n,e).start,G(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=Nr(a,t);if(i?.kind===`FormalParam`)return i;let s=q(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),j(t,0,s,!1)}),d={...H(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=S.goal;return p&&w.set(d,{scope:p,clause:S.goalClause}),d},Pe=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?mr(n,e.location):Te(i.value,e.name),a=dt(t,e.arity);return i.value=a.end+1,j(Or(e.name),e.arity,K(n,a),r)})},Fe=e=>{let t=E(e.location);return e.isLocal&&!W(n,t.start,`LOCAL`)&&W(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ie=(e,t)=>{let r=Fe(e),i=K(n,r),s=Or(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=A(U(),()=>{let t=Pe(e,l,!0),n=Nr(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return b(),{params:t,body:I(e.body),existing:n}}),d=x(),p=u.existing,m=u.params,h=wr(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=d,Le(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=ne({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:d});f(a,g),re(g),D.definitions.push(g),t?.push(g)},Le=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Re=(e,t)=>{let r=Fe(e),i=K(n,r),s=U(),l=e.isLocal?r.start+1:r.start,u=A(s,()=>ge(e.bounds,l+1)),d=Nr(a,e.name),m=A(s,()=>j(e.name,0,i,d===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=d?.kind===`OpDef`&&d.inRecursive&&!d.isDefined,_=g&&d.letInLevel===c.curLevel;_?d.arity!==0&&o(i,`Function ${d.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):d!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=wr(n,r.start),y=d===void 0?ne({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):d.kind===`OpDef`&&(_||!g)?d:void 0;_?d.arity===0&&Le(d,h,i,v):d===void 0&&y!==void 0&&(f(a,y),re(y)),y!==void 0&&(D.definitions.push(y),t?.push(y)),p.unshift({name:e.name,node:h}),b();let S=()=>P(u.bounded.flat(),e.body),C=y===void 0?S():A(s,S),w=x();y!==void 0&&(y.labels=w),p.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},ze=[],Be=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ft(e);l();let r=Array.from({length:e.arity},()=>j(``,0,void 0,!1)),i=ne({name:Or(e.name),params:r,location:K(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});f(a,i),ze.push(i),D.opDefsInRecursiveSection.push(i)})},Ve=()=>{c.unresolvedCount[c.curLevel]!==0&&(ze.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},L=(e,t,i)=>{l();let s=Un(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=Nr(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?ie(t,[],i):se(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?qn(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Fe(e),f={value:Er(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=Er(n,f.value,d.end,e.name);r!==-1&&(f.value=G(n,e.expression).end+1);let a=Jn(t,Or(e.name));if(a?.kind!==`OpDecl`){o(r===-1?i:q(n,r),`Identifier '${r===-1?e.name:xr(n,r)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=a.arity===0?I(e.expression):ye(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(i,`Substitution missing for symbol ${e.name} declared at ${Fn(e.location)} \nand instantiated in module ${D.name}.`)),c},He=(e,t,n,r,i,a=D)=>(In(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
25
|
+
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...H(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),Ue=(e,t,i)=>{let o=Fe(e),s=K(n,o),c=wr(n,o.start),u=e.name??``,d=U(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(d);let m=Pe(e,{start:p,end:o.end},e.params.length>0),h=k(e.module),g=h.context,_=L(e,g,s);e.params.length>0&&a.contexts.pop(),Un(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?ne({name:i,params:r,body:_.length>0&&n.body?He(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):ne({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});f(a,o),n.defKind===`UserDefined`&&re(o),(t??D.definitions).push(o)}),Un(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?He(`APSubstIn`,_,n.body,h,s):n.body,i={...H(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};f(a,i),(t??D.definitions).push(i)});let v={...H(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(i??D.topLevel).push(v);let y=ne({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});f(a,y),r.version!==`1.7.4`&&t?.push(y)},We=(e,t=!0,r)=>{let i=Fe(e),o=r??K(n,i),s=wr(n,i.start),c=k(e.module),u=c.context,d=L(e,u,o),p=e.isLocal,m=Lr(c);Un(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=ne({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return f(a,r),r},n=()=>(f(a,e),e),r=e.module===void 0||Lr(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&He(`SubstIn`,d,e.body,c,o));D.definitions.push(i),re(i)}),Un(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...H(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return f(a,r),r},r=m?p?n(e.module,e.body):(f(a,e),e):Lr(e.module)?p?n(D,e.body):e:n(D,He(`APSubstIn`,d,e.body,c,o));t&&D.definitions.push(r)});let h={...H(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:d,location:o};return t&&D.topLevel.push(h),h},R=e=>{let t=O(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(q(n,mr(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},Ge=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return R(e);let n=tr(e);if(n===void 0||!nr(n))return[I(e)];let r=fe(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t(`Expected a fact`);return[r]}),Ke=e=>W(n,e.start,`(`)&&gr(n,e.start)===e.end,qe=e=>vr(n,G(n,e)),Je=(e,t)=>qe(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ye=(e,t)=>Ke(t)?`N_ParenExpr`:e.kind===`String`?xr(n,t.start):e.kind===`Apply`?Je(e,t):Wr.get(e.kind),Xe=(e,t)=>{if(e.kind===`String`&&!Ke(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ye(e,t);return n===void 0||Gr.has(n)?void 0:!0},Ze=(e,t)=>{let r=(e,t=qe(e))=>({last:t,lastKind:Ye(e,t)});if(Ke(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:Xe(e.expression,qe(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=qe(t),i=r.end+1;return{hasChildlessFirstChild:Xe(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=Je(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=qe(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Xe(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Qe=e=>{let t=vr(n,G(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ke(t))return!1;let r=Ze(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=K(n,r.last);return r.hasChildlessFirstChild&&o(K(n,t),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?o(i,"Selector `!(...)' should not have argument(s)."):(o(i,`Unexpected token found.`),o(i,`Need name or step number here, not \`${r.lastKind}'.`)),o(K(n,t),`DEF clause entry should describe a defined operator.`),!0},$e=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return R(e);if(Qe(e))return[];let t=fe(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(o(T(e),`DEF clause entry should describe a defined operator.`),[])}),et=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},tt=e=>{let t=K(n,E(e.location));et(e,t);let r=Ge(e.facts),i=$e(e.defs);return r.length+i.length===0&&o(t,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>o(e.location,`The only expression allowed as a fact in a HIDE is
|
|
26
|
+
the name of a theorem, assumption, or step.`)),{...H(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},nt=e=>{let t=E(e.location),r=e.set&&I(e.set),i=Te(t.start,e.name),o=kr[e.level],s={...H(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:Or(e.name),arity:e.arity,declKind:o.declKind,location:K(n,dt(i,e.arity)),module:D};return f(a,s),{...H(l()),kind:`NewSymb`,declaration:s,set:r,location:K(n,t)}},rt=(e,t,r)=>{let i=E(e.location),s=Sr(n,i.start-1),c=G(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=K(n,{start:s?i.start-1:i.start,end:i.start});s!==Sr(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(U()),s&&a.contexts.some(e=>y.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||y.add(Mr(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};S.depth=t,S.isDeclared[t]=!1,t===1&&(S.goal=r&&p,S.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?rt(e,t+1):r?nt(e):I(e);return S.depth=t,r&&(S.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&S.goalClause++,i}),h=I(e.conclusion);t>1&&a.contexts.pop(),S.depth=t-1,t===1&&(S.goal=void 0);let g={...H(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:K(n,{start:s?i.start-1:i.start,end:i.end})};return C.set(g,p),g},it=(e,t,n,r,i,a=!0)=>({...H(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),at=e=>{let t=K(n,E(e.location));e.kind===`By`&&et(e,t);let r=e.kind===`By`?Ge(e.facts):[],i=e.kind===`By`?$e(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...H(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},ot=(e,t)=>{let r=e.body,i=K(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[I(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[I(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(I),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(U());let s=e=>r.kind===`Pick`?[P(e,r.body)]:[];if(r.bounds.length>0){let n=ge(r.bounds,t.start),a=s(n.bounded.flat());return{node:N(o,a,i,n),isPick:e}}let c=Tr(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>j(e,0,q(n,c[t]),!0)),u=s(l);return{node:N(o,u,i,{unbounded:l}),isPick:e}}}},st=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=vr(n,G(n,e.args[0])),r=G(n,e).start;return t.start===r&&!W(n,t.end+1,`(`)},ct=e=>{if(e.kind!==`Steps`)return at(e);let r=U();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?Ue(e,n,i):e.kind===`Function`?Re(e,n):Ie(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t(`A DEFINE step defines no operator`);return r});return{...H(l()),kind:`DefStep`,defs:r,location:K(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...tt(e),location:K(n,r)};if(e.kind===`Instance`)return We(e,!1,K(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=_r(n,e.head),u={start:i.start+1,end:i.end},d=e.body;e.name!==void 0&&b();let p=e.name===void 0?void 0:l();d.kind!==`Assert`&&(s.previousRight=void 0);let m=c(d,r,u);if(m!==void 0)return e.name!==void 0&&f(a,ne({defKind:`NumberedProofStep`,name:e.name,location:K(n,r),labels:x(),step:m})),m;let h=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=d.kind===`Assert`&&d.isSuffices,_=U(),v=d.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=A(_,()=>rt(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=I(t);return N(`$Suffices`,[e],K(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&st(t)&&t.args[0].kind===`ExceptAt`,a=i?I(t.args[1]):void 0,o=i?ie(ce(t.operator,T(t)),[N(`$Nop`,[r],T(t.args[0])),a],T(t)):I(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=st(t)?c:void 0,o})(d.statement),isPick:!1}:ot(e,u);if(v===void 0)throw new t(`Unexpected proof step ${d.kind}`);let y=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:it(p,e.name,v.node,q(n,mr(n,e.location)),x());S&&f(a,S);let C=h&&!g;C&&a.contexts.push(_);let w=e.proof&&ct(e.proof);return C&&a.contexts.pop(),ee(v.node),h&&g&&(o.push(_),a.contexts.push(_)),y?.symbols.forEach(e=>f(a,e)),{...H(l()),kind:`Theorem`,definition:S,body:v.node,proof:w,isSuffices:g,location:K(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>Kn(r,e))}),a.contexts.pop(),{...H(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:K(n,E(e.location))}},lt=e=>{let t=K(n,E(e.location)),r=e.statement,i=U();e.name!==void 0&&b();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?rt(r,1,e.name===void 0?void 0:{isSuffices:!1}):I(r),c=e.name===void 0||o===void 0?void 0:it(o,e.name,s,t,x());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),f(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&ct(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),ee(s);let d={...H(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(d)},ut=e=>{let t=E(e.location),r=K(n,t);e.name!==void 0&&b();let i=I(e.expression),o=e.name===void 0?void 0:it(l(),e.name,i,r,x(),!1);o&&(f(a,o),D.definitions.push(o));let s={...H(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},dt=(e,t)=>t===0?{start:e,end:e}:W(n,e,`_`)?{start:e,end:W(n,e+2,`_`)?e+2:e+1}:W(n,e+1,`(`)?{start:e,end:gr(n,e+1)}:{start:e,end:W(n,e+1,`_`)?e+1:e},ft=e=>dt(E(e.location).start,e.arity),pt=(e,t)=>{let r=ft(e);e.name===`@`&&t===3&&o(K(n,r),`Attempted to declare '@' as a variable.`);let i={...H(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:Or(e.name),arity:e.arity,declKind:t,location:K(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),f(a,i),i};e.extends.forEach(e=>{let t=k(e);D.extendees.push(t);let n=Mr(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Yn(n,e.name):Jn(n,e.name);t===void 0?Kn(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${Fr(e)} of '${e.name}' conflicts with \nits ${Fr(t)} at ${Fn(t.location)}.`):t!==e&&!Ir(t,e)&&s(e.location,`Warning: the ${Fr(t)} of '${e.name}' conflicts with \nits ${Fr(t)} at ${Fn(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let mt=(e,t)=>{c.unresolvedSum!==0&&o(K(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Be(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Re(e.definition,void 0):Ie(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?We(e.instance):Ue(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),ut(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),lt(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),D.topLevel.push(tt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,U()]},r=te(e.module,n,D,t),i=O(r.name);i===void 0?Kn(Mr(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${Fn(i.location)}.`);break}}}),Ve(),D},A=x.map(e=>{r.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=b(e,void 0),n=U();p.toReversed().forEach(e=>Kn(n,e));let i=te(t.module,t.file,void 0,{contexts:[n]});return g.set(e,i),r.onModule?.(i,a),i});return{root:A[A.length-1],modules:A,messages:a}},Yr=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},J=(e,t,n,r)=>Pn(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Xr=(e,t,n)=>`${e.id}:${t}:${n.id}`,Zr=(e,t,n,r)=>{e.set(Xr(t,n,r),{op:t,index:n,param:r})},Qr=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},$r=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},ei=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&$r(e,r,t)})},ti=(e,t)=>`${e.id}:${t}`,ni=(e,t,n,r)=>{let i=ti(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},ri=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&ni(e,t.param,t.position,t.level)})},ii=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},ai=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),ei(e.levelConstraints,t.levelConstraints),ri(e.argLevelConstraints,t.argLevelConstraints),Qr(e.argLevelParams,t.argLevelParams)},oi=(e,t)=>t.includes(e.op)||t.includes(e.param),si=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,ci=e=>e.kind!==`Module`,li=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,ui=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,di=(e,t)=>e.kind===`OpDef`?e.weights[ui(e,t)]??0:0,fi=(e,t)=>e.maxLevels[ui(e,t)]??3,pi=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,mi=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[ui(e,t)]??!0:e.isLeibnizArg[t]??!0,hi=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,gi=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],_i=(e,t)=>t.find(t=>t.op===e)?.expr,vi=(e,t,n)=>{let r=_i(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},yi=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=_i(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!si(i.op))return;let a=i.op;vi(e.param,t,!1).forEach(t=>Zr(n,a,e.index,t))}),n},bi=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;vi(r,t,!1).forEach(e=>$r(a,e,i))}),e.argLevelParams.forEach(e=>{let n=_i(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=fi(n.op,e.index);vi(e.param,t,!1).forEach(e=>$r(a,e,o))}),a},xi=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=_i(e.param,t);n===void 0?ni(i,e.param,e.position,e.level):n.kind===`OpArg`&&si(n.op)&&ni(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=_i(e.param,t);if(a===void 0)return;let o=_i(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&si(s)&&(X(a,n,r),ni(i,s,e.index,a.level))}),i},Si=(e,t)=>Zn(e,3).length>0||(ji(e,t),Xn(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),Ci=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(ti(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Xr(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(ti(t,n))}),Qr(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},wi=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>fi(t,o)&&(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!li(a.op)))return;let s=a.op;X(s,r,i);let c=qn(s);for(let l=0;l<c;l++){let c=pi(t,o,l);fi(s,l)>=c||(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!hi(t,o,l,u)||n.level<=fi(s,u)||(X(a,r,i)&&X(n,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${Fn(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},Ti=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);ei(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&ei(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>ei(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=fi(t,r);n?.levelParams.forEach(t=>$r(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!li(n.op))return;let o=n.op;X(o,r,i);let s=qn(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!hi(t,a,r,i))continue;let s=fi(o,i);n?.levelParams.forEach(t=>$r(e.levelConstraints,t,s)),!o.isLeibniz&&!mi(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&li(n.op)&&(X(n.op,r,i),$r(e.levelConstraints,t.param,fi(n.op,t.index)))}),ri(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&ri(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>ri(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!si(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)ni(e.argLevelConstraints,i,n,pi(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&hi(t,r,a,o)&&ni(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),ni(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Qr(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Qr(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Zr(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&si(a.op)&&Zr(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!si(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&hi(t,r,a,o)&&n.levelParams.forEach(t=>Zr(e.argLevelParams,i,o,t))})})},Ei=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),Di=(e,t)=>{let n=(n,r)=>{J(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=Ei.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},Oi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(li(i)){let r=X(i,t,n);wi(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&di(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(di(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),mi(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(gi(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),Ti(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),ei(e.levelConstraints,t.levelConstraints),ni(e.argLevelConstraints,i,n,t.level),ri(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Zr(e.argLevelParams,i,n,t)),Qr(e.argLevelParams,t.argLevelParams)});return Di(e,n),e.levelCorrect},ki=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),Ci(e,i,r),e.levelCorrect},Ai=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),Ci(e,e.params,e.body)),e.levelCorrect),ji=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),ki(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||J(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),ki(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(ji(e,t)));let a=Xn(e);return a.forEach(e=>i(ki(e,1,t))),Qn(e).forEach(e=>i(Ai(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),Si(e,t)||Zn(e,2).forEach(t=>$r(e.levelConstraints,t,0)),a.forEach(t=>{ei(e.levelConstraints,t.levelConstraints),ri(e.argLevelConstraints,t.argLevelConstraints),Qr(e.argLevelParams,t.argLevelParams,e=>!oi(e,t.params??[]))}),e.topLevel.forEach(t=>{ei(e.levelConstraints,t.levelConstraints),ri(e.argLevelConstraints,t.argLevelConstraints),Qr(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},Mi=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{ci(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),ai(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),Ni=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&J(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&J(t,e.body.location,`Non-constant CASE for temporal goal.`),Ni(e.proof,t)):n===`$Qed`&&Ni(e.proof,t)})},Pi=(e,t,n,r,i,a)=>{e.levelConstraints=bi(t,n,r,i,a),e.argLevelConstraints=xi(t,n,i,a),e.argLevelParams=yi(t.argLevelParams,n)},Fi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;ji(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=Si(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||J(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(ti(i.op,t))?.level;a===void 0||fi(o,t)>=a||(s&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=fi(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&J(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return ei(e.levelConstraints,bi(r,e.substs,i,t,n),a),e.substs.forEach(t=>ei(e.levelConstraints,t.expr.levelConstraints,a)),ri(e.argLevelConstraints,xi(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>ri(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Qr(e.argLevelParams,yi(r.argLevelParams,e.substs),t=>!oi(t,e.params)),e.substs.forEach(t=>Qr(e.argLevelParams,t.expr.argLevelParams,t=>!oi(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!ci(e))return ji(e,n);switch(e.kind){case`OpAppl`:return Oi(e,t,n);case`OpDef`:return ki(e,t,n);case`ThmOrAssumpDef`:return Ai(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,ii(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),ei(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>ei(e.levelConstraints,t.levelConstraints)),ri(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>ri(e.argLevelConstraints,t.argLevelConstraints)),Qr(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Qr(e.argLevelParams,t.argLevelParams,e=>!oi(e,n))}),e.instances.forEach(t=>Qr(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,ii(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>ai(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,vi(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,vi(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=Si(e.instantiatedModule,n);return Pi(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return Fi(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,ii(e,e.body),e.level!==0&&J(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=Mi(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&J(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&Ni(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return Mi(e,e.facts,t,n);case`NonLeafProof`:return Mi(e,[...e.steps,...e.instances],t,n);case`DefStep`:return Mi(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,J(n,e.location,`Level error:
|
|
27
|
+
Temporal formula used as set.`)),ii(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>ai(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&$r(e.levelConstraints,t,2)})),e.levelCorrect}},Ii=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},Li=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Ri=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&Li.get(e)===t.name||n(t))return!0}}return Ii(e).some(n)};return n(e)},zi=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Bi=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Vi=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(zi(t).map(e=>Bi(e)?.value));return zi(e).every(e=>n.has(Bi(e)?.value))},Hi=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Hi(e,t))}),t),Ui=e=>{let t=[...[...Hi(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Vi(e,n)).flatMap(zi).some(Ri)?[]:zi(n).flatMap(t=>{let n=Bi(t),r=n&&Jn(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${Fn(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Wi=e=>`${Fn(e.location)}\n\n${e.text}`,Gi=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Wi(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Wi(e)}\n\n\n`)].join(``)},Ki=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),qi=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},Ji=e=>{try{return ae(Cr(e))}catch(e){if(e instanceof t)return;throw e}},Yi=(e,t)=>t===`1.7.4`&&_(e)!==void 0?void 0:Ji(e)?.name,Xi=(e,t=()=>void 0,n={})=>{let r=xe(e,`.tla`),a=k(n.version),o=n.fileName??r,s=F(e)?ke(e,`utf8`):a.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,F(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},x=kt(He(),u),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),ee=e=>{let t=S.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=An(x,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},T=(e,t)=>{if(n.isXmlExport||S.has(e))return;let r=Ji(t);if(r===void 0||r.name!==e)return;let i=[...S.values()].filter(t=>qi(t.module).includes(e));S.set(e,{text:t,module:r}),i.forEach(()=>ee(e)),qi(r).filter(t=>t!==e&&S.has(t)).forEach(ee)},E=()=>{if(w(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${Wi(e)}\n\n\n`))),e.length!==v.length&&(u(Gi(v)),_.value=!0,y.isAborted=!0)},D=e=>{let n=a.get(e),r=t(e),i=r===void 0&&n===void 0&&s!==void 0&&!d?b(s,e):void 0,o=r??i;return g.set(e,r===void 0?i===void 0?`standard`:`root file`:`file`),o!==void 0&&T(e,o),o??n},O=(()=>{try{if(s===void 0)throw new i(`Cannot find source file for module ${o}`,void 0);return T(r,s),Jr(s,D,{rootFileName:r,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&ee(r),w()},onAnalyze:e=>{E(),(h||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&ji(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${Gi(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Wi(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Wi(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof m){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Gi(v));return}if(!(e instanceof i))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Wi(t)}\n\n\n`);return}u(Wi(t)),u(Gi(y.isReported?[t]:[...v,t]))}})();if(O!==void 0&&E(),O!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=O.modules.filter(e=>!Ki.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(Ui).forEach(e=>u(`${Wi(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:O}},Zi={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Qi=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),$i={"&":`&`,"<":`<`,">":`>`,"\r":` `},ea=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:$i[e]),ta=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,na=e=>{let t=(e.cdata??e.text)?.match(ta)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=na(t);if(e)return e}},ra=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${ea(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)ra(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},ia=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),aa=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},oa={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},sa={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},ca=Fn(`--TLA+ BUILTINS--`),la=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},ua=(e,t=16)=>e>t*.75?ua(e,t*2):t,da=(e,t)=>(e^e>>>16)&t-1,fa=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},pa=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),ma=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,ha=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=fa(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(ma,``)}).join(`
|
|
28
|
+
`)},ga=e=>{let t=fa(e),n=e=>pa(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
29
|
+
`)},_a=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},l=[],u=(e,t)=>{if(!r)return t();l.push(...e);let n=t();return l.length-=e.length,n},f=(e,t)=>{let n=[...l,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
30
|
+
`),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return a(new c(r,i),Zi.uncaughtException)},p=e=>f(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),m=(e,t)=>(i.has(e.id)||(i.add(e.id),o.set(e.id,u([...t?[t]:[],...la(e.kind,Fn(e.location))],()=>v(e)))),Z(aa(e),[Q(`UID`,e.id)])),h=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[ia(n),...r]:r;return{...e,children:[...i,...e.children]}},g=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[m(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),_=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
31
|
+
`),r=n.isUncommented?ga(ha(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},v=e=>{switch(e.kind){case`FormalParam`:return h(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return h(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?f(Qi(37),[sa]):a(new d(Qi(37)),Zi.uncaughtException);if(e.defKind===`ModuleInstance`)return h(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return h(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[g(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,i=e.module;if(n===void 0&&r)throw p($.body);if(n===void 0||i===void 0)throw Error(`The definition of ${e.name} has no body`);return h(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[C(n,$.body)]),...e.params?[g(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[m(e.source??e)]),Z(`originallyDefinedInModule`,[m(i)]),Z(`body`,[C(n,$.body)]),g(t,e.isLeibnizArg,$.param),..._(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return h(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),C(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[ia(e.location),...y(e)]);case`Theorem`:return h(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[m(e.definition,$.theoremDefinition)])]:[],Z(`body`,[C(e.body,$.theorem)]),...e.proof?[C(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[ia(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[m(e.definition,$.assumeDefinition)])]:[],Z(`body`,[C(e.body,$.assume)])])}},y=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Zn(e,2).filter(t).map(e=>m(e,$.constant)),...Zn(e,3).filter(t).map(e=>m(e,$.variable)),...Xn(e).filter(t).map(e=>m(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?C(e,$.topLevel):m(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>m(e))]},b=(e,t)=>u([t],()=>Z(`Subst`,[m(e.op,$.substOperator),C(e.expr,$.substExpression)])),x=e=>{if(e.isNull&&r)throw f(Qi(0),[$.operator,...la(`OpDef`,ca),sa]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=m(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&In(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):C(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[m(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>m(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],C(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...o])},S=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?m(e,t):C(e,t),C=(e,t)=>{if(!r)return w(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw p(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:Fn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return u(n,()=>w(e))},w=e=>{switch(e.kind){case`OpAppl`:return h(x(e),e,e.location);case`Numeral`:return h(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return h(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return h(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=C(e.body,$.letBody);return h(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>m(e,$.letDefinition)))]),e,e.location)}case`Label`:return h(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[C(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>m(e,$.labelParam)))]),e,e.location);case`OpArg`:return h(Z(`OpArgNode`,[Z(`argument`,[m(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return h(Z(`AtNode`,[C(t,$.exceptObject),C(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=oa[e.kind],n=e.substs.map(e=>b(e,t.subst)),r=C(e.body,t.body);return h(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[m(e.instantiatingModule,t.from)]),Z(`instTo`,[m(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>b(e,$.instanceSubst)),n=e.params.map(e=>m(e,$.instanceParam));return Z(`InstanceNode`,[ia(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return h(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>S(e,$.useFact))),Z(`defs`,e.defs.map(e=>m(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return h(Z(`NewSymbNode`,[m(e.declaration,$.newDeclaration),...e.set&&!(r&&In(e.set))?[C(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return h(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>C(e,$.assumption))),Z(`prove`,[C(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>S(e,$.byFact))),Z(`defs`,e.defs.map(e=>m(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return h(n,e,e.location)}case`NonLeafProof`:return h(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?m(e,$.step):C(e,$.step))]),e,e.location);case`DefStep`:return h(Z(`DefStepNode`,e.defs.map(e=>m(e,$.defStep))),e,e.location)}},ee=(n.isRestricted?[t]:e).map(e=>m(e,$.main)),T=ua(o.size),E=Z(`context`,[...o.entries()].toSorted(([e],[t])=>da(e,T)-da(t,T)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),E,...ee])},va=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=_a(e.modules,e.root,t),r=na(n);if(r){let e=r.character.codePointAt(0)??0;throw a(new d(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Zi.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return ra(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
|
|
32
|
+
`)}\n`},ya=`META-INF/MANIFEST.MF`,ba=async e=>{if(e===void 0||!F(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(ke(e),{filter:e=>e.name===ya})[ya];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},xa={success:o.success,"assumption-violation":o.assumptionViolation,deadlock:o.deadlock,"invariant-violation":o.safetyViolation,"property-violation":o.safetyViolation,"liveness-violation":o.livenessViolation,"postcondition-violation":o.assumptionViolation,error:o.error},Sa=Ve(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),Ca=Ve(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`-N`,isRequired:!0},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--summary`},{flag:`--strict`},{flag:`-I <directory>`,isRepeatable:!0}]),wa=Ve(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`--backend <${ye.join(`|`)}>`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-workers <count|auto>`}]),Ta=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),Ea=/* @__PURE__ */ new Set([`-o`]),Da=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
33
|
+
`)})(),Oa=[`Usage: ${Sa.usage}`,` ${wa.usage}`,` ${Ca.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
34
|
+
`),ka=/[*?[{]/,Aa=e=>e.flatMap(e=>ka.test(e)?De(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),ja=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),Ma=e=>e?e[0]===`auto`?Ne():Math.max(1,Number.parseInt(e[0],10)||1):1,Na=[`constrained`,`stuttering`,`strict`],Pa=(e,t)=>e.endsWith(t)?e:`${e}${t}`,Fa=e=>{if(e.length===1)return{path:Pa(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Pa(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},Ia=(e,t)=>e.print(w.computingInitProgress,O.none,`Computed ${t} initial states...`),La=(e,t)=>e===`invariant-violation`?{code:w.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:w.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},Ra=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return Ia(e,t.count);let n=La(t.status,t.name);e.print(n.code,O.error,`${n.text}\n${se(t.state)}`)}),za=(e,t,n={code:w.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,O.error,n.text),t.forEach((t,n)=>{(n>0||r)&&Ra(e,t.output),e.print(w.statePrint2,O.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${se(t.state)}`)})},Ba={code:w.counterExample,text:`The following behavior constitutes a counter-example:
|
|
35
|
+
`},Va=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
|
|
36
|
+
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Ha=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${T(e)}\n`).toReversed().join(``),Ua=e=>{if(e.length===0)return` The error call stack is empty.
|
|
37
|
+
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Wa=(e,t)=>{let n=t.generated,r=t.distinct,i=C(/* @__PURE__ */ new Date);n===r?e.print(w.initGenerated1,O.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(w.initGenerated2,O.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},Ga=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(w.progress,O.none,`Progress(${Math.max(t.depth,1)}) at ${C(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},Ka=(e,t)=>Te(e,`${t}.class`),qa=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(w.sanyFinished,O.none,`SANY finished.`),i(w.starting,O.none,`Starting... (${C(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(w.constantLevelInvariant,O.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(w.stateLevelProperty,O.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(w.livenessSymmetry,O.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(w.livenessConstraints,O.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(w.temporalBranches,O.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=Le(Ee(Ka(r,t.module))).href;i(t.isMatched?w.javaOverrideLoaded:w.javaOverrideMismatch,t.isMatched?O.none:O.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(w.computingInit,O.none,`Computing initial states...`);return;case`initial-states-progress`:Ia(e,t.count);return;case`initial-states-computed`:Wa(e,t.initialStates);return;case`progress`:Ga(e,t.statistics,n.start);return;case`liveness-started`:{n.liveness=Date.now(),t.isComplete&&Ga(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(w.checkingTemporal,O.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${C(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Ja(e,n);return;case`warning`:i(t.code,O.warning,t.text)}},Ja=(e,t)=>{t.liveness!==void 0&&(e.print(w.checkingTemporalEnd,O.none,`Finished checking temporal properties in ${te(Date.now()-t.liveness)} at ${C(/* @__PURE__ */ new Date)}`),t.liveness=void 0)},Ya=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),s={code:w.temporalPropertyViolated,text:Va(t.properties??[i],n.version)},c={success:void 0,error:void 0,"assumption-violation":t.message?{code:w.assumptionEvaluationError,text:v(w.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:w.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:w.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?La(`invariant-violation`,i):{code:w.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":s,"liveness-violation":a===void 0?o?La(`liveness-violation`,i):{code:w.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:s,"postcondition-violation":{code:t.postcondition?.code??w.general,text:t.message??`Postcondition ${i} is false.`}}[e],l=e===`property-violation`,u=a!==void 0&&!l,d=l||u,f=d&&n.version!==`1.7.4`;if(f&&Ra(n,t.trace[0]?.output),t.counts&&console.log(t.counts),c){let e=o?`${c.text}\n${se(t.trace[0].state)}`:c.text;r(c.code,O.error,e)}if(o||(d||Ra(n,t.trace[0]?.output),za(n,t.trace,d?Ba:void 0,d&&!f),Ra(n,t.traceOutput)),u){let e=t.loopLabel;a===t.trace.length-1?r(w.statePrint3,O.state,`${a+2}: Stuttering`):n.isTool?r(w.backToState,O.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,O.warning,t.warning.text);let p=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return p?.counts&&console.log(p.counts),p&&r(p.code,O.error,p.message),!o&&e!==`assumption-violation`},Xa=(e,t)=>e.print(w.nestedExpression,O.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Ua(t)}`),Za=(e,t,r)=>{let i=t.print;if(e.failure){let r=e.failure,s=t.isTool?r.toolMessage:r.message,c=()=>{let e=r.fingerprint;if(e){let n=r.callStack?.length&&t.version!==`1.7.4`?Ua(r.callStack):Ha(e.sources);i(w.fingerprintFailed,O.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${A(e.reason,t.isTool)}`)}else r.callStack&&Xa(t,r.callStack)};r.isCallStackFirst&&c();let u=r.initialState&&(()=>{try{return`While working on the initial state:\n${se(r.initialState)}`}catch(e){throw e instanceof l?a(new l(`${n}${e.message}`),o.error):e}})();i(u?w.initialState:r.code,O.error,u?`${s}\n${u}`:s),Ra(t,r.trace[0]?.output),za(t,r.trace);let d=r.traceFailure;d&&i(d.code,O.error,t.isTool?d.toolMessage:d.message),Ra(t,r.traceOutput);let f=r.postcondition;f?.counts&&console.log(f.counts),f&&i(f.code,O.error,f.message),r.isCallStackFirst||c()}else if(e.violation){if(!Ya(e.status,e.violation,t))return;let n=e.additionalViolation;n&&Ya(`property-violation`,n,t),e.liveCallStack&&Xa(t,e.liveCallStack)}else{Ja(t,r);let n=ne(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${N(ie(e.fingerprintDistance))}`];i(w.success,O.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${N(n)}`,...a].join(`
|
|
38
|
+
`))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Ja(t,r),t.isTool&&Ga(t,e,r.start),i(w.stats,O.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let s=t.version===`1.7.4`,c=s?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!s||c)&&i(w.searchDepth,O.none,`The depth of the complete state graph search is ${s?Math.max(e.depth,1):e.depth}.`);let u=c&&le(c);u&&i(w.stateGraphOutdegree,O.none,u)},Qa=(e,t)=>e.map(e=>Te(e,`${t}.tla`)).find(F),$a=e=>t=>{let n=Qa(e,t);return n===void 0?void 0:ke(n,`utf8`)},eo=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),to=e=>`jar:file:${Le(Ee(e)).pathname}!/tla2sany/StandardModules/`,no=e=>x([e]).toString(),ro=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Fe(),o=F(a)?je(a):Ee(a),s=Te(o,`tlc-${no(Ee(e))}`),c=Lo(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return je(Qa(t,n)??e);if(i===`1.7.4`)return Te(o,l);if(a===`root file`){let t=r===void 0?o:Ee(r),i=je(e);return`${Te(t,no(`${i} ${n}`),l)} (${i})`}let u=Te(s,l);return c===void 0?u:`${u} (${to(c)}${l})`}},io=e=>e.print(w.version,O.none,`TLC2 Version ${ze} (rev: tla-ts)`),ao=(e,t)=>(io(e),e.print(w.commandLineError,O.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),oo=(e,t,n)=>e.print(w.modelChecking,O.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${Ne()} cores with ${Math.floor(Re().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Ie()} ${Pe()} ${Me()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),so=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},co=async(e,n,a,s)=>{let c=n.has(`-seed`)?n.get(`-seed`)?.[0]:`0`;if(c===void 0)return ao(s,`Error: seed required.`);if(!ja(c))return ao(s,`Error: An integer for seed required. But encountered ${c}`);let l=n.has(`-lncheck`)?n.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(l===void 0)return ao(s,`Error: expect a strategy such as final for -lncheck option.`);let d=n.get(`-dump`);if(d?.length===0)return ao(s,`Error: A file name for dumping states required.`);let p=d?.length===2&&Na.find(e=>d[0].toLowerCase().includes(e));if(p)return console.error(`Error: tla-ts does not support the -dump format ${p}.`),1;let m=n.get(`-fp`)?.[0];if(m!==void 0&&Number(m)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${m}.`),1;let h=Ma(n.get(`-workers`)),_=s.version;io(s),oo(s,c,h);let v=n.get(`-config`)?.[0]??(n.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!v||!F(v))return s.print(w.configFileError,O.error,`TLC encountered the following error when trying to read the configuration file ${v??``}:\nFile not found.`),o.configParseError;let b=xe(e,`.tla`),x={start:Date.now(),liveness:void 0,isParsed:!1},S=()=>{let e=Date.now()-x.start;s.print(w.finished,O.none,`Finished in ${s.isTool?`${e}ms`:te(e)} at (${C(/* @__PURE__ */ new Date)})`)},ee=()=>s.print(w.parsingFailed,O.error,`Parsing or semantic analysis failed.`),T=e=>(e instanceof t?ee():uo(e,s),S(),r(e)),k=(()=>{try{return D(ke(v,`utf8`),_)}catch(e){if(!(e instanceof f))throw e;return e}})();if(k instanceof f&&_===`1.7.4`)return s.print(w.general,O.error,`${g(`tlc2.tool.ConfigFileException`)}${A(k.message,s.isTool)}`),S(),o.error;if(k instanceof f)return T(k);n.has(`-deadlock`)&&(k.checkDeadlock=!1);let j=Ce(e),ne=[j,...a.libraries],re=$a(ne),ie=so(n,_),M=async()=>{let t=ke(e,`utf8`),r=E(t).name;if(r!==b)throw new i(`File name '${b}' does not match the name '${r}' of the top level module it contains.`,void 0);let a=await he({workers:h,livenessCheck:[`final`,`seqfinal`,`off`].includes(l)?`final`:`default`,seed:BigInt(c),dump:d&&Fa(d),isTool:s.isTool,isTraceRecorded:ie,isSanyReported:!0,isWarningEnabled:!n.has(`-nowarning`),version:_,onProgress:e=>qa(s,e,x,j),source:t,config:k,onPause:()=>Ae(0,Buffer.alloc(1)),loadModule:re,loadClass:e=>{let t=Ka(j,e);return F(t)?ke(t):void 0},readFile:e=>F(e)?ke(e,`utf8`):void 0,writeFile:(e,t)=>{Oe(Ce(Ee(e)),{recursive:!0}),I(e,t)}});return Za(a,s,x),S(),a.failure?.exitCode??xa[a.status]};s.isTool&&s.print(w.startingSany,O.none,`Starting SANY...`);let ae=we(e),N=ae?b:e.replace(/\.tla$/,``),oe=Lo(a),se=_===`1.7.4`?Mo(e,a,oe):void 0;if(se?!F(e)&&!y.has(b)&&se(`${b}.tla`):!F(e)&&!ue.has(b)&&eo(ae?j:process.cwd(),ae?`${b}.tla`:`./${N}.tla`,[...ae||j===`.`?[]:[j],...a.libraries]),Xi(e,se?No(re,se):re,{fileName:N,describeFile:ro(e,ne,a,n.get(`-metadir`)?.[0],_),version:_,rootExtendees:ie?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return qa(s,{kind:`parsed`},x,j),ee(),S(),o.specParseError;try{return await M()}catch(e){if(!(e instanceof u))throw e;return e instanceof t&&console.log(lo(e,b)),x.isParsed||qa(s,{kind:`parsed`},x,j),T(e)}},lo=(e,t)=>{let n=e instanceof i;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},uo=(e,t)=>{if(e instanceof f||e instanceof l){let n=j(e.message),r=n&&!n.isEvalException?n.code:w.general;return t.print(r,O.error,v(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},fo=async(e,t=de(!1))=>{try{return await e()}catch(e){if(!(e instanceof u))throw e;return uo(e,t),r(e)}},po=async(e,t,n)=>{let r=[];for(let[i,a]of e.entries()){i>0&&console.log(``);let e=n();r.push(await fo(()=>t(a,e),e))}return r.find(e=>e!==o.success)??o.success},mo=()=>be().map(e=>Te(Ce(Ce(je(e))),`lib/tlapm/stdlib`)).find(e=>F(e)),ho=e=>e.flatMap(e=>ka.test(e)?De(e).sort():[e]),go=e=>F(e)?{file:e,source:ke(e,`utf8`)}:void 0,_o=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),vo=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,yo=e=>console.log(`\n\\* TLAPM version 5f5037f\n\\* launched at ${C(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`prove`,...e].map(vo).join(` `)}\n`),bo={incomplete:11,emptyTarget:12},xo=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${pe(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${pe(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${ve(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${ve(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[bo.incomplete]:[],...a?[bo.emptyTarget]:[]]},So=t=>{try{return t()}catch(t){if(!(t instanceof e))throw t;console.error(` tlapm ending abnormally with ${t.exception}\n`);return}},Co=e=>{let t=wa.parse(e),n=t.get(`--backend`)?.[0];if(t.unknown[0]!==void 0||t.incomplete||n!==void 0&&!ge(n))return console.error(`Usage: ${wa.usage}`),1;let r=ho(t.positionals).map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(r.length===0)return console.error(`Usage: ${wa.usage}`),1;let i=mo(),a=t.options.flatMap(e=>e.name===`-I`?e.values:[]);return po(r,async e=>{let r=[Ce(e),`.`,...i?[i]:[],...a.toReversed()],s=await _e({source:ke(e,`utf8`),loadModule:e=>r.map(t=>go(`${t}/${e}.tla`)).find(Boolean)?.source,backend:n,workers:Ma(t.get(`-workers`)),onObligation:t=>console.log(`${e}:${t.location}: ${t.status}${t.status===`proved`?` by ${t.prover}`:``}${t.status===`failed`||t.status===`unsupported`?` (${t.reason})`:``}`)}),c=Map.groupBy(s.obligations,e=>e.status),l=e=>c.get(e)?.length??0;return console.log(`${s.obligations.length} obligations: ${l(`proved`)} proved, ${l(`trivial`)} trivial, ${l(`failed`)} failed, ${l(`unsupported`)} unsupported`),l(`failed`)+l(`unsupported`)===0?o.success:1},()=>de(!1))},wo=t=>{if(!t.includes(`-N`)&&!t.includes(`--summary`))return Co(t);let n=Ca.parse(t),r=n.unknown[0];if(r!==void 0)return console.error(`Error: tla-ts prove does not support the tlapm option ${r}.`),1;if(n.incomplete)return console.error(`Error: option '${n.incomplete.name}' needs an argument.`),1;let i=n.options.find(e=>e.name!==`-I`&&e.values.some(e=>!/^-?\d+$/.test(e)));if(i)return console.error(`Error: option '${i.name}' expects an integer.`),1;let a=ho(n.positionals),s=a.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(s.length===0)return console.error(Oa),1;let c=n.has(`--toolbox`)||n.has(`--line`);c&&yo(t);let l=n.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?me:{start:n,end:n}:e},me),u=mo(),d=n.options.flatMap(e=>e.name===`-I`?e.values:[]),f=s.reduce((e,t)=>e.includes(Ce(t))?e:[Ce(t),...e],[`.`,...u?[u]:[],...d.toReversed()]),p=So(()=>{let t=s.findIndex(e=>!F(e));if(t!==-1){let n=a[t];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new e(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return P(s.map(e=>({file:`./${e}`,source:ke(e,`utf8`)})),e=>f.map(t=>go(`${t}/${e}.tla`)).find(Boolean),{lines:l,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(c&&t)return _o([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!p)return 3;let m=p.flatMap(e=>(n.has(`--summary`)&&console.log(fe(e)),c&&(e.obligations.forEach(e=>_o([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:to be proved`,...n.has(`--printallobs`)?[`obl:${e.text}`]:[]])),_o([`type:obligationsnumber`,`count:${e.obligations.length}`])),n.has(`--strict`)?xo(e,l.start>0||l.end<1/0,n.has(`--summary`)):[]));return m.includes(bo.incomplete)?bo.incomplete:m[0]??o.success},To=async(e,t)=>{let n=Sa.parse(e),r=Aa(n.positionals),i=n.has(`-config`),a=r.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||i||F(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(Oa),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>F(e)||we(e)?e:t.libraries.map(t=>Te(t,e)).find(F)??e))],s=t.tlcVersion??`master`;return po(o,(e,r)=>(o.length>1&&console.log(`Checking ${xe(e)} with ${xe(e,`.tla`)}.cfg`),co(e,n,t,r)),()=>de(n.has(`-tool`),!n.has(`-nowarning`),s))},Eo=e=>(process.stderr.write(`ERROR: ${e}\n${Da}`),Zi.argsParsingFailure),Do=(e,t)=>{try{return process.stdout.write(va(e,t)),o.success}catch(e){if(!(e instanceof d))throw e;let t=r(e),n=e instanceof c?e.unwound:``;return console.error(t===Zi.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},Oo=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={flag:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.flag=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.flag=i}return r.flag===e.length-2?n:{...n,error:`several-files`}},ko=e=>{if(e.length===0)return Eo(`at least one .tla file must be given`);let t=Oo(e,Ta);if(t.error===`missing-include`)return Eo(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return Eo(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(Da),o.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>Ee(e,r)).find(F);a===void 0&&!ue.has(r.slice(0,-4))&&eo(process.cwd(),`./${r}`,t.includes);let s=Xi(a??r,$a(i),{fileName:n,isXmlExport:!0});return process.stderr.write(s.text),s.isFailed||s.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Zi.specParsingFailure):Do(s.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},Ao=(e,t,n)=>console.error(`File does not exist: ${we(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[to(n)]].join(`, `)}`),jo=e=>e.endsWith(`/`)?e:`${e}/`,Mo=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!we(e)&&r!==``?[r]:t.libraries).map(jo),a=i.length>0?i[i.length-1]:we(e)?r:``;return e=>Ao(`${a}${e}`,i,n)},No=(e,t)=>n=>{let r=e(n);return r===void 0&&!y.has(n)&&t(`${n}.tla`),r},Po=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Zi.uncaughtException),Fo=(e,t)=>{if(e.length===0)return Po(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=Oo(e,Ea);if(n.error===`missing-include`)return Po(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return Po(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(jo),s=[`.`,...a],c=e=>Ao(`${a[a.length-1]}${e}`,a,t),l=s.map(e=>Ee(e,i)).find(F);if(l===void 0&&!y.has(xe(i,`.tla`)))return c(i),o.success;let u=Xi(l??i,No($a(s),c),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?Po(`tla2sany.xml.XMLExportingException: spec ${(l&&Yi(ke(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):Do(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Io=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Lo=e=>e.classPath?.split(Se).find(e=>e.endsWith(`.jar`)),Ro=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(Se));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Io.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},zo=e=>e.mainClass===`tlc2.TLC`?To(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?fo(()=>e.java.tlcVersion===`1.7.4`?Fo(e.args,Lo(e.java)):ko(e.args)):(console.error(`Error: tla-ts runs the Java classes ${Io.join(` and `)}, not ${e.mainClass}.`),1),Bo=async e=>{if(e[0]===`prove`)return fo(()=>wo(e.slice(1)));let t=Ro(e);return t===void 0?To(e,{libraries:[]}):(t.java.tlcVersion??=await ba(Lo(t.java)),zo(t))},Vo=async()=>{process.exitCode=await Bo(process.argv.slice(2))};export{Vo as runCli};
|