tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79
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 +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +47 -44
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +474 -718
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +8 -7
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +244 -238
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +31 -106
- package/src/exit-codes.ts +2 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +616 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +50 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +15 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +206 -44
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +22 -47
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +54 -26
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/README.md
CHANGED
|
@@ -161,10 +161,11 @@ pnpm --filter tla-ts conformance:fetch
|
|
|
161
161
|
pnpm --filter tla-ts conformance
|
|
162
162
|
```
|
|
163
163
|
|
|
164
|
-
Run the TLC conformance
|
|
164
|
+
Run the TLC and tlapm conformance suites in `packages/conformance`:
|
|
165
165
|
|
|
166
166
|
```shell
|
|
167
167
|
pnpm --filter @tla-ts/conformance fetch-tlc
|
|
168
|
+
pnpm --filter @tla-ts/conformance fetch-tlapm
|
|
168
169
|
pnpm --filter @tla-ts/conformance conformance
|
|
169
170
|
```
|
|
170
171
|
|
package/dist/compile.cjs
CHANGED
|
@@ -11,13 +11,13 @@ var e=Object.create,t=Object.defineProperty,n=Object.getOwnPropertyDescriptor,r=
|
|
|
11
11
|
`),`IF `,` `),...C(w(e.whenTrue),`THEN `,` `),...C(w(e.whenFalse),`ELSE `,` `)]:[...e.definitions.flatMap((e,t)=>C(e.split(`
|
|
12
12
|
`),t===0?`LET `:` `,` `)),...C(w(e.body),`IN `,` `)],ae=e=>w(e).join(`
|
|
13
13
|
`),oe=/* @__PURE__ */ new Set([`(`,`[`,`{`]),se=/* @__PURE__ */ new Set([`)`,`]`,`}`]),ce=e=>[...e].reduce((t,n,r)=>{if(t.isSkipped)return{...t,isSkipped:!1};if(t.isQuoted)return{...t,isQuoted:t.isEscaped||n!==`"`,isEscaped:!t.isEscaped&&n===`\\`};let i=e.slice(r,r+2);return i===`<<`?{...t,depth:t.depth+1,isSkipped:!0}:i===`>>`&&t.depth>0?{...t,depth:t.depth-1,isSkipped:!0}:n===`"`?{...t,isQuoted:!0}:oe.has(n)?{...t,depth:t.depth+1}:se.has(n)?{...t,depth:t.depth-1}:t.depth===0?{...t,surface:t.surface+n}:t},{depth:0,isQuoted:!1,isEscaped:!1,isSkipped:!1,surface:``}).surface,le=e=>e!==``&&!/^[~-]/.test(e)&&!e.includes(`
|
|
14
|
-
`)&&!ce(e).includes(` `),T=e=>le(e)?e:`(${e})`,ue=[` = `,` # `,` < `,` > `,` <= `,` >= `,` \\in `,` \\notin `,` \\subseteq `,` /\\ `,` \\/ `,` => `,` ~> `],E=e=>e.startsWith(`~`)
|
|
15
|
-
`).join(`\n${t}`),O=e=>({bindings:new Map(e.variables),previous:void 0}),k=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),de=(e,t)=>{if(!d.default.isIdentifier(e.name)||e.initializer!==void 0||e.questionToken!==void 0||e.dotDotDotToken!==void 0)throw new l.L(`Use a plain parameter here: ${e.getText()}`,e);return{node:e,name:t.names.getFresh(e.name.text),symbol:h(e.name,t.checker)}},fe=(e,t)=>e.map(e=>de(e,t)),A=(e,t,n,r)=>d.default.isIdentifier(e)?k(n,[{name:t,symbol:h(e,r.checker)}]):e.elements.reduce((n,i,a)=>{if(d.default.isOmittedExpression(i))return n;if(i.dotDotDotToken!==void 0||i.initializer!==void 0)throw new l.L(`Rest elements and default values aren't supported`,i);let o=d.default.isArrayBindingPattern(e)?`${T(t)}[${a+1}]`:`${T(t)}.${(i.propertyName??i.name).getText()}`;return A(i.name,o,n,r)},n),pe=(e,t,n,r)=>{let i=r.names.getFresh(d.default.isIdentifier(e)?e.text:`value`);return{definitions:[`${i} == ${D(t,` `)}`],scope:A(e,i,n,r)}},me=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=pe(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),he=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),ge=(e,t,n)=>{if(d.default.isIdentifier(e)){let r=h(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=_(r);if(i!==void 0&&!n.has(i))return n.add(i),ge(i,t,n)}return d.default.forEachChild(e,e=>ge(e,t,n)||void 0)??!1},_e=e=>d.default.isVariableDeclaration(e)?e.initializer:void 0,j=(e,t)=>{let n=t.definitions.get(e);if(n!==void 0)return t.inProgress.has(e)&&t.recursive.add(e),n;if(e.name===void 0)throw new l.L(`Name this function`,e);let r=v(e),i=fe(r?.parameters??[],t),a=i.map(e=>{let n=t.checker.getTypeAtLocation(e.node.name).getCallSignatures();return n.length===0?e.name:`${e.name}(${n[0].parameters.map(()=>`_`).join(`, `)})`}),o={name:t.names.getFresh(e.name.getText()),parameters:a,readsState:ge(e,t,/* @__PURE__ */ new Set([e]))};t.definitions.set(e,o),t.inProgress.add(e);let s=r===void 0?_e(e):r.body;if(s===void 0)throw new l.L(`Give this a value`,e);let c=M(s,k(O(t),i),t);t.inProgress.delete(e);let u=a.length===0?o.name:`${o.name}(${a.join(`, `)})`;return t.output.push(`${u} ==\n ${D(c,` `)}`),o},ve=(e,t,n,r)=>{if(e.body===void 0)throw new l.L(`Give this a body`,e);let i=me(e.parameters.map(e=>e.name),t.map(e=>U(e,n,r)),n,r),a=M(e.body,i.scope,r);return i.definitions.length===0?a:ae(S(i.definitions,b(a)))},ye=(e,t,n)=>{if(d.default.isArrowFunction(e)||d.default.isFunctionExpression(e)){let r=fe(e.parameters,n),i=M(e.body,k(t,r),n);return`LAMBDA ${r.map(e=>e.name).join(`, `)} : ${i}`}let r=h(e,n.checker),i=_(r);if(i!==void 0)return j(i,n).name;let a=r===void 0?void 0:t.bindings.get(r);if(a===void 0)throw new l.L(`Pass a function here`,e);return a},be=(e,t,n,r)=>{let i=j(e,r),a=t?.arguments??[];if(i.readsState&&he(n,r)){let t=v(e);if(t!==void 0)return ve(t,a,n,r);let i=_e(e);if(i===void 0)throw new l.L(`Give this a body`,e);return U(i,n,r)}if(i.parameters.length===0)return i.name;let o=a.map((e,t)=>i.parameters[t].includes(`(`)?ye(e,n,r):U(e,n,r));return`${i.name}(${o.join(`, `)})`},xe=(e,t,n)=>{let r=ee(e.expression,n);if(r===void 0)throw new l.L(`Unsupported call: ${e.expression.getText()}`,e);if(n.inProgress.has(r))throw new l.L(`A local function can't call itself, so declare it at the top level`,e);n.inProgress.add(r);let i=ve(r,e.arguments,t,n);return n.inProgress.delete(r),i},M=(e,t,n)=>d.default.isBlock(e)?ae(N(e.statements,t,n,()=>{throw new l.L(`This function must return a value on every path`,e)})):U(e,t,n),N=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=t=>N(e.slice(1),t,n,r);if(d.default.isBlock(i))return N(i.statements,t,n,a);if(d.default.isVariableStatement(i)){let e=i.declarationList.declarations.reduce((e,t)=>{if(t.initializer===void 0)throw new l.L(`Declare locals with a value`,t);if(v(t.initializer)!==void 0)return e;let r=U(t.initializer,e.scope,n),i=pe(t.name,r,e.scope,n);return{definitions:[...e.definitions,...i.definitions],scope:i.scope}},{definitions:[],scope:t});return S(e.definitions,a(e.scope))}if(d.default.isIfStatement(i))return Ce(i,t,n,e=>N([e],t,n,a),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression===void 0)throw new l.L(`Return a value`,i);return b(U(i.expression,t,n))}if(d.default.isThrowStatement(i))return b(Se(i,t,n));if(d.default.isSwitchStatement(i))return we(i,t,n,e=>N(e,t,n,a),()=>a(t));throw new l.L(`Unsupported statement: ${i.getText()}`,i)},Se=(e,t,n)=>{let r=e.expression;return`Assert(FALSE, ${d.default.isNewExpression(r)&&r.arguments?.[0]!==void 0?U(r.arguments[0],t,n):JSON.stringify(r.getText())})`},Ce=(e,t,n,r,i)=>{let a=V(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return ie(a,o,s,H(e.expression,t,n))},we=(e,t,n,r,i)=>{let a=T(U(e.expression,t,n)),o=e.caseBlock.clauses,s=e=>{if(e===o.length)return i();let c=o.findIndex((t,n)=>n>=e&&t.statements.length>0),u=o.slice(e,c===-1?o.length:c+1),f=u[u.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(d.default.isBreakStatement(m)||d.default.isReturnStatement(m)||d.default.isThrowStatement(m)),g=e+u.length===o.length;if(p.length>0&&!h&&!g)throw new l.L(`End each case with break, return, or throw`,f);let _=r(m!==void 0&&d.default.isBreakStatement(m)?p.slice(0,-1):p);if(u.some(d.default.isDefaultClause))return _;let v=u.filter(d.default.isCaseClause).map(e=>`${a} = ${T(U(e.expression,t,n))}`).join(` \\/ `);return ie(v,_,s(e+u.length))};return s(0)},Te=e=>(e.flags&d.default.TypeFlags.Object)!==0&&(e.objectFlags&d.default.ObjectFlags.Reference)!==0,Ee=e=>e.getSymbol()?.getName()??``,P=e=>[`Set`,`ReadonlySet`].includes(Ee(e)),F=e=>[`Map`,`ReadonlyMap`].includes(Ee(e)),De=(e,t)=>e.isUnion()?e.types.every(e=>De(e,t)):t.isArrayType(e)||t.isTupleType(e),Oe=(e,t)=>e.isUnion()?e.types.every(e=>Oe(e,t)):(e.flags&t)!==0,I=(e,t)=>{let n=t.checker,r=n.getNonNullableType(n.getTypeAtLocation(e));return De(r,n)?`sequence`:P(r)?`set`:F(r)?`map`:Oe(r,d.default.TypeFlags.StringLike)?`string`:`other`},L=(e,t)=>Oe(t.checker.getTypeAtLocation(e),d.default.TypeFlags.BooleanLike),ke=(e,t)=>P(t.checker.getTypeAtLocation(e)),R=e=>/^-?\d+$/.test(e),Ae=(e,t)=>{if(e.isStringLiteral())return te(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&d.default.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&d.default.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(d.default.TypeFlags.Undefined|d.default.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},z=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),je=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=Me(n,t);return typeof r==`string`?[...e,r]:r},[]),Me=(e,t)=>{let n=t.checker;if(e.flags&d.default.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>Ae(e,t)),r=je(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>R(e)&&R(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?T(e):e).join(` \\cup `)}let r=Ae(e,t);if(r!==void 0)return`{${r}}`;if(P(e)||F(e)||n.isTupleType(e)){let r=je(Te(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(r))return r;if(P(e))return`SUBSET ${T(r[0])}`;if(F(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${r[1]}] : ${e} \\in SUBSET ${T(r[0])}}`}if(!(Te(e)&&e.target.elementFlags.every(e=>(e&d.default.ElementFlags.Required)!==0)))return z(e,`tuples with optional or rest elements can have any length`,t);if(r.length===0)return`{<<>>}`;if(r.length>1)return r.map(T).join(` \\X `);let i=t.names.getFresh(`element`);return`{<<${i}>> : ${i} \\in ${r[0]}}`}if(n.isArrayType(e))return z(e,`arrays can have any length, so use a tuple`,t);let i=e.getProperties();if(!(e.flags&d.default.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&i.length>0))return z(e,`use a union of literals, or records, tuples, and sets of them`,t);let a=i.find(e=>e.flags&d.default.SymbolFlags.Optional);if(a!==void 0)return z(e,`the optional field ${a.name} may be missing`,t);let o=je(i.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(o))return o;let s=i.map(e=>e.name);return s.some(R)?!s.every(R)||o.some(e=>e!==o[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${s.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${o[0]}]`:`[${s.map((e,t)=>`${e} : ${o[t]}`).join(`, `)}]`},Ne=(e,t,n)=>{let r=Me(e,n);if(typeof r!=`string`)throw new l.L(r.message,t);return r},Pe=/* @__PURE__ */ new Map([[d.default.SyntaxKind.MinusToken,`-`],[d.default.SyntaxKind.AsteriskToken,`*`],[d.default.SyntaxKind.AsteriskAsteriskToken,`^`],[d.default.SyntaxKind.EqualsEqualsEqualsToken,`=`],[d.default.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[d.default.SyntaxKind.LessThanToken,`<`],[d.default.SyntaxKind.LessThanEqualsToken,`<=`],[d.default.SyntaxKind.GreaterThanToken,`>`],[d.default.SyntaxKind.GreaterThanEqualsToken,`>=`]]),Fe=/* @__PURE__ */ new Set([d.default.SyntaxKind.LessThanToken,d.default.SyntaxKind.LessThanEqualsToken,d.default.SyntaxKind.GreaterThanToken,d.default.SyntaxKind.GreaterThanEqualsToken]),Ie=/* @__PURE__ */ new Map([[d.default.SyntaxKind.AmpersandAmpersandToken,`/\\`],[d.default.SyntaxKind.BarBarToken,`\\/`]]),Le=(e,t,n)=>{let r=e.argumentExpression;return I(e.expression,n)===`sequence`?d.default.isNumericLiteral(r)?String(Number(r.text)+1):`${T(U(r,t,n))} + 1`:U(r,t,n)},Re=(e,t,n)=>{let r=e.elements.reduce((e,r)=>{if(!d.default.isSpreadElement(r)){let i=U(r,t,n),a=e.at(-1);return Array.isArray(a)?[...e.slice(0,-1),[...a,i]]:[...e,[i]]}if(I(r.expression,n)!==`sequence`)throw new l.L(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,r);return[...e,U(r.expression,t,n)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return r.length===0?`<<>>`:r.length===1?r[0]:r.map(T).join(` \\o `)},ze=e=>R(e)?`[${e}]`:`.${e}`,B=e=>e.every(e=>R(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Be=(e,t,n)=>{let r=n.checker,i=e=>e.name===void 0||d.default.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),a=e=>{if(d.default.isPropertyAssignment(e))return U(e.initializer,t,n);if(d.default.isShorthandPropertyAssignment(e))return U(e.name,t,n);throw new l.L(`Unsupported object member`,e)},o=e.properties.filter(d.default.isSpreadAssignment);if(o.length===0){if(e.properties.length===0)throw new l.L(`TLA+ has no empty record, so use a Map`,e);return B(e.properties.map(e=>{let t=i(e);if(t===void 0)throw new l.L(`Computed keys need a spread base`,e);return{key:t,value:a(e)}}))}let s=e.properties[0],c=e.properties.slice(1);if(d.default.isSpreadAssignment(s)&&o.length===1){let e=r.getTypeAtLocation(s.expression),o=U(s.expression,t,n);if(c.length===0)return o;if(c.every(t=>{let n=i(t);return n===void 0||e.getProperty(n)!==void 0})){let e=c.map(e=>{let r=i(e);if(r!==void 0)return`!${ze(r)} = ${E(a(e))}`;if(e.name===void 0||!d.default.isComputedPropertyName(e.name))throw new l.L(`Unsupported object member`,e);return`![${U(e.name.expression,t,n)}] = ${E(a(e))}`});return`[${T(o)} EXCEPT ${e.join(`, `)}]`}}return B(r.getTypeAtLocation(e).getProperties().map(o=>{let s=o.name,c=e.properties.findLast(e=>d.default.isSpreadAssignment(e)?r.getTypeAtLocation(e.expression).getProperty(s)!==void 0:i(e)===s);if(c===void 0||!d.default.isSpreadAssignment(c)&&i(c)===void 0)throw new l.L(`Can't tell which value ${s} takes`,e);return{key:s,value:d.default.isSpreadAssignment(c)?`${T(U(c.expression,t,n))}${ze(s)}`:a(c)}}))},Ve=(e,t,n,r)=>{let i=e=>T(U(e,n,r)),a=e.arguments[0];if((t===`floor`||t===`trunc`)&&e.arguments.length===1){let n=d.default.isParenthesizedExpression(a)?a.expression:a;if(!d.default.isBinaryExpression(n)||n.operatorToken.kind!==d.default.SyntaxKind.SlashToken)throw new l.L(`Math.${t} only takes a division, as in Math.${t}(a / b)`,e);let o=i(n.left),s=i(n.right);return t===`floor`?`${o} \\div ${s}`:(r.prelude.add(`Quot`),`Quot(${o}, ${s})`)}if(t===`abs`&&e.arguments.length===1)return y(i(a),`value`,r,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((t===`min`||t===`max`)&&e.arguments.length>0){let o=t===`min`?`<=`:`>=`;if(e.arguments.length===1&&d.default.isSpreadElement(a)){let e=T(it(a.expression,n,r)),t=r.names.getFresh(`candidate`),i=r.names.getFresh(`other`);return`CHOOSE ${t} \\in ${e} : \\A ${i} \\in ${e} : ${t} ${o} ${i}`}return e.arguments.map(i).reduce((e,t)=>y(e,`best`,r,e=>y(t,`value`,r,t=>`IF ${e} ${o} ${t} THEN ${e} ELSE ${t}`)))}throw new l.L(`Unsupported call: Math.${t}`,e)},He=(e,t,n,r)=>{let i=h(e.expression,n.checker),a=_(i);if(a!==void 0)return be(a,e,t,n);if(!g(e)){let r=i===void 0?void 0:t.bindings.get(i);return r===void 0?xe(e,t,n):`${r}(${e.arguments.map(e=>U(e,t,n)).join(`, `)})`}let o=e.expression.expression,s=e.expression.name.text,c=d.default.isIdentifier(o)?o.text:void 0;return c===`Math`?Ve(e,s,t,n):(c===`Object`&&s===`fromEntries`?ot(e.arguments[0],t,n):st(e,t,n))??gt(e,t,n,r)},Ue=(e,t,n)=>{let r=U(e,t,n);return I(e,n)===`string`?r:`ToString(${r})`},We=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=Ue(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(T).join(` \\o `)},Ge=(e,t,n)=>{let r=e.operatorToken.kind,i=e=>T(U(e,t,n)),a=I(e.left,n)===`string`||I(e.right,n)===`string`,o=Ie.get(r);if(o!==void 0){if(!L(e.left,n)||!L(e.right,n))throw new l.L(`${e.operatorToken.getText()} needs booleans, so compare explicitly`,e);return`${i(e.left)} ${o} ${i(e.right)}`}if(r===d.default.SyntaxKind.PlusToken&&a)return`${T(Ue(e.left,t,n))} \\o ${T(Ue(e.right,t,n))}`;if(r===d.default.SyntaxKind.PlusToken)return`${i(e.left)} + ${i(e.right)}`;if(r===d.default.SyntaxKind.PercentToken)return n.prelude.add(`Rem`),`Rem(${U(e.left,t,n)}, ${U(e.right,t,n)})`;if(r===d.default.SyntaxKind.QuestionQuestionToken)return n.prelude.add(`Null`),n.prelude.add(`Undefined`),y(i(e.left),`value`,n,t=>`IF ${t} \\in {Null, Undefined} THEN ${i(e.right)} ELSE ${t}`);if(r===d.default.SyntaxKind.InKeyword)return`${i(e.left)} \\in DOMAIN ${i(e.right)}`;if(r===d.default.SyntaxKind.SlashToken)throw new l.L(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,e);if(Fe.has(r)&&a)throw new l.L(`TLA+ strings have no order, so compare them with === only`,e);let s=Pe.get(r);if(s===void 0)throw new l.L(`Unsupported operator: ${e.operatorToken.getText()}`,e.operatorToken);return`${i(e.left)} ${s} ${i(e.right)}`},Ke=(e,t,n)=>{let r=[...n.variables].find(t=>t[0].name===e);if(r===void 0)throw new l.L(`Unknown variable: ${e}`,t);return r[1]},qe=(e,t,n)=>{let r=t.valueDeclaration,i=r!==void 0&&d.default.isEnumMember(r)?n.checker.getConstantValue(r):void 0;if(typeof i==`string`)return te(i,n);if(typeof i==`number`&&Number.isInteger(i))return String(i);throw new l.L(`Unsupported enum member`,e)},Je=(e,t,n,r)=>{if(t!==void 0&&t.flags&d.default.SymbolFlags.EnumMember)return qe(e,t,r);let i=_(t);if(i!==void 0)return v(i)===void 0?be(i,void 0,n,r):j(i,r).name},Ye=(e,t,n)=>{if(e.text===`undefined`)return n.prelude.add(`Undefined`),`Undefined`;let r=h(e,n.checker),i=r===void 0?void 0:t.bindings.get(r);if(i!==void 0)return i;if(r!==void 0&&r===t.previous)return B(n.checker.getTypeAtLocation(e).getProperties().map(t=>({key:t.name,value:Ke(t.name,e,n)})));let a=Je(e,r,t,n);if(a!==void 0)return a;throw r!==void 0&&n.variables.has(r)?new l.L(`${e.text} can't be read here`,e):new l.L(`Unknown name: ${e.text}`,e)},Xe=(e,t,n)=>{if(e.questionDotToken!==void 0)throw new l.L(`Optional chaining isn't supported`,e);let r=Je(e,h(e,n.checker),t,n);if(r!==void 0)return r;let i=e.expression,a=e.name.text;return t.previous!==void 0&&d.default.isIdentifier(i)&&h(i,n.checker)===t.previous?Ke(a,e,n):(a===`length`||a===`size`?at(i,t,n):void 0)??`${T(U(i,t,n))}.${a}`},Ze=(e,t,n)=>`${T(U(e.expression,t,n))}[${Le(e,t,n)}]`,V=(e,t,n)=>{if(!L(e,n))throw new l.L(`Conditions must be booleans, so compare explicitly`,e);return U(e,t,n)},H=(e,t,n)=>{if(d.default.isParenthesizedExpression(e))return H(e.expression,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken)return V(e.operand,t,n);if(d.default.isBinaryExpression(e)&&e.operatorToken.kind===d.default.SyntaxKind.BarBarToken){let r=H(e.left,t,n),i=H(e.right,t,n);return`${T(r)} /\\ ${T(i)}`}return`~${T(V(e,t,n))}`},U=(e,t,n,r=!1)=>{if(d.default.isParenthesizedExpression(e)||d.default.isAsExpression(e)||d.default.isSatisfiesExpression(e)||d.default.isTypeAssertionExpression(e))return U(e.expression,t,n,r);if(d.default.isNonNullExpression(e))return U(e.expression,t,n,!0);if(d.default.isNumericLiteral(e)){if(!Number.isInteger(Number(e.text)))throw new l.L(`Only integers are supported: ${e.text}`,e);return String(Number(e.text))}if(d.default.isStringLiteral(e)||d.default.isNoSubstitutionTemplateLiteral(e))return te(e.text,n);if(d.default.isTemplateExpression(e))return We(e,t,n);if(e.kind===d.default.SyntaxKind.TrueKeyword)return`TRUE`;if(e.kind===d.default.SyntaxKind.FalseKeyword)return`FALSE`;if(e.kind===d.default.SyntaxKind.NullKeyword)return n.prelude.add(`Null`),`Null`;if(d.default.isIdentifier(e))return Ye(e,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken){if(!L(e.operand,n))throw new l.L(`! needs a boolean, so compare explicitly`,e);return`~${T(U(e.operand,t,n))}`}if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken)return`-${T(U(e.operand,t,n))}`;if(d.default.isBinaryExpression(e))return Ge(e,t,n);if(d.default.isConditionalExpression(e))return`IF ${V(e.condition,t,n)} THEN ${U(e.whenTrue,t,n)} ELSE ${U(e.whenFalse,t,n)}`;if(d.default.isArrayLiteralExpression(e))return Re(e,t,n);if(d.default.isObjectLiteralExpression(e))return Be(e,t,n);if(d.default.isPropertyAccessExpression(e))return Xe(e,t,n);if(d.default.isElementAccessExpression(e))return Ze(e,t,n);if(d.default.isCallExpression(e))return He(e,t,n,r);if(d.default.isNewExpression(e))return _t(e,t,n);throw new l.L(`Unsupported expression: ${e.getText()}`,e)},Qe=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),W=(e,t)=>{let n=ee(e,t);if(n?.body===void 0)throw new l.L(`Pass a function here`,e);return{parameters:n.parameters,body:n.body}},G=(e,t,n)=>M(W(e,n).body,t,n),$e=(e,t,n)=>{if(W(e,n).parameters[1]!==void 0)throw new l.L(t,e)},K=(e,t,n)=>{let r=W(e,n).parameters[0];if(r===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!d.default.isIdentifier(r.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:A(r.name,e,t,n)}}let i=n.names.getFresh(r.name.text),a=h(r.name,n.checker);return{variable:i,scope:k(t,[{name:i,symbol:a}])}},et=(e,t,n,r,i)=>{let a=W(e,i).parameters,o=t===void 0||a[0]===void 0?r:A(a[0].name,t,r,i);return a[1]===void 0?o:A(a[1].name,`(${n} - 1)`,o,i)},tt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),nt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),rt=(e,t)=>y(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),q=(e,t,n)=>{let r=e=>U(e,t,n);if(d.default.isParenthesizedExpression(e))return q(e.expression,t,n);if(d.default.isArrayLiteralExpression(e)&&e.elements.length===1&&d.default.isSpreadElement(e.elements[0])){let i=e.elements[0].expression,a=I(i,n);return a===`set`?{set:r(i),isMapped:!1}:a===`map`?nt(r(i),n):q(i,t,n)}if(!g(e))return;let i=e.expression.expression,a=e.expression.name.text;if(d.default.isIdentifier(i)&&i.text===`Object`){let t=r(e.arguments[0]);return a===`keys`?{set:`DOMAIN ${T(t)}`,isMapped:!1}:a===`values`?tt(t,n):a===`entries`?nt(t,n):void 0}let o=I(i,n);if(o===`set`&&(a===`values`||a===`keys`))return{set:r(i),isMapped:!1};if(o===`set`&&a===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${T(r(i))}}`,isMapped:!1}}if(o===`map`&&a===`keys`)return{set:`DOMAIN ${T(r(i))}`,isMapped:!1};if(o===`map`&&a===`values`)return tt(r(i),n);if(o===`map`&&a===`entries`)return nt(r(i),n);if(a===`toArray`)return q(i,t,n);if(a!==`filter`&&a!==`map`)return;let s=q(i,t,n);if(s===void 0)return;let c=e.arguments[0];$e(c,`Elements of a set have no index`,n);let l=K(c,t,n),u=G(c,l.scope,n);return a===`filter`?{set:`{${l.variable} \\in ${T(s.set)} : ${u}}`,isMapped:s.isMapped}:{set:`{${u} : ${l.variable} \\in ${T(s.set)}}`,isMapped:!0}},it=(e,t,n)=>{let r=q(e,t,n);if(r!==void 0)return r.set;let i=I(e,n),a=U(e,t,n);if(i===`set`)return a;if(i!==`sequence`)throw new l.L(`Expected a Set or an array`,e);return rt(a,n)},at=(e,t,n)=>{let r=q(e,t,n);if(r?.isMapped)throw new l.L(`map() can merge equal elements, so count before mapping`,e.parent);if(r!==void 0)return`Cardinality(${r.set})`;let i=I(e,n),a=U(e,t,n);if(i===`sequence`||i===`string`)return`Len(${a})`;if(i===`set`)return`Cardinality(${a})`;if(i===`map`)return`Cardinality(DOMAIN ${T(a)})`},ot=(e,t,n)=>{if(!g(e)||e.expression.name.text!==`map`)return;let r=e.expression.expression,i=q(r,t,n)?.set??(I(r,n)===`sequence`?rt(U(r,t,n),n):void 0),a=e.arguments[0],o=W(a,n).parameters[0],s=(d.default.isArrowFunction(a)||d.default.isFunctionExpression(a))&&!d.default.isBlock(a.body)?a.body:void 0,c=s!==void 0&&d.default.isParenthesizedExpression(s)?s.expression:s,u=c!==void 0&&d.default.isArrayLiteralExpression(c)&&c.elements.length===2&&o!==void 0&&d.default.isIdentifier(o.name)&&d.default.isIdentifier(c.elements[0])&&c.elements[0].text===o.name.text;if(i===void 0||!u)throw new l.L(`Build a Map or record from a set with set.values().map((key) => [key, value])`,e);let f=K(a,t,n),p=U(c.elements[1],f.scope,n);return`[${f.variable} \\in ${i} |-> ${p}]`},st=(e,t,n)=>{let r=e.expression.expression,i=e.expression.name.text,a=e=>T(U(e,t,n)),o=e.arguments[1],s=e.arguments[0];if(d.default.isIdentifier(r)&&r.text===`Array`&&i===`from`&&e.arguments.length===2&&d.default.isObjectLiteralExpression(s)){let r=s.properties.find(e=>e.name?.getText()===`length`);if(r===void 0||!d.default.isPropertyAssignment(r))throw new l.L(`Array.from needs { length: n }`,e);let i=n.names.getFresh(`index`),c=et(o,void 0,i,t,n);return`[${i} \\in 1..${a(r.initializer)} |-> ${G(o,c,n)}]`}if(i!==`fill`||e.arguments.length!==1)return;let c=d.default.isNewExpression(r)||d.default.isCallExpression(r)?r:void 0,u=c!==void 0&&d.default.isIdentifier(c.expression)&&c.expression.text===`Array`&&c.arguments?.length===1?c.arguments[0]:void 0;if(u!==void 0)return`[${n.names.getFresh(`index`)} \\in 1..${a(u)} |-> ${U(e.arguments[0],t,n)}]`},ct=(e,t,n,r)=>{let i=i=>G(t,et(t,`${T(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${T(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${T(e)} : ${T(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${T(i(o))}`}},lt=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e=>U(e,n,r),s=e.arguments[0],c=T(t),u=e=>d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken,f=e=>u(e)?`Len(${t}) - ${T(o(e.operand))}`:o(e),p=(e,t)=>i?t:(r.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),m=e=>()=>{let t=r.names.getFresh(`index`),i=et(s,`${c}[${t}]`,t,n,r);return e(t,G(s,i,r))},h=(/* @__PURE__ */ new Map([[`at`,()=>{let e=u(s)?`${f(s)} + 1`:`${T(o(s))} + 1`;return p(`${e} \\in DOMAIN ${c}`,`${c}[${e}]`)}],[`includes`,()=>{let e=r.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${c} : ${c}[${e}] = ${T(o(s))}`}],[`indexOf`,()=>y(o(s),`value`,r,e=>{let t=r.names.getFresh(`index`),n=r.names.getFresh(`earlier`),i=`${c}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${c} : ${i} THEN (CHOOSE ${t} \\in DOMAIN ${c} : ${i} /\\ \\A ${n} \\in 1..(${t} - 1) : ${c}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let n=s===void 0?`0`:f(s),r=e.arguments[1]===void 0?void 0:T(f(e.arguments[1])),i=r===void 0?`Len(${t})`:`IF ${r} < Len(${t}) THEN ${r} ELSE Len(${t})`;return`SubSeq(${t}, ${/^\d+$/.test(n)?String(Number(n)+1):`${T(n)} + 1`}, ${i})`}],[`concat`,()=>[t,...e.arguments.map(e=>I(e,r)===`sequence`?o(e):`<<${o(e)}>>`)].map(T).join(` \\o `)],[`with`,()=>`[${c} EXCEPT ![${T(o(s))} + 1] = ${E(o(e.arguments[1]))}]`],[`toReversed`,()=>{let e=r.names.getFresh(`index`);return`[${e} \\in DOMAIN ${c} |-> ${c}[Len(${t}) - ${e} + 1]]`}],[`map`,m((e,t)=>`[${e} \\in DOMAIN ${c} |-> ${t}]`)],[`every`,m((e,t)=>`\\A ${e} \\in DOMAIN ${c} : ${t}`)],[`some`,m((e,t)=>`\\E ${e} \\in DOMAIN ${c} : ${t}`)],[`filter`,()=>{$e(s,`filter() can't take an index`,r);let e=K(s,n,r);return`SelectSeq(${t}, LAMBDA ${e.variable} : ${G(s,e.scope,r)})`}],[`find`,()=>{let e=ct(t,s,n,r);return p(e.exists,`${c}[${e.first}]`)}],[`findIndex`,()=>{let e=ct(t,s,n,r);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(a);if(h===void 0)throw new l.L(`Unsupported array method: ${a}`,e);return h()},ut=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e.arguments[0];if(a===`includes`||a===`has`)return`${T(U(o,n,r))} \\in ${T(t.set)}`;if(a!==`every`&&a!==`some`&&a!==`find`)throw new l.L(`Unsupported method on a set's elements: ${a}`,e);$e(o,`Elements of a set have no index`,r);let s=K(o,n,r),c=G(o,s.scope,r),u=`${s.variable} \\in ${T(t.set)} : ${c}`;return a===`every`?`\\A ${u}`:a===`some`?`\\E ${u}`:i?`CHOOSE ${u}`:(r.prelude.add(`Undefined`),`IF \\E ${u} THEN CHOOSE ${u} ELSE Undefined`)},dt=(e,t,n)=>{let r=e.expression.name.text,i=T(U(e.expression.expression,t,n)),a=e.arguments[0]===void 0?``:T(U(e.arguments[0],t,n)),o=(/* @__PURE__ */ new Map([[`has`,`${a} \\in ${i}`],[`union`,`${i} \\cup ${a}`],[`intersection`,`${i} \\cap ${a}`],[`difference`,`${i} \\ ${a}`],[`symmetricDifference`,`(${i} \\ ${a}) \\cup (${a} \\ ${i})`],[`isSubsetOf`,`${i} \\subseteq ${a}`],[`isSupersetOf`,`${a} \\subseteq ${i}`],[`isDisjointFrom`,`${i} \\cap ${a} = {}`]])).get(r);if(o===void 0)throw new l.L(`Unsupported Set method: ${r}`,e);return o},ft=(e,t,n,r)=>{let i=e.expression.name.text,a=T(U(e.expression.expression,t,n)),o=e.arguments[0]===void 0?``:T(U(e.arguments[0],t,n));if(i===`has`)return`${o} \\in DOMAIN ${a}`;if(i!==`get`)throw new l.L(`Unsupported Map method: ${i}`,e);return r?`${a}[${o}]`:(n.prelude.add(`Undefined`),y(a,`map`,n,e=>y(o,`key`,n,t=>`IF ${t} \\in DOMAIN ${e} THEN ${e}[${t}] ELSE Undefined`)))},pt=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${T(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${T(e)}`],[`pop`,e=>`SubSeq(${e}, 1, Len(${e}) - 1)`],[`shift`,e=>`Tail(${e})`]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${T(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${T(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${T(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${T(e)} \\ {${t[0]}} |-> ${T(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),mt=new Set([...pt.values()].flatMap(e=>[...e.keys()])),ht=(e,t,n,r,i)=>{let a=n.arguments.map(e=>U(e,r,i));return pt.get(t)?.get(n.expression.name.text)?.(e,a,i)},gt=(e,t,n,r)=>{let i=e.expression.expression,a=q(i,t,n);if(a!==void 0)return ut(e,a,t,n,r);let o=d.default.isNewExpression(i)&&i.arguments?.length===1&&d.default.isIdentifier(i.expression)&&(i.expression.text===`Set`||i.expression.text===`Map`),s=I(i,n),c=o?ht(U(i,t,n),s,e,t,n):void 0;if(c!==void 0)return c;if(s===`sequence`){let a=e.expression.name.text,o=U(i,t,n),s=i=>lt(e,i,t,n,r);return Qe.has(a)?s(o):y(o,`sequence`,n,s)}if(s===`set`)return dt(e,t,n);if(s===`map`)return ft(e,t,n,r);throw new l.L(`Unsupported call: ${e.expression.getText()}`,e)},_t=(e,t,n)=>{let r=e.expression.getText(),i=e.arguments?.[0];if(r===`Set`)return i===void 0?`{}`:d.default.isArrayLiteralExpression(i)&&!i.elements.some(d.default.isSpreadElement)?`{${i.elements.map(e=>U(e,t,n)).join(`, `)}}`:it(i,t,n);if(r!==`Map`)throw new l.L(`Unsupported constructor: new ${r}`,e);if(i===void 0)return`<<>>`;if(d.default.isArrayLiteralExpression(i))return i.elements.length===0?`<<>>`:i.elements.toReversed().map(e=>{if(!d.default.isArrayLiteralExpression(e)||e.elements.length!==2)throw new l.L(`Write each Map entry as [key, value]`,e);return`(${U(e.elements[0],t,n)} :> ${U(e.elements[1],t,n)})`}).join(` @@ `);if(I(i,n)===`map`)return U(i,t,n);let a=ot(i,t,n);if(a===void 0)throw new l.L(`Unsupported constructor: new ${r}`,e);return a},vt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusEqualsToken,`+`],[d.default.SyntaxKind.MinusEqualsToken,`-`],[d.default.SyntaxKind.AsteriskEqualsToken,`*`]]),yt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusPlusToken,`+`],[d.default.SyntaxKind.MinusMinusToken,`-`]]),J=(e,t,n)=>{if(d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e))return J(e.expression,t,n);if(d.default.isIdentifier(e)){let r=h(e,n.checker),i=r===void 0?void 0:t.scope.bindings.get(r);if(r===void 0||i===void 0||!t.mutable.has(r))throw new l.L(`Only state variables and local lets can change: ${e.text}`,e);return{symbol:r,current:i,selector:``}}if(d.default.isPropertyAccessExpression(e)){if(I(e.expression,n)!==`other`)throw new l.L(`Can't assign to ${e.getText()}`,e);let r=J(e.expression,t,n);return{...r,selector:`${r.selector}.${e.name.text}`}}if(d.default.isElementAccessExpression(e)){let r=J(e.expression,t,n),i=Le(e,t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}if(g(e)&&e.expression.name.text===`get`&&e.arguments.length===1&&I(e.expression.expression,n)===`map`){let r=J(e.expression.expression,t,n),i=U(e.arguments[0],t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}throw new l.L(`Can't assign to ${e.getText()}`,e)},Y=(e,t,n,r)=>{let i=J(e,t,n),a=i.selector===``?r(i.current):`[${T(i.current)} EXCEPT !${i.selector} = ${E(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},X=(e,t,n,r,i)=>d.default.isArrayLiteralExpression(e)?e.elements.reduce((e,a,o)=>{if(d.default.isOmittedExpression(a))return e;if(d.default.isSpreadElement(a))throw new l.L(`Rest elements can't be assigned`,a);let s=t!==void 0&&d.default.isArrayLiteralExpression(t)?t.elements[o]:void 0;return s!==void 0&&!d.default.isSpreadElement(s)?X(a,s,U(s,r.scope,i),e,i):X(a,void 0,`${T(n)}[${o+1}]`,e,i)},r):d.default.isObjectLiteralExpression(e)?e.properties.reduce((e,t)=>{if(d.default.isShorthandPropertyAssignment(t))return X(t.name,void 0,`${T(n)}.${t.name.text}`,e,i);if(d.default.isPropertyAssignment(t)&&d.default.isIdentifier(t.name))return X(t.initializer,void 0,`${T(n)}.${t.name.text}`,e,i);throw new l.L(`Can't assign to ${t.getText()}`,t)},r):Y(e,r,i,()=>n),bt=(e,t,n)=>{if(d.default.isNonNullExpression(e)||d.default.isParenthesizedExpression(e))return bt(e.expression,t,n);if(!g(e))return;let r=e.expression.name.text;if(r!==`shift`&&r!==`pop`)return;let i=e.expression.expression;if(I(i,n)!==`sequence`)return;let a=U(i,t.scope,n);return{value:r===`shift`?`Head(${a})`:`${T(a)}[Len(${a})]`,path:Y(i,t,n,e=>r===`shift`?`Tail(${e})`:`SubSeq(${e}, 1, Len(${e}) - 1)`)}},xt=(e,t,n)=>{if(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e)){let r=yt.get(e.operator);return r===void 0?void 0:Y(e.operand,t,n,e=>`${T(e)} ${r} 1`)}if(!d.default.isBinaryExpression(e))return;let r=e.operatorToken.kind;if(r===d.default.SyntaxKind.EqualsToken){let r=U(e.right,t.scope,n);return X(e.left,e.right,r,t,n)}let i=r===d.default.SyntaxKind.PlusEqualsToken&&I(e.left,n)===`string`?`\\o`:vt.get(r);if(i===void 0)return;let a=T(U(e.right,t.scope,n));return Y(e.left,t,n,e=>`${T(e)} ${i} ${a}`)},St=(e,t,n,r,i)=>{let a=e.arguments.map(e=>U(e,t.scope,n));if(g(e)){let r=e.expression.expression,o=e.expression.name.text,s=r.getText()===`console`;if(s&&o===`log`){let e=a.length===1?a[0]:`<<${a.join(`, `)}>>`;return x([b(`PrintT(${e})`),i(t)])}if(s&&o===`assert`){let e=a[1]??JSON.stringify(`Assertion failed`);return x([b(`Assert(${a[0]}, ${e})`),i(t)])}if(mt.has(o)){let a=I(r,n);return i(Y(r,t,n,r=>{let i=ht(r,a,e,t.scope,n);if(i===void 0)throw new l.L(`Unsupported method: ${o}`,e);return i}))}}let o=_(h(e.expression,n.checker)),s=v(o);if(o===void 0||s?.body===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);if(r.inlining.has(o))throw new l.L(`Helpers that change state can't call themselves`,e);let c=me(s.parameters.map(e=>e.name),a,t.scope,n),u=d.default.isBlock(s.body)?s.body.statements:[d.default.factory.createExpressionStatement(s.body)],f=e=>i({...e,scope:{...e.scope,previous:t.scope.previous}});return S(c.definitions,Z(u,{...t,scope:c.scope},n,{next:f,exit:f,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...r.inlining,o])}))},Ct=(e,t,n,r,i)=>{if(d.default.isParenthesizedExpression(e))return Ct(e.expression,t,n,r,i);if(d.default.isCallExpression(e))return St(e,t,n,r,i);let a=xt(e,t,n);if(a===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);return i(a)},wt=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=e.slice(1);if(i.initializer===void 0)throw new l.L(`Declare locals with a value`,i);if(v(i.initializer)!==void 0)return wt(a,t,n,r);let o=bt(i.initializer,t,n),s=o?.value??U(i.initializer,t.scope,n),c=o?.path??t,u=pe(i.name,s,c.scope,n),f=d.default.isIdentifier(i.name)?h(i.name,n.checker):void 0,p=(i.parent.flags&d.default.NodeFlags.Let)!==0&&f!==void 0?/* @__PURE__ */ new Set([...t.mutable,f]):t.mutable;return S(u.definitions,wt(a,{...c,scope:u.scope,mutable:p},n,r))},Z=(e,t,n,r)=>{if(e.length===0)return r.next(t);let i=e[0],a=t=>Z(e.slice(1),t,n,r);if(d.default.isBlock(i))return Z(i.statements,t,n,{...r,next:a});if(d.default.isEmptyStatement(i))return a(t);if(d.default.isVariableStatement(i))return wt(i.declarationList.declarations,t,n,a);if(d.default.isIfStatement(i))return Ce(i,t.scope,n,e=>Z([e],t,n,{...r,next:a}),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression!==void 0)throw new l.L(`Actions can't return a value`,i);return r.exit(t)}if(d.default.isBreakStatement(i)){if(r.breakTo===void 0)throw new l.L(`Unsupported break`,i);return r.breakTo(t)}if(d.default.isThrowStatement(i))return b(Se(i,t.scope,n));if(d.default.isSwitchStatement(i))return we(i,t.scope,n,e=>Z(e,t,n,{...r,next:a,breakTo:a}),()=>a(t));if(d.default.isExpressionStatement(i))return Ct(i.expression,t,n,r,a);throw d.default.isIterationStatement(i,!1)?new l.L(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,i):new l.L(`Unsupported statement: ${i.getText()}`,i)},Tt=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return re;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return x([...t.filter(e=>e.value!==e.name).map(e=>b(`${e.name}' = ${E(e.value)}`)),...r.length>0?[b(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return Z(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},Et=e=>g(e)&&e.expression.name.text===`get`?Et(e.expression.expression):d.default.isPropertyAccessExpression(e)||d.default.isElementAccessExpression(e)||d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e)?Et(e.expression):e,Dt=(e,t,n=/* @__PURE__ */ new Set)=>{let r=e=>{let n=Et(e),r=d.default.isIdentifier(n)?h(n,t.checker):void 0;return r!==void 0&&t.variables.has(r)},i=d.default.isBinaryExpression(e)&&e.operatorToken.kind>=d.default.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=d.default.SyntaxKind.LastAssignment&&r(e.left),a=(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e))&&yt.has(e.operator)&&r(e.operand),o=g(e)&&mt.has(e.expression.name.text)&&r(e.expression.expression);if(i||a||o)return!0;if(d.default.isCallExpression(e)){let r=_(h(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),Dt(r,t,n)))return!0}return d.default.forEachChild(e,e=>Dt(e,t,n)||void 0)??!1},Ot=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),kt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
|
|
16
|
-
`)}`,
|
|
17
|
-
`)}`,Q=(e,t)=>t.length>0?[`${e} ${t.join(` `)}`]:[],
|
|
14
|
+
`)&&!ce(e).includes(` `),T=e=>le(e)?e:`(${e})`,ue=[` = `,` # `,` < `,` > `,` <= `,` >= `,` \\in `,` \\notin `,` \\subseteq `,` /\\ `,` \\/ `,` => `,` ~> `],E=e=>{if(e.startsWith(`~`))return`(${e})`;let t=ce(e);return ue.some(e=>t.includes(e))?`(${e})`:e},D=(e,t)=>e.split(`
|
|
15
|
+
`).join(`\n${t}`),O=e=>({bindings:new Map(e.variables),previous:void 0}),k=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),de=(e,t)=>{if(!d.default.isIdentifier(e.name)||e.initializer!==void 0||e.questionToken!==void 0||e.dotDotDotToken!==void 0)throw new l.L(`Use a plain parameter here: ${e.getText()}`,e);return{node:e,name:t.names.getFresh(e.name.text),symbol:h(e.name,t.checker)}},fe=(e,t)=>e.map(e=>de(e,t)),A=(e,t,n,r)=>d.default.isIdentifier(e)?k(n,[{name:t,symbol:h(e,r.checker)}]):e.elements.reduce((n,i,a)=>{if(d.default.isOmittedExpression(i))return n;if(i.dotDotDotToken!==void 0||i.initializer!==void 0)throw new l.L(`Rest elements and default values aren't supported`,i);let o=d.default.isArrayBindingPattern(e)?`${T(t)}[${a+1}]`:`${T(t)}.${(i.propertyName??i.name).getText()}`;return A(i.name,o,n,r)},n),pe=(e,t,n,r)=>{let i=r.names.getFresh(d.default.isIdentifier(e)?e.text:`value`);return{definitions:[`${i} == ${D(t,` `)}`],scope:A(e,i,n,r)}},me=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=pe(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),he=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),ge=(e,t,n)=>{if(d.default.isIdentifier(e)){let r=h(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=_(r);if(i!==void 0&&!n.has(i))return n.add(i),ge(i,t,n)}return d.default.forEachChild(e,e=>ge(e,t,n)||void 0)??!1},_e=e=>d.default.isVariableDeclaration(e)?e.initializer:void 0,j=(e,t)=>{let n=t.definitions.get(e);if(n!==void 0)return t.inProgress.has(e)&&t.recursive.add(e),n;if(e.name===void 0)throw new l.L(`Name this function`,e);let r=v(e),i=fe(r?.parameters??[],t),a=i.map(e=>{let n=t.checker.getTypeAtLocation(e.node.name).getCallSignatures();return n.length===0?e.name:`${e.name}(${n[0].parameters.map(()=>`_`).join(`, `)})`}),o={name:t.names.getFresh(e.name.getText()),parameters:a,readsState:ge(e,t,/* @__PURE__ */ new Set([e]))};t.definitions.set(e,o),t.inProgress.add(e);let s=r===void 0?_e(e):r.body;if(s===void 0)throw new l.L(`Give this a value`,e);let c=M(s,k(O(t),i),t);t.inProgress.delete(e);let u=a.length===0?o.name:`${o.name}(${a.join(`, `)})`;return t.output.push(`${u} ==\n ${D(c,` `)}`),o},ve=(e,t,n,r)=>{if(e.body===void 0)throw new l.L(`Give this a body`,e);let i=me(e.parameters.map(e=>e.name),t.map(e=>H(e,n,r)),n,r),a=M(e.body,i.scope,r);return i.definitions.length===0?a:ae(S(i.definitions,b(a)))},ye=(e,t,n)=>{if(d.default.isArrowFunction(e)||d.default.isFunctionExpression(e)){let r=fe(e.parameters,n),i=M(e.body,k(t,r),n);return`LAMBDA ${r.map(e=>e.name).join(`, `)} : ${i}`}let r=h(e,n.checker),i=_(r);if(i!==void 0)return j(i,n).name;let a=r===void 0?void 0:t.bindings.get(r);if(a===void 0)throw new l.L(`Pass a function here`,e);return a},be=(e,t,n,r)=>{let i=j(e,r),a=t?.arguments??[];if(i.readsState&&he(n,r)){let t=v(e);if(t!==void 0)return ve(t,a,n,r);let i=_e(e);if(i===void 0)throw new l.L(`Give this a body`,e);return H(i,n,r)}if(i.parameters.length===0)return i.name;let o=a.map((e,t)=>i.parameters[t].includes(`(`)?ye(e,n,r):H(e,n,r));return`${i.name}(${o.join(`, `)})`},xe=(e,t,n)=>{let r=ee(e.expression,n);if(r===void 0)throw new l.L(`Unsupported call: ${e.expression.getText()}`,e);if(n.inProgress.has(r))throw new l.L(`A local function can't call itself, so declare it at the top level`,e);n.inProgress.add(r);let i=ve(r,e.arguments,t,n);return n.inProgress.delete(r),i},M=(e,t,n)=>d.default.isBlock(e)?ae(N(e.statements,t,n,()=>{throw new l.L(`This function must return a value on every path`,e)})):H(e,t,n),N=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=t=>N(e.slice(1),t,n,r);if(d.default.isBlock(i))return N(i.statements,t,n,a);if(d.default.isVariableStatement(i)){let e=i.declarationList.declarations.reduce((e,t)=>{if(t.initializer===void 0)throw new l.L(`Declare locals with a value`,t);if(v(t.initializer)!==void 0)return e;let r=H(t.initializer,e.scope,n),i=pe(t.name,r,e.scope,n);return{definitions:[...e.definitions,...i.definitions],scope:i.scope}},{definitions:[],scope:t});return S(e.definitions,a(e.scope))}if(d.default.isIfStatement(i))return Ce(i,t,n,e=>N([e],t,n,a),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression===void 0)throw new l.L(`Return a value`,i);return b(H(i.expression,t,n))}if(d.default.isThrowStatement(i))return b(Se(i,t,n));if(d.default.isSwitchStatement(i))return we(i,t,n,e=>N(e,t,n,a),()=>a(t));throw new l.L(`Unsupported statement: ${i.getText()}`,i)},Se=(e,t,n)=>{let r=e.expression;return`Assert(FALSE, ${d.default.isNewExpression(r)&&r.arguments?.[0]!==void 0?H(r.arguments[0],t,n):JSON.stringify(r.getText())})`},Ce=(e,t,n,r,i)=>{let a=B(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return ie(a,o,s,V(e.expression,t,n))},we=(e,t,n,r,i)=>{let a=T(H(e.expression,t,n)),o=e.caseBlock.clauses,s=e=>{if(e===o.length)return i();let c=o.findIndex((t,n)=>n>=e&&t.statements.length>0),u=o.slice(e,c===-1?o.length:c+1),f=u[u.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(d.default.isBreakStatement(m)||d.default.isReturnStatement(m)||d.default.isThrowStatement(m)),g=e+u.length===o.length;if(p.length>0&&!h&&!g)throw new l.L(`End each case with break, return, or throw`,f);let _=r(m!==void 0&&d.default.isBreakStatement(m)?p.slice(0,-1):p);if(u.some(d.default.isDefaultClause))return _;let v=u.filter(d.default.isCaseClause).map(e=>`${a} = ${T(H(e.expression,t,n))}`).join(` \\/ `);return ie(v,_,s(e+u.length))};return s(0)},Te=e=>(e.flags&d.default.TypeFlags.Object)!==0&&(e.objectFlags&d.default.ObjectFlags.Reference)!==0,Ee=e=>e.getSymbol()?.getName()??``,P=e=>[`Set`,`ReadonlySet`].includes(Ee(e)),De=e=>[`Map`,`ReadonlyMap`].includes(Ee(e)),Oe=(e,t)=>e.isUnion()?e.types.every(e=>Oe(e,t)):t.isArrayType(e)||t.isTupleType(e),ke=(e,t)=>e.isUnion()?e.types.every(e=>ke(e,t)):(e.flags&t)!==0,F=(e,t)=>{let n=t.checker,r=n.getNonNullableType(n.getTypeAtLocation(e));return Oe(r,n)?`sequence`:P(r)?`set`:De(r)?`map`:ke(r,d.default.TypeFlags.StringLike)?`string`:`other`},I=(e,t)=>ke(t.checker.getTypeAtLocation(e),d.default.TypeFlags.BooleanLike),Ae=(e,t)=>P(t.checker.getTypeAtLocation(e)),L=e=>/^-?\d+$/.test(e),je=(e,t)=>{if(e.isStringLiteral())return te(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&d.default.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&d.default.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(d.default.TypeFlags.Undefined|d.default.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},R=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),Me=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=Ne(n,t);return typeof r==`string`?[...e,r]:r},[]),Ne=(e,t)=>{let n=t.checker;if(e.flags&d.default.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>je(e,t)),r=Me(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>L(e)&&L(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?T(e):e).join(` \\cup `)}let r=je(e,t);if(r!==void 0)return`{${r}}`;if(P(e)||De(e)||n.isTupleType(e)){let r=Me(Te(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(r))return r;if(P(e))return`SUBSET ${T(r[0])}`;if(De(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${r[1]}] : ${e} \\in SUBSET ${T(r[0])}}`}if(!(Te(e)&&e.target.elementFlags.every(e=>(e&d.default.ElementFlags.Required)!==0)))return R(e,`tuples with optional or rest elements can have any length`,t);if(r.length===0)return`{<<>>}`;if(r.length>1)return r.map(T).join(` \\X `);let i=t.names.getFresh(`element`);return`{<<${i}>> : ${i} \\in ${r[0]}}`}if(n.isArrayType(e))return R(e,`arrays can have any length, so use a tuple`,t);let i=e.getProperties();if(!(e.flags&d.default.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&i.length>0))return R(e,`use a union of literals, or records, tuples, and sets of them`,t);let a=i.find(e=>e.flags&d.default.SymbolFlags.Optional);if(a!==void 0)return R(e,`the optional field ${a.name} may be missing`,t);let o=Me(i.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(o))return o;let s=i.map(e=>e.name);return s.some(L)?!s.every(L)||o.some(e=>e!==o[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${s.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${o[0]}]`:`[${s.map((e,t)=>`${e} : ${o[t]}`).join(`, `)}]`},Pe=(e,t,n)=>{let r=Ne(e,n);if(typeof r!=`string`)throw new l.L(r.message,t);return r},Fe=/* @__PURE__ */ new Map([[d.default.SyntaxKind.MinusToken,`-`],[d.default.SyntaxKind.AsteriskToken,`*`],[d.default.SyntaxKind.AsteriskAsteriskToken,`^`],[d.default.SyntaxKind.EqualsEqualsEqualsToken,`=`],[d.default.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[d.default.SyntaxKind.LessThanToken,`<`],[d.default.SyntaxKind.LessThanEqualsToken,`<=`],[d.default.SyntaxKind.GreaterThanToken,`>`],[d.default.SyntaxKind.GreaterThanEqualsToken,`>=`]]),Ie=/* @__PURE__ */ new Set([d.default.SyntaxKind.LessThanToken,d.default.SyntaxKind.LessThanEqualsToken,d.default.SyntaxKind.GreaterThanToken,d.default.SyntaxKind.GreaterThanEqualsToken]),Le=/* @__PURE__ */ new Map([[d.default.SyntaxKind.AmpersandAmpersandToken,`/\\`],[d.default.SyntaxKind.BarBarToken,`\\/`]]),Re=(e,t,n)=>{let r=e.argumentExpression;return F(e.expression,n)===`sequence`?d.default.isNumericLiteral(r)?String(Number(r.text)+1):`${T(H(r,t,n))} + 1`:H(r,t,n)},ze=(e,t,n)=>{let r=e.elements.reduce((e,r)=>{if(!d.default.isSpreadElement(r)){let i=H(r,t,n),a=e.at(-1);return Array.isArray(a)?[...e.slice(0,-1),[...a,i]]:[...e,[i]]}if(F(r.expression,n)!==`sequence`)throw new l.L(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,r);return[...e,H(r.expression,t,n)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return r.length===0?`<<>>`:r.length===1?r[0]:r.map(T).join(` \\o `)},Be=e=>L(e)?`[${e}]`:`.${e}`,z=e=>e.every(e=>L(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Ve=(e,t,n)=>{let r=n.checker,i=e=>e.name===void 0||d.default.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),a=e=>{if(d.default.isPropertyAssignment(e))return H(e.initializer,t,n);if(d.default.isShorthandPropertyAssignment(e))return H(e.name,t,n);throw new l.L(`Unsupported object member`,e)},o=e.properties.filter(d.default.isSpreadAssignment);if(o.length===0){if(e.properties.length===0)throw new l.L(`TLA+ has no empty record, so use a Map`,e);return z(e.properties.map(e=>{let t=i(e);if(t===void 0)throw new l.L(`Computed keys need a spread base`,e);return{key:t,value:a(e)}}))}let s=e.properties[0],c=e.properties.slice(1);if(d.default.isSpreadAssignment(s)&&o.length===1){let e=r.getTypeAtLocation(s.expression),o=H(s.expression,t,n);if(c.length===0)return o;if(c.every(t=>{let n=i(t);return n===void 0||e.getProperty(n)!==void 0})){let e=c.map(e=>{let r=i(e);if(r!==void 0)return`!${Be(r)} = ${E(a(e))}`;if(e.name===void 0||!d.default.isComputedPropertyName(e.name))throw new l.L(`Unsupported object member`,e);return`![${H(e.name.expression,t,n)}] = ${E(a(e))}`});return`[${T(o)} EXCEPT ${e.join(`, `)}]`}}return z(r.getTypeAtLocation(e).getProperties().map(o=>{let s=o.name,c=e.properties.findLast(e=>d.default.isSpreadAssignment(e)?r.getTypeAtLocation(e.expression).getProperty(s)!==void 0:i(e)===s);if(c===void 0||!d.default.isSpreadAssignment(c)&&i(c)===void 0)throw new l.L(`Can't tell which value ${s} takes`,e);return{key:s,value:d.default.isSpreadAssignment(c)?`${T(H(c.expression,t,n))}${Be(s)}`:a(c)}}))},He=(e,t,n,r)=>{let i=e=>T(H(e,n,r)),a=e.arguments[0];if((t===`floor`||t===`trunc`)&&e.arguments.length===1){let n=d.default.isParenthesizedExpression(a)?a.expression:a;if(!d.default.isBinaryExpression(n)||n.operatorToken.kind!==d.default.SyntaxKind.SlashToken)throw new l.L(`Math.${t} only takes a division, as in Math.${t}(a / b)`,e);let o=i(n.left),s=i(n.right);return t===`floor`?`${o} \\div ${s}`:(r.prelude.add(`Quot`),`Quot(${o}, ${s})`)}if(t===`abs`&&e.arguments.length===1)return y(i(a),`value`,r,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((t===`min`||t===`max`)&&e.arguments.length>0){let o=t===`min`?`<=`:`>=`;if(e.arguments.length===1&&d.default.isSpreadElement(a)){let e=T(at(a.expression,n,r)),t=r.names.getFresh(`candidate`),i=r.names.getFresh(`other`);return`CHOOSE ${t} \\in ${e} : \\A ${i} \\in ${e} : ${t} ${o} ${i}`}return e.arguments.map(i).reduce((e,t)=>y(e,`best`,r,e=>y(t,`value`,r,t=>`IF ${e} ${o} ${t} THEN ${e} ELSE ${t}`)))}throw new l.L(`Unsupported call: Math.${t}`,e)},Ue=(e,t,n,r)=>{let i=h(e.expression,n.checker),a=_(i);if(a!==void 0)return be(a,e,t,n);if(!g(e)){let r=i===void 0?void 0:t.bindings.get(i);return r===void 0?xe(e,t,n):`${r}(${e.arguments.map(e=>H(e,t,n)).join(`, `)})`}let o=e.expression.expression,s=e.expression.name.text,c=d.default.isIdentifier(o)?o.text:void 0;return c===`Math`?He(e,s,t,n):(c===`Object`&&s===`fromEntries`?st(e.arguments[0],t,n):ct(e,t,n))??vt(e,t,n,r)},We=(e,t,n)=>{let r=H(e,t,n);return F(e,n)===`string`?r:`ToString(${r})`},Ge=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=We(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(T).join(` \\o `)},Ke=(e,t,n)=>{let r=e.operatorToken.kind,i=e=>T(H(e,t,n)),a=F(e.left,n)===`string`||F(e.right,n)===`string`,o=Le.get(r);if(o!==void 0){if(!I(e.left,n)||!I(e.right,n))throw new l.L(`${e.operatorToken.getText()} needs booleans, so compare explicitly`,e);return`${i(e.left)} ${o} ${i(e.right)}`}if(r===d.default.SyntaxKind.PlusToken&&a)return`${T(We(e.left,t,n))} \\o ${T(We(e.right,t,n))}`;if(r===d.default.SyntaxKind.PlusToken)return`${i(e.left)} + ${i(e.right)}`;if(r===d.default.SyntaxKind.PercentToken)return n.prelude.add(`Rem`),`Rem(${H(e.left,t,n)}, ${H(e.right,t,n)})`;if(r===d.default.SyntaxKind.QuestionQuestionToken)return n.prelude.add(`Null`),n.prelude.add(`Undefined`),y(i(e.left),`value`,n,t=>`IF ${t} \\in {Null, Undefined} THEN ${i(e.right)} ELSE ${t}`);if(r===d.default.SyntaxKind.InKeyword)return`${i(e.left)} \\in DOMAIN ${i(e.right)}`;if(r===d.default.SyntaxKind.SlashToken)throw new l.L(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,e);if(Ie.has(r)&&a)throw new l.L(`TLA+ strings have no order, so compare them with === only`,e);let s=Fe.get(r);if(s===void 0)throw new l.L(`Unsupported operator: ${e.operatorToken.getText()}`,e.operatorToken);return`${i(e.left)} ${s} ${i(e.right)}`},qe=(e,t,n)=>{let r=[...n.variables].find(t=>t[0].name===e);if(r===void 0)throw new l.L(`Unknown variable: ${e}`,t);return r[1]},Je=(e,t,n)=>{let r=t.valueDeclaration,i=r!==void 0&&d.default.isEnumMember(r)?n.checker.getConstantValue(r):void 0;if(typeof i==`string`)return te(i,n);if(typeof i==`number`&&Number.isInteger(i))return String(i);throw new l.L(`Unsupported enum member`,e)},Ye=(e,t,n,r)=>{if(t!==void 0&&t.flags&d.default.SymbolFlags.EnumMember)return Je(e,t,r);let i=_(t);if(i!==void 0)return v(i)===void 0?be(i,void 0,n,r):j(i,r).name},Xe=(e,t,n)=>{if(e.text===`undefined`)return n.prelude.add(`Undefined`),`Undefined`;let r=h(e,n.checker),i=r===void 0?void 0:t.bindings.get(r);if(i!==void 0)return i;if(r!==void 0&&r===t.previous)return z(n.checker.getTypeAtLocation(e).getProperties().map(t=>({key:t.name,value:qe(t.name,e,n)})));let a=Ye(e,r,t,n);if(a!==void 0)return a;throw r!==void 0&&n.variables.has(r)?new l.L(`${e.text} can't be read here`,e):new l.L(`Unknown name: ${e.text}`,e)},Ze=(e,t,n)=>{if(e.questionDotToken!==void 0)throw new l.L(`Optional chaining isn't supported`,e);let r=Ye(e,h(e,n.checker),t,n);if(r!==void 0)return r;let i=e.expression,a=e.name.text;return t.previous!==void 0&&d.default.isIdentifier(i)&&h(i,n.checker)===t.previous?qe(a,e,n):(a===`length`||a===`size`?ot(i,t,n):void 0)??`${T(H(i,t,n))}.${a}`},Qe=(e,t,n)=>`${T(H(e.expression,t,n))}[${Re(e,t,n)}]`,B=(e,t,n)=>{if(!I(e,n))throw new l.L(`Conditions must be booleans, so compare explicitly`,e);return H(e,t,n)},V=(e,t,n)=>{if(d.default.isParenthesizedExpression(e))return V(e.expression,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken)return B(e.operand,t,n);if(d.default.isBinaryExpression(e)&&e.operatorToken.kind===d.default.SyntaxKind.BarBarToken){let r=V(e.left,t,n),i=V(e.right,t,n);return`${T(r)} /\\ ${T(i)}`}return`~${T(B(e,t,n))}`},H=(e,t,n,r=!1)=>{if(d.default.isParenthesizedExpression(e)||d.default.isAsExpression(e)||d.default.isSatisfiesExpression(e)||d.default.isTypeAssertionExpression(e))return H(e.expression,t,n,r);if(d.default.isNonNullExpression(e))return H(e.expression,t,n,!0);if(d.default.isNumericLiteral(e)){if(!Number.isInteger(Number(e.text)))throw new l.L(`Only integers are supported: ${e.text}`,e);return String(Number(e.text))}if(d.default.isStringLiteral(e)||d.default.isNoSubstitutionTemplateLiteral(e))return te(e.text,n);if(d.default.isTemplateExpression(e))return Ge(e,t,n);if(e.kind===d.default.SyntaxKind.TrueKeyword)return`TRUE`;if(e.kind===d.default.SyntaxKind.FalseKeyword)return`FALSE`;if(e.kind===d.default.SyntaxKind.NullKeyword)return n.prelude.add(`Null`),`Null`;if(d.default.isIdentifier(e))return Xe(e,t,n);if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.ExclamationToken){if(!I(e.operand,n))throw new l.L(`! needs a boolean, so compare explicitly`,e);return`~${T(H(e.operand,t,n))}`}if(d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken)return`-${T(H(e.operand,t,n))}`;if(d.default.isBinaryExpression(e))return Ke(e,t,n);if(d.default.isConditionalExpression(e))return`IF ${B(e.condition,t,n)} THEN ${H(e.whenTrue,t,n)} ELSE ${H(e.whenFalse,t,n)}`;if(d.default.isArrayLiteralExpression(e))return ze(e,t,n);if(d.default.isObjectLiteralExpression(e))return Ve(e,t,n);if(d.default.isPropertyAccessExpression(e))return Ze(e,t,n);if(d.default.isElementAccessExpression(e))return Qe(e,t,n);if(d.default.isCallExpression(e))return Ue(e,t,n,r);if(d.default.isNewExpression(e))return yt(e,t,n);throw new l.L(`Unsupported expression: ${e.getText()}`,e)},$e=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),U=(e,t)=>{let n=ee(e,t);if(n?.body===void 0)throw new l.L(`Pass a function here`,e);return{parameters:n.parameters,body:n.body}},W=(e,t,n)=>M(U(e,n).body,t,n),et=(e,t,n)=>{if(U(e,n).parameters[1]!==void 0)throw new l.L(t,e)},G=(e,t,n)=>{let r=U(e,n).parameters[0];if(r===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!d.default.isIdentifier(r.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:A(r.name,e,t,n)}}let i=n.names.getFresh(r.name.text),a=h(r.name,n.checker);return{variable:i,scope:k(t,[{name:i,symbol:a}])}},tt=(e,t,n,r,i)=>{let a=U(e,i).parameters,o=t===void 0||a[0]===void 0?r:A(a[0].name,t,r,i);return a[1]===void 0?o:A(a[1].name,`(${n} - 1)`,o,i)},nt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),rt=(e,t)=>({set:y(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),it=(e,t)=>y(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),K=(e,t,n)=>{let r=e=>H(e,t,n);if(d.default.isParenthesizedExpression(e))return K(e.expression,t,n);if(d.default.isArrayLiteralExpression(e)&&e.elements.length===1&&d.default.isSpreadElement(e.elements[0])){let i=e.elements[0].expression,a=F(i,n);return a===`set`?{set:r(i),isMapped:!1}:a===`map`?rt(r(i),n):K(i,t,n)}if(!g(e))return;let i=e.expression.expression,a=e.expression.name.text;if(d.default.isIdentifier(i)&&i.text===`Object`){let t=r(e.arguments[0]);return a===`keys`?{set:`DOMAIN ${T(t)}`,isMapped:!1}:a===`values`?nt(t,n):a===`entries`?rt(t,n):void 0}let o=F(i,n);if(o===`set`&&(a===`values`||a===`keys`))return{set:r(i),isMapped:!1};if(o===`set`&&a===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${T(r(i))}}`,isMapped:!1}}if(o===`map`&&a===`keys`)return{set:`DOMAIN ${T(r(i))}`,isMapped:!1};if(o===`map`&&a===`values`)return nt(r(i),n);if(o===`map`&&a===`entries`)return rt(r(i),n);if(a===`toArray`)return K(i,t,n);if(a!==`filter`&&a!==`map`)return;let s=K(i,t,n);if(s===void 0)return;let c=e.arguments[0];et(c,`Elements of a set have no index`,n);let l=G(c,t,n),u=W(c,l.scope,n);return a===`filter`?{set:`{${l.variable} \\in ${T(s.set)} : ${u}}`,isMapped:s.isMapped}:{set:`{${u} : ${l.variable} \\in ${T(s.set)}}`,isMapped:!0}},at=(e,t,n)=>{let r=K(e,t,n);if(r!==void 0)return r.set;let i=F(e,n),a=H(e,t,n);if(i===`set`)return a;if(i!==`sequence`)throw new l.L(`Expected a Set or an array`,e);return it(a,n)},ot=(e,t,n)=>{let r=K(e,t,n);if(r?.isMapped)throw new l.L(`map() can merge equal elements, so count before mapping`,e.parent);if(r!==void 0)return`Cardinality(${r.set})`;let i=F(e,n),a=H(e,t,n);if(i===`sequence`||i===`string`)return`Len(${a})`;if(i===`set`)return`Cardinality(${a})`;if(i===`map`)return`Cardinality(DOMAIN ${T(a)})`},st=(e,t,n)=>{if(!g(e)||e.expression.name.text!==`map`)return;let r=e.expression.expression,i=K(r,t,n)?.set??(F(r,n)===`sequence`?it(H(r,t,n),n):void 0),a=e.arguments[0],o=U(a,n).parameters[0],s=(d.default.isArrowFunction(a)||d.default.isFunctionExpression(a))&&!d.default.isBlock(a.body)?a.body:void 0,c=s!==void 0&&d.default.isParenthesizedExpression(s)?s.expression:s,u=c!==void 0&&d.default.isArrayLiteralExpression(c)&&c.elements.length===2&&o!==void 0&&d.default.isIdentifier(o.name)&&d.default.isIdentifier(c.elements[0])&&c.elements[0].text===o.name.text;if(i===void 0||!u)throw new l.L(`Build a Map or record from a set with set.values().map((key) => [key, value])`,e);let f=G(a,t,n),p=H(c.elements[1],f.scope,n);return`[${f.variable} \\in ${i} |-> ${p}]`},ct=(e,t,n)=>{let r=e.expression.expression,i=e.expression.name.text,a=e=>T(H(e,t,n)),o=e.arguments[1],s=e.arguments[0];if(d.default.isIdentifier(r)&&r.text===`Array`&&i===`from`&&e.arguments.length===2&&d.default.isObjectLiteralExpression(s)){let r=s.properties.find(e=>e.name?.getText()===`length`);if(r===void 0||!d.default.isPropertyAssignment(r))throw new l.L(`Array.from needs { length: n }`,e);let i=n.names.getFresh(`index`),c=tt(o,void 0,i,t,n);return`[${i} \\in 1..${a(r.initializer)} |-> ${W(o,c,n)}]`}if(i!==`fill`||e.arguments.length!==1)return;let c=d.default.isNewExpression(r)||d.default.isCallExpression(r)?r:void 0,u=c!==void 0&&d.default.isIdentifier(c.expression)&&c.expression.text===`Array`&&c.arguments?.length===1?c.arguments[0]:void 0;if(u!==void 0)return`[${n.names.getFresh(`index`)} \\in 1..${a(u)} |-> ${H(e.arguments[0],t,n)}]`},lt=(e,t,n,r)=>{let i=i=>W(t,tt(t,`${T(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${T(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${T(e)} : ${T(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${T(i(o))}`}},q=(e,t,n,r)=>n?t:(r.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),ut=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e=>H(e,n,r),s=e.arguments[0],c=T(t),u=e=>d.default.isPrefixUnaryExpression(e)&&e.operator===d.default.SyntaxKind.MinusToken,f=e=>u(e)?`Len(${t}) - ${T(o(e.operand))}`:o(e),p=e=>()=>{let t=r.names.getFresh(`index`),i=tt(s,`${c}[${t}]`,t,n,r);return e(t,W(s,i,r))},m=(/* @__PURE__ */ new Map([[`at`,()=>{let e=u(s)?`${f(s)} + 1`:`${T(o(s))} + 1`;return q(`${e} \\in DOMAIN ${c}`,`${c}[${e}]`,i,r)}],[`includes`,()=>{let e=r.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${c} : ${c}[${e}] = ${T(o(s))}`}],[`indexOf`,()=>y(o(s),`value`,r,e=>{let t=r.names.getFresh(`index`),n=r.names.getFresh(`earlier`),i=`${c}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${c} : ${i} THEN (CHOOSE ${t} \\in DOMAIN ${c} : ${i} /\\ \\A ${n} \\in 1..(${t} - 1) : ${c}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let n=s===void 0?`0`:f(s),r=e.arguments[1]===void 0?void 0:T(f(e.arguments[1])),i=r===void 0?`Len(${t})`:`IF ${r} < Len(${t}) THEN ${r} ELSE Len(${t})`;return`SubSeq(${t}, ${/^\d+$/.test(n)?String(Number(n)+1):`${T(n)} + 1`}, ${i})`}],[`concat`,()=>[t,...e.arguments.map(e=>F(e,r)===`sequence`?o(e):`<<${o(e)}>>`)].map(T).join(` \\o `)],[`with`,()=>`[${c} EXCEPT ![${T(o(s))} + 1] = ${E(o(e.arguments[1]))}]`],[`toReversed`,()=>{let e=r.names.getFresh(`index`);return`[${e} \\in DOMAIN ${c} |-> ${c}[Len(${t}) - ${e} + 1]]`}],[`map`,p((e,t)=>`[${e} \\in DOMAIN ${c} |-> ${t}]`)],[`every`,p((e,t)=>`\\A ${e} \\in DOMAIN ${c} : ${t}`)],[`some`,p((e,t)=>`\\E ${e} \\in DOMAIN ${c} : ${t}`)],[`filter`,()=>{et(s,`filter() can't take an index`,r);let e=G(s,n,r);return`SelectSeq(${t}, LAMBDA ${e.variable} : ${W(s,e.scope,r)})`}],[`find`,()=>{let e=lt(t,s,n,r);return q(e.exists,`${c}[${e.first}]`,i,r)}],[`findIndex`,()=>{let e=lt(t,s,n,r);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(a);if(m===void 0)throw new l.L(`Unsupported array method: ${a}`,e);return m()},dt=(e,t,n,r,i)=>{let a=e.expression.name.text,o=e.arguments[0];if(a===`includes`||a===`has`)return`${T(H(o,n,r))} \\in ${T(t.set)}`;if(a!==`every`&&a!==`some`&&a!==`find`)throw new l.L(`Unsupported method on a set's elements: ${a}`,e);et(o,`Elements of a set have no index`,r);let s=G(o,n,r),c=W(o,s.scope,r),u=`${s.variable} \\in ${T(t.set)} : ${c}`;return a===`every`?`\\A ${u}`:a===`some`?`\\E ${u}`:q(`\\E ${u}`,`CHOOSE ${u}`,i,r)},ft=(e,t,n)=>{let r=e.expression.name.text,i=T(H(e.expression.expression,t,n)),a=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n)),o=(/* @__PURE__ */ new Map([[`has`,`${a} \\in ${i}`],[`union`,`${i} \\cup ${a}`],[`intersection`,`${i} \\cap ${a}`],[`difference`,`${i} \\ ${a}`],[`symmetricDifference`,`(${i} \\ ${a}) \\cup (${a} \\ ${i})`],[`isSubsetOf`,`${i} \\subseteq ${a}`],[`isSupersetOf`,`${a} \\subseteq ${i}`],[`isDisjointFrom`,`${i} \\cap ${a} = {}`]])).get(r);if(o===void 0)throw new l.L(`Unsupported Set method: ${r}`,e);if(e.arguments[0]===void 0)throw new l.L(`Set method needs an argument: ${r}`,e);return o},pt=(e,t,n,r)=>{let i=e.expression.name.text,a=T(H(e.expression.expression,t,n)),o=e.arguments[0]===void 0?``:T(H(e.arguments[0],t,n));if(i!==`has`&&i!==`get`)throw new l.L(`Unsupported Map method: ${i}`,e);if(e.arguments[0]===void 0)throw new l.L(`Map method needs a key: ${i}`,e);return i===`has`?`${o} \\in DOMAIN ${a}`:r?`${a}[${o}]`:y(a,`map`,n,e=>y(o,`key`,n,t=>q(`${t} \\in DOMAIN ${e}`,`${e}[${t}]`,r,n)))},mt={pop:e=>`SubSeq(${e}, 1, Len(${e}) - 1)`,shift:e=>`Tail(${e})`},ht=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${T(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${T(e)}`],[`pop`,mt.pop],[`shift`,mt.shift]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${T(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${T(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${T(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${T(e)} \\ {${t[0]}} |-> ${T(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),gt=new Set([...ht.values()].flatMap(e=>[...e.keys()])),_t=(e,t,n,r,i)=>{let a=n.arguments.map(e=>H(e,r,i));return ht.get(t)?.get(n.expression.name.text)?.(e,a,i)},vt=(e,t,n,r)=>{let i=e.expression.expression,a=K(i,t,n);if(a!==void 0)return dt(e,a,t,n,r);let o=d.default.isNewExpression(i)&&i.arguments?.length===1&&d.default.isIdentifier(i.expression)&&(i.expression.text===`Set`||i.expression.text===`Map`),s=F(i,n),c=o?_t(H(i,t,n),s,e,t,n):void 0;if(c!==void 0)return c;if(s===`sequence`){let a=e.expression.name.text,o=H(i,t,n),s=i=>ut(e,i,t,n,r);return $e.has(a)?s(o):y(o,`sequence`,n,s)}if(s===`set`)return ft(e,t,n);if(s===`map`)return pt(e,t,n,r);throw new l.L(`Unsupported call: ${e.expression.getText()}`,e)},yt=(e,t,n)=>{let r=e.expression.getText(),i=e.arguments?.[0];if(r===`Set`)return i===void 0?`{}`:d.default.isArrayLiteralExpression(i)&&!i.elements.some(d.default.isSpreadElement)?`{${i.elements.map(e=>H(e,t,n)).join(`, `)}}`:at(i,t,n);if(r!==`Map`)throw new l.L(`Unsupported constructor: new ${r}`,e);if(i===void 0)return`<<>>`;if(d.default.isArrayLiteralExpression(i))return i.elements.length===0?`<<>>`:i.elements.toReversed().map(e=>{if(!d.default.isArrayLiteralExpression(e)||e.elements.length!==2)throw new l.L(`Write each Map entry as [key, value]`,e);return`(${H(e.elements[0],t,n)} :> ${H(e.elements[1],t,n)})`}).join(` @@ `);if(F(i,n)===`map`)return H(i,t,n);let a=st(i,t,n);if(a===void 0)throw new l.L(`Unsupported constructor: new ${r}`,e);return a},bt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusEqualsToken,`+`],[d.default.SyntaxKind.MinusEqualsToken,`-`],[d.default.SyntaxKind.AsteriskEqualsToken,`*`]]),xt=/* @__PURE__ */ new Map([[d.default.SyntaxKind.PlusPlusToken,`+`],[d.default.SyntaxKind.MinusMinusToken,`-`]]),J=(e,t,n)=>{if(d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e))return J(e.expression,t,n);if(d.default.isIdentifier(e)){let r=h(e,n.checker),i=r===void 0?void 0:t.scope.bindings.get(r);if(r===void 0||i===void 0||!t.mutable.has(r))throw new l.L(`Only state variables and local lets can change: ${e.text}`,e);return{symbol:r,current:i,selector:``}}if(d.default.isPropertyAccessExpression(e)){if(F(e.expression,n)!==`other`)throw new l.L(`Can't assign to ${e.getText()}`,e);let r=J(e.expression,t,n);return{...r,selector:`${r.selector}.${e.name.text}`}}if(d.default.isElementAccessExpression(e)){let r=J(e.expression,t,n),i=Re(e,t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}if(g(e)&&e.expression.name.text===`get`&&e.arguments.length===1&&F(e.expression.expression,n)===`map`){let r=J(e.expression.expression,t,n),i=H(e.arguments[0],t.scope,n);return{...r,selector:`${r.selector}[${i}]`}}throw new l.L(`Can't assign to ${e.getText()}`,e)},Y=(e,t,n,r)=>{let i=J(e,t,n),a=i.selector===``?r(i.current):`[${T(i.current)} EXCEPT !${i.selector} = ${E(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},X=(e,t,n,r,i)=>d.default.isArrayLiteralExpression(e)?e.elements.reduce((e,a,o)=>{if(d.default.isOmittedExpression(a))return e;if(d.default.isSpreadElement(a))throw new l.L(`Rest elements can't be assigned`,a);let s=t!==void 0&&d.default.isArrayLiteralExpression(t)?t.elements[o]:void 0;return s!==void 0&&!d.default.isSpreadElement(s)?X(a,s,H(s,r.scope,i),e,i):X(a,void 0,`${T(n)}[${o+1}]`,e,i)},r):d.default.isObjectLiteralExpression(e)?e.properties.reduce((e,t)=>{if(d.default.isShorthandPropertyAssignment(t))return X(t.name,void 0,`${T(n)}.${t.name.text}`,e,i);if(d.default.isPropertyAssignment(t)&&d.default.isIdentifier(t.name))return X(t.initializer,void 0,`${T(n)}.${t.name.text}`,e,i);throw new l.L(`Can't assign to ${t.getText()}`,t)},r):Y(e,r,i,()=>n),St=(e,t,n)=>{if(d.default.isNonNullExpression(e)||d.default.isParenthesizedExpression(e))return St(e.expression,t,n);if(!g(e))return;let r=e.expression.name.text;if(r!==`shift`&&r!==`pop`)return;let i=e.expression.expression;if(F(i,n)!==`sequence`)return;let a=H(i,t.scope,n);return{value:r===`shift`?`Head(${a})`:`${T(a)}[Len(${a})]`,path:Y(i,t,n,mt[r])}},Ct=(e,t,n)=>{if(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e)){let r=xt.get(e.operator);return r===void 0?void 0:Y(e.operand,t,n,e=>`${T(e)} ${r} 1`)}if(!d.default.isBinaryExpression(e))return;let r=e.operatorToken.kind;if(r===d.default.SyntaxKind.EqualsToken){let r=H(e.right,t.scope,n);return X(e.left,e.right,r,t,n)}let i=r===d.default.SyntaxKind.PlusEqualsToken&&F(e.left,n)===`string`?`\\o`:bt.get(r);if(i===void 0)return;let a=T(H(e.right,t.scope,n));return Y(e.left,t,n,e=>`${T(e)} ${i} ${a}`)},wt=(e,t,n,r,i)=>{let a=e.arguments.map(e=>H(e,t.scope,n));if(g(e)){let r=e.expression.expression,o=e.expression.name.text,s=r.getText()===`console`;if(s&&o===`log`){let e=a.length===1?a[0]:`<<${a.join(`, `)}>>`;return x([b(`PrintT(${e})`),i(t)])}if(s&&o===`assert`){let e=a[1]??JSON.stringify(`Assertion failed`);return x([b(`Assert(${a[0]}, ${e})`),i(t)])}if(gt.has(o)){let a=F(r,n);return i(Y(r,t,n,r=>{let i=_t(r,a,e,t.scope,n);if(i===void 0)throw new l.L(`Unsupported method: ${o}`,e);return i}))}}let o=_(h(e.expression,n.checker)),s=v(o);if(o===void 0||s?.body===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);if(r.inlining.has(o))throw new l.L(`Helpers that change state can't call themselves`,e);let c=me(s.parameters.map(e=>e.name),a,t.scope,n),u=d.default.isBlock(s.body)?s.body.statements:[d.default.factory.createExpressionStatement(s.body)],f=e=>i({...e,scope:{...e.scope,previous:t.scope.previous}});return S(c.definitions,Z(u,{...t,scope:c.scope},n,{next:f,exit:f,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...r.inlining,o])}))},Tt=(e,t,n,r,i)=>{if(d.default.isParenthesizedExpression(e))return Tt(e.expression,t,n,r,i);if(d.default.isCallExpression(e))return wt(e,t,n,r,i);let a=Ct(e,t,n);if(a===void 0)throw new l.L(`Unsupported statement: ${e.getText()}`,e);return i(a)},Et=(e,t,n,r)=>{if(e.length===0)return r(t);let i=e[0],a=e.slice(1);if(i.initializer===void 0)throw new l.L(`Declare locals with a value`,i);if(v(i.initializer)!==void 0)return Et(a,t,n,r);let o=St(i.initializer,t,n),s=o?.value??H(i.initializer,t.scope,n),c=o?.path??t,u=pe(i.name,s,c.scope,n),f=d.default.isIdentifier(i.name)?h(i.name,n.checker):void 0,p=(i.parent.flags&d.default.NodeFlags.Let)!==0&&f!==void 0?/* @__PURE__ */ new Set([...t.mutable,f]):t.mutable;return S(u.definitions,Et(a,{...c,scope:u.scope,mutable:p},n,r))},Z=(e,t,n,r)=>{if(e.length===0)return r.next(t);let i=e[0],a=t=>Z(e.slice(1),t,n,r);if(d.default.isBlock(i))return Z(i.statements,t,n,{...r,next:a});if(d.default.isEmptyStatement(i))return a(t);if(d.default.isVariableStatement(i))return Et(i.declarationList.declarations,t,n,a);if(d.default.isIfStatement(i))return Ce(i,t.scope,n,e=>Z([e],t,n,{...r,next:a}),()=>a(t));if(d.default.isReturnStatement(i)){if(i.expression!==void 0)throw new l.L(`Actions can't return a value`,i);return r.exit(t)}if(d.default.isBreakStatement(i)){if(r.breakTo===void 0)throw new l.L(`Unsupported break`,i);return r.breakTo(t)}if(d.default.isThrowStatement(i))return b(Se(i,t.scope,n));if(d.default.isSwitchStatement(i))return we(i,t.scope,n,e=>Z(e,t,n,{...r,next:a,breakTo:a}),()=>a(t));if(d.default.isExpressionStatement(i))return Tt(i.expression,t,n,r,a);throw d.default.isIterationStatement(i,!1)?new l.L(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,i):new l.L(`Unsupported statement: ${i.getText()}`,i)},Dt=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return re;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return x([...t.filter(e=>e.value!==e.name).map(e=>b(`${e.name}' = ${E(e.value)}`)),...r.length>0?[b(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return Z(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},Ot=e=>g(e)&&e.expression.name.text===`get`?Ot(e.expression.expression):d.default.isPropertyAccessExpression(e)||d.default.isElementAccessExpression(e)||d.default.isParenthesizedExpression(e)||d.default.isNonNullExpression(e)?Ot(e.expression):e,kt=(e,t,n=/* @__PURE__ */ new Set)=>{let r=e=>{let n=Ot(e),r=d.default.isIdentifier(n)?h(n,t.checker):void 0;return r!==void 0&&t.variables.has(r)},i=d.default.isBinaryExpression(e)&&e.operatorToken.kind>=d.default.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=d.default.SyntaxKind.LastAssignment&&r(e.left),a=(d.default.isPostfixUnaryExpression(e)||d.default.isPrefixUnaryExpression(e))&&xt.has(e.operator)&&r(e.operand),o=g(e)&>.has(e.expression.name.text)&&r(e.expression.expression);if(i||a||o)return!0;if(d.default.isCallExpression(e)){let r=_(h(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),kt(r,t,n)))return!0}return d.default.forEachChild(e,e=>kt(e,t,n)||void 0)??!1},At=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),jt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
|
|
16
|
+
`)}`,Mt=e=>e.length===0?` FALSE`:e.length===1?` ${e[0]}`:`\n${e.map(e=>` \\/ ${e}`).join(`
|
|
17
|
+
`)}`,Q=(e,t)=>t.length>0?[`${e} ${t.join(` `)}`]:[],Nt=(e,t,n,r)=>{if(n.views.length>1)throw new l.L(`Tag only one function @view`);let i=[...r.recursive].map(e=>{let t=r.definitions.get(e);if(t===void 0||t.parameters.length===0)throw new l.L(`A constant can't refer to itself`,e);return`${t.name}(${t.parameters.map(()=>`_`).join(`, `)})`}),a=r.prelude,o=[...a.has(`Null`)?[`Null`]:[],...a.has(`Undefined`)?[`Undefined`]:[],...r.modelValues.values()],s=t.variables.map(e=>e.name),c=t.symmetrySets;return{name:e,source:[`---- MODULE ${e} ----`,`EXTENDS Integers, Sequences, FiniteSets, TLC`,...o.length>0?[`CONSTANTS ${o.join(`, `)}`]:[],...s.length>0?[`VARIABLES ${s.join(`, `)}`]:[],`vars == <<${s.join(`, `)}>>`,...i.length>0?[`RECURSIVE ${i.join(`, `)}`]:[],...a.has(`Rem`)?[`Rem(a, b) ==
|
|
18
18
|
LET m == IF b < 0 THEN -b ELSE b
|
|
19
19
|
IN IF a >= 0 THEN a % m ELSE -((-a) % m)`]:[],...a.has(`Quot`)?[`Quot(a, b) ==
|
|
20
20
|
LET q == (IF a < 0 THEN -a ELSE a) \\div (IF b < 0 THEN -b ELSE b)
|
|
21
|
-
IN IF (a < 0) = (b < 0) THEN q ELSE -q`]:[],...r.output,`Init ==${
|
|
21
|
+
IN IF (a < 0) = (b < 0) THEN q ELSE -q`]:[],...r.output,`Init ==${jt(n.init.length>0?n.init:[`TRUE`])}`,...n.actions,`Next ==${Mt(n.next)}`,`Spec ==${jt([`Init`,`[][Next]_vars`,...n.fairness])}`,...n.predicates,...n.temporal,...n.assumptions.map(e=>`ASSUME ${e}`),...c.length>0?[`Perms == ${c.map(e=>`Permutations(${e})`).join(` \\cup `)}`]:[],`====`].join(`
|
|
22
22
|
`),config:[`SPECIFICATION Spec`,...o.length>0?[`CONSTANTS`,...o.map(e=>` ${e} = ${e}`)]:[],...Q(`INVARIANTS`,n.invariants),...Q(`PROPERTIES`,n.properties),...Q(`CONSTRAINTS`,n.constraints),...Q(`ACTION_CONSTRAINTS`,n.actionConstraints),...Q(`VIEW`,n.views),...Q(`POSTCONDITIONS`,n.postconditions),...c.length>0?[`SYMMETRY Perms`]:[],...t.isDeadlockChecked?[]:[`CHECK_DEADLOCK FALSE`]].join(`
|
|
23
|
-
`)}},
|
|
23
|
+
`)}},Pt=/* @__PURE__ */ new Map([[`eventually`,`<>`],[`alwaysEventually`,`[]<>`],[`eventuallyAlways`,`<>[]`]]),Ft=/* @__PURE__ */ new Map([[`constraint`,`constraints`],[`actionConstraint`,`actionConstraints`],[`view`,`views`],[`postcondition`,`postconditions`],[`assume`,`assumptions`]]),It=/* @__PURE__ */ new Set([...Pt.keys(),...Ft.keys(),`initially`,`always`,`leadsTo`,`terminating`]),Lt=(e,t)=>{let n=e.node.parameters;if(n.length===0)return O(t);if(n.length>1||!d.default.isIdentifier(n[0].name))throw new l.L(`Take the state before the step as one parameter`,n[0]);return{bindings:new Map([...t.variables].map(e=>[e[0],`${e[1]}'`])),previous:h(n[0].name,t.checker)}},Rt=(e,t,n,r)=>{let i=(e.tags.get(`leadsTo`)??``).split(/\s/)[0],a=n.topLevel.get(i);if(a===void 0)throw new l.L(`@leadsTo names an unknown function: ${i}`,e.node);let o=n.exported.find(e=>e.declaration===a);if(o!==void 0)return o.name;let s=j(a,r),c=t.slice(0,s.parameters.length);return c.length===0?s.name:`${s.name}(${c.join(`, `)})`},zt=(e,t,n,r,i)=>{let a=e.name,o=e.node,s=t===`always`||t===`actionConstraint`,c=Pt.has(t)||t===`leadsTo`;if(!s&&!c&&o.parameters.length>0)throw new l.L(`@${t} functions can't take parameters`,o.parameters[0]);let u=(c?o.parameters:[]).map(e=>({...de(e,i),domain:Pe(i.checker.getTypeAtLocation(e.name),e,i)})),d=s?Lt(e,i):k(O(i),u),f=u.length===0?``:`\\A ${u.map(e=>`${e.name} \\in ${e.domain}`).join(`, `)} : `,p=D(M(e.body,d,i),` `),m=Pt.get(t),h=Ft.get(t);if(m!==void 0&&(r.temporal.push(`${a} ==\n ${f}${m}(${p})`),r.properties.push(a)),t===`leadsTo`){let t=u.map(e=>e.name),o=Rt(e,t,n,i);r.temporal.push(`${a} ==\n ${f}(${p}) ~> ${o}`),r.properties.push(a)}t===`always`&&(r.temporal.push(o.parameters.length===0?`${a} ==\n [](${p})`:`${a} ==\n [][${p}]_vars`),r.properties.push(a)),t===`terminating`&&(r.actions.push(`${a} ==\n ${p}`),r.next.push(`${a} /\\ UNCHANGED vars`)),t===`initially`&&r.init.push(p),h!==void 0&&(r.predicates.push(`${a} ==\n ${p}`),r[h].push(a))},Bt=(e,t,n)=>{let r=e.node.parameters;if(r.length>0)throw new l.L(`Invariants can't take parameters`,r[0]);let i=e.body,a=O(n),o=d.default.isBlock(i)?M(i,a,n):B(i,a,n);t.predicates.push(`${e.name} ==\n ${D(o,` `)}`),t.invariants.push(e.name)},Vt=/* @__PURE__ */ new Set([...It,`fair`,`strongFair`,`symmetric`,`noDeadlock`,`param`,`returns`,`return`,`example`,`see`,`deprecated`,`remarks`,`throws`,`link`,`description`]),Ht=e=>new Map(d.default.getJSDocTags(e).map(e=>{if(!Vt.has(e.tagName.text))throw new l.L(`Unknown tag: @${e.tagName.text}`,e);return[e.tagName.text,d.default.getTextOfJSDocComment(e.comment)?.trim()??``]})),Ut=e=>(d.default.getCombinedModifierFlags(e)&d.default.ModifierFlags.Export)!==0,Wt=e=>d.default.isVariableDeclaration(e)&&(e.parent.flags&d.default.NodeFlags.Let)!==0,Gt=(e,t)=>{let n=t.checker.getTypeAtLocation(e.name);return`{${(n.isUnion()?n.types:[n]).map(n=>{if(!n.isStringLiteral())throw new l.L(`A @symmetric type must be a union of strings`,e);let r=t.names.getFresh(n.value);if(r!==n.value)throw new l.L(`"${n.value}" can't name a TLA+ model value`,e);return t.modelValues.set(n.value,r),r}).join(`, `)}}`},Kt=e=>{if(d.default.isImportDeclaration(e)||d.default.isTypeAliasDeclaration(e)||d.default.isInterfaceDeclaration(e)||d.default.isEnumDeclaration(e)||d.default.isExportDeclaration(e)&&e.isTypeOnly)return[];if(d.default.isFunctionDeclaration(e)&&e.name!==void 0&&e.body)return[{name:e.name.text,declaration:e}];if(!d.default.isVariableStatement(e))throw new l.L(`Unsupported statement: ${e.getText()}`,e);let t=e.declarationList.flags;return e.declarationList.declarations.map(e=>{if(!d.default.isIdentifier(e.name))throw new l.L(`Declare one name at a time`,e);if((t&(d.default.NodeFlags.Let|d.default.NodeFlags.Const))===0)throw new l.L(`Use let for state and const for everything else`,e);return{name:e.name.text,declaration:e}})},qt=(e,t)=>{let n=e.statements,r=new Map(n.map(e=>[e,Ht(e)])),i=n.filter(e=>d.default.isTypeAliasDeclaration(e)&&r.get(e)?.has(`symmetric`)===!0).map(e=>Gt(e,t)),a=n.flatMap(Kt),o=a.flatMap(e=>{let n=e.declaration;if(!Wt(n))return[];let r=h(n.name,t.checker);if(Ut(n)||r===void 0)throw new l.L(`State variables can't be exported`,n);let i=t.names.getFresh(e.name);return t.variables.set(r,i),[{name:i,declaration:n}]}),s=a.filter(e=>!Wt(e.declaration));return{variables:o,exported:s.flatMap(e=>{let n=e.declaration,i=v(n);if(!Ut(n)||i?.body===void 0)return[];let a=d.default.isVariableDeclaration(n)?n.parent.parent:n;return[{name:t.names.getFresh(e.name),declaration:n,node:i,body:i.body,tags:r.get(a)??/* @__PURE__ */ new Map}]}),topLevel:new Map(s.map(e=>[e.name,e.declaration])),symmetrySets:i,isDeadlockChecked:![...r.values()].some(e=>e.has(`noDeadlock`))}},$={strict:!0,noEmit:!0,target:d.default.ScriptTarget.ESNext,module:d.default.ModuleKind.ESNext,moduleResolution:d.default.ModuleResolutionKind.Bundler,moduleDetection:d.default.ModuleDetectionKind.Force,allowImportingTsExtensions:!0,resolveJsonModule:!0,skipLibCheck:!0,lib:[`lib.esnext.d.ts`],types:[]},Jt=(0,u.dirname)(d.default.getDefaultLibFilePath($)),Yt=/* @__PURE__ */ new Map,Xt=(e,t)=>{let n=d.default.createSourceFile(t,e,d.default.ScriptTarget.ESNext,!0),r=d.default.createCompilerHost($),i=d.default.createProgram({rootNames:[t],options:$,host:{...r,getSourceFile:(e,i)=>{if(e===t)return n;let a=Yt.get(e);if(a!==void 0)return a;let o=r.getSourceFile(e,i);return o!==void 0&&e.startsWith(Jt)&&Yt.set(e,o),o},fileExists:e=>e===t||r.fileExists(e),readFile:n=>n===t?e:r.readFile(n)}}),a=d.default.getPreEmitDiagnostics(i);if(a.length>0)throw new l.L(d.default.formatDiagnostics(a,r));return{sourceFile:n,checker:i.getTypeChecker()}},Zt=e=>d.default.isReturnStatement(e)?e.expression===void 0:d.default.isBlock(e)&&e.statements.length===1&&Zt(e.statements[0]),Qt=(e,t,n,r)=>{if(!d.default.isIfStatement(e)||e.elseStatement!==void 0||!Zt(e.thenStatement))return;let i=e.expression;if(!d.default.isPrefixUnaryExpression(i)||i.operator!==d.default.SyntaxKind.ExclamationToken)return;let a=d.default.isParenthesizedExpression(i.operand)?i.operand.expression:i.operand;if(!g(a)||a.expression.name.text!==`has`||a.arguments.length!==1)return;let o=e=>[...t.filter(t=>d.default.isIdentifier(e)&&t.symbol===h(e,r.checker)),...e.getChildren().flatMap(o)],s=a.arguments[0],c=t.find(e=>e.symbol===h(s,r.checker)),l=a.expression.expression,u=o(l);if(c!==void 0&&!n.has(c)&&u.every(e=>n.has(e))&&Ae(l,r))return{parameter:c,set:l,isDependent:u.length>0}},$t=(e,t,n,r)=>{let i=e.length===0?void 0:Qt(e[0],t,n,r);if(i===void 0)return{chosen:n,remaining:e};let a=k(O(r),[...n.keys()]),o=H(i.set,a,r);return $t(e.slice(1),t,new Map([...n,[i.parameter,{domain:o,isDependent:i.isDependent}]]),r)},en=(e,t,n)=>{let r=e.name,i=e.body,a=fe(e.node.parameters,n),o=$t(d.default.isBlock(i)?i.statements:[d.default.factory.createExpressionStatement(i)],a,/* @__PURE__ */ new Map,n),s=Dt(o.remaining,k(O(n),a),n),c=a.length===0?r:`${r}(${a.map(e=>e.name).join(`, `)})`;t.actions.push(`${c} ==\n ${D(ae(s),` `)}`);let l=e.tags.has(`strongFair`)?`SF_vars`:e.tags.has(`fair`)?`WF_vars`:void 0;if(a.length===0){t.next.push(r),l!==void 0&&t.fairness.push(`${l}(${r})`);return}let u=e=>n.checker.getTypeAtLocation(e.node.name),f=a.map(e=>{let t=o.chosen.get(e);return{parameter:e,chosen:t,domain:t?.domain??Pe(u(e),e.node,n)}}),p=f.flatMap(e=>e.chosen?.isDependent===!0?[]:[`${e.parameter.name} \\in ${e.domain}`]),m=[...o.chosen].filter(e=>e[1].isDependent).map(e=>`\\E ${e[0].name} \\in ${e[1].domain} : `),h=`\\E ${p.join(`, `)} : ${m.join(``)}${c}`;if(t.next.push(h),l===void 0)return;let g=f.map(e=>{let t=e.chosen===void 0?e.domain:Ne(u(e.parameter),n);return typeof t==`string`?`${e.parameter.name} \\in ${t}`:void 0});if(!g.every(e=>e!==void 0)){t.fairness.push(`${l}(${h})`);return}let _=f.flatMap(e=>e.chosen===void 0?[]:[`${e.parameter.name} \\in ${T(e.domain)}`]);t.fairness.push(`\\A ${g.join(`, `)} : ${l}(${[..._,c].join(` /\\ `)})`)},tn=(e,t)=>{let n=e.declaration.initializer;if(n===void 0){let n=t.checker.getTypeAtLocation(e.declaration.name);return`${e.name} \\in ${Pe(n,e.declaration,t)}`}let r=M(n,O(t),t);return`${e.name} = ${D(E(r),` `)}`},nn=(e,t,n,r)=>{let i=[...e.tags.keys()].find(e=>It.has(e));if(i!==void 0)return zt(e,i,t,n,r);let a=r.checker.getSignatureFromDeclaration(e.node)?.getReturnType();if(kt(e.body,r)||a===void 0||(a.flags&(d.default.TypeFlags.Void|d.default.TypeFlags.Undefined))!==0)return en(e,n,r);if(!(a.flags&d.default.TypeFlags.BooleanLike))throw new l.L(`An exported function that returns a value must return a boolean, or be tagged, such as @view`,e.node);return Bt(e,n,r)},rn=(e,t=`spec.ts`)=>{let n=Xt(e,t.replaceAll(`\\`,`/`)),r=m(n.checker),i=qt(n.sourceFile,r),a=At();a.init.push(...i.variables.map(e=>tn(e,r)));for(let e of i.exported)nn(e,i,a,r);let o=(0,u.basename)(t,`.ts`).split(/[^A-Za-z0-9]+/).map(e=>e.charAt(0).toUpperCase()+e.slice(1)).join(``);return Nt(o,i,a,r)};exports.compile=rn,exports.t=o;
|
package/dist/compile.js
CHANGED
|
@@ -6,18 +6,18 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{L as e}from"./worker.js";import{basename as t,dirname as n}from"node:path";import r from"@typescript/typescript6";const i=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ASSUME.ASSUMPTION.AXIOM.BOOLEAN.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.FALSE.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.SF_.STATE.STRING.SUBSET.SUFFICES.TAKE.TEMPORAL.THEN.THEOREM.TRUE.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WF_.WITH.WITNESS.Nat.Int.Seq.Len.Append.Head.Tail.SubSeq.SelectSeq.Cardinality.IsFiniteSet.Print.PrintT.Assert.JavaTime.TLCGet.TLCSet.Permutations.SortSeq.RandomElement.Any.ToString.TLCEval.Init.Next.Spec.vars.Null.Undefined.Perms.Rem.Quot`.split(`.`)),a=()=>{let e=/* @__PURE__ */ new Set;return{getFresh:t=>{let n=t.replace(/[^A-Za-z0-9_]/g,`_`),r=/[A-Za-z]/.test(n)?n:`v${n}`,a=t=>{let n=t===0?r:`${r}_${t}`;return e.has(n)||i.has(n)?a(t+1):n},o=a(0);return e.add(o),o}}},o=e=>({checker:e,names:a(),variables:/* @__PURE__ */ new Map,definitions:/* @__PURE__ */ new Map,inProgress:/* @__PURE__ */ new Set,recursive:/* @__PURE__ */ new Set,output:[],modelValues:/* @__PURE__ */ new Map,prelude:/* @__PURE__ */ new Set}),s=(e,t)=>{let n=r.isShorthandPropertyAssignment(e.parent)&&e.parent.name===e?t.getShorthandAssignmentValueSymbol(e.parent):t.getSymbolAtLocation(e);return n!==void 0&&n.flags&r.SymbolFlags.Alias?t.getAliasedSymbol(n):n},c=e=>r.isCallExpression(e)&&r.isPropertyAccessExpression(e.expression),l=e=>{let t=e?.valueDeclaration;if(t!==void 0)return r.isFunctionDeclaration(t)&&r.isSourceFile(t.parent)||r.isVariableDeclaration(t)&&r.isVariableStatement(t.parent.parent)&&r.isSourceFile(t.parent.parent.parent)&&(t.parent.flags&r.NodeFlags.Const)!==0?t:void 0},u=e=>{if(e!==void 0)return r.isFunctionDeclaration(e)||r.isArrowFunction(e)||r.isFunctionExpression(e)?e:r.isVariableDeclaration(e)?u(e.initializer):void 0},d=(e,t)=>u(e)??u(s(e,t.checker)?.valueDeclaration),f=(e,t)=>t.modelValues.get(e)??JSON.stringify(e),p=e=>/^(@|[A-Za-z_]\w*'?|-?\d+|"[^"\\]*")$/.test(e),m=(e,t,n,r)=>{if(p(e))return r(e);let i=n.names.getFresh(t);return`(LET ${i} == ${e} IN ${r(i)})`},h={kind:`disabled`},g=e=>({kind:`text`,text:e}),_=e=>{let t=e.flatMap(e=>e.kind===`and`?e.items:[e]);if(t.some(e=>e.kind===`disabled`))return h;let n=t.filter(e=>e.kind!==`text`||e.text!==`TRUE`);return n.length===0?g(`TRUE`):n.length===1?n[0]:{kind:`and`,items:n}},v=(e,t,n,r=`~${
|
|
9
|
+
import{L as e}from"./worker.js";import{basename as t,dirname as n}from"node:path";import r from"@typescript/typescript6";const i=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ASSUME.ASSUMPTION.AXIOM.BOOLEAN.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.FALSE.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.SF_.STATE.STRING.SUBSET.SUFFICES.TAKE.TEMPORAL.THEN.THEOREM.TRUE.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WF_.WITH.WITNESS.Nat.Int.Seq.Len.Append.Head.Tail.SubSeq.SelectSeq.Cardinality.IsFiniteSet.Print.PrintT.Assert.JavaTime.TLCGet.TLCSet.Permutations.SortSeq.RandomElement.Any.ToString.TLCEval.Init.Next.Spec.vars.Null.Undefined.Perms.Rem.Quot`.split(`.`)),a=()=>{let e=/* @__PURE__ */ new Set;return{getFresh:t=>{let n=t.replace(/[^A-Za-z0-9_]/g,`_`),r=/[A-Za-z]/.test(n)?n:`v${n}`,a=t=>{let n=t===0?r:`${r}_${t}`;return e.has(n)||i.has(n)?a(t+1):n},o=a(0);return e.add(o),o}}},o=e=>({checker:e,names:a(),variables:/* @__PURE__ */ new Map,definitions:/* @__PURE__ */ new Map,inProgress:/* @__PURE__ */ new Set,recursive:/* @__PURE__ */ new Set,output:[],modelValues:/* @__PURE__ */ new Map,prelude:/* @__PURE__ */ new Set}),s=(e,t)=>{let n=r.isShorthandPropertyAssignment(e.parent)&&e.parent.name===e?t.getShorthandAssignmentValueSymbol(e.parent):t.getSymbolAtLocation(e);return n!==void 0&&n.flags&r.SymbolFlags.Alias?t.getAliasedSymbol(n):n},c=e=>r.isCallExpression(e)&&r.isPropertyAccessExpression(e.expression),l=e=>{let t=e?.valueDeclaration;if(t!==void 0)return r.isFunctionDeclaration(t)&&r.isSourceFile(t.parent)||r.isVariableDeclaration(t)&&r.isVariableStatement(t.parent.parent)&&r.isSourceFile(t.parent.parent.parent)&&(t.parent.flags&r.NodeFlags.Const)!==0?t:void 0},u=e=>{if(e!==void 0)return r.isFunctionDeclaration(e)||r.isArrowFunction(e)||r.isFunctionExpression(e)?e:r.isVariableDeclaration(e)?u(e.initializer):void 0},d=(e,t)=>u(e)??u(s(e,t.checker)?.valueDeclaration),f=(e,t)=>t.modelValues.get(e)??JSON.stringify(e),p=e=>/^(@|[A-Za-z_]\w*'?|-?\d+|"[^"\\]*")$/.test(e),m=(e,t,n,r)=>{if(p(e))return r(e);let i=n.names.getFresh(t);return`(LET ${i} == ${e} IN ${r(i)})`},h={kind:`disabled`},g=e=>({kind:`text`,text:e}),_=e=>{let t=e.flatMap(e=>e.kind===`and`?e.items:[e]);if(t.some(e=>e.kind===`disabled`))return h;let n=t.filter(e=>e.kind!==`text`||e.text!==`TRUE`);return n.length===0?g(`TRUE`):n.length===1?n[0]:{kind:`and`,items:n}},v=(e,t,n,r=`~${S(e)}`)=>t.kind===`disabled`&&n.kind===`disabled`?h:n.kind===`disabled`?_([g(e),t]):t.kind===`disabled`?_([g(r),n]):{kind:`if`,condition:e,whenTrue:t,whenFalse:n},y=(e,t)=>t.kind===`disabled`||e.length===0?t:t.kind===`let`?y([...e,...t.definitions],t.body):{kind:`let`,definitions:e,body:t},b=(e,t,n)=>e.map((e,r)=>`${r===0?t:n}${e}`),x=e=>e.kind===`disabled`?[`FALSE`]:e.kind===`text`?e.text.split(`
|
|
10
10
|
`):e.kind===`and`?e.items.flatMap(e=>b(x(e),`/\\ `,` `)):e.kind===`if`?[...b(e.condition.split(`
|
|
11
11
|
`),`IF `,` `),...b(x(e.whenTrue),`THEN `,` `),...b(x(e.whenFalse),`ELSE `,` `)]:[...e.definitions.flatMap((e,t)=>b(e.split(`
|
|
12
|
-
`),t===0?`LET `:` `,` `)),...b(x(e.body),`IN `,` `)],
|
|
13
|
-
`),
|
|
14
|
-
`)&&!
|
|
15
|
-
`).join(`\n${t}`),E=e=>({bindings:new Map(e.variables),previous:void 0}),D=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),ae=(t,n)=>{if(!r.isIdentifier(t.name)||t.initializer!==void 0||t.questionToken!==void 0||t.dotDotDotToken!==void 0)throw new e(`Use a plain parameter here: ${t.getText()}`,t);return{node:t,name:n.names.getFresh(t.name.text),symbol:s(t.name,n.checker)}},O=(e,t)=>e.map(e=>ae(e,t)),k=(t,n,i,a)=>r.isIdentifier(t)?D(i,[{name:n,symbol:s(t,a.checker)}]):t.elements.reduce((i,o,s)=>{if(r.isOmittedExpression(o))return i;if(o.dotDotDotToken!==void 0||o.initializer!==void 0)throw new e(`Rest elements and default values aren't supported`,o);let c=r.isArrayBindingPattern(t)?`${C(n)}[${s+1}]`:`${C(n)}.${(o.propertyName??o.name).getText()}`;return k(o.name,c,i,a)},i),oe=(e,t,n,i)=>{let a=i.names.getFresh(r.isIdentifier(e)?e.text:`value`);return{definitions:[`${a} == ${T(t,` `)}`],scope:k(e,a,n,i)}},se=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=oe(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),ce=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),le=(e,t,n)=>{if(r.isIdentifier(e)){let r=s(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=l(r);if(i!==void 0&&!n.has(i))return n.add(i),le(i,t,n)}return r.forEachChild(e,e=>le(e,t,n)||void 0)??!1},ue=e=>r.isVariableDeclaration(e)?e.initializer:void 0,A=(t,n)=>{let r=n.definitions.get(t);if(r!==void 0)return n.inProgress.has(t)&&n.recursive.add(t),r;if(t.name===void 0)throw new e(`Name this function`,t);let i=u(t),a=O(i?.parameters??[],n),o=a.map(e=>{let t=n.checker.getTypeAtLocation(e.node.name).getCallSignatures();return t.length===0?e.name:`${e.name}(${t[0].parameters.map(()=>`_`).join(`, `)})`}),s={name:n.names.getFresh(t.name.getText()),parameters:o,readsState:le(t,n,/* @__PURE__ */ new Set([t]))};n.definitions.set(t,s),n.inProgress.add(t);let c=i===void 0?ue(t):i.body;if(c===void 0)throw new e(`Give this a value`,t);let l=j(c,D(E(n),a),n);n.inProgress.delete(t);let d=o.length===0?s.name:`${s.name}(${o.join(`, `)})`;return n.output.push(`${d} ==\n ${T(l,` `)}`),s},de=(t,n,r,i)=>{if(t.body===void 0)throw new e(`Give this a body`,t);let a=se(t.parameters.map(e=>e.name),n.map(e=>U(e,r,i)),r,i),o=j(t.body,a.scope,i);return a.definitions.length===0?o:S(y(a.definitions,g(o)))},fe=(t,n,i)=>{if(r.isArrowFunction(t)||r.isFunctionExpression(t)){let e=O(t.parameters,i),r=j(t.body,D(n,e),i);return`LAMBDA ${e.map(e=>e.name).join(`, `)} : ${r}`}let a=s(t,i.checker),o=l(a);if(o!==void 0)return A(o,i).name;let c=a===void 0?void 0:n.bindings.get(a);if(c===void 0)throw new e(`Pass a function here`,t);return c},pe=(t,n,r,i)=>{let a=A(t,i),o=n?.arguments??[];if(a.readsState&&ce(r,i)){let n=u(t);if(n!==void 0)return de(n,o,r,i);let a=ue(t);if(a===void 0)throw new e(`Give this a body`,t);return U(a,r,i)}if(a.parameters.length===0)return a.name;let s=o.map((e,t)=>a.parameters[t].includes(`(`)?fe(e,r,i):U(e,r,i));return`${a.name}(${s.join(`, `)})`},me=(t,n,r)=>{let i=d(t.expression,r);if(i===void 0)throw new e(`Unsupported call: ${t.expression.getText()}`,t);if(r.inProgress.has(i))throw new e(`A local function can't call itself, so declare it at the top level`,t);r.inProgress.add(i);let a=de(i,t.arguments,n,r);return r.inProgress.delete(i),a},j=(t,n,i)=>r.isBlock(t)?S(M(t.statements,n,i,()=>{throw new e(`This function must return a value on every path`,t)})):U(t,n,i),M=(t,n,i,a)=>{if(t.length===0)return a(n);let o=t[0],s=e=>M(t.slice(1),e,i,a);if(r.isBlock(o))return M(o.statements,n,i,s);if(r.isVariableStatement(o)){let t=o.declarationList.declarations.reduce((t,n)=>{if(n.initializer===void 0)throw new e(`Declare locals with a value`,n);if(u(n.initializer)!==void 0)return t;let r=U(n.initializer,t.scope,i),a=oe(n.name,r,t.scope,i);return{definitions:[...t.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n});return y(t.definitions,s(t.scope))}if(r.isIfStatement(o))return ge(o,n,i,e=>M([e],n,i,s),()=>s(n));if(r.isReturnStatement(o)){if(o.expression===void 0)throw new e(`Return a value`,o);return g(U(o.expression,n,i))}if(r.isThrowStatement(o))return g(he(o,n,i));if(r.isSwitchStatement(o))return _e(o,n,i,e=>M(e,n,i,s),()=>s(n));throw new e(`Unsupported statement: ${o.getText()}`,o)},he=(e,t,n)=>{let i=e.expression;return`Assert(FALSE, ${r.isNewExpression(i)&&i.arguments?.[0]!==void 0?U(i.arguments[0],t,n):JSON.stringify(i.getText())})`},ge=(e,t,n,r,i)=>{let a=V(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return v(a,o,s,H(e.expression,t,n))},_e=(t,n,i,a,o)=>{let s=C(U(t.expression,n,i)),c=t.caseBlock.clauses,l=t=>{if(t===c.length)return o();let u=c.findIndex((e,n)=>n>=t&&e.statements.length>0),d=c.slice(t,u===-1?c.length:u+1),f=d[d.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(r.isBreakStatement(m)||r.isReturnStatement(m)||r.isThrowStatement(m)),g=t+d.length===c.length;if(p.length>0&&!h&&!g)throw new e(`End each case with break, return, or throw`,f);let _=a(m!==void 0&&r.isBreakStatement(m)?p.slice(0,-1):p);if(d.some(r.isDefaultClause))return _;let y=d.filter(r.isCaseClause).map(e=>`${s} = ${C(U(e.expression,n,i))}`).join(` \\/ `);return v(y,_,l(t+d.length))};return l(0)},ve=e=>(e.flags&r.TypeFlags.Object)!==0&&(e.objectFlags&r.ObjectFlags.Reference)!==0,ye=e=>e.getSymbol()?.getName()??``,N=e=>[`Set`,`ReadonlySet`].includes(ye(e)),P=e=>[`Map`,`ReadonlyMap`].includes(ye(e)),be=(e,t)=>e.isUnion()?e.types.every(e=>be(e,t)):t.isArrayType(e)||t.isTupleType(e),F=(e,t)=>e.isUnion()?e.types.every(e=>F(e,t)):(e.flags&t)!==0,I=(e,t)=>{let n=t.checker,i=n.getNonNullableType(n.getTypeAtLocation(e));return be(i,n)?`sequence`:N(i)?`set`:P(i)?`map`:F(i,r.TypeFlags.StringLike)?`string`:`other`},L=(e,t)=>F(t.checker.getTypeAtLocation(e),r.TypeFlags.BooleanLike),xe=(e,t)=>N(t.checker.getTypeAtLocation(e)),R=e=>/^-?\d+$/.test(e),Se=(e,t)=>{if(e.isStringLiteral())return f(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&r.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&r.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(r.TypeFlags.Undefined|r.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},z=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),Ce=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=we(n,t);return typeof r==`string`?[...e,r]:r},[]),we=(e,t)=>{let n=t.checker;if(e.flags&r.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>Se(e,t)),r=Ce(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>R(e)&&R(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?C(e):e).join(` \\cup `)}let i=Se(e,t);if(i!==void 0)return`{${i}}`;if(N(e)||P(e)||n.isTupleType(e)){let i=Ce(ve(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(i))return i;if(N(e))return`SUBSET ${C(i[0])}`;if(P(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${i[1]}] : ${e} \\in SUBSET ${C(i[0])}}`}if(!(ve(e)&&e.target.elementFlags.every(e=>(e&r.ElementFlags.Required)!==0)))return z(e,`tuples with optional or rest elements can have any length`,t);if(i.length===0)return`{<<>>}`;if(i.length>1)return i.map(C).join(` \\X `);let a=t.names.getFresh(`element`);return`{<<${a}>> : ${a} \\in ${i[0]}}`}if(n.isArrayType(e))return z(e,`arrays can have any length, so use a tuple`,t);let a=e.getProperties();if(!(e.flags&r.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&a.length>0))return z(e,`use a union of literals, or records, tuples, and sets of them`,t);let o=a.find(e=>e.flags&r.SymbolFlags.Optional);if(o!==void 0)return z(e,`the optional field ${o.name} may be missing`,t);let s=Ce(a.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(s))return s;let c=a.map(e=>e.name);return c.some(R)?!c.every(R)||s.some(e=>e!==s[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${c.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${s[0]}]`:`[${c.map((e,t)=>`${e} : ${s[t]}`).join(`, `)}]`},Te=(t,n,r)=>{let i=we(t,r);if(typeof i!=`string`)throw new e(i.message,n);return i},Ee=/* @__PURE__ */ new Map([[r.SyntaxKind.MinusToken,`-`],[r.SyntaxKind.AsteriskToken,`*`],[r.SyntaxKind.AsteriskAsteriskToken,`^`],[r.SyntaxKind.EqualsEqualsEqualsToken,`=`],[r.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[r.SyntaxKind.LessThanToken,`<`],[r.SyntaxKind.LessThanEqualsToken,`<=`],[r.SyntaxKind.GreaterThanToken,`>`],[r.SyntaxKind.GreaterThanEqualsToken,`>=`]]),De=/* @__PURE__ */ new Set([r.SyntaxKind.LessThanToken,r.SyntaxKind.LessThanEqualsToken,r.SyntaxKind.GreaterThanToken,r.SyntaxKind.GreaterThanEqualsToken]),Oe=/* @__PURE__ */ new Map([[r.SyntaxKind.AmpersandAmpersandToken,`/\\`],[r.SyntaxKind.BarBarToken,`\\/`]]),ke=(e,t,n)=>{let i=e.argumentExpression;return I(e.expression,n)===`sequence`?r.isNumericLiteral(i)?String(Number(i.text)+1):`${C(U(i,t,n))} + 1`:U(i,t,n)},Ae=(t,n,i)=>{let a=t.elements.reduce((t,a)=>{if(!r.isSpreadElement(a)){let e=U(a,n,i),r=t.at(-1);return Array.isArray(r)?[...t.slice(0,-1),[...r,e]]:[...t,[e]]}if(I(a.expression,i)!==`sequence`)throw new e(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,a);return[...t,U(a.expression,n,i)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return a.length===0?`<<>>`:a.length===1?a[0]:a.map(C).join(` \\o `)},je=e=>R(e)?`[${e}]`:`.${e}`,Me=e=>e.every(e=>R(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Ne=(t,n,i)=>{let a=i.checker,o=e=>e.name===void 0||r.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),s=t=>{if(r.isPropertyAssignment(t))return U(t.initializer,n,i);if(r.isShorthandPropertyAssignment(t))return U(t.name,n,i);throw new e(`Unsupported object member`,t)},c=t.properties.filter(r.isSpreadAssignment);if(c.length===0){if(t.properties.length===0)throw new e(`TLA+ has no empty record, so use a Map`,t);return Me(t.properties.map(t=>{let n=o(t);if(n===void 0)throw new e(`Computed keys need a spread base`,t);return{key:n,value:s(t)}}))}let l=t.properties[0],u=t.properties.slice(1);if(r.isSpreadAssignment(l)&&c.length===1){let t=a.getTypeAtLocation(l.expression),c=U(l.expression,n,i);if(u.length===0)return c;if(u.every(e=>{let n=o(e);return n===void 0||t.getProperty(n)!==void 0})){let t=u.map(t=>{let a=o(t);if(a!==void 0)return`!${je(a)} = ${w(s(t))}`;if(t.name===void 0||!r.isComputedPropertyName(t.name))throw new e(`Unsupported object member`,t);return`![${U(t.name.expression,n,i)}] = ${w(s(t))}`});return`[${C(c)} EXCEPT ${t.join(`, `)}]`}}return Me(a.getTypeAtLocation(t).getProperties().map(c=>{let l=c.name,u=t.properties.findLast(e=>r.isSpreadAssignment(e)?a.getTypeAtLocation(e.expression).getProperty(l)!==void 0:o(e)===l);if(u===void 0||!r.isSpreadAssignment(u)&&o(u)===void 0)throw new e(`Can't tell which value ${l} takes`,t);return{key:l,value:r.isSpreadAssignment(u)?`${C(U(u.expression,n,i))}${je(l)}`:s(u)}}))},Pe=(t,n,i,a)=>{let o=e=>C(U(e,i,a)),s=t.arguments[0];if((n===`floor`||n===`trunc`)&&t.arguments.length===1){let i=r.isParenthesizedExpression(s)?s.expression:s;if(!r.isBinaryExpression(i)||i.operatorToken.kind!==r.SyntaxKind.SlashToken)throw new e(`Math.${n} only takes a division, as in Math.${n}(a / b)`,t);let c=o(i.left),l=o(i.right);return n===`floor`?`${c} \\div ${l}`:(a.prelude.add(`Quot`),`Quot(${c}, ${l})`)}if(n===`abs`&&t.arguments.length===1)return m(o(s),`value`,a,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((n===`min`||n===`max`)&&t.arguments.length>0){let e=n===`min`?`<=`:`>=`;if(t.arguments.length===1&&r.isSpreadElement(s)){let t=C(Xe(s.expression,i,a)),n=a.names.getFresh(`candidate`),r=a.names.getFresh(`other`);return`CHOOSE ${n} \\in ${t} : \\A ${r} \\in ${t} : ${n} ${e} ${r}`}return t.arguments.map(o).reduce((t,n)=>m(t,`best`,a,t=>m(n,`value`,a,n=>`IF ${t} ${e} ${n} THEN ${t} ELSE ${n}`)))}throw new e(`Unsupported call: Math.${n}`,t)},Fe=(e,t,n,i)=>{let a=s(e.expression,n.checker),o=l(a);if(o!==void 0)return pe(o,e,t,n);if(!c(e)){let r=a===void 0?void 0:t.bindings.get(a);return r===void 0?me(e,t,n):`${r}(${e.arguments.map(e=>U(e,t,n)).join(`, `)})`}let u=e.expression.expression,d=e.expression.name.text,f=r.isIdentifier(u)?u.text:void 0;return f===`Math`?Pe(e,d,t,n):(f===`Object`&&d===`fromEntries`?Qe(e.arguments[0],t,n):$e(e,t,n))??ct(e,t,n,i)},B=(e,t,n)=>{let r=U(e,t,n);return I(e,n)===`string`?r:`ToString(${r})`},Ie=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=B(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(C).join(` \\o `)},Le=(t,n,i)=>{let a=t.operatorToken.kind,o=e=>C(U(e,n,i)),s=I(t.left,i)===`string`||I(t.right,i)===`string`,c=Oe.get(a);if(c!==void 0){if(!L(t.left,i)||!L(t.right,i))throw new e(`${t.operatorToken.getText()} needs booleans, so compare explicitly`,t);return`${o(t.left)} ${c} ${o(t.right)}`}if(a===r.SyntaxKind.PlusToken&&s)return`${C(B(t.left,n,i))} \\o ${C(B(t.right,n,i))}`;if(a===r.SyntaxKind.PlusToken)return`${o(t.left)} + ${o(t.right)}`;if(a===r.SyntaxKind.PercentToken)return i.prelude.add(`Rem`),`Rem(${U(t.left,n,i)}, ${U(t.right,n,i)})`;if(a===r.SyntaxKind.QuestionQuestionToken)return i.prelude.add(`Null`),i.prelude.add(`Undefined`),m(o(t.left),`value`,i,e=>`IF ${e} \\in {Null, Undefined} THEN ${o(t.right)} ELSE ${e}`);if(a===r.SyntaxKind.InKeyword)return`${o(t.left)} \\in DOMAIN ${o(t.right)}`;if(a===r.SyntaxKind.SlashToken)throw new e(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,t);if(De.has(a)&&s)throw new e(`TLA+ strings have no order, so compare them with === only`,t);let l=Ee.get(a);if(l===void 0)throw new e(`Unsupported operator: ${t.operatorToken.getText()}`,t.operatorToken);return`${o(t.left)} ${l} ${o(t.right)}`},Re=(t,n,r)=>{let i=[...r.variables].find(e=>e[0].name===t);if(i===void 0)throw new e(`Unknown variable: ${t}`,n);return i[1]},ze=(t,n,i)=>{let a=n.valueDeclaration,o=a!==void 0&&r.isEnumMember(a)?i.checker.getConstantValue(a):void 0;if(typeof o==`string`)return f(o,i);if(typeof o==`number`&&Number.isInteger(o))return String(o);throw new e(`Unsupported enum member`,t)},Be=(e,t,n,i)=>{if(t!==void 0&&t.flags&r.SymbolFlags.EnumMember)return ze(e,t,i);let a=l(t);if(a!==void 0)return u(a)===void 0?pe(a,void 0,n,i):A(a,i).name},Ve=(t,n,r)=>{if(t.text===`undefined`)return r.prelude.add(`Undefined`),`Undefined`;let i=s(t,r.checker),a=i===void 0?void 0:n.bindings.get(i);if(a!==void 0)return a;if(i!==void 0&&i===n.previous)return Me(r.checker.getTypeAtLocation(t).getProperties().map(e=>({key:e.name,value:Re(e.name,t,r)})));let o=Be(t,i,n,r);if(o!==void 0)return o;throw i!==void 0&&r.variables.has(i)?new e(`${t.text} can't be read here`,t):new e(`Unknown name: ${t.text}`,t)},He=(t,n,i)=>{if(t.questionDotToken!==void 0)throw new e(`Optional chaining isn't supported`,t);let a=Be(t,s(t,i.checker),n,i);if(a!==void 0)return a;let o=t.expression,c=t.name.text;return n.previous!==void 0&&r.isIdentifier(o)&&s(o,i.checker)===n.previous?Re(c,t,i):(c===`length`||c===`size`?Ze(o,n,i):void 0)??`${C(U(o,n,i))}.${c}`},Ue=(e,t,n)=>`${C(U(e.expression,t,n))}[${ke(e,t,n)}]`,V=(t,n,r)=>{if(!L(t,r))throw new e(`Conditions must be booleans, so compare explicitly`,t);return U(t,n,r)},H=(e,t,n)=>{if(r.isParenthesizedExpression(e))return H(e.expression,t,n);if(r.isPrefixUnaryExpression(e)&&e.operator===r.SyntaxKind.ExclamationToken)return V(e.operand,t,n);if(r.isBinaryExpression(e)&&e.operatorToken.kind===r.SyntaxKind.BarBarToken){let r=H(e.left,t,n),i=H(e.right,t,n);return`${C(r)} /\\ ${C(i)}`}return`~${C(V(e,t,n))}`},U=(t,n,i,a=!1)=>{if(r.isParenthesizedExpression(t)||r.isAsExpression(t)||r.isSatisfiesExpression(t)||r.isTypeAssertionExpression(t))return U(t.expression,n,i,a);if(r.isNonNullExpression(t))return U(t.expression,n,i,!0);if(r.isNumericLiteral(t)){if(!Number.isInteger(Number(t.text)))throw new e(`Only integers are supported: ${t.text}`,t);return String(Number(t.text))}if(r.isStringLiteral(t)||r.isNoSubstitutionTemplateLiteral(t))return f(t.text,i);if(r.isTemplateExpression(t))return Ie(t,n,i);if(t.kind===r.SyntaxKind.TrueKeyword)return`TRUE`;if(t.kind===r.SyntaxKind.FalseKeyword)return`FALSE`;if(t.kind===r.SyntaxKind.NullKeyword)return i.prelude.add(`Null`),`Null`;if(r.isIdentifier(t))return Ve(t,n,i);if(r.isPrefixUnaryExpression(t)&&t.operator===r.SyntaxKind.ExclamationToken){if(!L(t.operand,i))throw new e(`! needs a boolean, so compare explicitly`,t);return`~${C(U(t.operand,n,i))}`}if(r.isPrefixUnaryExpression(t)&&t.operator===r.SyntaxKind.MinusToken)return`-${C(U(t.operand,n,i))}`;if(r.isBinaryExpression(t))return Le(t,n,i);if(r.isConditionalExpression(t))return`IF ${V(t.condition,n,i)} THEN ${U(t.whenTrue,n,i)} ELSE ${U(t.whenFalse,n,i)}`;if(r.isArrayLiteralExpression(t))return Ae(t,n,i);if(r.isObjectLiteralExpression(t))return Ne(t,n,i);if(r.isPropertyAccessExpression(t))return He(t,n,i);if(r.isElementAccessExpression(t))return Ue(t,n,i);if(r.isCallExpression(t))return Fe(t,n,i,a);if(r.isNewExpression(t))return lt(t,n,i);throw new e(`Unsupported expression: ${t.getText()}`,t)},We=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),W=(t,n)=>{let r=d(t,n);if(r?.body===void 0)throw new e(`Pass a function here`,t);return{parameters:r.parameters,body:r.body}},G=(e,t,n)=>j(W(e,n).body,t,n),Ge=(t,n,r)=>{if(W(t,r).parameters[1]!==void 0)throw new e(n,t)},K=(e,t,n)=>{let i=W(e,n).parameters[0];if(i===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!r.isIdentifier(i.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:k(i.name,e,t,n)}}let a=n.names.getFresh(i.name.text),o=s(i.name,n.checker);return{variable:a,scope:D(t,[{name:a,symbol:o}])}},Ke=(e,t,n,r,i)=>{let a=W(e,i).parameters,o=t===void 0||a[0]===void 0?r:k(a[0].name,t,r,i);return a[1]===void 0?o:k(a[1].name,`(${n} - 1)`,o,i)},qe=(e,t)=>({set:m(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),Je=(e,t)=>({set:m(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),Ye=(e,t)=>m(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),q=(e,t,n)=>{let i=e=>U(e,t,n);if(r.isParenthesizedExpression(e))return q(e.expression,t,n);if(r.isArrayLiteralExpression(e)&&e.elements.length===1&&r.isSpreadElement(e.elements[0])){let r=e.elements[0].expression,a=I(r,n);return a===`set`?{set:i(r),isMapped:!1}:a===`map`?Je(i(r),n):q(r,t,n)}if(!c(e))return;let a=e.expression.expression,o=e.expression.name.text;if(r.isIdentifier(a)&&a.text===`Object`){let t=i(e.arguments[0]);return o===`keys`?{set:`DOMAIN ${C(t)}`,isMapped:!1}:o===`values`?qe(t,n):o===`entries`?Je(t,n):void 0}let s=I(a,n);if(s===`set`&&(o===`values`||o===`keys`))return{set:i(a),isMapped:!1};if(s===`set`&&o===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${C(i(a))}}`,isMapped:!1}}if(s===`map`&&o===`keys`)return{set:`DOMAIN ${C(i(a))}`,isMapped:!1};if(s===`map`&&o===`values`)return qe(i(a),n);if(s===`map`&&o===`entries`)return Je(i(a),n);if(o===`toArray`)return q(a,t,n);if(o!==`filter`&&o!==`map`)return;let l=q(a,t,n);if(l===void 0)return;let u=e.arguments[0];Ge(u,`Elements of a set have no index`,n);let d=K(u,t,n),f=G(u,d.scope,n);return o===`filter`?{set:`{${d.variable} \\in ${C(l.set)} : ${f}}`,isMapped:l.isMapped}:{set:`{${f} : ${d.variable} \\in ${C(l.set)}}`,isMapped:!0}},Xe=(t,n,r)=>{let i=q(t,n,r);if(i!==void 0)return i.set;let a=I(t,r),o=U(t,n,r);if(a===`set`)return o;if(a!==`sequence`)throw new e(`Expected a Set or an array`,t);return Ye(o,r)},Ze=(t,n,r)=>{let i=q(t,n,r);if(i?.isMapped)throw new e(`map() can merge equal elements, so count before mapping`,t.parent);if(i!==void 0)return`Cardinality(${i.set})`;let a=I(t,r),o=U(t,n,r);if(a===`sequence`||a===`string`)return`Len(${o})`;if(a===`set`)return`Cardinality(${o})`;if(a===`map`)return`Cardinality(DOMAIN ${C(o)})`},Qe=(t,n,i)=>{if(!c(t)||t.expression.name.text!==`map`)return;let a=t.expression.expression,o=q(a,n,i)?.set??(I(a,i)===`sequence`?Ye(U(a,n,i),i):void 0),s=t.arguments[0],l=W(s,i).parameters[0],u=(r.isArrowFunction(s)||r.isFunctionExpression(s))&&!r.isBlock(s.body)?s.body:void 0,d=u!==void 0&&r.isParenthesizedExpression(u)?u.expression:u,f=d!==void 0&&r.isArrayLiteralExpression(d)&&d.elements.length===2&&l!==void 0&&r.isIdentifier(l.name)&&r.isIdentifier(d.elements[0])&&d.elements[0].text===l.name.text;if(o===void 0||!f)throw new e(`Build a Map or record from a set with set.values().map((key) => [key, value])`,t);let p=K(s,n,i),m=U(d.elements[1],p.scope,i);return`[${p.variable} \\in ${o} |-> ${m}]`},$e=(t,n,i)=>{let a=t.expression.expression,o=t.expression.name.text,s=e=>C(U(e,n,i)),c=t.arguments[1],l=t.arguments[0];if(r.isIdentifier(a)&&a.text===`Array`&&o===`from`&&t.arguments.length===2&&r.isObjectLiteralExpression(l)){let a=l.properties.find(e=>e.name?.getText()===`length`);if(a===void 0||!r.isPropertyAssignment(a))throw new e(`Array.from needs { length: n }`,t);let o=i.names.getFresh(`index`),u=Ke(c,void 0,o,n,i);return`[${o} \\in 1..${s(a.initializer)} |-> ${G(c,u,i)}]`}if(o!==`fill`||t.arguments.length!==1)return;let u=r.isNewExpression(a)||r.isCallExpression(a)?a:void 0,d=u!==void 0&&r.isIdentifier(u.expression)&&u.expression.text===`Array`&&u.arguments?.length===1?u.arguments[0]:void 0;if(d!==void 0)return`[${i.names.getFresh(`index`)} \\in 1..${s(d)} |-> ${U(t.arguments[0],n,i)}]`},et=(e,t,n,r)=>{let i=i=>G(t,Ke(t,`${C(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${C(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${C(e)} : ${C(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${C(i(o))}`}},tt=(t,n,i,a,o)=>{let s=t.expression.name.text,c=e=>U(e,i,a),l=t.arguments[0],u=C(n),d=e=>r.isPrefixUnaryExpression(e)&&e.operator===r.SyntaxKind.MinusToken,f=e=>d(e)?`Len(${n}) - ${C(c(e.operand))}`:c(e),p=(e,t)=>o?t:(a.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),h=e=>()=>{let t=a.names.getFresh(`index`),n=Ke(l,`${u}[${t}]`,t,i,a);return e(t,G(l,n,a))},g=(/* @__PURE__ */ new Map([[`at`,()=>{let e=d(l)?`${f(l)} + 1`:`${C(c(l))} + 1`;return p(`${e} \\in DOMAIN ${u}`,`${u}[${e}]`)}],[`includes`,()=>{let e=a.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${u} : ${u}[${e}] = ${C(c(l))}`}],[`indexOf`,()=>m(c(l),`value`,a,e=>{let t=a.names.getFresh(`index`),n=a.names.getFresh(`earlier`),r=`${u}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${u} : ${r} THEN (CHOOSE ${t} \\in DOMAIN ${u} : ${r} /\\ \\A ${n} \\in 1..(${t} - 1) : ${u}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let e=l===void 0?`0`:f(l),r=t.arguments[1]===void 0?void 0:C(f(t.arguments[1])),i=r===void 0?`Len(${n})`:`IF ${r} < Len(${n}) THEN ${r} ELSE Len(${n})`;return`SubSeq(${n}, ${/^\d+$/.test(e)?String(Number(e)+1):`${C(e)} + 1`}, ${i})`}],[`concat`,()=>[n,...t.arguments.map(e=>I(e,a)===`sequence`?c(e):`<<${c(e)}>>`)].map(C).join(` \\o `)],[`with`,()=>`[${u} EXCEPT ![${C(c(l))} + 1] = ${w(c(t.arguments[1]))}]`],[`toReversed`,()=>{let e=a.names.getFresh(`index`);return`[${e} \\in DOMAIN ${u} |-> ${u}[Len(${n}) - ${e} + 1]]`}],[`map`,h((e,t)=>`[${e} \\in DOMAIN ${u} |-> ${t}]`)],[`every`,h((e,t)=>`\\A ${e} \\in DOMAIN ${u} : ${t}`)],[`some`,h((e,t)=>`\\E ${e} \\in DOMAIN ${u} : ${t}`)],[`filter`,()=>{Ge(l,`filter() can't take an index`,a);let e=K(l,i,a);return`SelectSeq(${n}, LAMBDA ${e.variable} : ${G(l,e.scope,a)})`}],[`find`,()=>{let e=et(n,l,i,a);return p(e.exists,`${u}[${e.first}]`)}],[`findIndex`,()=>{let e=et(n,l,i,a);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(s);if(g===void 0)throw new e(`Unsupported array method: ${s}`,t);return g()},nt=(t,n,r,i,a)=>{let o=t.expression.name.text,s=t.arguments[0];if(o===`includes`||o===`has`)return`${C(U(s,r,i))} \\in ${C(n.set)}`;if(o!==`every`&&o!==`some`&&o!==`find`)throw new e(`Unsupported method on a set's elements: ${o}`,t);Ge(s,`Elements of a set have no index`,i);let c=K(s,r,i),l=G(s,c.scope,i),u=`${c.variable} \\in ${C(n.set)} : ${l}`;return o===`every`?`\\A ${u}`:o===`some`?`\\E ${u}`:a?`CHOOSE ${u}`:(i.prelude.add(`Undefined`),`IF \\E ${u} THEN CHOOSE ${u} ELSE Undefined`)},rt=(t,n,r)=>{let i=t.expression.name.text,a=C(U(t.expression.expression,n,r)),o=t.arguments[0]===void 0?``:C(U(t.arguments[0],n,r)),s=(/* @__PURE__ */ new Map([[`has`,`${o} \\in ${a}`],[`union`,`${a} \\cup ${o}`],[`intersection`,`${a} \\cap ${o}`],[`difference`,`${a} \\ ${o}`],[`symmetricDifference`,`(${a} \\ ${o}) \\cup (${o} \\ ${a})`],[`isSubsetOf`,`${a} \\subseteq ${o}`],[`isSupersetOf`,`${o} \\subseteq ${a}`],[`isDisjointFrom`,`${a} \\cap ${o} = {}`]])).get(i);if(s===void 0)throw new e(`Unsupported Set method: ${i}`,t);return s},it=(t,n,r,i)=>{let a=t.expression.name.text,o=C(U(t.expression.expression,n,r)),s=t.arguments[0]===void 0?``:C(U(t.arguments[0],n,r));if(a===`has`)return`${s} \\in DOMAIN ${o}`;if(a!==`get`)throw new e(`Unsupported Map method: ${a}`,t);return i?`${o}[${s}]`:(r.prelude.add(`Undefined`),m(o,`map`,r,e=>m(s,`key`,r,t=>`IF ${t} \\in DOMAIN ${e} THEN ${e}[${t}] ELSE Undefined`)))},at=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${C(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${C(e)}`],[`pop`,e=>`SubSeq(${e}, 1, Len(${e}) - 1)`],[`shift`,e=>`Tail(${e})`]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${C(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${C(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${C(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${C(e)} \\ {${t[0]}} |-> ${C(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),ot=new Set([...at.values()].flatMap(e=>[...e.keys()])),st=(e,t,n,r,i)=>{let a=n.arguments.map(e=>U(e,r,i));return at.get(t)?.get(n.expression.name.text)?.(e,a,i)},ct=(t,n,i,a)=>{let o=t.expression.expression,s=q(o,n,i);if(s!==void 0)return nt(t,s,n,i,a);let c=r.isNewExpression(o)&&o.arguments?.length===1&&r.isIdentifier(o.expression)&&(o.expression.text===`Set`||o.expression.text===`Map`),l=I(o,i),u=c?st(U(o,n,i),l,t,n,i):void 0;if(u!==void 0)return u;if(l===`sequence`){let e=t.expression.name.text,r=U(o,n,i),s=e=>tt(t,e,n,i,a);return We.has(e)?s(r):m(r,`sequence`,i,s)}if(l===`set`)return rt(t,n,i);if(l===`map`)return it(t,n,i,a);throw new e(`Unsupported call: ${t.expression.getText()}`,t)},lt=(t,n,i)=>{let a=t.expression.getText(),o=t.arguments?.[0];if(a===`Set`)return o===void 0?`{}`:r.isArrayLiteralExpression(o)&&!o.elements.some(r.isSpreadElement)?`{${o.elements.map(e=>U(e,n,i)).join(`, `)}}`:Xe(o,n,i);if(a!==`Map`)throw new e(`Unsupported constructor: new ${a}`,t);if(o===void 0)return`<<>>`;if(r.isArrayLiteralExpression(o))return o.elements.length===0?`<<>>`:o.elements.toReversed().map(t=>{if(!r.isArrayLiteralExpression(t)||t.elements.length!==2)throw new e(`Write each Map entry as [key, value]`,t);return`(${U(t.elements[0],n,i)} :> ${U(t.elements[1],n,i)})`}).join(` @@ `);if(I(o,i)===`map`)return U(o,n,i);let s=Qe(o,n,i);if(s===void 0)throw new e(`Unsupported constructor: new ${a}`,t);return s},ut=/* @__PURE__ */ new Map([[r.SyntaxKind.PlusEqualsToken,`+`],[r.SyntaxKind.MinusEqualsToken,`-`],[r.SyntaxKind.AsteriskEqualsToken,`*`]]),dt=/* @__PURE__ */ new Map([[r.SyntaxKind.PlusPlusToken,`+`],[r.SyntaxKind.MinusMinusToken,`-`]]),J=(t,n,i)=>{if(r.isParenthesizedExpression(t)||r.isNonNullExpression(t))return J(t.expression,n,i);if(r.isIdentifier(t)){let r=s(t,i.checker),a=r===void 0?void 0:n.scope.bindings.get(r);if(r===void 0||a===void 0||!n.mutable.has(r))throw new e(`Only state variables and local lets can change: ${t.text}`,t);return{symbol:r,current:a,selector:``}}if(r.isPropertyAccessExpression(t)){if(I(t.expression,i)!==`other`)throw new e(`Can't assign to ${t.getText()}`,t);let r=J(t.expression,n,i);return{...r,selector:`${r.selector}.${t.name.text}`}}if(r.isElementAccessExpression(t)){let e=J(t.expression,n,i),r=ke(t,n.scope,i);return{...e,selector:`${e.selector}[${r}]`}}if(c(t)&&t.expression.name.text===`get`&&t.arguments.length===1&&I(t.expression.expression,i)===`map`){let e=J(t.expression.expression,n,i),r=U(t.arguments[0],n.scope,i);return{...e,selector:`${e.selector}[${r}]`}}throw new e(`Can't assign to ${t.getText()}`,t)},Y=(e,t,n,r)=>{let i=J(e,t,n),a=i.selector===``?r(i.current):`[${C(i.current)} EXCEPT !${i.selector} = ${w(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},X=(t,n,i,a,o)=>r.isArrayLiteralExpression(t)?t.elements.reduce((t,s,c)=>{if(r.isOmittedExpression(s))return t;if(r.isSpreadElement(s))throw new e(`Rest elements can't be assigned`,s);let l=n!==void 0&&r.isArrayLiteralExpression(n)?n.elements[c]:void 0;return l!==void 0&&!r.isSpreadElement(l)?X(s,l,U(l,a.scope,o),t,o):X(s,void 0,`${C(i)}[${c+1}]`,t,o)},a):r.isObjectLiteralExpression(t)?t.properties.reduce((t,n)=>{if(r.isShorthandPropertyAssignment(n))return X(n.name,void 0,`${C(i)}.${n.name.text}`,t,o);if(r.isPropertyAssignment(n)&&r.isIdentifier(n.name))return X(n.initializer,void 0,`${C(i)}.${n.name.text}`,t,o);throw new e(`Can't assign to ${n.getText()}`,n)},a):Y(t,a,o,()=>i),ft=(e,t,n)=>{if(r.isNonNullExpression(e)||r.isParenthesizedExpression(e))return ft(e.expression,t,n);if(!c(e))return;let i=e.expression.name.text;if(i!==`shift`&&i!==`pop`)return;let a=e.expression.expression;if(I(a,n)!==`sequence`)return;let o=U(a,t.scope,n);return{value:i===`shift`?`Head(${o})`:`${C(o)}[Len(${o})]`,path:Y(a,t,n,e=>i===`shift`?`Tail(${e})`:`SubSeq(${e}, 1, Len(${e}) - 1)`)}},pt=(e,t,n)=>{if(r.isPostfixUnaryExpression(e)||r.isPrefixUnaryExpression(e)){let r=dt.get(e.operator);return r===void 0?void 0:Y(e.operand,t,n,e=>`${C(e)} ${r} 1`)}if(!r.isBinaryExpression(e))return;let i=e.operatorToken.kind;if(i===r.SyntaxKind.EqualsToken){let r=U(e.right,t.scope,n);return X(e.left,e.right,r,t,n)}let a=i===r.SyntaxKind.PlusEqualsToken&&I(e.left,n)===`string`?`\\o`:ut.get(i);if(a===void 0)return;let o=C(U(e.right,t.scope,n));return Y(e.left,t,n,e=>`${C(e)} ${a} ${o}`)},mt=(t,n,i,a,o)=>{let d=t.arguments.map(e=>U(e,n.scope,i));if(c(t)){let r=t.expression.expression,a=t.expression.name.text,s=r.getText()===`console`;if(s&&a===`log`){let e=d.length===1?d[0]:`<<${d.join(`, `)}>>`;return _([g(`PrintT(${e})`),o(n)])}if(s&&a===`assert`){let e=d[1]??JSON.stringify(`Assertion failed`);return _([g(`Assert(${d[0]}, ${e})`),o(n)])}if(ot.has(a)){let s=I(r,i);return o(Y(r,n,i,r=>{let o=st(r,s,t,n.scope,i);if(o===void 0)throw new e(`Unsupported method: ${a}`,t);return o}))}}let f=l(s(t.expression,i.checker)),p=u(f);if(f===void 0||p?.body===void 0)throw new e(`Unsupported statement: ${t.getText()}`,t);if(a.inlining.has(f))throw new e(`Helpers that change state can't call themselves`,t);let m=se(p.parameters.map(e=>e.name),d,n.scope,i),h=r.isBlock(p.body)?p.body.statements:[r.factory.createExpressionStatement(p.body)],v=e=>o({...e,scope:{...e.scope,previous:n.scope.previous}});return y(m.definitions,Z(h,{...n,scope:m.scope},i,{next:v,exit:v,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...a.inlining,f])}))},ht=(t,n,i,a,o)=>{if(r.isParenthesizedExpression(t))return ht(t.expression,n,i,a,o);if(r.isCallExpression(t))return mt(t,n,i,a,o);let s=pt(t,n,i);if(s===void 0)throw new e(`Unsupported statement: ${t.getText()}`,t);return o(s)},gt=(t,n,i,a)=>{if(t.length===0)return a(n);let o=t[0],c=t.slice(1);if(o.initializer===void 0)throw new e(`Declare locals with a value`,o);if(u(o.initializer)!==void 0)return gt(c,n,i,a);let l=ft(o.initializer,n,i),d=l?.value??U(o.initializer,n.scope,i),f=l?.path??n,p=oe(o.name,d,f.scope,i),m=r.isIdentifier(o.name)?s(o.name,i.checker):void 0,h=(o.parent.flags&r.NodeFlags.Let)!==0&&m!==void 0?/* @__PURE__ */ new Set([...n.mutable,m]):n.mutable;return y(p.definitions,gt(c,{...f,scope:p.scope,mutable:h},i,a))},Z=(t,n,i,a)=>{if(t.length===0)return a.next(n);let o=t[0],s=e=>Z(t.slice(1),e,i,a);if(r.isBlock(o))return Z(o.statements,n,i,{...a,next:s});if(r.isEmptyStatement(o))return s(n);if(r.isVariableStatement(o))return gt(o.declarationList.declarations,n,i,s);if(r.isIfStatement(o))return ge(o,n.scope,i,e=>Z([e],n,i,{...a,next:s}),()=>s(n));if(r.isReturnStatement(o)){if(o.expression!==void 0)throw new e(`Actions can't return a value`,o);return a.exit(n)}if(r.isBreakStatement(o)){if(a.breakTo===void 0)throw new e(`Unsupported break`,o);return a.breakTo(n)}if(r.isThrowStatement(o))return g(he(o,n.scope,i));if(r.isSwitchStatement(o))return _e(o,n.scope,i,e=>Z(e,n,i,{...a,next:s,breakTo:s}),()=>s(n));if(r.isExpressionStatement(o))return ht(o.expression,n,i,a,s);throw r.isIterationStatement(o,!1)?new e(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,o):new e(`Unsupported statement: ${o.getText()}`,o)},_t=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return h;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return _([...t.filter(e=>e.value!==e.name).map(e=>g(`${e.name}' = ${w(e.value)}`)),...r.length>0?[g(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return Z(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},vt=e=>c(e)&&e.expression.name.text===`get`?vt(e.expression.expression):r.isPropertyAccessExpression(e)||r.isElementAccessExpression(e)||r.isParenthesizedExpression(e)||r.isNonNullExpression(e)?vt(e.expression):e,yt=(e,t,n=/* @__PURE__ */ new Set)=>{let i=e=>{let n=vt(e),i=r.isIdentifier(n)?s(n,t.checker):void 0;return i!==void 0&&t.variables.has(i)},a=r.isBinaryExpression(e)&&e.operatorToken.kind>=r.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=r.SyntaxKind.LastAssignment&&i(e.left),o=(r.isPostfixUnaryExpression(e)||r.isPrefixUnaryExpression(e))&&dt.has(e.operator)&&i(e.operand),u=c(e)&&ot.has(e.expression.name.text)&&i(e.expression.expression);if(a||o||u)return!0;if(r.isCallExpression(e)){let r=l(s(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),yt(r,t,n)))return!0}return r.forEachChild(e,e=>yt(e,t,n)||void 0)??!1},bt=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),xt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
|
|
16
|
-
`)}`,
|
|
17
|
-
`)}`,
|
|
12
|
+
`),t===0?`LET `:` `,` `)),...b(x(e.body),`IN `,` `)],ee=e=>x(e).join(`
|
|
13
|
+
`),te=/* @__PURE__ */ new Set([`(`,`[`,`{`]),ne=/* @__PURE__ */ new Set([`)`,`]`,`}`]),re=e=>[...e].reduce((t,n,r)=>{if(t.isSkipped)return{...t,isSkipped:!1};if(t.isQuoted)return{...t,isQuoted:t.isEscaped||n!==`"`,isEscaped:!t.isEscaped&&n===`\\`};let i=e.slice(r,r+2);return i===`<<`?{...t,depth:t.depth+1,isSkipped:!0}:i===`>>`&&t.depth>0?{...t,depth:t.depth-1,isSkipped:!0}:n===`"`?{...t,isQuoted:!0}:te.has(n)?{...t,depth:t.depth+1}:ne.has(n)?{...t,depth:t.depth-1}:t.depth===0?{...t,surface:t.surface+n}:t},{depth:0,isQuoted:!1,isEscaped:!1,isSkipped:!1,surface:``}).surface,ie=e=>e!==``&&!/^[~-]/.test(e)&&!e.includes(`
|
|
14
|
+
`)&&!re(e).includes(` `),S=e=>ie(e)?e:`(${e})`,ae=[` = `,` # `,` < `,` > `,` <= `,` >= `,` \\in `,` \\notin `,` \\subseteq `,` /\\ `,` \\/ `,` => `,` ~> `],C=e=>{if(e.startsWith(`~`))return`(${e})`;let t=re(e);return ae.some(e=>t.includes(e))?`(${e})`:e},w=(e,t)=>e.split(`
|
|
15
|
+
`).join(`\n${t}`),T=e=>({bindings:new Map(e.variables),previous:void 0}),E=(e,t)=>({bindings:new Map([...e.bindings,...t.flatMap(e=>e.symbol===void 0?[]:[[e.symbol,e.name]])]),previous:e.previous}),oe=(t,n)=>{if(!r.isIdentifier(t.name)||t.initializer!==void 0||t.questionToken!==void 0||t.dotDotDotToken!==void 0)throw new e(`Use a plain parameter here: ${t.getText()}`,t);return{node:t,name:n.names.getFresh(t.name.text),symbol:s(t.name,n.checker)}},D=(e,t)=>e.map(e=>oe(e,t)),O=(t,n,i,a)=>r.isIdentifier(t)?E(i,[{name:n,symbol:s(t,a.checker)}]):t.elements.reduce((i,o,s)=>{if(r.isOmittedExpression(o))return i;if(o.dotDotDotToken!==void 0||o.initializer!==void 0)throw new e(`Rest elements and default values aren't supported`,o);let c=r.isArrayBindingPattern(t)?`${S(n)}[${s+1}]`:`${S(n)}.${(o.propertyName??o.name).getText()}`;return O(o.name,c,i,a)},i),se=(e,t,n,i)=>{let a=i.names.getFresh(r.isIdentifier(e)?e.text:`value`);return{definitions:[`${a} == ${w(t,` `)}`],scope:O(e,a,n,i)}},ce=(e,t,n,r)=>e.reduce((e,n,i)=>{let a=se(n,t[i],e.scope,r);return{definitions:[...e.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n}),le=(e,t)=>[...t.variables].some(t=>e.bindings.get(t[0])!==t[1]),ue=(e,t,n)=>{if(r.isIdentifier(e)){let r=s(e,t.checker);if(r!==void 0&&t.variables.has(r))return!0;let i=l(r);if(i!==void 0&&!n.has(i))return n.add(i),ue(i,t,n)}return r.forEachChild(e,e=>ue(e,t,n)||void 0)??!1},de=e=>r.isVariableDeclaration(e)?e.initializer:void 0,k=(t,n)=>{let r=n.definitions.get(t);if(r!==void 0)return n.inProgress.has(t)&&n.recursive.add(t),r;if(t.name===void 0)throw new e(`Name this function`,t);let i=u(t),a=D(i?.parameters??[],n),o=a.map(e=>{let t=n.checker.getTypeAtLocation(e.node.name).getCallSignatures();return t.length===0?e.name:`${e.name}(${t[0].parameters.map(()=>`_`).join(`, `)})`}),s={name:n.names.getFresh(t.name.getText()),parameters:o,readsState:ue(t,n,/* @__PURE__ */ new Set([t]))};n.definitions.set(t,s),n.inProgress.add(t);let c=i===void 0?de(t):i.body;if(c===void 0)throw new e(`Give this a value`,t);let l=A(c,E(T(n),a),n);n.inProgress.delete(t);let d=o.length===0?s.name:`${s.name}(${o.join(`, `)})`;return n.output.push(`${d} ==\n ${w(l,` `)}`),s},fe=(t,n,r,i)=>{if(t.body===void 0)throw new e(`Give this a body`,t);let a=ce(t.parameters.map(e=>e.name),n.map(e=>V(e,r,i)),r,i),o=A(t.body,a.scope,i);return a.definitions.length===0?o:ee(y(a.definitions,g(o)))},pe=(t,n,i)=>{if(r.isArrowFunction(t)||r.isFunctionExpression(t)){let e=D(t.parameters,i),r=A(t.body,E(n,e),i);return`LAMBDA ${e.map(e=>e.name).join(`, `)} : ${r}`}let a=s(t,i.checker),o=l(a);if(o!==void 0)return k(o,i).name;let c=a===void 0?void 0:n.bindings.get(a);if(c===void 0)throw new e(`Pass a function here`,t);return c},me=(t,n,r,i)=>{let a=k(t,i),o=n?.arguments??[];if(a.readsState&&le(r,i)){let n=u(t);if(n!==void 0)return fe(n,o,r,i);let a=de(t);if(a===void 0)throw new e(`Give this a body`,t);return V(a,r,i)}if(a.parameters.length===0)return a.name;let s=o.map((e,t)=>a.parameters[t].includes(`(`)?pe(e,r,i):V(e,r,i));return`${a.name}(${s.join(`, `)})`},he=(t,n,r)=>{let i=d(t.expression,r);if(i===void 0)throw new e(`Unsupported call: ${t.expression.getText()}`,t);if(r.inProgress.has(i))throw new e(`A local function can't call itself, so declare it at the top level`,t);r.inProgress.add(i);let a=fe(i,t.arguments,n,r);return r.inProgress.delete(i),a},A=(t,n,i)=>r.isBlock(t)?ee(j(t.statements,n,i,()=>{throw new e(`This function must return a value on every path`,t)})):V(t,n,i),j=(t,n,i,a)=>{if(t.length===0)return a(n);let o=t[0],s=e=>j(t.slice(1),e,i,a);if(r.isBlock(o))return j(o.statements,n,i,s);if(r.isVariableStatement(o)){let t=o.declarationList.declarations.reduce((t,n)=>{if(n.initializer===void 0)throw new e(`Declare locals with a value`,n);if(u(n.initializer)!==void 0)return t;let r=V(n.initializer,t.scope,i),a=se(n.name,r,t.scope,i);return{definitions:[...t.definitions,...a.definitions],scope:a.scope}},{definitions:[],scope:n});return y(t.definitions,s(t.scope))}if(r.isIfStatement(o))return _e(o,n,i,e=>j([e],n,i,s),()=>s(n));if(r.isReturnStatement(o)){if(o.expression===void 0)throw new e(`Return a value`,o);return g(V(o.expression,n,i))}if(r.isThrowStatement(o))return g(ge(o,n,i));if(r.isSwitchStatement(o))return ve(o,n,i,e=>j(e,n,i,s),()=>s(n));throw new e(`Unsupported statement: ${o.getText()}`,o)},ge=(e,t,n)=>{let i=e.expression;return`Assert(FALSE, ${r.isNewExpression(i)&&i.arguments?.[0]!==void 0?V(i.arguments[0],t,n):JSON.stringify(i.getText())})`},_e=(e,t,n,r,i)=>{let a=z(e.expression,t,n),o=r(e.thenStatement),s=e.elseStatement===void 0?i():r(e.elseStatement);return v(a,o,s,B(e.expression,t,n))},ve=(t,n,i,a,o)=>{let s=S(V(t.expression,n,i)),c=t.caseBlock.clauses,l=t=>{if(t===c.length)return o();let u=c.findIndex((e,n)=>n>=t&&e.statements.length>0),d=c.slice(t,u===-1?c.length:u+1),f=d[d.length-1],p=f.statements,m=p.at(-1),h=m!==void 0&&(r.isBreakStatement(m)||r.isReturnStatement(m)||r.isThrowStatement(m)),g=t+d.length===c.length;if(p.length>0&&!h&&!g)throw new e(`End each case with break, return, or throw`,f);let _=a(m!==void 0&&r.isBreakStatement(m)?p.slice(0,-1):p);if(d.some(r.isDefaultClause))return _;let y=d.filter(r.isCaseClause).map(e=>`${s} = ${S(V(e.expression,n,i))}`).join(` \\/ `);return v(y,_,l(t+d.length))};return l(0)},ye=e=>(e.flags&r.TypeFlags.Object)!==0&&(e.objectFlags&r.ObjectFlags.Reference)!==0,be=e=>e.getSymbol()?.getName()??``,M=e=>[`Set`,`ReadonlySet`].includes(be(e)),N=e=>[`Map`,`ReadonlyMap`].includes(be(e)),xe=(e,t)=>e.isUnion()?e.types.every(e=>xe(e,t)):t.isArrayType(e)||t.isTupleType(e),P=(e,t)=>e.isUnion()?e.types.every(e=>P(e,t)):(e.flags&t)!==0,F=(e,t)=>{let n=t.checker,i=n.getNonNullableType(n.getTypeAtLocation(e));return xe(i,n)?`sequence`:M(i)?`set`:N(i)?`map`:P(i,r.TypeFlags.StringLike)?`string`:`other`},I=(e,t)=>P(t.checker.getTypeAtLocation(e),r.TypeFlags.BooleanLike),Se=(e,t)=>M(t.checker.getTypeAtLocation(e)),L=e=>/^-?\d+$/.test(e),Ce=(e,t)=>{if(e.isStringLiteral())return f(e.value,t);if(e.isNumberLiteral())return Number.isInteger(e.value)?String(e.value):void 0;if(e.flags&r.TypeFlags.BooleanLiteral)return t.checker.typeToString(e)===`true`?`TRUE`:`FALSE`;if(e.flags&r.TypeFlags.Null)return t.prelude.add(`Null`),`Null`;if(e.flags&(r.TypeFlags.Undefined|r.TypeFlags.Void))return t.prelude.add(`Undefined`),`Undefined`},R=(e,t,n)=>({message:`${n.checker.typeToString(e)} isn't finite: ${t}`}),we=(e,t)=>e.reduce((e,n)=>{if(!Array.isArray(e))return e;let r=Te(n,t);return typeof r==`string`?[...e,r]:r},[]),Te=(e,t)=>{let n=t.checker;if(e.flags&r.TypeFlags.Boolean)return`BOOLEAN`;if(e.isUnion()){let n=e.types.map(e=>Ce(e,t)),r=we(e.types.filter((e,t)=>n[t]===void 0),t);if(!Array.isArray(r))return r;let i=n.filter(e=>e!==void 0).sort((e,t)=>L(e)&&L(t)?Number(e)-Number(t):0);return[...i.length>0?[`{${i.join(`, `)}}`]:[],...r].map((e,t,n)=>n.length>1?S(e):e).join(` \\cup `)}let i=Ce(e,t);if(i!==void 0)return`{${i}}`;if(M(e)||N(e)||n.isTupleType(e)){let i=we(ye(e)?n.getTypeArguments(e):[],t);if(!Array.isArray(i))return i;if(M(e))return`SUBSET ${S(i[0])}`;if(N(e)){let e=t.names.getFresh(`keys`);return`UNION {[${e} -> ${i[1]}] : ${e} \\in SUBSET ${S(i[0])}}`}if(!(ye(e)&&e.target.elementFlags.every(e=>(e&r.ElementFlags.Required)!==0)))return R(e,`tuples with optional or rest elements can have any length`,t);if(i.length===0)return`{<<>>}`;if(i.length>1)return i.map(S).join(` \\X `);let a=t.names.getFresh(`element`);return`{<<${a}>> : ${a} \\in ${i[0]}}`}if(n.isArrayType(e))return R(e,`arrays can have any length, so use a tuple`,t);let a=e.getProperties();if(!(e.flags&r.TypeFlags.Object&&e.getCallSignatures().length===0&&n.getIndexInfosOfType(e).length===0&&a.length>0))return R(e,`use a union of literals, or records, tuples, and sets of them`,t);let o=a.find(e=>e.flags&r.SymbolFlags.Optional);if(o!==void 0)return R(e,`the optional field ${o.name} may be missing`,t);let s=we(a.map(e=>n.getTypeOfSymbol(e)),t);if(!Array.isArray(s))return s;let c=a.map(e=>e.name);return c.some(L)?!c.every(L)||s.some(e=>e!==s[0])?{message:`${n.typeToString(e)} has numeric keys, so every key must be a number with the same value type`}:`[{${c.map(Number).sort((e,t)=>e-t).join(`, `)}} -> ${s[0]}]`:`[${c.map((e,t)=>`${e} : ${s[t]}`).join(`, `)}]`},Ee=(t,n,r)=>{let i=Te(t,r);if(typeof i!=`string`)throw new e(i.message,n);return i},De=/* @__PURE__ */ new Map([[r.SyntaxKind.MinusToken,`-`],[r.SyntaxKind.AsteriskToken,`*`],[r.SyntaxKind.AsteriskAsteriskToken,`^`],[r.SyntaxKind.EqualsEqualsEqualsToken,`=`],[r.SyntaxKind.ExclamationEqualsEqualsToken,`#`],[r.SyntaxKind.LessThanToken,`<`],[r.SyntaxKind.LessThanEqualsToken,`<=`],[r.SyntaxKind.GreaterThanToken,`>`],[r.SyntaxKind.GreaterThanEqualsToken,`>=`]]),Oe=/* @__PURE__ */ new Set([r.SyntaxKind.LessThanToken,r.SyntaxKind.LessThanEqualsToken,r.SyntaxKind.GreaterThanToken,r.SyntaxKind.GreaterThanEqualsToken]),ke=/* @__PURE__ */ new Map([[r.SyntaxKind.AmpersandAmpersandToken,`/\\`],[r.SyntaxKind.BarBarToken,`\\/`]]),Ae=(e,t,n)=>{let i=e.argumentExpression;return F(e.expression,n)===`sequence`?r.isNumericLiteral(i)?String(Number(i.text)+1):`${S(V(i,t,n))} + 1`:V(i,t,n)},je=(t,n,i)=>{let a=t.elements.reduce((t,a)=>{if(!r.isSpreadElement(a)){let e=V(a,n,i),r=t.at(-1);return Array.isArray(r)?[...t.slice(0,-1),[...r,e]]:[...t,[e]]}if(F(a.expression,i)!==`sequence`)throw new e(`Sets have no order, so spread one only into every(), some(), filter(), map(), or find()`,a);return[...t,V(a.expression,n,i)]},[]).map(e=>Array.isArray(e)?`<<${e.join(`, `)}>>`:e);return a.length===0?`<<>>`:a.length===1?a[0]:a.map(S).join(` \\o `)},Me=e=>L(e)?`[${e}]`:`.${e}`,Ne=e=>e.every(e=>L(e.key))?e.map(e=>`(${e.key} :> ${e.value})`).join(` @@ `):`[${e.map(e=>`${e.key} |-> ${e.value}`).join(`, `)}]`,Pe=(t,n,i)=>{let a=i.checker,o=e=>e.name===void 0||r.isComputedPropertyName(e.name)?void 0:e.name.getText().replace(/^["']|["']$/g,``),s=t=>{if(r.isPropertyAssignment(t))return V(t.initializer,n,i);if(r.isShorthandPropertyAssignment(t))return V(t.name,n,i);throw new e(`Unsupported object member`,t)},c=t.properties.filter(r.isSpreadAssignment);if(c.length===0){if(t.properties.length===0)throw new e(`TLA+ has no empty record, so use a Map`,t);return Ne(t.properties.map(t=>{let n=o(t);if(n===void 0)throw new e(`Computed keys need a spread base`,t);return{key:n,value:s(t)}}))}let l=t.properties[0],u=t.properties.slice(1);if(r.isSpreadAssignment(l)&&c.length===1){let t=a.getTypeAtLocation(l.expression),c=V(l.expression,n,i);if(u.length===0)return c;if(u.every(e=>{let n=o(e);return n===void 0||t.getProperty(n)!==void 0})){let t=u.map(t=>{let a=o(t);if(a!==void 0)return`!${Me(a)} = ${C(s(t))}`;if(t.name===void 0||!r.isComputedPropertyName(t.name))throw new e(`Unsupported object member`,t);return`![${V(t.name.expression,n,i)}] = ${C(s(t))}`});return`[${S(c)} EXCEPT ${t.join(`, `)}]`}}return Ne(a.getTypeAtLocation(t).getProperties().map(c=>{let l=c.name,u=t.properties.findLast(e=>r.isSpreadAssignment(e)?a.getTypeAtLocation(e.expression).getProperty(l)!==void 0:o(e)===l);if(u===void 0||!r.isSpreadAssignment(u)&&o(u)===void 0)throw new e(`Can't tell which value ${l} takes`,t);return{key:l,value:r.isSpreadAssignment(u)?`${S(V(u.expression,n,i))}${Me(l)}`:s(u)}}))},Fe=(t,n,i,a)=>{let o=e=>S(V(e,i,a)),s=t.arguments[0];if((n===`floor`||n===`trunc`)&&t.arguments.length===1){let i=r.isParenthesizedExpression(s)?s.expression:s;if(!r.isBinaryExpression(i)||i.operatorToken.kind!==r.SyntaxKind.SlashToken)throw new e(`Math.${n} only takes a division, as in Math.${n}(a / b)`,t);let c=o(i.left),l=o(i.right);return n===`floor`?`${c} \\div ${l}`:(a.prelude.add(`Quot`),`Quot(${c}, ${l})`)}if(n===`abs`&&t.arguments.length===1)return m(o(s),`value`,a,e=>`IF ${e} < 0 THEN -${e} ELSE ${e}`);if((n===`min`||n===`max`)&&t.arguments.length>0){let e=n===`min`?`<=`:`>=`;if(t.arguments.length===1&&r.isSpreadElement(s)){let t=S(Qe(s.expression,i,a)),n=a.names.getFresh(`candidate`),r=a.names.getFresh(`other`);return`CHOOSE ${n} \\in ${t} : \\A ${r} \\in ${t} : ${n} ${e} ${r}`}return t.arguments.map(o).reduce((t,n)=>m(t,`best`,a,t=>m(n,`value`,a,n=>`IF ${t} ${e} ${n} THEN ${t} ELSE ${n}`)))}throw new e(`Unsupported call: Math.${n}`,t)},Ie=(e,t,n,i)=>{let a=s(e.expression,n.checker),o=l(a);if(o!==void 0)return me(o,e,t,n);if(!c(e)){let r=a===void 0?void 0:t.bindings.get(a);return r===void 0?he(e,t,n):`${r}(${e.arguments.map(e=>V(e,t,n)).join(`, `)})`}let u=e.expression.expression,d=e.expression.name.text,f=r.isIdentifier(u)?u.text:void 0;return f===`Math`?Fe(e,d,t,n):(f===`Object`&&d===`fromEntries`?et(e.arguments[0],t,n):tt(e,t,n))??dt(e,t,n,i)},Le=(e,t,n)=>{let r=V(e,t,n);return F(e,n)===`string`?r:`ToString(${r})`},Re=(e,t,n)=>{let r=[...e.head.text===``?[]:[JSON.stringify(e.head.text)],...e.templateSpans.flatMap(e=>{let r=Le(e.expression,t,n);return e.literal.text===``?[r]:[r,JSON.stringify(e.literal.text)]})];return r.length===1?r[0]:r.map(S).join(` \\o `)},ze=(t,n,i)=>{let a=t.operatorToken.kind,o=e=>S(V(e,n,i)),s=F(t.left,i)===`string`||F(t.right,i)===`string`,c=ke.get(a);if(c!==void 0){if(!I(t.left,i)||!I(t.right,i))throw new e(`${t.operatorToken.getText()} needs booleans, so compare explicitly`,t);return`${o(t.left)} ${c} ${o(t.right)}`}if(a===r.SyntaxKind.PlusToken&&s)return`${S(Le(t.left,n,i))} \\o ${S(Le(t.right,n,i))}`;if(a===r.SyntaxKind.PlusToken)return`${o(t.left)} + ${o(t.right)}`;if(a===r.SyntaxKind.PercentToken)return i.prelude.add(`Rem`),`Rem(${V(t.left,n,i)}, ${V(t.right,n,i)})`;if(a===r.SyntaxKind.QuestionQuestionToken)return i.prelude.add(`Null`),i.prelude.add(`Undefined`),m(o(t.left),`value`,i,e=>`IF ${e} \\in {Null, Undefined} THEN ${o(t.right)} ELSE ${e}`);if(a===r.SyntaxKind.InKeyword)return`${o(t.left)} \\in DOMAIN ${o(t.right)}`;if(a===r.SyntaxKind.SlashToken)throw new e(`Write division as Math.floor(a / b) or Math.trunc(a / b)`,t);if(Oe.has(a)&&s)throw new e(`TLA+ strings have no order, so compare them with === only`,t);let l=De.get(a);if(l===void 0)throw new e(`Unsupported operator: ${t.operatorToken.getText()}`,t.operatorToken);return`${o(t.left)} ${l} ${o(t.right)}`},Be=(t,n,r)=>{let i=[...r.variables].find(e=>e[0].name===t);if(i===void 0)throw new e(`Unknown variable: ${t}`,n);return i[1]},Ve=(t,n,i)=>{let a=n.valueDeclaration,o=a!==void 0&&r.isEnumMember(a)?i.checker.getConstantValue(a):void 0;if(typeof o==`string`)return f(o,i);if(typeof o==`number`&&Number.isInteger(o))return String(o);throw new e(`Unsupported enum member`,t)},He=(e,t,n,i)=>{if(t!==void 0&&t.flags&r.SymbolFlags.EnumMember)return Ve(e,t,i);let a=l(t);if(a!==void 0)return u(a)===void 0?me(a,void 0,n,i):k(a,i).name},Ue=(t,n,r)=>{if(t.text===`undefined`)return r.prelude.add(`Undefined`),`Undefined`;let i=s(t,r.checker),a=i===void 0?void 0:n.bindings.get(i);if(a!==void 0)return a;if(i!==void 0&&i===n.previous)return Ne(r.checker.getTypeAtLocation(t).getProperties().map(e=>({key:e.name,value:Be(e.name,t,r)})));let o=He(t,i,n,r);if(o!==void 0)return o;throw i!==void 0&&r.variables.has(i)?new e(`${t.text} can't be read here`,t):new e(`Unknown name: ${t.text}`,t)},We=(t,n,i)=>{if(t.questionDotToken!==void 0)throw new e(`Optional chaining isn't supported`,t);let a=He(t,s(t,i.checker),n,i);if(a!==void 0)return a;let o=t.expression,c=t.name.text;return n.previous!==void 0&&r.isIdentifier(o)&&s(o,i.checker)===n.previous?Be(c,t,i):(c===`length`||c===`size`?$e(o,n,i):void 0)??`${S(V(o,n,i))}.${c}`},Ge=(e,t,n)=>`${S(V(e.expression,t,n))}[${Ae(e,t,n)}]`,z=(t,n,r)=>{if(!I(t,r))throw new e(`Conditions must be booleans, so compare explicitly`,t);return V(t,n,r)},B=(e,t,n)=>{if(r.isParenthesizedExpression(e))return B(e.expression,t,n);if(r.isPrefixUnaryExpression(e)&&e.operator===r.SyntaxKind.ExclamationToken)return z(e.operand,t,n);if(r.isBinaryExpression(e)&&e.operatorToken.kind===r.SyntaxKind.BarBarToken){let r=B(e.left,t,n),i=B(e.right,t,n);return`${S(r)} /\\ ${S(i)}`}return`~${S(z(e,t,n))}`},V=(t,n,i,a=!1)=>{if(r.isParenthesizedExpression(t)||r.isAsExpression(t)||r.isSatisfiesExpression(t)||r.isTypeAssertionExpression(t))return V(t.expression,n,i,a);if(r.isNonNullExpression(t))return V(t.expression,n,i,!0);if(r.isNumericLiteral(t)){if(!Number.isInteger(Number(t.text)))throw new e(`Only integers are supported: ${t.text}`,t);return String(Number(t.text))}if(r.isStringLiteral(t)||r.isNoSubstitutionTemplateLiteral(t))return f(t.text,i);if(r.isTemplateExpression(t))return Re(t,n,i);if(t.kind===r.SyntaxKind.TrueKeyword)return`TRUE`;if(t.kind===r.SyntaxKind.FalseKeyword)return`FALSE`;if(t.kind===r.SyntaxKind.NullKeyword)return i.prelude.add(`Null`),`Null`;if(r.isIdentifier(t))return Ue(t,n,i);if(r.isPrefixUnaryExpression(t)&&t.operator===r.SyntaxKind.ExclamationToken){if(!I(t.operand,i))throw new e(`! needs a boolean, so compare explicitly`,t);return`~${S(V(t.operand,n,i))}`}if(r.isPrefixUnaryExpression(t)&&t.operator===r.SyntaxKind.MinusToken)return`-${S(V(t.operand,n,i))}`;if(r.isBinaryExpression(t))return ze(t,n,i);if(r.isConditionalExpression(t))return`IF ${z(t.condition,n,i)} THEN ${V(t.whenTrue,n,i)} ELSE ${V(t.whenFalse,n,i)}`;if(r.isArrayLiteralExpression(t))return je(t,n,i);if(r.isObjectLiteralExpression(t))return Pe(t,n,i);if(r.isPropertyAccessExpression(t))return We(t,n,i);if(r.isElementAccessExpression(t))return Ge(t,n,i);if(r.isCallExpression(t))return Ie(t,n,i,a);if(r.isNewExpression(t))return ft(t,n,i);throw new e(`Unsupported expression: ${t.getText()}`,t)},Ke=/* @__PURE__ */ new Set([`concat`,`with`,`filter`]),H=(t,n)=>{let r=d(t,n);if(r?.body===void 0)throw new e(`Pass a function here`,t);return{parameters:r.parameters,body:r.body}},U=(e,t,n)=>A(H(e,n).body,t,n),qe=(t,n,r)=>{if(H(t,r).parameters[1]!==void 0)throw new e(n,t)},W=(e,t,n)=>{let i=H(e,n).parameters[0];if(i===void 0)return{variable:n.names.getFresh(`element`),scope:t};if(!r.isIdentifier(i.name)){let e=n.names.getFresh(`element`);return{variable:e,scope:O(i.name,e,t,n)}}let a=n.names.getFresh(i.name.text),o=s(i.name,n.checker);return{variable:a,scope:E(t,[{name:a,symbol:o}])}},Je=(e,t,n,r,i)=>{let a=H(e,i).parameters,o=t===void 0||a[0]===void 0?r:O(a[0].name,t,r,i);return a[1]===void 0?o:O(a[1].name,`(${n} - 1)`,o,i)},Ye=(e,t)=>({set:m(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),isMapped:!0}),Xe=(e,t)=>({set:m(e,`map`,t,e=>{let n=t.names.getFresh(`key`);return`{<<${n}, ${e}[${n}]>> : ${n} \\in DOMAIN ${e}}`}),isMapped:!1}),Ze=(e,t)=>m(e,`sequence`,t,e=>{let n=t.names.getFresh(`index`);return`{${e}[${n}] : ${n} \\in DOMAIN ${e}}`}),G=(e,t,n)=>{let i=e=>V(e,t,n);if(r.isParenthesizedExpression(e))return G(e.expression,t,n);if(r.isArrayLiteralExpression(e)&&e.elements.length===1&&r.isSpreadElement(e.elements[0])){let r=e.elements[0].expression,a=F(r,n);return a===`set`?{set:i(r),isMapped:!1}:a===`map`?Xe(i(r),n):G(r,t,n)}if(!c(e))return;let a=e.expression.expression,o=e.expression.name.text;if(r.isIdentifier(a)&&a.text===`Object`){let t=i(e.arguments[0]);return o===`keys`?{set:`DOMAIN ${S(t)}`,isMapped:!1}:o===`values`?Ye(t,n):o===`entries`?Xe(t,n):void 0}let s=F(a,n);if(s===`set`&&(o===`values`||o===`keys`))return{set:i(a),isMapped:!1};if(s===`set`&&o===`entries`){let e=n.names.getFresh(`element`);return{set:`{<<${e}, ${e}>> : ${e} \\in ${S(i(a))}}`,isMapped:!1}}if(s===`map`&&o===`keys`)return{set:`DOMAIN ${S(i(a))}`,isMapped:!1};if(s===`map`&&o===`values`)return Ye(i(a),n);if(s===`map`&&o===`entries`)return Xe(i(a),n);if(o===`toArray`)return G(a,t,n);if(o!==`filter`&&o!==`map`)return;let l=G(a,t,n);if(l===void 0)return;let u=e.arguments[0];qe(u,`Elements of a set have no index`,n);let d=W(u,t,n),f=U(u,d.scope,n);return o===`filter`?{set:`{${d.variable} \\in ${S(l.set)} : ${f}}`,isMapped:l.isMapped}:{set:`{${f} : ${d.variable} \\in ${S(l.set)}}`,isMapped:!0}},Qe=(t,n,r)=>{let i=G(t,n,r);if(i!==void 0)return i.set;let a=F(t,r),o=V(t,n,r);if(a===`set`)return o;if(a!==`sequence`)throw new e(`Expected a Set or an array`,t);return Ze(o,r)},$e=(t,n,r)=>{let i=G(t,n,r);if(i?.isMapped)throw new e(`map() can merge equal elements, so count before mapping`,t.parent);if(i!==void 0)return`Cardinality(${i.set})`;let a=F(t,r),o=V(t,n,r);if(a===`sequence`||a===`string`)return`Len(${o})`;if(a===`set`)return`Cardinality(${o})`;if(a===`map`)return`Cardinality(DOMAIN ${S(o)})`},et=(t,n,i)=>{if(!c(t)||t.expression.name.text!==`map`)return;let a=t.expression.expression,o=G(a,n,i)?.set??(F(a,i)===`sequence`?Ze(V(a,n,i),i):void 0),s=t.arguments[0],l=H(s,i).parameters[0],u=(r.isArrowFunction(s)||r.isFunctionExpression(s))&&!r.isBlock(s.body)?s.body:void 0,d=u!==void 0&&r.isParenthesizedExpression(u)?u.expression:u,f=d!==void 0&&r.isArrayLiteralExpression(d)&&d.elements.length===2&&l!==void 0&&r.isIdentifier(l.name)&&r.isIdentifier(d.elements[0])&&d.elements[0].text===l.name.text;if(o===void 0||!f)throw new e(`Build a Map or record from a set with set.values().map((key) => [key, value])`,t);let p=W(s,n,i),m=V(d.elements[1],p.scope,i);return`[${p.variable} \\in ${o} |-> ${m}]`},tt=(t,n,i)=>{let a=t.expression.expression,o=t.expression.name.text,s=e=>S(V(e,n,i)),c=t.arguments[1],l=t.arguments[0];if(r.isIdentifier(a)&&a.text===`Array`&&o===`from`&&t.arguments.length===2&&r.isObjectLiteralExpression(l)){let a=l.properties.find(e=>e.name?.getText()===`length`);if(a===void 0||!r.isPropertyAssignment(a))throw new e(`Array.from needs { length: n }`,t);let o=i.names.getFresh(`index`),u=Je(c,void 0,o,n,i);return`[${o} \\in 1..${s(a.initializer)} |-> ${U(c,u,i)}]`}if(o!==`fill`||t.arguments.length!==1)return;let u=r.isNewExpression(a)||r.isCallExpression(a)?a:void 0,d=u!==void 0&&r.isIdentifier(u.expression)&&u.expression.text===`Array`&&u.arguments?.length===1?u.arguments[0]:void 0;if(d!==void 0)return`[${i.names.getFresh(`index`)} \\in 1..${s(d)} |-> ${V(t.arguments[0],n,i)}]`},nt=(e,t,n,r)=>{let i=i=>U(t,Je(t,`${S(e)}[${i}]`,i,n,r),r),a=r.names.getFresh(`index`),o=r.names.getFresh(`earlier`);return{exists:`\\E ${a} \\in DOMAIN ${S(e)} : ${i(a)}`,first:`CHOOSE ${a} \\in DOMAIN ${S(e)} : ${S(i(a))} /\\ \\A ${o} \\in 1..(${a} - 1) : ~${S(i(o))}`}},K=(e,t,n,r)=>n?t:(r.prelude.add(`Undefined`),`IF ${e} THEN ${t} ELSE Undefined`),rt=(t,n,i,a,o)=>{let s=t.expression.name.text,c=e=>V(e,i,a),l=t.arguments[0],u=S(n),d=e=>r.isPrefixUnaryExpression(e)&&e.operator===r.SyntaxKind.MinusToken,f=e=>d(e)?`Len(${n}) - ${S(c(e.operand))}`:c(e),p=e=>()=>{let t=a.names.getFresh(`index`),n=Je(l,`${u}[${t}]`,t,i,a);return e(t,U(l,n,a))},h=(/* @__PURE__ */ new Map([[`at`,()=>{let e=d(l)?`${f(l)} + 1`:`${S(c(l))} + 1`;return K(`${e} \\in DOMAIN ${u}`,`${u}[${e}]`,o,a)}],[`includes`,()=>{let e=a.names.getFresh(`index`);return`\\E ${e} \\in DOMAIN ${u} : ${u}[${e}] = ${S(c(l))}`}],[`indexOf`,()=>m(c(l),`value`,a,e=>{let t=a.names.getFresh(`index`),n=a.names.getFresh(`earlier`),r=`${u}[${t}] = ${e}`;return`IF \\E ${t} \\in DOMAIN ${u} : ${r} THEN (CHOOSE ${t} \\in DOMAIN ${u} : ${r} /\\ \\A ${n} \\in 1..(${t} - 1) : ${u}[${n}] # ${e}) - 1 ELSE -1`})],[`slice`,()=>{let e=l===void 0?`0`:f(l),r=t.arguments[1]===void 0?void 0:S(f(t.arguments[1])),i=r===void 0?`Len(${n})`:`IF ${r} < Len(${n}) THEN ${r} ELSE Len(${n})`;return`SubSeq(${n}, ${/^\d+$/.test(e)?String(Number(e)+1):`${S(e)} + 1`}, ${i})`}],[`concat`,()=>[n,...t.arguments.map(e=>F(e,a)===`sequence`?c(e):`<<${c(e)}>>`)].map(S).join(` \\o `)],[`with`,()=>`[${u} EXCEPT ![${S(c(l))} + 1] = ${C(c(t.arguments[1]))}]`],[`toReversed`,()=>{let e=a.names.getFresh(`index`);return`[${e} \\in DOMAIN ${u} |-> ${u}[Len(${n}) - ${e} + 1]]`}],[`map`,p((e,t)=>`[${e} \\in DOMAIN ${u} |-> ${t}]`)],[`every`,p((e,t)=>`\\A ${e} \\in DOMAIN ${u} : ${t}`)],[`some`,p((e,t)=>`\\E ${e} \\in DOMAIN ${u} : ${t}`)],[`filter`,()=>{qe(l,`filter() can't take an index`,a);let e=W(l,i,a);return`SelectSeq(${n}, LAMBDA ${e.variable} : ${U(l,e.scope,a)})`}],[`find`,()=>{let e=nt(n,l,i,a);return K(e.exists,`${u}[${e.first}]`,o,a)}],[`findIndex`,()=>{let e=nt(n,l,i,a);return`IF ${e.exists} THEN (${e.first}) - 1 ELSE -1`}]])).get(s);if(h===void 0)throw new e(`Unsupported array method: ${s}`,t);return h()},it=(t,n,r,i,a)=>{let o=t.expression.name.text,s=t.arguments[0];if(o===`includes`||o===`has`)return`${S(V(s,r,i))} \\in ${S(n.set)}`;if(o!==`every`&&o!==`some`&&o!==`find`)throw new e(`Unsupported method on a set's elements: ${o}`,t);qe(s,`Elements of a set have no index`,i);let c=W(s,r,i),l=U(s,c.scope,i),u=`${c.variable} \\in ${S(n.set)} : ${l}`;return o===`every`?`\\A ${u}`:o===`some`?`\\E ${u}`:K(`\\E ${u}`,`CHOOSE ${u}`,a,i)},at=(t,n,r)=>{let i=t.expression.name.text,a=S(V(t.expression.expression,n,r)),o=t.arguments[0]===void 0?``:S(V(t.arguments[0],n,r)),s=(/* @__PURE__ */ new Map([[`has`,`${o} \\in ${a}`],[`union`,`${a} \\cup ${o}`],[`intersection`,`${a} \\cap ${o}`],[`difference`,`${a} \\ ${o}`],[`symmetricDifference`,`(${a} \\ ${o}) \\cup (${o} \\ ${a})`],[`isSubsetOf`,`${a} \\subseteq ${o}`],[`isSupersetOf`,`${o} \\subseteq ${a}`],[`isDisjointFrom`,`${a} \\cap ${o} = {}`]])).get(i);if(s===void 0)throw new e(`Unsupported Set method: ${i}`,t);if(t.arguments[0]===void 0)throw new e(`Set method needs an argument: ${i}`,t);return s},ot=(t,n,r,i)=>{let a=t.expression.name.text,o=S(V(t.expression.expression,n,r)),s=t.arguments[0]===void 0?``:S(V(t.arguments[0],n,r));if(a!==`has`&&a!==`get`)throw new e(`Unsupported Map method: ${a}`,t);if(t.arguments[0]===void 0)throw new e(`Map method needs a key: ${a}`,t);return a===`has`?`${s} \\in DOMAIN ${o}`:i?`${o}[${s}]`:m(o,`map`,r,e=>m(s,`key`,r,t=>K(`${t} \\in DOMAIN ${e}`,`${e}[${t}]`,i,r)))},st={pop:e=>`SubSeq(${e}, 1, Len(${e}) - 1)`,shift:e=>`Tail(${e})`},ct=/* @__PURE__ */ new Map([[`sequence`,/* @__PURE__ */ new Map([[`push`,(e,t)=>t.length===1?`Append(${e}, ${t[0]})`:`${S(e)} \\o <<${t.join(`, `)}>>`],[`unshift`,(e,t)=>`<<${t.join(`, `)}>> \\o ${S(e)}`],[`pop`,st.pop],[`shift`,st.shift]])],[`set`,/* @__PURE__ */ new Map([[`add`,(e,t)=>`${S(e)} \\cup {${t[0]}}`],[`delete`,(e,t)=>`${S(e)} \\ {${t[0]}}`],[`clear`,()=>`{}`]])],[`map`,/* @__PURE__ */ new Map([[`set`,(e,t)=>`(${t[0]} :> ${t[1]}) @@ ${S(e)}`],[`delete`,(e,t,n)=>{let r=n.names.getFresh(`key`);return`[${r} \\in DOMAIN ${S(e)} \\ {${t[0]}} |-> ${S(e)}[${r}]]`}],[`clear`,()=>`<<>>`]])]]),lt=new Set([...ct.values()].flatMap(e=>[...e.keys()])),ut=(e,t,n,r,i)=>{let a=n.arguments.map(e=>V(e,r,i));return ct.get(t)?.get(n.expression.name.text)?.(e,a,i)},dt=(t,n,i,a)=>{let o=t.expression.expression,s=G(o,n,i);if(s!==void 0)return it(t,s,n,i,a);let c=r.isNewExpression(o)&&o.arguments?.length===1&&r.isIdentifier(o.expression)&&(o.expression.text===`Set`||o.expression.text===`Map`),l=F(o,i),u=c?ut(V(o,n,i),l,t,n,i):void 0;if(u!==void 0)return u;if(l===`sequence`){let e=t.expression.name.text,r=V(o,n,i),s=e=>rt(t,e,n,i,a);return Ke.has(e)?s(r):m(r,`sequence`,i,s)}if(l===`set`)return at(t,n,i);if(l===`map`)return ot(t,n,i,a);throw new e(`Unsupported call: ${t.expression.getText()}`,t)},ft=(t,n,i)=>{let a=t.expression.getText(),o=t.arguments?.[0];if(a===`Set`)return o===void 0?`{}`:r.isArrayLiteralExpression(o)&&!o.elements.some(r.isSpreadElement)?`{${o.elements.map(e=>V(e,n,i)).join(`, `)}}`:Qe(o,n,i);if(a!==`Map`)throw new e(`Unsupported constructor: new ${a}`,t);if(o===void 0)return`<<>>`;if(r.isArrayLiteralExpression(o))return o.elements.length===0?`<<>>`:o.elements.toReversed().map(t=>{if(!r.isArrayLiteralExpression(t)||t.elements.length!==2)throw new e(`Write each Map entry as [key, value]`,t);return`(${V(t.elements[0],n,i)} :> ${V(t.elements[1],n,i)})`}).join(` @@ `);if(F(o,i)===`map`)return V(o,n,i);let s=et(o,n,i);if(s===void 0)throw new e(`Unsupported constructor: new ${a}`,t);return s},pt=/* @__PURE__ */ new Map([[r.SyntaxKind.PlusEqualsToken,`+`],[r.SyntaxKind.MinusEqualsToken,`-`],[r.SyntaxKind.AsteriskEqualsToken,`*`]]),mt=/* @__PURE__ */ new Map([[r.SyntaxKind.PlusPlusToken,`+`],[r.SyntaxKind.MinusMinusToken,`-`]]),q=(t,n,i)=>{if(r.isParenthesizedExpression(t)||r.isNonNullExpression(t))return q(t.expression,n,i);if(r.isIdentifier(t)){let r=s(t,i.checker),a=r===void 0?void 0:n.scope.bindings.get(r);if(r===void 0||a===void 0||!n.mutable.has(r))throw new e(`Only state variables and local lets can change: ${t.text}`,t);return{symbol:r,current:a,selector:``}}if(r.isPropertyAccessExpression(t)){if(F(t.expression,i)!==`other`)throw new e(`Can't assign to ${t.getText()}`,t);let r=q(t.expression,n,i);return{...r,selector:`${r.selector}.${t.name.text}`}}if(r.isElementAccessExpression(t)){let e=q(t.expression,n,i),r=Ae(t,n.scope,i);return{...e,selector:`${e.selector}[${r}]`}}if(c(t)&&t.expression.name.text===`get`&&t.arguments.length===1&&F(t.expression.expression,i)===`map`){let e=q(t.expression.expression,n,i),r=V(t.arguments[0],n.scope,i);return{...e,selector:`${e.selector}[${r}]`}}throw new e(`Can't assign to ${t.getText()}`,t)},J=(e,t,n,r)=>{let i=q(e,t,n),a=i.selector===``?r(i.current):`[${S(i.current)} EXCEPT !${i.selector} = ${C(r(`@`))}]`;return{scope:{...t.scope,bindings:new Map([...t.scope.bindings,[i.symbol,a]])},mutable:t.mutable,isAssigned:t.isAssigned||n.variables.has(i.symbol)}},Y=(t,n,i,a,o)=>r.isArrayLiteralExpression(t)?t.elements.reduce((t,s,c)=>{if(r.isOmittedExpression(s))return t;if(r.isSpreadElement(s))throw new e(`Rest elements can't be assigned`,s);let l=n!==void 0&&r.isArrayLiteralExpression(n)?n.elements[c]:void 0;return l!==void 0&&!r.isSpreadElement(l)?Y(s,l,V(l,a.scope,o),t,o):Y(s,void 0,`${S(i)}[${c+1}]`,t,o)},a):r.isObjectLiteralExpression(t)?t.properties.reduce((t,n)=>{if(r.isShorthandPropertyAssignment(n))return Y(n.name,void 0,`${S(i)}.${n.name.text}`,t,o);if(r.isPropertyAssignment(n)&&r.isIdentifier(n.name))return Y(n.initializer,void 0,`${S(i)}.${n.name.text}`,t,o);throw new e(`Can't assign to ${n.getText()}`,n)},a):J(t,a,o,()=>i),ht=(e,t,n)=>{if(r.isNonNullExpression(e)||r.isParenthesizedExpression(e))return ht(e.expression,t,n);if(!c(e))return;let i=e.expression.name.text;if(i!==`shift`&&i!==`pop`)return;let a=e.expression.expression;if(F(a,n)!==`sequence`)return;let o=V(a,t.scope,n);return{value:i===`shift`?`Head(${o})`:`${S(o)}[Len(${o})]`,path:J(a,t,n,st[i])}},gt=(e,t,n)=>{if(r.isPostfixUnaryExpression(e)||r.isPrefixUnaryExpression(e)){let r=mt.get(e.operator);return r===void 0?void 0:J(e.operand,t,n,e=>`${S(e)} ${r} 1`)}if(!r.isBinaryExpression(e))return;let i=e.operatorToken.kind;if(i===r.SyntaxKind.EqualsToken){let r=V(e.right,t.scope,n);return Y(e.left,e.right,r,t,n)}let a=i===r.SyntaxKind.PlusEqualsToken&&F(e.left,n)===`string`?`\\o`:pt.get(i);if(a===void 0)return;let o=S(V(e.right,t.scope,n));return J(e.left,t,n,e=>`${S(e)} ${a} ${o}`)},_t=(t,n,i,a,o)=>{let d=t.arguments.map(e=>V(e,n.scope,i));if(c(t)){let r=t.expression.expression,a=t.expression.name.text,s=r.getText()===`console`;if(s&&a===`log`){let e=d.length===1?d[0]:`<<${d.join(`, `)}>>`;return _([g(`PrintT(${e})`),o(n)])}if(s&&a===`assert`){let e=d[1]??JSON.stringify(`Assertion failed`);return _([g(`Assert(${d[0]}, ${e})`),o(n)])}if(lt.has(a)){let s=F(r,i);return o(J(r,n,i,r=>{let o=ut(r,s,t,n.scope,i);if(o===void 0)throw new e(`Unsupported method: ${a}`,t);return o}))}}let f=l(s(t.expression,i.checker)),p=u(f);if(f===void 0||p?.body===void 0)throw new e(`Unsupported statement: ${t.getText()}`,t);if(a.inlining.has(f))throw new e(`Helpers that change state can't call themselves`,t);let m=ce(p.parameters.map(e=>e.name),d,n.scope,i),h=r.isBlock(p.body)?p.body.statements:[r.factory.createExpressionStatement(p.body)],v=e=>o({...e,scope:{...e.scope,previous:n.scope.previous}});return y(m.definitions,X(h,{...n,scope:m.scope},i,{next:v,exit:v,breakTo:void 0,inlining:/* @__PURE__ */ new Set([...a.inlining,f])}))},vt=(t,n,i,a,o)=>{if(r.isParenthesizedExpression(t))return vt(t.expression,n,i,a,o);if(r.isCallExpression(t))return _t(t,n,i,a,o);let s=gt(t,n,i);if(s===void 0)throw new e(`Unsupported statement: ${t.getText()}`,t);return o(s)},yt=(t,n,i,a)=>{if(t.length===0)return a(n);let o=t[0],c=t.slice(1);if(o.initializer===void 0)throw new e(`Declare locals with a value`,o);if(u(o.initializer)!==void 0)return yt(c,n,i,a);let l=ht(o.initializer,n,i),d=l?.value??V(o.initializer,n.scope,i),f=l?.path??n,p=se(o.name,d,f.scope,i),m=r.isIdentifier(o.name)?s(o.name,i.checker):void 0,h=(o.parent.flags&r.NodeFlags.Let)!==0&&m!==void 0?/* @__PURE__ */ new Set([...n.mutable,m]):n.mutable;return y(p.definitions,yt(c,{...f,scope:p.scope,mutable:h},i,a))},X=(t,n,i,a)=>{if(t.length===0)return a.next(n);let o=t[0],s=e=>X(t.slice(1),e,i,a);if(r.isBlock(o))return X(o.statements,n,i,{...a,next:s});if(r.isEmptyStatement(o))return s(n);if(r.isVariableStatement(o))return yt(o.declarationList.declarations,n,i,s);if(r.isIfStatement(o))return _e(o,n.scope,i,e=>X([e],n,i,{...a,next:s}),()=>s(n));if(r.isReturnStatement(o)){if(o.expression!==void 0)throw new e(`Actions can't return a value`,o);return a.exit(n)}if(r.isBreakStatement(o)){if(a.breakTo===void 0)throw new e(`Unsupported break`,o);return a.breakTo(n)}if(r.isThrowStatement(o))return g(ge(o,n.scope,i));if(r.isSwitchStatement(o))return ve(o,n.scope,i,e=>X(e,n,i,{...a,next:s,breakTo:s}),()=>s(n));if(r.isExpressionStatement(o))return vt(o.expression,n,i,a,s);throw r.isIterationStatement(o,!1)?new e(`Loops aren't supported. Use map(), filter(), every(), some(), or a parameter`,o):new e(`Unsupported statement: ${o.getText()}`,o)},bt=(e,t,n)=>{let r=e=>{if(!e.isAssigned)return h;let t=[...n.variables].map(t=>({name:t[1],value:e.scope.bindings.get(t[0])??t[1]})),r=t.filter(e=>e.value===e.name);return _([...t.filter(e=>e.value!==e.name).map(e=>g(`${e.name}' = ${C(e.value)}`)),...r.length>0?[g(`UNCHANGED <<${r.map(e=>e.name).join(`, `)}>>`)]:[]])};return X(e,{scope:t,mutable:new Set(n.variables.keys()),isAssigned:!1},n,{next:r,exit:r,breakTo:void 0,inlining:/* @__PURE__ */ new Set})},xt=e=>c(e)&&e.expression.name.text===`get`?xt(e.expression.expression):r.isPropertyAccessExpression(e)||r.isElementAccessExpression(e)||r.isParenthesizedExpression(e)||r.isNonNullExpression(e)?xt(e.expression):e,St=(e,t,n=/* @__PURE__ */ new Set)=>{let i=e=>{let n=xt(e),i=r.isIdentifier(n)?s(n,t.checker):void 0;return i!==void 0&&t.variables.has(i)},a=r.isBinaryExpression(e)&&e.operatorToken.kind>=r.SyntaxKind.FirstAssignment&&e.operatorToken.kind<=r.SyntaxKind.LastAssignment&&i(e.left),o=(r.isPostfixUnaryExpression(e)||r.isPrefixUnaryExpression(e))&&mt.has(e.operator)&&i(e.operand),u=c(e)&<.has(e.expression.name.text)&&i(e.expression.expression);if(a||o||u)return!0;if(r.isCallExpression(e)){let r=l(s(e.expression,t.checker));if(r!==void 0&&!n.has(r)&&(n.add(r),St(r,t,n)))return!0}return r.forEachChild(e,e=>St(e,t,n)||void 0)??!1},Ct=()=>({init:[],actions:[],next:[],fairness:[],predicates:[],temporal:[],invariants:[],properties:[],constraints:[],actionConstraints:[],views:[],postconditions:[],assumptions:[]}),wt=e=>e.length===1?` ${e[0]}`:`\n${e.map(e=>` /\\ ${e}`).join(`
|
|
16
|
+
`)}`,Tt=e=>e.length===0?` FALSE`:e.length===1?` ${e[0]}`:`\n${e.map(e=>` \\/ ${e}`).join(`
|
|
17
|
+
`)}`,Z=(e,t)=>t.length>0?[`${e} ${t.join(` `)}`]:[],Et=(t,n,r,i)=>{if(r.views.length>1)throw new e(`Tag only one function @view`);let a=[...i.recursive].map(t=>{let n=i.definitions.get(t);if(n===void 0||n.parameters.length===0)throw new e(`A constant can't refer to itself`,t);return`${n.name}(${n.parameters.map(()=>`_`).join(`, `)})`}),o=i.prelude,s=[...o.has(`Null`)?[`Null`]:[],...o.has(`Undefined`)?[`Undefined`]:[],...i.modelValues.values()],c=n.variables.map(e=>e.name),l=n.symmetrySets;return{name:t,source:[`---- MODULE ${t} ----`,`EXTENDS Integers, Sequences, FiniteSets, TLC`,...s.length>0?[`CONSTANTS ${s.join(`, `)}`]:[],...c.length>0?[`VARIABLES ${c.join(`, `)}`]:[],`vars == <<${c.join(`, `)}>>`,...a.length>0?[`RECURSIVE ${a.join(`, `)}`]:[],...o.has(`Rem`)?[`Rem(a, b) ==
|
|
18
18
|
LET m == IF b < 0 THEN -b ELSE b
|
|
19
19
|
IN IF a >= 0 THEN a % m ELSE -((-a) % m)`]:[],...o.has(`Quot`)?[`Quot(a, b) ==
|
|
20
20
|
LET q == (IF a < 0 THEN -a ELSE a) \\div (IF b < 0 THEN -b ELSE b)
|
|
21
|
-
IN IF (a < 0) = (b < 0) THEN q ELSE -q`]:[],...i.output,`Init ==${
|
|
22
|
-
`),config:[`SPECIFICATION Spec`,...s.length>0?[`CONSTANTS`,...s.map(e=>` ${e} = ${e}`)]:[],...
|
|
23
|
-
`)}},
|
|
21
|
+
IN IF (a < 0) = (b < 0) THEN q ELSE -q`]:[],...i.output,`Init ==${wt(r.init.length>0?r.init:[`TRUE`])}`,...r.actions,`Next ==${Tt(r.next)}`,`Spec ==${wt([`Init`,`[][Next]_vars`,...r.fairness])}`,...r.predicates,...r.temporal,...r.assumptions.map(e=>`ASSUME ${e}`),...l.length>0?[`Perms == ${l.map(e=>`Permutations(${e})`).join(` \\cup `)}`]:[],`====`].join(`
|
|
22
|
+
`),config:[`SPECIFICATION Spec`,...s.length>0?[`CONSTANTS`,...s.map(e=>` ${e} = ${e}`)]:[],...Z(`INVARIANTS`,r.invariants),...Z(`PROPERTIES`,r.properties),...Z(`CONSTRAINTS`,r.constraints),...Z(`ACTION_CONSTRAINTS`,r.actionConstraints),...Z(`VIEW`,r.views),...Z(`POSTCONDITIONS`,r.postconditions),...l.length>0?[`SYMMETRY Perms`]:[],...n.isDeadlockChecked?[]:[`CHECK_DEADLOCK FALSE`]].join(`
|
|
23
|
+
`)}},Q=/* @__PURE__ */ new Map([[`eventually`,`<>`],[`alwaysEventually`,`[]<>`],[`eventuallyAlways`,`<>[]`]]),Dt=/* @__PURE__ */ new Map([[`constraint`,`constraints`],[`actionConstraint`,`actionConstraints`],[`view`,`views`],[`postcondition`,`postconditions`],[`assume`,`assumptions`]]),Ot=/* @__PURE__ */ new Set([...Q.keys(),...Dt.keys(),`initially`,`always`,`leadsTo`,`terminating`]),kt=(t,n)=>{let i=t.node.parameters;if(i.length===0)return T(n);if(i.length>1||!r.isIdentifier(i[0].name))throw new e(`Take the state before the step as one parameter`,i[0]);return{bindings:new Map([...n.variables].map(e=>[e[0],`${e[1]}'`])),previous:s(i[0].name,n.checker)}},At=(t,n,r,i)=>{let a=(t.tags.get(`leadsTo`)??``).split(/\s/)[0],o=r.topLevel.get(a);if(o===void 0)throw new e(`@leadsTo names an unknown function: ${a}`,t.node);let s=r.exported.find(e=>e.declaration===o);if(s!==void 0)return s.name;let c=k(o,i),l=n.slice(0,c.parameters.length);return l.length===0?c.name:`${c.name}(${l.join(`, `)})`},jt=(t,n,r,i,a)=>{let o=t.name,s=t.node,c=n===`always`||n===`actionConstraint`,l=Q.has(n)||n===`leadsTo`;if(!c&&!l&&s.parameters.length>0)throw new e(`@${n} functions can't take parameters`,s.parameters[0]);let u=(l?s.parameters:[]).map(e=>({...oe(e,a),domain:Ee(a.checker.getTypeAtLocation(e.name),e,a)})),d=c?kt(t,a):E(T(a),u),f=u.length===0?``:`\\A ${u.map(e=>`${e.name} \\in ${e.domain}`).join(`, `)} : `,p=w(A(t.body,d,a),` `),m=Q.get(n),h=Dt.get(n);if(m!==void 0&&(i.temporal.push(`${o} ==\n ${f}${m}(${p})`),i.properties.push(o)),n===`leadsTo`){let e=u.map(e=>e.name),n=At(t,e,r,a);i.temporal.push(`${o} ==\n ${f}(${p}) ~> ${n}`),i.properties.push(o)}n===`always`&&(i.temporal.push(s.parameters.length===0?`${o} ==\n [](${p})`:`${o} ==\n [][${p}]_vars`),i.properties.push(o)),n===`terminating`&&(i.actions.push(`${o} ==\n ${p}`),i.next.push(`${o} /\\ UNCHANGED vars`)),n===`initially`&&i.init.push(p),h!==void 0&&(i.predicates.push(`${o} ==\n ${p}`),i[h].push(o))},Mt=(t,n,i)=>{let a=t.node.parameters;if(a.length>0)throw new e(`Invariants can't take parameters`,a[0]);let o=t.body,s=T(i),c=r.isBlock(o)?A(o,s,i):z(o,s,i);n.predicates.push(`${t.name} ==\n ${w(c,` `)}`),n.invariants.push(t.name)},Nt=/* @__PURE__ */ new Set([...Ot,`fair`,`strongFair`,`symmetric`,`noDeadlock`,`param`,`returns`,`return`,`example`,`see`,`deprecated`,`remarks`,`throws`,`link`,`description`]),Pt=t=>new Map(r.getJSDocTags(t).map(t=>{if(!Nt.has(t.tagName.text))throw new e(`Unknown tag: @${t.tagName.text}`,t);return[t.tagName.text,r.getTextOfJSDocComment(t.comment)?.trim()??``]})),Ft=e=>(r.getCombinedModifierFlags(e)&r.ModifierFlags.Export)!==0,It=e=>r.isVariableDeclaration(e)&&(e.parent.flags&r.NodeFlags.Let)!==0,Lt=(t,n)=>{let r=n.checker.getTypeAtLocation(t.name);return`{${(r.isUnion()?r.types:[r]).map(r=>{if(!r.isStringLiteral())throw new e(`A @symmetric type must be a union of strings`,t);let i=n.names.getFresh(r.value);if(i!==r.value)throw new e(`"${r.value}" can't name a TLA+ model value`,t);return n.modelValues.set(r.value,i),i}).join(`, `)}}`},Rt=t=>{if(r.isImportDeclaration(t)||r.isTypeAliasDeclaration(t)||r.isInterfaceDeclaration(t)||r.isEnumDeclaration(t)||r.isExportDeclaration(t)&&t.isTypeOnly)return[];if(r.isFunctionDeclaration(t)&&t.name!==void 0&&t.body)return[{name:t.name.text,declaration:t}];if(!r.isVariableStatement(t))throw new e(`Unsupported statement: ${t.getText()}`,t);let n=t.declarationList.flags;return t.declarationList.declarations.map(t=>{if(!r.isIdentifier(t.name))throw new e(`Declare one name at a time`,t);if((n&(r.NodeFlags.Let|r.NodeFlags.Const))===0)throw new e(`Use let for state and const for everything else`,t);return{name:t.name.text,declaration:t}})},zt=(t,n)=>{let i=t.statements,a=new Map(i.map(e=>[e,Pt(e)])),o=i.filter(e=>r.isTypeAliasDeclaration(e)&&a.get(e)?.has(`symmetric`)===!0).map(e=>Lt(e,n)),c=i.flatMap(Rt),l=c.flatMap(t=>{let r=t.declaration;if(!It(r))return[];let i=s(r.name,n.checker);if(Ft(r)||i===void 0)throw new e(`State variables can't be exported`,r);let a=n.names.getFresh(t.name);return n.variables.set(i,a),[{name:a,declaration:r}]}),d=c.filter(e=>!It(e.declaration));return{variables:l,exported:d.flatMap(e=>{let t=e.declaration,i=u(t);if(!Ft(t)||i?.body===void 0)return[];let o=r.isVariableDeclaration(t)?t.parent.parent:t;return[{name:n.names.getFresh(e.name),declaration:t,node:i,body:i.body,tags:a.get(o)??/* @__PURE__ */ new Map}]}),topLevel:new Map(d.map(e=>[e.name,e.declaration])),symmetrySets:o,isDeadlockChecked:![...a.values()].some(e=>e.has(`noDeadlock`))}},$={strict:!0,noEmit:!0,target:r.ScriptTarget.ESNext,module:r.ModuleKind.ESNext,moduleResolution:r.ModuleResolutionKind.Bundler,moduleDetection:r.ModuleDetectionKind.Force,allowImportingTsExtensions:!0,resolveJsonModule:!0,skipLibCheck:!0,lib:[`lib.esnext.d.ts`],types:[]},Bt=n(r.getDefaultLibFilePath($)),Vt=/* @__PURE__ */ new Map,Ht=(t,n)=>{let i=r.createSourceFile(n,t,r.ScriptTarget.ESNext,!0),a=r.createCompilerHost($),o=r.createProgram({rootNames:[n],options:$,host:{...a,getSourceFile:(e,t)=>{if(e===n)return i;let r=Vt.get(e);if(r!==void 0)return r;let o=a.getSourceFile(e,t);return o!==void 0&&e.startsWith(Bt)&&Vt.set(e,o),o},fileExists:e=>e===n||a.fileExists(e),readFile:e=>e===n?t:a.readFile(e)}}),s=r.getPreEmitDiagnostics(o);if(s.length>0)throw new e(r.formatDiagnostics(s,a));return{sourceFile:i,checker:o.getTypeChecker()}},Ut=e=>r.isReturnStatement(e)?e.expression===void 0:r.isBlock(e)&&e.statements.length===1&&Ut(e.statements[0]),Wt=(e,t,n,i)=>{if(!r.isIfStatement(e)||e.elseStatement!==void 0||!Ut(e.thenStatement))return;let a=e.expression;if(!r.isPrefixUnaryExpression(a)||a.operator!==r.SyntaxKind.ExclamationToken)return;let o=r.isParenthesizedExpression(a.operand)?a.operand.expression:a.operand;if(!c(o)||o.expression.name.text!==`has`||o.arguments.length!==1)return;let l=e=>[...t.filter(t=>r.isIdentifier(e)&&t.symbol===s(e,i.checker)),...e.getChildren().flatMap(l)],u=o.arguments[0],d=t.find(e=>e.symbol===s(u,i.checker)),f=o.expression.expression,p=l(f);if(d!==void 0&&!n.has(d)&&p.every(e=>n.has(e))&&Se(f,i))return{parameter:d,set:f,isDependent:p.length>0}},Gt=(e,t,n,r)=>{let i=e.length===0?void 0:Wt(e[0],t,n,r);if(i===void 0)return{chosen:n,remaining:e};let a=E(T(r),[...n.keys()]),o=V(i.set,a,r);return Gt(e.slice(1),t,new Map([...n,[i.parameter,{domain:o,isDependent:i.isDependent}]]),r)},Kt=(e,t,n)=>{let i=e.name,a=e.body,o=D(e.node.parameters,n),s=Gt(r.isBlock(a)?a.statements:[r.factory.createExpressionStatement(a)],o,/* @__PURE__ */ new Map,n),c=bt(s.remaining,E(T(n),o),n),l=o.length===0?i:`${i}(${o.map(e=>e.name).join(`, `)})`;t.actions.push(`${l} ==\n ${w(ee(c),` `)}`);let u=e.tags.has(`strongFair`)?`SF_vars`:e.tags.has(`fair`)?`WF_vars`:void 0;if(o.length===0){t.next.push(i),u!==void 0&&t.fairness.push(`${u}(${i})`);return}let d=e=>n.checker.getTypeAtLocation(e.node.name),f=o.map(e=>{let t=s.chosen.get(e);return{parameter:e,chosen:t,domain:t?.domain??Ee(d(e),e.node,n)}}),p=f.flatMap(e=>e.chosen?.isDependent===!0?[]:[`${e.parameter.name} \\in ${e.domain}`]),m=[...s.chosen].filter(e=>e[1].isDependent).map(e=>`\\E ${e[0].name} \\in ${e[1].domain} : `),h=`\\E ${p.join(`, `)} : ${m.join(``)}${l}`;if(t.next.push(h),u===void 0)return;let g=f.map(e=>{let t=e.chosen===void 0?e.domain:Te(d(e.parameter),n);return typeof t==`string`?`${e.parameter.name} \\in ${t}`:void 0});if(!g.every(e=>e!==void 0)){t.fairness.push(`${u}(${h})`);return}let _=f.flatMap(e=>e.chosen===void 0?[]:[`${e.parameter.name} \\in ${S(e.domain)}`]);t.fairness.push(`\\A ${g.join(`, `)} : ${u}(${[..._,l].join(` /\\ `)})`)},qt=(e,t)=>{let n=e.declaration.initializer;if(n===void 0){let n=t.checker.getTypeAtLocation(e.declaration.name);return`${e.name} \\in ${Ee(n,e.declaration,t)}`}let r=A(n,T(t),t);return`${e.name} = ${w(C(r),` `)}`},Jt=(t,n,i,a)=>{let o=[...t.tags.keys()].find(e=>Ot.has(e));if(o!==void 0)return jt(t,o,n,i,a);let s=a.checker.getSignatureFromDeclaration(t.node)?.getReturnType();if(St(t.body,a)||s===void 0||(s.flags&(r.TypeFlags.Void|r.TypeFlags.Undefined))!==0)return Kt(t,i,a);if(!(s.flags&r.TypeFlags.BooleanLike))throw new e(`An exported function that returns a value must return a boolean, or be tagged, such as @view`,t.node);return Mt(t,i,a)},Yt=(e,n=`spec.ts`)=>{let r=Ht(e,n.replaceAll(`\\`,`/`)),i=o(r.checker),a=zt(r.sourceFile,i),s=Ct();s.init.push(...a.variables.map(e=>qt(e,i)));for(let e of a.exported)Jt(e,a,s,i);let c=t(n,`.ts`).split(/[^A-Za-z0-9]+/).map(e=>e.charAt(0).toUpperCase()+e.slice(1)).join(``);return Et(c,a,s,i)};export{Yt as compile};
|