From a07c6992b715080e09e4ad4c861711063dabfa87 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Sat, 7 Nov 2026 17:41:02 +0100 Subject: [PATCH 01/32] heyvl: allow omitted else blocks in conditionals --- src/front/parser/grammar.lalrpop | 5 ++++- src/front/parser/precedence_update/grammar_old.lalrpop | 5 ++++- src/vc/vcgen.rs | 9 ++++++--- website/docs/heyvl/statements.md | 5 +++-- 4 files changed, 17 insertions(+), 7 deletions(-) diff --git a/src/front/parser/grammar.lalrpop b/src/front/parser/grammar.lalrpop index 86e59680..7aeb9359 100644 --- a/src/front/parser/grammar.lalrpop +++ b/src/front/parser/grammar.lalrpop @@ -230,7 +230,10 @@ StmtKind: StmtKind = { "if" SymOplus "else" => StmtKind::Additive(block1, block2), "if" SymCap "else" => StmtKind::Demonic(block1, block2), "if" SymCup "else" => StmtKind::Angelic(block1, block2), - "if" "else" => StmtKind::If(cond, block1, block2), + "if" )?> => { + let block2 = block2.unwrap_or_else(|| spanned(file, block1.span.end, block1.span.end, vec![])); + StmtKind::If(cond, block1, block2) + }, "while" => StmtKind::While(cond, block1), "@" => StmtKind::Annotation(span(file, l, r), ident, inputs.unwrap_or_default(), Box::new(stmt)), "label" => StmtKind::Label(ident), diff --git a/src/front/parser/precedence_update/grammar_old.lalrpop b/src/front/parser/precedence_update/grammar_old.lalrpop index c944a465..f3b13885 100644 --- a/src/front/parser/precedence_update/grammar_old.lalrpop +++ b/src/front/parser/precedence_update/grammar_old.lalrpop @@ -216,7 +216,10 @@ StmtKind: StmtKind = { "if" SymOplus "else" => StmtKind::Additive(block1, block2), "if" SymCap "else" => StmtKind::Demonic(block1, block2), "if" SymCup "else" => StmtKind::Angelic(block1, block2), - "if" "else" => StmtKind::If(cond, block1, block2), + "if" )?> => { + let block2 = block2.unwrap_or_else(|| spanned(file, block1.span.end, block1.span.end, vec![])); + StmtKind::If(cond, block1, block2) + }, "while" => StmtKind::While(cond, block1), "@" => StmtKind::Annotation(span(file, l, r), ident, inputs.unwrap_or_default(), Box::new(stmt)), "label" => StmtKind::Label(ident), diff --git a/src/vc/vcgen.rs b/src/vc/vcgen.rs index 84787e9b..74b8caf8 100644 --- a/src/vc/vcgen.rs +++ b/src/vc/vcgen.rs @@ -42,9 +42,12 @@ impl<'tcx> Vcgen<'tcx> { pub fn vcgen_block(&mut self, block: &Block, post: Expr) -> Result { let prev_block_span = if let Some(ref mut explanation) = self.explanation { let prev_block_span = explanation.set_block_span(Some(block.span)); - let mut end_span = block.span; - end_span.start = end_span.end - 1; - explanation.add_expr(end_span, post.clone(), true); + // Zero-width spans have no closing brace to explain. + if block.span.start < block.span.end { + let mut end_span = block.span; + end_span.start = end_span.end - 1; + explanation.add_expr(end_span, post.clone(), true); + } prev_block_span } else { None diff --git a/website/docs/heyvl/statements.md b/website/docs/heyvl/statements.md index 228f1b62..4a8a52d0 100644 --- a/website/docs/heyvl/statements.md +++ b/website/docs/heyvl/statements.md @@ -162,10 +162,11 @@ This decrements `x` if it is positive: ```heyvl if x > 0 { x = x - 1 -} else {} +} ``` -The `else` block is required, but may be empty. +The `else` block is optional. +Omitting it is equivalent to writing `else {}`. ### While Loops From c88495d56b69b83f9a7c5aba42692c5191bb9548 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 10:47:38 +0100 Subject: [PATCH 02/32] z3rro: fix solver result cache invalidation --- z3rro/src/prover.rs | 38 +++++++++++++++++++++++--------------- 1 file changed, 23 insertions(+), 15 deletions(-) diff --git a/z3rro/src/prover.rs b/z3rro/src/prover.rs index bca62be1..9b7fa5cd 100644 --- a/z3rro/src/prover.rs +++ b/z3rro/src/prover.rs @@ -50,6 +50,8 @@ enum StackSolver<'ctx> { #[derive(Debug)] struct LastSatResult { + /// Whether the last check used temporary assumptions, so its result cannot be reused for an assumption-free check. + has_assumptions: bool, /// Whether the current model is consistent with the assertions. If the SMT /// solver returned [`SatResult::Unknown`], it is /// [`ModelConsistency::Unknown`]. @@ -125,6 +127,13 @@ impl<'ctx> Prover<'ctx> { pub fn set_timeout(&mut self, duration: Duration) { self.timeout = Some(duration); set_solver_timeout(self.get_solver(), duration); + if self + .last_result + .as_ref() + .is_some_and(|result| result.last_result == SatResult::Unknown) + { + self.last_result = None; + } } /// Add an assumption to this prover. @@ -164,18 +173,12 @@ impl<'ctx> Prover<'ctx> { return ProveResult::Proof; } - let res = match &self.last_result { - Some(cached_result) if assumptions.is_empty() => cached_result.last_result, - _ => { - let solver = self.get_solver(); - let res = if assumptions.is_empty() { - solver.check() - } else { - solver.check_assumptions(assumptions) - }; - self.cache_result(res); - res - } + let res = if assumptions.is_empty() { + self.check_sat() + } else { + let res = self.get_solver().check_assumptions(assumptions); + self.cache_result(res, true); + res }; match res { SatResult::Unsat => ProveResult::Proof, @@ -194,22 +197,27 @@ impl<'ctx> Prover<'ctx> { /// Do the regular SAT check. pub fn check_sat(&mut self) -> SatResult { - if let Some(cached_result) = &self.last_result { + if let Some(cached_result) = self + .last_result + .as_ref() + .filter(|result| !result.has_assumptions) + { return cached_result.last_result; } let res = self.get_solver().check(); - self.cache_result(res); + self.cache_result(res, false); res } /// Save the result of the last SAT/proof check. - fn cache_result(&mut self, sat_result: SatResult) { + fn cache_result(&mut self, sat_result: SatResult, has_assumptions: bool) { let model_consistency = match sat_result { SatResult::Sat => Some(ModelConsistency::Consistent), SatResult::Unknown => Some(ModelConsistency::Unknown), SatResult::Unsat => None, }; self.last_result = Some(LastSatResult { + has_assumptions, model_consistency, last_result: sat_result, }); From acbcf2c405d0cc3bea5bd1558ddeea1594433d21 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 10:47:38 +0100 Subject: [PATCH 03/32] z3rro: remove trailing newlines from quantifier IDs --- z3rro/src/quantifiers.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/z3rro/src/quantifiers.rs b/z3rro/src/quantifiers.rs index 1065d4d7..2392514a 100644 --- a/z3rro/src/quantifiers.rs +++ b/z3rro/src/quantifiers.rs @@ -67,7 +67,7 @@ impl<'ctx> QuantifierMeta<'ctx> { } qid.push_str(&self.user_name); if let Some(ref variant) = self.variant { - writeln!(&mut qid, "_{variant}").unwrap(); + write!(&mut qid, "_{variant}").unwrap(); } qid } From 6d780d8ea0a53ded2e6d5bcf32aad805a48f2771 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 12:07:20 +0100 Subject: [PATCH 04/32] z3rro: separate solver sessions from proof obligations --- src/driver/smt_proof.rs | 3 +- src/opt/fuzz_test.rs | 5 +- src/opt/unfolder.rs | 48 ++--- src/slicing/solver.rs | 272 ++++++++++++--------------- src/slicing/transform_test.rs | 3 +- z3rro/src/lib.rs | 1 + z3rro/src/prover.rs | 345 +++++++--------------------------- z3rro/src/scope.rs | 8 + z3rro/src/solver.rs | 298 +++++++++++++++++++++++++++++ z3rro/src/test.rs | 15 +- 10 files changed, 530 insertions(+), 468 deletions(-) create mode 100644 z3rro/src/solver.rs diff --git a/src/driver/smt_proof.rs b/src/driver/smt_proof.rs index 3e687f87..c8fc1887 100644 --- a/src/driver/smt_proof.rs +++ b/src/driver/smt_proof.rs @@ -15,8 +15,9 @@ use z3rro::quantifiers::QuantifierMeta; use z3rro::{ model::InstrumentedModel, probes::ProbeSummary, - prover::{IncrementalMode, ProveResult, Prover}, + prover::{ProveResult, Prover}, smtlib::Smtlib, + solver::IncrementalMode, util::{PrefixWriter, ReasonUnknown}, }; diff --git a/src/opt/fuzz_test.rs b/src/opt/fuzz_test.rs index e987de41..ffc1865a 100644 --- a/src/opt/fuzz_test.rs +++ b/src/opt/fuzz_test.rs @@ -2,7 +2,10 @@ use proptest::{ prelude::*, test_runner::{TestCaseResult, TestRunner}, }; -use z3rro::prover::{IncrementalMode, ProveResult, Prover}; +use z3rro::{ + prover::{ProveResult, Prover}, + solver::IncrementalMode, +}; use crate::{ ast::{ diff --git a/src/opt/unfolder.rs b/src/opt/unfolder.rs index a595e346..fb70b145 100644 --- a/src/opt/unfolder.rs +++ b/src/opt/unfolder.rs @@ -25,7 +25,7 @@ use std::ops::DerefMut; use z3::SatResult; -use z3rro::prover::{IncrementalMode, Prover}; +use z3rro::solver::{IncrementalMode, SolverSession}; use crate::{ ast::{ @@ -48,11 +48,9 @@ pub struct Unfolder<'smt, 'ctx> { /// Context to translate to SMT. translate: TranslateExprs<'smt, 'ctx>, - /// The prover keeps track of the conditions to reach the current - /// sub-expression. The proof check returns `Proof` if it's unreachable. - /// Since the conditions are not complete, a result of `Counterexample` does - /// not prove that a sub-expression is guaranteed to be reachable. - prover: Prover<'ctx>, + /// The solver tracks necessary conditions for reaching the current sub-expression. + /// Only `Unsat` establishes that the sub-expression is unreachable. + solver: SolverSession<'ctx>, } impl<'smt, 'ctx> Unfolder<'smt, 'ctx> { @@ -60,20 +58,20 @@ impl<'smt, 'ctx> Unfolder<'smt, 'ctx> { // it's important that we use the native incremental mode here, because // the performance benefit from the unfolder relies on many very fast // SAT checks. - let prover = Prover::new(ctx.ctx(), IncrementalMode::Native); + let solver = SolverSession::new(ctx.ctx(), IncrementalMode::Native); Unfolder { subst: Subst::new(ctx.tcx(), &limits_ref), translate: TranslateExprs::new(ctx), - prover, + solver, } } - /// Call `f` surrounded by `push()` and `pop()` calls to the prover. - fn with_prover_scope(&mut self, f: impl FnOnce(&mut Self) -> T) -> T { - self.prover.push(); + /// Call `f` surrounded by `push()` and `pop()` calls to the solver. + fn with_solver_scope(&mut self, f: impl FnOnce(&mut Self) -> T) -> T { + self.solver.push(); let res = f(self); - self.prover.pop(); + self.solver.pop(); res } @@ -88,18 +86,13 @@ impl<'smt, 'ctx> Unfolder<'smt, 'ctx> { // TODO: the local scope is unnecessarily repeatedly added to the // solver. - self.translate - .local_scope() - .add_assumptions_to_prover(&mut self.prover); + self.translate.local_scope().assert_into(&mut self.solver); - self.with_prover_scope(|this| { - this.prover.add_assumption(&expr_z3); + self.with_solver_scope(|this| { + this.solver.assert(&expr_z3); tracing::trace!(expr_z3=%expr_z3, "added expr to unfolder solver"); - // here we want to do a SAT check and not a proof search. if the - // expression is e.g. `false`, then we want to get `Unsat` from the - // solver and not `Proof`! - if this.prover.check_sat() == SatResult::Unsat { - tracing::trace!(solver=?this.prover, "eliminated zero expr"); + if this.solver.check() == SatResult::Unsat { + tracing::trace!(solver=?this.solver, "eliminated zero expr"); None } else { Some(callback(this)) @@ -243,12 +236,9 @@ impl<'smt, 'ctx> VisitorMut for Unfolder<'smt, 'ctx> { ); let scope = self.translate.push(); - self.prover.push(); - // we could also add the assumptions before the prover.push() - // call, but then we're risking re-adding the same assumptions - // over and over again. The SmtScope structure doesn't - // deduplicate those yet and I'm not sure Z3 does either. - scope.add_assumptions_to_prover(&mut self.prover); + self.solver.push(); + // Add constraints inside the scope so they are removed when it is popped. + scope.assert_into(&mut self.solver); for quant_var in quant_vars { self.translate.fresh(quant_var.name()); @@ -257,7 +247,7 @@ impl<'smt, 'ctx> VisitorMut for Unfolder<'smt, 'ctx> { self.visit_expr(expr)?; self.translate.pop(); - self.prover.pop(); + self.solver.pop(); self.subst.pop(); Ok(()) } diff --git a/src/slicing/solver.rs b/src/slicing/solver.rs index 4ef21db1..ae2575a1 100644 --- a/src/slicing/solver.rs +++ b/src/slicing/solver.rs @@ -4,12 +4,13 @@ use indexmap::IndexSet; use itertools::Itertools; use tracing::{debug, info, info_span, instrument, warn}; use z3::{ - ast::{Bool, Dynamic}, + ast::{forall_const, Ast, Bool, Dynamic}, SatResult, Statistics, }; use z3rro::{ model::{InstrumentedModel, ModelConsistency}, prover::{ProveResult, Prover}, + solver::{IncrementalMode, SolverSession}, util::ReasonUnknown, }; @@ -132,7 +133,7 @@ impl<'ctx> SmtSliceStmts<'ctx> { /// slicing by doing a binary search of upper bounds on the number of statements /// we're keeping in the program. pub struct SliceSolver<'ctx> { - prover: Prover<'ctx>, + solver: SolverSession<'ctx>, slice_stmts: SmtSliceStmts<'ctx>, universally_bound: Vec>, } @@ -141,16 +142,17 @@ impl<'ctx> SliceSolver<'ctx> { pub fn new<'smt>( slice_stmts: SliceStmts, translate: &mut TranslateExprs<'smt, 'ctx>, - mut prover: Prover<'ctx>, + prover: Prover<'ctx>, ) -> Self { let slice_stmts = SmtSliceStmts::new(slice_stmts, translate); let universally_bound = slice_stmts.universally_bound(translate); - prover.push(); - prover.push(); + let mut solver = prover.into_proof_query(); + solver.push(); + solver.push(); SliceSolver { - prover, + solver, slice_stmts, universally_bound, } @@ -160,7 +162,7 @@ impl<'ctx> SliceSolver<'ctx> { let (active, inactive) = self.slice_stmts.split_by_selection(selection); // inactive statements must be enabled in the slice - let inactive_formula = Bool::and(self.prover.get_context(), &inactive); + let inactive_formula = Bool::and(self.solver.get_context(), &inactive); debug!( active = active.len(), @@ -171,23 +173,6 @@ impl<'ctx> SliceSolver<'ctx> { (active, inactive_formula) } - /* - /// Run [`check_original_proof`] on the original query, without slicing anything. - pub fn check_original_proof(&mut self) -> ProveResult<'ctx> { - self.prover.pop(); - self.prover.push(); - let active_toggle_values: Vec<_> = self - .slice_stmts - .iter() - .map(|(_, value)| value.clone()) - .collect(); - self.prover.add_assumption(&Bool::and( - self.prover.solver().get_context(), - &active_toggle_values, - )); - self.prover.check_proof() - } */ - /// Minimize the number of statements while the program still verifies using /// an exists-forall encoding. #[instrument(level = "info", skip_all)] @@ -196,19 +181,19 @@ impl<'ctx> SliceSolver<'ctx> { options: &SliceSolveOptions, limits_ref: &LimitsRef, ) -> Result, LimitError> { - assert_eq!(self.prover.level(), 2); - self.prover.pop(); - self.prover.pop(); - self.prover.push(); + assert_eq!(self.solver.level(), 2); + self.solver.pop(); + self.solver.pop(); + self.solver.push(); let selection = SliceSelection::VERIFIED_SELECTION; let (active_toggle_values, inactive_formula) = self.translate_selection(&selection); - let (prover, universally_bound) = (&mut self.prover, &self.universally_bound); + let (solver, universally_bound) = (&mut self.solver, &self.universally_bound); - prover.add_assumption(&self.slice_stmts.constraints); - let mut exists_forall_solver = prover.to_exists_forall(universally_bound); - exists_forall_solver.add_assumption(&inactive_formula); + solver.assert(&self.slice_stmts.constraints); + let mut exists_forall_solver = exists_forall_query(solver, universally_bound); + exists_forall_solver.assert(&inactive_formula); exists_forall_solver.push(); exists_forall_solver.push(); slice_sat_binary_search( @@ -233,29 +218,26 @@ impl<'ctx> SliceSolver<'ctx> { &mut self, limits_ref: &LimitsRef, ) -> Result, LimitError> { - assert_eq!(self.prover.level(), 2); - self.prover.pop(); - self.prover.pop(); - self.prover.push(); + assert_eq!(self.solver.level(), 2); + self.solver.pop(); + self.solver.pop(); + self.solver.push(); let selection = SliceSelection::VERIFIED_SELECTION; let (active_toggle_values, inactive_formula) = self.translate_selection(&selection); if let Some(timeout) = limits_ref.time_left() { - self.prover.set_timeout(timeout); + self.solver.set_timeout(timeout); } - self.prover.add_assumption(&self.slice_stmts.constraints); - self.prover.add_assumption(&inactive_formula); - let res = check_proof_assuming_interruptibly( - &mut self.prover, - limits_ref, - &active_toggle_values, - )?; + self.solver.assert(&self.slice_stmts.constraints); + self.solver.assert(&inactive_formula); + let res = + check_sat_assuming_interruptibly(&mut self.solver, limits_ref, &active_toggle_values)?; let mut slice_searcher = SliceModelSearch::new(active_toggle_values.clone()); - if let ProveResult::Proof = res { - slice_searcher.found_active(self.prover.get_unsat_core()); + if let SatResult::Unsat = res { + slice_searcher.found_active(self.solver.get_unsat_core()); } Ok(slice_searcher.finish().map(|minimal_unsat| { @@ -276,19 +258,19 @@ impl<'ctx> SliceSolver<'ctx> { options: &SliceSolveOptions, limits_ref: &LimitsRef, ) -> Result, LimitError> { - assert_eq!(self.prover.level(), 2); - self.prover.pop(); - self.prover.pop(); - self.prover.push(); + assert_eq!(self.solver.level(), 2); + self.solver.pop(); + self.solver.pop(); + self.solver.push(); let selection = SliceSelection::VERIFIED_SELECTION; let (active_toggle_values, inactive_formula) = self.translate_selection(&selection); - self.prover.add_assumption(&self.slice_stmts.constraints); - self.prover.add_assumption(&inactive_formula); + self.solver.assert(&self.slice_stmts.constraints); + self.solver.assert(&inactive_formula); // TODO: re-use the unsat core from the proof instead of starting fresh - let context = self.prover.get_context(); + let context = self.solver.get_context(); let mut subset_explorer = { let active_toggle_values = active_toggle_values.iter().cloned().collect(); let extensive: IndexSet> = self @@ -318,7 +300,7 @@ impl<'ctx> SliceSolver<'ctx> { SubsetExploration::new(context, active_toggle_values, extensive, reductive) }; - let res = slice_unsat_search(&mut subset_explorer, &mut self.prover, options, limits_ref)?; + let res = slice_unsat_search(&mut subset_explorer, &mut self.solver, options, limits_ref)?; Ok(res.map(|minimal_unsat| { SliceModel::from_enabled( @@ -337,25 +319,25 @@ impl<'ctx> SliceSolver<'ctx> { options: &SliceSolveOptions, limits_ref: &LimitsRef, ) -> Result<(ProveResult, Option<(InstrumentedModel<'ctx>, SliceModel)>), LimitError> { - if !self.prover.has_provables() { - return Ok((ProveResult::Proof, None)); - } - - assert_eq!(self.prover.level(), 2); - self.prover.pop(); - self.prover.pop(); - self.prover.push(); + assert_eq!(self.solver.level(), 2); + self.solver.pop(); + self.solver.pop(); + self.solver.push(); let selection = SliceSelection::FAILURE_SELECTION; let (active_toggle_values, inactive_formula) = self.translate_selection(&selection); - self.prover.add_assumption(&self.slice_stmts.constraints); - self.prover.add_assumption(&inactive_formula); - self.prover.push(); + self.solver.assert(&self.slice_stmts.constraints); + self.solver.assert(&inactive_formula); + self.solver.push(); - slice_sat_binary_search(&mut self.prover, &active_toggle_values, options, limits_ref)?; - let res = check_proof_interruptibly(&mut self.prover, limits_ref)?; - let model = if let Some(model) = self.prover.get_model() { + slice_sat_binary_search(&mut self.solver, &active_toggle_values, options, limits_ref)?; + let res = match check_sat_interruptibly(&mut self.solver, limits_ref)? { + SatResult::Unsat => ProveResult::Proof, + SatResult::Sat => ProveResult::Counterexample, + SatResult::Unknown => ProveResult::Unknown(self.solver.get_reason_unknown().unwrap()), + }; + let model = if let Some(model) = self.solver.get_model() { assert!(matches!( res, ProveResult::Counterexample | ProveResult::Unknown(_) @@ -369,9 +351,9 @@ impl<'ctx> SliceSolver<'ctx> { Ok((res, model)) } - /// Retrieve the underlying prover's statistics. + /// Retrieve the solver session's statistics. pub fn get_statistics(&self) -> Statistics<'ctx> { - self.prover.get_statistics() + self.solver.get_statistics() } } @@ -453,27 +435,45 @@ impl<'ctx> SliceModelSearch<'ctx> { } } -/// Slice on the provided prover with the given slice variables while the solver -/// returns SAT. We do a kind of binary search on the number of enabled slice -/// variables using Z3's `pb_le` constraint (at most n true). +/// Universally quantify the negation of the counterexample query over program variables. +fn exists_forall_query<'ctx>( + solver: &SolverSession<'ctx>, + universal: &[Dynamic<'ctx>], +) -> SolverSession<'ctx> { + let ctx = solver.get_context(); + let universal: Vec<&dyn Ast<'ctx>> = + universal.iter().map(|var| var as &dyn Ast<'ctx>).collect(); + let theorem = forall_const( + ctx, + &universal, + &[], + &Bool::and(ctx, &solver.get_assertions()).not(), + ); + let mut result = SolverSession::new(ctx, IncrementalMode::Native); + result.assert(&theorem); + result +} + +/// Slice on the provided solver with the given slice variables while the solver returns SAT. +/// Search for the number of enabled slice variables using Z3's `pb_le` constraint (at most n true). fn slice_sat_binary_search<'ctx>( - prover: &mut Prover<'ctx>, + solver: &mut SolverSession<'ctx>, active_slice_vars: &[Bool<'ctx>], options: &SliceSolveOptions, limits_ref: &LimitsRef, ) -> Result<(), LimitError> { - assert_eq!(prover.level(), 2); + assert_eq!(solver.level(), 2); let slice_vars: Vec<(&Bool<'ctx>, i32)> = active_slice_vars.iter().map(|value| (value, 1)).collect(); - let set_at_most_true = |prover: &mut Prover<'ctx>, at_most_n: usize| { - prover.pop(); - prover.push(); + let set_at_most_true = |solver: &mut SolverSession<'ctx>, at_most_n: usize| { + solver.pop(); + solver.push(); - let ctx = prover.get_context(); + let ctx = solver.get_context(); let at_most_n_true = Bool::pb_le(ctx, &slice_vars, at_most_n as i32); - prover.add_assumption(&at_most_n_true); + solver.assert(&at_most_n_true); }; // TODO: we could have min_least_bound set to 1 if we could conclude for @@ -505,16 +505,16 @@ fn slice_sat_binary_search<'ctx>( ) .entered(); - set_at_most_true(prover, n); + set_at_most_true(solver, n); if let Some(timeout) = limits_ref.time_left() { - prover.set_timeout(timeout); + solver.set_timeout(timeout); } - let res = check_sat_interruptibly(prover, limits_ref)?; + let res = check_sat_interruptibly(solver, limits_ref)?; entered.record("res", tracing::field::debug(res)); let mut done = false; - if let Some(model) = prover.get_model() { + if let Some(model) = solver.get_model() { if model.consistency() == ModelConsistency::Consistent || options.unknown == UnknownHandling::Accept { @@ -566,11 +566,11 @@ fn slice_sat_binary_search<'ctx>( if let Some(cur_solver_n) = cur_solver_n { // only reset if the solver isn't already in the correct state if cur_solver_n != enabled { - set_at_most_true(prover, enabled); + set_at_most_true(solver, enabled); if let Some(timeout) = limits_ref.time_left() { - prover.set_timeout(timeout); + solver.set_timeout(timeout); } - let res = check_sat_interruptibly(prover, limits_ref)?; + let res = check_sat_interruptibly(solver, limits_ref)?; if minimize.min_accept().is_some() { assert!(res == SatResult::Sat || res == SatResult::Unknown); } else if minimize.max_reject().is_some() { @@ -581,7 +581,7 @@ fn slice_sat_binary_search<'ctx>( } } - assert_eq!(prover.level(), 2); + assert_eq!(solver.level(), 2); Ok(()) } @@ -589,7 +589,7 @@ fn slice_sat_binary_search<'ctx>( #[instrument(level = "trace", skip_all)] pub fn slice_unsat_search<'ctx>( exploration: &mut SubsetExploration<'ctx>, - prover: &mut Prover<'ctx>, + solver: &mut SolverSession<'ctx>, options: &SliceSolveOptions, limits_ref: &LimitsRef, ) -> Result>>, LimitError> { @@ -600,14 +600,14 @@ pub fn slice_unsat_search<'ctx>( while let Some(seed) = exploration.next_set() { limits_ref.check_limits()?; - match check_proof_seed(&all_variables, prover, limits_ref, &seed)? { - ProveResult::Proof => { + match check_seed(&all_variables, solver, limits_ref, &seed)? { + SatResult::Unsat => { // now start the shrinking, then block up let res = exploration.shrink_block_unsat(seed, |seed| -> Result<_, LimitError> { Ok( - match check_proof_seed(&all_variables, prover, limits_ref, seed)? { - ProveResult::Proof => Some(unsat_core_to_seed(prover, &all_variables)), - ProveResult::Counterexample | ProveResult::Unknown(_) => None, + match check_seed(&all_variables, solver, limits_ref, seed)? { + SatResult::Unsat => Some(unsat_core_to_seed(solver, &all_variables)), + SatResult::Sat | SatResult::Unknown => None, }, ) }); @@ -622,16 +622,16 @@ pub fn slice_unsat_search<'ctx>( SliceMinimality::Size => exploration.block_at_least(res.len()), } } - ProveResult::Counterexample => { + SatResult::Sat => { // grow the counterexample and then block down exploration.grow_block_sat(seed, |seed| -> Result<_, LimitError> { Ok(matches!( - check_proof_seed(&all_variables, prover, limits_ref, seed)?, - ProveResult::Counterexample + check_seed(&all_variables, solver, limits_ref, seed)?, + SatResult::Sat )) })?; } - ProveResult::Unknown(_) => { + SatResult::Unknown => { exploration.block_this(&seed); match options.unknown { @@ -652,18 +652,18 @@ pub fn slice_unsat_search<'ctx>( } #[instrument(level = "trace", skip_all, ret)] -fn check_proof_seed<'ctx>( +fn check_seed<'ctx>( all_variables: &IndexSet>, - prover: &mut Prover<'ctx>, + solver: &mut SolverSession<'ctx>, limits_ref: &LimitsRef, seed: &IndexSet>, -) -> Result { +) -> Result { let mut timeout = Duration::from_millis(100); if let Some(time_left) = limits_ref.time_left() { timeout = timeout.min(time_left); } - prover.set_timeout(timeout); + solver.set_timeout(timeout); let (all_on, all_off): (IndexSet<_>, IndexSet<_>) = all_variables .iter() @@ -673,74 +673,44 @@ fn check_proof_seed<'ctx>( let all_off_assumptions = all_off.iter().map(Bool::not); let all_assumptions = all_on_assumptions.chain(all_off_assumptions).collect_vec(); - // prover.push(); - check_proof_assuming_interruptibly(prover, limits_ref, &all_assumptions) - // prover.pop(); + check_sat_assuming_interruptibly(solver, limits_ref, &all_assumptions) } fn unsat_core_to_seed<'ctx>( - prover: &mut Prover<'ctx>, + solver: &mut SolverSession<'ctx>, all_variables: &IndexSet>, ) -> IndexSet> { - let unsat_core: IndexSet> = prover.get_unsat_core().into_iter().collect(); + let unsat_core: IndexSet> = solver.get_unsat_core().into_iter().collect(); all_variables.intersection(&unsat_core).cloned().collect() } fn check_sat_interruptibly<'ctx>( - prover: &mut Prover<'ctx>, + solver: &mut SolverSession<'ctx>, limits_ref: &LimitsRef, ) -> Result { - let result = run_prover_interruptibly(prover, limits_ref, Prover::check_sat); - if matches!(result, SatResult::Unknown) - && prover.get_reason_unknown() == Some(ReasonUnknown::Interrupted) - { - Err(limits_ref.interrupted_error()) - } else { - Ok(result) - } + check_sat_assuming_interruptibly(solver, limits_ref, &[]) } -fn check_proof_interruptibly<'ctx>( - prover: &mut Prover<'ctx>, - limits_ref: &LimitsRef, -) -> Result { - let result = run_prover_interruptibly(prover, limits_ref, Prover::check_proof); - if matches!(result, ProveResult::Unknown(ReasonUnknown::Interrupted)) { - Err(limits_ref.interrupted_error()) - } else { - Ok(result) - } -} - -fn check_proof_assuming_interruptibly<'ctx>( - prover: &mut Prover<'ctx>, +fn check_sat_assuming_interruptibly<'ctx>( + solver: &mut SolverSession<'ctx>, limits_ref: &LimitsRef, assumptions: &[Bool<'ctx>], -) -> Result { - let result = run_prover_interruptibly(prover, limits_ref, |prover| { - prover.check_proof_assuming(assumptions) - }); - if matches!(result, ProveResult::Unknown(ReasonUnknown::Interrupted)) { - Err(limits_ref.interrupted_error()) - } else { - Ok(result) - } -} - -fn run_prover_interruptibly<'ctx, T>( - prover: &mut Prover<'ctx>, - limits_ref: &LimitsRef, - check: impl FnOnce(&mut Prover<'ctx>) -> T, -) -> T { - let handle = prover.get_context().handle(); - - thread::scope(|scope| { +) -> Result { + let handle = solver.get_context().handle(); + let result = thread::scope(|scope| { let done_sender = limits_ref.spawn_until_stopped_or_done(scope, move || { handle.interrupt(); }); - let result = check(prover); + let result = solver.check_assuming(assumptions); let _ = done_sender.send(()); result - }) + }); + if result == SatResult::Unknown + && solver.get_reason_unknown() == Some(ReasonUnknown::Interrupted) + { + Err(limits_ref.interrupted_error()) + } else { + Ok(result) + } } diff --git a/src/slicing/transform_test.rs b/src/slicing/transform_test.rs index af794b4f..01945510 100644 --- a/src/slicing/transform_test.rs +++ b/src/slicing/transform_test.rs @@ -3,7 +3,8 @@ use itertools::Itertools; use z3rro::{ model::SmtEval, - prover::{IncrementalMode, ProveResult, Prover}, + prover::{ProveResult, Prover}, + solver::IncrementalMode, }; use super::{ diff --git a/z3rro/src/lib.rs b/z3rro/src/lib.rs index a9da1847..e8daca9c 100644 --- a/z3rro/src/lib.rs +++ b/z3rro/src/lib.rs @@ -31,6 +31,7 @@ pub mod probes; pub mod prover; pub mod quantifiers; pub mod smtlib; +pub mod solver; mod uint; pub use uint::UInt; mod ureal; diff --git a/z3rro/src/prover.rs b/z3rro/src/prover.rs index 9b7fa5cd..5149c11f 100644 --- a/z3rro/src/prover.rs +++ b/z3rro/src/prover.rs @@ -1,20 +1,17 @@ -//! Not a SAT solver, but a prover. There's a difference. +//! Proof obligations over a solver session. use std::{fmt::Display, time::Duration}; -use z3::{ - ast::{forall_const, Ast, Bool, Dynamic}, - Context, SatResult, Solver, Statistics, -}; +use z3::{ast::Bool, Context, SatResult}; use crate::{ - model::{InstrumentedModel, ModelConsistency}, - params::SmtParams, + model::InstrumentedModel, smtlib::Smtlib, - util::{set_solver_timeout, ReasonUnknown}, + solver::{IncrementalMode, SolverSession}, + util::ReasonUnknown, }; -/// The result of a prove query. +/// The result of a proof query. #[derive(Debug)] pub enum ProveResult { Proof, @@ -32,311 +29,87 @@ impl Display for ProveResult { } } -/// Because Z3's built-in support for incremental solving often has surprising -/// or simply bad performance for some use cases, we also offer an -/// [`IncrementalMode::Emulated`], with which the [`Prover`] mtaintains its own -/// stack of assumptions and re-initializes a new Z3 solver on every call of -/// [`Prover::pop`]. -pub enum IncrementalMode { - Native, - Emulated, -} - -#[derive(Debug)] -enum StackSolver<'ctx> { - Native(Solver<'ctx>), - Emulated(Solver<'ctx>, Vec>>), -} - -#[derive(Debug)] -struct LastSatResult { - /// Whether the last check used temporary assumptions, so its result cannot be reused for an assumption-free check. - has_assumptions: bool, - /// Whether the current model is consistent with the assertions. If the SMT - /// solver returned [`SatResult::Unknown`], it is - /// [`ModelConsistency::Unknown`]. - model_consistency: Option, - /// The last result of a SAT/proof check so we can return a chached result. - /// It is reset any time the assertions on the solver are modified. - /// Sometimes Z3 caches on its own, but it is not reliable. Therefore, we do - /// it here as well to be sure. - last_result: SatResult, -} - -/// A prover wraps a SAT solver, but it's used to prove validity of formulas. -/// It's a bit of a more explicit API to distinguish between assumptions for a -/// proof ([`Prover::add_assumption`]) and provables ([`Prover::add_provable`]). -/// -/// It keeps track of whether there are any assertions added to the solver. If -/// there are none, then [`Prover::check_proof`] will return -/// [`ProveResult::Proof`] (instead of [`SatResult::Sat`], i.e. -/// [`ProveResult::Counterexample`]). Therefore, you shouldn't add assertions -/// via [`Prover::solver`] to not mess that tracking up. -/// -/// In contrast to [`z3::Solver`], the [`Prover`] requires exclusive ownership -/// to do any modifications of the solver. +/// Adds proof obligations to a solver session and interprets counterexample queries. +/// A query with no proof obligations is proved without consulting the solver. #[derive(Debug)] pub struct Prover<'ctx> { - ctx: &'ctx Context, - timeout: Option, - solver: StackSolver<'ctx>, - /// Number of times push was called minus number of times pop was called. - level: usize, - /// The minimum level where an assertion was added to the solver. + session: SolverSession<'ctx>, min_level_with_provables: Option, - /// Cached information about the last SAT/proof check call. - last_result: Option, } impl<'ctx> Prover<'ctx> { - /// Create a new prover with the given [`Context`] and [`IncrementalMode`]. pub fn new(ctx: &'ctx Context, mode: IncrementalMode) -> Self { - Prover { - ctx, - timeout: None, - solver: match mode { - IncrementalMode::Native => StackSolver::Native(Solver::new(ctx)), - IncrementalMode::Emulated => { - StackSolver::Emulated(Solver::new(ctx), vec![Vec::new()]) - } - }, - level: 0, + Self { + session: SolverSession::new(ctx, mode), min_level_with_provables: None, - last_result: None, - } - } - - /// Get the Z3 context of this prover. - pub fn get_context(&self) -> &'ctx Context { - self.ctx - } - - fn get_solver(&self) -> &Solver<'ctx> { - match &self.solver { - StackSolver::Native(solver) => solver, - StackSolver::Emulated(solver, _) => solver, } } - /// Get all assertions added to the underlying solver. - pub fn get_assertions(&self) -> Vec> { - self.get_solver().get_assertions() + pub fn set_timeout(&mut self, timeout: Duration) { + self.session.set_timeout(timeout); } - /// Set a timeout for every `check` call. - pub fn set_timeout(&mut self, duration: Duration) { - self.timeout = Some(duration); - set_solver_timeout(self.get_solver(), duration); - if self - .last_result - .as_ref() - .is_some_and(|result| result.last_result == SatResult::Unknown) - { - self.last_result = None; - } - } - - /// Add an assumption to this prover. pub fn add_assumption(&mut self, value: &Bool<'ctx>) { - match &mut self.solver { - StackSolver::Native(solver) => { - solver.assert(value); - } - StackSolver::Emulated(solver, stack) => { - solver.assert(value); - stack.last_mut().unwrap().push(value.clone()); - } - } - self.last_result = None; + self.session.assert(value); } - /// Add a proof obligation to this prover. It adds the negated formula to - /// the underlying SAT solver's assertions. In addition, the prover will - /// never return a counterexample unless a provable has been added. - /// - /// We call it `provable` to avoid confusion between the Z3 solver's - /// `assert` methods. + /// Add the negation of a proof obligation to the counterexample query. pub fn add_provable(&mut self, value: &Bool<'ctx>) { - self.add_assumption(&value.not()); - self.min_level_with_provables.get_or_insert(self.level); + self.session.assert(&value.not()); + self.min_level_with_provables + .get_or_insert(self.session.level()); } - /// `self.check_proof_assuming(&[])`. pub fn check_proof(&mut self) -> ProveResult { self.check_proof_assuming(&[]) } - /// Do the SAT check, but consider a check with no provables to be a - /// [`ProveResult::Proof`]. pub fn check_proof_assuming(&mut self, assumptions: &[Bool<'ctx>]) -> ProveResult { - if !self.has_provables() { + if self.min_level_with_provables.is_none() { + self.session.clear_last_check(); return ProveResult::Proof; } - - let res = if assumptions.is_empty() { - self.check_sat() - } else { - let res = self.get_solver().check_assumptions(assumptions); - self.cache_result(res, true); - res - }; - match res { + match self.session.check_assuming(assumptions) { SatResult::Unsat => ProveResult::Proof, - SatResult::Unknown => ProveResult::Unknown(self.get_reason_unknown().unwrap()), SatResult::Sat => ProveResult::Counterexample, + SatResult::Unknown => ProveResult::Unknown(self.session.get_reason_unknown().unwrap()), } } - /// Whether this prover has any provables added (excluding assumptions). If - /// so, then any call to [`Self::check_proof`] or - /// [`Self::check_proof_assuming`] will return [`ProveResult::Proof`] - /// immediately. - pub fn has_provables(&mut self) -> bool { - self.min_level_with_provables.is_some() + pub fn push(&mut self) { + self.session.push(); } - /// Do the regular SAT check. - pub fn check_sat(&mut self) -> SatResult { - if let Some(cached_result) = self - .last_result - .as_ref() - .filter(|result| !result.has_assumptions) + pub fn pop(&mut self) { + self.session.pop(); + if self + .min_level_with_provables + .is_some_and(|level| level > self.session.level()) { - return cached_result.last_result; + self.min_level_with_provables = None; } - let res = self.get_solver().check(); - self.cache_result(res, false); - res } - /// Save the result of the last SAT/proof check. - fn cache_result(&mut self, sat_result: SatResult, has_assumptions: bool) { - let model_consistency = match sat_result { - SatResult::Sat => Some(ModelConsistency::Consistent), - SatResult::Unknown => Some(ModelConsistency::Unknown), - SatResult::Unsat => None, - }; - self.last_result = Some(LastSatResult { - has_assumptions, - model_consistency, - last_result: sat_result, - }); - } - - /// Retrieve the model from the solver. If the result of the latest check - /// was [`ProveResult::Counterexample`] or [`SatResult::Sat`], then the - /// model is guaranteed to be consistent with the assertions - /// ([`ModelConsistency::Consistent`]). After a - /// [`ProveResult::Unknown`]/[`SatResult::Unknown`], the model is - /// [`ModelConsistency::Inconsistent`]. pub fn get_model(&self) -> Option> { - let consistency = self.last_result.as_ref()?.model_consistency?; - let model = self.get_solver().get_model()?; - Some(InstrumentedModel::new(consistency, model)) - } - - /// Retrieve the UNSAT core. See [`Solver::get_unsat_core()`]. - pub fn get_unsat_core(&self) -> Vec> { - self.get_solver().get_unsat_core() - } - - /// See [`Solver::get_reason_unknown`]. - pub fn get_reason_unknown(&self) -> Option { - self.get_solver() - .get_reason_unknown() - .map(|reason| reason.parse().unwrap()) - } - - /// See [`Solver::push`]. - pub fn push(&mut self) { - self.level += 1; - match &mut self.solver { - StackSolver::Native(solver) => solver.push(), - StackSolver::Emulated(_, stack) => stack.push(Vec::new()), - } - } - - /// See [`Solver::pop`]. - pub fn pop(&mut self) { - self.level = self.level.checked_sub(1).expect("cannot pop level 0"); - if let Some(prev_min_level) = self.min_level_with_provables { - // if there are no assertions at this level, remove the counter - if prev_min_level > self.level { - self.min_level_with_provables.take(); - } - } - - match &mut self.solver { - StackSolver::Native(solver) => { - // we don't know if the pop will change the state, so reset in - // every case - self.last_result = None; - solver.pop(1) - } - StackSolver::Emulated(ref mut solver, stack) => { - let old_top = stack.pop().expect("stack was empty, cannot call pop"); - debug_assert_eq!(stack.len(), self.level + 1); - - // if we didn't change the solver state, we do not need to reset - if old_top.is_empty() { - return; - } - - self.last_result = None; - *solver = Solver::new(self.ctx); - for level in stack.iter().flatten() { - solver.assert(level); - } - } - } + self.session.get_model() } - /// Retrieve the current stack level. Useful for debug assertions. - pub fn level(&self) -> usize { - if let StackSolver::Emulated(_, stack) = &self.solver { - debug_assert_eq!(stack.len(), self.level + 1); - } - self.level + pub fn get_assertions(&self) -> Vec> { + self.session.get_assertions() } - /// Return the solver's statistics. - pub fn get_statistics(&self) -> Statistics<'ctx> { - self.get_solver().get_statistics() + pub fn get_smtlib(&self) -> Smtlib { + self.session.get_smtlib() } - /// Turns this prover into a regular [`Solver`]. - pub fn into_solver(self) -> Solver<'ctx> { - match self.solver { - StackSolver::Native(solver) => solver, - StackSolver::Emulated(solver, _) => solver, + /// Consume the prover into a SAT query whose unsatisfiability establishes the proof. + /// An empty set of obligations has no counterexamples, regardless of the assumptions. + pub fn into_proof_query(mut self) -> SolverSession<'ctx> { + if self.min_level_with_provables.is_none() { + self.session + .assert(&Bool::from_bool(self.session.get_context(), false)); } - } - - /// Create an exists-forall solver. All constants provided in the iterator - /// will be universally quantified. The rest will be existentially - /// quantified. - /// - /// The result is a [`Prover`] for convenience (such as using the - /// [`Self::level()`] function), but it should be used as a [`Solver`] via - /// [`Self::check_sat()`]. - pub fn to_exists_forall(&self, universal: &[Dynamic<'ctx>]) -> Prover<'ctx> { - let universal: Vec<&dyn Ast<'ctx>> = - universal.iter().map(|v| v as &dyn Ast<'ctx>).collect(); - let theorem = forall_const( - self.ctx, - &universal, - &[], - &Bool::and(self.ctx, &self.get_assertions()).not(), - ); - let mut res = Prover::new(self.ctx, IncrementalMode::Native); // TODO - res.add_assumption(&theorem); - res - } - - /// Return the SMT-LIB that represents the solver state. - pub fn get_smtlib(&self) -> Smtlib { - let global_params = SmtParams::global().lock().unwrap().clone(); - Smtlib::from_solver(Some(global_params), self.get_solver()) + self.session } } @@ -344,26 +117,42 @@ impl<'ctx> Prover<'ctx> { mod test { use z3::{ast::Bool, Config, Context, SatResult}; - use crate::prover::IncrementalMode; - use super::{ProveResult, Prover}; + use crate::solver::IncrementalMode; #[test] - fn test_prover() { + fn proof_obligations_follow_scopes_and_assumed_checks() { for mode in [IncrementalMode::Native, IncrementalMode::Emulated] { let ctx = Context::new(&Config::default()); + let p = Bool::new_const(&ctx, "p"); let mut prover = Prover::new(&ctx, mode); + assert_eq!(prover.session.check(), SatResult::Sat); + assert!(prover.get_model().is_some()); assert!(matches!(prover.check_proof(), ProveResult::Proof)); - assert_eq!(prover.check_sat(), SatResult::Sat); - + assert!(prover.get_model().is_none()); prover.push(); - prover.add_assumption(&Bool::from_bool(&ctx, true)); + prover.add_provable(&p); + assert!(matches!( + prover.check_proof_assuming(std::slice::from_ref(&p)), + ProveResult::Proof + )); + assert!(matches!(prover.check_proof(), ProveResult::Counterexample)); + prover.push(); + prover.add_assumption(&p); + prover.add_provable(&Bool::from_bool(&ctx, true)); assert!(matches!(prover.check_proof(), ProveResult::Proof)); - assert_eq!(prover.check_sat(), SatResult::Sat); prover.pop(); - + assert!(matches!(prover.check_proof(), ProveResult::Counterexample)); + prover.pop(); + prover.add_assumption(&p); assert!(matches!(prover.check_proof(), ProveResult::Proof)); - assert_eq!(prover.check_sat(), SatResult::Sat); + assert!(prover.get_model().is_none()); + let mut query = prover.into_proof_query(); + assert_eq!( + query.get_assertions(), + vec![p, Bool::from_bool(&ctx, false)] + ); + assert_eq!(query.check(), SatResult::Unsat); } } } diff --git a/z3rro/src/scope.rs b/z3rro/src/scope.rs index 409fbd31..d1de3d9a 100644 --- a/z3rro/src/scope.rs +++ b/z3rro/src/scope.rs @@ -15,6 +15,7 @@ use z3::{ use crate::{ prover::Prover, quantifiers::{mk_quantifier, QuantifierMeta, QuantifierType}, + solver::SolverSession, Factory, SmtFactory, SmtInvariant, }; @@ -72,6 +73,13 @@ impl<'ctx> SmtScope<'ctx> { } } + /// Assert this scope's constraints into a solver session. + pub fn assert_into(&self, session: &mut SolverSession<'ctx>) { + for constraint in &self.constraints { + session.assert(constraint); + } + } + /// Create a new existential quantifier around `body`, quantifying over all /// bound expressions in this solver. pub fn exists(&self, meta: &QuantifierMeta<'ctx>, body: &Bool<'ctx>) -> Bool<'ctx> { diff --git a/z3rro/src/solver.rs b/z3rro/src/solver.rs new file mode 100644 index 00000000..38b8089d --- /dev/null +++ b/z3rro/src/solver.rs @@ -0,0 +1,298 @@ +//! Stateful Z3 solving with scopes, configuration, and query results. + +use std::time::Duration; + +use z3::{ast::Bool, Context, SatResult, Solver, Statistics}; + +use crate::{ + model::{InstrumentedModel, ModelConsistency}, + params::SmtParams, + smtlib::Smtlib, + util::{set_solver_timeout, ReasonUnknown}, +}; + +/// Whether scopes use Z3's native stack or reconstruct the solver when assertions are popped. +pub enum IncrementalMode { + Native, + Emulated, +} + +#[derive(Debug)] +enum StackSolver<'ctx> { + Native(Solver<'ctx>), + Emulated(Solver<'ctx>, Vec>>), +} + +/// Remembers the last answer to avoid repeated Z3 calls and guard model/core access. +/// Marks checks with temporary assumptions so their results cannot be reused without them. +#[derive(Debug)] +struct LastCheck { + has_assumptions: bool, + result: SatResult, +} + +/// A wrapper around [`z3::Solver`] that adds: +/// +/// - Caching for repeated checks without temporary assumptions, invalidated when assertions or scopes change. +/// - Emulated push/pop scopes that rebuild the solver instead of using Z3's native stack. +/// - Timeout settings that are reapplied when the solver is rebuilt. +/// - Guarded access to the last check's model, unsat core, and unknown reason. +/// +/// Unlike [`z3::Solver`], checking or changing the solver requires `&mut self`. +#[derive(Debug)] +pub struct SolverSession<'ctx> { + ctx: &'ctx Context, + timeout: Option, + solver: StackSolver<'ctx>, + /// Number of times push was called minus number of times pop was called. + level: usize, + last_check: Option, +} + +impl<'ctx> SolverSession<'ctx> { + pub fn new(ctx: &'ctx Context, mode: IncrementalMode) -> Self { + Self { + ctx, + timeout: None, + solver: match mode { + IncrementalMode::Native => StackSolver::Native(Self::create_solver(ctx, None)), + IncrementalMode::Emulated => { + StackSolver::Emulated(Self::create_solver(ctx, None), vec![Vec::new()]) + } + }, + level: 0, + last_check: None, + } + } + + fn create_solver(ctx: &'ctx Context, timeout: Option) -> Solver<'ctx> { + let solver = Solver::new(ctx); + if let Some(timeout) = timeout { + set_solver_timeout(&solver, timeout); + } + solver + } + + pub fn get_context(&self) -> &'ctx Context { + self.ctx + } + + fn get_solver(&self) -> &Solver<'ctx> { + match &self.solver { + StackSolver::Native(solver) => solver, + StackSolver::Emulated(solver, _) => solver, + } + } + + pub(crate) fn clear_last_check(&mut self) { + self.last_check = None; + } + + /// Get all assertions added to the underlying solver. + pub fn get_assertions(&self) -> Vec> { + self.get_solver().get_assertions() + } + + /// Set the timeout for subsequent checks and allow an unknown query to be retried. + pub fn set_timeout(&mut self, duration: Duration) { + self.timeout = Some(duration); + set_solver_timeout(self.get_solver(), duration); + if self + .last_check + .as_ref() + .is_some_and(|check| check.result == SatResult::Unknown) + { + self.last_check = None; + } + } + + pub fn assert(&mut self, value: &Bool<'ctx>) { + match &mut self.solver { + StackSolver::Native(solver) => { + solver.assert(value); + } + StackSolver::Emulated(solver, stack) => { + solver.assert(value); + stack.last_mut().unwrap().push(value.clone()); + } + } + self.last_check = None; + } + + pub fn check(&mut self) -> SatResult { + self.check_assuming(&[]) + } + + /// Check the current assertions under temporary assumptions. + /// Only consecutive checks without temporary assumptions may reuse the last result. + pub fn check_assuming(&mut self, assumptions: &[Bool<'ctx>]) -> SatResult { + if assumptions.is_empty() { + if let Some(check) = self + .last_check + .as_ref() + .filter(|check| !check.has_assumptions) + { + return check.result; + } + } + let result = if assumptions.is_empty() { + self.get_solver().check() + } else { + self.get_solver().check_assumptions(assumptions) + }; + self.last_check = Some(LastCheck { + result, + has_assumptions: !assumptions.is_empty(), + }); + result + } + + /// Retrieve a model of the last check, if available. + /// A model returned after `Unknown` has no consistency guarantee. + pub fn get_model(&self) -> Option> { + let consistency = match self.last_check.as_ref()?.result { + SatResult::Sat => ModelConsistency::Consistent, + SatResult::Unknown => ModelConsistency::Unknown, + SatResult::Unsat => return None, + }; + let model = self.get_solver().get_model()?; + Some(InstrumentedModel::new(consistency, model)) + } + + /// Retrieve the core of the current unsatisfiable check. + /// Panics if no current check returned `Unsat`. + pub fn get_unsat_core(&self) -> Vec> { + assert_eq!( + self.last_check.as_ref().map(|check| check.result), + Some(SatResult::Unsat), + "an unsat core requires a current unsatisfiable check" + ); + self.get_solver().get_unsat_core() + } + + /// See [`Solver::get_reason_unknown`]. + pub fn get_reason_unknown(&self) -> Option { + if self.last_check.as_ref()?.result != SatResult::Unknown { + return None; + } + self.get_solver() + .get_reason_unknown() + .map(|reason| reason.parse().unwrap()) + } + + /// See [`Solver::push`]. + pub fn push(&mut self) { + self.last_check = None; + self.level += 1; + match &mut self.solver { + StackSolver::Native(solver) => solver.push(), + StackSolver::Emulated(_, stack) => stack.push(Vec::new()), + } + } + + /// See [`Solver::pop`]. + pub fn pop(&mut self) { + self.level = self.level.checked_sub(1).expect("cannot pop level 0"); + self.last_check = None; + + match &mut self.solver { + StackSolver::Native(solver) => solver.pop(1), + StackSolver::Emulated(ref mut solver, stack) => { + let old_top = stack.pop().expect("stack was empty, cannot call pop"); + debug_assert_eq!(stack.len(), self.level + 1); + + // An empty scope does not require reconstructing the solver. + if old_top.is_empty() { + return; + } + + *solver = Self::create_solver(self.ctx, self.timeout); + for level in stack.iter().flatten() { + solver.assert(level); + } + } + } + } + + /// Retrieve the current stack level. + pub fn level(&self) -> usize { + if let StackSolver::Emulated(_, stack) = &self.solver { + debug_assert_eq!(stack.len(), self.level + 1); + } + self.level + } + + /// Return the solver's statistics. + pub fn get_statistics(&self) -> Statistics<'ctx> { + self.get_solver().get_statistics() + } + + /// Return the SMT-LIB that represents the solver state. + pub fn get_smtlib(&self) -> Smtlib { + let global_params = SmtParams::global().lock().unwrap().clone(); + Smtlib::from_solver(Some(global_params), self.get_solver()) + } +} + +#[cfg(test)] +mod test { + use std::{panic::AssertUnwindSafe, time::Duration}; + + use z3::{ast::Bool, Config, Context, SatResult}; + + use super::{IncrementalMode, SolverSession}; + + #[test] + fn temporary_assumptions_do_not_escape_their_check() { + for mode in [IncrementalMode::Native, IncrementalMode::Emulated] { + let ctx = Context::new(&Config::default()); + let p = Bool::new_const(&ctx, "p"); + let mut session = SolverSession::new(&ctx, mode); + session.assert(&p.not()); + assert_eq!(session.check(), SatResult::Sat); + assert_eq!( + session.check_assuming(std::slice::from_ref(&p)), + SatResult::Unsat + ); + assert_eq!(session.get_unsat_core(), vec![p.clone()]); + assert!(session.get_model().is_none()); + assert_eq!(session.check_assuming(&[p.not()]), SatResult::Sat); + assert_eq!(session.check_assuming(&[p]), SatResult::Unsat); + assert_eq!(session.check(), SatResult::Sat); + assert_eq!(session.check(), SatResult::Sat); + assert!(session.get_model().is_some()); + } + } + + #[test] + fn scope_changes_invalidate_details_and_restore_assertions() { + for mode in [IncrementalMode::Native, IncrementalMode::Emulated] { + let ctx = Context::new(&Config::default()); + let p = Bool::new_const(&ctx, "p"); + let mut session = SolverSession::new(&ctx, mode); + session.set_timeout(Duration::from_secs(5)); + session.assert(&p); + assert_eq!(session.check(), SatResult::Sat); + session.push(); + assert!(session.get_model().is_none()); + session.assert(&p.not()); + assert_eq!(session.check(), SatResult::Unsat); + session.push(); + assert!( + std::panic::catch_unwind(AssertUnwindSafe(|| session.get_unsat_core())).is_err() + ); + assert_eq!(session.check(), SatResult::Unsat); + session.pop(); + assert!(session.last_check.is_none()); + assert_eq!(session.check(), SatResult::Unsat); + session.pop(); + assert_eq!(session.level(), 0); + assert!(session.get_model().is_none()); + assert_eq!(session.get_assertions(), vec![p]); + assert_eq!(session.check(), SatResult::Sat); + session.assert(&Bool::from_bool(&ctx, false)); + assert!(session.get_model().is_none()); + assert_eq!(session.check(), SatResult::Unsat); + } + } +} diff --git a/z3rro/src/test.rs b/z3rro/src/test.rs index 586d550c..f0a1f025 100644 --- a/z3rro/src/test.rs +++ b/z3rro/src/test.rs @@ -4,7 +4,10 @@ use z3::{ast::Bool, Config, Context, SatResult}; -use crate::prover::{IncrementalMode, ProveResult, Prover}; +use crate::{ + prover::{ProveResult, Prover}, + solver::{IncrementalMode, SolverSession}, +}; use super::scope::SmtScope; @@ -18,14 +21,12 @@ pub fn test_prove(f: impl for<'ctx> FnOnce(&'ctx Context, &mut SmtScope<'ctx>) - let mut scope = SmtScope::new(); let theorem = f(&ctx, &mut scope); + let mut session = SolverSession::new(&ctx, IncrementalMode::Native); + scope.assert_into(&mut session); + assert_eq!(session.check(), SatResult::Sat, "SmtScope is inconsistent"); + let mut prover = Prover::new(&ctx, IncrementalMode::Native); scope.add_assumptions_to_prover(&mut prover); - assert_eq!( - prover.check_sat(), - SatResult::Sat, - "SmtScope is inconsistent" - ); - prover.add_provable(&theorem); match prover.check_proof() { ProveResult::Counterexample => panic!( From 25d4e06bbbfb066a89f0020015a5051c28eea5d5 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 12:12:04 +0100 Subject: [PATCH 05/32] smt: only warn about fuel and MBQI when recursive fuel is used --- src/driver/smt_proof.rs | 18 +++++++++++------- 1 file changed, 11 insertions(+), 7 deletions(-) diff --git a/src/driver/smt_proof.rs b/src/driver/smt_proof.rs index c8fc1887..b5e80f32 100644 --- a/src/driver/smt_proof.rs +++ b/src/driver/smt_proof.rs @@ -186,6 +186,7 @@ pub fn mk_function_encoder<'ctx>( } else { PartialEncoding::StrengthenToTotal }; + let mut uses_recursive_fuel = false; let function_encoding = match fe_opt { FunctionEncodingOption::Axiomatic => { AxiomaticFunctionEncoder::new(AxiomInstantiation::Bidirectional, partial_encoding) @@ -199,7 +200,7 @@ pub fn mk_function_encoder<'ctx>( | FunctionEncodingOption::FuelParam | FunctionEncodingOption::FuelMonoComputation | FunctionEncodingOption::FuelParamComputation => { - let fuel_functions = tcx + let fuel_functions: std::collections::HashSet<_> = tcx .get_function_decls() .into_iter() .filter(|f| { @@ -208,6 +209,7 @@ pub fn mk_function_encoder<'ctx>( }) .map(|f| f.borrow().name) .collect(); + uses_recursive_fuel = !fuel_functions.is_empty(); tracing::debug!("Using fuel encoding for functions: {:?}", fuel_functions); let fuel_options = FuelEncodingOptions { fuel_functions, @@ -243,12 +245,14 @@ pub fn mk_function_encoder<'ctx>( // Warn if using fuel encoding with non-ematching quantifier // instantiation. The exception is the [`FuelEncodingOption::FuelMono`] // encoding, which does not rely on Z3 not creating new terms for termination. - if matches!( - options.opt_options.function_encoding, - FunctionEncodingOption::FuelParam - | FunctionEncodingOption::FuelMonoComputation - | FunctionEncodingOption::FuelParamComputation - ) && options.opt_options.quantifier_instantiation != QuantifierInstantiation::EMatching + if uses_recursive_fuel + && matches!( + options.opt_options.function_encoding, + FunctionEncodingOption::FuelParam + | FunctionEncodingOption::FuelMonoComputation + | FunctionEncodingOption::FuelParamComputation + ) + && options.opt_options.quantifier_instantiation != QuantifierInstantiation::EMatching { tracing::warn!( "Using fuel function encoding with MBQI still enabled does not guarantee termination. Set the `--quantifier-instantiation e-matching` option to use the fuel encoding without MBQI.", From e93cdf27d16c61a9a37e08bd8163d3c24cbd0c84 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 16:40:57 +0100 Subject: [PATCH 06/32] website: clarify documentation heading hierarchy --- website/docs/getting-started/heyvl-guide.md | 2 +- website/src/css/custom.css | 11 +++--- website/src/css/docs.css | 44 +++++++++++++++++++++ 3 files changed, 51 insertions(+), 6 deletions(-) create mode 100644 website/src/css/docs.css diff --git a/website/docs/getting-started/heyvl-guide.md b/website/docs/getting-started/heyvl-guide.md index 18b2ac45..5c6b8fc3 100644 --- a/website/docs/getting-started/heyvl-guide.md +++ b/website/docs/getting-started/heyvl-guide.md @@ -25,7 +25,7 @@ import TOCInline from '@theme/TOCInline'; ### Architecture -
+

Architecture of Caesar

diff --git a/website/src/css/custom.css b/website/src/css/custom.css index e0319317..670f671f 100644 --- a/website/src/css/custom.css +++ b/website/src/css/custom.css @@ -1,4 +1,5 @@ @import './fonts.css'; +@import './docs.css'; /** * Any CSS included here will be global. The classic template @@ -146,21 +147,21 @@ pre code { font-family: 'Source Code Pro', var(--ifm-font-family-monospace); } -/* Separate documentation sections without adding visual rules. */ .markdown { --caesar-docs-code-background: var(--ifm-code-background); } -.markdown h2 { +/* Keep the existing typography on Markdown pages outside the documentation. */ +.markdown:not(.theme-doc-markdown) h2.anchor { + --ifm-h2-font-size: 1.75rem; margin-top: 3.5rem; - font-size: 1.75rem; } -.markdown h3 { +.markdown:not(.theme-doc-markdown) h3.anchor { margin-top: 2.75rem; } -.markdown h2 + h3 { +.markdown:not(.theme-doc-markdown) h2.anchor + h3.anchor { margin-top: 1.5rem; } diff --git a/website/src/css/docs.css b/website/src/css/docs.css new file mode 100644 index 00000000..9c4880ee --- /dev/null +++ b/website/src/css/docs.css @@ -0,0 +1,44 @@ +/* Style anchored Markdown headings so card and figure titles keep their own typography. */ +.theme-doc-markdown h2.anchor { + --ifm-h2-font-size: 1.5rem; + margin-top: 3rem; + padding-bottom: 0.5rem; + border-bottom: 1px solid var(--ifm-color-emphasis-300); + line-height: 2rem; +} + +.theme-doc-markdown h3.anchor { + --ifm-h3-font-size: 1.25rem; + position: relative; + margin-top: 2rem; + padding-inline-start: 1.5rem; + line-height: 1.75rem; +} + +.theme-doc-markdown h3.anchor::before { + content: ''; + position: absolute; + inset-inline-start: 0; + top: 0.375rem; + width: 1rem; + height: 1rem; + background: var(--ifm-color-emphasis-600); + mask: url("data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3E%3Cpath d='M4 3v6a3 3 0 0 0 3 3h9m-4-4 4 4-4 4' fill='none' stroke='black' stroke-width='1.5' stroke-linecap='round' stroke-linejoin='round'/%3E%3C/svg%3E") center / contain no-repeat; +} + +.theme-doc-markdown h4.anchor { + --ifm-h4-font-size: 1.125rem; + margin-top: 1.5rem; + line-height: 1.5rem; +} + +.theme-doc-markdown h2.anchor + h3.anchor { + margin-top: 1.5rem; +} + +.theme-doc-markdown strong, +.theme-doc-toc-desktop .table-of-contents > li > a, +.theme-doc-toc-mobile .table-of-contents > li > a, +.theme-doc-markdown .table-of-contents > li > a { + font-weight: var(--ifm-heading-font-weight); +} From abaf985b67e2701311080e90f649b145535e2e7f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Tue, 17 Nov 2026 20:30:25 +0100 Subject: [PATCH 07/32] docs: fix exponential bounds and Riemann sampling example --- .../blog/2025-04-11-foundations-continuous.md | 17 +++++++++-------- website/docs/heyvl/domains.md | 8 ++++---- 2 files changed, 13 insertions(+), 12 deletions(-) diff --git a/website/blog/2025-04-11-foundations-continuous.md b/website/blog/2025-04-11-foundations-continuous.md index 11792147..b7502833 100644 --- a/website/blog/2025-04-11-foundations-continuous.md +++ b/website/blog/2025-04-11-foundations-continuous.md @@ -26,19 +26,20 @@ In addition to theoretical results such as convergence and completeness of the a The HeyVL encoding of the Riemann sum approximation is simple. Consider sampling the variable `x` from the *continuous* uniform distribution over the $[0,1]$. -The original sampling interval $[0,1]$ is divided into $N+1$ subintervals, where $N$ has to be a chosen integer literal. -Then, the encoding looks as follows: +The original sampling interval $[0,1]$ is divided into $N$ equally sized subintervals, where $N\ge1$. +For example, the following encoding uses $N=8$: ```heyvl +var N: UInt = 8 var x: UReal -var j: UInt = unif(0, N) +var j: UInt = unif(0, 7) cohavoc x coassume ?!(j / N <= x && x <= (j+1) / N) ``` -We sample a random integer $j$ from the *discrete* uniform distribution over $[0,N)$ using the [built-in `unif` distribution](/docs/stdlib/distributions). -The sampled integer $j$ is then used to select the subinterval $I = [j/N, (j+1)/N)$. -To overapproximate the expected value on the subinterval $I$, we *nondeterministically* select a value $x \in I$ such that the expected value is maximized. -This is done using the `cohavoc` and `coassume` statements. +We sample a random integer $j$ uniformly from $0$ through $N-1$ using the [built-in `unif` distribution](/docs/stdlib/distributions). +Its bounds must be integer literals, so the code uses `unif(0, 7)`. +The sampled integer $j$ is then used to select the closed subinterval $I = [j/N, (j+1)/N]$. +The `cohavoc` and `coassume` statements take the supremum of the postexpectation over all values $x\in I$, giving an upper approximation on that subinterval. Increasing the parameter $N$ leads to a more precise approximation of the expected value, but incurs a slowdown in the verification time. @@ -46,7 +47,7 @@ The above encodes the Riemann sum over-approximation of the expected value of a Formally: $$ -\int_0^1 f(x) \, dx \quad\leq\quad \sum_{j=0}^N \frac{1}{N+1} \cdot \sup_{ j \in [j/N, (j+1)/N) } f\left(\frac{j}{N+1}\right) +\int_0^1 f(x) \, dx \quad\leq\quad \frac{1}{N} \sum_{j=0}^{N-1} \sup_{x \in [j/N, (j+1)/N]} f(x) $$ A dual version of the encoding can be used to obtain an *under*-approximation of the expected value. diff --git a/website/docs/heyvl/domains.md b/website/docs/heyvl/domains.md index f4cbb163..f25d85d5 100644 --- a/website/docs/heyvl/domains.md +++ b/website/docs/heyvl/domains.md @@ -49,7 +49,7 @@ proc ohfive_6() -> () The domain `Exponentials` contains one func declaration `exp_05` with one parameter, `exponent` of type `UInt`. -It returns a value of type `UInt`, and its recursive definition is given after the equality sign. +It returns a value of type `UReal`, and its recursive definition is given after the equality sign. :::note Function Encodings @@ -105,10 +105,10 @@ domain Exponentials { ### Axioms for Hints Axioms can be used for both definitional functions and for uninterpreted functions. -For example, the verifier might need to know the fact that `exp_05(x) >= 1` always holds. +For example, the verifier might need to know the fact that `exp_05(x) <= 1` always holds. We can add the following axiom for both of the above definitions to let Caesar know this fact: ```heyvl -axiom exp_05_one forall exponent: UInt. exp_05(exponent) >= 1 +axiom exp_05_one forall exponent: UInt. exp_05(exponent) <= 1 ``` ### Axioms as Assumptions @@ -159,7 +159,7 @@ When using [limited functions](../caesar/debugging.md#function-encodings-and-lim At the moment, Caesar will *only* define the axiom with one specific fuel value, which is the maximum defined by the `--max-fuel` command-line option (default: 2). For example, the axiom from above would be translated to: ```heyvl -axiom exp_05_one forall exponent: UInt. exp_05($S($S($Z)), exponent) >= 1 +axiom exp_05_one forall exponent: UInt. exp_05($S($S($Z)), exponent) <= 1 ``` where `$S($S($Z))` represents the fuel value of 2. This behavior has implications with respect to [triggers](./expressions.md#triggers): the quantifier will only be instantiated by e-matching for the specific fuel value of 2. From 7eeddf4846e8501fbe67b1761ebf27f00fa26a05 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 10:53:10 +0100 Subject: [PATCH 08/32] ost rule: support expected runtime lower bounds --- src/proof_rules/ost.rs | 5 ++--- src/proof_rules/tests.rs | 30 ++++++++++++++++++++++++++++++ website/docs/proof-rules/ost.md | 33 ++++++++++++++++++++++----------- 3 files changed, 54 insertions(+), 14 deletions(-) diff --git a/src/proof_rules/ost.rs b/src/proof_rules/ost.rs index 5bf24e5a..b2999aba 100644 --- a/src/proof_rules/ost.rs +++ b/src/proof_rules/ost.rs @@ -97,14 +97,13 @@ impl Encoding for OSTAnnotation { inner_approximation_kind: ApproximationKind, calculus: Option, ) -> ApproximationKind { - // @ost is only sound with @wp; @ert also uses LFP but is not appropriate here. if let Some(c) = calculus { - if !matches!(c.calculus_type, CalculusType::Wp) { + if !matches!(c.calculus_type, CalculusType::Wp | CalculusType::Ert) { return ApproximationKind::UNKNOWN; } } match (fixpoint_kind, inner_approximation_kind) { - (FixpointKind::Least, ApproximationKind::EXACT) => ApproximationKind::EXACT, + (FixpointKind::Least, ApproximationKind::EXACT) => ApproximationKind::UNDER, _ => ApproximationKind::UNKNOWN, } } diff --git a/src/proof_rules/tests.rs b/src/proof_rules/tests.rs index e83bcdf9..90629e8a 100644 --- a/src/proof_rules/tests.rs +++ b/src/proof_rules/tests.rs @@ -734,6 +734,36 @@ fn test_ost_passes_unchanged_parameters_to_generated_procedures() { } } +#[test] +fn test_ost_weak_invariant_does_not_refute_the_property() { + let source = "@wp proc main() -> () pre 1 post 1 { @ost(0, 0, 0, 1) while false {} }"; + let (result, server) = verify_test(source); + assert!(!result.unwrap()); + assert!(server.diagnostics.iter().any(|diagnostic| diagnostic + .to_string() + .contains("Counter-example to verification found"))); +} + +#[test] +fn test_ost_expected_runtime() { + let source = r#" + @ert proc countdown(n: UInt) -> (x: UInt) + pre n + post 0 + { + x = n + @ost(x, 2 * x, 2, 0) + while x > 0 { + tick 1 + x = x - 1 + } + } + "#; + let (result, server) = verify_test(source); + assert!(result.unwrap()); + assert!(server.diagnostics.is_empty()); +} + #[test] fn test_past_transform() { let mut test_string = String::from( diff --git a/website/docs/proof-rules/ost.md b/website/docs/proof-rules/ost.md index 760289cc..ed273730 100644 --- a/website/docs/proof-rules/ost.md +++ b/website/docs/proof-rules/ost.md @@ -14,7 +14,7 @@ For upper bounds on expected results, use [induction](./induction.md). ## Formal Theorem -Consider a loop `while G { Body }` whose `Body` is purely probabilistic (without nondeterministic choices) and [AST](./ast.md). +For the `@wp` rule, consider a loop `while G { Body }` whose `Body` terminates [almost surely](./ast.md) and contains no ticks or nondeterministic choices. Choose finite expectations `I` and `PAST_I`, a nonnegative postexpectation `f` that may take the value infinity, and a finite constant $c \geq 0$. In the encodings below, `vars` denotes the variables used by the loop or annotation, excluding loop-local variables. @@ -153,9 +153,29 @@ The four parameters are: - `cdb`: The bound `c`, given as a `UReal` literal. - `post`: The postexpectation `f`, which may take the value infinity. -Use `@ost` with `@wp` and an [exact loop-body encoding](./approximations.md#proof-rule-approximations). +Use `@ost` in a `proc` with `@wp` or [`@ert`](#rewards-and-expected-runtimes) and an [exact loop-body encoding](./approximations.md#proof-rule-approximations). The annotated loop must be the last statement of its procedure. +## Expected Runtime {#rewards-and-expected-runtimes} + +For a loop $L$, `@ost` with `@ert` proves $I \leq \mathrm{ert}\llbracket L\rrbracket(f)$. +Set $f = 0$ to bound the loop's expected ticks. + +The finiteness checks and the exit inequality $I \leq f$ are as above. +For each state $s$ satisfying $G$, Caesar checks + +$$ +\begin{aligned} + I(s) &\leq \mathrm{ert}\llbracket \mathtt{Body}\rrbracket(I)(s), \\ + \mathrm{ert}\llbracket \mathtt{Body}\rrbracket(1 + \mathtt{PAST\_I})(s) &\leq \mathtt{PAST\_I}(s), \\ + \mathrm{ert}\llbracket \mathtt{Body}\rrbracket(|I - I(s)|)(s) &\leq c. +\end{aligned} +$$ + +The extra $1$ in the second check counts each iteration, so $\mathtt{PAST\_I}$ bounds the expected number of iterations. +In the third check, $I(s)$ is the value before the iteration, and $\mathrm{ert}$ adds the body ticks to the expected absolute change of $I$. +The triangle inequality then gives the change bound needed to apply optional stopping to accumulated ticks plus $I$. [Hark et al., Theorem 32(b)](https://arxiv.org/pdf/1904.01117v3#page=15) + ## Soundness The theorem assumes that `Body` terminates almost surely and contains no nondeterminism. @@ -205,13 +225,4 @@ Compared with the [Encoding of the Optional Stopping Theorem for wp (Appendix C. - Appendix C.5 requires [finite expected runtime](https://arxiv.org/pdf/2309.07781v3#page=23) of the whole loop. Here, `Body` may have infinite expected runtime, provided it is AST and the expected number of outer-loop iterations is finite. -#### Rewards and expected runtimes - -For a purely probabilistic program $P$ and a nonnegative expectation $X$, [Hark et al., Section 8](https://arxiv.org/pdf/1904.01117v3#page=22) give -$$ -\mathrm{ert}\llbracket P\rrbracket(X) -=\mathrm{ert}\llbracket P\rrbracket(0)+\mathrm{wp}\llbracket P\rrbracket(X). -$$ -For nonnegative rewards, retain the cost term in subinvariance and use ordinary $\mathrm{wp}$ for iteration counts and absolute changes. - From 1e1be3310e0e8ca612f3df4d8c9522ab84262139 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 11:47:56 +0100 Subject: [PATCH 09/32] docs: summarize proof-rule guarantees --- website/docs/proof-rules/approximations.md | 169 +++++++++--------- .../proof-rules/approximations.module.css | 6 - website/docs/proof-rules/ast.md | 8 +- website/docs/proof-rules/induction.md | 7 +- website/docs/proof-rules/omega-invariants.md | 9 +- website/docs/proof-rules/ost.md | 6 + website/docs/proof-rules/unrolling.md | 8 +- .../components/ProofRuleGuarantee.module.css | 136 ++++++++++++++ website/src/components/ProofRuleGuarantee.tsx | 95 ++++++++++ website/src/components/ProofRuleQuickCard.tsx | 2 + website/src/data/proofRules.ts | 73 ++++++++ 11 files changed, 420 insertions(+), 99 deletions(-) create mode 100644 website/src/components/ProofRuleGuarantee.module.css create mode 100644 website/src/components/ProofRuleGuarantee.tsx create mode 100644 website/src/data/proofRules.ts diff --git a/website/docs/proof-rules/approximations.md b/website/docs/proof-rules/approximations.md index ccf18f7c..160a33d8 100644 --- a/website/docs/proof-rules/approximations.md +++ b/website/docs/proof-rules/approximations.md @@ -8,9 +8,20 @@ description: Approximations, sound verifications and refutations. import Mermaid from '@theme/Mermaid'; import Tabs from '@theme/Tabs'; import TabItem from '@theme/TabItem'; +import Link from '@docusaurus/Link'; +import { Fragment } from 'react'; import styles from './approximations.module.css'; import { QuickGuide } from '@site/src/components/ProofRuleQuickCard'; import { TokLFP, TokGFP, TokProc, TokCoproc, TokExact, TokOver, TokUnder, TokUnknown } from '@site/src/components/SemanticToken'; +import { FIXED_POINTS, PROOF_RULES } from '@site/src/data/proofRules'; + +export function selectRuleCases(fixedPoint, approximation, refutation = false) { + return Object.values(PROOF_RULES).flatMap(rule => rule.cases + .filter(ruleCase => ruleCase.fixedPoint === fixedPoint + && ruleCase.approximation === approximation + && (!refutation || ruleCase.refutation)) + .map(ruleCase => ({ rule, calculi: ruleCase.calculi }))); +} ``` # Soundness of Proof Rules @@ -35,91 +46,42 @@ For an overview of what Caesar does and does not check automatically, see [What ## Quick Overview To verify or refute a lower/upper bound (/), the proof rules must induce the right approximation (/) between original semantics ($orig$) and verification condition semantics ($vc$). -The cards below are the quick reference; the detailed rule mapping appears later in [Proof Rule Approximations](#proof-rule-approximations). +See [Proof Rule Approximations](#proof-rule-approximations) for the loop-body conditions. {(() => { - const procKind = ; - const coprocKind = ; - - const underRows = [ - { - id: 'lfp', - semantics: , - calculi: [ - { href: '#calculus-annotations', label: '@wp' }, - { href: '#calculus-annotations', label: '@ert' }, - ], - rules: [ - { href: './unrolling', label: '@unroll' }, - { href: './omega-invariants', label: '@omega_invariant' }, - { href: './ost', label: '@ost' }, - { href: './ast#new-proof-rule', label: '@ast' }, - ], - }, - { - id: 'gfp', - semantics: , - calculi: [ - { href: '#calculus-annotations', label: '@wlp' }, - { href: '#calculus-annotations', label: '@uwlp' }, - ], - rules: [ - { href: '../heyvl/procs#calling-procedures', label: 'calls' }, - { href: './induction', label: '@invariant' }, - { href: './induction', label: '@k_induction' }, - ], - }, - ]; - - const overRows = [ - { - id: 'lfp', - semantics: , - calculi: [ - { href: '#calculus-annotations', label: '@wp' }, - { href: '#calculus-annotations', label: '@ert' }, - ], - rules: [ - { href: '../heyvl/procs#calling-procedures', label: 'calls' }, - { href: './induction', label: '@invariant' }, - { href: './induction', label: '@k_induction' }, - { href: './past#past-from-ranking-superinvariants', label: '@past' }, - ], - }, - { - id: 'gfp', - semantics: , - calculi: [ - { href: '#calculus-annotations', label: '@wlp' }, - { href: '#calculus-annotations', label: '@uwlp' }, - ], - rules: [ - { href: './unrolling', label: '@unroll' }, - { href: './omega-invariants', label: '@omega_invariant' }, - ], - }, - ]; - const cards = [ - { mode: 'Verification', kind: procKind, boundHint: 'lower bounds', approx: 'Under', rows: underRows }, - { mode: 'Verification', kind: coprocKind, boundHint: 'upper bounds', approx: 'Over', rows: overRows }, - { mode: 'Refutation', kind: procKind, boundHint: 'lower bounds', approx: 'Over', rows: overRows }, - { mode: 'Refutation', kind: coprocKind, boundHint: 'upper bounds', approx: 'Under', rows: underRows }, + { mode: 'Verification', kind: , boundHint: 'lower bounds', approx: 'Under' }, + { mode: 'Verification', kind: , boundHint: 'upper bounds', approx: 'Over' }, + { mode: 'Refutation', kind: , boundHint: 'lower bounds', approx: 'Over' }, + { mode: 'Refutation', kind: , boundHint: 'upper bounds', approx: 'Under' }, ]; - return ; + + return ({ + ...card, + rows: FIXED_POINTS.map(({ id, calculi }) => ({ + id, + semantics: id === 'lfp' ? : , + calculi: calculi.map(label => ({ href: '#calculus-annotations', label })), + rules: selectRuleCases(id, card.approx, card.mode === 'Refutation') + .flatMap(({ rule, calculi: ruleCalculi }) => { + const labels = rule.annotations.length ? rule.annotations : ['calls']; + const qualifier = ruleCalculi.length < calculi.length ? ruleCalculi.join(', ') : undefined; + return labels.map(label => ({ href: rule.href, label, qualifier })); + }), + })), + }))} />; })()}
Example: Sound and Unsound Proofs and Refutations
-All four examples share the same geometric loop and [`@invariant` annotation](./induction.md); only kind (`proc`/`coproc`) and `pre` differ, so each one is an approximation of the original loop semantics. +In all four examples, the geometric loop continues with probability $1/2$ on each iteration, so the expected final value of `x` is `init_x + 1`.
-Caesar reports _sound verification_: We show that `init_x + 2` is an upper bound (`coproc`) on the expected value of `x` on termination (`@wp`). -The actual expected value is `init_x + 1`. +Caesar verifies that `init_x + 2` is an upper bound using the superinvariant `ite(cont, x + 1, x)`. ```heyvl {1-2} @wp coproc sound_proof(init_x: UInt) -> (x: UInt) @@ -140,17 +102,17 @@ The actual expected value is `init_x + 1`.
-Caesar reports _a counter-example to the property_: We refute that `init_x + 2` is a lower bound (`proc`) on the expected value of `x` on termination (`@wp`). -The actual expected value is `init_x + 1`. +At `init_x = 0`, the unrolling gives a lower bound of $1/4$ from executions that continue once and then exit. +This exceeds the proposed upper bound `init_x`, so Caesar reports a _counterexample to the property_. ```heyvl {1-2} -@wp proc sound_refutation(init_x: UInt) -> (x: UInt) - pre init_x + 2 +@wp coproc sound_refutation(init_x: UInt) -> (x: UInt) + pre init_x post x { x = init_x var cont: Bool = true - @invariant(ite(cont, x + 1, x)) + @unroll(3, 0) while cont { cont = flip(0.5) if cont { x = x + 1 } else {} @@ -162,7 +124,8 @@ The actual expected value is `init_x + 1`.
-Caesar reports _unsound verification_: We want to verify that `init_x + 1` is a lower bound (`proc`) on the expected value of `x` on termination (`@wp`), but Park induction does not give us this guarantee. +The subinvariant check succeeds for the candidate `ite(cont, x + 1, x)`. +Caesar reports _unsound verification_ because the subinvariant conditions alone cannot establish a lower bound on the least fixed point used by `@wp`. ```heyvl {1-2} @wp proc unsound_proof(init_x: UInt) -> (x: UInt) @@ -183,8 +146,8 @@ Caesar reports _unsound verification_: We want to verify that `init_x + 1` is a
-Caesar reports _a counter-example to verification_: it is a counterexample against `init_x + 1` as an upper bound (`coproc`) on the expected value of `x` on termination (`@wp`). -But this is only because the `@invariant(1)` is not inductive (as Caesar reports), not because the specification does not hold. +Caesar reports a _counterexample to verification_ because `1` fails the superinvariant check on exit states with `x > 1`. +The proposed upper bound `init_x + 1` holds for the original loop. ```heyvl {1-2,7} @wp coproc unsound_refutation(init_x: UInt) -> (x: UInt) @@ -394,15 +357,45 @@ The results also apply for approximations. ## Proof Rule Approximations -As explained above, proof rules such as `@invariant` may introduce approximations between the original semantics ($orig$) and the verification condition semantics ($vc$). -Below, we summarize which of [Caesar's built-in proof rules](../proof-rules/) induce which approximations, and thus which proof rules are applicable for sound verification/refutation of lower/upper bounds. - -| Original Semantics | Approximation | Applicable Proof Rules | -| --- | --- | --- | -| | | [Procedure Calls](../heyvl/procs#calling-procedures)
[(k)-Induction](./induction) (`@invariant`, `@k_induction`)
[Positive Almost-Sure Termination Rule](./past#past-from-ranking-superinvariants) (`@past`) | -| | | [Loop Unrolling](./unrolling) (`@unroll`)
[ω-invariants](./omega-invariants) (`@omega_invariant`)
[Optional Stopping Theorem](./ost) (`@ost`)
[Almost-Sure Termination Rule](./ast#new-proof-rule) (`@ast`) | -| | | [Loop Unrolling](./unrolling) (`@unroll`)
[ω-invariants](./omega-invariants) (`@omega_invariant`) | -| | | [Procedure Calls](../heyvl/procs#calling-procedures)
[(k)-Induction](./induction) (`@invariant`, `@k_induction`) | +The table gives the approximations for sound verification in the indicated procedure kind. +See the [Quick Overview](#quick-overview) for supported refutations. + + + + + + + + + + + {FIXED_POINTS.flatMap(({ id, calculi }) => ['Over', 'Under'].map(approximation => ( + + + + + + )))} + +
Original SemanticsApproximationRules for Verification
{id === 'lfp' ? : } + {approximation === 'Over' ? : } + {' in a '} + {approximation === 'Over' ? : } + + {selectRuleCases(id, approximation).map(({ rule, calculi: ruleCalculi }) => ( +
+ {rule.title} + {rule.annotations.length > 0 && ( + <> ({rule.annotations.map((annotation, index) => ( + {index > 0 && ', '}{annotation} + ))}) + )} + {ruleCalculi.length < calculi.length && <> with {ruleCalculi.join(', ')}} +
+ ))} +
+ +The [`@past` annotation](./past#past-from-ranking-superinvariants) checks positive almost-sure termination. For loops, the loop-body approximation must be compatible with the chosen rule. For example, for k-Induction under , the loop body must be so the whole loop is . diff --git a/website/docs/proof-rules/approximations.module.css b/website/docs/proof-rules/approximations.module.css index 162acc75..5679d819 100644 --- a/website/docs/proof-rules/approximations.module.css +++ b/website/docs/proof-rules/approximations.module.css @@ -86,12 +86,6 @@ max-width: 100%; } -.hoverHint { - border-bottom: 1px dotted var(--ifm-color-emphasis-700); - cursor: help; - text-decoration: none; -} - [data-theme='dark'] .fullSpectrumCode { --docusaurus-highlighted-code-line-bg: rgba(79, 221, 191, 0.16); } diff --git a/website/docs/proof-rules/ast.md b/website/docs/proof-rules/ast.md index 0e3b851e..42d731a5 100644 --- a/website/docs/proof-rules/ast.md +++ b/website/docs/proof-rules/ast.md @@ -4,6 +4,12 @@ sidebar_position: 5 # Almost-Sure Termination +```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +``` + + + _Almost-sure termination_ (AST for short) means that a program terminates with probability one. In our probabilistic setting, this does not necessarily mean that all executions terminate (we would call that _certain termination_), but only that the expected value to reach a terminating state is one. In terms of weakest pre-expectations, this means that `wp[C](1) = 1` holds for a program `C`. @@ -23,7 +29,7 @@ With an encoding of standard weakest pre-expectation reasoning (`wp`), it is suf Since `wp[C](1) <= 1` always holds (by a property often called _feasibility_), `1 <= wp[C](1)` implies `wp[C](1) = 1`, i.e. almost-sure termination. Lower bounds on weakest pre-expectations need a proof rule like [omega-invariants](./omega-invariants.md) to reason about loops. -To _refute_ a lower bound on weakest pre-expectations, [unrolling](./unrolling.md) (also known as bounded model checking) can be used. +To _refute_ an upper bound on weakest pre-expectations, [unrolling](./unrolling.md) (also known as bounded model checking) can be used. ## A New Proof Rule for Almost-Sure Termination (`@ast` Annotation) {#new-proof-rule} diff --git a/website/docs/proof-rules/induction.md b/website/docs/proof-rules/induction.md index e76b7fdb..6df68463 100644 --- a/website/docs/proof-rules/induction.md +++ b/website/docs/proof-rules/induction.md @@ -5,6 +5,12 @@ sidebar_position: 2 # Induction and k-Induction +```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +``` + + + _Induction_ and the more general _$k$-induction_ are built-in proof rules to reason about `while` loops. The *non-probabilistic* intuition goes as follows: induction requires an _invariant_ that is maintained by each loop iteration. The invariant must hold before the loop, and then we are guaranteed that the invariant holds after the loop. @@ -109,7 +115,6 @@ Stated in terms of fixed points: * In `coproc`s, `@invariant` *over-approximates* the *least fixed-point* loop semantics. The same statements hold for _k-induction_ (`@k_induction(k, I)`). -With an explicit `@uwlp` annotation, both rules under-approximate the greatest fixed point in either procedure direction: this supports sound verification in a `proc` and sound refutation in a `coproc`. ## Internal Details diff --git a/website/docs/proof-rules/omega-invariants.md b/website/docs/proof-rules/omega-invariants.md index 78a7203e..985f99aa 100644 --- a/website/docs/proof-rules/omega-invariants.md +++ b/website/docs/proof-rules/omega-invariants.md @@ -5,6 +5,12 @@ sidebar_position: 4 # ω-Invariants +```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +``` + + + *ω-invariants* ("omega-invariants") are a built-in proof rule for `while` loops. The idea is to prove bounds on finite loop unfoldings by induction on the number of iterations. @@ -65,12 +71,13 @@ Use the [calculus annotations](./approximations#calculus-annotations) `@wp`, `@w ::: -For every candidate invariant family, when the terminator is the appropriate initial value for the intended fixed-point semantics, the encoding gives: +When the loop body has a [compatible approximation](./approximations#proof-rule-approximations) and the terminator is the appropriate initial value for the intended fixed-point semantics, the encoding gives: - With `@wp` or `@ert`: an under-approximation of the least fixed point, giving sound verification in a `proc`. - With `@wlp`: an over-approximation of the one-bounded greatest fixed point, giving sound verification in a `coproc`. - With `@uwlp`: an over-approximation of the unbounded greatest fixed point, giving sound verification in a `coproc`. +For sound refutation, use the same calculus and terminator in the opposite procedure kind. Without a calculus annotation, `proc` selects least fixed-point semantics and `coproc` selects unbounded greatest fixed-point semantics, starting at infinity. ## Internal Details diff --git a/website/docs/proof-rules/ost.md b/website/docs/proof-rules/ost.md index ed273730..e8d5a249 100644 --- a/website/docs/proof-rules/ost.md +++ b/website/docs/proof-rules/ost.md @@ -5,6 +5,12 @@ description: Proof rule for lower bounds on least fixpoints. # Optional Stopping Theorem +```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +``` + + + The `@ost` annotation proves lower bounds on the expected result of a loop: `I <= wp[while G { Body }](f)`. The candidate bound `I` must be finite, must not decrease in expectation during an iteration, and must be at most the postexpectation `f` on exit. The rule also requires a finite expected number of iterations and a constant bound on the expected absolute change of `I` in each iteration. diff --git a/website/docs/proof-rules/unrolling.md b/website/docs/proof-rules/unrolling.md index 0226e173..46e5f938 100644 --- a/website/docs/proof-rules/unrolling.md +++ b/website/docs/proof-rules/unrolling.md @@ -4,8 +4,14 @@ description: Loop unrolling and bounded model checking. sidebar_position: 3 --- +```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +``` + # Loop Unrolling and Bounded Model Checking + + *Loop unrolling* replaces a `while` loop by a fixed number of iterations `k` and a `terminator` expectation to be used if more than `k` iterations run. For example, it *under-approximates* least fixed-point semantics (`wp` and `ert`, using terminator `0`): $$ @@ -18,8 +24,6 @@ There are three main applications of loop unrolling: 2. [**Verification**](#verification): Proving specifications of loops. 3. [**Refutation**](#bounded-model-checking): Refuting specifications of loops. This is often called *bounded model checking*. -Read the [*Soundness* section](#soundness) for details on the soundness of the proof rule. - :::note Relation to Probabilistic Model Checking (Bounded) [Caesar supports using *probabilistic model checking*](../model-checking.md) to compute and verify expected values of probabilistic programs. diff --git a/website/src/components/ProofRuleGuarantee.module.css b/website/src/components/ProofRuleGuarantee.module.css new file mode 100644 index 00000000..ef92d164 --- /dev/null +++ b/website/src/components/ProofRuleGuarantee.module.css @@ -0,0 +1,136 @@ +.summary { + --summary-line: color-mix(in srgb, var(--ifm-color-emphasis-300) 70%, transparent); + margin-block: 0 1.55rem; + border: 1px solid var(--summary-line); + border-radius: 0.55rem; + background: color-mix(in srgb, var(--caesar-surface-tint) 55%, var(--ifm-background-color)); + font-size: 0.925em; + container-type: inline-size; +} + +.layout { + display: grid; + grid-template-columns: minmax(0, 1fr); +} + +.matrix { + min-inline-size: 0; + padding: 0.4rem 0.85rem 0.48rem; +} + +.summary .table { + display: table; + inline-size: 100%; + margin: 0; + border-collapse: collapse; +} + +.summary .table :is(thead, tbody, tr, th, td) { + border: 0; + background: transparent; +} + +.summary .table :is(th, td) { + padding: 0.34em 0.8rem 0.34em 0; + text-align: start; + vertical-align: top; +} + +.summary .table :is(th, td):last-child { + padding-inline-end: 0; +} + +.summary .table thead th, +.body strong { + color: var(--ifm-color-content-secondary); + font-weight: 600; +} + +th.verify, +.refuteHeading { + white-space: nowrap; +} + +th.verify span { + color: var(--ifm-color-primary); +} + +.refuteHeading span { + color: color-mix(in srgb, var(--ifm-color-danger) 60%, var(--ifm-color-content-secondary)); +} + +.headingLink, +.calculi a { + color: inherit; +} + +.headingLink:hover, +.headingLink:focus-visible, +.calculi a:hover, +.calculi a:focus-visible { + color: var(--ifm-color-primary); +} + +.summary a { + text-decoration: none; +} + +.summary a:hover, +.summary a:focus-visible { + text-decoration: underline; +} + +.summary .table tbody tr { + border-block-start: 1px solid var(--summary-line); +} + +.calculi code { + white-space: nowrap; +} + +.body { + display: flex; + align-items: baseline; + flex-wrap: wrap; + gap: 0.22rem 0.6rem; + padding: 0.47rem 0.85rem; + border-block-start: 1px solid var(--summary-line); +} + +@container (min-width: 33rem) { + .summary .table .verify { + padding-inline-start: 0.8rem; + border-inline-start: 1px solid var(--summary-line); + } +} + +@container (min-width: 41rem) { + .layout { + grid-template-columns: minmax(0, 1fr) 9rem; + } + + .body { + flex-direction: column; + justify-content: flex-start; + padding-block: 0.72rem; + border-block-start: 0; + border-inline-start: 1px solid var(--summary-line); + } +} + +@container (max-width: 32rem) { + .summary .table :is(th, td) { + padding-inline-end: 0.5rem; + } +} + +@container (max-width: 21rem) { + .matrix, + .body { + padding-inline: 0.6rem; + } + + .summary .table :is(th, td) { + padding-inline-end: 0.25rem; + } +} diff --git a/website/src/components/ProofRuleGuarantee.tsx b/website/src/components/ProofRuleGuarantee.tsx new file mode 100644 index 00000000..515f2d22 --- /dev/null +++ b/website/src/components/ProofRuleGuarantee.tsx @@ -0,0 +1,95 @@ +import React from 'react'; +import Link from '@docusaurus/Link'; +import { PROOF_RULES } from '../data/proofRules'; +import { TokExact, TokOver, TokUnder } from './SemanticToken'; +import styles from './ProofRuleGuarantee.module.css'; + +type Rule = Exclude; + +const soundnessPage = '/docs/proof-rules/approximations'; +const approximationGuide = soundnessPage + '#kinds-of-approximations'; +const compatibleBody = { label: 'Compatible approximation', href: '#soundness' }; +const bodyRequirements = { + induction: compatibleBody, + unroll: compatibleBody, + omega: compatibleBody, + ast: { label: , href: '#soundness' }, + ost: { label: , href: '#soundness' }, +}; + +const lower = <>Lower bounds proc; +const upper = <>Upper bounds coproc; + +export default function ProofRuleGuarantee({ rule }: { rule: Rule }) { + const { cases } = PROOF_RULES[rule]; + const body = bodyRequirements[rule]; + const showRefutation = cases.some(({ refutation }) => refutation); + + return ( + + ); +} diff --git a/website/src/components/ProofRuleQuickCard.tsx b/website/src/components/ProofRuleQuickCard.tsx index 250d774a..4a04dc18 100644 --- a/website/src/components/ProofRuleQuickCard.tsx +++ b/website/src/components/ProofRuleQuickCard.tsx @@ -4,6 +4,7 @@ import styles from './ProofRuleQuickCard.module.css'; export type QuickRuleLink = { href: string; label: string; + qualifier?: string; }; export type QuickRuleRow = { @@ -41,6 +42,7 @@ function renderCodeLinks(items: QuickRuleLink[]): ReactNode[] { {index > 0 ? ', ' : null} {item.label} + {item.qualifier && <> ({item.qualifier})} )); } diff --git a/website/src/data/proofRules.ts b/website/src/data/proofRules.ts new file mode 100644 index 00000000..f2380100 --- /dev/null +++ b/website/src/data/proofRules.ts @@ -0,0 +1,73 @@ +const least = { id: 'lfp', calculi: ['@wp', '@ert'] } as const; +const greatest = { id: 'gfp', calculi: ['@wlp', '@uwlp'] } as const; + +export const FIXED_POINTS = [least, greatest] as const; + +type FixedPoint = (typeof FIXED_POINTS)[number]; +type Calculus = FixedPoint['calculi'][number]; +type Approximation = 'Under' | 'Over'; + +type BoundCase = { + fixedPoint: FixedPoint['id']; + calculi: readonly Calculus[]; + approximation: Approximation; + refutation?: true; +}; + +type Rule = { + title: string; + href: string; + annotations: readonly string[]; + cases: readonly BoundCase[]; +}; + +const unfoldingCases: readonly BoundCase[] = [ + { fixedPoint: least.id, calculi: least.calculi, approximation: 'Under', refutation: true }, + { fixedPoint: greatest.id, calculi: greatest.calculi, approximation: 'Over', refutation: true }, +]; + +const inductionCases: readonly BoundCase[] = [ + { fixedPoint: least.id, calculi: least.calculi, approximation: 'Over' }, + { fixedPoint: greatest.id, calculi: greatest.calculi, approximation: 'Under' }, +]; + +type RuleId = 'induction' | 'unroll' | 'omega' | 'ast' | 'ost' | 'calls'; + +export const PROOF_RULES: Record = { + induction: { + title: 'Induction and k-Induction', + href: '/docs/proof-rules/induction', + annotations: ['@invariant', '@k_induction'], + cases: inductionCases, + }, + unroll: { + title: 'Loop Unrolling', + href: '/docs/proof-rules/unrolling', + annotations: ['@unroll'], + cases: unfoldingCases, + }, + omega: { + title: 'ω-Invariants', + href: '/docs/proof-rules/omega-invariants', + annotations: ['@omega_invariant'], + cases: unfoldingCases, + }, + ast: { + title: 'Almost-Sure Termination', + href: '/docs/proof-rules/ast#new-proof-rule', + annotations: ['@ast'], + cases: [{ fixedPoint: least.id, calculi: ['@wp'], approximation: 'Under' }], + }, + ost: { + title: 'Optional Stopping Theorem', + href: '/docs/proof-rules/ost', + annotations: ['@ost'], + cases: [{ fixedPoint: least.id, calculi: least.calculi, approximation: 'Under' }], + }, + calls: { + title: 'Procedure Calls', + href: '/docs/heyvl/procs#calling-procedures', + annotations: [], + cases: inductionCases.map((entry) => ({ ...entry, refutation: true })), + }, +}; From 44ca58ebc6c27f9f8c21f526f8810cbd6964e62c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 11:51:58 +0100 Subject: [PATCH 10/32] past rule: summarize loops for expected runtime upper bounds --- pgcl/examples-heyvl/test_past.heyvl | 4 +- pgcl/pgcl2heyvl/pgcl2heyvl/encode.py | 21 +- src/intrinsic/annotations.rs | 15 ++ src/proof_rules/calculus/soundness_checker.rs | 3 +- src/proof_rules/past.rs | 159 ++++++++++++- src/proof_rules/tests.rs | 90 +++++-- tests/loop-rules/past2013/annotated.heyvl | 21 ++ vscode-ext/src/HeyVlReference.ts | 5 +- website/docs/proof-rules/approximations.md | 2 - website/docs/proof-rules/past.md | 223 ++++++++---------- website/src/components/ProofRuleGuarantee.tsx | 1 + website/src/data/proofRules.ts | 8 +- 12 files changed, 374 insertions(+), 178 deletions(-) create mode 100644 tests/loop-rules/past2013/annotated.heyvl diff --git a/pgcl/examples-heyvl/test_past.heyvl b/pgcl/examples-heyvl/test_past.heyvl index 2fbe1fab..5ec41600 100644 --- a/pgcl/examples-heyvl/test_past.heyvl +++ b/pgcl/examples-heyvl/test_past.heyvl @@ -1,6 +1,8 @@ // Auto-generated by pgcl2heyvl from test_past.pgcl // -proc main(init_x: UInt) -> (x: UInt) +coproc main(init_x: UInt) -> (x: UInt) + pre ∞ + post 0 { var prob_choice: Bool x = init_x diff --git a/pgcl/pgcl2heyvl/pgcl2heyvl/encode.py b/pgcl/pgcl2heyvl/pgcl2heyvl/encode.py index 2678db6e..0a2a1b95 100644 --- a/pgcl/pgcl2heyvl/pgcl2heyvl/encode.py +++ b/pgcl/pgcl2heyvl/pgcl2heyvl/encode.py @@ -331,18 +331,17 @@ def encode_past(program: Program, invariant: Expr, eps: Expr, hey_instrs = _encode_instrs(program.instructions) annotated_block = _annotate_heyblock(hey_instrs, [(Encoding.PAST, hey_arg_list)]) - - return_object = _encode_proc(name="main", - body= prob_choice_decl + _encode_init_assign(program) + annotated_block, - input=_encode_var_dict(_get_init_vars(program)), - output=_encode_var_dict(program.variables), - direction=_encode_direction, - ) - - return [ - return_object - ] + return [HeyProc( + direction=Direction.UP, + proc_name="main", + param=_encode_var_dict(_get_init_vars(program)), + out=_encode_var_dict(program.variables), + body=prob_choice_decl + _encode_init_assign(program) + annotated_block, + pre=HeyExpr("∞"), + post=HeyExpr("0"), + comment="", + )] def encode_optional_stopping(program: Program, post: Expr, invariant: Expr, diff --git a/src/intrinsic/annotations.rs b/src/intrinsic/annotations.rs index fd00109c..f3d7f514 100644 --- a/src/intrinsic/annotations.rs +++ b/src/intrinsic/annotations.rs @@ -34,6 +34,11 @@ pub enum AnnotationError { span: Span, annotation_name: Ident, }, + WrongProcedureDirection { + span: Span, + annotation_name: Ident, + required: Direction, + }, NotOnWhile { span: Span, annotation_name: Ident, @@ -86,6 +91,16 @@ impl AnnotationError { "The annotation `{annotation_name}` can only be used inside a procedure." )) .with_label(Label::new(annotation_name.span).with_message("here")), + AnnotationError::WrongProcedureDirection { + span, + annotation_name, + required, + } => Diagnostic::new(ReportKind::Error, span) + .with_message(format!( + "`@{annotation_name}` requires an enclosing `{}`.", + required.prefix("proc") + )) + .with_label(Label::new(span).with_message("Proof rule applied here")), AnnotationError::NotOnWhile { span, annotation_name, diff --git a/src/proof_rules/calculus/soundness_checker.rs b/src/proof_rules/calculus/soundness_checker.rs index b3a2f9a5..151dde5a 100644 --- a/src/proof_rules/calculus/soundness_checker.rs +++ b/src/proof_rules/calculus/soundness_checker.rs @@ -266,7 +266,8 @@ fn track_approximation_in_statement( .collect(), StmtKind::If(_, ref block1, ref block2) | StmtKind::Demonic(ref block1, ref block2) - | StmtKind::Angelic(ref block1, ref block2) => { + | StmtKind::Angelic(ref block1, ref block2) + | StmtKind::Additive(ref block1, ref block2) => { let mut acc = track_approximation_in_block(block1, direction, calculus, tcx); acc.extend(track_approximation_in_block( block2, direction, calculus, tcx, diff --git a/src/proof_rules/past.rs b/src/proof_rules/past.rs index 1075019c..d1c33bcf 100644 --- a/src/proof_rules/past.rs +++ b/src/proof_rules/past.rs @@ -6,21 +6,26 @@ //! - `eps`: a positive real number used for the epsilon value from the proof rule, must be a literal //! - `k`: a positive real number used for the k value from the proof rule, must be a literal //! -//! Note that eps must be smaller than k! +//! The decrease must be positive and smaller than k. //! use std::{any::Any, fmt}; +use num::Zero; + use crate::{ ast::{ - util::VariableCollector, visit::VisitorMut, BinOpKind, DeclKind, Direction, Expr, - ExprBuilder, Files, Ident, ProcSpec, SourceFilePath, Span, Spanned, Stmt, StmtKind, Symbol, - TyKind, UnOpKind, + util::VariableCollector, + visit::{walk_expr, walk_stmt, VisitorMut}, + BinOpKind, DeclKind, Diagnostic, Direction, Expr, ExprBuilder, ExprKind, Files, Ident, + ProcSpec, SourceFilePath, Span, Spanned, Stmt, StmtKind, Symbol, TyKind, UnOpKind, }, front::{ resolve::{Resolve, ResolveError}, tycheck::{Tycheck, TycheckError}, }, - intrinsic::annotations::{tycheck_annotation_call, AnnotationDecl, AnnotationError, Calculus}, + intrinsic::annotations::{ + tycheck_annotation_call, AnnotationDecl, AnnotationError, AnnotationKind, Calculus, + }, proof_rules::calculus::{ApproximationKind, CalculusType, FixpointKind}, tyctx::TyCtx, }; @@ -83,6 +88,24 @@ impl Encoding for PASTAnnotation { Ok(()) } + fn validate( + &self, + tcx: &TyCtx, + call_span: Span, + _args: &[Expr], + inner_stmt: &Stmt, + ) -> Result, AnnotationError> { + if let StmtKind::While(_, body) = &inner_stmt.node { + PastBodyValidator { + tcx, + annotation_name: self.name(), + call_span, + } + .visit_block(&mut body.clone())?; + } + Ok(vec![]) + } + fn get_approximation( &self, fixpoint_kind: FixpointKind, @@ -96,7 +119,7 @@ impl Encoding for PASTAnnotation { } } match (fixpoint_kind, inner_approximation_kind) { - (FixpointKind::Least, ApproximationKind::EXACT) => ApproximationKind::EXACT, + (FixpointKind::Least, ApproximationKind::EXACT) => ApproximationKind::OVER, _ => ApproximationKind::UNKNOWN, } } @@ -114,16 +137,24 @@ impl Encoding for PASTAnnotation { ) -> Result { let annotation_span = enc_env.call_span; + if enc_env.direction != Direction::Up { + return Err(AnnotationError::WrongProcedureDirection { + span: annotation_span, + annotation_name: self.name(), + required: Direction::Up, + }); + } + let [inv, eps, k] = three_args(args); let builder = ExprBuilder::new(annotation_span); let eps_val = lit_rational(eps); let k_val = lit_rational(k); - if eps_val >= k_val { + if eps_val.is_zero() || eps_val >= k_val { return Err(AnnotationError::WrongArgument { span: annotation_span, arg: eps.clone(), - message: String::from("eps must be smaller than k."), + message: String::from("epsilon must be positive and smaller than k."), }); } @@ -143,10 +174,19 @@ impl Encoding for PASTAnnotation { let bounded_on_exit = encode_exit_bound(tcx, &enc_env, loop_guard, inv, &k); let k_bounded_by_invariant = encode_continuation_bound(tcx, &enc_env, loop_guard, inv, &k); - let decreases = encode_decrease(tcx, &enc_env, inner_stmt, loop_guard, inv, &eps); + let mut variables = VariableCollector::from_stmt(inner_stmt); + variables.add_expr(inv); + let decreases = + encode_decrease(tcx, &enc_env, inner_stmt, loop_guard, inv, &eps, &variables); + let summary = encode_summary( + annotation_span, + loop_guard, + inv, + variables.free_modified().collect(), + ); Ok(GeneratedEncoding { - block: Spanned::new(annotation_span, vec![]), + block: Spanned::new(annotation_span, vec![summary]), decls: Some(vec![bounded_on_exit, k_bounded_by_invariant, decreases]), diagnostics: vec![], }) @@ -161,6 +201,92 @@ impl Encoding for PASTAnnotation { } } +/// Summarize the loop using its possible exit states and an upper bound on its expected reward. +/// +/// ```text +/// if G { tick I; cohavoc modified; coassume ?(G) } else {} +/// ``` +/// +/// `modified` consists of the variables modified by the body and visible after it. +/// The summary charges the ranking `I` from the entry state. +fn encode_summary(span: Span, guard: &Expr, invariant: &Expr, modified_vars: Vec) -> Stmt { + let builder = ExprBuilder::new(span); + let mut body = vec![Spanned::new(span, StmtKind::Tick(invariant.clone()))]; + if !modified_vars.is_empty() { + body.push(Spanned::new( + span, + StmtKind::Havoc(Direction::Up, modified_vars), + )); + } + let condition = builder.unary(UnOpKind::Embed, Some(TyKind::EUReal), guard.clone()); + body.push(Spanned::new( + span, + StmtKind::Assume(Direction::Up, condition), + )); + + Spanned::new( + span, + StmtKind::If( + guard.clone(), + Spanned::new(span, body), + Spanned::new(span, vec![]), + ), + ) +} + +/// The ranking argument needs a terminating probabilistic transition for each body execution. +struct PastBodyValidator<'tcx> { + tcx: &'tcx TyCtx, + annotation_name: Ident, + call_span: Span, +} + +impl PastBodyValidator<'_> { + fn unsupported(&self, span: Span, message: &str) -> AnnotationError { + AnnotationError::UnsupportedStatement { + span: self.call_span, + annotation_name: self.annotation_name, + statement_span: span, + message: message.to_owned(), + note: Some("`@past` requires a loop-free probabilistic body."), + } + } +} + +impl VisitorMut for PastBodyValidator<'_> { + type Err = AnnotationError; + + fn visit_stmt(&mut self, stmt: &mut Stmt) -> Result<(), Self::Err> { + match &stmt.node { + StmtKind::Seq(_) + | StmtKind::Var(_) + | StmtKind::Assign(_, _) + | StmtKind::Tick(_) + | StmtKind::If(_, _, _) + | StmtKind::Label(_) => {} + StmtKind::Annotation(_, name, _, _) + if matches!( + self.tcx.get(*name).unwrap().as_ref(), + DeclKind::AnnotationDecl(AnnotationKind::Slicing(_)) + ) => {} + _ => return Err(self.unsupported(stmt.span, "Unsupported statement in the loop body.")), + } + walk_stmt(self, stmt) + } + + fn visit_expr(&mut self, expr: &mut Expr) -> Result<(), Self::Err> { + if let ExprKind::Call(ident, _) = &expr.kind { + if matches!( + self.tcx.get(*ident).unwrap().as_ref(), + DeclKind::ProcDecl(_) + ) { + return Err(self.unsupported(expr.span, "Procedure calls are not supported.")); + } + } + walk_expr(self, expr) + } +} + /// Check `[!G] * I <= K` on terminating states. fn encode_exit_bound( tcx: &TyCtx, @@ -212,7 +338,7 @@ fn encode_exit_bound( generate_proc(span, proc_info, enc_env.base_proc_ident, tcx) } -/// Check `[G] * K <= [G] * I + [!G]` on continuing states. +/// Check finiteness of the ranking and `[G] * K <= [G] * I + [!G]`. fn encode_continuation_bound( tcx: &TyCtx, enc_env: &EncodingEnvironment, @@ -250,6 +376,14 @@ fn encode_continuation_bound( ), ); + let finite = builder.binary( + BinOpKind::Lt, + Some(TyKind::Bool), + inv.clone(), + builder.infinity_lit(), + ); + let condition = builder.binary(BinOpKind::And, Some(TyKind::Bool), finite, condition); + let condition = builder.unary(UnOpKind::Embed, Some(TyKind::EUReal), condition); let variables = VariableCollector::from_expr(&condition) .used_variables .into_iter() @@ -279,12 +413,11 @@ fn encode_decrease( loop_guard: &Expr, inv: &Expr, eps: &Expr, + variables: &VariableCollector, ) -> DeclKind { let span = enc_env.call_span; let builder = ExprBuilder::new(span); - let mut variables = VariableCollector::from_stmt(loop_stmt); - variables.add_expr(inv); let modified_vars: Vec = variables.free_modified().collect(); // Substitute initial values only for modified variables, in expression order. diff --git a/src/proof_rules/tests.rs b/src/proof_rules/tests.rs index 90629e8a..108ef592 100644 --- a/src/proof_rules/tests.rs +++ b/src/proof_rules/tests.rs @@ -768,19 +768,29 @@ fn test_ost_expected_runtime() { fn test_past_transform() { let mut test_string = String::from( r#" - proc main() -> () { + coproc main() -> () { var x: UInt - { } + { + if (1 <= x) { + tick cast(EUReal, (x + 1)) + cohavoc x + coassume ?((1 <= x)) + } else { + + } + } } proc main_past_bounded_on_exit_0(x: UInt) -> () { assert ?((([! ((1 <= x))] * cast(EUReal, (x + 1))) <= cast(EUReal, 10/10))) } proc main_past_k_bounded_by_invariant_0(x: UInt) -> () { - assert ( - ([(1 <= x)] * cast(EUReal, 10/10)) <= ( - ([(1 <= x)] * cast(EUReal, (x + 1))) + [! ((1 <= x))] + assert ?(( + (cast(EUReal, (x + 1)) < ∞) && ( + ([(1 <= x)] * cast(EUReal, 10/10)) <= ( + ([(1 <= x)] * cast(EUReal, (x + 1))) + [! ((1 <= x))] + ) ) - ) + )) } coproc main_past_decreases_0(init_x: UInt) -> (x: UInt) pre ( @@ -802,7 +812,7 @@ fn test_past_transform() { "#, ); let source = r#" - proc main() -> () { + coproc main() -> () { var x: UInt @past(x+1, 0.5, 1.0) while 1 <= x { @@ -819,14 +829,14 @@ fn test_past_transform() { #[test] fn test_past_rejects_infinite_loop() { // Issue #122 also fails without tick, isolating the required decrease. - for body in ["tick 1", ""] { + for (rank, body) in [("1", "tick 1"), ("1", ""), ("∞", "")] { let source = format!( r#" @ert coproc main() -> () pre 0 post 0 {{ - @past(1, 0.5, 1) + @past({rank}, 0.5, 1) while true {{ {body} }} }} "# @@ -848,18 +858,48 @@ fn test_past_rejects_infinite_loop() { } #[test] -fn test_past_accepts_deterministic_countdown() { - let source = r#" - proc main(init_x: UInt) -> (x: UInt) - { - x = init_x - @past(x + 1, 0.5, 1) - while 0 < x { - x = x - 1 - } +fn test_past_requires_coproc() { + let source = "@ert proc main() -> () { @past(1, 0.5, 1) while false {} }"; + let error = verify_test(source).0.unwrap_err(); + assert!(error + .to_string() + .contains("`@past` requires an enclosing `coproc`")); +} + +#[test] +fn test_past_summarizes_tick_cost() { + for (pre, post, expected) in [ + ("ite(n > 0, 2 * n + 1, 0)", "[x > 0]", true), + ("0", "0", false), + ] { + let source = format!( + r#" + @ert coproc main(n: UInt) -> (x: UInt) + pre {pre} + post {post} + {{ + x = n + @past(2 * x + 1, 0.5, 1) + while x > 0 {{ + tick 1 + x = x - 1 + }} + }} + "# + ); + let (result, server) = verify_test(&source); + assert_eq!(result.unwrap(), expected, "{source}"); + if expected { + assert!(server.diagnostics.is_empty(), "{source}"); } - "#; - assert!(verify_test(source).0.unwrap()); + } +} + +#[test] +fn test_past_requires_positive_epsilon() { + let source = "@ert coproc main() -> () { @past(1, 0, 1) while true {} }"; + let error = verify_test(source).0.unwrap_err(); + assert!(error.to_string().contains("epsilon must be positive")); } #[test] @@ -868,7 +908,9 @@ fn test_past_passes_unchanged_parameters_to_generated_procedures() { let source = format!( r#" @ert - proc main(n: UInt) -> () + coproc main(n: UInt) -> () + pre 2 * (n + 1) + 2 + post 0 {{ var x: UInt = 2 @past({invariant}, 1, 2) @@ -887,7 +929,9 @@ fn test_past_passes_unchanged_parameters_to_generated_procedures() { #[test] fn test_past_accepts_probabilistic_countdown() { let source = r#" - proc main(init_x: UInt) -> (x: UInt) + coproc main(init_x: UInt) -> (x: UInt) + pre init_x + 1 + post 0 { var prob_choice: Bool x = init_x @@ -1402,7 +1446,7 @@ fn test_k_induction_nested_transform() { #[test] fn test_past_not_on_while() { let source = r#" - proc main() -> () { + coproc main() -> () { var x: UInt @past(x+1, 0.5, 1.0) x= x+1; diff --git a/tests/loop-rules/past2013/annotated.heyvl b/tests/loop-rules/past2013/annotated.heyvl new file mode 100644 index 00000000..35758a7f --- /dev/null +++ b/tests/loop-rules/past2013/annotated.heyvl @@ -0,0 +1,21 @@ +// RUN: @caesar @file + +// A fair coin either decreases the counter or leaves it unchanged. +// The ranking superinvariant proves positive almost-sure termination. +@ert +coproc countdown(init_x: UInt) -> (x: UInt) + pre 3 * init_x + 1 + post 0 +{ + x = init_x + // The ranking expression 3 * x + 1 decreases by 0.5 in expectation after paying for the flip. + // The threshold 1 bounds the expression from below while x > 0 and from above at exit. + @past(3 * x + 1, 0.5, 1) + while x > 0 { + reward 1 + var step: Bool = flip(0.5) + if step { + x = x - 1 + } else {} + } +} diff --git a/vscode-ext/src/HeyVlReference.ts b/vscode-ext/src/HeyVlReference.ts index a864e786..7c625826 100644 --- a/vscode-ext/src/HeyVlReference.ts +++ b/vscode-ext/src/HeyVlReference.ts @@ -450,8 +450,9 @@ export const HEYVL_REFERENCE: Readonly> = { }, "@past": { title: "@past(invariant, epsilon, K) — positive almost-sure termination", - description: "Proves that a loop terminates in a finite expected number of iterations.", - details: "The non-negative expression `invariant` measures the work remaining and must decrease in expectation by at least `epsilon` per iteration. " + + description: "In an `@ert coproc`, proves that a loop terminates in a finite expected number of iterations and bounds its expected reward.", + details: "Use `post 0` and a finite upper bound on the procedure's expected reward in `pre`.\n\n" + + "The finite, non-negative expression `invariant` must decrease in expectation by at least `epsilon` per iteration after accounting for rewards. " + "Its value must be at least `K` while the guard holds, and at most `K` on exit.\n\n" + "`epsilon` and `K` are `UReal` literals with `0 < epsilon < K`.", documentation: `${docs}proof-rules/past/#past-from-ranking-superinvariants`, diff --git a/website/docs/proof-rules/approximations.md b/website/docs/proof-rules/approximations.md index 160a33d8..522b5db2 100644 --- a/website/docs/proof-rules/approximations.md +++ b/website/docs/proof-rules/approximations.md @@ -395,8 +395,6 @@ See the [Quick Overview](#quick-overview) for supported refutations. -The [`@past` annotation](./past#past-from-ranking-superinvariants) checks positive almost-sure termination. - For loops, the loop-body approximation must be compatible with the chosen rule. For example, for k-Induction under , the loop body must be so the whole loop is . Additionally, the rules [Almost-Sure Termination Rule](./ast#new-proof-rule), [Positive Almost-Sure Termination Rule](./past#past-from-ranking-superinvariants), and [Optional Stopping Theorem](./ost) require the loop body to be . diff --git a/website/docs/proof-rules/past.md b/website/docs/proof-rules/past.md index 20325b05..897e1696 100644 --- a/website/docs/proof-rules/past.md +++ b/website/docs/proof-rules/past.md @@ -4,111 +4,103 @@ sidebar_position: 6 # Positive Almost-Sure Termination -_Positive almost-sure termination_ (PAST for short) means that a program [terminates almost-surely](./ast.md) and the expected runtime to termination is finite. -In terms of the [expected runtime calculus](./approximations.md#calculus-annotations), this means that `ert[C](0) < ∞` holds for a program `C`. - -In Caesar, there are several ways to prove PAST: - ```mdx-code-block +import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; import TOCInline from '@theme/TOCInline'; +``` + + + +_Positive almost-sure termination_ (PAST for short) means that a program [terminates almost surely](./ast.md) and the expected runtime to termination is finite. +In HeyVL, [`reward` statements](../heyvl/statements.md#reward-and-weigh) model the cost measured by the expected runtime calculus. +`tick` is an alias for `reward`. +```mdx-code-block ``` -## Upper Bounds on ert - -The simplest way to prove positive almost-sure termination is by proving a finite upper bound $g$ on the expected runtime of a program using the expected runtime calculus, i.e. $\mathrm{ert}\llbracket C \rrbracket(0) \leq g$. -The upper bound $g$ must be finite: for every state $s$, $g(s) < \infty$ must hold. +## Upper Bounds on `ert` -Upper bounds on the expected runtime can be shown with [Park induction](./induction.md). -The ranking-superinvariant rule below can be viewed as a derived way of constructing such an `ert`-superinvariant. +[Park induction](./induction.md) suffices to prove PAST when every nonterminating execution accumulates infinite total reward. +A finite upper bound $\mathrm{ert}\llbracket C \rrbracket(0) \leq g < \infty$ then establishes both almost-sure termination and finite expected reward. +If each execution of the loop body terminates, adding `reward 1` per iteration makes the iteration count at most the total reward. ## PAST from Ranking Superinvariants -Caesar supports proofs of PAST using *ranking superinvariants*, also called *ranking supermartingales*. -We use the `wp`-based formulation of [Theorem 6.3 in Benjamin Kaminski's PhD thesis](http://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=143). -Closely related statements also appear as: +In an `@ert coproc`, `@past(I, epsilon, K)` proves that a loop terminates almost surely using a *ranking superinvariant* $I$. +From an initial state $s$, it bounds the expected number of iterations by $I(s) / \epsilon$ and the expected sum of the loop's rewards by $I(s)$. +The [soundness proof](#past-via-ert-superinvariants) derives these guarantees by Park induction. -- Theorem 4 of [„*Probabilistic Program Analysis with Martingales*“](https://doi.org/10.1007/978-3-642-39799-8_34) by Chakarov and Sankaranarayanan (CAV 2013). -- Theorem 5.6 of [„*Probabilistic Termination: Soundness, Completeness, and Compositionality*“](https://doi.org/10.1145/2775051.2677001) by Fioriti and Hermanns (POPL 2015). +If the `coproc` omits its calculus annotation, `@past` selects least-fixed-point semantics. -Ranking superinvariants are supported via Caesar's built-in `@past` annotation on `while` loops. +The rule follows the ranking-superinvariant argument in [Kaminski (2019), Theorem 6.3](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=143). +Related results use the term *ranking supermartingale* [Chakarov and Sankaranarayanan (2013), Theorem 4](https://doi.org/10.1007/978-3-642-39799-8_34) and [Ferrer Fioriti and Hermanns (2015), Theorem 5.6](https://doi.org/10.1145/2676726.2677001). -### Formal Theorem +### Verification Conditions {#formal-theorem} -Consider a loop `while G { Body }` whose `Body` is exact.[^exact-body] -The loop's used and modified variables, except the ones declared within the loop, are referred to as `vars`. -Let +Let $L$ be a loop `while G { Body }` with a loop-free probabilistic body and valid sampling parameters. +The body may use local declarations, assignments, conditionals, built-in sampling, and rewards. +The constants $\epsilon$ and $K$ are `UReal` literals with $0 < \epsilon < K$. -- $I$, a function assigning a value $\mathbb{R}_{\geq 0}$ to every state, -- $\epsilon \in \mathbb{R}_{> 0}$, -- $K \in \mathbb{R}_{\geq 0}$, +1. **Exit.** $I \leq K$ when $G$ is false. +2. **Ranking.** $I < \infty$ in every state and $K \leq I$ when $G$ is true. +3. **Decrease.** $\mathrm{ert}\llbracket \mathtt{Body} \rrbracket(I) \leq I - \epsilon$ when $G$ is true. -such that all the following conditions are fulfilled: +In the decrease check, $\mathrm{ert}$ adds the body's expected reward to the expected value of $I$ after the iteration. +The sum must be at least $\epsilon$ below the entry value of $I$. -1. $I$ is bounded on terminating states: $[\neg G] \cdot I \leq K$, -
- HeyVL Encoding +
+Generated HeyVL checks - ```heyvl - proc I_bounded_on_exit(vars: ...) -> () - { - assert ?(([!G(vars)] * I(vars)) <= K) - } - ``` +Here `vars` denotes the variables used by the loop or annotation, excluding loop-local variables. -
-2. $K$ is small enough on states where the loop continues: $[G] \cdot K \leq [G] \cdot I + [\neg G]$, -
- HeyVL Encoding +```heyvl +proc I_bounded_on_exit(vars: ...) -> () +{ + assert ?(([!G(vars)] * I(vars)) <= K) +} - ```heyvl - proc K_bounded_by_I(vars: ...) -> () - { - assert ?(([G(vars)] * K) <= (([G(vars)] * I(vars)) + [!G(vars)])) - } - ``` - -
-3. $I$ decreases in expectation by at least $\epsilon$ in each loop iteration: - $[G] \cdot \mathrm{wp}\llbracket Body \rrbracket(I) \leq [G] \cdot (I - \epsilon)$,[^literature-condition-3] -
- HeyVL Encoding - - ```heyvl - coproc I_decreases(init_vars: ...) -> (vars: ...) - pre [G(init_vars)] * (I(init_vars) - epsilon) - post 0 - { - vars = init_vars // set current state to input values - if G { - Body - assert I(vars) - assume 0 - } else {} - } - ``` +proc K_bounded_by_I(vars: ...) -> () +{ + assert ?(I(vars) < ∞ && ([G(vars)] * K <= [G(vars)] * I(vars) + [!G(vars)])) +} -
+coproc I_decreases(init_vars: ...) -> (vars: ...) + pre [G(init_vars)] * (I(init_vars) - epsilon) + post 0 +{ + vars = init_vars + if G { + Body + assert I(vars) + assume 0 + } else {} +} +``` -Then `while G { Body }` is universally positively almost-surely terminating, i.e. `ert[while G { Body }](0) < ∞`. +
### Usage -Consider the following example, where we have a loop that decrements a variable `x` with probability `0.5` in each iteration. -The loop terminates with probability `1` and the expected number of iterations is finite. -We show this by using the `@past` annotation on the loop. +To bound the procedure's expected reward, set `post 0` and give a finite upper bound in `pre`. + +The countdown charges one reward per coin flip and decrements `x` on heads. +Caesar verifies almost-sure termination and an upper bound of $3 \cdot \mathtt{init\_x} + 1$ on the expected number of flips. ```heyvl -proc main(init_x: UInt) -> (x: UInt) +@ert +coproc main(init_x: UInt) -> (x: UInt) + pre 3 * init_x + 1 + post 0 { var prob_choice: Bool x = init_x @past( - /* invariant: */ x + 1, + /* invariant: */ 3 * x + 1, /* epsilon: */ 0.5, /* K: */ 1) while 0 < x { + reward 1 prob_choice = flip(0.5) if prob_choice { x = x - 1 @@ -117,70 +109,53 @@ proc main(init_x: UInt) -> (x: UInt) } ``` -**Inputs:** - -- `invariant`: The ranking superinvariant. -- `epsilon`: The expected decrease of the ranking superinvariant in one loop iteration. -- `K`: The constant from Conditions 1 and 2. +On heads, $3 \cdot x + 1$ drops by $3$, so the expected drop after charging the reward is $\tfrac12 \cdot 3 - 1 = \tfrac12$. -:::note +### Loop Summary -Mathematically, the rule requires $\epsilon > 0$. -Currently, Caesar requires `epsilon` and `K` to be literal `UReal` expressions and checks $\epsilon < K$. +The summary adds the reward bound $I$, evaluated at entry, to the supremum of the postexpectation over states that satisfy $\neg G$ and agree with the entry state outside `modified`. +Here `modified` lists the variables assigned by the body that remain in scope after the loop. +When $G$ is false on entry, the summary acts as `skip`. -::: - -### PAST via `ert` Superinvariants - -Every use of `@past` can be replaced by a proof via an `ert`-superinvariant. - -Let `L = while G { Body }`. -Assume that $\mathrm{ert}\llbracket Body \rrbracket(0) = 0$ and that the decrease premise of `@past` holds for some $V \colon \mathrm{States} \to \mathbb{R}_{\geq 0}$ and some $\epsilon > 0$, i.e. $[G] \cdot \mathrm{wp}\llbracket Body \rrbracket(V) \leq [G] \cdot (V - \epsilon)$. +```heyvl +if G { + tick I + cohavoc modified + coassume ?(G) +} else {} +``` -Then the following expectation is an `ert`-superinvariant of $L$ with respect to postexpectation $0$: -$$ - J = 1 + [G] \cdot \frac{V}{\epsilon} -$$ -Hence, by [Park induction](./induction.md), $\mathrm{ert}\llbracket L \rrbracket(0) \leq J$. -In particular, $L$ is PAST since $J$ is finite. +This [over-approximation](./approximations.md#kinds-of-approximations) can yield spurious counterexamples. -
-Generalization and Proof +### Soundness {#past-via-ert-superinvariants} -More generally, assume that $\mathrm{ert}\llbracket Body \rrbracket(0) \leq c$ holds for some constant $c \in \mathbb{R}_{\geq 0}$. -Then +We prove that the [verification conditions](#formal-theorem) imply almost-sure termination and bound the expected number of iterations and the expected reward. +Under $G$, the parameter and ranking checks give $\epsilon < K \leq I < \infty$. +Starting from the decrease check, we derive a bound for `Body; reward epsilon`, which charges an extra $\epsilon$ per completed iteration. $$ - J = 1 + [G] \cdot \frac{c + 1}{\epsilon} \cdot V +\begin{aligned} + &\mathrm{ert}\llbracket \mathtt{Body} \rrbracket(I) \leq I - \epsilon + && \text{(decrease check)} \\ + \iff{} &\mathrm{ert}\llbracket \mathtt{Body} \rrbracket(I) + \epsilon \leq I + && \text{(add }\epsilon\text{)} \\ + \iff{} &\mathrm{ert}\llbracket \mathtt{Body} \rrbracket(I + \epsilon) \leq I + && \text{(the body terminates)} \\ + \iff{} &\mathrm{ert}\llbracket \mathtt{Body};\,\mathtt{reward}\,\epsilon \rrbracket(I) \leq I + && \text{(composition).} +\end{aligned} $$ -is an `ert`-superinvariant of $L$. -The theorem above is the special case $c = 0$. - -Write $\Phi_0$ for the `ert` loop-characteristic function of $L$ with postexpectation $0$. -Then +The last inequality and $0 \leq I$ when $G$ is false give the [Park induction](./induction.md) premises for `while G { Body; reward epsilon }` with postexpectation $0$. +For a run with $T$ iterations the extra reward contributes $\epsilon \cdot T$, so from an initial state $s$ we have $$ -\begin{align*} - \Phi_0(J) - &= 1 + [\neg G] \cdot 0 + [G] \cdot \mathrm{ert}\llbracket Body \rrbracket(J) \tag{definition} \\ - &= 1 + [G] \cdot \left(\mathrm{ert}\llbracket Body \rrbracket(0) + \mathrm{wp}\llbracket Body \rrbracket(J)\right) \tag{ert decomposition} \\ - &= 1 + [G] \cdot \left(\mathrm{ert}\llbracket Body \rrbracket(0) + \mathrm{wp}\llbracket Body \rrbracket\left(1 + \frac{c + 1}{\epsilon} \cdot [G] \cdot V\right)\right) \tag{definition of $J$} \\ - &= 1 + [G] \cdot \left(\mathrm{ert}\llbracket Body \rrbracket(0) + \mathrm{wp}\llbracket Body \rrbracket(1) + \mathrm{wp}\llbracket Body \rrbracket\left(\frac{c + 1}{\epsilon} \cdot [G] \cdot V\right)\right) \tag{linearity of wp} \\ - &= 1 + [G] \cdot \left(\mathrm{ert}\llbracket Body \rrbracket(0) + \mathrm{wp}\llbracket Body \rrbracket(1) + \frac{c + 1}{\epsilon} \cdot \mathrm{wp}\llbracket Body \rrbracket([G] \cdot V)\right) \tag{homogeneity of wp} \\ - &\leq 1 + [G] \cdot \left(c + \mathrm{wp}\llbracket Body \rrbracket(1) + \frac{c + 1}{\epsilon} \cdot \mathrm{wp}\llbracket Body \rrbracket([G] \cdot V)\right) \tag{$\mathrm{ert}\llbracket Body \rrbracket(0) \leq c$} \\ - &\leq 1 + [G] \cdot \left(c + 1 + \frac{c + 1}{\epsilon} \cdot \mathrm{wp}\llbracket Body \rrbracket([G] \cdot V)\right) \tag{feasibility} \\ - &\leq 1 + [G] \cdot \left(c + 1 + \frac{c + 1}{\epsilon} \cdot \mathrm{wp}\llbracket Body \rrbracket(V)\right) \tag{monotonicity of wp} \\ - &\leq 1 + [G] \cdot \left(c + 1 + \frac{c + 1}{\epsilon} \cdot (V - \epsilon)\right) \tag{decrease condition} \\ - &= 1 + [G] \cdot \left(c + 1 + \frac{c + 1}{\epsilon} \cdot V - (c + 1)\right) \tag{arithmetic} \\ - &= 1 + [G] \cdot \frac{c + 1}{\epsilon} \cdot V \tag{simplify} \\ - &= J \tag{arithmetic} -\end{align*} +\begin{aligned} + I(s) + &\geq \mathrm{ert}\llbracket \mathtt{while}\ G\ \{\mathtt{Body};\,\mathtt{reward}\,\epsilon\} \rrbracket(0)(s) \\ + &= \mathrm{ert}\llbracket L \rrbracket(0)(s) + \epsilon \cdot \mathbb{E}_s[T]. +\end{aligned} $$ -So $J$ is an `ert`-superinvariant of $L$, and [Park induction](./induction.md) yields $\mathrm{ert}\llbracket L \rrbracket(0) \leq J$. - -
- -[^exact-body]: Caesar only accepts `@past` in settings where the loop body is exact; see [Proof Rule Approximations](./approximations.md#proof-rule-approximations). -[^literature-condition-3]: Kaminski writes $\Phi_0(I) \leq [G] \cdot (I - \epsilon)$ instead for condition 3, where $\Phi_0$ is the loop-characteristic function with respect to postexpectation $0$. Our condition is equivalent to this, but simplified. +Every nonterminating execution has $T = \infty$ because each execution of the body terminates. +Since $\mathbb{E}_s[T] \leq I(s) / \epsilon < \infty$, the loop terminates almost surely. diff --git a/website/src/components/ProofRuleGuarantee.tsx b/website/src/components/ProofRuleGuarantee.tsx index 515f2d22..601c0632 100644 --- a/website/src/components/ProofRuleGuarantee.tsx +++ b/website/src/components/ProofRuleGuarantee.tsx @@ -15,6 +15,7 @@ const bodyRequirements = { omega: compatibleBody, ast: { label: , href: '#soundness' }, ost: { label: , href: '#soundness' }, + past: { label: 'Loop-free, probabilistic', href: '#formal-theorem' }, }; const lower = <>Lower bounds proc; diff --git a/website/src/data/proofRules.ts b/website/src/data/proofRules.ts index f2380100..97bf44b6 100644 --- a/website/src/data/proofRules.ts +++ b/website/src/data/proofRules.ts @@ -31,7 +31,7 @@ const inductionCases: readonly BoundCase[] = [ { fixedPoint: greatest.id, calculi: greatest.calculi, approximation: 'Under' }, ]; -type RuleId = 'induction' | 'unroll' | 'omega' | 'ast' | 'ost' | 'calls'; +type RuleId = 'induction' | 'unroll' | 'omega' | 'ast' | 'past' | 'ost' | 'calls'; export const PROOF_RULES: Record = { induction: { @@ -58,6 +58,12 @@ export const PROOF_RULES: Record = { annotations: ['@ast'], cases: [{ fixedPoint: least.id, calculi: ['@wp'], approximation: 'Under' }], }, + past: { + title: 'Positive Almost-Sure Termination', + href: '/docs/proof-rules/past#past-from-ranking-superinvariants', + annotations: ['@past'], + cases: [{ fixedPoint: least.id, calculi: ['@ert'], approximation: 'Over' }], + }, ost: { title: 'Optional Stopping Theorem', href: '/docs/proof-rules/ost', From 2d81f3701988fb0b1012c134fe99238c3398b320 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:41 +0100 Subject: [PATCH 11/32] mc: read Storm 2.0 results and solution bounds --- src/mc/run_storm.rs | 163 +++++++++++++++++++++++++++------ website/docs/model-checking.md | 2 + 2 files changed, 137 insertions(+), 28 deletions(-) diff --git a/src/mc/run_storm.rs b/src/mc/run_storm.rs index 75a627bf..f979df73 100644 --- a/src/mc/run_storm.rs +++ b/src/mc/run_storm.rs @@ -208,39 +208,146 @@ fn parse_property_results( .collect() } +fn parse_property_result<'a>( + output: &'a str, + property: &str, +) -> Option<(&'a str, Option<&'a str>)> { + let header = format!("Model checking property \"{property}\""); + let mut lines = output.lines(); + lines.find(|line| line.starts_with(&header))?; + // A missing result must not be replaced by a later property's result. + let result = lines + .take_while(|line| !line.starts_with("Model checking property ")) + .find_map(|line| line.strip_prefix("Result (for initial states):"))? + .trim(); + + // Multiple initial states can produce a list of values or a range. + if result.starts_with(['{', '[']) { + return Some((result, None)); + } + + // The scalar comes first, followed by optional approximations and solution bounds. + let value = result.split_whitespace().next()?.trim_end_matches('.'); + let bounds = result + .split_once("Solution bounds: [") + .and_then(|(_, bounds)| bounds.split_once(']')) + .map(|(bounds, _)| bounds); + Some((value, bounds)) +} + fn find_property_result( options: &ModelCheckingOptions, output: &str, property: &str, ) -> StormValue { - const RESULT_TEXT: &str = "Result (for initial states):"; - - let search_string = format!("Model checking property \"{property}\""); - if let Some(start) = output.find(&search_string) { - if let Some(result_start) = output[start..].find(RESULT_TEXT) { - let result_start = start + result_start + RESULT_TEXT.len(); - if let Some(result_end) = output[result_start..].find('\n') { - let mut result = &output[result_start..result_start + result_end]; - if result.contains("(approx. ") { - result = result.split("(approx. ").next().unwrap(); - }; - let mut result = result.trim().to_string(); - if options.storm_exact { - if let Ok(value) = result.parse::() { - let pretty = PrettyRational::from(value); - result = pretty.to_string() - } - } - let operator = match (options.storm_exact, options.storm_state_limit) { - (true, None) => "", - (true, Some(_)) => "≥ ", - (false, Some(_)) => "⪆ ", - (false, None) => "≈ ", - }; - let result = format!("{operator}{result}"); - return StormValue::Value(result); - } + let Some((value, bounds)) = parse_property_result(output, property) else { + return StormValue::NotFound; + }; + let mut value = value.to_string(); + if options.storm_exact { + if let Ok(rational) = value.parse::() { + value = PrettyRational::from(rational).to_string(); + } + } + let operator = match (options.storm_exact, options.storm_state_limit) { + (true, None) => "", + (true, Some(_)) => "≥ ", + (false, Some(_)) => "⪆ ", + (false, None) => "≈ ", + }; + let mut result = format!("{operator}{value}"); + if let Some(bounds) = bounds { + let label = if options.storm_state_limit.is_some() { + "bounds for truncated model" + } else { + "bounds" + }; + result.push_str(&format!(" ({label}: [{bounds}])")); + } + StormValue::Value(result) +} + +#[cfg(test)] +mod test { + use super::{find_property_result, ModelCheckingOptions, StormValue}; + + #[test] + fn property_result_formats() { + for (result, exact, limited, expected) in [ + ("0.9999995232", false, false, "≈ 0.9999995232"), + ( + "0.9999995232. Exact solution.", + false, + false, + "≈ 0.9999995232", + ), + ( + "10/3 (approx. 3.333333333)", + true, + false, + "3.3\u{305} (10/3)", + ), + ( + "10/3 (approx. 3.333333333). Exact solution.", + true, + false, + "3.3\u{305} (10/3)", + ), + ( + "3.333333531. Solution bounds: [0, ?].", + false, + false, + "≈ 3.333333531 (bounds: [0, ?])", + ), + ( + "10/3 (approx. 3.333333333). Solution bounds: [10/3, ?] (approx. [3.333333333, ?]).", + true, + true, + "≥ 3.3\u{305} (10/3) (bounds for truncated model: [10/3, ?])", + ), + ( + "{2. Exact solution., 1. Exact solution.}", + false, + false, + "≈ {2. Exact solution., 1. Exact solution.}", + ), + ( + "{2 (approx. 2). Exact solution., 1 (approx. 1). Exact solution.}", + true, + false, + "{2 (approx. 2). Exact solution., 1 (approx. 1). Exact solution.}", + ), + ( + "[0, 15] (approx. [0, 15]) (range). Exact solution.", + true, + false, + "[0, 15] (approx. [0, 15]) (range). Exact solution.", + ), + ] { + let output = format!( + "Model checking property \"reward\": Rmin=? [C] ...\n\ + Result (for initial states): {result}" + ); + let options = ModelCheckingOptions { + storm_exact: exact, + storm_state_limit: limited.then_some(100), + ..Default::default() + }; + let StormValue::Value(value) = find_property_result(&options, &output, "reward") else { + panic!("Missing result for {result}"); + }; + assert_eq!(value, expected); } } - StormValue::NotFound + + #[test] + fn missing_property_result() { + let output = "Model checking property \"reward\": Rmin=? [C] ...\n\ + Model checking property \"later\": P=? [F \"target\"] ...\n\ + Result (for initial states): 1. Exact solution.\n"; + assert!(matches!( + find_property_result(&ModelCheckingOptions::default(), output, "reward"), + StormValue::NotFound + )); + } } diff --git a/website/docs/model-checking.md b/website/docs/model-checking.md index 16bb15a6..7315de57 100644 --- a/website/docs/model-checking.md +++ b/website/docs/model-checking.md @@ -87,6 +87,8 @@ Expected reward from Storm: ≈ 0.9999995232 ``` The result is approximate because it was computed via floating-point arithmetic. To get exact results at the expense of slower computation, you can add the `--storm-exact` flag. +With Storm 2.0 and later, Caesar also displays solution bounds reported by Storm. +When a state limit is used, these bounds describe the truncated model. You can also use the `--run-storm` flag with the [`verify` command](./caesar/README.md#subcommand-caesar-verify) or with [our LSP server](./caesar/vscode-and-lsp.md). Furthermore, you can set the `--no-verify` flag to only run model checking and not run Caesar's deductive verification. From 506a45873cfbaee2cdbdc0aec465c4bc4c469940 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:41 +0100 Subject: [PATCH 12/32] website: add shared citation previews and references --- website/package.json | 1 + website/src/components/Citation.module.css | 84 ++++++ website/src/components/Citation.tsx | 68 +++++ website/src/data/references.ts | 316 +++++++++++++++++++++ website/src/theme/Root/index.js | 3 +- website/yarn.lock | 195 +++++++++++++ 6 files changed, 666 insertions(+), 1 deletion(-) create mode 100644 website/src/components/Citation.module.css create mode 100644 website/src/components/Citation.tsx create mode 100644 website/src/data/references.ts diff --git a/website/package.json b/website/package.json index a7cc0ac6..9159eb8c 100644 --- a/website/package.json +++ b/website/package.json @@ -19,6 +19,7 @@ "@docusaurus/preset-classic": "^3.10.2", "@docusaurus/theme-mermaid": "^3.10.2", "@mdx-js/react": "^3.1.1", + "@radix-ui/react-tooltip": "^1.4.1", "clsx": "^2.1.1", "katex": "^0.16.47", "prism-react-renderer": "^2.4.1", diff --git a/website/src/components/Citation.module.css b/website/src/components/Citation.module.css new file mode 100644 index 00000000..154b520f --- /dev/null +++ b/website/src/components/Citation.module.css @@ -0,0 +1,84 @@ +.citation { + padding: 0.05em 0.25em; + border-radius: 0.2rem; + background: color-mix(in srgb, var(--ifm-color-primary) 7%, transparent); + color: var(--ifm-color-primary); + font-size: 0.875em; + font-weight: 500; + text-decoration: none; + box-decoration-break: clone; + -webkit-box-decoration-break: clone; +} + +.citation:hover { + background: color-mix(in srgb, var(--ifm-color-primary) 12%, transparent); + text-decoration: underline; + text-underline-offset: 0.15em; +} + +.citation:focus-visible { + outline: 2px solid currentColor; + outline-offset: 2px; +} + +.reference { + margin-block: 0 1rem; +} + +.referenceTitle { + font-style: italic; + font-weight: 500; +} + +.reference .referenceTitle a[href] { + color: inherit; + text-decoration: none; +} + +.reference .referenceTitle a[href]:hover { + color: var(--ifm-color-primary); + text-decoration: underline; +} + +.locator { + display: inline-block; + max-inline-size: 100%; +} + +.authors { + font-weight: 500; +} + +.venue { + color: var(--ifm-color-content-secondary); +} + +.note { + margin-block-start: 0.2rem; +} + +.note > p:last-of-type { + display: inline; + margin-block-end: 0; +} + +.preview { + z-index: var(--ifm-z-index-overlay); + max-width: min(25rem, var(--radix-tooltip-content-available-width)); + max-height: var(--radix-tooltip-content-available-height); + overflow: auto; + font-size: 0.875rem; + line-height: 1.5; +} + +@media print { + .citation { + padding: 0; + background: none; + color: inherit; + } + + .preview { + display: none; + } +} diff --git a/website/src/components/Citation.tsx b/website/src/components/Citation.tsx new file mode 100644 index 00000000..b0a14fea --- /dev/null +++ b/website/src/components/Citation.tsx @@ -0,0 +1,68 @@ +import React from 'react'; +import Link from '@docusaurus/Link'; +import * as Tooltip from '@radix-ui/react-tooltip'; +import styles from './Citation.module.css'; + +export type CitationSource = { + href: string; + title: string; + authors?: string; + year?: string | number; + /** Short author name or source identifier, e.g. "Kaminski et al." or "RFC 3927". */ + label?: string; + locator?: string; + venue?: string; +}; + +type Props = CitationSource & { + variant?: 'inline' | 'full'; + /** Explain why the source is relevant when rendering a full reference. */ + children?: React.ReactNode; +}; + +function Details({source}: {source: CitationSource}) { + const {title, authors, year, locator, venue} = source; + return <> + {(authors || year) && + {authors}{authors && year ? ' ' : ''}{year ? `(${year})` : ''}. + } + {' '}{title}. + {locator && <> {locator}.} + {venue && <> {venue}.} + ; +} + +/** Render a source inline or in full; add list markup at the call site when needed. */ +export default function Citation({variant = 'inline', children, ...source}: Props) { + const {href, title, authors, year, label, locator} = source; + + if (variant === 'full') { + const attribution = [label ?? authors, year ? `(${year})` : undefined].filter(Boolean).join(' '); + const fullLocator = locator?.replace(/^§§\s*/, 'Sections ').replace(/^§\s*/, 'Section '); + return
+
+ {attribution && <>{attribution}. } + {title}. + {source.venue && <> {source.venue}.} +
+ {(children || fullLocator) &&
+ {children} + {fullLocator && <> ( + {fullLocator} + )} +
} +
; + } + + const shortLabel = `${label ?? authors ?? title}${year ? ` ${year}` : ''}${locator ? `, ${locator}` : ''}`; + return + + [{shortLabel}] + + + +
+
+
+
; +} diff --git a/website/src/data/references.ts b/website/src/data/references.ts new file mode 100644 index 00000000..40cafb17 --- /dev/null +++ b/website/src/data/references.ts @@ -0,0 +1,316 @@ +import type {CitationSource} from '../components/Citation'; + +// Shared source metadata; keep citation-specific links and locators in each page. +export const references = { + // Caesar and HeyVL. + heyvl2023: { + href: "https://doi.org/10.1145/3622870", + title: "A Deductive Verification Infrastructure for Probabilistic Programs", + authors: "Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja", + label: "Schröer et al.", + year: 2023, + venue: "OOPSLA", + }, + caesar2026: { + href: "https://doi.org/10.1007/978-3-032-32537-2_27", + title: "Caesar: A Deductive Verifier for Probabilistic Programs", + authors: "Philipp Schröer, Kevin Batz, Umut Yiğit Dural, Darion Haase, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja", + label: "Schröer et al.", + year: 2026, + venue: "CAV 2026", + }, + heyvlFoundations2026: { + href: "https://doi.org/10.4230/LIPIcs.ITP.2026.29", + title: "Securing the Foundations of an Intermediate Language for Probabilistic Program Verification", + authors: "Oliver Bøving and Christoph Matheja", + label: "Bøving and Matheja", + year: 2026, + venue: "ITP 2026", + }, + continuous2025: { + href: "https://dl.acm.org/doi/10.1145/3720429", + title: "Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back", + authors: "Kevin Batz, Joost-Pieter Katoen, Francesca Randone, and Tobias Winkler", + label: "Batz et al.", + year: 2025, + venue: "OOPSLA 2025", + }, + heyvlGame2024: { + href: "https://doi.org/10.1007/978-3-031-75434-0_17", + title: "A Game-Based Semantics for the Probabilistic Intermediate Verification Language HeyVL", + authors: "Christoph Matheja", + label: "Matheja", + year: 2024, + venue: "AISoLA 2024", + }, + slicing2026: { + href: "https://arxiv.org/abs/2512.20214", + title: "Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing", + authors: "Philipp Schröer, Darion Haase, and Joost-Pieter Katoen", + label: "Schröer et al.", + year: 2026, + venue: "ESOP 2026", + }, + incremental2026: { + href: "https://doi.org/10.1007/978-3-032-26204-2_29", + title: "Highly Incremental: A Simple Programmatic Approach for Many Objectives", + authors: "Philipp Schröer and Joost-Pieter Katoen", + label: "Schröer and Katoen", + year: 2026, + venue: "FM 2026", + }, + distributedTermination2026: { + href: "https://doi.org/10.1145/3776691", + title: "Verifying Almost-Sure Termination for Randomized Distributed Algorithms", + authors: "Constantin Enea (LIX, CNRS, Ecole Polytechnique), Rupak Majumdar (MPI-SWS), Harshit Jitendra Motwani (MPI-SWS), and V.R. Sathiyanarayana (MPI-SWS)", + label: "Enea et al.", + year: 2026, + venue: "POPL 2026", + }, + weightedProgramming: { + href: "https://arxiv.org/pdf/2608.18971", + title: "Weighted Programming", + }, + + // Foundations and proof rules. + queueDisasters2014: { + href: "https://doi.org/10.1142/S021759591450016X", + title: "An M/M/1 Queue in Random Environment with Disasters", + authors: "Noam Paz and Uri Yechiali", + label: "Paz and Yechiali", + year: 2014, + venue: "Asia-Pacific Journal of Operational Research", + }, + conditioning2018: { + href: "https://doi.org/10.1145/3156018", + title: "Conditioning in Probabilistic Programming", + authors: "Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Annabelle McIver", + label: "Olmedo et al.", + year: 2018, + venue: "TOPLAS", + }, + kaminski2019: { + href: "https://publications.rwth-aachen.de/record/755408/", + title: "Advanced Weakest Precondition Calculi for Probabilistic Programs", + authors: "Benjamin Lucien Kaminski", + label: "Kaminski", + year: 2019, + venue: "PhD thesis, RWTH Aachen University", + }, + batz2024: { + href: "https://publications.rwth-aachen.de/record/1002329/", + title: "Automated deductive verification of probabilistic programs", + authors: "Kevin Batz", + label: "Batz", + year: 2024, + venue: "PhD thesis, RWTH Aachen University", + }, + expressiveLanguage2021: { + href: "https://doi.org/10.1145/3434320", + title: "Relatively Complete Verification of Probabilistic Programs: An Expressive Language for Expectation-Based Reasoning", + authors: "Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja", + label: "Batz et al.", + year: 2021, + }, + kInduction2021: { + href: "https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25", + title: "Latticed k-Induction with an Application to Probabilistic Programs", + authors: "Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Philipp Schröer", + label: "Batz et al.", + year: 2021, + venue: "CAV", + }, + aimingLow2020: { + href: "https://arxiv.org/pdf/1904.01117v3", + title: "Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification", + authors: "Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, and Joost-Pieter Katoen", + label: "Hark et al.", + year: 2020, + venue: "POPL", + }, + almostSureTermination2018: { + href: "https://dl.acm.org/doi/10.1145/3158121", + title: "A New Proof Rule for Almost-Sure Termination", + authors: "Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, and Joost-Pieter Katoen", + label: "McIver et al.", + year: 2018, + venue: "POPL", + }, + expectedRuntime2016: { + href: "https://users.dcc.uchile.cl/~folmedo/pubs/2016.ESOP.pdf", + title: "Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs", + authors: "Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo", + label: "Kaminski et al.", + year: 2016, + }, + expectedRuntime2018: { + href: "https://discovery.ucl.ac.uk/id/eprint/10089685/1/main.pdf", + title: "Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms", + authors: "Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo", + label: "Kaminski et al.", + year: 2018, + }, + totalExpectedRewards2024: { + href: "https://doi.org/10.1007/978-3-031-75783-9_11", + title: "J-P: MDP. FP. PP -- Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs", + authors: "Batz et al.", + year: 2024, + }, + martingales2013: { + href: "https://doi.org/10.1007/978-3-642-39799-8_34", + title: "Probabilistic Program Analysis with Martingales", + authors: "Chakarov and Sankaranarayanan", + year: 2013, + venue: "CAV", + }, + probabilisticTermination2015: { + href: "https://doi.org/10.1145/2775051.2677001", + title: "Probabilistic Termination: Soundness, Completeness, and Compositionality", + authors: "Fioriti and Hermanns", + year: 2015, + venue: "POPL", + }, + programmingFromSpecifications: { + href: "https://www.cs.ox.ac.uk/publications/books/PfS/", + title: "Programming from Specifications", + authors: "Carroll Morgan", + label: "Morgan", + }, + correctnessByConstruction: { + href: "https://doi.org/10.1007/978-3-030-61362-4_12", + title: "Correctness by Construction for Probabilistic Programs", + authors: "McIver and Morgan", + }, + smtTutorial2024: { + href: "https://doi.org/10.1007/978-3-031-71177-0_31", + title: "Satisfiability Modulo Theories: A Beginner’s Tutorial", + authors: "Barrett et al.", + year: 2024, + }, + + // Theses. + beothyElo2025: { + href: "https://publications.rwth-aachen.de/record/1016969", + title: "Effective quantifier-based reasoning for quantitative deductive verification", + authors: "Emil Beothy-Elo", + label: "Beothy-Elo", + year: 2025, + venue: "Master thesis, RWTH Aachen University", + }, + vanJaarsveld2025: { + href: "https://purl.utwente.nl/essays/106318", + title: "Practical Probabilistic Program Verification using Caesar", + authors: "Franka van Jaarsveld", + label: "van Jaarsveld", + year: 2025, + venue: "Master thesis, University of Twente", + }, + schroer2022: { + href: "https://publications.rwth-aachen.de/record/998370", + title: "A Deductive Verifier for Probabilistic Programs", + authors: "Philipp Schroer", + label: "Schroer", + year: 2022, + venue: "Master thesis", + }, + + // Algorithms, protocols, and tools. + algorithms: { + href: "https://algs4.cs.princeton.edu/32bst/", + title: "Algorithms", + authors: "Robert Sedgewick and Kevin Wayne", + label: "Sedgewick and Wayne", + }, + programmingZ3: { + href: "https://z3prover.github.io/papers/programmingz3.html", + title: "Programming Z3", + authors: "Nikolaj Bjørner, Leonardo de Moura, Lev Nachmanson, and Christoph M. Wintersteiger", + year: 2019, + label: "Bjørner et al.", + }, + dataLinkProtocol1994: { + href: "https://doi.org/10.1007/3-540-58085-9_75", + title: "Proof-Checking a Data Link Protocol", + authors: "Leen Helmink, M. P. A. Sellink, and Frits Vaandrager", + year: 1994, + label: "Helmink et al.", + }, + successiveRefinements2001: { + href: "https://doi.org/10.1007/3-540-44804-7_3", + title: "Reachability Analysis of Probabilistic Systems by Successive Refinements", + authors: "Pedro R. D’Argenio, Bertrand Jeannet, Henrik E. Jensen, and Kim G. Larsen", + year: 2001, + label: "D’Argenio et al.", + }, + couponCollector: { + href: "https://en.wikipedia.org/wiki/Coupon_collector%27s_problem", + title: "Coupon collector's problem", + label: "Wikipedia", + }, + morris1978: { + href: "https://doi.org/10.1145/359619.359627", + title: "Counting Large Numbers of Events in Small Registers", + authors: "Robert Morris", + label: "Morris", + year: 1978, + }, + fastDiceRoller2013: { + href: "https://arxiv.org/abs/1304.1916", + title: "Optimal Discrete Uniform Generation from Coin Flips, and Applications", + authors: "Jérémie Lumbroso", + label: "Lumbroso", + year: 2013, + }, + approximateCounting2022: { + href: "https://arxiv.org/pdf/2010.02116", + title: "Optimal Bounds for Approximate Counting", + authors: "Jelani Nelson and Huacheng Yu", + label: "Nelson and Yu", + year: 2022, + }, + mutualExclusion1992: { + href: "https://doi.org/10.1145/135419.135468", + title: "Randomized Mutual Exclusion Algorithms Revisited", + authors: "Eyal Kushilevitz and Michael O. Rabin", + year: 1992, + label: "Kushilevitz and Rabin", + }, + guardedCommands2004: { + href: "https://cgi.cse.unsw.edu.au/~carrollm/probs/Papers/Hurd-05a.pdf", + title: "Probabilistic Guarded Commands Mechanized in HOL", + authors: "Joe Hurd, Annabelle McIver, and Carroll Morgan", + year: 2004, + label: "Hurd et al.", + }, + reservoirSampling1985: { + href: "https://doi.org/10.1145/3147.3165", + title: "Random Sampling with a Reservoir", + authors: "Jeffrey Scott Vitter", + label: "Vitter", + year: 1985, + }, + rfc3927: { + href: "https://www.rfc-editor.org/rfc/rfc3927.html", + title: "Dynamic Configuration of IPv4 Link-Local Addresses", + label: "RFC 3927", + }, + prismZeroconf: { + href: "https://www.prismmodelchecker.org/casestudies/zeroconf.php", + title: "PRISM case study: IPv4 Zeroconf Protocol", + label: "PRISM Zeroconf", + }, + zeroconfCost2003: { + href: "https://doi.org/10.1109/DSN.2003.1209963", + title: "Cost-Optimization of the IPv4 Zeroconf Protocol", + authors: "Henrik Bohnenkamp, Peter van der Stok, Holger Hermanns, and Frits Vaandrager", + year: 2003, + label: "Bohnenkamp et al.", + }, + digitalClocks2006: { + href: "https://www.prismmodelchecker.org/bibitem.php?key=KNPS06", + title: "Performance Analysis of Probabilistic Timed Automata Using Digital Clocks", + authors: "Marta Kwiatkowska, Gethin Norman, David Parker, and Jeremy Sproston", + year: 2006, + label: "Kwiatkowska et al.", + }, +} satisfies Record; diff --git a/website/src/theme/Root/index.js b/website/src/theme/Root/index.js index 20d8db51..fca913dd 100644 --- a/website/src/theme/Root/index.js +++ b/website/src/theme/Root/index.js @@ -1,4 +1,5 @@ import React from 'react'; +import {Provider as TooltipProvider} from '@radix-ui/react-tooltip'; import Head from '@docusaurus/Head'; import plexSans from '@site/static/fonts/ibm-plex/IBMPlexSans-SemiBold.woff2'; import sourceCode from '@site/static/fonts/source-code-pro/SourceCodePro-Regular.otf.woff2'; @@ -12,7 +13,7 @@ export default function Root({children}) { - {children} + {children} ); } diff --git a/website/yarn.lock b/website/yarn.lock index a8b3bc74..73b9e8b8 100644 --- a/website/yarn.lock +++ b/website/yarn.lock @@ -2038,6 +2038,33 @@ utility-types "^3.10.0" webpack "^5.88.1" +"@floating-ui/core@^1.8.0": + version "1.8.0" + resolved "https://registry.yarnpkg.com/@floating-ui/core/-/core-1.8.0.tgz#d01c0bbea02e4a57f6fd7d5de6fc2c5c7dca40e1" + integrity sha512-0CIZ5itps/8x7BG8dEIhs53BvCUH2PCoogtakwRTut+Arm58sJooJ0AuZhLw2HJYIR5cMLNPBSS728sPho2khQ== + dependencies: + "@floating-ui/utils" "^0.2.12" + +"@floating-ui/dom@^1.8.0": + version "1.8.0" + resolved "https://registry.yarnpkg.com/@floating-ui/dom/-/dom-1.8.0.tgz#8a20e6facbe2456afdbeb6c8b968a72df689cf63" + integrity sha512-yXSrzeHZBTZadLOlfyhCkJHNeLJnHRnRInwdZ40L7ZiaAtrBwoYlsDrX3v5zB1Utk7CLfzcOVnVVWoXEky7Ceg== + dependencies: + "@floating-ui/core" "^1.8.0" + "@floating-ui/utils" "^0.2.12" + +"@floating-ui/react-dom@^2.0.0": + version "2.1.9" + resolved "https://registry.yarnpkg.com/@floating-ui/react-dom/-/react-dom-2.1.9.tgz#f42a5f469ea56d6f2e2751efa1cf936243a87355" + integrity sha512-JDjEFGCpImxDCA7JJKviA0M9+RtmJdj0m/NVU5IMgBK+AmZouAQQ7/+2GLH0GXXY0YMw9oXPB8hKdbPYg5QLYg== + dependencies: + "@floating-ui/dom" "^1.8.0" + +"@floating-ui/utils@^0.2.12": + version "0.2.12" + resolved "https://registry.yarnpkg.com/@floating-ui/utils/-/utils-0.2.12.tgz#afefe785949f16ac4cdd1e695935a321572dd56a" + integrity sha512-HpCo8tmWzLVad5s2d19EhAz5zqrrQ6s69qd6moPMQvkOuSwDT1YgRfWSVuc4ennqrgv3OHppiOGMQ7oC13yIww== + "@hapi/hoek@^9.0.0", "@hapi/hoek@^9.3.0": version "9.3.0" resolved "https://registry.yarnpkg.com/@hapi/hoek/-/hoek-9.3.0.tgz#8368869dcb735be2e7f5cb7647de78e167a251fb" @@ -2518,6 +2545,174 @@ resolved "https://registry.yarnpkg.com/@polka/url/-/url-1.0.0-next.29.tgz#5a40109a1ab5f84d6fd8fc928b19f367cbe7e7b1" integrity sha512-wwQAWhWSuHaag8c4q/KN/vCoeOJYshAIvMQwD4GpSb3OiZklFfvAgmj0VCBBImRpuF/aFgIRzllXlVX93Jevww== +"@radix-ui/primitive@1.2.0": + version "1.2.0" + resolved "https://registry.yarnpkg.com/@radix-ui/primitive/-/primitive-1.2.0.tgz#8ddb41310edbef7e064b1e5fd65a6dde31d8b5cc" + integrity sha512-KABY+VMIRPJL+Vyzv/335FEhXXD/xDv8BMb1kl48/aXJZMH0LtHCTx5ga5RnxaEP3nZHtmTLf1P9vanmFX46bw== + +"@radix-ui/react-arrow@1.1.17": + version "1.1.17" + resolved "https://registry.yarnpkg.com/@radix-ui/react-arrow/-/react-arrow-1.1.17.tgz#6d6948e2829001d3cac6a19e546c60605f905cba" + integrity sha512-67jjcVvxjXCCStnTW3Z+M7jmaFMuMR7M2JgpDzH4w7JSRrikmzhjfYgP/09ECb8n7whnsgh1ifJ+Ie96qEj+pQ== + dependencies: + "@radix-ui/react-primitive" "2.2.0" + +"@radix-ui/react-compose-refs@1.1.5": + version "1.1.5" + resolved "https://registry.yarnpkg.com/@radix-ui/react-compose-refs/-/react-compose-refs-1.1.5.tgz#883e642c5ec0ba393dd1bf586e7e772985770d87" + integrity sha512-+48PbAAbq3didjJxa+OaWY2ZwgAKsNiRGyeHKszblZMQ+kcpd9pAaT11cMkGEie0vsOi3QdeTE6d5Fe3Gn61kA== + +"@radix-ui/react-context@1.3.0": + version "1.3.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-context/-/react-context-1.3.0.tgz#17c67491445490cc1cb0b8e4a36ab05e34a60a3f" + integrity sha512-v5AYEocMISkbJ+1fTXzZpiFv7NRr3D2WiYbLIKf+FkmJ8VkP6d503eV2n34MFussHXY1pcoq3yfJiQH77dc4Mg== + +"@radix-ui/react-dismissable-layer@1.2.1": + version "1.2.1" + resolved "https://registry.yarnpkg.com/@radix-ui/react-dismissable-layer/-/react-dismissable-layer-1.2.1.tgz#2a5c3f59e2d9660a55564265341c33ebf1bdc0a5" + integrity sha512-KIfDcAsx+oVylFZ4xryVKusJUrLLhTQmfnJW4kwk4Km5myvhHCrj04hnWWUC166+xD4DHdH8tQGylwYX1h6+Pg== + dependencies: + "@radix-ui/primitive" "1.2.0" + "@radix-ui/react-compose-refs" "1.1.5" + "@radix-ui/react-primitive" "2.2.0" + "@radix-ui/react-use-callback-ref" "1.1.5" + "@radix-ui/react-use-effect-event" "0.0.5" + +"@radix-ui/react-focus-scope@1.3.1": + version "1.3.1" + resolved "https://registry.yarnpkg.com/@radix-ui/react-focus-scope/-/react-focus-scope-1.3.1.tgz#ccde041435b6602fc09e88ad8a9d3ccb8f386c8a" + integrity sha512-ugeMhbXt4y5S2T1GnIqbWDKEN962PDwnX1fN0eKOOgf5f63Dh2mn8F1FUySlgW0iF6GiVsRF32DzuDIWTUyQJg== + dependencies: + "@radix-ui/react-compose-refs" "1.1.5" + "@radix-ui/react-primitive" "2.2.0" + "@radix-ui/react-use-callback-ref" "1.1.5" + +"@radix-ui/react-id@1.1.4": + version "1.1.4" + resolved "https://registry.yarnpkg.com/@radix-ui/react-id/-/react-id-1.1.4.tgz#e642714bdaf551c1bfacbe51508ed843a3a27980" + integrity sha512-TMQp2llA+RYn7JcjnrMnz7wN4pcVttPZnRZo52PLQsoLVKzNlVwUeHmfePgTgRluXFvlD3GD5g5MOVVTJCO0qA== + dependencies: + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-popper@1.4.0": + version "1.4.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-popper/-/react-popper-1.4.0.tgz#12d4abbe6fb501309e9fef2a00ad7c58840827b3" + integrity sha512-yCWRvLeGv9Pz3+efwHqGPp70mZ56r3kfIgQVF56Oj2aAa4uP/Tb+IE59wNcc+758rctqbCKx4LbK8II/r7Bn0Q== + dependencies: + "@floating-ui/react-dom" "^2.0.0" + "@radix-ui/react-arrow" "1.1.17" + "@radix-ui/react-compose-refs" "1.1.5" + "@radix-ui/react-context" "1.3.0" + "@radix-ui/react-primitive" "2.2.0" + "@radix-ui/react-use-callback-ref" "1.1.5" + "@radix-ui/react-use-layout-effect" "1.1.4" + "@radix-ui/react-use-rect" "1.1.4" + "@radix-ui/react-use-size" "1.1.5" + "@radix-ui/rect" "1.1.3" + +"@radix-ui/react-portal@1.2.0": + version "1.2.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-portal/-/react-portal-1.2.0.tgz#72691fb9724c334998943765a6ccd4acee8de050" + integrity sha512-StX7xXnaRU41VvFtMm9zlhVGz8XF6GmWWTXftkQaY+tqVkbs/R9UmAp5mLzHHapk5hM9RMZQvO/3usyIP/g42g== + dependencies: + "@radix-ui/react-primitive" "2.2.0" + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-presence@1.1.11": + version "1.1.11" + resolved "https://registry.yarnpkg.com/@radix-ui/react-presence/-/react-presence-1.1.11.tgz#6128921738f3adceebf08e0a031705b3a9bbe345" + integrity sha512-Z7/atlkab36Z8hm+V8zYc79r0W+tiOB1o0tun1By94JyadkekLQmtEAnBSP9XKXBNQsStoStS4+gX10JpS5akA== + dependencies: + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-primitive@2.2.0": + version "2.2.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-primitive/-/react-primitive-2.2.0.tgz#b29b6139dc8c0f87f39482a7d310f07e9f2da072" + integrity sha512-HCTSPMNqv55Qk0IX4geJbpyXazmqulcimwuyjxTkKi29v+QZbG2Zho9BnbBq4YS2PF+KlNb2CXoLz66uUmblkg== + dependencies: + "@radix-ui/react-slot" "1.5.0" + +"@radix-ui/react-slot@1.5.0": + version "1.5.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-slot/-/react-slot-1.5.0.tgz#b105cfe8c4635fe8810ac9cb899f737da14a7150" + integrity sha512-tyYd9ddPXAysAbdbD9eYxgwpCSv6f3PncqVSNKQFSR5lcJVLz3cb/pANDoYrLiHBpXv7skortyUgGUWsYuPPFQ== + dependencies: + "@radix-ui/react-compose-refs" "1.1.5" + +"@radix-ui/react-tooltip@^1.4.1": + version "1.4.1" + resolved "https://registry.yarnpkg.com/@radix-ui/react-tooltip/-/react-tooltip-1.4.1.tgz#73edc0b68cd9875ea3bfca238375ac9bb93cb2eb" + integrity sha512-NxLFGSFtZ78zVfcoOhTwR1xwqo5qx1Jh8Pw6FMZ9McCaqfRzz7/gIRahs2Oy5XlPgQ+8QkUcKbN5B0U44J/kCg== + dependencies: + "@radix-ui/primitive" "1.2.0" + "@radix-ui/react-compose-refs" "1.1.5" + "@radix-ui/react-context" "1.3.0" + "@radix-ui/react-dismissable-layer" "1.2.1" + "@radix-ui/react-focus-scope" "1.3.1" + "@radix-ui/react-id" "1.1.4" + "@radix-ui/react-popper" "1.4.0" + "@radix-ui/react-portal" "1.2.0" + "@radix-ui/react-presence" "1.1.11" + "@radix-ui/react-primitive" "2.2.0" + "@radix-ui/react-slot" "1.5.0" + "@radix-ui/react-use-controllable-state" "1.3.0" + "@radix-ui/react-use-layout-effect" "1.1.4" + "@radix-ui/react-visually-hidden" "1.2.13" + +"@radix-ui/react-use-callback-ref@1.1.5": + version "1.1.5" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-callback-ref/-/react-use-callback-ref-1.1.5.tgz#af6a37e94eb8fb38d870ce90c936a292f23a5e86" + integrity sha512-Y5GBf4NKeADoXI1geiMlMuMoURT3k9MizzzKhGb/m55H94aGigZ01PIpkvsO6lML13BA6XYAXSJ6gza7vTn5nw== + dependencies: + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-use-controllable-state@1.3.0": + version "1.3.0" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-controllable-state/-/react-use-controllable-state-1.3.0.tgz#aa816fde85316f77a7a889dd6eac83104dbfb03a" + integrity sha512-TAcBI7bw2ljYCbv4+zuTSd6zICu8pRt6SDN2vJ/Z06K2MXh6I9WYFe/A9ovlFDtR5HVHGm5iDxDoABm/++dbKg== + dependencies: + "@radix-ui/primitive" "1.2.0" + "@radix-ui/react-use-effect-event" "0.0.5" + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-use-effect-event@0.0.5": + version "0.0.5" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-effect-event/-/react-use-effect-event-0.0.5.tgz#7732a4ae6bc032c7f654e658203df92d3520f8d1" + integrity sha512-7cshFL8HGS/7HEiHH+9kL9HBwp2sa9yX18Knwek6KYWmXwM7pegMgta2AXMQKI+rq3JnfSj9x8wYqFMTdG1Jgg== + dependencies: + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-use-layout-effect@1.1.4": + version "1.1.4" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-layout-effect/-/react-use-layout-effect-1.1.4.tgz#51a0bbc342315070983383b3f8f00061083782a8" + integrity sha512-K20DkRkUwDnxEYMBPcg3Y6voLkEy5p5QQmszZgLngKKiC7dzBR/aEuK3w1qlx2JWDUNH6FluahYdgR3BP+QbYw== + +"@radix-ui/react-use-rect@1.1.4": + version "1.1.4" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-rect/-/react-use-rect-1.1.4.tgz#9d68dd1d149a0af4f228c5c9ae4646d3ceaa0e2a" + integrity sha512-cSOCh6JlkmfjLyNcLiu2nB4v+nm+dkZ+Q5KHWk/soo4U7ZLiEQFKHK9/YmtBHjfCEaU43IBKQOc4/uJmCaiCTQ== + dependencies: + "@radix-ui/rect" "1.1.3" + +"@radix-ui/react-use-size@1.1.5": + version "1.1.5" + resolved "https://registry.yarnpkg.com/@radix-ui/react-use-size/-/react-use-size-1.1.5.tgz#b4b5933720960a660ea19ea6f22b3d7027d797dc" + integrity sha512-V1McDQkMGzgivwqdu7u96APs7oi0Jvj9LTzgq3WWrDZqxWdAqU9yZnZQqk5OizGFR8badUQwZsrlao7MOlWYOA== + dependencies: + "@radix-ui/react-use-layout-effect" "1.1.4" + +"@radix-ui/react-visually-hidden@1.2.13": + version "1.2.13" + resolved "https://registry.yarnpkg.com/@radix-ui/react-visually-hidden/-/react-visually-hidden-1.2.13.tgz#bca8f9696c8fb4cdc51d292795bd10f26e126a8e" + integrity sha512-feijiN1oPk4rck4u9Dm9tsU4mT6Wp9oeEEhaz1WUEs1VuqLf8xzsFG+Qk+uWq6TnMH9O+WRECRg0NftyP9E4Fw== + dependencies: + "@radix-ui/react-primitive" "2.2.0" + +"@radix-ui/rect@1.1.3": + version "1.1.3" + resolved "https://registry.yarnpkg.com/@radix-ui/rect/-/rect-1.1.3.tgz#5a58fbae3deefb7f8cfe6ea314287d699eb694a9" + integrity sha512-JtyZR+mqgBibTo8xea3B6ZRmzZiM/YeVBtUkas6zMuXjAlfIFIW2FgqeM9eLyvEaYX66vr6DJMK+4U6LV0KhNw== + "@sideway/address@^4.1.5": version "4.1.5" resolved "https://registry.yarnpkg.com/@sideway/address/-/address-4.1.5.tgz#4bc149a0076623ced99ca8208ba780d65a99b9d5" From 09d679c3cf45e0980d2ae53bd5d717063c4cf607 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:57 +0100 Subject: [PATCH 13/32] docs: clarify HeyVL examples and proof-rule references --- .../blog/2025-04-11-foundations-continuous.md | 7 +- website/docs/caesar/debugging.md | 14 ++- website/docs/caesar/slicing.md | 11 ++- website/docs/getting-started/heyvl-guide.md | 31 +++++-- website/docs/heyvl/expressions.md | 22 ++++- website/docs/heyvl/procs.md | 30 +++++-- website/docs/heyvl/statements.md | 50 ++++++++--- website/docs/heyvl/statements.module.css | 21 +++-- website/docs/introduction.md | 15 +++- website/docs/model-checking.md | 11 ++- website/docs/proof-rules/README.md | 13 ++- website/docs/proof-rules/approximations.md | 23 ++++- website/docs/proof-rules/ast.md | 30 ++++--- website/docs/proof-rules/induction.md | 26 ++++-- website/docs/proof-rules/omega-invariants.md | 11 ++- website/docs/proof-rules/ost.md | 31 +++++-- website/docs/proof-rules/past.md | 15 +++- website/docs/proof-rules/unrolling.md | 9 +- website/docs/publications.md | 86 ++++++++++++------- website/docs/stdlib/lists.md | 1 + 20 files changed, 355 insertions(+), 102 deletions(-) diff --git a/website/blog/2025-04-11-foundations-continuous.md b/website/blog/2025-04-11-foundations-continuous.md index b7502833..368b379f 100644 --- a/website/blog/2025-04-11-foundations-continuous.md +++ b/website/blog/2025-04-11-foundations-continuous.md @@ -24,7 +24,7 @@ In addition to theoretical results such as convergence and completeness of the a ## Encoding Riemann Sums in HeyVL The HeyVL encoding of the Riemann sum approximation is simple. -Consider sampling the variable `x` from the *continuous* uniform distribution over the $[0,1]$. +Consider sampling the variable `x` from the *continuous* uniform distribution over $[0,1]$. The original sampling interval $[0,1]$ is divided into $N$ equally sized subintervals, where $N\ge1$. For example, the following encoding uses $N=8$: @@ -41,7 +41,7 @@ Its bounds must be integer literals, so the code uses `unif(0, 7)`. The sampled integer $j$ is then used to select the closed subinterval $I = [j/N, (j+1)/N]$. The `cohavoc` and `coassume` statements take the supremum of the postexpectation over all values $x\in I$, giving an upper approximation on that subinterval. -Increasing the parameter $N$ leads to a more precise approximation of the expected value, but incurs a slowdown in the verification time. +Finer partitions can give sharper bounds on the expected value, at the cost of larger verification conditions. The above encodes the Riemann sum over-approximation of the expected value of a function $f$ when sampling uniformly from the continuous interval $[0,1]$. Formally: @@ -62,10 +62,11 @@ A more detailed explanation can be found in [Section 9.1 of the paper](https://d As long as the hare did not overtake the tortoise, the hare flips a fair coin to decide whether to move or not. If the hare decides to move, it samples a distance uniformly at random from $[0, 10]$. The tortoise always moves exactly one step. -The following HeyVL code encodes a proof that $$\mathrm{wp}\llbracket\texttt{tortoise\_hare}\rrbracket(\texttt{count}) \leq 3.38 \cdot (t - h + 2)~,$$ where $h$ and $t$ are the initial positions of the tortoise and hare, respectively. +For initial positions $h\le t$, the following HeyVL code encodes a proof that $$\mathrm{wp}\llbracket\texttt{tortoise\_hare}\rrbracket(\texttt{count}) \leq 3.38 \cdot (t - h + 2)~,$$ where $h$ and $t$ are the initial positions of the hare and tortoise, respectively. Here, we chose the parameter $N = 8$ for the Riemann sum approximation. ```heyvl +@wp coproc tortoise_hare(init_h: UReal, init_t: UReal) -> (count: UReal) pre 3.38*((init_t - init_h) + 2) post count diff --git a/website/docs/caesar/debugging.md b/website/docs/caesar/debugging.md index 3ec2cb88..a65c2514 100644 --- a/website/docs/caesar/debugging.md +++ b/website/docs/caesar/debugging.md @@ -4,6 +4,18 @@ sidebar_position: 1 # Debugging +```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781#page=23", + }, +}; +``` + Follow this guide if you are debugging verification with Caesar. ## Disabling Slicing @@ -26,7 +38,7 @@ Caesar's incompleteness comes from incompleteness of the underlying SMT solver w At the moment, Caesar's translation of HeyVL verification problems is rather direct: most expressions are translated as one would intuitively expect. If operators have a direct correspondence in [SMT-LIB](https://smt-lib.org/), then we translate directly to those. Otherwise, usually only additional simple case distinctions are introduced. -We have some more explanations in [Section 5 of our paper on HeyVL](https://arxiv.org/pdf/2309.07781#page=23). +We have some more explanations in our paper on HeyVL . As a consequence, it is usually pretty simple to predict which [SMT-LIB theories](https://smt-lib.org/theories.shtml) will be used for the SMT query done by Caesar. [Caesar supports Z3 probes](#z3-probes) to help you check in which theory your problem falls. diff --git a/website/docs/caesar/slicing.md b/website/docs/caesar/slicing.md index ae8fb930..d22f86bb 100644 --- a/website/docs/caesar/slicing.md +++ b/website/docs/caesar/slicing.md @@ -20,6 +20,15 @@ Fun fact: Caesar's slicing feature was developed with the project name *Brutus* **In this document:** ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: { + ...sources.heyvl2023, + href: "/docs/publications#oopsla-23", + }, +}; import TOCInline from '@theme/TOCInline'; @@ -348,7 +357,7 @@ Our theory of slicing for HeyVL aims to give clear correctness criteria for slic :::info The theory is based on the verification condition semantics of HeyVL. -You can find some information in the [statements documentation](../heyvl/statements.md) and all relevant formal background in our [OOPSLA '23 paper](../publications.md#oopsla-23). +You can find some information in the [statements documentation](../heyvl/statements.md) and all relevant formal background in our OOPSLA '23 paper . We are working on an academic publication about these ideas that goes into more detail. ::: diff --git a/website/docs/getting-started/heyvl-guide.md b/website/docs/getting-started/heyvl-guide.md index 5c6b8fc3..e121cc8b 100644 --- a/website/docs/getting-started/heyvl-guide.md +++ b/website/docs/getting-started/heyvl-guide.md @@ -6,6 +6,20 @@ sidebar_position: 2 # Guide to HeyVL ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781.pdf", + }, + cav: { + ...sources.caesar2026, + href: "https://link.springer.com/content/pdf/10.1007/978-3-032-32537-2_27.pdf?pdf=inline%20link", + venue: "CAV", + }, +}; import Link from '@docusaurus/Link'; ``` @@ -13,7 +27,7 @@ For a short introduction to running Caesar and interpreting a verification resul This guide explains HeyVL in more detail, using a *lossy list traversal* to introduce user-defined types and functions, quantitative specifications, and loop invariants. It then explains the verification statements used to encode proofs in HeyVL. -#### Contents of This Guide +**Contents of This Guide** ```mdx-code-block import TOCInline from '@theme/TOCInline'; @@ -26,7 +40,7 @@ import TOCInline from '@theme/TOCInline'; ### Architecture
-

Architecture of Caesar

+
Architecture of Caesar
@@ -61,8 +75,8 @@ That is the advantage of using an intermediate verification language such as Hey :::info -Our [OOPSLA '23 paper](../publications.md#oopsla-23) ([PDF](https://arxiv.org/pdf/2309.07781.pdf)) gives the formal foundations of HeyVL and explains how to prove that its encodings represent the intended verification problems. -The [CAV 2026 tool paper](https://link.springer.com/content/pdf/10.1007/978-3-032-32537-2_27.pdf?pdf=inline%20link) describes Caesar's architecture and current capabilities. +Our OOPSLA '23 paper gives the formal foundations of HeyVL and explains how to prove that its encodings represent the intended verification problems. +The CAV 2026 tool paper describes Caesar's architecture and current capabilities. ::: @@ -223,13 +237,14 @@ Remember that we want to verify that the probability of a successful run without How do we specify such a property in HeyVL? HeyVL uses *expectation-based reasoning*, which is a kind of deductive reasoning that talks about expected values of random variables. -We describe the full theoretical details in our [OOPSLA '23 publication](../publications.md#oopsla-23). +We describe the full theoretical details in our OOPSLA '23 publication . For now though, we'll provide some intuition. #### Specifications We extend our `lossy_list` declaration as follows with a `pre` and a `post` attribute: ```heyvl +@uwlp proc lossy_list(init_l: List) -> (l: List) pre [len(init_l) == 1] * 0.5 post [true] @@ -296,7 +311,7 @@ Before we do so, a warning. :::caution HeyVL is an intermediate verification language and proof rules like Park induction must only be applied where it is sound with respect to the language semantics that we are considering. -In this case, by using Park induction in a `proc`, we implicitly assumed *greatest fixed point* semantics on unbounded non-negative expected values for the loop. +Here, the [`@uwlp` annotation](../proof-rules/approximations.md#calculus-annotations) explicitly selects *greatest fixed point* semantics on unbounded non-negative expected values for the loop. It assigns an infinite expected value to nonterminating executions. Then, Park induction is sound for lower bound reasoning only. @@ -326,6 +341,7 @@ domain List { axiom list_pop forall l: List. len(pop(l)) == len(l) - 1 } +@uwlp proc lossy_list(init_l: List) -> (l: List) pre [len(init_l) == 1] * 0.5 post [true] @@ -364,6 +380,7 @@ HeyVL also has dual `co`-versions of its [verification statements](#verification Consider the following `coproc` example (with the domain declarations from above omitted): ```heyvl +@wp coproc lossy_list_up(init_l: List) -> (l: List) pre 0 post len(l) @@ -410,7 +427,7 @@ For reference-level documentation, refer to the [HeyVL statements documentation] :::info -Our [OOPSLA '23 paper](../publications.md#oopsla-23) ([PDF](https://arxiv.org/pdf/2309.07781.pdf)) gives a formal treatment of HeyVL's verification statements. +Our OOPSLA '23 paper gives a formal treatment of HeyVL's verification statements. ::: diff --git a/website/docs/heyvl/expressions.md b/website/docs/heyvl/expressions.md index bf533dbb..e70e6360 100644 --- a/website/docs/heyvl/expressions.md +++ b/website/docs/heyvl/expressions.md @@ -5,6 +5,22 @@ sidebar_position: 3 # Expressions +```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781.pdf#page=5", + }, + complete: { + ...sources.expressiveLanguage2021, + href: "https://dl.acm.org/doi/10.1145/3434320", + }, +}; +``` + HeyVL expressions can be used inside [specifications](./procs.md) and [statements](./statements.md) and evaluate to values in some program state. ## Expression Syntax @@ -104,7 +120,7 @@ The most precise grammar specification can be found in Caesar's source code ([`s ## Semantics and Under-Specified Expressions -In [our paper on HeyVL (cf. Section 2)](https://arxiv.org/pdf/2309.07781.pdf#page=5), we give a formal semantics for *HeyLo*, our logic for reasoning about expected values. +In our paper on HeyVL , we give a formal semantics for *HeyLo*, our logic for reasoning about expected values. HeyLo includes operators such as `==>`, `<==`, `!`, `~`, `?(e)`, and more. Caesar's expressions are a superset of HeyLo. In particular, the paper explains in detail the lattice and Heyting algebra operators that Caesar supports. @@ -169,13 +185,13 @@ For more information on how triggers/patterns work in general, see the [Z3 User ## Relative Completeness -Caesar's expression syntax is based on [the expressive assertion language for probabilistic verification by Batz et al](https://dl.acm.org/doi/10.1145/3434320). +Caesar's expression syntax is based on the expressive assertion language for probabilistic verification . In theory, *expressiveness* means that for many programs and properties, we know that we can express *all* pre-expectations and invariants in the expression syntax when a post-expectation is written in that syntax. Formally, we have that the [weakest pre-expectation calculus](../proof-rules/approximations#calculus-annotations) `wp` is *relatively complete* with respect to this language, which means that `wp[P](post)` is effectively constructible for all programs `P` and expectations `post` in their syntax. Their syntax includes enough constructs to specify many interesting properties, such as termination probabilities or the distribution over final states, even including stuff like harmonic numbers. -See [the paper's Section 12 for more details](https://dl.acm.org/doi/pdf/10.1145/3434320#page=26). +See for more details. Of course, this does not mean that all of these verification problems are decidable. It just means that in theory, the undecidable part is *only* in the final inequality check `pre <= wp[P](post)` instead of the computation of `wp[P](post)`. diff --git a/website/docs/heyvl/procs.md b/website/docs/heyvl/procs.md index 667ee703..7642c777 100644 --- a/website/docs/heyvl/procs.md +++ b/website/docs/heyvl/procs.md @@ -4,6 +4,20 @@ description: Procedures are HeyVL's logical units of code. sidebar_position: 1 --- +```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + complete: sources.expressiveLanguage2021, + morgan: sources.programmingFromSpecifications, + oopsla: { + ...sources.heyvl2023, + href: "/docs/publications#oopsla-23", + }, +}; +``` + # Procedures and Coprocedures HeyVL [statements](statements.md) are placed inside the body of _(co)procedures_ or _(co)procs_ for short. @@ -85,7 +99,7 @@ This allows us to reason about various kinds expected values of probabilistic pr However, all of these expected values are limited to non-negative values. This is seldom a practical limitation.[^on-negative-numbers] -HeyVL supports the syntax of the [*relatively complete assertion language* by Batz et al](https://doi.org/10.1145/3434320). +HeyVL supports the syntax of the relatively complete assertion language . This means we can express practically all expected values of interest in our syntax. For more information, read the [Caesar documentation on relative completeness](./expressions.md#relative-completeness). @@ -240,7 +254,9 @@ This allows us to follow a programming methodology called *programming from spec We can start with just a specification and step-by-step fill in executable code. A procedure call to a procedure without a body then corresponds to what is known in the literature as the *specification statement*, which is the basis for the *programming from specifications* methodology. -[^programming-from-specifications]: The book *Programming from Specifications* by Carroll Morgan details the methodology in a very approachable way (for non-probabilistic programs). It is available online at https://www.cs.ox.ac.uk/publications/books/PfS/ in PostScript format (you can convert to PDF using `ps2pdf` command). ISBN: 978-0-13-123274-7. +[^programming-from-specifications]: The book *Programming from Specifications* details the methodology in a very approachable way (for non-probabilistic programs). + It is available online in PostScript format (you can convert to PDF using `ps2pdf` command). + ISBN: 978-0-13-123274-7. :::warning Infeasible Procedures @@ -355,7 +371,7 @@ This generalizes the Boolean setting: Example: Why validate is needed for soundness. The `validate` statement has no effect in the Boolean setting, but it is crucial for soundness in the quantitative setting. - The formal proof of soundness can be found in the [OOPSLA '23 paper](../publications.md#oopsla-23). + The formal proof of soundness can be found in the OOPSLA '23 paper . Here, we show an example where omitting the `validate` statement leads to unsoundness. Consider the following procedure `P` that has a pre of `1` and a post of `2`. @@ -423,15 +439,17 @@ This generalizes the Boolean setting: The encoding of [Park induction](../proof-rules/induction.md#internal-details) for the verification of while loops makes use of the same statements as the procedure call encoding plus some additional statements. -A more formal treatment of the encoding and semantics of procedure calls can be found in our [OOPSLA '23 paper](../publications.md#oopsla-23). +A more formal treatment of the encoding and semantics of procedure calls can be found in our OOPSLA '23 paper . [^spec-combination]: The combination of specifications is a logical consequence of their encodings in HeyVL. When *verifying* a procedure, `pre` annotations will be translated to `assume` and `post` annotations will be translated to `assert` statements. One can prove that the HeyVL statements `assume A1; assume A2` are equivalent to `assume (A1 ⊓ A2)`, and also that the sequence `assert A1; assert A2` is equivalent to `assert (A1 ⊓ A2)`. The same equalities can be used for the procedure *call* encoding. -[^on-negative-numbers]: Many verification tasks that require reasoning with negative numbers can be embedded in this framework. First, note that we can still have negative numbers in our program states, we just have to ensure that the `post` is non-negative. [Chapter 11 of the paper _"Relatively Complete Verification for Probabilistic Programs"_](https://dl.acm.org/doi/pdf/10.1145/3434320#page=24) by Batz et al. might be of interest for further reading. +[^on-negative-numbers]: Many verification tasks that require reasoning with negative numbers can be embedded in this framework. + First, note that we can still have negative numbers in our program states, we just have to ensure that the `post` is non-negative. + might be of interest for further reading. [^bang-question-operator]: `!?(b)` is not a special kind of operator, it is simply the `!` operator applied to `?(b)`, i.e. `!(?(b))`. The negation operator `!` is defined on `EUReal` by $!0 = \infty$ and $!x = 0$ for all $x \neq 0$. Thus, `!?(b)` is logically equivalent to `?(!b)`. -In the [OOPSLA '23 paper](../publications.md#oopsla-23), we denoted `!?(b)` by $\mathrm{co?}(b)$. +In the OOPSLA '23 paper , we denoted `!?(b)` by $\mathrm{co?}(b)$. diff --git a/website/docs/heyvl/statements.md b/website/docs/heyvl/statements.md index 4a8a52d0..57f337be 100644 --- a/website/docs/heyvl/statements.md +++ b/website/docs/heyvl/statements.md @@ -6,6 +6,32 @@ sidebar_position: 2 # Statements ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + construction: sources.correctnessByConstruction, + oopsla: { + ...sources.heyvl2023, + href: "/docs/publications#oopsla-23", + }, + cav: { + ...sources.caesar2026, + href: "https://link.springer.com/content/pdf/10.1007/978-3-032-32537-2_27.pdf?pdf=inline%20link", + venue: "CAV", + }, + weighted: sources.weightedProgramming, + game: { + ...sources.heyvlGame2024, + href: "/docs/publications#aisola-24-a-game-based-semantics-for-the-probabilistic-intermediate-verification-language-heyvl", + venue: "AISoLA", + }, + slicing: { + ...sources.slicing2026, + href: "/docs/publications#esop-26-error-localization-certificates-and-hints-for-probabilistic-program-verification-via-slicing", + venue: "ESOP", + }, +}; import styles from './statements.module.css'; ``` @@ -129,7 +155,7 @@ The other distributions require numeric literals. Arbitrary finite discrete probabilistic choices can be implemented using only fair binary probabilistic choice (`flip(0.5)`) and iteration (`while` loops)[^sampling-with-just-flips]. You can also use [`weigh`] statements and the additive choice statement (`if +`) to implement any finite discrete distribution, as shown in the [example below](#sampling-with-weights). -[^sampling-with-just-flips]: See [_Correctness by construction for probabilistic programs_ by McIver and Morgan](https://doi.org/10.1007/978-3-030-61362-4_12), Section 4. +[^sampling-with-just-flips]: See .
@@ -294,7 +320,7 @@ $8$, the sum of both rewards. For ASCII spellings, use `\cap` for `⊓`, `\cup` for `⊔`, and `\oplus` for `+`. Additive choice also accepts `⊕`. -One can use the additive choice operator and the [`weigh`](#weights) statement to implement any sampling from finite discrete distributions. +One can use the additive choice operator and the [`weigh`](#weigh) statement to implement any sampling from finite discrete distributions. The [example below](#sampling-with-weights) applies this to implement a `x = flip(0.3)` assignment.
@@ -605,7 +631,7 @@ assert I assume 0 ``` -Reading backwards, `assume 0` transforms any continuation into $\infty$, and `assert I` then yields $\min(I,\infty)=I$. +Reading backwards, `assume 0` transforms any postexpectation into $\infty$, and `assert I` then yields $\min(I,\infty)=I$. Proof-rule encodings use this to finish a branch after introducing its obligation. The dual fragment is: @@ -616,7 +642,7 @@ coassert I coassume \infty ``` -`coassume` makes the continuation $0$, and `coassert I` gives $\max(I,0)=I$. +`coassume` transforms any postexpectation into $0$, and `coassert I` gives $\max(I,0)=I$. For complete encodings, see [procedure calls](./procs.md#assert-assume-understanding-of-procedure-calls) and [Park induction](../proof-rules/induction.md#internal-details).
@@ -754,7 +780,7 @@ This pattern appears in [procedure-call encodings](./procs.md#assert-assume-unde ## Game Semantics {#game-semantics} -HeyVL programs describe a [game between two players](../publications.md#aisola-24-a-game-based-semantics-for-the-probabilistic-intermediate-verification-language-heyvl): the *demonic* player minimizes expected reward, and the *angelic* player maximizes it. +HeyVL programs describe a game between two players : the *demonic* player minimizes expected reward, and the *angelic* player maximizes it. For the core HeyVL language, the game's value is the [pre-expectation](#semantics) defined above. **Programs and choices.** @@ -834,11 +860,15 @@ Negation statements can break this property and make calls unsound. ## Further Reading -- [OOPSLA '23](../publications.md#oopsla-23): formal statement semantics and how `assert`, `havoc`, `validate`, and `assume` encode procedure calls. -- [CAV '26](../publications.md#cav-26-caesar-a-deductive-verifier-for-probabilistic-programs) ([PDF](https://link.springer.com/content/pdf/10.1007/978-3-032-32537-2_27.pdf?pdf=inline%20link)): how HeyVL proof encodings connect to Caesar's verification backends and editor support. -- [Weighted programming](https://arxiv.org/pdf/2608.18971): how `weigh` and additive choice express weighted programs beyond probabilities. -- [Game semantics (AISoLA '24)](../publications.md#aisola-24-a-game-based-semantics-for-the-probabilistic-intermediate-verification-language-heyvl): interpreting verification statements as a game between two players, with a referee for assumptions and validations. -- [Slicing (ESOP '26)](../publications.md#esop-26-error-localization-certificates-and-hints-for-probabilistic-program-verification-via-slicing): why a failed proof can involve several statements and paths, and how slicing finds them. +- Formal statement semantics and how `assert`, `havoc`, `validate`, and `assume` encode procedure calls. + +- How HeyVL proof encodings connect to Caesar's verification backends and editor support. + +- How `weigh` and additive choice express weighted programs beyond probabilities. + +- Interpreting verification statements as a game between two players, with a referee for assumptions and validations. + +- Why a failed proof can involve several statements and paths, and how slicing finds them. [^assertion-game]: The paper models assertions with referee decisions (Section 4.2, Table 1). Here we use an equivalent stop-or-continue choice. diff --git a/website/docs/heyvl/statements.module.css b/website/docs/heyvl/statements.module.css index 38c50e9c..2e082716 100644 --- a/website/docs/heyvl/statements.module.css +++ b/website/docs/heyvl/statements.module.css @@ -47,14 +47,22 @@ } .syntax { + --syntax-background: #e6f5ec; + --syntax-border: #a7d2ba; display: grid; grid-template-columns: minmax(0, 1fr) minmax(15rem, 0.9fr); align-items: start; gap: 1rem 2rem; margin: 0.75rem 0 1.25rem; padding: 1rem 1.15rem; + border: 1px solid var(--syntax-border); border-radius: 0.25rem; - background: var(--caesar-surface-hover); + background: var(--syntax-background); +} + +[data-theme='dark'] .syntax { + --syntax-background: #143c2e; + --syntax-border: #327859; } .syntax > p { @@ -70,7 +78,7 @@ position: absolute; top: 0.35rem; left: 0.75rem; - color: var(--ifm-color-emphasis-700); + color: var(--ifm-color-primary); font-family: var(--ifm-heading-font-family); font-size: 0.875rem; font-weight: 500; @@ -99,6 +107,7 @@ } .reference .syntax > :global(.theme-code-block) { + --prism-background-color: transparent !important; width: 100%; min-width: 0; margin: 0; @@ -110,9 +119,9 @@ .syntax pre { margin: 0; padding: 0 0 0 1rem; - border-left: 2px solid var(--ifm-color-emphasis-300); + border-left: 2px solid var(--syntax-border); border-radius: 0; - background: transparent; + background: transparent !important; } .rules { @@ -169,11 +178,13 @@ margin-top: 1.5rem; } -@container (max-width: 40rem) { +@container (max-width: 48rem) { .dualRules { grid-template-columns: 1fr; } +} +@container (max-width: 40rem) { .syntax { grid-template-columns: 1fr; gap: 0.6rem; diff --git a/website/docs/introduction.md b/website/docs/introduction.md index 64ec4e39..d9bb3bcf 100644 --- a/website/docs/introduction.md +++ b/website/docs/introduction.md @@ -2,8 +2,18 @@ sidebar_position: 1 slug: / --- + # Introduction +```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: sources.heyvl2023, +}; +``` + Hello and welcome! This is the user documentation for [_Caesar_](https://github.com/moves-rwth/caesar), a deductive verification framework for probabilistic programs. @@ -18,7 +28,10 @@ In the [Caesar section](./caesar/), we have documentation for the Caesar tool, i ### Our Theory Paper -We have an OOPSLA 2023 paper on Caesar and its theory: [_A Deductive Verification Infrastructure for Probabilistic Programs_](https://doi.org/10.1145/3622870). +Our OOPSLA 2023 paper introduces Caesar and its theory. + + + You can [find the preprint on arxiv](https://arxiv.org/abs/2309.07781). More information on the [publications page](./publications.md). diff --git a/website/docs/model-checking.md b/website/docs/model-checking.md index 7315de57..deae4568 100644 --- a/website/docs/model-checking.md +++ b/website/docs/model-checking.md @@ -6,6 +6,15 @@ description: Caesar can export models to the JANI format. # Model Checking ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=115", + }, +}; import Link from '@docusaurus/Link'; ``` @@ -337,6 +346,6 @@ In particular, the following constructs are *not* supported: [^1]: We use the `--exact` and `--sound` flags to ensure that Storm is forced to use exact arithmetic and only sound algorithms to produce the solution. Consult your chosen model checker's documentation to see which guarantees they give. [^2]: We always use least-fixed point semantics because encoding greatest fixpoint/weakest *liberal* pre-expectation semantics seems to be impossible with a single JANI property right now. -[^3]: [Corollary 4.26 of Benjamin Kaminski's PhD thesis](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=115) states that (one-bounded) `wlp` can be computed via `wp` plus the probability of divergence. +[^3]: states that (one-bounded) `wlp` can be computed via `wp` plus the probability of divergence. [^4]: This is similar to the qualitative wlp, which evaluates to the top element of the Boolean lattice (`true`) if the loop has a possibility of nontermination. In the quantitative setting, we have $\infty$ as our top element of the [`EUReal`](./stdlib/numbers.md#eureal) lattice. [^5]: Storm currently does not support the qualitative analysis required for the `can_diverge` property and will throw an error. The feature is tracked in the issue [moves-rwth/storm#529](https://github.com/moves-rwth/storm/issues/529). diff --git a/website/docs/proof-rules/README.md b/website/docs/proof-rules/README.md index d7335bae..dd399e7c 100644 --- a/website/docs/proof-rules/README.md +++ b/website/docs/proof-rules/README.md @@ -11,7 +11,7 @@ All while loops used in HeyVL must have a proof rule annotation so that they can To help you use proof rules correctly, Caesar supports [calculus annotations](./approximations#calculus-annotations) on procedures. These annotations specify a desired reasoning calculus and limit the proof rules for loops to ensure that only sound proof rules for the respective calculi are used. -If you have read our [OOPSLA '23 publication](../publications.md#oopsla-23): these proof rules were implemented in our [`pgcl2heyvl`](../pgcl.md) tool to reason about pGCL programs, but are now implemented directly in Caesar. +If you have read our OOPSLA '23 publication : these proof rules were implemented in our [`pgcl2heyvl`](../pgcl.md) tool to reason about pGCL programs, but are now implemented directly in Caesar. This allows verifiers for languages other than pGCL to re-use the proof rule encodings. :::caution @@ -19,11 +19,20 @@ This allows verifiers for languages other than pGCL to re-use the proof rule enc Proof rules are only sound in specific contexts. Using proof rules in a wrong way may lead to _unsoundness_, i.e. a program may falsely verify. To be certain that a proof rule may be applied, correctness of the proof rule needs to be proven with respect to the language semantics that are to be encoded. -See our [OOPSLA '23 publication](../publications.md#oopsla-23) for details on the theory. +See our OOPSLA '23 publication for details on the theory. ::: ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + oopsla: { + ...sources.heyvl2023, + href: "/docs/publications#oopsla-23", + }, +}; import DocCardList from '@theme/DocCardList'; diff --git a/website/docs/proof-rules/approximations.md b/website/docs/proof-rules/approximations.md index 522b5db2..a3535d3e 100644 --- a/website/docs/proof-rules/approximations.md +++ b/website/docs/proof-rules/approximations.md @@ -5,6 +5,20 @@ description: Approximations, sound verifications and refutations. --- ```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=91", + }, + reward: sources.totalExpectedRewards2024, + oopsla: { + ...sources.heyvl2023, + href: "/docs/publications#oopsla-23", + }, +}; import Mermaid from '@theme/Mermaid'; import Tabs from '@theme/Tabs'; import TabItem from '@theme/TabItem'; @@ -200,8 +214,9 @@ These annotations let Caesar check additional soundness conditions for proof-rul :::note RECOMMENDED PAPERS We recommend reading the following literature for formal accounts of the above semantics: -- **wp (LFP) and wlp (GFP) Semantics:** [Advanced Weakest Precondition Calculi for Probabilistic Programs](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=91), Chapter 4, Kaminski (2019). -- **Least Fixpoint Semantics in Detail:** [J-P: MDP. FP. PP -- Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs](https://doi.org/10.1007/978-3-031-75783-9_11), Batz et al. (2024). +- Formal accounts of wp (least fixed-point) and wlp (greatest fixed-point) semantics. + +- A detailed account of least fixed-point semantics for total expected rewards. ::: ### How Caesar Selects Original Semantics @@ -219,7 +234,7 @@ Correct results — sound verification or sound refutation — depend on The verification condition semantics is the semantics of the verification conditions that Caesar generates and reasons about. :::note RECOMMENDED READING - Our paper [_A Deductive Verification Infrastructure for Probabilistic Programs_](../publications#oopsla-23) explains the verification condition semantics in detail and covers several of the proof rules. + Our paper explains the verification condition semantics in detail and covers several of the proof rules. ::: @@ -402,7 +417,7 @@ Additionally, the rules [Almost-Sure Termination Rule](./ast#new-proof-rule), [P ## What Is Checked By Caesar {#what-is-checked} HeyVL is designed as an intermediate verification language and intentionally allows dangerous constructs. -See our [OOPSLA '23 paper](../publications#oopsla-23) for more background. +See our OOPSLA '23 paper for more background. Caesar checks many proof-rule soundness conditions automatically, but not all modeling assumptions. diff --git a/website/docs/proof-rules/ast.md b/website/docs/proof-rules/ast.md index 42d731a5..801a0909 100644 --- a/website/docs/proof-rules/ast.md +++ b/website/docs/proof-rules/ast.md @@ -5,21 +5,30 @@ sidebar_position: 5 # Almost-Sure Termination ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; +import TOCInline from '@theme/TOCInline'; + +export const references = { + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=139", + }, + mciver: sources.almostSureTermination2018, +}; ``` _Almost-sure termination_ (AST for short) means that a program terminates with probability one. -In our probabilistic setting, this does not necessarily mean that all executions terminate (we would call that _certain termination_), but only that the expected value to reach a terminating state is one. +Infinite executions may exist, provided the set of such executions has probability zero. In terms of weakest pre-expectations, this means that `wp[C](1) = 1` holds for a program `C`. -For a nice overview of details and proof rules that are available in the literature, we refer to [Chapter 6 of Benjamin Kaminski's PhD thesis](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=139). +For a nice overview of details and proof rules that are available in the literature, we refer to . In Caesar, there are several ways to prove almost-sure termination: ```mdx-code-block -import TOCInline from '@theme/TOCInline'; - ``` @@ -34,8 +43,8 @@ To _refute_ an upper bound on weakest pre-expectations, [unrolling](./unrolling. ## A New Proof Rule for Almost-Sure Termination (`@ast` Annotation) {#new-proof-rule} The `@ast` annotation proves almost-sure termination of a loop from every initial state satisfying a Boolean invariant $\mathtt{I}$. -Caesar's `@ast` rule adapts the _"new proof rule for almost-sure termination"_ by [McIver et al. (POPL 2018)](https://dl.acm.org/doi/10.1145/3158121). -An [extended version of the paper](https://arxiv.org/pdf/1711.03588.pdf) is available on arXiv. +Caesar's `@ast` rule adapts the new proof rule for almost-sure termination . +An extended version of the paper is available on arXiv . The rule uses a _loop variant_ $\mathtt{V}$ to measure progress towards termination. If an iteration starts with variant value $v$, it must exit or decrease $\mathtt{V}$ by at least $\mathtt{decrease}(v)$ with probability at least $\mathtt{prob}(v)$. @@ -158,9 +167,10 @@ If these conditions hold, `while G { Body }` terminates almost surely from every ### Usage Use `@ast(I, V, v, prob(v), decrease(v))` to generate the five checks above. -The following program encodes the "escaping spline" example from [Section 5.4 of the paper](https://dl.acm.org/doi/pdf/10.1145/3158121#page=18). +The following program encodes the "escaping spline" example from . ```heyvl +@wp proc ast_example4() -> () pre 1 post 1 @@ -210,17 +220,17 @@ A formal soundness proof for these adaptations is still pending. These comparisons use the same `I`, `V`, `prob`, and `decrease`. -Compared with [McIver et al., POPL 2018, Theorem 4.1](https://arxiv.org/pdf/1711.03588.pdf#page=7): +Compared with : - **Function assumptions → conditions 1–2:** unchanged. - **(i), invariant → condition 3:** unchanged; `I` is preserved and the body terminates almost surely under `I && G`. - **(ii), positive active variant:** the paper requires `I && G ==> V > 0`; Caesar allows `V = 0` while the guard holds. - **(iii), progress → condition 5:** the paper counts only `V + decrease(v) <= v` as progress; Caesar also counts `!G`. - **(iv), supermartingale → condition 4:** the paper requires `[I && G] * (H ⊖ V) <= wp[Body](H ⊖ V)` for every `H > 0`, where `H ⊖ V = max(H - V, 0)`. - With body termination from condition 3, this is equivalent to `awp[Body](V) <= V` under `I && G` ([Lemma B.1](https://arxiv.org/pdf/1711.03588.pdf#page=33)). + With body termination from condition 3, this is equivalent to `awp[Body](V) <= V` under `I && G` (). Caesar instead checks `awp[Body]([G] * V) <= V`, so exit values do not affect the bound. -Compared with [Kaminski's thesis, Theorem 6.8](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=149): +Compared with : - **Function assumptions → conditions 1–2:** the bounds are the same, but the thesis additionally requires antitonicity at zero. - **(a), invariant → condition 3:** unchanged, including body termination under `I && G`. diff --git a/website/docs/proof-rules/induction.md b/website/docs/proof-rules/induction.md index 6df68463..692e4646 100644 --- a/website/docs/proof-rules/induction.md +++ b/website/docs/proof-rules/induction.md @@ -6,7 +6,21 @@ sidebar_position: 2 # Induction and k-Induction ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + kinduction: sources.kInduction2021, + oopsla: { + ...sources.heyvl2023, + href: "https://arxiv.org/abs/2309.07781", + }, + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=121", + }, +}; ``` @@ -26,7 +40,7 @@ A dual version exists for `wp` and `ert` semantics. The same inequality holds with `uwlp` in place of `wlp`, using the full `EUReal` lattice instead of the one-bounded lattice. *$k$-induction* is a strictly stronger version of induction. -Refer to the [CAV 2021 paper presenting *latticed k-induction*](https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25) for more details. +Refer to the paper presenting latticed k-induction for more details. It allows us to reason about multiple loop iterations: the invariant is not required to be re-established after just one loop iteration, but may be re-established after $1$, $2$, ..., up to $k$ loop iterations. ## Usage @@ -87,7 +101,7 @@ Just like induction, the `@k_induction` annotation will result in a HeyVL encodi Again, Caesar will encode the *super-invariant* version for upper bounds in a `coproc` and the *sub-invariant* version for lower bounds in a `proc`. Check the [soundness section](#soundness) and the [details section](#internal-details) below for more details. -We recommend reading the [*Latticed k-induction* paper](https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25) for more details on the principle of k-induction applied to the verification of probabilistic programs. +We recommend reading the latticed k-induction paper for more details on the principle of k-induction applied to the verification of probabilistic programs. ## Soundness @@ -123,7 +137,7 @@ We describe the [encoding](#heyvl-encoding) of the proof rules in HeyVL, the [ve :::note -More polished formal details on the HeyVL encodings and the (simplified) semantics of the above proof rules are provided in the [extended version of our OOPSLA '23 paper](https://arxiv.org/abs/2309.07781), both in the main text and in Appendix C. +More polished formal details on the HeyVL encodings and the (simplified) semantics of the above proof rules are provided in the extended version of our OOPSLA '23 paper , both in the main text and in Appendix C. ::: @@ -179,7 +193,7 @@ $$ \forall \sigma \in \mathsf{States}.\quad I(\sigma) \leq ([G] \cdot \mathrm{wlp}\llbracket B \rrbracket(I) + [\neg G] \cdot f)(\sigma)~. $$ -[^common-park-induction]: A thorough exposition on the usual definition of *inductive invariants* for probabilistic programming is found in [Benjamin Kaminski's PhD thesis at Definition 5.1](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=121). +[^common-park-induction]: A thorough exposition on the usual definition of *inductive invariants* for probabilistic programming is found in . ### Local Inductive Invariants @@ -282,7 +296,7 @@ For the very similar encoding of procedure calls, we give [an example where remo The encoding is similar for k-induction (`@k_induction`). It also evaluates to `I` if the invariant is *k-inductive* and to $0$ otherwise. -Refer to the [k-induction paper](https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25) for the precise definition and properties of k-inductive invariants. +Refer to the k-induction paper for the precise definition and properties of k-inductive invariants. For *2-induction* for lower bounds, one obtains an encoding of the following form: ```heyvl @@ -337,4 +351,4 @@ The above explanation follows the version of $k$-induction for lower bounds on g However, in the literature, $k$-induction is often defined for upper bounds on least fixed-point semantics.[^literature-kind-upper-bounds] Then, the explanation is dual, and the encoding is similar, but essentially just with the angelic choices `if ⊔ { ... } else { ... }` replaced by demonic choices `if ⊓ { ... } else { ... }`. -[^literature-kind-upper-bounds]: For example, the [Latticed k-induction paper](https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25) defines and interprets latticed $k$-induction only for upper bounds on least fixed-point semantics. +[^literature-kind-upper-bounds]: For example, the latticed k-induction paper defines and interprets latticed $k$-induction only for upper bounds on least fixed-point semantics. diff --git a/website/docs/proof-rules/omega-invariants.md b/website/docs/proof-rules/omega-invariants.md index 985f99aa..e33c2157 100644 --- a/website/docs/proof-rules/omega-invariants.md +++ b/website/docs/proof-rules/omega-invariants.md @@ -6,7 +6,16 @@ sidebar_position: 4 # ω-Invariants ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=122", + }, +}; ``` @@ -28,7 +37,7 @@ $$ Here, $\Phi_f(X) = [G] \cdot \mathrm{wp}\llbracket Body \rrbracket(X) + [\neg G] \cdot f$ is the loop's characteristic functional for postexpectation $f$. The same rule applies to `ert`, and a dual version proves upper bounds for `wlp` and `uwlp` semantics. -For more details on the proof rule, see the discussion following [Definition 5.3 of Benjamin Kaminski's PhD thesis](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=122). +For more details on the proof rule, see the discussion following . ## Usage diff --git a/website/docs/proof-rules/ost.md b/website/docs/proof-rules/ost.md index e8d5a249..646e7c0f 100644 --- a/website/docs/proof-rules/ost.md +++ b/website/docs/proof-rules/ost.md @@ -6,7 +6,20 @@ description: Proof rule for lower bounds on least fixpoints. # Optional Stopping Theorem ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + hark: { + ...sources.aimingLow2020, + href: "https://arxiv.org/pdf/1904.01117v3#page=17", + }, + oopsla: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781v3#page=43", + }, +}; ``` @@ -15,7 +28,7 @@ The `@ost` annotation proves lower bounds on the expected result of a loop: `I < The candidate bound `I` must be finite, must not decrease in expectation during an iteration, and must be at most the postexpectation `f` on exit. The rule also requires a finite expected number of iterations and a constant bound on the expected absolute change of `I` in each iteration. -The rule is based on the "Optional Stopping Theorem for Weakest Preexpectation Reasoning" by [Hark et al. (POPL 2020)](https://doi.org/10.1145/3371105). +The rule is based on the "Optional Stopping Theorem for Weakest Preexpectation Reasoning" . For upper bounds on expected results, use [induction](./induction.md). ## Formal Theorem @@ -119,8 +132,8 @@ If these conditions hold, `I <= wp[while G { Body }](f)`. Use `@ost(I, PAST_I, c, f)` to check the four conditions above. Caesar generates five procedures because it checks finiteness of `PAST_I` separately from its superinvariant condition. -The following [geometric loop](https://arxiv.org/pdf/1904.01117v3#page=19) stops with probability $0.5$ in each iteration and otherwise increments `b`. -The invariant `b + [a]` gives a lower bound on the expected final value of `b`. +The following geometric loop stops with probability $0.5$ in each iteration and otherwise increments `b`. +The invariant `b + [a]` gives a lower bound on the expected value of `b` on termination. ```heyvl @wp @@ -180,7 +193,7 @@ $$ The extra $1$ in the second check counts each iteration, so $\mathtt{PAST\_I}$ bounds the expected number of iterations. In the third check, $I(s)$ is the value before the iteration, and $\mathrm{ert}$ adds the body ticks to the expected absolute change of $I$. -The triangle inequality then gives the change bound needed to apply optional stopping to accumulated ticks plus $I$. [Hark et al., Theorem 32(b)](https://arxiv.org/pdf/1904.01117v3#page=15) +The triangle inequality then gives the change bound needed to apply optional stopping to accumulated ticks plus $I$ . ## Soundness @@ -188,13 +201,13 @@ The theorem assumes that `Body` terminates almost surely and contains no nondete Caesar does not check these assumptions. Caesar checks finiteness of `I` and `PAST_I` directly; `f` need not be finite. -The proof rule generalizes [Hark et al., Theorem 38(b)](https://arxiv.org/pdf/1904.01117v3#page=17), and simplifies the OST encoding in [Schröer et al., *A Deductive Verification Infrastructure for Probabilistic Programs*, Appendix C.5](https://arxiv.org/pdf/2309.07781v3#page=43). +The proof rule generalizes , and simplifies the OST encoding in . Cases (a) and (c) require a manual encoding.
Differences from the published formulations -Compared with [Hark et al., Theorem 38(b) in the extended paper](https://arxiv.org/pdf/1904.01117v3#page=17) (Theorem 37(b) in the published paper): +Compared with (Theorem 37(b) in the published paper): - Caesar drops harmonization (`I = f` on exit). The exit inequality `I <= f` already follows from subinvariance. @@ -223,12 +236,12 @@ The comparison with $f$ holds for nonnegative extended expectations, so $f$ may
-Compared with the [Encoding of the Optional Stopping Theorem for wp (Appendix C.5)](https://arxiv.org/pdf/2309.07781v3#page=43): +Compared with the encoding of the Optional Stopping Theorem for wp : - Caesar drops harmonization and checks `I < ∞` directly in place of the finiteness condition on $\Phi_f(I)$. -- Caesar checks conditional difference boundedness only for states satisfying `G`, as in [Hark et al.'s Definition 35](https://arxiv.org/pdf/1904.01117v3#page=16). +- Caesar checks conditional difference boundedness only for states satisfying `G`, as in . The unguarded check in Appendix C.5 can reject valid invariants whose change is unbounded outside the guard. -- Appendix C.5 requires [finite expected runtime](https://arxiv.org/pdf/2309.07781v3#page=23) of the whole loop. +- Appendix C.5 requires finite expected runtime of the whole loop . Here, `Body` may have infinite expected runtime, provided it is AST and the expected number of outer-loop iterations is finite. diff --git a/website/docs/proof-rules/past.md b/website/docs/proof-rules/past.md index 897e1696..65658c8d 100644 --- a/website/docs/proof-rules/past.md +++ b/website/docs/proof-rules/past.md @@ -5,8 +5,19 @@ sidebar_position: 6 # Positive Almost-Sure Termination ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; import TOCInline from '@theme/TOCInline'; + +export const references = { + kaminski: { + ...sources.kaminski2019, + href: "https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=143", + }, + martingales: sources.martingales2013, + fioriti: sources.probabilisticTermination2015, +}; ``` @@ -33,8 +44,8 @@ The [soundness proof](#past-via-ert-superinvariants) derives these guarantees by If the `coproc` omits its calculus annotation, `@past` selects least-fixed-point semantics. -The rule follows the ranking-superinvariant argument in [Kaminski (2019), Theorem 6.3](https://publications.rwth-aachen.de/record/755408/files/755408.pdf#page=143). -Related results use the term *ranking supermartingale* [Chakarov and Sankaranarayanan (2013), Theorem 4](https://doi.org/10.1007/978-3-642-39799-8_34) and [Ferrer Fioriti and Hermanns (2015), Theorem 5.6](https://doi.org/10.1145/2676726.2677001). +The rule follows the ranking-superinvariant argument . +Related results use the term *ranking supermartingale* , . ### Verification Conditions {#formal-theorem} diff --git a/website/docs/proof-rules/unrolling.md b/website/docs/proof-rules/unrolling.md index 46e5f938..21a6713b 100644 --- a/website/docs/proof-rules/unrolling.md +++ b/website/docs/proof-rules/unrolling.md @@ -5,7 +5,13 @@ sidebar_position: 3 --- ```mdx-code-block +import Citation from '@site/src/components/Citation'; import ProofRuleGuarantee from '@site/src/components/ProofRuleGuarantee'; +import {references as sources} from '@site/src/data/references'; + +export const references = { + kinduction: sources.kInduction2021, +}; ``` # Loop Unrolling and Bounded Model Checking @@ -128,6 +134,7 @@ In the following example, we use loop unrolling to refute an upper bound (`copro Because we want to approximate least fixed-point semantics, we use `0` as our `terminator` (c.f. [*Usage*](#usage)). ```heyvl +@wp coproc geo1_bmc(init_c: UInt) -> (c: UInt) pre init_c + 0.99 post c @@ -224,4 +231,4 @@ However, loop unrolling is *complete* for *refuting* specifications when the sem This is the case for `wp`, `ert`, and one-bounded `wlp` semantics. Then, any *wrong* bound on the pre can be refuted by *some* value of `k`.[^bmc-completeness] -[^bmc-completeness]: See [_Latticed k-Induction with an Application to Probabilistic Programs_](https://link.springer.com/chapter/10.1007/978-3-030-81688-9_25) (CAV 2021) for more information on the theory of *bounded model checking* on probabilistic programs. +[^bmc-completeness]: See for more information on the theory of *bounded model checking* on probabilistic programs. diff --git a/website/docs/publications.md b/website/docs/publications.md index 958f9fe3..9f434074 100644 --- a/website/docs/publications.md +++ b/website/docs/publications.md @@ -3,6 +3,16 @@ title: Publications sidebar_position: 9 --- +```mdx-code-block +import Citation from '@site/src/components/Citation'; +import {references} from '@site/src/data/references'; + +export const theoryPaper = { + ...references.heyvl2023, + venue: 'Proceedings of the ACM on Programming Languages 7, OOPSLA 2023', +}; +``` + # Academic Publications Caesar is a collaboration of the [Chair for Software Modeling and Verification (MOVES)](https://moves.rwth-aachen.de/) at RWTH Aachen University, the [QUAVE group](https://quave.cs.uni-saarland.de/) at Saarland University, the [SSE section](https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering) at the Technical University of Denmark, the [PPLV group](http://pplv.cs.ucl.ac.uk/welcome/) at University College London, and the [Theory of Correct Systems group](https://uol.de/en/computingscience/groups/theorie-korrekter-systeme) at the University of Oldenburg. @@ -11,9 +21,8 @@ If you are interested in collaborations or simply have some questions, please re :::note Citing Caesar -For publications about Caesar, please cite our [OOPSLA '23 paper](#oopsla-23) ([BibTeX file](https://dblp.org/rec/journals/pacmpl/SchroerBKKM23.html?view=bibtex)): - -> Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. *A Deductive Verification Infrastructure for Probabilistic Programs.* Proceedings of the ACM on Programming Languages 7, OOPSLA 2023. DOI: https://doi.org/10.1145/3622870. +For Caesar as a verifier, cite the [CAV 2026 tool paper](#cav-26-caesar-a-deductive-verifier-for-probabilistic-programs) ([BibTeX](https://dblp.org/rec/conf/cav/SchroerBDHKKM26.html?view=bibtex)). +For HeyVL and the foundations of the verification infrastructure, cite the [OOPSLA 2023 paper](#oopsla-23) ([BibTeX](https://dblp.org/rec/journals/pacmpl/SchroerBKKM23.html?view=bibtex)). ::: @@ -29,7 +38,9 @@ import TOCInline from '@theme/TOCInline'; ### ITP '26: Securing the Foundations of an Intermediate Language for Probabilistic Program Verification -The paper [_"Securing the Foundations of an Intermediate Language for Probabilistic Program Verification"_](https://doi.org/10.4230/LIPIcs.ITP.2026.29) by Oliver Bøving and Christoph Matheja was published at [ITP 2026](https://itp-conference-2026.github.io/), held in Lisbon, Portugal. + + +The paper was published at [ITP 2026](https://itp-conference-2026.github.io/), held in Lisbon, Portugal. The paper develops mechanized foundations in Lean for proving the correctness of HeyVL encodings and probabilistic-program verification techniques. It formalizes Markov decision processes and their probability spaces, characterizes expected total costs as least fixed points, and uses these results to verify weakest-precondition calculi and existing HeyVL encodings. @@ -40,7 +51,9 @@ See also [our blog post about the paper](/blog/2026/07/22/itp26-securing-foundat ### CAV '26: Caesar: A Deductive Verifier for Probabilistic Programs -The tool paper [_"Caesar: A Deductive Verifier for Probabilistic Programs"_](https://doi.org/10.1007/978-3-032-32537-2_27) by Philipp Schröer, Kevin Batz, Umut Yiğit Dural, Darion Haase, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja was published at [CAV 2026](https://conferences.i-cav.org/2026/) in Lisbon, Portugal. + + +The tool paper was published at [CAV 2026](https://conferences.i-cav.org/2026/) in Lisbon, Portugal. The [published paper is available as an open-access PDF](https://link.springer.com/content/pdf/10.1007/978-3-032-32537-2_27.pdf?pdf=inline%20link). A [preprint is also available on arXiv](https://arxiv.org/abs/2605.15827). @@ -56,9 +69,11 @@ See also: ### FM '26: Highly Incremental: A Simple Programmatic Approach for Many Objectives -The paper [_"Highly Incremental: A Simple Programmatic Approach for Many Objectives"_](https://doi.org/10.1007/978-3-032-26204-2_29) by Philipp Schröer and Joost-Pieter Katoen was published at [_FM 2026)_](https://conf.researchr.org/home/fm-2026) in Tokyo, Japan. + + +The paper was published at [FM 2026](https://conf.researchr.org/home/fm-2026) in Tokyo, Japan. -An **extended version with a detailed appendix of proofs and case studies** is available on arXiv: [_"Highly Incremental: A Simple Programmatic Approach for Many Objectives (Extended Version)"_](https://arxiv.org/abs/2603.02405). +An **extended version with a detailed appendix of proofs and case studies** is [available on arXiv](https://arxiv.org/abs/2603.02405). The paper present a one-fits-all programmatic approach to reason about a plethora of objectives on probabilistic programs. The first ingredient is to add a reward-statement to the language. @@ -72,8 +87,9 @@ See also our [blog post about the paper](/blog/2026/03/04/highly-incremental) fo ### POPL '26: Verifying Almost-Sure Termination for Randomized Distributed Algorithms -The paper [_"Verifying Almost-Sure Termination for Randomized Distributed Algorithms"_](https://doi.org/10.1145/3776691) was presented at the [POPL 2026](https://popl26.sigplan.org/). -The authors are Constantin Enea (LIX, CNRS, Ecole Polytechnique), Rupak Majumdar (MPI-SWS), Harshit Jitendra Motwani (MPI-SWS), V.R. Sathiyanarayana (MPI-SWS). + + +The paper was presented at [POPL 2026](https://popl26.sigplan.org/). The paper presents a verification technique for liveness properties of randomized distributed algorithms. It introduces a proof rule for fair almost-sure termination of distributed systems, combining martingale-based arguments for probabilistic termination with reasoning about weak fairness. @@ -83,9 +99,11 @@ See also [our blog post for more details](/blog/2026/01/15/popl26-ast-distribute ### ESOP '26: Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing -The paper [_"Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing"_](https://arxiv.org/abs/2512.20214) by Philipp Schröer, Darion Haase, and Joost-Pieter Katoen was accepted at the [ESOP 2026](https://etaps.org/2026/conferences/esop/) to be held in Turin, Italy. + -An **extended version with proofs and additional material** is available on arXiv: [Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Extended Version) — arXiv:2512.20214](https://arxiv.org/abs/2512.20214). +The paper was accepted at [ESOP 2026](https://etaps.org/2026/conferences/esop/), to be held in Turin, Italy. + +An **extended version with proofs and additional material** is [available on arXiv](https://arxiv.org/abs/2512.20214). The paper presents theoretical foundations and the implementation of our slicing-based user diagnostics in Caesar, dubbed *Brutus*, and introduces different kinds of slices: error-witnessing (for error localization), verification-witnessing (for proof simplification), and verification-preserving (to maintain successful verification results). @@ -97,7 +115,9 @@ See also: ### OOPSLA '25: Foundations for Deductive Verification of Continuous Probabilistic Programs -The paper [_"Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back"_](https://dl.acm.org/doi/10.1145/3720429) by Kevin Batz, Joost-Pieter Katoen, Francesca Randone, and Tobias Winkler was recently published at [OOPSLA 2025](https://2025.splashcon.org/track/OOPSLA). DOI: https://doi.org/10.1145/3720429. + + +The paper was recently published at [OOPSLA 2025](https://2025.splashcon.org/track/OOPSLA), with DOI [10.1145/3720429](https://doi.org/10.1145/3720429). This paper lays out the formal foundations for us to verify probabilistic programs that sample from continuous distributions, with support for loops, and conditioning. One challenge is to integrate the integrals for the expected values that arise from continuous distributions into the deductive verification framework of Caesar. @@ -108,8 +128,9 @@ In addition to theoretical results such as convergence and completeness of the a ### AISoLA '24: A Game-Based Semantics for the Probabilistic Intermediate Verification Language HeyVL -The publication [_"A Game-Based Semantics for the Probabilistic -Intermediate Verification Language HeyVL"_](https://doi.org/10.1007/978-3-031-75434-0_17) by Christoph Matheja was published at [AISoLA 2024](https://2024-isola.isola-conference.org/). DOI: https://doi.org/10.1007/978-3-031-75434-0_17. + + +The publication appeared at [AISoLA 2024](https://2024-isola.isola-conference.org/). Quoting from its abstract: @@ -121,14 +142,12 @@ This new operational semantics is aimed at improved intuition and ergonomics of ### OOPSLA '23: A Deductive Verification Infrastructure for Probabilistic Programs {#oopsla-23} -HeyVL and Caesar were first published at [OOPSLA '23](https://2023.splashcon.org/track/splash-2023-oopsla): [A Deductive Verification Infrastructure for Probabilistic Programs](https://doi.org/10.1145/3622870) by Schröer et al. -This paper introduces HeyLo and HeyVL with formal semantics, and explains how different proof rule encodings work. - -For publication, please cite as follows ([BibTeX file](https://dblp.org/rec/journals/pacmpl/SchroerBKKM23.html?view=bibtex)): + -> Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. *A Deductive Verification Infrastructure for Probabilistic Programs.* Proceedings of the ACM on Programming Languages 7, OOPSLA 2023. DOI: https://doi.org/10.1145/3622870. +HeyVL and Caesar were first published at [OOPSLA '23](https://2023.splashcon.org/track/splash-2023-oopsla). +This paper introduces HeyLo and HeyVL with formal semantics, and explains how different proof rule encodings work. -An **extended version with proofs, details on encodings, and typo fixes** is available on arXiv: [A Deductive Verification Infrastructure for Probabilistic Programs (Extended Version) — arXiv:2309.07781](https://arxiv.org/abs/2309.07781). +An **extended version with proofs, details on encodings, and typo fixes** is [available on arXiv](https://arxiv.org/abs/2309.07781). **The artifact** for our OOPSLA '23 publication is [available on Zenodo](https://zenodo.org/record/8146987). [It has received the *Distinguished Artifact* award](/blog/2023/10/27/oopsla23-distinguished-artifact), praising exceptionally high quality of the artifact. @@ -151,7 +170,8 @@ Below are some selected theses that contributed to the development of Caesar and ### Master Thesis '25: Effective Quantifier-based Reasoning for Quantitative Deductive Verification -[_"Effective quantifier-based reasoning for quantitative deductive verification"_](https://publications.rwth-aachen.de/record/1016969) is a Master thesis written by Emil Beothy-Elo at RWTH Aachen University. + + This thesis investigates different encodings of user-defined recursive functions as limited functions to avoid matching loops in the context of Caesar. It provides formal definitions and soundness proofs for several encodings used by other verifiers, and examines how one of the encodings can be modified to obtain finite and constructible counterexamples involving recursive functions. The results of this thesis [have been implemented in Caesar](./caesar/debugging.md#function-encodings-and-limited-functions) (as of [Caesar 3.0.0](/blog/2025/07/29/caesar-3-0)). @@ -166,7 +186,8 @@ Caesar is a deductive verifier for probabilistic programs. It builds on modern S ### Master Thesis '25: Practical Probabilistic Program Verification using Caesar -[_"Practical Probabilistic Program Verification using Caesar"_](https://purl.utwente.nl/essays/106318) is a Master thesis by Franka van Jaarsveld written at the University of Twente. + + It uses the *Bounded Retransmission Protocol* (BRP) as a case study to explore the practical verification of probabilistic programs using Caesar and gives insights into the strengths and limitations of Caesar in practice. The PDF file is available via the [UT Student Theses website](https://purl.utwente.nl/essays/106318). @@ -180,7 +201,9 @@ This thesis explores the practical verification of probabilistic programs using ### Master Thesis '22: A Deductive Verifier for Probabilistic Programs -Caesar is based on a 2022 Master thesis by Philipp Schroer entitled [_"A Deductive Verifier for Probabilistic Programs"_](https://publications.rwth-aachen.de/record/998370). + + +Caesar is based on this thesis. This thesis contains the foundations for Caesar, HeyVL, and HeyLo, including encodings for Park induction, k-induction, and bounded model checking. It also discusses the implementation of Caesar with its prenexing-based quantifier elimination and presents early experimental results. @@ -199,16 +222,21 @@ Compared to the [OOPSLA '23 paper](#oopsla-23): * The thesis still uses negation statements, whereas the paper switches to `validate` statements to encode comparisons. * `validate` statements have monotonic semantics (in contrast to negation statements), which is easier to work with in general. -Citations: -* DOI: https://doi.org/10.18154/RWTH-2024-11340. -* BibTeX: https://publications.rwth-aachen.de/record/998370/export/hx?ln=en +Citation metadata is available via the [DOI](https://doi.org/10.18154/RWTH-2024-11340) and as [BibTeX](https://publications.rwth-aachen.de/record/998370/export/hx?ln=en). ## Related Work and Further Reading For more background on the weakest pre-expectation-based approach to reasoning about probabilistic programs, we recommend the following publications: - * [_"Advanced weakest precondition calculi for probabilistic programs"_](https://publications.rwth-aachen.de/record/755408/). PhD thesis by Benjamin Lucien Kaminski (RWTH Aachen University, 2019). [PDF file is available online](https://publications.rwth-aachen.de/record/755408/files/755408.pdf). - * [_"Automated deductive verification of probabilistic programs"_](https://publications.rwth-aachen.de/record/1002329/). PhD thesis by Kevin Batz (RWTH Aachen University, 2024). [PDF file is available online](https://publications.rwth-aachen.de/record/1002329/files/1002329.pdf). + +- + The [PDF file is available online](https://publications.rwth-aachen.de/record/755408/files/755408.pdf). + + +- + The [PDF file is available online](https://publications.rwth-aachen.de/record/1002329/files/1002329.pdf). + Caesar uses SMT solvers as backends. For more information on SMT solving, we recommend: - * [_"Satisfiability Modulo Theories: A Beginner’s Tutorial"_](https://doi.org/10.1007/978-3-031-71177-0_31) by Barrett et al. (2024). + +- diff --git a/website/docs/stdlib/lists.md b/website/docs/stdlib/lists.md index 72b2aa9e..22de6812 100644 --- a/website/docs/stdlib/lists.md +++ b/website/docs/stdlib/lists.md @@ -65,6 +65,7 @@ The built-in API is enough for many length-preserving transformations. For example, `fill` rewrites every valid index with the same value: ```heyvl +@uwlp proc fill(list: []UInt, value: UInt) -> (res: []UInt) post ?(len(res) == len(list)) post ?(forall k: UInt. (k < len(list)) ==> (select(res, k) == value)) From 83632c4ea96210658faefbf44328e51caf87a231 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:57 +0100 Subject: [PATCH 14/32] website: improve documentation and source readability --- website/src/css/custom.css | 6 ++ website/src/css/docs.css | 66 ++++++++++++++++++-- website/src/css/verification-code.module.css | 7 +++ 3 files changed, 75 insertions(+), 4 deletions(-) diff --git a/website/src/css/custom.css b/website/src/css/custom.css index 670f671f..520a5866 100644 --- a/website/src/css/custom.css +++ b/website/src/css/custom.css @@ -290,6 +290,12 @@ article a[target="_blank"]:not(.button) { math to nicely be contained in the surrounding text. */ .katex { font-size: 1em !important; } +.token.comment { + color: color-mix(in srgb, var(--ifm-font-color-base) 85%, var(--ifm-background-color)) !important; + font-style: normal !important; + opacity: 1; +} + .float-right-responsive { float: right; margin: 0 0 1rem 1rem; diff --git a/website/src/css/docs.css b/website/src/css/docs.css index 9c4880ee..632f1318 100644 --- a/website/src/css/docs.css +++ b/website/src/css/docs.css @@ -1,3 +1,64 @@ +:root { + /* Use the body font's measure for headings and code as well as prose. */ + --caesar-docs-reading-width: 70rch; + --caesar-docs-code-width: var(--caesar-docs-reading-width); +} + +article:has(> .theme-doc-markdown) { + container-type: inline-size; +} + +.theme-doc-markdown { + max-inline-size: var(--caesar-docs-reading-width); + margin-inline: auto; +} + +/* The gallery explicitly opts into the wider article layout. */ +.theme-doc-markdown:has(> .docs-wide) { + max-inline-size: none; +} + +.theme-doc-markdown h1 { + text-wrap: balance; + position: relative; + inset-inline-start: 50%; + inline-size: 100cqw; + transform: translateX(-50%); + text-align: center; +} + +.theme-doc-markdown :where(h2, h3, h4, h5, h6, p, ul, ol, dl, blockquote, details, hr, .theme-admonition), +.theme-doc-breadcrumbs, +.theme-doc-toc-mobile, +.theme-doc-footer, +article:has(> .theme-doc-markdown) + .pagination-nav { + max-inline-size: var(--caesar-docs-reading-width); + margin-inline: auto; +} + +/* Keep navigation card text aligned and wrap it within the card. */ +.theme-doc-markdown .card > :where(h2, p) { + min-inline-size: 0; + margin-inline: 0; + white-space: normal; + overflow-wrap: anywhere; +} + +/* Keep examples within the reading column, including their headers and controls. */ +.markdown.theme-doc-markdown .theme-code-block { + max-inline-size: min(100%, var(--caesar-docs-code-width)); +} + +.theme-doc-markdown :where(table, figure, .katex-display) { + max-inline-size: 100%; + margin-inline: auto; +} + +.theme-doc-markdown .katex-display { + overflow-x: auto; + overflow-y: hidden; +} + /* Style anchored Markdown headings so card and figure titles keep their own typography. */ .theme-doc-markdown h2.anchor { --ifm-h2-font-size: 1.5rem; @@ -36,9 +97,6 @@ margin-top: 1.5rem; } -.theme-doc-markdown strong, -.theme-doc-toc-desktop .table-of-contents > li > a, -.theme-doc-toc-mobile .table-of-contents > li > a, -.theme-doc-markdown .table-of-contents > li > a { +.theme-doc-markdown strong { font-weight: var(--ifm-heading-font-weight); } diff --git a/website/src/css/verification-code.module.css b/website/src/css/verification-code.module.css index 17edf237..110d720e 100644 --- a/website/src/css/verification-code.module.css +++ b/website/src/css/verification-code.module.css @@ -1,8 +1,10 @@ .code { + --docusaurus-highlighted-code-line-bg: color-mix(in srgb, var(--ifm-color-primary) 6%, var(--prism-background-color)); --verification-keyword: #086f73; --verification-builtin: #365fb8; --verification-boolean: #a74343; --verification-punctuation: #8840ad; + --verification-comment: #596575; } :global([data-theme='dark']) .code { @@ -10,6 +12,7 @@ --verification-builtin: #82aaff; --verification-boolean: #ff8096; --verification-punctuation: #c792ea; + --verification-comment: #a0b2b2; } /* Override Prism's inline colors, including on highlighted lines. */ @@ -31,6 +34,10 @@ color: var(--verification-punctuation) !important; } +.code :global(.token.comment) { + color: var(--verification-comment) !important; +} + .code [class*='codeLineNumber']::before { opacity: 0.8; } From 9487804d9566ecc89f0b5b887c47d74f22170cf3 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:57 +0100 Subject: [PATCH 15/32] examples: add Boolean algorithm verification fixtures --- .../algorithms/binary_search_trees.heyvl | 166 ++++++++++++++++++ tests/boolean/algorithms/bubble_sort.heyvl | 90 ++++++++++ tests/boolean/algorithms/insertion_sort.heyvl | 80 +++++++++ tests/boolean/algorithms/left_pad.heyvl | 49 ++++++ .../boolean/algorithms/list_operations.heyvl | 84 +++++++++ tests/boolean/algorithms/quicksort.heyvl | 81 +++++++++ tests/boolean/algorithms/selection_sort.heyvl | 77 ++++++++ 7 files changed, 627 insertions(+) create mode 100644 tests/boolean/algorithms/binary_search_trees.heyvl create mode 100644 tests/boolean/algorithms/bubble_sort.heyvl create mode 100644 tests/boolean/algorithms/insertion_sort.heyvl create mode 100644 tests/boolean/algorithms/left_pad.heyvl create mode 100644 tests/boolean/algorithms/list_operations.heyvl create mode 100644 tests/boolean/algorithms/quicksort.heyvl create mode 100644 tests/boolean/algorithms/selection_sort.heyvl diff --git a/tests/boolean/algorithms/binary_search_trees.heyvl b/tests/boolean/algorithms/binary_search_trees.heyvl new file mode 100644 index 00000000..fad0582d --- /dev/null +++ b/tests/boolean/algorithms/binary_search_trees.heyvl @@ -0,0 +1,166 @@ +// RUN: @caesar verify --function-encoding fuel-param-computation @file +// Verify membership, extrema, and insertion for trees specified by domain axioms. + +domain Tree { + // Constructors for the empty tree and a node with two children. + func nil(): Tree + func node(left: Tree, value: Int, right: Tree): Tree + + // Selectors recover the corresponding argument of a constructed node. + func left_child(tree: Tree): Tree + axiom left_child_node forall left: Tree, value: Int, right: Tree. + left_child(node(left, value, right)) == left + + func root_value(tree: Tree): Int + axiom root_value_node forall left: Tree, value: Int, right: Tree. + root_value(node(left, value, right)) == value + + func right_child(tree: Tree): Tree + axiom right_child_node forall left: Tree, value: Int, right: Tree. + right_child(node(left, value, right)) == right + + // A tree is empty precisely when it equals nil(). + func is_nil(tree: Tree): Bool + axiom is_nil_def forall tree: Tree. + is_nil(tree) == (tree == nil()) + + // A constructed node is never empty. + axiom node_not_nil forall left: Tree, value: Int, right: Tree. + node(left, value, right) != nil() + + // Membership holds at the root or in either subtree. + func contains(tree: Tree, value: Int): Bool = + ite( + is_nil(tree), + false, + (value == root_value(tree)) || + contains(left_child(tree), value) || + contains(right_child(tree), value) + ) + + // Both subtrees are ordered, with left values below and right values above the root. + func is_bst(tree: Tree): Bool = + ite( + is_nil(tree), + true, + is_bst(left_child(tree)) && + is_bst(right_child(tree)) && + (forall value: Int. contains(left_child(tree), value) ==> (value < root_value(tree))) && + (forall value: Int. contains(right_child(tree), value) ==> (root_value(tree) < value)) + ) + + func min_value(tree: Tree): Int = + ite(is_nil(left_child(tree)), root_value(tree), min_value(left_child(tree))) + + func max_value(tree: Tree): Int = + ite(is_nil(right_child(tree)), root_value(tree), max_value(right_child(tree))) + +} + +@uwlp +proc get_min(tree: Tree) -> (result: Int) + pre ?(is_bst(tree) && !is_nil(tree)) + post ?( + (result == min_value(tree)) && + contains(tree, result) && + (forall value: Int. + (contains(tree, value) && (value != result)) ==> (result < value)) + ) +{ + var left: Tree = left_child(tree) + var root: Int = root_value(tree) + if is_nil(left) { + result = root + } else { + result = get_min(left) + } +} + +@uwlp +proc contains_value(tree: Tree, value: Int) -> (present: Bool) + post ?(present == contains(tree, value)) +{ + if is_nil(tree) { + present = false + } else { + var root: Int = root_value(tree) + if value == root { + present = true + } else { + var in_left: Bool = contains_value(left_child(tree), value) + if in_left { + present = true + } else { + present = contains_value(right_child(tree), value) + } + } + } +} + +@uwlp +proc insert_value(tree: Tree, value: Int) -> (result: Tree) + pre ?(is_bst(tree)) + post ?(is_bst(result)) + post ?(forall witness: Int. + contains(result, witness) == (contains(tree, witness) || (witness == value))) +{ + if is_nil(tree) { + result = node(nil(), value, nil()) + } else { + var left: Tree = left_child(tree) + var root: Int = root_value(tree) + var right: Tree = right_child(tree) + + if value < root { + var new_left: Tree = insert_value(left, value) + result = node(new_left, root, right) + } else { + if root < value { + var new_right: Tree = insert_value(right, value) + result = node(left, root, new_right) + } else { + result = tree + } + } + } +} + +@uwlp +proc get_max(tree: Tree) -> (result: Int) + pre ?(is_bst(tree) && !is_nil(tree)) + post ?( + (result == max_value(tree)) && + contains(tree, result) && + (forall value: Int. + (contains(tree, value) && (value != result)) ==> (value < result)) + ) +{ + var right: Tree = right_child(tree) + var root: Int = root_value(tree) + if is_nil(right) { + result = root + } else { + result = get_max(right) + } +} + +@uwlp +proc insert_example() -> () +{ + var tree: Tree = nil() + tree = insert_value(tree, 4) + tree = insert_value(tree, 2) + tree = insert_value(tree, 8) + tree = insert_value(tree, 6) + + assert ?(is_bst(tree)) + assert ?(contains(tree, 2)) + assert ?(contains(tree, 4)) + assert ?(contains(tree, 6)) + assert ?(contains(tree, 8)) + + var least: Int = get_min(tree) + var greatest: Int = get_max(tree) + assert ?(least == 2) + assert ?(greatest == 8) +} diff --git a/tests/boolean/algorithms/bubble_sort.heyvl b/tests/boolean/algorithms/bubble_sort.heyvl new file mode 100644 index 00000000..2fc42e98 --- /dev/null +++ b/tests/boolean/algorithms/bubble_sort.heyvl @@ -0,0 +1,90 @@ +// RUN: @caesar @file +// Verify that bubble sort produces a nondecreasing list of the same length. + +proc sort_pair_at(input: []Int, index: UInt) -> (result: []Int) + pre ?(index + 1 < len(input)) + post ?( + (len(result) == len(input)) && + (select(result, index) <= select(result, index + 1)) && + (forall k: UInt. + ((k < len(input)) && (k != index) && (k != index + 1)) ==> + (select(result, k) == select(input, k))) + ) +{ + if select(input, index) > select(input, index + 1) { + var left: Int = select(input, index) + var right: Int = select(input, index + 1) + result = store(input, index, right) + result = store(result, index + 1, left) + } else { + result = input + } +} + +proc bubble_sort(input: []Int) -> (sorted: []Int) + post ?( + (len(input) == len(sorted)) && + (forall p: UInt, q: UInt. + ((p < q) && (q < len(sorted))) ==> (select(sorted, p) <= select(sorted, q))) + ) +{ + sorted = input + var i: UInt = 0 + var last: UInt = ite(0 < len(sorted), len(sorted) - 1, 0) + + @invariant(?( + (i <= last) && + (len(input) == len(sorted)) && + (forall p: UInt, q: UInt. + ((last - i <= p) && (p < q) && (q <= last) && (last < len(sorted))) ==> + (select(sorted, p) <= select(sorted, q))) && + (forall p: UInt, q: UInt. + ((p < last - i) && (last - i < q) && (q < len(sorted))) ==> + (select(sorted, p) <= select(sorted, q))) + )) + while 0 < last - i { + var j: UInt = 0 + + @invariant(?( + (j <= last - i) && + (len(input) == len(sorted)) && + (forall p: UInt, q: UInt. + ((last - i <= p) && (p < q) && (q <= last) && (last < len(sorted))) ==> + (select(sorted, p) <= select(sorted, q))) && + (forall p: UInt, q: UInt. + ((p < last - i) && (last - i < q) && (q < len(sorted))) ==> + (select(sorted, p) <= select(sorted, q))) && + (forall k: UInt. (k <= j) ==> (select(sorted, k) <= select(sorted, j))) + )) + while j < last - i { + if select(sorted, j) > select(sorted, j + 1) { + var left: Int = select(sorted, j) + var right: Int = select(sorted, j + 1) + sorted = store(sorted, j, right) + sorted = store(sorted, j + 1, left) + } else {} + + j = j + 1 + } + + i = i + 1 + } +} + +proc bubble_sort_example() -> () +{ + var input: []Int + assume ?(len(input) == 5) + input = store(input, 0, 3) + input = store(input, 1, 2) + input = store(input, 2, 5) + input = store(input, 3, 1) + input = store(input, 4, 4) + + var sorted: []Int = bubble_sort(input) + assert ?( + forall p: UInt, q: UInt. + ((p < q) && (q < len(sorted))) ==> (select(sorted, p) <= select(sorted, q)) + ) + assert ?(len(sorted) == 5) +} diff --git a/tests/boolean/algorithms/insertion_sort.heyvl b/tests/boolean/algorithms/insertion_sort.heyvl new file mode 100644 index 00000000..3d0b8268 --- /dev/null +++ b/tests/boolean/algorithms/insertion_sort.heyvl @@ -0,0 +1,80 @@ +// RUN: @caesar verify --function-encoding fuel-param-computation @file +// Verify agreement with a recursive insertion-sort function. +// The concrete example also checks the sorted result for a five-element input. + +domain List { + func nil(): List + func cons(head: Int, tail: List): List + + func head(list: List): Int + axiom head_cons forall value: Int, rest: List. + head(cons(value, rest)) == value + + func tail(list: List): List + axiom tail_cons forall value: Int, rest: List. + tail(cons(value, rest)) == rest + + func is_nil(list: List): Bool + axiom is_nil_def forall list: List. + is_nil(list) == (list == nil()) + + axiom cons_not_nil forall value: Int, rest: List. + cons(value, rest) != nil() + + func insert_sorted(value: Int, list: List): List = + ite( + is_nil(list), + cons(value, nil()), + ite( + value <= head(list), + cons(value, list), + cons(head(list), insert_sorted(value, tail(list))) + ) + ) + + func insertion_sorted(list: List): List = + ite( + is_nil(list), + nil(), + insert_sorted(head(list), insertion_sorted(tail(list))) + ) +} + +proc insert_sorted_value(value: Int, list: List) -> (result: List) + post ?(result == insert_sorted(value, list)) +{ + if is_nil(list) { + result = cons(value, nil()) + } else { + var first: Int = head(list) + var rest: List = tail(list) + if value <= first { + result = cons(value, list) + } else { + var inserted_rest: List = insert_sorted_value(value, rest) + result = cons(first, inserted_rest) + } + } +} + +proc insertion_sort(list: List) -> (result: List) + post ?(result == insertion_sorted(list)) +{ + if is_nil(list) { + result = nil() + } else { + var first: Int = head(list) + var rest: List = tail(list) + var sorted_rest: List = insertion_sort(rest) + result = insert_sorted_value(first, sorted_rest) + } +} + +proc insertion_sort_example() -> () +{ + var input: List = + cons(3, cons(2, cons(5, cons(1, cons(4, nil()))))) + + var result: List = insertion_sort(input) + assert ?(result == cons(1, cons(2, cons(3, cons(4, cons(5, nil())))))) +} diff --git a/tests/boolean/algorithms/left_pad.heyvl b/tests/boolean/algorithms/left_pad.heyvl new file mode 100644 index 00000000..a6fe58d7 --- /dev/null +++ b/tests/boolean/algorithms/left_pad.heyvl @@ -0,0 +1,49 @@ +// RUN: @caesar @file +// Verify the output length, padding values, and original suffix of left padding. + +domain List { + func nil(): List + func cons(head: Int, tail: List): List + + func head(list: List): Int + axiom head_cons forall value: Int, rest: List. + head(cons(value, rest)) == value + + func tail(list: List): List + axiom tail_cons forall value: Int, rest: List. + tail(cons(value, rest)) == rest + + func is_nil(list: List): Bool + axiom is_nil_def forall list: List. + is_nil(list) == (list == nil()) + + axiom cons_not_nil forall value: Int, rest: List. + cons(value, rest) != nil() + + func length(list: List): UInt = + ite(is_nil(list), 0, 1 + length(tail(list))) + + func select(list: List, index: UInt): Int = + ite(is_nil(list), 0, ite(index == 0, head(list), select(tail(list), index - 1))) + + func padding(width: UInt, list: List): UInt = + ite(width < length(list), 0, width - length(list)) +} + +@uwlp +proc left_pad(list: List, width: UInt, fill: Int) -> (result: List) + post ?( + (length(result) == ite(width < length(list), length(list), width)) && + (forall i: UInt. + (i < padding(width, list)) ==> (select(result, i) == fill)) && + (forall j: UInt. + ((padding(width, list) <= j) && (j < length(result))) ==> + (select(result, j) == select(list, j - padding(width, list)))) + ) +{ + if width <= length(list) { + result = list + } else { + result = left_pad(cons(fill, list), width, fill) + } +} diff --git a/tests/boolean/algorithms/list_operations.heyvl b/tests/boolean/algorithms/list_operations.heyvl new file mode 100644 index 00000000..2d9279bd --- /dev/null +++ b/tests/boolean/algorithms/list_operations.heyvl @@ -0,0 +1,84 @@ +// RUN: @caesar @file +// Verify element updates, appending a value, and reading the last element. + +domain List { + func nil(): List + func cons(head: Int, tail: List): List + + func head(list: List): Int + axiom head_cons forall value: Int, rest: List. + head(cons(value, rest)) == value + + func tail(list: List): List + axiom tail_cons forall value: Int, rest: List. + tail(cons(value, rest)) == rest + + func is_nil(list: List): Bool + axiom is_nil_def forall list: List. + is_nil(list) == (list == nil()) + + axiom cons_not_nil forall value: Int, rest: List. + cons(value, rest) != nil() + + func length(list: List): UInt = + ite(is_nil(list), 0, 1 + length(tail(list))) + + func select(list: List, index: UInt): Int = + ite(is_nil(list), 0, ite(index == 0, head(list), select(tail(list), index - 1))) +} + +@uwlp +proc store_at(list: List, index: UInt, value: Int) -> (result: List) + pre ?(index < length(list)) + post ?( + (length(result) == length(list)) && + (select(result, index) == value) && + (forall k: UInt. + ((k < length(list)) && (k != index)) ==> (select(result, k) == select(list, k))) + ) +{ + if is_nil(list) { + result = list + } else { + var first: Int = head(list) + var rest: List = tail(list) + if index == 0 { + result = cons(value, rest) + } else { + var updated_rest: List = store_at(rest, index - 1, value) + result = cons(first, updated_rest) + } + } +} + +@uwlp +proc append_value(list: List, value: Int) -> (result: List) + post ?( + (length(result) == length(list) + 1) && + (select(result, length(list)) == value) && + (forall k: UInt. + (k < length(list)) ==> (select(result, k) == select(list, k))) + ) +{ + if is_nil(list) { + result = cons(value, nil()) + } else { + var first: Int = head(list) + var rest: List = tail(list) + var extended_rest: List = append_value(rest, value) + result = cons(first, extended_rest) + } +} + +@uwlp +proc get_last(list: List) -> (result: Int) + pre ?(!is_nil(list)) + post ?(result == select(list, length(list) - 1)) +{ + var rest: List = tail(list) + if is_nil(rest) { + result = head(list) + } else { + result = get_last(rest) + } +} diff --git a/tests/boolean/algorithms/quicksort.heyvl b/tests/boolean/algorithms/quicksort.heyvl new file mode 100644 index 00000000..29a751d6 --- /dev/null +++ b/tests/boolean/algorithms/quicksort.heyvl @@ -0,0 +1,81 @@ +// RUN: @caesar verify --function-encoding fuel-param-computation --max-fuel 8 @file +// Verify agreement with a recursive quicksort function. +// The concrete example also checks the sorted result for a five-element input. + +domain List { + func nil(): List + func cons(head: Int, tail: List): List + + func head(list: List): Int + axiom head_cons forall value: Int, rest: List. + head(cons(value, rest)) == value + + func tail(list: List): List + axiom tail_cons forall value: Int, rest: List. + tail(cons(value, rest)) == rest + + func is_nil(list: List): Bool + axiom is_nil_def forall list: List. + is_nil(list) == (list == nil()) + + axiom cons_not_nil forall value: Int, rest: List. + cons(value, rest) != nil() + + func append(left: List, right: List): List = + ite(is_nil(left), right, cons(head(left), append(tail(left), right))) + + func filter_leq(pivot: Int, list: List): List = + ite( + is_nil(list), + nil(), + ite( + head(list) <= pivot, + cons(head(list), filter_leq(pivot, tail(list))), + filter_leq(pivot, tail(list)) + ) + ) + + func filter_gt(pivot: Int, list: List): List = + ite( + is_nil(list), + nil(), + ite( + pivot < head(list), + cons(head(list), filter_gt(pivot, tail(list))), + filter_gt(pivot, tail(list)) + ) + ) + + func quicksorted(list: List): List = + ite( + is_nil(list), + nil(), + append( + quicksorted(filter_leq(head(list), tail(list))), + cons(head(list), quicksorted(filter_gt(head(list), tail(list)))) + ) + ) +} + +proc quicksort(list: List) -> (result: List) + post ?(result == quicksorted(list)) +{ + if is_nil(list) { + result = nil() + } else { + var pivot: Int = head(list) + var rest: List = tail(list) + var lower: List = quicksort(filter_leq(pivot, rest)) + var greater: List = quicksort(filter_gt(pivot, rest)) + result = append(lower, cons(pivot, greater)) + } +} + +proc quicksort_example() -> () +{ + var input: List = + cons(3, cons(2, cons(5, cons(1, cons(4, nil()))))) + + var result: List = quicksort(input) + assert ?(result == cons(1, cons(2, cons(3, cons(4, cons(5, nil())))))) +} diff --git a/tests/boolean/algorithms/selection_sort.heyvl b/tests/boolean/algorithms/selection_sort.heyvl new file mode 100644 index 00000000..c6eef011 --- /dev/null +++ b/tests/boolean/algorithms/selection_sort.heyvl @@ -0,0 +1,77 @@ +// RUN: @caesar @file +// Verify that selection sort produces a nondecreasing list of the same length. + +proc min_index_from(input: []Int, start: UInt) -> (index: UInt) + pre ?(start < len(input)) + post ?( + (start <= index) && + (index < len(input)) && + (forall k: UInt. + ((start <= k) && (k < len(input))) ==> (select(input, index) <= select(input, k))) + ) +{ + index = start + var j: UInt = start + + @invariant(?( + (start <= index) && + (index < len(input)) && + (start <= j) && + (j <= len(input)) && + (forall k: UInt. + ((start <= k) && (k < j)) ==> (select(input, index) <= select(input, k))) + )) + while j < len(input) { + if select(input, j) < select(input, index) { + index = j + } else {} + + j = j + 1 + } +} + +proc selection_sort(input: []Int) -> (sorted: []Int) + post ?( + (len(input) == len(sorted)) && + (forall p: UInt, q: UInt. + ((p < q) && (q < len(sorted))) ==> (select(sorted, p) <= select(sorted, q))) + ) +{ + sorted = input + var i: UInt = 0 + + @invariant(?( + (i <= len(sorted)) && + (len(input) == len(sorted)) && + (forall p: UInt, q: UInt. + ((p < q) && (q < i)) ==> (select(sorted, p) <= select(sorted, q))) && + (forall p: UInt, q: UInt. + ((p < i) && (i <= q) && (q < len(sorted))) ==> (select(sorted, p) <= select(sorted, q))) + )) + while i < len(sorted) { + var min: UInt = min_index_from(sorted, i) + var first: Int = select(sorted, i) + var least: Int = select(sorted, min) + sorted = store(sorted, i, least) + sorted = store(sorted, min, first) + i = i + 1 + } +} + +proc selection_sort_example() -> () +{ + var input: []Int + assume ?(len(input) == 5) + input = store(input, 0, 3) + input = store(input, 1, 2) + input = store(input, 2, 5) + input = store(input, 3, 1) + input = store(input, 4, 4) + + var sorted: []Int = selection_sort(input) + assert ?( + forall p: UInt, q: UInt. + ((p < q) && (q < len(sorted))) ==> (select(sorted, p) <= select(sorted, q)) + ) + assert ?(len(sorted) == 5) +} From b00dabbcf2cbc81a34be4db495cc48b8e500300f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:57 +0100 Subject: [PATCH 16/32] examples: extend probabilistic proofs and case studies --- tests/case-studies/brp/combined.heyvl | 74 ++++++ tests/case-studies/brp/failed.heyvl | 68 ++++++ tests/case-studies/brp/sent.heyvl | 38 +++ tests/case-studies/brp/success.heyvl | 79 ++++++ tests/case-studies/brp/termination.heyvl | 63 +++++ tests/case-studies/conditioning.heyvl | 52 ++++ .../coupon-collector-manual.heyvl | 130 ++++++++++ .../coupon-collector-uniform.heyvl | 44 ++++ tests/case-studies/coupon-collector.heyvl | 141 ++--------- tests/case-studies/ert-composition.heyvl | 54 +++++ tests/case-studies/fast-dice-roller.heyvl | 164 +++++++++++++ tests/case-studies/geo-recursive.heyvl | 29 +-- tests/case-studies/morris-counting.heyvl | 31 +++ .../case-studies/power-of-two-sampling.heyvl | 78 ++++++ tests/case-studies/reservoir-sampling.heyvl | 56 +++++ tests/case-studies/retry-moments.heyvl | 63 +++++ tests/case-studies/slow-dice-roller.heyvl | 229 ++++++++++++++++++ tests/case-studies/tortoise-hare.heyvl | 32 +++ tests/case-studies/zeroconf.heyvl | 24 +- tests/loop-rules/ast2018/ast-flipflop.heyvl | 17 +- .../loop-rules/ast2018/demonically_fair.heyvl | 25 +- .../loop-rules/ast2018/escaping_spline.heyvl | 16 +- .../ast2018/negative_binomial.heyvl | 27 +-- tests/loop-rules/bmc/refute-geo2_bmc.heyvl | 28 ++- .../loop-rules/bmc/refute-unif_gen1_bmc.heyvl | 56 +++-- .../induction/chain/lossy_list.heyvl | 20 +- tests/loop-rules/induction/geometric.heyvl | 20 ++ tests/loop-rules/induction/linear01.heyvl | 18 +- .../loop-rules/induction/rabin_hurd2004.heyvl | 40 +-- tests/loop-rules/induction/rdwalk.heyvl | 17 +- tests/loop-rules/induction/sprdwalk.heyvl | 20 +- tests/loop-rules/k_induction/geo1.heyvl | 28 +-- .../omega_invariants/countdown-bounds.heyvl | 28 +++ tests/loop-rules/ost2019/annotated.heyvl | 25 ++ tests/loopfree-prob/noisy_or.heyvl | 16 +- tests/loopfree-prob/six-sided-die.heyvl | 6 +- 36 files changed, 1556 insertions(+), 300 deletions(-) create mode 100644 tests/case-studies/brp/combined.heyvl create mode 100644 tests/case-studies/brp/failed.heyvl create mode 100644 tests/case-studies/brp/sent.heyvl create mode 100644 tests/case-studies/brp/success.heyvl create mode 100644 tests/case-studies/brp/termination.heyvl create mode 100644 tests/case-studies/conditioning.heyvl create mode 100644 tests/case-studies/coupon-collector-manual.heyvl create mode 100644 tests/case-studies/coupon-collector-uniform.heyvl create mode 100644 tests/case-studies/ert-composition.heyvl create mode 100644 tests/case-studies/fast-dice-roller.heyvl create mode 100644 tests/case-studies/morris-counting.heyvl create mode 100644 tests/case-studies/power-of-two-sampling.heyvl create mode 100644 tests/case-studies/reservoir-sampling.heyvl create mode 100644 tests/case-studies/retry-moments.heyvl create mode 100644 tests/case-studies/slow-dice-roller.heyvl create mode 100644 tests/case-studies/tortoise-hare.heyvl create mode 100644 tests/loop-rules/induction/geometric.heyvl create mode 100644 tests/loop-rules/omega_invariants/countdown-bounds.heyvl create mode 100644 tests/loop-rules/ost2019/annotated.heyvl diff --git a/tests/case-studies/brp/combined.heyvl b/tests/case-studies/brp/combined.heyvl new file mode 100644 index 00000000..cb2607a0 --- /dev/null +++ b/tests/case-studies/brp/combined.heyvl @@ -0,0 +1,74 @@ +// RUN: @caesar @file --quantifier-instantiation e-matching + +// Adapted from the complete Figure 1 example in the CAV 2026 Caesar artifact. +// Paper: https://doi.org/10.1007/978-3-032-32537-2_27 +// Original artifact source: tests/case-studies/brp-send-packet.heyvl. +// Changes: combined invariant cases with minimum, maximum, and Boolean embeddings. +// Added an upper bound on the actual number of failed transmission attempts. + +domain Exponentials { + func pow(base: UReal, exponent: UInt): UReal = + ite(exponent == 0, 1, base * pow(base, exponent - 1)) + + axiom pow_bounded forall base: UReal, exponent: UInt. + (base <= 1) ==> (pow(base, exponent) <= 1) +} + +@wp +coproc brp(packets: UInt, maxTries: UInt) + -> (sent: UInt, fail: UInt, totalFail: UInt) + pre !?(maxTries > 0) + pre 1 - pow(1 - pow(0.01, maxTries), packets) + post [fail == maxTries] +{ + sent = 0 + fail = 0 + totalFail = 0 + + // Failure is certain at the retry limit; otherwise combine this packet and the later packets. + @invariant( + !?(sent <= packets && fail <= maxTries) + ⊔ [fail == maxTries] + ⊔ (?(sent < packets && fail < maxTries) + ⊓ (1 - (1 - pow(0.01, maxTries - fail)) + * pow(1 - pow(0.01, maxTries), (packets - sent) - 1))) + ) + while sent < packets && fail < maxTries { + var transmit: Bool = flip(0.99) + if transmit { + sent = sent + 1 + fail = 0 + } else { + fail = fail + 1 + totalFail = totalFail + 1 + } + } +} + +@wp +coproc brp_failed_transmissions(packets: UInt, maxTries: UInt) + -> (sent: UInt, fail: UInt, totalFail: UInt) + pre 0.01 * maxTries * packets + post totalFail +{ + sent = 0 + fail = 0 + totalFail = 0 + + // Each unused transmission slot contributes at most its failure probability. + // Delivery can discard several remaining slots, while a failure consumes one. + @invariant( + !?(sent <= packets && fail <= maxTries) + ⊔ (totalFail + 0.01 * (maxTries * (packets - sent) - fail)) + ) + while sent < packets && fail < maxTries { + var transmit: Bool = flip(0.99) + if transmit { + sent = sent + 1 + fail = 0 + } else { + fail = fail + 1 + totalFail = totalFail + 1 + } + } +} diff --git a/tests/case-studies/brp/failed.heyvl b/tests/case-studies/brp/failed.heyvl new file mode 100644 index 00000000..39cb173e --- /dev/null +++ b/tests/case-studies/brp/failed.heyvl @@ -0,0 +1,68 @@ +// RUN: @caesar @file + +// Copyright 2025 Franka van Jaarsveld. +// SPDX-License-Identifier: CC-BY-4.0 +// License: https://creativecommons.org/licenses/by/4.0/ +// Adapted from "Practical Probabilistic Program Verification using Caesar" (University of Twente, 2025). +// Artifact: https://doi.org/10.5281/zenodo.15408743 (FvJ_Thesis/brp/failed.heyvl). +// Thesis: https://purl.utwente.nl/essays/106318 +// Changes: retained the upper bounds and removed the trivial lower bounds. +// Removed unused power functions and made auxiliary variables local. +// Combined the accumulated counter and remaining allowance using minimum and Boolean embeddings. + +domain Constants { + func p(): UReal + axiom transmission_probability p() <= 1 + func MAX(): UInt + + func s(): UReal + axiom packet_probability s() <= 1 + func f(): UInt // Fixed increment to totalFailed in the sequence model. +} + +// Bound the expected number of failed transmissions for one packet. +@wp +coproc sendPacket() -> (failed: UInt) + pre MAX() * (1 - p()) + post failed +{ + failed = 0 + var success: Bool = false + + // At exit, use failed itself; while retrying, add (1-p()) per remaining possible attempt. + @invariant( + failed + (?(!success) ⊓ ((1 - p()) * (MAX() - failed))) + ) + while failed < MAX() && !success { + success = flip(p()) + if !success { + // This failed attempt is now included in failed, with one fewer attempt available. + failed = failed + 1 + } else {} + } +} + +// Bound the expected value of totalFailed on termination in the sequence model. +@wp +coproc BRP(N: UInt) -> (totalFailed: UInt) + pre f() * N + post totalFailed +{ + var sent: UInt = 0 + var success: Bool = true + totalFailed = 0 + + // At most N-sent packet attempts remain, each adding exactly f() to totalFailed. + @invariant( + totalFailed + (?(success) ⊓ (f() * (N - sent))) + ) + while sent < N && success { + success = flip(s()) + // Charge f() for this attempt, including an attempt that fails to deliver a packet. + totalFailed = totalFailed + f() + if success { + // The increment reduces the remaining allowance f()*(N-sent) by the amount just charged. + sent = sent + 1 + } else {} + } +} diff --git a/tests/case-studies/brp/sent.heyvl b/tests/case-studies/brp/sent.heyvl new file mode 100644 index 00000000..79b40bda --- /dev/null +++ b/tests/case-studies/brp/sent.heyvl @@ -0,0 +1,38 @@ +// RUN: @caesar @file + +// Copyright 2025 Franka van Jaarsveld. +// SPDX-License-Identifier: CC-BY-4.0 +// License: https://creativecommons.org/licenses/by/4.0/ +// Adapted from "Practical Probabilistic Program Verification using Caesar" (University of Twente, 2025). +// Artifact: https://doi.org/10.5281/zenodo.15408743 (FvJ_Thesis/brp/sent.heyvl). +// Thesis: https://purl.utwente.nl/essays/106318 +// Changes: retained the upper bound and removed the trivial lower bound. +// Removed unused constants, power functions, outputs, and counters. +// Combined delivered packets and the remaining allowance using minimum and a Boolean embedding. + +domain Constants { + func s(): UReal + axiom packet_probability s() <= 1 +} + +@wp +coproc BRP(N: UInt) -> (sent: UInt) + pre s() * N + post sent +{ + sent = 0 + var success: Bool = true + + // Keep the delivered packets, adding s() for each of at most N-sent further packet attempts. + @invariant( + sent + (?(success) ⊓ (s() * (N - sent))) + ) + while sent < N && success { + // With probability s(), this attempt delivers one packet and reduces the number still to send. + // Otherwise the loop exits with sent unchanged, matching the postexpectation. + success = flip(s()) + if success { + sent = sent + 1 + } else {} + } +} diff --git a/tests/case-studies/brp/success.heyvl b/tests/case-studies/brp/success.heyvl new file mode 100644 index 00000000..7b82a23d --- /dev/null +++ b/tests/case-studies/brp/success.heyvl @@ -0,0 +1,79 @@ +// RUN: @caesar @file --quantifier-instantiation e-matching + +// Copyright 2025 Franka van Jaarsveld. +// SPDX-License-Identifier: CC-BY-4.0 +// License: https://creativecommons.org/licenses/by/4.0/ +// Adapted from "Practical Probabilistic Program Verification using Caesar" (University of Twente, 2025). +// Artifact: https://doi.org/10.5281/zenodo.15408743 (FvJ_Thesis/brp/success.heyvl). +// Thesis: https://purl.utwente.nl/essays/106318 +// Changes: replaced the manually fueled power function with an ordinary recursive definition. +// Implemented the packet retries inside the sequence model and derived its success bound. +// Removed independent abstract constants and unused counters. +// Expressed delivery probabilities with explicit numeric cases. + +domain Exponentials { + func pow(base: UReal, exponent: UInt): UReal = + ite(exponent == 0, 1, base * pow(base, exponent - 1)) +} + +domain Constants { + func p(): UReal + axiom transmission_probability p() <= 1 + func MAX(): UInt + func packet_success(): UReal = 1 - pow(1 - p(), MAX()) +} + +@wlp +proc sendPacket() -> (success: Bool) + pre packet_success() + post [success] +{ + var failed: UInt = 0 + success = false + + // Use probability 1 after delivery, or the delivery probability within the remaining attempts. + @invariant( + ite(success, 1, 1 - pow(1 - p(), MAX() - failed)) + ) + while failed < MAX() && !success { + // Either this attempt succeeds, or a failure leaves one fewer attempt. + success = flip(p()) + if !success { + failed = failed + 1 + } else {} + } +} + +@wlp +proc BRP(N: UInt) -> (success: Bool) + pre pow(packet_success(), N) + post [success] +{ + var sent: UInt = 0 + success = true + + // Each remaining packet contributes a factor packet_success() to sequence delivery. + @invariant( + ite(success, pow(packet_success(), N - sent), 0) + ) + while sent < N && success { + var failed: UInt = 0 + success = false + // Multiply this packet's delivery probability by the factor for all later packets. + @invariant( + ite(success, 1, 1 - pow(1 - p(), MAX() - failed)) + * pow(packet_success(), (N - sent) - 1) + ) + // Initially this agrees with the outer annotation for all packets still to send. + while failed < MAX() && !success { + // Either this attempt succeeds, or a failure leaves one fewer attempt. + success = flip(p()) + if !success { + failed = failed + 1 + } else {} + } + if success { + sent = sent + 1 + } else {} + } +} diff --git a/tests/case-studies/brp/termination.heyvl b/tests/case-studies/brp/termination.heyvl new file mode 100644 index 00000000..2a4c537f --- /dev/null +++ b/tests/case-studies/brp/termination.heyvl @@ -0,0 +1,63 @@ +// RUN: @caesar @file + +// Copyright 2025 Franka van Jaarsveld. +// SPDX-License-Identifier: CC-BY-4.0 +// License: https://creativecommons.org/licenses/by/4.0/ +// Adapted from "Practical Probabilistic Program Verification using Caesar" (University of Twente, 2025). +// Artifact: https://doi.org/10.5281/zenodo.15408743 (FvJ_Thesis/brp/termination.heyvl). +// Thesis: https://purl.utwente.nl/essays/106318 +// Changes: removed unused outputs, constants, and counters. +// Tightened the invariants by removing their unnecessary constant one. +// Combined the deterministic retry limits with the geometric bounds using minimum. +// Used Boolean embeddings to restrict the remaining cost to successful or pending delivery. + +domain Constants { + func p(): UReal + axiom transmission_probability 0 < p() && p() <= 1 + func MAX(): UInt + + func s(): UReal + axiom packet_probability s() < 1 +} + +// Count transmission attempts for one packet. +@ert +coproc sendPacket() -> () + pre MAX() ⊓ (1 / p()) + post 0 +{ + var failed: UInt = 0 + var success: Bool = false + + // Remaining attempts are bounded by both the retry limit and the geometric waiting time. + @invariant(?(!success) ⊓ ((MAX() - failed) ⊓ (1 / p()))) + while failed < MAX() && !success { + // Each transmission attempt costs one reward unit, and failure leaves further attempts possible. + success = flip(p()) + if !success { + failed = failed + 1 + } else {} + reward 1 + } +} + +// Count packet attempts in the sequence model. +@ert +coproc BRP(N: UInt) -> () + pre N ⊓ (1 / (1 - s())) + post 0 +{ + var sent: UInt = 0 + var success: Bool = true + + // Remaining attempts are bounded by both the unsent packets and the wait for failed delivery. + @invariant(?(success) ⊓ ((N - sent) ⊓ (1 / (1 - s())))) + while sent < N && success { + // Each packet attempt costs one reward unit and permits another attempt after successful delivery. + success = flip(s()) + if success { + sent = sent + 1 + } else {} + reward 1 + } +} diff --git a/tests/case-studies/conditioning.heyvl b/tests/case-studies/conditioning.heyvl new file mode 100644 index 00000000..a6fd7ce6 --- /dev/null +++ b/tests/case-studies/conditioning.heyvl @@ -0,0 +1,52 @@ +// RUN: @caesar verify @file --werr --max-fuel 4 --quantifier-instantiation e-matching + +// Queue with arrivals, service, and failure; stopped at emptying or first failure. +// Queueing context: Paz and Yechiali, APJOR 2014, Section 2. +// https://doi.org/10.1142/S021759591450016X + +domain QueueConditioning { + // The minimum exposes the bound <= 1 to the solver. + // It does not change the value 2^(-n). + func success_probability(n: UInt): UReal = + ite(n == 0, 1, (success_probability(n - 1)/2) ⊓ (1/2)) +} + +@wlp +proc evidence_lower(initial: UInt) -> (pending: UInt, rounds: UInt, healthy: Bool) + pre success_probability(initial) + post 1 +{ + pending = initial + rounds = 0 + healthy = true + @invariant(ite(healthy, success_probability(pending), 0)) + while pending > 0 && healthy { + rounds = rounds + 1 + healthy = flip(4/5) + if healthy { + var arrival: Bool = flip(1/2) + if arrival { pending = pending + 1 } else { pending = pending - 1 } + } + } + assert ?(healthy) +} + +@wp +coproc rounds_upper(initial: UInt) -> (pending: UInt, rounds: UInt, healthy: Bool) + pre success_probability(initial) * ((5*initial)/3) + post rounds +{ + pending = initial + rounds = 0 + healthy = true + @invariant(ite(healthy, success_probability(pending) * (rounds + (5*pending)/3), 0)) + while pending > 0 && healthy { + rounds = rounds + 1 + healthy = flip(4/5) + if healthy { + var arrival: Bool = flip(1/2) + if arrival { pending = pending + 1 } else { pending = pending - 1 } + } + } + assert ?(healthy) +} diff --git a/tests/case-studies/coupon-collector-manual.heyvl b/tests/case-studies/coupon-collector-manual.heyvl new file mode 100644 index 00000000..47307c69 --- /dev/null +++ b/tests/case-studies/coupon-collector-manual.heyvl @@ -0,0 +1,130 @@ +// RUN: @caesar @file --function-encoding fuel-param +// Original manual Park-induction encoding, retained alongside the annotated example. + +domain Sums { + + // The sum of elements given in the list of at indices [start,start+len], + // i.e. \sum\limits_{i=start}^{start+len-1} elements[i]. + func sum(elements: []UReal, start: UInt, len: UInt): UReal = ite(len>0, select(elements, start + (len - 1)) + sum(elements, start, len-1), 0) + + // This is a helper function to specify the pre-expectation of the unif assignment in inner_loop. + // It returns a list of unspecified length with identical elements `N/x`. + func summands1(N: UInt, x: UInt, i: UInt): []UReal + axiom summands1_def forall N: UInt, x: UInt, i: UInt, j: UInt @trigger(select(summands1(N, x, i), j)). + (j<=N) ==> (select(summands1(N, x, i), j) == [0 < x && x < j] * (N/x)) + + func harmonic(n: UInt) : UReal = ite(n==0, 0, (1/n) + harmonic(n-1)) +} + +// Verifies the outer loop of the coupon collector. It uses inner_loop and +// harmonic_lemma. +coproc outer_loop(N: UInt, x: UInt, i: UInt) -> () + pre [0 < x && x <=N] * N * harmonic(x) + [N=x || x>N)) + coassume ?( + ( N * (harmonic(x-1)) + ite(N>=x, (N/x), 1) ) + > + ([0 < x && x <=N] * N * harmonic(x)) + ) + } else { + if x == N+1 { + } else { + } + } + } + + // this encodes the loop using Park induction. we omit the assert; havoc; + // validate; assume here since that's given by the procedure's pre already. + if 0 < x { + // current pre: [1 < x && x <= N+1] * N * (harmonic(x-1)) + [N+1=x, (N/x), 1) + + var new_i: UInt = N+1 + + // current pre: [1 < x && x <= i] * N * (harmonic(x-1)) + [N+1=x, (N/x), 1) + inner_loop(N,x,new_i) + var new_x: UInt = x-1 + + // encodes the constant invariant as per the default Park induction encoding + coassert [0 < new_x && new_x <=N] * N * harmonic(new_x) + [N () + pre !?(i == N+1) + pre [0 < x && x < i] * (ite(N>=x, (N/x), 1)) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 (select(summands1(N,x,i), j) == [0 < x && x < j] * (N/x)))) + coassume !?(sum(summands1(N,x,i), 1, N) == ite(N>=x, N-x, 0) * (N/x)) + + // The call below encodes the uniform assignment `i = unif(1, N)`. + unif_1_n(N, x, i, 1, N) + + // Standard Park induction encoding for the invariant at the end of the + // loop body. + coassert [0 < x && x < i] * ite(N>=x, (N/x), 1) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 () + pre (1/len) * sum(summands1(N, x, i), start, len) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1=x, (N/x), 1) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 () + pre !?(1=x, (N/x), 1) ) + <= + ([0 < x && x <=N] * N * harmonic(x))) +{ +} + +// We now prove a lemma about the anonymous sum by induction on the number of +// summands len. +coproc sum_lemma(N: UInt, x: UInt, i: UInt, list : []UReal, len: UInt) -> () + pre !?(0 < x && 0 (select(list, j) == + [0 < x && x < j] * (N/x)))) + post !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) +{ + if len == 1 { + coassert !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) + } else { + sum_lemma(N, x, i, list, len-1) + coassert !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) + } +} diff --git a/tests/case-studies/coupon-collector-uniform.heyvl b/tests/case-studies/coupon-collector-uniform.heyvl new file mode 100644 index 00000000..c2626f94 --- /dev/null +++ b/tests/case-studies/coupon-collector-uniform.heyvl @@ -0,0 +1,44 @@ +// RUN: @caesar @file --function-encoding fuel-param --quantifier-instantiation e-matching + +domain Harmonic { + func harmonic(n: UInt): UReal = ite(n == 0, 0, harmonic(n - 1) + 1 / n) +} + +@ert +coproc coupon_collector(N: UInt) -> () + pre !?(N > 0) + pre N * harmonic(N) + post 0 +{ + var x: UInt = N + @invariant(!?(x <= N) ⊔ N * harmonic(x)) + while x > 0 { + var found_new: Bool = false + @invariant(ite(found_new, 0, N / x) + N * harmonic(x - 1)) + while !found_new { + // Count one coupon draw without charging for the sampler's internal steps. + tick 1 + // Draw an index uniformly from 1 through N. + var coupon: UInt = N + var chosen: Bool = false + @invariant( + !?(1 <= coupon && coupon <= N) + ⊔ ( + ite(chosen, [coupon > x], + ite(coupon > x, (coupon - x) / coupon, 0) + ) * (N / x) + + N * harmonic(x - 1) + ) + ) + while !chosen && coupon > 1 { + chosen = flip(1 / coupon) + if !chosen { + coupon = coupon - 1 + } else {} + } + // Labels 1 through x represent the currently missing coupons. + found_new = coupon <= x + } + x = x - 1 + } +} diff --git a/tests/case-studies/coupon-collector.heyvl b/tests/case-studies/coupon-collector.heyvl index 7d44a84e..1d14fe00 100644 --- a/tests/case-studies/coupon-collector.heyvl +++ b/tests/case-studies/coupon-collector.heyvl @@ -1,129 +1,28 @@ -// RUN: @caesar @file --function-encoding fuel-param +// RUN: @caesar @file --function-encoding fuel-param --quantifier-instantiation e-matching -domain Sums { - - // The sum of elements given in the list of at indices [start,start+len], - // i.e. \sum\limits_{i=start}^{start+len-1} elements[i]. - func sum(elements: []UReal, start: UInt, len: UInt): UReal = ite(len>0, select(elements, start + (len - 1)) + sum(elements, start, len-1), 0) - - // This is a helper function to specify the pre-expectation of the unif assignment in inner_loop. - // It returns a list of unspecified length with identical elements `N/x`. - func summands1(N: UInt, x: UInt, i: UInt): []UReal - axiom summands1_def forall N: UInt, x: UInt, i: UInt, j: UInt @trigger(select(summands1(N, x, i), j)). - (j<=N) ==> (select(summands1(N, x, i), j) == [0 < x && x < j] * (N/x)) - - func harmonic(n: UInt) : UReal = ite(n==0, 0, (1/n) + harmonic(n-1)) +domain Harmonic { + func harmonic(n: UInt): UReal = ite(n == 0, 0, harmonic(n - 1) + 1 / n) } -// Verifies the outer loop of the coupon collector. It uses inner_loop and -// harmonic_lemma. -coproc outer_loop(N: UInt, x: UInt, i: UInt) -> () - pre [0 < x && x <=N] * N * harmonic(x) + [N () + pre !?(N > 0) + pre N * harmonic(N) post 0 { - // These if branches will generate some case distinctions which help the SMT - // solver to decide this problem. - if x==1 { - } else { - if 1=x || x>N)) - coassume ?( - ( N * (harmonic(x-1)) + ite(N>=x, (N/x), 1) ) - > - ([0 < x && x <=N] * N * harmonic(x)) - ) - } else { - if x == N+1 { - } else { - } + var x: UInt = N + // The expected number of remaining draws is at most N * harmonic(x). + // The condition x <= N keeps x / N within [0,1]. + @invariant(!?(x <= N) ⊔ N * harmonic(x)) + while x > 0 { + var found_new: Bool = false + // The expected wait for the next new coupon is N / x draws. + // The expected number of later draws is at most N * harmonic(x - 1). + @invariant(ite(found_new, 0, N / x) + N * harmonic(x - 1)) + while !found_new { + tick 1 + found_new = flip(x / N) } - } - - // this encodes the loop using Park induction. we omit the assert; havoc; - // validate; assume here since that's given by the procedure's pre already. - if 0 < x { - // current pre: [1 < x && x <= N+1] * N * (harmonic(x-1)) + [N+1=x, (N/x), 1) - - var new_i: UInt = N+1 - - // current pre: [1 < x && x <= i] * N * (harmonic(x-1)) + [N+1=x, (N/x), 1) - inner_loop(N,x,new_i) - var new_x: UInt = x-1 - - // encodes the constant invariant as per the default Park induction encoding - coassert [0 < new_x && new_x <=N] * N * harmonic(new_x) + [N () - pre !?(i == N+1) - pre [0 < x && x < i] * (ite(N>=x, (N/x), 1)) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 (select(summands1(N,x,i), j) == [0 < x && x < j] * (N/x)))) - coassume !?(sum(summands1(N,x,i), 1, N) == ite(N>=x, N-x, 0) * (N/x)) - - // The call below encodes the uniform assignment `i = unif(1, N)`. - unif_1_n(N, x, i, 1, N) - - // Standard Park induction encoding for the invariant at the end of the - // loop body. - coassert [0 < x && x < i] * ite(N>=x, (N/x), 1) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 () - pre (1/len) * sum(summands1(N, x, i), start, len) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1=x, (N/x), 1) + [1 < x && x <= N+1] * N * harmonic(x-1) + [N+1 () - pre !?(1=x, (N/x), 1) ) - <= - ([0 < x && x <=N] * N * harmonic(x))) -{ -} - -// We now prove a lemma about the anonymous sum by induction on the number of -// summands len. -coproc sum_lemma(N: UInt, x: UInt, i: UInt, list : []UReal, len: UInt) -> () - pre !?(0 < x && 0 (select(list, j) == - [0 < x && x < j] * (N/x)))) - post !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) -{ - if len == 1 { - coassert !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) - } else { - sum_lemma(N, x, i, list, len-1) - coassert !?(sum(list, 1, len) == ite(len>=x, len-x, 0) * (N/x)) + x = x - 1 } } diff --git a/tests/case-studies/ert-composition.heyvl b/tests/case-studies/ert-composition.heyvl new file mode 100644 index 00000000..58713d14 --- /dev/null +++ b/tests/case-studies/ert-composition.heyvl @@ -0,0 +1,54 @@ +// RUN: @caesar verify @file --werr --quantifier-instantiation mbqi --timeout 10 + +// The generator and countdown each have finite expected runtime. +// Their composition has infinite expected runtime but terminates almost surely. +// Each tick counts one coin flip or countdown decrement. +// Integers are unbounded, and arithmetic adds no runtime steps. + +@ert +coproc generator() -> (stake: UInt) + pre 2 + post 0 +{ + stake = 1 + var more: Bool = true + @invariant(2 * [more]) + while more { + tick 1 + more = flip(0.5) + stake = 2 * stake + } +} + +@ert +coproc countdown(init_stake: UInt) -> (stake: UInt) + pre init_stake + post 0 +{ + stake = init_stake + @invariant(stake) + while stake > 0 { + tick 1 + stake = stake - 1 + } +} + +@ert +proc composition(target: UInt) -> (stake: UInt) + pre target + post 0 +{ + stake = 1 + var more: Bool = true + @omega_invariant(n, ite(more, stake * (n ⊓ target), stake)) + while more { + tick 1 + more = flip(0.5) + stake = 2 * stake + } + @omega_invariant(n, n ⊓ stake) + while stake > 0 { + tick 1 + stake = stake - 1 + } +} diff --git a/tests/case-studies/fast-dice-roller.heyvl b/tests/case-studies/fast-dice-roller.heyvl new file mode 100644 index 00000000..58d8634e --- /dev/null +++ b/tests/case-studies/fast-dice-roller.heyvl @@ -0,0 +1,164 @@ +// RUN: @caesar verify @file --timeout 30 --max-fuel 4 --quantifier-instantiation e-matching --werr + +// Fast Dice Roller returns each k < n with probability 1/n, for every n >= 1. +// fdr_probability_upper and fdr_probability_lower bound the same shifted postexpectation. +// fdr_terminates checks almost-sure termination of the same sampler. +// Termination equates the wp and wlp values, yielding the exact probability by linearity. +// Caesar checks that the natural-number rank n-(v-c) decreases in both recursive branches. +// This decrease establishes well-foundedness of prefix. +// Explanation: https://www.caesarverifier.org/docs/getting-started/zoo/fast-dice-roller + +domain FDRProof { + // prefix(n, v, c, k) is a candidate sum of return probabilities from starting values 0 through c-1. + // The endpoint values are 0 at c == 0 and v/n at c == v. + // Every recursive call doubles the positive gap v-c < n, decreasing the natural rank n-(v-c). + func prefix(n: UInt, v: UInt, c: UInt, k: UInt): UReal = + ite(n >= 2 && v < n && c <= v && k < n, + ite(c == v, v/n, + ite(c == 0, 0, + ite(2*v < n, prefix(n, 2*v, 2*c, k)/2, + ite(2*c < n, ite(k < 2*c, 1/2, 0), + (1 + prefix(n, 2*v-n, 2*c-n, k))/2)))), + 0) ⊓ 1 +} + +// The recurrence also holds at both endpoints, and the clamp to one is redundant. +// The finite bound preserves the quantitative postexpectation at each helper call. +@wp +coproc prefix_recurrence_upper(n: UInt, v: UInt, c: UInt, k: UInt, bound: UReal) -> () + pre !?(n >= 2 && v < n && c <= v && k < n) + pre bound + post !?(2 * prefix(n, v, c, k) == + ite(2*v < n, prefix(n, 2*v, 2*c, k), + ite(2*c < n, ite(k < 2*c, 1, 0), + 1 + prefix(n, 2*v-n, 2*c-n, k)))) + post bound +{} + +@wlp +proc prefix_recurrence_lower(n: UInt, v: UInt, c: UInt, k: UInt, bound: UReal) -> () + pre ?(n >= 2 && v < n && c <= v && k < n) + pre bound + post ?(2 * prefix(n, v, c, k) == + ite(2*v < n, prefix(n, 2*v, 2*c, k), + ite(2*c < n, ite(k < 2*c, 1, 0), + 1 + prefix(n, 2*v-n, 2*c-n, k)))) + post bound +{} + +// Both recursive branches preserve the guarded domain and strictly decrease n-(v-c). +@wp +coproc prefix_recursion_decreases(n: UInt, v: UInt, c: UInt) -> () + pre !?(n >= 2 && v < n && 0 < c && c < v && (2*v < n || 2*c >= n)) + pre 0 + post !?( + ite(2*v < n, + 2*v < n && 2*c <= 2*v && n - (2*v - 2*c) < n - (v-c), + 2*v-n < n && 2*c-n <= 2*v-n && n - ((2*v-n) - (2*c-n)) < n - (v-c)) + ) +{} + +// The prefix recurrence makes the signed difference equal the average of the two successor values. +// Shifting and scaling the difference gives the same [0,1]-valued invariant for both bounds. +@wp +coproc fdr_probability_upper(n: UInt, k: UInt) -> (result: UInt) + pre !?(n >= 1 && k < n) + pre (1 + 1/n)/2 + post (1 + [result == k]) * (1/2) +{ + var v: UInt = 1 + var c: UInt = 0 + var done: Bool = n == 1 + result = 0 + @invariant( + !?(n >= 1 && k < n && v >= 1 && c < v && (done || v < n)) + ⊔ ite(done, (1 + [result == k]) * (1/2), + ((1 + prefix(n, v, c+1, k)) - prefix(n, v, c, k))/2) + ) + while !done { + var bound: UReal = ((1 + prefix(n, v, c+1, k)) - prefix(n, v, c, k))/2 + prefix_recurrence_upper(n, v, c, k, bound) + prefix_recurrence_upper(n, v, c+1, k, bound) + v = 2 * v + var bit: Bool = flip(1/2) + c = 2 * c + ite(bit, 1, 0) + if v >= n { + if c < n { + result = c + done = true + } else { + v = v - n + c = c - n + } + } else {} + } +} + +@wlp +proc fdr_probability_lower(n: UInt, k: UInt) -> (result: UInt) + pre ?(n >= 1 && k < n) + pre (1 + 1/n)/2 + post (1 + [result == k]) * (1/2) +{ + var v: UInt = 1 + var c: UInt = 0 + var done: Bool = n == 1 + result = 0 + @invariant( + ?(n >= 1 && k < n && v >= 1 && c < v && (done || v < n)) + ⊓ ite(done, (1 + [result == k]) * (1/2), + ((1 + prefix(n, v, c+1, k)) - prefix(n, v, c, k))/2) + ) + while !done { + var bound: UReal = ((1 + prefix(n, v, c+1, k)) - prefix(n, v, c, k))/2 + prefix_recurrence_lower(n, v, c, k, bound) + prefix_recurrence_lower(n, v, c+1, k, bound) + v = 2 * v + var bit: Bool = flip(1/2) + c = 2 * c + ite(bit, 1, 0) + if v >= n { + if c < n { + result = c + done = true + } else { + v = v - n + c = c - n + } + } else {} + } +} + +// Appending a bit changes v-c to 2*(v-c)-bit, and recycling preserves v-c. +// On a zero bit, the loop either exits or n-(v-c) decreases by at least one. +@wp +proc fdr_terminates(n: UInt) -> (result: UInt) + pre ?(n >= 1) + pre 1 + post 1 +{ + var v: UInt = 1 + var c: UInt = 0 + var done: Bool = n == 1 + result = 0 + @ast( + done || (c < v && v < n), + n - (v - c), + _, + 1/2, + 1 + ) + while !done { + v = 2 * v + var bit: Bool = flip(1/2) + c = 2 * c + ite(bit, 1, 0) + if v >= n { + if c < n { + result = c + done = true + } else { + v = v - n + c = c - n + } + } else {} + } +} diff --git a/tests/case-studies/geo-recursive.heyvl b/tests/case-studies/geo-recursive.heyvl index 803ff14f..0f03f9d7 100644 --- a/tests/case-studies/geo-recursive.heyvl +++ b/tests/case-studies/geo-recursive.heyvl @@ -1,20 +1,21 @@ // RUN: @caesar @file -// Verifying wp[geo1](c) <= [f = 1] * (c + 1) + [f != 1] * c -coproc geo1(init_c: UInt, init_f: UInt) -> (c: UInt, f: UInt) - pre [init_f == 1] * (init_c + 1) + [init_f != 1] * init_c - post c +// Verify wp[geometric](count) <= init_count + [init_running]. +@wp +coproc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) + pre init_count + [init_running] + post count { - var prob_choice: Bool - c = init_c - f = init_f - if f == 1 { - prob_choice = flip(0.5) - if prob_choice { - f = 0 + count = init_count + running = init_running + if running { + var stop: Bool = flip(0.5) + if stop { + running = false } else { - c = c + 1 + count = count + 1 } - c, f = geo1(c, f) + // Apply the same specification to the recursive call with the updated arguments. + count, running = geometric(count, running) } else {} -} \ No newline at end of file +} diff --git a/tests/case-studies/morris-counting.heyvl b/tests/case-studies/morris-counting.heyvl new file mode 100644 index 00000000..33287659 --- /dev/null +++ b/tests/case-studies/morris-counting.heyvl @@ -0,0 +1,31 @@ +// RUN: @caesar @file + +// Morris counting records each event with a probability that decreases as the counter grows. +// Adapted from the Caesar ROCKS 2026 tutorial's Morris showcase and SSFT 2025 exercise solution. + +domain Exponentials { + func exp2(c: UInt): UReal + axiom exp2_base exp2(0) == 1 + axiom exp2_step forall c: UInt. exp2(c + 1) == 2 * exp2(c) + axiom exp2_at_least_one forall c: UInt. exp2(c) >= 1 +} + +@wp coproc morris(n: UInt) -> (c: UInt) + pre n + 1 + post exp2(c) +{ + c = 0 + var remaining: UInt = n + + @invariant(exp2(c) + remaining) + while remaining > 0 { + var increment: Bool = flip(1/exp2(c)) + if increment { c = c + 1 } else {} + remaining = remaining - 1 + } +} + +// The estimate of the event count is 2^c - 1. +// Each event increases 2^c by 2^c with probability 1/2^c, an expected increase of one. +// Decreasing remaining by one preserves exp2(c) + remaining in expectation. +// This specification establishes E[2^c] <= n + 1, hence E[2^c - 1] <= n. diff --git a/tests/case-studies/power-of-two-sampling.heyvl b/tests/case-studies/power-of-two-sampling.heyvl new file mode 100644 index 00000000..421ac9f3 --- /dev/null +++ b/tests/case-studies/power-of-two-sampling.heyvl @@ -0,0 +1,78 @@ +// RUN: @caesar @file --timeout 20 --max-fuel 4 --quantifier-instantiation e-matching --werr + +// Appending m independent fair bits samples uniformly from 0 through 2^m - 1. +// pow2(m) represents 2^m and is positive by construction. +// BEGIN power-of-two-definition +domain BinaryRange { + func max_value(m: UInt): UInt = + ite(m == 0, 0, 2 * max_value(m - 1) + 1) + + func pow2(m: UInt): UInt = max_value(m) + 1 +} +// END power-of-two-definition + +// BEGIN power-of-two-upper +@wp +coproc uniform_bits_upper(m: UInt, k: UInt) -> (result: UInt) + pre !?(k < pow2(m)) + pre 1 / pow2(m) + post [result == k] +{ + result = 0 + var left: UInt = m + + @invariant( + [result * pow2(left) <= k && k < (result + 1) * pow2(left)] + * (1 / pow2(left)) + ) + while left > 0 { + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + } +} +// END power-of-two-upper + +// BEGIN power-of-two-lower +@wlp +proc uniform_bits_lower(m: UInt, k: UInt) -> (result: UInt) + pre ?(k < pow2(m)) + pre 1 / pow2(m) + post [result == k] +{ + result = 0 + var left: UInt = m + + @invariant( + [result * pow2(left) <= k && k < (result + 1) * pow2(left)] + * (1 / pow2(left)) + ) + while left > 0 { + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + } +} +// END power-of-two-lower + +// BEGIN power-of-two-termination +@wp +proc uniform_bits_terminates(m: UInt) -> (result: UInt) + pre 1 + post 1 +{ + result = 0 + var left: UInt = m + + @ast(true, left, variant_value, 1, 1) + while left > 0 { + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + } +} +// END power-of-two-termination + +// With left bits remaining, the current prefix can reach an interval of 2^left values. +// The invariant is zero outside that interval and 1/2^left for each output inside it. +// Termination makes wp and wlp agree, so the matching bounds give exact uniformity. diff --git a/tests/case-studies/reservoir-sampling.heyvl b/tests/case-studies/reservoir-sampling.heyvl new file mode 100644 index 00000000..e2adf218 --- /dev/null +++ b/tests/case-studies/reservoir-sampling.heyvl @@ -0,0 +1,56 @@ +// RUN: @caesar @file + +// Algorithm R samples one stream position using only the current sample and index. +// Adapted from the Caesar ROCKS 2026 tutorial's Algorithm R showcase. +// Background: Vitter, Random Sampling with a Reservoir (1985), Section 2. + +@wp coproc algorithm_r(n: UInt, x: UInt) -> (c: UInt) + pre !?(1 <= x && x <= n) + pre 1/n + post [c == x] +{ + c = 0 + var i: UInt = 1 + + @invariant(!?(1 <= i && i <= n + 1 && c < i) ⊔ ite(i <= x, 1/n, ((i - 1)/n) * [c == x])) + while i <= n { + var take: Bool = flip(1/i) + if take { c = i } else {} + i = i + 1 + } +} + +@wlp proc algorithm_r_lower(n: UInt, x: UInt) -> (c: UInt) + pre ?(1 <= x && x <= n) + pre 1/n + post [c == x] +{ + c = 0 + var i: UInt = 1 + + @invariant(?(1 <= i && i <= n + 1) ⊓ ite(i <= x, 1/n, ((i - 1)/n) * [c == x])) + while i <= n { + var take: Bool = flip(1/i) + if take { c = i } else {} + i = i + 1 + } +} + +@wp proc algorithm_r_terminates(n: UInt) -> (c: UInt) + pre 1 + post 1 +{ + c = 0 + var i: UInt = 1 + + @ast(1 <= i && i <= n + 1, (n + 1) - i, v, 1, 1) + while i <= n { + var take: Bool = flip(1/i) + if take { c = i } else {} + i = i + 1 + } +} + +// Before position x is processed, its final selection probability is 1/n. +// Afterwards, a selected x survives the remaining replacements with probability (i - 1)/n. +// The wp upper bound and wlp lower bound coincide because the loop terminates almost surely. diff --git a/tests/case-studies/retry-moments.heyvl b/tests/case-studies/retry-moments.heyvl new file mode 100644 index 00000000..6ab70921 --- /dev/null +++ b/tests/case-studies/retry-moments.heyvl @@ -0,0 +1,63 @@ +// RUN: @caesar @file + +// From Schroer and Katoen, Highly Incremental (FM 2026), Appendix B.2. +// Each request costs one second, and caching costs another half second at startup. + +@wp +coproc retry_mean() -> (done: Bool) + pre 2 + post 0 +{ + done = false + @invariant([!done] * 2) + while !done { + reward 1 + done = flip(0.5) + } +} + +@wp +coproc cached_retry_mean() -> (done: Bool) + pre 2 + post 0 +{ + done = false + reward 0.5 + @invariant([!done] * 1.5) + while !done { + reward 1 + done = flip(2/3) + } +} + +// Incremental squared costs also account for executions that never finish. +@wp +coproc retry_second_moment() -> (done: Bool) + pre 6 + post 0 +{ + done = false + var tau: UInt = 0 + @invariant([!done] * (6 + 4 * tau)) + while !done { + reward 2 * tau + 1 + tau = tau + 1 + done = flip(0.5) + } +} + +@wp +coproc cached_retry_second_moment() -> (done: Bool) + pre 4.75 + post 0 +{ + done = false + var tau: UReal = 0.5 + reward 0.25 + @invariant([!done] * (4.5 + 3 * (tau - 0.5))) + while !done { + reward 2 * tau + 1 + tau = tau + 1 + done = flip(2/3) + } +} diff --git a/tests/case-studies/slow-dice-roller.heyvl b/tests/case-studies/slow-dice-roller.heyvl new file mode 100644 index 00000000..a3357157 --- /dev/null +++ b/tests/case-studies/slow-dice-roller.heyvl @@ -0,0 +1,229 @@ +// RUN: @caesar @file --timeout 30 --max-fuel 4 --quantifier-instantiation e-matching --werr + +// Matching probability bounds establish uniformity for every positive range size n. +// The finite expected-bit certificate and terminating preparation establish almost-sure termination. + +// BEGIN slow-dice-roller-definitions +domain SlowBinaryRange { + func max_value(m: UInt): UInt = + ite(m == 0, 0, 2 * max_value(m - 1) + 1) + + func pow2(m: UInt): UInt = max_value(m) + 1 + + // Count the completed candidates outside 0 through n - 1. + func slow_rejected(n: UInt, result: UInt, left: UInt): UInt = + ((result + 1) * pow2(left) - n) ⊓ pow2(left) + + +} +// END slow-dice-roller-definitions + +// Each fair bit splits the possible completions into two equally sized blocks. +@wp +coproc slow_block_probability_split(n: UInt, k: UInt, start: UReal, half: UReal, bound: UReal) -> () + pre !?(n >= 1 && half >= 1) + pre bound + post !?( + ite(start <= k && k < start + 2 * half, 1 / (2 * half), 0) + + ((((start + 2 * half) - n) ⊓ (2 * half)) / (2 * half)) / n == + (ite(start <= k && k < start + half, 1 / half, 0) + + ((((start + half) - n) ⊓ half) / half) / n + + ite(start + half <= k && k < start + 2 * half, 1 / half, 0) + + ((((start + 2 * half) - n) ⊓ half) / half) / n) / 2) + post bound +{} + +@wp +coproc pow2_step(left: UInt, bound: UReal) -> () + pre !?(left > 0) + pre bound + post !?(pow2(left) == 2 * pow2(left - 1) && pow2(left - 1) >= 1) + post bound +{} + +// Each fair bit splits the possible completions into two equally sized blocks. +@wlp +proc slow_block_probability_split_lower(n: UInt, k: UInt, start: UReal, half: UReal, bound: UReal) -> () + pre ?(n >= 1 && half >= 1) + pre bound + post ?( + ite(start <= k && k < start + 2 * half, 1 / (2 * half), 0) + + ((((start + 2 * half) - n) ⊓ (2 * half)) / (2 * half)) / n == + (ite(start <= k && k < start + half, 1 / half, 0) + + ((((start + half) - n) ⊓ half) / half) / n + + ite(start + half <= k && k < start + 2 * half, 1 / half, 0) + + ((((start + 2 * half) - n) ⊓ half) / half) / n) / 2) + post bound +{} + +@wlp +proc pow2_step_lower(left: UInt, bound: UReal) -> () + pre ?(left > 0) + pre bound + post ?(pow2(left) == 2 * pow2(left - 1) && pow2(left - 1) >= 1) + post bound +{} + +// BEGIN slow-dice-roller-upper +@wp +coproc slow_probability_upper(n: UInt, k: UInt) -> (result: UInt) + pre !?(n >= 1 && k < n) + pre 1/n + post [result == k] +{ + var width: UInt = 1 + var bits: UInt = 0 + @invariant( + !?(n >= 1 && k < n && width == pow2(bits) && width >= bits + 1 && bits <= n) + ⊔ (1/n) + ) + while width < n { + width = 2 * width + bits = bits + 1 + } + result = 0 + var done: Bool = false + @invariant( + !?(n >= 1 && k < n && width >= n && width == pow2(bits)) + ⊔ ite(done, [result == k], 1/n) + ) + while !done { + result = 0 + var left: UInt = bits + // block = 2^left is the number of completions of the current prefix. + var block: UReal = width + // Output k contributes 1/block; each rejected completion contributes 1/(n*block). + @invariant( + !?(n >= 1 && k < n && block == pow2(left)) + ⊔ (ite(result * block <= k && k < (result + 1) * block, 1/block, 0) + + (((((result + 1) * block) - n) ⊓ block) / block) / n) + ) + while left > 0 { + var bound: UReal = (ite(result * block <= k && k < (result + 1) * block, 1/block, 0) + + (((((result + 1) * block) - n) ⊓ block) / block) / n) + pow2_step(left, bound) + slow_block_probability_split(n, k, result * block, block/2, bound) + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + block = block/2 + } + if result < n { + done = true + } else {} + } +} +// END slow-dice-roller-upper + +// BEGIN slow-dice-roller-lower +@wlp +proc slow_probability_lower(n: UInt, k: UInt) -> (result: UInt) + pre ?(n >= 1 && k < n) + pre 1/n + post [result == k] +{ + var width: UInt = 1 + var bits: UInt = 0 + @invariant( + ?(n >= 1 && k < n && width == pow2(bits) && width >= bits + 1 && bits <= n) + ⊓ (1/n) + ) + while width < n { + width = 2 * width + bits = bits + 1 + } + result = 0 + var done: Bool = false + @invariant( + ?(n >= 1 && k < n && width >= n && width == pow2(bits)) + ⊓ ite(done, [result == k], 1/n) + ) + while !done { + result = 0 + var left: UInt = bits + // block = 2^left is the number of completions of the current prefix. + var block: UReal = width + // Output k contributes 1/block; each rejected completion contributes 1/(n*block). + @invariant( + ?(n >= 1 && k < n && block == pow2(left)) + ⊓ (ite(result * block <= k && k < (result + 1) * block, 1/block, 0) + + (((((result + 1) * block) - n) ⊓ block) / block) / n) + ) + while left > 0 { + var bound: UReal = (ite(result * block <= k && k < (result + 1) * block, 1/block, 0) + + (((((result + 1) * block) - n) ⊓ block) / block) / n) + pow2_step_lower(left, bound) + slow_block_probability_split_lower(n, k, result * block, block/2, bound) + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + block = block/2 + } + if result < n { + done = true + } else {} + } +} +// END slow-dice-roller-lower + +// BEGIN slow-dice-roller-prepare-termination +@wp +proc slow_prepare_terminates(n: UInt) -> (width: UInt, bits: UInt) + pre ?(n >= 1) + pre 1 + post 1 +{ + width = 1 + bits = 0 + @ast(n >= 1 && width >= 1 && width == pow2(bits) && width < 2*n && bits <= width && bits <= n, + n - width, variant_value, 1, 1) + while width < n { + width = 2*width + bits = bits + 1 + } +} +// END slow-dice-roller-prepare-termination + +// BEGIN slow-dice-roller-expected-bits +@wp +coproc slow_expected_bits_all_inputs(n: UInt) -> (result: UInt) + pre !?(n >= 1) + pre 2*n + post 0 +{ + var width: UInt = 1 + var bits: UInt = 0 + @invariant( + !?(n >= 1 && width >= 1 && width == pow2(bits) && width < 2*n && bits <= width && bits <= n) + ⊔ 2*n + ) + while width < n { + width = 2*width + bits = bits + 1 + } + + var done: Bool = false + result = 0 + @invariant( + !?(n >= 1 && width == pow2(bits) && n <= width && width < 2*n) + ⊔ ite(done, 0, 2*bits) + ) + while !done { + result = 0 + var left: UInt = bits + @invariant( + !?(left <= bits) + ⊔ (left + 2*bits*(slow_rejected(n, result, left)/pow2(left))) + ) + while left > 0 { + reward 1 + var bit: Bool = flip(1/2) + result = 2*result + ite(bit, 1, 0) + left = left - 1 + } + if result < n { + done = true + } else {} + } +} +// END slow-dice-roller-expected-bits diff --git a/tests/case-studies/tortoise-hare.heyvl b/tests/case-studies/tortoise-hare.heyvl new file mode 100644 index 00000000..b4840cfa --- /dev/null +++ b/tests/case-studies/tortoise-hare.heyvl @@ -0,0 +1,32 @@ +// RUN: @caesar @file + +// Adapted from Batz et al. (OOPSLA 2025), Sections 9.2.3 and 9.3 and Appendix C.24. +// https://arxiv.org/abs/2502.19388 +// The eight-interval approximation follows Caesar's accompanying blog post. + +@wp +coproc tortoise_hare(init_h: UReal, init_t: UReal) -> (count: UReal) + pre 3.38 * ((init_t - init_h) + 2) + post count +{ + var h: UReal = init_h + var t: UReal = init_t + count = 0 + + // Bound the final round count by rounds so far plus a bound for the remaining gap. + @invariant(ite(h <= t, count + 3.38 * ((t - h) + 2), count)) + while h <= t { + var choice: Bool = flip(0.5) + if choice { + var inc: UReal + var N: UInt = 8 + var j: UInt = unif(0, 7) + // Upper Riemann sum: choose any point in the sampled interval. + cohavoc inc + coassume !?(j / N <= inc && inc <= (j + 1) / N) + h = h + 10 * inc + } else {} + t = t + 1 + count = count + 1 + } +} diff --git a/tests/case-studies/zeroconf.heyvl b/tests/case-studies/zeroconf.heyvl index d12c1df7..b41fac31 100644 --- a/tests/case-studies/zeroconf.heyvl +++ b/tests/case-studies/zeroconf.heyvl @@ -1,25 +1,31 @@ -// RUN: @caesar @file +// RUN: @caesar @file --quantifier-instantiation e-matching domain Arith { - func exp(b: UReal, i: UInt): UReal = ite(i == 0, 1, b * exp(b, i - 1)) - axiom exp_bounded forall b: UReal, i: UInt @trigger(exp(b, i)). (b <= 1) ==> (exp(b, i) <= 1) + func exp(base: UReal, exponent: UInt): UReal = + ite(exponent == 0, 1, base * exp(base, exponent - 1)) + // Powers of probabilities remain probabilities. + axiom exp_bounded forall base: UReal, exponent: UInt @trigger(exp(base, exponent)). + (base <= 1) ==> (exp(base, exponent) <= 1) } domain Constants { - func probCollision(): UReal // this is often called q + func probCollision(): UReal // Probability that the chosen address is already in use. axiom collisionProb probCollision() <= 1 - func probMessageLost(): UReal // this is often called p + func probMessageLost(): UReal // Probability that a detection message is lost. axiom messageLostProb probMessageLost() <= 1 - func maxTries(): UInt // this is often called N + func maxTries(): UInt // Maximum number of detection attempts. } +@wp coproc arp(triesRemaining: UInt) -> (success: Bool) pre 1 - exp(probMessageLost(), triesRemaining) post [success] { if triesRemaining == 0 { + // With no probes remaining, the collision cannot be detected. success = false } else { + // A delivered probe detects the collision; a lost probe leaves one fewer attempt. var messageLost: Bool = flip(probMessageLost()) if messageLost { success = arp(triesRemaining - 1) @@ -29,14 +35,16 @@ coproc arp(triesRemaining: UInt) -> (success: Bool) } } +@wp coproc zeroconf() -> (success: Bool) - pre probCollision() * (1 - exp(probMessageLost(), maxTries())) + (1-probCollision()) + pre probCollision() * (1 - exp(probMessageLost(), maxTries())) + (1 - probCollision()) post [success] { var collision: Bool = flip(probCollision()) if collision { + // Try at most maxTries() probes to detect this collision. success = arp(maxTries()) } else { - success = true // no collision, no erroneous allocation + success = true } } diff --git a/tests/loop-rules/ast2018/ast-flipflop.heyvl b/tests/loop-rules/ast2018/ast-flipflop.heyvl index 10ae1790..f73bbeed 100644 --- a/tests/loop-rules/ast2018/ast-flipflop.heyvl +++ b/tests/loop-rules/ast2018/ast-flipflop.heyvl @@ -1,16 +1,19 @@ // RUN: @caesar @file -proc main() -> () +@wp +proc parity_walk(init_x: UInt) -> (x: UInt) pre 1 post 1 { - var x: UInt - // invariant = true variant = (3 * [!(x % 2 == 0)]) + ite(x >= 10, x - 10, 10 - x), probability function = 0.5, decrease function = 2 - @ast(true, (3 * ite(!(x % 2 == 0), 1, 0)) + ite(x >= 10, x - 10, 10 - x), v, 0.5, 2) + x = init_x + // Measure the distance from ten, adding three at odd positions. + // Its expected value does not increase, and a decrease of at least two has probability at least 0.5. + // The additional three covers the deterministic step from an odd to an even position. + @ast(true, 3 * ite(x % 2 != 0, 1, 0) + ite(x >= 10, x - 10, 10 - x), v, 0.5, 2) while x != 10 { - if x % 2 == 0{ - var prob_choice: Bool = flip(1/2) - if prob_choice { + if x % 2 == 0 { + var down: Bool = flip(0.5) + if down { x = x - 2 } else { x = x + 2 diff --git a/tests/loop-rules/ast2018/demonically_fair.heyvl b/tests/loop-rules/ast2018/demonically_fair.heyvl index 80e37b81..602593ec 100644 --- a/tests/loop-rules/ast2018/demonically_fair.heyvl +++ b/tests/loop-rules/ast2018/demonically_fair.heyvl @@ -1,22 +1,19 @@ // RUN: @caesar @file -// The "Demonically Fair Random Walk" example from the "A New Proof Rule for Almost-Sure Termination" paper, Section 5.2 - -proc demonically_fair() -> () +// The demonically fair random walk from McIver et al. (2018), Section 5.2. +@wp +proc demonic_walk(init_x: UInt) -> (x: UInt) pre 1 post 1 { - var x: UInt - @ast( - /* invariant: */ x >= 0, - /* variant: */ x, - /* variable: */ v, - /* prob(v): */ 0.5, - /* decrease(v): */ 1 - ) - while x != 0 { - var prob_choice: Bool = flip(0.5) - if prob_choice { + x = init_x + // The variant x is nonnegative. + // Each iteration decreases it by at least one with probability 0.5. + // Its expected value does not increase under either demonic choice. + @ast(true, x, v, 0.5, 1) + while x > 0 { + var down: Bool = flip(0.5) + if down { x = x - 1 } else { if \cap { diff --git a/tests/loop-rules/ast2018/escaping_spline.heyvl b/tests/loop-rules/ast2018/escaping_spline.heyvl index 02a2af03..c0b9d5c7 100644 --- a/tests/loop-rules/ast2018/escaping_spline.heyvl +++ b/tests/loop-rules/ast2018/escaping_spline.heyvl @@ -1,12 +1,14 @@ // RUN: @caesar @file -// The "Escaping Spline" example from the "A New Proof Rule for Almost-Sure Termination" paper, Section 5.4 +// McIver et al. (2018), "A New Proof Rule for Almost-Sure Termination", Section 5.4. +// https://arxiv.org/abs/1711.03588 -proc escaping_spline() -> () +@wp +proc escaping_spline(init_x: UInt) -> (x: UInt) pre 1 post 1 { - var x: UInt + x = init_x @ast( /* invariant: */ true, /* variant: */ x, @@ -14,12 +16,12 @@ proc escaping_spline() -> () /* prob(v): */ 1/(v+1), /* decrease(v): */ 1 ) - while x != 0 { - var prob_choice: Bool = flip(1 / (x + 1)) - if prob_choice { + while x > 0 { + var stop: Bool = flip(1 / (x + 1)) + if stop { x = 0 } else { x = x + 1 } } -} \ No newline at end of file +} diff --git a/tests/loop-rules/ast2018/negative_binomial.heyvl b/tests/loop-rules/ast2018/negative_binomial.heyvl index 37f6cadd..b3fb331b 100644 --- a/tests/loop-rules/ast2018/negative_binomial.heyvl +++ b/tests/loop-rules/ast2018/negative_binomial.heyvl @@ -1,23 +1,20 @@ // RUN: @caesar @file -// The "Negative-Binomial Loop" example from the "A New Proof Rule for Almost-Sure Termination" paper, Section 5.1 - -proc escaping_spline() -> () +// The negative-binomial loop from McIver et al. (2018), Section 5.1. +@wp +proc countdown(init_x: UInt) -> (x: UInt) pre 1 post 1 { - var x: UInt - @ast( - /* invariant: */ x >= 0, - /* variant: */ x, - /* variable: */ v, - /* prob(v): */ 0.5, - /* decrease(v): */ 1 - ) - while x != 0 { - var prob_choice: Bool = flip(0.5) - if prob_choice { + x = init_x + // The variant x is nonnegative. + // Each iteration decreases it by at least one with probability 0.5. + // Its expected value does not increase. + @ast(true, x, v, 0.5, 1) + while x > 0 { + var step: Bool = flip(0.5) + if step { x = x - 1 } else {} } -} \ No newline at end of file +} diff --git a/tests/loop-rules/bmc/refute-geo2_bmc.heyvl b/tests/loop-rules/bmc/refute-geo2_bmc.heyvl index d7175635..1a187180 100644 --- a/tests/loop-rules/bmc/refute-geo2_bmc.heyvl +++ b/tests/loop-rules/bmc/refute-geo2_bmc.heyvl @@ -1,20 +1,22 @@ // RUN: bash -c '@caesar @file --slice-error-first 2>&1 | grep -Eq "Counter-example to property found"' -// Auto-generated by pgcl2heyvl from refute-geo2_bmc.pgcl -// -coproc main(init_c: UInt, init_f: UInt) -> (c: UInt, f: UInt) - pre init_c + 0.99 - post c +// Adapted from refute-geo2_bmc.pgcl, translated by pgcl2heyvl. + +@wp +coproc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) + pre init_count + 0.99 + post count { - var prob_choice: Bool - c = init_c - f = init_f + count = init_count + running = init_running + // Unexplored executions contribute zero to the lower approximation. + // With init_count == 0 and init_running == true, it is 509/512 > 0.99. @unroll(12, 0) - while f == 1 { - prob_choice = flip(0.5) - if prob_choice { - f = 0 + while running { + var stop: Bool = flip(0.5) + if stop { + running = false } else { - c = c + 1 + count = count + 1 } } } diff --git a/tests/loop-rules/bmc/refute-unif_gen1_bmc.heyvl b/tests/loop-rules/bmc/refute-unif_gen1_bmc.heyvl index 0c375446..7a94ea09 100644 --- a/tests/loop-rules/bmc/refute-unif_gen1_bmc.heyvl +++ b/tests/loop-rules/bmc/refute-unif_gen1_bmc.heyvl @@ -1,37 +1,35 @@ // RUN: bash -c '@caesar @file 2>&1 | grep -q "Counter-example to property found"' -// Auto-generated by pgcl2heyvl from refute-unif_gen1_bmc.pgcl -// -coproc main(init_elow: UInt, init_ehigh: UInt, init_n: UInt, init_v: UInt, init_c: UInt, init_running: UInt, init_i: UInt) -> (elow: UInt, ehigh: UInt, n: UInt, v: UInt, c: UInt, running: UInt, i: UInt) - pre ([(((((((init_elow + 1) == init_ehigh) && (init_n == ((init_ehigh - init_elow) + 1))) && (init_v == 1)) && (init_c == 0)) && (init_running == 0)) && !(init_i < init_elow)) && (init_i <= init_ehigh)] * 0.49) + ([!((((((((init_elow + 1) == init_ehigh) && (init_n == ((init_ehigh - init_elow) + 1))) && (init_v == 1)) && (init_c == 0)) && (init_running == 0)) && !(init_i < init_elow)) && (init_i <= init_ehigh))] * 1) - post [c == i] + +// Adapted from pgcl/examples/refute-unif_gen1_bmc.pgcl. +// Coin recycling follows Lumbroso, "Optimal Discrete Uniform Generation from Coin Flips, and Applications" (2013). +// https://arxiv.org/abs/1304.1916 + +// For n > 0, generate an integer uniformly from 0 through n - 1. +// The claimed upper bound 0.49 is false for either output when n == 2. +coproc uniform_below(n: UInt, target: UInt) -> (candidate: UInt) + pre ite(n == 2 && target < n, 0.49, 1) + post [candidate == target] { - var prob_choice: Bool - elow = init_elow - ehigh = init_ehigh - n = init_n - v = init_v - c = init_c - running = init_running - i = init_i + var range: UInt = 1 + candidate = 0 + var running: Bool = true + @unroll(2, 0) - while running == 0 { - v = 2 * v - prob_choice = flip(0.5) - if prob_choice { - c = (2 * c) + 1 - } else { - c = 2 * c - } - if !(v < n) { - if !(n == c) && !(n < c) { - running = 1 + while running { + range = 2 * range + candidate = 2 * candidate + var bit: Bool = flip(0.5) + if bit { + candidate = candidate + 1 + } else {} + + if range >= n { + if candidate < n { + running = false } else { - v = v - n - c = c - n + range = range - n + candidate = candidate - n } } else {} - if !(running == 0) { - c = elow + c - } else {} } } diff --git a/tests/loop-rules/induction/chain/lossy_list.heyvl b/tests/loop-rules/induction/chain/lossy_list.heyvl index 37e19259..49ee17d7 100644 --- a/tests/loop-rules/induction/chain/lossy_list.heyvl +++ b/tests/loop-rules/induction/chain/lossy_list.heyvl @@ -1,28 +1,32 @@ -// RUN: @caesar @file +// RUN: @caesar @file --quantifier-instantiation e-matching domain Exponentials { - func exp(base: UReal, exponent: UInt): UReal = ite(exponent == 0, 1, base * exp(base, exponent - 1)) + func exp(base: UReal, exponent: UInt): UReal = + ite(exponent == 0, 1, base * exp(base, exponent - 1)) } domain List { func len(l: List): UInt func pop(l: List): List - axiom list_pop forall l: List @trigger(len(pop(l))). len(pop(l)) == len(l) - 1 + axiom list_pop forall l: List @trigger(len(pop(l))). + len(pop(l)) == len(l) - 1 } +// Every successful read removes one node, and assert 0 represents a failed read. +@wlp proc lossy_list(init_l: List) -> (l: List) - pre [len(init_l) == 1] * 0.5 - post [true] + pre exp(0.5, len(init_l)) + post 1 { l = init_l @invariant(exp(0.5, len(l))) while len(l) > 0 { - var prob_choice: Bool = flip(0.5) - if prob_choice { + var read_succeeds: Bool = flip(0.5) + if read_succeeds { l = pop(l) } else { - assert [false] + assert 0 } } } diff --git a/tests/loop-rules/induction/geometric.heyvl b/tests/loop-rules/induction/geometric.heyvl new file mode 100644 index 00000000..c4405c20 --- /dev/null +++ b/tests/loop-rules/induction/geometric.heyvl @@ -0,0 +1,20 @@ +// RUN: @caesar @file + +@wp +coproc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) + pre init_count + [init_running] + post count +{ + count = init_count + running = init_running + // An active loop adds at most one flip showing tails in expectation. + @invariant(count + [running]) + while running { + var stop: Bool = flip(0.5) + if stop { + running = false + } else { + count = count + 1 + } + } +} diff --git a/tests/loop-rules/induction/linear01.heyvl b/tests/loop-rules/induction/linear01.heyvl index 5f372eb4..b3648627 100644 --- a/tests/loop-rules/induction/linear01.heyvl +++ b/tests/loop-rules/induction/linear01.heyvl @@ -1,21 +1,23 @@ // RUN: @caesar @file -// Auto-generated by pgcl2heyvl from linear01.pgcl -// +// Adapted from linear01.pgcl, translated by pgcl2heyvl. + @ert -coproc main(init_x: UInt) -> (x: UInt) +coproc countdown(init_x: UInt) -> (x: UInt) pre 0.6 * init_x post 0 { - var prob_choice: Bool x = init_x + // The invariant bounds the expected number of remaining coin flips by 0.6 * x. + // Each iteration decreases it by one in expectation, accounting for one coin flip. + // At exit, it is nonnegative and covers the zero postexpectation. @invariant(0.6 * x) - while 2 <= x { - prob_choice = flip((1/3)) - if prob_choice { + while x >= 2 { + var short_step: Bool = flip(1/3) + if short_step { x = x - 1 } else { x = x - 2 } - tick 1 + tick 1 // Count the single coin flip in this iteration. } } diff --git a/tests/loop-rules/induction/rabin_hurd2004.heyvl b/tests/loop-rules/induction/rabin_hurd2004.heyvl index 249614f7..feb6eea6 100644 --- a/tests/loop-rules/induction/rabin_hurd2004.heyvl +++ b/tests/loop-rules/induction/rabin_hurd2004.heyvl @@ -1,4 +1,4 @@ -// RUN: @caesar @file --function-encoding fuel-param +// RUN: @caesar @file --quantifier-instantiation e-matching // Verification of Rabin's mutual exclusion algorithm, based on // Joe Hurd, Annabelle McIver, Carroll Morgan: Probabilistic Guarded Commands Mechanized in HOL. QAPL 2004: 95-111 @@ -8,25 +8,31 @@ domain Exponentials { func rec_pown_2(exponent: UInt): UReal = ite(exponent == 0, 1, rec_pown_2(exponent - 1) / 2) } -proc rabin(init_i: UInt, init_n: UInt, init_d: UInt) -> (i: UInt, n: UInt, d: UInt) - pre ([1 == init_i] + ([1 < init_i] * (2/3))) +@wlp +proc rabin(init_i: UInt) -> (i: UInt) + pre [init_i == 1] + [init_i > 1] * (2/3) post [i == 1] { i = init_i - n = init_n - d = init_d - @invariant(([1 == i] + ([1 < i] * (2/3)))) - while 1 < i { - n = i - @invariant(([(0 <= n) && (n <= i)]) * (((2/3) * (1 - ((([i == n] * (n + 1)) * rec_pown_2(n)) + ([i == (n + 1)] * rec_pown_2(n))))) + ((([i == n] * n) * rec_pown_2(n)) + ([i == (n + 1)] * rec_pown_2(n))))) - while 0 < n { - var prob_choice: Bool = ber(1, 1) - if prob_choice { - d = 0 - } else { - d = 1 - } - i = i - d + // One survivor contributes 1, no survivors contribute 0, and another round contributes 2/3. + @invariant([i == 1] + [i > 1] * (2/3)) + while i > 1 { + // Each contender present at the start of this round flips exactly once. + var n: UInt = i + // Evaluate the outer annotation after the remaining n flips. + @invariant( + [n <= i] * ( + // More than one eventual survivor contributes 2/3. + (2/3) * (1 - ([i == n] * (n + 1) + [i == n + 1]) * rec_pown_2(n)) + // Exactly one eventual survivor contributes 1. + + ([i == n] * n + [i == n + 1]) * rec_pown_2(n) + ) + ) + while n > 0 { + var withdraw: Bool = flip(0.5) + if withdraw { + i = i - 1 + } else {} n = n - 1 } } diff --git a/tests/loop-rules/induction/rdwalk.heyvl b/tests/loop-rules/induction/rdwalk.heyvl index 3a3fe1a7..2c95ee5c 100644 --- a/tests/loop-rules/induction/rdwalk.heyvl +++ b/tests/loop-rules/induction/rdwalk.heyvl @@ -1,22 +1,25 @@ // RUN: @caesar @file -// Auto-generated by pgcl2heyvl from rdwalk.pgcl -// +// Adapted from rdwalk.pgcl, translated by pgcl2heyvl. + @ert -coproc main(init_x: UInt, init_n: UInt) -> (x: UInt, n: UInt) +coproc drift_walk(init_x: UInt, init_n: UInt) -> (x: UInt, n: UInt) pre 2 * ((init_n + 1) - init_x) post 0 { - var prob_choice: Bool x = init_x n = init_n + // The invariant bounds the expected number of remaining coin flips. + // Its expected decrease covers the one tick charged per iteration. + // The extra one in n + 1 permits overshooting the target by one. + // At exit, the invariant is nonnegative and covers the zero postexpectation. @invariant(2 * ((n + 1) - x)) while x < n { - prob_choice = flip((1/2)) - if prob_choice { + var up: Bool = flip(0.5) + if up { x = x + 2 } else { x = x - 1 } - tick 1 + tick 1 // Count the single coin flip in this iteration. } } diff --git a/tests/loop-rules/induction/sprdwalk.heyvl b/tests/loop-rules/induction/sprdwalk.heyvl index 578ef2a4..93c6f54e 100644 --- a/tests/loop-rules/induction/sprdwalk.heyvl +++ b/tests/loop-rules/induction/sprdwalk.heyvl @@ -1,24 +1,20 @@ // RUN: @caesar @file -// Auto-generated by pgcl2heyvl from sprdwalk.pgcl -// +// Adapted from sprdwalk.pgcl, translated by pgcl2heyvl. + @ert -coproc main(init_x: UInt, init_n: UInt, init_r: UInt) -> (x: UInt, n: UInt, r: UInt) +coproc forward_walk(init_x: UInt, init_n: UInt) -> (x: UInt, n: UInt) pre 2 * (init_n - init_x) post 0 { - var prob_choice: Bool x = init_x n = init_n - r = init_r + // Twice the remaining distance bounds the expected number of coin flips. @invariant(2 * (n - x)) while x < n { - prob_choice = flip((1/2)) - if prob_choice { - r = 0 - } else { - r = 1 - } - x = x + r + var step: Bool = flip(0.5) + if step { + x = x + 1 + } else {} tick 1 } } diff --git a/tests/loop-rules/k_induction/geo1.heyvl b/tests/loop-rules/k_induction/geo1.heyvl index 685f34b3..45bfc9de 100644 --- a/tests/loop-rules/k_induction/geo1.heyvl +++ b/tests/loop-rules/k_induction/geo1.heyvl @@ -1,21 +1,21 @@ // RUN: @caesar @file -// Auto-generated by pgcl2heyvl from geo1.pgcl -// +// Adapted from geo1.pgcl, translated by pgcl2heyvl. + @wp -coproc main(init_c: UInt, init_f: UInt) -> (c: UInt, f: UInt) - pre init_c + 1 - post c +coproc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) + pre init_count + 1 + post count { - var prob_choice: Bool - c = init_c - f = init_f - @k_induction(2, c + 1) - while f == 1 { - prob_choice = flip(0.5) - if prob_choice { - f = 0 + count = init_count + running = init_running + // The second guard check uses post count when running is false. + @k_induction(2, count + 1) + while running { + var stop: Bool = flip(0.5) + if stop { + running = false } else { - c = c + 1 + count = count + 1 } } } diff --git a/tests/loop-rules/omega_invariants/countdown-bounds.heyvl b/tests/loop-rules/omega_invariants/countdown-bounds.heyvl new file mode 100644 index 00000000..6690431d --- /dev/null +++ b/tests/loop-rules/omega_invariants/countdown-bounds.heyvl @@ -0,0 +1,28 @@ +// RUN: @caesar @file + +// The countdown terminates with probability one for every initial counter. +@wp +proc countdown_termination(init_x: UInt) -> (x: UInt) + pre 1 + post 1 +{ + x = init_x + @omega_invariant(n, [x <= n]) + while x > 0 { + x = x - 1 + } +} + +// The expected number of ticks is at least the initial counter. +@ert +proc countdown_ticks(init_x: UInt) -> (x: UInt) + pre init_x + post 0 +{ + x = init_x + @omega_invariant(n, [x <= n] * x) + while x > 0 { + tick 1 + x = x - 1 + } +} diff --git a/tests/loop-rules/ost2019/annotated.heyvl b/tests/loop-rules/ost2019/annotated.heyvl new file mode 100644 index 00000000..d9d73480 --- /dev/null +++ b/tests/loop-rules/ost2019/annotated.heyvl @@ -0,0 +1,25 @@ +// RUN: @caesar @file + +// Optional stopping proves a lower bound on the expected value of count on termination. +// The annotation checks the subinvariant, the expected number of iterations, and bounded differences. +@wp +proc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) + pre init_count + [init_running] + post count +{ + count = init_count + running = init_running + // count + [running] changes by -1 after heads and +1 after tails. + // Its expectation is unchanged, and at termination it equals count. + // 2 * [running] bounds the expected number of remaining coin flips. + // Each active iteration changes the subinvariant by exactly 1 in absolute value. + @ost(count + [running], 2 * [running], 1, count) + while running { + var stop: Bool = flip(0.5) + if stop { + running = false + } else { + count = count + 1 + } + } +} diff --git a/tests/loopfree-prob/noisy_or.heyvl b/tests/loopfree-prob/noisy_or.heyvl index 926c19f8..47f376c5 100644 --- a/tests/loopfree-prob/noisy_or.heyvl +++ b/tests/loopfree-prob/noisy_or.heyvl @@ -1,10 +1,16 @@ // RUN: @caesar @file -proc noisy_or(what_n3: Bool) -> (n3: Bool) - pre [what_n3] * (130307/160000) + [!what_n3] * (29693/160000) - post [n3 == what_n3] +@wp +proc noisy_or(target: Bool) -> (n3: Bool) + pre [target] * (130307/160000) + [!target] * (29693/160000) + post [n3 == target] { - var n1: Bool = false; var n21: Bool = false; var n22: Bool = false; var n31: Bool = false; var n32: Bool = false; var n33: Bool = false; + var n1: Bool + var n21: Bool + var n22: Bool + var n31: Bool + var n32: Bool + var n33: Bool var n0: Bool = flip(1/2) var n4: Bool = flip(1/2) if n0 { @@ -33,4 +39,4 @@ proc noisy_or(what_n3: Bool) -> (n3: Bool) n32 = flip(1/10) } n3 = n31 || n32 || n33 -} \ No newline at end of file +} diff --git a/tests/loopfree-prob/six-sided-die.heyvl b/tests/loopfree-prob/six-sided-die.heyvl index 1f8d9347..ffd5b399 100644 --- a/tests/loopfree-prob/six-sided-die.heyvl +++ b/tests/loopfree-prob/six-sided-die.heyvl @@ -1,5 +1,7 @@ // RUN: @caesar @file +// Bound the unnormalized expected die result after discarding outcomes 7 and 8. +@wp coproc die_wp() -> (r: EUReal) pre 2.625 post r @@ -11,6 +13,8 @@ coproc die_wp() -> (r: EUReal) assert ?(r <= 6) } +// Bound the probability that the sampled outcome is retained. +@wlp proc die_wlp() -> (r: EUReal) pre 6/8 post 1 @@ -20,4 +24,4 @@ proc die_wlp() -> (r: EUReal) var c: Bool = flip(0.5) r = 4 * [a] + 2 * [b] + [c] + 1 assert ?(r <= 6) -} \ No newline at end of file +} From 4a24d22e1a4b1006d551ed66161a49160dd33cc6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:57 +0100 Subject: [PATCH 17/32] website: publish the finished HeyVL example zoo --- .github/workflows/website.yml | 2 + vscode-ext/src/WalkthroughComponent.ts | 3 +- vscode-ext/walkthrough/heyvl-examples.md | 3 +- .../blog/2025-04-11-foundations-continuous.md | 8 + website/blog/2026-03-04-highly-incremental.md | 2 + website/docs/getting-started/README.md | 2 +- website/docs/getting-started/first-proof.mdx | 2 + website/docs/getting-started/heyvl-guide.md | 18 + .../getting-started/zoo-of-heyvl-examples.md | 24 - website/docs/getting-started/zoo.md | 17 + .../zoo/binary-search-trees.mdx | 135 +++++ .../zoo/bounded-retransmission.mdx | 256 ++++++++++ .../docs/getting-started/zoo/conditioning.mdx | 129 +++++ .../getting-started/zoo/coupon-collector.mdx | 158 ++++++ .../getting-started/zoo/escaping-spline.mdx | 110 ++++ .../getting-started/zoo/fast-dice-roller.mdx | 474 ++++++++++++++++++ .../getting-started/zoo/figures.module.css | 47 ++ .../getting-started/zoo/geometric-loop.mdx | 187 +++++++ .../getting-started/zoo/morris-counting.mdx | 100 ++++ .../zoo/one-sided-random-walks.mdx | 156 ++++++ .../zoo/rabin-mutual-exclusion.mdx | 93 ++++ .../zoo/reservoir-sampling.mdx | 129 +++++ .../getting-started/zoo/retry-moments.mdx | 142 ++++++ .../zoo/runtime-composition.mdx | 77 +++ .../getting-started/zoo/selection-sort.mdx | 72 +++ .../getting-started/zoo/tortoise-hare.mdx | 122 +++++ .../zoo/two-sided-random-walks.mdx | 121 +++++ website/docs/getting-started/zoo/zeroconf.mdx | 116 +++++ website/docs/heyvl/statements.md | 2 + website/docusaurus.config.js | 68 ++- website/package.json | 2 + website/plugins/heyvl-examples/index.cjs | 43 ++ website/plugins/heyvl-examples/validate.mjs | 91 ++++ website/scripts/check-examples.mjs | 34 ++ .../heyvl-examples/ExampleGallery.module.css | 451 +++++++++++++++++ website/src/heyvl-examples/ExampleGallery.tsx | 192 +++++++ .../heyvl-examples/ExampleMetadata.module.css | 91 ++++ .../src/heyvl-examples/ExampleMetadata.tsx | 25 + .../heyvl-examples/ExampleSourceExcerpt.tsx | 14 + .../heyvl-examples/ExampleSources.module.css | 140 ++++++ website/src/heyvl-examples/ExampleSources.tsx | 84 ++++ website/src/heyvl-examples/InlineMathText.tsx | 11 + website/src/heyvl-examples/catalog.mjs | 396 +++++++++++++++ website/src/heyvl-examples/exampleFilters.mjs | 63 +++ .../heyvl-examples/exampleFilters.test.mjs | 168 +++++++ .../figures/ExecutionDiagram.tsx | 208 ++++++++ .../figures/FastDiceRollerPrefix.module.css | 78 +++ .../figures/FastDiceRollerPrefix.tsx | 49 ++ .../heyvl-examples/figures/Figure.module.css | 122 +++++ .../figures/RetryLatencyPlot.tsx | 56 +++ .../figures/TortoiseHareJump.tsx | 39 ++ .../heyvl-examples/figures/UnrollingPlot.tsx | 51 ++ 52 files changed, 5155 insertions(+), 28 deletions(-) delete mode 100644 website/docs/getting-started/zoo-of-heyvl-examples.md create mode 100644 website/docs/getting-started/zoo.md create mode 100644 website/docs/getting-started/zoo/binary-search-trees.mdx create mode 100644 website/docs/getting-started/zoo/bounded-retransmission.mdx create mode 100644 website/docs/getting-started/zoo/conditioning.mdx create mode 100644 website/docs/getting-started/zoo/coupon-collector.mdx create mode 100644 website/docs/getting-started/zoo/escaping-spline.mdx create mode 100644 website/docs/getting-started/zoo/fast-dice-roller.mdx create mode 100644 website/docs/getting-started/zoo/figures.module.css create mode 100644 website/docs/getting-started/zoo/geometric-loop.mdx create mode 100644 website/docs/getting-started/zoo/morris-counting.mdx create mode 100644 website/docs/getting-started/zoo/one-sided-random-walks.mdx create mode 100644 website/docs/getting-started/zoo/rabin-mutual-exclusion.mdx create mode 100644 website/docs/getting-started/zoo/reservoir-sampling.mdx create mode 100644 website/docs/getting-started/zoo/retry-moments.mdx create mode 100644 website/docs/getting-started/zoo/runtime-composition.mdx create mode 100644 website/docs/getting-started/zoo/selection-sort.mdx create mode 100644 website/docs/getting-started/zoo/tortoise-hare.mdx create mode 100644 website/docs/getting-started/zoo/two-sided-random-walks.mdx create mode 100644 website/docs/getting-started/zoo/zeroconf.mdx create mode 100644 website/plugins/heyvl-examples/index.cjs create mode 100644 website/plugins/heyvl-examples/validate.mjs create mode 100644 website/scripts/check-examples.mjs create mode 100644 website/src/heyvl-examples/ExampleGallery.module.css create mode 100644 website/src/heyvl-examples/ExampleGallery.tsx create mode 100644 website/src/heyvl-examples/ExampleMetadata.module.css create mode 100644 website/src/heyvl-examples/ExampleMetadata.tsx create mode 100644 website/src/heyvl-examples/ExampleSourceExcerpt.tsx create mode 100644 website/src/heyvl-examples/ExampleSources.module.css create mode 100644 website/src/heyvl-examples/ExampleSources.tsx create mode 100644 website/src/heyvl-examples/InlineMathText.tsx create mode 100644 website/src/heyvl-examples/catalog.mjs create mode 100644 website/src/heyvl-examples/exampleFilters.mjs create mode 100644 website/src/heyvl-examples/exampleFilters.test.mjs create mode 100644 website/src/heyvl-examples/figures/ExecutionDiagram.tsx create mode 100644 website/src/heyvl-examples/figures/FastDiceRollerPrefix.module.css create mode 100644 website/src/heyvl-examples/figures/FastDiceRollerPrefix.tsx create mode 100644 website/src/heyvl-examples/figures/Figure.module.css create mode 100644 website/src/heyvl-examples/figures/RetryLatencyPlot.tsx create mode 100644 website/src/heyvl-examples/figures/TortoiseHareJump.tsx create mode 100644 website/src/heyvl-examples/figures/UnrollingPlot.tsx diff --git a/.github/workflows/website.yml b/.github/workflows/website.yml index 9f0b2864..4c647369 100644 --- a/.github/workflows/website.yml +++ b/.github/workflows/website.yml @@ -36,6 +36,8 @@ jobs: - name: Install dependencies run: yarn install --frozen-lockfile + - name: Test example filters + run: yarn test:examples - name: Build website run: yarn build env: diff --git a/vscode-ext/src/WalkthroughComponent.ts b/vscode-ext/src/WalkthroughComponent.ts index 57c2d07b..f082b36d 100644 --- a/vscode-ext/src/WalkthroughComponent.ts +++ b/vscode-ext/src/WalkthroughComponent.ts @@ -52,6 +52,7 @@ export class WalkthroughComponent { private async openExampleFile() { const content = `// save as geo.heyvl +@wp coproc geo(init_c: UInt) -> (c: UInt) pre init_c + 1 post c @@ -74,4 +75,4 @@ coproc geo(init_c: UInt) -> (c: UInt) }); await window.showTextDocument(document, ViewColumn.Beside); } -} \ No newline at end of file +} diff --git a/vscode-ext/walkthrough/heyvl-examples.md b/vscode-ext/walkthrough/heyvl-examples.md index b21e051f..3efd3ec3 100644 --- a/vscode-ext/walkthrough/heyvl-examples.md +++ b/vscode-ext/walkthrough/heyvl-examples.md @@ -5,6 +5,7 @@ The expected value of the counter `c` increases by at most one. [**Open in editor**](command:caesar.openExampleFileBeside) ```heyvl +@wp coproc geo(init_c: UInt) -> (c: UInt) pre init_c + 1 post c @@ -25,4 +26,4 @@ coproc geo(init_c: UInt) -> (c: UInt) ## More Examples -You can find more examples in our [Zoo of HeyVL Examples](https://www.caesarverifier.org/docs/getting-started/zoo-of-heyvl-examples). +You can find more examples in our [Zoo of HeyVL Examples](https://www.caesarverifier.org/docs/getting-started/zoo). diff --git a/website/blog/2025-04-11-foundations-continuous.md b/website/blog/2025-04-11-foundations-continuous.md index 368b379f..729fbfb0 100644 --- a/website/blog/2025-04-11-foundations-continuous.md +++ b/website/blog/2025-04-11-foundations-continuous.md @@ -23,6 +23,13 @@ In addition to theoretical results such as convergence and completeness of the a ## Encoding Riemann Sums in HeyVL +:::warning Reusing the encoding + +This is a manual encoding of continuous sampling. +Check the [soundness conditions](/docs/getting-started/zoo/tortoise-hare#soundness-conditions) before adapting it to another model. + +::: + The HeyVL encoding of the Riemann sum approximation is simple. Consider sampling the variable `x` from the *continuous* uniform distribution over $[0,1]$. @@ -64,6 +71,7 @@ If the hare decides to move, it samples a distance uniformly at random from $[0, The tortoise always moves exactly one step. For initial positions $h\le t$, the following HeyVL code encodes a proof that $$\mathrm{wp}\llbracket\texttt{tortoise\_hare}\rrbracket(\texttt{count}) \leq 3.38 \cdot (t - h + 2)~,$$ where $h$ and $t$ are the initial positions of the hare and tortoise, respectively. Here, we chose the parameter $N = 8$ for the Riemann sum approximation. +The [Tortoise-Hare Race case study](/docs/getting-started/zoo/tortoise-hare) provides the complete checked source and explains the approximation and the meaning of the final-count bound. ```heyvl @wp diff --git a/website/blog/2026-03-04-highly-incremental.md b/website/blog/2026-03-04-highly-incremental.md index f0588bcf..7706da24 100644 --- a/website/blog/2026-03-04-highly-incremental.md +++ b/website/blog/2026-03-04-highly-incremental.md @@ -264,3 +264,5 @@ coproc retry2_second_moment() -> (done: Bool) ``` Both programs have expected runtime $2$, but their variances are $6 - 2^2 = 2$ and $4.75 - 2^2 = 0.75$, so the second program is more predictable. + +The [Retry Latency and Higher Moments example](/docs/getting-started/zoo/retry-moments) develops this comparison with downloadable HeyVL files and explains the loop invariants checked by Caesar. diff --git a/website/docs/getting-started/README.md b/website/docs/getting-started/README.md index 3dd73a94..5f490f7c 100644 --- a/website/docs/getting-started/README.md +++ b/website/docs/getting-started/README.md @@ -20,6 +20,6 @@ Start with a short example, then use the guide to learn how to express your own Specifications, invariants, types, functions, and verification statements in detail. -4. ### [Explore More Examples](./zoo-of-heyvl-examples.md) +4. ### [Explore More Examples](./zoo.md) Worked examples of probability bounds, termination proofs, and model checking. diff --git a/website/docs/getting-started/first-proof.mdx b/website/docs/getting-started/first-proof.mdx index 4883e112..6bbe64d4 100644 --- a/website/docs/getting-started/first-proof.mdx +++ b/website/docs/getting-started/first-proof.mdx @@ -46,3 +46,5 @@ $$ Caesar checks that the loop body preserves this bound and that it agrees with the precondition before the loop and the postcondition on exit. The [`@invariant` proof rule](../proof-rules/induction.md) establishes the bound for infinitely many possible execution paths. Individual executions can exceed two iterations; the bound concerns their probability-weighted average. + +Continue with the [Guide to HeyVL](./heyvl-guide.md) for language details, or the [Geometric Loop](./zoo/geometric-loop.mdx) to construct an invariant and compare proof techniques. diff --git a/website/docs/getting-started/heyvl-guide.md b/website/docs/getting-started/heyvl-guide.md index e121cc8b..c8ee0132 100644 --- a/website/docs/getting-started/heyvl-guide.md +++ b/website/docs/getting-started/heyvl-guide.md @@ -416,6 +416,15 @@ See the [proof rules documentation](../proof-rules/). ::: +## Conditioning + +An observation restricts a probabilistic model to executions consistent with what we learned. +In HeyVL, `assert ?(observed)` removes the contribution of executions that violate an observation. +Conditional probabilities also require normalization by the retained probability. + +[Conditioning on Queue Completion](./zoo/conditioning.mdx) bounds the expected number of processing rounds given that a queue empties before the server fails. +It verifies the successful runs' contribution and the observation probability, then divides to obtain the conditional bound. + ## Verification Statements {#verification-statements} In addition to HeyVL's "normal" programming constructs such as assignments `x = e`, `if (b) { ... } else { ... }`, Caesar has statements that are specific to program verification. @@ -530,3 +539,12 @@ Together, these choices make the `pre 2` specification an upper bound on the exp Caesar also accepts `tick` as an alias for `reward`. See [Reward and Weigh](../heyvl/statements.md#reward-and-weigh) for the statement reference. + +## Continue with the Examples + +Read these examples in order: + +1. [Geometric Loop](./zoo/geometric-loop.mdx): prove an upper bound with ordinary induction before exploring the other proof techniques. +2. [One-Sided Random Walks](./zoo/one-sided-random-walks.mdx): distinguish almost-sure termination, a finite expected number of loop iterations, and a numerical bound on that expectation. + +For more problems and proof techniques, browse the [example gallery](./zoo.md). diff --git a/website/docs/getting-started/zoo-of-heyvl-examples.md b/website/docs/getting-started/zoo-of-heyvl-examples.md deleted file mode 100644 index cc5f5cf3..00000000 --- a/website/docs/getting-started/zoo-of-heyvl-examples.md +++ /dev/null @@ -1,24 +0,0 @@ ---- -description: Worked examples of expected runtimes, probability bounds, termination, and model checking. -sidebar_position: 3 ---- - -# A Zoo of HeyVL Examples - -## Worked Examples - -- **[Expected Runtime of a Geometric Loop](./first-proof.mdx).** - A short first example: use a supplied invariant to bound the expected number of loop iterations. -- **[Lossy List Traversal](./heyvl-guide.md#verifying-our-first-program-lossy-list-traversal).** - Define a list type and an exponential function, then verify a probability bound that depends on the list's length. -- **[Induction and k-Induction](../proof-rules/induction.md#usage).** - Compare invariants that are preserved by one loop iteration with those that require several iterations. -- **[Almost-Sure Termination](../proof-rules/ast.md#usage).** - Prove termination with probability one for a loop whose chance of exiting decreases as its counter grows. -- **[Model Checking](../model-checking.md#usage).** - Analyze a bounded geometric loop using Caesar's Storm backend, without supplying an invariant. - -## Example Collections - -The repository contains further [HeyVL examples and tests](https://github.com/moves-rwth/caesar/tree/main/tests), including examples for individual language features and proof rules. -It also contains [pGCL programs](https://github.com/moves-rwth/caesar/tree/main/pgcl/examples) and their [translations to HeyVL](https://github.com/moves-rwth/caesar/tree/main/pgcl/examples-heyvl). diff --git a/website/docs/getting-started/zoo.md b/website/docs/getting-started/zoo.md new file mode 100644 index 00000000..59b6aa31 --- /dev/null +++ b/website/docs/getting-started/zoo.md @@ -0,0 +1,17 @@ +--- +description: Browse HeyVL programs, proofs, and refutations by topic and verification technique. +sidebar_position: 3 +hide_table_of_contents: true +--- + +# HeyVL Examples + +The examples below cover probability bounds, expected costs, termination, and Boolean correctness. +Start with [First Example: Expected Runtime](./first-proof.mdx) for a short walkthrough, then [Geometric Loop](./zoo/geometric-loop.mdx) to compare proof techniques. +Browse by program family, or filter by topic and technique. + +```mdx-code-block +import ExampleGallery from '@site/src/heyvl-examples/ExampleGallery'; + + +``` diff --git a/website/docs/getting-started/zoo/binary-search-trees.mdx b/website/docs/getting-started/zoo/binary-search-trees.mdx new file mode 100644 index 00000000..51a603dc --- /dev/null +++ b/website/docs/getting-started/zoo/binary-search-trees.mdx @@ -0,0 +1,135 @@ +--- +title: Binary Search Trees +description: Define trees with a HeyVL domain and verify recursive lookup, minimum, maximum, and insertion. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/boolean/algorithms/binary_search_trees.heyvl?raw'; +import download from '@site/../tests/boolean/algorithms/binary_search_trees.heyvl?download'; + +export const references = { + algorithms: { + ...sources.algorithms, + locator: "§3.2, “Binary Search Trees”", + }, + datatypes: { + ...sources.programmingZ3, + locator: "§3.5, “Algebraic Datatypes”", + }, +}; + + + +A *binary search tree* keeps a set of values ordered for lookup, insertion, and minimum and maximum queries . +Here a HeyVL domain specifies the trees, and recursive procedures implement these operations. +Do the membership, minimum, and maximum procedures return the right answers, and does insertion keep the tree ordered? + +Caesar verifies partial correctness under the tree axioms, using the specifications of recursive calls. +The [`@uwlp` annotation](../../proof-rules/approximations.md#calculus-annotations) selects unbounded greatest fixed point semantics for the Boolean specifications written with `?(...)`. + +## Representing Trees {#representing-trees} + +The [`Tree` domain](../../heyvl/domains.md) declares an empty tree `nil()`, a node constructor `node`, and selectors for each node's integer value and children: + + + +These axioms do not say that every tree is built from finitely many nodes. +The proofs therefore do not establish that recursion terminates for every value of type `Tree`. + +## Checking Membership {#checking-membership} + +The recursive function `contains` specifies whether a value occurs at the root or in either subtree: + + + +The procedure `contains_value` checks the root, then searches the subtrees until it finds the value. +It needs no ordering assumption on its input: + + + +Each recursive call gives the membership result for its subtree. +Combining those results with the comparison at the root proves the caller's postcondition. + +## Finding the Minimum and Maximum {#finding-extrema} + +Both queries require a nonempty tree satisfying `is_bst`: + + + +The predicate requires both subtrees to be ordered, with all left values below the root and all right values above it. + +### Minimum {#finding-the-minimum} + +The function `min_value` follows left children: + + + +The procedure `get_min` finds this minimum: + + + +If the left child is empty, the root is the minimum. +Otherwise, the recursive call gives the minimum of the nonempty left child. +By `is_bst`, that value is also smaller than the root and every member of the right subtree. + +### Maximum {#finding-the-maximum} + +The function `max_value` follows right children: + + + +The procedure `get_max` verifies that this value is the largest member: + + + +The proof mirrors the minimum query, using the right child's specification and the ordering of the left subtree. + +## Inserting a Value {#inserting-a-value} + +The procedure `insert_value` adds the supplied value to a tree satisfying `is_bst`. +Its two `post` clauses require the result to remain ordered and describe exactly which values it contains: + + + +The recursive call tells us which values are in the modified child and that they are ordered. +The comparison with the root ensures that rebuilding the parent preserves `is_bst`. +The result contains exactly the old members together with the inserted value. + +The complete source also includes `insert_example`, which inserts `4`, `2`, `8`, and `6`, then uses these specifications to check membership, minimum `2`, and maximum `8`. + +## See Also + +- [Left Padding](/docs/getting-started/zoo?q=Left+Padding) verifies that padding preserves the original list as a suffix. +- [Symbolic list operations](/docs/getting-started/zoo?q=Symbolic+List+Operations) uses constructors, selectors, and recursive specifications for linked lists. + +## References + +- + Introduces binary search trees as an implementation of ordered symbol tables. + + +- + Introduces native SMT datatypes using a binary tree and explains their constructor and finiteness properties. + + +- [Domains](../../heyvl/domains.md) explains how to declare types, functions, and axioms in HeyVL. +- [Boolean procedure specifications](../../heyvl/procs.md#embedding-boolean-specifications) explains the `pre ?(...)` and `post ?(...)` notation used by the tree operations. diff --git a/website/docs/getting-started/zoo/bounded-retransmission.mdx b/website/docs/getting-started/zoo/bounded-retransmission.mdx new file mode 100644 index 00000000..6730c2b1 --- /dev/null +++ b/website/docs/getting-started/zoo/bounded-retransmission.mdx @@ -0,0 +1,256 @@ +--- +title: Bounded Retransmission Protocol +description: Bound message failure and failed transmissions, then examine packet-level retries and optional abstract packet-sequence proofs. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import ExecutionDiagram from '@site/src/heyvl-examples/figures/ExecutionDiagram'; +import combinedSource from '@site/../tests/case-studies/brp/combined.heyvl?raw'; +import combinedDownload from '@site/../tests/case-studies/brp/combined.heyvl?download'; +import terminationSource from '@site/../tests/case-studies/brp/termination.heyvl?raw'; +import terminationDownload from '@site/../tests/case-studies/brp/termination.heyvl?download'; +import successSource from '@site/../tests/case-studies/brp/success.heyvl?raw'; +import successDownload from '@site/../tests/case-studies/brp/success.heyvl?download'; +import failedSource from '@site/../tests/case-studies/brp/failed.heyvl?raw'; +import failedDownload from '@site/../tests/case-studies/brp/failed.heyvl?download'; +import sentSource from '@site/../tests/case-studies/brp/sent.heyvl?raw'; +import sentDownload from '@site/../tests/case-studies/brp/sent.heyvl?download'; + +export const references = { + toolpaper: { + ...sources.caesar2026, + locator: "Figure 1", + }, + thesis: { + ...sources.vanJaarsveld2025, + href: "https://essay.utwente.nl/fileshare/file/106318/vanJaarsveld_MA_EEMCS.pdf", + locator: "Chapters 4–6", + }, + protocol: sources.dataLinkProtocol1994, + refinement: sources.successiveRefinements2001, + heyvl: { + ...sources.heyvl2023, + href: "https://arxiv.org/abs/2309.07781", + locator: "§4", + }, +}; + + + +A sender retries a packet if no acknowledgement arrives. +The *bounded retransmission protocol* gives each packet a limited number of transmission attempts . +If all attempts for one packet fail, the sender abandons the remaining packets. + +How likely is success, and how many attempts are made on average? +We first bound message failure and failed attempts in a complete retry loop, then examine the probability and cost of retrying an individual packet. +The [optional final section](#an-abstract-model-of-packet-delivery) studies packet sequences that summarize each packet attempt by one probabilistic step. + +## A Complete Message in One Loop {#combined-message} + +The following model sends `packets` packets, allowing at most `maxTries` transmission attempts per packet . +Each attempt independently succeeds with probability $0.99$. +Success means that the packet arrives and its acknowledgement returns. + +### Probability of Abandoning the Message {#message-failure} + +For `maxTries > 0`, we bound the probability of exhausting a packet's retry limit. + + + +After each successful transmission, `sent` increases and `fail` resets to zero, giving the next packet its full retry allowance. +The counter `totalFail` keeps failures across all packets. +At exit, `fail == maxTries` means that the sender abandoned the message. +The loop makes at most `packets * maxTries` transmissions, so it always terminates. + +One packet fails all $m=\mathtt{maxTries}$ attempts with probability $0.01^m$. +Successfully sending all $n=\mathtt{packets}$ packets therefore has probability $(1-0.01^m)^n$. +The `coproc` specification verifies the complementary upper bound + +$$ +\Pr(\mathtt{fail}=m)\le 1-\bigl(1-0.01^m\bigr)^n. +$$ + +For `packets == 0`, no transmission is made and the bound is zero. + +The invariant uses probability one when the current packet has exhausted its attempts and zero when all packets have been sent. +While transmission continues, the factor `1 - pow(0.01, maxTries - fail)` is the current packet's success probability within its remaining attempts. +The factor `pow(1 - pow(0.01, maxTries), (packets - sent) - 1)` covers all later packets. +Their product gives the success probability for the whole message. +Subtracting it from one gives the remaining failure probability. + +### Expected Number of Failed Attempts {#message-failed-transmissions} + +The next procedure bounds the expected number of failed attempts across the whole message. +The excerpt shows its specification and invariant for the same transmission loop. + + + +Caesar verifies + +$$ +\mathbb{E}[\mathtt{totalFail}]\le 0.01\cdot m\cdot n. +$$ + +The counter includes failed attempts before a later success. +The bound allows all $n\cdot m$ transmission slots, although successful delivery or abandoning the message can leave some unused. +It also applies when either input is zero. + +The invariant retains `totalFail` and adds an allowance of $0.01$ for each remaining transmission slot. +The term `maxTries * (packets - sent) - fail` removes slots already consumed on the current packet. +A failed transmission consumes one slot and increments the counter; a success can discard the unused slots of that packet. +The expected counter increase is therefore covered by the decrease in the allowance. + +## Packet-Level Retry Proofs {#retrying-one-packet} + +The following variants isolate the retry loop for one packet, then combine these retries in a nested message loop. +The transmission probability `p()` and retry limit `MAX()` are symbolic . + + + +Each transmission succeeds independently with probability `p()`, where $0\le\mathtt{p}()\le1$. +The procedure `sendPacket` stops after the first success or after `MAX()` failures, with `MAX()` a nonnegative integer. +With `MAX() == 0`, it makes no attempt and returns `success == false`. + + + +### Success Probability for One Packet {#packet-success} + +Caesar verifies a success probability of at least `packet_success()`, defined as `1 - pow(1 - p(), MAX())`. + + + +The loop makes at most `MAX()` attempts, so the [`@wlp` annotation](../../proof-rules/approximations.md#calculus-annotations) gives a bound on success probability without requiring a separate termination proof. +The [`@invariant` annotation](../../proof-rules/induction.md) uses probability one after success and `1 - pow(1 - p(), MAX() - failed)` for success within the remaining attempts. +With $m>0$ attempts remaining and $p=\mathtt{p}()$, its preservation follows from + +$$ +p+(1-p)\cdot\bigl(1-(1-p)^{m-1}\bigr)=1-(1-p)^m. +$$ + +If all attempts fail, the bound is zero. + + + +### Success Probability for All Packets {#success-probability} + +The procedure `BRP` applies the retry loop to each of $N$ packets, stopping when all succeed or one uses all its attempts without success. +Caesar verifies a probability of at least $\mathtt{packet\_success}()^N$ for successfully sending the whole sequence. + + + +The outer invariant uses `pow(packet_success(), N - sent)` for all unsent packets and becomes zero after a packet fails. +The inner invariant multiplies the current packet's success bound by `pow(packet_success(), (N - sent) - 1)` for all later packets. + +There are at most $N$ packet attempts, each with at most `MAX()` transmissions, so the loop terminates. +For $N=0$, no packet is attempted and `success` remains true. + +For `p() == 0.99`, `MAX() == maxTries`, and `N == packets`, this success bound is the complement of the failure bound in the [single-loop model](#message-failure). + +### Expected Number of Transmission Attempts {#expected-iterations} + +When `p() > 0`, Caesar verifies that the expected number of transmission attempts for one packet is at most `MAX() ⊓ (1 / p())`. + + + +With the [`@ert` annotation](../../proof-rules/approximations.md#calculus-annotations), one `reward 1` per transmission makes the expected cost count transmission attempts. +At most `MAX() - failed` further attempts are possible. +Writing $p=\mathtt{p}()$, the expected number of attempts until success without a retry limit is $1/p$, since + +$$ +1+(1-p)\cdot\frac{1}{p}=\frac{1}{p}. +$$ + +The invariant bounds the remaining attempts by both quantities, and success ends the wait. +With `MAX() == 0`, the bound is zero. + +### Expected Number of Failed Attempts {#transmission-counts} + +Caesar verifies that the expected number of unsuccessful transmission attempts, recorded by `failed`, is at most `MAX() * (1 - p())`. + + + +While retrying, `(1 - p()) * (MAX() - failed)` bounds further failures by allowing every remaining transmission, even though success can stop the loop earlier. +At exit, the invariant equals `failed`. + +## Optional: Abstract Packet Sequences {#an-abstract-model-of-packet-delivery} + +The remaining `BRP` procedures summarize each packet attempt by one `flip(s())`, without tracking individual retries . +The packet success probability satisfies $0\le\mathtt{s}()\le1$ and is not related to `p()` or `MAX()` in these files. + +These procedures stop after $N$ successful packet attempts or the first failure. +Thus, they make at most $N$ packet attempts, with no attempt when $N=0$. + +### Expected Number of Packet Attempts {#expected-packet-attempts} + +When `s() < 1`, Caesar verifies that the expected number of packet attempts is at most `N ⊓ (1 / (1 - s()))`. + + + +Here one `reward 1` counts a whole packet attempt, including an unsuccessful final attempt. +At most `N - sent` further packets can be attempted. +Writing $s=\mathtt{s}()$, waiting for the first failed packet attempt with no packet limit has expected cost $1/(1-s)$. +One attempt adds one reward unit and continues with probability `s()`, so preservation uses $1+s/(1-s)=1/(1-s)$. +Completing all packets can stop the sequence sooner. +In particular, the bound is zero for $N=0$. + +### Expected Number of Sent Packets {#delivered-packets} + +Caesar verifies that the expected number of successfully sent packets, recorded by `sent`, is at most `N * s()`. + + + +The term `s() * (N - sent)` bounds further successes by allowing all remaining packet attempts, even though the first failure stops the sequence. + +### Fixed Cost per Packet Attempt {#accumulated-cost} + +In `failed.heyvl`, each packet attempt adds the fixed nonnegative integer `f()` to `totalFailed`, including an unsuccessful attempt. +The file does not relate `f()` to individual transmission failures. +Caesar verifies that the expected value of this counter is at most `N * f()`. + + + +Every packet attempt either increments `sent` or stops the sequence, so `f() * (N - sent)` covers all remaining cost. + +## See Also + +- [Zeroconf Address Allocation](./zeroconf.mdx) bounds collision-detection probabilities after a fixed number of probes. +- [Geometric Loop](./geometric-loop.mdx) shows how invariants bound a repeated coin-flipping process. + +## References + +- + Presents the single-loop message model and its failure specification. + The complete proof in the accompanying artifact supplies the failure invariant and the generic boundedness axiom for powers used here. + + +- + Develops the two models, their bounds, and the original HeyVL proofs, available in the [companion artifact](https://doi.org/10.5281/zenodo.15408743). + + +- + Specifies the protocol and verifies it in Coq. + + +- + The [PRISM BRP case study](https://www.prismmodelchecker.org/casestudies/brp.php) provides the corresponding model with separate sender, receiver, data channel, and acknowledgment channel. + + +- + Explains the HeyVL encodings of weakest preexpectations and weakest liberal preexpectations used by these proofs. + diff --git a/website/docs/getting-started/zoo/conditioning.mdx b/website/docs/getting-started/zoo/conditioning.mdx new file mode 100644 index 00000000..044f9c9b --- /dev/null +++ b/website/docs/getting-started/zoo/conditioning.mdx @@ -0,0 +1,129 @@ +--- +title: Conditioning on Queue Completion +description: Bound the expected rounds until an unbounded queue empties, conditioned on completing before the server fails. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/conditioning.heyvl?raw'; +import download from '@site/../tests/case-studies/conditioning.heyvl?download'; + +export const references = { + queue: {...sources.queueDisasters2014, locator: 'Section 2'}, + conditioning: sources.conditioning2018, +}; + + + +A server processes a queue while new jobs arrive, and it can fail before the queue empties. +For $n$ initial jobs, we prove at most $5\cdot n/3$ rounds on average, conditioned on completing before failure. +For any positive initial size, successful runs can still reach arbitrarily large queues and take arbitrarily many rounds. + +## Queue Example + +Each round fails with probability $1/5$; otherwise, an arrival or service completion occurs with equal probability. +We stop at failure or an empty queue, using a discrete version of a queue with disasters . + +```heyvl title="Queue conditioned on completing before failure" +proc observed_queue(initial: UInt) -> (pending: UInt, rounds: UInt, healthy: Bool) { + pending = initial + rounds = 0 + healthy = true + while pending > 0 && healthy { + rounds = rounds + 1 + healthy = flip(4/5) + if healthy { + var arrival: Bool = flip(1/2) + if arrival { pending = pending + 1 } + else { pending = pending - 1 } + } + } + assert ?(healthy) +} +``` + +The final [`assert`](../../heyvl/statements.md#assert-and-assume) gives failed runs zero contribution. +Call emptying the queue before failure *success*, and let $R$ be the final round count and $n$ the input `initial`. + +## Encode Conditional Expected Values + +For $f\ge0$ and a program $C$ with observations but no nondeterministic choices, use : + +$$ +\operatorname{cwp}\llbracket C\rrbracket(f) +=\frac{\operatorname{wp}\llbracket C\rrbracket(f)} + {\operatorname{wlp}\llbracket C\rrbracket(1)} +\le\frac UL. +$$ + +Verify the same inputs, program body, and observations against two specifications: + +- $\operatorname{wp}\llbracket C\rrbracket(f)\le U$: `@wp coproc` with `pre U`, `post f`. +- $0 + +### Bound the Denominator + +The probability proof uses the queue updates from `observed_queue` with this specification and annotation: + + + +The final `assert ?(healthy)` retains successful runs, and `post 1` counts them. +Consequently, + +$$ +\operatorname{wlp}\llbracket C\rrbracket(1) +=\Pr(\text{success})\ge2^{-n}>0, +$$ + +where $C$ is `observed_queue`. +Each round fails with probability $1/5$, so nontermination has probability zero. +Thus $L=2^{-n}$. + +### Bound the Numerator + +Next, bound the rounds contributed by successful runs: + + + +With the observation, `post rounds` measures $\mathbb E[R\cdot[\text{success}]]$. +The invariant is zero after failure and equals `rounds` at successful exit. +The procedure proves + +$$ +\mathbb E[R\cdot[\text{success}]] +\le U=2^{-n}\cdot\frac{5\cdot n}{3}. +$$ + +Dividing by the positive denominator bound gives + +$$ +\mathbb E[R\mid\text{success}] +\le\frac{2^{-n}\cdot(5\cdot n/3)}{2^{-n}} +=\frac{5\cdot n}{3}. +$$ + +For three initial jobs, this is at most five rounds on average among successful runs. + +## References + +- Queueing context; our program stops at the first failure or empty queue and counts discrete rounds. +- Conditioning as a ratio of weakest preexpectations. diff --git a/website/docs/getting-started/zoo/coupon-collector.mdx b/website/docs/getting-started/zoo/coupon-collector.mdx new file mode 100644 index 00000000..2d8d5c91 --- /dev/null +++ b/website/docs/getting-started/zoo/coupon-collector.mdx @@ -0,0 +1,158 @@ +--- +title: Coupon Collector +description: An upper bound on the expected number of draws needed to collect every coupon. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/coupon-collector.heyvl?raw'; +import download from '@site/../tests/case-studies/coupon-collector.heyvl?download'; +import uniformSource from '@site/../tests/case-studies/coupon-collector-uniform.heyvl?raw'; +import uniformDownload from '@site/../tests/case-studies/coupon-collector-uniform.heyvl?download'; +import manualDownload from '@site/../tests/case-studies/coupon-collector-manual.heyvl?download'; + +export const references = { + background: sources.couponCollector, + runtime2016: { + ...sources.expectedRuntime2016, + href: "https://users.dcc.uchile.cl/~folmedo/pubs/2016.ESOP.pdf#page=23", + locator: "§7.2", + }, + runtime2018: { + ...sources.expectedRuntime2018, + href: "https://discovery.ucl.ac.uk/id/eprint/10089685/1/main.pdf#page=33", + locator: "§9.1", + }, + heyvl: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781#page=2", + locator: "Example 1.2 and Figure 3", + }, +}; + + + +Completing a set of coupons from cereal boxes can take many draws because the same coupon may appear repeatedly. +The *coupon collector's problem* models this process with $N\ge1$ different coupons, each equally likely on every independent draw . + +As the collection grows, a draw is less likely to find a new coupon. +How many draws are needed on average to collect all $N$ coupons? +We count every draw with `tick 1`, including one that finds a new coupon. + +## The Program + +The variable `x` counts how many coupons are still missing. +A draw finds a new coupon with probability `x / N`, so we use `flip(x / N)` to decide whether this happens. +We only record whether the coupon is new, without choosing a coupon number. + +The inner loop draws until it finds a coupon not yet in the collection. +The outer loop repeats this until the collection is complete, decreasing `x` after each new coupon. + +We verify that the expected number of draws is at most $N\cdot H_N$, where $H_N=\sum_{j=1}^{N}1/j$ is the $N$-th harmonic number, written `harmonic(N)` in the source. + + + +## Verification {#expected-number-of-draws-to-collect-every-type} + +The clause `pre !?(N > 0)` restricts the claim to positive `N`, and `pre N * harmonic(N)` supplies the bound. + +The two highlighted [`@invariant`](../../proof-rules/induction.md) annotations bound the draws still needed at the outer and inner loops. +We first check the inner loop, whose bound is then used to verify the outer loop. + +### Finding One New Coupon {#waiting-for-one-new-type} + +The inner loop waits for a new coupon using this invariant: + + + +For $0 0'} title="Invariant for collecting the remaining coupons" /> + +The term `N * harmonic(x)` bounds the draws needed for all `x` missing coupons. +The condition `x <= N` ensures that `flip(x / N)` uses a valid probability. + +For $x>0$, the term `N * harmonic(x)` combines the bounds for the next new coupon and all later coupons: + +$$ +\frac{N}{x}+N\cdot H_{x-1}=N\cdot H_x. +$$ + +After the inner loop finds a new coupon, the expected number of remaining draws is at most $N\cdot H_{x-1}$. +Updating `x` to `x - 1` makes this the outer invariant for the new value of `x`. + +- **Initialization:** `x == N` gives the specified bound. +- **Exit:** at `x == 0`, `harmonic(0) == 0` gives the zero bound required by `post 0`. + +## Explicit Uniform Draws {#uniform-draws} + +We replace `flip(x / N)` with a sampler that draws uniformly from `1` through `N`. +Labels `1` through `x` represent the missing coupons, so `found_new = coupon <= x` records whether the draw is new. +The surrounding collection loops are unchanged, so the excerpt shows only one draw and its sampling loop. + + + +Starting at `coupon = N`, the sampler accepts each candidate with probability `1 / coupon` and otherwise tries the next smaller index, with `1` as the fallback. +For each index $j$, reaching it has probability $j/N$, so selecting it has probability $(j/N)\cdot(1/j)=1/N$. +Its internal flips add no ticks, so the same $N\cdot H_N$ bound still counts coupon draws. + +The term `N / x` bounds the further draws needed after a duplicate, while `N * harmonic(x - 1)` covers the draws after the next new coupon. +Before selection, $\max(\mathtt{coupon}-x,0)/\mathtt{coupon}$ is the fraction of remaining indices that are duplicates. +After selection, `[coupon > x]` records whether the drawn index is a duplicate. + +At `coupon = N`, adding the preceding tick gives $1+(N-x)/x=N/x$, recovering the waiting cost. +At sampler exit, assigning `found_new = coupon <= x` recovers the invariant for finding the next new coupon. + +## Earlier Version {#original-proof} + +An earlier version uses a specification for uniform sampling and a separate summation lemma. +The [sampling loop above](#uniform-draws) proves the same bound without that lemma or explicit sums. + +## See Also + +- [Geometric Loop](./geometric-loop.mdx) bounds the expected number of tails before the first heads. +- [One-Sided Random Walks](./one-sided-random-walks.mdx#countdown-termination) distinguishes almost-sure termination from a finite expected number of iterations. +- [Bounded Retransmission Protocol](./bounded-retransmission.mdx) uses nested retry loops to bound delivery probabilities and costs. + +## References + +- + Introduces the problem and derives the expected total by summing the expected numbers of draws between new coupons. + + +- + +- + Both papers analyze coupon collection with a cost model that also charges for assignments and guard evaluations. + + +- + The paper presents the coupon collector as a HeyVL case study. + diff --git a/website/docs/getting-started/zoo/escaping-spline.mdx b/website/docs/getting-started/zoo/escaping-spline.mdx new file mode 100644 index 00000000..45e5b244 --- /dev/null +++ b/website/docs/getting-started/zoo/escaping-spline.mdx @@ -0,0 +1,110 @@ +--- +title: Escaping Spline +description: Proving almost-sure termination with a state-dependent probability of reaching zero. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/loop-rules/ast2018/escaping_spline.heyvl?raw'; +import download from '@site/../tests/loop-rules/ast2018/escaping_spline.heyvl?download'; +import ExecutionDiagram from '@site/src/heyvl-examples/figures/ExecutionDiagram'; + +export const references = { + termination: { + ...sources.almostSureTermination2018, + href: "https://arxiv.org/abs/1711.03588", + locator: "§5.4", + }, +}; + + + + + +The *escaping spline* becomes less likely to stop after each unsuccessful attempt . +While its position `x` is positive, each iteration jumps to zero with probability $1/(x+1)$ and otherwise increases `x` by one. +Does the loop still terminate with probability one? + + + +## The Program + +The procedure starts at the nonnegative integer `init_x` and repeats this step while `x` is positive. + +```heyvl title="Unannotated HeyVL program" +proc escaping_spline(init_x: UInt) -> (x: UInt) { + x = init_x + while x > 0 { + var stop: Bool = flip(1 / (x + 1)) + if stop { + x = 0 + } else { + x = x + 1 + } + } +} +``` + +If `init_x` is zero, the loop performs no iterations. + +## Verification {#almost-sure-termination} + +With the [`@wp` annotation](../../heyvl/procs.md) and postexpectation `1`, the weakest preexpectation is the termination probability. +Caesar verifies `pre 1`, establishing almost-sure termination (termination with probability one) for every `init_x`. + +The [`@ast` annotation](../../proof-rules/ast.md) uses variant `x`: + + + +For the highlighted annotation, Caesar checks: + +- **Progress:** for positive integer `x`, the jump to zero decreases the variant by at least one with probability `1/(x+1)`. +- **Expected variant:** one iteration does not increase its expected value: + + $$ + \frac{1}{x+1}\cdot 0+\frac{x}{x+1}\cdot(x+1)=x. + $$ + +The functions `1/(v+1)` and `1` are positive and nonincreasing for $v\ge0$, with `1/(v+1) <= 1`. + +## Expected Number of Iterations {#stopping-probability-and-waiting-time} + +Almost-sure termination alone does not imply a finite expected number of iterations. +For this loop, the separate calculation below shows that the expected number is infinite whenever the initial value is positive. + +Starting at $m>0$, let $T$ count the loop iterations. +Executing more than $n$ iterations requires $n$ consecutive increments: + +$$ +\Pr(T>n)=\prod_{k=0}^{n-1}\frac{m+k}{m+k+1}=\frac{m}{m+n} +\qquad(n\ge 0). +$$ + +Summing these probabilities gives the expected number of iterations: + +$$ +\mathbb{E}[T]=\sum_{n=0}^{\infty}\Pr(T>n) +=\sum_{n=0}^{\infty}\frac{m}{m+n}=\infty. +$$ + +The harmonic series diverges, so the loop is not [positively almost-surely terminating](../../proof-rules/past.md) for $m>0$. + +## See Also + +- [One-Sided Random Walks](./one-sided-random-walks.mdx) starts with a constant probability of making progress. +- [Two-Sided Random Walks](./two-sided-random-walks.mdx) studies other members of this family, with steps toward or away from a target and adversarial choices. + +## References + +- + Proves almost-sure termination of the escaping spline using a state-dependent probability of progress. + diff --git a/website/docs/getting-started/zoo/fast-dice-roller.mdx b/website/docs/getting-started/zoo/fast-dice-roller.mdx new file mode 100644 index 00000000..b5919e2f --- /dev/null +++ b/website/docs/getting-started/zoo/fast-dice-roller.mdx @@ -0,0 +1,474 @@ +--- +title: Fast Dice Roller +description: Compare rejection sampling and Fast Dice Roller, then prove uniformity from fair bits for every positive range size. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +toc_max_heading_level: 4 +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import FastDiceRollerPrefix from '@site/src/heyvl-examples/figures/FastDiceRollerPrefix'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import slowSource from '@site/../tests/case-studies/slow-dice-roller.heyvl?raw'; +import slowDownload from '@site/../tests/case-studies/slow-dice-roller.heyvl?download'; +import bitsSource from '@site/../tests/case-studies/power-of-two-sampling.heyvl?raw'; +import bitsDownload from '@site/../tests/case-studies/power-of-two-sampling.heyvl?download'; +import source from '@site/../tests/case-studies/fast-dice-roller.heyvl?raw'; +import download from '@site/../tests/case-studies/fast-dice-roller.heyvl?download'; + +export const references = { + algorithm: {...sources.fastDiceRoller2013, href: 'https://arxiv.org/html/1304.1916#S1', locator: '§1'}, + termination: sources.almostSureTermination2018, +}; + + + +Given a positive natural number `n`, we want to use fair coin flips to return each integer from `0` through `n - 1` with probability $1/n$. +We develop and verify three samplers: + +1. [Binary sampling](#sampling-from-a-power-of-two-range) builds an integer from a fixed number of bits. +2. [Slow Dice Roller](#slow-dice-roller) rejects out-of-range results and starts over. +3. [Fast Dice Roller](#fast-dice-roller) reuses the randomness in rejected results . + +## Sampling from a Power-of-Two Range + +### Program + +Three fair coin flips give eight equally likely bit strings, `000` through `111`, representing the integers zero through seven. + +Let $m\in\mathbb N$ be the number of coin flips. +Starting from `result = 0`, each flip doubles `result` and adds the new bit. +The counter `left` records the remaining flips. + +```heyvl title="Binary sampling without proof annotations" +proc sample_bits(m: UInt) -> (result: UInt) +{ + result = 0 + var left: UInt = m + while left > 0 { + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + } +} +``` + +### Verification + +Fix $k\in\mathbb N$ such that $k<2^m$, and let $C$ be `sample_bits(m)`. +We prove $\Pr(C\text{ returns }k)=1/2^m$. + +#### Upper Bound + +The `@wp coproc` specification checks $\operatorname{wp}\llbracket C\rrbracket([\mathtt{result}=k])\le1/2^m$. +The example's helper function `pow2(m)` represents $2^m$. + + 0', highlight: '3-5,10-13', +}]} /> + +The remaining `left` bits give $2^{\mathtt{left}}$ equally likely completions of `result`, yielding the invariant + +$$ +I(\mathtt{result},\mathtt{left})=[\mathtt{result}\cdot2^{\mathtt{left}}\le k<(\mathtt{result}+1)\cdot2^{\mathtt{left}}] +\cdot\frac1{2^{\mathtt{left}}}. +$$ + +For $\mathtt{left}>0$, the loop body $B$ selects one of the interval's two halves: + +$$ +\begin{aligned} +&\operatorname{wp}\llbracket B\rrbracket(I)\\ +={}&\tfrac12\cdot I(2\cdot\mathtt{result},\mathtt{left}-1)\\ +&+\tfrac12\cdot I(2\cdot\mathtt{result}+1,\mathtt{left}-1)\\ +={}&I(\mathtt{result},\mathtt{left}) +&&\text{(the halves partition the interval)}. +\end{aligned} +$$ + +The initial and final values are + +$$ +I(0,m)=\frac1{2^m}, +\qquad +I(\mathtt{result},0)=[\mathtt{result}=k]. +$$ + +[Park induction](../../proof-rules/induction.md) therefore gives the specified upper bound. + +#### Lower Bound + +Since $B$ terminates, $\operatorname{wlp}\llbracket B\rrbracket(I)=I$ for $\mathtt{left}>0$. +Park coinduction gives $\operatorname{wlp}\llbracket C\rrbracket([\mathtt{result}=k])\ge1/2^m$. + + + +#### Termination + +The counter `left` decreases from $m$ to zero, so the loop terminates after exactly $m$ iterations. +The [`@ast`](../../proof-rules/ast.md) annotation checks $\operatorname{wp}\llbracket C\rrbracket(1)=1$ using $\mathtt{left}$ as its variant: + + 0', highlight: '3-4,9', +}]} /> + +#### Exact Probability + +Termination gives the equality in + +$$ +\frac1{2^m} +\le\operatorname{wlp}\llbracket C\rrbracket([\mathtt{result}=k]) +=\operatorname{wp}\llbracket C\rrbracket([\mathtt{result}=k]) +\le\frac1{2^m}. +$$ + +## Slow Dice Roller + +### Program + +To sample from zero through five, draw a three-bit number and accept it if it is below six. +On six or seven, discard the attempt and start over. +This *rejection sampling* extends the binary sampler to any positive range size `n`. + +The program first computes `width`, the smallest power of two at least `n`, and `bits`, the number of flips needed to sample that range. +Each attempt resets `result` to zero, samples `bits` fair bits, and accepts if `result < n`. + +```heyvl title="Slow Dice Roller without proof annotations" +proc slow_dice_roller(n: UInt) -> (result: UInt) +{ + var width: UInt = 1 + var bits: UInt = 0 + while width < n { + width = 2 * width + bits = bits + 1 + } + + result = 0 + var done: Bool = false + while !done { + result = 0 + var left: UInt = bits + while left > 0 { + var bit: Bool = flip(1/2) + result = 2 * result + ite(bit, 1, 0) + left = left - 1 + } + if result < n { + done = true + } else {} + } +} +``` + +### Verification + +Fix $k\in\mathbb N$ with $k + +#### Lower Bound + +Since $A$ terminates after `bits` flips, the same invariant gives $\operatorname{wlp}\llbracket C\rrbracket([\mathtt{result}=k])\ge1/n$ by Park coinduction. + + + +#### Termination + +Preparation terminates because `width` starts at one and doubles until it reaches `n`. +Let $T$ be the total number of coin flips. +Caesar checks $\mathbb E[T]\le2\cdot n$ by counting each flip with `reward 1`: + + + +For $n\ge2$, every attempt uses at least one flip, so nontermination implies $T=\infty$. +The finite expectation gives $\Pr(C\text{ diverges})\le\Pr(T=\infty)=0$. +For $n=1$, it returns immediately. + +#### Exact Probability + +Almost-sure termination gives the equality in + +$$ +\frac1n +\le\operatorname{wlp}\llbracket C\rrbracket([\mathtt{result}=k]) +=\operatorname{wp}\llbracket C\rrbracket([\mathtt{result}=k]) +\le\frac1n. +$$ + +## Fast Dice Roller + +### Program + +Suppose we want one of five outcomes, `0` through `4`. +Three fair flips produce the eight candidates `0` through `7` with equal probability. +[Slow Dice Roller](#slow-dice-roller) accepts `0` through `4` and starts over on `5`, `6`, or `7`. + +Fast Dice Roller subtracts `5` from a rejected value, leaving one of `0`, `1`, or `2`. +Conditional on rejection, those three values are equally likely, so the sampler can keep the value it already has and build on that smaller range . +One fresh bit doubles the range from three values to six, enough to try accepting again. + +In the program, `v` is the size of the current range and `c` is the value held by this run, with $0\le c (result: UInt) +{ + var v: UInt = 1 + var c: UInt = 0 + var done: Bool = n == 1 + result = 0 + while !done { + v = 2 * v + var bit: Bool = flip(1/2) + c = 2 * c + ite(bit, 1, 0) + if v >= n { + if c < n { + result = c + done = true + } else { + v = v - n + c = c - n + } + } else {} + } +} +``` + +Each strip shows one value for every equally likely bit sequence that reaches that flip. +On a recycled tile, the value after the arrow is the starting value of `c` for the next flip. + + + +If the sampler returns on flip 3, each of the five outputs is equally likely because each has one green tile on that strip. +The same holds if it returns on flip 4. + +### Verification {#fast-proof} + +For every positive $n$ and every $k\in\{0,\ldots,n-1\}$, we want + +$$ +\Pr(\text{Fast Dice Roller returns }k)=\frac1n. +$$ + +For $n=1$, the program returns zero immediately. +For $n\ge2$, Caesar checks an upper bound, a lower bound, and almost-sure termination. +The two bounds use the same loop invariant and imply equality once termination is established. + +#### Prefix Sums {#constructing-the-invariants} + +In the figure's “After flip 2” row, the first three tiles $0,1,2$ form a *prefix* of length three. +For a range of size $v$, the prefix of length $t$ is the part to the left of the cut. + +$$ +\underbrace{0,\ldots,t-1}_{\text{prefix}}\quad\big|\quad t,\ldots,v-1. +$$ + +Imagine one run from each value to the left of the cut. +Add their chances of returning $k$. +The HeyVL function `prefix(n, v, t, k)`, written $F(v,t)$, is a candidate for that total. +For $0\le t\le v + +In the annotation, the Boolean condition describes the valid states, and `ite(done, ...)` selects the exit or running expression above. +The `@wp coproc` checks the upper bound on the expectation of $Q$. +The `@wlp proc` in the full source checks the matching lower bound with the same invariant value on valid states. + +The recurrence helpers in the full source are checked separately, including at $t=0$ and $t=v$. +The loop calls them at $t=c$ and $t=c+1$ to supply exactly the two equations used in the subtraction. +Their specifications pass the invariant value through each call, and their empty bodies leave the sampler state unchanged. + +
+Five-outcome example + +For $n=5$, $k=0$, and $v=4$, the first two starting values yield $0,\ldots,3$ on flip 3. +The branch that produces zero contributes $1/2$ to $F(4,2)$. +From the additional start $c=2$, bit zero returns $4$ and bit one recycles $5$ to width $3$ and accumulator $0$. +The recycled state has $D(3,0)=F(3,1)-F(3,0)=1/2$, since its next bit returns zero or one. + +$$ +\begin{aligned} +F(4,2)&=\frac12,\\ +F(4,3)&=\frac{1+1/2}{2}=\frac34,\\ +D(4,2)&=\frac34-\frac12\\ + &=\frac{0+1/2}{2}=\frac14. +\end{aligned} +$$ + +
+ +#### Almost-Sure Termination + +At each continuing loop head, $0\le c. + + + +#### Exact Probability from the Caesar Bounds + +For $n\ge2$, the initial difference is $D(1,0)=F(1,1)-F(1,0)=1/n$. +Under `wp`, divergence contributes zero to the expectation, and under `wlp` it contributes one. +Almost-sure termination makes that contribution zero under both calculi, so the upper and lower bounds meet at $(1+1/n)/2$. +For the initialized sampler $C$, this gives + +$$ +\begin{aligned} +\frac{1+1/n}{2} +&\le \operatorname{wlp}\llbracket C\rrbracket(Q)\\ +&= \operatorname{wp}\llbracket C\rrbracket(Q) &&\text{(almost-sure termination)}\\ +&\le \frac{1+1/n}{2}. +\end{aligned} +$$ + +The expected value of $Q$ is $(1+\Pr(C\text{ returns }k))/2$, since $Q$ gives $1$ on a match and $1/2$ on every other return. +It follows that $\Pr(C\text{ returns }k)=1/n$. + +## See Also + +- [Reservoir Sampling](./reservoir-sampling.mdx) proves uniform selection from a stream using a state-dependent replacement probability. +- [Assertions](../../heyvl/statements.md#assert-and-assume) can discard unwanted samples through conditioning. + +## References + +- The original algorithm and its correctness proof. +- The almost-sure termination rule used by the fast sampler. diff --git a/website/docs/getting-started/zoo/figures.module.css b/website/docs/getting-started/zoo/figures.module.css new file mode 100644 index 00000000..d85de1de --- /dev/null +++ b/website/docs/getting-started/zoo/figures.module.css @@ -0,0 +1,47 @@ +.withFigure { + display: flow-root; + container-type: inline-size; + margin-block: 1.5rem 0.5rem; +} + +.withFigure > p:last-child { + margin-bottom: 0; +} + +.figure { + box-sizing: border-box; + width: min(100%, 22rem); + margin: 0 auto 1.5rem; + padding: 0.9rem; + border: 1px solid var(--ifm-color-emphasis-300); + border-radius: 6px; + background: color-mix(in srgb, var(--caesar-surface-tint) 30%, var(--ifm-background-color)); + break-inside: avoid; +} + +.figure svg { + display: block; + width: 100%; + height: auto; +} + +.figure figcaption { + margin-top: 0.75rem; + padding-top: 0.65rem; + border-top: 1px solid var(--ifm-color-emphasis-200); + color: var(--ifm-color-content-secondary); + font-size: 0.8rem; + line-height: 1.5; +} + +.figure figcaption p { + margin: 0; +} + +@container (min-width: 42rem) { + .figure { + float: right; + width: 21rem; + margin: 0 0 0.5rem 1.75rem; + } +} diff --git a/website/docs/getting-started/zoo/geometric-loop.mdx b/website/docs/getting-started/zoo/geometric-loop.mdx new file mode 100644 index 00000000..9ebe7592 --- /dev/null +++ b/website/docs/getting-started/zoo/geometric-loop.mdx @@ -0,0 +1,187 @@ +--- +title: Geometric Loop +description: Bounds on the expected number of tails before a fair coin first shows heads. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import ExecutionDiagram from '@site/src/heyvl-examples/figures/ExecutionDiagram'; +import UnrollingPlot from '@site/src/heyvl-examples/figures/UnrollingPlot'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import invariantSource from '@site/../tests/loop-rules/induction/geometric.heyvl?raw'; +import invariantDownload from '@site/../tests/loop-rules/induction/geometric.heyvl?download'; +import inductionSource from '@site/../tests/loop-rules/k_induction/geo1.heyvl?raw'; +import inductionDownload from '@site/../tests/loop-rules/k_induction/geo1.heyvl?download'; +import recursiveSource from '@site/../tests/case-studies/geo-recursive.heyvl?raw'; +import recursiveDownload from '@site/../tests/case-studies/geo-recursive.heyvl?download'; +import stoppingSource from '@site/../tests/loop-rules/ost2019/annotated.heyvl?raw'; +import stoppingDownload from '@site/../tests/loop-rules/ost2019/annotated.heyvl?download'; +import refutationSource from '@site/../tests/loop-rules/bmc/refute-geo2_bmc.heyvl?raw'; +import refutationDownload from '@site/../tests/loop-rules/bmc/refute-geo2_bmc.heyvl?download'; + +export const references = { + runtime: { + ...sources.expectedRuntime2016, + href: "https://users.dcc.uchile.cl/~folmedo/pubs/2016.ESOP.pdf#page=2", + locator: "§§1, 7.2", + }, + induction: { + ...sources.kInduction2021, + href: "https://arxiv.org/pdf/2105.14100#page=14", + locator: "Example 2", + }, + stopping: { + ...sources.aimingLow2020, + href: "https://verify.rwth-aachen.de/giesl/papers/POPL2020.pdf#page=18", + locator: "Example 39", + }, +}; + + + +The *geometric loop* makes independent flips of a fair coin until the first heads. +It can make arbitrarily many flips, yet the expected number is finite . +How many tails occur on average before the first heads? + +## The Program + +```heyvl title="Unannotated HeyVL program" +proc geometric(init_count: UInt, init_running: Bool) -> (count: UInt, running: Bool) { + count = init_count + running = init_running + while running { + var stop: Bool = flip(0.5) + if stop { + running = false + } else { + count = count + 1 + } + } +} +``` + + + +Each flip showing tails increments `count`, while heads sets `running` to false. +If `init_running` is false, the loop performs no flips and returns `init_count` unchanged. +An active loop terminates with probability one. + + + +Starting with `count = 0` and `running = true`, the expected counter is one, as the verification below establishes. +The expected number of all flips is two, since it also includes the final heads. +One `tick 1` per flip would measure that second quantity. + +Exactly $k$ tails followed by heads has probability $2^{-(k+1)}$. +Every additional flip showing tails halves the probability of that outcome. + +## Verification + +Caesar first bounds the expected counter from above using Park induction, then verifies a simpler candidate with two-step induction. +The later variants prove a matching lower bound and refute an incorrect upper bound. +Each specification uses [`@wp`](../../proof-rules/approximations.md#calculus-annotations) to select least fixed point semantics, where nontermination contributes zero. + +### Park Induction {#invariant} + +For [Park induction](../../proof-rules/induction.md), the `@invariant` annotation bounds the expected final counter by `count + [running]`. +The term `[running]` bounds the expected number of tails still to come. + + + +From an active state with `count = c`, heads gives invariant value $c$ and tails gives $c+2$. +Their average is $\tfrac12\cdot c+\tfrac12\cdot(c+2)=c+1$, the invariant's value before the iteration. +At exit, the invariant equals the postexpectation `count`. + +### Two-Step Induction {#k-induction} + +The simpler candidate `count + 1` does not check whether the loop is still running. + + + +Its average value grows by one half after one iteration, because even after heads it still adds one to the counter. +Park induction therefore fails for this candidate. + +[Two-step induction](../../proof-rules/induction.md#using-k-induction), selected by the `@k_induction(2, count + 1)` annotation, checks the loop guard again. +On the heads branch, the loop has finished, so it uses the postexpectation `count` instead of the candidate . +If the loop starts inactive, this upper bound is one above the unchanged counter. + +### Optional Stopping {#optional-stopping} + +The `proc` specification gives the matching lower bound, using the same expectation `count + [running]`. +A subinvariant alone is insufficient, so the [`@ost`](../../proof-rules/ost.md) annotation checks additional side conditions . + + + +- The second argument, `2 * [running]`, bounds the expected number of remaining coin flips by two for an active loop and zero otherwise. +- The third argument, `1`, bounds each iteration's absolute change to the subinvariant. + +The upper and lower bounds match for every initial count and value of `running`. +In particular, an active loop starting at zero has expected count one. + +### Refuting the Upper Bound `init_count + 0.99` {#refutation} + +Finite unrolling can also reject a proposed bound without first computing the exact expectation . +The next variant proposes the upper bound `init_count + 0.99`. + + + + + +For an active loop starting at zero, the [`@unroll(12, 0)`](../../proof-rules/unrolling.md) annotation gives the lower approximation $509/512>0.99$. +The eleventh unfolding is still below the proposed bound. +The twelfth refutes it. + + + +## Recursive Formulation {#recursion} + +The same coin-flipping process can be written using recursive calls in place of the loop. +Each call uses the procedure specification to bound the expected number of tails still to come. + + + +An inactive call returns the counter unchanged, while an active call increases it by at most one in expectation over the entire recursive execution. +The verified upper bound is the same as for Park induction. + +## See Also + +- [Coupon Collector](./coupon-collector.mdx) bounds the expected number of draws needed to collect each new coupon. +- [One-Sided Random Walks](./one-sided-random-walks.mdx) generalizes waiting for one head to several required heads and bounds the total number of coin flips. + +## References + +- + Explains why arbitrarily long executions can have finite expected runtimes and analyzes the coupon collector. + + +- + The geometric loop demonstrates an upper bound that requires two-step induction. + + +- + The paper proves the lower bound by optional stopping. + diff --git a/website/docs/getting-started/zoo/morris-counting.mdx b/website/docs/getting-started/zoo/morris-counting.mdx new file mode 100644 index 00000000..0f442bb4 --- /dev/null +++ b/website/docs/getting-started/zoo/morris-counting.mdx @@ -0,0 +1,100 @@ +--- +title: Morris Approximate Counting +description: Bound the expected estimate returned by Morris's approximate counting algorithm. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/morris-counting.heyvl?raw'; +import download from '@site/../tests/case-studies/morris-counting.heyvl?download'; + +export const references = { + original: sources.morris1978, + analysis: { + ...sources.approximateCounting2022, + href: "https://arxiv.org/pdf/2010.02116#page=4", + locator: "§1.2", + }, +}; + + + +An exact counter increments after every event. +*Morris counting* instead increments a counter `c` with probability $2^{-c}$ and estimates the number of events by $2^c-1$ . +As the counter grows, increments become rarer and represent larger changes to the estimate. + +How does a counter that often ignores an event still track the number of events in expectation? +We verify that after `n` events, the expected estimate is at most `n`. + +## The Program + +The function `exp2(c)` represents $2^c$ using the domain axioms explained below. +The variable `remaining` counts the events still to process. +Each iteration processes one event and increments `c` with probability `1/exp2(c)`. + + + +The `@wp coproc` specification bounds the expected final value of `exp2(c)` by `n + 1`. +The loop terminates after exactly `n` iterations because `remaining` decreases from `n` to zero. +Subtracting one gives the stated bound on the estimate: + +$$ +\mathbb{E}(2^c-1)\le n. +$$ + +The proof covers every unsigned input `n`, including zero. + +## Why the Invariant Works + +The [`@invariant`](../../proof-rules/induction.md) annotation uses `exp2(c) + remaining`. +The first term is the current estimate plus one, and the second allows an expected increase of one for each remaining event. + +Suppose the current value of `exp2(c)` is $z=2^c$. +Incrementing `c` doubles it to $2\cdot z$, while leaving `c` unchanged keeps it at $z$. +The expected value after the event is + +$$ +\frac1z\cdot2\cdot z+\left(1-\frac1z\right)\cdot z=z+1. +$$ + +At the same time, `remaining` decreases by one, preserving the invariant in expectation. +Initially `exp2(0) == 1`, giving `n + 1`. +At exit, `remaining == 0`, leaving the postexpectation `exp2(c)`. + +## Axioms for Exponentiation + +The [domain declaration](../../heyvl/domains.md) supplies the equations needed to relate the state-dependent probability to the change in the estimate. + + + +The base and recurrence equations describe powers of two on natural exponents. +The additional axiom `exp2(c) >= 1` lets the solver establish that `1/exp2(c)` lies between zero and one. +These axioms hold for the intended interpretation `exp2(c) = 2^c`. + +The verified specification establishes an upper bound on the expected estimate. +For the algorithm's exact mean, variance, and space analysis, see the literature . + +## See Also + +- [Reservoir Sampling](./reservoir-sampling.mdx) samples one stream position uniformly using a state-dependent replacement probability. +- [Coupon Collector](./coupon-collector.mdx) combines user-defined functions with an invariant for the expected number of draws. + +## References + +- + Introduces approximate counting with small registers. + + +- + Section 1.2 describes the base-two counter and its expected value and variance. + diff --git a/website/docs/getting-started/zoo/one-sided-random-walks.mdx b/website/docs/getting-started/zoo/one-sided-random-walks.mdx new file mode 100644 index 00000000..676c1e92 --- /dev/null +++ b/website/docs/getting-started/zoo/one-sided-random-walks.mdx @@ -0,0 +1,156 @@ +--- +title: One-Sided Random Walks +description: Termination and expected numbers of coin flips for walks that move toward a target or stay put. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import pastSource from '@site/../tests/loop-rules/past2013/annotated.heyvl?raw'; +import pastDownload from '@site/../tests/loop-rules/past2013/annotated.heyvl?download'; +import astSource from '@site/../tests/loop-rules/ast2018/negative_binomial.heyvl?raw'; +import astDownload from '@site/../tests/loop-rules/ast2018/negative_binomial.heyvl?download'; +import costSource from '@site/../tests/loop-rules/induction/sprdwalk.heyvl?raw'; +import costDownload from '@site/../tests/loop-rules/induction/sprdwalk.heyvl?download'; +import twoStepSource from '@site/../tests/loop-rules/induction/linear01.heyvl?raw'; +import twoStepDownload from '@site/../tests/loop-rules/induction/linear01.heyvl?download'; +import ExecutionDiagram from '@site/src/heyvl-examples/figures/ExecutionDiagram'; + +export const references = { + termination: { + ...sources.almostSureTermination2018, + href: "https://arxiv.org/pdf/1711.03588#page=12", + locator: "§5.1", + }, + heyvl: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781#page=26", + locator: "Table 2", + }, +}; + + + +Obtaining several successes from repeated independent trials may take arbitrarily many attempts. +Our countdown models this with a fair coin: a counter records how many heads are still needed, decreasing on heads and staying unchanged on tails . + +Does the countdown reach zero with probability one, and is the expected number of flips finite? +We prove both properties, then derive numerical bounds for two related walks. + +## Countdown with Pauses {#countdown-termination} + + + +The procedure `countdown` starts at the nonnegative integer `init_x` and stops at zero, when all required heads have occurred. +Each iteration makes one coin flip. + + + +### Almost-Sure Termination {#countdown-ast} + +With `pre 1`, `post 1`, and the [`@ast` annotation](../../proof-rules/ast.md), Caesar proves that the countdown reaches zero with probability one. +The [`@wp` annotation](../../proof-rules/approximations.md#calculus-annotations) selects the calculus in which `post 1` measures the termination probability. + + + +The variant is `x`. +For $x>0$, one iteration decreases it by one with probability $1/2$, and its expected value is + +$$ +\tfrac12\cdot(x-1)+\tfrac12\cdot x=x-\tfrac12\le x. +$$ + +These establish the progress and expected-value conditions of the almost-sure termination rule. + +### Positive Almost-Sure Termination {#past-finite-expected-number-of-coin-flips} + +The countdown charges `reward 1` per flip, and Caesar verifies that the expected number of flips is at most `3 * init_x + 1`. +The [`@past` annotation](../../proof-rules/past.md) proves positive almost-sure termination and supplies this upper bound for the `@ert coproc`. + + + +On heads, the ranking superinvariant `3 * x + 1` drops by $3$. +After charging for the flip, its expected decrease is $\tfrac12\cdot 3 - 1 = \tfrac12$. +It is above the threshold $K=1$ while the loop is active and equals $K$ at exit. + +## Expected Number of Coin Flips to Reach a Target {#forward-walk-cost} + +We now count up to a target instead of counting down to zero. +The procedure `forward_walk` starts at `init_x` and stops when `x >= init_n`. +Each fair coin flip either increases `x` by one or leaves it unchanged. + +With the [`@ert` annotation](../../proof-rules/approximations.md#calculus-annotations), each `tick 1` counts one flip. +The `coproc` specification bounds the expected number of flips by `2 * (init_n - init_x)`. +Subtraction on `UInt` stops at zero, so the bound is zero if the target has already been reached. + + + +The [`@invariant` annotation](../../proof-rules/induction.md) supplies `I = 2 * (n - x)` as a bound on the expected number of coin flips still needed. +Its expected decrease covers the current `tick 1`: + +$$ +1+\tfrac12\cdot(I-2)+\tfrac12\cdot I=I. +$$ + +At exit the invariant is zero, matching `post 0`. + +## Expected Number of Coin Flips with Steps of One or Two {#two-step-countdown-cost} + +The final countdown has no pauses: a biased coin flip decreases `x` by one with probability $1/3$ and by two with probability $2/3$. +It stops when `x` is zero or one, and each flip still counts as one tick. + +The `coproc` specification bounds the expected number of flips by $0.6\cdot\mathtt{init\_x}$. + + + +The `@invariant` annotation supplies $I(x)=0.6\cdot x$, which covers the tick because + +$$ +1+\tfrac13\cdot I(x-1)+\tfrac23\cdot I(x-2)=I(x) +\qquad(x\ge2). +$$ + +At exit, $I(x)\ge0$ bounds `post 0`. + +## See Also + +- [Geometric Loop](./geometric-loop.mdx) is the countdown with pauses when one head is required, counting tails before that head rather than all coin flips. +- [Two-Sided Random Walks](./two-sided-random-walks.mdx) includes steps away from the target and adversarial choices. + +## References + +- + The negative-binomial loop is the countdown with pauses verified using the `@ast` annotation. + + +- + The benchmark `linear01` is the countdown with steps of one or two. + diff --git a/website/docs/getting-started/zoo/rabin-mutual-exclusion.mdx b/website/docs/getting-started/zoo/rabin-mutual-exclusion.mdx new file mode 100644 index 00000000..366418be --- /dev/null +++ b/website/docs/getting-started/zoo/rabin-mutual-exclusion.mdx @@ -0,0 +1,93 @@ +--- +title: Rabin’s Mutual-Exclusion Algorithm +description: An upper bound on the probability that Rabin’s voting stage ends with no survivors. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import nestedSource from '@site/../tests/loop-rules/induction/rabin_hurd2004.heyvl?raw'; +import nestedDownload from '@site/../tests/loop-rules/induction/rabin_hurd2004.heyvl?download'; + +export const references = { + algorithm: sources.mutualExclusion1992, + voting: { + ...sources.guardedCommands2004, + href: "https://cgi.cse.unsw.edu.au/~carrollm/probs/Papers/Hurd-05a.pdf#page=16", + locator: "§4", + }, + heyvl: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781#page=2", + locator: "Example 1.1 and Figure 2", + }, +}; + + + +Mutual exclusion allows only one processor at a time to enter a shared critical section. +We study a sequential model of the voting stage in Rabin’s mutual-exclusion algorithm . +In each *voting round*, every contender flips a fair coin to decide whether to withdraw . +One survivor wins, several survivors vote again, and no survivors means that the election has failed. +How likely is voting to end with no survivors? + +## The Program + +The outer loop runs the voting rounds. +The inner loop makes one withdrawal decision for each contender present at the start of the round. +The variable `i` counts contenders who have not withdrawn, and `n` counts decisions still to be made in the round. + + + +## Verification {#success-bound} + +For `init_i > 1`, the probability of terminating with no survivors is at most $1/3$. + + + +The [`@wlp` annotation](../../proof-rules/approximations.md#calculus-annotations) verifies the complementary lower bound of $2/3$, counting both one survivor and nontermination. +It does not establish that voting terminates. + + + +The outer [`@invariant`](../../proof-rules/induction.md) annotation uses $I=[i=1]+\tfrac23\cdot[i>1]$. + +A round starting with $k\ge2$ contenders leaves zero or one survivors with probabilities $2^{-k}$ and $k\cdot2^{-k}$, respectively. +Its expected invariant value is therefore + +$$ +k\cdot2^{-k} ++\frac23\cdot\left(1-(k+1)\cdot2^{-k}\right) +=\frac23+\frac{k-2}{3\cdot2^k} +\ge\frac23. +$$ + +For `n <= i`, the inner invariant uses `rec_pown_2(n)` for $2^{-n}$. + +- $([i=n]\cdot n+[i=n+1])\cdot2^{-n}$ gives the probability that the round ends with one survivor. + With `i == n`, one remaining contender must stay, whereas with `i == n + 1`, all must withdraw. +- $\tfrac23\cdot(1-([i=n]\cdot(n+1)+[i=n+1])\cdot2^{-n})$ accounts for rounds with at least two survivors. +- `[n <= i]` restricts the calculation to states with enough contenders for the remaining flips. + +## See Also + +- [Two-Sided Random Walks](./two-sided-random-walks.mdx) shows how almost-sure termination is proved separately. +- [Zeroconf Address Allocation](./zeroconf.mdx) verifies a probability bound using specifications for recursive procedures. + +## References + +- + Develops the mutual-exclusion algorithm underlying this voting model. + + +- + Verifies the voting stage using nested-loop invariants. + + +- + Presents the HeyVL encoding and its liberal $2/3$ bound. + diff --git a/website/docs/getting-started/zoo/reservoir-sampling.mdx b/website/docs/getting-started/zoo/reservoir-sampling.mdx new file mode 100644 index 00000000..c086915a --- /dev/null +++ b/website/docs/getting-started/zoo/reservoir-sampling.mdx @@ -0,0 +1,129 @@ +--- +title: Reservoir Sampling +description: Prove that Algorithm R samples each stream position with equal probability. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/reservoir-sampling.heyvl?raw'; +import download from '@site/../tests/case-studies/reservoir-sampling.heyvl?download'; + +export const references = { + algorithm: { + ...sources.reservoirSampling1985, + locator: "§2", + }, +}; + + + +This example uses *reservoir sampling* to choose a uniformly random item from a stream while keeping only one candidate. +For a reservoir of size one, *Algorithm R* selects the first item and replaces the current sample with each later item at position $i$ with probability $1/i$ . +The replacement probability uses only the current position, so the algorithm need not know the final stream length in advance. + +We represent a nonempty stream by its positions `1` through `n` and verify that each position `x` is the final sample with probability exactly $1/n$. +Caesar proves an upper probability bound and a matching lower bound using a loop invariant. +A separate termination proof lets us combine these bounds into an equality. + +## The Program + +The variable `c` holds the selected position, with zero marking the initial state before any item is processed. +The variable `i` is the next position to process. +Each iteration selects that position with probability `1/i`, then advances `i`. +The parameter `x` identifies the position whose final selection probability we want to verify. +It appears only in the specification and invariant, so sampling does not depend on `x`. + + + +The postexpectation `[c == x]` is one when the final sample is `x` and zero otherwise. +Its expected value is therefore the probability of returning `x`. +The `@wp coproc` specification bounds this probability from above by `1/n` for every valid position $1\le x\le n$. +The first `pre` clause expresses this restriction, which also ensures that the stream is nonempty. + +## Why the Invariant Works + +At each loop head, the [`@invariant`](../../proof-rules/induction.md) annotation bounds the probability of eventually returning `x` from the current state. +Its `ite` expression distinguishes whether position `x` is still to come or has already been processed: + +$$ +I(i,c)= +\begin{cases} + 1/n & \text{if } i\le x,\\ + \dfrac{i-1}{n}\cdot[c=x] & \text{if } i>x. +\end{cases} +$$ + +If `i > x`, position `x` has already been processed. +When `c != x`, it cannot be selected again, so its final selection probability is zero. +When `c == x`, it remains the final sample precisely when no later item replaces it. +At each remaining position $j$, the probability of keeping it is $1-1/j$. +The probability of surviving all positions from `i` through `n` is + +$$ +\prod_{j=i}^{n}\left(1-\frac1j\right)=\frac{i-1}{n}. +$$ + +This gives the second case, `((i - 1)/n) * [c == x]`. +At loop exit, `i == n + 1` and there are no remaining positions, so the product is one and this expression equals the postexpectation `[c == x]`. + +If `i <= x`, position `x` has yet to be processed. +It will be selected at iteration `x` with probability $1/x$, then survive the later replacements with probability $x/n$. +Their product is $(1/x)\cdot(x/n)=1/n$, giving the first case. +Iterations before `x` cannot affect this probability because they only choose among earlier positions. +Initially `i == 1`, so this case gives the required upper bound `1/n`. + +The additional condition `1 <= i && i <= n + 1 && c < i` records the valid index range and ensures that `c` is either zero or an earlier position. +Outside these states, `!?(...)` makes the upper invariant infinite, so it imposes no bound there. + +## The Matching Lower Bound + +To prove that `x` is selected with probability at least `1/n`, we reuse the same `ite` expression in a `proc` under [`@wlp`](../../heyvl/procs.md#calculus-annotations). +The invariant uses `?(...) ⊓` to give value zero outside the valid index range, as required for a lower bound. + + + +Under `wlp`, nontermination contributes one to the expected value. +This specification therefore proves that the probability of returning `x` or not terminating is at least $1/n$. +We still need to rule out nontermination to obtain the claimed lower bound on returning `x`. + +## Termination and Uniformity + +The loop processes exactly `n` positions: `i` starts at one and increases by one on every iteration, regardless of the random choice. +The following specification verifies termination with probability one. + + + +The [`@ast`](../../proof-rules/ast.md) annotation uses `(n + 1) - i`, the number of remaining items, as its variant. +It is positive while the guard holds and decreases by one with probability one on every iteration. +Since the program terminates almost surely, `wp` and `wlp` agree. +The verified bounds therefore give + +$$ +\Pr(c=x)\le\frac1n +\quad\text{and}\quad +\Pr(c=x)\ge\frac1n, +$$ + +so every stream position is selected with probability exactly $1/n$. + +## See Also + +- [Morris Counting](./morris-counting.mdx) estimates the number of stream events using a randomized counter. +- [Geometric Loop](./geometric-loop.mdx) combines matching upper and lower bounds on an expected value. + +## References + +- + Section 2 describes Algorithm R for a reservoir of arbitrary size. + This example uses a reservoir containing one item. + diff --git a/website/docs/getting-started/zoo/retry-moments.mdx b/website/docs/getting-started/zoo/retry-moments.mdx new file mode 100644 index 00000000..03c31cc1 --- /dev/null +++ b/website/docs/getting-started/zoo/retry-moments.mdx @@ -0,0 +1,142 @@ +--- +title: Retry Latency and Higher Moments +description: Comparing database retries with the same expected runtime and different variances. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import RetryLatencyPlot from '@site/src/heyvl-examples/figures/RetryLatencyPlot'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/retry-moments.heyvl?raw'; +import download from '@site/../tests/case-studies/retry-moments.heyvl?download'; + +export const references = { + incremental: { + ...sources.incremental2026, + href: "https://arxiv.org/html/2603.02405v1#A2.SS2", + locator: "Appendix B.2", + }, +}; + + + +A web server retries a database request until it succeeds. +Each request takes one second and succeeds independently with probability $1/2$. +Adding a cache takes half a second initially and raises the success probability to $2/3$ . +Both designs take two seconds on average, but does the cache make the response time more predictable? + +## Expected Runtime + +The [`reward`](../../heyvl/statements.md#reward-and-weigh) statement collects the modeled runtime: one second for every request, including the successful one. +Other program statements add no time in this model. +With postexpectation `0`, the [`@wp`](../../heyvl/procs.md) specification bounds the expected accumulated reward. + + + +The invariant `2 * [!done]` bounds the expected remaining runtime by two seconds while requests are still needed. +One iteration incurs one second and leaves another two seconds to be paid with probability $1/2$, giving $1+\tfrac12\cdot2=2$. + +In the cached variant, the expected number of requests is $3/2$. +Its half-second initialization cost brings the same upper bound of two seconds. + + + +## Second Moments + +For runtime $T$, its second moment $\mathbb{E}[T^2]$ measures the expected squared runtime. +Together with the mean, it determines the variance: + +$$ +\operatorname{Var}(T)=\mathbb{E}[T^2]-\mathbb{E}[T]^2. +$$ + +To collect the square incrementally, introduce a fresh ghost variable `tau` that records elapsed time. +The original guards, probabilities, and assignments do not read `tau`. +An additional second increases the square by $(\mathtt{tau}+1)^2-\mathtt{tau}^2=2\cdot\mathtt{tau}+1$. +Replacing `reward 1` by this increment makes the accumulated reward equal $T^2$ on every terminating execution . + +Apply the transformation to every original reward, including initialization costs. + + + +For an unfinished request sequence, the invariant `6 + 4 * tau` bounds the squared-time increments still to come. +One iteration collects `2 * tau + 1` and continues with probability $1/2$: + +$$ +\begin{aligned} +&(2\cdot\mathtt{tau}+1)\\ +&\quad+\tfrac12\cdot\bigl(6+4\cdot(\mathtt{tau}+1)\bigr)\\ +&=6+4\cdot\mathtt{tau}. +\end{aligned} +$$ + +Starting at `tau = 0` gives the verified upper bound of six squared seconds. +On a nonterminating execution, these incremental rewards also grow without bound. +A single `reward tau * tau` after the loop would never be reached on that execution and would collect no reward. + +For the cached design, `tau` starts at `0.5` and `reward 0.25` accounts for the square of the initialization time. +The loop uses the same increments, with an invariant adapted to the larger success probability. + + + +## Comparing the Designs + +The procedures above prove upper bounds on the first two moments. +To determine the variance, we also need matching lower bounds. +We omit those proofs here and use the exact moment values calculated below . + +If each request succeeds independently with probability $0 + +Without caching, $T=K$ and $p=1/2$. +With caching, $T=1/2+K$ and $p=2/3$, so $\mathbb{E}[T^2]=1/4+\mathbb{E}[K]+\mathbb{E}[K^2]$. + +At 1 second, half the uncached requests have finished, while cached requests take at least 1.5 seconds. +At 2.5 seconds, $1/4$ of uncached requests are still waiting, compared with $1/9$ of cached requests. + + + +| Design | Mean runtime | Second moment | Variance | +| --- | --- | --- | --- | +| Without a cache | $2$ s | $6$ s$^2$ | $2$ s$^2$ | +| With a cache | $2$ s | $4.75$ s$^2$ | $0.75$ s$^2$ | + +The cache reduces the variance while preserving the mean. + +## See Also + +- [Geometric Loop](./geometric-loop.mdx) compares upper and lower bounds for the number of unsuccessful coin flips. +- [Programmatic Reward Transformations](/blog/2026/03/04/highly-incremental#programmatic-reward-transformations) explains the general construction and further objectives. + +## References + +- + Introduces the retry/cache comparison and gives the reward transformation, exact moment calculations, and HeyVL proofs. + diff --git a/website/docs/getting-started/zoo/runtime-composition.mdx b/website/docs/getting-started/zoo/runtime-composition.mdx new file mode 100644 index 00000000..ced7e345 --- /dev/null +++ b/website/docs/getting-started/zoo/runtime-composition.mdx @@ -0,0 +1,77 @@ +--- +title: Finite Expected Runtime Does Not Compose +description: A random generator and a countdown each have finite expected runtime, but their composition has infinite expected runtime. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/ert-composition.heyvl?raw'; +import download from '@site/../tests/case-studies/ert-composition.heyvl?download'; + +export const references = { + runtime: { + ...sources.expectedRuntime2016, + href: 'https://users.dcc.uchile.cl/~folmedo/pubs/2016.ESOP.pdf#page=2', + }, +}; + + + +A *generator* starts with a counter of one, doubles it on every flip of a fair coin, and returns it after the first heads. +A *countdown* decrements its input to zero. +Each program has finite expected runtime for every fixed input. +Running the countdown on the generator's output has infinite expected runtime . + +The counter is unbounded, and we count one tick per flip or decrement. +With [`@ert`](../../proof-rules/approximations.md#calculus-annotations) and `post 0`, the specifications bound the expected tick count. + +## The Two Programs + +### The Generator + +Caesar verifies that the generator takes at most two coin flips on average. + + + +### The Countdown + +The countdown takes one tick for each unit of its input, and Caesar verifies the upper bound. + + + +## Their Composition + +Caesar verifies that every natural number is a lower bound on the expected runtime of the composed program. +The expected runtime is therefore infinite. + + + +Stopping on flip $k$ has probability $2^{-k}$ and leaves $2^k$ decrements, so each possible stopping time contributes $2^{-k} \cdot 2^k = 1$ tick to the expected countdown cost. +The generator's [omega invariant](../../proof-rules/omega-invariants.md) adds these contributions, and the countdown's supplies the cost when the generator stops. +The target appears only in the proof, so every bound applies to the same program. + +The composition terminates almost surely because the first heads arrives with probability one and every resulting countdown is finite. + +## References + +- + Introduces the failure of finite expected runtimes to compose and develops expected-runtime reasoning. + The [extended version](https://arxiv.org/pdf/1601.01001#page=17) gives a composition example in Example 6. + diff --git a/website/docs/getting-started/zoo/selection-sort.mdx b/website/docs/getting-started/zoo/selection-sort.mdx new file mode 100644 index 00000000..ff9473fe --- /dev/null +++ b/website/docs/getting-started/zoo/selection-sort.mdx @@ -0,0 +1,72 @@ +--- +title: Selection Sort +description: Verify sortedness and preservation of length using Boolean loop invariants. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import source from '@site/../tests/boolean/algorithms/selection_sort.heyvl?raw'; +import download from '@site/../tests/boolean/algorithms/selection_sort.heyvl?download'; + + + +Selection sort repeatedly finds the smallest remaining element and swaps it into the next position. +Starting with `[3, 2, 5, 1, 4]`, the first pass produces `[1, 2, 5, 3, 4]`, then leaves the first position fixed while sorting the remaining suffix. +How can loop invariants connect these local choices to a nondecreasing output of the same length? + +The example uses [Boolean specifications](../../heyvl/procs.md#embedding-boolean-specifications) and the [`@invariant` annotation](../../proof-rules/induction.md) for both the minimum search and the sorting loop. +The verified specification establishes sortedness and preservation of length on termination. +It does not establish that the output is a permutation of the input or prove termination. + +## Finding the Minimum + +The helper `min_index_from` searches the suffix beginning at `start` in an integer list `input`. +The list operations `len` and `select` give its length and read an element. + + + +The precondition requires a nonempty suffix. +The postcondition places `index` within that suffix and requires its value to be no greater than every other suffix element. +This specification lets the sorting procedure use the helper's result without repeating the search proof. + +During the search, `j` marks the end of the scanned range. +The quantified invariant says that `select(input, index)` is no greater than every element between `start` and `j`, excluding `j`. +The bounds on `index` keep it within the suffix, while `start <= j` and `j <= len(input)` keep the scanned range valid. +If the element at `j` is smaller, the branch makes it the new candidate before extending the scanned range. +At exit, `j == len(input)`, so the quantified condition covers the entire suffix. + +## Extending the Sorted Prefix + +The sorting loop keeps the positions before `i` fixed and selects the next minimum from the suffix beginning at `i`. +The two `store` assignments exchange that minimum with the element currently at `i`. + + + +The first quantified condition says that the prefix before `i` is nondecreasing. +The second connects that prefix to the unfinished suffix: every prefix element is no greater than every suffix element. +Sortedness of the prefix alone would not justify appending another element, since that element might be smaller than the prefix's last value. + +The helper's specification gives the minimum of the suffix. +The second invariant condition puts that minimum above every existing prefix element, and the helper puts it below every remaining suffix element. +Swapping it into position `i` therefore extends the sorted prefix while preserving both conditions. +The `store` operations preserve the list's length. + +At exit, `i == len(sorted)`, so the sorted-prefix condition covers the whole output. +Together with `len(input) == len(sorted)`, it gives the stated postcondition. +The complete source also checks these properties for the five-element input used in the opening example. + +## See Also + +- [Binary Search Trees](./binary-search-trees.mdx) verifies ordered data structures using recursive specifications. +- [Loop Invariants](../../proof-rules/induction.md) explains the proof rule behind the annotations. diff --git a/website/docs/getting-started/zoo/tortoise-hare.mdx b/website/docs/getting-started/zoo/tortoise-hare.mdx new file mode 100644 index 00000000..c557fcc8 --- /dev/null +++ b/website/docs/getting-started/zoo/tortoise-hare.mdx @@ -0,0 +1,122 @@ +--- +title: Continuous Tortoise–Hare Race +description: Bound the expected final round count of a race with continuous random moves using upper Riemann sums. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleSourceExcerpt from '@site/src/heyvl-examples/ExampleSourceExcerpt'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import TortoiseHareJump from '@site/src/heyvl-examples/figures/TortoiseHareJump'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/tortoise-hare.heyvl?raw'; +import download from '@site/../tests/case-studies/tortoise-hare.heyvl?download'; + +export const references = { + continuous: { + ...sources.continuous2025, + href: "https://arxiv.org/html/2502.19388v1#S9.SS2.SSS3", + locator: "§§9.2.3–9.3 and Appendix C.24", + }, +}; + + + +A tortoise advances one unit per round, while a hare flips a fair coin to decide whether to move. +When the hare moves, its jump is sampled uniformly from the continuous interval $[0,10]$. +The race ends when the hare is ahead after both have moved . +We want an upper bound on the expected final round count. + +:::warning Reusing this encoding + +Caesar checks the encoding, whose soundness relies on the [conditions below](#soundness-conditions). +Check these conditions when adapting the encoding to another continuous program. + +::: + +## The Program {#the-program-and-its-specification} + +The program starts at positions `init_h` and `init_t`, counts completed rounds in `count`, and approximates the hare's continuous jumps using eight intervals. + + + +For `init_h <= init_t`, the `pre` clause bounds the expected final `count` by `3.38 * ((init_t - init_h) + 2)`. +If the hare starts ahead, the loop is skipped and the count is zero. +Under [`@wp`](../../proof-rules/approximations.md#calculus-annotations), nonterminating runs contribute zero, so this bound does not prove termination. + +## Continuous Sampling {#approximating-the-continuous-move} + + + +Suppose the hare starts a round at 0 and the tortoise moves from 2 to 3. +The hare must jump more than 3 units to end the race. +The highlighted interval $[2.5,3.75]$ contains jumps that lead to both outcomes. + + + +The hare's jump is ten times a draw from $[0,1]$. +The encoding divides that interval into eight equal parts. + + + +The [`unif(0, 7)`](../../stdlib/distributions.md#uniform) draw chooses each interval with probability $1/8$. +Then [`cohavoc`](../../heyvl/statements.md#havoc) and [`coassume`](../../heyvl/statements.md#assumptions) take the supremum over all values in the selected interval. +For a measurable expectation $f$, this gives the upper sum + +$$ +\int_0^1 f(u)\,du +\le \frac18\cdot\sum_{j=0}^{7} +\sup_{u\in[j/8,(j+1)/8]} f(u). +$$ + +The supremum accounts for every possible move within an interval, including jumps that change whether the race continues. + +## Soundness Conditions {#soundness-conditions} + +The paper's source programs use the following constructs, expressed here in HeyVL notation : + +- Assignments to `UReal` variables, sequential composition, `if`, and `while`. +- Probabilistic choice, written as `flip(p)` followed by `if`, with fixed rational $p\in[0,1]$. +- Continuous uniform draws from $[0,1]$ using the encoding above, and hard observations written as `assert ?(b)`. + +Assignments, guards, and postexpectations must be measurable. +The race meets this requirement through polynomial arithmetic and comparisons, with postexpectation `count`. + +## Verification {#bounding-the-remaining-rounds} + +Let $I$ denote the expectation in the [`@invariant` annotation](../../proof-rules/induction.md). +While `h <= t`, its term `3.38 * ((t - h) + 2)` bounds the expected rounds still to come, in addition to those already counted. + +Let $C$ be the original continuous loop and $B$ its body after the sampling encoding above. +Caesar checks the following inequality whenever `h <= t`: + +$$ +\operatorname{vp}\llbracket B\rrbracket(I)\le I. +$$ + +At loop exit, $I=\mathtt{count}$, giving the required postexpectation. +The factor `3.38` satisfies these checks with eight intervals . + +The paper's upper-bound theorem then gives + +$$ +\operatorname{wp}\llbracket C\rrbracket(\mathtt{count})\le I. +$$ + +## See Also + +- [Two-Sided Random Walks](./two-sided-random-walks.mdx) bounds round counts for a walk with discrete steps. +- [The continuous-programs article](/blog/2025/04/11/foundations-continuous) introduces the general encoding and further case studies. + +## References + +- + Develops sound Riemann approximations and gives the race's analysis, bound, and HeyVL encoding. + diff --git a/website/docs/getting-started/zoo/two-sided-random-walks.mdx b/website/docs/getting-started/zoo/two-sided-random-walks.mdx new file mode 100644 index 00000000..ef3de0e7 --- /dev/null +++ b/website/docs/getting-started/zoo/two-sided-random-walks.mdx @@ -0,0 +1,121 @@ +--- +title: Two-Sided Random Walks +description: Almost-sure termination and expected numbers of coin flips for walks that can move toward or away from their targets. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/loop-rules/ast2018/demonically_fair.heyvl?raw'; +import download from '@site/../tests/loop-rules/ast2018/demonically_fair.heyvl?download'; +import driftSource from '@site/../tests/loop-rules/induction/rdwalk.heyvl?raw'; +import driftDownload from '@site/../tests/loop-rules/induction/rdwalk.heyvl?download'; +import paritySource from '@site/../tests/loop-rules/ast2018/ast-flipflop.heyvl?raw'; +import parityDownload from '@site/../tests/loop-rules/ast2018/ast-flipflop.heyvl?download'; + +export const references = { + termination: { + ...sources.almostSureTermination2018, + href: "https://arxiv.org/pdf/1711.03588#page=14", + locator: "§5.2", + }, +}; + + + +A random walk can move away from its target, so progress made on one step may be lost on the next. +Our first program moves two places toward a target or one place away, using a fair coin to choose the direction. + +We bound the expected number of flips needed to reach the target, then ask whether related walks terminate with probability one when choices are adversarial or steps depend on parity. + +## Positive Drift {#positive-drift-cost} + +The procedure `drift_walk` starts at `init_x` and stops when `x >= init_n`. +A fair coin flip increases `x` by two or decreases it by one. +At zero, the downward step leaves `x` unchanged. + +With the [`@ert` annotation](../../proof-rules/approximations.md#calculus-annotations), each `tick 1` counts one flip. +The `coproc` specification bounds the expected number of flips from above by `2 * ((init_n + 1) - init_x)`. + + + +The [`@invariant` annotation](../../proof-rules/induction.md) supplies `I = 2 * ((n + 1) - x)`. +The `n + 1` in `I` allows for a final step to overshoot the target by one. +The expected cost including the tick is at most + +$$ +1+\tfrac12\cdot(I-4)+\tfrac12\cdot(I+2)=I. +$$ + +At exit, $I\ge0$ bounds `post 0`. + +## Demonic Choice {#demonic-walk-termination} + +The *demonically fair walk*, implemented by `demonic_walk`, starts at `init_x` and stops at zero. +A fair coin decides whether to decrease `x` by one or make a demonic choice between increasing it by one and staying put. + +With `pre 1`, `post 1`, and the [`@ast` annotation](../../proof-rules/ast.md), Caesar proves almost-sure termination under every resolution of the demonic choice. + + + +The variant `x` decreases by one with probability $1/2$. +Its expected value is at most + +$$ +\tfrac12\cdot(x-1)+\tfrac12\cdot(x+1)=x. +$$ + +Choosing to stay put gives a smaller expectation, so either demonic choice satisfies the expected-value condition. + +This walk also models a recursive process in which `x` counts pending calls . +A call either returns or is replaced by one or two further calls, with the number of new calls chosen demonically. + +## Parity-Dependent Steps {#parity-walk-termination} + +The final walk uses different steps at even and odd positions. +The procedure `parity_walk` starts at any nonnegative integer `init_x` and stops at ten. + +At even positions it moves down or up by two with equal probability. +At odd positions it moves up by one without flipping a coin. + +Caesar again proves almost-sure termination with `pre 1`, `post 1`, and the [`@ast` annotation](../../proof-rules/ast.md). + + + +- **Odd positions:** the term `3 * ite(x % 2 != 0, 1, 0)` compensates for a step away from ten. + It drops by three at the next even position, so the variant decreases by at least two. +- **Even positions:** a decrease by two has probability at least $1/2$, and the expected variant does not increase. + +## See Also + +- [One-Sided Random Walks](./one-sided-random-walks.mdx) studies walks that never move away from the target. +- [Escaping Spline](./escaping-spline.mdx) is another two-sided walk, with upward steps and a state-dependent probability of jumping directly to zero. +- [Rabin’s Mutual-Exclusion Algorithm](./rabin-mutual-exclusion.mdx) illustrates a probability bound whose proof leaves termination open. + +## References + +- + The demonically fair random walk illustrates termination under every resolution of the demonic choice. + diff --git a/website/docs/getting-started/zoo/zeroconf.mdx b/website/docs/getting-started/zoo/zeroconf.mdx new file mode 100644 index 00000000..ade87c85 --- /dev/null +++ b/website/docs/getting-started/zoo/zeroconf.mdx @@ -0,0 +1,116 @@ +--- +title: Zeroconf Address Allocation +description: An upper bound on the probability of avoiding an undetected address collision, verified with recursive procedures. +displayed_sidebar: docsSidebar +pagination_prev: getting-started/zoo +pagination_next: null +--- + +import ExampleSources from '@site/src/heyvl-examples/ExampleSources'; +import ExampleMetadata from '@site/src/heyvl-examples/ExampleMetadata'; +import ExecutionDiagram from '@site/src/heyvl-examples/figures/ExecutionDiagram'; +import Citation from '@site/src/components/Citation'; +import {references as sources} from '@site/src/data/references'; +import source from '@site/../tests/case-studies/zeroconf.heyvl?raw'; +import download from '@site/../tests/case-studies/zeroconf.heyvl?download'; + +export const references = { + rfc: { + ...sources.rfc3927, + locator: "§§1, 2.2", + }, + prism: sources.prismZeroconf, + cost: { + ...sources.zeroconfCost2003, + locator: "§3.1, Figure 1", + }, + timing: { + ...sources.digitalClocks2006, + locator: "§6.1", + }, + heyvl: { + ...sources.heyvl2023, + href: "https://arxiv.org/pdf/2309.07781#page=26", + locator: "Table 2", + }, +}; + + + +IPv4 Zeroconf lets devices choose local network addresses without manual configuration or a DHCP server . +A device sends *probes* to check whether another device already uses its chosen address. + +Lost probes or replies can leave a conflict unnoticed, while additional probes cost traffic and delay . +For one address choice and a fixed probe limit, we verify an upper bound on the probability that the address is free or the collision is detected. +Both outcomes count as `success`. + +## The Program + +The functions `probCollision()` and `probMessageLost()` give the collision probability $c$ and the probability $q$ that a probe fails to detect it. +This can happen if the probe or its reply is lost. +The function `maxTries()` gives the probe limit $M$. +The helper `exp(q, k)` denotes $q^k$. + + + +The procedure `zeroconf` first samples whether the address is occupied. +For an occupied address, it calls `arp(maxTries())` to try to detect the collision. + + + + + +Choosing another address after detecting a collision is outside this model. + +## Verification {#verification} + +Both coprocedures use the [`@wp` annotation](../../proof-rules/approximations.md#calculus-annotations) to verify upper bounds on the probability that `success` is true. + +### Upper Bound for the Address Choice {#avoiding-an-undetected-collision} + +Caesar verifies the upper bound + +$$ +\Pr(\mathtt{success})\le (1-c)+c\cdot\left(1-q^M\right). +$$ + +The term $1-c$ accounts for a free address, which immediately succeeds. +The term $c\cdot(1-q^M)$ accounts for an occupied address, using the bound in `arp`'s specification for $M$ probes. + +### Bounding Collision Detection Recursively {#detecting-a-collision} + +The helper `arp(triesRemaining)` probes an occupied address, stopping when a collision is detected or no probes remain. + + + +With $k$ independent probes left, the collision remains undetected if all fail, an event of probability $q^k$. +With no probes remaining, `arp` returns `false`, matching the bound zero. +For $k>0$, a probe detects the collision with probability $1-q$; otherwise, we use the recursive specification with one fewer probe: + +$$ +(1-q)+q\cdot\left(1-q^{k-1}\right)=1-q^k. +$$ + +Each recursive call decreases `triesRemaining`, so the procedure terminates after at most that many probes. +Caesar uses the recursive definition of `exp` for $q^k$ and the axiom `exp_bounded` for $q^k\le1$. + +## See Also + +- [Bounded Retransmission Protocol](./bounded-retransmission.mdx) analyzes packet delivery with a retry limit. +- [Geometric Loop](./geometric-loop.mdx) compares several ways to bound the effect of repeated independent trials. + +## References + +- + +- + Studies the tradeoff between reliable address allocation and expected cost. + + +- + The [PRISM Zeroconf case study](https://www.prismmodelchecker.org/casestudies/zeroconf.php) describes the model with timing, message buffers, and address reconfiguration used in that analysis. + + +- + Includes the recursive HeyVL case study used here. + diff --git a/website/docs/heyvl/statements.md b/website/docs/heyvl/statements.md index 57f337be..41afbcd2 100644 --- a/website/docs/heyvl/statements.md +++ b/website/docs/heyvl/statements.md @@ -246,6 +246,8 @@ Rewards accumulate along an execution. With `post 0`, `reward 2; reward 3` has total reward $5$. A nonzero `post` adds a final reward. +The [Retry Latency and Higher Moments example](../getting-started/zoo/retry-moments.mdx) models elapsed time with rewards and transforms them to bound the expected squared time. + ### Weights {#weigh}
diff --git a/website/docusaurus.config.js b/website/docusaurus.config.js index c58ea23f..9522ce15 100644 --- a/website/docusaurus.config.js +++ b/website/docusaurus.config.js @@ -4,6 +4,7 @@ import {themes as prismThemes} from 'prism-react-renderer'; import remarkMath from 'remark-math'; import rehypeKatex from 'rehype-katex'; +import {examples, groups} from './src/heyvl-examples/catalog.mjs'; /** @type {import('@docusaurus/types').Config} */ const config = { @@ -34,7 +35,10 @@ const config = { mermaid: true, }, themes: ['@docusaurus/theme-mermaid'], - plugins: [require.resolve('./plugins/homepage-metadata')], + plugins: [ + require.resolve('./plugins/homepage-metadata'), + require.resolve('./plugins/heyvl-examples/index.cjs'), + ], presets: [ [ @@ -43,6 +47,43 @@ const config = { ({ docs: { sidebarPath: require.resolve('./sidebars.js'), + sidebarItemsGenerator: async ({defaultSidebarItemsGenerator, ...args}) => { + const exampleId = 'getting-started/zoo'; + const detailDocs = args.docs.filter((doc) => doc.id.startsWith(`${exampleId}/`)); + const detailDocIds = new Set(detailDocs.map((doc) => doc.id)); + const exampleGroups = groups.map((group) => ({ + type: 'category', + label: group.label, + collapsible: true, + collapsed: true, + items: examples + .filter((example) => example.group === group.id && example.detailSlug && detailDocIds.has(`${exampleId}/${example.detailSlug}`)) + .map((example) => ({type: 'doc', id: `${exampleId}/${example.detailSlug}`})), + })).filter((group) => group.items.length); + const items = await defaultSidebarItemsGenerator({ + ...args, + docs: args.docs.filter((doc) => !doc.id.startsWith(`${exampleId}/`)), + }); + function addExampleHierarchy(sidebarItems) { + return sidebarItems.map((item) => { + if (item.type === 'doc' && item.id === exampleId) { + return { + type: 'category', + label: 'HeyVL Examples', + link: {type: 'doc', id: exampleId}, + collapsible: true, + collapsed: true, + className: 'example-sidebar-group', + items: exampleGroups, + }; + } + return item.type === 'category' + ? {...item, items: addExampleHierarchy(item.items)} + : item; + }); + } + return addExampleHierarchy(items); + }, editUrl: 'https://github.com/moves-rwth/caesar/tree/main/website/', remarkPlugins: [remarkMath], @@ -127,6 +168,30 @@ const config = { /** @type {import('@docusaurus/preset-classic').ThemeConfig} */ ({ image: 'img/social-card-v2.png', + mermaid: { + options: { + xyChart: { + width: 340, + height: 220, + xAxis: {labelFontSize: 14, titleFontSize: 14}, + yAxis: {labelFontSize: 14, titleFontSize: 14}, + }, + themeVariables: { + xyChart: { + backgroundColor: 'transparent', + plotColorPalette: 'var(--ifm-color-primary)', + xAxisLabelColor: 'var(--ifm-font-color-base)', + xAxisTitleColor: 'var(--ifm-font-color-base)', + xAxisTickColor: 'var(--ifm-color-emphasis-600)', + xAxisLineColor: 'var(--ifm-color-emphasis-600)', + yAxisLabelColor: 'var(--ifm-font-color-base)', + yAxisTitleColor: 'var(--ifm-font-color-base)', + yAxisTickColor: 'var(--ifm-color-emphasis-600)', + yAxisLineColor: 'var(--ifm-color-emphasis-600)', + }, + }, + }, + }, metadata: [ {property: 'og:image:width', content: '1200'}, {property: 'og:image:height', content: '630'}, @@ -148,6 +213,7 @@ const config = { }, items: [ {to: '/docs/getting-started', label: 'Getting Started', position: 'left'}, + {to: '/docs/getting-started/zoo', label: 'Examples', position: 'left'}, { type: 'docSidebar', sidebarId: 'docsSidebar', diff --git a/website/package.json b/website/package.json index 9159eb8c..fa7b1e0a 100644 --- a/website/package.json +++ b/website/package.json @@ -6,6 +6,8 @@ "docusaurus": "docusaurus", "start": "node scripts/start.mjs", "build": "docusaurus build", + "test:examples": "node --test src/heyvl-examples/exampleFilters.test.mjs", + "check:examples": "node scripts/check-examples.mjs", "swizzle": "docusaurus swizzle", "deploy": "docusaurus deploy", "clear": "docusaurus clear", diff --git a/website/plugins/heyvl-examples/index.cjs b/website/plugins/heyvl-examples/index.cjs new file mode 100644 index 00000000..e45bcdbb --- /dev/null +++ b/website/plugins/heyvl-examples/index.cjs @@ -0,0 +1,43 @@ +const fs = require('node:fs'); +const path = require('node:path'); +const {pathToFileURL} = require('node:url'); + +module.exports = function heyvlExamples(context) { + const catalogPath = path.join(context.siteDir, 'src/heyvl-examples/catalog.mjs'); + return { + name: 'heyvl-examples', + async loadContent() { + const catalogUrl = pathToFileURL(catalogPath).href; + const catalog = await import(`${catalogUrl}?mtime=${fs.statSync(catalogPath).mtimeMs}`); + const {validateCatalog} = await import(pathToFileURL(path.join(__dirname, 'validate.mjs')).href); + validateCatalog(catalog, context.siteDir); + }, + getPathsToWatch() { + return [ + catalogPath, + path.join(context.siteDir, 'docs/getting-started/zoo/*.mdx'), + path.join(context.siteDir, '../tests/**/*.heyvl'), + ]; + }, + configureWebpack(_config, isServer) { + return { + module: { + rules: [{ + test: /\.heyvl$/i, + oneOf: [ + {resourceQuery: /^\?raw$/, type: 'asset/source'}, + { + resourceQuery: /^\?download$/, + type: 'asset/resource', + generator: { + filename: 'assets/examples/[contenthash:8]/[name][ext]', + emit: !isServer, + }, + }, + ], + }], + }, + }; + }, + }; +}; diff --git a/website/plugins/heyvl-examples/validate.mjs b/website/plugins/heyvl-examples/validate.mjs new file mode 100644 index 00000000..51787988 --- /dev/null +++ b/website/plugins/heyvl-examples/validate.mjs @@ -0,0 +1,91 @@ +import fs from 'node:fs'; +import path from 'node:path'; + +const slug = /^[a-z0-9]+(?:-[a-z0-9]+)*$/; + +export function validateCatalog({examples, categories, groups, topics, techniques, papers}, siteDir) { + const repoDir = path.resolve(siteDir, '..'); + const detailDir = path.join(siteDir, 'docs/getting-started/zoo'); + const errors = []; + const entryIds = new Set(); + const detailSlugs = new Set(); + + function checkTags(values, label) { + const ids = new Set(); + for (const tag of values) { + if (!slug.test(tag.id) || !tag.label || ids.has(tag.id)) { + errors.push(`Invalid or duplicate ${label}: ${tag.id}`); + } + ids.add(tag.id); + } + return ids; + } + + const topicIds = checkTags(topics, 'topic'); + const techniqueIds = checkTags(techniques, 'technique'); + const categoryIds = checkTags(categories, 'category'); + const groupIds = checkTags(groups, 'group'); + const paperIds = checkTags(papers, 'paper'); + for (const paper of papers) { + if (!paper.title?.trim()) errors.push(`${paper.id}: paper requires a title`); + if (!paper.url?.startsWith('https://')) errors.push(`${paper.id}: paper requires an HTTPS reference`); + } + + for (const entry of examples) { + if (!slug.test(entry.id) || entryIds.has(entry.id)) errors.push(`Invalid or duplicate example ID: ${entry.id}`); + entryIds.add(entry.id); + if (!categoryIds.has(entry.category)) errors.push(`${entry.id}: unknown or missing category`); + if (!groupIds.has(entry.group)) errors.push(`${entry.id}: unknown or missing group`); + if (entry.papers?.some((id) => !paperIds.has(id))) errors.push(`${entry.id}: unknown paper reference`); + if (!entry.title || !entry.summary) errors.push(`${entry.id}: title and summary are required`); + if (!entry.topics?.length || entry.topics.some((id) => !topicIds.has(id))) errors.push(`${entry.id}: unknown or missing topic`); + if (!entry.variants?.length) errors.push(`${entry.id}: at least one variant is required`); + + if (entry.detailSlug) { + if (!slug.test(entry.detailSlug) || detailSlugs.has(entry.detailSlug)) errors.push(`${entry.id}: invalid or duplicate explanation slug`); + detailSlugs.add(entry.detailSlug); + const detailPath = path.join(detailDir, `${entry.detailSlug}.mdx`); + if (!fs.existsSync(detailPath)) { + errors.push(`${entry.id}: missing explanation page ${entry.detailSlug}.mdx`); + } else { + const page = fs.readFileSync(detailPath, 'utf8'); + const frontmatter = page.match(/^---\r?\n([\s\S]*?)\r?\n---(?:\r?\n|$)/)?.[1]; + const title = frontmatter?.match(/^title:[ \t]*(.+?)[ \t]*$/m)?.[1]; + if (title !== entry.title) errors.push(`${entry.id}: explanation title must match catalog title ${JSON.stringify(entry.title)}`); + if (!new RegExp(`exampleId=["']${entry.id}["']`).test(page)) errors.push(`${entry.id}: explanation page must reference its catalog entry`); + for (const variant of entry.variants) { + if (!page.includes(`${variant.sourcePath}?raw`) || !page.includes(`${variant.sourcePath}?download`)) { + errors.push(`${entry.id}/${variant.id}: explanation must provide the cataloged source and download`); + } + } + } + } + + const variantIds = new Set(); + for (const variant of entry.variants ?? []) { + const name = `${entry.id}/${variant.id}`; + if (!slug.test(variant.id) || variantIds.has(variant.id)) errors.push(`${name}: invalid or duplicate variant ID`); + variantIds.add(variant.id); + if (!variant.label) errors.push(`${name}: missing label`); + if (variant.topics !== undefined && (!Array.isArray(variant.topics) || variant.topics.some((id) => !topicIds.has(id)))) errors.push(`${name}: unknown or invalid topic`); + if (!variant.techniques?.length || variant.techniques.some((id) => !techniqueIds.has(id))) errors.push(`${name}: unknown or missing technique`); + if (!['proof', 'refutation'].includes(variant.outcome)) errors.push(`${name}: unknown outcome`); + if (!Array.isArray(variant.args) || variant.args.some((arg) => typeof arg !== 'string')) errors.push(`${name}: command arguments must be strings`); + const sourcePath = path.resolve(repoDir, variant.sourcePath); + if (!variant.sourcePath.startsWith('tests/') || !sourcePath.startsWith(`${path.join(repoDir, 'tests')}${path.sep}`) || !sourcePath.endsWith('.heyvl') || !fs.existsSync(sourcePath)) { + errors.push(`${name}: missing or invalid HeyVL test ${variant.sourcePath}`); + } else { + const source = fs.readFileSync(sourcePath, 'utf8'); + if (!/^\/\/\s*RUN:/m.test(source) || /^\/\/\s*IGNORE:/m.test(source)) errors.push(`${name}: source must be an active integration test`); + if (variant.outcome === 'refutation' && !source.includes('Counter-example to property found')) errors.push(`${name}: test must assert a property refutation`); + } + } + } + + if (fs.existsSync(detailDir)) { + for (const filename of fs.readdirSync(detailDir)) { + if (filename.endsWith('.mdx') && !detailSlugs.has(filename.slice(0, -4))) errors.push(`Explanation page missing from catalog: ${filename}`); + } + } + if (errors.length) throw new Error(`Invalid example catalog:\n${errors.map((error) => `- ${error}`).join('\n')}`); +} diff --git a/website/scripts/check-examples.mjs b/website/scripts/check-examples.mjs new file mode 100644 index 00000000..5f4e1404 --- /dev/null +++ b/website/scripts/check-examples.mjs @@ -0,0 +1,34 @@ +import path from 'node:path'; +import {fileURLToPath} from 'node:url'; +import {spawnSync} from 'node:child_process'; +import * as catalog from '../src/heyvl-examples/catalog.mjs'; +import {validateCatalog} from '../plugins/heyvl-examples/validate.mjs'; + +const siteDir = path.resolve(path.dirname(fileURLToPath(import.meta.url)), '..'); +const repoDir = path.resolve(siteDir, '..'); +validateCatalog(catalog, siteDir); +const variants = catalog.examples.flatMap((entry) => entry.variants); +console.log(`Validated ${catalog.examples.length} examples and ${variants.length} source variants.`); + +// An optional binary verifies the documented commands, including their expected outcomes. +const binary = process.argv[2] ? path.resolve(process.argv[2]) : undefined; +if (binary) { + let failures = 0; + for (const variant of variants) { + const result = spawnSync(binary, ['verify', variant.sourcePath, ...variant.args], { + cwd: repoDir, + encoding: 'utf8', + timeout: 60000, + }); + const output = `${result.stdout ?? ''}\n${result.stderr ?? ''}`; + const matches = variant.outcome === 'proof' + ? result.status === 0 && /: Verified\b/.test(output) + : result.status === 1 && output.includes('Counter-example to property found'); + if (result.error || !matches) { + failures++; + console.error(`Unexpected ${variant.outcome} result: ${variant.sourcePath}\n${result.error ?? output}`); + } + } + if (failures) process.exitCode = 1; + else console.log(`All ${variants.length} documented commands produced their expected result.`); +} diff --git a/website/src/heyvl-examples/ExampleGallery.module.css b/website/src/heyvl-examples/ExampleGallery.module.css new file mode 100644 index 00000000..0f71c477 --- /dev/null +++ b/website/src/heyvl-examples/ExampleGallery.module.css @@ -0,0 +1,451 @@ +.gallery { + margin: 1.5rem 0; +} + +.groupNavigation { + margin-bottom: 1.25rem; +} + +.groupNavigationLabel { + display: block; + margin-bottom: 0.35rem; + font-size: 0.9rem; + font-weight: 600; +} + +.groupLinks { + display: flex; + flex-wrap: wrap; + gap: 0.4rem 1.1rem; + margin: 0; + padding: 0; + list-style: none; + font-size: 0.9rem; +} + +.groupNavigation .groupLinks > li { + margin: 0; +} + +.filters { + margin-bottom: 1.5rem; +} + +.filters label { + display: block; + margin-bottom: 0.35rem; + font-size: 0.9rem; + font-weight: 600; +} + +.filters input[type='search'] { + box-sizing: border-box; + width: 100%; + min-width: 0; + min-height: 3rem; + padding: 0.65rem 0.8rem; + border: 1px solid var(--ifm-color-emphasis-400); + border-radius: var(--ifm-global-radius); + color: var(--ifm-font-color-base); + background: var(--ifm-background-color); + font: inherit; +} + +.filters input::placeholder { + color: var(--ifm-color-content-secondary); + opacity: 1; +} + +.filters :is(input, button, summary):focus-visible, +.gallery a:focus-visible { + outline: 2px solid var(--ifm-color-primary); + outline-offset: 3px; +} + +.searchField { + min-width: 0; +} + +.categoryFilters { + display: flex; + flex-wrap: wrap; + gap: 0.4rem; + margin: 0.85rem 0; +} + +.categoryFilter { + display: inline-flex; + align-items: center; + gap: 0.4rem; + min-height: 2.75rem; + padding: 0.35rem 0.7rem; + border: 1px solid transparent; + border-radius: 2rem; + background: transparent; + color: var(--ifm-font-color-base); + font: inherit; + font-size: 0.9rem; + cursor: pointer; +} + +.categoryFilter:hover { + background: var(--ifm-color-emphasis-100); +} + +.categoryFilter[aria-pressed='true'] { + border-color: var(--example-accent, var(--ifm-color-primary)); + background: color-mix(in srgb, var(--example-accent, var(--ifm-color-primary)) 9%, var(--ifm-background-surface-color)); + font-weight: 600; +} + +.categoryDot { + width: 0.55rem; + height: 0.55rem; + border-radius: 50%; + background: var(--example-accent); +} + +.filterToolbar { + display: flex; + align-items: center; + flex-wrap: wrap; + justify-content: space-between; + gap: 0.3rem 0.8rem; + padding-bottom: 0.85rem; + border-bottom: 1px solid var(--ifm-color-emphasis-300); +} + +.filterPanels { + display: flex; + align-items: start; + gap: 0.6rem; +} + +.filterPanel { + position: relative; + min-width: 0; +} + +.filterPanel summary { + padding: 0.4rem 0.6rem; + border-radius: var(--ifm-global-radius); + cursor: pointer; + font-size: 0.85rem; + font-weight: 600; +} + +.filterPanel summary:hover, +.filterPanel[open] summary { + background: var(--ifm-color-emphasis-100); +} + +.panelSummary { + display: inline-flex; + gap: 0.5rem; +} + +.selectionCount { + font-size: 0.8rem; + font-weight: 400; + color: var(--ifm-color-content-secondary); +} + +.filterPopover { + position: absolute; + top: calc(100% + 0.35rem); + left: 0; + z-index: 5; + width: min(28rem, calc(100vw - 3rem)); + padding: 0.35rem; + border: 1px solid var(--ifm-color-emphasis-300); + border-radius: var(--ifm-global-radius); + background: var(--ifm-background-surface-color); + box-shadow: 0 4px 14px rgb(0 0 0 / 12%); +} + +.checkboxGroup { + display: grid; + grid-template-columns: repeat(2, minmax(0, 1fr)); + gap: 0.15rem 0.65rem; + min-width: 0; + margin: 0; + padding: 0.3rem 0.7rem; + border: 0; +} + +.filters .checkboxLabel { + display: grid; + grid-template-columns: 1rem minmax(0, 1fr); + align-items: start; + gap: 0.45rem; + min-height: 2rem; + margin: 0; + padding: 0.35rem 0; + font-size: 0.85rem; + font-weight: 400; + line-height: 1.4; + cursor: pointer; +} + +.checkboxLabel input { + width: 1rem; + height: 1rem; + margin: 0.1rem 0 0; + accent-color: var(--ifm-color-primary); + cursor: pointer; +} + +.filterHint { + margin: 0.2rem 0.7rem 0.65rem; + color: var(--ifm-color-content-secondary); + font-size: 0.8rem; +} + +.filterFooter { + display: flex; + align-items: center; + justify-content: space-between; + flex-wrap: wrap; + gap: 0.4rem 1rem; +} + +.resultCount { + margin: 0; + font-size: 0.85rem; + color: var(--ifm-color-content-secondary); +} + +.reset { + min-height: 2.75rem; + padding: 0.4rem 0; + border: 0; + background: transparent; + color: var(--ifm-color-primary); + font: inherit; + font-size: 0.9rem; + text-decoration: underline; + cursor: pointer; +} + +.reset:disabled { + color: var(--ifm-color-content-secondary); + text-decoration: none; + opacity: 0.6; + cursor: default; +} + +.boolean { + --example-accent: #2d629d; +} + +.probabilistic { + --example-accent: #166851; +} + +.quantitative { + --example-accent: #7448a7; +} + +:global([data-theme='dark']) .boolean { + --example-accent: #98c6ff; +} + +:global([data-theme='dark']) .probabilistic { + --example-accent: #70d5b9; +} + +:global([data-theme='dark']) .quantitative { + --example-accent: #cba4f5; +} + +.groups { + display: flex; + flex-direction: column; + gap: 2rem; +} + +.groups .groupHeading { + margin: 0 0 0.85rem; + font-size: 1.15rem; + font-weight: 600; + line-height: 1.4; + scroll-margin-top: calc(var(--ifm-navbar-height) + 1rem); +} + +.cards { + display: grid; + grid-template-columns: repeat(2, minmax(0, 1fr)); + gap: var(--ifm-spacing-vertical) var(--ifm-spacing-horizontal); +} + +.entry { + --ifm-card-vertical-spacing: calc(var(--ifm-spacing-vertical) * 0.75); + position: relative; + min-width: 0; + border: var(--ifm-global-border-width) solid var(--ifm-color-emphasis-400); + overflow: visible; + overflow-wrap: anywhere; + font-size: var(--ifm-h5-font-size); +} + +.walkthrough { + --ifm-card-background-color: var(--caesar-surface-navigation); + border-inline-start-width: calc(var(--ifm-global-border-width) * 4); + border-inline-start-color: var(--ifm-color-primary); +} + +.walkthrough:hover { + --ifm-card-background-color: var(--caesar-surface-active); +} + +.source { + box-shadow: none; +} + +.entry .title { + margin: 0 0 calc(var(--ifm-spacing-vertical) / 2); + font-size: var(--ifm-h4-font-size); +} + +.walkthrough .title { + font-size: var(--ifm-h3-font-size); +} + +.summary { + margin-bottom: calc(var(--ifm-spacing-vertical) / 2); +} + +.metadata { + display: flex; + align-items: baseline; + flex-wrap: wrap; + gap: calc(var(--ifm-spacing-vertical) / 4) calc(var(--ifm-spacing-horizontal) / 2); + color: var(--ifm-color-content-secondary); + font-size: 0.875em; +} + +.category { + color: var(--example-accent); + font-weight: var(--ifm-font-weight-semibold); +} + +.topics { + display: flex; + align-items: baseline; + flex-wrap: wrap; + gap: calc(var(--ifm-spacing-horizontal) / 4); + margin: 0; + padding: 0; + list-style: none; +} + +.entry :is(.topics, .sourceLinks) > li { + margin: 0; + padding: 0; +} + +.topics > li:not(:last-child)::after { + margin-left: calc(var(--ifm-spacing-horizontal) / 4); + content: '·'; +} + +.techniques { + font-family: var(--ifm-font-family-monospace); +} + +.linked { + cursor: pointer; +} + +.linked a { + position: static; +} + +.linked a::after { + position: absolute; + z-index: 1; + inset: 0; + border-radius: var(--ifm-card-border-radius); + content: ''; +} + +.linked a:focus-visible { + outline: none; +} + +.linked a:focus-visible::after { + outline: calc(var(--ifm-global-border-width) * 2) solid var(--ifm-color-primary); + outline-offset: calc(var(--ifm-global-border-width) * 2); +} + +.source.linked:hover .sourceLink { + color: var(--ifm-color-primary); + text-decoration: underline; +} + +.sourceLinks { + min-width: 0; + margin: 0; + padding: 0; + list-style: none; +} + +.sourceLink { + display: flex; + align-items: center; + justify-content: space-between; + gap: calc(var(--ifm-spacing-horizontal) / 2); + padding-block: calc(var(--ifm-spacing-vertical) / 4); + color: var(--ifm-color-content-secondary); + font-family: var(--ifm-font-family-monospace); +} + +.summary :global(.katex) { + font-size: 1.05em; +} + +.empty { + padding: 2rem 1rem; + text-align: center; +} + +.empty h2 { + font-size: 1.25rem; +} + +@media (max-width: 760px) { + .cards { + grid-template-columns: 1fr; + } + + .filterPanels { + width: 100%; + flex-wrap: wrap; + } + + .filterPanel[open] { + flex-basis: 100%; + } + + .filterPopover { + position: static; + width: 100%; + margin-top: 0.4rem; + box-shadow: none; + } + + .filterFooter { + width: 100%; + } +} + +@media (max-width: 480px) { + .checkboxGroup { + grid-template-columns: 1fr; + } + + .categoryFilter { + padding: 0.35rem 0.6rem; + font-size: 0.85rem; + } +} diff --git a/website/src/heyvl-examples/ExampleGallery.tsx b/website/src/heyvl-examples/ExampleGallery.tsx new file mode 100644 index 00000000..48e084a5 --- /dev/null +++ b/website/src/heyvl-examples/ExampleGallery.tsx @@ -0,0 +1,192 @@ +import React, {useEffect, useState} from 'react'; +import clsx from 'clsx'; +import Link from '@docusaurus/Link'; +import useIsBrowser from '@docusaurus/useIsBrowser'; +import InlineMathText from './InlineMathText'; +import {examples, categories, groups, topics, techniques, papers} from './catalog.mjs'; +import {EMPTY_FILTERS, filterExamples, githubSourceUrl, readFilters, writeFilters} from './exampleFilters.mjs'; +import styles from './ExampleGallery.module.css'; + +const galleryPath = '/docs/getting-started/zoo'; +const facets = {categories, topics, techniques, papers}; +const categoryLabels = new Map(categories.map(({id, label}) => [id, label])); +const topicLabels = new Map(topics.map(({id, label}) => [id, label])); +const techniqueLabels = new Map(techniques.map(({id, label}) => [id, label])); + +function ExampleEntry({example}: {example: (typeof examples)[number]}) { + const walkthrough = Boolean(example.detailSlug); + const linked = walkthrough || example.variants.length === 1; + + return ( +
+
+

+ {example.title} +

+

{example.summary}

+
+ {categoryLabels.get(example.category)} +
    + {[...new Set([...example.topics, ...example.variants.flatMap((variant) => variant.topics || [])])].map((topic) =>
  • {topicLabels.get(topic) || topic}
  • )} +
+
    + {[...new Set(example.variants.flatMap((variant) => variant.techniques))].map((technique) =>
  • {techniqueLabels.get(technique) || technique}
  • )} +
+
+
+
+ {walkthrough ? ( + Read example + ) : ( + + )} +
+
+ ); +} + +export default function ExampleGallery() { + const isBrowser = useIsBrowser(); + const [filters, setFilters] = useState(() => readFilters(isBrowser ? window.location.search : '', facets)); + + useEffect(() => { + if (!isBrowser) return; + const pathname = window.location.pathname; + const restoreFilters = () => { + if (window.location.pathname === pathname) { + setFilters(readFilters(window.location.search, facets)); + } + }; + restoreFilters(); + window.addEventListener('popstate', restoreFilters); + return () => window.removeEventListener('popstate', restoreFilters); + }, [isBrowser]); + + const matchingExamples = filterExamples(examples, filters, facets); + const matchingGroups = groups.map((group) => ({ + ...group, + entries: matchingExamples.filter((example) => example.group === group.id), + })).filter((group) => group.entries.length); + const hasFilters = Boolean(filters.q || filters.category || filters.topics.length || filters.techniques.length); + + function replaceFilters(nextFilters: typeof filters) { + setFilters(nextFilters); + const {pathname, search, hash} = window.location; + const url = `${pathname}${writeFilters(nextFilters, search)}${hash}`; + // Filter edits stay within this page and preserve the router's history state. + window.history.replaceState(window.history.state, '', url); + } + + function updateFilter(key: 'q' | 'category', value: string) { + replaceFilters({...filters, [key]: value}); + } + + function toggleFilter(key: 'topics' | 'techniques', value: string) { + const values = filters[key]; + const selected = values.includes(value) ? values.filter((item) => item !== value) : [...values, value]; + replaceFilters({...filters, [key]: selected}); + } + + function resetFilters() { + replaceFilters(EMPTY_FILTERS); + } + + return ( +
+ {matchingGroups.length > 0 && ( + + )} +
event.preventDefault()}> +
+ + updateFilter('q', event.target.value)} + /> +
+
+ + {categories.map(({id, label}) => ( + + ))} +
+
+
+ {([ + {key: 'topics', label: 'Topics', items: topics}, + {key: 'techniques', label: 'Techniques', items: techniques}, + ] as const).map(({key, label, items}) => ( +
+ + + {label} + {filters[key].length ? `${filters[key].length} selected` : 'All'} + + +
+
+ {items.map(({id, label: itemLabel}) => ( + + ))} +
+

Matches any selected {key === 'topics' ? 'topic' : 'technique'}.

+
+
+ ))} +
+
+

+ {matchingExamples.length} of {examples.length} examples +

+ +
+
+
+ + {matchingExamples.length === 0 ? ( +
+

No matching examples

+

Try another search or reset the filters to see all examples.

+ +
+ ) : ( +
+ {matchingGroups.map((group) => ( +
+

{group.label}

+
+ {group.entries.map((example) => ( + + ))} +
+
+ ))} +
+ )} +
+ ); +} diff --git a/website/src/heyvl-examples/ExampleMetadata.module.css b/website/src/heyvl-examples/ExampleMetadata.module.css new file mode 100644 index 00000000..7cb7cf12 --- /dev/null +++ b/website/src/heyvl-examples/ExampleMetadata.module.css @@ -0,0 +1,91 @@ +.metadata { + margin: 0 0 1.5rem; + color: var(--ifm-color-content-secondary); + font-size: 0.8125rem; + line-height: 1.6; +} + +.category { + display: inline-flex; + align-items: center; + gap: 0.4rem; + margin-inline-end: 0.75rem; + padding: 0.1rem 0.55rem; + border: 1px solid color-mix(in srgb, var(--example-accent) 18%, transparent); + border-radius: 2rem; + background: color-mix(in srgb, var(--example-accent) 6%, transparent); + color: var(--example-accent); + font-weight: var(--ifm-font-weight-semibold); +} + +.category::before { + width: 0.4rem; + height: 0.4rem; + border-radius: 50%; + background: currentColor; + content: ''; +} + +.values { + display: inline; + margin: 0; + padding: 0; + list-style: none; +} + +.metadata .topics { + margin-inline-end: 0.75rem; +} + +.metadata .values > li { + display: inline; + margin: 0; + padding: 0; +} + +.topics > li:not(:last-child)::after { + margin-inline: 0.35rem; + color: var(--ifm-color-content-secondary); + content: '·'; +} + +.techniques { + font-family: var(--ifm-font-family-monospace); +} + +.metadata .techniques > li { + display: inline-block; + margin-inline-end: 0.5rem; +} + +.techniques code { + padding: 0.05rem 0.3rem; + border: 0; + background: var(--ifm-color-emphasis-100); + color: inherit; + font: inherit; +} + +.boolean { + --example-accent: #2d629d; +} + +.probabilistic { + --example-accent: #166851; +} + +.quantitative { + --example-accent: #7448a7; +} + +:global([data-theme='dark']) .boolean { + --example-accent: #98c6ff; +} + +:global([data-theme='dark']) .probabilistic { + --example-accent: #70d5b9; +} + +:global([data-theme='dark']) .quantitative { + --example-accent: #cba4f5; +} diff --git a/website/src/heyvl-examples/ExampleMetadata.tsx b/website/src/heyvl-examples/ExampleMetadata.tsx new file mode 100644 index 00000000..b5c8713d --- /dev/null +++ b/website/src/heyvl-examples/ExampleMetadata.tsx @@ -0,0 +1,25 @@ +import React from 'react'; +import {categories, getExample, topics, techniques} from './catalog.mjs'; +import styles from './ExampleMetadata.module.css'; + +const categoryLabels = new Map(categories.map(({id, label}) => [id, label])); +const topicLabels = new Map(topics.map(({id, label}) => [id, label])); +const techniqueLabels = new Map(techniques.map(({id, label}) => [id, label])); + +export default function ExampleMetadata({exampleId}: {exampleId: string}) { + const example = getExample(exampleId); + const exampleTopics = [...new Set([...example.topics, ...example.variants.flatMap((variant) => variant.topics || [])])]; + const exampleTechniques = [...new Set(example.variants.flatMap((variant) => variant.techniques))]; + + return ( +
+ {categoryLabels.get(example.category)} +
    + {exampleTopics.map((topic) =>
  • {topicLabels.get(topic) || topic}
  • )} +
+
    + {exampleTechniques.map((technique) =>
  • {techniqueLabels.get(technique) || technique}
  • )} +
+
+ ); +} diff --git a/website/src/heyvl-examples/ExampleSourceExcerpt.tsx b/website/src/heyvl-examples/ExampleSourceExcerpt.tsx new file mode 100644 index 00000000..7127d615 --- /dev/null +++ b/website/src/heyvl-examples/ExampleSourceExcerpt.tsx @@ -0,0 +1,14 @@ +import React from 'react'; +import CodeBlock from '@theme/CodeBlock'; +import codeStyles from '../css/verification-code.module.css'; + +type Props = {source: string; start: string; end?: string; title: string; highlight?: string}; + +/** Select an excerpt from the imported test, so explanations follow source changes. */ +export default function ExampleSourceExcerpt({source, start, end, title, highlight}: Props) { + const from = source.indexOf(start); + const to = end === undefined ? source.length : source.indexOf(end, from + start.length); + if (from < 0 || to < 0) throw new Error(`Source excerpt markers not found: ${title}`); + const code = source.slice(from, to).trimEnd().replaceAll('\t', ' '); + return {code}; +} diff --git a/website/src/heyvl-examples/ExampleSources.module.css b/website/src/heyvl-examples/ExampleSources.module.css new file mode 100644 index 00000000..f9238d0b --- /dev/null +++ b/website/src/heyvl-examples/ExampleSources.module.css @@ -0,0 +1,140 @@ +.sources { + min-width: 0; + max-inline-size: var(--caesar-docs-code-width); + margin: 1.25rem 0; + margin-inline: auto; +} + +.preview { + --caesar-source-background: #fff; + --docusaurus-highlighted-code-line-bg: color-mix(in srgb, var(--ifm-color-primary) 6%, var(--caesar-source-background)); + min-width: 0; +} + +:global([data-theme='dark']) .preview { + --caesar-source-background: var(--ifm-background-color); +} + +.preview + .preview { + margin-top: 1.25rem; +} + +.previewHeader, +.previewFooter { + display: flex; + align-items: center; + justify-content: space-between; + flex-wrap: wrap; + gap: 0.4rem 1rem; + padding: 0.5rem 0; +} + +.previewHeader { + padding-top: 0; + color: var(--ifm-color-content-secondary); + font-size: 0.8rem; +} + +.previewHeader strong { + font-weight: 500; +} + +.outcome { + color: var(--ifm-color-primary); + font-size: 0.75rem; +} + +.outcome[data-outcome='refutation'] { + color: var(--ifm-color-warning-darkest); +} + +:global([data-theme='dark']) .outcome[data-outcome='refutation'] { + color: var(--ifm-color-warning-lightest); +} + +.codePanel { + border: 1px solid var(--ifm-color-emphasis-300); + border-radius: 4px; +} + +.codePanel > :global(div.theme-code-block) { + --prism-background-color: var(--caesar-source-background) !important; + width: 100%; + min-width: 0; + margin: 0; + border-radius: 0; + box-shadow: none; +} + +.preview :global(pre) { + --ifm-pre-background: var(--caesar-source-background); + background-color: var(--caesar-source-background) !important; + border-radius: 0; +} + +.preview :global(.theme-code-block-highlighted-line) { + --ifm-pre-background: var(--docusaurus-highlighted-code-line-bg); + box-shadow: inset 2px 0 var(--ifm-color-primary); +} + +.omission { + display: block; + width: 100%; + padding: 0.1rem 1rem 0.1rem 4rem; + border: 0; + background: var(--caesar-source-background); + color: var(--ifm-color-content-secondary); + font: 1rem var(--ifm-font-family-monospace); + text-align: left; + cursor: pointer; +} + +.omission:hover { + background: var(--docusaurus-highlighted-code-line-bg); + color: var(--ifm-color-primary); +} + +.previewFooter { + font-size: 0.75rem; +} + +.actions { + display: flex; + align-items: center; + flex-wrap: wrap; + gap: 0.85rem; +} + +.actions :is(a, button) { + color: var(--ifm-color-content-secondary); +} + +.actions button { + padding: 0; + border: 0; + background: none; + font: inherit; + cursor: pointer; +} + +.actions :is(a, button):hover { + color: var(--ifm-color-primary); + text-decoration: underline; +} + +.preview :is(a, button):focus-visible { + outline: 2px solid var(--ifm-color-primary); + outline-offset: 3px; +} + +.command { + flex-basis: 100%; + min-width: 0; +} + +.command > :global(div.theme-code-block) { + --prism-background-color: var(--caesar-source-background) !important; + width: 100%; + min-width: 0; + margin: 0.25rem 0 0; +} diff --git a/website/src/heyvl-examples/ExampleSources.tsx b/website/src/heyvl-examples/ExampleSources.tsx new file mode 100644 index 00000000..b1c2e47f --- /dev/null +++ b/website/src/heyvl-examples/ExampleSources.tsx @@ -0,0 +1,84 @@ +import React, {useState} from 'react'; +import CodeBlock from '@theme/CodeBlock'; +import {getExample} from './catalog.mjs'; +import {exampleCommand} from './exampleFilters.mjs'; +import styles from './ExampleSources.module.css'; +import codeStyles from '../css/verification-code.module.css'; + +type Source = { + variantId: string; + code: string; + downloadUrl: string; + title?: string; + start?: string; + end?: string; + highlight?: string; +}; + +type Props = {exampleId: string; sources: Source[]}; + +function selectCode(source: Source) { + const full = source.code.replace(/^\/\/\s*(?:RUN|XFAIL|IGNORE):[^\n]*(?:\n|$)/gm, '').trim(); + const from = source.start === undefined ? 0 : full.indexOf(source.start); + const to = source.end === undefined ? full.length : full.indexOf(source.end, from + (source.start?.length ?? 0)); + if (from < 0 || to < from) throw new Error(`Source preview markers not found: ${source.title ?? source.variantId}`); + const lines = full.slice(from, to).trimEnd().split('\n'); + const excerpt = lines.join('\n'); + const before = full.slice(0, from).split('\n').length - 1; + const remainder = full.slice(to).trimEnd(); + const after = remainder ? remainder.split('\n').length : 0; + if (source.highlight) { + const ranges = source.highlight.split(',').flatMap(range => range.split('-').map(Number)); + if (ranges.some(line => !Number.isInteger(line) || line < 1 || line > lines.length)) { + throw new Error(`Invalid highlight range: ${source.title ?? source.variantId}`); + } + } + const fullHighlight = source.highlight?.split(',').map(range => range.split('-').map(line => Number(line) + before).join('-')).join(','); + return {full, excerpt, before, after, fullHighlight}; +} + +function SourcePreview({exampleId, source}: {exampleId: string; source: Source}) { + const example = getExample(exampleId); + const variant = example.variants.find(candidate => candidate.id === source.variantId); + if (!variant) throw new Error(`Unknown variant ${source.variantId} for example ${exampleId}`); + const [expanded, setExpanded] = useState(false); + const [showCommand, setShowCommand] = useState(false); + const filename = variant.sourcePath.split('/').at(-1); + const {full, excerpt, before, after, fullHighlight} = selectCode(source); + const title = source.title ?? variant.label; + const expected = variant.outcome === 'proof' ? 'Verified' : 'Counter-example to property found'; + const highlight = expanded ? fullHighlight : source.highlight; + const command = exampleCommand(variant); + + return
+
+ {title} +
+ Expected: {expected} +
+
+
+ {before > 0 && } + {expanded ? full : excerpt} + {after > 0 && } +
+
+
+ Download .heyvl + {(before > 0 || after > 0) && } + +
+ {showCommand &&
{command}
} +
+
; +} + +export default function ExampleSources({exampleId, sources}: Props) { + if (!sources.length) throw new Error(`No sources provided for example: ${exampleId}`); + if (new Set(sources.map(source => source.variantId)).size !== sources.length) { + throw new Error(`Duplicate source variant for example: ${exampleId}`); + } + return
+ {sources.map(source => )} +
; +} diff --git a/website/src/heyvl-examples/InlineMathText.tsx b/website/src/heyvl-examples/InlineMathText.tsx new file mode 100644 index 00000000..2f3a4108 --- /dev/null +++ b/website/src/heyvl-examples/InlineMathText.tsx @@ -0,0 +1,11 @@ +import React from 'react'; +import katex from 'katex'; + +/** Render the catalog's $…$ inline math in both static HTML and filtered cards. */ +export default function InlineMathText({children}: {children: string}) { + return <>{children.split(/(\$[^$]+\$)/g).map((part, index) => + part.startsWith('$') && part.endsWith('$') + ? + : part, + )}; +} diff --git a/website/src/heyvl-examples/catalog.mjs b/website/src/heyvl-examples/catalog.mjs new file mode 100644 index 00000000..765fd969 --- /dev/null +++ b/website/src/heyvl-examples/catalog.mjs @@ -0,0 +1,396 @@ +/** + * The catalog describes the examples whose source code lives in the test suite. + * Variant IDs are local to an example, and techniques and outcomes describe each variant. + */ +export const categories = [ + {id: 'boolean', label: 'Boolean'}, + {id: 'probabilistic', label: 'Probabilistic'}, +]; + +export const groups = [ + {id: 'random-walks', label: 'Random Walks and Countdowns'}, + {id: 'sampling', label: 'Sampling and Probabilistic Models'}, + {id: 'rewards', label: 'Rewards and Resource Consumption'}, + {id: 'protocols', label: 'Protocols'}, + {id: 'data-structures', label: 'Data Structures'}, +]; + +export const topics = [ + {id: 'ast', label: 'Almost-sure termination'}, + {id: 'past', label: 'Positive almost-sure termination'}, + {id: 'axioms', label: 'Axioms'}, + {id: 'conditioning', label: 'Conditioning'}, + {id: 'continuous', label: 'Continuous distributions'}, + {id: 'expectation', label: 'Expected values'}, + {id: 'moments', label: 'Higher moments'}, + {id: 'runtime', label: 'Expected runtime'}, + {id: 'lists', label: 'Lists'}, + {id: 'probability', label: 'Probability bounds'}, + {id: 'sampling', label: 'Sampling algorithms'}, + {id: 'protocols', label: 'Protocols'}, + {id: 'refutation', label: 'Refutation'}, + {id: 'termination', label: 'Termination'}, + {id: 'trees', label: 'Trees'}, + {id: 'functions', label: 'User-defined functions'}, +]; + +export const techniques = [ + {id: 'ast', label: '@ast'}, + {id: 'invariants', label: '@invariant'}, + {id: 'k-induction', label: '@k_induction'}, + {id: 'loop-free', label: 'Loop-free reasoning'}, + {id: 'omega-invariants', label: '@omega_invariant'}, + {id: 'optional-stopping', label: '@ost'}, + {id: 'past', label: '@past'}, + {id: 'recursion', label: 'Recursion'}, + {id: 'unrolling', label: '@unroll'}, +]; + +export const papers = [ + {id: 'bjorner-2019', label: 'Bjørner et al. 2019', title: 'Programming Z3', url: 'https://z3prover.github.io/papers/programmingz3.html'}, + {id: 'bohnenkamp-2003', label: 'Bohnenkamp et al. 2003', title: 'Cost-Optimization of the IPv4 Zeroconf Protocol', url: 'https://doi.org/10.1109/DSN.2003.1209963'}, + {id: 'dargenio-2001', label: 'D’Argenio et al. 2001', title: 'Reachability Analysis of Probabilistic Systems by Successive Refinements', url: 'https://doi.org/10.1007/3-540-44804-7_3'}, + {id: 'helmink-1994', label: 'Helmink et al. 1994', title: 'Proof-Checking a Data Link Protocol', url: 'https://doi.org/10.1007/3-540-58085-9_75'}, + {id: 'kaminski-2016', label: 'Kaminski et al. 2016', title: 'Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs', url: 'https://users.dcc.uchile.cl/~folmedo/pubs/2016.ESOP.pdf'}, + {id: 'kaminski-2018', label: 'Kaminski et al. 2018', title: 'Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms', url: 'https://doi.org/10.1145/3208102'}, + {id: 'kushilevitz-rabin-1992', label: 'Kushilevitz and Rabin 1992', title: 'Randomized Mutual Exclusion Algorithms Revisited', url: 'https://doi.org/10.1145/135419.135468'}, + {id: 'kwiatkowska-2006', label: 'Kwiatkowska et al. 2006', title: 'Performance Analysis of Probabilistic Timed Automata Using Digital Clocks', url: 'https://www.prismmodelchecker.org/papers/fmsd06.pdf'}, + {id: 'schroer-2023', label: 'Schröer et al. 2023', title: 'A Deductive Verification Infrastructure for Probabilistic Programs', url: 'https://arxiv.org/abs/2309.07781'}, + {id: 'schroer-cav-2026', label: 'Schröer et al. 2026', title: 'Caesar: A Deductive Verifier for Probabilistic Programs', url: 'https://doi.org/10.1007/978-3-032-32537-2_27'}, + {id: 'schroer-2026', label: 'Schröer and Katoen 2026', title: 'Highly Incremental: A Simple Programmatic Approach for Many Objectives', url: 'https://arxiv.org/abs/2603.02405'}, + {id: 'batz-2025', label: 'Batz et al. 2025', title: 'Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back', url: 'https://doi.org/10.1145/3720429'}, + {id: 'morris-1978', label: 'Morris 1978', title: 'Counting Large Numbers of Events in Small Registers', url: 'https://doi.org/10.1145/359619.359627'}, + {id: 'vitter-1985', label: 'Vitter 1985', title: 'Random Sampling with a Reservoir', url: 'https://doi.org/10.1145/3147.3165'}, + {id: 'lumbroso-2013', label: 'Lumbroso 2013', title: 'Optimal Discrete Uniform Generation from Coin Flips, and Applications', url: 'https://arxiv.org/abs/1304.1916'}, + {id: 'batz-2021', label: 'Batz et al. 2021', title: 'Latticed k-Induction with an Application to Probabilistic Programs', url: 'https://arxiv.org/abs/2105.14100'}, + {id: 'mciver-2018', label: 'McIver et al. 2018', title: 'A New Proof Rule for Almost-Sure Termination', url: 'https://arxiv.org/abs/1711.03588'}, + {id: 'hurd-2004', label: 'Hurd et al. 2004', title: 'Probabilistic Guarded Commands Mechanized in HOL', url: 'https://doi.org/10.1016/j.entcs.2004.01.021'}, + {id: 'hark-2020', label: 'Hark et al. 2020', title: 'Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification', url: 'https://arxiv.org/abs/1904.01117'}, + {id: 'paz-2014', label: 'Paz and Yechiali 2014', title: 'An M/M/1 Queue in Random Environment with Disasters', url: 'https://doi.org/10.1142/S021759591450016X'}, + {id: 'olmedo-2018', label: 'Olmedo et al. 2018', title: 'Conditioning in Probabilistic Programming', url: 'https://doi.org/10.1145/3156018'}, + {id: 'van-jaarsveld-2025', label: 'van Jaarsveld 2025', title: 'Practical Probabilistic Program Verification using Caesar', url: 'https://purl.utwente.nl/essays/106318'}, +]; + +function variant(id, label, sourcePath, techniques, args = [], outcome = 'proof', topics = []) { + return {id, label, sourcePath, techniques, args, outcome, topics}; +} + +const computation = ['--function-encoding', 'fuel-param-computation']; +const fuel = ['--function-encoding', 'fuel-param']; +const eMatching = ['--quantifier-instantiation', 'e-matching']; + +// Within each group, examples appear in this order. +export const examples = [ + { + id: 'geometric-loop', + group: 'random-walks', + papers: ["batz-2021", "hark-2020"], + category: 'probabilistic', + title: 'Geometric Loop', + summary: + "Count tails until a fair coin first shows heads. " + + "Prove that the expected number of tails is one, and refute a proposed upper bound of $0.99$.", + topics: ['expectation'], + detailSlug: 'geometric-loop', + variants: [ + variant('invariant', 'Expected number of tails: upper bound by Park induction', 'tests/loop-rules/induction/geometric.heyvl', ['invariants']), + variant('k-induction', 'Expected number of tails: upper bound by 2-induction', 'tests/loop-rules/k_induction/geo1.heyvl', ['k-induction']), + variant('optional-stopping', 'Expected number of tails: lower bound by optional stopping', 'tests/loop-rules/ost2019/annotated.heyvl', ['optional-stopping']), + variant('refutation', 'Refuting the upper bound of 0.99 tails', 'tests/loop-rules/bmc/refute-geo2_bmc.heyvl', ['unrolling'], ['--slice-error-first'], 'refutation'), + variant('recursive', 'Expected number of tails: recursive specification', 'tests/case-studies/geo-recursive.heyvl', ['recursion']), + ], + }, + { + id: 'coupon-collector', + group: 'sampling', + papers: ['kaminski-2016', 'kaminski-2018', 'schroer-2023'], + category: 'probabilistic', + title: 'Coupon Collector', + summary: + "Draw independently from $N$ equally likely coupons until the collection is complete. " + + "Caesar bounds the expected number of draws by $N \\cdot H_N$, where $H_N$ is the $N$-th harmonic number.", + topics: ['runtime', 'expectation', 'functions'], + detailSlug: 'coupon-collector', + variants: [ + variant('main', 'Expected draws: simplified sampling', 'tests/case-studies/coupon-collector.heyvl', ['invariants'], [...fuel, ...eMatching]), + variant('uniform', 'Expected draws: explicit uniform sampling', 'tests/case-studies/coupon-collector-uniform.heyvl', ['invariants'], [...fuel, ...eMatching]), + ], + }, + { + id: 'reservoir-sampling', + group: 'sampling', + papers: ['vitter-1985'], + category: 'probabilistic', + title: 'Reservoir Sampling', + summary: + "Keep one uniformly chosen item from a stream without storing the whole stream. " + + "Caesar proves matching probability bounds and termination, establishing a selection probability of $1/n$ for every position.", + topics: ['sampling', 'probability', 'termination'], + detailSlug: 'reservoir-sampling', + variants: [variant('main', 'Uniform selection: upper and lower bounds and termination', 'tests/case-studies/reservoir-sampling.heyvl', ['invariants', 'ast'], [], 'proof', ['ast'])], + }, + { + id: 'fast-dice-roller', + group: 'sampling', + papers: ['lumbroso-2013', 'mciver-2018'], + category: 'probabilistic', + title: 'Fast Dice Roller', + summary: + "Compare rejection sampling with Fast Dice Roller, which reuses the randomness in rejected values. " + + "The fast sampler's proof uses one invariant for matching bounds on each result.", + topics: ['sampling', 'probability', 'functions', 'termination'], + detailSlug: 'fast-dice-roller', + variants: [ + variant('slow', 'Slow Dice Roller: probability bounds and expected bit cost', 'tests/case-studies/slow-dice-roller.heyvl', ['invariants', 'ast'], ['--timeout', '30', '--max-fuel', '4', ...eMatching, '--werr'], 'proof', ['ast', 'expectation']), + variant('power-of-two', 'Binary sampler: matching probability bounds and termination', 'tests/case-studies/power-of-two-sampling.heyvl', ['invariants', 'ast'], ['--timeout', '20', '--max-fuel', '4', ...eMatching, '--werr'], 'proof', ['ast']), + variant('main', 'Arbitrary ranges: matching probability bounds and termination', 'tests/case-studies/fast-dice-roller.heyvl', ['invariants', 'ast'], ['--timeout', '30', '--max-fuel', '4', ...eMatching, '--werr'], 'proof', ['ast']), + ], + }, + { + id: 'morris-counting', + group: 'sampling', + papers: ['morris-1978'], + category: 'probabilistic', + title: 'Morris Approximate Counting', + summary: + "Count events by incrementing a small counter with a probability that decreases as it grows. " + + "Caesar verifies that the expected estimate $2^c - 1$ is at most the number of events.", + topics: ['expectation', 'axioms', 'functions'], + detailSlug: 'morris-counting', + variants: [variant('main', 'Upper bound on the expected count estimate', 'tests/case-studies/morris-counting.heyvl', ['invariants'])], + }, + { + id: 'retry-moments', + group: 'rewards', + papers: ['schroer-2026'], + category: 'probabilistic', + title: 'Retry Latency and Higher Moments', + summary: + "Compare database retries with a caching alternative that has the same mean latency. " + + "Caesar bounds their second moments using incremental rewards, supporting a comparison of latency variance.", + topics: ['runtime', 'expectation', 'moments'], + detailSlug: 'retry-moments', + variants: [variant('main', 'Upper bounds on mean latency and second moments', 'tests/case-studies/retry-moments.heyvl', ['invariants'])], + }, + { + id: 'runtime-composition', + group: 'rewards', + papers: ['kaminski-2016'], + category: 'probabilistic', + title: 'Finite Expected Runtime Does Not Compose', + summary: + "A randomized generator and a deterministic countdown each have finite expected runtime for every fixed input. " + + "Their composition terminates almost surely but has infinite expected runtime.", + topics: ['runtime', 'expectation', 'termination'], + detailSlug: 'runtime-composition', + variants: [variant('main', 'Finite component runtimes and arbitrary lower bounds on composed runtime', 'tests/case-studies/ert-composition.heyvl', ['invariants', 'omega-invariants'], ['--werr', '--quantifier-instantiation', 'mbqi', '--timeout', '10'])], + }, + { + id: 'tortoise-hare', + group: 'sampling', + papers: ['batz-2025'], + category: 'probabilistic', + title: 'Continuous Tortoise–Hare Race', + summary: + "A hare chooses continuous random jumps while a tortoise advances one step per round. " + + "Caesar checks an upper bound on the expected final round count through a Riemann approximation of continuous sampling.", + topics: ['continuous', 'expectation'], + detailSlug: 'tortoise-hare', + variants: [variant('main', 'Upper bound through eight Riemann intervals', 'tests/case-studies/tortoise-hare.heyvl', ['invariants'])], + }, + { + id: 'conditioning', + group: 'sampling', + papers: ['paz-2014', 'olmedo-2018'], + category: 'probabilistic', + title: 'Conditioning on Queue Completion', + summary: + "A queue receives new jobs while a server processes existing ones and may fail. " + + "Conditioned on emptying before failure, Caesar bounds the expected number of rounds by $5n/3$ for every initial queue size $n$, without bounding the queue's growth.", + topics: ['conditioning', 'expectation', 'probability', 'termination'], + detailSlug: 'conditioning', + variants: [variant('main', 'Conditional expected rounds and observation probability', 'tests/case-studies/conditioning.heyvl', ['invariants'], ['--max-fuel', '4', ...eMatching])], + }, + { + id: 'die-sampling', + group: 'sampling', + papers: ['schroer-2023'], + category: 'probabilistic', + title: 'Die Sampling with Conditioning', + summary: + "Simulate a six-sided die with three fair coin flips, conditioning on a result at most six. " + + "Caesar verifies that the expected die result under this condition is at most $2.625 / 0.75 = 3.5$.", + topics: ['conditioning', 'probability', 'expectation'], + variants: [variant('main', 'Conditional expected die result', 'tests/loopfree-prob/six-sided-die.heyvl', ['loop-free'])], + }, + { + id: 'noisy-or', + group: 'sampling', + category: 'probabilistic', + title: 'Noisy-OR Bayesian Network', + summary: + "Sample a Boolean Bayesian network whose nodes combine causes by disjunction. " + + "Caesar verifies lower bounds on the probabilities that the output is true or false.", + topics: ['probability'], + variants: [variant('main', 'Output-probability bounds', 'tests/loopfree-prob/noisy_or.heyvl', ['loop-free'])], + }, + { + id: 'one-sided-random-walks', + group: 'random-walks', + papers: ['mciver-2018', 'schroer-2023'], + category: 'probabilistic', + title: 'One-Sided Random Walks', + summary: + "Move toward a target with random pauses or steps of one or two. " + + "Compare almost-sure termination, finite expected numbers of coin flips, and numerical bounds on those expectations.", + topics: ['termination', 'runtime', 'probability'], + detailSlug: 'one-sided-random-walks', + variants: [ + variant('ast', 'Countdown: almost-sure termination', 'tests/loop-rules/ast2018/negative_binomial.heyvl', ['ast'], [], 'proof', ['ast']), + variant('past', 'Countdown: finite expected number of coin flips', 'tests/loop-rules/past2013/annotated.heyvl', ['past'], [], 'proof', ['ast', 'past']), + variant('expected-cost', 'Counting up: expected number of coin flips', 'tests/loop-rules/induction/sprdwalk.heyvl', ['invariants'], [], 'proof', ['ast', 'past']), + variant('two-step', 'One- or two-step countdown: expected number of coin flips', 'tests/loop-rules/induction/linear01.heyvl', ['invariants'], [], 'proof', ['ast', 'past']), + ], + }, + { + id: 'two-sided-random-walks', + group: 'random-walks', + papers: ["mciver-2018"], + category: 'probabilistic', + title: 'Two-Sided Random Walks', + summary: + "Move toward or away from a target, with positive drift, adversarial choice, or parity-dependent steps. " + + "Caesar bounds the expected number of flips for positive drift and proves almost-sure termination for the adversarial and parity-dependent walks.", + topics: ['termination', 'runtime', 'probability'], + detailSlug: 'two-sided-random-walks', + variants: [ + variant('positive-drift', 'Positive drift: expected number of coin flips', 'tests/loop-rules/induction/rdwalk.heyvl', ['invariants']), + variant('main', 'Almost-sure termination under adversarial choice', 'tests/loop-rules/ast2018/demonically_fair.heyvl', ['ast'], [], 'proof', ['ast']), + variant('parity', 'Parity-dependent steps: almost-sure termination', 'tests/loop-rules/ast2018/ast-flipflop.heyvl', ['ast'], [], 'proof', ['ast']), + ], + }, + { + id: 'escaping-spline', + group: 'random-walks', + papers: ["mciver-2018"], + category: 'probabilistic', + title: 'Escaping Spline', + summary: + "Move to zero with probability $1/(x+1)$, otherwise increase the current state. " + + "Caesar verifies almost-sure termination even though the probability of reaching zero in one iteration decreases as the state grows.", + topics: ['termination', 'probability'], + detailSlug: 'escaping-spline', + variants: [variant('main', 'Almost-sure termination', 'tests/loop-rules/ast2018/escaping_spline.heyvl', ['ast'], [], 'proof', ['ast'])], + }, + { + id: 'zeroconf', + group: 'protocols', + papers: ['bohnenkamp-2003', 'kwiatkowska-2006', 'schroer-2023'], + category: 'probabilistic', + title: 'Zeroconf Address Allocation', + summary: + "Probe one candidate network address for a conflict. " + + "Caesar verifies an upper bound on the probability of avoiding an undetected collision using recursive specifications.", + topics: ['protocols', 'probability', 'axioms', 'functions'], + detailSlug: 'zeroconf', + variants: [variant('main', 'Upper bound on avoiding an undetected collision', 'tests/case-studies/zeroconf.heyvl', ['recursion'], eMatching)], + }, + { + id: 'bounded-retransmission', + group: 'protocols', + papers: ['helmink-1994', 'dargenio-2001', 'van-jaarsveld-2025', 'schroer-2023', 'schroer-cav-2026'], + category: 'probabilistic', + title: 'Bounded Retransmission Protocol', + summary: + "Send packets over a lossy channel, retrying each packet up to a fixed limit. " + + "Caesar bounds success and failure probabilities and the expected numbers of attempts, failed attempts, and sent packets.", + topics: ['protocols', 'probability', 'expectation', 'runtime', 'axioms', 'functions'], + detailSlug: 'bounded-retransmission', + variants: [ + variant('combined', 'Complete message: failure probability and failed attempts', 'tests/case-studies/brp/combined.heyvl', ['invariants'], eMatching), + variant('success', 'Lower bound on success probability', 'tests/case-studies/brp/success.heyvl', ['invariants'], eMatching), + variant('termination', 'Transmission and packet attempts: finite and geometric bounds', 'tests/case-studies/brp/termination.heyvl', ['invariants']), + variant('failed', 'Single-packet failures and abstract packet costs', 'tests/case-studies/brp/failed.heyvl', ['invariants']), + variant('sent', 'Expected number of sent packets', 'tests/case-studies/brp/sent.heyvl', ['invariants']), + ], + }, + { + id: 'rabin-mutual-exclusion', + group: 'protocols', + papers: ['kushilevitz-rabin-1992', 'hurd-2004', 'schroer-2023'], + category: 'probabilistic', + title: 'Rabin’s Mutual-Exclusion Algorithm', + summary: + "Contenders repeatedly flip coins to decide whether to withdraw, aiming to leave one survivor. " + + "For multiple contenders, Caesar proves that the probability of ending with no survivors is at most $1/3$.", + topics: ['protocols', 'probability', 'functions'], + detailSlug: 'rabin-mutual-exclusion', + variants: [ + variant('nested', 'Upper bound on the probability of no survivors', 'tests/loop-rules/induction/rabin_hurd2004.heyvl', ['invariants'], eMatching), + ], + }, + { + id: 'selection-sort', + group: 'data-structures', + category: 'boolean', + title: 'Selection Sort', + summary: + "Sort an integer list by repeatedly selecting the smallest remaining element. " + + "Caesar uses Boolean loop invariants to prove that the result is nondecreasing and has the original length on termination.", + topics: ['lists'], + detailSlug: 'selection-sort', + variants: [variant('main', 'Sortedness and length through loop invariants', 'tests/boolean/algorithms/selection_sort.heyvl', ['invariants'])], + }, + { + id: 'symbolic-lists', + group: 'data-structures', + category: 'boolean', + title: 'Symbolic List Operations', + summary: + "Update, append to, and read the last element of a symbolic linked list. " + + "Caesar uses recursive specifications to prove that the operations return the specified lengths and elements on termination.", + topics: ['lists', 'axioms', 'functions'], + variants: [variant('main', 'Updating and extending lists', 'tests/boolean/algorithms/list_operations.heyvl', ['recursion'])], + }, + { + id: 'left-padding', + group: 'data-structures', + category: 'boolean', + title: 'Left Padding', + summary: + "Prepend a chosen value until a list reaches the requested width. " + + "Caesar verifies the output length, padding values, and preservation of the original list as a suffix.", + topics: ['lists', 'axioms', 'functions'], + variants: [variant('main', 'Length, padding, and the original suffix', 'tests/boolean/algorithms/left_pad.heyvl', ['recursion'])], + }, + { + id: 'lossy-list', + group: 'data-structures', + category: 'probabilistic', + title: 'Lossy List Traversal', + summary: + "Traverse a list while each step has a chance of a memory fault. " + + "For a list of length $n$, Caesar verifies a success probability of at least $2^{-n}$.", + topics: ['lists', 'probability', 'axioms', 'functions'], + variants: [variant('main', 'Success probability for any list length', 'tests/loop-rules/induction/chain/lossy_list.heyvl', ['invariants'], eMatching)], + }, + { + id: 'binary-search-trees', + group: 'data-structures', + papers: ['bjorner-2019'], + category: 'boolean', + title: 'Binary Search Trees', + summary: + "Look up and insert values, and find the minimum and maximum in a binary search tree. " + + "Under the domain axioms, Caesar proves that queries return the specified values and insertion preserves tree ordering on termination.", + topics: ['trees', 'axioms', 'functions'], + detailSlug: 'binary-search-trees', + variants: [variant('main', 'Membership, extrema, and insertion', 'tests/boolean/algorithms/binary_search_trees.heyvl', ['recursion'], computation)], + }, +]; + +export function getExample(id) { + const example = examples.find((entry) => entry.id === id); + if (!example) throw new Error(`Unknown example: ${id}`); + return example; +} diff --git a/website/src/heyvl-examples/exampleFilters.mjs b/website/src/heyvl-examples/exampleFilters.mjs new file mode 100644 index 00000000..2bf91007 --- /dev/null +++ b/website/src/heyvl-examples/exampleFilters.mjs @@ -0,0 +1,63 @@ +export const EMPTY_FILTERS = Object.freeze({q: '', category: '', topics: Object.freeze([]), techniques: Object.freeze([])}); + +function knownFacet(value, items) { + return !items || items.some((item) => item.id === value) ? value : ''; +} + +export function readFilters(search, facets = {}) { + const params = new URLSearchParams(search); + const selectedTopics = params.getAll('topic'); + const legacyOutcome = params.get('outcome'); + if (['proof', 'refutation'].includes(legacyOutcome)) selectedTopics.push(legacyOutcome); + return { + q: params.get('q') || '', + category: knownFacet(params.get('category') || '', facets.categories), + topics: [...new Set(selectedTopics)].filter((value) => value && knownFacet(value, facets.topics)), + techniques: [...new Set(params.getAll('technique'))].filter((value) => value && knownFacet(value, facets.techniques)), + }; +} + +export function writeFilters(filters, existingSearch = '') { + const params = new URLSearchParams(existingSearch); + for (const key of ['q', 'category', 'topic', 'technique', 'outcome']) params.delete(key); + if (filters.q) params.set('q', filters.q); + if (filters.category) params.set('category', filters.category); + for (const topic of new Set(filters.topics)) params.append('topic', topic); + for (const technique of new Set(filters.techniques)) params.append('technique', technique); + const query = params.toString(); + return query ? `?${query}` : ''; +} + +function facetText(ids, items = []) { + const facets = new Map(items.map((item) => [item.id, item])); + return ids.flatMap((id) => [id, facets.get(id)?.label || '', facets.get(id)?.title || '']).join(' '); +} + +export function filterExamples(entries, filters = EMPTY_FILTERS, facets = {}) { + const queryTerms = (filters.q || '').trim().toLocaleLowerCase('en').split(/\s+/).filter(Boolean); + return entries.flatMap((entry) => { + if (filters.category && entry.category !== filters.category) return []; + const entryText = `${entry.title} ${entry.summary} ${facetText(entry.topics, facets.topics)} ${facetText([entry.category], facets.categories)} ${facetText(entry.papers || [], facets.papers)}`; + const variants = entry.variants.filter((variant) => { + if (filters.techniques.length && !filters.techniques.some((technique) => variant.techniques.includes(technique))) return false; + const variantTopics = [...entry.topics, ...(variant.topics || []), variant.outcome]; + if (filters.topics.length && !filters.topics.some((topic) => variantTopics.includes(topic))) return false; + const searchableText = `${entryText} ${variant.label} ${variant.sourcePath} ${facetText(variant.techniques, facets.techniques)} ${facetText(variant.topics || [], facets.topics)} ${variant.outcome}`.toLocaleLowerCase('en'); + return queryTerms.every((term) => searchableText.includes(term)); + }); + return variants.length ? [{...entry, variants}] : []; + }); +} + +export function githubSourceUrl(sourcePath) { + return `https://github.com/moves-rwth/caesar/blob/main/${sourcePath.split('/').map(encodeURIComponent).join('/')}`; +} + +function shellWord(value) { + return /^[\w./:=+-]+$/.test(value) ? value : `'${value.replaceAll("'", "'\\''")}'`; +} + +export function exampleCommand(variant) { + const filename = variant.sourcePath.split('/').at(-1); + return ['caesar', 'verify', filename, ...variant.args].map(shellWord).join(' '); +} diff --git a/website/src/heyvl-examples/exampleFilters.test.mjs b/website/src/heyvl-examples/exampleFilters.test.mjs new file mode 100644 index 00000000..649a9503 --- /dev/null +++ b/website/src/heyvl-examples/exampleFilters.test.mjs @@ -0,0 +1,168 @@ +import assert from 'node:assert/strict'; +import test from 'node:test'; +import {EMPTY_FILTERS, exampleCommand, filterExamples, githubSourceUrl, readFilters, writeFilters} from './exampleFilters.mjs'; + +const facets = { + categories: [{id: 'boolean', label: 'Boolean'}, {id: 'probabilistic', label: 'Probabilistic'}, {id: 'quantitative', label: 'Quantitative'}], + topics: [{id: 'probability', label: 'Probability'}, {id: 'algorithms', label: 'Algorithms'}, {id: 'proof', label: 'Proof'}, {id: 'refutation', label: 'Refutation'}], + techniques: [{id: 'induction', label: 'k-induction'}, {id: 'unroll', label: 'Bounded unrolling'}, {id: 'recursion', label: 'Recursion'}], + papers: [{id: 'example-paper', label: 'Example et al. (2018)', title: 'A Method for Reasoning about Coin Flips', url: 'https://example.com/paper'}], +}; + +const entries = [ + { + id: 'geometric', title: 'Geometric loop', summary: 'Bounds on the expected number of flips showing tails.', category: 'probabilistic', topics: ['probability'], papers: ['example-paper'], + variants: [ + {id: 'upper', label: 'Two-step upper bound', sourcePath: 'tests/geo-upper.heyvl', techniques: ['induction'], outcome: 'proof', args: []}, + {id: 'refuted', label: 'Twelve-step counterexample', sourcePath: 'tests/geo-refuted.heyvl', techniques: ['unroll'], outcome: 'refutation', args: ['--slice-error-first']}, + ], + }, + { + id: 'binary-tree', title: 'Binary search trees', summary: 'Search and insert values.', category: 'boolean', topics: ['algorithms'], + variants: [{id: 'recursive', label: 'Recursive contracts', sourcePath: 'tests/tree.heyvl', techniques: ['recursion'], outcome: 'proof', args: ['--max-fuel', '8']}], + }, +]; + +const filter = (overrides) => filterExamples(entries, {...EMPTY_FILTERS, ...overrides}, facets); + +function variantIds(result) { + return result.flatMap((entry) => entry.variants.map((variant) => variant.id)); +} + +test('filtering preserves the editorial catalog order and does not mutate entries', () => { + const result = filter({}); + assert.deepEqual(result.map((entry) => entry.id), ['geometric', 'binary-tree']); + assert.deepEqual(entries.map((entry) => entry.id), ['geometric', 'binary-tree']); + assert.equal(result[0].variants.length, 2); + assert.notEqual(result[0], entries[0]); +}); + +test('filtered subsets retain the authored order regardless of title or explanation', () => { + const catalog = [ + {...entries[0], id: 'zebra-source', title: 'Zebra source'}, + {...entries[0], id: 'zebra-guide', title: 'Zebra guide', detailSlug: 'zebra-guide'}, + {...entries[0], id: 'alpha-source', title: 'Alpha source'}, + {...entries[0], id: 'alpha-guide', title: 'Alpha guide', detailSlug: 'alpha-guide'}, + ]; + const result = filterExamples(catalog, EMPTY_FILTERS, facets); + assert.deepEqual(result.map((entry) => entry.id), ['zebra-source', 'zebra-guide', 'alpha-source', 'alpha-guide']); + const filtered = filterExamples(catalog, {...EMPTY_FILTERS, q: 'zebra'}, facets); + assert.deepEqual(filtered.map((entry) => entry.id), ['zebra-source', 'zebra-guide']); +}); + +test('selected topics form a union, including outcomes derived per variant', () => { + assert.deepEqual(variantIds(filter({topics: ['probability', 'algorithms']})), ['upper', 'refuted', 'recursive']); + assert.deepEqual(variantIds(filter({topics: ['refutation', 'algorithms']})), ['refuted', 'recursive']); + assert.deepEqual(variantIds(filter({topics: ['proof', 'refutation']})), ['upper', 'refuted', 'recursive']); + assert.deepEqual(entries[0].topics, ['probability']); +}); + +test('selected techniques form a union and combine with the selected topic group', () => { + assert.deepEqual(variantIds(filter({techniques: ['induction', 'recursion']})), ['upper', 'recursive']); + assert.deepEqual(variantIds(filter({techniques: ['induction', 'unroll'], topics: ['refutation']})), ['refuted']); +}); + +test('technique and outcome topic must match the same variant', () => { + assert.deepEqual(filter({techniques: ['induction'], topics: ['refutation']}), []); + assert.deepEqual(variantIds(filter({techniques: ['unroll'], topics: ['refutation']})), ['refuted']); + assert.equal(entries[0].variants.length, 2); +}); + +test('variant properties and proof techniques must match the same variant', () => { + const terminationFacets = { + ...facets, + topics: [...facets.topics, {id: 'ast', label: 'Almost-sure termination'}, {id: 'past', label: 'Positive almost-sure termination'}], + techniques: [{id: 'ast-rule', label: '@ast rule'}, {id: 'past-rule', label: '@past rule'}], + }; + const countdown = { + id: 'countdown', title: 'Countdown', summary: 'A decreasing counter.', category: 'probabilistic', topics: ['probability'], + variants: [ + {id: 'first', label: 'First argument', sourcePath: 'tests/countdown-a.heyvl', techniques: ['ast-rule'], topics: ['ast'], outcome: 'proof', args: []}, + {id: 'second', label: 'Second argument', sourcePath: 'tests/countdown-b.heyvl', techniques: ['past-rule'], topics: ['ast', 'past'], outcome: 'proof', args: []}, + ], + }; + const find = (overrides) => filterExamples([countdown], {...EMPTY_FILTERS, ...overrides}, terminationFacets); + + assert.deepEqual(find({techniques: ['ast-rule'], topics: ['past']}), []); + assert.deepEqual(variantIds(find({techniques: ['past-rule'], topics: ['past']})), ['second']); + assert.deepEqual(variantIds(find({topics: ['ast']})), ['first', 'second']); + assert.deepEqual(variantIds(find({q: 'positive almost-sure'})), ['second']); + assert.deepEqual(variantIds(find({q: 'past'})), ['second']); + assert.deepEqual(find({q: 'positive', techniques: ['ast-rule']}), []); + assert.deepEqual(find({q: 'first positive'}), []); + assert.deepEqual(countdown.topics, ['probability']); + assert.equal(countdown.variants.length, 2); +}); + +test('query words cannot match two different variants', () => { + assert.deepEqual(filter({q: 'two-step counterexample'}), []); + assert.deepEqual(filter({q: 'two-step', topics: ['refutation']}), []); + assert.deepEqual(filter({q: 'counterexample', techniques: ['induction']}), []); +}); + +test('category, topic, technique, and query groups combine by intersection', () => { + const result = filter({q: 'COUNTER bounded', category: 'probabilistic', topics: ['probability', 'refutation'], techniques: ['unroll']}); + assert.deepEqual(variantIds(result), ['refuted']); + assert.deepEqual(filter({q: 'counter', category: 'boolean'}), []); + assert.deepEqual(filter({category: 'quantitative'}), []); +}); + +test('search includes titles, topics, category labels, techniques, and source filenames', () => { + assert.equal(filter({q: 'binary values boolean'})[0].id, 'binary-tree'); + assert.equal(filter({q: 'probability k-induction'})[0].variants[0].id, 'upper'); + assert.equal(filter({q: 'geo-refuted.heyvl'})[0].variants[0].id, 'refuted'); +}); + +test('paper authors, titles, and years are searchable entry metadata', () => { + const result = filter({q: 'Example 2018', techniques: ['unroll']}); + assert.deepEqual(variantIds(result), ['refuted']); + assert.deepEqual(variantIds(filter({q: 'reasoning coin flips', techniques: ['unroll']})), ['refuted']); + assert.deepEqual(filter({q: '2019'}), []); +}); + +test('empty searches show all entries and unmatched searches return no results', () => { + assert.equal(filter({q: ' \t '}).length, 2); + assert.deepEqual(filter({q: 'does-not-exist'}), []); + assert.deepEqual(filterExamples([], EMPTY_FILTERS, facets), []); +}); + +test('URL round trips preserve repeated selections, Unicode, and unrelated parameters', () => { + const filters = {q: 'counter ≤ 1 ', category: 'probabilistic', topics: ['probability', 'refutation'], techniques: ['unroll', 'induction']}; + const search = writeFilters(filters, '?utm_source=docs&q=old&q=duplicate'); + assert.deepEqual(readFilters(search, facets), filters); + assert.equal(new URLSearchParams(search).get('utm_source'), 'docs'); + assert.equal(new URLSearchParams(search).getAll('q').length, 1); + assert.deepEqual(new URLSearchParams(search).getAll('topic'), ['probability', 'refutation']); + assert.deepEqual(new URLSearchParams(search).getAll('technique'), ['unroll', 'induction']); + assert.equal(writeFilters(EMPTY_FILTERS, search), '?utm_source=docs'); + assert.equal(writeFilters(EMPTY_FILTERS), ''); +}); + +test('legacy outcome and single-technique links migrate to checkbox filters', () => { + const filters = readFilters('?topic=probability&outcome=refutation&technique=unroll', facets); + assert.deepEqual(filters, {...EMPTY_FILTERS, topics: ['probability', 'refutation'], techniques: ['unroll']}); + const updated = new URLSearchParams(writeFilters(filters, '?outcome=refutation')); + assert.equal(updated.has('outcome'), false); + assert.deepEqual(updated.getAll('topic'), ['probability', 'refutation']); + assert.deepEqual(readFilters('?topic=refutation&outcome=refutation&technique=unroll&technique=unroll', facets), {...EMPTY_FILTERS, topics: ['refutation'], techniques: ['unroll']}); +}); + +test('restoring earlier URLs restores corresponding categories and checkbox choices', () => { + const earlier = writeFilters({...EMPTY_FILTERS, category: 'boolean', topics: ['proof'], techniques: ['recursion']}); + const later = writeFilters({...EMPTY_FILTERS, topics: ['refutation'], techniques: ['unroll', 'induction']}); + assert.deepEqual(variantIds(filterExamples(entries, readFilters(later, facets), facets)), ['refuted']); + assert.deepEqual(variantIds(filterExamples(entries, readFilters(earlier, facets), facets)), ['recursive']); + assert.deepEqual(readFilters('', facets), EMPTY_FILTERS); +}); + +test('unknown and repeated filter values restore as valid deduplicated controls', () => { + assert.deepEqual(readFilters('?q=tree&category=unknown&topic=missing&technique=old&outcome=timeout', facets), {...EMPTY_FILTERS, q: 'tree'}); + assert.deepEqual(readFilters('?topic=proof&topic=proof&technique=recursion&technique=recursion', facets), {...EMPTY_FILTERS, topics: ['proof'], techniques: ['recursion']}); +}); + +test('download commands preserve required arguments and shell quoting', () => { + assert.equal(exampleCommand(entries[1].variants[0]), 'caesar verify tree.heyvl --max-fuel 8'); + assert.equal(exampleCommand(entries[0].variants[1]), 'caesar verify geo-refuted.heyvl --slice-error-first'); + assert.equal(exampleCommand({sourcePath: 'tests/a b.heyvl', args: ['--filter', "a'b"]}), "caesar verify 'a b.heyvl' --filter 'a'\\''b'"); + assert.equal(githubSourceUrl('tests/a b.heyvl'), 'https://github.com/moves-rwth/caesar/blob/main/tests/a%20b.heyvl'); +}); diff --git a/website/src/heyvl-examples/figures/ExecutionDiagram.tsx b/website/src/heyvl-examples/figures/ExecutionDiagram.tsx new file mode 100644 index 00000000..1d7fefee --- /dev/null +++ b/website/src/heyvl-examples/figures/ExecutionDiagram.tsx @@ -0,0 +1,208 @@ +import React, {useId} from 'react'; +import styles from './Figure.module.css'; + +type Kind = 'escaping-spline' | 'countdown' | 'packet-retries' | 'geometric-loop' | 'zeroconf'; +type State = {x: number; y: number; label: string; radius?: number; terminal?: boolean; textOnly?: boolean}; +type Edge = {path: string; label: string; x: number; y: number}; +type Diagram = { + width: number; + height: number; + radius?: number; + fontSize?: number; + initial: {path: string; state: number}; + title: string; + description: string; + states: State[]; + edges: Edge[]; + notes?: {x: number; y: number; label: string}[]; +}; + +const diagrams: Record = { + // Adapted from Bohnenkamp et al. (2003), Figure 1, with detection ending this address choice. + zeroconf: { + width: 500, height: 252, + initial: {path: 'M 1 70 H 37', state: 0}, + title: 'One Zeroconf address choice with three probes', + description: + 'An incoming arrow marks the address choice. ' + + 'With probability 1−c the address is free, and with probability c probing starts with three probes remaining. ' + + 'Each probe detects the collision with probability 1−q; otherwise, one fewer probe remains. ' + + 'Free and detected return true, while three unsuccessful attempts leave the collision undetected and return false.', + states: [ + {x: 44, y: 70, label: '', radius: 7}, + {x: 146, y: 70, label: '3'}, + {x: 248, y: 70, label: '2'}, + {x: 350, y: 70, label: '1'}, + {x: 44, y: 18, label: '', radius: 7, terminal: true}, + {x: 220, y: 200, label: '', radius: 7, terminal: true}, + {x: 455, y: 70, label: '', radius: 7, terminal: true}, + ], + edges: [ + {path: 'M 44 63 V 29', label: '1 − c', x: 85, y: 46}, + {path: 'M 51 70 H 125', label: 'c', x: 88, y: 50}, + {path: 'M 167 70 H 227', label: 'q', x: 197, y: 50}, + {path: 'M 269 70 H 329', label: 'q', x: 299, y: 50}, + {path: 'M 371 70 H 444', label: 'q', x: 407, y: 50}, + {path: 'M 146 91 L 214 191', label: '1 − q', x: 120, y: 142}, + {path: 'M 248 91 L 223 189', label: '1 − q', x: 279, y: 141}, + {path: 'M 338 87 Q 306 200 231 200', label: '1 − q', x: 345, y: 183}, + ], + notes: [ + {x: 44, y: 109, label: 'choose'}, + {x: 84, y: 18, label: 'free'}, + {x: 220, y: 230, label: 'detected'}, + {x: 455, y: 109, label: 'missed'}, + {x: 248, y: 14, label: 'probes left'}, + {x: 422, y: 14, label: 'M = 3'}, + ], + }, + 'geometric-loop': { + width: 460, height: 179, + initial: {path: 'M 128 2 V 29', state: 0}, + title: 'Geometric loop starting with count zero and running true', + description: + 'An incoming arrow marks count zero with running true. ' + + 'Each fair coin flip either advances along the upper row and increments count on tails, or moves to the stopped state at the same count on heads. ' + + 'The chain continues to arbitrarily large counts.', + states: [ + {x: 128, y: 50, label: '0'}, + {x: 240, y: 50, label: '1'}, + {x: 352, y: 50, label: '2'}, + {x: 128, y: 139, label: '0', terminal: true}, + {x: 240, y: 139, label: '1', terminal: true}, + {x: 352, y: 139, label: '2', terminal: true}, + ], + edges: [ + {path: 'M 149 50 H 219', label: '½', x: 184, y: 31}, + {path: 'M 261 50 H 331', label: '½', x: 296, y: 31}, + {path: 'M 373 50 H 420', label: '½', x: 402, y: 31}, + {path: 'M 128 71 V 114', label: '½', x: 151, y: 94}, + {path: 'M 240 71 V 114', label: '½', x: 263, y: 94}, + {path: 'M 352 71 V 114', label: '½', x: 375, y: 94}, + ], + notes: [ + {x: 240, y: 10, label: 'count'}, + {x: 42, y: 50, label: 'running'}, + {x: 42, y: 139, label: 'stopped'}, + {x: 435, y: 50, label: '…'}, + {x: 435, y: 139, label: '…'}, + ], + }, + // The spline layout follows McIver et al. (2018), Section 5.4, Figure 4. + 'escaping-spline': { + width: 460, height: 210, + initial: {path: 'M 140 2 V 37', state: 1}, + title: 'Escaping spline', + description: + 'An incoming arrow marks the initial position one. ' + + 'From each positive position x, one iteration jumps to zero with probability 1/(x+1), or advances to x+1 with probability x/(x+1), and zero ends the execution.', + states: [ + {x: 34, y: 58, label: '0', terminal: true}, + {x: 140, y: 58, label: '1'}, + {x: 246, y: 58, label: '2'}, + {x: 352, y: 58, label: '3'}, + ], + edges: [ + {path: 'M 161 58 Q 193 24 225 58', label: '½', x: 193, y: 19}, + {path: 'M 267 58 Q 299 24 331 58', label: '⅔', x: 299, y: 19}, + {path: 'M 373 58 Q 399 30 421 49', label: '¾', x: 402, y: 19}, + {path: 'M 119 58 H 60', label: '½', x: 88, y: 43}, + {path: 'M 232 74 C 185 135 107 135 48 79', label: '⅓', x: 145, y: 140}, + {path: 'M 340 76 C 260 190 104 190 48 79', label: '¼', x: 210, y: 187}, + ], + notes: [{x: 432, y: 58, label: '…'}], + }, + countdown: { + width: 112, height: 168, radius: 11, fontSize: 17, + initial: {path: 'M 32 1 V 13', state: 0}, + title: 'Countdown from three', + description: + 'An incoming arrow marks the initial counter value three. ' + + 'The chain runs downward to zero, with probability one half of decreasing and probability one half of taking the self-loop at each positive counter value.', + states: [ + {x: 32, y: 24, label: '3'}, + {x: 32, y: 64, label: '2'}, + {x: 32, y: 104, label: '1'}, + {x: 32, y: 144, label: '0', terminal: true}, + ], + edges: [ + {path: 'M 32 35 V 53', label: '½', x: 15, y: 44}, + {path: 'M 32 75 V 93', label: '½', x: 15, y: 84}, + {path: 'M 32 115 V 129', label: '½', x: 15, y: 122}, + {path: 'M 41 17 C 89 -1 89 49 41 31', label: '½', x: 96, y: 24}, + {path: 'M 41 57 C 89 39 89 89 41 71', label: '½', x: 96, y: 64}, + {path: 'M 41 97 C 89 79 89 129 41 111', label: '½', x: 96, y: 104}, + ], + }, + 'packet-retries': { + width: 460, height: 188, + initial: {path: 'M 1 54 H 19', state: 0}, + title: 'Packet retries with three allowed attempts', + description: + 'An incoming arrow marks the initial state with zero failures. ' + + 'The sender receives an acknowledgement with probability p or adds one failure with probability 1−p, and the third failure exhausts the attempt limit.', + states: [ + {x: 40, y: 54, label: '0'}, + {x: 155, y: 54, label: '1'}, + {x: 270, y: 54, label: '2'}, + {x: 414, y: 54, label: 'give up', textOnly: true}, + {x: 210, y: 168, label: 'success', textOnly: true}, + ], + edges: [ + {path: 'M 61 54 H 134', label: '1 − p', x: 98, y: 34}, + {path: 'M 176 54 H 249', label: '1 − p', x: 212, y: 34}, + {path: 'M 291 54 H 364', label: '1 − p', x: 328, y: 34}, + {path: 'M 40 75 Q 40 168 151 168', label: 'p', x: 28, y: 132}, + {path: 'M 164 73 L 198 151', label: 'p', x: 162, y: 111}, + {path: 'M 261 73 L 222 151', label: 'p', x: 269, y: 111}, + ], + notes: [{x: 40, y: 12, label: 'failed'}, {x: 414, y: 87, label: 'MAX = 3'}], + }, +}; + +export default function ExecutionDiagram({kind, children}: {kind: Kind; children: React.ReactNode}) { + const id = useId(); + const diagram = diagrams[kind]; + const arrow = `${id}-arrow`; + const radius = diagram.radius ?? 21; + const width = Math.min(diagram.width, 288); + const markerSize = 5 * diagram.width / width; + return ( +
+
+
{children}
+ + {diagram.title} + {diagram.description} + + + + + + + {diagram.edges.map((edge, index) => ( + + ))} + {diagram.states.map(({x, y, label, terminal, textOnly, radius: stateRadius = radius}, index) => ( + + {!textOnly && <> + {terminal && } + + } + {label} + + ))} + {diagram.edges.map((edge, index) => ( + {edge.label} + ))} + {diagram.notes?.map((note, index) => ( + {note.label} + ))} + +
+
+ ); +} diff --git a/website/src/heyvl-examples/figures/FastDiceRollerPrefix.module.css b/website/src/heyvl-examples/figures/FastDiceRollerPrefix.module.css new file mode 100644 index 00000000..b6e0e2db --- /dev/null +++ b/website/src/heyvl-examples/figures/FastDiceRollerPrefix.module.css @@ -0,0 +1,78 @@ +.figure { + margin-block: 1.25rem; + padding: clamp(0.7rem, 2vw, 1rem); + border: 1px solid var(--ifm-color-emphasis-300); + border-radius: var(--ifm-global-radius); + background: var(--ifm-background-surface-color); + font-size: 0.875rem; +} + +.caption, +.legend { + display: flex; + flex-wrap: wrap; + gap: 0.25rem 0.9rem; +} + +.caption { + justify-content: space-between; + margin-bottom: 0.8rem; +} + +.legend > span { + display: inline-flex; + align-items: center; + gap: 0.3rem; +} + +.legend [aria-hidden] { + width: 0.8rem; + height: 0.8rem; + border-radius: 2px; +} + +.figure :is(.iterations, .strip) { + margin: 0; + padding: 0; + list-style: none; +} + +.figure .iterations > li { + margin: 0; +} + +.figure .iterations { + display: grid; + gap: 0.9rem; +} + +.heading { + display: block; + margin-bottom: 0.2rem; +} + +.strip { + display: grid; + grid-template-columns: repeat(8, minmax(0, 1fr)); + font-variant-numeric: tabular-nums; + text-align: center; +} + +.figure .strip > li { + margin: 0 1px; + padding-block: 0.2rem; + border-radius: 2px; + white-space: nowrap; +} + +.returned { + background: color-mix(in srgb, var(--ifm-color-primary) 16%, var(--ifm-background-surface-color)); +} + +.continuing { + background: var(--ifm-color-emphasis-200); +} + +.strip > .returned + .continuing { + border-inline-start: 1px solid var(--ifm-color-emphasis-700); +} diff --git a/website/src/heyvl-examples/figures/FastDiceRollerPrefix.tsx b/website/src/heyvl-examples/figures/FastDiceRollerPrefix.tsx new file mode 100644 index 00000000..4340ff39 --- /dev/null +++ b/website/src/heyvl-examples/figures/FastDiceRollerPrefix.tsx @@ -0,0 +1,49 @@ +import React from 'react'; +import styles from './FastDiceRollerPrefix.module.css'; + +const outcomeCount = 5; +const iterations = [ + {flip: 2, size: 4}, + {flip: 3, size: 8}, + {flip: 4, size: 6}, +]; + +export default function FastDiceRollerPrefix() { + return ( +
+
+ Fast Dice Roller with n = {outcomeCount} + + + + +
+
    + {iterations.map(({flip, size}) => { + const returns = size >= outcomeCount; + const description = returns + ? 'Values 0 through 4 return. The remaining values continue.' + : 'All values continue.'; + + return ( +
  1. + After flip {flip} +
      + {Array.from({length: size}, (_, value) => { + const returned = returns && value < outcomeCount; + const recycled = returns && !returned; + + return ( +
    1. + {recycled ? `${value}→${value - outcomeCount}` : value} +
    2. + ); + })} +
    +
  2. + ); + })} +
+
+ ); +} diff --git a/website/src/heyvl-examples/figures/Figure.module.css b/website/src/heyvl-examples/figures/Figure.module.css new file mode 100644 index 00000000..1dcb257e --- /dev/null +++ b/website/src/heyvl-examples/figures/Figure.module.css @@ -0,0 +1,122 @@ +.context { + container-type: inline-size; + margin-block: 0 1.25rem; +} + +.layout { + display: grid; + align-items: center; + gap: 0.75rem 1.5rem; +} + +.prose > :last-child { + margin-bottom: 0; +} + +.layout svg { + display: block; + width: min(100%, var(--diagram-width)); + height: auto; + overflow: visible; + color: var(--ifm-font-color-base); + font-family: KaTeX_Main, serif; + font-size: 24px; + text-anchor: middle; + dominant-baseline: middle; +} + +.edge, +.arrow { + fill: none; + stroke: var(--ifm-color-emphasis-700); + stroke-width: 1; + vector-effect: non-scaling-stroke; +} + +.state { + fill: var(--ifm-background-color); + stroke: var(--ifm-color-emphasis-700); + stroke-width: 1; + vector-effect: non-scaling-stroke; +} + +.layout text { + fill: currentColor; +} + +.probability { + font-size: 0.95em; +} + +.layout .note { + font-size: 21px; + fill: var(--ifm-color-content-secondary); +} + +.layout .plot { + font-size: 16px; +} + +.plotAxis { + fill: none; + stroke: var(--ifm-color-emphasis-600); + stroke-width: 1; + vector-effect: non-scaling-stroke; +} + +.plotCurve { + fill: none; + stroke: var(--ifm-color-primary); + stroke-width: 1.7; + vector-effect: non-scaling-stroke; +} + +.plotPoint { + fill: var(--ifm-color-primary); +} + +.plotThreshold { + stroke: var(--ifm-color-danger-dark); + stroke-dasharray: 4 4; + stroke-width: 1; + vector-effect: non-scaling-stroke; +} + +.plot .plotBound { + fill: var(--ifm-color-danger-dark); + text-anchor: start; +} + +.jumpInterval { + fill: var(--ifm-color-primary); + fill-opacity: 0.22; +} + +.jumpThreshold { + stroke: currentColor; + stroke-dasharray: 3 2; + stroke-width: 1; + vector-effect: non-scaling-stroke; +} + +.retryBaseline { + fill: none; + stroke: var(--ifm-color-content-secondary); + stroke-dasharray: 4 3; + stroke-width: 1.7; + vector-effect: non-scaling-stroke; +} + +@container (min-width: 21rem) { + .portrait { + grid-template-columns: minmax(0, 1fr) var(--diagram-width); + align-items: start; + column-gap: 0.75rem; + } +} + +@container (min-width: 36rem) { + .layout { + grid-template-columns: minmax(0, 1fr) var(--diagram-width); + } +} diff --git a/website/src/heyvl-examples/figures/RetryLatencyPlot.tsx b/website/src/heyvl-examples/figures/RetryLatencyPlot.tsx new file mode 100644 index 00000000..36122f89 --- /dev/null +++ b/website/src/heyvl-examples/figures/RetryLatencyPlot.tsx @@ -0,0 +1,56 @@ +import React, {useId} from 'react'; +import styles from './Figure.module.css'; + +const lastTime = 4.5; +const x = (seconds: number) => 54 + seconds * 55; +const y = (probability: number) => 126 - probability * 90; + +function survivalPath(cacheDelay: number, retryProbability: number) { + const segments = [`M ${x(0)} ${y(1)}`]; + for (let attempts = 1; cacheDelay + attempts <= lastTime; attempts += 1) { + segments.push(`H ${x(cacheDelay + attempts)} V ${y(retryProbability ** attempts)}`); + } + return [...segments, `H ${x(lastTime)}`].join(' '); +} + +export default function RetryLatencyPlot({children}: {children: React.ReactNode}) { + const id = useId(); + return ( +
+
+
{children}
+ + Probability of still waiting with and without a cache + + The uncached probability drops by a factor of two after each whole second. + The cached probability drops by a factor of three at 1.5 seconds and once per second thereafter. + At one second the uncached probability is one half and the cached probability is one. + At 2.5 seconds the probabilities are one quarter without a cache and one ninth with a cache. + + Chance of still waiting + + {[0, 0.5, 1].map(probability => ( + + + {probability * 100}% + + ))} + {[0, 1, 2, 3, 4].map(seconds => ( + + + {seconds} + + ))} + Elapsed time (s) + + + + Without cache + + With cache + +
+
+ ); +} diff --git a/website/src/heyvl-examples/figures/TortoiseHareJump.tsx b/website/src/heyvl-examples/figures/TortoiseHareJump.tsx new file mode 100644 index 00000000..fd1b48f1 --- /dev/null +++ b/website/src/heyvl-examples/figures/TortoiseHareJump.tsx @@ -0,0 +1,39 @@ +import React, {useId} from 'react'; +import styles from './Figure.module.css'; + +const boundaries = Array.from({length: 9}, (_, index) => index * 10 / 8); +const x = (distance: number) => 16 + distance * 28.8; +const finishThreshold = 3; + +export default function TortoiseHareJump({children}: {children: React.ReactNode}) { + const id = useId(); + return ( +
+
+
{children}
+ + The hare's jump intervals and the finish threshold + + The hare starts at zero and the tortoise advances from two to three. + If the hare moves, its possible jump distances from zero to ten are divided into eight equal intervals. + The highlighted interval from 2.5 to 3.75 contains both jumps that leave the race running and jumps longer than three that end it. + + Jump distance if the hare moves + Tortoise at 3 + + + {boundaries.map(distance => ( + + ))} + + {[0, 2.5, 3.75, 10].map(distance => ( + {distance} + ))} + Continue + Finish + +
+
+ ); +} diff --git a/website/src/heyvl-examples/figures/UnrollingPlot.tsx b/website/src/heyvl-examples/figures/UnrollingPlot.tsx new file mode 100644 index 00000000..5316632f --- /dev/null +++ b/website/src/heyvl-examples/figures/UnrollingPlot.tsx @@ -0,0 +1,51 @@ +import React, {useId} from 'react'; +import styles from './Figure.module.css'; + +// Caesar's k unfoldings include the final guard check before returning the counter. +const approximations = [10, 11, 12].map(depth => ({ + depth, + value: 1 - depth / 2 ** (depth - 1), +})); +const x = (depth: number) => 60 + (depth - 10) * 104; +const y = (value: number) => 130 - (value - 0.98) / 0.02 * 104; + +export default function UnrollingPlot({children}: {children: React.ReactNode}) { + const id = useId(); + return ( +
+
+
{children}
+ + Finite unrolling refutes the geometric loop's bound of 0.99 + + Starting with count zero and running true, the lower approximation is 251/256 after ten unfoldings, 1013/1024 after eleven, and 509/512 after twelve. + The twelfth approximation is the first to exceed 0.99. + The vertical axis is zoomed to the interval from 0.98 to one. + + + + 0.99 + {[0.98, 1].map(value => ( + + + {value.toFixed(2)} + + ))} + Lower approximation + `${x(point.depth)},${y(point.value)}`).join(' ')} className={styles.plotCurve} /> + {approximations.map(point => ( + + + + {point.depth} + + ))} + + 509/512 + Unfoldings + +
+
+ ); +} From 1ce23cee2153f6360bb4c16a02f4e6afd4c5c90b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:16:42 +0100 Subject: [PATCH 18/32] website: add citation and brand downloads to About --- website/docs/publications.md | 2 + website/docusaurus.config.js | 4 + website/src/components/CaesarCitation.tsx | 81 +++++ website/src/components/CaesarDownloads.js | 52 ++++ .../src/components/CaesarDownloads.module.css | 66 ++++ website/src/pages/_about.mdx | 84 +++++ website/src/pages/about.js | 103 ++----- website/src/pages/about.module.css | 32 ++ website/static/img/caesar-logo.png | Bin 0 -> 54819 bytes website/static/img/caesar-logo.svg | 286 ++++++++++++++++++ website/static/img/caesar-qr.pdf | Bin 0 -> 22572 bytes website/static/img/caesar-qr.png | Bin 0 -> 179958 bytes website/static/img/caesar-qr.svg | 17 ++ website/static/img/laurel.png | Bin 0 -> 51725 bytes 14 files changed, 642 insertions(+), 85 deletions(-) create mode 100644 website/src/components/CaesarCitation.tsx create mode 100644 website/src/components/CaesarDownloads.js create mode 100644 website/src/components/CaesarDownloads.module.css create mode 100644 website/src/pages/_about.mdx create mode 100644 website/src/pages/about.module.css create mode 100644 website/static/img/caesar-logo.png create mode 100644 website/static/img/caesar-logo.svg create mode 100644 website/static/img/caesar-qr.pdf create mode 100644 website/static/img/caesar-qr.png create mode 100644 website/static/img/caesar-qr.svg create mode 100644 website/static/img/laurel.png diff --git a/website/docs/publications.md b/website/docs/publications.md index 9f434074..6f256710 100644 --- a/website/docs/publications.md +++ b/website/docs/publications.md @@ -24,6 +24,8 @@ If you are interested in collaborations or simply have some questions, please re For Caesar as a verifier, cite the [CAV 2026 tool paper](#cav-26-caesar-a-deductive-verifier-for-probabilistic-programs) ([BibTeX](https://dblp.org/rec/conf/cav/SchroerBDHKKM26.html?view=bibtex)). For HeyVL and the foundations of the verification infrastructure, cite the [OOPSLA 2023 paper](#oopsla-23) ([BibTeX](https://dblp.org/rec/journals/pacmpl/SchroerBKKM23.html?view=bibtex)). +Copy the BibTeX entries or download the logo and QR code from [Cite and Share](/about#cite-and-share). + ::: **Overview:** diff --git a/website/docusaurus.config.js b/website/docusaurus.config.js index 9522ce15..a417c7fa 100644 --- a/website/docusaurus.config.js +++ b/website/docusaurus.config.js @@ -278,6 +278,10 @@ const config = { label: 'About', to: '/about', }, + { + label: 'Cite and Share', + to: '/about#cite-and-share', + }, { label: 'News', to: '/blog', diff --git a/website/src/components/CaesarCitation.tsx b/website/src/components/CaesarCitation.tsx new file mode 100644 index 00000000..4d8324d4 --- /dev/null +++ b/website/src/components/CaesarCitation.tsx @@ -0,0 +1,81 @@ +import React, {useState} from 'react'; +import Citation from './Citation'; +import {references} from '../data/references'; + +const toolPaper = String.raw`@inproceedings{SchroerBatzEtAl2026Caesar, + author = {Schr{\"o}er, Philipp and Batz, Kevin and Dural, Umut Yi{\u{g}}it and + Haase, Darion and Kaminski, Benjamin Lucien and Katoen, Joost-Pieter and + Matheja, Christoph}, + title = {{Caesar}: A Deductive Verifier for Probabilistic Programs}, + booktitle = {Computer Aided Verification}, + editor = {Darulova, Eva and Lin, Anthony W. and R{\"u}mmer, Philipp}, + series = {Lecture Notes in Computer Science}, + volume = {16684}, + pages = {565--582}, + publisher = {Springer}, + year = {2026}, + doi = {10.1007/978-3-032-32537-2_27}, +}`; + +const foundationsPaper = String.raw`@article{SchroerBatzEtAl2023HeyVL, + author = {Schr{\"o}er, Philipp and Batz, Kevin and Kaminski, Benjamin Lucien and + Katoen, Joost-Pieter and Matheja, Christoph}, + title = {A Deductive Verification Infrastructure for Probabilistic Programs}, + journal = {Proceedings of the {ACM} on Programming Languages}, + volume = {7}, + number = {OOPSLA2}, + pages = {2052--2082}, + year = {2023}, + doi = {10.1145/3622870}, +}`; + +function BibTeXActions({bibtex, conference, filename}: {bibtex: string; conference: string; filename: string}) { + const [status, setStatus] = useState<'idle' | 'copied' | 'unavailable'>('idle'); + + async function copy() { + try { + await navigator.clipboard.writeText(bibtex); + setStatus('copied'); + } catch { + setStatus('unavailable'); + } + } + + return <> + + {' '} + + Download .bib + + + {status === 'copied' && ' Copied to clipboard.'} + {status === 'unavailable' && ' Clipboard unavailable. Use the download link.'} + + ; +} + +export default function CaesarCitation() { + return
    +
  • +

    For Caesar as a verifier, cite the CAV 2026 tool paper.

    + + + +
  • +
  • +

    For HeyVL and the foundations of the verification infrastructure, cite the OOPSLA 2023 paper.

    + + + +
  • +
; +} diff --git a/website/src/components/CaesarDownloads.js b/website/src/components/CaesarDownloads.js new file mode 100644 index 00000000..c023c9df --- /dev/null +++ b/website/src/components/CaesarDownloads.js @@ -0,0 +1,52 @@ +import React from 'react'; +import Link from '@docusaurus/Link'; +import useBaseUrl from '@docusaurus/useBaseUrl'; +import styles from './CaesarDownloads.module.css'; + +function DownloadLinks({asset, label, formats}) { + const baseUrl = useBaseUrl(`/img/${asset}`); + + return + {formats.map((format) => ( + + {format.toUpperCase()} + + ))} + ; +} + +export default function CaesarDownloads() { + const logoUrl = useBaseUrl('/img/caesar-logo.svg'); + const qrUrl = useBaseUrl('/img/caesar-qr.svg'); + + return ( +
+
+

Caesar Logo

+
+ Caesar name and laurel +
+
+
+
With Name
+
+
+
+
Laurel
+
+
+
+
+
+

Website QR Code

+
+ Green QR code with the Caesar laurel at its center +
+
+ caesarverifier.org + +
+
+
+ ); +} diff --git a/website/src/components/CaesarDownloads.module.css b/website/src/components/CaesarDownloads.module.css new file mode 100644 index 00000000..727b739f --- /dev/null +++ b/website/src/components/CaesarDownloads.module.css @@ -0,0 +1,66 @@ +.assets { + display: grid; + grid-template-columns: repeat(2, minmax(0, 1fr)); + gap: 0.75rem; +} + +.asset { + padding: 0.875rem; + border: 1px solid var(--ifm-color-emphasis-200); + border-radius: var(--ifm-global-radius); +} + +.asset h4 { + margin-bottom: 0.5rem; +} + +.assetPreview { + display: grid; + place-items: center; + min-height: 8rem; + margin-bottom: 0.75rem; + background: #fff; + border: 1px solid var(--ifm-color-emphasis-200); + border-radius: var(--ifm-global-radius); +} + +.logo { + width: min(72%, 10rem); + height: auto; +} + +.qr { + display: block; +} + +.logoDownloads { + margin-bottom: 0; +} + +.logoDownloads > div, +.assetLinks, +.downloadLinks { + display: flex; + flex-wrap: wrap; + align-items: baseline; + gap: 0.25rem 0.75rem; +} + +.logoDownloads > div, +.assetLinks { + justify-content: space-between; +} + +.logoDownloads dd { + margin: 0; +} + +.downloadLinks a { + font-weight: 600; +} + +@media (max-width: 620px) { + .assets { + grid-template-columns: minmax(0, 1fr); + } +} diff --git a/website/src/pages/_about.mdx b/website/src/pages/_about.mdx new file mode 100644 index 00000000..8de5207e --- /dev/null +++ b/website/src/pages/_about.mdx @@ -0,0 +1,84 @@ +import CaesarCitation from '../components/CaesarCitation'; +import CaesarDownloads from '../components/CaesarDownloads'; + +# About Caesar + +Caesar is a deductive verification infrastructure specifically designed for probabilistic programs. +That means it is a tool to provide formal guarantees for programs that incorporate probabilistic behaviours, such as drawing random numbers or making random choices. + +For BibTeX, logos, and the website QR code, see [Cite and Share](#cite-and-share). + +Probabilistic programs can be found in randomized algorithms, communication protocols, machine learning models, and many other domains. +When designing or analyzing such programs, many questions can be formulated with respect to some kind of *expected value*, such as the probability of reaching a certain state, the expected number of steps until a certain event occurs, or the expected value of some variable at the end of the program. +We support the use of different proof rules, from areas such as martingale analysis or domain theory, thus enabling reasoning about programs with infinite state spaces and unbounded loops. + +Caesar aims to be a *verification infrastructure* that combines many different techniques to formally reason about such expected values. +We want to provide a tool that automates the verification process as much as possible, while still allowing the user to guide the verification process and provide additional information when needed. +This differs from *probabilistic model checkers* such as [Storm](https://www.stormchecker.org/) or [PRISM](https://www.prismmodelchecker.org/), which are more "push-button" approaches that require less user interaction but struggle with e.g. infinite state spaces. + +Caesar is an open-source project from [RWTH Aachen University (MOVES group)](https://moves.rwth-aachen.de/), [Saarland University (QUAVE group)](https://quave.cs.uni-saarland.de/), [Technical University of Denmark (SSE section)](https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering), [University College London (PPLV group)](http://pplv.cs.ucl.ac.uk/welcome/), and [University of Oldenburg (Theory of Correct Systems group)](https://uol.de/en/computingscience/groups/theorie-korrekter-systeme). +The [source code is available on GitHub](https://www.github.com/moves-rwth/caesar). +The name "Caesar" comes from "veni, vidi, vc", where we let "vc" stand for "verification conditions". + +## Cite and Share {#cite-and-share} + +### Cite Caesar + + + +### Describe Caesar + +Caesar is an open-source deductive verifier for probabilistic programs. + +[caesarverifier.org](https://www.caesarverifier.org/) + +### Logos and QR Code + + + +## Main Features + +- Verification of expected values in probabilistic programs +- Support for infinite state spaces, unbounded loops, and recursion +- Support for different proof rules, such as from martingale analysis or domain theory +- Integration with SMT solvers and probabilistic model checkers +- Program slicing for error localization and hints +- Integration with Visual Studio Code + +## Key Components + +### HeyVL + +The architecture of Caesar is inspired by modern program verifiers that use an *intermediate verification language* (IVL) to encode a program, its specification, and proof rules into a common representation. +Our *quantitative* IVL is called [*HeyVL*](/docs/heyvl/). +HeyVL generalizes classical IVLs to the quantitative setting through *HeyLo*, our new quantitative logic developed for Caesar. +The names come from [Heyting algebras](https://en.wikipedia.org/wiki/Heyting_algebra), which underlie the logic. + +In Caesar, HeyVL also has high-level constructs such as loops or procedure calls, but these are all encoded into a smaller core language. +This core language and many encodings are described in our [OOPSLA 2023 publication *"A Deductive Verification Infrastructure for Probabilistic Programs"*](/docs/publications#oopsla-23). + +### SMT Solving and Probabilistic Model Checking {#verification-backends} + +Caesar uses the [Z3 SMT solver](https://www.microsoft.com/en-us/research/project/z3-3/) to reason about HeyVL programs. +This allows Caesar to use symbolic reasoning to prove properties of probabilistic programs, enabling reasoning about infinite state spaces and unbounded loops. +It is also possible to use other SMT solvers ([by emitting SMT-LIB](/docs/caesar/)). + +In addition, Caesar has [a model checking backend](/docs/model-checking) that emits files in the [JANI format](https://jani-spec.org/), a JSON-based interchange format for probabilistic models. +This is possible for an "executable" subset of HeyVL programs that can be translated into JANI models. +The result can be fed into probabilistic model checkers such as [Storm](https://www.stormchecker.org/). + +### Slicing for Error Localization and Hints {#slicing} + +Caesar includes a [*program slicing* engine called *Brutus*](/docs/caesar/slicing) (get it?) that reduces HeyVL programs with respect to certain properties. +Slicing is Caesar's theoretical and practical foundation for error localization and hints. +For example, by removing assertions from the program, we can find out the remaining assertions which must cause a verification failure. + +### Visual Studio Code Integration {#vs-code-integration} + +We value usability and user-friendliness highly and want to make Caesar as easy to use as possible. +It is our belief that UX is a key factor in making formal verification succeed in practice. +This is why we put a lot of effort into [integrating Caesar with Visual Studio Code](/docs/caesar/vscode-and-lsp/) with our [Caesar for VSCode extension](https://marketplace.visualstudio.com/items?itemName=rwth-moves.caesar). + +## Other Tools Named Caesar + +Caesar should not be confused with the set of tools in the [CADP toolbox](https://cadp.inria.fr/) by INRIA, which includes tools like the CAESAR or CAESAR.ADT compilers, or the OPEN/CAESAR software architecture. diff --git a/website/src/pages/about.js b/website/src/pages/about.js index 194c786e..83c9fad5 100644 --- a/website/src/pages/about.js +++ b/website/src/pages/about.js @@ -1,94 +1,27 @@ import React from 'react'; import Layout from '@theme/Layout'; -import Link from '@docusaurus/Link'; +import MDXContent from '@theme/MDXContent'; +import TOC from '@theme/TOC'; +import TOCCollapsible from '@theme/TOCCollapsible'; +import AboutContent, {toc} from './_about.mdx'; +import styles from './about.module.css'; export default function About() { return ( -
-

About Caesar

-

- Caesar is a deductive verification infrastructure specifically designed for probabilistic programs. - That means it is a tool to provide formal guarantees for programs that incorporate probabilistic behaviours, such as drawing random numbers or making random choices. -

-

- Probabilistic programs can be found in randomized algorithms, communication protocols, machine learning models, and many other domains. - When designing or analyzing such programs, many questions can be formulated with respect to some kind of expected value, such as the probability of reaching a certain state, the expected number of steps until a certain event occurs, or the expected value of some variable at the end of the program. - We support the use of different proof rules, from areas such as martingale analysis or domain theory, thus enabling reasoning about programs with infinite state spaces and unbounded loops. -

-

- Caesar aims to be a verification infrastructure that combines many different techniques to formally reason about such expected values. - We want to provide a tool that automates the verification process as much as possible, while still allowing the user to guide the verification process and provide additional information when needed. - This differs from probabilistic model checkers such as Storm or PRISM, which are more "push-button" approaches that require less user interaction but struggle with e.g. infinite state spaces. -

- -

- Caesar is an open-source project from RWTH Aachen University (MOVES group), Saarland University (QUAVE group), Technical University of Denmark (SSE section), University College London (PPLV group), and University of Oldenburg (Theory of Correct Systems group). - The source code is available on GitHub. - The name "Caesar" comes from "veni, vidi, vc", where we let "vc" stand for "verification conditions". -

- -

Main Features

-
    -
  • Verification of expected values in probabilistic programs
  • -
  • Support for infinite state spaces, unbounded loops, and recursion
  • -
  • Support for different proof rules, such as from martingale analysis or domain theory
  • -
  • Integration with SMT solvers and probabilistic model checkers
  • -
  • Program slicing for error localization and hints
  • -
  • Integration with Visual Studio Code
  • -
- -

Key Components

- -

The Quantitative Intermediate Verification Language HeyVL

-

- The architecture of Caesar is inspired by modern program verifiers that use an intermediate verification language (IVL) to encode a program, its specification, and proof rules into a common representation. - Our quantitative IVL is called HeyVL. - HeyVL generalizes classical IVLs to the quantitative setting through HeyLo, our new quantitative logic developed for Caesar. - The names come from Heyting algebras, which underlie the logic. -

-

- In Caesar, HeyVL also has high-level constructs such as loops or procedure calls, but these are all encoded into a smaller core language. - This core language and many encodings are described in our OOPSLA 2023 publication "A Deductive Verification Infrastructure for Probabilistic Programs". -

- -

Backends: SMT Solving and Probabilistic Model Checking

-

- Caesar uses the Z3 SMT solver to reason about HeyVL programs. - This allows Caesar to use symbolic reasoning to prove properties of probabilistic programs, enabling reasoning about infinite state spaces and unbounded loops. - It is also possible to use other SMT solvers (by emitting SMT-LIB). -

-

- In addition, Caesar has a model checking backend that emits files in the JANI format, a JSON-based interchange format for probabilistic models. - This is possible for an "executable" subset of HeyVL programs that can be translated into JANI models. - The result can be fed into probabilistic model checkers such as Storm. -

- -

Slicing for Error Localization and Hints

-

- Caesar includes a program slicing engine called Brutus (get it?) that reduces HeyVL programs with respect to certain properties. - Slicing is Caesar's theoretical and practical foundation for error localization and hints. - For example, by removing assertions from the program, we can find out the remaining assertions which must cause a verification failure. -

- -

Visual Studio Code Integration

-

- We value usability and user-friendliness highly and want to make Caesar as easy to use as possible. - It is our belief that UX is a key factor in making formal verification succeed in practice. - This is why we put a lot of effort into integrating Caesar with Visual Studio Code with our Caesar for VSCode extension. -

- -

Disclaimer: (Un)Related Work

-

- Caesar should not be confused with the set of tools in the CADP toolbox by INRIA, which includes tools like the CAESAR or CAESAR.ADT compilers, or the OPEN/CAESAR software architecture. -

-
+
+
+ +
+ + + +
+
+ +
); } diff --git a/website/src/pages/about.module.css b/website/src/pages/about.module.css new file mode 100644 index 00000000..583e53dd --- /dev/null +++ b/website/src/pages/about.module.css @@ -0,0 +1,32 @@ +.article { + min-width: 0; +} + +.desktopContents { + display: none; +} + +.about :is(h2, h3)[id] { + scroll-margin-top: calc(var(--ifm-navbar-height) + 1rem); +} + +@media (min-width: 997px) { + .layout { + display: grid; + grid-template-columns: minmax(12rem, 1fr) minmax(0, var(--caesar-docs-reading-width)) minmax(12rem, 1fr); + column-gap: var(--ifm-spacing-horizontal); + } + + .article { + grid-column: 2; + } + + .article .mobileContents { + display: none; + } + + .desktopContents { + display: block; + grid-column: 3; + } +} diff --git a/website/static/img/caesar-logo.png b/website/static/img/caesar-logo.png new file mode 100644 index 0000000000000000000000000000000000000000..828e2897950ce0d60df1cea86342721cb79b1125 GIT binary patch literal 54819 zcmd2?^Kg;Mt2XC?jD^gsnlq2bhk94L`0-rMdEV!Fp1VkORe54UYC;?w9AcotD@`06JSiL;+=V;%*iS5U zdVXMk;hQPRzrwk?{+HcWlz@Z7fCGFbt?m7JYu3kG`*7-NZ#ck;W$T&6EmVDlQRsi1 z^%K*&)6<5VOQY=f;u!1>^~&RHwsU2wW0HcWyNMkNK1$TrSg0EXl!6?T^y(=&?&?24 z^l&@fmy-LBkADqwiEH@ZEdwjJnpV@v@y!kYVUgqGgj9~VsME}yc&t7D4}L)X5gw%$ zV_RdLZU$opHwNv}3)lyfuw`XXn^zvg4lI^F4LDow7xUx({qusPP4F#8UY3B@SF8FR z$3~oDvQFm4XVSKwv&Sg~DJ!`{*B-~g37-9hgLkwTk)gK9zc3!s({f5+=^15AA2-I? zScVqq@X-N`J^{b}`z%h~Cw#W*gcry@3wI!tf8O=&Bf2W7og{=Gb6aib=wxcSm7L?{Fo2)&W@bPbKAUf7 zRF%r(`%VZxb}Qta=aI-4JDB) zJWmq!0JN{61&j7t`2S5g=5?u?TTnBiU%1ic1qh3J9ZoXb8457_0qKc~C%YNlEq|Mw zmQP4rsJ)#@q?=q@V4%E1AnMdqH8I))P4-Kt;4y)kY;E0|q(QrZ>A4`T|`48E^5MiN_e zpOP*tRy;oE>%W-b&N#^9Rroyr()`blZ+ZlOXOSYu`gojugQeYwumf3{;6;r&=NPZZ&7UGxHMP5XOm z55O;}r&*1Dk-{Q8VMXcb5feYD>~DR4c{sUT6aI^~ViG?HEk#CSZISG?`1xiZ>rCZ1 za{b1-FRU*T%eV0P>0t=h(b6BQ4?Y$sxAes}3kkl=I9BU*h!VRfwt&vY1&zG_ZsFu} zWB+=yK5mpa^$TI}s{wF^F}*GF2|s6Se~Sx9?dc*t)Z_Jinl1Ez8>5Rpl^p_ORzK=2hX?kXm*#SKJ=1!J5%$~9 z+>knHP{hkxjJ(DG>EGely>sn)kN$-9{Rz>%jI}62Z5j&)wABv|zd-VzS(9CIYpv@k z&;gg+!v&=!#N4~}P$m>_Z_)E-}BJ(ckH>P(vXipz+~BjwHvFYSaWfw5zXbT+)2r&Np>sAcepbeFTUYT1wi#o zg#WlTPXeRB0#*bctYE&~p9TaSn?dw9BgJp~1s|E2!>td7lMY(CX0;rf%0=R%>08Cx zic7lr;mB;Uz2yp)j_Rf7qRT5%fb+=d0kvmCH;51%QGKf}rBoqHgfk;TlHvG;W9tE? zO-PbiC$YR$+Ub{&q)N2Ur~xrQ-|(yS+cyiw6Xucx4+$5d%5Nt{@Fa{)tQHMi#I(^? zr6$0noTwW44MTpLF`s2NMXj>_9U)cKLpWk$b&XU8NIgi5UC)Y&Yi9t6N^^>!7&xml7K$ zEUxIcI-#HE-&re-VVscDn_(l&u0;MkFP=f!Bbhy7^UbG?7+G41y3ZzyNO;lDw<~6) zg9y8R``HBEK++q%a-3~uv%BXp%dCyZz9}XFjwAM@^&VnBr(gDpp0D+Sgq-`cRZIg{ z7YQ1{`!hE_SjV>sKDtE#UK)D3 zB0{I|+=#FG%l+DqSG{LXMwQRJaSOd&e9kbF$DZ$$n013A4dc9~DlTgy4Ppy-eCxeO zZ%-W$JtUMcA z0_wkb_V(SHyh#Bm9;w@PEs90&qrUfXtaujWr{)t^S)6xF6&qiEQcV%4!Qpr8T{%e5 z{d}wj45xe}0qkqJaMIdJr{K5s|L3ern_y4bywR*V$xl@9?g}zEnY#&1}Vf;k`H{)0=B6T=MysK3Cbe)6v=k!041sPvC7Yk%J)Yi{DA? zWiH8ey0}W%62(h(v+NpB?xq2YF76)q1P~nBqF8|ih|Kvq&Nj};J?|U8f1Seyt+0lM zFowOk5}uhcp)^08U#CU%qA1N&Ct|gTX}d{0Xj4M%2B2{WBk*mggs%^(rzS^^K&m>A zA-YU>pqc!dATpN2inC3RU)1pK&D0U9xJMDMzI;+B!gq>DxzwLA9U78W5v~0&-m|*4z7G> zw9t|&oRQVOgWXvy$8mq-z0_mdof+;b=btg3=jJy5dABl*A{(SYlaU3f^Yz&l=h+gw zPc$Ru(DP9Jcqef+z3@4d#7kU&1(fE%-JAIqZqpnc=h1|5&$uje6HGsi;;puf*0Z3q z-ci4?(t|=kswEU>A~v^CNHGt~`|s@kh0WV_1XWzgX@^>F<74;INuh)1~JIQTmF%T^9Q zOpCGa2cs~*oy<>v8`k>UD_tn%4B5B3A*<#dJ-X&U+;hk72BVg4^m8$nuSkVXL)}14 zre^5Xeb^XZ+SSCj-_8UFqZ?^P?6}zQi zVl2QzRP8sxA$17C5ii=Lpuj`wHtv$ExvGY4y6;7T6WlXw!0@8sP0^Qo(+A~S{gALm zK_w#mR1esUYD(yIt6XVnf+5FbEngcu&~2Ob`6^u6;Q8~$D$=dBNzSr@)0PZg%p7@rH^v8NhErrepcc3O2FyAC>}i6j5*L*8@-}V}mJ)70-Kw5) za!{~NXGW%qSSPc5`#vdyMw5g1{okhz8~+m97xnYS`N!Kv9tcP=x($5hSCT!Jv%3m< zUt|b)Q)$|S%%$ZqP1!Q)v#N4do^Lsdc4uGxbd_zPWGPV&MSE$Rz~5Q*gHFc={3ex@ z7^D70UFIizn^%frfi3y6qUyQb`0Eqj8^X_)&srV!5okr@#v0FGN-dcQY_w+z4Yo_q zfGHjfvVNBmadw%-gJKUl|93*j{k|=5YXw}wo`Bj=Aa-xDxjx$(JuW^REML;8%pY#F zZ+t4v;C-4H)RTV+fD|R^_HS>5O`mo1`LGV$P@!NG?g)UCv%8G%ejrOgMILydi&8IG zQPVyhn-RGU?GnoCHqEFln?lMoU0@(;WD6EgT)RQ_>*59`q^z;Wj%ovQJd^{O9W&8; z^rcNm3Sl;GnMTD7<+nqf(EHk$>h!C{IhXaU2o*i`+iDYAxO4MvG#0Q!1(~2C)XPvNa=MFj;OlLY}L*sH~yvuM#kvX?g))d1T`#yr>&LGK4JO=tvDL% zZ?Z7EZ0V^&cbw|ZQ2;STR^dAVNoMye`==XqllupkRipoNj29NJzP_G_E_*~_dRWqU zuW&RZLyddv2^|NDYxiacQfkt->w;eorg>{GbPj)0AKnr(q4V2kgphEL2xR`IymAk* zy9pQ^acbg`TaN<2j;_*s<%2-%OfKkcVrCLot~@ zM~C0ZqXJNeFQwg0yWlSJuXd@O;vv!_x_NGW3VQ~Q{G3W4(aAOi0<p2P9IYOHElsw%M3p5b4uzZ(z)TmIO|B8;0AdB?Lm;^ z!j%HRCxtN+L0LZK!w^Sn7$*YaNw#R5(Ty_igmoqzY=?HLfMty6m>*{#Cbf&{Gsv^8bm48SU& zuPWRy?Q&N3Dx>>AIgaRxl1BGzYoCb9;#k{#z)_2AkVZ&1b+e6bdd~`jn-X)NJ}ERY zF}&>Qf8!euFm~NH2ZBpIVKvST-tX)O>3;0fe)cpP@CdY$v5E!19#?s(vp?Ltnc&18 z&xB~>5_u(>smbG&1|%%ty+bbKIFK?~Fo6%ZN->FNO2BUsU_#Wn7H{jf+aW%#8pEnx zb*)0Iz`JEPGzSNOOFW`WE#e2yc^hZ?%=y&Ms)ovwo>&;XOzEA%jp-j4NN9YBI_UPHWn!>Lnq*!Fg-ItE^8 z&V4R_j>tNS#@3m5qOqUSp@827&2)B(E&UC%9pWQJG}fG;xk&eaHqpMmT}Of6ZQ3!O zzjO>XdDGz8C_Q>rZ(XFE5LoxjZ_83NR%am1rLtu{cl+GeGkLySc?rYESX)W9_CIFw z4u4%Darp7oWA`g%`=NT?nF?HLp|Tgr>TJ(#wm);vW(?aw;7E0dDi#KI4!<|-{0xvO zdr$QtKsf6VNsLr>UmN;-i;m%@0F8701?I*pTXtbzY# z<`2+O#)R=s4I)MYK5UX~lAMsg58Eqh4v$p?6xKf`To4h4!g9Wrc$P9e^n z8`fKHy=r#-f~O-5TedSYSMj&Tw^rbv`z7Y}jU+ovO-o@lW4C#^CS+cP;rX?{&>0EF#WQ{m`CMZ#ifYki0>#k`KSWJD{Ai7e|Um~z^J{M_o` zilp1-#Pw-v6|iUM;b%kt*wCxOTHVK>)R)@4on`HrVPFV82n(e$lQ1aZ21Q)R>I9(tl(Z)hqGz`P2^^ z705V2VW`?b`IRh96<+YW$A8f$i?)(47g(NF38du+$MKp@xLk9Hoq4?8o5$w%*$u!Rrg z#}df1##laM3j_&M+F&f{$d86(rW~jNg9ybhWceB~k=Iph?&_`J5-l=WvW%FhjF`JC z;muo)As6bxwCs(t%tD;M(e~;lDmv ze{BCHpl(1f17ZI5kwgt{kHc0zo;H{aXT*$^ykL;d8vlc`P6_+PdEOSfx@Lnm7w zXT*|;N95dQ#hqSgDiQ^dF3igt8k6SfKZuy2s~@57?Rh8Z)U;Bmmq+rq9%U0d!bwUb z-Qv)V*pZWA#*4U(6HkLFcz)XrvCqmr_84;2xPRKkjA*y0vG(_9=rGQTyC9=e2nj#6 zILw!yd4JAT7@qEA(j>MKd~I6rxAn))=Av)DAC}xUGq}{kYjWg2*gZ+AMPb}=&2XiP zX#6$C;~=R)(<)@kXT`A9?JcNfw8a$%nqGLeX1#II)8~4c^#r{43a5ri++%?r&JYGHR!?U9IHnX~b*Dedx;HRkg?Z)ij6`X8dcnJi47zw02 zQ%>8Zy?926VoU32?U5 zD4_xW>a^xh-%!41Q0mlDwY^}L?8a1pV0?LH`i8WBblR!{H61wL${ujs&7L68Es6p%L2C-E<9)m~hS>k_Wt;*V2 zkf9XK=EG3{(%?mE6Y*v-=RXywGpR8HhGqeHzG<>*mGK73^ta3AVvrp4Z(jM9(RDBy z%bg9p9c1p46hzN83b6KXY6kHkPj0Cm8g>l~1oBbrH!C_qu##`4@ANQVEsr9gvw$^Y z2{G4rwtwy|^I}AnR^adxW{~+kcY=QylT!;S-Nf}c{SZwx{}}vt=j+kF7li6+-<_UE zhMM~KzX8yu>PEBeYOB45Unm#7kKaq$An5ExX;USrQNIqbC> zZDf*kn73w>c|W*C(7REpw!FwZYTCXRlafdB_poUL#ySNj52x+gx@X1xM50AwV}Szq zhS?`N;@q1Nr7{zU1hS5_jYgkZlG>&Y6{j7~$-RA@os_A{^NSUV;*H4ZmPv9^vfv@F zoAe-?g!x4Kb}C{ryUG@uS4o-5SfL03=e?TZzv_{c^DlFn>=pO2Ft&j?c3@7on<%}# z5RC(#N!jE7Fq;h~*dQ5OaP(;tcAK=29IR@|pHl&iuHKr^@dM2|1LB9kwJrIT0 zA$enfbn0cH5`m)T(8K0NI-(==x5~7>o{S~ZhSl#&l^GuDsr@>za`ueLbtys%Q4}<2 z$+3C|6Vo*AI@>YI%Yign*KtK(#E`ks zc;n7c709H84>g+lLX7;yp*w3ZWqLk`EYhr1P@M*e>S$y!54Y~!+GVP4<0X} zJIex5KgMogJY==Kyxe!uR)gT$JHeU7@`6(G*uzAD9|S{$v{N^s`+4bFjf+JFw;QhY zyjifn_UwndtDSB@b3#EqB9jyX>+4h{T-e6p1AAsi_OFRF4R}*DUbLK9&{EISXTVD$ z-kv#u7K75a6A<|*G16dFZCwyJvU&dLUUi;H;rINrx8q4mx&IsjjI|ApsZ@eG!I6Fd zN)#MN2SA%X_WPH}V8u~M+Hqx&`&Y}AS}pfMkB?DTZG&m{no9#`1lQ9JK~xDW$CJ>Y zz&!1r^7T11zz^`nnhhY?|9mYMYZFX&U3R`rRSd`WtJP0vpBQ{dLlE*f)y_h z7sQDT-w+`LayGlGU#+o2NtkW1m0ire0(!-$`Vv)|=7R)(-5vWTzFJr+HrR}@p{1AV z0UQ$)_$wWF6W`{|R2l@oZt=UgkQ92bU7?c7NMx4s`Ahe| zYKkp3J$diF^Q)^GFQTp0fv?e6TMg+a4LPtais1kZkOx35<#aMIi3bhi!{$|H#iEwO zdB^LyBV-x_7zN#q@?}>%-SG}A*a$;niP2hUklc1sodJO)H9qUdo$J+u{rv{L- zy8Q#Mm}W;iGc|&S=fbA&A8jCq{eIm6W8Yz#D*3^*IKHV5y5Wu)_$fg(IYQ{jA8B5a zI{6|vukyDROBrvICM!%Y?J&LB+2WA3X9*PBAiuVL1nSX0E>D5v4}bpPDm=fvqU{Hl zzn&6tchuC9Bu_2Pk;lL?T5pWIVh-Huk81K_`&6JTAq{Ua%E-eLNkNfXG?o`vT!9Jf zao2PE3JdVDD7DoM5|7Dru2^&1F}d0vaQ}xTC8Kgv_&>6fGZD{#PI zPK~z?u9f^_j;RaM=CJxbxB<5OfhCh94+EhNm8P~m4LICaZ_PcIGt~T@%c2g_y57CI zU=WsM+G!Y+aR>69c0B9~y9hW9C92sjA`X+kRPme$YhI9$LY`qp%4S|Ej?gxi@YwGh-d!OzH1QiI!u#|ej-L)70KRSIX@bp} z1Rt2~++tat>R%QH(rNU)0|`xs$0s{ZnDr>Zs@{a)yy5AyV~O@EI&J<~0l}~!o%zI< zaw>GP2Pw~V`Te?Q8@v~cn0u2*&FE-2flhxgC|&l(+k+QUX(Wl8F2L|t#|0h~Lhjy& z%YG*5UV7$Zz-t#}b8H9^kKAyWk3Yc03hS&9_-w(dyf$Yd1*j>byrBnQ^q4N^W&^D$ zB{rHb(hui{#PojN#W&R!%x9vD@tC}m79D@C-y6fW{A5-NX!7SciO%ntTIjX(7(5Hk zz+bmF@+btJdlg4)`_Zf8uzh$a7zC=RDR%d$QHS#-%&ui#fkvlYLixI9)lQR~xn|gq zUZNOQAT_`do?~_NfL~Mv{upx1V-?1|C~m1jpkm58Oa9NZcCbOZY>HYf(!PU8lH{qe zINC2AaAY+@4$d1=#WD^_Gq~)=>kf0#Z}~|%9z{mgE?rz+m!cbDq8u5?)Q=3el!?j} zD`SCCa?p|pApur5`F3AfE7||Ob0nqnP(M}{{KDI!i>Lp^?$l*Ds%oaK6z5A6>RN(s zuyx;kbtcav55<$(eBx$XIzQpyADYjYH>7D{#C#PJ+SxcU3)_t>?y7q|RaYD9(jNpY zbZ0({2B^JgLJV%M@w75+Jh^@gBT4^h5ZFXB3$XJ%p@oeEg2cO z$X#Z(rlq)%X{@q8=N?XRR``R@0qVO$3&u- z68%HS>6%f=-FoG1w!f4#2<)oBjaDWO*cFtxqxq0j8f(w1Ke(M%$sU7;L-y43w@Of$4A@@5h=l+DeVRARMZnmVwS-32&$hno^P; z{8`2To32`$t6XPIy(|jTkHDGlUO+VrwZMvFFRne4UADeYJQ4+qWMrn*{0iww9Il|& z{OXJ6dH}u>x6uY|c&70r34BGDMgz!#Cpa>61*h}f^M*9uh$K|fHZ>2ggB!We0><7( zS4J6aIL8z^GONgW7A z4@pM3LA&RGm@oWtD zOSx&Wh-XN?EYaBc2^dSV=_&Fb2CHfaZErCepQ^ov<}oUJB4Ius+iAfus5hYfZlwej z0y+*PqlUF@=pZUkOXAnDJMYd(U}uT}oY=SXONRXJ1( zP@6tC$#f*ghf@*ilS;AP;VS>)1mnqPYWC0?Z4DKcgXSR=c={bP0*5|GB>NffFYYkT zN({1?X7id(df2aa7kB-AHG045=Ua_NDs|E;{+xPm0?N3{QpE!eh2s6D3raK*)J5lJ zaIY+En^5CtI!=_m&EWE-GA6Cqy)FY;v}xKG@M7c9>|o)kq`q_IbI7;i+O21aQ_vUP zu?E7XMJ(kM;twD`S;{N^gpg`)v@<&YbkG(UU1^1j-0X;4Y`HEn*; z<7?!mpH%b^YdGiWmbJHrxRb_6QA-n zK2>jWo#k~@2XxIH+N8*Gs~jR4Duz4hND2A_vil#p(Leh6kdJs5gc{@5sx{7F?xk=_ znBoZemhwKet;W)5w~u4qu<1p5)qk@p`!#5S6(MKZ^gG{j-WKQZ(UAXqh=@g<7|f*E z);6ch>eb$I)O`f&ewV^k)JpJYx^VfUeUeG?#|0(a5facMl6GZM`DMXg-&wdPO%=_R zP6Ei_!}AOpE3313*r|VFg=kXd|JMd6*21K+G=(K;cBKI|cz#WN(Q}XfaU&i*%4&HxH~74lxuSkMXx`MNmWtxcFip~$ zt~`eM8>?xn>z<_NX95PZcws56!;;@x_G2S2`T5-@!$%xq8}zH7gcvo6=?U~<#)j96yaI#zS4ob(BA|#!e!2% zs3))!iSMCW?d#HFlLZXn@es2I@`!{<3yhwZk!@i|dN>C~SkT-4XW3}EIUKGm{yzz; zm;{DG#jQ@?JQ9XEPVy@WsI4qj=SOp{Yly^%tJjG6Clukfj_Z3-N%a@9 z_t%}UF-XJ|Ahhvhdw1;X~(@z{F!9ae)=z#NZiy)U%`hl+S^i>`oz=l-BkKK=@bMZtTrFefz+|H}> zFLQ^+d@-N$=bP|I^*h=-Y+#u4j9k?ZN6#xN#aMW+npz}Sru2cgu`K~Qgx(88mNF)M zWQ%IkbbworrHfJ;G!mFn7{-!r&f34#6>{)4<#jR90Uu!9ndP$6GAQEt(Z`h4+0!5m zf?K|@pFy_TV+E*WkK|^Siqs^78uS+pFqta&REbbc`07TQTP;0D< zcrCJsI$qx%j(SND{Osj*>}Dw8w`V&YhG{{Tb2gcrQn<_iWM%Mi(hrMs*}6O^@=>j+ z5@OD}lJHZmclgO%(q-0s;+^s%4f!8*#>au*{z;EhjL7T^L+Dg+v$TG4}gM@_~FwumE=urVEAj=5(S~A zO+Ct!;rCxr=HqU4VdL1_vvcng9j|7OoxoS5{KuBjX_sPE7XdU4#2CTzu*Ug?kELNu zW{TKDM=*Vr%lJMxtW9JYuHC^kb%GVY$v?1bym>D}dY+C~F|Em(JSoc)VELFOIJw0rEy^2k*gXN+=CDCX>xT9Le4bmt$+|oUPo^gS4H_3tKdh z=L9yUTwF{MuxC~A9q)0AN`n?;XCqqKk*uf&ivZ7s+pTXm9*60v`S=Z?*D_9D9eysf zR&s*`a-V{j2Qz{WF5aD+#scm)AcB0y5oT~E{w#JRt;QPCB4?R2$nDG>dOPSNYu}Fk z_)M5l>m${${0l_jHREJDwpxU33kX%UwElF*VSDJFg=L(czn`qS@#m5J(h8+)dAhr6 zMu7?;scJ?5l7o zg`(yWyg?d`C*hKwSh=uZGYb>ZtTxEum25C<(%YKQl&_|E)Vm4^slqlTV2ts1oW1vc zbPvC#Ef)sluGUHLgrBRuKoc2b+KbVz*y6UBQnK=mF*I29KdWW4;n2SJN{PR8!NF$m zdn{g!t=kpP;cm-IL)!?YHO0>6-ano0x*(sTTjvtz6S;AHg*wqk3}Vmd?TuE@`+(yQ*-v)>@QBU!A=`%@fpYrH`rVFLgKpylxwn`uE zM+x2ONALJGzU`%27h zTpMDbS98mfLq=QnG)~Q%@x@&S_`Ur@^!Z#yg?)#3jzOBDM_codpvi9+j$+>n%}FG8 zTH7-SoX*RY#vw6L05#$JikM&{mr*Pk#b}Bdw9A#_I2v5b<9%I3GmfqKUX*?ky4ZfI z1S>fAGy_|mQuDbTeK*&&>oxU~7`7kxynm185V4Dk}LL6_tFg zhc7r`Y|8NGHM@xxqZ=KizVNNW;Tw_oDw0KYu`6~5XUWtQD5tQ@t^2)jy6@I3_NB>e1H-GG9*zQF zyJu5t<7gAKqiMW{!k8;8UaIDb@AyhlS5M*(d>mT_oPDwRkV}CLiNLS7L0dUl%m!5; zOWLW|-&Uu$bv0{u^IBp;_f4r>rUy4h*V>^3W_JS&;4OqNdn!%tiiBj6QgT z)CM9CO8d|Cj|_UNu+KEG$DflMRI`h;?T1@Z=^Y-l`4V+P1e20_A$nPfh+DrdwjzG9 z%x08V`nUdVRD?@UCY7go_|_DMw^6uY1+)+V70E4otcXt{eQnspk7Z~iCFaT)hQg+otV2^GaJOsKDmA^+I=z6 z0C^fq^UM>&v8TQtzrHt`*&ny-CisXtGiS*7;)MA&?5s8`hnaD-E%T?&;7983{H+yTlVJZidXFwovfk^>by5G!BP ze_@$@hBiMA5ITCwJ!(N3AXDQD-~M8}*q72Cur^&R3l{8E8j>(Py%1|wMYaudaz_2C zTnNFow`E`8nR?sKfuc1CWG2-Cj*EL%onW_smm8cQAQOjFmWeq%1Q`tK0a0g^sQU6-&iQlsJlkBG>waC(!4EhBWko5Z7UBn`o$9ktCFzXXQjnq@-&6zCLd`E0{ z@0^79+a$p^`eK=sgeu~YG=E#_G(=1-Qq32mz3F{C?BWeZmyR*hxLH{q-q^B6oaIsz z8w}qR6@&!ohbvaC(UM_7wtc}CU>(C#|M&S?xkIDxp%A?jZ*1^n{QXmL7Xv`Hun?cM zj5T2L-GavB!C{ab90y!dU{rk+bY>ep1?JuP<3-4eyv<=XbD1J+^0%#;hAHa;AHPhZ z>t{X4gs$Bl321I*>)?ob?%dg!J2bM{6j9|{t;4hAA31_#l62tI%yI|A4Xm-_i?qZ=W=_pxhHjpG zOgt|u0q~^MCUHX_gOll;u4pAQVwrg=r?&$fo%!ml7JJY}?qyyVjyzb%;JGi1{)qj5 zEGc$HO>86c^g6$v={|H$+`9E;%r_R$h6@V_EsC{AHf8KIkgoR`cwHI5muS-_EhpPf zpFv5KC0ZB{4daAQ!AAIPN1Zw;d)iXj^4QM)Q*fi&@I@MN&L7?ju~>K;vg)4AOj1!IR-Vwl{5tEL^1ZKmh~F?r67t!^=kjSvVHCLM zZHmWrPZ~?dDv8Cs)#063?hqP7NP%H7043?NkCz?$Z3z~tsw9qU52B?=6#)VpFF^)H z!Z*<@(7M9EMdn90F;1I$^yi1cq4S)RKAow-^T`O3F+{?+)7e7Qbb+3j``&v5p)rlr zD+qH{CX=lTw$}T;t-AN>r|Ms#Er^td2sI%n0?3+aqlYbj*k^Ypj^RE}lTzTMr9dWm0=(=)q<$tOm9V z3!0CcdI-*}EcNgmFXFsImn^`(!TGy$`$YedX=Zten8*g(tN}K8{T4$cxl8yqINPH8 z=Th`gJeK1+CB?NKcv!HqCZNMi6~t>;hs4}9_hmBRN7iZ(JTHW&m%5Xm?J&_|`{Av& z4icG0bBIRs^%AUaxShGbtUx5N@)Ro9ohF+*0a0}9svCzsDLV4@S>N_CJD#>~ zy&;Hs43uxo8yb=UcDSO^Xam|Q{S1TZPZSbTvCHsGy#g-{l&|+TmlB2&95c63;Nyjv z|ACjLcNAd7lSD_OrmGh)IuMkPYN&w;yD+bu8PpU)RzaeP6WUP5Dd#~C?=b`4FP+>~ z^X(O~u*pgZCDp2ncR)$?J-VZ)hE3K+yxxtzQ1R`jg5gf1Uu>HR}opwmFxFI z+p&#N_}2=GUiu4o@1(8 z2EiXo=hjCVbTlbjHEp13Dit^Jh1HZbb6-E~m252F7Bp62JBA1YQYk9oElA&=4J(eZ zTceA`{5XDm*L5)#JA$5`7HC*^njFS&h8K*ox^n2)t3cD)peCo{a~EE;R)MZ=vm5lx zJfcDBV+MdU=CU$4Ux2I_PF`8*fOG%lmm-Hrbs;YBSNq$ImrgyhdLv-sL_}L}dTFl) zfpkxjYKC_!=LsHSs}8j0M2V8#bYccai(3t)6l&U$I5TFNo zC`qrwB!`m9(H6BqQa%UNt+|sbZaf&AF=2RmOwVM`P9TK6Qr1x1l^uZXYSFIcV88R? zd>&lI0I0{MRxE0$N!Y!bYC)eAm)4Rlbgaz)zi~712S-rg%E?g{pr$pw><{a|NwJjc z&=93DH0V62gX(I0F-&60wk>OAPy4!{Ti#G#ukBb-p%j^I1}Y{(DF2=u7zmh?yw&ai zwBkFS#uF!o?=c!~O+8%ktpzhh8@g0pMlzD{THwzLkj253#D5YX3(u9%V zdilLCh|~vP2Eb}9^5}$5I;@zE6y8c^ya=n=Z=K+H`6u^qT+P2!G{#Zp=}L5kAr zCoQSMX}@#N{SH5t#(uc`wlKW4vnDja`JkmR;I*sV!n0>*L^#g_VPr2(;vs!CWnh8_ zCD_R)iRp$v;+$;^Em{p7;>^~r`Qymhwl2=(c%2xDm9Nhl#2elh|NX5o%P#e?0Yq1V z;DqYj$mk3Eho8^pQ{`g>nrz-l8B4>cSx1x$}#N_*We^WnH9nK;+y)MMGQlxaDKT#6lo=5uvZgnT6b zBcjk@-pC(u+Pm22YP~`7OfxTajg0q|7fGXgIgVl!kLoe=tFeu!_hE$zf#1LK69hE> z`oOwLeN6h<&)`>SECXxR-9HZ_#d~WPJhGORnI8uIqLsdr?X$wF9Qas@bk^VlGa>m~ z*WR%&tQ#b`8OLFJ@8gs)6g9WHqJ1B(lg@JVxfQyAj2|@J`QQg$yPy0Ly42g@=lp1X z@fO2u{z;lUfL$mH>H6MO^}(>)pr~t;vR91pffP@TViT$AyrtPJ(p?j8 zdHc?%+z|-qF5f*nDyUN{as&n4O*KeSy5s6?Tfg;_JU>0- zl-aa?c8BVzj3iS+m3L86^ayn24K`ZQSfdksX@F|~Jq^l1F)Z%3QkchDvrHb|9ny^< zmkOT&P283`Q>(qxMixy|WwQ-Q%2CjA6$4O8(LNgH$*Mo;_54vcSUqL_14qniMCz~* z#VHd(9-jtwmN4p)dXKs%lX&qph@8WO@Oj{BDOo}bS;qveOn4;)nbHyEk-OF58%%D9 z>nM8bYhORyb}$Jf!zfP2MwU(R7ds-#_-ZEvKq(<%fjqr`u#w}V`0%j5GX?da_ zUW%~@Qc2B8_&208;;9QQnG(b;;_ec(CENNMO>z=(Dcu8*kR?PWld8fkPiXUE_&Ymp z?e_dkRnYXJd-^I$ADSyF1GsZhiMsc!gZ4#1If0K@&<6+NA#ee6r<4h81KfFknS_?D zom^^&E;qqB!sW;cg|V+gqa&T>^s^8+0C_Kxw;4k$CynhBD<7xuUONzIZ*vxF@=^A|JL1)70nvefbmCMtZ+?x@&w1j-0$>|%RUx_$-c~CdX$R0dKdeN-+kVe zCN~EdLH!09VF}ZKDQ;X~z-fq7Q%8R8K?{H-mdZ1YbhiYsN@;i?NGRShLMtPH(E4qe zj-Xs_3gHiDc%a(9e)#E^?9MK|y#_S`dZ-lCa3v6CR%r#c?d_a8KLD z8_`0wo;|V%G%W1If2X_r1+fs<;oZZ1LHE_?y#2?gdHYXH9~5YaN1+Vj2NKWV=K3$I zn%ri9_xk!}UH|(^c%0YTD&<8YdQy1i$DteBRnmP+rpRP@@57&C>qFa(_7V*Dy_pix zaF_e$Zyi9n_i`-nvKDcbaEd}B=v~}Y;{_F7NZv^~k{_Z_&ZNJ!iyVso=n$lpqMq5A zeD8Y`>eEP5xrC1A?kpzcHLeN4ZuDh`YF{EIOQxwm5_UWP{hP`OsPuA9T!;D>1A^?2 zC^ngl1VzFI(<0FiD>6^*|2ZhQh-1L- zg0Pm)YVf-MsdQ&aRiCRe8f-Rx2#0n#JzY0)4CzxP!}y(?s2XeEpDr5yFTy(`^wnMC zUxpaVkv|eeFp%iR!=h&I(h*cbG00cMxe1t?eM4t_?8{g>3-ArE{G5}lZGr^J z!cbqDkDc;N+Ny2V5L0Ns1_NKer=znXR&JL*+UY2H|8BthE>XEFg1d(ZI|u0x~S=D=E?MWHOW)Rk1h_rCmzEfA?KA=3`MCjPZ~?SPJ(Hu>v7%`KEvC@ zj@-7`ID)Xq3F2~d!&9E_c_~S-YdRc}P#eV6snD^ZBM9TqGA4#-CY@R`d;lbjO{ zF=njhtS(*!eiwRp&1%Nfq88Z#bjIKg1@4JIU4by*J6@FO4pa`U@w6Ejdj)OB>a}N? zSiutWea3Ha-q!xHeXJpGm5H2ugvAu2OCInw;P)csk1B$EMEXu7^B@zw){J;`%~^8r zw{-gr_6`lmohVa=Kgj+n?f)he`$4a0i2Wd0ktI+rb}#YunmZ2zO`YFnQjudUOK4>p zkKPS&2v}ShCH%BXn*!nx#0>bKQ^|Z{>L1aDh&&XONFZ@TdNQ%L1rkI&u(`d8txp{q z7cLY6sz_rC#qX)RUL~QG=a^nbA?Oa)a8tNYo=_u>L`l*WsDgr3RT{)(>ZrxHkl4wr zZ%Y`uy+68?JzpIy`>E>gFV@jWDP)PxzeN|gN6YkUbY0HB%*tN;aQecy%JTA`ig*Ux znbAHFznHuJ<;(xPkKF@7L^kOQxpTyX4cnPqhgrCbBif+B*58v6^l2Z1eP!r$tPq$WKs(2 zds$x&sIttKPn2-e_(lY3{5nX~7K+0MM6TnjkUu46rl>FtVs3xj9Q1aR?vtD)RKYN( zMAL75x8yZY`1OT)U6`V-qoX*Q%87PLxp|?XN8ekLLXTR=f>X2;QTp>42iZHMWz9M+d5=irfY`k99`taSj zFL1t8q>gav_D*2TKV&Qk*t9V{CIZ@g=&G>;9@(7L)p0Rq_C_Ycbuo>I&RKHCJ$xt* z@84fufMC{XZb%^(Y1?ZTF=qrqg>=!L4VeCNR z0^e07?7m1~jkKc$OC>^duGJCc&h=WAl&g+RMr6Pfbu20WpjmhakN$*0p=8(gDmaLT z!UsAWp>0Lr`{iQ`mqFdOJYY9TjSk2R62^5*V1#9#3za_`WI-^Qp2cR{c_k^UXS70&VSxMy*|~CG86Fs3dP^}7 z$fzSwQ!M#UL7N8w(TEu9?`hM^QNn3M?f?O!b#z*vELQG?y;BjLgUud(^;*q+>X(jF zA>4MSJ_p+w7ObSG16C{>92$r>#x|cEimb+_$yDU^M@Dx$*K{mCM6;| z)IxBoZ77S;sIIgnPpQWYheRBUvJ1xk7nT|{$Bc2P~&xoxMMr zN}UB}>MSgj=zD1C%|0PGDJ;~O;+_0NEEMcz4I3S?{SJ4&-4kNoXnB*utQJUp40Yc! zr8h5#+!5H#dxnu9$6=th$Remtzb6W=)PKFg6h!RT50`gUK)YBB$IEyYwZZzg)PM3f zzMppd#|<-`5th{6J3%B#RWvl==}Acl+1>rDUY(15t(Z8)sw-gR?~{*t`g)1t&E_Q~ z%aQvM-=9~J5WgzJ=p3N(JgC1HFT1-3$ezk#R&BlP#{TW8V)Uok48=(6PQ^F6Z7t<5 zE71L8ZzWbIf=7sg4Ee0yU7)$-3KJOLZCZg}JqHZDg$a**#FavpG{Av5zDN)j(uq(I zn9u^suODxDBgMm+J;_|zoOzGlFi1N!3pb^dp=!LD93DA_JRkN5HLvM2`lI#Hj_&Va zXZ{L4(oCS>L63w^EOV$!{D4O-0_Pz2TWTJZD@r@;F+*$fJrVuk$e%hd5E3Ug zsW5+t1;@9i!e0U3#7|E*>v#bkob2plK#D#+6CB`+vuFz?jO5> zeR5mKkz$gt1FPN*J5QfKDc7FmdpDDMn!=_KOGsnm%UmOOXYV}hMD5ln_b=c>+AQRF z7>S8{Xy59j^V`j4S#I)P$yYZDM-*@Kar6<%h=fl5*Th&G60@QbWmNYTkxycC8sW{_ zKiy~+@Jlf><&851N6 z0!vKwaW*8K?f9hdmkUk%KYMqSC`9^pL>GdhcEp4o;~XJ>_}sIZyo9O3&i}m8kqQ}!-EQCw6)#Pk$a`O7mGd;@Hv9|C*bxFFkdMB^nwrzDb3g;ZwSa5may4;J;9Rq21 zx8PsV3M6BpTJJWZP<*DeSPl!N78=4A&TYBlbY8ol09Md)EAI>bGj=fcWB8Hs)8pSt z-qW!-Y`xBK9v@j!CU@w$rid^rgi+e>1|WIA#Blhp^v8qlvf0iI3w-tDt{aqF1qgMNTzYEFy zUB0Su;9ssqFM6XYLI+7K+wJ(VXDgE(KXEd@!4!UAq$R7eem7t?Xx)}Kt*i}~mR{0- zBVAh9nTPaUsn_iHO&4!_V?e;{K-t*HkFvNvILzvvVAymTtF& zLSLC69L3#UlF#Ui2!^<5T6!+slg6iO$Ks(%svy+-usd9vYQBaL+n%=?*V+lgFCo4; z7#yk-emOYj6wH53Uv0@x@8E3-e!!OwuJ*TQAqtOe>GLR24p?&n`AKoK#(5&iZ2{b=vP!1@hFf zn%7^SSxn~gZ88riO~D->Oe_^v3C`mcjZHQRU2;U2s)`^Bh$8H@%N^>? z0~#Trs7>x)i`_RMQ{i#3NKP$x85OsY~$C^QYE+JUy3N-eu)y2QD}%;`nZ6 z=H{R(ySVOU@c$2>1fvb#>$XzF#;b1q0F0}vI8-S$CCho<#I`649P+!0Pk0ppz zNM}mI(X+g?_f8Y;wHu#^7xKOmffG?v1f7AfflKvb(~l)K+`NuuT9lx4do>OP^Tl3&`3i+dk*VJ6FR zy!Ub1p6@la&;g-X!?kK^ngOQjljZCpA!H+aDcm^i2=pfaD7O`68nU263LBb6+BVE{ z!GRyhOQY2p0Mu`emWct|d2(~rBDFNKKsyF+2thxkO z4d7-7sXkrKc792}nt`YV?bN1+oAW8`l_~0eRd8L90F3$yBxe5G+Ot-Inu?c69W@7; zIYD1c9?ic>s5gf~=f0I70GW-Lr^Uqa89}ntem*0>%c!IM$kFU>&EvI@@>mL6%xh$D zVSz)yZ<7hK`KL)>ZK>+R9GMF45GY};o;(k= z^Sr7`_+heG0Q*QeX9`%)ws}TSa5>3GC1*hBzR4!dhaDAp+sdEhV>UwH=O#amKKaQu z+Wjx;6u7I2Q$BPo#ar2vD|8?!DGwydZ2;GRB%}rbC6gT&0Rh^tzy%HCOY|l7%w876 zbQV4HkS^UuLs{AMvXa;WEFe76dpkbYu(l9E^2SdTUIt9{Of&!fI%853r;WWL5H&(? zCT~A85Ta@pa(R^sJZO2xf8wh~EN8PasG>&ESM4?#O#aSWNUv-MupT0o1fXk`>ho%i zd(F&dO})Lvm%Kx-Df>X`@%1q7As!G1MZiSoX>IxZFx7>2)T7gg+m{fYo@rJau`CWs zg7netk&j}#C9qD&??LRe_pu0a_WyRhmIyrTN{a(SC;~w<2zAMy&oii1)9MmSBllkq z>owEU@kO@XIIX`-aVRyol3&#Hpn2O@6?%f<4c|gM zCePC}ynO8)eAk&%{Wd!}0VcC=bxS$HopohucmB0yh=8^U$-||81$8wyZi4%5THOZy z|7N*=|I-1jP-wqvq9VTzQ8v;M^@sLqN(YlxuoO;YaKy-!>^|a}Wr5Z5`F0(`vH}6U zt;~NM&!Q*6`Mr0LdmL(jM0b0e!PkZicgUn~rv1(DyBANlxK{9k?6SKhq?b>l?o!z> zZTP>v!w(FH3vBxndW3VJgZjC^0wces) zp}sNiI69I8n1xiY&HH@T>gXy}*RkoT>ia$+eTVA9EvL>UA#3Pzg3LNK{VybVsJrZ% zP2WxPl6X&Kne!lB!J1^hnt3w>g*C};*IEZGu>ejYxJ?ZW7W?c%@i|L5e37?1@pMK^ z#QY!wn@D?$hMa8qBIe~JHG2sNWPwLR?^xnu#@K_C^Z^sfPQUjaCf!{4Eyg{G0p2*i z@g25vLXfqw-cGr7$Ml%0_)krLSK9A$GYJEeLBby4(%rcab>6BT958FHN0Xn zi-Dwjpmdg{xk2M!aGUkn;xdw%iRETd)b{fw(RrEZHr$T#2*GBDXEO|whmq{o5*wo> ziVBvhOH@k~)g&RyEUQ#YqHosLd{}`K?-d%Bj)D#PAb+Zz;qKC1fT~`-=tWY_{$ok< zAvp}_NEcG6O~*N17_|LOt4Qw_H^8(Y8Vcn$YqHUH=qjkr2e9%vJQNgB8(g4z%StS! z)711Ng-WS&B7XJG5#MC~3V`-BgD%@DHCPek!+#@4skvWu{Hof$u?CfGeg&*t4yTgG zOw5W|L2>V$+=u2zGMryj=zF&(4i;h9sVg_1>;ptF>EGBgsft2OFcQy`q9xzn{@9mt zuu*^zTb)KNrSM8%j?#KY^rOY$E3~0}JdcPaT=RI+FY7EFZ1!s{jW~XOt0;#$b)d{F zE_{|zSfX&7%#hQxC`3SijwB&%gARzxtZ{+iL7Ci;*SX-0pL5Q51+Qghk9$jn%4w{( zbKLCwpcY0RJ|(Y*EmS75zH;{}41rV3@F(!2@{_Iy5i$0T2gSjhJ=y?^5Cqj+aO6WN zOcqQ0-4>$efIN-u7CV=YX6f=(JF!e?B|La1;{zAyjl4q5l*Bt*}-#}8dC9+VFM9X0o5qpkX2+v?5pnfPqBI|uGclE$-#_VYVbmjWa* zR;^ET0;g99TvX|yd0jYyeb-kA&H(NOxvLTchW@7N668(is`ETQuWP+?5IXtt66UDf z5?^RPYF54H9U-@9EZuI{~j1U`k-A0Iy`!nlyfV$WKu$P4Fk+) zU*fdixVr^wOGqW40?FGc)7IR`Dv1m#cNzoPV|+3K(Xe0 ze3GFIhG|R^QejZ;&e<}U%yaS^{8UB;-OL}#zds2n-|ke`xiG`OBB&e-2-tWU?nXt4 zbPOd5RedSLvQ4+~=;hStycZX=Nf#H~arr<6f!4-Ibum-_ftx_A+0+aO=A=W2MrmBK_U(-`tr&)+2jDl;2W zS#l7A0vc4gJ(u6~tp>w?$d`)(zc5S4IA?Kt6~Nm*H>ARDZ$JnC^{RRq&BUvfOC6N* z32GUP8OxsyTg6=CKB+ScZ7O=5Ng!{qY4?8|DK#)g726ikLcS^@IVC(wu+FoNst6c9 z#)hBa@tcFP_qE(^ces8c$4aYXm2uG&Hhneue_f~?s-aLMy8ei-TEq&vSs1xrz}aAU zfO7BLZ!$6X6@vFg<9!T|0Zp=T4N@(|+FDX{2NSqaTtvZP&?A|=a&$EEj`uSk#?sJe zuL$TQm$-}nudmL-(MpBsEwl~YOnp<}^bc~t+mjylwj%+gnU8;!heZ5vYZx?BM~%+R zH{U<3^p7ddsd0qHFzGYTx4p)oKeMc?-BNW9Mm37*ApT$x7{LlHq;Rz*k?QJ`3af z;{v9I5^%i(dW>Akk6>x}(9;tVncvrjCKs9onP`JE0J>yJ@8t+GKAk$x@rI?{LZRW_=o&n6T~?s#xzLtkTX5k*Bd@O{L6 z;xK>x$x6jQFMaUayO|epIoi=r^oSUq%@x)4k`HF>iL+uUF${y^DQA4rc=Jds6KV7} z8tFSyev^O|V{+B!MOV|8`Jiq5ALzIk81&n$db-&{YAGh(q6GY=gt_6OB0t&_N-XHP z-F-12EyAFeOL^U4HSh`hs0wva=eE9xzNA zcAT$-;<0D;n#huVF_d_KUQq@kk+DfVXOSBHP~*2ji>7z5gB%_92)4`Xt`m!9{$uZw zzR9on$PI+2l*_X}>X=EsC0svOR=8xlq|Jk+L1ng6LT#H7IM+<;NNfTm4I(0zcrtl9 zTRvMUH!slE2m#YVz5}f0Tc3LDkVsw49k`hTs zhZXZ71%8OJ2Lpen$nq{c70w?K~}F7>V*j~9%i|1O>Hp^_+U!K zu=WSO;9Rfr3agu|oO|F?5g~wIkJpkJpG_KIK=8f#=VHKFp-fW3aT&OHTUiQ7aE4Sa za5Y$4P+6X*nTkW_{*_^Xj;XW0gcqqOVeTPtN6o7t=UP+Aa74j=Lq3$ldlZG_KZKRj zy?$jic-N%bgp5re`b{R$=)>6ODR5i!7c|ygrVcf_Z}YH-FS$$*!3-$3vKF!*4kPDu z0|oHbFYWFHdsx01@OS}AtIbkxzNHzaf|Lc?S5jZ~VPhEUm5;>zn;U)FH zFjma?=C9$nXtef&9o;dI-~W)dJBbNyf_~D%u`|?DEILrIa5^Y)9FUGM;p&lBL^kJ` zL@$q-js|Y@?%E^eHsUhDyP4Fw4e66Ak3nGf!;Aen5+oN*L(A3|dpmWu_kRL68=wBzoFLq?gN!+#}cP$;(BFH_6ssu@G=Y*^kaY^o-PL1nCvZO$gZr~!WPIfoRa zLw2BuaKAVhHD}IE4j*6yV$Gbm69|!&kdH1-1nJ53aJyJhZe|6ml8DnP1L1MT%u&{~jmA~@~L8IMpH(j*+cJI$jAo(2X>MdBE0!VVN0WoS9$hzC9GVT#-ZM%_4*H%CFF2J(oFEf>@bT1xa#c)yL?S+EXP1DZl}b1WQ)XI zWqC)XiLvU#8*l4!dXu^7c+Q4}HjS*Ow0bG!!-~013m(I^6+iH?BK;DtNqy)(+f302 zP5pZ4d8lEue6x@-#%n*Y&N@nS?u>fQ0TdnHp9H4%srwc$nLApL`XG7(+VPnTSHoO# zH2URuD=DQEmi`L`=O}V6CHNCH`CW@Jx#IRnq9-{GnMBfA*P-zKY;YM|o)dLUzS_>@rt`@op-(E2q z?+BG!>fzsF@m?TRQ57G~gS^IXf#!vH?HdvlhhixS#-Gn~$g& zE5ZjHIwWhWLJ}j1!TKCG%iD*IFz$ARE_2mwR7$K|`**2`GgM@JK9`~?%NS&G;1wW_ z#1gQJi`Is+CeO9e9# z*Lhzr+iW3Y(sM$Qd8NF;?e?NcM}?DJV_=<_^_D2F{jCK+aE?9}D6r1UxxnCAffL#qI%3Bb28OudL_Z zpwT#&{IN+CES#|UXt_wwYiy_xnk;!}m@|NG;-}{`-_$@njFp%B!W3Vq;u*m@tl|yO%iR*|#_!oM z4d-bH24gaIh$BVj%o+_c@fKWb;3S@E8J*AH?&xB$&ei+cYdTuR2$TDubPRh9(;G}t z4-sLct>UHxV67@8$IgQ~gyzZ=+x$0$pN|*`eF9dGA3g-T5}F0uwdaF9jbTvs%6xP? zUsMeMrR~F!gr%v8sO7jD_NMpZ$GHbLK)B8ak_ZCyt}u+qpGWt}oF0Vl2PioYWOJ3t zJ?J}ZgNGkV0r$3lKC6> zd30D>Ns&B9!a3+4_AAZt0M=aoobVhKS<+_pKiC!lI|tB+lgkf!V9$};9ZK;e(SNdk z`}V(0Nr<||mPRJDvhY3>p&}Ex_{|!X4S@4~owyjeL~85|#)&5f7fp~Hd%QQAL&zHS zJJhLr^%YrwRSMGgeq(SX&X$MDKt?3Fe*}qlQdf%ImtBSz7;7R73;4^?IuT?(9D}_< z*GSDVC^*eq-&GY{?ZmLB8L8pBBX%MuGbgJ$G(LSgM+)wz8pYU)8=@&*! z`u$v=GHl&clDuo%3uopRYWFgYh z$>N78D9BrTcKn$(8=!k{s{rHJ0$ZvEEy`Jcl_0j49-mv*FjEr>ET1(A%}gU zXYmvvtr|WhM&2sCH3-|-^0Fe7nYB+ST6I_N(%!0u07Bjh=s+_VTxOvDpDjMLqKr@* z>d;+S4C~Kixafb*m?vFgi=xLhJ!zfMV75R9ZTq*;!XP2HjlQZ5`a~7|Di3Tkx*-?k zXSak#8bMjjh2YCR!8mQ`Yz_&BRN3{IY8tOcy(9;o+%vz?S#!3dmLM-;NeI*D(dOP= z6&Z}%C-KaNw;s$ca(|Asy@0;PUgIex1Bqq*GW!W@L!?&~ zlheJ}>*UC*mI_-W2hzajnv<5bFJb|?2wt!44+ZU(O7e4Dm=mXb9g<Elui$Un>zQ%I%i{3$_CyfXqOVoOxdbVH<*@&GLV37+h9xB zf)0Yq&ub=2VFP^Ms+S06;`#JsxaAS~7DTTYOz;mVl_oiV(n>M@4vYK@I!y)MeG(;+ zS2WPC=rvFVd;R}_rMI2rx8yhhZdXg+?m4Lhm>+rqENAz}FL~*4=#m4zn(BR4!pMVk z`uj^IdwfM;$kc8=2}~`We-y}fQGvdl5k|K!NLb*Iy4b7GbByen#J7;I8W5Ze%st(A zw@J~}h92kxpPYZRdn?J)b*T^l3VS0U&2k)Q1YXA)>!8df%m^lrio9q0^Taib&uKZW z$G8;ND+_*^A1RRb5Xx+K?6)C(fBhPwWyJ*=ZQoGQ+VM4hf?puXtAwnPXgV!<*B$PY zG{Sl$3C76T`M}3>=H*rJ{&;bMI(Szqen@0q3kJL~5`V;E=c?3GweX3X=$+Y9_DXbr zY##I_W{!TqSmo#FWn7iu=p~S`lR3*nV7wIoOI5$jzkjI9zdP->vWL@+i){ArTshCzl=;~Al-utIrH4bnnWJ|DiXpW~oi)}^yZ&ZA0RDnaHo z3XlCMRhQ4aiXPe0j%R?(w^M0DPqxjJO5JPk(Aq>|DS59QuY&ej!^VS4vpXmSq7=$t zjKU6&zN>v`WA*C(@rx+Uj?nCyTf!WfA!7$OCCp<>G0gksiV$$K291^G%9&VPoI@i!EmBB+JVe+SPWFAR(I2I zHGM{p;43N(+azw=%*w)VX$A2&CQ#ujl#T(NcxKEITx0@HtzA(86H z$L$_l1Z8h<&aEogt?$7AQ4Sc3r~Eo;O3pT(C67VR{~5&8V+I_-wb8B*5wzwhB(k`m zt%?LlR$7$G^0vMkY?Q$$^3R1yWkkOgIuld##z<`U)9k}XDJBEX#=wv0s4bFgg>sXW z{Rm{$sYWVB!;cg@u6U~J*lpeL(hD!(0Q^)X1Ex6qHpXrHKmOkS3+ zr<*T?1w-{&YdHx@uvQY(s1s}oDL%^BrTo?O?!yi!hsjs0hFYp3^GK`tlF4j*1W$|2 zpJ|%hTLHbbnGo5Bt_wVkPn<18aO2jKzs=ecdqQzsp)OE?Wl+;M9{RnT-78aD*3#0U zV!^lH+<=w%@@c1y2hX-9IN6sLf2oPUMiab5|CZGx5EXLlVQRg@-ehyBdhV@6cT5G( zZsG?4C^g74S(2{^)u_q4$SsJE$`0P|4AdaEc4#?ye)Y%DtKUso`Az9W?*`Od*CTLt z7}8|H!gJkcSXqYEA?&dQ{R>nhX+;V-mb`D_0~b@4VlgMu8T}{>q4Jl5hIf;mxcYBP zd~MZ<_-lAe1+mOVW^CYhP;tmuwQCp85CyO6zM}i*YAWbso#9ddz#?urGYfi=j+wfT zqHxd$-7y>E1@FHA_F}eMT4?!9mTY85qEdC8ZX~gz4_nJi1MNWDq2>!cmS?D|)<7vt zx6N`aeR&qWo@@DSR0D$xHPAkB3UYrUPSF=>owz8^-u39QvsrECKrp`E1PjQlHyz}& ze87A8&gNP8ac10;XVKfSfMNvd#m~^5KyGu@yS&m>X#J_``K3)ydrCq-17&(QrNi3` zC$hhX-9)c%`kRfmHtHonU52Taa~wk)cXcPpY!!t!jA-c?%+i3nDn7|Da2AyQ*O|N28+_kqqJn(gr*NYrA5!){Pfi|pAe}m!_71e z+)D8+^3B7dr^;@U5aOuo9Gi6G!nbYP1$JRzMSu=?R>xH;qaCrj3fB{hXw7<8)u7Z`jY1_V_k ziL|R#VAz<7YvpWt`sdCEU=zlt-?jQ4#lzL2oU;<4=aq z?>aC&P{5Z*M%d*7sy3GLlv)ccrt9^p8=WwHRSQ`Fu=J{j#PoH^TI)YxlL7!xH}Rs-sm;5UcyN|ykCy~ z$o?Aeq0DWNzH^?Clg)eWS6lu($+N5+M7D8Yuoqfiy?xwR1Y*LNf^w?=52ThE3xbl$ zt5e*0Qk>EkM8sA0e)ORe*2fNc5~q zGR5ZW3QIPc)gYw02xB*=niO{M805I;1iiI~J*grh|#-sO!r=n8I{Tq^Qsquj^OSj*tVp&50v;QC-Ppx2iHTOBl zBJ=%rmZ+g`SZ^E5BI;+9mcYHp0~}SKTwIda6ra1HGG)rg&wdN62F4uC$(QoLSo|> z$*Kh!`V>2!JfC+=A&$QFw`e;mKb^hA=$TYzGvbD4JO&Xb!dBuOO9 zinKvx7+C^HRGgl}Wguiv!E2|0_D-xirO(^D*ePN8%P(GdIh)oPvwan*fBqHr3hgh> zkY)1WiU`l$PXuq5$&j9EXvH4r<@ZcVd!y0wlSVNK3psx_jq*S60c~eriiHFDzv7tZ*i(33)}`SR>fz#dJhspEM+G6xUG{7{>%iD>XT9y0ZxKo~iV_9XbE#r@VlpFKNye4$=6P8brGgzbx8bO)Y zAW|-qo=$(%qLv}0DZXFuX5d5ZW5dlS^p+1;J^%q4@D8Y%%ZWtGy@ofu6#Hw#7tLyi z1OHG)o>u4`skkvueq2{D-6z+83#X9tcsqz|M>I8Zs+Hd@cYpHkp`te+i55I)a66L1n?pjoRy?8_Jr+F~T}re(K&(`p{cFUlAxI zF!U64tdn)|d?^Xv=H-M>nt1)4l-Pdj~3?A z`g1A^pmLdZW~J@K9~fVJO4UkPn%2|4Y_wdPkFje3F|Y{-R@!QUqu@Y7Q6G=eUO|77V;Ld2dZ1?==YsYVVA~y7Z`Q7VD&7^S?hWcpH&gWOZ z;;23s+Ha2&@Sk_M2SJ|c=-Y3$;G8BjErIg&>O3)zWJcQKjG_KT(cfsP6tcOunFy4( zvjxPaTqUw6U@tnD(l4JaF6aQs3SH=4n2b%S&3MH4?u|UC$n058trg4)s@s|g!7n}g zYLG(kAJZEo!1D~m);WmZItt^SMxRf;xg(aT&H08p7Oo$o16&n-wk!-z8wIs1@_VlA z=T7{oG){GIpX>N%i1TB*fw2$z6XOEm<7ef6XZ8Gr=_tPTh`7YIDc$CJY5!%q& z*+KO`lbcol_B@l297``ivJO|^(eBscO*?o23&zML0XjSJiC8S)eTK2;y51uH_zn#0 zke1-#+pHo1JllAm33`9(;Ql+Pyf;EythveDx&5-qZIA~GhjuM-N>)au(bV`3)$`g( zVXstsEFcF3*8Z($K6udRQChdFJ{ib@b_L`q5Pd)pfbHR&MSZSZ1qIhKBWp5g<9l^u; z*BQ_&hiSlYca3*0_4$*cI5;W#ASgGMrG;vJYMS(N@l`Fr?y(E`h_mR;e5WZn#j_nq zUXiEf(a^t|6fJAP(1H8Tr>oOR_RMgJU_P%yivK(4X|o?4sRP8eB14J83xAO-uAVEa zS25@ornwe_UOvCMiY(hk(nvy=)6jm>l+2>KHxm7cJQ!4*($k!oz-UBA?0r^qCB~_- zVQU-8aCNY)&MO3a8AAJUQ^=%NG6?3nR*On$8npfFARftmGuSEjm#*Kz-z;brpbmp4 zOKtm~P+J-rJoT2#D2+`3My>{z4{62uGx#ieS9FTCUv*u&s?1cX9He@G4xJS?RPVbE z>U^k`eWH*Mw;PvVUVqyi!3u)E#4dMXX5ID;CL0~ytow-?Y$ArfFQ^xyDZ^X&-602H zF1h}ZCav|^)1)~nfS28>wEg0#fe_tqK*OJt zJU!}YB3xfNz@}4=Eg4sgc@b&5z&v%LU@VH_U^Rn zjEz@av2rT}B=zh^x41EV&J)?8$DV@Dqockym3pBqrfq7$8&b7mk}+ zW9<}#s0BC;LxU2AJ-}8S5i2*$#AAB7gR6>4L z9;Zo6bS&=7Gy0{i7@|O%%eRihx-}?O&8Eh)i$`BQxQR~YfObR+W+p5$K;kVEqNi#s zL7u|t<%*=a$st9u=;mCMmE}#`1|}k*4BoSEKot>xd=y|hc=l*!# zQ#g~vo^`fyeP;rk82DOVMI@Mb(dr`NR2J%vldrfb+7Ib_EbQlvWEZU^K37>M! z#RGn*Y{*VO8y-E+gHg-vrI|zfP3lRcR?;cnCqz=g%2ca%L|3sF%eg)%!8e(|xNM%J z$Gog%(HHofD{y%agRo}1%y=u8Qh^!RilCThX zjLfCJ`n=H`h=czvXO9C190{&8kOR!V-J-hHctf)PXwRb7K(-(Wc>4Y-?IGciO*|ld zg$zJX`|ktw?MO2n&#Axwa(b+Sr>z}N&yQ)rv1Ql)&jLJkgn4fDGcW)CGYDxj8Qcgh zM;SWqjr}|<>X6aH6~V;YS^>5JzUc?w+z)-Dwygvqd8K8PU7JiP>RBvvxu@Bbk<$AH1 z06aZ^c_x2QEB+GKCLM@&6osHV@WAofPbxbi1z(r&Xm93AHIGk_8)W7Sq7d;J``7xt z{+$;yr{PlS0CgGF1h?GTH;{(IUg$j1e(-PHUx?^K`>n`*o>@wYb6w@Dtj;l>F(rhY%LMGB_O%j%s z%Ynl*1-vlQmxQk$8aG9~ubUtUh5E;Q!_@%nq7yKYe3o`yBYzg*jwO&c{@wF=OjPFB zl)$QXN*%jvzLP|8*&eCjYx8FUGg&N15LLNAH?db01T0%AsYa_Fv9-eQs}-0R=>btS zg}H&B;W4RODI~fGiR(;>VKzIv`IT6)`mvU|9Snxg<0WdW+oZj7Y2tGe=Rqsug1p{#gbil<`%t?dALFTKeo0zO{T>nACKdK_x zGgMK{=!@hR+6$;iDe68u96~5t0k|5;6QWH?0t_WHHB#wpj^zjYZi98k80OD4xg%8? zo%fB`6%G)4gU)yrOk-LCz4K*T)%H}m%NaW66 zytY4&A?j0W^;S@sG!}l27QF6J(JV$xSsY-8e`#}#&Tu#`HFcbcQ%_jb zFE(E32;TgT=E#gs62chFiXZ#Dud}pwXg~ew)r?mbsU+y3?EETKM-hJaEt`Vq=YLwBu3d_@i%GR!zbG!$Zqi`(jYNpoE%_9R#=dmyP}EB|OKcAX}2rcp4@+ zC;iX%;?!4&hpr0+?YX~o&p$QW*Vv`HqSSdDjU*S0(+*AqxcEYq_dbs^K!}G1+Gi$Ts#kak(7|Hh7+@@-I_~L(@ojg-|2*v z*d0DjK>ozpaC(5-iGcEsvPkwThqF~rD=>0@LBf6fnM4;x+E0ILvbVC%L31OB@o4-e zD2QVD&)-K^e%*|#`5nMG3i0#j46a6h#25D14e&(tsQf%;HnYCvQFr~xSCWkUGf?Or zt3z^_+}n1+&7h6H*`^w=_@!iO2XnIo+$A>7H56L-cLkP3r!VJGEZk&KK7?{$q;~yv zJ+}&KrYS_`7R)lWeyGcGR>Kg(8@9-F4&^xiG(pi6=kjw1=|I%<{rEpRzl!%m9nS89 z%D*%FH&9lHAK@uNmo+#KJKUxWP#PK?9r5Kvv$w%gN`hpLiBfcndv)8GOfwgg%rjo} zoHpQLy;@m$Kx_Y9!Pyev-S@EGbmYYtFOYWJLSfmk(B!t8|EXEe`t6J-AZBQLSeY24 zTyyXn+&k)%%}z8@Ik2o>DDrJ<2uUTPTFalBEHnjrk0g^jqbFLI8{w;qG=WEoL+Pzv zCO_tnonJUkyC{=T2D?iFm6JPEOB?3H-XhctSsN*-nIkIr;EC)OXC!(S*v9?t z7V#90XcUB=d``)ED)wMu3K5C;RXOHRa`RDvGWfxN&DHikK$=Cj;aUFU~~ zEmD5!CZ22Wn_&U(>00DjK_O`?o$n=Fl?6-=&UU<)l@k0G^J@|L){)v$nT|g6CsGWN znc88U)B>MNly~UXC`N2@U4&PXp@GM>vpc%3xjyNiWD(>p$)eV@^Lqy=E= zJ-XfE!WGpn4bJ>2=v|HxvH65R^L=eSx{#NDWGha>t(b@9y`V*G9eq5s3u#V2Dgr2V z6^md`<2iYC>HB_ms^?c$d=i%1VDuIaF= zh&g7~)NBIi^?ytqWmuI>_EHxR z5Re9G1nF++ZUpJ>F6q96Gy)>s4bt6>AYIbk-QD}T?(Vn#;gN@#_sp5oH3nN4NOY*C z)#zJ38GSz)1B#mEF8B}}G*a2) z6*%P{h&HYMB@I)F?sq`i*$5hO>?BUG&mt1pNuPmrs@ z7t5MwE>Qe=ZkY3@09og;8iYvUhrQofMSTf{zEBBUZ%&&0822+<(d6Xry!`j`LG(n) zen6uTBsM;r47}Do7!54wTU@%MDg{K;MV135#P`zH{Jz9>N26P;SJvrb7&qXY{!dYa z;>+-yvt%Wz!MAP!$TsI^nQ%r2p3tSw15_vj^z`ZQT_^g-SL5igk6GNawv{WOVOs8rlACdh^1>-uy^1>&E=? zO>>CG^cGeZIDcss-OW`XBDkr>hrit8ku)uB#mVZnI@N6x6H)**yO`67M?DD|E~ont z><7##bgVEj2t z$vc*08>>GxU0%UeF-UvCF}T@xNU&^@JMb6m_OLxE-NMlfZg%E9IK%3b` zhR;qYH}9eM$CjLvG0XR*J{7+uNMu9k=_E?$cr0vw+H2_yLc?R6=Q;fd%HRS#^h>=8Jvy$<$oKMJ9JIcr$PcXE6;lJ|3RCu`eI}OUE*=1{z${teZ9UQa#F^M;! z%VmvrMx6F_T!j34cEN&KfeD+PM!&JDddTLVrzyaMGx6*su%E43E*nJ+>8ZC$&yF+hGjQl$_yD7xhwSEM)!dGFGRsAX}#g>#sQAg)( zNtq*0kQf-_Vh5XfXd^GIaqJmLq_Sk4q-LODVAS$jVbbFdCLSsj9Jg=X#@K@qMz5;$al&QPP$AWthhqT(U! zuw0%9g%8+!TLAPBQOjCEJm%-)vkvf5$m9Hcx7Fkhrwh2{up&=5RRa5(7t4r2PVkUf zTX6+jW^)Y8PYMkn(N;~?Q6^*y$g7y`>{`bRDD#*}ZaODAK|6q6fhoK=1y=;MsT1oP zttMhfSZj9Prw)e0_*)3DPE}td$IDU(@~fV^vmf3bI3dtlY?Xn>0ABJIGFEjXL~u+U z8AsZ2ujUvPD101>xaU7zcDoZivA6XHD3S$6m1(v#CaD{=t>;T@$%uV9NrG zaT-|PVm{qAbAMA|pZfh9mg@>E$C{yA7fy-hKv!gKBDh?}|-0XQ-+J zye3}JJUuW?5_@>^qu2V8K_(zG95lN8jyL->xK z5`i#2^V3q880r(CPPCZh4cE;aWx@rn;;(&E|z}ex5m@)!Tmy>np4$mQt*B!QU9*48E zWM)PL-`kiK(FZc-CCsA@2xAiLg+Hvn;S`aUxi+&mT?8T#!b3I?7T0>H zSI}Ve4Li6g42IodMHy%XTTLGN4+TYr%U7-3D|B$_s5BwW3`zLNhbBsINdqUZhuR4D zYP;=~LYTh!tyrqcw3z%Pc9RLWyNJgkJlafAS^18H3TPvmt9UGd!GR|@+#BfKg(yWR z{napb=d3~tIGAu?XbD?s`V{VRUCFZ=7h(4&DBt)s`5_U;X&f9K<*_NyH(iDOachT3qch65*fC5$a|cm2(k-*O|oIz1Iv5JYSMpICc5QN^dP@ z*;BL-&h+v*1o3t)$#ZqCjPipX_q%jU)Ank*X{k~>Ru^R7ze7)Ao*+5I^!OQz@Qe-nWP>t6uo6jtQw%?j0zTh z(rkQ?S?A&~ixM_e6hKP~nu2!)rMID1lbynGYa74^43=J;w?MYKS|a z+`9BlUjcgY;QrSQpZlN;rJp%9WRh@z36yEJKpg6#4LH1evg)wHG<5FvxPs+wgW&|h zx=UC2b$cCJx?b?C2|Q^zytr=Al&$r~T{NuwvtJVJh<%>Kp3+7Pz$cLjs6Eq13Vtys zPS~U@F-4p~8e=l+_E(o|sEKAfY6@IcMMtMr!?O*YuZ>`KP{u_a4MsAuK0q^y5?7JV z-g?<;oLNIFdGIlZU%_8kfaH~7Nd{5$G#n!QMg?!bcVsXZD}-KxQEH{|7Q1Zcu3JDDN(B*$w>Tjk?eT0)#|ostft#$(HhQmt}Fs zZBUv>m7%S`UEI8NGR9*FP(4A-W-LZwlOLPHJA9doP`iULt`a>Vp#r! zKEhHIk46TEoOVcjIPke0RbQ{5I)pz`YNO;=$(Ua0`(s+#Z;Y0?oB}b^T!NBNMU%>^z$BOVJ_5-W! z+@BaQ-2+rag&KUXRxt~zop4xHe|qJhvRP#-0ymBcJ#mEJPa+!z79lMNxC{aiYHWJN z)nOsvnHMNz?&gfCKWW}^ofci|dIE^&aV$@J5sQRQkFvlKCJzP4O}wH-=x&lfwe z8c-|D@sx{Pu6K6b87WDFvhFI+GKja;N$ig6=%ed|2c?Jr^BI`D6PR4x(ZBW>6s{q+ zm&?u1TKsYUN2oIr3Ze-x{iQi}++BJ(r7)wl zj;f{gHMs~qj?ua@4d##xa#d6@FROHkSId)|-xct4XB)6H2|&3s8^0qKa%!`9hiU4K zdTTxU0Q#_e7kN=~KQ{9UJ}zU<4g<9eWR5>}Az|`B7u#Oo3W$_S-u#vCv0VrKsiT3= z34SlMg_jw|s+6o-@FT?H9VbI&%`QmsCJwG!&>@;HXB3Y{epdNvkz|6O6l;+$!i|TE>tSeEk=1Fc@4(NylkmeRW ztxu<#F56VU&W0o4J>UbLK7W19?x>9h%=DXaBgw06DiD*;@!9nWOVdtsFF-%j zrD@p3_>`R1l$UVP$0rWZGdAjDplZAxD~;YRK%?%w41eRNyR$iCMl=$rcK+j)od$=^ za%<-AIoUwIvXvOPW~SG(%k9L`^1SDWq)p`eI$CSt$IhRV51D8t`ot52a7xM$?dlCm ze4)8UgB*tPLHDioCA(CqOl1*#Z{-^ak6M*wCiaairB*=kTNrHRWL?QKUef!#rKz|%Lk5*44HLh$5jdTam|C>;vJt29Y?J#qAPrVB)p-Q#jBR zmv<#3-mLBD^Mtb#2mjX6&3eGS;P^eHV`Dko)WkIqwgP2eRpflMX0ZCvPU8&ER$9B2 z0rx8xp*hYbEj@Rvl!8nQd*l~1UglOPe7lW$Z6a&<=)(wcPCwwC@N42~36g_zU$|`_ z8}T+{%uiV91Nt%?s^-qsLm;ed##eOm6lK>qjmS5i6|3DCF)?gH3Yss98wGU{;*W0= zCn}-lzm8BQJc!u2pTUS*t=|wFbm?&?nHKc<%4FTm=JKzZSc6HS^hqY{detov>Ey@0 zuPdp#VePFz=IOz&;V;%e`j9ok(kBg;wy z6ks+oU`k0^v`to2L{P4W#^`r@v4(HQW35Pb@R?4_DkBRcN0j5uN(&M|U_-DH=T~^o z^dVrwKKKD5`0Dw9N+wMLo|&+TwxV}A>KA>gzv~D|U**r)7YT@)eQ4_{GYHo6{rDm( zvyM#G1d2EVog_JZ?A<1{jI}ed|5yy@3o)h)Q{msg$*myI2_;aLj8>*d<}F~BS|}c% z`ii!F;AJ5{>=YT}z-3{!nKEKh)kk_7dcidjQ+SpNADMm#hy#oFxbmin<<{cl9BjDG zaj!P%bFBkWZj?afqqj3;0eGKG1ryw5!qq@-nlOxlMZPu&$v3(E%dw+#tjBn6Y_$B? z_*8aTb(5gD$H;Nl*0Vo2f`W7m;{N6&$mBSfsWZ{kQhm__IYm!uhz@)lV(a6~bJHd8?**@ z>w(*QwS2x#IsJ%?u1jLmLYRcbaYWSYJ$=R;w#x<1u&$x#MUO_oC?H^6yNl}-D?Mu0 z0%zKB0O_OQhL~m* z1MJ-!amA2r?teuYm45`%Z*U49RGbr!KZjg_I4;r1kg47iv!1|rk%C^^!uTLm5JX%* zI3q0!GGY5%$dpd8u)KJyiEAp?+o#w`pP6_+eRLbQ3R+VlkS*@Le0O@J@QT!BV)m`I zw&f984QTb!4ssk3qab<*%CG!P063DwXs76`zQUQKf{P`X*@!MS=M)Wa3^;vKeSC-` z(hXeUm{&8_n=}nxV~0jvl4KF!4Snl{HUTJxy3gKU01v#!{2OgE+ICegl=R%wvtM02 zSBX2Df&aCe&nLybjGD{%3hInDmv?sew=kIwOlHLsrZCL+N_yuk{_{9@!qA7 zg%W9&vS-{)iDX5}Bg+R;fj)$^HIL*%+v7q7A2rPBqe0;#i$T`zx3L3V9_MGr1D;Jq zaKH=8Z6r8PHd+6IBE%;^47tIg z{}}#3eGfe!ufJ%0^&a^(hCTefEzGi*AQ7a+j#Ho99Ob<^E(1tXkXgTB{soOqLzgk>g99Z=LCdw-F3rSDYjJ>gVSxZk_u`~m zS#@8@;{K=;f?UbcP&hRi?cFWN*F-1 zn<*>Dvuo*UJa|Rrp&qD+kll9$jv=4AoGbO8j7-%cr-JeWPBZ76#qP<3r}F3TU)1^J zODHeVL3i8g%5Q z^GG;VEp0u(U7Y^?B|BB}@jG5|>Ij*VE&;0^@Fja4BaxL8C-C^!DdP4U{BgsFfJ*~E z2>2izO0?;NsiPYv}4|o1A;r&o#}HcR^Ow0k>msS2D8~wtTN5XAPtim zfw8x&6QPc(!|6+gb7+2$uVo6_u!^lFMj=ko`llu zuigW1Ns}M&gnc(<8aIhazOR@Ra>>UWltu4zFuGip;Pidj>Tv|sEo2nfg^!f@ehDde z;t94NQVUvlB(Lr|pd+S!%K?-jCNLSbZ5f6B?rEUaoII^N%JDZw1Q#$rPSo{GT6BR^G{F;DI}wwSCKLVmVn44 zKS_QEtn>OaNRoMOZq@w`#rPJps_A- zLvabc5dPa+&FBx__s4gp z@8=~`9VM^s8dW#Zg=cA5ihU4a3P9=`PS|T)Fro=PmIOfdBv)juLP$2gG=Qq9!`ytO zCR?PZDkxLMaQN)N*i={Cf;9guMnB-`;ACp*r_pk)80=&Dkr7gX*Pe6(6)Bp%asJAW zxoR!k+ei!}B#58D;p~t-r(S|pGg^LS4b=WfzdKw9C2ikqB#d^@vnSxRvC0*)4+P?; z%^hB&c$XJYRjOK5tu_sZ2?DJ|f1*NuS49<8duTCX>$0D4QKmsB}=LC6gZmw={*`NBo`^*irZISQpKubOI(FaK#JF zn($)iR6MV756cIIOa-PJuiD9*{!*luq&VI?1kF1}af90GsH4!llk-rS>JlT zEf(-grzxaqsi=qRg?)qpsq+nfKI2vUedXrh?SePh>7*ib)e}&P0JMhb)zqCC0W&~@ zKNzNl*7;At0m4Hs_4Nc{kn|#GjHAHO_zjro!1|gBlv&0wA{#Z2NqzBq>Sr|{q5$Nl zyaamuT$xk`0ZLF?JzgjbFzt{SbPEO@I^h~1!mMViS3JL@{u!&h&+{wa?%MFT3&#Tn zDEo%L39pCxX{`YWM9xdBLV=8DY)=W#m~JZ{2f7YC9jgX`)@(nXvEn6fM=hfa7?O(P zOAK;SQICJKywkcdlhWF@%&ZZ8$Ht%ds{@aut4%8U^V^I>eqE!1A-(-3v{w*|M_!mZf(% z>>mCns5Q-Gud8daMoroGMwsh8kmr9lpURctmk9`+T3mJ0hBtlO6$e%m*_~r2P!iMk zBOiJ=%aDSaYd>l}1R7uhj99QEkT@5I5jJ|3LV$qRVj#dqQFP~5^^gF z;dkW;XF^)REh>76ouqcbx+rZXTy5t~BgbH3Vh6sM$J-}vMIb;aXzKSWhGLK)Q;u_J zPCE0GI_+V)|BtRg&(HoyGz&kNj`(#w7W}uQQeWUeXtzSJ&>TbCSi-ZEZ#fLvvx;P$ zLO)n8N}xXv4~sF8OD3EXVLsx5k>;--|oq5#2m*)Xrn z8=9scIbp`s_%^;t-!QDk7XY4MH6!Z`x&e8AfP8n;*1W`r@zSZuU-KylaC%?CWzZ1u z21Jnhb)t_CuNaYUE*9gvkSnx#_4_C^yw3RiB-5oF&SPv+uz->x-`e4EMu#mejNkjY zCBm8G!T|E~4};;~P=OZ?*#Bs}um}v0*SZt70X}&5dAF%&4!FxnkB<*P#PL0I9Ed4( zWI}@7k&GFUPy5C0soODG$g5c_sfQED;8xBD4Tcm#SBV>G8m^AcrS}xc+X+tU{L#3; zf4I<|cb%}uX~C=v;nQp%R-K|pY8V|InKyTm#da@BI3Ak{%u0O=pOsCUX2L{;jbCZu zXP&IEya0UyjEi=toUH6XR^dYxFMPF7%sr1)vS}oo#{Po8Z81?`#X)qEg?;&@v#SMQqG8o?FHtF`KsQVMHl-l1wP= zrAMKzR|;w$npU7)5cAas$iG{Zv{sHZlHolpC35NuAJkITn>Yd>BwC2l*{IiNDdGc-B}^nEt@iS{@ov{? z{;;swu=5@taty?@^@K(1fBIjwYEr!gp}i&;SREuGD45M|q^yCk$$ux9tU2|gbarB! zJ%uj_pvVD!4JwI(tLWLI%ci|-WU)77!<8;ZVfYhTG2!!wMKAk0Z0S{8Ur?UR*ZhS| z2Rw%+6{1^N3YGk&$4D~GxA1`$)wNLwWYs#AeKrSouTv!!a+)R87{^QBzP@6H( zUNSeIUzUd%Ty-bQV_=$$XG7q2-ULse%1ziyGoE}85~O}o*J~otR|RmKW}UVjEG$RT zHXk9IZ55+&1$1?%OF;krLm8wf_Gz>WPdNY%h`9)Rk;mtIqjGFue0yZu|CA_2?T!uR zZuD^oU|N3Wk+kcv6jo!6el<9kC(xA!Tu_Yhps4AWW&KrERx-pG3u`M#oAOygEeLy# zT~`g^le(gc`s^Gt50ah+Ge_(9$|Jlukr`&+se+ zY*XIQVg-O>Q7*2dlhMu{>4DltMA!VCa_=m})u~bAXEwmPzlMvw|A=93O=Z0v!J-du zGL-m#=gLP+vuRg8KXa?f+1mrFKd5T?qGF`MlH_rI9$-R*whi@=$UslR(%o@Nq_8is zS;Yd~G#02G_6RcJBPZ2yxRy{lp+bmkvMB;9DxqG1WF`GLE-jhmn;T)kLu*x^(NmJzREU*7T9&;+ zpEiA4i5G|adwfMN-f$+(^f!)hZd*Cgj}_eF()Q$#D5%>L`5kl+>+LpywVTEy z@g;PGU30l7=bDXiD~lmloVA;eC%a^@*eUJWKmv6!?&y4Q6v0!>l&_5?nfJa=UmMBG zb&kw{4?0~jw-2yrO?%q)5K_!V*LstcjWhyA#`9m9=xXbDs7t9_x+O^ zPSjM858Rkd^wL^$I8+n8CPp$c(({n20NOIqsB|ife$ia*m)&A(8(`*TNWlWXsac{- z-!i+;Cn||c%bTgC+j^?D)`=R+2q?m~A?*)!0|L`EK-m#B;~Q%?M&R|7&kto4gJ~nN zS;;~TEZYR$=Rxy|y)T5K{wS1dk zh9WFQ;X^nzM;rEIdwqCHYLSXpgs20E!pHhagVc&Fj+zge1owytJJ6SnlkP0gYbYXn zpBLnUK2aO+(tLxl*$?MH)mw4xg$sFnk%2j_pW1It2cBTSgj2$}XKGP?C318$%QA z>g$Nz3jOl;x$SHj0#K7kEIt-W5YZk+RC5xAs@BVQN*-_rue_Pm$KtHr2uZnL@j5PQ zV4T`sFRSo{gyCrM)W|*r>eKYP~2K)1yWy=7z0X2acN85=LKCh^y$VKKZ1<2cwmHFaKnv#cGb%Ckx>o{3; zmlk-k*U_Zaj1%ewKc@fueKGrn84#S{sT2IerQ`bM)(^p-fVzeP zyVX%p6WP8_3Jzcdi*eD(*c}=_Jvr9(0uc`fWkXCDRuX~W;d3~2J;JMA2|zDIk#_Tc z3In_#vyONl3G_3*=q+0pZ25-js8G0rm(dZSf8*9tIH6tuk&+AGzXJN<*~bDz(~w^4P)C z^0^B!tnelUj23@19`8KS4!u2!OjCI7+tneIhN>W-p~ugVe(pi61%%v~AIW^nr{SX^^hYbSC&5Q_oO({R2E>4_u zep;{|=FBrLp)4cmatAHS@7%raJsO{nHX-2L`L4htTPYuox|qXG+UM~(=~ttGHF!(y zK@ZNp$_TIRBpHZEMx^QCVw|GdyPsltaB8{44Ic5FwWi=tCt{pv^}Q^&_e~$oB6m#v z%qnMB3G}tTz7-B(!$Bxa{S`Kexn>C3f!RHA%EhdO%k0C#LmeEhYZTY@u(*zgqF3`X z$H&zzxKIzSW4=`=xobnI#&5Idku&pBek50S_Zij~fC4hMP|iAlIx#)o zhu_pl=`g7hmU-RUmbaiiXI`pkSFuUXz>O6yNjsv)Ls^2fyx#65B%0!@IHLfHh5 zwswiHXK7y4QCcF)QrukJ>x;;|ewQ(BtKA8J$L8eE2sK1<<#l*U$G^!*zAk_3TSIoG zdh>OAGKFTl-B=8mo_N1-qxnL#fRT=o!^nco3)-IC~gKuX*HMEZ|+;0eKguMj62dgbwwB3oc_` z2vsOxzt|05RMiNdAU92C#Kzg{fg|+_WG9E;9)y~kF2=DB_Dd{z($<&Uq8X;b0S_E; z1tE|VB9ftuy?g@~w!VGo9w|Q`g|?5I#a!%Vf&0gf%RFFM7u>8-j1ShhIC=wz!LGOGKX(XR1}zJdU|lE@Q8=s_e$ zAO!x+DwJD@%Ep^XnV9*p55@Zh0i=2F9y}3tm}`Ju#c1f075XZ;)t?Z}!qD^uwAAML zJ;5aF9(FPE4Tnd6%rul*fSeo#IcP;34*7ENna{Q9hkXM67K5YW!mwbEU=R+#JLV@GL!&VB~cSyW?O zNq!ii_H0Tvt*hx4P^VxRMzjN*oHmh!U!I_YqeQHIZj6X(!N*BVy=PNih+5(vUj3Tp z->3`x8)1skGw^%RpV}|~BqA3cco3wb#X|G;G)-@yc``$Sfz5g2P)*&vm$A9gCr51W z`APUYXFx$JN(ppCY#iKNts%cf=^Y0}!r3!{22CMJ`t%S~#7C&u z`+}_XayuZ5vACz0z3>aD8bKg)&Iij=t|EZC-wt8GkBN%DP;9GRrh9&19Hc-fxXssg zLu$_Y(l^>YzN5t76>$0=9Dfx5%3Iqwg~>l_wGA?=S+r z4g3ALYz1e|9gy%Q2eC({im$i*k3o3sR1tv<48Z&)(T7&V3dN7!5o7Nn{D}Z^lenjs zd;7Cwnx3(=NULGE6Bs&$lq(8@i9Aqz{t|~E;LP(1g!?L|?c&yhB=ekaFa>JU<@3CV z_}dw}`nAe_BbZpQ%}tFMl$(crGNn?mW-VnA8W~W;*5uZ}ajPguh^&v<@c^kH#`QGn zv%OH|KmQF)BD~6o_ZxYv57x_=$yeX}ez!Qdmi9*ag@1E^2f9assR06snLYF7 zc)Q(NZve``IAspu2VcDM_uw3yye?bh3jfaTUe(v!R|mrt!-bqFA~~J~dWmMge%G~J zQ6>}zI(>(r2dNB85}*>x2yhppHKSk9eo!CEb`bl45aGBZe#0Y)PFz;Yqey+&S8`)E z_6&OnPb=^q$c7rQhfJegBqY1DqsJ43rEqMQyhu);$)bvsU%v>x`yhd~h5$hV9ir;n zB{mngK%MR&-{Z>C3by!5wWb81oRlInSh70+V<%rpM}pr&fG!w*S#_{};iSe`r|s#T z$}<(zV^x4rJ^I=}-ei~KVJLW01t(o%Na6DG1DLO>#Be!I6_}+IGJ@QGo^2p5Kr|5A zgZ7i{duR~k63vty7Zg$fWKO{#uscGFk@vg&;biKp@5{iPS%kOnXQt*;C7~%OuIXY7Y31>u;Y9sA!in5MRA4_!D9=|3TC0j$%Ln_H8N5%jT6gVaCyXE zNSgZUi}XqhaaPjWn(0^TN9y_A=~9B}(r&Q3myS~}P&G}mCiGRJI4jxWJ!=q+68DPF z3sjgJQwY{++6}Z;jj98h9i<|4M0u#bxjnLGxyqOx;565B-3w6BIV;{JJ=HaUPfTjY z+j5z-13p7R@I-`U!`u+8lt6-ESDXUXk`Det=y~WSIMY`7SKPB`G2#ViNwg;TnIJ{Q zJ%J2Fq*br7FLGFGj;=mgnG?Q*7(Vrb4kt|rIIW!YkA9JJ(R%D_q!5qEU)Dk&Dt(n# z5jDF141`1jro;Z3od~<-1WBWBefJ2P=xW0<|J9E;3Mt}Yq^xgKsr=+}0Tx0N<+|(O z!YQyY`Ph;`WvU$i@L4(MpA8UVx|DtZ9y537?l4Kqp)nX5Z1Zb?&vIubsHV&pwZjy= ztkl5_z^Ap`n9X48TGz7ooKs;`TCHo)`vM`%FrfV}D8QcdN@Y+@ToqiMn@OM!V1A26 zv60L3(|X4`tlwjBMAsP*LXb%v5Ch}9(^&6l8R(jnMFeIx{XGdVy){gx5s-FtfGi`Y zeL@0H^TY|Ef1SUo1=@t3u^F7~{anF*g-m-q(l7IYZ2w&atj}%vZViF%s7k@{`hn~X zh7@9KIKrbS7DT4$x)(i&_(c(I&_iR+N1`AS{<9J^%!jqY7AJhMC2{Fo{te^e=;i4`Y2bn19 zUfqf`@mK@hBYA+1@M2m5We%Tf_XKP4i*rUG-Z~<14IVZPeONwB{@;lJ+JP$l> zKljv5WFH|``+tY9*B)RKOtD2N*I(rZ^;zUC50=xVh6!d)dI5!Nb@^d;uJ5;aFayOw z)-DW3dpo;yW0jNP;?P{3RZy7n`+L+nBNJHvoQq5>R~7~ngzzZ%!1xg0Cf;UtMhZaf0C;8ZJd@hD z>1AiBsPb|9bO7)r=;h9s$=Oep$&!)u9m}CBKbJu9u-IF0Kow|y7#gcAGl9R}47|zz zA^<`Y(HdO&+O!}ro2~tSU!b7h!p~fQw?*`;EDK7W$^#~i@*hz5RVxJr+x5_W z4EAc=akhKNxkoU#tdXG{J}w7 zc{S7&X#$ui^xtoeTTwTr)RXzl>MtVeyAm8-l6TqZ5NT^Gs<=%~SX^xTd(^=^0@T(Z$mu8o6+vOAa%xr-)Ff--7z-1FOz|2=Y2g3W0-V# zv(NpXhGi)K2P#mYqf`aR*<9@#7^Wuo+cRVz?(+E;X`idW*wP`B>h43_K))vsXEMLe z%f2*S?lF=Xt0mnWmH(r^@H}f6r@flqD7?4({oFmc@cA?6#gBFotyW!J;n{O!FKyxX zFu3NE_5mKA*_1PHL7{27_kJ=PkuAJW?)^Yo=zn{WaZ@h$7%24 zp2hB_Hlo;h69}EG7TeOM8gC+}Z)k-NI&Tjc7*VNkba`4Vy?nm)|8t~3Noi@$fAj3_ z9^Kdp$>ZCS=On!?-%>!2@k9H4e|~v-y-l~!o4v`=Z73|^E5Q$UHIdj%g-xNX^*>mI zLyU91M3_P~GI@EE5Pkb^=w5&@gZ=)l=Sc0r__?klxxvl~3YB9OEs^hQK`nT_^Csk{ zb-=@%H3mYr{{v=R3y`xmP3$fHA^5U1t|TF5mok?RWB^Hd-?`rTnk(r{zWX(4xM6>0 zEU){odI7RycC|VBk!~yv1w4MGsIH;7<=d9| zqrzUc!)}FqX9?}bdck-`9hrg;+b{iSbFi@_j!o$Q#M#kAHk9Q#u$&q^qHmuw7%+9G z^5tenB}$;j-@(KBXQYB1l>Q){BD7&YPF6xQ7g=zvhmcD!&Oevr@<$2i_tTB(+<~4^ zD(@=*R=DvW=%T&IPe87s|^YUSDOn26) zAx(KZFwXeD@Z5i`u>bqBeAvrn#1KRhA0DEG2A=k&Qz+h<%1^5|N4UX|IMd(b zJts~VW8T0HLV3Q#tiAsyl?`1den2&CZU?ChxsAni;&pd;p;%qn`qZ`;Wm(zo_8BOOeQpEU!PA+$~X4<-Oc)%8FzGZ#r31FGVnCc9~9m0 znD&4`SkY3VLZANq3qzcI&ZEO_^gDsn_Le9#J~5W2?P4 z25&HeUnYnAk&jJaF!fIf?^G}tI9Q|pcdo!+))s#x37IntP~O7b6#X+ZWj*~6^_&)I zbZ@W!Poodang*>uy4&*Cxf;{y+*+x$*B-`)m!W-$*pmN{sBuk=ErbC`XD}z4ai!&? zT*IGD!U3+x`AMVxN_wi~s=F$zVFM9oGo_!_H@cY8THR=3F5g6Izkg6HDlT&X7)@?( zO6xHyCV(d0pB?U!4a=kD*9yDG+@TyE;6T&ZoX4D^?D5OUT(&V&;iRWu8$O1><(UZ6 z|AXV0&WSdtdwKmej_C$y5N}!@JUD=vv3x>+&`&VI7alN1IGBc+SwViLNg8$qO{J#4 z4OU^dvL1#D-~9s&i`qO8BF@~KJ{{D5&Y9%)2njh|fF3=E`=kBaivyA(1iD%%Pj*5Z z*rTSpQ}HrEAn1f0HEiq@mH%U0<8=OU0J%{qwxH8IV3RPvi?Qi*rRB?SS!smz*7N>R ziD&+JMsFrBxBMzBA_q>UgA6`*Y6PocADLOo{XJ68OTFvP$InwH_&;#}zh}jru zp5Myy=a6M#+0md$1tlk@oLBCQ^aB&~5`Nq-{do3yZn>F$;NOdFProQ`0)b?4QIsLq z!*nHad(~Nv5#!DD)KBXb>5D{Kp1)X{a-o}v^lt8P%6@dD4xj&`RB_uJiHR%6?^l2W z{r#6>S*TPrtI?oQbs)ThnvOfr}liyR?zvO3~P2rfYBd zIrxzuUD|&avo!?K2)>ibo6z{C8vK=+vJ6{Bnp3WstN!PkarQFh%o}7U>@vc>oqFm} zuV%|3c6Wt^yFP`YUhDrXFAJg-3_t5q`TQWe`*!1W+4wdbH?K`0uNMAIc2!Cioq&-B6tgDM# zVE%%Dl5GHhfS=0UzOwYf?)24RHqSa~`Fc=c(AL9xu!)ZyCPOh;~ zv$HM}TTfv$S>nR7;x7V0&Sh)BejXNm&So+{wy1x-svap?>Z`Z)aMpJ@A^f~lH>V&u zIM~f2=8*bHV8!ZCF^BJk%VZhRhJF4o{XlrwNned^nLT?MaTgm=@S*bz;<8JGm8B9X z*v(&xQ%>N#i_`TU&f6iM>;rFfRkO?7nyGjqJyOys%QsopApJdov!yU5Z~`~^wf@hP z_l3DQB4&6w*X(mkqw|;R6C+(PlrPi83@B!~u?a5NM1=+%Qc7i<2{CL%L9|gett2-DVUbT1Xp~rBY-d%)7yJ8+?y52N+;POzZ~-d zsg0N{kphL*qU=fa<#*dzQSArkSN~oQ;W5mD37nXYP1!4J1Q^m!!t_LEdhX$1MmMg% zE50eXx9>33xZ29Hb;g+La>vutsukz&hxa(wQ$2dVF%;4=~Ux!z0PIuH& z{nxzlbx)tR8Xq%+5C39b@Lp~f`qQ^C9i+Cy{BVGF=@Xvw^9nW+$GACEbn8hap=kC* zjxIj)!p)=n1q?G~46cv@#RWEfNUlefV&^uPa-Wca&t#Fe{Yi{@4X=B$3Og?y~+129U;wxLOWey($25xAxyEEHC`5}mf%0A z6NPHRd#Wze(;V5imvRjrVS$DhXwmKi_6_@W=$hry+`|6b_CLU4!0loqrz^XiXTmsb z4l+v61dmj!lvN8$xQQA2D0Ex}!!G_8W7(jkFky)-?V+3A^x5FJ~B zuDhL`3bx%WSf*d9N|_DT&^YBMczewMZ0yexK^|%{jg;m5GRyZ?wgHU)jtC>6(Jv> zwrRGbv#&jecI1<6u6A)X?YTp^68uzq%n6K9i^pPHNM$-)r=JsLS_vb7}$!iMnj{I267Ei$n{!C<6D2J6&cpaXIsvO^#G4PR^y* zCMrJ4de1>|wex>PFT^Pav=mg=*hjoAbtxki`|e5lm{U9{pCDnl$yRLD{EGBz&h+7` z_qXMb0XADYG71WsZyAZoIvM@~`5Ou#H1oZ5hwuHi@xL#B3`Qk6Nv!+yDZ1>|1&_Ag zeNnudC<9cPJtzIgIA6!`*mr}1?j`iJ{$DH-GYxW!{z zn$q@qM%_!LDVY4(tTSd_s=33=T+8&ami$Dg5v3I?aM|HUlX}V8e`-IV*+yDYN&XKj@`wU$D3c5$a=P`puF}aI zBOklJ5yd*SFA{&Q?tCvzw1^fL&v||lT6gWFO?FdV%)Fr8cjbzOt!l*a_v8Bj+vC2S zj$Oz()FiWLrzusZ-(yaC?psuAu+H05Xq=N~lqfEtzS!(2v6}v5;i_^(kilb7kneoc zP*l3!oigBwGupa_ik0yn_H7b_;t?;!*?g^(`|_>EDieX=UFo+Pr3uz=rOp;MxtrVx z(*w2BdA0ew?g`VTLm3KhO0V({9bs6@-Q_7!ziTNoav8M0mp+cIk%8;u*B$y-aaaD% zX4Zx?Ejk#@OiO+J>K&c7u{J2W$RKHrCAEy9Xck+wOxEBDu~jC*eTIZ z#S*c!Q%!5C5kWL1)GpSNRBHdCFZ~z3^TYeo^PJ~C&$*v-?sJ{@y|1IdM^s8@HxC>9pHNGM96pk3X_VXG~v1I;{ z$2Z#{&uoyr=K2lJ+TDV%zbe{|SNqpQiUGulTF@8!yE0XU#}k|xn3zgpfAdBvi(K^h zmT{pY&(rbL9W{`cwOV4ko)(c~+421v#wOLs%OS)GM^k#7DW)6T!yNxGyCq`i-Mx!_U{(z z%S)nJ8*$M@LC|l|BN)|hSFX1Z;$c`{@<{MkpS)t>g%BF~g2O??6XeA55a%cE-+sVr zbkF7hLJ1M#b^Z8BK)XM~1DI|K;#bYOUNJlgqWrg_ELKGYp)e5#{cpy^RuSi#(=)ME zq(?8Wr+dIqGVWO~ezPOEj#v^jg;0;9D=j*wc5&`6fY2UGH$yz<_Da`6gv<2lz|jR0 z+sl%=hiRS9-1*2HCi_bO=I>?P zuerulP;3yRq9vixS(yxbr`bxqe9ul*J=(3^I_NcWh~=eptYcKznf&t>*618ykWQsB zf2qfd67V~#=>&JHLR0q-tu<}xUH+VT{bi=FkOu7iS`Azd}hpoNG} zG9UfI7&BMsZoR8EW2Avla5Lb=z4bbhMgp5;2+f_{zv-EPOq9M6ztdvZSn`}$IYe~u zmBKWeC_NlG)1=)#5Lmu9qpAr{`o zkEC!+c1_Hcso_;;%_Dw1i)qzv$hd@&|NW)Cy4v*VL6yC9aufE^zo3h88*vPR8`nF5 zeTY*V&`sZBucpQCrAqux)=DrsJjx9JxN8pnGJQK^i)OuvIeqwOU^y z-ReGb4o8Iq`OIhMlL7aZ$qdq{9KmA)(V>TLr3;!>mZ0b34}$!S6;mM;ha;0!^BnDOK$*sWud7HUa#$2u|7);c>#+-( vRQ0DIM3mC{@onFCA~5-2KmX_Flk!ddikp~b#2~tH2MXHK;fLx=K6m~HLZBRq literal 0 HcmV?d00001 diff --git a/website/static/img/caesar-logo.svg b/website/static/img/caesar-logo.svg new file mode 100644 index 00000000..248420e6 --- /dev/null +++ b/website/static/img/caesar-logo.svg @@ -0,0 +1,286 @@ + + Caesar + + + + + + + + + + + + + diff --git a/website/static/img/caesar-qr.pdf b/website/static/img/caesar-qr.pdf new file mode 100644 index 0000000000000000000000000000000000000000..98ffd51139b6a2f2c783bef02a56c8b28880361f GIT binary patch literal 22572 zcmV*8Kykk%P((&8F)lX>CAICY`wBE5Fd%PYY6?6&ATLa1ZfA68AT=N`AW{k-ARsSB zX>4?5av(28Y+-a|L}g=dWMv9IJ_>Vma%Ev{3V57-ea(*aI`&o?+;jH#!qHaeKElF$^43uL5dQ%`=9^w^{?&peR@1^*YoY`^nJTr@0Zv9AJ^OK zbQz_8&fnLc$JhD!eLr8mK3_k#@5k#(`=}kxALn}%p7!(mwbKizjj=1U_t!sL<+gKueqVMRbA5g9m16PN_wD=? zHmn(W8&tvpYQM5Ud?K+<5eC+~Hp#Y^{bzf;zMqemnLV%H*HdB!TdjuQXM4X$YQ@L% z`{(gPGPKx=u+@sRqox6+R;+xdyY;&23ei$4!l72A9mD~J zN<|#CVri0S#q;T!F5u_ueERvm-BL5sp>{)wWMB4c_1fq;pU&UUvszLno01N-r5sV= z4S=Lj8NMgy!f}w^TipG2hdiJ5>!U*F^Lf8O3_wdQ3P-9@tMVT5{PX=P?R431=*u&O zgu^K3`}fc5wK%p^bNocae!kDA#Ja?sHLpvMg6->$01FrVu2w0wQS;fB24_6~Ah z9d1}UheFVJN z=6HGizTd90Zu^{f+dO>kQ{v7xf%ol%p`##+s zLV*=A-m)i&C_3#)aT5~w=gN-SzxICqb8+=w_xeIpM z(+=WgNLFZ(rn2?iGHPn-3pjrtP_6)4rsgREL$86{y)DrwM! zJ;uyj;PdBzXo!k95K4*9!5~YAAS&b-GWS9CCqulx@6SAc(Lo3ffYsjIlKMql?(^lo z-&tvh%mHK6E+IdE4`7a2IgK&36!{zsieVF>Ar6FGU{k&95 zm>Zhm?H?#)VX#NMy>`8kIp6o;>XHT#IS9cLviEu7wd>Px4Dt7 zv5JLY%manu;JjbXTkdkZY2l-8pC)YjXYs}pD`>tQ_i;V)=9&o$$B9HB>u$oiYt^zrGj4AB0_fL1w$MyT? z#-DR`2wYpB35RIm(WTp>X?xasm!}%U3#qpsWXO^t9V}rg5~j{>N93(IW=-NL2bIi` z(sPMI<57a4!&InFWiOu#?33g<211nIrjyxH ziy*Mxl_ei)@?7*;rm8SikMrpZG|)8R5u;CUuoFfDO%t9l+Wa<6BXmelcm(Lv z73>62A;$!kiwuapU%c}4w0E2r`=Cvx?$__v<)=D! zN#f26M0Q@A>bxb!=a1PU1!xq;4354bdP6LN2mH?8D^gnwomIpI441=g0Z` za@DMoOg1$pn*QnMf<>O8Pk( zY@+w*O2rxBcn&f`L);NciO({t(H25O+~=xN;`7&Rq!Jx*M<^ve%cMeE2n|swDNmZ|7?dNDThC?VUl2FP(_c<5|=@7{66fG*p^)=djqlb{u`Dv;1w+Nr3p%9K) zCfPuYk=F4r62pA2ls%+4=rSnK!JxDeG{zhU#hB!vKaaf^KmQG`i%`+!D!E5&&y1GGTLsQWsclV2w6pg%7u-{fkb15*^t^OxA*6000@Tyut=(3 zyFEV#H!vJVL6MA7Z_m%s4IB~*3eO)zcw}+`SA)&) zCERBn%j8hNM#w{E0$D~#I9O;w^>evV;xRZ4kYO96f$B*+L9{Vd4uLdK58Vb?Mru0l zb7Cou`EK|88c$stQHOoLi0FG|F~-r;O!PbIUjv`1bEt2Q&0SGHiOw+0mq*tY^PL{7 z6OBF|hpm{Ml@z2QkV{TuXXKJKbcQ-3N#>GK3(L0@w31NH5gsKS^$TPjVN?92s0^tB@3C(VcDD6PI&)h)-+P*5Sw;vNl zbQxb^v;ASC(J*wgg)y@00>t<#rWk!;BQlY|W5x;b_q@%25w%z%A!b-V0UNo+s5K3> zAsk`?1>0@4A?-lB&bqS=E3G+fms#Mm&JwWMhOkj{yi{Zx;@6M}0Yr{qIf(W%M z9cT^0fdj*_Ww$RfGUl(yE9n_TB$o+*4v~a|Bx8m#NlZZ|iJXN=M$W>u znhaFuVQqyX9|*+pzBhKBjCbvQy{HnB;&Gj5X}F-rgz$i{IDF~p2uMAUAYdh!m$8^L zmX??_mYxs;x;g^DFl9J&4Z>!d0g4TZP`(0O#o`KL)d@@B!Gm~w4$-|pN3=&;#lkjz zjNB&38L1WHxkzn{ z$0W50U-r6_@F%#20jKL*8epo3$RQ!#=dY%~gz zJ`y;uq_lR--RAOB#IDRz#>!l~Y=Ir&Y=g|yL%~xiE6{!~_0*eKMf+nyR|)<;*>g!L z98@(yh8A0fHd}^vv<#P&Qq~k^>D8^db}<5*+&Xu?ycGgotY%H%`I?d-*wLEYH!n7F zv=)7rGtckq>+EQY9*~1&SVHzL&0ZUA%AIIjT5Md}Y+Tx)4>ZQ0H4}D>>w#tNMXMLFquy-Moyq5e$01jrk%4JzqjuGw29;vx5u>H>}N# zs>M{Mh-70C0_OuE5baKL!*zN42Vz9EwK#Yw<(Qb8@|g;mDaJg0n~QsVpzrllA`Q_*Bo$syKsL`!S{w0bEVgLYy0InWPum}RTSKYYmr&xiRs{Q@?IZ@R1qTj64P; zI)d7->=(0R%L@`%@7g4>pagTRnAKRoN<&D#)r5r_u|EC(%2saRhm9r; zklL^^`>;ovX>?d-DfDM%Fkq<>>0l$$MtP%4~fZ8pI&ONXtF zgS3F{$Qtl=BwSFXMXH|S8Lm&$unphBD+^%+Boc&xJVT$9$2Fs+YeomJ8SS7CC5D@bKh63Rk?Y1Z>lcFWl&>)7za~6K z#q)o6Y>5Yx3gCf^16b6M@ATF&u~_C|IC!n(h>NAyj@(ZMC7|oIRAbC&cp_I+KC|a( z_GCwzWoNa*RK3$QE0%PCCGbcR@nCLF61Z)VBwz_72>=I+HyCa7AZ4w|mk9^frc}So z@oJG}N{7P)@z9?f$O@>Ez+@A^^r+B+c#U(48f%=%oX_c~7uPuZI^YK;)oFW`v!n7! zS5e_GN~9Z_o%=oV5#SXIm&LjUe5WNL=D_E3ap3biF!*$j2w~=$^9SmIbfEcx$BTn_ zsR#B-?<`-Z-1sjf_inwAc%as!|mrgEH( zTUid;kMHLxH}3wZ^>gwK@!B79Pj1{WbK~*{YFs){3*c#wYs5>9+uP|MZeM`sQ&*|~ z(u~x=uePIhdnPKjxis(Vwq7@Q)mKOY63dg!bsRGHo4LcIOc{ZNei>2)x@=HGupTUG^5!f zSHmVoCP!Cbzm=y_C)4LMw0hVK97wdTGez=t=0?Prx=6AJ4&p=CHG6Z@@CVT}GaVz{ zSEA)?Od{}yE>pmTk=Gs=rK>&I#%Q2kUvG?6tHB`@7D*_0dtwy4en}z(4x@zl>WX9-1HjVlL5C>zN;nhakXXi<#7wNHZ(4>i!&I%k z=*m$c09S_^iVhxqfJ}@+7LHjjnf5Ao;80W+NtG{R=5wTW;J_U&J8n!Yk=k@z1lCCD zE~nlx3Fsje2m*u)Eya;`C-^+)w%-{(_b2>IzB+U$!t=Ci&&%S-{gOYyCEU$ty1+GN z&?r#{jc1-!Lz-OubWf$C2-D1+gg-FLR*!vVKHaiT+jYVI>^9b_SQ+e&r^l(w>G^%R zt82ncQS}2{PTA4^g2Txc42P?^eTk7K_}wwJBTHQO+x2QZn7E#_H(d$+f{brjinay_ zK{q##Bi`pvF%%h)-*yU!Y%W{z4`TTUj|oBVEWxH&D&anhGz*i#IvI&A7VmnAcDxm` zJ>MBoiA}UkLM_1GJ+=~r3WnEp3Wm3N^>r57!PaX$#yNFHX0+pN7Lc%@2XRP@JiuF- zN38|I%AmAND55CusEcKLC%F-*EDK5(3%yJY5ZzGqM<<2NKT&^Ms6QQS-kO)QO{TV? zrswNPq7-6pFH9HJuIp$s9Hm;aL&=4MaI;Zquu+xqbF{hM$iZU0QIld(6I*B)I>@9m z)ml$QTZE7tEW;AUXu{{SDkIps&siX0lp=nYl`!BCNCWjMO@nkTC5J&8YSL^*StJ@9 zLg}zxRAZDyqS0X#6iFzx(C0uig)NK@s)aL#_*3v0q=I@oP6AnE6dVHSs7_uPrHdXp zjM89}xH8J3rQi@shxM9wqx{5Tlq7~?u}Tv|n2KcKPNRcEFzq<)icmPrG5*zq&cmzx4V?z?imk`*nEJ#uLJwPRLVaA=ZBF|=4A`8iU6aCp*h z)kuoYD2pJ2!zc}QsF8cVfFC7;j6#P{Sj3LoxKwUI=7*vMX{iP2Pz%~ITTpP+Foj}h zs6uk+%FFjH-6KPlx%*3_MSx_YW6HyxDMuWi1~eQ$fLQ97AX7SK5pADENAZB1c)cbK zC;K11%ohUR1QNlEaqyySW^mT`Wa*8g(CeyR+wo#8OCzr`p!li0(r!C3U4%y1ipE@x z>&iEWMBtl6X#>1>gfxhP!48J&N{6DALbh2~*mzgT|DRQ@w6g3V(M39htzh_ls%kCa ze3XPk*hXlGdUt4qCN*HIL`SroA;O|w=)iSIj<^uRyq#|wLC>et*g8h@y>LkKM?t&X z3ELrIBO+coZi*Q1Bo&b_1${@wTSHTf_^QD)H^$4GiA`}4LU1?;isXvcLZ2fc6b_?w zSiee4C{6d!kx&|J(pN%R3Kn}KZH`h_O3#a-B$W!i z{7TM@`HIZ42d~hmdg28eB5;K+2>6Yho0Se!0C21w!m(AiwS|&`5y@4sgd@$9KXY+- za_n>4#jOfRvZ9&p@)~0Zp1t)Rxd-izmz8HyGf%6T)H3k6W#|A0z>y)srIzWHlzf2a zv&aS7v4_Vtj{M7~t!_NN5D(FB=7eDX>bO-MzB)q(6s;L3UR+>>nYhKadr`x#{CY$M zb`#MWTa7la2~#y_M{FWt$9sffCCCDG)RMY-5C)N8MI624i!D#eQ3c6ONT@-n?%P=@ zHNanLitWqa%bqzOGDkv)8*5>aDQz&N8O;fx8CR>;646TRv&z7-pn4^)!(4>Wr5kM_ zG(?F*BXltcn_Yl*GzSt~Y^z9rsSot%I*LWnx)`L*5;fVBj$$!F{F4!2vqVQ!B1{Nf z1JV{kLzK!iLRXcrS)wCKWeTBdK-xlRh*FtG=&BMnuN&>SZdi22>xNZlx^O+bPM=XY zuIw&yZY=ZZaxU%!ojwyciVvR=KRGb25e|bM!;zr~X^_NGG%5f=OgNalZ{>)gE-7dd z1{|xCs~=)C7L~h2y3~|I6j{WMa}3)g4M`2outXU)h8mjSD<}}I^s;<5<3%mgVS=p+ z7QP8((YbI4g+($-DfBtexpWw%!CLqlW!1TG2nFvslLJfKc@2n(i$IfC!9v+l7hOz; zgESg`?P!#Jlz8O_;axHAI>23!QVAD4%-l)4MNgPV_!6+0cwv*wc?2d7 z#H7|Nw5D8)vr0r1`vR!Th#B%W}H81!Pd#nkq!cATQ3Ba{lUtd~f2(MMq` z9DXnRpSDHqvnZ6hBx*&}VFX5K3I(=G@D*3HH?;u;RkQ&zpnRcLg1wV~V)!m^U^`r+ zV*w?EE|}s!ux2dVuah1-0#An&0RFv%x6)y_E-hdyob3@V7I-ll7I-Nd7I-Nd7I?u% zWFXnvgB-uP) zpYrTRi2%N`aJRytrnf!6zW^+L!~?O^_+YcScFgFhL?}Aq*&N}L1dP_$ezPYU7#Tt~ zf2n?vG-{DW!N6gX_`F1M%q~INz*IBH4BE~hrl?Ke(BUARMiNp+S#(o45=w(jLP{u$ zZh|ABG+4i(O(^r_X#$zHF*>N;&>8}}4vNw`*&$_xi_ODvd^f?9f>shqiYe%#yx=eh ziewaQpf?JVdjbjD7$}e&b4R}W5K@}#LpIU%neya7kQ{R);1++jRb}}0y1K*}={u7S zhe@_tI0(RYMW;aI>sX2lGtAITjsa1-; z`Wy)`I1~c!g_8p>ju{k?hzTo2ED=5j@{0~fXdK2Gy;A6-1#<}n4xx0|fl>+$l-E9$ zv)GOg+Qdui7@hUf8iTc7 zTEo^$YuJb!NHk`cE$t8$u`a{vH*jpn2XgeaoJkCcRuMzSQ^eZ0c=(wff3hcnY*~Mi z*P^$=7B&wfrfu~^ghegk1PPYF>OI>yILBvG;#jJ5MpY1gC#A(`T?cWqq0n1&D=i^( zWfitcbVMsHA#`OGwhXjGF`0$LIFA%%)RLBJ2}dH-82_VB+B#&HRCE{xMT%pl3|UX)2vJX3tfx|l zk*@Y@RaJu-NLI2?%qhpjdQpbqFv(sGryLUsQh`PZM?z_^PB|I{2c;%KIZsku^dzbq z=EnAT>jxU&<%k9a99tXVIKpo$Ywx)=N$j~z`Y!g|c6|qu(sv?>ADAQ^K@xBziExP| z7`bV&16L(NBNGmmIuY}u?nM;UWPHuHPHTXCN~+rgTR4(Bj4d8bej)%Y-)-S=gTRgo z0E)FkDC-4~+1wt;d9nmjqJX2N_Fztx&7sXOqzgFd{ZjcNpVc0VT86_MQ6%@YTIh46 zmcwC`4(sIrMq%>NiL-Ddg>}w7E+s`JxG;G!eJ9lkkW3LYnnQ%v^#-*c!9j?o5*sL9G;LYt+I=Ccu zTd8)Ps${aFbrDOO(P&3BzT`(Zysc3%_1t0FiMe+4(v@B^F-eRc|Ge1Gu4wnP(A5DJ&A{UGM?($Nn3E6 z(;pMbVqGX^A!^o(?xaIeStNDYTIh46JK+#Y zht;}8c$A9MFZ8L;7)gGaUn`FD_^b~-_;xME8d@>bNV3FYCrOsM5Q;$5Acfgnx>&gB zlxK6rSK35vA+Hy@!sz0HpK>xr2ep6^Mi(sjC;=*+9MLBDx|Y8$b1w_b-YW@hKUPd^ zKUU0pJt1BP)!ub@VYGSLer$Li&)prmOtb?JN0Qgm=hJmUPG4LjrR|CKk;g&KtP`4s zsPb7v%=AL8IYgCq;9cWuK8#g}<&2cLF7sK~zLs*twM4?o-JdBfUrjD#GiR=JbD3bF zeY|$?zHufiQH`&$C9d;xZOe=@n?hgQK}-1?JgIK-uyO$?o`?uLQgA<5?x)H{dMg!* z$=RT^SvPn#UqnslK^=&i&r3t36Z_pX%n*654M(CGMY7`_FDOJD6TFDa7I8`d@unj_ zy}(2JbwM)A{1qb;XR^!lDUxBFPmw8$hJlr?DLm<#%7a<}P_;zFd`*|ea)QlF|C$(6 zi$Y8+o_wV#IHE$#kx_4ypm{fjc`P$F964%d=8ek<2N@^hgd^cB$Uc(AILL~5=AL#& z>9~5AoIu)iPe+33xJg$CW|0waWS9<|l!b8?ArX$$&E!Eh+wI$wL+odd{aX5ddmnHa zsiD|T?8r>~C^8(W2FNfip4`irg^FG__b98A)tGrtvS~1LBpPt!pq-d=R0#*^AmfB1 z;Vj6`QVEA?Cc@xA6e=fXs6tlJ(xgg{ubw?nZGk6A7va*i%(`(Nh-!W zWx+Zp8cSG6QzjnmcAR5k4VX!cn zINM4?A-iRYe<@iPQjz4CpUX;{XJeUAtu&~Ag6;Qmue_A zXOx!F`n5wS9ab5)gc5m#gyKBc(?W~YW!6IDi~gN478cqF?VxPks^(8=c(izrxLPf! z!2SjMmp#Pt-~3Bqy}!gvgJF$V_*8!EAJTjtK=m79@h|2ou#+R5y{Rsg3X{Fc-qp95G?4h46JSHxPe8;>2UcYGdTIU234e zgmGr7Qt)ibhlzY-%S4{0$kRdYVQ(TYJdkfhgM6j>In?>|=vv7GYVo!_J=o%XxyQ`4 z1uW82@B>j!k6P}2#Z#+WZg<6lE5ZvH{A9E3tn5?pMat9R(4CC5eTG@JJUs&H$Ua*! z0pSI17NPVANTu8uaU!A{L((0MAzK|u9`+V<$W zDI_wv!Uu{;aF!7?3E31?$q!+jF|bH}}OKXbp4B9w{U zw@wZ#WTTLjJwvWSzI-W6%TR6etCQtpo%+rg@qM*ggwJ0hKZR%%^yWNaEKd$}L|{8W zERH76m(7ZVcux zvIIu<=|BRfg!`r|@J>Hrr?QsA;H1QLc@;ou_+F?xSD&~lb#5v8Dl)~%cW~t!;KY?b z(WpvIyg1auvTUAT?Q?#f61Z}W9X}^LNr}JG#Nw|+GSw&(&EU^J+>KxZQOP;Jh3 zwv<#m>nExkJ**o+!4yGtM~auK_BhY4{-^+Q&%$Fansw7&_jD=sBQgi3YE~QLU4*I{ z=s=djW37ZjX+UYEJ}FNu9D0n?fSr-fILtsB2Oev=2JDP*=CpQR+5qsungq^AOO=+q`-Abl$g+AN|1$#D)TSw7FfTFYdu<%n7* zX^MmTc$hwm_ zK%ICcM$6cxl&K1-h#hpypBDQm*pU?WX}Da9$%GcUQ}Z4_@z}EY!mHu z(Xz<|@|V^#Ovm++NrqW8q#TCnz+NDkaAJL9!kG&oMS`m(m>~^&Q_H^7PdHTBgX<$q zFj7#A$L|CBURGhUi|~{~m8OieCxm9|J%S}W+8)eXq>sKgm_k3ZHer&M&BPq7TZunV zBhdjC!UIbMbQ>+T^+F00UDT}{iYyO8bCbPdLuG3+k-BxOQvb4ucudSKIZ~@)H;>6; ze^Jt|vHz%RSF~!FxmEcC)r}5RO?aTGfNoWhQr)lz$<2Xuu-c2Zh8uolI*m8_5x5I9 zYF3-#oioE~9p+4}1nCe}m9YmO$`N~sZm^dv_VS3lJRB^U7^d(pR7+ae?3?_xLtK~o zB<jMOV{doQ|9%vT#;COown(#yHBO5=R+c$5`UFMoN^`uu_Lxz1XlfGE=OW9LU5yL|Ol4bi za4P2nrF6TE0@%wm;$5rdSlzqG<=_l6an=taLG+s)BR@nu z)PeE1oO1^NB~@~FoRULNG{CcYp2ypUV@s`~pMdivccHJ=1aGfScB?F!oDPv>5j&W3 zhDVPrK|7g2TMn{Lj(IV0mI666j^$B$M4%%60KbKM3p_pFHVU!N*oU~E;BLN*Mw7{kZ527p&1#}pt!=^_M zp)AiDb#?RsY|`FDInvq`g)AoFn{jHf&w*T(Cjm9+%}bm!(i7RbELhLaBtN82k@4l{ zv_1IfCk{>tzIt@0B`r_nSm^A?h3q>mAWjwF8i1q?V^jUA4H1UB^iu`+6Vv5Fg4N>+ za2>LdW8twQSGJLry_V+vq?D>^5J}f08<~_voUls`^b<}1*)!h|5R^TIVflt2<#JtV zCUaE?`j(h7V@TnbvQs1RC!~HU{jE1g$p^cMn3}cBWa_r7OoUNB*e#@=sD+Ye)`p<0 zETX0cA~QD-)3++aoG>wMpYu1DN*n1%WPi>NUthgJN>12~bRbOOFRmjt`wcyw=>->~i^7G;6Q(wKezlsH z;}I4OFh@W$;=SzvB`*&S%7Vl7uMOa1s@x=typ)4=lp{EWesvuva8*evOx2MJl&t~= z0VhJNqK@-7M`oz41|x&r#9%amEL}BuSR*-t0?~q=g0Vh9Ctoz?!`TAJhqHlbvPN>~ zqRBHE3ofeDs-M&8ZV_a-t>KUXZ$dKy$WoKY!zPg<>L56@3B$2Xlu%cjAOp?<(EDs* znrsp|V*hYTsN*664HvjpKg(RT$f9cHAjA7lxjCoq-EU7U(J)Z_ucRJgju)uN#wrQ+WO-RiEWqvEfN0vF$l@g z)~qH^R586gn2oUY1tedc>N`E)B=+m$3_W7oE0i8^475JZ$YY=ez2!Fy3F^;B5kqzG zfT{((Av8nLW2gqcFW}@Jh8vX45|q$n;n*vQ%z~ zCVoGM0+}8S8uH-2j05}Ajr)ot{j+|J&!i_l@gen8hE#BLh#ejkaeflZ=)9;T8RMj< zE*ayAoYr_A_mNS|9XLT6nFB#ZXH=*#b!?RG3Y{CJ64dy>qZ#4SL&3}s{BCxDF5ys@ zTKV+3Q@2Nah%^b#_)O^{I3s{eHi#UoktF=$2+p>FI6qICG=3$Rlg8q#B(4-8le|q5 zMhGR1gF=#o;P@mcWd7q)$WR;V2kfVywk@O`|Ryj!r zn@WzTTC7XzhZU4x&#T{IB%B$ssl5I|B((*tsFzc^TP;M84dhk^bpii^ z#H_|v53Z6OI-mgyFch~?E&4|657bP}k|urQOVy|4&(YK^53iOzNXUjj@b$8W;04q2 z1GC{eS5ffa^YfO#@>Oe-|L0I3&?CO`fUmY|F$7b!=F0@B`7(v7GNeMjawNXot7X3U z{(IsZUx@eR<_mImGrdDsH`6avLwQg`VS=opB1Qi8HZs?cyU0`s%OM0xn-%mTVs&Qy zhUAIK%GCxbSyeaEf1|U+R;A$CQpyt*VD^#~kgW>HL;lKvvI4?H1sd6?K&AURl8*AY z0y z3kg(tASs0j#i^*ebJuoD>Fsc(^tRfT`RGN-zN}=mGs039L-}uZjHf~3VJ=`i9@(Q$ zDA42lHfIlHtNC7`0pMIfMS=BHcs%3HvR-v{xk%k(F z^_Ch|B||Rz_h10HE!j~^9k*tZtNMjQK`3Xl<20oMJj6uUWGZS6lG4ahpUnF%>hopw znK}%Apr%ZYL4tUshS5ZLDwNaUJhno7hQ()|F*%Mp< zDyj&}EZO^@%3l6px?KKH1oQb1!JLG2rCas*Z}B|ONia5%pXq{{FA%5E_NZV?+Zf83 zYffXivXNvDP}Qn5NI7W2jf4YRt4cp5PgdzOj8;atk@yo=5G#;ZhuFh$;Sy>dHKDMT zYT2}B`dCh!6gW2R9VqaZ6?kFKpO`G4b`Ct^uazch7c5&=1uEHCAo5V3K?U%E)hue` z3#&&G{ACGVYQUeEFBga$cvJ(eG$HcNEr;j;lHf#OPAqKQl)z{cxXqw*-w0Vz1OTBm? zZvLbdyB%L7OpZW|m-|UfR)RSzDb7q2iZj!Qa4^Y;5Xwq|gVU1OHsQ1+_EiXPRzl&X z_5Ly;)R9R<{G1XGSTrM6(u8QkBnrWoaHvhK{>(|@I5f2gjytDtBamjneN5b+N?=1PHawI4b0%p33`TA=S@=L%fMs{|)!oQ@{Wd~q($av-Kk*pB1d%BR!WH)OJJ$U(|-L?h_e@? z1Ke~Nf^nF>O#%oL1t*a7cP=K-J7D!#|AYgNJ=oDDP^c?L9p;vk#$wMY!SXA_?6af- z-N%w9W-s%PKwX$*SDPb!AvU$psu|@WS4u!RLL+Xjul_`9z$EvS?M`w3)^>{9h@`!6 z##vRPJi=+fK7cpjtlCW;;;4{uS}8B1O)yyTy67cbHN9nbhtp3Oxl{3XsZwMnFH@R| z9^y#6B*=I6PcNQO*qtLj6+rCcF<2mw^bRCk=OdoeajIPLO8>53d-zp5I9f<*3MHWzJPldr` zCRH+XomC}Al7MDh&AbE`7u+ft9fELRz-Ta;Io%4yDr-Nh?1il&ERZpZ%KR)Ul(u-w z5xk*tHIY#Ui#T)|b4xcyl7OJNC^&vUk`Z`bm>oPYtbX>LL1m_xCB|n_ zc5R}=%_ey@`Y|nVQAXg!Goh0U(RW@#YVJ(@Carxw(%L1{S=w2- zL$!0t!ZIs+b{5t_Q#&tBmUS@6uA&zXH!I5&oKoy_AbRO=734t`bS4A?Ac?CnZRL{o z)+usV#d5d?*q_!MTfXl239kvau;G%`pzosK$zzf0bfmDISyu4ES;RLS##xY4LRL6` zXzha2k<+pX<18W`jwHf5a+c)6S;RCP38y2c^UQ?v+ONeU*K2pYtf(xNaVf(tw-S{yL`CG_z8`p)97R}}j4DSg4|6s(R)=i>6o))xgW@zXY{TTl5I3gO}BR z32L3W=rL3S-|}Q;sC6om$50Kt>`qBgNbMvjdIZ(Mx131w47E&S_86*xZ+Xs4Q0p8? zk0v~MFhxbS$v1%#Ql9h{KHl&Fmo|LpC*1G>hcX)R!d~WlU!Qk;K)5=OvN-ULKRJNO zEguY7DdsI7Vy&zRY15&oERr3uXbm3bS+EE~=G51I`zqFQ1nZ4^K0u*S%!}U4nwb>o z0cKht2bhP65L)yG4$j;JNhfYl2g0$22nX}Mt*w-1c9L9YW;j%ci`cRwj`xIzn4l#S zP3ugLf+|&`nH6s=`^*|Gqc@gn8UDbWI%|DN)lrowVN^O)h(+vR`UW26Yfx30sH)OA z>_u{*7X_XuG>SR>Bi2gIkahbU^FcM705Zy5D{+9rk5rdWLhAd={M?gToIhY+l#Oph z1CC#YyyqoF^YiGPb=n3jmdb-@MCG}CEY(jO|4kcZ)ap+C__*-g-+JJ@=_PTg=jf!w zj$?OvX>Fi^lu;27Jqf5mmrcD13P*S*DD0_hJ5{{oii_iPCB0ih(HB1HEKUbsbz?Z# zC1hirSqM|#JkqZ06&8)ALRs0~Av!Z6hlUp|Co@&1O+=NP*i1^ipqaGx&CSH0m|H8H zrK-A~*1i!r{mnlueXmN$&!NhM$FZ4!k!MqihSY(}%F}eqwK$(ugxZrLH!fSzyoOp8 zEz#^*$y^-21qu%yhWwjAh6~y-yCeVH16y10g04+1e3o z<7{@5<>~C=s$C?BEB2YFe&8XlawM+t?hZx#c2THu#Fj6=3~Y`~o2}AMup0}n3&pF% z%r6X00|^|{K!%6S5$PWUu=Tp+ec7V8RKo8E6>=4_bg+<$7=1C6_JBS zHNqoN7n|ymd7cOR%faSOj`PS*aFrW4G>-WU8_{OU$MT5|vF!D5YRM?ER?Z+;E7xUV zT(xB4vdI%w{mqWi6v7J*3>VhhUp~zos|@_CLQxJD;#)#Fc$_4|5)!0r#`W=*WCul_ z$wBE*(9Xg~-U#J+iBr+6^DgnNnXW~nePL=>sMV<2H#tUCgcl?fFU;+|()P|~vHVkz z)CU0qUeSa`Q6xNF_3;*RQ{IC|%k zUa&d%D$(R&pU)mn_AxzjS2MJt#uX_vvynfj}xn4qx1z)(2LMj{9qK+W%5pymsxpQzcBXEr-A(Siz!?dR`<3jCu_+9$SL z#Fp4%5!<5KNSBM)5?%hpbnOYc1O;D(HD7VFGP>uUq;#h+ZAT}8r)nwwi0pyM%GCzR z-oxtMms4oVRT6qHcNEGB(R9E>M1zzF@WTVuLWo~Y=9zD8HV@5G9tIa z;>Uu3ds>Hh!+$YjujFi)(A%t;@3#s z0ZJz8qtxCrPCrU1(Vz=7)TLFvs1~-zDpKH3{p1KzI!Glb^Zgksh}T)H9$$9h$B0g- zY1Rv-WE=@%{k`~c{XO*y(_qm6GSNa_e@{k~L*2#&P7WX{8Hj+DVBW1O&Ps%lv=U|E zP#P^lDDS3D#vkY+$Pq0^yr=}jsgscq>&TtH_&Jht#G=WIproC8nLOYNIM$|C|D6|r zsY#CXAv_wOSjgi`S4p2EB~_1WPSPsjG+pyK)IQwhM;z=IwawFXkWwKiKYSwF-MNSP z9LXMf9H=o#iMfP>yqjULM29FH)|(Ctq7_G0J@6Q&!loCz2?pBtbD7(h z`@DXlPHztyn4rv@Au1Lzy;t(-xEzy}1Qc0%RA&~-j``S~l53ANi`nL-w*uw3V$W=X z&9l7-RjTEa>ZZ@n>Lm3@5~UhyYOe8eOXCM_XgUCt{-)ohcJ2+9g|CRNGM64TD>u|; z$Npg9b|$JA(N4Emi}N{D#qhYw@&Gw@hd45}k8n&~xTl>T4!lnmuX7ok_UYnrP7+v3 z4;RN`P*;aPF;{uOm7t)?sJ=dAX6=W)BP;=(E?&AM(P{zUa-9(Zw>zC67Bc($bCR<3bm4?e+TiOe_f7RlTa0*_we zgTJ?gh`)X!WzEd+;t+p(z+YbrQryZlKP3e0XHoF7h+9o8~o6W%I%|d{x3P zqVd@Yq6K}$3X>_&t+Y{SydvM-KULyR zuyRRiQK1)UD2HmGG6{!=MF@wPmpmby(hS1!AFmQM`s02}$sPyR47z%FmwHbnk$GqZ zXW2sZowGmU&Mb_%BTYl{$l{1RQ$LA3f8ueDQ|jswdCkp2jgHE3?(E>kLJA;Y@>CX^r|Y@A=yTLQMTD&o z3kmHF6ogVe#Gu0<4b;gggD~|Z5I9t5LG}JXq43BLq2S05*jz$}vtyDu4`uP9Gql)m zc8nGU94IgvOs>V-3P&ZC#F1$ya#U6-9LiY*NoBd9$DQR8$>bO$iAR=*2XlKX_av4` zO|by-R;;tl=tVle8H}9iV!I-5hDNUqkk`bkO;(iwhw7LdgH*hUbW7t^q^<;2hN?&r z!ry}d;I?G*R^e+%k>naVk>naVIFvz)R?r$bT{!+gl}e7mf_UJ_c)oC?I6r+aMDIW8E~vmZGgP}Qf;zIA2>vjMba(N3Vl{NLx)j1tXI?-g{d~7FcTLJ z<>{ib%IxX-@CUj+$uSy~cp$-ezCH`>tink1NOi&Eft{u3*@_So)S|rjU0T*4IpTAr zr`Y+R8RPVdRr$JeRx)Ypqa!PyX05{$b5#kJawYVU1RfK{k0kIIG278)E#BB=eN3ND z01Hg2xyH3@e@y(lGV4c}9n`42a5dB_`*ezhE<^IniuxQd?ySRGTVIETPx|VhgDVZE z;Pkj2%)F)Rpk$nyHF-|hFg-hl7NphC@BIGPbd+lo9eNU-MsPN3E0|8sPEdGl*V0*{ z%vXWFqy2VM(HB1Hq&o*!M#=ga9wU)PYF4Gd)U3%fIqGlyWogzHJSELmId3|hV0pQ0 zsP$Qao&?pv%Vw1X^`}lx3blck%_<3MeF%UjK{fEQ!^BVrDjuFBq>)ZamyQ`HHjP{d zG+bTRj*LW!C{aR;Aq3Hl7G+F==wbxXOY{~-H-jM}1ks6-Atbs85u*2=C}W7|b@VoR zC*LIh`@a9T*0=tDeRth;?m73|yVu@l?{)6EXYc)R1R*=Q(B$u5od8KuNbN19ymeJo ztu-BD$Su7ucCmZ!=$`U%QBD+Z1a^^R21whfY_Zey_xoLBV_>11o4hQrx=doQ2Kk`bqo^|~&Y zq9sAS`+LHX>dm5l(o`uTx~#(q%38dfcQ>Sp(WNM2S`A%!2_ZTlI{N!f&@i+92b*aN z_C`&ey%hhCnyEY#Ucz02!Pnpu(s>sN0oVm=D~i^N4`IOi-R&{`D(Ko%Ig&+6 zJgy@6v}*RYt#u#W?Hf+V;e&G9P5CJXW8|+u_c%DYJaXH1v<=&~0FGL0z@yu@iYk>g zhPt>#BG{7yeUF-V`k`mU$^!Qkr~0}d(ZB3gWFU#S)7duBfVj&cFAAx))Uqy~< z7y%qh^~KGq1j*3n{h+1jD^-=0Tv0MlS$vfiw>q>f<%l|OE0tl&FyHKljJ3btr%&=F zExRAvNoxZ%ng%|$hraj(GWCP!-wDL_)FC)GWzJowBdt_-SI&9k8MdO_XLSJQ`xo(j0Nj3|?UZ zl`SZ+%c3(l#?5^69=HvhW7(0125%!u^XyY29xHBuc89PqPvn66*kE^xZ!$=3aKVr_ zE&2pJ3Pq0NLJRTUi<+f71MT;*>Z$70&At=75^Xkb7<`{R6^t@HZn1sQ;#4SBty~)y z2ik8k5GwR1xPD9lzRwr#ANw5NicL8lMufm}my90@HB5}0(0txYz8C{8Kw$T|G~3)ASC3~#;_-xicC}dUtJc?2lfS%eH~+36 zchhLx+{jgkN79u0f zuu?TYT^J6u`}zjr{dJ%Ai7`mmI5WSZrEtvYiuS;$Kh@rK*+R*-2q1c1bb|`7+*cNT z4XNRtm%}-U-m?-8x^#+a;zn_6HNT0`b@kJwvehu9s`V^bkULy(d3Ncrf8k?bIOUDp zaLOcVauO;1w(T48lUx^MPM?2%Gt{q2^BRJuc!el9#8nR{{)DZ+^BADt*i2kq4I2V~ z1K&=668=2O0xGGLo$O#tdG!q>Gk6?1OKn{QjA!C|9r0GHUlG#(J~LfWoA#lhEmG=pAav1p?WnC>pyG-^qinaPLTOji*UeXT^!yx>*^4>kViqfKTyD|*U-)zUn zTR~QsWfAnfE9$g#g`CqCCn)daRuez3_*mf{Ugl*QE#B%X5fpyr? zfm+5R=*Q4Zz)rDb$J+b;yJ%u|MT(xvhs3}}-_q{OnGfVr*LOLr$24sN$~5@*H8heu z?~)R7j)3OUqA<DJ(60FgR%#@`jt8t)%@VPt} zSdzaWd{>$ZHqZ)nOyKf19bQkxpOdOBU_Sff56xEcq>KoIV2#j?3=yGZ4GtO1o8BXm zo6Xd6ch%2_YJ}O@=!uNFO>WGFVBUH7-%6*Nx8MB!6&m>Z7w_F=RZrun!ZzU_AMU#5 zR~6^5Ks+IRC@1sfZPS|gZR@Y;jh+Gw09 zXRJ-Z#27077f_RAi&QN~gf8Y*2qrI~Fa-#HeC#=}9yX{tJBxN-7f576Q=L1qye>a; zOrOq}yI0%%-mNF5;6v|{95zXT-%s{z!hsH$|CA1BKuMBuvowh!*W2jijO)h`EXDrX z>=m;1YaV_j<+8nD3(_C^oAcct{y@m#ueIGf5}x)AEYA0D?7N&TyzO6}FId28(XI_c zYn86~jpjG3(FTUVXr1#%T|vWtvpGz^Ho^UP=P()-}?^O+R@0!-11D%+&Zi8$+7YAS$TdEUK0hGh|tt> zQM5C7rWnYod;8P2#B{}H0on7KRo(??6a9qqcFEBOI324@2n+B~;)`c}GiOmmo0*$z@u@`0}nBcKC}iklpT$C|!0&0cWC@R;L4? z2lQbYSF!fJ2JrE?vg7@?j|SSK<@Iv)8uGO&IzLR!uyGV<$@s4(X>GMUV1syFqvYg$ z!PWDla7Xy+lq68nz^5UBjSDkr*`>B^N=)v+YJUv@Ov#z&;f8bNJ3#}8saCexluesn zdCw15slY<(*$dBNKA_3Uz3tXARAEc!EG@7MjRmGzW*-B&ghfTGC_eGv!o zWDXCTC%3*>R{s#`NgB@2A=+2c9qRbuHgBP?=0P1>{ZnmMozs}a^U2K9BT5)~wDvx4 z`3vL&yj5|@3!oc)O3|J$XK&IG z*vYFp&Um&rg9$t?;z$5C!>BIW!K`O1*ew?Lj|AjfWqcRSSs=ktXqGzHYz{yyq=cFb znkgAbu{*j^=#`RFZz9|G$WT;m2Mko{_P;#$q{~R73rfD`I$1}lgf!K6Y)gS zy8U?Io*PwJn}-c3VD>3pa;aTFb*sj4;zzF=-=g~uwrXrKb)U~bVVkiX;wY*+gYX2! zoiLY@IJ;cp@;(K^3@^8o%A@cpfn2t3Z&cKnf3f&ScFL6hu|AXo45aGhse<|!&ur){ zH<}CP_->_+&Ejar&Ys~SzGv}$A3BphR?9qlU}JNtS+HRetfH}WtF7?(;JtcCGeA7G z?i?Uq$$~lMBid0&r3m+e;DhzbC{;|TY|l?PKd+`XAD7l%ph`UpN<*QhBK+_1<~-`= zY-I{QGTJ@iaO+N5Q)xOCn{{lEEmTr~Qf!UnV*$LJ0~7F?d(%6;L61tC50&+0U;U^j zYhXt^I zT(fZ>`Tc^08<4)_^uYl~_a2p7y^a(6L^1HqD=j_{Xj{_U4fecGxcE3PwhGi`|OAcwij1LoRGqM?^V zDWR9I{z_zR_61xyc=qxZF)?p?6JoGo3*kTZ7ojYrqv2m82ggTZxm!rF;iWZc7dwMS zob|_2jHpIhkk{z=UZH5YmcRcXbu?KfZQ1jt`^Wc$r`kyUDpbgVmQ&R(ZJo;B#q73g z`L<5)poNum%6)%1f#{j}_+8PFd70JnA&1{=x`vi|Wn*C01ONfZgX!H9^GQDUhg96} zHmkxq6B_0sN94%fO&@DO9!6-ML|CNzP&}Fx@$WczloiglnM863>L7FbN;VgMdV=zK z#e~6I(U-WOq*uZpHZEcL3@+;&~9$$9X>2t0H5qQ`qsRx~%qRFs0}m7jeN>xDK0ck(h?EKAhI z0XpaWka?2zDI}VZXv7`#+NC4KG2?>FPOqhT{`?NJkM7$DIYxqiw!l{m=1c*Djtz8- zD$9%+;h#(knwnNF)lLf%BC0pCYd=n)#O^&(c=u_IW&N~va+4-T6q`G)=s_d3w%O9F zhi1FpHs$&pw0eHEo}?@=c{6(RXtT1rgrzDS;q#^z(;_Dt?4h_pxp+S5au{|fc-Xxd zu3AZpFLpnDBgE!mx(_pVV+e7X{HFC$ z$e3hisC@mnK=3!mU6uuA{>dQZ`Psm&)3kl@i^Gh-z>V*&{`-hDifvk&A_qTg9C&AN2J*l|1c zwkgYEY4atC;!;azy3yXpd8IB(BA-eJJm6hC+g!opQwCNASR75BiiuK_M^StJGR>Cs z&6v$bMhocfOf$GGy6u>8zOytK_ptr+0>31gv?X=F!aXXlto{sDWPqBrf3eF6ji|d% zI@x&3m)Kv)r>bwhkMt-dCd+DN0D&n*<2WKYVE27DG?6BQ7JW`t!}ivB9S&T(kS&i$ zG{B|K3Oaodn!32WhGkz;4SZMZ7SI#?)ErUIWFiqiOJB8tn_GiU!?$9}p|BUh)hzfu`7YWOB zeqEnLs`|=7Mo&!p5Vc9$eqE0(((?LPfKv>p5#v&poaVCq1z&ES=C=FJ(guHFH_?qZ z+-Grq&1s1_%0t?&QIlDH_;~w6ak8Ys65TY>`9r@*EaD|=!b0>3ag>ztJ5bs2)u_&e zpsUbc`U#l}gZZ!HxZYz*;Va75Xx`K->QALYw^K8&L12N6+f2?V5MS+~tJ~e45Y{PX z!-(O!%u_GMb5D}%i>GhW1$2TRqF`>MDq>UIh4;pnrIZ&9WzU{M?V?ztSEHRkwS5Of zn^I;pl(uEJKgT-@2TnB_kt(Ij+T1yV>xasA_WISfx2M6y4p(J`XbzzGXp}r9Jw$l% zre;U1U*oL&d!eWUXSomQLLMV%jtM8q;yjOR2k*pX4t*e`5kpkQaA<%P(OZ`d*b2Q9 zJHR{LXC*J)Xz7NnqXY+=y8gu2%tYy5 zN;W`O>aR0!a%sPAJ~6`!QTV#uY+n{LGlmc_`T_v+?lB$Ahds--tpTORy+rQ9>7pa{ zapP$uOD#PNFMO~mS32QJHkOoVDmp8v3qGzmsS5l-nnXz#K4VcSim|+8murmEz@*QZ zf0psO2)eRkrb+fyST{=ZN=8*=jAZ{^X`H}M{*55ZlYrh@Z_*ruFA!1E%~;t9Gn15i z`T|M_++eE-gwHaoHo+#McGF21RHMl6TTRZ_WhezluK7<2EuM$UxkJsP1;}^3evz3E zOaL%TzZhPMH$>`C`iy`xJF2yl^${JuNnmIs!&Gl4MBzw^e)h>y({*;y3_sM|wQDgc zq{UfN_jhYz$Xx6jc6o}gZ?3NibVPtrn3@UUEpfe0jbC5ShYx-cd3CbRklVOe{{<~d zsQm^d{f$KW`%1tf6#FU5VH1K`I_h{j|DpO98mifV3%0-_|Hjwfy!_@% zMD)L6>`5HVsf~@g9Ul-;oybLZLp)G|-+~I=q^)+_+K*2*EUrk)QcI_1y1`LmTu-Pk z2HAk5Ac`anz05(L%@#)8RY*Q0o(&&1d@xq}n34F>%4;A+9pDOutUvLOe48&1`e&)> z()C(fLPEnt3+Q8C>Z(#=+s8)N2gUjymmRZLt0sbQh;yZDwmEN&Y_B}rcxP!8?;25* z2}^-k0^wYZR?Wd>2Pe@EvrAhESGIVsev4imk9s|sQ?B7Hqs?$Uy~JSgMe`Y3<42g0 zfas5}LjLvAS8LvvWxai5d(d}QGi&$Rm&SOgs#wooRq$jGtB~BZYsUE1UXa4t2UAAt zUV9bn!u_j7qUQ@teCkULYT`ppE^GRRTl#-$=+8j^ZG@8GzjXxuUmN_}b_}#_Z2#SI z#HIdEP5ib{9S2_5 zdh{zJJSZWE=%Fw;6ln4Esr3xWjoVHSEY~0C-K7d!2GG2|y~-#@ENWFnq{Tmx9z=9W gT9D-Xe@f}$Y2ogPa3=^LA|fg#O3ult2vZ{e7kvi%vj6}9 literal 0 HcmV?d00001 diff --git a/website/static/img/caesar-qr.png b/website/static/img/caesar-qr.png new file mode 100644 index 0000000000000000000000000000000000000000..ab7e162ca9abeae22b154f699e29a3df3f624be2 GIT binary patch literal 179958 zcmeFZXH=9+(>6MwfD%-=f`vJC1LvR?&|95s=BT&w)ZnR2@*nTLIeUqA|?4q z5rH@#f&F(57d}}a<9rI=@L$VFJVIcw|HYJ|gAfP?gw&&l&+Q@>hYcc>yJPvsxShYn z5`Q{}%Xnj$u1354vP@VKe+_?4b@ihRe(x|ErLMP^;=Fl{UbEk&E`GAe$a3ZKGaN(i z;D__iyr^C}2&@onlrcT|i?C`@H)z>#TBXUxlz*QRK1jt37*E{{YB&o*z$2P!DNb<~P8)6!v!rJ=cDPE9i+I-C-DajvbeLv!$%PH$h^P!Bay zhA`v`Md%jGl9Hl&fWb?2L*8`afTyW7$(AWCZESY@vuL_orH;X0LxQKLCp}ukB+bco zVUjf3C2Zr$#6QBf60q}3+2nsrTcV}4_9cP78e!C822!yfhDt_m-FkCN$ngq=SIa*f z>H~v$JUm@|J-z(=)(vFrtn9bhSg|vIGq~+Jo0FH{%iCppmlgP1#R(@d$UE6ibgvT|-Tbwj)#U}4YweUBWvmMpSaY~ySZE5e@w6*=f z9lg!n_s>?hf63bXmp4B8DjWj?U00EE>Lkm>O|esPWP`?k3<>Dl(GpU#_lKMRyzz;O zI;c%i4#`%1&YN#D6LzR&X=(XnIqzV1{DwbW?oJ)q{pu2puXammx8z%$kGd01-ptMO z@C#D8VLRx2xT+xGOTFWLhO~J|;=^=Lk9Rh@yx{Gzanltp?R+LwM9ytamIv=%?7`$B zc`FYImIN445zG2kRe4_8;oI{aja14Z#zw}9sF3&0`*e!J^Q)z`5jJfXj~uq8+m*-8 zbn|tIZ0_gG$*`eSmD5K`SRbqQr`h&jKUvGBApvcBx$4Sgt&geQT?2{=rO8HB16vwK zs^%^RxbIAdr#-(;x6LuoI$WV3TkNzIUCA15+F$BHufzyD6Kv0E2)`VgeJGw9_d}ym ziYX|TTa>b|qi?l#Jz+zIODEHzrlh+mG*zQ>U?j44po+AqwRzCEqN0?5Y|x-S(;1&k z@Z}5p(SM?1#oJjoRJkx)x;ye=A}Kc(M2cm6K9^fouZisU8NRud5Sxu6XytI)$d`Yx zI-nsVMsVI7L@}q|`IXHSF_AlFwz&7XQ1!vy*q7wTvF;xE#u>t+$nCgM!L_bGVT*4K zjZ0nDb@}C;9sc%k#AbWg&T7ZCip+7>eHmd!1uVzt5B9J{Ijx#!$jQ#!w6l0P?n-O( zXOG!grBgi2)U3~@hMeqZse7igaIyGj%ovf^HRs&>cbhCX;*BR_d;~#XRRS5{?w;UUTh0^37v^je&+KAeF^lhSmv4n* zoX0Xt#RwW+!f7jaoF5+*+6qWKjHb<$*fTYV5R5m+v^|`C-JrK#WI$iM*zQQY>zapY z8_$olSZ;GE_9X3K?at*LEtoR$xpS;0C)d)?9OW=xSN@iHDe|suw}#HahB6zU={d`- zhi{I|_G$(GdifJtT4%MDC^wbcG$}Xnr;}N3X*q0{?JXG43mL62s4|ON-wd)+E#=L9 zJpxNYbEwVo;`iZTTya-#IJ&-d+GFwe)8kBF`i{QwJwjbz=a`C1R&94W(e%n&@z6Qd zfsMYq2QFrZ3gorR=1RvuhxRApiI$5wP@k`YZxY$6lBp%8zJ!!a+#eTmE&Dsg8mmC$e|8dn z<|t7&iD$JOz1Pw8xiFk2@1x(DVF`?ODf5?MjMZO%r2eMxfb2a##h|BId1f2V+}cID z1C!6#2(Qa5_7pD?dC@uVUt}g;5Me-Fxs*|wI~k;^Gx26~hx>I!jMR)yPxjCIsDM9K zJ1I)7g$w?$u!ZVUvVw&_8&1C$_^`98*$!PmJ}&X2&mI*r(7LeUX1+4Jdq`4lA8V;S z%docpx3|o7;Gu+vT%f%X&AfccMCH}8m!xxpuIqT^^QuNdB&<0Jzs9Rn4|Cvjw>`Y% z-ncI-fKlbso<2%VO0$1C-IQO>WBA6m=4pT!v^kp{2I>gTS3m79z`NxAXyh@a)@9@w zr_7{~4HqZOl1Le5dxmYghqucM^q}c%)w!Ac*wtlxj!N0bX0AWQsrP*>`I}tx5z8%U z^MsP}uzk~8A3u8eU!_4xdK#J-9#8m&^5^AwkY372CNU=Ki*u@Wdl>89h8L!xQEvCw zys9kZQei${`k>=#rotHlFVgigrWS{-eFJ);NJgU!&a~a0yY$Vr!4)?9!%Ac#LOZ@~ ztRUuV871+1-yfL$DTA>hwYUu@{#xmK$^}Z^yfhd_tuZhlcQxO2mZAFA_os4UA_s>D zW(N&tT)(Re*vjaN&pv8vHZ?Yi(9WH0<$AzvT+=bUzd5W++08^%vHYQW8Qcpq=9n_N z^jI~B@{ifd>^WM3EJ=xbdrmb&TqC=KWIAh|QX2*z{elv-)fC4kGs#dJUFh&&tHHT+ z)u@c5eD_X*wipzRt$cLRD`TzM%fE_kI&Q??IArD*+R>Xm_iM1gy6K2phcJ?{iYJd} zbZvdIjdf%#G&CxW+g-kqCpQm!AmAg58MapYYg5reygOUu8M||#7`qyxkc~z5b8}rI z?Q4HZ)S}C_JCriYc55DQh}XR*i|M+l9b&BNx>h^tvP@PURcK-{%O23JpYe0QLsr#k zdS9nmr}P2pYpT`C7fLaSdIU|r+4qu{a2VK2T=xpg16L;OGHpXc%N3++uC$11g%3JJPyCz@)Aq3tAe zWj1uP4Lsx?UY<^OSWxQK-tQJUT5b+$5;J(8%I9o2W!S5=Jtd<3%WgQVO>NAXmDgLr z%6P#%+U{MY`LXT#hyK`X1ZGuis^okqX3}ftu&}I<74?;U9U@@c#d}qox66MnwY7CT zFc0A+j9gES4cQA**O*Sd^RS1tQ}?KC&9F}@Tb13|%#{hY{sr>vQMQa4p-K zFK6p2C>>)tF-%`Jf#%}UzJMfJC2Rc?ZoQbnwL4W^tTFK5#ibhwOzq!Gf6Vud9`1f- zrZ+J(CyK<|rKD|`q~($q*ya}j-73totHnY%0mBwY*AsK6d}&x(-Pe#AKn|Sz{wMcM zSwCCy17#b||cf7DI!@cBPz3#gpVzI@Q;jq6# zD_1D_OF5h$DIFiA(qlqQdp#(1ePKQaKKkfa(PHU3ThjfD)XufKMMEw7I?CherSXiW zx6IZm)%;_s-MeK$36M^vJFUmc>)0lR(^Z?a4|Fph9sdv!!UQ|=DkvCT@_}S!<8q6?96*Eyw%l^oGWjxHPs)fS*2^Ay2$*Y>g%a$+QpWw~qjde$9 zXiS8^^-+=0Fjg{_0h`v937R?=nLsy-PrTdWV*_IBf*8038<0BJ3PdmaOWp=ksI%u$ zHx-XxFq8}gg}H1tMuSN&#JVE}$5+ft){~66hI341W*Gt`S$MsF7jfjGwQRq4>M)RV zXlAc>rEpp<>wc~lSh& z6J9&ger(tDejUaHJ! zNeW@5!dYxGQ5vg+V6~VEA}cL;>oR*8yGF^*uk0oI;CHbtYd37m4Jn_9K`Lg}oR(%V z;^GX*VU|Hu8g(;hW@xX@v|094v9C-_jSiP}j>kNxXVcXO)XN>~NH|Q>V%-C*gTvwn zL*#{WP|nt~mqiKF21?dc{YNN~cre|C+63|yH6;ylBwm1+PfvQ;Je9d_keRe>N3!M8 zyvS1*b`&AQl$rhboLW<;ryLG+i62}r=O{c%Fc3#06qg4Km^iT*fH2EPF(_w$ugW$r zFW*ZJCtg$Hp8dGHEik#KI^2ZZyL|URi-m!<8U`Ta=SDddH(B5?y$LPcE4bH9UJ z0k{5Xm<*8@z6>v`l)Ee*w_U7fgoWrCO_e~@7egaDl7BdKcUp~}JJ}scue#|!FJ6@1 zgK5)XS{~De$~M;eE6`=KmQ~)v4{`QgRdAiS1dNU7_0L7i|xMW(*LeC$~y!$YwTLaPb^WGi^Cn~Ugq_(B&nvN0@ume|Z%aOb& zEWgc=yKHAKJ$p{{swwT#&QsUxpvDi1LBR`>Ov=;&&BuJsM&J}q?IIa;HY~D{0JijU z*=efK5A2VyNF;%Yl|T3Oa$^{HC&ceAlfnJX5`I`KJc?7^0^IzjgO`wa7yf*frP0>p z5&5@^LCBSNqr^Md?VQbfioo4zwY!TtiybYgJMgKn>Y6^t`I75-OZFKKcn2i|rUW79 zDvZ<@{L!3gNmS-DE3Z_V09!JjS?<a(xXBs~8+2 zk%VK-`nHLK0lc9=aCb7i(`ojDaO>khSDBYEKm7jkQbafF^*#= za?yq1$~0xQT5eY9bec9D68A!&eaZ-k|L-tU-|_A0O1jNI`USl5+@cS_vLcW5Sw^j2 z&Yt@o?^F>3i+{40?xISS;pBF3Moo{))^5!C(QZXaXzT29C87RUbRlzqqO`1H{Sncw z!G=m9vq^NvkBMK!WRPEQUsDvm4KXzfAQ!3DLcBOh+MoQLF(GN6&*Eq|)a+aXj-Bg8 z;XCx|!bmWUS|@WOTuk-gU_7|I=Z1#HT3If#U?h)JOh;Y}KBGrI_7rfc{)SC+UODbP zHud^YQsVBpM1g#aU*Fu|{chiXDI_}Fw*H-~L{{Z>N8gsFEn0dzbBQmIaaR`8=7lO| z3;s+R%}dM!U&6rXldPJblmAifVg3{mSrQiW=avd#8yfU1e^YZAn?+~PAB_)1L;#jj zEnBG2eX>H172&9!9Gf39uh_1-jl2P?!;=%S6q`L4K&m6SUfp)l&5oAaA$q)c`3kZ| zaDQjsx$*d~I68*NPL|v*^y_wBjj^g1ObYQp86YwZ>`7$8LW;OV{hb^5#K>1eIDmYX zi^=6wj?6Or>Fw&VKvnKyakkujIMGG5QU|oxx_LO`D?j153m2_;!3mfM2@Q9gwqX7! zx8}#~xA)fK;j7upC>))Q_pWGa2CQ>#94Kmzy@6=AFzCYxbv<4HRs>RPZ3(|?J0Umx z$RZgxCTFI#4nnv$tTx05ynCtYob(P?17UHz>y}oS)$Wxm(^FogxJmzjg1bY@-guL( zMju7T$$iozAFy!Wxo=$AfPJ~gG>L>3=ab)gQALR)sbsrEoa5mlq^;)?Uycq&#A&J+ z&%P18bEja1({+Dfhu2DQ`e)!@m+b~FSYeWQqlA{zfT|cehRv5=c%CwPUvc(w!0qw} zOKg6j_`=Uz%toTiT(-x`iamVWGYm4yBi2NO2z@GRV^V%{y1C|?`3Rm#`T=T9roBXZ z7(Ng4(ppT65Ik6O_wm|Zphrq-lG5Lu{!V|?5$GlOH}yRFaLss>>u%g;hOldWJDJmp zYiW1yk<&qe|L|HG{r0lLCFD6&0+@4nxyv?HoeK}@0s}WdS(Ej>P+FR0(fuP&(&)`N znVm&*joszAA{A?#l5mhgH_P++uV+NNw#KDNg>j^PafkgIoW*l{%;v6Z{mmqUVs+RnHbvn9i zu^;VVtZU`vjt;FT%v&_`-uA2~`)cHO@tF+v3|&U58&OPC28UotR6n}=lbNMY=y@%N z3Vu6!kUnlC0TCOyTsD}|E-unF;oK=#N`E;SekHamdLQ+;2DsA$I8JR*H)_e~?GL{l zMHG=NegkQ^=v{_FNd;{jl&5lT5gBl5l$cZ%4S4PsdG160%vt!zOioVCuoalnDjTXh zWloboBKltwX!)nwtfANGR0RUqWDCCtJub5UBtL@Y_8+dRf^X|b+`ULft@DBX!QY+} z%#2f|g=f~<8Gr6_T)FyYtrKuO5^-Wr)gHkntHmsn)Bp+VEztdU#t!$CRU z$^9ljvq5vW>sI-BHM8z%UoH;yJEh5%zvn4W)Pt7+0 z3I#&6H>IGi1*3OQ43gbYO0I8(CToB;jcMldd2ITBctLc^CmMU`yifbUX%eVRKUkDn zx!~WV!VK3f`EsJj50UG==9pF81G>w|$7m4J&Z7Nr4rto1s-{Egs=a;BdY_GADK|<5 z7EYGM&bav0cvQZya~&wS{)CbZZRhGRH8pa=_LE^VNPAKAN=AivcSJ~ff0KoSjg^-7 z-Rkcu2|C!sZx6-AyarfhdR5DF?0y3U8Pc7?$8R#&(f4fd+2}2i!k;lQsS<{2Qgh%p zfk{KgJ54Iw*x|fgKZZlE3GDXrOw{6Dn-p*}=}b<4tf(Z3zRd|y6`E(2a> zsi!!#AZB$bo7iE8r6ITNYm4E^Y~MiFH_4lz&F}&B-X2qJjr>B`3E+A5QdFNm&oDAv z@N{I_T2{!~%y%V)Fe(M^Y0;)7v{=uD5C5b6o|o@ctHZt{;FeZ^$z8XS9S^hwQqiX; z&BbMWXy!_pfazT2at`yPhU$pA`txf@JdeAMkGri~h4*(OzQdbyg|AoWZlUS#j{o^9 zPu+($cSx7K5H#IdblhK;$f5Qvk8N4IXXT5o$i8o!$l}*B-Qcic(I>%SKw6tctXD^N zCZd|Q665PZHz%C!{rxH`+jDE+xcTMmCo(z{ON4AAnz3i?fZ6Hr#)005-#%nd#V~wS zMnrhtT%(rb*5348dh9<|HdfhIisJ8pD5qwexlx}vm7YI)SN-W1(2BN0-;RKpFUISS zf2bkhSQDn)s$8-+RLPI#N?YVhdADx0k({vyDIrQ8{KAifQq$E!w3l2v9_fHpbtsw0 zvJyRV$e8nN7qAQfILhV1@5Moq!mbsw-s_s9Os&T9{i*iOqHejv;z&;ScTB2|VJnS1 zX2iqd0FCL0R|h)7pT6Lz#jq8x&|xqAjJe2P*V<)ap89U?FvV<|Pvu=sHph#Ag}l-o zO1(|EfyUG*+Z&~)&QqObh}`O!z#A=E8UU99%voS7ozvvX@xqsXDu1*+L?)!g9rgMT z+b+dRxNADY%?5C`uJk!GpBPkI-vXgSbr7`TfnCY4@un)N$T2wqT^K8-sf`0`;k#R^ z%MMe8{9n09A`^(7>ujiI;0F?7RY1eug)}U8=e)m{?MOy<1$nL{4zhee2fMS2R8-Cj zQO*t4?gz_|1ji5d+m4`GHz{$kDM{gR%IMM1ZXB+DOcQT@p38ob3^=E2cf<`9*4#%i z-cl7y30;f$j9k1c4pV!W!h`8AE^luZz^Qg@EgA#TTby9;sT_9 z!G%D~u^KkQGtkGta((zUg>x;nD~KQC;kgQKlwh-zJK{|0x%PkGi--WlOB)&#w9#;e zOmHQ>^9jkdYe=FJ-R0zbPS?Zt=$X=s$a*<7o2fLRr3G<9JMXCA`q{L5aQgQq$+!yt zYKTCEP551R&!Kf+jLUY340ugW)K}WxAzFVzH_YO6lKe+g9&+zTzyONajvh`ozImnF zmdjay$;^Jxx<+lw-UK$ZwP0%?gqNnWw*Eeq5RP3}y+u%K`Qmg& zbXxmOz5~+!jTUa#&1y2vmf4!PW{8P5+JpcIc-Q_ZF`$^7inQ%8pcC4mBrsSfz#krQ z5%&^t+WuI6@Va*K#wI7#Q6zzlsI_VHV=@e|?2i}&-&V6jO2SnvGd)fOD z<1dGeL=Xw^;}|_)z(U)jq?&v8iYh(RtVLXR)7w~uD|S{&l71x!pg!ASG1QpzxGNtx z2-#L4D&%8;A0}pf+Z$fX#8_tY&GgxqaJ|whyrx4I%eWroP^vr)JQ_rKH0g*H^pye ze-QM&g4>;$hyneikcI36-_>rwHtC( zgTx%49^U&NQI>-R&EcVx5)NMSfcV&x&P6hwsXp`x)6V^w7AFKdbJx_{SvF5x-}yJD zEwhwP_yB$6xJ3$*4F;4QF-IM2{F&$FPGMkhXW?zIfq-|kR6K(Pjik7OKXZQWMy+UO zhQ9HB}b3p1-ZH2?A}O&OX%TGYnMFvy`rIo$l-ECyKKsc9_9>2<3`croYJnvg(=>73{6hg|ENjGz4% zka$|Du)>jSPORqJ9==2q-(Ik-%XfM9EtDR4&Lh6-X3EiSa4S+GX!#Xfmz3{zg#rK? zNlS-Yevh4JgBNsf=gF7`i>I`-eQ2A<=BqJ|pEt&TyRDSG6^Xk+tFDmv+CcMgjw^Hp zc?U%}i+eyq>oU?1eLfObOws6{Qfy|~JH^(l4zrMp|_MYNC0@ zWt3Z^?NNdcR5SAx^7ZK;;pt2!oTaX1sC>h&&&FRrAZJ;s( zfJ4k`d3B?9^Y${VB>ov#XnWj}C=v9~O9CO3zUhEPL1hNrErJuJ#D^;erET|=RYfMEA!q_n_bhiP<7tdeLW$>1ANH7Uar@(eN8laVuXg4JiFp+aBv3DAun}k*#Ud4RE z^SpvEoD9TAFu>|?5Q+(@@jT!&+VXP@X3s6A3JXb#N!XFWOLLcJ+^--INpW3g5t1SI zX9gzV;Lnjy(f>+)lyqKnf78#>o9utuhnsB9(~b)*YWHxV&f4^h?Ru)fmARX?Gwd^i z5Aib1F#0+I!J2R~7@Rdv@X+97PfwqqvD4m9aFwRzu}~It*+ULT^h!U}gaGHz#tKG4 zpTL9=O}+*}@|BAwZ|iSIzj~}KeTcMv>y$7Jh!0fHPz>CS^V>dcIO&K0uwR7Rb1Wq= z`Q8iSCRf?J*}ISt;ce4q%?OKo0!PFp%zq4%BI=RRB9pUNV>_LP&>7>QWMye7hTipp zWW#w~+zZ&T-uoK`L7RwFacZmWQh>e6bvyEG4r+aIcH&X7W5B)E4{~Kqv&l@CQ~eX`@ct z#s_4ybjZgOfBwqt@8Vc2eQauBsc$NtqM2D7NRgjq@MbGp^#!U4m~}VytvPp6%(eyG zgySOIP|v^!;#CwL{;rxi+zdXd^CAog3bKN<#AOX#TGuuVF=S`c-^G3`bNw04XF|gC zz4iR^*%%eXhoa4#jN?UeObAW0CkE~vJ}HtT7^WO3b_$llXO8!+bZ9#AUBkG9Ty}pF zlw-)bork;IT#o1kW(=_W2v8t%C1z%FEx^fbF4~7W&t?AYu-8KD+L~vK7Ogm999N@m zh#BA@7(QN0K8pw-6%Y_GxV90PL2F$}ZlxWb^{xdfrzkTtf}S!dS)_q8ING@?409=w zU8QgMgV!GrFcdG-n`^{T}VT0<$ zHwL=aT#@fj@E zd+!*$!@@rQM}(c@w(wE?c{IHMa5g+SJm%@6D!_mYw2vtN20mj>NpT=Q-az$8v>qkm zINQP&?ZkrmY^#wEcY$Y%&_48q2Vn+GiA$Cr_x8+Psh2yld*4@WBXgWK+gu`t7bXJM z6}*D|rEgvW#vdyGa!Ek&a7C)^;SoFIxxJm?uogC(S|}kF|X<2VM>=k?CU9@)qac6$#&w~xjuKxHJS50@m`D4B{M5t)yTi{#~rWg zzS_kvGqM@;9nbBdmm~OY33a}JB!+p}xnf7|{uV%1K}-gmFdH_O!8BX7`484lWE=;@ zGh~ZjHU1^)O(hQZa8>=Lv)b?Of4J-sR7XtRvFEC+_~Nyg?uLLD}9k(fHL?WA;kP+`Iu@;nEkYI#OzCB6k&02J+J~g zqNm4{G&11;02UT(A9gooIBvItWgWqmy8N9b+ga#mLvfCsu{(4AM^9ge(;hk5HK+E% za_5PMzWV#hy*-*+o1&C_SW`7$154#s$2d;&h@uM3iiKC+?!g^v(3uV zuY!7rcdIos+G~^Uz8uZ5e-RjOMe>O)s5N2IJPyJh;ARQ8RZeK@eHvy5bu4yGP82BE9$Mex4RBc)>`)GkM>Vl*f+)ca0P(INQg)Stt9+&swqWxKK zAJn`3NJ!iIQ?5DMb8-4{)fYY}*c*M|;(EeLtU(cIy3euAT4cGVj#4=XiZHKL2Q6!F zw7dYxfT$!mAcIkBB}kQ-pcdI+*g|*qa(r8Kl;zdCHCjP+8&37lrAa8xo9 z`;zW59cZ<@uluu<++GAKCqv0s%1{$RaLa!Q*6nyBZ0AO(=?i{f{@PgYwZa~PQJssN zpg-On3VJoVf7A+vUw5&D;N`_nqasJ|X3rrm^s&j@*5}-~DV_%mb~|wN;%J6joc5E; zU?Xuiz7x}WxVA&pR-B_*p?*g-RCVmcba~7U2`m+YZ{$Z2j`Z>dF^y~vk;5I+*70Fw zCsd62gh#u=@tB8Yh#@azO|5I{%zv&?N5+Ay;jIJU7(M41PUatDq6>GfctI!FM-BsL#rdq zo0YP-xa5sm|JKNcr~gQW6Q95C8z6c~(X9>l1B#uY??UE}*Hw>e)@KK_db5g)(u;bm zA8RcdKUBD=klf*TJ^*o^!N61$CRsqM!GWqH0>6W9R zgVKi#o_&B*90lBzKz+FH9L zI=>Otce>6#zq?Vl7m~}{LGjkT$kUTQ)QMROr8llQX4 z7NDNImzPIU6@g&*qC~xWnYUbRjQG&Fy=4E1-1JubkJ`29XqSL=#45LEnA@eW$QCkH z&cJlhaOX^;^9DagVvEvMkg<5mxwlnVn_?$5IFo}*G-?#k6Rm`%Kc*D`!pbXdJR*8W zUPkBOwVzlk-*b3V>ph>Nc@5*pdqS2Eu}m=@Q^k2JA~w&9a7}GelP%l*I65d0#Q5&N zlO`#NDZx|cQQ2od;a#AQV<5?S&|GmjB-^wk<* zkr%w&ImY;p%UVCq=a)avv%DJjYwkFIUz{j^qaW}WJYzgpEG|mr7a-1IMPO)E(8>Qh z<}ybZ5nC$Ze=SXK>cYuuh=`8B&-b*26Lbbims655g3=Kc&&Z!u0+XW5TVD z^KV1l-_*sEpAHd|UU`obF;5fv4u=AEagrh=RGK+PYxnG_$g6?{PVu&0Y>n_fG+%zE zsC+%r%|@V+`P@l=Hzl^D$@Rc8+BEi1xf3x(WyMQTxC04^QS$#T2mQPWPc$;c@NK}q zZ_v74wD!w}ziP!khkgT3umVsbP6goQ;l&CtFTjR{y$D1_5-*P>&a+X_+D};C$!8~D z67B-{`Og!>C&Gxzi=9bhio$I#yki`I!bMbYm|PnNNrpUAu0vyBBaOG_22& z@*0JqKsj!LwPkcgahpBosUK7sgQW5{rQ=;>90{31*N+Y zMTEBtCMczX5EWaViTc~078tca-m#CTn%=*#NdIo8kWxyuf|p0uaqNRPoGnDY-MgWi zvYqiKGLf8)NdV1j$r?qE9!Yssys3TjX7s_K)5!vSTk69sT0UYsB1Sw+fpA8@1~tU?6Tprp4ptX^{IfNuzd`UTT$vc)im=9oZn z#e4A@W7?rxG)@XD@1rv`gdK-J^Wxc4@RH6kBHWC>v{K(mG$a!(=` z1+;*hA65)eg@v8vvY9yk1U6J$VwpC$EsXl+QUnQG0-Ic(%Zk~Y$Cb@5@{>}J+<(Uy z;)nCHu-{?1o267DB!;YOnxdpk8!ax5&-zhPt1$gD-5B-zRkg`F5fL$Awt7|CZ=t`% zD1SeGDveyEU%y^hgpi))c7Q&bJAYPGLCx@cTv1kD;*pg0SgVf9v-FV|+xY;id#}mk z+2ppJTRiPGdZbh%*g25LwXbHRRA+0IbevJCMbbsM>5~RLS_8Ii3C;w(f|13f^z7_x zthUcpyWV-I_Byg%G3yKG!fv=a_$375@sfapU2A(4c>d58D?Ul)*(YLNeoFZM!Rc=D z^=!ADOxuT6@>03d*==|7#Bg!FtXJ-u?ta68Kdah{zRJtNffVLIj-T?L`Z$tLM!jofabb1mh zn4fodk8F&GXZL2jLqoR+i6T+7S~>zKmIb6@xRDYQPwvD_hTHK)eDf>=3OD#9%^B|W8d+IPl=PMD<+ zyrD%iP3w}7!=ua-vq2pFD@fBYra@4Ulr|v!POw0-xx-8}qyOgt`?*nO=VNd^4@B6L|1SVN{6*3IhuNKlW-FXat&SIqr`~#mXv;-wuGD>ps`#(6%|S5oUykdpOsI#{QPq26f=~yl{g~XK3IDF zZw+c1H=yA&wb#G$BL9`Q*Af}oah~I?O4k2vj+0>#|L5KJsT}_w#ftw|lihh6#&i<* zuM*?8$Y}Uj*%f$)6@Lwbow2)$b*IGFao%@e!F#+lenTgQ6wmze}!lFV2^@f|N% z`ScKyO7Zc#M0|eX(#2a~%5D#^ z;ruF(EKNv{%xSlDb20ua-%Whm=hQmRud3tdH^GUPQH^-{9I2yeNOf$47i;e4-CQI+Qte^s49y!^M5ri00h6}N*7q@#$6 z-r@U;Lz$u}sE-|-i$V;!*f3Yp|8rA&zNBjXgZ2?O)_+1Cfs0kS%XSBEC(`y)a5{8# zllLJ$?`YkKy5aLFLaan+;=7bm0^8UW#JB}dLFE@jNWPLP5zg|HbFPd%sAC4>J!7_J zC2Rxwp`_S7kr(98-cce?+@+H3xZdbZZp8`_xD20;0^tecLoK@mIgk*`bUfR zFpIyhe;`31SUzHpWcmEX-Z$gU^8S(wth87)N89|(+z>84`rWrm+Hsvw0LJ}r5GC#7 z9ZLE>c(^kKKzB(p(nzT6;O83sJ|@M|jP0XjI@A28^4+Txp^|buV*l3W~@{ zZiX~)bYx?uMli1=@9na@{op(e%~0v%lp0q(hm5(nS}77G9K?rqIhtf2V7r&RaGmb+p)V;e9DKJ@~os zLV2o8w+3Ffl(4q|N8x$5KKtTr0t$tY$(}Pb%nn#lmbFE zp1+v>$!YbRmzTddURn)DU#5V!K>Xd?6_5Bo1s-|n)e9)(hL4YQ^6jQ;-BY~Xyjyfa zzFt`$4v(sE-78ZcD#Yfs&@yUZ=t);bbnSNNwtPuwb|_2+qFqyqlK&_yRpJ=9^}o)> zhjeXeSRhHliSla{K4R>7!8QS+f_0Bdwv@bR`%2NR!wu^uDxASf4WzOz_zCW z7=aL;dHbdYZTwYA^>7~cm`Fw@o((lU{Dz2vN~TJ1QP}eB$X9Eu{f-6yXN}PtOJ8$= zb?TrfH+pNd|J6{M#<}oS0t&aJIdq{v37ih)N!kp3tW;)Zq?jX2tXn!kY2V_vX$D324R+F`rwhFlR&{8c$Oi(1eVVm6ftq8mguNPO{Pb0xT%*j{<;& zmFjdngj?2s)-kH6rtuerOkh*5;7QoJZFCJBw%pVqHQb@x{*S%o^YHRZG3TWIDpW&0 zmPKYDkb@)-gc2W@obyScMDM9~Z<{Sht%q5hkG@)w@rU>mZi9Q&ohN7#2DF71M{Bhh*_U7*9)Dx0+m%9 z_xf_j@F6IMN~Zs*C|#x({H6O7tRtC`l7hPXlSGO z8T^}4PBR_N$U|^oiSlBqU-3T{_q&Tn6(8cm*=ppb^3Bk+GR_oP>BqZV2~1ei*d!Fr zmS`8@qAf6Zp+FV<14#2~*gve1F=Phlcp2tdZ-q{LYndQ`JnB!KyvCjZ3};$ODoR|p9zdaXJ^m27c93lw-B6xdkkQa?*IqsgN6 zUMUPY8ByF?{HO@GY-0aCoc)`qrJy$DA~6H3F+g5vM&(ilIkcU3IECO3OAjv% zS(>{~kT}{k69#4atCDksyPqBFo)(;JcSJ|zj5Z1?pmY&aaIl_lu6_&^;eAE8(3bq9 zGY4MV9lS}G@Novtm{yN@ChFt7euQHn>ccUyZ1Zyii@$HfBaf~jG!tyaRITaiRxVs~ zsHu1b&Rw7C*ZC?%wSlvoRyA(1gq#y3T-$%*ll(R9@J@%8;3}GkT?_{kv7Hd+>UR`u7c%-O@hG{|T z!ZUtWwXQr%Wpb~^JFf4lL7u!ZNMGcy4dd!uUZlTcHUH()h4ii*20_-TJvMVNw3Kw(IGwV6m41=CPh=e}D|zQ1 zD4a!%TpyuZ+Yg?5f5r7TzHBF5;p}IHxe_lrGfJ9~ao+_qT_-=A&*#oN&m8G zy7A-oz`X&&P}`doIkxQ2-Hv%VcWpO4=iBbb9id^7yN{8NIDim|aIUMu(f2`p^7EbR z-x(~Xm;W@&l4b4qY}KoCS!ro03Nc3eBz{Zt-KbJh2Q4XKpKa$@y}B#} zpa97%88DHR+u3__G%s4AVXuVW5>!;D7UJLX!Fy8Wz(m-v z>+nte@=4zXkv=SiUojuGjM@B&3g!p!$jg{k_j5Bf(6ICm6Dh8nFq|t?)$4UZuIyI( z@6N>dRlkxOIX*htUK?_a$(fXVtR|)WSXs+dS4j!`)hY;;B>as>S5h>l;Vtp`b2$WF zDB|3j0VK-byXlK8;M1V=GwLt9a{dy$2X&=3wrUj{%#5#R-IK6RifdHRVb+>?^6LFV z2tv)&!I%4!TwhCL;`PjnEOLv|^Ga&l+xljcUGKEL{-x$Vu=!cqC)ytPI`5;_77k>l zk?rz+X|cbu@>gVXBW-uCFUgX8*0)2Go)}<-g;?SZG(#8TgXz|^3QQ)=D0uzWsU@s{ z9QssZ34Eg%5#Y0-xE_ay(Wqa4C3dB-W8T(O3dlEWO^*wqc*EO0YsAb-km!6}Dw!`l|OA{Ur^D5`&F3B5}DoTVf^Y=P@Opp+A+9V}CcaDU3 z{ew>-gt|3a;g!|jynFV>JB#dl7&H%O|M)l_1cGU5*rdBrSo% zyulw{_vVd%QzPG1Vu{<0mV`S?_favKsgv*Q)eNoQyfKx9tP;Kk1t}e=tZ|2ZI68Cq zH1Q?I?NdOeU+gQ3@rz0A7DBJdpW6`#xaGm&oBc=VzTOL?>CCRD;4yG7F(R2Bp(28X z9wE;f{OF(4%yI7gL95X-Ib$l2iH>dHP@NaY#XYc=0@y<}n5_d?zvqzoiL8u|pS+J> z`SN1>vgC*2Zhk(eT#K!&$id#rlT#EFe1ef3k9UP+tn#-V59PpZ6UufLNz_3SRjl78 zIrmkEmPKfPYCj}p-KzKU|6=biqoVrWKVW!J0R;)A1O&uFTBV0nKolgT8Pu21YU%OcuZ%&3G< z>)c0LMrAt_pO*iG!=nmvC+pq*D$|qStB?c3Ih&F9VJSXhINdNM(=f$KN?Q?{uk>G~ zPPT8>*G)6$v+!C?pWVWOdS$TOtZ}xg?bs2Z1TD;(NO^OB$};JwYy(`>Zx2XQytDiMhunnSUqq)nQ;0cCORmKG;il#+(1^qBEcv zxBbd3SQ2?Ixwm)p2<}^a+S2nRFotWvBhnF9*Ws!G_*m`h?B(4rsLC8hu~T&pj&A*l zB}-p=#dJmBSsLCd(53fgnL?=|BOeDKB+@-|yzARA<;zB1mZB-Zs_vtrz;g@`Ulqax zAm-aMBz#o2i1HtL)qI%c*8hsFKgy*4#XfOgzO7B5;`lO!JiF z5%ez{szD%dwG;rLMCftM|>ZneN&Jk(7H09dDXsMor;6W|*B z;iST!CzBoH5jZ*r;eDziRR`F5fV(Kqy7^At^Wo-_~Bo$|h?8k+COGB<0a zf?3Upp-dtuM;>w^Q2a_*fcn=jz$dFQ(F(i>6Nm8aQ(F1IZWFTsobE&7=Bs@mA!ZZZ za^XanJ<}rbadFHB(cly^K&=h8%|9cn-@xf$tEar%8yj_2BB+?Gj`%LlKzj<4K=zW8 zObAS0>0{M;$DcYUdF}@j1PV^dEhYu`_5VuctE@M-h4_8%S+xW4aMuzVf>+!kz=zbbP8Xe{NmcBi(WS@5}#0R5DgJ?uh?uDK8hI*2NZ&yb^cnmY=zX|NlqBY56Yl zP3n-^g$Hy@#6l2Z+xsDDtb6%&_Vc%720*V@CjKaX47c-16jJzUX97xCyXG03U4!zf zCG*SL-jFt4_G`sE}`n5Z7BSLb{mY_P0THiaw8N(sMYI61^ch6voz8+t#41gH4*RI4s-z_o} z|KEj!h;OXn2Mu;idO+jmIM4-SxFm~L{7h1%C$vQ8RN#aY8F38dB>qf=X4@tJF%wbd z0N*IW3=pR>(0SLijt!a_46~w+{uHr+u$-s&K@gcw~^FQ$x%*=?B-KsVI8+ z+40Q8BTS|y1nzXZw&2ATTAg0eam#w|CftW~y7SzsprZs_EeJ%MAT33v)BW}e-;D^Y zoSF)3gJNqdAVGe~LY%wX`!@98u)G6zV|(x!gMx(e-YOk!>dtOUJ7}zqgW~iahF9FqpV-jNKwP(= z8Prfdf=i#yzk5V6e44mkmftKH*EZ~vp$R8{%@9B;a=h&WJ3oO=-2)s_mh17i8&t;K z%o1g)y@FZZQy83wgc-skR)e-&H6jM6i9lp3KbtE4S73^pd|=OTRkf%4yADnyB;Cxu zxF_NS^j`MC02*>lqNFd6>OiOMHoXtp+qTLP*ht^(`LNEumm6TDfKx^2sJgCHVQYBL zAE>Em2=Dh*QBg8QlH$F+*ZWq-j6fdwlLR7LHJ!*33hGw?!b%-F%HE=Z`f_)V?7;yN zM^YVSzt$_0gUDP{G%#3;!VHTo^i_fQyp>X%d-TOetOTd1J*J;u+CwlvkcxhP1uKYE z-V2+PuRbD$OMjUc$bXRRL{J*69mQ?&b@5)gc;YU6dg90?vvT{1ySV2)t##yBXkD|R zH_}+OCWsk$TRBZd^&LB!K)*X97my#kN^q`|*gx8q*hl=BArB->k$>4_N1KP)(a^!D zC$?rSHTf355#k<>`2_P znYQSS_nj-xC(m3P1v}1Yt-+k)OOU(cvh;R_N@tEK!dOhnP=h|U zKk5yTM3ul1?I*)9;ncb7(lgvJdwU^v=jAr!yB{+5_zz=LOt%!DLN7u{P`UeDPR}V> zIHn2`*DW!6EZY!XlhBSC8hF{gdrN*^+sm*HN;C-fZ(i=k)H%CZJEUIorNybcBt>At z2#!u#@^}J9q@D#`R9q2K9FsGIA(3wbQQQG)!E!M|#yqU%`acF8YHRe7;c7oFD~Ghq zgK-L`UccJRngJ48QL8_i9!kF*fgvMW4@vwA2C7>nI#JWsB*gio@+sE9sdAPxz+j4V1-j=5@ywsn1S}O^8V*{ zL8#!FDmD7!tnhJ}(lAfv-SA7x9hheNUgpdn?eM-&v3cd#+Xo&ms34qw#b^A^H|prR zA@t6ph;dM7G385^gJ?pMTcZmjw7CAw(OG~vKn5IBsDMM|<5P^W@gyuDIg#-liZ_p@ z5m9#5bqk(K4^FQfE^da4>-c&6acO$L65ILH(9$&^MM($9qvwU1$H#8b6sC}FYMvPw zs2FHyIxjz#9;)g7a`dkbuI)gy>)sP~vFg0hidHd6!1H3c#?IewUUJjEI#G8EHXLfV zYH_xmPamQSIwt`{q?wRc8pl)74~X*! z-r;M9A)OcFzIv(;%l$r{Sr1bkGIP@0z2poT4OGRxKSt38tm zQ0Qz~66s=OgZsr5ULZk$5&+>8tPxS!9DCZO|BMp4^Yp8nOM#;gQ4J^YUesR*q~`FL zA5yAY3;#baK*&%2P^&Ca8ulRe7N6D@t+2QvbL{tx=tY3BUWR_@wP!d_3ahVq*gi&c z>E(qf6S5=|9ugKWGVMM9aHAG_Bv~4d4+GQZh4}}^cOhy6eO%}QFDLKu;WwyTeGzb% z0ZZ+ZoZhn_qqfoY@`&XayxjN{{_zeOBWme3fNj!Q=I8^`B6l; zm=HJ>${4XElFmmDmpOb%GS50_6wUsX_Aj~IDt%* z7Dt9p;YdLtU}P54d`2@{Z>zW}t>vW2E|3qfJE?NEjg|7cSOj4$U=(98<8K;!`Qf#} zy>c3^(JUR~lNN$|wR-V&%lP#HiR>bog+Ip$v9frXG=@vpP@Qa`l2jJjt{$>emu-L8 ztfMj}@O#m>Ix0Zj0jQQ`N8IBe#cmAwsLUp4wX?H#Yau!gj2dkrl7yp05mRJbHp2#Y zJ;sOtcL+0^AN;kW*NkVZ|oLn`GIFAX_my)BEVosyulR)Mqqc{` z7hdUyND0qSu2!tJ(d=B^o*#Rrkh~cX8w{{D_P*=1!EODx(&)-6&o1%o zN@LG{grfDqMMomy4%Sh2Jv<4{j|3B9rCMjnOY1%pS7Vj2f7fQeV6xn%gi?2D0hWkt z4P_)(on-&*A6b-G=$iELs@|k%GXQ()dU=(&ea0{`T5M@beRUilw$H{IXswW{T>F+f z_@NTSM|4IJildx5WNh4Big}KdWk1O@Qc~0KsMEp5mN-`a?blJH z+2uOBc6XZ_@vsVNX+1%Eygh?JCR$K^MUjW1$vwt4pM`k1Td^B3og2|Bq*vy=SZt*M zuaYs(Mo^Ho`(Ydu#JRM#KcOT9fd6GrSpoP7H~aR+ToQ!iWKTiMNrlmOOUb+*H%z0A z&0v`h|JhHuP(tW2RkC_N6tozs)oP(`=8si}J(kL{1FP6lQpz3S8ly$w>FKRw;WEA)nA1 z5Y$GG>~vdQD@*I>^_r?bjXPD6GtkOk|JTZ!j~+o`uA~rk-YN8=ft6-O_AgB^k|l<) zMGSmSx3P3}XadTk%6$Q@}(U9o-J#kmaPb% z_JPv*dzn^5*fcic%Fq)ep09nWlw-Jp?*KqVmnWegc7e2IN2J`k0ixn$_(`7SYY<7` zvV;q7RSryghG9;HW)3?|cS4y9O4pgZNKU0i`A7pBU9bFHkPCcE!-d`U7CZo-_NX56 z9d+d5H;-HH8tNT;j(dA16Ah7ysLmt5KEt0SUW*b%<5Z?hPt{jEzt5DAQQD2q&rUEBHr`OBCoq4QH+f z@;W|38f=(AiQR^Msmh#F%Eg!`>=lw#3WP_%9%3Iv`dB01@|!zLYnqp5)g3nOF|X-Q zj`bISm+8ZCDfz98lxgg1MMN=AJLhaO&by%L3WcvFQo!utk~!dN4(z$&|v?Meb4 z{;M`EpB$vPB689w{hP>w0aV+w#~!%3e`1_e;t~-f6BN<*WUNSeyiw+=;>R_7RFoou zSCc0$Y_d7|s5igsL{$CUXi1*HhmjsEn2fik!xq;AX2(-8F(RQ-p{7a2+$jRQ;OXU$ z>KQ8Ywd>gsY)YFQj^DmCDp$)>9`iZgao10q2!(0jCyw%p$0s_;xJZQ2CiwmeVS7Cy z?v*bMP)Y*LvXAf64mBdcfZ>;9?nO~5s}ZYQQpb$yJi}L2khV`^(DsadSgK7=4n7f7 z;R7jd8`aN<#eV5FG3d7$)Inx!2*^xc9FU~)QE%K{`2xURg39}mO7@-<^bj5b1=|E$ z3tJ30*r*WUouWuC@MC2O-r}p89OzBgOq}g#{;?QJoS8hEr3N)29Q^ER0m7~T;O7NS zrOg4QAr<3*FXCKkp=)gF3^X>Ok3#}KX94Q*{?G(@8g~ikgxQzOLFq=^d2v(blpe~O z;uQo+;KvMBp--OLI;q%yjGg; z%-zKGVtmAl*VNe8Pf~F{64*}LosSuen>yVUp}&;t?T7o* z)R}7{Kq8J>tGZ|7%w<%FKZAa68h4g~mpR>abfz`~?^K6J+`GpwEXQAa7P`pF(??U& z%Rh0uKW$~K9nL%5*Y%!H-nRfgJOk(LAD3?5*t}iLAWSPVx%i+?OP+pBOCyf&;s2CG3ryE6e@1QuB$)u^Kn@nN5)a2%9B~1gZ8nH+;}>vG^xVhC zOH?+YpFksq-bD6||K&#@MDU72uCo7+;1PK-e4gtJqVhel@7fih6Fxm#&>Bt0--`}c z$f4P4js&cX+rHa^0UYW*5U|%$z_mzX`0bG^k)*t9dxha`Al}weJQ{VI4;@d#uy*No z!ut1nIFHR*ig-xHQzV|)+n={Z=3+mN*Ol!84K=~+RpwZhvMcdFa%Vz_;(+vJ0e`j2 z#V1WyKKHADSc*GhQIW>L{C@5L-ne2R??&?u-I zd8=WS5XE5SY}vT{Pq zB?nR@d=rd(_fFioE8>4WN}?f-t1|6W`}d{4_2|)C&AZcBS<;?hiONgcNV$KFH?aGf4kjpU4bh|8wq;(9?5?Nf_Ln@a>sP%s-i)mJOJY zz`mzPr~M|x_ql(3lA;s?BoobhFl%BWJpj)BlAI`mD=UM@y0Aqkl!>?1&PaK*ze47; za)tAM(dq35!(7+`8H^m93@?}bdu_-?gp!7lnc++v=nl1)ZzRl)9}Bi9ArAWP_3|I? z1oXsf$^X~x{A--Iz1vZt(j&_d`gSFd&|7FjZE2bQ!DaP9AT=0Ww>?#f5mu3uL*}b` zKC+=J91Pw1CSifuXVmhDtp1s9gejQ4mTqFp{}A0s$Wun``GKj*KQqZBqF%9{?JT%y z>f)!pjg_1Rl((hi>eKk2tWX}#Fg%q)=z)n8JDVkbOWGMi0aql+nPiw9+nl>6dMF!! zF!ReRb&B)YjRRp$HlSF->_?!@*@7Iw(38~t_#szJ5{Tzom%1 znCAU{QaxntfZA-m2<%nt+COHS{NiOeZ~3TOMO>lf!;Z7SGLzGjchPDYZ2sa4uTi2% zJHJ8ZI@eH!p%<<(GAcT!YTBC*R*gMeq|cK^Slf~CaWk@dWRhgkP@6?4m_4{s7J2fH zt;8bLjRSvFs?9Jpy2}66_wK)M(qeu6>UXGfzYCS$%bK45+%U*^*KcBn|ab;KVp z!ik6&i`gP%tX#7fPgvEc+LyL04lIhP_jmcEAmLGe2bRK>)FsGMiimxcPx|`_D8Fil zUXe&PS6iqC86@i{MQlFir0(V2ze8)%%gfllb|zO)#lu*#R2~#8%a}fy2aiVxCiu#uNmGoVsYs~hnY1omE9IR}iDV~M zUk5U&dbsaN*Qn$#|DptEnTB(`JyU$&KMX#m=G~hz^^Uzi;8z3oKK5ksm@ZmANq_xA zHx=jk{5{i#TaPtjpAJ!Q;@2q)*Qb{3og4mDDP=O$;SW)14~8Hg!zT)&huI8{3$xaM;>vWs~hxw$7g@(_)U>Qx5oegxDSx%;j*+P1mr; zMh(fNK0s9siHNc5l*SuJC+YPYWKz&$PWY}4796_limZbtCk%969YkCtZPeOo+pee3 z)FnO|EFuI{kiOuhKA&|a?ER%A57$=|Yvm^&nrz1I8ZP*C=#I{DWHbHN6F1677FEI{ z1~U+>?HMTc+7fi~_5zo_+`)H{b_R;26BBUG5cfY$kX%HpfcjYEFt8yb`Ys}oSu<&~ z9jGWGETmWZPopT5F}vMh4$Eit=gPucgY75t&3Sv{%$@(ljbR~Hpn;x{?bl|Tsqc`7 zk?ApS&z;lv>W75@yWPB2536d#MYoo#va9q8=!Fs4$>zg9tj#fF8$QGsj|1GIAP3(b zNa75gyjD*;Dh#eP~9mG1?`!z=m@pW(9;D3>OKQvjydtEJ!Ga!hE|0njjbk^QpOk1eFBPcT0e&{sL zFSRpr>aFL2bxFBk##V6yhMV?L>wjW0Sl0iE$)f-9h*?xaD^LIUod4VR*t;-fxEz-L z68~F~^=x^6{zAplXiy@%w_>@dGHQgF@v6WR6us?ObBa05u8_sJsE__mXP!$e&p6}N z>w4#0g<|;3nkPQXG43tFSQg^W3vDj)#H)ha7F`&=ckr1wdvNPd3-0+r2p(iCkrb=` zsP}Pv)L)fVW;N22E$Xr#oW^N6k5}~ZNFsn}dUkYLs4$$Rshi3l)&vM7 zx8IFXbwi{}Lv_=Z>LP_pLH>>0C22m_xqG)5!3L!zFh=pb@UO`gK2UgllwOcwy~qq) z_fJ#&MY!Rm)756K+Oo-mGF;^^H{%SvkB1k4w+#0(kp? z$K@a9!@-grhntBSA1oPGDZn2VQ^r{4Jxe@7wn}qhO&|sfQCJLBM(o~;dCD|)&?r3a zal8a}ak`|7jQdd^2A)_|$isgZZ1~ZK>pFbfPS^3k^JFt-Yx;2mhq1|NFZ1uNip!(+ zYyB(suj9es$GI+epZ-j2pS=9d?n2zy&IE}~g{G=L+vVqEMBY}-TbIT>0xc`#p>`G) z80VYv6R6a!QcimT6Zjlg)q__{|Bl*bFB}sn&I=R+T-B?|+80`iS{`i1mzekn7E2L< zgbp{+gV;Vkwa?o;zB~X0k+Y_}Fjkkr^Mf9|0FE4Wn&np3(HNCtm!;QUhoMw*19*#p z#G!wIVZRjfiFTj_OiVcA@%49_N3CGJGL}$o&O>`g>Zr~)$+Ji~mT$%eWid|AU}V>| z;PI0skL@=6bIayBYN(6)lnX90LF?}KybQWRwY2lleZlqSvoq2G`iBy@#B)|&Mf2a! z9JoQFuv61`@Hz~pgG#456pzo*$qZ8^8wcn5bP_DNS*@D5?^SVN26m~BU)vQux4Xc& zChDe!ym@V{G*1SL{whah@N2i|U+sBR_fW(Br*G+lh228oIISZg?7(#D!MTae3Y|tD~cmgwbOT^PRkzFinBm2-Zaz zy6^DNI{oJG^tS8r6-RUGb-mH+D5p&d5NPWa;PWo=p83L{1ItNZz2>024tTBZzZ5ow zYVmP!fdQj=HDGI6tI~(`P`kEsM5SDHmRC=R+U=G^a zZs;Q}ve8DxfpKX%Df8>c2Eb{6VCS~y(`!rLn_3>$9K(Wu-m%*?mG0^*DNYatFUF3`BVu>iH{mdU_G$DNgQ|!T}$*V!jWmkPJ98cO!-*ui^CVsact49+gNPus7IVf2VcxZ6P1D?v%Hb)BPRcI z_zS$lX2JaG^g|yT@h?(4xO?wZh6x$-xmOISE{zHAwy9gVKPVI^n!j$q%IDLfX`o?s zf3fXR#n5!*KM~%WH?Ele*RaMfOosnVJeULhIvr_rhNn~neR1#vY8hWi%b=u-PVtr3`%1oViR!+(#+deO5HagO;*8T8zai7y*vH=>&^0! zaKj(gK6nV|nWkl@^V5@9VzA&|H zueR@}3n`tD!{~H7=ScC1##}U6N22}b)XLSM3LWv$(yZUPx{lP+Tu7W zbwvEB)>28pmr3~tvc{HDMwU{)=C4&wj$TBIHE6^kNv?M3BF-Uv;6;K6U$T_@w5FaL z4`drIbv>A{*=Uwy(n1O(Vk4;QMoVicHr>vnN8{q=yuc=0I|pwnL@1}{X)zto zSNuzp#odsCnugdxm&dBR)#dVQx2FEGqqE6T|2DdbbFoKl8w3IL;}REtxHVgB^+Z<8 zWw~(iEBe))91Sq7G__HF#j|$#aTgP6z~$5;JPTLwHTePFPl;Dp&HcobMve)ziC5{5 zW=(b^e)Mbt1HAyF_#I?@qGrZ+CN@uUa%? z$G=f5+SF>|Ebavq@XAwoDdti}j(_6F#D!EhEfLYFgjs7%R%C6WXO4@GRw1BfLB>iI-687gjYfW_p(R{usJ684rRovRFiQIRq8vQ z<5ki2-uW5t*~QBBYJuOM`r2T8rUgnNd7g64tJo=X{=9AIt=2U-0eLXIc@W{2Xms@w z1D^Na1xM=+k=t- zXvPa7708OXdPIs$NSWx0TRqvJJJ6))8M z`8CChoZ{E!0?g7(>n$bjhN(3))o7;c|K0pQF93@n8}9`k5jf090ynCD#S$gMOQ&wu zA0d7`Qc0s57mX+Q?EBxW-%MO{j!J(ssIm5O z;#%VTc`?a$R=IXnq7Qy}ul=%_;Q*uRXRHXsm%wf_DVa4|<_9&}PAT)0VmH`gf8vL} zCo(iEVMFS&BOl&~H%48J=exhkb?t}LyMUk&+{I3xF*_UH>8sQKyG0yysfx}K+MKC~&p_~v2Sg)7=?XkJ77*SUA@*=5E%#;ff4<9*PB#@;%M%q^R^bWE$wML+nY z+lx=4^7&a|Cn^R!-;ZH9apMd*ZbI9j3-6V8Jcqt}lNCCy!DSlSh%0DWN20x-uRrMd z`3Y7Pi$E@jdn*O~SU{>0jjGv@hBqBUx>t&T-QYaukX%S;MmGJy#mfvegm2SSr#yBp zp=ujPJ57H>@0NtLmGH&mgTmz5tco-n$Zd{+4f3#T|K=T-ZZ=hGY6i9!S&;aMcStF| zpQZ*~5O4(f{ORZ$Xgdxl4E;cXdg$yzQt7`d!q+#Iz>?-CDV6NY6wPNH2=SR{S{Dcm zv3+(S$4+1;Y(6PK=YVX=h5XZ>V4LIyW#${)UYWAN28W}Z?x=pwPtqBd6! zpBBB|@{NSs?-lUGd6PUapY=Qf6_^Xwfh4W`zL-am?4Q~juX2ZyNV*ug6-r@q33aAA z`@m(nHLM5M#?v8}I>zI;RUz5 z(Xb=m{Ti;%*IcW93bSQ`N6Zdp{IGbQlIY#T^#)X^qg9_e1az*==Q(ww9`5|OceNsh zD(vQNxLl-TMZRJ>bIZyuNYbwsd^PAS;!K^kl$_Y+TeRJOzQEOYAX&-xoULLJyacpv29s zMl@;4oUXS0IxgaLG_<#nK^*P{n7tMr9}lxXu3Zm2bv%u>Li4Z(txf_Ky+7mgsT*=`y8fM`suP_qedpQq(+0R`fmR4YE9JcZIwM#->yz<}H&c z*6HBulW{b!Z_DCv+KT_&+^DeQM>fqtFL>uL;=HD8at|vKdZ_IaRNH~ma0t^bMo8(a zX-1PsE(=^Yx2Nic-Qw+Xo!$Le}XJun})^p4- zf#p^2D;w*3NRjK>3FgTbT~#VknpRQt}ePvA?ez*-awe8-D&|{@f$~0Mh<~Lpz zT+%35y26lUzUU)pkul_RKf6~cQ6T0O$88sU75spCD7X2)50}sD>)=NC z`=>b3S>-<(Dbs75=3mjWC-_7SbFGGPRq~Iz)hzZ=Qbw_k6p5j8c90y72$7(FPev~zR9GwJ?he$ewgZZ z>#D+B!xUkZ)yQuF@fKoYCr9%klSSXj(2(c}iY2`AqV+i;ai3erce=Hziw{2NCF}9L zu#bCCDOeY$!~A?kqWgJsx{Ibm)-oKiyWi_`Jp1u=?OceWlf zbO&A}u1XqF3l06on`@!irG?OiDX@BmmSfhmN_V5>C$Gsz2bhwI*J@bamK&!H?M$19 z?GM$)=TXJ`J!ZanXYc3dDXh(+7Ywg?jDQV{+WY54 zR{QML!PQ{oR>_m1_R1Xsf+H$>K@=tnYrg6q;l!UFB`}uhREAI1z8LmterDw$PT8xE zf}MKxuNW8d{jWQGF)NSlYFZU(jN(|=H=OHK7n5&~?v4J^xn)y-hmV{2US;1Ap$UoX zG8^(S#Z_+B*!`wAAG=?6J@`fbOI3m4?onGA@DA^S+TS4T`!#tE^T=Vek@l(}pV&f$X>oc2aPYcG;`EBFB`8LfSEu=1akexR_ z=nlc-I(*vH?3Ws^^5cS~^Wjd0VWTV&%QoYWji89tw|DynM9a6v6kV*$ZO^-+RSjGP4hETghZQGf+(F1ht=;(8wSm znNYq+z3IhNsiri!l8l-Lj2;67Bfz_OKi%=+8;1rbCo0TQvbS7*-^EVe!f1}|`b+
+ +
diff --git a/website/src/pages/about.module.css b/website/src/pages/about.module.css index 583e53dd..6c97689d 100644 --- a/website/src/pages/about.module.css +++ b/website/src/pages/about.module.css @@ -1,3 +1,7 @@ +.about { + background-color: var(--caesar-surface-reading); +} + .article { min-width: 0; } From 2915a29c5cf716d6bb734a230d97ecea73a2934e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 15:54:24 +0100 Subject: [PATCH 28/32] website: improve news layout and media --- website/blog/2024-05-20-caesar-2-0.md | 17 +++--- website/blog/2026-03-04-highly-incremental.md | 24 +++------ website/blog/post-media.module.css | 26 +++++++++ website/src/css/custom.css | 44 ++++++++++++--- website/src/css/docs.css | 49 +++-------------- website/src/theme/BlogLayout/index.tsx | 27 ++++++++++ .../src/theme/BlogLayout/styles.module.css | 53 +++++++++++++++++++ 7 files changed, 163 insertions(+), 77 deletions(-) create mode 100644 website/blog/post-media.module.css create mode 100644 website/src/theme/BlogLayout/index.tsx create mode 100644 website/src/theme/BlogLayout/styles.module.css diff --git a/website/blog/2024-05-20-caesar-2-0.md b/website/blog/2024-05-20-caesar-2-0.md index 364a8d55..d696f70a 100644 --- a/website/blog/2024-05-20-caesar-2-0.md +++ b/website/blog/2024-05-20-caesar-2-0.md @@ -19,10 +19,11 @@ We are happy to announce *Caesar 2.0*: the next release of Caesar packed with a ```mdx-code-block import Link from '@docusaurus/Link'; +import styles from './post-media.module.css'; ``` - + Our new *Caesar Verifier* VSCode extension is now the recommended way to use Caesar. @@ -50,13 +51,13 @@ The extension is built on the [Language Server Protocol](https://microsoft.githu ### Assertion Slicing - + The error reports in Caesar are driven by the first implementation of specification-based slicing for probabilistic programs. By default, our slicing implementation is used to identify which `assert`-like statements are responsible for errors ([Caesar's *assertion slicing*](/docs/caesar/slicing#assertion-slicing)). -An example is shown on the right. +The screenshot shows a verification error. The slicing algorithm has determined that the invariant might not be inductive and could rule out e.g. that the pre does not entail the invariant. Caesar's slicing does not operate on high-level programs with loops, but instead on the low-level HeyVL statements, including verification statements. @@ -68,12 +69,12 @@ Custom error messages can be added via [slice message annotations](/docs/caesar/ ### Assumption Slicing - + Whereas assertion slicing is concerned with finding a minimal set of assertions in the program so that the program still has an error, [*assumption slicing*](/docs/caesar/slicing#assumption-slicing) tries to find a minimal set of assumptions so that the program still verifies. -In the example on the right, we can see a slightly modified version of the geometric loop example from above. +The screenshot shows a slightly modified version of the earlier geometric loop example. Now it has a constant starting value of zero. With the correct invariant, the program verifies. But Caesar can also tell us that this `while` loop could also be an `if` statement — no loop is required to satisfy the specification. @@ -85,13 +86,13 @@ Maybe the program can be simplified, but maybe the specification is not as stron ### General Slicing - + Caesar's implementation of slicing is not restricted to verification statements such as assertions and assumptions. With program annotations, Caesar can be instructed to run slicing for correctness and try to eliminate unnecessary assignments from the program. -In the example on the right, we have a probabilistic program that encodes a Bayesian network.[^1] +The screenshot shows a probabilistic program that encodes a Bayesian network.[^1] We have added the [`@slice_verify` annotation](/docs/caesar/slicing#general-slicing-for-correctness) to have Caesar also try to slice assignments. Caesar determined that most assignments are not necessary to satisfy the specification. @@ -102,7 +103,7 @@ There is also a corresponding [`@slice_error` annotation](/docs/caesar/slicing#g ## Calculus Annotations for Proof Rules {#caesar20-calculi} - + Caesar's HeyVL was designed as a [quantitative intermediate verification language](/docs/publications#oopsla-23), therefore it allows encoding all sorts of potentially unsound proof rules. diff --git a/website/blog/2026-03-04-highly-incremental.md b/website/blog/2026-03-04-highly-incremental.md index 7706da24..ad1db9b5 100644 --- a/website/blog/2026-03-04-highly-incremental.md +++ b/website/blog/2026-03-04-highly-incremental.md @@ -4,6 +4,8 @@ authors: phisch tags: [publications] --- +import styles from './post-media.module.css'; + Our new paper [_"Highly Incremental: A Simple Programmatic Approach for Many Objectives"_](https://doi.org/10.1007/978-3-032-26204-2_29) by Philipp Schröer and Joost-Pieter Katoen presents a one-fits-all approach for quantitative objectives on probabilistic programs, applicable to verification with Caesar. The paper [will be presented](https://conf.researchr.org/details/fm-2026/fm-2026-research-paper/31/Highly-Incremental-A-Simple-Programmatic-Approach-for-Many-Objectives) at [_The 27th International Symposium on Formal Methods (FM 2026)_](https://conf.researchr.org/home/fm-2026) in Tokyo, Japan. @@ -39,15 +41,8 @@ To capture that difference, we need higher moments: the _second moment_ $\mathbb Consider the three different runtime encodings in the following figure. -
-
+
+

@@ -121,15 +116,8 @@ This directly captures quantities such as the second moment, which is useful for The idea is shown in the following sketch: -
-
+
+

diff --git a/website/blog/post-media.module.css b/website/blog/post-media.module.css new file mode 100644 index 00000000..a694be08 --- /dev/null +++ b/website/blog/post-media.module.css @@ -0,0 +1,26 @@ +.codeFigure { + --figure-width: min(100cqi, 46rem); + inline-size: var(--figure-width); + margin-inline: calc((100% - var(--figure-width)) / 2); +} + +.codeGrid { + display: grid; + grid-template-columns: repeat(auto-fit, minmax(min(100%, 11rem), 1fr)); + gap: 2rem; + align-items: start; +} + +.screenshot { + display: block; + max-inline-size: min(100%, var(--screenshot-width)); + block-size: auto; + margin: 0 auto 1rem; +} + +@container (min-width: 38rem) { + .screenshot { + float: right; + margin: 0 0 0 1em; + } +} diff --git a/website/src/css/custom.css b/website/src/css/custom.css index b1ec092b..8ce9e637 100644 --- a/website/src/css/custom.css +++ b/website/src/css/custom.css @@ -160,18 +160,46 @@ pre code { --caesar-docs-code-background: var(--ifm-code-background); } -/* Keep the existing typography on Markdown pages outside the documentation. */ -.markdown:not(.theme-doc-markdown) h2.anchor { - --ifm-h2-font-size: 1.75rem; - margin-top: 3.5rem; +/* Style anchored Markdown headings so card and figure titles keep their own typography. */ +.markdown h2.anchor { + --ifm-h2-font-size: 1.5rem; + margin-top: 3rem; + padding-bottom: 0.5rem; + border-bottom: 1px solid var(--ifm-color-emphasis-300); + line-height: 2rem; +} + +.markdown h3.anchor { + --ifm-h3-font-size: 1.25rem; + position: relative; + margin-top: 2rem; + padding-inline-start: 1.5rem; + line-height: 1.75rem; +} + +.markdown h3.anchor::before { + content: ''; + position: absolute; + inset-inline-start: 0; + top: 0.375rem; + width: 1rem; + height: 1rem; + background: var(--ifm-color-emphasis-600); + mask: url("data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3E%3Cpath d='M4 3v6a3 3 0 0 0 3 3h9m-4-4 4 4-4 4' fill='none' stroke='black' stroke-width='1.5' stroke-linecap='round' stroke-linejoin='round'/%3E%3C/svg%3E") center / contain no-repeat; +} + +.markdown h4.anchor { + --ifm-h4-font-size: 1.125rem; + margin-top: 1.5rem; + line-height: 1.5rem; } -.markdown:not(.theme-doc-markdown) h3.anchor { - margin-top: 2.75rem; +.markdown h2.anchor + h3.anchor { + margin-top: 1.5rem; } -.markdown:not(.theme-doc-markdown) h2.anchor + h3.anchor { - margin-top: 1.5rem; +.markdown strong { + font-weight: var(--ifm-heading-font-weight); } /* Keep disclosures quiet when closed and mark the extent of expanded content. */ diff --git a/website/src/css/docs.css b/website/src/css/docs.css index 131c8395..0a2988c1 100644 --- a/website/src/css/docs.css +++ b/website/src/css/docs.css @@ -22,8 +22,13 @@ article:has(> .theme-doc-markdown) { max-inline-size: none; } -.theme-doc-markdown h1 { +.theme-doc-markdown h1, +.plugin-blog article > header > :is(h1, h2) { text-wrap: balance; +} + +.theme-doc-markdown h1, +.blog-post-page article > header > h1 { position: relative; inset-inline-start: 50%; inline-size: 100cqw; @@ -62,45 +67,3 @@ article:has(> .theme-doc-markdown) + .pagination-nav { overflow-x: auto; overflow-y: hidden; } - -/* Style anchored Markdown headings so card and figure titles keep their own typography. */ -.theme-doc-markdown h2.anchor { - --ifm-h2-font-size: 1.5rem; - margin-top: 3rem; - padding-bottom: 0.5rem; - border-bottom: 1px solid var(--ifm-color-emphasis-300); - line-height: 2rem; -} - -.theme-doc-markdown h3.anchor { - --ifm-h3-font-size: 1.25rem; - position: relative; - margin-top: 2rem; - padding-inline-start: 1.5rem; - line-height: 1.75rem; -} - -.theme-doc-markdown h3.anchor::before { - content: ''; - position: absolute; - inset-inline-start: 0; - top: 0.375rem; - width: 1rem; - height: 1rem; - background: var(--ifm-color-emphasis-600); - mask: url("data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3E%3Cpath d='M4 3v6a3 3 0 0 0 3 3h9m-4-4 4 4-4 4' fill='none' stroke='black' stroke-width='1.5' stroke-linecap='round' stroke-linejoin='round'/%3E%3C/svg%3E") center / contain no-repeat; -} - -.theme-doc-markdown h4.anchor { - --ifm-h4-font-size: 1.125rem; - margin-top: 1.5rem; - line-height: 1.5rem; -} - -.theme-doc-markdown h2.anchor + h3.anchor { - margin-top: 1.5rem; -} - -.theme-doc-markdown strong { - font-weight: var(--ifm-heading-font-weight); -} diff --git a/website/src/theme/BlogLayout/index.tsx b/website/src/theme/BlogLayout/index.tsx new file mode 100644 index 00000000..9e141293 --- /dev/null +++ b/website/src/theme/BlogLayout/index.tsx @@ -0,0 +1,27 @@ +import React from 'react'; +import BlogSidebar from '@theme/BlogSidebar'; +import Layout from '@theme/Layout'; +import type {Props} from '@theme/BlogLayout'; +import styles from './styles.module.css'; + +export default function BlogLayout({sidebar, toc, children, ...layoutProps}: Props) { + const hasSidebar = Boolean(sidebar?.items.length); + + return ( + +
+ {hasSidebar && ( +
+ +
+ )} +
+
+
{children}
+ {toc &&
{toc}
} +
+
+
+
+ ); +} diff --git a/website/src/theme/BlogLayout/styles.module.css b/website/src/theme/BlogLayout/styles.module.css new file mode 100644 index 00000000..9e8e7971 --- /dev/null +++ b/website/src/theme/BlogLayout/styles.module.css @@ -0,0 +1,53 @@ +.layout { + display: flex; + flex: 1; +} + +.content { + flex: 1; + min-inline-size: 0; +} + +.posts { + container-type: inline-size; + min-inline-size: 0; +} + +.posts > :is(article, :global(.pagination-nav)) { + max-inline-size: var(--caesar-docs-reading-width); + margin-inline: auto; +} + +.posts :global(.katex-display) { + overflow-x: auto; + overflow-y: hidden; +} + +.posts :global(.markdown) :global(.button) { + white-space: normal; +} + +.posts iframe[width='560'][height='315'] { + max-inline-size: 100%; + block-size: auto; + aspect-ratio: 16 / 9; +} + +.sidebar { + display: none; +} + +@media (min-width: 997px) { + .sidebar { + display: block; + flex: 0 0 var(--doc-sidebar-width, 300px); + background-color: var(--caesar-surface-doc-sidebar); + border-inline-end: 1px solid var(--ifm-toc-border-color); + } + + .sidebar > aside { + max-inline-size: 100%; + block-size: 100%; + padding: 1rem 1.25rem; + } +} From 6285fea41cee8323139356445381bf76195b793b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 15:54:24 +0100 Subject: [PATCH 29/32] website: announce Caesar 4.2 --- website/blog/2026-11-18-caesar-4-2.md | 168 ++++++++++++++++++++++++++ 1 file changed, 168 insertions(+) create mode 100644 website/blog/2026-11-18-caesar-4-2.md diff --git a/website/blog/2026-11-18-caesar-4-2.md b/website/blog/2026-11-18-caesar-4-2.md new file mode 100644 index 00000000..caf3d501 --- /dev/null +++ b/website/blog/2026-11-18-caesar-4-2.md @@ -0,0 +1,168 @@ +--- +authors: phisch +tags: [releases] +--- + +# Caesar 4.2: HeyVL Examples, Loop Proofs, and Soundness Fixes + +Caesar 4.2 adds new ways to bound expected rewards and a filterable gallery of programs and proofs written in HeyVL, Caesar's verification language. +The release also fixes soundness bugs involving `@past` loops, procedure calls in variable initializers, and model exports for loops with local declarations. + +**Overview** + +1. [Soundness Fixes](/blog/2026/11/18/caesar-4-2#soundness-fixes) +2. [HeyVL Example Zoo](/blog/2026/11/18/caesar-4-2#heyvl-example-zoo) +3. [Required Migration for `@past` Proofs](/blog/2026/11/18/caesar-4-2#positive-almost-sure-termination) +4. [More Flexible Optional Stopping](/blog/2026/11/18/caesar-4-2#optional-stopping) +5. [Optional `else` Branches](/blog/2026/11/18/caesar-4-2#optional-else) +6. [Website and Documentation](/blog/2026/11/18/caesar-4-2#documentation) +7. [Other Improvements](/blog/2026/11/18/caesar-4-2#other-improvements) + + + +:::info[Migration Required for `@past`] + +If you use `@past`, put the annotated loop in a `coproc` and [update its specification](#positive-almost-sure-termination). + +::: + +## Soundness Fixes {#soundness-fixes} + +:::warning[Earlier Verification and Model-Checking Results] + +Earlier versions could accept invalid proofs or export models that gave incorrect results in the cases below. +After upgrading, rerun proofs that use `@past`, procedure calls in variable initializers, standalone `validate` or `covalidate`, `--explain-core-vc`, or `--opt-rel`. +Regenerate JANI models exported from loops with literal initializers inside the body, then rerun model checking. + +::: + +- **Loops annotated with `@past`.** Caesar checked the ranking proof separately and could accept a procedure specification that left out rewards accumulated in the loop. + Caesar now accounts for the loop's rewards and possible exit states when checking the procedure. +- **Procedure calls in variable initializers**, such as `var x: UInt = p()`. + - A call in a declaration could bypass the direction check, allowing a `proc` to call a `coproc` or vice versa. + Caesar now checks calls in declarations as well as in assignments. + - Proof rules that copy loop bodies, such as `@unroll`, could drop an initializer call from a copy and verify a false postcondition. + Caesar now preserves and checks the call in each copy. +- **JANI export.** A literal initializer inside a loop, such as `var x: UInt = 0`, only ran at model startup, so later iterations could reuse a stale value and give the wrong result. + The exported model now runs the initializer every time it reaches the declaration. +- **Standalone validation statements.** Caesar swapped the effects of `validate` and `covalidate` on positive finite expectations when translating these statements on their own. + The corrected translations map those values to $0$ for `validate` and $\infty$ for `covalidate`, as specified for [validation statements](/docs/heyvl/statements#validations). +- **Optional transformations** + - `--explain-core-vc` could replace $0 - x$ with $x$. + The simplifier now leaves the subtraction intact when it cannot fold it correctly. + - `--explain-core-vc` could simplify $0 / x$ to zero even when $x$ could be zero, allowing an invalid proof to pass. + The simplifier now preserves the division in that case. + - `--explain-core-vc` could crash when simplifying multiplication of a `Real` value by zero. + The simplifier now produces a zero of type `Real`. + - `--opt-rel` applied lattice rewrites to types where they can change an expression's value. + It now applies those rewrites only to extended nonnegative reals. + +## HeyVL Example Zoo {#heyvl-example-zoo} + +The expanded [HeyVL Example Zoo](/docs/getting-started/zoo) collects 22 examples, from coin flips and sampling algorithms to communication protocols and data structures. +You can filter by topic or proof technique and download the HeyVL source. +Seventeen examples have walkthroughs that explain the program, what Caesar verifies, and how to run the proof yourself. + +### New and Updated Proofs {#example-proofs} + +- Browse new proofs of uniform sampling from a stream in [Reservoir Sampling](/docs/getting-started/zoo/reservoir-sampling) and from a range of any positive size in [Fast Dice Roller](/docs/getting-started/zoo/fast-dice-roller#fast-proof). +- See how two separate bounds limit the expected number of rounds given that a queue empties before its server fails in [Conditioning on Queue Completion](/docs/getting-started/zoo/conditioning#verification). +- Compare upper and lower bounds on the expected number of tails before the first heads in [Geometric Loop](/docs/getting-started/zoo/geometric-loop#verification), or see how `@past` bounds the expected number of flips in [Countdown with Pauses](/docs/getting-started/zoo/one-sided-random-walks#past-finite-expected-number-of-coin-flips). +- Explore proofs that bound the probability of delivering all packets and the expected number of transmission attempts for one packet in the [Bounded Retransmission Protocol](/docs/getting-started/zoo/bounded-retransmission#retrying-one-packet). +- Find Boolean correctness proofs for [Selection Sort](/docs/getting-started/zoo/selection-sort) and [Binary Search Trees](/docs/getting-started/zoo/binary-search-trees). + +## Required Migration for `@past` Proofs {#positive-almost-sure-termination} + +The [`@past` annotation](/docs/proof-rules/past) now uses the ranking expression $I$ to bound the loop's expected reward in the enclosing procedure. + +1. Declare the enclosing procedure as a `coproc`. + Write `@ert` to make the expected-runtime calculus explicit. + If the `coproc` omits its calculus annotation, `@past` selects least-fixed-point semantics for the loop. + Put any lower-bound claim in a separate proof. +2. If the procedure consists of the loop, use its ranking expression $I$ as `pre` and set `post 0`. + +Keep `@past(I, epsilon, K)` on the loop. +Caesar now rejects $\epsilon = 0$, checks $I < \infty$ in every state, and enforces the [loop-body restrictions](/docs/proof-rules/past#formal-theorem). +The expected decrease in $I$ must cover the iteration's expected reward plus $\epsilon$. + +
+Example Migration for a Countdown + +The countdown initializes `x` to `n`, so the ranking expression `2 * x + 1` at loop entry gives `pre 2 * n + 1`. +With one reward per iteration, Caesar verifies this as an upper bound on the expected number of iterations. + +```diff +-proc count(n: UInt) -> () ++@ert ++coproc count(n: UInt) -> () ++ pre 2 * n + 1 ++ post 0 + { + var x: UInt = n + @past(2 * x + 1, 1, 2) + while x > 0 { + reward 1 + x = x - 1 + } + } +``` + +
+ +## More Flexible Optional Stopping {#optional-stopping} + +The [optional stopping rule (`@ost`)](/docs/proof-rules/ost) accepts more invariants in `@wp` proofs and now supports lower bounds on expected rewards in `@ert` proofs. +Existing `@wp` proofs that meet the rule's assumptions need no changes. +Write $I$ for the invariant and $f$ for the loop's postexpectation. + +- **On exit.** Caesar previously required $I = f$. + Now $I \leq f$ suffices. +- **Finiteness.** The old check required a finite expected value of $I$ after one iteration and a finite value of $f$ at exit. + Caesar now checks that $I$ itself is finite in every state, and $f$ can be infinite even at exit. +- **Change per iteration.** Caesar previously checked the expected absolute change of $I$ even in states where the loop would stop immediately. + It now applies the bound $c$ only in states where the loop guard holds. + The bound includes the iteration that exits the loop. + +To prove a lower bound on accumulated rewards, put `@ost(I, PAST_I, c, 0)` in an `@ert proc` with `post 0`. +The bound $c$ must cover the expected sum of the rewards and the absolute change of $I$ in one iteration, as described in the [expected runtime rule](/docs/proof-rules/ost#rewards-and-expected-runtimes). + +## Optional `else` Branches {#optional-else} + +This one took us a while for a change that saves seven characters. +You can finally leave out `else {}` in a [HeyVL conditional](/docs/heyvl/statements#boolean-choices). + +```heyvl +// Before +if x > 0 { + x = x - 1 +} else {} + +// Now +if x > 0 { + x = x - 1 +} +``` + +## Website and Documentation {#documentation} + +- The docs add a [first-proof walkthrough](/docs/getting-started/first-proof), expand the [HeyVL statement reference](/docs/heyvl/statements), and explain the [guarantees of each proof rule](/docs/proof-rules/approximations). +- The Publications page links to the [open-access CAV tool paper](/docs/publications#cav-26-caesar-a-deductive-verifier-for-probabilistic-programs). + The [About page](/about#cite-and-share) offers BibTeX, logos, and a QR code for the website. + +## Other Improvements {#other-improvements} + +- **Proof diagnostics** + - Counterexamples from `@unroll` have clearer diagnostics. + - Caesar handles unchanged parameters correctly in `@ost` and `@past` obligations. + - `--explain-core-vc` supports `conegate`. +- **Storm** + - Caesar reads the new command-line result format and displays the solution bounds reported by [Storm 2.0](https://github.com/stormchecker/storm/releases/tag/v2.0.0). + With a state limit, Caesar labels these as bounds for the truncated model. + - If Storm omitted a property's result, Caesar could display the next property's result in its place. + Caesar now reports the result as missing. +- **SMT.** Caesar handles more Boolean operators during verification and avoids repeatedly simplifying the same subexpressions in nested implications. +- **VS Code.** Installation and updates handle multiple open windows, and the walkthrough links to the example zoo. +- **Command line** + - Caesar has removed the experimental `--egraph` option. + Remove the flag from scripts that pass it. + - On Linux, `--mem` now reads resident memory from `/proc/self/statm`, which works under QEMU user-mode emulation. From 7457e49fd2ed250738e7e6a0bc69931ffde98e69 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 16:05:25 +0100 Subject: [PATCH 30/32] docs: rewrite the introduction --- website/docs/introduction.md | 49 +++++++++++++++++++----------------- 1 file changed, 26 insertions(+), 23 deletions(-) diff --git a/website/docs/introduction.md b/website/docs/introduction.md index d9bb3bcf..e7850173 100644 --- a/website/docs/introduction.md +++ b/website/docs/introduction.md @@ -1,41 +1,44 @@ --- +description: Learn what Caesar can verify, run a first proof in HeyVL, and find the language and tool references. sidebar_position: 1 slug: / --- # Introduction -```mdx-code-block -import Citation from '@site/src/components/Citation'; -import {references as sources} from '@site/src/data/references'; +Caesar is a deductive verifier for probabilistic programs. +It can prove bounds on the probability that a protocol abandons a message or on the expected number of steps in a randomized algorithm. +It also checks whether a program terminates with probability one and whether it satisfies Boolean specifications, such as returning a sorted list whenever it terminates. -export const references = { - oopsla: sources.heyvl2023, -}; -``` +## Getting Started {#overview} -Hello and welcome! -This is the user documentation for [_Caesar_](https://github.com/moves-rwth/caesar), a deductive verification framework for probabilistic programs. +[Install Caesar](./getting-started/installation.mdx) to verify programs in VS Code or from the command line. +In the [first example](./getting-started/first-proof.mdx), you verify that a loop that flips a fair coin until heads takes at most two iterations in expectation. -### Overview +The [Guide to HeyVL](./getting-started/heyvl-guide.md) shows how to write your own programs and specifications. +Browse [HeyVL Examples](./getting-started/zoo.md) for worked proofs and downloadable programs, from sorting and sampling algorithms to random walks and communication protocols. -After [installing Caesar](./getting-started/installation.mdx), continue with our [getting started guide](./getting-started/) to learn the basics of HeyVL and Caesar. +## How Verification Works -The language is documented in the [HeyVL language section](./heyvl/). -Built-in functions and types are documented in the [standard library section](./stdlib/). +You write the program and its specification in HeyVL, Caesar's verification language. +For each loop, you select a proof rule and supply the information it needs, such as a loop invariant. +Caesar generates verification conditions and checks them with the Z3 SMT solver. +This lets you reason symbolically about unbounded loops and programs with infinitely many possible states. -In the [Caesar section](./caesar/), we have documentation for the Caesar tool, its command-line interface and the VSCode extension, as well as for our slicing algorithm. +## Reference -### Our Theory Paper +- [HeyVL](./heyvl/) documents the language, and the [standard library](./stdlib/) documents built-in types, functions, and distributions. +- [Proof Rules](./proof-rules/) covers loop annotations, their assumptions, and the guarantees they establish. +- [The Caesar Tool](./caesar/) covers the command line, VS Code integration, and diagnostics for debugging proofs. +- [Model Checking](./model-checking.md) explains how to export supported HeyVL programs to JANI and analyze them with Storm. -Our OOPSLA 2023 paper introduces Caesar and its theory. +## Research and Citation {#our-theory-paper} - +Read about Caesar's verification workflow and tooling in the [CAV 2026 tool paper](./publications.md#cav-26-caesar-a-deductive-verifier-for-probabilistic-programs). +For the design of HeyVL and the theory behind the verifier, see the [OOPSLA 2023 paper](./publications.md#oopsla-23). +See [Publications](./publications.md) for related work and BibTeX entries. -You can [find the preprint on arxiv](https://arxiv.org/abs/2309.07781). -More information on the [publications page](./publications.md). +## Questions and Feedback {#contact-us} -### Contact Us! - -**This is research software**, so it's not bug-free and there may be missing documentation in places. -Please open [start a discussion in our forum](https://github.com/moves-rwth/caesar/discussions), [open an issue](https://github.com/moves-rwth/caesar/issues), or send an email to [phisch@cs.rwth-aachen.de](mailto:phisch@cs.rwth-aachen.de) with questions or ideas. +Ask a question in [GitHub Discussions](https://github.com/moves-rwth/caesar/discussions) or [open an issue](https://github.com/moves-rwth/caesar/issues) to report a bug. +For research questions or collaboration, email [Philipp Schroer](mailto:phisch@cs.rwth-aachen.de). From 8d85ef41575bca0bb2d8c21445fbf979b17928a8 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 16:42:31 +0100 Subject: [PATCH 31/32] examples: verify uniform coupon draws separately --- .../coupon-collector-uniform.heyvl | 46 +++++++++++-------- .../getting-started/zoo/coupon-collector.mdx | 18 ++++---- 2 files changed, 37 insertions(+), 27 deletions(-) diff --git a/tests/case-studies/coupon-collector-uniform.heyvl b/tests/case-studies/coupon-collector-uniform.heyvl index c2626f94..8a6d87d2 100644 --- a/tests/case-studies/coupon-collector-uniform.heyvl +++ b/tests/case-studies/coupon-collector-uniform.heyvl @@ -18,27 +18,35 @@ coproc coupon_collector(N: UInt) -> () while !found_new { // Count one coupon draw without charging for the sampler's internal steps. tick 1 - // Draw an index uniformly from 1 through N. - var coupon: UInt = N - var chosen: Bool = false - @invariant( - !?(1 <= coupon && coupon <= N) - ⊔ ( - ite(chosen, [coupon > x], - ite(coupon > x, (coupon - x) / coupon, 0) - ) * (N / x) - + N * harmonic(x - 1) - ) - ) - while !chosen && coupon > 1 { - chosen = flip(1 / coupon) - if !chosen { - coupon = coupon - 1 - } else {} - } - // Labels 1 through x represent the currently missing coupons. + var coupon: UInt = draw_coupon(N, x, N * harmonic(x - 1)) found_new = coupon <= x } x = x - 1 } } + +@ert +coproc draw_coupon(N: UInt, x: UInt, remaining: UReal) -> (coupon: UInt) + pre !?(0 < x && x <= N) + pre (N - x) / x + remaining + post ite(coupon <= x, 0, N / x) + remaining +{ + // Draw an index uniformly from 1 through N. + coupon = N + var chosen: Bool = false + @invariant( + !?(1 <= coupon && coupon <= N) + ⊔ ( + ite(chosen, [coupon > x], + (coupon - x) / coupon + ) * (N / x) + + remaining + ) + ) + while !chosen && coupon > 1 { + chosen = flip(1 / coupon) + if !chosen { + coupon = coupon - 1 + } else {} + } +} diff --git a/website/docs/getting-started/zoo/coupon-collector.mdx b/website/docs/getting-started/zoo/coupon-collector.mdx index 2d8d5c91..3b18dba2 100644 --- a/website/docs/getting-started/zoo/coupon-collector.mdx +++ b/website/docs/getting-started/zoo/coupon-collector.mdx @@ -109,26 +109,28 @@ Updating `x` to `x - 1` makes this the outer invariant for the new value of `x`. ## Explicit Uniform Draws {#uniform-draws} -We replace `flip(x / N)` with a sampler that draws uniformly from `1` through `N`. -Labels `1` through `x` represent the missing coupons, so `found_new = coupon <= x` records whether the draw is new. -The surrounding collection loops are unchanged, so the excerpt shows only one draw and its sampling loop. +The collector calls `draw_coupon` to draw an index uniformly from `1` through `N`. +Labels `1` through `x` represent the missing coupons, so the collector uses `found_new = coupon <= x` to tell whether the draw is new. +It charges one `tick 1` per call to the sampler. Starting at `coupon = N`, the sampler accepts each candidate with probability `1 / coupon` and otherwise tries the next smaller index, with `1` as the fallback. For each index $j$, reaching it has probability $j/N$, so selecting it has probability $(j/N)\cdot(1/j)=1/N$. Its internal flips add no ticks, so the same $N\cdot H_N$ bound still counts coupon draws. -The term `N / x` bounds the further draws needed after a duplicate, while `N * harmonic(x - 1)` covers the draws after the next new coupon. +The sampler's `post` adds `N / x` to the bound when it returns a duplicate, accounting for the draws still needed to find a new coupon. +The collector supplies `N * harmonic(x - 1)` for `remaining`, which bounds the draws after the next new coupon. Before selection, $\max(\mathtt{coupon}-x,0)/\mathtt{coupon}$ is the fraction of remaining indices that are duplicates. After selection, `[coupon > x]` records whether the drawn index is a duplicate. -At `coupon = N`, adding the preceding tick gives $1+(N-x)/x=N/x$, recovering the waiting cost. -At sampler exit, assigning `found_new = coupon <= x` recovers the invariant for finding the next new coupon. +The sampler's `pre` bounds the expected cost by $(N-x)/x$ plus `remaining`. +Adding the tick before the call gives $1+(N-x)/x=N/x$, the waiting cost before a draw. +After the call, `found_new = coupon <= x` restores the invariant for finding the next new coupon. ## Earlier Version {#original-proof} From 7c5d319512bad994adf22857ad8a01a1055b1da9 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 16:47:08 +0100 Subject: [PATCH 32/32] examples: stabilize the inline coupon collector proof --- .../coupon-collector-uniform.heyvl | 48 ++++++++----------- .../getting-started/zoo/coupon-collector.mdx | 18 ++++--- website/src/heyvl-examples/catalog.mjs | 2 +- 3 files changed, 29 insertions(+), 39 deletions(-) diff --git a/tests/case-studies/coupon-collector-uniform.heyvl b/tests/case-studies/coupon-collector-uniform.heyvl index 8a6d87d2..f10eca3d 100644 --- a/tests/case-studies/coupon-collector-uniform.heyvl +++ b/tests/case-studies/coupon-collector-uniform.heyvl @@ -1,4 +1,4 @@ -// RUN: @caesar @file --function-encoding fuel-param --quantifier-instantiation e-matching +// RUN: @caesar @file --function-encoding fuel-mono --max-fuel 1 --quantifier-instantiation e-matching --strict domain Harmonic { func harmonic(n: UInt): UReal = ite(n == 0, 0, harmonic(n - 1) + 1 / n) @@ -18,35 +18,27 @@ coproc coupon_collector(N: UInt) -> () while !found_new { // Count one coupon draw without charging for the sampler's internal steps. tick 1 - var coupon: UInt = draw_coupon(N, x, N * harmonic(x - 1)) + // Draw an index uniformly from 1 through N. + var coupon: UInt = N + var chosen: Bool = false + @invariant( + !?(1 <= coupon && coupon <= N) + ⊔ ( + ite(chosen, [coupon > x], + ite(coupon > x, (coupon - x) / coupon, 0) + ) * (N / x) + + N * harmonic(x - 1) + ) + ) + while !chosen && coupon > 1 { + chosen = flip(1 / coupon) + if !chosen { + coupon = coupon - 1 + } else {} + } + // Labels 1 through x represent the currently missing coupons. found_new = coupon <= x } x = x - 1 } } - -@ert -coproc draw_coupon(N: UInt, x: UInt, remaining: UReal) -> (coupon: UInt) - pre !?(0 < x && x <= N) - pre (N - x) / x + remaining - post ite(coupon <= x, 0, N / x) + remaining -{ - // Draw an index uniformly from 1 through N. - coupon = N - var chosen: Bool = false - @invariant( - !?(1 <= coupon && coupon <= N) - ⊔ ( - ite(chosen, [coupon > x], - (coupon - x) / coupon - ) * (N / x) - + remaining - ) - ) - while !chosen && coupon > 1 { - chosen = flip(1 / coupon) - if !chosen { - coupon = coupon - 1 - } else {} - } -} diff --git a/website/docs/getting-started/zoo/coupon-collector.mdx b/website/docs/getting-started/zoo/coupon-collector.mdx index 3b18dba2..2d8d5c91 100644 --- a/website/docs/getting-started/zoo/coupon-collector.mdx +++ b/website/docs/getting-started/zoo/coupon-collector.mdx @@ -109,28 +109,26 @@ Updating `x` to `x - 1` makes this the outer invariant for the new value of `x`. ## Explicit Uniform Draws {#uniform-draws} -The collector calls `draw_coupon` to draw an index uniformly from `1` through `N`. -Labels `1` through `x` represent the missing coupons, so the collector uses `found_new = coupon <= x` to tell whether the draw is new. -It charges one `tick 1` per call to the sampler. +We replace `flip(x / N)` with a sampler that draws uniformly from `1` through `N`. +Labels `1` through `x` represent the missing coupons, so `found_new = coupon <= x` records whether the draw is new. +The surrounding collection loops are unchanged, so the excerpt shows only one draw and its sampling loop. Starting at `coupon = N`, the sampler accepts each candidate with probability `1 / coupon` and otherwise tries the next smaller index, with `1` as the fallback. For each index $j$, reaching it has probability $j/N$, so selecting it has probability $(j/N)\cdot(1/j)=1/N$. Its internal flips add no ticks, so the same $N\cdot H_N$ bound still counts coupon draws. -The sampler's `post` adds `N / x` to the bound when it returns a duplicate, accounting for the draws still needed to find a new coupon. -The collector supplies `N * harmonic(x - 1)` for `remaining`, which bounds the draws after the next new coupon. +The term `N / x` bounds the further draws needed after a duplicate, while `N * harmonic(x - 1)` covers the draws after the next new coupon. Before selection, $\max(\mathtt{coupon}-x,0)/\mathtt{coupon}$ is the fraction of remaining indices that are duplicates. After selection, `[coupon > x]` records whether the drawn index is a duplicate. -The sampler's `pre` bounds the expected cost by $(N-x)/x$ plus `remaining`. -Adding the tick before the call gives $1+(N-x)/x=N/x$, the waiting cost before a draw. -After the call, `found_new = coupon <= x` restores the invariant for finding the next new coupon. +At `coupon = N`, adding the preceding tick gives $1+(N-x)/x=N/x$, recovering the waiting cost. +At sampler exit, assigning `found_new = coupon <= x` recovers the invariant for finding the next new coupon. ## Earlier Version {#original-proof} diff --git a/website/src/heyvl-examples/catalog.mjs b/website/src/heyvl-examples/catalog.mjs index 765fd969..5f10cf69 100644 --- a/website/src/heyvl-examples/catalog.mjs +++ b/website/src/heyvl-examples/catalog.mjs @@ -113,7 +113,7 @@ export const examples = [ detailSlug: 'coupon-collector', variants: [ variant('main', 'Expected draws: simplified sampling', 'tests/case-studies/coupon-collector.heyvl', ['invariants'], [...fuel, ...eMatching]), - variant('uniform', 'Expected draws: explicit uniform sampling', 'tests/case-studies/coupon-collector-uniform.heyvl', ['invariants'], [...fuel, ...eMatching]), + variant('uniform', 'Expected draws: explicit uniform sampling', 'tests/case-studies/coupon-collector-uniform.heyvl', ['invariants'], ['--function-encoding', 'fuel-mono', '--max-fuel', '1', ...eMatching, '--strict']), ], }, {

^^(M7O(Xm;2TsO>jTS>^6>tfqP6ysMAb zn|d-_7v5|)P9rUS#dC&MSii|gC$HfFBnIp(os0m8IdR>-MNTWMM>=(XDEx-NbdBJ_Q@Gj^BwN=f zpXVuyl>>r)(XW-vBtAN@Kld>#!q`3Ui6c?mGyR09wVLp{T*mId3rhFOh#BoPD}Smz zv-o7&{4ngXu<;Yui`<;!|1Oe!-ieQVOPZT~3bf6xhMJdVb(@hh{IrWG_(Bk-bnEQ+ zuG-&Sc}FBltw9?Q2WE1j#>q4>_A1-nxtRD|^#-y_-ap{O<~l?#%t4n`@R9}54wcAT z+HogSW0c%$--oFee%OgvP9n{BBl2r*8a+4I7ZVbfsu;S1JToDBv|6mt?saQUijC9n z-57por<_nefV&B#Ihic2cGi?B9b@f4r<483qqDF5l_?~qH1Bsg6;KBOjWH$Zs25z% zfjpBHo} zjtmBp5(L2a(9PKjN&{XcO_p?g+aMI{`93SR<$$@?$=;h{pYHmPzx#aQVX=pStm#h% z_14If!zJa~wTQFAb|{RvoEQ#?7_ZM^LShFsd@ufgJi`BTR)tp~l@e9$a>sZ~>r2BI z+<$+On1-RoRLb96O2+IeQ~XkV?X6?-Nu&^=h-8ZsF00>|kd?kafyaAWwm-pG zNZMb{?eUG7*XmL!A5#%zAHLYz`!c=%WbYqE!LoPy0C~A^6vdm4_g%83+3|eP|H;pe zlSw_x3AeJoe_B(rtbPawo2GOaMFeF z6C&}pZ$tefDVTD2UKV^=WjFVG^4@EPQ2Vivg&pmHlPAfsM20^e*^f&{bo@_=F9+9YeZ?O z7faVAuJ9}9z&>-`C~|t5mc%Cpk>vD^49^gBw^q7xW3wV{T%aX|q2|m;=^I%JkEhja z&tLTtz6pRI>*(aM;O+9OFZnD4H550vN{g(S>NcsfXk&rvc-uhoM3$PNMgYL8#O5?1 zL5sk|J}LhP<VjXbNl|?GGU)vsn9Q4e74(ce z)PA)F@Lm}}+Gr4yBEB#>Vzqfmlww@?oEG?L8 zClap?=-z7yP$$2K%mU?nfQ&vnB*A;p?}Z6lJQVJEwMv;QHX;NL>IRpjWqieBgd&N3 zqXfcQe)(R-wL`Tk1l73qd-fKfXm_(|SD-qK`}bHyGTh8}Nf~++nl;Y-q%{daadgy0 zcj&qVv3-@Zl&8odopBEijrLk00oe!U4)64IHC;ZZPdWB zGxMM9Jh%bP6tPgo;8l#cK&5kH33R}*urn_8ue{VA1&#xLw2Bgb+!7I0I8mcz<(Lz% z@|f*$s_tHAhM75+0B@RH3qNM``0G67#$wm)Ni5(kN1|f+#^OlK_>FqsxL%LyI(zi` zwajFeQISI7^sfhBm)y5KEPH_oLp)}Any7!YX8Aqd!e9MaDIkR}lYEgk%64MCR)XVI zbQ_jjL}GFL2c>UveqVii#jYI$e=b~hrW=9>Lx}V`E6_Lp0!#ydVeemKx0~nnT zp&zLkq>yP769TKzvlJTRn5&*`Of2Kq>-a7W-K;MHAo^mkdxjeSh?iv34z9 zH4m=HNf{De0Uig5})Ap#V2#Ft-AMap|<7e*ml zuBj$QyI?=oJQpNY!M(kk4n+CP4#A8rp)z zZ&l(V8^hP!@0Z{c;a_7!U6nRdr$KDUp;D_pVrqoInu@vnGeYCJaS$s*?%{n8L(6I<)2RW z$y9m~nGwoC;`;x%C-iTgxj%2((u<54^7sd(OfTJdoVq+#*)wH$Tb|)=D-HUpNm};d zOHBWaF#k+AiW((-B^c=ly;1RFoIRhZ{|Qdq^28Lv*Cv1wYiEHPDI%j2GF;xikRx(y zf*)#1;=&Alx98b4FR4-ZRTK#yimfKrXbo9hK3cFMgR-?<9IJ=CL)yP_ zBj0tnK3^YM3R$H=J>-Ib`F$yEzas1gR~`NOkE@?x1i)FOHTsiX=^!zUZG0VH(H0ZG z#Zfp2q~FIQS*~)l##9+^`x_E+_5=GceVHMv$;&Wxo-+8#hEK<=M(iax?N7G8!Bq|M zd*02!vPqjhxCUMETwPQb&AO|D5jej*iM z0c6QX{&?U+{Vtd7H`d*m;XBBG6FZvQ167|5e?PzmmW^vpw(k`Zg8R*;ZX^&oE_SDT zH6}5JB2n$Nc{8TL1q69bng(-O&*_}Z@*mNs!=yJLdm>%osV$w!Tyc%%@aYE+LeFAZ zhRm)--r>ShYPgcKRbRh&BpOOUUeIDw|xL!6r@E0-o;;2xCPAn$VY zHnn$7!A)DH@uKWv^k}J<3bA=v-7_UEbs(i$Z|5DR{dwQ{8yo^$*VAYPI)P@A2~=df z)0&>aHxD%4&~%%_QJ{9+_tB@>R_)T^(en3UIGgBlniqchF@g2zrUQts97p=3(v_xw zEHyKa62&oTJH3lA2EELNzr>=NkTqg1D~IVk#e%HoQEsRFsu%`0Rx*WL>sr70@L`1>(m9>V0 z((u+B042wD508Oc_we4Z8Vy*@2Fk=I^WY#16*IQiONzjL`eHYY5%>Q7Oq&Dw{w`@U zPu`ZQ$wDgNcDnJz#wr`16w@-&cuBt3edB8liwn90+{yIgI#yP@J7>E9%L4XKSk|kZ_rgl2?YD9>6p5? zE|mEkzj)_D*G9}Q>QdLNGalp6ptLe0Uq=iWJGuODv6j=qj2G`H5?%;mu|np;eWZ9z zAev?n6?1O^Rpk>?sp3ek0YbdB8zv58bu=U#JZq!YOQ(Ob+GE}_>+aKo@Eib&hNXOe zApGNv*P~`9>fZI=z%Ai56VP$SwxU$x_xfJV1)CG6o^{D_rnN(b*>T=oY$RrIdS>N1 zD2CU`8AP2nPRP(3^BeABuj*GhJ3Mow9El{Z1oZ3=Zn(i{A^-ZqMt_!pSieZ=Z1pBE zz~IX;a4?Fiz6gw(3zsWuyrtvH($cE_UK|d-`yoEHm(hD4bVOr{v$xKGRRkE*EM)j? z zr_Hr5F54zyDF}6sI%2fv*37t7{F!SKO0TX@%(o>G(p0IK=0O#eYSZK5o#T=Yh1Qkq z?EfEoZy8lp_x6o$#6$&@5)?2%8l+*9N~46Nv`R{MN~j>Ipp_<#P)E)&i+yj^rAVN&c<6G>%X;cYQsvImoo@XK?QVQ|Kwj^$ME>U=& zYzzT_li8#sgnSK|>7pll8xFkw_RQp_8jEr2?2w;Hm;TpuLCxd~#CxuNNSBkueS$pwp2*gqcm=pW|0|S0PAH zw&FZ&8GMXlG&!D89CdAek7EH#NHY)L#^_b$JkYfXyT!zsnx}G-H^T#gXgf9gwP)#9 z3!&RVz-&uU@E)Fm@P&o7L%ogivpi94A~Z&zu?naaIwvUj5<=b3q0bD%cAr8hab5j3 zZ%hw|c=?8vvaP7(ZAHjQ_k{@M#!XSQZ^7}TMtQ;IYLT8^75=e2z*7SRN+DT%rAT!B zCZ}=*FD%nOi!ax|)@htODEuP*P~OMTW{WPLDVM=2W$UxmLoVoSF>CiR6^G|cMNew1 zl*odNqEGgp(_R+Z$M7w1nap{2S};wRmPacMje12{1b;FYA7>9Nr%^cJ#sn&%LZR(H z)J&Sk8pw2yb&zAhzNtg9hMgR^{ZEQ1`zi?8wDs0_5dUnDkE+l^kuYEr<<;~XY5Bl% zatO}4FY>mk);?p*YK#7%_}i(dS1dph!M8ph!^3%wF$GOE7 zM%TV!aZ-?VTg>{bIt}-%9IA$RaWS{e+;ZZxGZp0#JMZnWE34LMoam{u}*@y^vlfaYf&r~EXd{`7%@DfE1Kf`S$Um=fA<=sYOO{!|~&H`pGNp z5_E396UE&&jx%y&RI>wY0$ppkl2T_0HLtIrx!YASAc6=49nC=jOF-5r$Lr&-i;NBj z7^jbFjFXr;e3<@e(;y5g@`p6z`^IwWoKD&ML`Jy9eQW>pEvd$d4W(RY+NM5 zVyN=u?<+v?UAt=gmEPVxvg*C1%he8wtJtt#*@u8lJ26$uwj|5rC#;a;rnVGo`Tl+l z{JuQt|I6faL%F>Ax)v@I`pY#o?1;pk9+%(eSz>ZUv9~ zYzo%yqQdSTz{H$In|w>u`r-A<99Rt$Dl;gO>SZSx#u?Z-;oOBZAqC*0-4n+i#_%-BOgs)nY zLHuph@k!}82|u`xG0$Gc#_|bR-H}_dha`_5wk3p9)1)b(if>$+?Yy1D!s0jWF@Ejz zp38IrQc&9)%&x@CA4-FQrOie!aM_D9S4{?3FSd9ioYT@8e*Qc;^95}I zj7+S#i;AER2zLGF0gvKjc{vu)9oJm+!Afze9pL*|@cpqi8j%K1O{QVrrwC0rqQe!~ z#44u-ppx3;J-?CNVwMJni9vYUpv|pbk$9f%p}Ch-yTl;#93lcW3j7<)mHOlkn(}>0 zL{5utFCg2pP|Znl2y%^=kKEmIj|eJ{fE_CLe2KNQa4umXa}T&vI?!lQix@dw6nuI)oYC9PN)Dcxs*t!RqF{HtKH=Qw%yVCT0N*7^D@XkQRPJw zW8o>E`F1cJ{Hy~9rqj`mrw7xc2>da}#(R0w4##9JaM~uyZPRo`z;BKWO9PJS z9KU^u+XZL`hWId`c%nqh)@7_#NYSDSZaf#XHaEMn41|6NBa58ZaKRIFe8f6hdBFUX z^UIEe`0!pbH@GCIbrw7^dmADdRc?PZ%;-C4`(O6NQjabE=LIW_hw#>pQ$~-WZ@u^i^jryS3lR4R95okvGK%Jn) zN(A*<6RL-fbHwWL$qQe(-s5aDyLUfUqL#6x7k0YcBQncUW8_k{+6b>Tz#)%MOrk{0 zIJj?No0)dgg_2{$yvXTYY`t$J^iJ(qO*Vi9t$vdr)1uiG@9|9%4(FD{R|)q)4wr0h zM=L1EJ~eu9YCKu7{*j)fK&_pxs$nk-wb64a>O7_GV%MD<2Rll5+PeYk=}&E!Y>ed>7)Ebqv7O>hrx_3)DIdm5+aRJhJ*E)WR+(*|Hyk6e9pjElv1`rPvalm6+ zdI>O#rm&V#2BW!zlf8ev%Fl?md52eaRdS&>N%v;ap}zW~54FbGUv6QqYJAS?PuCnG z6o!Zmf%8kzjSp290s_EYpMY)BsfF0wk1<(KxVMk<-!65Rryu&TBE$%D*uvuQXRx&M zbA}fBf4CXhZz4WBRap8Ao?cBLxjL+kO^xpZ_Ndu+PV$?%oia1{F&X9$cBXa)mvQ*{ z9X|uUWHowcvOVGKw8647qdOfOth&6C!s_}sMFE&~<_9^8MERgwg)!!T+KvD^+oi&3(X}4Eq$4NQzl)$NlRKJrb`vEJ-+^yA zVz{h#Yd8@;S`auVPr~(CMu)L(GlP7s;WNI?v{@Y|uOF~y+;-A>*p{-8r~W!*_ySH# zxzQSXynHc5QMvW@#Mai~5`?M*1wcrZi;>>yEYXd)6BX!bGw&i4^ANF#2)l{%rd%?k z&g!VDSgB`{FLE+D!bK5fbMzA$tK{hnIm!qS{kBGf4H|x20b2IN@K$=9{ojcM85uw67MY`0BL=Z>tLo1m(39US`?}^K&^lzCdQQHIOdsArDfpt&Z7JOq$oPS;<-uTQKL+o~uzBq8jamzs@PV(Bo~8%m z>?BgfBL@*K4wki#0G;0g5d6pP*hRFdhzm1XH02TwZCVGcD&UnV&&P4|1Xa4QTm|Eh1kK&C4mW%C}P51*WzIAZ=4+vpgxp zR-uDWde&6_nF{}A*S@W%kTvdJ#Ij2L@pf|`s1d22X&H~qN-;tEE|FxJ_ zwY@cTfKngie8mG@(nlI8DeyN4xE_PsHfF1{D5iTT(Vo1q3Dc=apA-)c90S`q8 zQ3|RW2l{E-$XX!u?FiTOLpd`JZ)pryIOs*|&kA1C#$)m3_T&2|z+Sl(JvFS6hn;FF zrN(H$di)D)knus#b0T*)zjp(Z3sHB=_nLA*Nf0~$aa=HW(QUV7ti=tgd(DfWtnkLO z-P_Mesau-q0bkWR z*m}NmA`M^2$GHZqHDMmQboJpCy6vmUP76^hUj14qP=VKG9(;GB3>>G;U#FA^;-p z6$^vsW&3c2MFFs)?%|n+ZeiMbP71z=Mw}J<1o~|x0Fc+NM&{rBC2Lr7572ZjGKmPr z((%%bqZNT0}$)JetVJnJTg+a>Gv<$<`ux24fSi>GO807 zt`JK9RIinwLv&T%x7s9v=L>9DT=3Gk`z^yFt!O-(FH+|tdv8X|w?5+Mmu?GG+QR@N zIoB(Z*tl+Yv1d1pk?^sblMMl4GZ*?AOR^S{o}2^SS4#+PJ9!?wkw}m^2@-D2FH7(S zAa(`#{_p4iE;RT*SzE!zs7^o&z7Bfqn2*c4Jc;M7 z{~%wzzVZ>&&)HvGQKG=SWGdtbk;hBp-9ewhos0jW8+i+Ez%?k|7+(aPC;ncwfJNs5 zIy3JMw8b+9k{M7qPG(^OTf5j$dK9o#Cdcxw+olkuTk`_#dNmoRyIv7ii_QHKz z7`0r!3Hk0ptOBFVj{u6wcNggq+X{2Km0icR@$)~>y9gE&`V1>`>=$qqtFWVBj71h9 z-TW+^GLQ3KPWlJyc~+5PJp&@ff;-vBOM}I=9+q8j&h=DIf@&_D%q2q_Uux66cx`Z8CM1srTHtL z%~&=wtU7D8CRrYwJvLKs=Z`;=@B1oeBSrZ;WUAM!pTeM%;M zya)cE&iY`V;k?<&?XaA8GIyg-4w)YhJpDD8k4omuA!e{79w?X%*Vp>cA?$^H=3=!` zBnCBD63WhNZEo3cQvR$1=cm6{k0|V;;Q{jmLw`AX@rgHQ(Ln<{o}OP+dY3^(;Zu~9 zW#72b9}0@Lk!;K9Hx*a0%jUQsA8Rrotdf!Q&98U#S%^hdEr7mTH#@?alNWnI;Q@cdFsn6NyTRS(z!klrrl96hO)w!Q-~-|8 zjznYM&eBa}1qD7Yop?&Q-P{+a_kN?n5ji|m_ZS4|ipui`b=cGvM~Vq-yd;x53Vppv zgCKgB+W^GYV_u0Ro&{p4FPY=-;E0t`>)*1#2T#OLPd)HF5Vt=IUAb4flh`KgCXX&rKZgTK z9M{ZtsBp4@aGjCwqqpE5!KLS-re>j6x5jFyF*JM7SC-tT;OWj*R+IjXeW|TcytSR* zqV(IKF)Zu-`UhQUg!Wc{m~z^cs-TU|j^bv(=8R%w^53i$$U2dTOyj?c<^;ajkE2u{C_E&Fqxd zrw%&NQaho8i4`LZI0?_@8+0M<2#wNaEGFraNl@^>k@~AN;eh`}(7#;j|8|`7=S9Mf0ydei>nZ&1_sY2zBKOX9QffuY35#F8;;NnVwTlm6{K93Bd zeMctD&3ID`9to9@o-IacT{;^AP?2CQ>HeA;m}d$^r_8>CF0ikrbW-eEG@JQOIpTu{ zmPh=voQeL2ut0~1c)S0bcbBNt_z32)iBoS5T$!wMYkl}gP5%Qsmd9_w7o({^=CM5P z(o}8(HLyy|GN`P&*}P#HmV7mM{ky4WR|;nY5`j^OrvzEm+6$EF{!Caf;Rw;S`XqN} z-YqoHhc1<0Iz@Kxr<)8@Ls*qV4`@|qOd4@31`=fzU@QjB3La0ZzWK{*y{rC-At~uS zbhwj2cO3m>qAc~>cW=S^=02dhIx14m_}GjCVp`;;7UU)t`or(nCQlyd$=%d2mOmlz zH$h>D*M;GuaBuUE6ig3to@_`BVw>>~fY!44XTeOYVrMr0&^XHke^kdLyW(&pxyX5K zFa*!DqU5d!XlAoj#|E7|t~{_vpx^^SbGlTon3w0w9NZjrwgCVsXvB7+{Gs*`6#Vz? z`(21ElZPTxR?|mbYmM7g)rMNinh?eB22s)Nx;!mL=asaictToU?QfO3qXK=m2B=^q z@hziw%Y`_wFX|BbDaOYr+DKTH%qmUfd%88+9wBIMzdqZ6bjoKlV+O*>SB8j#`Ai1T z)J7o^j@apNYA%Es%C(7G* zP19I<5poZO5(n+7N1CMUaT6WWbSurpTOPsFRktJwqRzOLBk!%*GoF1}%YNq!IpRz| zGaQ?p`x;q1Ow$G{ZL1`Q7=eRD79xU+JsHypf^&>!J7b7z)}sAytf3e`LJf^8)<5>y z(gS!@m3I%;-d!|*2TOr;%4(gI+b*33JFr4|T7PKC76KDNSXSIKdK-OioDxg`JwrMw zW0&2GPjeC+0&t_o0}2Z|ya;#}C0m;bAz}ggr~L3dxFzWJSpcyt*Xnk`{FKQvL=HJVl*#A(>S(-el( zRlu9bWKYZAEoU%9+R8#O8j#jHu4to_27cpg@h~hYIsL$OA()ax#NcWa1?B8~TqHmQ zL1xx*4E58M?^ww-G=NI}e#YaGV)*y-|Ca^E<0mv| zcQ3<=B2RkM;9_}?QNiTk&S+s#Ma6Q(k*#5cZAyXDXko9?Vsr-93Inz*u85%R8TU_P zR6X)Z`S-k5YHttsBlS z{QFP%9YFHW(XprB$ekXJ^v@p!4ga1<|M$P*AL4+m|M&AxV&jGRnxpY}OTQc)yrr{+ z+GtUNlMavf`($flqW_GSSYmb_-}c<{|+AJ z^J#65tTI6*dsN@)nMWwMAs;pmFX`+A2{(xZCEv_qReAaBIoO~$>`c(;)U7Fp6{d*mL?prFT&4x?D&}7D}97-+&RF^tk)=GtnT|Z{A_jBj8tbD1rLEUjFceCr@$pY&$>vOlX zl{O5JFM8%zS9yeC!&HaAO=@An0Xp7ol!Wj@h4J^%#CHDvN>ru49bt`cg(?$M2LWxc zWY4|A?c&UezqysSPH*wt`=*fkl+Z-40jj~J4PBYNPDh7TXN7 zFMQ4e$*8iDYo75?>2FJ4xZ-!s-DC7dA&;ZDbA~bMGwcrsc@g~1W@z(BI4^qr(mfvQ zn?e0gy)W3=8Fg6hM<(y+e|4>JI>_|HyO76{YG@dlpN?DQmRPLhtX5E#r|)X|>l|u@ zqJOUMUZG8llF91QfR?vi;%3J}bmjhv=lhWjk%ht->01&~0-uz@W7U+@ZD^BrUn=mo zDvsHh&9j3{l5?h=u`64u%YoXfkvzu3u%Sy~5~*}6SD2a{#oz0j*BZ!jGCb|((D6c? z(4%djMF<{Eh2SUYMe+uOxum4$H@sw|;pAEPbmV;X{yXNMb7RbC4w_6G;pYJfWW-g9 zMtP(HF$JuA%hoF%FMUgjhviH&taYn9Hp4R2)k&S#y54^f!|{SK!PHyd`MuracIRD{ zfbZ0$kBB##B!#JBbE0oK>4$!?4`qolQlRa_!b8M_A)%rc%PlK4MZDy7*RLut#5ZeR`r7nD{R-b9A?diZvSe+vq zlC-YvIWAgEZkI3gfqfNK>*xAi{mO=dAG6JE-G8^fK`u;5Hef~IN8p@>*MhJSHn>0E}?xW4X0I3qCsN_JNa?>!#2KmFOz1c z6KAKrGTm;XzXabwW0*%_x4t}2kq;+5U>0x;rM@d08!TpFKXNw;=||sPXvY*A4eOT4 z%2*V0jw<4yrA}PwlAV=kZ+39%N@bEOR8e=j7<4z^*N|}ntBPkbaSnElKS%6$y^@<+ z!AncfORK`a7UP&Y?e=O^Yns4F&Hy_R=T66h>FTJH-o~7}*SFFWh3pvD?3k*})bT5x zZBY(ZKbi;*G$z6;R`K(we*i4vmYixCb)T=RPgv z;kX>`0Q;@Mu^ngolsQv9Urn{pe9`JXmoGM@+ zV+>;{a`FwyRJYdd?(VHD-bmx@&G=R@AY269nk}GJPc7TD_9Wv_%O)c)bNNJ!K(SZG z*7(?ZHiQ^cjF)wVEF(0uneb|8N_wi}QnPN%$}l}zxV$MfwcXZqpI3LW+ePTaVaPc$ z>WqGu7dGm4S!+GcRi}L#A{n-s7A9Ucd1A}8lo%a7f5IEw7-W=+iWp#yIV=$=hX@Iri| z-u0WoNSNxdtt`S7KPvVCcdZBAPLdboRWRF*Gm9{4jVE{eus72$aN|}Ngp|J?K&w^j z#D?Q^ds2okt9>NDu7Po3?}e+O?F3~9LGI)BW))ZWK$Qu4czD0EhT3MA_q}*J7b;4= zjA2!p(nk`7QCu~zkbR&EFVCCr3>%gFM77Qp^W;+2%BrOUS5)(_#aL* zJD(JCh@GHzQbUmdg+~T`QGjK5Uyk%YZ{2Ul#v^b2mQ*Y;{WGBq5eg;N*1XrZCcdKr zFhh?On8FEqr~|B)BnaUG@+4I~ zcwv(if2vunA7`w>=FajMbEth9phwzZY!1cnne_D3-_eqi$_9+uvdUu6>XQhj2pb zYM5igpt;1V++@G^#kgocC{m<}2uw}NERRdpWtC_qKXP!#!0za7jw$JxpEtP}q}Aoo z+;$<7X$no+m&eaTsQ`b z{rmYJg9?8i|Njy$`JYTI@=?MkiynynNeWc0Jzg5HvG6NfW~z2>y!7zIvtKv5I8HKk z$eQuA`5EP`Q%a;FO6T@$J;++>-Wj@r=MTwhXwJO80_|z7>tL-Yd1dPLHB9FZ@pwTL z)yj25*CdG=9M6rDJdryN!(Q7ah6+l+dBL2a98})hvmCtRuWqbW(>ys(Z1*bc ziVNH*+)MPdj`kHZ=6lvJe&wNOvSr##7`W5kCZ=~f7;UQp9zn7E4g}zCN%r%SJse1C zj+HQ4AKQiCqc5&*b7v_pZQ|e~DJgbhT^^r*JL&OfT@$MsyFiun_bgLs4K{ZXN+>B^ zE=6I&*a#!r6Xzv#MG`+WlUWCWTQUq@`tu}sOy~*25!L+bQLz-)E8o%vr>b2hPD`Ym z^}U$1*c+b&-Iv91Brzp2RC}S5SCe5(>T8lS(=x5m4OGsa4)lQD<}@Me%l|%5!sjt= zlzBn4MTQ6!wZszx`$U>&*0rk$KJ)e?)QF?tn?7K7zd1+T?s%>m`%=*n-AGh#BD z(%*LZnwlEn_1>A;{#W%-wl?10lN;T@FXR+l@d6y&#*!*;*KrB_6!QmQ#w&gFLezHd zK6=7V)Ov0vX+k57%&|x^Xfs4ZHnTX}%iT*45L$zQf>=r6k&BUaG8rHotcf;`pj&>SISvJe`8Yi)&dU>{8YqcRltmFh=v%t4&g(&-%e1H(mlqhm_1*A?C50YdzyX+-FpfHO8lLOls2EX;eTi?V1?)t3)rNK`*BL zHE(s_?d*pge+muD3_72@OW$32d-v?kBmVGpYW>HUdkNkZfhWu>u(J>6*X<2ej_o@+ zR;~Tn_mMk)%3vtVehKJa4O3hBG!;&Vn!2X5b}-ex2^dS*6Z&JPc0yhIDe4@L+xvnw z3uPfQ^1AOr7nwIUw#`xJ5T~!o{#xGdDBG`XUt21G33TKxwtw8Nq0N-Fyq+vhv**}t zgjXHYain|u5-sbQF7`TYC$!sq@FpTXBSO;u^~az3W4>&u3mtb*Q`gC!tJ;rYW{vPk zEhhObVz}>La5)&4w|f84=15{zlcbfD?@wmL?xUAo21HDy-}P|FHme3){c&JR;WL7a zCU+w;B6bhm6J2iYf)e$Nq~MRo5Eax#atidV%i|X1A{VOf`7QOE7#y@gZ1B3$Y7v4W zn2V(~)V;K-rPeR)?vmCp+KY7<6`YU>yjsbQ2!&{7r=fCkHqX$6W0pZWL8<7Y7fEN~ zWh(?I9V`W(Jz;8fOPY&UtJZjhOy%n_y9YN8-l&+U8Ft z^ZI1jZdgEf-}VJw_Rqb|i}Mky(ZRfqaH9a(pcTb|v6M-Md}x2FMAt)aQvEA8uHlia zbf4oE8dEYU64-895OU%l$f23GR<$S*vA%|)IlD(fC>6QC_icUERHb6R|9c=&`%vWm zIxY&u{b6y?NGEw^Y-M0wccG9^Upg$Ry#8jjt|15C#7p*qg8DXnU4kj1&6-|uIfR|0RZE+%O>;yrFi;)z@25X{tRhj8lwZTl^O?<1D)zg<20OMzO(4LF8z=`&o&_--gwVE&5k7P+DWR-)VWd3LbpB5%~St7&+5}&}AMc+T`MI z4RT8ArYR{lEvdTQ2WS6~NS)Un`r3+jH=?99s+x6!F}jIQONW_At%WeHC)oFRe0Ce6 zLG=>hX+t6cE5IL_>hTY=a1h+5{jzK3D%WWCuxbetE8nJ^W=^fTf@z_WGWWd=)zQ)X z!P>_PnNx*PfAWp#00K)kwO;Pcz}0wBpK#BVeeSh-A(t7`hsNjd!r|d>heT@G#=BeO zONc&3@~Ay$q+{gdF$@&Vkh?(Q2T+{1y1T?dJrE`DO#WS6#bRza>@QCKWo#=B(eK9Y zIy_%ehn3>tbW5L@$y#$*D_DwK-o+r>{) zh4P(M2SD`5N(J(+viv0#9bRSY04xYy=rba1G*xY*9s8&5tw0_bav})XD$z$TR-;_j-W1$k871Q|q$~Mm2Fz-jaDw3>W)q%r~Mxf$~ zcfY>5vpvS;ZnSrBK5bRwe5E=Tk)qhwd#kmrg^`{*H;6!`MUnmE0D}rq zLE#`#GtgWklY@~c98BYv=QJbdH zYx}7$(tKa9-XObnL!q90eRq9%gry@z(I!+&HP?D*5Fn_!xtqCLRvgSV@&`DJF~3Gr zE?d5VAuOJ8p$x#r`*52e+-vOmbI)LmQ+ldyJlgLbXArH z+J;c8Z`{t+<|4!47GncltHzoY`+ISZbtxemPYm`Nut)T-+J;yq#?sc(pc1_X* zZ4dSN)YPw{ZE^RU3>K6;{nfxa?VmyJb#^#^dO z7d?>=7TMw6GQ%rRjl!RK`z2;(ss%dD;RlX5j>m=Gju|f*KN#f=AnE-HpC&X)G75R7 zq>{7JP-!E!gAj#Qzv;0#&zh@bwAvoll(?R(O&=DF@$nvpln9w+t~$`l`oM*JfA%{s zi=2xWdR|{ra|md;vdClv#&o99b*h9>8=_g1xk_A;F|aJqE}$IBxh<4710HmUpj>L5 zM=-pN`CSYenq^869A5DCPwNLdGlxkn$*?E*p=v9yH*5QPUoYkY6kl$CLcX&hFF-at z`9}nEBYVJD#^q=Nlbl|z>EJvn6u3U-y(B6P?vC>K(!!aem|lOEBbB73Zw1fjs2E(9 zJyxsC2jHy9k5TO;`-7}ntH%S|zUObV`W9@!pNdyUl#BVks5ws8o2@v_5+ohQZ9M}@ zXO>3Ivua~2?9ew}4b>iOi8k?yZD&Vi!dX(qw?VqT;BV`OQ_-RQ}FdWl2mWL`m2?$1;m2W<4j7&QVre zlB&`>BW4v86YTvM?N1G8%3Rlt04B!^p$_4s=-cO@ohI681;60go(&Y!(tw>CeQrL> zx0r6iEE87#mfoW%AHqmYWTAQP_VA8;y{7860FViZ@oCP(4umvZ1Y_VC(s5zV1RiItxs4v)0K4}ULzNb_lCh^Na;ftdl=1&I1S zDF*D$x50NP3{A~#_If*riF!PDZZ$OFYOMS2x()`&t5cW$4o@{Q(p0NZx2|OZzGZZ* zP!j@P;)>EgYDQ8}#$0tqMxknH=Z34#eb|CIb*uaq1oL8#n;SJN?L46lXkll2!Ruxw zs+8ynWvD1}$=7Tvvou3GTql!0MVv8`RH^3LFj!qixmw44d%jO*J6ZZJ{q14!L9N#M#jCPLc@=r{VhDqQN&9@OKt>ge(tVzvUV_>)iq!xI>)jqbZn5sTq@1Uu zOv=a9*O(9r1Zhx%T~)iYev;EUjAV2GP4m@Fl(D#7f89I0_T3SZbeYXS;oa2ZcclQrpjFCWdQK&&6EAf)tZ# z0j3sHOk17flCUw6dRn4_6vK3ACIoD93MdDL(Wp*bGzYpLa@a-B|I}S~waRnJx)luO;MowIJC`%kc`; zPc>UcxRBYaN0&iOr13_SW~L7p_XDY$+ZCWOeg`Wx6km|7Nh=4LFt-T{6vUvA%?VsG z_li5HOp&(T3*2c3$mX!eCeM%t zu?`5gas1O-;q`6oqeeeuK6HLv!PaT=;N~{}($}YGZr7`rS6P%&6lep}U!Y>~HAz0i zq>E*u+Q!>0B2nXC6NgUE+Dv94K0?wK&A<*a^AvxO6}!>6Z*;?Wizw>3RzMIChSZl= zlh&w>A7Hwb!O68K)c8ZtwmkJ1091Rs%P7}FNOj2|{p;89HB{i7PnwON=^gZU{!6Y` zF$68_nLNZ^cw9i)!LhDjiFucA+8OjCWRa4F@u781&u2tncEjBAGJ)~X@OtKQ=ynkM z6%>9V)ez1a#eYo^Rwe)W9fifXhfgM>7}uTTULKqO2Jw4>}02x++8-r`+em9I_Vo11bgM!k1qO zX4x^qyV>Pc?a$vy1L4CjP|^OAA7WgT;K22}@j5)w=gp&m4SBI#hOpaQWT&1184D1q znd2sapq-tVDDslt^H9xjG3e*&ATYn873DG$`xIuEiR9fde%M&TXEBV~+&!OF871rE z`TpbNFuVOnZXq*0D4^XRrv-EmRM&Fz1Bwm;AGUmrP*5+tGG$W~QawFKI?Ht9VTx&q zjN`;HyjLs1y15#54P;*p3qA-1iH3QEU}T~ml42O*W%;cH!@n<->-OH}PZtJv}|_>;NSImb@uhdMWV&AWF;Ia)|dJ5}59l?D*i8 zIP;*ks zxg95RQ~7w-GYcXGM$J-xrQH^WU2_2iRB=memsaI13lPG|t5l8hq8h90DGruEkPOjJ~kq8ZVy?S7fe3^B(u_b$`%qKeO*+5=W3 zvU;#hh8%jwnfYF-d7D~XFf4G~8E3|G+|nr5ZKdMjm<=W@dmeY~%|kpVDw$;gwx8{7 zADvLuZm75{nxUUe@(qkx~BD5q2fT8MrsS(E$7N2=EQzYEQ_^&4|^ym7M!8L=Yi zaaPh$uS>pj7c%v5yIDys1oD2h>dZA+3>*#zZRNA>mw=WE zvT$dCa$>*vmRm_~O)%ha`I1@6L;E?$^HKc2o?qEw|LN|&SYUIMjc2^&Wc@S4|6?&b zAb3efRngH}fUw2G>Q8lT3>ir1`Iu%QVuEN+={aNIT3`0pLM7`nuq7?~1iGv}^3Ppe zqo(=%{79>nia`A6nb%LhckdD+f~q7)_2Di^>n^t#!+bORAU7_Zy=QD`v~uQGbhlq% z38hH9m3pgK+TwM*zAT$Epvdl>dAG19&+y}(+IulH3{>OK?!U7zACi7IWDCUbbZ-+s z6K{xO02LYwm;OE*?|nA)?oKEEU2#XvkKdB$ng@Rz^pcHIl|H%)m6ANy&!2IfYDe0X z?7C8Yj3NBqHG41UTaz_Vx+ zqP117GD84yJ8AOARW6&?$Kk7WyK@KaYO6pt#3!IoZPRI8t1h<3A(Nh?Be{-0Ixy8k z2vI?`5K_`j{)D=^+~+D#Xw^Pz7Sm5rO@Rh$ku?;YHMz;y-cM!nXBtizFl?I(%{2LN z$CTfj*tQbR=~Zwowc2b?{#YrnJ%MnmvnW&~bUPf$B`)e5ZGZ=AHs#r=9GUxNMB)gGzu&{d@gAG|F_v6`8ZDR%D$SoE(9}21tQ|{LPmTOdbxtL z1=KdsC#1n~A-xq7tQDe0Cj!rLOCwNiB23q~Q~JmdAXDW?9x}*Q_q_ZOP9O2-mz`D2 z40;L`%Qf%7O@3Go&K^{?H;}R_(zBY+tPH@ngF-#8?_@AyxMgpB&$svFdENk$y|Z&8 zEEYesPh7S$Ux`-u&k>>o`N}Ki#TbjvpiKSZ?nh3SIrA6|;9Nwx1%<3m-}-rz$My~# z1C<&iAb912Dqo7sMhKPWt$<&e)|XMSnT+@ZOOgV2kdOeR$O(EHV?h|7lJ5HMPt|V1 z)O3gPR3a2i{PJrp>v*F`c{O|{t;^RG1J!+LXbnVqB+olKk@!(ibW8nKGZf15-x5ZQ z+fi=y@@YNb*~xO)D&hFliWHftv0WVvKn0XONR`Pj9rz+x3d)KUqIHOPM5USA2~dJb zaw*p%M6-Zx)!;ku#l}DlS9|(@oZE;ddJRs&~_O=eeeEue-`2gQ!J zP{quk?f5K&8zL!HSB4LgbX@ZJZgmc|m+;U8%^0((0A3lS$&f0t8~?y`8#)bXAS1Fk zK$Ix+ZL}kt5i|u93a94OkOjJ?OZ+<_SNplJpA7~`LMXT7zlI{X%WMMUYZm#T6L@`K zo`VnB8^{{+5fnnWX}*J1Bs@5M;4XCK(?7+&xhwU3ti^@p?gMc+9~nZbnZL#?Ff*uc z24u^Sf6?zg@Pa}^p@xZ10}V)2bpBU*?WqY&^Y8PDPJ=4ACN}4M(ek0cg`F=%CU6Vk zKewPRdYskFV1@Y;|-)8BBt1JrGH<8>obHwN73_0>jthFRqg!O!U%&& z_S|^3!#y)Rh}FQai*q^`!@oZ6R>wXyNeKVv70&)At6*@`EO!2k^d(fa)PEl1Q<*XN zalRYrkB~6-e-du)nq1lGwg3CZ_;4aT{2AUc4+5(v;tN#JN1)bt|4mhTtM60Me0e$2 z*-@ybe?6kr-caN9yK}&PAeVE%bPVs1EDFk z1mX%rQbMu)1nN$hicL25J2m<{Hn#v-_^H16bBb;<^<2{B-+j0NZjm=}%rTMsyuAfZ z+g#8q!3gY*?;u~1JZi&vX{mIMMCVq47RVV(mc+l?`6jd(14V)^9)Oe+*a`aqld6)s%JT_OnGV zYNo4sR9xri2vL;lJ@cUMAYnIru39K(9UFomEOKOR)FIa<^f=+&4`9v#_cPFB7J$Y& z-`I7IYK}PcHX38i`jDi?0cuV53sj`HH1Ytq_XdRcgB2ol9R%B5$%<;=1Eo+?OQhjq zq=#wxv$elTQlFuSa&^YHo`q2cJgBp1=|X{D=2S>ov`o1Om9w*u-ABClC{F9geVXxj z3lC>ADzbKO19`#*oGwV7007KuqrB;q+_GLg@^=9gq4d6Jb&yxMj!q9V`d%kKZ>bdy z1n+9dGoM(S_xCd*k|TU#@6_2!%l#T&1aD^e*)JdvLWH#!0bA1oLxj@$k%)kWAbl{D zVynMTfGiHYs|Rlh??}vrkG~uoK;uNl8bJrma&1fN2c9EHnaM_r%bSC`A)?$ZVf-u* z%xz*I`_YGUvG&hFoRFlHrd8!s+V~uwG@dsjobBkK{}SZ*z8*G74{J2fKE~Z`FB5iP zfFZ;BNQPyyJIvOnE}Ta9r+FTIpTA6jo~V2K!KL{tKR)$QeI|525j_1%RZNpYKk7z? zlal+-Plxl_x9qJr3o8q*pD&o->u$A!{==&Ze0T0E9HR=Z6Eb9Gbh~QdiA>{7C6p z;G}AGoY;|Ax*+xg3TPfv^z}wHuhJdC*tq4=^oZT^7Uc|2r}54@R1hskdShwT@nV{W zKvjvww0ER&2eOq0N|p)?$K6H+!HSCULQ4iWdk&cz6U>%-)l~A{Krm9syZ##@_o|Bd z`t-NFee~U9^>!~;rvOKROSD+e+w@6>5@?k#pGUyn8S48znK2nXEXTHjk48zdax^}J zT-e2oRstok#ME#=Z)ZG5XvjwCm&T7cb(mLG!adz3_C~{j3Y<+=*`F^j08Mi(S`!l( zUP%dooZY3A$lo;pik_AX1QRRv^vwEVsh9jjgDFC+u{20|Y7&u|5b6;RKcTd6$Jk|s z{6s6ONA&FZlFAFHaWd=CL4cQJEls$j@p5V1_mK!)H2iH@kwGwiANtPS)EDG;;r3d> zyjDG<*TJF*%*1}j+r#;+3(k61ZZQ{}fDGT3_%){AZpYg6l|@`hdScBBHU9HaqdE`H z-#i);tEH$dSRor~itXZA`0kO{s{k@uNRy-|Z+MopKFbZ8(d{yN^TpG6Yi~AVH|c9K z_}jQ_`O^^HjyY6Wg;Y*aY(I%|rU^@#@o9;Am16pC@A*F@@BHdQCZwF|sJ8r!NPiRk za;t|hG4vUI`L9me2ch25vR4XJM|de(f*)_m8NKy$LClu22L8pp6~C_wYtUmvODqSp zN{!Qs<+fwLUN-|_iA&(*-X(ty((OUkG8Snc;O?sGWy1NNyU$_iiZ?f|9MtfFS6!#F zv_-kHy?>JM(C8pV8#-$2)0r!z2V1SDQ=woYI7~T7dA@{4+j8-2%Bgt&ARl|2aB2H8 z2w99Yj4!~3ed*d$Y%O1o zj>RBneG^ZR**De&?6G(dXt_Nw!d`WDZruRomD`2}1XrTRKE1a_%VyR_XRA(lxpTU- z#7298sYqt*7WzU*cU(5%xm%b)M@?t5@D_}KRF=6iQ#!7o2nA}n+PlVlw|YNn%yJ{D zRCb&eut+oAYnPNsoGN5d%;{tr>oO=(>jfjNpxeS=_{rhg^v%UeyLGV854}$~;3OB= zYgkj8{ZKAdQ)WyJn58X-u*zlWQHXD-nw+Uh@$rG#?vlOP!Z2WKMol!Y5&$s)2InIK z+pkDGrEMU50qLNUFMrJgPDJJew={5cr937oc8PZokuq6s7H~Nlwu|w`GRGu#AOe*m ze~~I&Ig+l0e79~B%%s-{Q2w7CXv}`5$*^{uMcMt0zrJ~bAB0327XxJo9N-z6iHM8_~M67rLsfr09+PG#W^F>PDK+D(Chu_kk9S!C9oU7>=nz zjLZSpf5U@so?k#rg1D%75d4II84>*ejy~UxjuBC&_A4kg1OqR8xBdNpG4&NtQEuPc zg9=!HNJ*O@t+b?yh)5|ZEg;?9;YCD2KoJB<$)S<%66x;l?rw(p_8`Ci`ds%eyz4UW zocF{&dq2;!_im#E)(i}GJ_yP|^oa2$#vQ;;!{R#`kYX(AgI=RnX-@=q_)1r#>NBO| z);hRPrC){Oi4kZpgG^u}wbN&l7C+txZjZq*yLmOOa&Uw^rp}TQZebkAbBF*rmDeZL z@6{QQT|iKX7E}^NmO7lkcAxhdd-V0EhFLo3`R-ykV$c&sBD-;AO{LLlgGM8q-}w;#FHu*DA!rn5RCodg~_x!61)EC2XH zf74o&zTa|JmPVwd`1`tOb7>H8g55@W^VbSvazf%&Cm_S2>eN+E@_wx82?H|&NwRre z@)W-e(p1RpLF!G-1X<|wQ#g@DHd%c~6p59h4gDYgqqb5MPc0n24PYY3KY?C+y>^H1 zf?3k1JzRu^+}Xsp8`}c=Q0NJ9DF}@DrD1myR2OgkArb3-5%xPznq543>TJD(lSUf{vb#d8xAf5p8rzg8SfJX+q@P%j9YAR z`P4mqENDg1$~l6v9*=c@BWkm${hMF8boPrcW{0WZu4f4w@L6sSO^m!6UR zCY{dnb$zF`&lLi_$VXp;-41M;;X*qUdb&r-g66l>b8(30IQ_y((=$K(ejpI2Q!AJb zH#-B(b!z#qfO!K<4s6<*ptDiiPdU6$ZH<_%ULo$qU2upT40*9JH53qLz~*3nKGuS> zAv9Dpv%}TYMl$REXz5a9h_&!gR7=~49IoE;igJ4?%W_ZZ^|Ud`Ym+pfJRN9d0u|i3-FN@UfW|}B-_YHcz3Ii z+mwgH>3a)#Ds@84nCD=^M$AuyZhx5F{(`x%P*|knK{V(otP7-U#-~CQgUp58EJnVe zCh3i%iM<*0Wp6J-^sHpn}Aj_b{R zQU&HZlRw)W^$o?aU>v@`#5E z<*1)*ZJ;b+CL%@$wJn6_&qU(^5%eq=X_)UV!i_ zgauP}5HWoHUkvB*%!GUBNZ540&!;Ve!^s8EaoY5Z)d0uM$%7C@R}|_bC~QzgjI+0A zJU?=*9L)xPPw*8?ScfP88;SXO)AzVDaDcX=Y-0Xo$wemAef;kzKye;$+}K>uHA*FJ zRvWx>;M!3;ZGj-KJ*g){jTQ63|C>w(ApPgrXv>0CWo=OA;hpA5t*Xw|VsMa^vvpe} zQp@dTYV_D34~#j2*IE)u!>aM`^Z(lyRj^Gp)DC9c`_MqJs-yW`bBh~LABWemVAl$- zSH%W(8RB0~^WI;tCqN2!^4)F(t{*dke-sbAg6#Vulf}*hpmtS4%**4%#vs3F$-OO6 z2Uowe;&;8a-7|I6RY=ro5zhf3O@=1t>G*lhHiH)AQMj-1v*}N(r%mkv8ohluw%*|1 z;*N4L1YR<(Yf&st5p6qd>P~GL9u{tZSwjz^vs3yhYhk}?VXf>n2&<;{?7#S%f>bKf ze4pKRs5+V@e`KB_AAfFb>S*jUhnVg1>g3Gnr{~T=4WM3`QT2MCvAngoT};`ZHJ?=IkeqW z(JXrFIL}!JdOQ7uomKmr?^< z%Hu25dgpVU)_WaLI>RG?{}frpV7_fU>kI%;(+AlHjwGi7V-NUieTT9D{_cqF@?@mC zf%+3Nt6;1%{AE&`R0`BZW3U$*dF3pu&p zOk@}c0zu;s0NvBf9te=DRi|dsJ3eLn7FkQj$dogG44tcD*j6D|f+CpX=k&L%>C2B^ zLbYNn;UT2Lkg>WmcSY{IrVSB4iB#{SqpK%-`{H~I1ru2G8{e!bN5vWi39L4QH%a7^ z<;zPyS)7Y3P)t`GT6Dia^6S|#*9Rm9aC>k-0kQ-Uy-Zy{w_`FA?qIczl-;ypQ!b?AJYbpk` z)$9ipY>FhGGxn(?3wo96xMIhN={&#vGWmfL!e#J3FnMZ{21Jmh zkarR96hBe0IR7vW3QIXer5k#anQM%U)5`cr7+il_+^ZBY7h$}9r_W0x6$OzC26vO> zoXApnabOrmkiOG-Te6t!o6@z`J3z6IUtQMs#7w5XxQ{UlI17R^62+2#<`_GPsi>*w ziqEZz4~{*96}-kBZVJ9!NTXX>vq@2&RV)2kH}_<(q7Fa3`dlhxh2gnPQ(^?Fy%ngj zwCN73(S~ytc$b887fbUZV|BnA{QQCTuT$;4PtqPkf$Qp5EUsS~8^uBb4xsb!4Dtr%|jhZ%qg7&t_Y15Do;s;0PzG zq?fniaRD`)msngy;6|-=@*W+@yVayD11J~o)CLyz=PSM!D|QDupV}DT8ksX_*!g07 z2VV3`iG*)(tje?J>&p2&lw&q3jjB%cv1;?4d)t(0&Mr6nbN}L&a|L2;Ye*;^I#gpf)kjEj>CJ7B3(!p7?l_-=^=RID&P-;eNu7hgFPlC$~E zLY^H!I}v8B?O9asabhto$W}r(3Ot^zzVg&LUVVXjQKNJ*QqO$WI5@aZ*)(y|gN9pwm z2ITm|tpH#vX3XvZ(Zqx|y7zG}3`+tZ+Ql<=55OYXWFTyf?PY*R#Y8fY5^4MS+vJBR zxRM4$YBAqlQn7Z8_34$pUf~!)@BPa27}f;1!UVb5%N33q@eKPYLxKkM`?-ejwdLq` z4HHlBEZX*uO8)-!ZSkOYaOvI$)$u7WQacD?LVHNGKxnY#K{S9TfFKrb_GHSs8%-OA z0Yvi!zr1Sax@N=!$Bw^0fgdxgOjm^@iWD)i zVeUdxePF)hw|ZG4H`~qE9GO2<1gsr((d_PRkc49uAa^#M_GAbe?S$V}zK->*CPgn) zF?nA<7geolgBVr=N^NH=D!SC>1mL1uSim)by^s6Ea>LxOPoJRK+3r9e=rz*oGD$l<&=umW-{%_2l_~S|l7wQF8g? z!A`1`bk0!U@yUNNia1kI}N*ZUaMdvHK5s&WO z{iW+L?c7CUL^L3Y87DxgeJ##zgU(m%bR&pI&hg5w{rK!lFMMNpj*aiaHE^gSAQQMd zAmDf_T`F~SC_m#@TDNYKDb00m>-MChBm8e@sum`|m|**K3&)I5E-4mTIZHs|##mWf zb#d<6+GLWw~zsdnjQfjPi+USQ*!KtZh~+LLUzMu z*+0kU>uigv@VMNYlJ>}Z%bR}hsM?-EW0nR8|!$i_3o`SXIry z?*n-==x?jiIVWC1o-YsLdj8~pY+Sz1zh_X48&`F~o2`G;$Z1ddHW z0EMuAeSefpR7C_@k4HH;&a}Z`U85|ymAI1O9&af%8LT#+fAQ& zn>n{djfUCr-VSY?oR6hlp7P>gDm?3 zjB*12&E+=9F_+_4Mu(s84CqH@fssPsHkJn2kCkLn@kiVCpq&jlXjmg&zy=uJV^BJE5oc#XD`{OLEiBB_u2hHp(Z~zq(K*XmN{CV^6fKZz-zJ zPnB5o@w14V^`qfG1YhE^U|$~L7yr)Lutu;-V66HwY)4RBqfOX_lYY*n!dxP3I->2s ztwM{?r3qV2>rI_mHJ_b?puL{XVvL}&p;+52v68}K1d3XS^TB;S&NNN6NsoR1DW`2y zN|LGJT~}of6+z=|uDyU86%TjXGn$EM*%L$GDAni%S z7qBwQ^Vk%v%J-JXU3kYcj;{5_L$j%k>JoOjJw2p82_G7ppzu>gBin7>c#*9ip4a&Z zq?Y+&C1lK6Jp9CF`t zI=eQlnrsHyBlEM1CkBGU87pO|GcMs1Ts9-5dHA4QPWCAhUdKd0b$PJZw6E8cmd1L; z%lo;tU+Z{ov7W)(udW3Ql*W<`1LV%xo%qx5pp;k0Qm(F(sUOEnvdiLxi5<@_V2gQu zurnVqd;4^*>T{%^6Rq zVPQYWl_T~jebxQp#h;3CGb#SVh1%e7Sprq{JgQIJP>c1COvUODgSc!#za4>J7_VvN z??h=I%3q4s5_iHy^)qIg*hLn~4YX?afEjKn_bI^anm z#?-=ZGT-MF_!OHcbx!wSFG2A@)Zjl+WKxsz-Xkmxo$3wGJ=d*oy{|^bbG{!Qo2K;Z z6g~3a-pMpJhfToWd2SqgH?r~Arn*s>fS%tzHg0f}sgd>g_vE;Sc;KXtiU6o&cG_R(#u&1579 z3uLu^c3t_Fi(Zvu#}oK<6y_`I$lB7g)U1Bwx3cJ{iat|!ambIaH^|7!%$(ICv^I-g zXjR_EDtf5OZ11{r!k_AvRk%SjJji~fRmNe>>--~nukBHJCj5Ic2lG9?UA2YEP|Is^ zllEk5>FKR9u!Q@>K4I&kZOoC;5s|mJMYMDe)HN$IdH76g2p_jXv!2!CO?5rX3y4aQ zvi+gGwY0;84JcT#s(hqnsgU66ik;M>Ikshx^YwSr+GU5#0>zWu*?G4ta>mr1z2>9e zn1aDyni`pT(etrvAK1R^%_J&F?3#cN0fFh#>+TP2%J$2ZlOy4x$gg+BUkcjKqPQxc zcx0itUe&>#BAO0U(#jya552#UC!u^UF^at`=P#&C0k5ENDn%Pje<2{wUXuRk^=?>5u%dbQEjo;a`0^yOQ^nG^8R|E z87K9{B90?#=~W@e+dISLwALfbOliQcvMhdnvv~-{**>FtbD^%C0DaZ3KMAQHw z^-m{^kqxmwhrPL)wes}5r;+)FTuNBClEvfk;S$=SVzIG98C{au^heq5VznEnNAy>i znv8`LUfmz$@?9XL2Y}-(VzO8jGAUBV~W8QUivh%^qF>JOAfro=^ClzYm7` zeErvX#!OWAy7!lquit>>5xsBpr@*9*mzD3SIzNXjgV7)R<$B2k5F&VpIk>l&N1MIT znrcN2+9&1QPS7DAiANv`@Lc+7c%K4GU@G1 z%yfvmX2i8FE0?wtrM-FnB$2s9MFp&%{kH7swYMD{>-p^J*8~n@BgvDYIu1mXVT`^kCtka`!R29iOmU z`J`N#i=+CjrX1nkqH3V#OPg+LNhMqEZ|@$^&AGfKG*q|=+v*P2t+?V{ir%cDuYXzd zua2cBWH8!2t&P&lq=-u#?)asu zc7M5yk0*bm6#m7Jie#F0eKTlitz5ggCYeGaSAjMIg@O%wHIa_3L0L69W3kVb-+iP2 zb^;vyNR?c(A?8F=d7Bcw7SHaJz`Nu|k|a**uN6e?wA}2pq6V}bZ5JcuId9>z3m9^R zO6vPu;pa5J$M-^={9q2s3qE#=qLPCdb-;!5&!St**g;6~DzQtp`@`COBxa4jMDn`t zMr8^=2s1Vjel|tho;>>dZm{e?o^AN~N6I05MlZBO_RPzKH_%OY^?Y?ld-Kq!t+~r( zt^WOf_ml23CEbVRapQiR?l!r|5b!1PZuM(}b*XGYLuhk?Wrb32cnE?G5Bu?4ymHY* zeeJ;%V3*(kn#rc5`g{)q8-PGiyo%`?dAK*SN%w;U2A^<@j`@)XO#9f|*Bo$TOURjp z58JQTV1_hgY#x8I`-zCZ=ZG zI5lQxa|)q@@2kW;vAIy`YEwE6%C}T{w|z!r(ywGOb)$~Pa?49s?9I~3?!8(;uZJ4b zP&%u(qub#4%wed{Ec)>bY@24F*Q+OIVfvtg*Qw2pD%H@9UxgTx7 z<;2gI7p{^J_Q>jw+*Bq3-c>983Jx?qeE+i`wMD7bssWgB zA@pPZ>5GKYp|_Sr71B<|$uT)L@vb=33r#m($~V0oN9h7&huoJkCdanxRmMY#Av%bXYY!@>gIazSN?su{e-5a-@;(wNU+h z&ria^WkU&U_E1QSCEy*=H+W|JW8#h#BG9LhC+<`{%o_sXqGV#X&_a;okYc8aq zsGHk!q>l2?F1E1Y%+rsPvsKpK8k5yL=XSQ}{!o%x*tqcl^FhSK{nNs79&3ktZDWRb zJ$AIC^}{(*v9gT%{#3%rZIuDNENHhq(z1^67sh3SwZadqj(1SrDGH3pzZeP!aZ&7S zdgZO`YNNg7s0?G|eBbDMeY=~i@T@zWXB5?TNv>irdlqcmR-;6?jf0Ir{|@ToD7VA2 z0B%d^)9QqXujhSE`Hb+5s0}|#U zxqi0btx}Q3V+{A*tfu}|*P~k7SB%8cZKp%}zlZtaM>dRF9Dnunv$0ux(J~lxxu)`i z^m!sa@xXWN;ayv;vryC(uSZ2BuZNNA$|b+6_@9k?OVx93ke#j(qW-ezsQ_(Vls4mF z#3+xi{{`|#2BT4LqGED!U9D|^t}OUQU~bi4cECA=KN$&J^5HB$230RJH7U^!ti8>F zRjc;o#OFRGDLh!trkkgW5)ZA$E|YLPG%%LQz;Dcqmnmyl(rQMYcq(A?_`98hdER)< zm)S7qil0RD$c!9U!%e$7%C$bBj*aJ-|B3jGedpgM;wNw6!uU0ZI=IdS5=mu(sSnoH zf11<{(T4T+{NFF1z06ZEL%sjC^+G)taanW)LGti7%i)dP9>yM+9RGsTDg3{I7J$b@ z;Ih|{jVie(F3U(K^o?<8r=^vp>7SRJw3(2CRwQ~0tJu zA+>fFm-2L0EA7tCigWW&@$S@)d-rHyf2{3_cTqx(|DKgj=kKo`kL!m1{qFO#-<3#v zRE#dtB<&suz1EezTRj|j8`t@Ds(gT7_x(A}#kIh9} zwq_FW?QEKU5w3*Q@b-TiVOCtKo$^+sd71wvJ(m6S)5C4xpkV%Z#7UDzROqah^w8;` zkc(fsIe!{Mti=3+!}*WA>TVi0IRu@4TwJit8cgu_%i?C>AN`GKRXlyFKrbHTu$u76?9R^FmKThI5<6{vGTl}T5YLv zYX&5Qw#oWTsXM6w%R^yyHu`#tKLc+=a~%eqr`1DZ1)l;8328@ST_t^YJ6I;eYMyz2 z=wX%ZebYR{XR4(u>ZGx{VU7Hr!x5OnvHjdLT6U*b%6^Q?!KB#CrcXxUXrz~(TtQDSu6O+8D9aDrS$C_H`xRCCLt;Fc zIid-<6-kd$j5Aen{S4NVgXDg0<)m&OHXr^heQC+(hzsuHT z2=B5(a25aJ@nMu0cqVn_>mFk3-)F=Eq63@6V8*Wnm?x~WOgy0|>$u4$s{SqPS_dIw z@AEjedCvN;w;hB6A1k6&rf8vHa^0u)`i%qGbtWx8~TwrPbIy{kETr+!^ap{UFNhW?`3^zk$Ddu0BGb0_!o?h1$8XDTn373z)#%Abh22$)BZMn_v-Bfn((c}# z90a*gs5c~ca(wjB(hr_&5vY(7$zmECyE6Y`iuU*Xd-vX-4*9=gmuGZ^kAq6fstola zlblV4V{xO5hzw<{Ds$?$RPlJ|z>qw~$K1@hmjn1LPtw3OCZf9bMnCvYr7w00>P}(P zkY4(tUwT!-dWlisbJA*}B!v%>XhH~zW{F8YNn>#`v#{-b6V>F@cx6I*T}594Adp16 zc=`K66-yJN?zHy~M*Q(InU7+gW*QqAOWB%6zmFb0xOQiA;?80~1}U@}sef=f17A_T z$%rU}$1Y+Wgo`hI){@eAyvWAW4{K~;v9#Sby9JnUXN*2IFlev*&>DNkArNbYpD#N$ z%J=G*wYz*ztKU&xO=@3SJzPXFir7w-hSGDrE`^1qgr!1F zr1jX*T%cn{h5;k7&j3-PtM!_WJm&;|;PhTmSF)(FqdzT}Y>&)uBRkBM2{?51tH-ZC zBGWvU>etO*&EmXH&5;T`URC~<(_ZzRRyveU{~MCL2v78k&@t>(0!~%&Lg&x-oPd*Oi^@0eYh&Oy8OW)c8S=JUHfqXZ zOxTR$r-=|U*{)%+=E*Ey=qk9(*l5yhSit?QgDJ|vQa1WY#_Gkd;jHO{+a_HaHa-KM4|ZezChVzi|-Fdoa{}Z<|mA;SaoeR%MzM)j*KX& zkzBt9y-B=_<{DG~{KpBEnFC~F91OOhwLL2XALnx7d$ne-(g-FdN2diI?p3OBWJZPM z3vbpC;aBNV&U<%w2ue5qhT>WDtlmO&kbA8^#7erhn5I;#XI+LkCz6+p^o_QU2rj@#X)a0@l7Mbiiv5B zI~MR`k+^p@6K!%}6H(U3@({AkjWX5I{mmtgjD0BMUn0bK7v_B29W3}A-}3uihNi>9 zNii|C;01W$;BZ;V`~LnkM(cV~T#lx^ubkK=jhf!M=bX>YWhw`8ExKs+$2|f;B6ag# zwMu)*1)gVga!W@H3T&G0C8uF(B^t1$wo8{Ts_j<_Q&xPMqCuA}M6p__3tzP;MvvO? z+`(VrNRh|{7Y59cWU@j^=Bi_m(RWuGDy|9bqNl$A9GiB};{-ol$zJ&O&?T!0<5@F} zJg$|bl_T6F${We#NxKz^_MHj%3uJv-FmE`yGNtS5YRV1q1e&Aa!K2+tQav$_sWSl; z>;3&ph2gkDPz$pqdgGbz?~5Hz;@xG6KWkxptFHvCEtO>VxXpKt;?RbaBzG7ed#IqQ z()Y&L4GNPG9{dMK$(qsJsQjusqPQDxW&Fc84|5mXUIx$K+`LY5{Sf7ugG*;~o%*jF z1F=sVvaQ&9e!gjKkzL7d@dR}~2Spi1DQ5L;$m?7r-!NcftJCUI^?W9vkM9>Pdjq?D}|#bQfaIm7o3Ll29V>f1jA zcS|etC;_L16OYnq&Wk;DqIM2G<0C$Gq?#TV4`h~Sn>4@)`NBn4u#@`g{&Tz4gU+C# z;+lMGRiww`JA8W%mW`%qpJ#4D%R=kveEqtqNF%* zi&CSU4*WIxfa)N~3Kq}*_vq`C4^CQ>okDc{h20$b)$*XNJ6%lU`NN_No#8%HN2 zB{GQ+q}G~beZrqnq(FO=TT%nATV}idDgSi`bR!R-{GJiY{k9*x_g<=j0v;xCAKPqQ zfeoVQj@g>eC`0bjP7JWcDJV(2FMeN8Oe4MWEo5H%yGZTh*PFtXyvJh>LcD&nPg2X z1qB%^@#Z^Vutl4|KeA z%%$dP-tqg=x3J#(^DyB$#oeliO_M~j^esKpw`37cV1G(Pm2t_8oTh=Q)a+G8ABn<` zkcC|7(mt`NHQJa&8Qth)(A5+kA0a{l+!WG3c)H_2=!pSA#n)R(k&#!zIVnxoA3~HRq4n(OvVM-eCp&v`RAHyj0xhQGk zKX-q~y%=y&{)lI%|JWycI&HgJUnbZnwb5qKs;qaiwq#X0gt*u-<&x?%qo+=JrfhuJ zRDn(>CZ~OnqqGdP`*Z^Y*}%zaVqon59{l5neZG7uOP_I*txCt|n`ANXpG<^}UzB>` zJ<9?cb+tP-?~nB?-#N7pv2-{2;ng-)Su{;GRywoT*RhdfN8B%V$u93auMQL(0t*0B7YkMMu-DEMIDV{mFfJnxcTTrEVjCFc7*UEY3|2s+^x zekE(DmcMH)p0T4UL>1Zd6?`e{&VhT<9~u?rJ8M#^=DbM<+&iqmbOjuGW+~wic}8MS zKAUpW^?GR3bC?>+b8%h%xpfN!WflFoi*L;Q=a~`DVv`m=H5#G*L{e6aX75Uh$ILUY zU+sv|vd5$3(Ah7XZ>Jk$z3PDH6XsEBA|bq6c`O3~peXKpp0Dn&t-&F0HWzLsvm{t1 zfr8g%bKjsy^`1T6cy`Lwo&eUv%>Ym5VJN!%Rj+l0Ky8S>0i}N4k5^rdce)4pMb8;W z&(v*K3XJ9}dF3o1vJR(kd5|kK4Pyfwy6?(Zy(_iw@?F}oD#h=?mduPl#n=D{Lyp(}MK#pZL#u`ZZC z;(>P+6qhPS%E8k^caY=3UWXQcU!_TA&=Dr+2U6mJU$`J7=B-*gvezfu%p*roZT9@& zQuqixp~mkSG0z6{WnKdxkO#iVK`|AB7lG%wy4BMQ{lboGOtN5yV7dVZ-W4BP8X~L2+e#Rrjb9FEfC|OBN1wq z*q9}Q=$1rO>T&5*5fa*54A1pHf`_FmGP!^But54=dB?T4j4ftu{Y=b5Mm5*^`;^~} zH*!QC)&3jrFCy@#8qcdu%n!&x$2K$3*F@Jc->5=6jB%lR3RW&vA?)X`-V76<*JhmH zpqPx0;{P5IIpM&sh@*sM5h@^@h*gf(U#5yy3#7`WJ$5F^mk0n4+|E99bV_qbn_boI# z#{#|?W?2&%JcHCy$fJ_05;Ng-Yp0pe691nTfMMl6@nvN0`O1)nEgcGk0MyX1z?N2- zFou=0s*HHMerq%0LR(|>t(#$L=&Lh7FOOy>Wly#*m>@Y5;-LhvR`&5_0tC(Ts6LVL zg=r^7yuvf=>}!Z$vNyAI@iGYw@p6zIm3_*6P4l3s4|s5&LtWm-|Iou}U5UZh`dlRB zRFi3m%Zf35W$Qz+z&ZbSeEymKKQM&x9~g3z4dyV6WJ**r$C-Uwl;V?Gphhg zdQ@ZUus3`3;qU3kFlHR{mzy7f9MGxhEHEoA*{yB<&l*T;xj}PE5^Abz^FfIwAwNP& z-tGPH;^+CXWE*&wi@-Njc2ow-4KaWDw6XJp3)f1zcfetCSXn=BEJ1-% zpR0%W`+&>za5VFZo@na zvHs)?85>DcTp|*7N#LN6f2k0OWK6MbUDSOS5+yZQ0iANjlAF7&^*0+Oz+we0O0fV4MH>iM>_5@TaG)^%pkCFd9eI=@wZq_xO+ofvAZ3R_``DzH7@h@GpacVmKdd=tm_Tli{ z9;yVc%=UVGfS2l=Ax;u3S3=`N10#rm;vxRGE)6+^_G4^?QmM-~%IJ-SgIMX5##Za1qZ1hwzPxy1w+9%vs2BD)6%xojM%> z?HP_fJPp)tGy_9QSwc#2ajTFPen2-U=Z1ye$w&GDvtrrO zPRG`so)IDce><+QIyv^ZjR&QyAD1!uqNPypA-)}_aWfa8JMF4r{u@2?ehYXq)FwrQ zGGD?s+vh)L7}H_~F+O!Rjr;<8P3Jrt;_F`;O zMe0+u>qg=8Xsg$obd6|U(6lTl2WhvWH2B$vIGicd%J_zYdn;07($ckDSzmqzV8 z#h&o@b`BvlcH7slU)!HB{t*dqRmdLp)>78xxsF zc5b<=1VaSofj|_x3!MCk7xGl=7CN04JeZbGbrI?ogu#J4j!@SjJjbjke>Cu??Q{<% z=3(m9wfhVT`8I@9*Lc@P>z6ft(nY%DhfZ4ULVYw?ke`j#t zj0jA1Uw>FSiM4@&i0)Kg0T2>}>c)r!;0kV(s2IryWQ~hg7Q;oxm!D^IPJ5Yr>~dHw zIFwtl{#z1R<~)ka7Z>wcoQ(|t9>5&7^aTh>s3x~zQ+v?+v|oUWY`=K@=E>CwRhWcH z(e;7zWaHg{1x$>pqEz!590o?LBz!4{Pb%v#g$VBE8FtZcFS<|Y`}Q2R|0k1kWhu&X#Se31#Lq+P7{YO{SdnVDSP_*-FjdEH zeRQh3;KTNf@1Cp>iP(!Bf`y@Vtl&GMT*XquGi-Su*5(BUBu6m=oVPFAN zcinGHQqo@r68};pSZUu$S#_n`A@66r-B=q35G;Z0ed6XB#Kk)7$NLnRF+dCf8%EfM zPSxg`LjWSr$)<1gbaRxDt`5J^P0Dvg=a%N+k#gM=ciIi3{IN2o?mRsMff7q0x&cSb zP6J-F)@F$#QI!^4>F3o|T>}hA_SPT7Ge1bdm`1U&arK7Y6~BC?6V4v&d5}HP=Nt4S z=!RE)RtH0!Uk7)o5EDcBohxGqZ7*y?07pPCGp-2Np)!D(e{n00z(;imP{qNY!|bZp zl6qTxs=b^GU$;v?hV%f7rTn6wpJ$98)Y_~9Q~-(W5wzlG7j55|rhNePBLGHHjli0< z7rKA>2@U7QmsTmb={O&+>NMxLausj~ zI%+Fs9^^ND`aMdQu1cnR;uP&d8{W9ldJpaa*O6+j_NOok1pugvio8Yr`8YZVBnm0P zLnQ@dOq3(qr~3m)D9j(s?cz?xhGP@~z~*Xqr6kf=t=lM0@t1;i1wqdKRGNMf87255 zB*~W!4x{Q8(^l{*BY_ju@6rcY2Kok`1_5fhem=^)TgjM4N>9eCx*2fl~PDYWqwSQyrWKIUCZ)cYVSv3XHyQj4!0+B-H5gnL^eEs16eb+8;|f zoFX?dj!gh99tSZZIhkJW^%p)WXbZZ_P>{QCU?%-jS~a6fF`))q`@LJgUK7 zU2au{U{6k3msmbXX+94|lGkvb@7onG93wEkgkj?l%K{3Rspz=NU)l`OByD{IcrJi? zH|?l=FRC?F*Po5HSJljC>N3<+KM{%aYtyt({rX`2qHzGt{SHN#n{qk&NJ<YlV{Mq)T%6De;#2O;1m8cd&X;0jMP)l>7=fon3$*QRLIo$9a5! zhLKZs-r>$rcqT7L&_|93{%;f$6GI;igfFt=5g9^IMN7eJ{vsYoW-T(gH)7>}X}K}# z#?#$ZBZ}xRRj4CP59bSwsnr&8;-)Wofc|sIO*gNVAsGO}>i_<`!&wC-KXy#}Zaq%7 zdzs_m2dsfqic~G_p4pLQTdxQ*$B(uADFxNFP_W6M7^B;j-rN>#(zz23co9*jEpT>M zeZ$mM^BirK?{+W<1lJg;gTU^1WyxMYD#@x7b-^M>R=vl5i03%pU1{(jN6%N(h6)R! z5kTKD+)JJ-j?*EEDcdSB-e7gM$Jl?h3ABlkq8i}#(xxB9wbr5~i@m;W6b3~vM>;D8 z#s@9i_(BBkz(5J#GZ(g^L)Jorcia%3eCILn7NA#TM1x7zu_Nz6$qFSfw>Hl`C5|?g4tC5! zESi2z0P_;KNH^>mOE)}$oL*@|7bo?r7u*3aK3s-sz-97aAw+e=eEXck2M31JY$^#}p14t;2Nl7<~!lpd?B z3Syn^0L^G94}4UD^G>&;RjRMWG1w<@u9G5VE%a!WlIh2xgJ@1Z$2~7#%g2Ca^~IkY zXbmEkazH0Qm?qnCAwv7$y7*VK2dI9?QU@6@g z8z(6%H2O%l3IY{uJ;YxX*iay}wOglPx&R7^da z{+IB0fx*&r;}F{ZJA7U)f;l!qabH)qmSwickFj{ab*SaAtb}^{-PLchiJt{l-~_d0 ze%QkMnv@)}Kn93R_ z9x8y7@>J2(V0gGCb?xBLlfG8!HNzwK3&UC`yF2hIa3>?s=c$0DU2-g$`U@E$;u$WCb=6TM%8HguqSX=CZndL0-K zu>~_9{x}nURI7F<9fBZx@gjY?$6HD{0&+>P!Y6uMYgaAEVFLsUDzj50I#y{Mh@MmP z=_^I%sHA7Bt4WzTL-KqWwatG1i}k^}tV8?^GG@0}r?ME>DFZsui*cSU;9k_fd^= ztxdp*duX2ThxsO~1J~#0qgDYBQ>0J7=RUp6fXvk?peC==JapZtfjn-n$s%L(>y($) z8Q2AaaXcg-xHN1Qyz+^z+S(o_CqKTWc68|k!XqzZ}QmSg8b`Th_|dMz>9_F;NNGuc^Wn!a18u#a%y5_vxAsjyadqKwfIl4 zP4)BN*gO|`@%Y#L&8V2{FbM*W@6>|fQ-6B_*yYd4dkzi&*sL|Uq2i;2yT*^HLLa0^NaY8LPai*KYUQ4%P&FqEX_FPPm zE0Ue!ApaT()n?mt~KMhfr&w!X^r8f!_!#LIwk*~Vb(t7Fj z6V_U!$E?{+-CG+HTg4%CULH~UVkvNnlObB4{)2CpmE@IIhjDCij>u{n7#QE!-qqdt zh5{<^5xd*=3`4;YgL1)XXn*t085rh`M%o!q>gNwa4-iE+b`D|{b;9vkBY0I6W0Pny}fM@Q48&@=26iwDV zRz6yUdKtJq7QPC+7;o9BOc6naBtEU5f)McNF+#m}efO1F;_|C_4uO}j{ejiK_9odSN>cs+p7Bm@CNG(%0UjL^&Q7Kn)l z-sZYxKH^Z&6@Dt8{NFe$XIv|cw}2Z7OljmB0*WSb=rt%m@yvL_j8`Lh^xGOZ=j`mO z0Ke$U?jVfCydvV$*<`cEJx7M^Q9Y7xSu@(*|Y{BMRUb%AbK_(R~mM8XAHI?waxB70s#%GDty50&tKNAXPS zVr)KeYJfy8{yoNgF{1F|KTV;5B&dyXW%Skei%wnu33FXrg)cReiQhIeX9lzzz;&sn zDeBu=etR0TzuoGMfmF_*NM7o*Cp7;-(I#w6IQH|CLH_bDXQtgejm?4i z&~HT-#;0^Ltn_V67c%tiP*3~(INjYAeE&9|g*YVpurUm=3FWG!A7yhaEpwDwk4yyb zl8+{f0S&jp0?7$QbMM0BC^DyjLX3)X@ciEtkep4yy>x!N-_MQ;Vt%T21@sQ+8)z#D zCp2!9C*t2wIhue~h4hnIhnyY1wE=V&zdi%WWhKs2O|l2mKQ*_9go@o;`$!hmF8`i^ z>mb_gYV8PSIN!Yp+pK4Fv$^xYDXywYZ;5gsVGb}ah17^wUjO!w>AxX7u7-;;8DDscTqi_oPG!;1*d8Y?Q&#$Z+XlG&pld0jdUllgi8XVj|qT&jI2tUfi z3j3z3$TZYHLGKX;%Fj%=Mvbtb*I3V&yT5OW#cgP@I&fu?EfrRoT10GMq)#{_%w}Wm zKcDQ({ItB1FScj~6tMuoLYiH0tWv%5$Ry^PW{oDRKYL5|Jl_?T1K?Z(UNYXq1( zA2FWy)F{0P+kq$HDFApN+^QS5$L=>kZHVm5MU{=qzjl*;{Up+_`g#dnjeTxh921}2 z(wNZ3WHmuAE9jB!a^<3*#)Ll99!}IB{mpg*v3KRtw9cU7roh;xU|q&aQHQGYe?SxU z-pIX!f#MoPJRvpKClNI)Fu_pNALt7#}ucL`Mwt$4TBOE;624j2-^9GOmw z!3r{Eo!x_sh@bNf_734YM$m@u>3J}nkURh`m4X-#}`V$FQl8W&8#;@H&kmcvpLuJ5ySwrs#(Ho4ycE zP3oK!6Yoz9>T;3htlR<(cd9%H?uMOb`fCVUg*FF~=A#aK9x6@N=hk`86a7D)&H^gR z?Q7#BUQj{60Fkx;X_Rgh0cmMzC8Qa;OA%2JP`W{o?(Pe?EQP5z0ch@CIQfNw|HR=0*9}zFAf5qLCr^}&Ou2Xt7x(Bg|Mbn5+}#*8Whv1 z_K@r9gbJpI){Bs6NLNF@t2;1^mPuM+3iPohl9jITxsr@Ho`d{V#Lu~QwA+9~#uL?h zFo`nt6S+FC(*JWdfn{X|k3j7pt4$y5py`TfeXmTOMqGxf9&}GOT<^~~*xuK$*9R#x zl_Cxh1*M|rMu-_>0jCB~_B=GGxIT~gEcU5deH16^E$9dQ4T({4V{&GN%S;Q}4MUyz zXfcmktpYEctq>Wtg!j!CKPUceB0lTt4hqMWn0lOztMO%fYa>rD?2kq}zheB0RA;T) zF8^tQnHRN7@>=1%j*5$rvbTd^47lV0m-*Nqb5?YA{Fyv2-TMvK5#>W)`#|NR(4P%c zBgEQ|P25mEs~sw0#m_hoY?(#a%%s0aNUZYD6wHc4VJE75ZL+k|T~qaJda&yOqrs32N9*=df*AEsSGquGwBE)RpEyjIEu0pN8cN(zAjz z$DN?>O1(e#ME%dTtY$pF{zQ+mxVTj50@Jb@A>TyN!27C#|wcJ-x{Vb8B84WULLyJ*ht zcdp|8nJ>MJP(~?8lP3G%iO>Xh-&mExT2;&y5lNEn3_mzTM9W>iweT@fR5qF6di+a| z66Kf#11RiE2Rms2vMndn>qJb2zDleEUi}r+tcEOpMbqNFhr|SFMpiFtiMXwWnOC41lDDh$&(Go2$BG z{0AAF-4~vp=pzs1PwlH_g;QQRu{kS_7ypMce!O~&M?S`838)7CD`xMYHvmb@BWwH# z>`6{$%hz)VCw5_}aocw^S&E90jKQxZQQUX{#kj=m66aHyo`mx=pFu!Cflu-MOV&Si z^yC$nO~zd}Gh0I(#878C{qgg_w}2fOn&Zk+qfLWlTzYN!SG}v^lW-;jcces7o>mUE07eI-`Zgv_nO%mck z3E-jk!RG`zp~b|k-x~Q74XZoI4z34=_0x@7;x>^I1QQ2nRhU39L@# z7h7_v!q$rgJCk}!JZEuwlF{qyNiOqqjzy=(tMEwmn0+T0YlA0h&c_z%x)#Ol>HF^O z8-YM5XIh$|C2x&pYBk9tf<@@v*Skgg9=OpFR?JHH6Bw9jy);~x%R6#LBEKU~#jU(B zS}Kljj;WgD+wBKqH{g0n$@BxnXa3}8scI|c@j&f13782x{wwm;pJQc=j*R;N&Oj&! zMEUii`iygm^Y%#zQ|cA)*H$|3pghh?WPs zrqXpQEHbG7H22unrGTsnPG^cv?z~RQ_*|_iUwRB$zvYX1Iza`0(RHG+KR8_RlTe{O z8tk&NnMTFWzWA;IjjLh1ilONbf6>g3B&ZC16Y$sOXfSWtygMXoqTo|c$MxOF;N7)d9!@pGB(GB6YQwvUYWh$Ee+Z}pvR7yRB&VI$O3E}Q`$ z@zHS#>D2`i;7P2OXAQ^^rYM77T^UyHG)2F2k0VNA=}Cb70pW2^e*XnnwO$2cdlF1J6iFMwf?)N;I+5F37L@b-E6 zUPeg0Nq@pyFthAgdECQ`-#XN^TMCH{n{Hbgm>x$)Se=5wj{rWt_47ULeO!x-j%7Zz zGUG1KtVnu#3(I~41K>dZq?NnddzOG3zOU z(+WjUXv~nKpTS&+c^zTrb$Ra&s}h+6Sa@tq?$jeoOF2{g=OdPs|*o)f|eu=taoo{2;70CHv6JEv`# zpdVl^twtGg+)i!YC1!F(K7j57%EQ2J>T4>XhNOMjl`eyg5Mte#<~L6hqPb1>C&yO@ zVuO}-Js`U?h$%ORb`Kt&Fg5=8qFyhIhG+l@qUh{I6daDqg|4<1HlH9idIz~}1nunB z2Tl9OVS|j9a&j@ZbzGDvCNLrQuf9*7p~}F8hEP5>hCStOp2?~y-1q!(-OZSk+jdBY z4cwn$Qnc-x9Wbr`uGp`w_kto`L2euDE!-P-uOT9}z?)2=5Cm5{yY1uZ<%>WT>a-Vr z@B&hAJAW=DF{Dc34_o@6_wk0qT-CipP>38o&pyE6VW}c`tcK35+OBmilXCK ze}e_+d-kPr4?b8|V-C)|;f*U`_g(E1ktai#Jt%R`QMTp~DiqwCM4#FFpy{}Spfy6% znhgqBYvQ^8PqD6+am)=hM;E9A&Bu^#iv~&Zr*TSHYC;x%2vXzwMftB42}q!H-)=hz z8MK&hUFf$wDE$(3cx|7>jxb}m{zMSfUKzdSnRr2&XMaJdQC8iR<{Zl>7Kpam7abcY z!)Ue4@oRSUYKj$pin4$c5I+|NVG2ZqHPN(KmVcM-&&pQG@GY8-jcfAap0C{R@y}Ww zZ|I;eR3A>hdp`yC6~T#VeG)1G<^Msoi}%&04@$Znpo-k9bWgW=&FRVpD|OPr$a^HJ zpxT#9^UQT+)YeI^_q<^<;^*Sa{SUbY?{nD$D?Hs|Kd74DTacCy%yJo3tz6^1DW8b> z04-Oy*>q6QMm09@`6Ah(#M(Np6O)+8&`5-3KzX!lL1V>yxq)D~CI5b80N5`PK3p+D z_qm>P%CdxEc6|6KzQ@2%E85i=_!D;L93J=O?IRx?KX(sNBp;Gn%c~o*vN0n=ysAT& zbop6Qy>VlyV@~fN(3n0EZKTPA?rg2P!tOI54k<=verc=!5Jc9~{(dUo)MM-A-R=xj zovi4Nr>pY8p@qUzGe3$GjH&MpcRA+-k<<<4A=KR2`1POgd=$$+`p~aMQ=Op`epq&S zAH^?Mg4ExDTfYdHmm7dD^!Yj zae37>e`%3hpowB}GC-L~lVyBrLo!KG2cyO;VqcQ%r0>ZapEJL=uHas9Mz35)j`~&Z_^k}%F1m%^jqN} zpX0W?q1S^aM=y#B^=coZ?iW$}&o$bp|0*Hb{vP$F@lk?d)Pv?NZr3(Plg^P_-a;vN zarX)1QD_bx!~%E`~R+4 zp7!3$ir?@fDQu5swtST^qv)gLt?Z_tvpR za2}7PWQFW^3kp+@UG!i^JpT(g5g=VXhlA=RDDB8gy+3pnca@9pZn$zCcNgnbyza#@ zN&NoW8edwYxjR>sD;S<=*}M~yc0TL(7cUv~+8=nFey7af;+atUSC#(Fic39j$Xda$ zd_Y!ZZJNL`*JY$!*oTb2)H1TDQ_klv>b>#d-+}!f6&Q8AP6!sK3$`FXw`lFE_1CH| zD@)KWdY>^w`|pa;{yiDc{AUk4PTp`(5LvuglRpy4IowY>rj)E%T~@@O{BMl^$KXLh zE)`~zOVK57w@~~LRbhg9MRQ3PtxHpId2imln{NE~H~H5IVrubG6s&kXaZ;yd=K`!M zd)r&o+b?qxtmc9Xyli*IC$%y1^^;KND8@B$Vd#BFgFujcjiZ!*yR~yM{e_j6gSTGY zslv|Flcp)E0fQq{DrtGR+=qz1AM>#)t-Af2{`yEdT}Q%>xKYcx-;akWVPmY$xs6v5 zf@CHxDt&Y9m}aym>>tZuaZ&g$+zDL#u`=)Z%K15p?u||U@D&J%feQq(kX;znqhBcX z>SdUS%V3V^AcIQ35sS%)oC9e$2h8t+5p{wlIQB2mW7X6=J^vo<;9#LR8ZDORt9>LX zdB~4jV+SgNXTsT?=I@H zK=SO%_3Xax9hVNYPo8dOY9B8~s$j?0lmb>>dPA9{OLC%-At9Xu3Fge8c;_B$AUqFQ z_tv`&2xuJ&HMa|WY7MCe)VH~Id3Qe1j{iwWLm4#Ma1xYojEOsEn7nxDgTf-!Z&zsi2NJh@|yk?Dy4FZ&5-Q(#M zq+C{ag-dfqH<^Q%HT2W$!JPoAB3l?m*h?wm*W%P>zjvFb+*i|9N~}1b-Q3 zu}2bS^eyi`AlK-<6`g8sWDEcO)Hl7w^YgsfqrF;3)ZW z8OgR#VBu^bF&|B&Hnr=8gB|Z+^zK1QWB2lRK0#Em^r)P>2*j-%;fj1L)fBv}cJf7( zbW7N=>1OBE?Q2o@xX@EqgJf*YFW>87(`~uj#Bh8qke2$?zob~dFW4HNbYgmOx8<8^ z;8Nx?>#*ePojWU{JPOl^JlJH?I7B6fv$zH29N?cTG$NB(Pl#B@i+T=KQ5t3o-0=EMh ziJ71^nS9+s8*enxFKoA0>fajolSHDg?L7H{gQi5;Y#}Qg{z$a@TtoepntbQm>Er7P zGnU2~Zm|nP)>%$vv%mNg6veTJI+v~DxvYk_mPC-FHZfn&aS;fHnXvmsBSR@=1J^I{ zC5BB?(H2X&i$TQVd|Z87L%4?cJ0IVhU%aD7Uag4Y5;93u3Bvf@V^p*BJaPZP;0R{N;Uh1c?WaUZBWG@>qq~NETSNQpk_|YDMd*z2o6)Au>{VNxUpL!d zc!&&;gJvYzxoE}D!?U=nx`tnXV`BB9LZQ8KG)E>N6}Q)|CWAZOVb4S+EyB*>?s&!N zGcjtn*SLE`#TzL~JiPynk0Y*5-seK7X@1TcKl#E4Tg5C7?>5`UWFD%hBGlR;3Mv&6 zl7=8nV`WZku1Nq-+Pxu^fj8!^m1Q#*_6xoDjw$3Mg-%-$RqI20qo44p7#?~1URJVX zd$`)vj|y)y_rG~1a(^`*-z}8l4PF_2D{XtKnqRRu>?49Z=wiC;;Ip?KwT(b#_kZYP9J!wTY(*D!9Q1HUk*(b=oNe0$N(z{(zcsS| zndyfG&QzwgOh~AIZ}Wt=IRZw+5rGHS9l% zmS}8ic{)FjkI(V+Q@xh;fb|0o3E86rT20NC#_%%j>5r9yv|I;u+~i{pTQNkgC-7vk z7c5%M4#QL_our?N4a83CG48 z@N~9%l`Jztf~|?2wyS^H3j2+Qnei}8{(_XJxvnleV?=|2pE2fM0P@8fvyk7CWvm8c zr5f=|pL(wHGp;vW`5M}>o_MNv+m<47Ajs}1JtKE>BvNtB<}I8bZoXq?xX@)f^v{B+ zWcab;aZhZNY#POIWQ@}5WO=6f*$FICHq33@joqy~QE}-bXqLh*(F=IG_Jlq+-`DuA z$Ygb+hdH@BorL#g65sAkcMQ10it|mkt(|S2*1u_dn5tuj*3gs}D#LJk(``oI6)ca9 z$5$=fGgGXpH?cQdgB}l&uTy$+C;!x#Q2DKh@tDKL40IlRt!mBf&1JBf_y1W~lMMIM zAMgF`vx(*;;jU_Xccj#P%HDWqZc4LqIQzN$I(|utWRd|cKLwYEWJ|peE$*7HI7cP( z*+I$I{E_FL!BG>nu&6{F`3&_SqRBkQ03!ER+Rk}p1;cw307L@}7twYO%Jd)jXuMuU&`Vby1g#Ka2g;Zxg& zoty9*ke_LsHq~;*$p!Xix=aVPSJK06d(kJrb~nT3OADF5ZeL3wkazIRA|M%}Pqmkj z-}$_!ewwdDEqEL6GP%^g{@}Odj=C|KG$>L_OC^y?XAsEV5eJdzJMp zXr)s5OT@6I?X$jNeJ8_?m;6X_S7gl4rDyQ0Si1|t%*!>wrl%ZyK2Q)8M;XgXo~d>) z6Z>85%13v6JOatl;;n|Nezm4n#e(>e+7I#b0lv}F;U&82*^TRyeC{zsEKjQoxiu%h z%39`DzRug}kBWG#gBFJu6euyAf8<%Er1_^!{^G0J)bqXxkr5EyPSg(K?vm~FOvuzw z@+)wogZ&$JZ0y>$Ad5QO4ZeNOQ9OPUSGyRY$T*bed{h?zxtEREx|!Q;0{@279duPP zG&2TKb~@@4ctmh_NX%9Po1TtUZBH^UrbPHEXmd-5`de|0ezxhyzq!6TmZd`fSbw?k zAvKL=KjPKpm`sgwyLR8O+mv}8oFtT+UG<)>M<*}0l&|bZ7_=RqWKoFkt%b6l@nB0 zYbwFJj^9!44I)`*d$TUS>Wmy;QXqC)necz7_Gj)!o?0|jGH=GARZF7MDW!KovtKML z#hV^;Q`Fap(FHfWb9UyV6*Rv7_;GXO`G%insJAzuO*g~lmiCIxnnBfm3XRg&jml?Z ze3s;n3@uf)gOTh+Kf($$q!SX;Im`Q-^Un5#881NXM+0Eg|53v1TzT0Fdna{lX#2T}1y@FH+BqUtd2tq>74k7^@p&Z|t@vye z@fiDf(^sE;NPU)W$gP?!9k|qqrO`P$!j0$C^0CgAVbelUv-hz}cdEPSmy09A%^ma( z@e3unX^kCPlCfSFNQYalr-;0P3b?2_nJcyw%n;nDyiRHF^mkC)L$w0C_B~5>V{Ht* zK-Je9+rB=as0v5|)43BA7uek}cwudPPg-k5OWW}2MW?~FAba@8v^7o}_4mIZ#!Y`{=Y?ejZlds^?kazT*}({5Cv_%#-^Fj3h6^1p+e(v;;2we_#iBpDVk#Qp7N z{ntoO_uBjo=;N=d%cETLHt6p46$Xf~6oe{1Gw+*VPFCCWbwk) zSJiEHtrhu*YT?D8v8N=&t|x#Y6xd|B@98hjuzxC8RqMP2k)bNLO`0fQLVZ$V%XrD* zRzF`$&wnh8Y|+xqubQP+D@s}JUSkC&ctgq^nUtf3_-Kd%-OWQmcCuCTc*x`*ah3_b4t# zJmXv{`pu!Tz;Q9!)m{A!W+xIxyLr7FmHkLQ3Shr$HWY>%q#BmrC!SuMu&bx*cE~JV zXx`Q~+^)KgGGBy?D4^%$A5D6OV*Y{OWA?##J=7H_mE@Ryo-Guh;dAvm!*pRJ0f4tW*hoYW2s%^5voMEtiFZhbN#7Yitpi-rSu#D5G-Oi`9xcD!s%!CRTYA zqf}G0c~-e_b@mU7T#uD0ECWiErwHi$nm;)fK0Z}w%(?03gKdNC(&`ppA1Cb=N$OU2 z`6+oSyh{9{k0Oy0h)6u;E_Ysx?7LSOOM z?VHlQQaw5o%DRukC@Ragj{E8g03S1D&LQFgG044R*ff<8Z{l}OXrLvI|D)zD*ZFgK zc`YOL`#p>k5mzYB4tJJ2Z|*)4B}(%#2wy+p%xVc_)MP};yhRL1xd%}dy8#|C>1!q= zQwCE6qKFsyDgE`G>xk)iy&U#A4SOBFU?s2^7nw z^@0xt(&adREg0_bzeviApitA{*kLudZoW-E%^XqzfSXs2LQ`YJMS=N5hi*sFHS3b? zL%M__NoMch8uUtcubKm%IL(N}a`s&7CrnaUPR}R$f?;ZhhKf@!u zPKyt-0DvXq37fCeYi8dw6&GrMDhEk92#h`dyA7dUIz!-qGwpKC>a7aU#AY{&%YmQJKHzquZN8IgZO{=3j6LCvvW5BKZ%@w~2`T zaCiUrQ*9_l?*8u#+^ClxUW0CaY3^VPsqZ|! zt4C=C&1(^R<~Hw3O6U8qFclvDh3WtBrdwHd6(DXP(35riE*kDlalBq)V$ny3$FN+1 z$W0Wf!5I3NEmoKO#fB3M644;8QHXj;ONMbAtESP>cBupb_y6R&H}|2Kp4IdRj^jl; zSw!Uje(C4m!@@%{PW8q;Y46bVs!-VcCMVw7G=i--GR?6tDk{xi)6d?zxchr3hZ}s> zYMb@tvkTh$>6A+u6>Bh%`EwhU+*POdco`d_g^50WqJ7U|rQQfLlF&+a~Zg?&BC676Zva8P$8L&2<6eJG|r1V{U<%Y+2!#as=>Gz*$YOjH?{f}kMswLhOl(!&8GQT zzyr@Y%UKS^KmMKE_@Xu5^HBy7!4X_-#&GxYQIUfy=~$Y4bhFlj_#l%TZmH!yPJOvS zik_Y-5(%v_LBA$y4>yVb`?%e)%)5ipN!|2ga5=#Y)vT2xKp-FsmWiu zD5iN&vN97CJOZB35l^a+{6XZ= zcZ>9g6LtXsT}Q(&pGXD)cSd?dcGM733x2~a#&FfqJa|7`1}jB3ncP(hx8IFYRok;* zPRl8>vh>aPiRaY`VppPKieCJw`StaTdTK2ZRMXKomLgBZkU#nrdre)*nIK4^TET<^i<4euxbw?o&~D{Tfz+W^tG||b%9QA* zB1jtHKI3a}H&pt{rJS+Ho}>&;{=g`D?K_FSezL=*9`YLox29CsV6E!@`o=3>WtVZ9{z!Bwv-c)nYJ%sUh6>_Mnf|VKIJ`N?MPx4Bu$@^j=lQ<+ zFkbr`mb;${7k>id@9C!Zl5Xye?O!a_UwOw3aG`IP2-ZM8NgP~Of@`cD71T&Iw>Lyi z+`TLGd}fzW&rTQsT0GK8u7^X`*qhq~QE^TXJrrh)zqay9gES;c-4SY>(MP&+%GlV8 z(GjW~iOKe$1J=J+XCpgl_Voef%}Z}#G`#?0p6OEZ%gv+1Ck(qm3n7a#?Wfmj~_LqiBWNubH@HfO6Goi4O8Vh z_@*))iud0@%!0Z$AnZjpD+~|__5toX-z8^&XdHKk=q`$}qN92RBHHGs%g8o6f9s$B z&~PthF{R-W(luT0GJ2D?caceW9ABw?y2XIXQRYASb++w3L?mYdHzw(5hFQ~l&p2x< z`(dM=U$nGr`99OR+momgej+m>Nu%D*p3~25&$GInt@a-hg^?VNWOw@1v9QR@3H$95 z_gzQ_&>c!<@@4>r->oP#FMFe%(}K$%P!xK|y#m8P=hn;9iEKU3G4ODz5uz?NNp}<@ zX5{pmbSn%7+L4_R;ElV0|_-e?HP`fqjNZe;W&uE-a#2GdJ<7S;t;dAE$u#X&RDyuXbeAd=TDD8 zpkrmpP|&N-Lvp?=(^O(L*hof_hdwsrjJe{79l1S_=g_%7Iu!R-|KNyVe0ku{Gxq(F z$22@zy?Mx@^kD&cMDkB*t7ZIi`?O~-L!mnUIQ2GO?%v_KHT0pS5rFaMkFg(p;yqOz z1&jGaI=r97XCC{%_edrtl&@wivmTxOpwi<%O20k&nrMlD=^Q-yfGj|HAQ{Z6Dr&!d z898<^eMxH4W3ng<#v$1H@y5V%W+n$z9L79VzXIc;IBbOIJMU zo#%Y|O-mYTT&bU*oWxX}d`OC0jN@W6%$=(`kKi!-NM4qJ_MrzGQ+aF02Q+ebL0{f---;;$6O@DN3qJ>c7Q3g#TA zX>PKaSzna{3Sy*Vg+gUE>XFGi-r<}3d-jWS+%bd}&9mp9a;`N5bTR4@gbK~0xi$TF z6spo|Vz)42aAl`psyb78jZCw131?WERN(}f^DHZdXGal~@L2zIoc^N^2~t0WqK@E+ z4-7P4%o23ezAd%F=}be;_nD><9HrNl!gxQEYa-#w?Dt6f%_?Tyczg+&5 z#aWINImrPl!YxL1pv|;nGO>Os&-CqpB#y>~;~EW%P8h3j2#2~>gH*%EZrqaUUZ#E9 zcU_DFMGlLy1*{mVeLz)+xofu_fBGroSnqsKPQ;cX`sK@tZwlWSX?Yi}ZanD)Jb4G7 z^meb4-EdpwNGn1FVi|q;U`~FvNjtS#XceND*LpZOcXBIDDCM^#D!8b8dv;0vVT85M z*R_GiO*OW8G--+g9fB1Yygf!8vq%6Xbe7R2FW={+X=LH6S|#;=Ug-VfSJGj`)COnxpdZ(C`aGLk?pM_Mddbt^IV1b zoD+2+g!ID;!`98TFF%TfJ`i7DQ1qoXgv8jG%Vi;vEvm`cW`8ljYu^sJ?~<;4 zt@;vVx7yQw4HVHF-vUET+S;Ga6R3&>8ICk85bAGXZ|*MlBpbl55Jk+MW9|`+aewmm z(J0H0amkP>dIowZf+M&?FihT9_vY%;!_qDxRcYMmzq*E+{iE*45N*Xd=JF~(>OV88 zc@*}bXxLDaz~H#>%&OTubAbo*0qx%Rmi}h$KMh5S0aEIl}t1R5f7kec@;U$%1xilIl2kRw_<1 z>J3|;&d=i0I9)DfF5NEMzs;zQ7lme8qtA35*>7)G)&^t#bY73vYTK)-Ncvk=j9is{ zZ3;{>Eb}w<+j8vbYS~8O;20QkrXMG#5|wrTmfdiKOFV2DYm|ONi{)17IYZdp}b z`}+6A>wQ@R&PRa`6_MY;c5ue$Vh08quBc2`??R9rmEC=qFFQ-H;fTxM0_132*96P~ zFZi+9k4r>9`WK%&osyJO(#Is3gc!6nv&jANEF&JsJ?+7!CGGAXsyn8kF(8(G1`&#z6k9`sD-SI-WQb(P_d@OAu*Sh829Rv???v@JviKVo^7yu zn0~$Bc*tx9%m!n^?J%CsS`)3`CkxW7OP^(dJ>)7lM5v;e&Eu?7CmlXWR6e8B1Zfm~ zLkd&BInsn!U&fps`|4p0YSUBl3!xZ^$D9L3Hx#>A6lEhv~V_6+Bx~ z4C9wy^~UiIpKmYYzDo$P&KOA;S;192Ijb9Ym2^BvAsT7Awi=*&xNO}#uFj^psW3=O z5EH&Ne#kF5Tx>Y^@tnmr+8PHZiu-iKFD6E^YUYm=mbjOmiTeI>Th(~^?il>imOA~= z%~&Qt2<=kxj0ZY%bi{dlGFm(6d#aU@xr+n$?^l$4!Ws;7=XdC>f#Os8kqVO@g7wFh zX~|+5${ZpSSY(KaIhgZKRSPX8G(`zR{GT?Jtk_Y~D-3#ILZHKy*?t4ONp4U1)GH3o z-#JfDc+KGh-`;oHpCm6Uy0%EV^j+7!wk0c(E@~e2|6o=jKU*YrZ2yI|SW(({n&*0; zhvX^-U=3PKnrn-_Nv9fW(=Q11JG{bF`&vhGrHnt-`cH}Ixlk+x`)N-0B;D>Od^*M!y~@jbhHADf4|ZEp2M)ffZe<_M%yzZM=epOLv>-8NU3n(LsCb-_b#`x_c#0wgwQ z93ySs!y>z($iPaqTyn_&1zH4|+13r&>{<7GnmTTKG;%P}=sl0WGBsUBp0Y-!m>@qJpEHY^iAMLY;hEFTj)=s0&xTOwC06Ae5Oh+f zG9C6W4x)p%0bX5bk{!HfREl(t z#cuDAZrnrpxrSDwKy?#bgc}i)y@QW_fBh3@QYk*mX?IM9jSc;(x3)H`>h8DO^%5H> zfDXMX0I9fzWgZ%mW`S^Vbz~RD&a@6wCarBuzjJLB6g!CbfNmbFCi!|vZ8BP#clt&2 z1J*>CaYLf93F<=0F#BgI^C)FibjFX%R*GaJ&L|zlD{U`EvSY>O9?GLwxC{IoaSt>b z+oDR}#mDz|YkhEOtOu7k8haa#-ha=zR*3`FrYRCg=@A$@+|E}O87x^G0WRk2VRox@ zglGa03_5z?qe0yoX_BvUx?(5wn=JKfRQY@CFPr-X^KEAD^D@pC#}R+LjCe(Xx(@T9 zGH$-fE)RM7R_-1??9AcBnwKF@U^A{*Qm!adwe=dDg+DaSqG7u8x*9EQ`FVqoIm}5q z)yym^OyBWMdPEQuNb-`)MDG?Nlb%h(GG@{e3(Gg*5j<*+24;44U_$(T{4M_;1?@vl zW_2sCT$TfH6QYz9H#;hZNCE&8RE&mCg4h~!ouH=LR5kd~;sLtP7-OS279y5<-)5a) zLfb+>M0f2jynGgzSStohlr%?vNgCJK4hOscKn8P5>Cq+m*?;}_!GpE zp*xrf&--1A!PB>@(Y0lfdCJCH^@&?z*}8PzbNp<&ILUeCwe?=EyJ!-ltIB6_4g+Zq ze7EN2&Y5o_5tpCHd$W0ZDu+867;N`h0x|)o3z+HdX*@Ik4tK~zU;u*}=It#c^4PQ9 zke;Sfi^-&N;u2zwu7!W%{0LXBj9`1$^^#=^YspvQC4!CR>Gmq7DVr!MJ=dSbzg%r6 zq}rP~gHlThb}s3AvU&1cS5bF^6An2U;2T=FWwplOBdR@Mv46#tADBwV&!r{N}i+SAm355VH{ z7nk3I^b>cTNUwui|FisT+v{ku-<}TGLx)F6S>qO2Q~1D;V70YdExH!Mpr$%~VOteI z^~Z&)M!le5k!!zRqLA?0+J9{bNv{ZR`;oo<`MBF;+4#vxfaC9eEF1;u_V7B#W}e)6 zt8y{t3p)3PKR5=(Gbdm#j3MT11xIPYL%|>OB3}=W4}S2{&^=GzI2A3FBJq;|CL<@G2@ZFvp{Ic0?e2pbs4UtJ(*=PA~m;j>s(|M0%EQkCu*TV-y;m z|IXO2EIA-RKi=Kls@xlPEZrv_w@sFMf&K&>EIEOe?0nJcZ}_Y?oxm&EAaY@vjTHmU z^5T#^*f>v!t|urqeO08-azNEttz9;sI)r^kd8fph7RXkKAv+CmDr>PewN z3+glc4{{6h?0kaQ-2V}%V57{t@jK;_UcOGpg~y=POQ*QFD-0y%VYK~BU;r0WoE|P^ zl+7FH=wSfXCEFn_?%UB z>N7x1J>9ilRw!>#&EKdugX!{jX#bgZ-5d>^BvJLa_*ZNyPL9*PaQYUlV6{50EBj5j zW8)KDd-98bmH&LX{g${#H?&D_qNn2sh+fL(L0t%9;GdMTe~XYzX6`$oYM)E?)V`RM z{m=GqhqpDa?_wn@`vES7^eH?lEf91G7w=KE*|+He7wvdEU=tkFVMfHKvsKvn4i=Z{ zyV){RXVTB;hfM7@D?*bOh;{~;@*~MeSL)H3z3CGa$ZQry2(NtnI}WA)8wa1~M(|P+ zle;=^wr|r$HNR$mth30BEH_`SfVb0d@2*D0XED`sy#~Kx0^}`wr)Zuef{)Y&+rU6c;d~e z%tjU&8f=)OqR@I#A|QbMPsp+XbFqA<96XuRc~$C_{FzO{82QFUn+f~;6?)IX!r0`8 z_qu1qY^FLrW7&kivN(T6O*q`)uX2%$>hA!b5vk!Ld{nDUngSKFh}~U?Zxsf8pJlmb z_g6b3T@QB$8irXvr!O$cG`GK-ndLieW>F4Kv%W*yaq*h4{1ZTm$* zB?Yp>v#oLF?d@?w=PIeByqryyOV6f{u9NlanF(vGK`F{@2K8)4V@VRI+t8hi43Bbr zQZ^L8eF>3#$;3BNRF~T%5e-qy#BhGetpd$i0^+T@{$|yPcyEN{S@8rKnv)ZFeSlt0 zNDTEMb;MDx(K>skM0@k0;mW!FLfU>2D-b{9_Dif{dIS(u#xqya&{1a&E)wK22f?o{ zP?FEdbN%TdY`*G?AlHO=LiswNj!D%2!`*EG((-(S zyi(Axp~mvQx@yDujxHq34)%CEQy;=Wx9vaJ@#aK5(7v&){-JClcZMVq25G_6s)TBj zvjTo(D1#76dQAHOnvQb-UyT61K63Ay98WGGj4Aw{7=+hHX+SCx3$@a zyKB)=OAp6KHvT%1|1dy;$C15+xQChtg{)B9S3Or&kB@`MAqK-$(F|MN&frpVqM|kN z-JM?I8>@WIh8qo8q%Xzfsr^r(Otk)25N={%MIYcuw*gZa$Tj-v zSwFHuiogeGum{~zs})eELI3rF6=J{i(3d_q^jz$wDxy7?KHrQv|egKlj)l5hUn z1adcyFkkF=Lo-FldO#Q5gUrNhKBv2AS!spCTH<>mrnnbA^xAb3V@XjEG4d$oF5LkI z=(#r6K1#Ac_xIVy5rG1sfWEue}=5{A5BPX6l! z$Q&Br5dv2{?~zNC6cyJ?4{*0<`IbVy?rBJ%Q`e@=dr8J|=rP`CrbJ9*vD4VXC2JdWdX>9xwM?D~<|7B9r@JvA> zVQ}LXCD&C%(#_kwBW-seCm;*koDEFahSWglfr65ZXrrpQi$ba79^4?uOPH_0Q)8l7 zmYIwI=>{C|PNoBQWiF-8!U`+7KxHxR!{8Ia5WYjR?~jJ~hzfYbKq$(pI^)(AXtu$L z&Nb**MlSbg!;HIYGWPrX=}?wlf#1(x$$Ng1S=O*yKO;Nk<^39$hcH9q z4Ifekp;$C{7Ay^A(-He}mboj)j8d1eoXzJpiMb|3I~cltzp+F45GvSx}842Boa*woSi4U?8ZAW0prO8Buf*Smk`A*sF2!> zm42y56UIrzzrD?SlqAILer(K~&0mVUL{fyz(Dn7h zR9xUn3!SA)A*W`_ePuTky(Ko@O1n)mWstnbZC{&!WqyrnN=`1ffaj#VoNA}c;CWR9_`G6*zU#J?k+f(j(7g_F@g6Rp%l23OPW=F4 z;{!rXFRA;{Qb|}lPrzdRuA`}*hl*-VpfUuj_e$SJVcVin}i7u z?IAsgDzJ7IQ~U(j8(`F8m*te(O?a)0d4!U>d$DlvbA4MO^XhvUPHPANh&v?Z#M)4g z0Hm`*k#mt_+%(b~I@8opEKt{Bc0Vs{-dNRDJ}!Cjmqc_lSf4=&?Mdig)QStwIu*&O zLd&H)-`HQO(36sMweufZ=gFmWEpqW7qGyJQ?;a}jxpAxS-XjUC8}m1&=E{6QO-l(O z2xodC)1?*Zmk#E-FaF5StQ?rNIll|vN;iA(s-N}6UxJd#5LXBRTlG+oIg~8uDZh=Hr?imFP%uW#!Drjg|k+FYrZ*7(7ARoQQTGgnE32<_k~Kvs-> zcu+8V#pc=~FHo-N6mqH22^RDqr8{k5u)N|B%d3e8&q7W!wpGuq{H{JY0^^Y=O<`bV z<-$C;jaUEZdR;0`C6f$d1W#3<+#46Gxqfh*!RA@~HNbdNJJY3-wzs!rP^Fy{{_y4& zIdSTOO!1tdW|jb-kJEMu!eFjSBZQkf>S|$Iyx)BRBEQ}pSkEUi_A~q+TVEYi<=XYV zEkr^rT0mM#5Cxk1z;a_<-l(|%m`jX0v$4US2_ z(JAOXY*2gxV*9TqJLVhsAqpXbzig%e>C+s68dBl9b8#M4Q(~NynlKzwg@}hTnbN-W zt(v*2a9U~&9MY*MK466%F;`hWdas&F={2m1{gO}{B`+JMtT|-n~8u^wnf5gitdvx8|g9=RA5fn8EWlfhK1^6Z#%rRS6qBiq4|dA1rD0Maapwz} z6_#v2Tyy+w#YzO~keKT`#IvOL45N$I9L0{xMS6#MQj@}ER?h z6y5?b3hDoxomque0_{inj*cpDq#S_tVpy?M21uYvM7=e<_vBA3h+M82cMXZrfqV{u z5U`eJt=_IhtWRW&YIw>}ltbBwxWOKan8%qT>B@g~_qvtUmQznxfTrvl#TnBYet=L-&Yb*kQJWUBXFh=Ucg#9s~4&DT{dGLy{KqsNf+pDsO{%O z5X~PMZu7V%T^h0tT9Y zsged>cK0zfNR>*MVSvsR4Ll;Y3T@DG;fobQWl5XLJj4(qEmxxD zbn53-HXat;w!u{eqw2Sk?`ahmIavKNiEhb_7lMonVJe(&2h3f&%OkjjPwyN;(>DTv zK)bLxB2FukjLb-nV=L`WKATOJI_ta_jJYPf@^>T)MGq1L9qLGfC?IQK?Pu(=sMk4P z!54JF1l3|EaaywxVDML*Q17=vm@`tQ&Yyusc!LnrvpdFNU}+4pT3aykIESa;0nBfP4P5;0*a1x%AN{t$~K$HXLL}JHU~^!pYY4b9V!Gp1HSrvP`sG z`iy2l9Qj^wd1~8Qx$iGK#+B=i9}Tt36VI7!$yF}?JjBXfFMm!oNvG*rKG)e7O;35@ zVKs-!&SzgQGt_F`!Q`*MigLCyLS_*yZ_~_dig6kd!AonSp30`Q>wDojPBDsdd(8`i zqGuffd&$2O&dfue=aP(Cy450pJ4~CC%yzPr(3JAZLfK)KftMqG|cv^kPruyX(nRVI@>Msjy9dv|2`lSVGx<}V;vzztGV zsC@QiM9u}5i_nD}O@3oH9Wmsh@0`Ncw-18t-z#=X^w`>ceid-(BDoqbssfiWT=a^x z0wmWRu$qyxHbgcYvfgKxUXd-vrZt45nM&<)4SknIwBxc60eGkbRS{6MPsf1Dy8 zJCJUJDeq+S@o!R4otSNS**Vf*5}_g;%dO!LSQqByG>R)3~<%f*W?* z;O0HD>Asx|!4vK7`ma1x$4C>1AtAxJFwMhAy`??pZ$^N^@hhGDhy8HE4{UrU|9unF zxL*T3n8h}l!)AJVr>ze#Xzb?S!b?0>H{`R=bgbjR7U4RX$dOtpM96M z@4IqVf(eIDd)~oR>`dDhGge8)Wcu4|XY=_6K*uGVeeyKJ5x_Wv-2d|Roq@~JB-+mT zkTQR9L7>Jnn@u>xc}+ZE;)9e+aQ;VJCvPAJZ*0HG!WrlVi=v0c@gnT}^2D3_nqrVt z*s^m@0-MwQcLj)=&+_GsJqdlGs!5LgI5>b0EA2?^? z`~G>y)9dMyR&MTM-NT!bGi-tQv4v}>TKnrVL*=tSpA}zDr0A!+5{Yt{v}$V}ZBuhz zytyHWUuSPFN80uCscxH6K0dgNmFEH<1-2WrL*}Uj{*#@WhM(!Tz%FkvIc%qTlQS%$ za{2i||T^X>@Vap4vlc7p0q_jPP(GRb zt6PTz+`}iqy0<_xX>~@9nDnXwSefWLJ^0qwJc|wPze^ zHa9t`ojB5Vwa^2@SGfXuVt=ObT;v6gbmf+c>{2o>>EUtqEB$}PpthI!Xxp{_g_S03Z9(0*p*u3jys(s*J(|$ zLXd_)gkR6_NH&!qf#yeVK$0TP61l3aGI~E*ePsJZ*~9wWS~%^YvIOVPu1Jk!*~$d5 z7*800nMN^9$>f!FgUu|pjs8|XLB*)32__l8I=(LBYY2_P36q~JOD)r$NzGoSiQRQ_`o5A(e$*G)G$)VqUtne4B=8AT5vH>JE5gyp>lCeq^0Aa6 zCXs%6#3tnpwoIrl@A5=k%Ii33GDe~K6Ky%yNW_EWNSn_M`W1{<(^I~*lvMM+n6mzs z%j0vq;QJlQ)HHRMtvp(WrJCCzv0<(9XGd`%n5Y#j8p~MKMbh?!K7H2N( zGsM1kpdD5!oTi26smy8>o#uWQc~3X+Q)7)^jN}WN$7FdsUq4qtEB$mdso459`OymP zB~{=zLU!dxfk8KAa1;r@vyfAFGa=TGOVp8ZliN}6lNS26pve%wf9QrvV^&cDputh!;*Aw;&sU+`#n7TC z7dU7gGB}&c?g)ekbW~(uaD(#|k?WUab<&E)IA=E%_}dFy4sYxu^;`oEzAyX}+7T(Y z^OqKG-&MW(@mAZEmO+*7n9!w1rdOXJY8Ukx)!j1g<}cNk3LR~&2$1fPc&4XnJ1&hv=(VaxdrZIQzTMDj%N=(NWrlr^`@)VxkFy44})}7A2 zg5Oir{@%dSsDJHNwUMJ(R?3SBRUWHo0b>H&BKsjuqR5k3n8@bn#C+R*zeZ1g`Q{?fDSDewiEDhnn{WKZs67_5UP#c2 zf>XHYjsQJpvFxg?s?Fa1>T6fEDmz~GS80QrBT4Ql)&g3~`PrONf7W6SVyn}5k0;l^ zv$38yZ}GPsM}KhA_zr_>o6G6IO9;cXN0c;VeFS&@p3HF2^Vg|13x#ui3FM`@O({I& zF{lVTz1#w0;#6}{PM71NxbG&%X2;4NIJAz7S8JBcG^iU`Hq`g_4RjY`jhCQ zq<-Yh$!ZQJt`EWI$zioeN}qldI^J}uF&W&}`@B*^jD1WmqFF3>t7X>MWR&CKRu!xI zg5$x)$ZdoioD%imR))tLrOlFt$Wn$r!(86aVlBe0a`U>gVE4r_@2L(^Gsuz~rj>W; zVBsI*qT_g+d5li=8>59uLdg%n}pC3rnC&Vq$ZTsNHpSZhlkuOcx z=v!^l)oWfXA2_)GKI#48)fxA8ZeBNYvtY9vpETiXi)OX@O36*wO6lHVsY7hKocvMT zTEnKgg0FRW94pkKJX>Z~-(bA9wNo^QX+xfP=kw+S0qbhEHs}I_cm9BU%-mldvB1U9 z9r*a^FS&UW4%-h_Xz4+7C&dJZd%=>=WBu!UBvT4xRZuD_u9ubNr`nL;>k^^A<2+%M zS5r9ZM?{ELe#mf`%PB=1Olydv&*G|4^-JF9F!#)6kLVXjP;h)gb7Jt);jN2Cs7kwh z;hp@Uml;K`(l4uxnG4Hu&)%ESl=vjk+T7BjIFDm)8PhHtpqY$1924kcCFnG%t-#K> zVIeHUq?-1@hOgNj0R1xK5}#s-IzgyT;RmMRHdQ&uLzhlU@z-rNznTN6(uehc{kqk##< z{r8V5Lf%v7Bb_DZYF9J(zgMJcF8yY>4h8cmnsQA4PS5!5z}=Nu%E3y#`de@$G3^Azel_)V^AlUG{A zydf{Cz*^r%sZaYyCN3e}U}40gFRCXW7kLjsC6Yu}vHLV%!`{~r%XFk7)~jTgpHj@Zs%8)|&+C*=TUsPQSZ98SFKhMIUuINPyq{ zDo;1|eLQaYFkvV0s4Y1y2fO!bM3%U(LRwU*Eg|w=EiR!)fk}2nvg}ckbk;brwaw3z z!akdNX#WQyd$jwflOQ=-!mzA$i+aoeBkK)T|!m^ciR57Pvk;pWTZCH%^dR5b} zs>b|uRda`Eg!fwt)3F7artCAv!8sFLDO{v={T5!>0sYEW0;XQTmeJTB*W*bR7b_yn z9nFBqVk24R&h2tV3$%@Z@p6}?4r|_d0x>T?lLcIQ@tSD6(2&R0izCyvx#+zylDRdT z6u$vcqzIjytu+zjlTG!&^GK7*5-`I~jEU&x*ZO)1ak|*|62g$M;@0 z3UtbqdI~IT)Omht8+oWK4_~*f=rj1C9fd$_4Oy-HIC8E@nV&`LRd>)>IUx+&nJkkV zY?${-nEqQHj9n(5JjlS2XSv;6^DH764M95(!Kda)IST`Il+~>uw4z8$tkqaYJKK}$ z<;_FP)&BS!NCB-AT2?`7x8c3*`V3;RnmgYT_bWjDSdUWZ7|ZXLGfi?lA}emSwPcIq zB~=pK#E#LZAzv^~Gvm3dW&DsD1EnF%)tIPQJ3<>wi zCYNfS&)g#18rov1MkhfF7m7&M8v7ZIZhvoZ9AS*Lo)_UC?t~-JCvOr|nYBbCaM?Ou z|G1;F!A_^?ytIO8I_l@=KUeY`C^>!W3K3NW*S%2=GHN2WyVKvD*lc%0HtTIMoy0oZ zk-H5a;3fisciryAXz;#1^n^cF+=RQw>gxIpmpOIBGC1Yhp#ch!6N0fBRc(@;`e`N_ zLD)fjJo$d|1`3mmhIU<7Ts5G@$8{KwX_~Jno^(<`e&**D^>V@dHI zz!-JuZ2@?CyA2TyaCO>6`5i>h$Onl2kt63(*ONm$Cm%1+yKYrNg5?>aQKnpS`m=uIljUxL|A+a?_DT9nNI) zPHc&SjyVdEG<}9~Z<62j$ayT)yz|~>`+vV%9K^1)H|2W3FHhr{!7j3AdOm zV&-P^vbr_Z_Q(CZbUMm|MOfJAKCe>8e9-X4TB-NPtp$!GVMN*f51&GHq!pT{HlBN3 z-dgR=9-5Xr!9kUqJ(I8=Oi#79D&EzB*tYeLJ0}hPW|*Q<-qBwk_@jbThdw~QXMY5+ z+u&g?9CLdEsZyGs=HA?m;+xcG`EG7 z(Hfh((aHWU991ssb?V8oZtURl&kS2~+RmMq3IadA(T#VwI)7tKjkdiv^yKdLNKqrX zZE8Zc{+bcztjmvl7SjXk0)Vmph2ZNVLVIBnpNzvb_8mwr|ay9fRLf={a zyVtG<%V5Z%iY=#?hgm?`W3$FEXRiZ}as|qlK~v-`oxGJldpFc^=?cERo%C!^HBoom z;8~W9Mer3{FRg6<-9TAKH#i<9S90p+I@;J>udKh^LxadHhNVJ==kEs;U`SZz+EC*y zfNx)zZFA==|4MXvY`w^gL`^wZ9Ki0mJz>7L(@*Bi{`!G1yIpWjXTEe6_w&V>CfMu4 zNE*LLu6x#)TJQz~f(b7rZ68sh` zCZ5HOl*|+<=-lXw>yB)8hWny|pE2LuX&xGg@j5P=xuttO3xQzlws8oLjk=4!>t=;E zRr@@;;_{c5qr|Z)uH!%6bF5txlt|Y|{6lMwRmPO4&t3dU$~iVD26~JTRD%_62|#CW z?zw!vXS&QNsPN{YCzB~flcGKi%wPmvxsHAzYa?+Va(l7kz5(lM!}2RV|A=58-QiT1 zI$spO$|tU~CmEJ$)+@4|4MOzHJNFr&I(}k)*54oM)jpBkowOyN4gsMLXVD8~YaYz^ z`*I0hMx;Ll>`ww~A*V=yNE#x2<>6RE?~NMHS`rxL4&|YI~BdU z&Dqeva`2)1P@}ulz`(kKvuL0dCXvc(RojwV-lvClhLQt6+Or%OqHK4)^A(93$zDNN zq0EhP|Ip5*?Tg-B`hz+a+0c^?{sX*D~;Hy0};#XX3 z-FR`5uOLu;>g7>bDiZ0fHD>4TPsw3gOijPD9N?Yn0X%&b9? zn#SF3w@$`LUHX8xH19!f-UCie6B=3bwK(mk8iS49gc$1?oiE0?{au^a=9WY6kI2UN zi%%3(@MYn5Cvv;4BM^SOWYnYKbqALl_CMptZ^{wGt2E2a8(KfTDUt9+MK*ol9&HLU zteY5T>!w&LM}XDGJ8xu^``X&lHmdk(le!~(w8QCX-Mb?|5_q`lGHRNF&4TaQjogmv zj2p6?J^CtH#j8ImK@}*Mh@Ro`W3ah@u(=rRarwK^zwgsRHYqj*J$xc}LKTi1R7`nX z`OTQxhN=_zlJEyh=+2){VBQ-qCL^BTya$c%ehhACMo2~ntQmW5NWBDyW`<| zb#!8B5vx>#OK?8%%1a-yS)-NVu%IVTXb*yRN367!L(dk~wc(X^v4ErI7mpBbJ_(y! zOkORmH>F9fVnwgW(OIqh&hSuu>_!cxc()S=7e#~~zW>}J=fG`!ca90;#qXy)7};?T zUKlZP1B>^*2?$EWU$z8itki4UbGXL0Za-x37~F}|l`l)jS4(;u zE>)Z5+5uYEZ#a(_6Goo4)yfP~{2KO$U9Jvkd_>gIK25S-VK^6VzS@I1H zzo>ad9eE5|7uIr90X)>tN?K*87c3MrKoC_QXg#5<~ z>KnmF>8)fV^D`FPp?MlNgXE+nr@uY|U@PDJRTN55#rcg9m)QaDzrA@8f7(+V2IAP6 zH+TKhFZgprI84@aIuAjcYnJqO;`1YH=YDrRsV38-g!XzV8%=hzJ4PmNv-Z^k7;^LC z@8lK)(K+;?)9p+(75+>;E$R4()^z?Z2rZ2NU8$3wB37-gE;4saO!EHjrq4l~l!}wN zB1-2A(yUJ-Ek?O05+{dKp_|lcChEQw=L9~&js0I)azwl+3X8$A_No#xjJLDnXf9VB zb58tZto@blszzHZ4_UNim=YGSwHkP!T-A|~qi}@QZ4_icQN{nJ&rW_+7 zQk8W%7D*datax|PJn>gAgfQqhN^I4(zXv#8m=j`>(N#vWF`ZPEr>z07HDPOA9x51? zOZcmgp_-zbqB%>F5 zuNzfAdbB-USv9)g#QJ*~8@)s*M&1a`ej)v-#^;X8l2y}HrI4^vR8*S78&MrG;Z;VK z@)Z|XLKOTbR7|~`eAy0k&{VE-Rh>Cd^{}MF<+Mji&JYVa>p|DgZkRGvM456=F?TWP zciD}kNL0#BcQd!nRRjd$>OcJ$QHy!I)n&lw3xY^@KC3jEci0lCsI4iX>SR6$ft}MX z-rt1|qeJ=oH&i-%2gB2xZS6V>k{q*o&ZRg|5C7FlMC~`Xkao~`Bt_KEmSd>I9(z+#!9q}81=akWZ1YSL*XCkXO*YrNc-o7^9R%X` zg&YZ1Nn~N{73EOuvR*>(^+H>d%-#JT?|5^c-F1%IG%y%nzJEXaTe-<*NCh#Eyzz6u zrlzr=$@ub?tbF27Z3JJ_*@sW-f0xU6AEp`SDdBCU9^b!IZBaexbFIDlL?41{e8WfA zO<8wtPURI3zGKGd>m2U?rAL6_nV~uuUE!Lw0DR`z$4%>h%|En6d?f|v&WB4nvO&C) zRVgcacd1R3oo8QRP@9y@nW&7vb*Ym#gB5)!k*a}7CC0SxAf+_;PUgf}qyQh(D;J6w z0`b|Nog=_xJi-bsl`m_bVM81u90$fITdD&aY*iy7HLqZ~Mx|zK%&OzeiO&JSVji(^ zvR`=h`x7A&&$Pw7xZLIc);c#w5*y^Av56SOm>oaI7E5)Wm#)qc*Em-7_+Kq6D<5Sy z4_`>ZxkQRX_O5^QU17F)$vk8UD=_@A3DUT@))b^rUi>sx7(~aj%JRv|hfU4L^_hPE zpU;y{Hh)(9TZ+4iO<$XmKgQ@~FCwL0ex^Dq_eUNpmfK#hJ%~R$H2B}hKZ{W=y20)- z6IWt>DKGL~qq^&THuL_(Qbqc*xM;cV!5!1CkE2X7`GUI#+R;ztk?-;Y^SfnBbAD4? zsB?(5vnqAxAB{YE&eP@FWTBKq$yd{o%t}?akcsY`EEQzan%FCZGls8!YWtNGFO1MI zup5ZdgoykIiEgr)pS3iSB>F?~Po-PC`rqZMpKfgsj(h_>fU-o}c{*(~4oyqk)pKM?Eyf=}xZ- zg>wmuU68P++@HI|L?}nxE$tXDNX{`ymwxMh!xgDKZG5c59<(|QbUT=7a*UxC>>zmM zh0+NNA#Qz6@oULV;1}Vz98RsmW_PrLKy6XTh}<1u0vscgJm|bRm}5KO6cv*DXt%j| zjElfw|6R{2P{nlI+Q#0=I6;|}T-=PdFgQI_7!>UhZJsH9P43slXr)q+;<|#mwCS*w z>c7XY-M%&5ZT~@vfzDW^7V9kV%vVSkh8;aSs7VgNm7ieYp7sPg{1QAst=KU^sXn1v z7{JE+<<8lQLF^##g&m4ZQuT$1P>`#X{{f^O|6Y+^Y#yFS`4xx z?&*s3iR$-#|A2#yf$7Rnk)PLYCjXkvC8;wc(WoIf{*J4)V5sp$v5wH>;1_K?PAAOw zB==5Mn94G*@%{Sqo_zKW4f5Ws-QJPGJf$Vs>!enf5mo;vMdz;0ytgLm-%PTGgdfXC zxa@>Xl65XsI^_WO9e&p_Qz|qq9Dq|L<5)ErwPvb8NPZ2fn^P#ckim zdDs_Skib#}@BZjlf0a+~n@i!L(zXlLp7gDrWsX6Tm*%|TAeT_x#jY^4c#bt2tNkJ& zSLlqe*r;CD*;C1h8s#QSdfg4}_N=E$vWBD)eF=K;G{Kogp zSOjH^|HhJhD5#~$viB6zQrVEG((=}Z4!+V7mvU%Qn1M@5mJP=!7gz`=ZG8q0C5=Fd zg^jddtjz2d61CCe5C!z!2kBH>&Y14%Mm_dnY~h#CTy2k{)rjb`&#*))NL=j{pN}_K zJQ`e7EdCCJFvmVAvBpJzH5=A&f8ZM?3GOj^5rO1LbBm(XNTrGylX(w;8$RkLW^#7q zpEtVG%YXSf1e+g@^~>VjpoNjQVf&6e=5m_^D5R#i&)6J?VhFtJeMz-g&w7uNEYC*% zQT5vUll~Ay*(~srvwy__S&j5%zJLMDfaNGOVmf0ii(bQt`0+`}W|nhWK9%WqaH=q; z;c?Gv+nlhSt5}XdiMJc*2Fp^!Pqf3TL;Mv&oiN!1B|NoHToX+u6EmsBJsZ>S3X4~V zr|ex%;r{JzGfq3WA*4QOG3UV29=5?wkg?x$b z;^!KM?)<&R%KmhGDaY~_{Cg8V9Uc=2i4#WSg7o#pYEypvw2tT6rMP&hgFp8Ykw{v6 z46yMf=_i-X)?T3YcO>8BM&f^CFMrMGP>(=;t6x~M6+KfkUUtodT&S)M!*nFmGn*R} z&%fjG83A`w?iOE?BS})VHpRci&*AY3dj5rit0gac#*Z4-tqmhwncrF1Jd%%I@6!n4 zVR+V)F?eADXFy`ClF^O*Zivbaxc~$p_hL>lR)*$agO`<$j0gk8YH7-B2`k9NJ-hJ; z6E33YgQvzXIj)5V1Tt_=efIJxxaCb2 z6Itl-yFEME@{eCLItWYVMz<=*?woQY8P%W_Hx(>_9Aq~_iGyQ+sh0b}eqN-$W%_!V z$=zB3 zduaSZzJxOCEZb7vR5AuUmVo_d(qMv>ERWT;d*Vw>?p)F^rPmHca>`mavs?3xce_XH zF}twn)nNco1l@MU@U;+=`(pw6?+$w(K|pA3+KX2&z0EKZ+>RInQHjkzMzT|!Nh{GQ zM(ylp8&}f`&`UY2)X2?Td!Fm}jnxe7x*OE2qly!OjhLva^2O0%-D~f$H?%s#kFzNb1!%h#jF>fiQ5mT+FmA%aawo$Rfu8In8m)`DycvD zdN5g;HX_;zhsp8}WA)w#D-;Ctg2Nt$S+^u<2)EOTTsF@Wt@gDwGB&-2;Ur)}wN&PL?x4M`q<;Y#&a2x*5UP@-aJvRZ zk@E#W+%>AQT}{X}my}~h1KH3W%!2p}W7cU{!IG~&G!r>CQ{I8?;*aS(6Hr=SRkHQI zUyH_!FFD-v6)^d*=)|eN)wW_bU3uA!Kl_8>sr6<76X(aw?~%9es`S#;Hf9e^!+ybb zXIe)#HssjicB|?ACk(&(V@ln`ofbA3a3wdoEsRAi?$$goqp!!TWx{AEQyQ%vEl2_t zPsc$;)Fu_d?W0s;&-W|w(y9ySX8!z?d;x0tw|u|%8T3_|DpjX4QBf+V4Wf4$V5%O{ z5IKS@nGlHk@^%D6ia4}TVuq%)is=r7Gtr&ZH{Xho;n-&3mKgsnTVJkd{mWy^dP65L z9W=r!f~O2!hOcFUe62Woyg$8ao_P^ftbDxkquM{xTWKWM&K+NCz3_T{FOWG;o)m0s zGWXl7nYiMR1!l|WW=r?y6&K!;H|7@u7GiC`S8N@41Ku-9RBnFO{Hb*aKW(8r$d|Br z?r8J8x8`=zR}$zFF0?UKaXh#MK`16hfYN%$b=X*OkC#MR_n!c5S~sw(C(Lk_Te29w zicO14I4atv9TXiwjJ-Rx6MUvsrgAXK#lE50i>y1>a?K zMmn*?Soz%fL9e0rnuB~QPFJ^bZ0gB|#gl$}@=qzBqkQwjjeayK}=+W~s!6H9jUcrer3B;N7vg>Sj zNp#aKHHe!Q%hN}dKQWx^yDfD+74O5$!lkq*sW@8X=Bs|ScR(xR;K*_Jh@pA+z04?( z&s6(nLU*77&ZMU4GHC3$x2ZKpw>H@;zK@6|6v?WL(8|BhS<&XXr1U)43@BVU@(8qK zLx0aKR(WR7b#-$KGJhD}w)eOOPI7O-#L!Em z$+BOlgN32*7?#5*X>3qY%~yErE4dep<De%;AX}@BK32J1j`a1d}Ev|bk{z4|Ng72XRJ}XL9EHj&OTl)lpO!741=NST= z8hB3__A*D)kak{I;`qa9_|dQ{HBm%`b$c$ZWXMit)5M8mTF30+PBm|?#{I%~?5@kF zOiRZgHLefx@EP=2T9&+w<=I_ZNh!OoTseM)6vz96ksa7Q7JBmxWNWly9ezhmXgzb7 zAA$QkYUKVTA~Kgt4nl)@oEvNL!VZ>^vbPRX_J zJmv+VO)l=s(|ej24bcJRgO0;oVBV4y)(r?VriiKkXy8-in4`hvvg`21cuSUt&5naz zNyY0BrRZknlROc+F-iT;EZ#Z<+mnRaNmW#( z^ylMmo^ns+tWt>M+M8a#QZHU|=kop9{SW)qp z7zHq7ylv8A`o?bk*X#9REc*Al-sYDH_xm&9Zw}D7&+>BlzbyMlhwQu-LFY@_w#5qVf?KZvYc5cHY13 zg7%#*Kxg7W`vjz{Eh-BVr$7xhv(=Kvgkk7v-EZ)y0Gf5z#Q^1WOi%Y>D(5+Z{n|eH zpfj&+XYOUir}&=sM`YF;xxCJ6tpRU&=c&8M(;m3a9Hhi8Px$%FiGlZE73;Kn`#a;E zURe>nOKz?}`5bZBZEhS21k`HGyv5o_5~9uTUQg$FDmXIyoi*e!B@r+tEYvvO1OAbJ z%*e9hvGrL1itn3cycYebajO2|@1jeCDr#|h2!fgjsNalfohm*z3+`sS?&(9uq&RL; zY`(NXS3sR4pCg(cY+#jUQ*%ymGqYB#ZsfA7Ro>MH6A4PLhSS=d?gxAu4W8YJCK9H0 zV$^s*!3Vu;*G<*Ph(2%4##8MHQ+1`y_`L_=sXIhzMmbf^AGo@;upYc zVe-uJDCQ(8>eL% zU+ZDjC_>uvuC19?9!z0A{K$iAj6}?#y2?GzTf#CrqH1bB^4A}^G=NwXE;UsV7|bA` zLrQ+5aAj%|YZds_d-3Gy9WV)nIqGWw)SpVMYqgu;c6Ko(Z->Y~b+(bl29-G(YQGn! zuGQS7K$z?IH@gcu5FzgsslLN_oq8$#%;u{Ly1ZOATX1NwGsgid$jANTB#Mk*J_F;z zSA3$)FuzUo5-zzwjrPD5OWRw zES)*7*b)4B&C{Lj(G5%YYipurOiKyIy@~rqsHq)VOkE|6DZT682VsAP9)gP%;MLt7IjBm_7jm2Lb|j-lF`aO_vm8XT@u5WbHS{` zcr*LDml7PC)yMKKR zTKj$^KitMcj#fz%e?d+B3MyCgqxk$te!Ya7tJrH4Q7wsYStV26lPDV!z-Fn9g~bPz zaNgqzR*-?R7SD!f30(Y}TKnfG>DJsp?`(GE5d1XNgIAy$~n> z;6>2~V0$?G{HNAv5iHp6-H%zfetiZVMZZKxoGg0uUcCY?%gCM2{5y6}kbz&uVZ6de z&hkGZJ{$u=8QwG}9$=b6t0`F(?@y-nF5W;%pZ`tw#uh7%`}V*0aWlO6A5|+$R{VwD z&T)_Nb?PV$gNUAe10am+W*TI8589~teyt>4WCS4)w{HE{XsKyN<1c^eJ<>m8I(`wJ zB^PL|f~SVx26yu)}?%dm2P#h6WXmGqo1~aLZY#rQ58K_nBR?eFN zk$GNo=Im$jD6gvN(03#zr&@2_dUXRvAy_K|G!d2 z2*g~xx^Pu*+#{8}9aLN+)en!iP#Qc7g+#U|*ozYU`Dv7FVYq{4eg3`w)4O-?!&{O)#vaW)z&+yvfd7cp>KJq^ato9ppC)SAd z_mf#HF|SI+*7g^B2!O2WVV&rct70!AOK`sBejxjg>A(7)9^{4}Btik8j(roE2+g{S zWt8!?<>Qhw*hctmb}N9OlQ{bD5h->aHNw-nNz)7e6I~I+f>#GVqkfA4PtIvm%JE>5 zq|hXemgx{~IlDJ9gLp^M$yP4Wd)ZN-=_PtsU>iRf-#=ZY_P?PiO_cs-IoT*S5jI0%1^U~&wY)-s8kYS$Hi9CDPpyGlv@ zlA0Q}-N?w`Gs52>IW@-Jt17t0S2aEh{yD}(PJjSLxv>V4RooUHlg0S1lWp=X8yU^> zE^}MJ_;1kPP3p%Mq~CkiMx6&k8PNYPI!=u)87fzH_GKf6#aKPP%3tlxG`~6-VA;m5 zItUKo*QQidX~q7mzzPv^<_X){H^=cNfMu{pY>c3DTdQ4+ro#UXT<>*Ys7=?xUFdL3 ztL#8BDMrs2%r>3=TueAbD=%-XOolU9Wckft{+Ed42c^)MUPtrJ6wUP!UtfQQ+~o^_ zrk3u1GdmWXE|ZwVPYhZOi&M={x6`5P=mq{TO}drTS&t56stz^?{U}I&a%Z5Au}pIs z=li3$=?rIYr6nzccG>BRhm-zy!Z-p!WuRpz0I}Mx*QwopCt1}B*uNpP!(E!x22(e_ z(syg=7#mXScC8`Zly*m>p^J^&>FJ8GiEqo}i`M*~WXB{QXR}HY6;!#a@+SW$97(gQ z;p?<-2OUyorX^c5m0JBA3OztIpoEST8AVthkZ4 zD${S2Z5laAiuNa|qow!>XBIk4+@Wn!Jvs`RLj0QK`edZ{NiQS5qCk3)hrf&Pn=se545h|fA~J-t>|)@`3(kT|w{zZ(CU;ZhSxnF;IpsYvM)f4R7e zmd>L$V!{)?ZhyrkneJmpY3s`bNOrm!%3Q8Q(SzJhb`M7} zqU9A}id7>EQ4xL$MwaIjTE05$2sy`U$()+chv}|XD(SE(EW3s5PyR5HEuA}_906jsf;qA{AwMk;@&@2=|dKj%< zS!YQA;(;t7voAmid*$1)4uk&UK}qi%a+EivQUu@JKp7KJCw>3uX|;MCi@sXfC*5HL zZs}pO2s|r7&qy^|J^VeNV(F;J4bUV=^HBW1(<2b?SvGbwIW2lV6;Hmi%au2jQ~+nz ztkB~|V%+?1Ng@78A;rGM*@b66_-FZNyQdTv^BXWIs?gn2ut|RNF%U473Y78#o5<(Q#+BM2Cwl5`#Z|_d> z_1qR0xx%P9g7P|_eza>8TvtJ$86~D0_yLIk8BEtB_fWbO`hE~Yt>~1F1Wa5^y!~#o z#r+jwGp6J>dZ};pCY(3Qmh@CwW(LqwLe!w^RA{~`Sa|rKJsl+dD4?YjpZ&H%X>=g3 z7>ruCeFctm6-0Gw{30fhqn*!`)t+GRazhJa+?~5?KGj4C5p&lMteS4@TPuVQb(Fbv zH?;Osi?_1jv#xk^ejLjry^_}9cGOMi!5dAKjH*fPHa zlG4nJ^EWMRFmrzYo}SSm{qy$s8^CJv4b&LN$f!)sa`fH0Yk(CHse*hAnLd&9t*o03 zNbPH|T!O&5%9XI#q>FItfqlpcIhu!5bTv)VyX*rLlhS5t;!8oRescTIiudzc1S0paNaz&9x&z!m!q+qK zVl+86zxUgrNy(Lr}rEPbhQ0+Efs^W~!$Be|3?$b53`sXF~|%$eDP+Q4-Cd2!az z8A`^->r37~y}8uZp$LOEz@~U%|5^DLNo^f?t|PGioM9k5kDukv@sYtQ!thH9C=Mda zu}wu(x3!f{vU0B1@xlr>VLJBVLi%|TjiLX6CTI(LsM z$q`KkIl*v*T_NQxSA0{8QW3*sz!NZz#8Q{L)z#i7OkDNDBcV{~4Uq&*%@sM8uZTw! z%v{xvf~3e3s`=KhtC3 zG(<<`V5-=YQ>}BT0nYip+*g)>lo9FVI>RKB_>(-zJje%QV(rZbV0YK%btc?vF0&nU zK2@EGi2iWo!&>mBD}3O2LP$qfLJ59#K0I*9lfu!_Iu^roY3oUaeA+p$8BQD_P++)c zrxC__9WjMwBVSAItyKATMu1J#vEVV}5V`Qap&!Ob&B`x5{cu7qAmGIZdAYC`fu-S2 zn-&KA@!YsbnO=2CY7`NgWVwkKJrpOv{otoeviO)@!T zx~H%V;HAd;}r+sK;)A{~cISS(7j6{N@Wjl+xde%B?;cIxei1Te*<{zfW zHGaZbwv~*Y)fb!_>XV_;WV6`#xRd(W{!>);@p=UM-`pCsZ`En5fdSPye>N2PNO6ru zr=QH>zN@EC|v5(Up1NQ)lT)^byEUyT1pw@uvwnT%ge}A;|yX$FVT~ydMiu>c- z0)>aARj2PLSA-!Um~~nP_If@_u(!lSm%B}UG=b#NQTBH@v$9UFOl7=cqnad3>u6XJ zT@pu)xSC%&5N|=(*)|#@OZPkk6wz7u!~^+NcNiM^5&lyL$QcFgMvBE+<7Nj0j}$t- ze`lyeG`^=New*>xRk2lOcXE0ihtPJI`N&VZJXj`}O+XAWDRA$?KS}9-j9Z$jKssoCBoi)Kts;(gpu(HFQcaHFOk+zW{4$p)8zI!zIz^` zuxz65SUupPNmOnby!Wz^*U!hd`Yb=q6tWLNQUUmvIZ+@?Q6QfVk_6;8o@GDqya#+B z$81j-$&81gJf?o_ix`E4cacSIRb2Fzg}aovR6C^AWo-7{H(9d^5=$--4ax55X&>Ne zW6R4hlQ!AiV5AC72L@w4=l`+y*HKlyU-&4x!9YnB0ci|M1f-==6r@o~T2Z8=yHQk> zZlpoFrKD3rK)RGhBsSf-fio9;zQ1wKpJ&{^?j3gz#}L@>T5r#HKJ$6zS}tZeiovlD zBGoqEtb%h7s6n#vk?4$*r&`Ou@6s}wDXqiZWf{5_kX#L>zLh6s;Hs6aUQ3*_+$b3u15tcU7u=)rbRZ!dK*OAW+B;z z;?Me9Bi-l846A9ABQ2lNM!+=f{P?y5EZReXN0y-ZUjVs3P<~nS6-0JXUN)`f!a7r^Iy(Cc6OA; z`O?x4d*^vK@a!O?T1yGev_}GjxrW`qb!Ly~M?&WP&);+DyEuUSdv$eCzdCytwqh9X z$h~-SS&ht(zpu8|KT#SL`#ev0r{pq z&z*hWDQ7&>A?U!$GoX5(X@;DLvhsvN>(6|`HNuy!|NJpm>MuWpVSnG5*!IN0U`Q zOXrXT!mNG@>gJLt;Fp%|{DJ?4#9SD{S3O=^pfQwO*7Eaqc384p^ody<@y6HS)Mn?~ zrGuA+yWM9!^C0SAkaLuPCP7Pqs~6^LhiQo)P4{m8>d^E1HJ8EHhwN&*rw`(%H+=V0 za=@T%wdwy>L%Gl0F@CqE*vEYa9w+eG!EwdPP%h6Rz7}j9Bw+^0D?0+?v^%;$rnju? z?S3g@Uq~iat)WqPf3xrjleXz16yn*!L&5-k>rY9Fw>J~j1^HllQ?BG^`#qSRoVdD7 z49-nonY?)R(fN0X99Q<4p3^*loDoa(n?zNXXKA42ft>LEk|$hsPTb~RX4>j@|2o?O z^v*6kxk0*P+UH`NHU_E2?`&H?C;Jwqz?C$%s^8QT$UlM}Am(><^RS=hmw|pwNV}S@ zZwYHAYDf_w&Q^jg4~eNEf}5OSg$-(E3{CFtyF^oJiCiy>jU8m?x?YMslj$9rILT2O zaQ>s#pQCdl;;|_DX#2plB21WNwDI==NCnyKX@-nq4}Q&ac=URp%*CGc_Cb!{d7y*j zAUF(~c7f<2s>P@qOGCY0kO6$_Ulg+qgaW{rLU!)d3*AYc#&aLPrWzp$9EN{hJUF14 z5l$je#0J=VS4DC~i?YT@AC~vy6<1201Gm-Rt#W~Q?7&&+V)9KPOYEUjgw(BZ{A)a= zMkY6^)an8CiSFv_e;oQ9xmMbrBA-M%zE`XK@p|g)boKFuH)IlCL5~7pS^C)mi{jI! z4x*}s5Npw-f)RYfgXTLxEDVmUHv=O=fYP8R&)`_Hv$0hfdM z9mylQ*mqCu<8H~0N*|mjQZ#~4kh|vA`&w`w~Tw@e^sg*G8Qgvy&SK4GJ<@ zCZKLOV~z%=Ot$HB1s^H(Zz*7SiUdZTMUMlcLcq!JgM7rI91{rK1QTM8qhsBK<9XYbYZ2KWvG+L7zA*dFZA z5$CjDYqnPO)bBk)cFewOb7%QhL_vIYF^>D72Je=$z`f!um4I1zhAb-e1v*Id)406G zcRzywiAG@<6dhx^$?S1=xYsX5$gQ?7b*I=xQWw5_F}awp9Hyd5BPu5F4h>mxs5MJ3 zBxOLzF#z+WyJy5P*n$o60-E@PUaFJcb|)9Et@Zx31iZXYaWTp{bC4 zS5^0I|KEMcHc9DS7>pB<1sNEK^~kI@uxWYY1%u)w-<+er>wJ&?42rmL4&hG}KT@%V@E5o!8bEb0dV&q3AvTw=y*JApolE@2iwcV9d#b2ncjWglD&2!)J;sK; z1K8&w2%a#y{j-ol`!eW(1ve(PPtqE{cp#wDANBfi4l`zB{t<9$ZxH1?!wj}u(!ez& znJ3~eN4(TIEqAJTh33V&yqJJ01(nHFTS(Q@SXVN?`>;pgEs^O8$&b5zxxY0M`n423 z-Hfe2dkz15=FEB2glAIN))=#O)b6<;!Us*jr)~4kPxMzrs&a}T@K z&d7JRCt9-xX1myK7D5K6caoiF%|qSdE!dQ?ItswomizXmb|R&9{V>Gu!h|2L`7AJ8bA67s z;4iR7=_Cr%9atXLxEXIi7e|)P{=PSx^j;M>ON!=!gEGn zCY;=hA2>pfdzOj&AG7wLf!kMVHxRg9`;HCjk1seaubFcjL%_-Q zkFri5HWyHps4rIp*c+yH^BxrRpJZ1dcP9xBQ<#FsJn0}$UXt%KTSd7%SKrR6{voo! z^9iU_^$R~c)QFz#)xePimIjhzIp>5l2GCoM2>m2`K9(`(`T4mKQIC_%C0VH#m;HQd zNsM`tZ+-~|AtnfvnG)8;`xN(dNQ{kS8@u-H5VFhCX1M_6z?1Sak02@aCp;zT{sl!7 zT(6uXyYa2ZJ@;XxWY5H=dBLMPKFE+k{3=BC?im{$<1;7SfN$Zkd|8r*tHL3o*58U4 zsNbXfat$Fy_gz~^P5_}k;dAwW;bK%}B0$qRwC*m14G152$mhj_=%v%079KTnT67E< zoRiPh*@b^jhWl!)*bg4#To*IHi{ucS2N^uZIpu>+)Ci|V>EW3HL;P#KpneO6yVgDb z0(TuVd8T`s9ppj!zxc9P3t-(&X9695mrB_i*JB?U3RE3=>H@X1BY>tmy;<$u|5N(U zzE|-Gm(h3Rkw0_~dgr_)a&+yOkFNi(=>KVJDB~~2)lJ4@6Y8td0-w72qU!Hwk&epx zGXB@Cgz^(I)NMcQsz4;YbesCGiX=;G zuEWNksC@x6Frtu;qKJQ*slgg@Y4mlSDUqn-noW|(WfqH`mh3jHEbljO-E3Yc(m<24 zJDT+O>nW=%dqr zx4rPc+w$hls+-V$aUJGY!WuRu&&OihDl! z#sz3uJj(NrO%X@xp_{mSIx`MGJUWbMM=f@$Uw&YBubEiLp+u(nE9teEfu-e(WCSu0 zCp{r5u)I&_sMfjM_Hm5$R{M@Z-2QTu{_&r0<@KsJwKollG?sq)>e&0&JU;Jp6Iy1WGVw(3wJOw`!*fI_ZHOW_#MAGZJnP6_*8LC_#I32u?ZkDyX7whbe%R4ju z2IQ{eYe_iXJ{=Z#;a7*ht37zS((td&XmsCJo@bt)?c)PZrJmWNQmt~BT&Whzr6Gxj zVan>s;wUCBPd*sut)^Fuzy>gM`+JTMqSg5-g7?&t`X~mYj z>~idvZ1TizLvA~-DaDqx%AUVpy$h128GY_BvJO!Av}-8os%fhYcNq>Eawj%Df2kPQ za*ax#Q!?^b{)?d4p$7V<20P=6L3{m`BgwDVhm0daV!Cp)t08)sr=Cj8uC4$;0I}LK{Y6Is{bk?9p4=Z_mR+G&=Fw67McNNTZD21N)@OG^iUg<# zcvGF@moLU9v%rYJ%C8;n8EP88C;gd==f1#UO{#WU$9s}hikE?tf7)`V>e?W^+t8*& z1eT$c8dNHk)qk{5u;8%6@1cZjwF^i(l6bjIL~fUm%TW8%UJ0>KVm-D0*xW^rt>8OjWB@K*O73;H>ves{UWm_oEiRh(B`GoW+3%8U zrGLwexbU5-kb_}2_S-}ty}bx;{tgPUSGPv*8rLuM8hoJegngg>4*DS`@vUyPewu5% zYWuqmwV<3J(2F?zUr&LEaLdCEx(MG+@OfC}VJ(H#hNQ(quj)(k0ho=S|VYQ}3b z$sDbQ<;ui%V?8^$C_8j>t!kgK@w@H84b*sljr9;C-&lyIR?(Zz?|xoZ-)UP|vT}`W z1d=PjeAo!&*n#16Cl{Lcausy@HCn;J&R4Q)sGlQO4$OSsJjM9hl8KqHRe=pUmz9!m z`VH&7XBsMhCJaNDvFXGXtjdxpFNv*7`xI_i!M}j;2z6tV+orr;ZOqi?boFxbpswKD zdtpy#uhLTA)V{8e)-UlfDoJ+c{T%O^kX|mOo{FM{u5wZRe03I6)e_}%=&dIVh5Yv# zSl!#(sz(ZrK9=Q4tHs==&pm9a5oOozeqZElz~ta>KE_Jq`*V(2yPJY%%a&Br@5f|S zJbK!>l}LXB8TbGPR)*#tlQ4eaOL{BxuE_7wJx|4QWoE^={#-?FD(}RzIkAXWweW$*gvrWXn!)R@_Bf-8QW6 z@C@E}(>_CP%gG=viI@X-@lGSOLUhZuU!5TmN%=UKXJl_b+8ftTwdU~j&R{l<#~j~& zX1HVst0{W#h=r^Y)A0GWj}0EGR7pI^wQW+o2LTXn_0v{Wn8T8!xU%D3Ka($p*jOn= z0$gVbcy#(a}-~0Z`MytvnYAn}3z%T@By3>P*)~ zqNb{K*nw9}u+?)NHNnfW&50b#7M>B+x_8|-1Yq;mQ_0V2$5&SzK8}MOp2E@h9;fQN z-ei+FKXf7VTglwdjd532aHGr$E7B)QQ%($eZOJq#nQ-A89^63M(6DG6Gf9=!Mo*0` zrj5@t$xPt4U83gBsEs9deI-|2RmCJE7hbPtQKmI+))@{zqE=1w^0XS146rb_OG*u4 zXF*+kjf%u^1<#%Bq{1GRL+(lDg7K`m4&uO>ZEOt?^dKITNOtA`Zvajw_HNbAz?~3z zR07+_sMXM7e&=Lj6w_?;nK$I9-GFv4BB~rFq)ybTO7yz*!jc_g<^BXl^uoT)MI|sH z7cB~nrCyv+{^M8%x1Qi-i&!Z1Gdb}qUHT>bFJWNvdP)00 z0j9Llg0I1Y#@MSjX>)a3G!vj6jaf0vARBBH$uyPd?O1pNF$}}yFy5@T>0qeuhEK7C z02XQ_HU00u`NImZ%qW!0(+}-P$wwr-9n@Hc6ykCYXYKW{c5jAj_-kP8hLxzgGsZ%> zi4epmL1zj15{j^xu@Dwv8_A&pR9_;U}1+!DFo zx3bJQ1OAG9JmO!Tc%m^uj?r#+m{@|4F@n#k!HL)D!KG(^FYb8R1p0jPac=_0177l> z6mO8%&cb>!cSv!~|BCm|*=YQ^6K4~yz&*Vpc3@_C@_Nxpanv#_DEP^uu$j!|ds?~};)%eg*8S8q9m!7Y zcKb1+ma}CGd*kHeh8$qfPB;F>M}q%n^fG_Q*`ay7pBcD~N(=jx^_sq(rRVIK;B_{NL zUkRUn#m=v6g{dT?ZDXH4JOOp^4u&5mL$exJzh1DR44Ob`=Iy^lsmK$%h}KkbQW& z^(sRw>Nt5uL4ljarSMUdGUmK+^MK;9`%2~NkoO0+2pI%dloC|9!yV$FEi{+)Ib{$R zd>F^!Q&g5}a{%@3>oa<^aPe%;1Q4d+bxV>=@Y#m-X&uIyU2@ z)SKwefOQrhl9Z5PjA>06EaC8yQQP&k3wqLXku!XGh;wpJ(vFrD@qAEb2@~?nu$;yL zl_`)1#<0OId;6h^h(TN+RfgHkpYJizlTI5N$%N0D=k4ZE_qqwquHZ{M1zQ5 z_UlXh7|UF>!U-Q1>5ZBD7V>ng&pDY9^({&BlOJQb8H${V#dt_ zZQccx-JRgOY+}8G?>t`(Z7{dsmIg1$gOqZ-qK5z8Lu6^!nsZpcOS{$hoq9a02DZ!x z-^HOUwdRfYm z8=0A+U)kLuFq5#c$f12*t|4p}dCtqIp%mY7{9LX5mjU;*RwE!EP0_|dkRmn%II<=?RgL4%d|Hejp30dyg zu2hApY1~1U#F4DDmb1JEG}i$!qXRIUH4cqib>}@{QFFjs-dcRpbh+MS+g!kYpfSAL z`T8(NT-jGyEKvS90PmR7y1^j>C2Fzr-e)<|f@8ltFgLieY0h$P-eotPaA71T8nW)Ps|(wyYkTQ22=x^(w$SsP!;;o*J|zQcs@nUIR? z(wz($973MCEgc;j7|t;A>vh0S%VLtpuPo+Uu?Jl?YenOmwAD4!-%> z_QyTD3vDGOiM4t)M>V=z!>8EwezFg)47DUC97mu zxabZP9?KPfE!~uI#w#v%pkG|(qF7S-7R{gH!OR$KT{E2;=HuGyI;?Hj?xFxkr(|f*7p5(s_f9*8kCKiXRTV z6CV!v7n_}1(5I1QY&xdp^rTVBoGmvJOi`}$3cWcS$GxAI$c??ZBL$nkw@J4=_BR>) zb)5gwX7MnDz2A_Vz`yAxqYNvrNlH$WhVDxEZBG%Vp*Q~AkyAHcewCdGKUyLA9wq09 zvwf9B`M2>M-mK#44ptQkKZe#<{+yA+A0+{+_LL}jD~Mw0WcB;c4>>Cjj#2ofj%Zka zEvVNkRQ+vCK~0F}rhmioQ&3B_=X$1`SNa#lq$dJ6C`@x=@Kp3V5fz)@6Qe?nHv{J- zlQfUA0S_2)N`8zA(VIHYkY;Z*SjXzl8z{FZJn^%Fu&#R0zC^?xx>BkZVCH`{`9J!t30`Q_?V77QOn0=yP> zOlgFF&_3k`IFLNXnKSS4Zyc)ePR~kvB^Wh^k#w>}9=EQW)0RzmlmF-p>o9t|B)R^& z^4RLW`scy$-(7~fmDU?z5hU$bxMnleIbKZaXmX=a)zf~oq@vXmg&!qWgr(B6%jZ*8 z$bPAp?N&=gj0xBkgbyFV+Vtq{mcjvp90(4hf8-$@vD_Be!sTPV<#yVRwJ@9avaz-j%{#wMb_V#%gPKfeo1-E(2TGw&6EufOW8>8Zxw6=EcxNK&WY)ME9 zVnC>S)QHc3`I_8n)h@^$lbsPvc;DJJu4?-a{RUttbCbG6O;M-bw!9#b#%}L|tg-!w zh;cjs!~1cV?ZUk8m|Mf&44YFWYmT0MM~-?$TEua1v)u5q_GWRsTovHxhE}5_ntrT? ziFB$sEVtLaQnojBbuWc+IezCY;xgf?#}*#+li;PWa8vlrmdn1nsZ3jcw2F=#)DR)&5{OP^>ykcxRaRHQE;|wb1XCsPFK*6{Jcd2chGi`6W@NQn1;euk%ED z8l^2sB*Qr2%XC1nETTadYjHcGt+-^>OU+D}A z_HSMx-($5H@L&e|`lbKx*J$Xn$9iyqZwNaO5V2xmW>jGc%ELoVDebR$kwj8PW+8ZA z@cFNf#+TJD@lm>oQCXy&#SphknXC5vsA~iTCIbEovm&KY3I7G{Pkup#p8D>mzj*YV zdZeenDV{=u(_c{1r55NCq9NpZA5US;RmVfEljR)c>#8GgzKol5TyEK>* zXBUe{jn&N_R*KKV_vxh@my8g{73Goo=;JyULBR9$&$VA?nz+4ha)?Dm{XdGQJ3dkl z4Hg97QS3(~jsw29+}ZHos~2GHl5g%`@NYmF<-ce(rJA61akccG+W))gNT{!35?KcIqR~lX+_-#UF zpPsoyCg}w&4Ll$&HsxR38O#}^((F(hs8m1o6~sZiZZ$R7e)0|i%iJn0HE3K6K4S09 z>&$mfeahY7!r-TV`*djUaVc-pVYVA58;tw9QdP+6DkVP8OXm5_NGu&|zo8^Y<$eS|>0Ut9pJf{lpRx1B%-?TH&jsV-JCKv@mq(Mv}d##XO zq=rdV&|B|f8wHGQ$W75Mm&7=KwIYe|=*7UCRL{j4hz;jay7?oUc2&4gLLpRs*H0%c zn%^Y``IBLNLSOD7Nkt{)(R&EEcfi#jz1~Z!!JYh6v#QK{=#gVE=*r+x@LTZ|mI*J0 zO`5K(mj-BW-CtB3xpL1=VCJgu4=yM0fKF$$6Ky7Tay-ei-He$W*-bXTpRD+#%jZp(x2uJ?*fD|g7K zO>vzk*CW|=9mNCXtuk>Fq+(wVyV~zeMG#RW4z3Yjw5JFivYoC{@LL>eJMiJ1_cXi4 z^P+Ca-JI<5^kE9r?GBDotG9DJ#o)%B712Yc$7%5*uQq!GX=QvrZ>)dCLe<8b5Rkrj>0~KQ?0s4_*UAZ~4T}t}K1y_F1%T~I8(}azJw!1tTwY2STW!#s+{WppZMprJ zSS<`2mkY!-mhZSPerDBxHtufnDPs5H$-mF_(ZRat6I!KC_!y@@pe}3`sNj- z;Un5;YVZQA! z>`&q4m_TS4ssBjRCm`aumSTPBQV{}Nu>uF@Y!+_|xuh5U)+^M=<|($@!M{hap8)<^ za!bsm(V6UIWowI1;N+FIY7FNld9`J-u$Y*J@kUo1y?JP87}`Shl5piuejzSFDBufuXLsK(=){PaRq#&PN}kh`$bRK7JhRT3<*>T@t#&^ou4VC%@0d=MR zts}}5mZ)!A`4Pk~^-@?gCM^DZ9({x~LH*4@rbd?LQL1Xvp<@IC_?qTvp{kWXdo^@R z7Um{{Go^vcQ8%$2%*gu|7|0aDKXi5AW}=d2+}lY)_2W{myrO62f0fC$Xh&{dmx7-t z373xDI(gCFO7ss)${cE+qj6(`R_x8k?JE`GYu76wk~S*KRlbd3;hlwp5Ji_x>mTE^ zE8vST#OHkYAu8$Di_aYShXN_9vJMX9vo}wmRuB4sK4n`*I*jnikfqFCg-JN;a20FX zZhCLXptxc2(54-Alg*0Y%Z7X70&&MGNxk{chntSyJgeeA7L#+0wej~*e7UMFm7&Dt zrNjCB6UR@wSZj&DNqVJiOEuGBq*?rZE_N+08IQauJP&N8%WNjPG9tyJYwFXA{S-nR zaLbAEdHUQ7UTmpp4w#Duk9QeHbkwl}Y3(M(9D#q$Nqy$qb5C>g$*`xxipTMOCO{Fm z9RyW639<+s`Rb%C3|zMa8gUR`xY;~c_wC9&)o`x$8$qyfp@Yhu+9fXC{_V~_{@en> z&X0_&v?_wMo!hB6s%0t&X|yj@uC%c()QlA9l-Kj!DmFR*>N|zSLPB0y<0_T$>(p0F zrN*YMq6rg*sJd;SU4uACwecZRj+0GUGw$oxR>b_Xd!cKnoVflsC1o&bLXD3Ir zbS2|M{P7{C4K`l{+d9rlwmPqKcO|Z-pUnk%6$A5K^u$p-;j+6^_bib@q+Me|P|u^I ziNoTyc=b)kvM>^w_P-Va_Oz_OU5h3V&!0+U`RxYVMl|CqRL%gzEUmjM`P5i*wpOF{ z-NJO8Zq#fx;E3ja`R!b5-TS)X{Rd}*GB6cyWf`eaVzwY;V5nOC?QBxB(*Zz$M}Rv1 z%`={5T_Tp`xC`At{j5^;7d?6Y8u*(3zFs|hvH{ z`vb%R9gJ*KZ1CtZ0CA$T6lzKrDf8sG-KTBJNSA+ezuxu~#NDW>Gz2#U1vsiUKBJIN z)_q|w_N$ixL^6S|C@dH-WnbBh8B}F+nykokR9icCvTrX)BXa{l;Lw7zph{zK^Cr-4 zD5;0{m4%Ml(;z~$IMz8n>!>U84~Q7y_5Nn$Pe+clOuP6jyWxwKBWQEs*+aZbSdZ?- zbWqMzuTQG517@`Sw_%rAOJr`*KH=7Yk1=f{2+XL{|o;f~H*Js$*lrPOwl9is;` z_QLgcV*s)h-1PR?`t_Avb!nVlJCQjnH)`*wO=}WyeIWdfg-HaaxRWIcyy`Bg)xB6K9g^#D z>|oGdK&(OvkbC&{8y@oXZw@D_bwOUlA|t4(L1X1XQyMrd{T&yy5hdR z>*udXVNotgOMgCE=h{Q!5wR$!T6$aZC>3kG0E|Yx)tJ;`2w^zYtQ{s?qrlqQ4Sf-f zyBqLP;y^H~2H1p1ZpKbfB2*kPYUR(*@WcvHFF1caYQR^u|m{ zhB?th{RO%!K)p4ErOOFogKGUl$t*5Spew3he+nZ&3E(U?_UYMR>JNK<@?JKL8GS;b z;JU05!K`xU6lFdYNW5sQ3L7b=$uw0WEor2c;OvE~0AOFqh1q=QWXe&s#0!|QF4NM_ zUTs&c$0h1~-v2=C$;N8n3C8P$2zP=}n6y0lPO&QbJwv*B${i85vsZomNUFLQf?C~Fm?h@Naz7j~q8FOp9$#m^hw6$$rASlZzthkEZ$mR!LH~XJKLDMzkv-BlyQHkN zUjn8m-+O&C-ovVXh!T1DM=o5oo2~X{QT7_j#VacMj=sGS3^fd{!RBjN!NE@sVKAwzt*{`*y|2CD42nul~2>5flj+N~vDNShVZhhnl% z=g8o8>#J~>(;ycu5r6YbG*?JkGp9Fp@1LCz_r3q|lIIg}NStEj+e6wsyuNLqKKUrG zi^;b8d45%qcJuU@1r+bWrO$bu(i34FZX)~%aB+P&mcl$j*N1*J)y-x&1`?s%AJ)ak z{ZtH*Z;>3vqN(pVL&r9h{Z~|+r;{3@rnn++RqGDPYm;ELc~EZ3&fS8o96U9YvG zQ$sRpG2R5s*aQ%Lvhe(cP#WWbjX2X}yEKy*1#-T-1IWWI(s?ai4isaN?>kC1LY7O0 zS3#O|HVUvKKo}q~-g~`&-2lMIFzQ`R-d{M2>Jmwk=w7OYwngq@5l_qj8nl;0uaAHoD8r(1)^j6 z=hJK}KHyQKc2o0(_dBk+<=T9ZNa~iQ<#YlM5so8|-SjVHd8In#*cS{1a<&i2?cbmC zdhBHg5%IyiD0*#6ia`QezVDK{Ck&6{L}iAs;QBSzvs7@}P4EJG<6}jN*Y_W#&@hsHZP6~SK=&!RI|bev9Q&ErWs7_#3iXR6%e|$Icj3Q(8nPEEs@_w zV+rI&TT-&&?WOCBK_jW3Ya90TQ5KZe7C$3OL>#8lKMN2x9kn5}jMeN*j+wjYOQq`R z91dfwJL8>l8y@iW%$s^+IOlNOJfS69}3Ng_A_)ek`n1oByT1 zF=#Lc?>1@H-i?o5Cg8nRSz{wcy(3rougb)HYHQvj;d2$vowAMY(9-Q2GAnUi=mY1t zYjNF5uh6U{rns6m%}HtmG^|!Uh#qQDf3O-DDJ{HrwG9>RsM=V3r^6|-Lw%4QS*x-g z>GcNKZl6cr;DAxvJ1hXbONJzNK>eyFD8X)$X{|-nCCy}OVfIpKO(^G6d?py{#UG5v zTQ;X+&gA7h+a1l#LC(p`Zp{gU3iBb3ZNFRoMlhc7(3~q8s$kTzQ6Kom&k}(#_>l=> zT=qMCR8&@gBY=ilq#EwP^EuPUS7tu*%{Pt~Q~Gz5XPmk)RAv_SHeK>TPXLj~L4Wv` zwcE4G1H-rWqyh=nL)jc54BIqwnw>kipcAWcY4V+%t^RJ+J*dgY%{^50t?SFT)hsXH zNPaynEr(<>Qk-fdP-a|{yuY}`(!!%Zh5KC4&)a<7rfqs?<3XCy`GU-)F5xJJF z!rUg%n}6HsqkNlApgcfzv;h&p?VQ}~>|*tilKKVP@^oF1tWT~duZm|oB?mTOh0>u8JkhdJ| zYoE?>59l)P$ljqQgOpdV8tgX<`)Lf%0nZyZ^7ktMa5JDM-EMVidwr;`zxHY_WVFkDzwyakTtB-?18O|TtNGr#k z_wqfgX?2RkI?wIz=^VM$X=X))gWp_|U^IC>QH_Y)dZocf+^_DWP;W_5fN!<_uYZv@ zo2_G+D;Kj^McZ|RR-U(5f>F|elTX)j`zNS|35YI+nY|qbt%cX!zD?FT$SV6a3C#O| zcUt|0%tF3jIzsNt0c};7n9QTtUYa;g)5j6ZV_Hn8(ja!>bP5sUmJU|pc=vxWL|+Vz zxhcTYwp#JGj(6S-A;?PBM7>}%$z*drj5Hv1t$V1X-)~!-m;3AXk{lyTO+IO9O!L&k{ioR~tLOv`sXS zb8YL_;V>?tR0;PWuwAf^r^2SkosQcDVWU;<_NRdYVdb9?D{347Y+UiH+3>7!$7*j) z1Gl^}vzn!;5|K6?7HaHI`2&No$30V^gm~@re@vBSL=H zWteFmgx~ye6pJ__da#)8E3og^A1FLoy$*8!wCY3Ia_mdr))YJVG=WM=Xmk_$X5Z4$ z4xwA|mE1ixBp`-;l$~0=9Qh$0QD-!Me^c1Yn7RM0lq8(cEh1n zO_Mjhk|^;)MB7$7@3NZs^NftV1G61fa2R_4CZ5xWko>Cn24CLnKTaWoqnRy$xP4Zj z8yN+<4(Y?n&z2rArpYW(s?T%)o3d!H32r#pV4-v&^b}Vx+2sb_D2$K44fX^g^rMzf zvpJ_>{*p$MwNw{UT8<%E19z7ZGz7~@=U|LOlZK4o$te|Ylx^|yCc2B>NugF}K{KiJ zol12xld1m=ze}LA(j~>vs#jOqi$0rQiVKR(o6Er2EzddU<=}F`L4Etm)3zmLTFOWzH0n&(hH<0$8gwcr2AC0A|(X0#Qb$em{2C zS>T*%b(x*JGGAX4{e*JCg8@D(-cFitkxTG4Icmu>V9EoB=IhL55sa9MX%3hw*0epTMt@CMjp&X|Zdar^5<=I*mW@}V;WY1?p z7^d$PC(K4v!r~a`rF*iOG?bZ+UB-ljL6CDoisTHfW-^7S!y39Z1coyn^~9jFyTVWc!y1bD2|Z5qwtKF0*qEXYPjWRnx7g9M^{zY_);KN}K4vQ+Qf z=N=OGnHi3d6yh$5?$mEA=lxC;uGO=PMY#s_DS#O3U*W5o{=_|-pxGyKyVA1nVJv5a zi0qo-hU#Ms{Ni6XNb zGB_Sw4H>Uc9!M7rQj=>y%nlh_eD^3)tSxR=$@67&)@nA#4T7G_Mg|Y#qGKexQ=P}A zTk5i67tuzq{ay*SDtjk|h{f`v89QEzxA$tLu@v=d)jrL%R>Iw*bHR)6fcdxK;{{92K*fK}Td!Sx#d*GD^BBoG39A{|oja$NEm~^+QfGPW>&@wb zDBuWFs|Q$B3@?Xp-0OMe&-=l4A@CkJ$ALhavpI-bgA5UN51dTp%eB=IqK06t%1}0_ z+XS3F`M5xCV(0ZETIP-aB~Olqiio>jUhgHMAWQ19FmZ6fQ?BzVc7B|ZnmcJDyFpQ& z;`mOJlKqaMqm$nT2Fs=u$TywjT}sJljeL~*hhpZn6Ti;zCU=;@GjL*8tc7CA9v*N`w#XjUCb;z zFD;A*Rcjvh4k(Uy&2>iDe!PZ%{d|(mIU%;kX+(Hy^K5dT>aHP)AN4&$jesujRUPs1#^@#zk$X%`MbnHZEPLeW!)icV z9e$~pO%p%hqiN-TW;Nn>&??F`?|DNu^?f=optQoLJ)P+8yhwvL!|xx(4Du~NvWl56 z7B__)B#ISfmja2Lg3ac*m4Pq<;YX6oaTeXCv$8?ChNM32cE z@=6wv2}u2Bw}n7C+vn#l+U1KL+ksF;Bn zXXRhjDPsL0Innf9XyK${2PmRRqx-8Ou*f~}0afeCF4q3ryq`f1DnrwmLW^NZ3Ee*T zRgm*ma5U)xvlhNGS`C+NzpErxAqgwy-5L8wL4zRog|X`#u#6r`bdG&)F~dyh%vcDh zt&DH=CLU65Sgp$l7t{mzzT!SspY{r}lq2xeCwRc>($N8RrNEo*Ez&;5`F;uE=N=w?tzViF&bXC+?|J^WwOEj#DWqfeje|8d!!0P1O2;vo>a%lko7nrj}k6SCa*D8_X+ z4x_WeNy8(YESUYagKx`7h3U6VdYWUt-D4B7YWidi8P?Z*y{t>c-O!&Ss*h)U zmf|#}L9Yw{UO1xdD@u&Hqq6&ahdUyzSSac^5SzYZh;4QP5gL$F@dnd;-P%kv+n{M?Js6}76gk+)uA`c*R%ONQIlmMk8s z_*CCaNH9Jd4#$5HWwjw*eO@hp=Kt2=ahXErTM*ZINbp#d@R-0+F)eTI)b)t zc6Y-XgfA3+AQtp@Uw*No!0m4P>#18^TL9=>;I+o9tdM$Lwi?D*DcX(c502GjbDEZl zcVO0*a~*A%rCmFExS7}#|LF8x>8=;Z2>s&xZ>r@3{h!F z7Dx|}U!-JGUUYO+C86;fi{fMPhDY;|Is3U&xM0O0QQ3ob*W$1hZ7$00Ps70kdX66qH5Hwy@LJr zF7F*wW(x~z_4E(^zmmQXU|ZS!XZq)3FQ_?7TrsJVwEV+VAipMGsaotdaKu8bjswsy z(Oa=Yd-vXZqF-jYoJHU-fxbkd(m#}1bLe8LonvzW69Zy+_w8jakxT*C-@Bnj%u)>3 z`?{{sCCU&~Nf#&FAia}7ms^!xZWdIWyF8!y`~LmKs_W8u*x1)MDd-5EdWdl{b7gRC zRDKG`#&|N^;@VmHr8Ta$|1M@BgrDEKqf8-kYs`dkIyWr)iN+JRHbHiri8JYxjsDq1 zHEw&=%~L_`&zubd_E+xY*;Tw|bzvRUp^KhOXNuqM@HyxI^bh_n-^qYf59d4fyU`Qw zDv%7vAKc&47DN3#I_k%HWK6Z{9#(*!O~L`yYv;PFVD)&JO8JAdUNmlOih}!bBtT?3 z#ZuuoQFnow*6CovJ>g@_%+0kY-mN|I(^b{;kX5l;w!@b@6cv73JFypSgWhA*Q7?O3 z{vd?r=*?R--LLBQdD$49HO*h5`;Iv`aK1I;$#<%+#R5!+j19==+8AI9lfSo+6)HE9 zeR0B`>X%^k%!C=*yYQ;$;Py-uZ3=P6zT51;uiknEz#(V-wVdm|#%d%^~6n8BNBU$&X?F-jFQ3%Nj8(Y(B~fcOo@=*4Q4kRlM9aR`n+mgoCRNLe?q* zKkNttnm0Q3r+Y{YTuY7o{xA04I;yHQdK=xMSO{2vk}5|!RJu__6r^KIE7ILvqJV&a zNJ+PJ_ohKYy1To(^UjUu{O%oh+%fLB_uubZe>l!zuYA}0&Nb&VpZUy31hh4bXuq=} zpN-2*NG{a8Rz9#tR`nkvbSYkjIBO<>Q%?Jtg2j7e@9u#N(%2Tr-;*cJ4W{7QMa0-K-6?be5w9M2Jjxe53HfA@ypo0 z=}_HfitvKx;EDZqv=rNqAh`gik`pcT6QEySVF2ft@<+4K+rHI^XbQo|pedk5f@`n0#5HWn~%~UIfneDl9y8RJ2C2=xPKI7>V@h8)gmhHCmVvOvWNEN-kyhiOGHI;BM6%pT# z?{r?vZ(wAYl=ZU+NFF`CaqQ+|*Hqs+ZRTeMT+3qDx%I47AA<1NP^9%W^yE<#)WBKz zqR=0hhVdYyA$hXy`M}bX?&0cGw21R@VCa||@mjZXLh7JA8vZzoAK$H-u?!9feuLC@ z3l+j|Bqha91#np=-GvMt#5#&}DDyu~MSP{DF%zcjelZ}5uV@Xi@9`+LWlE7q932ba zOYMlJ6$aT&HyxI}iJspRA4Y7rBPXBX&CTeZqQ?IYYf4f^kXVwSjcfuM+>n(?Eiy?; z%J?CcM1npWO^VEMCmZ_j(@%70N(G&0rk|J94{or*52-ebQ2>t}kjr^|# z?|^kO<{`7$)?ODCvx}}9e4&no`&HVEjCB1r3ob7C0aKcrFau8XgO(ei4X_v@UwTVlC*C7BVdp(l>i$v=b+PURmDt%o8Z2;^x{-R)x!12! z=}+7OZin`ab>ixaZ_hO!Q;OSvwMbmv^KqGjz{kP*=Nl*`VD<&J&0xO4ZSn{SESA)O z9#(~7RiyP#59!gXR0g5Uf$#uB+IVnUgC52F7oR_exe5W(|5FCGqV=WQm=)L-oXT&l zSFo>3MdS0_#NsOGDZ!!k`4@+9z>fPjkMk-q)@)F|KjV@ zB;=6wf~UeIBJZ-m8`AC0IE^bbefOeAeS&f>ryM<`A^5etb{&!D%G89=B}g8XUt{ff zny%l`iKh@d{xH_19uH(W^t)8@MRty8ZCb7`id3~wC!QhjF5Um;FlYgW*nT3mzy#{< zJMr?R*ZJRyUSDnN)+XyJwfQ27dT|j3z^=f@KO-r^MK9O|`540)AMC!d3L6eFb;LRm z8#d|Vi0G$qrg{7!G1O$*gU=g-@gE=+E$({nbH)PSOVlJ=f6$?OE4|{L-WX6O=sv5o z;gd@I#{T>Y(39%(fFcuW5-c4=~0ErolHmLM*W)r;R^BYzkwvotb-c zv0PV~ZMR~umN~4Fw2v%=cY5-wzdUNP)R64y^8u5HN87e1BykLW8SI(w<2DLzO~FSE zeJ9#pG+O-#{w`Pt?2Klw=kFj#9ss9oz(2#Qz)b|H-4<{vaM@y+?)=l=fxk4ySRn?P zfc6-95ka3_Y}*s8zSi;b3l%2vnemd!w!+AHb57+ie~#N|f5G(I7yMqeKg`m#)2JkV zk(skhojwZGg2NOA5bh&?u79m~8~#W+CXeft=v$ei(1MVf zdg{&fl>Q_NCsL~fcYB|QvrpvoU6K%fXWURdL@F^?EHP)c_Opqh zB&ovOHTJUQJh$DC#lAdOO!rc&p^L1!f~@5KP+3=fJ1Txlh9E>+0jKebzLszvos{va z{=A2AV?_rH$q7fFG;bBm;PQ>|W%$eR=dm1jah*LwEeT3pa4v$`xWz?QCb?S6{rvLO z@*8QgNOpM|gvxD$>1k?2mn8os-D+q*e*d=z&yl6>Xd{uAGbbzvu2;&>%=Y(Z zjx6;#P2cM&EKc}yjP_R(Z6CstI+^5rT>JR#B2P3N-9d06+GNLIY@>_o^oQ*ut%b+{ zxO*<&ga`)eARmmy7!Q_MtCIawlL(64c}nX{S%EwsPaB)Xv!!I6Uat`OxXKW z#!X8SO6>pX*VZ432co>#MK1I5Ql!)u)-fhdD3CQ7v7<~RQ!z8%>&@#1PhC($Y=LSl z+s(~FZ^V$_zWVEL(wf^SosEc=+3)Q_j3K6DKbxHT%M7+U1pX`}-#?(FRqpXFkA5GQ zEo$DSDz`s+(K?#}VSNz>f2SP=xb4g-(-+(~Q%>Q=Cc-6m#hU6zEkO@HUnYGYtNgGo zn)dKUX>40%=ox)x3Y~d?oE%$gMrqaitPuK%55Ha==*O3AqJXWW2OE%I@Z$$HT5H`_DU^h_`w`rjl_n9 zd}A*RmkoLql| zPs%G!GBsvGea+Mz7rFgT&rO5-?*3i4WQ|P)T*6+B;k7f~TP!4MH*!MgZ&8SBT~&nH zax!)2c4*3%WEgp*xjOh5 z?D^Y5l|tWe_7|%>F5XnX?{zbCOV$69k?k==_AW?Ei9{7zCaYwUMYbFCHe8!3*-P%L zz{bMSxpjXs;R&;nyoT#|iYq@D!Z`X~Z7=bt6YFi63`PPZG>wZsZ&dNPV>&7Rz^%kHAaWu3gd!jc+SO#}N56 zRP+a3N12&id40iH=^Wfj#ZG-N0r*%BUSac`EPWQ$JKdeJ<8@r@tQwxebzpUxs0+l> z;%(>sRm@0$jqt90fUXrjtsGr$mOMKpy3=B2?^inEiHx+gJqwlN$5b^OvOWk;EZx2> z2m3`ogg}pMC#vGWI`#nKRfw`R*jnte2Ul)iOUk^$=P(!3HY-vlq^WAz+fP6`WI<<4 zb^-I;&wzT(k}i`a7Y^4}DS%s68ieh}(L8(v*?!c2Iab01-R0Ub_7=hc^=I`3ti_!t!$ zsg&xanq!WWi|py2SprWT`1pwNG=d<fUx%TXHyu#f$XhFyGcq<8g zb5~4#3`E7xYw{3q@zthjZ?swT%!RjaQu;s@6>Hhr=-F0q`j4`ST>j8b)vq4l4@mH# zQ*{!3fH}n9$@?%hangCsc}@SlE0DaM2_2=DqkC31!0b!F;neqq!UORD6{+&WM6{q2 z3C^()m0FUu1!S~eHdGSempm4H4$pFxc&K}bMRs>xqH1KHr=F?tZdfix<=Xie#CC3q z%fP1-sV$(ZQUELmE_ZZUC?eYVh1S9!wG#8%;s74*w>*C25EIY@)AF35s~Ee{rWtWp zcG~g>)mwA%R2wSlZ*a+a&Asvh}zLx{#0}i?)oi^_VeuT`JdpQ|6Q#7|6Yc@ ze&zY)U0o<5y`#^3p1elzzn|D9gB4qP^W*o&%s>`G+~j}MB6rR^K>XD*b)FRrr3YS( zbLH(?BrbZm_d#+7W{^z_xdHm`2(|X5FmO_VZv*u@@6X8|%#73w&*6pMx3CN-ShY_fMuUGl^dUO=rldE2gXvwZi*FUT9*>yr)Gy3c|zn;T2>7c)8 zBwA7eaVF?O-lQTeGjCk~z53riF7Z%ngkX3HA<&?x)wktg0rXxsfn+Oihl20Ps_?(s zs^b2ip5k?E6-n{rU%A-xljp4iW1PCi$0w^VF2-j+t!^k8(zQxwkcP)g$No>J zdUgmsy@BM()NOEEa;j^BN%yBCzCRdS`O}xS?x$(i)G&X#5dklhHLLoFJZxYSB9}MF zhOQ+G7R7z=O-0jg?VQXd;LU*L!kH%Jl2%ZfHXm#vCiSf+iXb#iDSFL$VRSNyYAn*m zTvbf&xsJ!k!h2VOTcnyfA?c8VOvKNAV-gX%QEroIA}6Qc#*Jd*%GGpbq%lMB7%otK z&=M8_zbb8^NuSos`ak+3ymYIe2dZfic8Rqfd3!hA2cGve@^(J!aOILUY@lnk6Mq z{{&gAo#t&OiOcO%-gm@V`fHX|3E)osakw(}bn!>guNF+E_W5cT z0p@I1r2o*Ad=90?=wQOoGn|s)PmVrBj%_O&bVDT$@HcQhQb!mTh>u?-&ZcYLAhN58 z_M81Kv4GDv0lvfP7>8BM4|<*CwDnMM%PY{hKZavcrDS6Y=2x^yx0u858bIV z`H%{dt49gsPk1V(mlS6!mYY0gGnEYYhVw-zDt0r~Jowlu>xW6(;0cw1&uf_|fWrKq zXFuk1jq%jqg979C;>D7>vh{l)$AZT$oCx$y*927&ckLmRfL(n#`tJZ91G5$uJbanw z39$Nz`{_wG>v{Y0G+R9dbJhw5%%>}r$x5q^EXFT_2en__nW=#+px1FR6;8sMcZtiF)I{m=uNC~xLE>^e& zUHQ<3I#|=Y)~mP7i50G}g+1;jE{?2;&ZMnJYZV?YD z1^O%d6&NB)MJ}DUYsp?59j1_h3jt2g#^$DAk6|#Hlu4B8M3Y8VyAFwE3g;Oak>7_dg(W&`#9BW5KbN;YWZy z4h}5^LA6vllP{i1F7H52`ByHSrG*s>5wy}RKRwuR{?Flb1+;c2v*0`R6pQB8rJN92 zV^K5fcKKb@@Z>=l=i{rCU@->)pa3W0m6cG)*?NaUU*++P23VwcTH{aPPlfrC!foG% zj7m_R4BEAnKuhzrOTem3xT9MrTb4C#?sH>;{`%=-Lk(A<2NT0&7^0?iAAIY{;Wirz zwrdy)6;T)jVpYl-feGrwlDnVY!Z(Ng{3LchTCXX)4UH^+nO7Hs=f#d!5{%<0P=&|4 zv`rnk?ON%l#Yja(52Zo&LRD)dm3F&X)q3GMSJHLWus|Rt2mP1=FlFIR6372&K+rfY zk#YTW;@gi@xtJfa&cR6sT34+-T(}gR_p)#^EgDJlQatcLokIgY9L{bzTzEXZGF$lB zj}iqqFPtX#Cr@5C(t?Nh;3~u~X(oiV{^QYOt2_y-|J!ji)QtXONy^DTJ~W=9qAe2e zXfhPi)~{0OI<6rA_uj)9f1I|iP%oxa79baJE><#le!Wd=Zb03onVQlUGqDsBXH_53 za$|T7O+g))y*oBH#&z1#-sIxcG&)CRn22bq(*JD#-wBcEL;qLGwq!n;m(Rb+AD}#e zE`fVN4~Y=}&T8$ewFb9+F;z?|JGE+EURTRf2KsMnf_QAwLSF;w125K_$-HR6jpFg85i;kN2cQL^CKU^;3ZLIdu zQLateyS6Bk-bsBQ9n8~BK=iQoGPhb!>06+97U|vN(dT7UMX5Is2wmn66*5zAAI6|R zmO#n|^7-{Lm9bQVQuHEs7_@@(DjV&b-YCh_CBi2LNcz4(7_;oUx#F6oXU2NjAa!9i zC9{zRHa2*P_WzXYU@_G8phj0Xg(M&$8393Z3MSp zc;l=1cbL=vyy?m3q2`t3oKVugzbKg5x2Kmme4wGh_Y$+_?lIA&QlSAOf$j(wA}MIy zH}*$++*zS!KlCz!Umh|ZJVSZG8I`V6>o-Shp580fu-_|(_rsXyr4!U2n{O_-;%2@W zJE*KSh1v@eYyY{ybNHI__|;O<&y4gzVPv=Ad-qm9idu3%e_PAw-Mzlk!_1w- zR!G__Wc^b|!X1Pfi}*WwjWHQXz?-cg9Q$n6M9At>BVY}+m)0Uu_83AQS1(!lpnga9 zi6FZfs@2O))`44_i^|hyLNy5j8`Mm>GfVRpC}QNU-eZv*D3PLz`OxL2LPMkZov=h+_;CtHccD&?jDd3HDl}%UwlZa#`4+TT)7w zWdbUY|LOwRzW}%hDEo?@k-=Y_tkoxbY-Qbf_~W$ikT6+{Uj_cH*<6yyqkv+o6+aP* zT+yUVz>V$dl_(&$0S>0H_n))OAt5n|xj;v#&dbk1awEJ~{XCGgcC{B5V*xs&uc>7&%rvqP>wGlVA(3=kFs?);zO~po zy2JGnW(C*Q1+&*l<_&8e-nyH!c_lLU9=C$}!=?(P7MK^r$teN+b6U8roYk?vOTU-0 z%Rgn7_w}3YTNC*xzMjsq5KIE28d zW#$#p?k`nbUFea!m>EepR@P=F{p$*mw+l9Mhh)23mhJjw?NF6Wr_WPuHWiwz54X>HCCljy~!VdJADhV#Itk__wFJ%Z+^<>U% z2zKTQcC3j~>ZUNPtr1T(-cllIfdL${BlFT59NzQ7!DZrM(>NR|9B$G>5k9I`KV5DW zLZ?cmXT(Po3l(?QrTuO7W?v2I2)tsn9giXj&EGzW1>nBzZMh93XkL7lpO`pz8?Qr8NF^sc~M%1S$efhnGpeTrB%!)@k z1uI>%+}yAix-9^XB)?rEQrJD@jN=hTW@qvz(g2GsZ7|3rzBHvX)r)C<$Aex`HJDj{ z@Vi${&07^^Ip-&k*-?3>F`H$A#hSKncr+WAxLI2E65iyvkFuusJ-!?>T)fElN{lCi zR>ud~XAA@WImR`OfaaIKn^4S)>~xx^7hsf|qc3m{hT!uzel|okrcLcn7fWmLchqpM zk@RP8HGi0@vs_9jrY{Xuc=^h~WKY#fGoeMf#C#-%2Utf7kHR&sUn98}#r|=>-(=)y z9i@jrFjM}%x7|D)wnpdx0Yeb|XhgWhVSxFqR>(z-s11pdJUMoIPLAg!NO0^nI<@hd z?Lij!07h-xp~}Xnc6o(q^CF%b>@j)m(Ko{eZtE17>-7{sD12&?FPV^PyO;efPuj*( zD|uug$yAoD(YI%5+fP#@V1SUQC*J7D$B}8!L?&RZsg+Y%K}iM;+xKL=>es!GefZkH z7La?znv(j066dj=kj_aUycF+Zlypfd&1zdqd8;D#8R!+QybR{ZXzc@=@{g?RI{b@A z-%S{3ih$ANUEz9l*mRvydm|&A3BUA_vPs7Jldg2Md7!G&EEsGKdZ*|QJL&2L9juX6 z*qaO#0=>plZ}50iHaHqYZ0rA+g!jrav^s0fQt7 z8nSquf}fH!U45AqZ!7%X)$bZLlH2FDd%oyFT#}oY)GR-3erVdEnxN19({4CeB+bil zg$rl3TM#v=RNoqYY6#G#rx|n$5sHdpgpZYz?b?n}!5P@vjM0@z_s8b`8T_B^^K6tM zPzIPTW1cBXYl%IIo}ob-G9Q4xe`6^XTG|b2&pJH);$OQ<5~4%tg|#9k^rl$60$Z{s znyot=p-)26Rp=n3cf$8F`eBjuopL|`x+awko%yaky}aYQ)D3w|^RJy^!FMZ4KFoMJ zaP7_!r&^Yj7Dk7bDAb#;u$b)^f#tP0MnZJ|v1DggC6MnLE8$W8T7w9?@dtg)CdhN5 z#n1p2(Cpbn+LrOg2Sd`fpZC$LAy&_Dlc=w3@7srufGqWHsIvHGK~&k7`T-$> z7A15ZOEQ<`+d9!&Gkhm6DLeDIwwNdKb8$WHENN7Uw|bNwO5 zS9opgY5;A8NR*j3c&Kd7x-N3+erCFY{SvTqDU}HTAt1rzw?M`N~tC(^f6A)T~% zBnW^efCj9Ory7oOPl?C!T-VT0QM6C~mA&JIvOcVc(pWsi_#912%4~-6kMPLDQ3Kq9 zJV7XcmI&o5r3F3CSCW#l7F$D%o^OG+NyT_{Sa>QeQ>O>Fg23oI4NqIxQq_#T1~4vH zPUo*yhnTb8(+NjwTo zp#uqg@b=6(M@lW4QUIFp%!NmJgqGMtsKR6zRVh5z?7z=YXa{)_z|7D}`v^3d;mD+q z6}WQm%B_R~MPeSJQ9k?kZ5z!~n8Ux|iIn(O<(7_boJYL~{$MS}1_o|=UK}`uzWnJ|m_VENp=lm@E&3<&X9|+F_wlQ7W051mG~9oCCwo+#>IO z!eCd6QoxMhf1mA^vhVs8mFt!aGMO3bfamf%oTIAFrLUnWW(+&1RbAX4QaBrw1>((nq(U`Outrom#VB>VUNKC6rsDhq+xeq2k5u293kQsr@suCOIj zld_LRPegulG+`0i$$y(4R_2^wON;s7Fht9y1uU4tQ$2L}{~nF! zRIxm$VlZ_MHmx4$85xk^0nmZC`VwL%hXqgrp>2P#=N-XZ^pOC#$6|?gn<+$h6n>wh z@60&p6@riu)HYr(VOldH>r!H!8hsipPQv~IB!_P{WQY=4w$%cybG#b!{31bS!jIL=@jiB^Oa za_J#+uMTaxM@0@>Wi@mHH$^3qbIEl{^DFF!s1*5&;yaIhWe(vhJ&9=%!YwPe-2gC9 z*{~27e~_8m6g2D$afpZvvJc;zfF5uR^@-cJ)#0rXY}&DrtY_$){goX#v+V8_a>~-| z!}cY`^2IK{KOlDif>8;MCHfJfZS zrX_NL5ftrjQRIpx=7!KgZgN;1lvXD`P{e&2+Q?s#$#!s9{z8orr==7rZ<3VOH3*Gb{f2))2Tez;9ZJ9^jMDaB5=zNAWts~d@mi1PSJPn!eDIyHr8 z;!ax0NpU^+7)Pca7A9#A#)5}BL-BY!)jbM&ja=7;%BNuVSjnK>N)$Ym<%ABndDHrN z%ApTFN(2nR9doi8v1AFT%>@}8YkDbcdF2FiEPL-QrFco#TBXi!+rC|88ffl)o$E?_>%xO4Cc+q}$?fteMlM?NvuTgm>e5&jf5Ba#tS75+5fna( zX3l=a?Dh4Vw{9oha4!uF%H|7whK?6$_DXE}M5j)YKd^W7xlQ@iJLn(9{g}MtX1Qo7 z+9|=uCFG$1JY#?y8OI7g>M7_hdgvF{PbFa1vKjc@jd}t>b?}bxbymWqP4ViQw{fU# z;+}-W;2+0sBMZPUck_0~{YQ&n~7I5Pr}fWTM`<)FzCi z`iHx@n=zxS633(OF}AO_?xTn)BsXars=KUdZ?!+%l8S|K$PQ^%aGq5%fw&R5eLra= zmCSSnGs@^h2S`VNTLKKKqTtEGoaUrd4UtP91-9ND66s(kNZ*y@>31b)5HUVJiMfxZ zA`kiZ?#{Nkp_Q22N&3sc2Z``a4_%bhdc1ht-UIygS zA^%N;vnDPk&hy7uG7M)%!zm(1M?_&UBkVvj`2AjOy(FR&`Kb|QsR|e zX)RaNrB%!`_u@n6P54C0Ilr4V2V)uBx^J;p8$8Nu8e3rK)Rs%YeR85Tw$iUOvsrub zg&uHSfjRmUIE?9WGGh;sW=Y8|v$qPkgj7xIlSGbZXJ0>`kqtakK5VJ>PW2>Oki6qK z3(Qeon;vgSJdN|WW+#@P>9?@v(9ef8Gb zvJvgo(R41(_=C#_ep-PRv2wOk{h`3ouDaH}*EBW`I{Eqkc->PP^?_+!eA4wM8(P`_>EVA7vT(kknzl#Dh#mhdkt5 zd*53-vO?*P^->+zPb52G^@@ky`FFt`6Clmffg6 zl0hb`LmqB_{x~uGp{V^;|G*=wGP9+!(wdxyIauOt@1AIB$)U`zG7Q7DPLCIka~iLc zG4{#JKRrvtOT}Gvga_glzJxd??elwX2MG@-1sLW!lPY2&op*NGFP=Xfht+f|Yg%)`IPuly?A2w&6UaGWxK zvys5a16nFw3ZbZ?cjIh|~tr)K60 zG>C0xkJ>!tM7{LAQY~^`5hLni$XO{Va1+8Mj5nbBv^%c zeuXar0$(WV7)8CuLF!y|c7g;awy_;I-?DJ|bVB_VzO8kbimAq%IO|5W8m+jj>Gw~f zDtwRDK8_iVH4|g8^pXsgK@Hq8YS9iT+|-#VGIQdaC!(o)bLwa|GZN_#l~_kL10QHu8)%SIydZ6= zx*aRaT)YtyPoOFAK-}>x`H>Y3pcaSLP3Q(_&IHi&tP||<9#^4{^=gMALGwV6$xF^F zSJ}C8JB^&y@*lQwAImmUkZ#_H5ZkK@C5yk)&OSO;lmZco@&?vC!3Sn7v(tpom;Q>t( zY*{H4%O`t9fPh1aTN;n3gW6Cp)YQpCv8#9;Q>AK8tPF@wE1bW24Z6U-LMjeWbFnJg z-FFlD896AZCN^KVPCpPk%7DG7m+LtsB}NIQRv=|~4eRpP zqfeFxD$+Qz6j7LJMZ>>wfsK$d9<2W?Rn8$^oyO|mpnREbRrC{^ajsz5GH)c15&op8d9pk^v?a{mt)+4HODnrYl-NeW*&2WgNh4bodHZHhJ<9 z;I1*@FJ^iz1CtMyq;~fi636o(@0f!XDDuK#hPpT|fv(pkoz^&j%359#M+hG=UI8s$ z@W5{?Y<4<;(pehowX4o%*4&Y7a%aXpdQhK99c1_^6OYs8G;4MMn(RUemwf(WT+%n( zTc3b1S31~YA!AXCU%om_DvpkvYm32D(xe2G^x^MFB~3@gN72YgK{CVSd%wwm&q8b0eXiX;WO-y)uz~ZTyO7Q#eFv5?f!s=Ir0R#m-GC zo-JLAry^Rb(I~oLo?=KW+|)Eo>T51Yzbvd$;DVAib43P)mM|xAvG7%?vBv*>tWhX) zLzW*lPu$@EkY|y8Yx@sObu}lkAoHvC?)5lFpL8Gdy_8G0mE7u+ok@WnSxzbHJt<5q zXEz4adqgzyV?QLt>B=JMS(1w#_(zh9>C@FAmOO(nu^N~RZ|xU0(z+6%Z9ZcTpx*Y~40Ohqvb&Gbik_ z0q#oB+7Q_0Xg`BDT-(EwjOR_k&i6QVi=nur4}U%PX%N=6M0$=&*+w96^zSJuGah%1pH|@vAw#HmqJJ3cTDieWO!NR762I9~gp%2`l zdTn_`iBAGxTkFZ&$9KG}4E~Zc(K~393W)AEl%BH*uKp|us&GL66*hhWFx`yAT>cds zz#6)az$nln9f|Tk@2POULpv*6*439a)54A$?n~W12L#{#dk6eOkQrS{8Ob=Od0yae zo>O$9K~pKt4~2iU??K{i1Om{lWlT8wHyAFb;WANlkD2o=`U8xMg{r~OKM@H2ek8R% z&_Mrg1n@|uO*58f0VpJlc@{(p>z5S%{jm}gY{%N5U!WXJnheB)H2BJkD5U()i{(#+ z`zq-r9VUmeMGY9F51K~Bt^JCx_@9Ec(U7wM5`#7{A=YCf zc5!A zfSi?#cS|4l)^yvv&MNJq>m6u?itwzAb2?-b>*AK73wvGDvIn&#&m4 zA0<>BB@xWE(S5XB{~#Xd8P`MCz&XP1=f&}a^akkI4C40MH^GTZwiG(~hW?Uu&~7weSAz`0;|wIWzYfWjoi zUY)*K__BpcLrMWht`kof@?cip1`)ey^4cb zCQ8H|ng|Mj&>1?UrVaq^a(s;fF_I@raIF$Z{=(c_e}o<>ZkUu9h?#IIngB6&#<;5W z-n@~bJ<4>qU!@VdyqX|D}MC%81Le~*_^m8`netMi5{^)LWW1&uO zQBGU59m6bs(x51r>4rBHBO(#c0NcaT9A-TI^@DeXvy^#K3>xe)A8Ar&tQ@!-V? zeNFSk6ff%J!^Y>Q36S-ZC#NXoTWWiCu>>2zyzKUgyrO)MY*^spI5FgA^hh0ce?*?d zV*rf+bv%(6D%2m3u{g6qYh-;g%T>I0;sgj>E~Ti$1nPe0L+5xXW=K0(GAkRZ6~R;r zV_q&fBK^2@3E}ALzFeiaxt!w5fY?`2@w-g=mIo?;cASpdfPKe1ocAjanA$==o@bJc z#kG}vWLP5$elUW8@P4nIn6Y$vxK`Ll?_e~wIQc9Qh_13<+(Tdt#wQ~bRaH-FGBO{& zvHXt<@Nt1x(a^VdWvzU_llJIFXK%ts05_HZ3<5&h{v(@@8Ww@(KJoA4Odz3d6m{$<0r7J(%@GVRWE3te7b1sVB%35vDu1={Ax&c4nN7FUJ>2Q9>XudOk{mwYc z95XK_7KKU!@tW$s?h5JLS5W09jU3r-_?^l|!tp)a(OOGxFr@RgUC7i~w$<2%WcR^T zeWALvr8Miqho5dfi1{*VxAy4jRm-eL{dQ$s;%(5~bGIw^eSIzotBeH7nSVaw(vO=z zZeD%pz-D3P2zoTHin{~zQ zSG>=1Cl57+7-wUXFnC*+Y&N}Xw4LLA)kTr1CDnF*3)`3?U%_oF zos8VlG~%{5*0Zeh32&Ch)6fuemtGUvuY<5jx7D^OHT=|my_)cLHCI7d>S%?KbzH|i zJWYeeGmU42TG;nk^(wO*Y&gQ0a1%7Ni0L`yCyfI*NJcrQ39;*_QdWdb9#be=g=wZKb-QXR&Re@?L#(#Li>7Cb*49Ij%gy|(zd#7TH8G3?E^p{eAI)SgC-=i0&G zt=TWR^~pI^@bL+uFr9IGx_j_?13?amlsmFye~zWhN17MQieatrF@ z6{RHJ)V zYcmTcUf9%C-XYUhI;jiQ5b`=Md_{$re`^!C<(=O&Dqj(s6sv@)9i!1pq18*-687xO zc?Pm3%)FiD#>3s1AAcFw;yQwuCadX?G1i z9&&Wt%{d6hB_WTvcmhwLqOj4TrN~ywbA~g@lrCv!nrmde7RXp|cHEX~XjnIy=Nx%A z0AKa2wMj9T3H)jPn%%iMrIL9;Lu`&Ib(;nMG5gIwvleR%MJ0-1mYp2!9QcSY;xJi7 zDD%Gl(Js|*n9mbZ*>5v&Lg_bXQ-prkU=6AJwQFm48lmH4Gtqc!D!*LcK^6pWFt*cj ze%TIgIemz|b}45OH8@02aoUTT>3rB8=F&NdrD|)ce8{_SlX(n8hPBGJFRir;KHySO z;651OW9qo%9MtdUZ*#ik`>cbz$*d8vLnA&UvajT z62|qrAjt57<6~-yT~}IsL+kmFEnDpGhB~~WWMt9ozV&AHlWaJ6)6mWK`(6V9nE|IM zsNUL2FQusNw>A~mLJZYzf3#(`dbk$`e#JM=V7-YF#wa>Qbohf!Ya+*BJ*UA_X4B#Y zFF8|wo7+g+O&q?8;?N@T4JES>6m&}yD4#6Q<8J=smg!Bl2&-iq-P=9piUX*gzC|*w zW$GgHhk?-*kVFE1Ao`1K;nJu${=&HHRS8j#+|7>6Q+nl3_y?v(zgVv9fdoIssB*<4 zdM_>J3(MQeA z29i!@?&ND^f7t!nyypvEv(vnYg(Peb=P`9)Hr9L_#u>8>K^}*z>y8@_9xFbY03kP{iW^e~X^>ml^ z5!eR@4bQ=$Z5#-l@IjaL*Znn z^Px5z!Q`4>ZGQ{aev)Wy$*&)j`)?Mo9A%-MHW?YDMtB2s7{FQK43b?+3C`g6(*L6d z-41^Q)ebyE^-rNFl*6t!rsQEcwY3PNb;)s5E< zjM1ywzRjpuvn5uTc?AE|{^qgh04L5lUJ6Z^cJ^#cVP~(T6duTD_F=kmiO@#@(f(qF z_%%_>)J6aoXe^(fLJ871MULAb6;!FmK*l*+ie?5Po+^c2YLC7x1lls&9?Bw1jqGOp z50aBpQ>P@2;!nC?IzJ=y_HBvOf_Wr>FtXL(Eqws04;bGi727lj z5!gwygbem^=ms$t=%s2Yzw%49B*O^Z8>0*TlB=-~60Mh#B{+|dV`tE_#J`~Ygq|8pQf4j8Rp zTSwB-3Lnn6^3AhPlgs`Vf1&qTCxlnPey3y)q7Hk*7gj2%|23y+$3_40v1H>C(YEi& z|6Gs~F8J;ReUS1T0apC2grKZA3`XqEYu zPYFVgK9XMYR9WFX7nD6e46V9;>)nr!ci{2(7VZ(9HAN9h8uJao9d-p3q>BGT6FuO_muFu!cMLyw^OOOW6%{Gp}> z=Muor<>2jPQ0_ojTElfVE;zgWBWTuu(f;I|TY%X9LrC1olnpBT=1JmGrtgfunhRdE z&0k8=yoWFWZwl%d`Qv_mtNZjv8CD^c=Q;BO;XoKL{J23q2+R#N7g5&F7Em;R!rDU z#0&B(|8p==T*v;NNM`O&c{_X+O{{AU`q2Bub4=}NSXAk}Zd?ZyI&fw4;j7Sl5ep|f z4yxB|%XNiTqzDPLU>;P^lL+}p?`c4ok@0khf6L!m; z1_eL+m%J|IN789-rJdH0{2k#OO@S>;S`izfA0 zNid5hODA7}%YmmG(c$#EWd7Yk`0TwOojY3~NC58rK;#NI^FwAn0Zf&M_fKAaapU3M z@+@f!J85Zc3G)F+xv_zPb78|ez67Mdw$IX7d)_V%Bg&f7wQ@_}7b8#28zeeg-K7<|tf`shW?jmw`$biHy0Z^y*l{ml+JrH6SxpmDTZVH~ zbEPioI^0TrXjrJo8S|lO)q$IVyE97h+f{71nP!TJ(u@QxHTOsllGbCZ^wjchNqO0& zzOs`!@+)im^Vm*?*-wQd0zZ?Mh@ddEspG1&3kO^6Q&(<}S-v*yd;Ukc)xHNN(8Cxr z_mj;-R1S?+NY}(%$LumPvXP#5rj1^=Z&FmRd?*(R6zQcTr062ronfMejcR4_72YEx z*2m3teMfgXOocXi*R)?5IE*x2EJ2d==g*EqM~_Df#5{U>zW0H^4iQu0HgP3~+TS}GsT zKBy%t=ahQ)V8o?Pmte%xuC?@WKXEr_=jxm{DK+=%96hUB(@HBf4FI#HjQzys6O|K% z;-MYsq9qh3zLFn$lb)pdrnI^u&sbG#0{s(LCa}`0$qyPY@(Tb-itsy9YP&9UCdxor z71a7iZr}6?#z)_zP+0F^dV$v!?^2y(X0bJl#?|5FCH%7SImIiUG>uWp1=A~0j@Bok zLlAOJwTWKjAMX$TKid1wsHnDO-39|H3c3|gB&vXlh)Rx)0+Iwoz$T+eMuL(vD2j>* z3P=tTCAMVAAUPvB=bW0H8k$!N_de&2`{%y*@0A|0Mf5#{i?O!Bx5${56j;QsvAe8ad~chwBK>(>AHzsuM*g8d2W5Pt6&cE$zjKx zeq#Yjb(quMs3}?~@6vM}gV0NQw5w~|XVF)uP*G^r1iAj*vScpnFhwF1aZPSPYlLQw z7y@dSBDwKCI9M*M)NAAM%a16u8R>#x5ovB$p(C~?pON$A&-z!7<<0D2!n3(r8Q+3# zK1r^XYTY3Nu&GP`PMJyJ+Y_kMZV}pqiN*fs2bu+Ju*bhoFJsXzhP5Oqf5k)vVs1Du zt=fVs_bjj%gneBBlq^}1k#kL7fb5K@miGXbKNoN~=n;{b&s0Ew%z+A02#$=XFi_I# zF=PQn1ujgaThpz5bFNSZIv}@m4{BAQ_?I`pg#mlr>D7g_tg}dc2}H!f?)$KQ=i{D_ z>mJmxaH-C$FCN|t;a9}jByLdG7uie5gayEvQTCALL$nHUB%mt5wHN6_bKnbDB7Pg< zcCRiu%=U)MYh{Cusb#yxZ94@7fH+pDudVedCSEOn6k+t_%$FbB=K_n5rOz=GLus6z z-htv`M+EYSk)5z*tp$wNBh*l{cuU1SxOW-SMD;vv$ zZSL=$SJpy_4s_zWGKK+0HbSV+^C0Rjlw zN{|)~DErl?>+V8OK_niCRYl0lf@ zO-*HRwqY_pD%huDnFP@Sld*cW#AiXJHTxVJwj-x<75} zGz_?wORdq&;jEhFRvm<*{HLvf7li>QruyEBSj|KJ9}gfZ686>_RvRTrmMC#K%-8?Y zZz%XpWZ#i(jXYvD|4&hegIgWk37a4BIVeZD>-N`w6vt9eSVb$dnm6ImlBPm`c6{Ul zCnT2lU+sU^>HeJR)_Oqo{QJ89Um=v!?mf@JsY(_sJC6x5;9d>@`s%d5kTTgLE(oc) z8^*>%jb;@&vP%bFTIk)$Y-tt|&-urpFoxH!gL@fHo=+lheLQ)}PYy+_iG)Yp<%r&L zICj+ydFPfxZ{?Sc6pzfI0wLP9du2lnmaP6IF^EN6#=s9q0-UzNabJ!cnxw zv=^Ad-M)VC$wEE@!-F10YQlpG&z>#Y=Dv zb$2=kwgX7sKkw2ONV9N0e|TqV$t~97`?SsP^j3nuKCQrzQhT#gY7%ssc*r%4g57G&f#qj)*RQ?d$cbY~bW{`B(J)jU$$pkD>~ z6}hsqPtM1aP;Jm7UJkdQis{FD0#|no6}mhs5Ss;3LC*am0-c*vzp3=h{TKzL)*ce0 z;6|s?FnQ!zf+R)+V;0F-Ua_gH`O|Do7cnIe;4prKsA@;7qCsEqI_iVShwjuI0p?~Tcdm$tw8pQ1%T+R% z-LHJF@2{D4A>9yj4Yodli!gtS*0M;fv;Ba|uYO7j8=IJ&A zEiga$B>4|(S$6r8vaHV^43G93wO3S)C8Em{Ctfw)#jzK%R8fN4{P5R{)sg6!A&Bsl zrEX7OJ%B+`?gz2MEk28;e!|5wgr7*MJwug(>F#E;y=T=b5j!0ee!sUSvvcKf0xFQX z1BEuCHQHbMO2V~#TKCa|`GnkE#%s)v`Ju=wX|>#5eM%n0I_6l+w@c`2p3xn(mlZ)B z%mvoV1#2qnrHWK*7k~Ag{;dQ6Dbs6-REOb2B3gc_+)_L!dxJ%Uv;_9z5Iju89en`R z*DmJIx+fqY%|NTlUT;E*)9{Rp=SO`7iP8lAs;Uypy>NMLC$16`HY8`eBHsM~DcBKNKrh3L&6oU1-Gm}19R+1(&w5i&=186j#_?uR7 z5s?E!ZS5M<&5`9E4E4#Q60+7CiGEB?b$1eC+GoJu&}!ssz#SZ&!d=ioX__5Z!NfVH zoU+Z7z+*sH$9D5N_9Xz?PG{Z^Q5YZ3Q8&Gv^A40s2j(2}apH%75h-70*5J~4RXtXF zlixl+qp)J+D&!#R>e%L2d7-ELsk(#!#i@i9a5f9|Q1@+3GCc;g=kICB>rOxzom{A#Rd`BpxWMCd$9+LT)X6Z3~#drD!kXWan0-Kg6mpvF7-; z)C%E;_+L1bY+Uo+)&6+@nY6||X^mI%<(%VUs*qoKujjMhcJC|>GEL2-q<%KL8>7K# z82c(PqKmFKdH7+bt&V51gq&|$OH#)5DaVUY9@4(?ceI~Nw}y^Ya$b3rCR+bx@>0!x z0{geG!x8Vp%47JFj7{2UjGN}sH@FyKaTmApw+@2-yuZ+yrvYHe!#_KS_sV4NguK)0 z`^ZR(dzbl)lS+EiXOd|{n{XUU6ZSkksodbyPyvi}gIs(6DFC3SQFYsZoO^zC8vdTR z(MP!|BZn?{UdzfFD9kz58d@d4+Ghi@tSRUq{SK-Fa5|o%{aH~N;V03F#d?l8@(vr{ z%2|9sJN$A-Zd~4Bl94$C)ietF6MlT5fUp;jW(nC>)WqPIsJy5O@pstkVevN}B<(_N z(aO85&U`Vw2&6p~n9`WyWuKMn30B7#Vlv`)@^iHXZ6MO|7;2($X$*ri*I?>fTL082 z?^JF)1@T>ce_pvnudz%Bn@RxlUDnTfwgS2aB2l-0zqaoJ%L;-Y7=R~^V~G88+O6{^ z-*$D~P`7>pX*FQWqB{UEO3m#TJ=ukTzjP#I9uQe@dw@>3%a-tcsh&0zAdBzQZ|I9{ zAi|X5= z%cKM7KJ`NamWAmvh~61>8`&OEZkB4`T(Ke!G4F5(x`$gyYCpE6h1iWBYMsaR)}2ie z0a+dL2Q9IX16vuClj0Ob7O-64rS|!h6{?czQPf%DMT*pv<)Ayr{)w02O%Sq|fHFl+ zpy|q+M$}W&BC|L&Eu> zvEJ42%L!qz!(ZxVjX^KF4pw8beI%u8JVfvN{Q(WA<0mK3oX6=e5uXqcbUS*@(Qx=X ze3THdeg36D{a>JB|C<`r-~IaEQP=)&ALdpDJ~?A9UJ4Q38Aw1~e|g<0~*>D{rbXXclBt1mD(l~Mj>%$;a= z>eii)w6J%2bara}!v)}U|G>ftc1v)`P+W|E3Nf+t&m;`$x83g?3qV6%qt6=~Yxvea z2bBTlMOS@&%zrzA^IGAi}wzxT~j@B_#F7WpN;V-^lcqJ^H8V! zGW6sUSoG~qY{XVk0S?ukhRNOq)d!c(!sPp=jXwv*%^EIBhvKwhyP$B?XArtW8?^vo z@2|;9>tBgC+5`Mh&duzaophTI(tFM`h{AA^_SqP?Uv$I5r`NixK zR6$B=X$$awuoe+P1Snax^&B|5CIS5H@(D(A?DU-)i&tv^M-XSV$D(sVuGE(_H?wSW z3ZB&FClD$6QECC?uf)HF2y&mM)V_v!G-6=ix1PCOXvqVI_pNd5J<fp$&aQ5t*C_7{i!5#(`(`xKyqm%JV`ev!yamjQ_MNdkcCyxCgtc=q`7ohWGPL z>fYSYO=2AAV`eKJ0m9MgnbRWo-&L**zA8|uQ4*#6D1>XOg<=Y)PdCj!zyF)*Y8oxq z%wVGBVep-}*&w2AmC*osX@7c(%zmOSbWs@h3!tX`y+u=&dYL${CDP2=_83zw0l4DL`D6t3jpox={NNiJ3)b3kx73`)tre`B!sb)6rstUTjzhd@s9c;ccb(>{}_l%HO&$kvUYbfr&0gqwPHXrl`^vonRcACNL zw3Ir=@RlFVxn}Q9WNuq}jePsIaZCN4l9h3&jlN$_7mxIN8N12W?Pd*rbi#KF$EMGq zxEaV9CC%;THcthf!}9;AHxD(5J?%9C4urkD%9@9B!5pRF7=@?)b%wgL-E~AsTy^LD z?xTd5!a4=q%A7YBUjpe~Uf%uQ(8yK9pG&dQz^teg#8qcJ_ty|Nn}6-!8syMf!aTg`6_ zo=ISJCOl!KzE+_#GgRERR{T1R<~F0?6(xQNPq2Uh&%B(yjsP<;%(w4NYFAF=HM za1F{ZBBvw(^bJ*X91dSTg`*X=hcqk(;G^vevp2My{ALj7{Gxh17|`Le0xuMJ*XJ{s zuvpc}?}{~g8+Y23v7z4-#rDuR8r7!;ml}TK0HdZ3zXP^G54VAZ9rL*ZJb?u>f3p8Y=6_uJ?CE3fT!_ z_{I3D1*IJuhgdq@&@~2TE ze^P^n%m?EF+dI2}O;xM4vuu)P%m~F_{7dr8AeG+QSgpD63(E^s#aTdP0@jB#MuY{R z5w4lI_xv$M)(uBya?;ec(L=nV}-lHN5p#RSvQ-So`WqYA$PXahzh z(q`Nu`UtMCX*}^7Kx%?EY$&(L1I1q!a#qS?9z)Gk@e{C#oJH+lOS$R?@EU~4Do)I+ zEgdI3D5pBXr^|JuGUnEtt5W9>&J2( zV2G$CcElEoI<7&N3xH$NV58?d)ToZ9r+GVg@s78!@JO(20RkTCL5~?*&V;&6NC~We zwS%l0|NJImbYQXk{p(fl|7ClEp;?FQi=2oT_?Q1Xh<%#$@@-Sn?8E;Zd4Bq_g7fB$ zpnoIPKqx(4%Ao=@%n-5Gp|67HYo3TMEpxdfy zh_!nxA`Fj@Pyv)!?E|?2$wz6IxAST!>e$J$yN!nuL2bOcJ@%^e0>$7M5%w8yDQFR| zLzymT(;pSqX1nD!WhO9kmRQv#-ys|M^EN4G%;1^sNMpP z|B2F}KL|L|#pqv3yQe!+bUaBa#IM0!O%>DYz;Uex87x{D3z7s1L)r!76cn@AG=O<= zKj!wM+Rz0Qime(vQ{o@lb|;Uwfp6n5X?0jvCmphA)h&FPZUlL9WqV)nAroWWW=zU6 z5m#3(>^yq-92Ys+#w~GjGMemRQb<)P`*f=7$M5z+(@Mx4h}r=||6vWSpT3Pr8>sW% zU(TJiZEo)Y9sgql@`YP20e&pQ5*2rD_w?AMXf=u6I9BSY;pP*^IF~m?#)^sCvNfTIM6j^SoH(AYq7~+NXpWHFtjk&aa>Dxt z)kin3EJYqLc(h+?I2C^JW8tjz^;d!_JEs<6HCiuRdvV-YPTjrqDJQk(72AL`-q2Sh ztsHOTuWn|(BKx7uRXaSMrhhi@!9~4yNd=U6LDV#b>o=n8lk?r%0m){-h-zirVv}#k zGu91+)M{=)z=wqwa(b4(vOH7vPHy1U>liwZR*PF~Q1^H@)J=NpExQ2j2hI!AWsrXYAkTgzkPcY07R@onocbEWwE@5jk2eb0lGJ}u6el!3x%F|b({V&4;^z@m5g3c#O+-B9lIfjx$lKW8D;dSbqjX7+ z7vT#@yY^>rg%W4C=z*y-+J6x#r9}Ix>O;=k5-=>cBq5Tqa0ZrK+Lz+H!hny5&*4sR zlho?(rhzr=H92(V3^gi8+VOtvr>L{{W9jt9J8F>vkFy>SZP=AbfH4#kC0T0D3tjf^v-ll>#3G+!1%|R zsxScreZcC=;;bjX6Dnb~=mKWK=WkEJq^Jijjkr70?feeev4p+3S@q^QAqHMa$01#< zt>rm~Kp4*Fn3ESn&z%KF4Er&%6Zuxt(~l%3z&>kb+oA>I(dh*~@~4z`VAGsXl(lYq z{+jd6+`fJF$U)nsY967efG#UQ4Q%h0FkbYbxsh}=(9E5#;R0`TX0JT{+SNM^4n4lN zCFJPPPAfn6bLn)_clTQ7fDQC{pJzZ23S*fLT{i<2dfjY7ZsuF@Fhe~;=LIIxb$p$u z>~wIq3n=!$%mrmzD);-PDoVoQx~=vd-7Khl5+obXcSr(Y3DCy`TW^a*<=M2ycJ^aV z(cf|qq-h;-23~R1-hxjn#VKCGsOM~ zr607wwGSSOW6d%i8##nc+c5(R$gD);GgzHk9LA%-uR0qYz4wC;cl`#t=31K%E>&A~ zG{ql`53#qZSi0LIAV&JSpT(+MMJMG3C`~h&#Kd#6b7wo_H8*plIsrA|1X4z#IV6K=n7Nwz(r!6z zk zYShntTm4poY`)uGQX0diRb<){Ok12%r>eD({Vlvw_ftl1NN#y@;^0DWs3RvE>)2B5 z*n$74T%F}8Mf)Xgr%};nlV`=+=S)UQMTY2ftPncD-PtR1-!x3Io#?T zwaxI>?IXBQd!43$@;yiCXQaoyPh{R#HO*HgO>dv+4hjGKHQ+^bN^DAv zxT-1SwMjev9(aZu#$Ajxu?tvtuz=impMj1&!?My$Ga^Id68>T`?B;mA{$<4bTfwwt z>1EJl0EuG&C?b=a>19cb>9n=e)1#z(-Y8s%S9$!t?ZqUILRt3b!b;scy{RJxHmTt2 zJt?;s65`w4PU1R1C$AbX)?iea`|H(%c<^9B0Ln+4Dwnl&!6!Y_T79uuw&yc(S#TwpLS@0FQaogCXl1 z^|n00%;5KeK#`8@sWA8Qa?U%GxZP6XBVE%32soey244QXa?|Di&!J9rh@q$%c_Jp#^q*j@#f8KJ0JBP^~Nm)Zkv~6S#?oD z@XGnn-Z^yc9=OeY{Z&BTES|wOlhN9v19UE!Mv8>ccfJe07ML{A|OVNUakKo>d0T}eFyYE$6s#U(sB6w?I)S@V*1Z;>?)GinxGP{qx_D(h^-umgv9I{_BTKB=ASoO0GXa5({?pO*?8wvxQX20f+`<_#dYpAWe zaRa=8ZdE%sybTl~Qho!{bof(W(huiP-^7iFCH*O#>`QQ}`bnR*xIY%Y6 z+}V$Xf5EkCU$En~hfpF|Im}~-sR6Z5wh`NkLSYeqzgsk7fCJO(aiYo*+J}~1*A-W~ zPNSOQJYpzOr9S8OT4z)I<-k>Q057Ov)z zZIfdtek5NfO1vX~HtsC-Lv^eUg;kVXEv;4~lmViG01K4sqg9+-YCRL8H&Y;;|EK*A zITa66`c#9mz2y^%_+t)Q6e(i%*(vi9dsdGnreXtuyz-}&lAbrd^rOAK1L)!|kJPns z2o>y~g9ttE*o_WrAZWQoD&79|k7YT11gQ02>q5ZCSSnBRZw7x6!r*@yogxM>jUVv_ zM6@0>H!UO>;o4O;BzVB%jPT!o7U4l2eQWaWFmKs0sI_y@qNtFb0_6juSaz?>wM+fm zI!0KE#Px*TXGm}6>(NN){h#(HI)P8g7c=z|qNIg^Mo4z+zxB3vCx7h~Vp>jpI*2Dk z=JcPo1j+i2@tU-4!Vn1OPPWkfmq#9iZNORsye3lJ()VAOh6oz^KK#7)0T${cL(=r` z@o8p%^Be!%v=F&c4rmb|l3+mTcWi9c^kgBi_CHV60$;rQbd0PCKm+tUhLDou46^9 z3)l&6Ces$)q5S)VC>|K%pL7JB^n(mIg;itAf?4B-czldzC4-p6z>4lXO_7Y8Okt68 z62)dPrqXK&!3f zv-CDX078Ym9-xN6DpW}ILc47A@EdAyUtUNW6=$0UR?^`tHOwABsEuqlzmO3@zGc1b z0CPf2QqFxKRCV6IDU3up@TyO3Y#fe! zQhhHqi)g~$p9%@;Y0*EA7m5*F?YWNgko zCz}oRhibA+qK_VdAmh&Rdnwg&3PR(K$CO1>7BTm6 zv7Hk)rh)9TCHAiJQg{m|JfX>TksT4`5E;j-^<1mf4{}yg*qmUEINgg8^#Z(lf*IR)Y>7o&$>LsdOkuC;7!W@MplIp#k;LU zEiB7kIJR7!{U!>$?S@I@9f-FDvkeTGIIq(`A*!=vFx`H+IXRbB=+eOG5o+fz>OqA} zC=@MLO6;zZdS_6(R{f&=JTP<`u3bNO{HMdX2RKJkdn$?^LVrrJU_@R zk*vOwG7yTGJ*UzcNmwQL`nSVd13XY5(YHa#VZu;41sMCweRm8FfHN{&efBTe;g6^*!h+Qon2;XQ97+S2UUF)+E$TqVCXeN;S z;@Ri=gNGxZvAo85sJ?=L=Q!5F7=Y#Nwo0qYNg{S9{lMz#;(lNBm%x?kO0dvA?7J=u zI64hjhfghs^;>?KY{l<=$&$sj++$ZPZ6!W({T%H>qBmt{&WZVwB)`jNn9CpvZVxHBu{U{2NuIcHYy4 zq;-?rMKdEKa}y);zOIg*%R|w^>Y9P6i`trPf>z`GRg+`P4=(T+O8PkIp-?p@mBA03 zbMl4N+a79im{tVwd7qUJ;co=yUU~Q+k&HdZ{NoJ-1KMj&um!3?`etkkA0q> zzm!i?MNr)y+h?{wIE z%$&K-&Zf?5U-he&;}N;N-yxC$*UXKcfVr+TwGx}LPo}90rm3{1B;>TxMWhUoR#uDJ z8^79EJ5%lFV`Di`t3Sul)PSR}t^YyGV&-8iZ zG+G2rfBB9GtylU53BR0Q`}_=TKWdcdDMEght2W@9^{KfNw~dJN=QbD?iItG&}rF z6b>#v@58rlq}FTO<$wQf*ic#)cvIu$$S$ls;V5@4>)|JxK6I)stA{on29DN{hT1M{ zEn*k9`y>K$C+73q@CErfHrdYy1~P2wCkyCYdEsmG8tnum+z@j47_RBt77x=#IqA0R@Yy^Hm54}}V(CfH9St9C5 z#^&g<4&$tC*B^Zmy|$e37d_8W1-qu>d82zOrLL0=4<$Rz`!c34YAbOPeX20;6n5O< zF@MN8bD3^?fHc8%mG#4wQ&?Ou;g{=b;2L;{VETM06aT7&Fj<_|)Gm6}LUUk%YG`Kxqiz#VM{J=I(YL!Y zMOf?{zq?%A;o~|-fRH?*E!$}3ygMmPqRj5OD_cFUUbLb2MrSZu(nZ7!C7S!I^o!jE z0_!KHnY#9OCDheyOc@evkPV{R+BE3#SkIuRqno;Nl^lAm9oh<#_) z7tx82w7;}|;zTD_+pf3oqnqGMFx4N)+xgLBw=nb4aTfg} z?Ru!g5uxETn_>SSz8fpKZD7O z&6$5tG@AN2#rD#hHIP?^NmCDqORD+4J+U*RC_Uq#*F_c?CNY#AXKerj+0MFBzGJHX zNIvR`sReR}fw?pCsxGpkhohPKIISy!kmtvHpAU5)7K$?67mj>?#KJ?ZukVq(+hAMo zV1&cHL5pwVi&<7%9f!uf2WZc*)2V5ci$d@DI4!N7fjFL}5IGk7U@|COHWAZuNTcEq z4IlPKTLSO!P{4qT#<<9o`%U>{s1?Zu3|)WFF=Xf-nksJurJsdQa4(2kr(w8v2l+5~ zayzcW!;iZo{ahq&G4K0p8#|_ER2xJPEGnDd`G+%(Uq@kSYDg?EtpzJ ztHHoWP!6lT5i;Kx($d8i#F<){bz}XHA9E$(yHry+2mU9FP=&DIlyl-AFRO1g+;XvE za^@KcnN$(6r2fN_e8q%DSQE%C-2|D9zgWU}^ydx69&zrnUme6ee)PrRkI`fQpgoo+ z3~hc_D*g4To$r=YHzoh>{%$}YARZv?h-CYfI0Dz6i^DdR1o?Tmm4(>bPOjbEI(E<^g8n}1ja2)U^pW*FT+vR6 zEFJgt_0z*b)E%xZXqSzh^h2JpNZb?{nq_}+NtsKU?log~Gn%_RoRCH6h%J8F&mf*j zevO??R){fDY3l_oGCJ*N2k)!CcfI>E`qDU&Jkh&t6aL8y!YM&i~ne>`N6I!lgVxserh=&z+WSGt&rY% z)^hK9@+0$axgAPMUnvWI<1H$kj@*h5Vi&5|C5O)3lRmNJP4-+z~4fOX}^5@9pc!SjHI|I#|;Fs=7R&T*(c`f}o$ zf&QJ~c6CVxzuJ@L(~%D1F5hpk(mzxTbr2ssuYiu?9aPoREq7}_d-Xy2EWY5bhsOC1 z*C(^b&7Vn{I_Fhq(?)z|+&|(KO{aDn^Jb!2eCW&uweX~ri>_#ea?B37w9trY#jfgI z?aRi0HGNbV`>O3YW-Zg~W&is6nqFKb6U;-??Q9-84jZRgwph;GbiQ?uU5ke9Wj*2I z=^q`B^+G+p5wShVDfd9g{g*!*Hi%!xYL?<$2z=%Xm#gEnmbtIj)#-nvh7P+Na}3~e z)cC3WPLGL+LxLw>>$Ci%m{5LH^&6qysS1HW?o)K!KeQ_ZUW6V!b;{1`2b!FbSi$dI zowRhC;6%ej7ol?0hy&C!LgOzfK=yuhmAEv$K^B&}WP|nY(-0xEd$Y&wnTJ{Ph*%VE z{VMLiPvCc0`}rXwisvo=Fu7uPatf?lF~_hm&@ZGryUo4yFaZMSu*#5z1bwh-+^?^sQMG_ew(~DzO5b`F6g8* z%jRLxnPT5T5s-)x1CznYaAO&i+ThhGHc6oo*-4*BLH*(3cGjyZ^mxCsF-1w@#rWyS zupozD0{pgvc$y_wrINZNCXP?CMWYK826yO#@x|?|gX6oUFgv{x8fi4tBOQ*6_j@pw z8+m^(B)(LW<%8%yX zy%|&ts}19vm@e6G2wcRoYish_-=F0>-0GXk$KI_?MHDVPrb2&a&#aNA?cA(fd~=x7 z{n_K^GOk^|A9?GAF?`QYclTzSgeQN(6Mv6CjnR-NC{WS5zBGje_QBSwCz|O+L^Aq^ z_JYJ@n6HC)1T6T1=`FuUShui(75}(Ock`I-wdl=+h$VXcPev!#H@nosgvYvJXcM%S z>2IR1wUp4V>HT$P`zc|o7QNd(6|sYJwH|0)tsNa1ofO2%zLVIsmg0;R5 zls6Hly)e?(Vd$aSQ}nz;3Fmi-U=b9K`g15^w?yA|ZI+CV!?v&+igj6f))a{=iz5x> zJVo~v2ES$g#o1-tWTph z?=z(e`J0}?-^brxG?OeMBE!gvPxQx6dQpY(W1*5IbEdVej3ekWF;NyE)HLsmbz{S< z2YG~dr{MltfvIvu?|vq+UN`UwwV0|SDIlkPP{b7WfO)kDT_CtZi~S6f;Cw%pKro1q z6nF-9hpTN*w(^7)8&mGlu1<0+&UI+E`Vl!JPBUXTt6u&CVR8jNV%13+r)I_EN96Cn zN2koQ1Uf(MkNTGAxqD`{THa+hZm1~B*`)UZJ$ht3nKClKMl>SnDw_bL%=a03NPtEk zXhsV-_QP&MR!>MvGubC>&9>DKXm9c#%DSB7Xb@wL@pt=Vxa4 z3gzt;tK4wMO^uz`xSNhot-s*36drF-P3`s^S*2pyUc{9R39glb?N!9_d*D2*;@!m~ zk!j@g_1|!(xvrgd+{8J)9LqQ0F?X_At#5ul_;Vw>G0~;tt_29kG0&5cV7IoPiAnf$ zp2OsUB8Z3fn3`vO8(D;AN7oHMiv4_SGROMY3XqLWA$+*rO;^P7Ow2v^ic6h)$gVkj zQ#gC}3A}JmERgQ~=Q;Et0Bt?7Sw#bs}y1|G4d0Y`J ze_Jr^UXBUb4(^TD0SKUIE_Fj)>jk0kNF;i19+ZVg=JvLW4!a|vi~E(USku`?bC}Gn zpu%hzRR~3A$LzW8ucQgkIXuA;oD*|PKhJ8n;YK&vidV+t%IM1plmjH>gDZ1*b1fU( zq^5wwLMWxdodj9*BxrHLcXX_<&TVwd6;;+egO*b(R1u4fUvJwC`?AUjufEzQ<*#Q;DhcJcc!~BQbR{(u&xamig`id|EZVR=Udq7%Drx7kNn9+neZko|-AH zlIS;H?74MoJ?viQ)4on^!R_g~brX!KN@&c`aPWh8`{{Q*W6Tk^Ud-ZsA{I_c-Mg4u zLLiqH&VRWVqCBVF-%-r7PV*}1IyQ(a-pK6Ps!^K(2v>iHCdXW(shmhO0lD2{Q3see}aVrSZ5*0*ErQ zXlK zWp%H#cMJ@)7U#wlrT#!~{LDxx6jmSbO})w9n9%3G+6#+K^ACiz*>Y%VE-AyhXLcva z80@~@p^lE$-#N*q=JK>l;{_R`U-F+@i(1Qan``Ip9U9~v2HfiezKk4p+;!y+xGdw| z?!zqrH)lXihv}c&d*FFKgfO|J1a{wqOeXgw|7v0f_^AF70~XW$jZnv$ literal 0 HcmV?d00001 diff --git a/website/static/img/caesar-qr.svg b/website/static/img/caesar-qr.svg new file mode 100644 index 00000000..1dfad326 --- /dev/null +++ b/website/static/img/caesar-qr.svg @@ -0,0 +1,17 @@ + + +Caesar website QR code +Scan to visit https://www.caesarverifier.org/?utm_medium=qr. The Caesar laurel is centered in a green QR code with high error correction. + + + + + + + + + + + + + diff --git a/website/static/img/laurel.png b/website/static/img/laurel.png new file mode 100644 index 0000000000000000000000000000000000000000..f23813750cf41650e0bc571e713d63687d263efe GIT binary patch literal 51725 zcmX_obyQW)_x7Q$E`@XXB7f7)nCOsP$wMlfyk zhPyf1jd?!YJ9KMh+hlldX7PK5R#(nr42h0km8f?5kNu^VfiOft>7XrcW5?{m3-Z1X z27@}}U{m3Qj>tJVPWel}nF)1`@iy_6o2@||HsoLEVGiHl`iKJ5L9pxJcpmd!%*a-Y z8IkE{^J4V_;nO)1-*L4e3<^8$)VdVAQqN`IK2dZQ%gLx#_tj@t13N3$w0?Gb=c9{8 z{5^IyFK&D4P;DTkhgc4x`JS;hE4^1DEzTa*;K0bqay+6qZ!wA0cLJZNMT?Dll%^_{G}4dVTo65iNB4?dUAJB@^Pt(blPfPrkvsM}X2}bsAM! z3!bDW(dEcu7s6Ac}e{GkGEAQ!M0 zq;Hc{O&k`>Ss%a7QpX0@B8oRHV?>NCT`f-yyEJUa21o6;Sgbs|o;?J+BV-$cnf2*#RwUXWu&f?j3U6wU+X+nF$ub zbMmG#(x@L?cFBPQ2IX9WuXNX^x&nv<(6r!k5Qf+5A{HKB~tZ`NT z>)6HeG|M|BXQu5%NbsedixDHebn1yV$Am<&{nx zh*Zd_uk~eVU-CrHSdDr;&sH+-;7PBPZe>es25c4YggZ^BFyAkp zu$>M;h5Q^pfsh$nfhNhjbCnP8o(kADPyU}p~8QGnIi+{W)J=LAx_tr#y zc)`8U_b>DznpIBL{P=3`jDV7s%T=@^ZcepBr^Fgq`Y2>TQ*iA=ET&X9f)ye{f)JUm zm8g4$Qm?1DUa5vP6g2{ihCZ7GO{}EV7(sr%_Vn_+x<9FqXZXTxY%)X4kT7rP z*Xi?)z3N%UoJFswr$Lr|5trg6kv7Qvv+R9Owg1sL;EL+`i&3nyE^(oirr7E+=Pwdj zyJ~nHrcDnvqt^nkyr#X)+*I_i#S5}m@Go!Uy5?qQJW6-y7m){VgDkSb>fb-(X6r}c z_;fbY&U!+PWE)JFi?LjF1oqMO#FJT6S>vdu+w^8ZBRx3#R(A8VG~u1NNUIvmQ63&i zo2Yn&zE&h4WL}wei?$+v<HZKH9c zM)yTA@Hw5`&@wrQv`A6~$KE|PIWK@^*V<-hwkpq|F$+4nHrtOo69U7wxhPj5*Z_Uc zsIihu%j>&8$p^5!K4-pf#BzQWe0pS>FPj1QyU}}ei5ZHw8W$oNtouGcjoLnpV@wz0 z=Hgfk7Ko=OeYUu^;?0X#O1o8Hjymogo37aaZlwqB0~0DCngrJVg%zIoeJ@!b-*un~z*G!E5e|^mxs;R^s^v z_oqY<%O`uOu=SUP&0kBx9|gJE*VR3mw5YSK7fFxtX+8cN)es(`o2 z#*l$wnYUfCYRtO_oI;+DP_rVF1tGb$-wM{Z9@DaapWA`fo~V$!bHhY^O&DqKCsNfU z^UN+&aI9g{O~gx)sJsSEU`ioI#FcxM)czAZP?N zF7aFce%NlbihgT(H83yWCxwD>7x71~do@43*k{CeO`>kpi}Z03XfKgJbh%e7k0s2j z*I~i)$(A?TB=tPMJD2x5xbGP=&`;;vvc*Fj#A2Vn#?yxI7JScWeN0>)2v8qPGw3lF zo;(hsyg_4W{4vmyn1ho0A$gqyqo>O-ZE5z`J=V0QS{eoDSPa}f za_G=BTDoal8_9el7LO=i*DjWY8!k;Iv8rRSD{-!uDqrZ_E&oes|HNwrUH$9T540rqNc5UqZjSLM95 zUc=(!hJNe8Z#x@|r(rq0TLHPn#%fsXHsB!dzaTyLbFyUAvXRq|`FpKmhdVh>IY`H= znoRDTG5h^R-BPF3Za;&bja*r8lqRvNlSd)0B5_uci!4;`ewfIjb9#8K;>T{%%jytZ zt&FUN5e08kb(*JI89S-qmONpbvU?yC_zgTG7YX7qw*AmyBl25qCBNaCWVk{y%K-1K zqbbhMc{n~1Gia)Xy*iCEKPUXi?YoSZrah zC*yyAz}2w}CQH1Nq^OJ~Jbt;*Gf>3UVR=iJ0_~C3efp2=@uY?(xiobbJhtDnQ(X2BiC+KHr>`IGutZ%Ur)@r>;M`hyXx)MJ zsT_hI7^?unuwMsz!DXv%v6f^0KB9jx1Gnc6I=d#sVukomi{m!&U%8bL-Ms_%y)Q!c z{VxyJFv@Ao^P+BoO|kwtvs?@dI)dNCX*i-6ZkFJvA2^JmQtq(w#1%ATPKHeeZdEYe=$3WebUNc8N}6& z4O_3P`-zZP_DbroTs8H@dOGe+O;V^5rh0X_FiPLbH92$tcv@B^3$!T|Qpd(UoU_(H z+_!$o)03HdY(?&VkEA0W1UT=qs{3t2g=varkOvHVgjbcDyk(DgBg`ppaUHm&CrGV( zRz>^QiaJKBH^Bq7Bop%1`rWG!EVhQ^$jPFVyOckCRngodZ};D{_{kzawAZa;Fm4?3 z(p;ps>&%MYN|3Txuu$n{ae1Q$&B}(PELoP=mM@EDJ9V5d+Ahai zYiO1xZ#(%i@$758~T&1zM}IaUZQxl z&9+GgiH`wyz@Id3RHBnCShc%hEAld~+m1qyf*ZrSJ#?pCHnDgaU-{wOOQK#V%<<&d z@;0)xW_#fSEbmzni1%ZIEMIy%-_4U>i($qDU7iMQ$+XQciwWljIctA>Zg?-LfzvfcBz!iA*ceHs= z7SeMXtKlCYMjB>UrQdxptRLrL%@O@GAor4V+EU>hboj@H-o{JJb3?Yc)KUn$*egJ;J^lGXRuhu6u^tX}!FsBdMHz*nJrMkvCe91>pa^Ca3k!fk=BA zt}N4-vShL*B!X)vMSf(WCB@NxaD#g$fd+I*n2Wp++Uhd<768A=Er*IfzRP&HxJq(TCj~&fh=rwg{yj^-$0_!Ur06Tr^gx#6QvKpIuz#{b~E>4cr8zPx6eM#Z_;fOK%*6C4FLCBXffP;wPET z!p%jsC>vMuMyW!b)b90@5O6zt_22b*%BzTy0{RZxiX_3@>P9Lon9x$NvLTw;DHX+! z*Z49R<{7=)Y8&-jC^` zp22x}n@Qs|kUux_aAh~%iAhKf?x|l9$K0_lW+)lOZ5yM-UA6XGw3lR zEDQi~gu+;fn6^As&&`U=>M-AuzV)iO$^i&5>yyTZrA(JyuvvY7Ig2TTwo)D~p<6r- z+u~oW`I#@mSOA`sLD}A{&WC>YvPeX!U43Zm_I2zR(izX$_p}-4X z=~g@(WTO&%kM5{|51FLAcPyjo1jpA4w0?(68^NDcS9PalqhN~QzL{41++|@eegIbK=?G5W{L7SXVj6WF4jxI3a~<(AL((fH zkr2ywAeKOtv903nF_MhKUAE4`vnmP{YkIkF;U28-DbaP*0=oa_mhtcOTO2lP= zT|(U+WtqDOP*i$}nlje~;h{89I0-{2wM zFDqx7PMf>Y1a5;irPu?skFihtELz`xtPGa&_ZErlR6*!ByA3ocC)^op-6lZy@@rzH zjy0qSxKwh8OV~sQxLPcjwLY4oig4r)*cS7NcML70%qOt)3cuY6+@l)K`%~`aTkh0Y z3Z4D~XxL9c(a8K`!rf{4^D?9UeN!F@$&e*T-F!oYvu-$=61@$w9Bk|)Nv3u!et?W? zXEIHl&NF^BmVhVq{9g?NbF#L46vcl#x^|oj+HZwla=>0FhVYfhqlm;ISY<6ez;BmX z&95(EZ91s`qd_4twocKu)U;7j{2K&JDsR@=IB#z?5J4s3pSm)3tp1>f^wq%Ht`fB7 z_I2N0bV+PyBz>xoTdJQ_QKy$0dvFjH&yXFEv%LQ@%G9K2b*`;&SwHL-;8(YwWuF@; zA^FF(`RCm3tVoiaNGdriYP^y05b4>h}*CLiO+Lq%Ye&%*_iuOs9UrrF;U zTzjH|x#O>swIru*s`yPF>Ld3J&onq?%y<;?dArD?dGcrw;j=2b0(a|6H0B_wo}MT*`b;slNJ+94?c{Bn$syN0Y>i z^T(pSZ}k;(w%Fm=F$<68Y7tEFd0CR60PO4J%n6CD8C+$D%;2VuTwj>eWNLPy)9MQz z(`WCr?h19Z(i_5FdW=;FGzqxWRs+I)KA7qOI}f+GwRTH^54N)GcwxZuV&u_-OnoJ3 z99uQQ+;nl~gr(5`N=$(kG_FGZMXd)9%m-r3d~qL&$c*U^F?gDl&2DdEd{qq&0f*Y0 zjX7G@W#NgK*{A19hHK&$BWK$SeQr;~J7*SWq%H$rC|V5lU=)_AJ7symE353g7glWW zIc%%qtj?W)fsKG5I|<9$`yUn2!*h5IrXU6(n%k=k!eKcY%;YiJV*Cs8w#1~p;v%2aB zp?rCYaHeSX`0svO?_OiOc3|aBQt<}$iQQ1JKoZF%@sG)_Y4X4PLKUouFS!_%Kn9&& zyKcaG-Iy*TxnCx{tMS$D=Nx`RzL&(T;IYQk!AcGH6{Gty<#vy6Sp zQ{`wm-*cY0Tss7jMtgDp7Gl5ku5yq!@`ye1ely{H4n3W#7OD>G0dyn=Jhju&s%C9@Lm9U zZ`F@y%r>=iu7r!IUmm|Wf3fd$_*Ln<)|rwWoblL4()|G)`|lBdusETsuUaX&+QDbf zZ{^KG+*T9m0N1qt-y$-F<^rC@40qbw<{en!G0CbhIl~kgn5A$(`{#oq^2;lu!*X-n zOVIb1wU|Ix)abY%`5sCmN;kEap-y0YfCz%Ks?03M`qH9j-f%H1eP8 zy~5dJsc#40QD8ASHb$h3P6b8V;KV+RPhH2Pj}qK|^CBlS(SkF6sjxanLst{dvj(V$ zCjC~)u*wW|q;)x+P~7WwxF`b96oh%BLuO|Ej#xmvehgZ@OgvZJcv#OXwJq{qbE3&h z;%SCA4`n7p_q?ki0(u{Cos}d&Mq`B-DtHope zNvwc`=B(ZPyMzZ6OVay#c!XmO;iY|bliSgMERCgt2WZTY+=`5AoVaaz zVn%9P$ErwF#olDce@p>op@{vGfk=MWKd#@B9vZgpfJUM42(-cO-y$4ZbM@GX5k@>d zuVQ&C>qR?fypn=I$~PHh^6F&}H+d<*cDe@p3AucXmfVV+d@j(B=8aVckrI8viTZ>n zAS3_^k}L4{td+OuvR0NscwvG-b&dBJT?TeK7@iN|dZQwg&_pN^vA8iocrwD_`n+FM zoGVWktj~V<$^ZJt)CJuEFXC=F>i2y;{z?vkL&TehdLqd#XvYJlUCYAdv&%d?6&~MT z4>*>*wxY!YiX5=o8b+}v#o06O``9nuf{wF!>+8~09FIa57>z;_m7VX(Ev_SXs2u}D z3Ez_KM_|jvjv$v77Q2HzO~E%|D;5UrF$VV(%BX5bJ%YF@@hnP!i>cc~<@{8!waK+> z7o-H1T!$K^lIc4XBaxAHEx1&C0X^JT5J-Bt93;)Kxw|&X%vQ{w28YBNG6@-dnd<2iB z6U>u^tP!xQt+gmu-KQydNniU@C1E~1>sJiTi+gy22UPZ#$li&k%L|hPdQdN8S0` z5Fm+L(B9=rd{W`n&)EOy1I92Ks&5#g#1q1B3*r@t$8n=oGb70WIT!*5m(w^MQ-x3~ zp};qEo7!InHSa*=AP?Z@X{do0C3yiI)|Vst9I3A6OthnNyTM&~l*BV;6DgRUj}W)& z-j6CMBOJWT#*pNSNgXZL@nm#{<|yufmurTlTC4*LRPT zO8mUfOK1j#T@5v~OFUqOs>G8xlG6UicDztv#16IGnSBjG1`clu=l~KZZV%KhtS#>1 z{hOamFJ^>!WU&snsT-v~<)vYqAlF&?0V9c06+DZ%^J%}rn@){F0?R?=qQ-k2*itxG zMio>43jacoL&^FURk(Frf1q&I7@lp|UvnrJ8=jy4g3vX!7^O zCCbCSb34}E*P4K}CppVO4>P?9!g<6I*$_LLsHf}pRse`h5yCT9#5#toB5Ut9pv`? z9rblGY$*-jX%O6V$A;XjMsi}gS@oP%mwat^H%5;jE+N-JUTQ~z&ic@EF<$6K$cTm%7iA^>pBCVR0eC~S{t~K=;Y0c~wI9UL zzrZPBAXITf9z|sqoDdP;btEojCX0N(_GPJ`j{7`4fd9Na*&zY{$;&5jP8pr7Am?ch zdfX?67bAD7MwJ@AJSN%8*3aaK0d_UsvKeElSLoYkCIgckpS0_YJtaSA%oSAKR+wOw zCyq*mt(qzHKH$yiwg}l^aslfoiL4Vl7W?g#qcTLKb5&@Jyf?0>%T}v-rZ??)sQggI zer4!)!~z!L-r{|I<4+7%%G)U+v{2iqu_H4!U$O)X@C=|;#4mbMTvm`-M+f@eGA+42 zTF?vA9x1ZB%Q~z)9BUn^G}>c{U{_HdMTc@v_@6moJ_}uCYBy%z%(x=t;LKl2|912d zTB2+jA9B#nL~17azRNZJbmHfZ+XzT;CGF9alpJo_j@#Bd{}c2kp)O>D+Z8J0hq4?K zBuT~Jvo5>)$}XiaE3_8D`po_V$2hyd%gxD@hY<(o&Cp`c0G`n8dxeHOafdON8ZZcV z*K3E%{#%{mQUS6NEBlE)L8a4PL=3M%!bQra-Sc^isxcj49ZK*fSTgM`#o4%AxvG^{ zjMh({(TzV7>v^i*FW7%xtJ`tWzwDOQ-u-kyAJkM|{^^?+lmVH@l(Nxr7*+>pj&=&( z8(I===SRDL;zE1S$q;l^JZ1VhwN%QX7h2sjmjm}~uM}A&zbq}DiLRu~yr1vtwh|)=f{NdfBHORdZ3-;^(5V@t=?ntyO&Tk$c3fZ?7c!) zyAU_%ww90*Fg%Ytv}0G*Gy(590BB4&2!6+%fkM7HPAKw8P`}Mbr-S;@h0B{PL0fI~ zYc+f8+qiC_D)4@vBclyKi`=s9Y;_~F>Xb^Y$R!wjVrd_Aqd zKhbC53a@!MUjXfO_u1l@L*R`C)iW#pWQ~|%eW;(AR0PRaGt7JO$zLAn?~B>=wBV?^ zyn)(|`oOg#@c1;Pa-u^eQNv4d-8T!L zF)DxKy-Qrqj1%1!pWE4uND&{8+LsVah0H6c{i}DlU{oh@Y|LNs%YtBOPPLi;w9o&$ z?)Lq5jO9fT|2+>#tQ_Zzz*HBIAwi}GT~M1_3)LJ2PqdvO!#Jr3U9S)0he?vR1O^%D zPwVj)TWK_&8+INkxe?{RuOlv&!>*5di~FjLREC*uppNZV&W=(RDys~rzY^Ipq8*?i+!MUXxq(*;R)XnrmYDg)~OUc+fdNH#Rn%pDBKcb7y%~D z6EWS;{$9}cLOIhzm08M`6uL3)dSHqfEnJFHoB7Yab$eb1^Sz zDO#W}3no5*`!f#4GfCVPSTGCyPqebvnjEQ_zJ3zHJ(MVvCs#FK$Rd0WL176C!p~;f2;Ox}UutFTKAJ3Hw$j@uF5aWh#?-%0x*& zR*Rw3MpZ$#>fQuqM=2JhH_x+DfB$#D2e>p8y5X}FeOI1_$vK?eltss+7b@eJX&aAF zZF>9bwN-1v7>=fjO^hKb*ImqlqC{Q)<;F_g|%dG zN`am@$Y3=gsj3qCJYFmIeh9Z7-M#LD5}qge=k`)%e)fbL2vzeu6;?heC7SeMU53&% zaG?}%{^*P%R|@wK#$Fqpy*d>`I|Wmd>{=OexN6w-VBU~FnYI5P~8ar{kuQH-b!^fqgh9T{EAL`gCb$_zmTbW%w8_??<;#O@`LJV=K#u| z^EvoT3MqeFpK7KebNhX`*{{R~xL>gpdW?T~NNku1rBPV1P=8oz{Bk#M_BN+FyUB3f zbpGxY?t%cDN1p%pkFNpLkGP@M8cfd~`Kp8$}VA_3` z6!bj{I*p5sMJM{ibNL4u;FD8cu|X9sS>CaQGdsBdJW%I>GE^AXfF%XOh%q2Z@PqAW z*Papi(fQwJtPBbd*gH8D$1=JJcbts5u3`hUT5%2%E@Dy7k*Yky$VXL|kiK0Qo|GD4 zf0%>$oCJ|mb55*40Ln5VUI@6w48MO-WWKLE^v`+oA*jBaM?Ur)OSGXvg%RZorr%&t zQY#GRC}T3khqaL?UZH72bc9i^S5?h^dpu{M=9d>HL)2h2v0ZAJTctD=;(3YZSt&IG zm{V3Lcy3AhXmrLw?3>Ixd0!CLGoU_Yt4xnYQ2;?jB=4+OQux;&NaYfG_6RHirLt@X z5?R~uzXoDE1TwLKvMK?_#GgcwDkF#h`$$3k%pVA1U6#R?yi>&m#h?HK+4M5i z{bC1563AmRtx5;Ec5p7lb{6I1*)LKau^`nn5Fv1c3io|NU>ugmByU@S2Ce~j5e#jR zN*R1{fFsDjTj1RGzH9r zREiFzomQC(`Ay*4!zL4VO89N$)BYPi2b_DNFE=~us>`%!9V0)uj)>=$n1f}<8EJ$m z#mDDGkm?;=@XK-7N9ZkcEyd)T1RU!Be+vV)i{-oFqwKMlBNavm8amwB6!2oAXh>no z4!|h+KVn;?+bhYXJOv~k2#^7E;(Ko<6izWRZc`VrWN4q79UMh-PG5=wX3vI=TM<7y zKW*oPc9Pn=y;1j9RW_w9CHgoET-KKs8Uv^c?f<2(ptAZD_2XKf9ne1d%)eP?9L}Ee zpItJ3i}|=vLD>>hDFx?LcNzsXK{nOkn?Jo9s{52%{&QLD&5G?i9x4?Ug`w0Qfr6e| zr6{?w9hamB-n;|nT*ps>?qw@2K@H1ZVFl&x`+OwNI^x%I)J!@u)vMLG5+8()x}(@E zwcwZrmL|hd4PA>KY(WkA{#k25Ch^8-PTvT0R)>D1xSUq6EZ3^Qjjd4`;Q6A7n4zX1W*sE_ucA-VyY%l&>^ z`I_e`=?ln-6#Iw-@&vv7iUy<>`xdp)g(qYGrK!U;vlWy7_#d=S5z7oaZTfVi4dBt7 zCBsj6Q0?0Hf6eA(rpUz-r1Xq1agNNR2+#rzl~WHT10oWL;4DhBYN8T(xKOS4^#UKw zy$DJv?1VyQ*U#ph+ACj6r>mm;POys)n*oz0I*T>c;Eoj~`(pVa?e+8rOH{8gx~#tu z$34hYN={NL4>FM>pb)H6?@eC78COmzBS`-EwLd!>TIOdbr-!sm!)Rz$YR^by-tdpf zX{mnlawz&VFb`qmK*DTh|zzKp8Pv03Ad3yA#@55UJ-V+d_|)@4UFkGhfX>Z0k3{uSSP+o{rmi)eB*Br zt^3qFL#&LTk>>lKbWE+5U7v#>4XOq2%yyq{k^hqA z)@SB+XrXHV*EKNKxBTyJ%d9$q+wl#3s^a-tRarPxU?z~^ULJdz6?{1_z%%HbJ2OEeU!?RQ^flhJd^+z9mtE8J z;+%@51Eze}Ti~e~!aWpz(D|Q$Y$b^f_12JwpM(Q*c{bx(2h6rUjDs;;FTy5fClz~u zTN|Oi<5siqRKwTU>Xx%j2NN2ywA8-e;^On!>2pr3&CztRRtE46duF2E!VwhU%Efkr zAKlCGi4#Rl%{P#yumLBHT_$>{T_k4-WEKs3cST_p?MXUikh9`3hnpI;EvQ_P681Ej zplf}9q-ge#)W{AQ3mi=oj(aOecrfU4U;yUX|E-{In*rbMp6mHRyu9rj?jHVoPNUi~ zK*sqZ5Qwp@BdC4R1$)F}n>~b%$#?zH@;}8cDV2vf#PjyMPC@59g{!%Z7$~mi=leFI ziHuFcaQK#z+3#{fARG|YqPq%l%22+gx6WigZ$M?~@A+cA4BS@1N#Y0dY0)TXR$9-9 zEO@#cS7ThxpGaPQVm*3p*uauwy^+dNOf|jq737GRO(jrPiRt)B3X|fLPV{{xIhdm$ ztM)LG6r?c34r zrb>`cK|I;h2a*Qmt9rWqf)-wyd<8=U)E1U6(BINUuzFbetQ39$&xQa*^I7yzf&FW- z57PGwi!&ix7F6m^jTcNsAvmjW2^$XP<`zJ~_&xGq_v`8EpQs4^4h6-@`~F^CEELd);dRE> z2l67PeKQniQLF=FOWLMG>zF}9wV-NWk6fB*)%prsmwfw8oWp>GNRm*V0%Ywe`v`88 zVX~@(M59R4`CQ9d;<<&y;bg7nNs{v#e+q$J+el671DQ(K=f-T_iPI<~C&2I) z3&0(+=1w~d78VV18W&y<_xqO(W%Sj8N0zzON`LRoyy6w&rOVin;@n)yKwra`{(C0R zfBIwzC$n>51rtdz6SokAr<^2;h6Tu8sxVS^8GNWEE^JV?#D8Xql5$`9m9KlS9fpFi zy6^$6jCyZ&t2dM0+}v?RzO()FfVFxl@rT#(GinKQ_HSuE8U;vds1_XUzoBtg4$qli z>P5HIU4@5+oxtb)rJ^o76|~#E3)DfmZ4Ih*$&ulR73u?E`)6SIp9+JDe)Vu0iSX}d zVc&x#dM;gjZKC($JU+ZJJU`n%e%4KB1v1pnuL2yt@z4Bk9 z@Y??}YPO%>bP3mfUGuoXH|0HQvJnyo)7AMXY9}I(fp(|psv)E#G$52p2TUv|JUJ0Y z#XnoSj4nt<2)|yOP>icQTy_#mg!V{eS)NB~IicKy4wTL|TYgIg^z0jjwW(r54_%qt zKYf(WgVP-~b0PIn9kdrD&W1$CMJ&Pog^q?kq1f-rxiKtmGn`rPQmOpx$lex$n*Y^0zmUW zK(RT0y+!S+&dmAj&-Hz;a@86Z5c*{Lj@-*xU;8GrLyW`_Sy149Bc)j2DI-Ed%VUsV z{1*K-H;Z;b$m#U)e;oRbj9lz$D#fPTwcMZl(%XzD0B#LM-SvbnVz>pjhhs)9w+f5t zKtG1}(%y6^zQ)gg$!&h*^n+>F%lfiIw)wh}h<}dg6&UUUb$O3Uc^<7AVm|1}-f@G9 zKDzo~FC_@WG86xZ>3_PoZ#SRi@e>}|By{KR#`|ovzt+$l>5K{!pB87KrOpYew`{4G zNZ<3|*IZj*l4F>0D8N)uLJLAiQ9>1=&RS8}K=s2zNRywnTUAZPi?f@2NU>*)hMJ}I z{CYxEnU66Mb`)@i!`nHzNZrM-6;4j<*hq)wK1OeR|6Toe1ekHmJmr&8*Gu z3*h=jiSt?7{plj(k4>VcurJZ3dn@Z&57+jcIOY(|){Xc3+~}<%GpFckq7p`R;;4J1 zdkOKsxPhCq`q7#mEMQ6D8k$l*7u1qT;6NjlkLlesMFkiZUzbXDfRE3s_9*}@8AYn zo$rVt%j$B|Z7iQ5=>Sbjv4IZ|fj%Ui01ecC7yW2LvE=cYwG}AW=A{7(=6c_xn^}q_ zp=x*Rklz)!lk*J|%f+JVypE=*4Jbhs8T3lJcd(00K;SS$ZEFmXu*BMDCBdM2%wUua z#V9Mnt_PRb5;_XYv!?Hb@BhhBjRMofpNg>gTRf&&Q4$67tfBJ0?JXaFctL8h2H49( zIYIEu`S}$pB^f*^1s_B8#V~0Kn1VR2sQWO4WI{$b@_KBb*v{&W6v+W+;L(1Y1!iqjAo z@~vA;GpHCA6@N^M4aKnV*0;X-R&olC!5cC;-DW%3n*Xy|Y>iu-cC4u^Jq;V96^<>won^32(pB^m+ne6dGPn6CdWhxET~I z+2VS*dS;$Dyi7fEtvC=*9lA^v?%53jdA%;}8v$+owU>D=15g9qv0g z&mtZ%VCzke!?f9bIkNCmpK67-YO+JAl@#U1L-C4!0=PeiNjtJ<1+S98xdthk!{cGm zXxA^p>@s@JUg{bz5f%l8;I5v92wQcwv|Zin|IJi^5E3hfs$@{GW{;&jMNKOA9$Wdz zrEF6$CmL$NJhz&nw?tmX6+WumGXIA&6Ut~1-wNZTZo`#HS-G`*GW@+l?G2<(S@ql1 zkh}kQwR1Y!vbS2n9?@9j!yuwu`eD&bw4-Kf;;Xua{_$e&0};xk_O6_giNE+ z`;Q(D8w0xbJh>PY!brR=TeCHA_wl6Lpr87^V(81=YBel-1c4Xh+f#y{yhm^IU!AjO zKno$n-j*Eh%mo)W?HWu5s@D{2A{AmYo(zwxEmq%iJ@a$?Iry~M?*q8FI^cXMM8>>g zObFe%$eD4%LJdCi2b!2KCQ^C9VyV1xS@aw=<>L5KS>PWZlS-^hf~hF(6?p zrX)4nZ$}N6+cv>8|LQG1hI;Z6bJe3!@?FZjFBm85G(_(h?XqF-5=jTXEC89=W8=QY zb0r~nmty<(Nv+()yy0!n4m?xqAN`uc1 zkerm~_M$`mB_sFAB13Y&1{i9DB(X%XVfGor3*`TvFU{Md<9k`oaW`G;OndPe z!vkNS!?5Y0wQ3KAqoNqAA-eiw$h<|QnM$AMmmv>OUSkz3b2XMC01PU z(B-%d5Cl4UuEg%CgPs#z(Ib(r!o=S@CJ8BTfn`1}OcpHoVk zrr68xnR#uXMhf|W2WiPVTS4g;d)q8_cuy4=pq9b8*GA9$fg6$_`NO2+pJOFSSZV`c zUu{iNJ6Hel!6IXw8gBmk7bCk(*Y#PBQsnmNWsJU=h3`9mff2ldJBh93IqHo;iM-#i zfs&#T*_RUmMm`#8~PagB<7LOag|_3$h_Syo57(umLS>eCJl z&x(c4>h|`43NY(*81rpBayx7S!_K6K=8nrxZd1x`;_m=W&MWY+z$y~8T{G~To?c;b- zv3ahG964UTJHIt|S8ep`j9}SnS2ga{>$}flbME*Cl4u3n--!^}zFOa`kP4A_rEW6B z!uP8G(*g|lPu!aidC?6Q9)#HNzL5y^_d?3&yOW7;>jD=o9fB0~&IrLOtOA_+>+Du+ zXsGD)oyiN=bEaf=^g9BcfrMU4qwY)IurHbGq_~@O!wDZj0K>W6W1|{Oh|mOM35w5N z@}#d$*xyl9nVs8FzXU^~XJH8!eM5<%wYowppvGR|gngkW_jRNsF@hS<Eo^-|Lp`DKLJlev+Rv29}4vz%Yj6ez;i<<#d1M>(Nj3n>$Qc zg21*Psj%Dd!s92Ze9)`Se1fv){jNqJPadM#j$H>sN(WFy{&YOpKYIqkKC@HqR83Jy zCGxo0P!#%sPh8O)82x>cFWSFWo8o{a+_I!4R@n&z+@qu@_DwoeWU7{YH6uRryK~p4 zz;$Y-2R0!gsSl_R6hyxN7j`vl0Q_$O{M+@Q1Sc&p=IOYs#A4mDfwY$_ggoP3nY(o# z?4V<(4C)^p4_tQr5J;ojVJquVYbhTGzFc3O6@es_s&CcdcJM1;(8Wj3q2bz_C1<`t zD0d{W@-AMR4Su4)XsCH+UJ5PzLabwX?knb#$?y^C#7CKQ(oFq0tHJgX_M#1jUBJAOV=aG7AePe+ODSJc821_v{ zGC~KVfgU0tY@3?ufuev#5h+AZ}=Caa_&Qn1P2T-5vP9{TG`_jwmLm!@4p z;ObrEVtt5L)AhX^ckX1!-@yMz(^ZB=^?lu;M4BO_Yv_=W?ivIM0Ra)|?(Qyy0ZCE1 z1nI7!OHwK6?rxCo_s;Km|DWgHll$zm_gZV;(K>ApK(AItb9tMecc%>x#UJe_jtmpt zDs%2LHOjp(RxWSksPp{cPUGz8uK{koO2&NHr9UcjeBomMqRJNOV8fN6gy>a8LEe5i z+!c8FMPwL857}n}@{xh?FRU-)LM&{IAu;!bar=97feLodlLkYLXBc9Eo=@+gN~u&xH?Ckm6ADqQ-@%jKVWND75Y zJtxm+Dt`M+P5%TZB*!9oV49|qC^G5Gka_Han3LFS+#1F`UeF@)bF=V0oD{u7Vf?~F zmj7O3$}S-C?g|(u$*lJ6)NU?k4k@H$I}kPqnCYu>rz+|qBHc@yge6e$HqNDY3?+CscS~N7S zVaVaGzE^l3=}#%@lt$E|VAXY@1~Sevw+Oo%t}H*R%|NxnV^a&7D%m3wf4TT%D*7A@ z6uk2fh7D^lu{(W;s6WLX{uY(ok{T#_zTp1`Ir7ey|cF`+#qN@)tg4TEVH=}p))LZX`ukzhx4K}h-@>-5@ zn2A?zt8#fU5>0waT1g-l`iWBT2%KO;x#7t~|^>Qgpv#G--lzsJCwq zmLm?DuDINf{Vgl8_U7M(7p|xlMt!ehmpiW!A6mRZ^sR|4$~&lMC-CQKQ*tk(uE#zB zJ($hOJ7qmJ?_b%E)Xgv@Cp5Nf9ZV-riC~5_MzCCbnY-5HE$tNio3iJf(PJD|qTY1y&OL}e zC0lI){SA_sg3i)pj4YKe>>q1%ZCdO1H3d%N zK(-fRW+F%Ut1i`(MHp0XO?{Cvb$*(%)f4;Q`yaD$T=gM$7(}k$w2?H`vh?ES3Vx=Y zElpRhCiz!V4pRMl&Nb~$MDTfba~Y|&cdhEm{Nq@`l|lMZ9Tg1L&lN17tabdsa8Ja= zg!Sq|ucbj1P1@1oq-3z=d?dUnTjKOXE(rY@aiKy<_I0q2iyMmKQQw!k~~M&{8-k3zg+0A4CRwB+fh&-KcIKY4B_%n7D>QjfrQlHRNJG z2aYqvlWu_;O24J~rj56&zy;wHhMMbH7N5i(|=;QfmrL8N=7U=ma>1ELY%zm{^05JR;sSO5EH5rRna(5fZIWbHp!FqE|FEA0E}?0h}m5})u%(U{|k zqpZrIzrynTnO?1)508!~P8N`yG1Pww0=t>D>;$JtD`&Yq$=Mb7zIR14$kmBCD(vO2#=vH@FaAYBh z0*)4I6BtZ68f*a3T)IXbo(7Gi7Eg|kU1Up1e1UlAFO$gcVeANy*f@`=CYinFq5Fh?nh> z*jv)&#P>~y73Bm=#w^;M^D;ME#=O$00_ktWHf=c@ZFr&p~WOTzM(S9_$#xIO^yQM)HodfoSk?< zeT3c}9@G$WK&6|kD!$KXy!x=Y1>LZd+`AO;G%W8B1_@+hHL_&|ahXQD@s^9SuhP~( z@1O=P70#I#gxgy}a^iot%U5So9_b$bqEeq1xHFQ(yn_F%(2jo%+DHAD7i`+tUwKeG zT@G^E=xBdj9;>O~x+J85K=bu@(JxLosgeTy696nrOa z`G>!z*uF1&mA`@cs4yf8Wyba_>kFo364dNF7mmh{HjY}>lofH)si+K7(Pubiz_xm8 zMeqg9l|3m>tZy>_j~O0w8N-BQh8MNRPG@b=Y(!D_{Z!+ncok zhoi%7-F-kXx9ufyn5w>&EoPCD*rk49x=259`x>I9w9~K@J0+E8l{LFfOoeuj5y+oI zWWG|VOk=v8MAI}h~j z8|L|{;xR&bu`#|w{*ULN`C2FuCes-kmU8|h|BY#N#DP-{`M)>OY2@{?Ylps|biMuy zWMFr4oVe$>@!VCjKt`Sk{10@7nXA;27T5dzKM}D?AAy%ba4uG(L9n2!&L%KLBFxtm zTTNb1d?1tRd{w5)K6(Es4_N%qwwLY=+nZ0Hax$fMM(!5e+8uwuV39_(#y%k^DpO|( z&xf;ihok0)c?c%z3WncxR)C1=FxpVI4YD9$F!7L8ms9pQ9|55;kU-svG{cyU;T5kk2><&R{2#b9jCJ-kc;&-dT*L~j zLj)jdpPZX=?dUKFge`P5jI{%aY5ztA?V^sV$o`TuZ*0iTvUgwf9f|Oo7^+eGSFEB1 zOHN|2`b`x7fBpnHL1hw45xb$oBTO;gE=!|XglCsd%MH1ZtsqgzCHBV$DD*X{ZL(vx z=MqZTa>O&~;M{#t%W!Ye_P=Q^L#2CWzUzWWj;ukl*x&rB3%o})5KfcKwA8p*lflkXmp zx6rz*F>p+h{TS{fH0ny#ZWd}|5#Bep;8Z<{w@Q}Nh4ds+PEAsw56TJ`M~p{b^|DO~z{LIiT-|_!zqT>5B&<6~ zs4zkm7zF0IiaDs&>0Ify7RCG(&cg|Ws!@D{-%XiRqRjn;qvpaw$wjvPj1ZR^oT}Ti ze4k-GmI{6J1sZN$`qpH`?DzJn^kA5k+H3Os8r%eYUUgQ=7QaU&&~R-=7Z>lsdY{>P zt|Z>BD2)`$dqMW|0zXP6sIi5`dzN<-!r?!dT@=T}S#OWc>R-99Vyq_|7FC=xzZORs zeUej1WdsR1HQ8CxLdYXi$nrxoav$V=3l!(EJ?emxW^sX%j+lv`EoM>9tDLWv7uXYsa9EpaUb(agT^4 z`1!$p4IEg0oSs2Tl+38I4%6i2s|^hojv!xqbk_I4@g}MGb(6WakFQ*rVflgluIlhP z6xzjefm^d?kqiQjj?BcUm73{}pH`vXYC1>IA`cOKh_}``*Pf??!NN@Qjf-P=-ZA@0 z=&a{MPW`Rz?+(nW#V^odODNFo4N~>{evfC69GPTqhJ7Qw?yGnzWp^=76;PX_Xupv~ z6YqKjlgC4o6c>`3y{KxuOC#HYg(xawkARALlv&FOOyY;yL+sEu@R1_@jO1F)>?As$ zAp*7g7DP~hm>2Ocg)U8nyn}x=;xzvyAoFzaL_0^IV*HLU=;t9vUP783GcANovog(A zK7n>W9kkL64+V7?Yv;dif50tAaSA)+F#q^4{D~h(L8PIYg^HPEsq`+@htE60WYd=o zz8K0vmN}5()3St*gD?K;^3R~Cve);1^-t#Z)SdTVpcj<`rlbJK;e zVPP7zksJOXeY>b*^oxyoI4>~A0ky8~kA&{OR8Sm~aWY&bR=k(EkPb-CXWGE$7jTb< zKOWeS9Fvq;KYjD)2obvaK>K-CUo`#?DwZ~p+uoA09|V=T;-%VgivHSj!U}UzbQt${ z=3no9N?+f=!!b!GJ1QbHr4D#z^bUU=ZHHea>M;UgWqI7^3LelwZloT%06d;qaaT=& z_-4G0$ADP#&S)SrA_E6DLUR6?TG_V5k8*3BAhq|+(4AgB0eLwSMWvqd+5NXqFv!4P zQDsLcpR)R3(EcraR@PsB4;yXxUrC!*aXqJP>lqDVNx%R3OFui)t}+o3bXs@He0h@V z1h|G`Ha7QXiQ$R`h|z3vk8zv!x0&U7-B^M3W#x#@oc8kj+Tf%dvvx&xC3?kydiR{U#F5PB?dpxOCP*uH1KW$I>4-5iCEr1RjTS^rVhYmZ@B%SmfxO9P|Y`k;$JT|tTpOnh6g>|Pd`ww*=5ZP3IA0};xEvi1Hw6=`Ov-JjQ*13Q&Hd(@tcG0ER1Ei23Wd&ynI1|r!T8MKYnH=@^#tmSl!|W#gfGk zk|PVZ7w|viAON2LAUZ&M1tGU665Gjx^Iq?0BjV#~#OqwIDe{?bz@ywXr}fLMmzfA# z4_eC&*uV&$reePI?teb3nhbl*kc(4O-+sgja!f8Id;QzL_=`hw@h!1r^`~H|;jI`6 zsOIiqTbG+YUgR=G8JWcXn98mnkD#)l*Po-})PL-8`YxubO4><>M8IHpTX)cd9{>0a zsp;q*;N0jv>VX&oBMD4mbBk|F5cY!B>D8sF%GP9zd1AveP2*v1!xvQJA89(Cnw-t! z+WC@xZC)1wS;wjI4Ddm#b&0)YyCkitpW0;wG2IgNy-K z{S72`ZME7wBrC~TKCnJ&8}Yz}q1XLAA<9}55an`>ca8As+mp-K5g5pwiAh*}!nP`1}IxgCsO8`HL$7$nJ2B}SoJ`~$02z~t9m{qdg zJWR0C3Ov~VFW|TTS9X&KD~7W&n?DFFrSEK3e!nw`7Gz?}ppKpxo zXXTjRu)bha{GRl=+TZmLI_*aZpx#@`KF4p1r?|ZRlI({aNzE}J3Tzv3nIlp}x7Pr*U1tbtBH}9u~=R4mm zY-YFa-5c0#7AAzCSI(u89f#IO1|6#MFc`eH)ie26JH7@Nh*gbDf{K$L)q(|8CaPaP zdpN6{?%wnQ^-|lS@8A^v^hq60s@5R@+uQo$xEdlcl`54!g+w4F8hi_o4cb?psJ0ub zeoSQ!YgSxy{U$P=~+aNsW!?7$DG8M zY#%VEFT$EEs(rUukYX^{62QfRQB=`*2sF-A6cenTY(M%R{)AC^s(xV5s8un-!_!~g z=y|X7qdv9J{LA|9+%A1yiPI^0{P@W#%ofznf>&jWmJg@*Zljid1mI{sUB1DV?Stl< z_L9Au{AZEgK4d|qMLyCRme*HFG5uB2W~>P^7hycJ#nvfX=i=}#e6U>43mlF3ZrYaT+Bms#!C)*wNk!{FYaWnAC*wFK!;tSKfbm=a&D4<+`&S5uK6U~*8RZ!gL7 z>4)#?+oZHO`S?Fb1S=u6m=_xa-6jI=3fEowA+N?3q>Rh-cJvWvhvZdbYA67obO{7N zAahfRyvi4si?_&N%7lYt|H6pQTTbQn(!V9j6PRCR0(ckr4fJBLAWHED+C6!>HClI; zK;BB}FiHRh<2VdNV?p65#>hd%yfoZr4ONm$fpYHUx2_-$L3OU@F?*Fb8hn~KuEaql zggko9=Q-yTh>2>2lu5GB`udV!IN9l2+Jr?QWu^O$kZU~@M|?y&b!q&uZ1`5+>z5aZ z2AgF>EfaJy>G$H!?Bm#>T_O~^WtWP`tE-r^sNJTRW5VBqm{Uk=>+3`_>{P{rSnTKu zcF2xuV@4bI@OT_Rw-3s;w}K0K;jn(1Gz%cZ{(J=@b<0IYlhAUVP5042 zDOvX?le%tyB3zJMV5Hulmxj)oD6HTii*sdlECGH}CFN$I z+TRv9yzNQYPr6SVyHrIez=aY`IXjt9*2F+fyjIdN`1dSOO8%hmCtr6?A7R84?i8NFH?Y2++DeNPY= z)+@a7edE>NmJpJCq{^E3)MrJ^k`zZ8Q8wK%6Nio_hNb*$AJ`%#WjDci!@2AqkG(pj z7S+xuA1d%DuRXS10YU04dh=bQChshP3iVDihSg3_UTEpz-ySdkkWhU-0}|z7M<1h<8w|pN#=v>~v3U zkK!Y(74e+RaomoXwxX0RH%}n=_^9PKtEqxAwSBuu(xv}1jv=TW$&0FkoMlStBwxmW zxN`txKy+##^WJdKdswNftbyvyUWqnkUgm*?C^`_C3Oo^+j6jakw5F%dSC^*Bm&vfI z2i|U5YPTk$o)~NJ51j8y2#OyF1f(Roefak}#^)az$j|c)H2&nMS+M6WvQZsc5tOP+ z(S(T1`?ubKew{A8HH$xd{@pIjcMl5cqsPp80R|gq8xI4CC*4e4zc1b!xFDH$2L1Zd zMdZ3r4N{9~wFAa&#^Ynw$6>Y6Tf&A71iRk^Ln=N+bj z?U%PTD163Up5bt@hK1HU_b=<(wPe#7-|=_Ct|tGGF@fbmQ9$0^in?Au3QN9J2u)f+ zKm)pCl7#)UK^Ymg&|mc?^?mQ%10{ovq&SQHJ5SRhHj_o!%0Ime!fztopR zHDTpHXz0}sqa%35K@#^KS$7jxy+)E=O zub=|I>w>n{-E|PTz(dFSf6sT_$xoV)+}lZOZoM`1isahXy@b0NVo%~q+Bn8aHHVPf zGW^r5zaJo``Awh>#pak{y<0zZHsD+~@JN+5``D}tWrQsn8PJG+Y!I1ZMg+{XA-VOp zJQToGe*u_b#lhlxqH9%+aAikTRoiJlskGH~;M2Gqx9d07Z5n59B#!Hlbp4wLw5tDG zQka79F}L8PiN?eNBJkSjWN~{^r zZ%t`%V|A}eG_RJUF90!8qo&gvJ5h*(?`Je$&W&~anW2YYSt5tyB)}lXUGzFNmg+}j zN-HLz7jX9R>Ya-IE!<}(x+t6fPMp33i`0Gx62tuBjL?Th%>OoRxFa8BGHgGf4DRnS z<}_q)w$N-aE8P5#C76?=ByKGUfkfi;jLjl4l>WB0=q`5_3ad~TLynbG%f)Pl zU-850?eIi_e{pN{($taeda5e2S79LqF&8t_VSm|)--^}cI}l-b)9XgXL>S~(yw_kX z852l~Sevhb`SyLF?ZC(5dwG+!w=`s4(0yW;SSbfRpUaCjzx-EUC-qZ{HF|`*^qHwi z9`M!qgfcDNI!C5F&el!`{7c)T^DGUs4y||F`ZdInI|#eXTJm8dqpAZK_95JX$4mT%EYNun4{cEn~a2S$n+v1>3Y z0{m0VI`A1q%^z1VW;@^nV#E|HKeu3cu<_U3i!R^=KCMK32anE0zlpW= zLB3A&Ye8nB1xW7U_(S*gi*P8kEzZn$uNl-vI%u^sbhW-BA-G7>?u1f z%tU<7HF3}fo-4-c(>F?s^V&FpjNo{ET+LA5`oh95Jr`-g(Sk$*N~ZY$Zx*p8Ks3vN zWJKk{=pY~sCE}2$WS;2}f{-wZlGitb1?A%QMZ9}n0_xAzBRiH%0U(p@I1NcR#*M=G zPGMh~%6PW79;=VMvd*|Pj3x;sB8veDkWW807OQXCC%>JVtmDtutj&ueKunknH>gVB z+54WPy*UcYS<7K>o*>EZyzVu!Q z|CjalB!K`DiH&Zv8GrEFx0j%ybM0F5CvY#msS>09v?9Ja_3q_`kN_lSMc8JWYHRCl z`LUJQyvsATjvq(6g#RM%kd%4VRVn=^p;SO9FNDls7q0fbWS>)Ia&}lcw8U9M>$v-F z9E2;Nr7^i0hK3ld;`Ph|dM-oQJZ|$V^L>9d9AgCPY>MIbWrZ}s9gP}sAjyV10zXS1 zitgj@%%{Y2=?ulU=9nY*)R4Im2MePHIaA*=_Ge zOKj&YDDIA8pJ`7ooin00&~&^-!kJy(&Tr(W2Frz^&^n5C;}=soj{)OFyHN7$P66;< z=J~WX`oFeF-6)i)HA;}kZ9 zhXk>J>&;VU->pJKcX#Kt+^ z<~G(?=COP#*1O08rQ3-Py#9so`aChv3S*gI!UU=!i+SOk?DE`QsMawT@+X@>17`4g z4h4En-w zf(o1;0oDL0oT<7_kkiq|IYe(7k-!&{#;`5bQsrQ;pG7)wBKv3qM13G$CmFm3 zI~ai#yHJ8ltEh66(Mwg%mj~sfqyPtlPb`K>J8=h~>ZOO+P-u?}YP@4I=%mO@e!T}S zJEJ*0mHe)g0MtA`{EDM90ZxxVtb(DJR9o*i(tgA9XW<$%YRgO4%Mcgzpiy`YQMV~@ zE$lc?jI*?NEu`<27C&<6Ip&79>THY@R1@$jMW5uWfq%4N zf{A!W!{nsO_b1%>{8i<+YN_%RZUkFS{lb9-*LcG_7@c3Ha;|;pY=ppZ{im_c?dH`L zPYzsd&k-#=})%@WSM zQ)^5lR(2w5osXr{9S9(sN7#r?2o+%B9&Zpgf- zReUD{RBUI-nzp9?d;)<2zO%bNmr<{ZH5WWqPXRGzwu3Ydu|E~xO&89Wqq zBfHAB_c8Vm|8pVY+(#-@z!oFlU-TjF_pCL8Kl2oQC~qP<4NE!Q&8)#P%>bF&D9eQi2{q=@Jd zzFJiJB$u07M1MI^1U2Ld7?jZH@(jWzVsLns9XG_jE&^oJzDSycqiEmOJN=?$%yQXp zF?(!LIg(eRh-2|*6(nUco$(m)XQ{=g8F~>&{vUNtY6|FlQAuO-!9su?gdKFzBw|9c&}SDF4ml;s|?uJbs=V z>G}DWanX0^&%}?S_JfHrIiTVjPyl|R3Fy2h4JnDCFQpSStzu44D6s=t|4Tjjmlu)F6N=tq)I+<6M}H>j*s&peO^URLgZm z6+OUer*Cr# z?sS%`+s}uUxatt-;?I`=u8Y1Uo>={9=!d(#3e9Ei3HH@BkD732?A&Vh^z2)pojHLL zX}ON8WEAL$96)+&M`vOfmD1G7u3Y%NKdMADQ)^G2AA%LQlvh*0C1&n9u0^%OG0rc$ zA$ouL6~;CyfHVGkn+6VM_(^cn;+cP19H~lLL590e*dN&E@f-q?1W>J{5yN}FAd;76 z7|fG3$_{3KD~&D#07a4(mon=0X-AAY6iRH_94!S+1mgR_C2f+x11F6hu?Vfb^_dp0 zrFy$?TFAcv4~qPP+ve=hPbts0lG*d+$xDbK#V%(Z;~0>f$lArQU04mn3ME}Z5kl1P z!{mE|=Ya@Uc{u`h4w!T3IQ9oFRgc(a z)lg20Ro_8-zC?ZLp9GdkjttdR1OIhDpN*p-e$UZQyUJ`HhzW@a_zV5Yt=`Xw2nm6p z2f9(;Nnye9=n85C)qGmqNFCPH$qFrezi>A&$T_RsW{>b$_|NQaV%yhMo}~6j3UD@h0yxJ=!434Am~h`vOaiozueNn?VLig0uRy)C?e#uc7uD%vFDM+bBfowxA@sC+pj1!X&>Dmz4~0sw{bl8VpZ#^E@!C4VFS)7qs^RF~j0VMH6pP2ht;xb*%ksn#vbA0cJ zdmND$7J0c^J3L~BhMZJ0o*QAK_71Z$Ldf5Ceqlm&Y0Z+(>DE}RDBKVBzyGsVBVTJX zQ9!3QFD;Oy;zjX<1upR3}50OY$Y&h^qyzT?FaJVqH7rQEmk3TK1VP z2b_DI@eW#XN+&-NB{3oHF9V)dJ%1S?tm;iJYSMErH!_F&>L*U~o$}%Vb5-%9diY!< zFlG5s9NzJT2j8G=v+~%o`Leiu1kMb~^^4IcC%!?A!9FvciMBC~Jq|4s2*&SQ2L`s$ z{Pl88Gyd(kbk6G@)Xc&uXBNBBa{=?rU#m$hWZYA3mtMUb(|ViB#y2?E-^i*(AB>Aco%qGPC!6ibY0@ z5*5Jiy+ke8nqhiCCZONHLA{-S~W)7C*hxrBQ>5rr70VG=Ut zpixh6{{E1aOJpJ*RAG@i&MYzNH(dhn`liU=-r83M0tGt(QF7ZWCzIA`>`%6?M^Z3t zHF_d>tkj5GD{F}@%2ew&PmVJJ>Rg$;6IY4N%p^Z^ntqFe<)mhTO=-CXf6iC=6hTnY zAz%H%GWq!VIfcem*AIV^mwQ#;IxBx%MH7c-CE>>hMsf6Lb4_u?cq0FL3U1>;8=<74 zB0O(-8)WDcpyWO@J*jW7b>X2kW+hwN8{qx zTcnC?EG)lio&0)G$XhxEf_PyG>^h5?kE@`I^g8YdM zQY{BOpvzbKqRP;pm1Oxc*tpH_Q6>9*s|IqNs$s0fRXU$lcfQN}gX6iPhPjclJ(uh& zgfkzRG5z~U)H8iPOZW(!W}TMgxOhthUtRGPJoz&4D}nG;(=c1#2jgLTG>yiDIU*9A4{4T2V9E96>B zq_Q=QRi%1-1<6^n^I@RS5N4a5YB0>NyK82`+^%+U<_OLO4RWh<*+JEISZR8OJ*K`W z)T2MVb#%Rr?b#~kTT@7Q(HNsld8`(-5{iVt;{#Gkaz~^$_HHlpW0P4Hw)5{+SKUCi z$`e==s;BSirr#LjXdvB7Lq~pFR{5&BP8ZB_2&#<=_bkz`_$otQ9WNSgg|wq6u+$Dr zWTpc+J+s^?ndV9XQ^+s!eB4FuEVa>_7((B`d`5pL;xzd?_|*M?#U}xZAS^kRQNdyW z8jN>79_F6(by%Tc{?#e2L6T{-@u4_#>RiA0gHg`=exeDW2)j#@17(B2xg`|XK@^{~ z=J~{t=5^uqUACaeD?`Rbmcq1EYDeF3Uq~@GFr|uJnkUMo42-Gw+r^GNb#s;VjEBfO z0_yC1n0^djaGp{me#U*F9GRCKPnBR9AKSbf)NL6Y@lqE=qy#xax!v>Yv&DOnex7fk zmv$e|&j3qnYPy^lKyL9|kt8NQ#)A`E<8l zsK`5G2L&b9l%1g*ec4Ioxjy^CKNM4B6t#g9nEB9H*0gNCrDip6hKnZ+Bo zA$5{DW~2Stx7NHB13(G-qV|acfbiiq$+ru%(<g8C)O-CUN~ z=E>Mbqb?JcvErZj)Y-%QLL)?g+5%%latT03z6dst5XEvUFOV}%73qU*j=|sb28~hX zPcvV~ueFhQnOnR-0MJZUW8QVX;n<}Y*!`)v-tm2(w>_})8AIJA}L`! zL)6O9#z>Jxy_XR3UAR>;;P9zKEW?`L$Z?fA+KTjP!jxUFj>Rt|Fy%Dgu79u=mCCbr zQe99dCL!f)Hbls3$;;nB=_dq4Zwl9nWE?a{ZTCgVC9T=|Bd2--Bj}!J@Xu3sS@$iUO>5^kZkL90yM)=*-`Yy|Jf`1vH3ZFb}>q9qtCya zHpfZqn1LMKOB-3?S_rxbq*DKCB*4-5^L&HmL%ZKW2JAnk41^;VCCk=->i>zoC`af^ zZa8p5_hMD1UWPxX$j1QeGlBN{(@2*lK>hGcZUYe;D(OMXfDFl_opcaN312{aQCETB zp6j@y`N!rF%}GL}`+2j&cR~b~T^!>G`BBNrAKG35D|1R#dFXqbG48x?ebp3H?=mXd z?kd?eat8{l^nr>FNfop8I?TgY`pwS`?6xtuK2o+rT3X+4p(IoObpmFqKKsl%87=VR ztNz359pJOp^PV2Ah$#I6?luxki`Maa-N$-&cG~h~lrE1zY4Q85n{^3u+-)XfRs^oKU?dRU7JL+dic~EDW%$JOtC{^O$WHgGsv!jD3H2C z$u$r-h$dXxBAG{{4@d;a9fr+Ro=*E&<#Xrs!F${#KO28F73TYph@Ww z>^x(J`RxfAx8Tn|Je8Z64{eO~AjP!v_Q@#B&fgwBc0eoYcm5z6_G6L%P(_2W7$x>F&`6sTrmrvy8armqSvL&uw0t%}8?JNXUd zL;J(G$Labyxj9*AigPgIlYi6{7OcH3!f-$c3h&hpXE%>16bltp7792h=WPz0wDr8H z^6{_*^7F=}ts@%qYJPN?O;iwGO5y&S(wQ<8`4#{i1LNPM4q*c#qoLCXmRlejf^ds; zEohPmIfQr5UmPThVmrq!zRJ;uM!JjVag5@P+q``Y7aRF^7c*+83dCez4;!* z)BNTWuQG&fKrPnHf4*HSIJYK39gli1Q=+qi2X5)@IxP$EjiwU8t;8^!xT3!2~lT`|7UPY!4Vs}Xr-7hIIme1{e8y^ki>gDa6$M+h7Cvf6|{ivPhf!y-%u3;yn^x;xjn1x zo#o3JAE|>uPAk(kXfbwd+1&8;H?#XfB+2{1-`7!tJKuSlXB0J2@ziozp(7PoXxx z`7CyPgGjeSW|n)GwD7Uqu}SxzF`5cS=rT#lKw?!NGS&szxlvf z`{gT)WdYMS%Hl$N>xD<~A1**iZ8?McYHZSTaF!;n#D1G4QB&*C3P`)mb^F;u!x zgKV@G((N2?U(i&{@*qSt#Y<(N-nrp-9I7p+fF4qvk65V7jrvqr9^-spRU$g;zsVdj z(5rZC+K_Z~0!S?+Q3J83Z=`Wt_W}&?g6jQ--$llX8eEPd^us{^?||$j6BqacB8Jev zq`kAlQqWONwJv4ByfaY9f(G0OQ+YJ`tPj9z3GFS5+z`OkkfBqZ zcpMoozx(FcQpj0utEB%+Hsqm3gr^EEWEU8KEERz77V@D9lAvGbW=Uf^L7klabB?zc zHac2xmOB({4k5RP@c_J7ol*}i`;SM| zKVj#23>Zr)kWwS?6r7F(2@4);JXQBM`o80O4oe1Y!B<^1cH7+2*$Bt{HD~FHmG1z6 zfJsPp%z*;DX#|aB7amcJs8@nsD9#HjpZ;g_D(W~I&|fVlmfX>{gb#s5_E{OVR1A@T zrCczA?q-IKBUu_|(ZJt-7KV{wJ^jk+JlO8=W&mVE-t*EqKLMgzBOVLDsoy{+0FiHG zJ|ZXg-t9vwJ!k#0{2Iwc7LX(RWLD@Tdl3&;G|*RxozDYc-l*n+;1^`#c*aL42CSb1 zxOcYHjk^l>#q60?Pu+pBok6GO|J#sr`NutPCBJ@f?K7bdiFT^~JsxqDE_}Xl5OMtn z#g(f6w!twu=5a2T_C?e)C--Xc?+#9?8}X`Xvrgm~ZDyk3s@DpMFvWLnT?fGZf*KTf z6W5dYT7}_JZ(cz3Yk}i6UH#sLFz6BxbK@afW&r3jkqYBsGaICxhpL+iEnjF&OcP)( z+#TFNEaxSFoU!-RpdLWQbBcb375$C0Nk%Cq`d0=VJ`&zJ)qsjaZaCt;LQXao4L20) z2VMY-6-e<-4G=}s7&txZIuS2bJ@O@tMI&)S?k(*tPZBmN=l)x~ufXC>i9R8%9Ea6> z3OCXAy4I;KtMbnmb?vsx6F?jTHkT#qf}Q2b ztdi5>UmA6J0D^Jpit0O;2I++A{IWwQUWm6-S`_ON4~RPCj@;Cx{+|}0O$`PMSn$Bk zdguZOlgRR~6kB6o#vDP{37s6P%tE=6JbNQ3>~Gi=yUbm2pH(&=Qc58Bp0D2*xCQ^B z4|c?hFI_gmF&+^IHn+~IpAH%KjdfM zt_Z4&IU<~dwhm5><53QF5DAWX1ZA*alZf_%f_~qDHN56qE+7g15hBPw!@_loV5*4p zH^sjav(VBXRUN#?#doJx@%Tv&sNS_o|D@q&uZ=vPMD?);mU4&fjEaf2nEs;bV5?Vl z^t+woo&vzQ!@G!vzEIhS%7ES@Zb#uAX>^NYs3y`Mhva>N{U~>KUUk3WvFEto)!1)JZH;72L&?F+5gIJn~Hy$SW)h^35?vUg2 zxX(Ps{Z_}@u21W&nJQ7Yso$$2`U|T8O@LJ8j6%jA9d zPhtJv_s<|~S&d;S{fihgcX>oebpY88)FJWD;8uV4w?jWk`!&2iGeltb!HGc#?jWtv zb6g13ECLkG2o)Q~3RvTUZGzf+r5=Ih!>P>Z@siC%Lyw_>mabm%r!)D1FCJd#O)nT~ z0_bP{6HQXAc{p7MD)>Q8Uw6I0&Jqb!2;EN`T`S8JK#QHjUSTi^oWCAnE37E_cuJP$ z4J+gW)W{;#l3c9Hbuc$TR>wb!3kit;j`$lWwSr(?S^0_q++%KF#?BQ_T_>((Evo7T zJy;zhN?>rw`^(caiNu$h-(?(?Josia?KR!HH1Q;BGLXvmk*>EbBxhx-_uCxUalzkv zubYXq?z`QFFkgi3;eEANDfl?3_WPLI^(I}y3LuvX?YwJ~**KFCbiDm0UCtVrW3n^) z7m%6CbeRzkY)KEGzF1G<1vw|T==qQAXOuMoCRX(ayhh^b&^ZrSwAd&K{A@kB+evQ47*@#8#y7~5 zdtrdKbe`++nc}c$Nq;;gm7v=w;=W1IA^GZZxcQKOo^Gjb5#YXQDvs^MnEtXrH3UL9xL3mlUnMxxX}DAUa%AWwFPzi>sge^to_+LGypQ!QBNgL zi9|Dy=&;;ka{A5I;>IVkzlo>u&pqQyFGe2gzO4C}s?RNFw?=^s9l<3fOtX(IKvcS_ z+ja1p`dSwhNO37cJ_t6Qj=F2hLebo0J5vzQYIOkepm3W!_;xqCeKIIJ5{=)%Mo$f} z1+Pay9@IpgEeHsWP}Noj0nwprz~l(?>(+H``!BbxpZumhU}e?SH0F-!rmT43y7j+3@h?~9S^m>E4y*sxD+&JeE*2%)XVX6bl zm2+{x*8v9EM#KAaPk;N0^!wXjR$*0#lcM{1iOITEK|riG07y2Xu$Q^%;&^R2(==$H z)DX6q#hv%x5{;bm%|{J^Da7QQgcXI{HeF+;^|gUV--p~$lon|J7?UurghI=0 z01RVPng5|aMP%x{#OusHoaIw?Lo@_xhA7bZ$BqXkX08mI^>uF2CT_>JX~7iyt;C>5 z_!)}7OO`KHu?K_zpAIQM$3ZNTQ7$8THYp8%;j51#`^&F&p9h9eR{Y8kZKZcNYLpX; zcI)z!E_uyWNtL7a@ekn(dEIKnzCu;mUg#dqcBzX+f z2aJ0}nLJlp+uHL9K%mey*0914!GeQz>&s30!AT+1_3t9~%!|r3OE-{b4_vp#P-TM! ze+W%`#F!K%&T;b?5JsE?3dm}%B0DA{%Bp>&9tC%t*=HsI<=0n9$qxX3AQGhY?Ckn2 zba-G;^=Z)~Cg;s>971Gq(MH<3*xy1>O-go}*GgI!b%jxQTe8wWNJiW&6J1HqYkGfO zD+f2f0?Iew8M#&z0(2~oR9nr(3{3GlD^SgdQog}KwEC8pA?)^1|JT!3#zpnKZ|~9_ z(nyLl$RdcabazO1NrQs0bS=^?AYCFMAf1YIOS3eBfJm%>fFP;z4By}9|L}rWXZFmQ zGjre9eO=egu_!t-%g^#NtpHo#oYQQAPHhc6t-#<>>M7rN^Fg@ZMO7AzBre77*SGvO ztYKcbXPb=Cr)jF5Z%=TPfEJcIl34F5aO&JM_#&(JWQ(1Hj%&03m*u-KxPm^0D{M zZaRcf`MCuL{iS>5bSPit@zu35124%L>~wim5ul(?yElYO+&-Fcg|l9?A?j&ae@@g+ z6Eqzyx)mU~?awJCc3$wPCH%Ge?3YzLNzxxVRmuu|jbCBcE2m}z=5FH313Gzm=6=5l z*jH#;_z4>^#O%Q#BSratsTKR3`XauS-)>h_a=kPCs_NGE)WRGBv5q`opt=`Ubu#ew z@D9FSpMFeG5jcxQ_KPf0j&0i;_=kRk<~@3IE_#PH?tG(^k1byML@5GeAAVLTJZUYD zdS_Ev!2Ed}Kk7}lFmqf;Q%yCxZ*UKMsw46(I4}Zi!v2dJvj4tzoM#(n^0*gl z*#WD+kUN z46o;SUJ)PYH$a=Jt0n7~EA_)PWPUu6&^eZId6epQr=9ED6Kq+s?_)nFuFrAn6~8ZP zI-E%gU57|91)p9Me>(Ahk{WF9Aa!#2dLb*CY-%+ADFwPiqm*FaaU{T4D-nMlFByF5 z{UA}8NeW-~qX3^?LVb_N3$RH~b|5FMwu+%G} z|6^&!66XTVmvkTM)bkWN-%?a~E&kOe+oxU}#=Wg$#&AA?K z-`^s`{%vN*NCR${s=<;p-e&gJ&5_4sGz{^ZxwL)zQ!f^>Y;0W|@<$J@jF%^h_>~0} z>w?D*FgaW@*tW5!*M%}{H}Ex&-GRsx!e+UTm*eyZU`e`)qnVNTqnZbYr$9B{c?;G{>IS0du+6@wzEOo*$eA5pE_pPK*X!22pGe|C zMfNq&9NXG%SX6p}Mz6oI_s?U7yjlHc(udQ>!Lc!f9d{-dS<{9>>bsxv7*GaTWI^hJ zXRHezscW&M#*C<6NN^>Lchw~jgJz8bPMj{qUdh#2Ifuw*_!)3q#~Gb5i;+3 z8a%HaKaMFJESUUe<-@S4J|5fVY_pp2zF3s{FV3Hn#^2*MGY{a#@CaR-^-Sg;?T^g8 zl;L;fu`!ud9PwX;lv-Hvk8VY(SMJY2a(s`KbLoVOv;%${nR1MW%&q!u$Pnql`$%k; z5{iMCxAn3c+`s9oU9B)}I;2I_5ubo&8}erU|Oin&O!fpp&4Xl-sBNBnsJ;F zg@rQ5+v@N<39Zfi*!wd3&*eVb@p&m57ZqZ|UnySpxWu0nFH=?dSlpIjS^wFMGF*9) zNZZm+hd#v@s!-CnkI}fnuqyFl!V}G+hHbzFR9Fbs*A>@IUns)Ir1eN>ktSIpLNh0^ z{>ae;1Cm1V(HxAYEOkLIR^9&cJlr?3@c3G>DC#nrm4y{)p~rJl_aul)h?W8?T)5*{^d%UuEr2z^zy>r@6E z{`r|VQSN4xHuFwvc3zlL(hETh7$B6usAXOEa3579_DaaW7u?SsnGX6n^jJ|iX^;Xkk0n7 zt{F>&-o30>fXBPT($$sm!gWXaprSh13fk<}>w5*Shb#SDISf)^d~>HU&#;LUk|OEgt(~gD}wMjWo*#O_02BXah)B_hdnf<-oU6YGQhy} z#!duq3}0Ni^%HUI=;Zraq_+(3jZYs zlQSc9oea(JbKPBqQ-_BO<4IPnf#ean%z4<0Hrb`^h7z%f(PLBh1|t!JB}eF=XAsv8 z2K797)2z$4)_hF`#cW?%IrP*H6j=zo#IJ~3)~r@Ck?7+RXHpR0*FJ4@gPV3N(W*gb z14WWx984_vtSV~!jaU)WD6tg2y;E zZGj;zg9S;-cxybQ8Px5>v+AWS(d#5KE+sC9p%CgB6$>NdiVnhA(pVEmCCgBX8yt`R z2mdbCqWX*;YgJn9dM91joe;)Y6VRsPE#5?Z>Ru8KXf{1lLbHTC_E^5WMtnw?V86*l zP@mJ;SM={wqbb!cP2Nnv4%Ea6*Uvv)ZVJG0Bn=9L-;ox&{M@ron!SHrt)CuDzIed{ z74Q=?gzE4`6_?6m$u4LtJi)U!!C={WEk|PHlFeSKH{M4mR;HUzRSpn}8@(@du{~Fs z181jU5cfV-otIcLpAG7$Dsjq+xX-^G@x$2S?GtRdbr68?PQ}0LszrEZ zPf=VlRNVOb*u01@3#F-&mC_RJqcn3Qr#0U#v0C zn0Z|u$Y)@0HCuf540q=8Ak!`QNdeKW+khmkzIdAea_W$AMDDs+NmLK>4Y3R+T(@C&>PRGc~@q@5k)pwTDkw}{x7cP#%>yirPt~KX=x$2$h)qe9}2A= zy!J5I(>zn7N!nq;N!O+mM{e}@m=jEqLF6F}#4O88eH0hVWeR`Y#q)*ilA3CEmw8*9 zF_AAdDAODuJ0cwW%J&B!)Cy`l^m>U0XVaY)Z!4_+G`!HQw8pT?f{@i#w-b*^`y9V2 zL^`=7*93j}ws*k)fN8;7c}=QvRO)VEh#)3BwOhF^yzlcmTMQZxhot+g5yg-}P-0bf z$6NYX^!a+f>tF$%C$;(x7j4;Hy*cl$SM*W^!d4h{C!734)WYz0lY5!EGAaPGuoMU%Vy@5K4+A-2&#ZDUymP8;M9-w*+XD;>kRWyNvKC&~4Tuas zXdX*dA##U``Wc04tvhSRUg2XWl~N*+lc}pIn2z-AW_`c0!kwP94+fRrqG1Vo`Af1e z92G~d`#2=&3|#;&L;l$KhEBXW1`~w2)ZwJ^8+DF*TSk8#C7yNw9B;$iGhyBj)n5A7 z#)rx?;oI_60(26{1-Zs>IAb@{Hp$faxBAkVW?_S($RBr;vIqoCig=NC)kUukf7xx7 z=#CXagEnW6}ybf_Hk z3|2R-`M9S%t{+}(s}PNDKBAJALbbhh4I4DTMs?QvIQ=}?8D4A&2)_`($C1Q3bxnE-za*WXK?Hd~~Mvi=0tkQu@RX4T8 zcu0G8pZbu(+pOZQx=J}bBO44AdmQPhFhx+h)6)9ZB>r|y$2CyRv5vPkqT#=^)+>x= zI7q@e+WT2}8dTk0_AAgduct@RG^_u6Zlf^n2l2^PB7qlgwVj-K1V9rg%al^hZ8Rz2m3B4D4iazt)ByXWBte_oHwjRg-&~5jN}$7O<7J4_t?`yoV7j zFf;y7iF6_6RhK$ss}B7~g?`Tl+`r8{ptLYiJYWiwyFMYOjIV8NMNX$Y+lg{`OUJLd zRjCuo5|oO5!HGOC_1Y(Zc61~7AEty3xsC;nx-;qVw@~qTeZra~yZng-1J`q@-o@n^_YC zBC~(t;>eWb9Y_>t&f}h(lxTN!QD@p%n47Ktg23Ab1CogV=MK%G#5`pn6KvlczdhRK zwO938@z`tsi7JYtqw1L)s(H0hD>OEnC?o>)YwyFger-=TNdgLuSAiA!f&_nY<*rG; zxR-c+kAx*4(P-lZs^grvlCL|IoA1AIQQ}6i<=Z$CA$A+~NpMQJe<`fcTfCl}=kbl` zgh8#%5MK`P22HjnuENR*vWLyKn$x{+$%_(9Dhh`YcOM5QQ93l1xVqjpDJgEm~I**7Vz<$Z0M-<(eLJnS3_6`&plY?p7?*XbhhF{l0h%7l7Wh26yQRF^n zrgNCgP`{cPT-(?5!xBPn%Zi^?-k4TMa>oJOVjQq{NOvIvk0!(+_j7?~__wyV{BoD) zG)jQb?0l!JrPE+mcYI}YaYBP#7Wx5E61Jq_6E;y`aLJR?>sH6K?1p4t$nrKba_F2D z+(r9UUj~>oc(z-*c;@Q8j&v4XN-h!FCs4j{rXlrpyH6}Rqwmk118%E%?be3*&-CvQ zKPH~UoXqyBAF3)@TX1rIRd;25Mum{e=Hx9S$@iR2K^47>W7v^I6Wx(Qw|vcX% zD80AH_f)pR{_Mr&2cC%kijR`R5MRuTRzwnpXoT!0Bj=|oK4&R&Lp_@x9G@;f>on1J zYWuW=EH$6Bszxt{2l)tmHjuc}$AxaT&bbix)n}v*tHfJDH%{B_^TZ1$GF=X@%@`=}}&R$+N5WZ-r@KmL023trd_qfmK+!J(;fkuBH+*-;hsEav z{4gn$@(0ZaJ02S&8YjN3r;4{d<4<$w8qp8}^ppZt!VI*{afZ6xtf1<`!aor}YA%6h zX}-eLi6<-q>bS%5tUJv2zkQC2#b(gH)Ssr|fY7e1LPXSe@Ul9IuAmf_37q4lVDO(B zpVQwb&`&|ohGVwPAQ=D83vhCN-y`ghU+H=!(3O|Q zr(jt$ji#kLMmk5ahGXd6&zGgl>*A#7FxeHvzmWG&6lLjxag>6DEL=H;m~*{$_3^3s6H8Yu z+S>{o@y48-O(!x{Kna|ph84A6BabVt<4 zZxf21KRb zb^LvaJeNCYq6BJzryOc3J6yV}F)xCn>iG(U-ESFiv<&2x+SqgGQ6+*TlV4ji??eDi z#@HKGNI+rz=YxI&-Z zXKKbZdy-=}G!dgc%U)|Q7PO-w;iGJTo!XWbp_hPZ<(?H}(;X#730dc}Wiu$K%Hr|P zZVC3ztTWFDZe|zctP`*I7&H;cw|R`?P+Y&nRz==sZ$0c}v)x^^n@HsLYN7}N5yVMM ze!afM`sisVA2~8>TP0yngrn06F7K#7@iwT1&$Ecz;eE2gq76m?>C{CT@uj(GWB-g9f3RQL0v)E^(+)uTPa+$SGGky-y} zYZ<*>B1pDK_{SLdo2VTaL^sL4ZcV@BBf(T3apCPU`@nix)0?;@#VJAPbrHOI{=mBL zY)xpOlC24LGNmiIV^0>n70%(-Mt;J$rFv5PAFljuy(B!2Q8&H!LgJT_dOBmqs!>pI z)Y4B_^ov4}K1#yNC#HMHW?EFt9wE<5yvi+}t`jsp3;w(}qz&dQn~ZEn=4JF7slZDy z%7jOSbfTNTAA2(?OgY3^#&Q(85O(}s2y-$2w$^73RQM=0x9jwqz7Di-A|7GP3JQ)E)bfr zO%L;ks?6&&N=TLBbFkOe$?B$?WQb1~f~gLuabZ*bNJJE&T{ zY*g=-3iUpDL(X~P+I`sg2wgLK@o^(}Rny~drEC~2WED`I$5524{?8_uc!mGBye*=f z`}y))`=bCguWyHcSFhaZ)Knn-;4MK~!j^~srDIgvJB?%tAD4Fc4;4`=$y?9jNc79? z)AcoopBCuF(iGp(>CyK{+>hQexIwvQL%+J2p#9fg*in=C5Cj`PuJTN~o9Nwn6!-QtN^th8vrXIm zN1sFD=_pFQ%2&u?A0moxxSGcbo--sbg*s-BU7%eJNQ3U@_sPpj18eC|a$MiOhSQV9 zom1vv#c}*=@Y#lpiK1Vg?c@Utk3~wD5JcnHM;V0K<~`l0&g{9+)QOGsvuCTlzvz5) zCE8A-QLM8Ckz2Xr%y@3JDZF5J|F2me1yLdTzWs>@&#jG?P41nI7vHs8kBXd^E1dj# z@ZouG0Pcb2^S{P&%qWFovq<+u z9VgE!Tt7k6TE@|9(LNaZS^nuMZRoUmmV;^I=E&f<@J?$zNM7+A4$_b9Qh- z1L0kXone)Bt<3owwSIvuyC1Qa>L$*S^KF|=dqmPSi^;jb?*`tt;m+n4FHa*Lp6$@j znTshNfQ)kesX~!9+cB1TU1D_oyrqU_7$&jCWsU*ucu3h{078ufzXs_eKyKn~SAZ$| z^(;ILceKnL^{E(l*zQ7r>rclR5#7WGnD*%sxn4`(ja10cSmq#SE*p4_lc?TPc8^ZK(46TPQzsBFW3YWHjV3C1cr4gGWEK034q-v7-OPQ-rSdm;i$?J9p(J$Y zi^97l^5r+vy?jVOobtoa0V&Y_{>K@dypunM12ZkeL+_F=e8_jESzhd>s?Jz7MAirO z6;07_bW7BqQlH46Xf~c-*}fV_k?^}r znHxMN?LK*+jDa**x)X$pb+*3PsjN@w2>2$bc&CYHeHLiEcpLHWBBcuHWX7^2O3J>y zXABS$lZKk}i$pVC8UDw4CDZXG*m7$ij}lo`Pl(X816qW7GEaL$B6=7Lf-CwJh~Hjo z)jc>!KfJ4F;AM$*gmhKSdMBb?X|}$6{F3`mT8NJ|M6ZVh%`l)rsHfr;5QDugh-Tn% zSAL#UDt;DJ8qNcG&c}0Petpt0P*Y9-%0R$K?x;s|IhbbY@{QWC`3NGnP*3zj@FZ&3 zGKX~2_7|XkKBo0`ZL+vfkGe<&)+Zy7a%@wRr+j)z)ManBW6x`!VgdzF&GCspE9S-1 zKl7u%EJtT$Pj?_9J{~LMNWnICK`#T`HD-|_^Pu2lyuPUUoV8a;PpX<=k&m>S?q*%O zd=O_<@IQ=KaUTtQ^71zCuGDLm(XGGNja{lmtasQ@jSMWD4?-(Tg(!LXHJF`hYPyo2 zyrQysotst55177*^JiuO&)cZFb1ysM%gXNjZv4f_TeZA!!9VY9s69*9_^=5U{Pttz zKS!3a+sI=J+n7`~HA0NHuWoco`y6Bz&!}@UTwlm(5#!+p$fDCRq!WjX) zm15pb%ymUH7mq-Az<|is-;FtQiyPnXBI;LjKhde`)+SdgKS>zkz(@5kM4N*~vTRVS zaf#Gr$^Q|&i5nP@LlrPOAM4wF_609HKYQdcLl;}3Guz#1Q{3B~R$GfUr+Z_+pav|n zJQ`A%RUNrROtYkB0@6Aj%F$x4lJKdhF$`Tk>vVU?6W-B;9sUX?a)Tkg=s71$r_l%- zJ6iCeLWLkzAQ4-^l?A7JPm9<41_eClVHN{H66f`R9FvFq!xN*kdAO zpY}dSa9i%$WyK$+q)zU=OkJD64o}< zNrbHC0Smsoh1ihOKLwK;vdv6XDD{AYvDnzj=E@kTt^(whAmZgQHoLodeHG6U)@-`L zu_gyB{Y}pMy=SfAk(!iTDHH1yxbKWYt46n|VyMd|9~ms^W$WZ!Gvbhia}vG(coftA zRl)ip7$sqL0}J0z%F}X@vEKe4w8=xw;Bxg-?rkjAI)H6>jugmDdh7Y{aeCd5N;F>M zujM$eY&0tG?b}bLCep0uZp(hOK$LdtUPBj9Sh^V{U#V@*>ukNi~IRfdg?PbS=>vV zDjz%<-BW?9I*I(FK3sm$*#<}FmYPq+n?Tlx@A-yH#r^)I3s<039A4zh?{Sa0#6T0- zyo;pM`A;*(n|PT~wr0Y((w9>TBqk&+)G4Uxj}AHC*JymUzTmm4_vDc;ia``e5XJYh4d$Ql?X*- zQ#;@Zo1RGh%y=M%iL8o80$?ESGp)5JTCb&34eer%cnmM6op0 z*CK9T9XGikUL}p?7A#l)Zdo!!!W0V(X#k4)a5FZSwC$mu15`nL(uRZ)R`TQsQCVr4m1 z9r1Yi$6mPrSHaUMQm82Skgh`I$X?ta11>K%P*jKZnA*3)hAZ5`yIEonBLqY$< z0fCjX2^J4R@ACw*r0}1JZ-fdTYTQQHJAg|kzh`NoMCgJ_DAWKhPYWV@ELdHUai@9_;PsNL12@Un zZYVAO)Fjld^n|iV{)=I4^=lGxI~-S=pGnXiV=&{2BTc@y)Dr1ClJ62h4%K(KMHCPe z#yfWqvq-2DPTdpGK|#6DmlXSl7c1+A?x@4Bp7w$O@_WZcT&V zGwQDxvDRhLqKaW2KIqx{EtKHP5eO5A8%DVz8#17i;8LFoR>AXd{oa2ZLPi+Iy!o8_ z_pCa%f-O!d3V}PY|s7p>%F!Q?Sm2ua3vO#jK2Px zS4kVnIAH$KINMZqsNMQ)yn3Z*GBtLZU_ltM4lss?GYg{GO&){m@=7cB zn3kI+2U!nt_4f2bG6i>C@=K-#vxy3jHN4kiSRMEGIQTWvGjA!!`MmO6>R2V57J=^* zsBF2C!@=sH6hsV*3vh5jPWeu}b|Gl2+b4qCeZDX`d{=oe+B0YbmEg|jG8Jg1 zb&!DMMm8QGRC@b7jhg4my_P!;KSr1UX`UPt24y`4XdqV^FMDe+#qL1=uKO6 z@_Yf_;AbLuEHaJkC5F8A z&zC1U9@97Y%Z?K4l_PA7NeBED(n*D5T)P#}yoiFNhkIkgcSjQh8v5+*JSzIk)!y_$ z7)aJ-Amqtxc95!j>(9vk;_mbL%GA;&lumP5x@TF}p8Ewg-|c&sb6wVGjAI>&=DS1t zCliDj1C-e9O@=`U9)elsjwxJ-#BEV(od^y76AtQg&(T{M^I5ADF5G$31A_$m#GULA zS4sQc)53$B#NcxTkxyQ->>v)typSIzg*%MlYEiHb<#9A2IAmRF;k>87UdW?v_>Va( z6g(Ez@xiS%u;gh(B(+0*BOe=+YcQny^1$jd#E%@w7^}3;zUkN@K%-SL!TX<-S&Jd6 z23OyBVZif5S`n@YU~wHH;8&rh}yfHXyu1~7(f=kCNK5WCT5(%Tl){G^68xHe z+ml79Ds$h*$X^AkLIbW0?pJxklWR-Di92~O)A=HT6#q1#ubqWHQKBmIdHNc7F+)N& zf^jZA)Wv-1S*!Q*@9{Ok<{bN7d4`Z5Nc=;}VRf?*>F=V0FZr)SeyudP?tpI{jrfAH zlN8b^0F>JX=hJ7QH6|Zr2=#)sB%C=QvxskGxw3v?+0@nP>dq16=CppZq#9f)3k=38JupYO<15o((ynib5(Qb4NluQ%FLs}de^JZaZFn)F zertzeGik!u<<1}A)wnS5N)HZ4B;79ZK*~Zll8CSYNC1t;qPI1lZFpgPxAAN>Z&$-b zfLSZIZVivN;hz}UR`s1DlF-NL9@Vu{(NRMF-U%}Wh!Lj62!o(x)cZzXn z=|lk+stH#z0Vd8s+IBcg9xvknA<2m<|J-i@l^r|^5VF(GV($oT6gnehPly%~w)f8JmvfC#fy)jrr>fDf!_^|*9ome?P#HL4Z< zRAO2#w;mMR6IMskp*=bc!W@|~d`)E1A!&HAdUs&?gLKz|o z;4Lq$dI?)ZN`XyfJEOD3bTbg3HX&Lm6W{8+Azv}-7`n~I{BUtPlu4@Ziyod$R9Tj0 z2J{u*7B~B}@lZs{1jp^~TBZC5|o9dW3dp?_66U-o* z__hk*Q?!J#*ee=njerQ+E0%*@fK&WNb-IG$Hi-~Y*3`&oEe}X z5EETRB1jB8T(hR+5{!CQY+)Hn4fPqo8%2+{&Zj~Sz=1@$4moY+J*Yywf`M#Z6Ze0) z+zSL1RrDkJt2}!sYBPs_1N+x9j1jXUi`+p+So9(XV8?m1PR6RwZ5$>C|POh4ysE zi>PaiQ?rk$jRXlpbboYIUo+iio=lP^-h;rtPRKefnlG?B#p(Ohe_@{SepM4JofB9K z@820%lNB|C#}g!oK;rTK$WUqp%iI3MMTPkY-}?NMY}z5WDeKd*8jlTWCJ8y9H%5dG zG8>rWFEXd}etJRpaIA-3RiCK)1FdIBXu}z@TH3gu(36%+@mo55;=k+l8zqoV(Fzh+88WlFMg!HB&fZm$VT9f7Dfa92T%67>QdWk6;UW*~c;Y{Vlt5%oS>VXZwu>LT*KK=n0a#Q};BaQ&P> z5_tOkJ{>=CyZMT%y7q-12SCeppd!_hZ3;rJ0cBBi`T+A$@XY%g-5BD|u3x;3Uk0l$ za0Qk8BXi8;GS3S#9Zpl9VhFdEn31%_WEp6hhT#`r4rk&Yn8kL?p zf8#qE`I0JJDFxv`93+(`!;Kf$+svngpv*}Z_%Aj4QDd~2)Dl!}?N2=#Py0db_u{B1 zZHQ=?eozRD;rqbxmyR5@#c)Z9&gIww8y+haz)M0mY#{}cF8T!BPwb8;Zao_Ri2&E@ ziD}#I&aVV9x&xmxUw3649_=r>WP*9^UQ)RqfUNC3i)>B*#UPZ+uGPeD>Dtzb_SBo( ze@w*YNq}r!krF}jFA=To^}Lv4+GRJ{5(f)#4zddU`%gd8fLUF+Yt4Gxd~;j&OJ-yc zL3he?#x&%o+&gE!D{!zG40LTxmHo$|-S#Lj5TYty@u1kV=Npzs+&}nF-A=M-ws&{x z#;Tt_6btp-Gv@KVy4(J%+OOf;J*0ySCq_lDE!mBa*QDlS{!c!gu8pngz{n_!@=HZ( zY0k1L>FG5~&Q_cA_y$B(1o5Vq7Y>YNLZ%))G+-sqsyXPaca&cmcgQxweb({W@^efQ z))XpxQ#3;Q1EuPgDxuz`sh4+$W7=4@gKm5A`IG4^SrhR-4)D8uc1M?x7BI&ZV>}FMcgtwNCL@6lFFt@m-esgj8RGXK zxz(PS^V;?Cpb=wnWCcdCv+du_F@y+G8&Dnh6lifU1psiI^xX8g-39abu<@7(;^pNp z8NMT|m2*;d_v!m2kQKvF<`(CCF_U2#WvSDdJ<0uP4j3z!W~R4fNHy48VGLVqY+ZPG zQk~DJ?Va?sPd^MeX9DjHXOmh>qxmXT$Q|6B_FhEtoyKydHoBd-+Vt-fhxOCWsPm1~_xASTK`?Jem;H22Eet`oy}NzvZz%XW%QS`oQq!(^RK5u3%2i zoio_fPP{%<#_fI7H5=AO`aKAcO5i?Dj3Y_MZvM{(K7uv?gwbfwybV?orO=*hIK}1H zpz^DJyu`Z{lZaKP0*~i0mCSawG-*JkJKhJzNm4-@O5~sv`qA&_40_%LmZ=6sf-CUa zK=|?;PS4yxWBQ2RLj!wl&&{f%TQ9&1FG;gGG1Dv_eI=kxFe_fK$@aJXPD$+x(gxba zdm2+hZ~0R)Fzy?Tt=v~?RD)}Qh`s^fBlGsId^OdpUu2L`#h`7SpHzEak|KUR_m)`$ zs@o302Rgj(tN%O@yn(j8D@&cpO0?0x<>S#Tm0kdk?51nhNaPdM;MUdtH%Jc?hKC1Z z8x2)(pD@0Qtca775c9!Xm%v!}xE+s<@hG8&TM-ZZ^w6$XRwWmx8q92m3-EwT=61Yf zla3K+NoVuvr5tdnS+4)hvN@QUKDHjtvMUM0Of(*Tjt#rO1}xDBy3b#l%EfSV#!sqei! zNpIEPE3KvB({EF_dDsvSZv;z6rt0q(rO1vC;eih zjn6K4kYZrzPhaYSJu1x37DdV8m%vfN)BKo-r_eUZanNp8#HJES>t{U$xpj1KOYabIX(5lR1)2N5U)r2a0$&sYQdGke+%z6L?UP27&+^+lI44@52LgVC7TiT zh}X7d?=IE6r=~tru{Gd;Ehw^}w@<8bYTSUNs17~`35LPDx6YY{F%O(4gdu7GRtSMJ zM*hNo<)n(>ZL;(39l_==WC(P*>3SA>ngA8Wzfv#%Wr)@N_*}YipZPsa(~n*p>@w*U zwT~rL^M42g9UvEP5!6%xhvE!k^`!yxpHQ-Kv0BDDBkbb_XWyQqQw7L9qHiz2y{qK& z@2FzC^Y#KTYFlA`)h5tE1SA;5IGw;M5THK(SH7^^0*drsGL<7WlY=@0)}5fWi(_@- z*>xHs#Tg z53x#Bo1IK0x#JL^YFL5c^si!-;b7rfl#CtXmOfD|7YzW?tDLx6HC%ilkhd$lqcoVV z75hB?B^;>lac`A9auekg*3N4*hpXJ8W%i=KUpbIw_`B?k%8?*eJ*3N9aap=s+8B`t z0*V?&ST4mGBl|Fk?K%{6O(IK&DbWUpPhEP=qD+00n|(L@o#pDqhMv0PIkT7_H{IzY zh-8USg$^wOd0g}yfBPYri$Uvs?=l`7{QVsknurX53KIqVR`#Zz{`^;&#PSR@%`GjC zhy>w##4(Cvyokg@9H|F}u=@*vh?e?)j;L2K5PnA9{jUi0g^*-Uyv0bUN6CKovncO4 zIc-SRl}f+e3XrSB9rh0Dlr~X}5$EwncIgYCK0tw?D>VA}awhHi?J)|guh?>CTe~I<#Y0Y2QjFv3bswv|Wf+xTzck|pr+Z_o& z0hr}l^JiXMu=6%A0lnQF|zN~+D*5#$%G$am*f=(qy%u&PE;vTH>=utRy z@G){E+%6p?;92glMe*W&pzDUB{Plap6ojLP!7=OKs;E#lKyT2icqQ7?*0eBhd3P8jg!+1?!FIm9Ci!L$V(yyMVT;jg=jf#w|YpRw^uw8~)$Q>(qWT4Y5V}&ss|EK+??aoKc`;fkv;Z=bQf$P%=0h7_fM*_1AI1NaK~HQQOq5LQ&?@&jNg}-76ym2!;T(6EgoiA_ zdqR}q30D$-H+0mXkP+7*Cd>)T&u`SCSvp$XRHrtU#ERAN{HH(^%kin|nBdWsBr5j**)8@~fP9 zl6cx|ci2n?L`(LCCjAJ+FP3hSRw4OZEA(Oo@T*Gj*Pex7_(r_@$}A8b9Qk6gM0rGI zX?4Mb59Q&R>JK3~GVL*p63n0N3Y?m@gZUWM{Iv=7xVJt6BR@sr^b4XSOku2bRtU~5 zf`2B^g5d-`xkK9&5jL3GQmsimFP~c)UeSBo^;lY)#F!9$)VY(WzLMQ*j0+43X03$2 zy5QeM53u7>p+`&*#>!z|y<3D#>U>IC++(;K4y(mX@P@eGklx*+HD-*ZJ=|}7wiRd^ jr^a3STKE6|tNjx?`GOKZYSyD10{&DLwG?XPtY7{=#-WS_ literal 0 HcmV?d00001 From 5fdf776a60f77cd8cdd38171b6c23f7afdbd605e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schr=C3=B6er?= Date: Wed, 18 Nov 2026 12:12:58 +0100 Subject: [PATCH 19/32] release: bump Caesar to 4.2.0 --- Cargo.lock | 2 +- Cargo.toml | 2 +- vscode-ext/package.json | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/Cargo.lock b/Cargo.lock index b9bd4a7f..3a7eae5e 100644 --- a/Cargo.lock +++ b/Cargo.lock @@ -233,7 +233,7 @@ checksum = "1fd0f2584146f6f2ef48085050886acf353beff7305ebd1ae69500e27c67f64b" [[package]] name = "caesar" -version = "4.1.0" +version = "4.2.0" dependencies = [ "ariadne", "built", diff --git a/Cargo.toml b/Cargo.toml index 4979c7d0..cc4382c7 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -7,7 +7,7 @@ members = [ [package] name = "caesar" -version = "4.1.0" +version = "4.2.0" authors = ["Philipp Schroer "] description = "Caesar is a deductive verifier for probabilistic programs." homepage = "https://www.caesarverifier.org/" diff --git a/vscode-ext/package.json b/vscode-ext/package.json index 3ccfa343..b8ba4e5a 100644 --- a/vscode-ext/package.json +++ b/vscode-ext/package.json @@ -3,7 +3,7 @@ "displayName": "Caesar Verifier", "description": "The quantitative deductive verifier Caesar for VSCode", "publisher": "rwth-moves", - "version": "4.1.0", + "version": "4.2.0", "repository": { "type": "git", "url": "https://github.com/moves-rwth/caesar.git", From 8773bc3221cde338ef4fd3be8b8885b088838ada Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 14:03:18 +0100 Subject: [PATCH 20/32] resource limits: use statm for linux memory checks QEMU user-mode emulation reports zero RSS in /proc/self/smaps, so Caesar can exceed --mem without triggering the memory check. The memory-stats reader also fails when smaps contains a non-UTF-8 mapped path, disabling monitoring for that run. Enable always_use_statm to read Linux RSS from /proc/self/statm. This avoids the smaps failures at the cost of a less precise reading on kernels that report batched RSS counters. Update the warning to describe what happens if reading memory usage still fails. --- Cargo.toml | 4 +++- src/resource_limits.rs | 11 +---------- 2 files changed, 4 insertions(+), 11 deletions(-) diff --git a/Cargo.toml b/Cargo.toml index cc4382c7..c342e74c 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -62,7 +62,9 @@ regex = "1.11.1" tempfile = "3.16.0" os_info = "3.11.0" petgraph = "0.8.0" -memory-stats = "1.2.0" +# Linux's /proc/self/statm can report less precise RSS than /proc/self/smaps. +# It works under QEMU user-mode emulation, where smaps reports zero RSS. +memory-stats = { version = "1.2.0", features = ["always_use_statm"] } [build-dependencies] lalrpop = "0.23" diff --git a/src/resource_limits.rs b/src/resource_limits.rs index f5179721..2fbd8bb1 100644 --- a/src/resource_limits.rs +++ b/src/resource_limits.rs @@ -109,16 +109,7 @@ async fn wait_for_oom(mem_limit: MemorySize) { } } None => { - // We have observed that the call `ProcessStats::get()` fails on - // x86 Linux-based Docker images running virtualized in an ARM - // environment on Apple M1 chips. This seems to be due to - // `procfs` failing to parse `/proc/self/stat` for some reason. - // Since we have not been able to track down this bug after - // several hours, we just disable memory limit checking in such - // cases. This seems acceptable since it's a very specific set - // of circumstances and likely a bug in QEMU that is going to be - // fixed. - error!("Could not fetch process stats to check memory limit. Memory limit checking is disabled. This error may occur in virtual machines. For memory limit checking, please consider using a native environment."); + error!("Could not read process memory usage. Memory limit checking is disabled for this run."); pending().await // do not terminate this function } } From 76cf9e15593459feab3562dfa38cc88eeba0e1f7 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 14:28:37 +0100 Subject: [PATCH 21/32] procs: preserve call initializers in loop copies Proof rules copy loop bodies while sharing variable declarations. Lowering an initializer used to remove it from every copy, which could verify a false postcondition, report a spurious counterexample, or miss a call direction mismatch. Store the initializer on the statement so each copy can lower its call independently. Keep the variable declaration in its enclosing block for later references and declare a fresh saved argument inside each lowered call. --- src/ast/decl.rs | 14 +- src/ast/stmt.rs | 12 +- src/ast/util.rs | 10 +- src/ast/visit.rs | 13 +- src/front/parser/grammar.lalrpop | 6 +- .../precedence_update/grammar_old.lalrpop | 6 +- src/front/parser/precedence_update/mod.rs | 14 +- src/front/resolve.rs | 10 +- src/front/tycheck.rs | 42 ++--- src/mc/mod.rs | 28 ++-- src/mc/opsem.rs | 6 +- src/opt/fuzz_test.rs | 1 - src/procs/spec_call.rs | 154 ++++++++++-------- src/proof_rules/mciver_ast.rs | 3 +- src/proof_rules/omega.rs | 1 - src/proof_rules/past.rs | 2 +- src/proof_rules/util.rs | 1 - src/slicing/transform.rs | 1 - src/slicing/transform_test.rs | 1 - src/vc/vcgen.rs | 7 +- 20 files changed, 158 insertions(+), 174 deletions(-) diff --git a/src/ast/decl.rs b/src/ast/decl.rs index b87d52e1..a28e220d 100644 --- a/src/ast/decl.rs +++ b/src/ast/decl.rs @@ -213,14 +213,12 @@ impl SimplePretty for DeclRef { } } -/// A variable declaration consists of a name, a type, and a mutability kind, and -/// an optional initial expression. +/// A variable declaration records the name, type, and kind of a binding. #[derive(Debug, Clone)] pub struct VarDecl { pub name: Ident, pub ty: TyKind, pub kind: VarKind, - pub init: Option, pub span: Span, /// If this declaration was created by cloning another variable declaration, /// we track the original name here. @@ -234,7 +232,6 @@ impl VarDecl { name: param.name, ty: *param.ty.clone(), kind, - init: None, span: param.span, created_from: None, }; @@ -250,17 +247,12 @@ impl VarDecl { } fn pretty_with_kind(&self, kind: &'static str) -> Doc { - let res = Doc::text(kind) + Doc::text(kind) .append(Doc::space()) .append(Doc::text(self.name.name.to_string())) .append(Doc::text(":")) .append(Doc::space()) - .append(self.ty.pretty()); - if let Some(init) = &self.init { - res.append(Doc::text(" = ")).append(init.pretty()) - } else { - res - } + .append(self.ty.pretty()) } /// The original name of this declaration, i.e. `created_from` if it is diff --git a/src/ast/stmt.rs b/src/ast/stmt.rs index 8ca8c147..e8db5bc3 100644 --- a/src/ast/stmt.rs +++ b/src/ast/stmt.rs @@ -29,8 +29,8 @@ impl Display for Stmt { pub enum StmtKind { /// A sequence of statements. Seq(Vec), - /// A variable declaration. - Var(DeclRef), + /// A variable declaration with an optional initializer. + Var(DeclRef, Option), /// An assignment. Assign(Vec, Expr), /// A havoc statement. @@ -105,7 +105,13 @@ impl SimplePretty for StmtKind { let res = match self { StmtKind::Seq(stmts) => pretty_block(stmts.pretty()), - StmtKind::Var(decl_ref) => decl_ref.borrow().pretty_stmt(), + StmtKind::Var(decl, init) => { + let var = decl.borrow().pretty_stmt(); + match init { + Some(init) => var.append(Doc::text(" = ")).append(init.pretty()), + None => var, + } + } StmtKind::Assign(lhs, rhs) => Doc::intersperse( lhs.iter().map(|lhs| Doc::as_string(lhs.name)), Doc::text(", "), diff --git a/src/ast/util.rs b/src/ast/util.rs index 10b77c4e..8438cd0f 100644 --- a/src/ast/util.rs +++ b/src/ast/util.rs @@ -40,10 +40,9 @@ impl VariableCollector { pub fn add_stmt(&mut self, stmt: &Stmt) { match &stmt.node { StmtKind::Seq(stmts) => self.add_stmts(stmts), - StmtKind::Var(var) => { - let var = var.borrow(); - self.declared_variables.insert(var.name); - if let Some(init) = &var.init { + StmtKind::Var(decl, init) => { + self.declared_variables.insert(decl.borrow().name); + if let Some(init) = init { self.add_expr(init); } } @@ -264,7 +263,6 @@ mod test { name: local, ty: TyKind::Bool, kind: VarKind::Mut, - init: None, span, created_from: None, }); @@ -280,7 +278,7 @@ mod test { ))), )); let program = stmt(StmtKind::Seq(vec![ - stmt(StmtKind::Var(local_decl)), + stmt(StmtKind::Var(local_decl, None)), stmt(StmtKind::Havoc(Direction::Down, vec![x])), stmt(StmtKind::Havoc(Direction::Up, vec![y, local])), annotated, diff --git a/src/ast/visit.rs b/src/ast/visit.rs index b5c93892..77fe204d 100644 --- a/src/ast/visit.rs +++ b/src/ast/visit.rs @@ -33,9 +33,6 @@ pub trait VisitorMut: Sized { let mut var_decl = var_ref.borrow_mut(); self.visit_ident(&mut var_decl.name)?; self.visit_ty(&mut var_decl.ty)?; - if let Some(ref mut init) = &mut var_decl.init { - self.visit_expr(init)?; - } Ok(()) } @@ -57,7 +54,7 @@ pub trait VisitorMut: Sized { self.visit_expr(&mut axiom_decl.axiom) } - fn visit_stmts(&mut self, stmts: &mut [Stmt]) -> Result<(), Self::Err> { + fn visit_stmts(&mut self, stmts: &mut Vec) -> Result<(), Self::Err> { for s in stmts { self.visit_stmt(s)?; } @@ -226,8 +223,12 @@ pub fn walk_stmt(visitor: &mut V, s: &mut Stmt) -> Result<(), V:: StmtKind::Seq(ref mut block) => { visitor.visit_stmts(block)?; } - StmtKind::Var(decl_ref) => { - visitor.visit_var_decl(decl_ref)?; + StmtKind::Var(decl, init) => { + // Visit the initializer before the declaration can shadow an outer binding. + if let Some(init) = init { + visitor.visit_expr(init)?; + } + visitor.visit_var_decl(decl)?; } StmtKind::Assign(ref mut lhses, ref mut rhs) => { for lhs in lhses { diff --git a/src/front/parser/grammar.lalrpop b/src/front/parser/grammar.lalrpop index 7aeb9359..80fa2a86 100644 --- a/src/front/parser/grammar.lalrpop +++ b/src/front/parser/grammar.lalrpop @@ -171,7 +171,7 @@ QuantOp: QuantOp = { QuantVar: QuantVar = { ":" - => QuantVar::Fresh(DeclRef::new(VarDecl { name, ty, kind: VarKind::Quant, init: None, span: span(file, l, r), created_from: None })) + => QuantVar::Fresh(DeclRef::new(VarDecl { name, ty, kind: VarKind::Quant, span: span(file, l, r), created_from: None })) } QuantAnn: QuantAnn = { @@ -200,9 +200,9 @@ pub SpannedStmts: Spanned> = { StmtKind: StmtKind = { => StmtKind::Seq(block.node), "var" ":" "=" - => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, init: Some(rhs), span: span(file, l, r), created_from: None })), + => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, span: span(file, l, r), created_from: None }), Some(rhs)), "var" ":" - => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, init: None, span: span(file, l, r), created_from: None })), + => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, span: span(file, l, r), created_from: None }), None), > "=" => StmtKind::Assign(lhs, rhs), "(" > ")" => { let call = Shared::new(ExprData { diff --git a/src/front/parser/precedence_update/grammar_old.lalrpop b/src/front/parser/precedence_update/grammar_old.lalrpop index f3b13885..9a8a5848 100644 --- a/src/front/parser/precedence_update/grammar_old.lalrpop +++ b/src/front/parser/precedence_update/grammar_old.lalrpop @@ -87,7 +87,7 @@ QuantOp: QuantOp = { QuantVar: QuantVar = { ":" - => QuantVar::Fresh(DeclRef::new(VarDecl { name, ty, kind: VarKind::Quant, init: None, span: span(file, l, r), created_from: None })) + => QuantVar::Fresh(DeclRef::new(VarDecl { name, ty, kind: VarKind::Quant, span: span(file, l, r), created_from: None })) } QuantAnn: QuantAnn = { @@ -193,9 +193,9 @@ pub SpannedStmts: Spanned> = { StmtKind: StmtKind = { => StmtKind::Seq(block.node), "var" ":" "=" - => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, init: Some(rhs), span: span(file, l, r), created_from: None })), + => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, span: span(file, l, r), created_from: None }), Some(rhs)), "var" ":" - => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, init: None, span: span(file, l, r), created_from: None })), + => StmtKind::Var(DeclRef::new(VarDecl { name: ident, ty, kind: VarKind::Mut, span: span(file, l, r), created_from: None }), None), > "=" => StmtKind::Assign(lhs, rhs), > => StmtKind::Assign(vec![], call), "havoc" > => StmtKind::Havoc(Direction::Down, vars), diff --git a/src/front/parser/precedence_update/mod.rs b/src/front/parser/precedence_update/mod.rs index a7a89812..4192044a 100644 --- a/src/front/parser/precedence_update/mod.rs +++ b/src/front/parser/precedence_update/mod.rs @@ -191,12 +191,6 @@ fn collect_decls_exprs(decls: &[DeclKind], out: &mut Vec) { fn collect_decl_exprs(decl: &DeclKind, out: &mut Vec) { match decl { - DeclKind::VarDecl(var_decl) => { - let var_decl = var_decl.borrow(); - if let Some(init) = var_decl.init.as_ref() { - collect_expr(init, out); - } - } DeclKind::ProcDecl(proc_decl) => { let proc_decl = proc_decl.borrow(); for spec in &proc_decl.spec { @@ -235,7 +229,8 @@ fn collect_decl_exprs(decl: &DeclKind, out: &mut Vec) { DeclKind::AxiomDecl(axiom_decl) => { collect_expr(&axiom_decl.borrow().axiom, out); } - DeclKind::ProcIntrin(_) + DeclKind::VarDecl(_) + | DeclKind::ProcIntrin(_) | DeclKind::FuncIntrin(_) | DeclKind::LabelDecl(_) | DeclKind::AnnotationDecl(_) => {} @@ -255,9 +250,8 @@ fn collect_stmt_exprs(stmt: &Stmt, out: &mut Vec) { collect_stmt_exprs(stmt, out); } } - StmtKind::Var(var_decl) => { - let var_decl = var_decl.borrow(); - if let Some(init) = var_decl.init.as_ref() { + StmtKind::Var(_, init) => { + if let Some(init) = init { collect_expr(init, out); } } diff --git a/src/front/resolve.rs b/src/front/resolve.rs index f183b9e8..aabb07d2 100644 --- a/src/front/resolve.rs +++ b/src/front/resolve.rs @@ -107,14 +107,7 @@ impl<'tcx> VisitorMut for Resolve<'tcx> { } fn visit_var_decl(&mut self, var_ref: &mut DeclRef) -> Result<(), ResolveError> { - let mut var_decl = var_ref.borrow_mut(); - - // first visit the initializer - if let Some(ref mut init) = &mut var_decl.init { - self.visit_expr(init)?; - } - self.visit_ty(&mut var_decl.ty)?; - drop(var_decl); + self.visit_ty(&mut var_ref.borrow_mut().ty)?; self.declare(DeclKind::VarDecl(var_ref.clone())) } @@ -280,7 +273,6 @@ impl<'tcx> VisitorMut for Resolve<'tcx> { name: *ident, ty: TyKind::None, kind: VarKind::Subst, - init: Some(val.clone()), span, created_from: None, })); diff --git a/src/front/tycheck.rs b/src/front/tycheck.rs index ef87d032..d7915a99 100644 --- a/src/front/tycheck.rs +++ b/src/front/tycheck.rs @@ -1,6 +1,6 @@ //! Type checking and type inference happens here. -use std::{cmp::Ordering, ops::DerefMut, rc::Rc}; +use std::{cmp::Ordering, rc::Rc}; use ariadne::ReportKind; use indexmap::IndexSet; @@ -426,29 +426,6 @@ macro_rules! ops_ty_check { impl<'tcx> VisitorMut for Tycheck<'tcx> { type Err = TycheckError; - fn visit_var_decl(&mut self, var_ref: &mut DeclRef) -> Result<(), Self::Err> { - let mut var_decl = var_ref.borrow_mut(); - let var_decl = var_decl.deref_mut(); - if let Some(init) = &mut var_decl.init { - self.allow_impure_calls = true; - self.visit_expr(init)?; - self.allow_impure_calls = false; - - // try to unpack a tuple first - let init_ty = init.ty.as_ref().unwrap(); - if let TyKind::Tuple(tys) = init_ty { - if let [lhs_ty] = tys.as_slice() { - if lhs_ty == &var_decl.ty { - return Ok(()); - } - } - } - // only if unpacking the tuple failed, try a normal assignment - self.try_cast(init.span, &var_decl.ty, init)?; - } - Ok(()) - } - fn visit_proc(&mut self, proc_ref: &mut DeclRef) -> Result<(), Self::Err> { let mut proc = proc_ref.borrow_mut(); for spec in &mut proc.spec { @@ -496,14 +473,23 @@ impl<'tcx> VisitorMut for Tycheck<'tcx> { fn visit_stmt(&mut self, s: &mut Stmt) -> Result<(), Self::Err> { // first, walk recursive statements/expressions, and allow impure calls // (e.g. procs) when in variable declarations or assignments. - self.allow_impure_calls = matches!(s.node, StmtKind::Var(_) | StmtKind::Assign(_, _)); + self.allow_impure_calls = matches!(s.node, StmtKind::Var(_, _) | StmtKind::Assign(_, _)); walk_stmt(self, s)?; self.allow_impure_calls = false; match &mut s.node { StmtKind::Seq(_) => {} - StmtKind::Var(var_decl) => { - self.visit_var_decl(var_decl)?; + StmtKind::Var(decl, init) => { + if let Some(init) = init { + let decl = decl.borrow(); + // Procedure calls have tuple types even when they return one value. + if let TyKind::Tuple(tys) = init.ty.as_ref().unwrap() { + if tys.as_slice() == std::slice::from_ref(&decl.ty) { + return Ok(()); + } + } + self.try_cast(init.span, &decl.ty, init)?; + } } StmtKind::Assign(lhses, ref mut rhs) => { // TODO: handle mutability on LHS @@ -850,7 +836,7 @@ mod test { var ureal2: EUReal = uint; "#; let block = parse_block_and_tycheck(source).unwrap(); - assert!(matches!(block.node[0].node, StmtKind::Var(_))); + assert!(matches!(block.node[0].node, StmtKind::Var(_, _))); let source = r#" var eureal: EUReal; diff --git a/src/mc/mod.rs b/src/mc/mod.rs index a84a5d80..25ca857f 100644 --- a/src/mc/mod.rs +++ b/src/mc/mod.rs @@ -23,9 +23,9 @@ use lsp_types::NumberOrString; use crate::{ ast::{ util::{is_bot_lit, is_top_lit}, - visit::VisitorMut, - BinOpKind, DeclKind, DeclRef, Diagnostic, Expr, ExprBuilder, ExprData, ExprKind, Ident, - Label, LitKind, ProcDecl, Shared, Span, Spanned, Stmt, TyKind, UnOpKind, VarDecl, + visit::{walk_stmt, VisitorMut}, + BinOpKind, Block, DeclKind, Diagnostic, Expr, ExprBuilder, ExprData, ExprKind, Ident, + Label, LitKind, ProcDecl, Shared, Span, Spanned, Stmt, StmtKind, TyKind, UnOpKind, }, driver::commands::options::ModelCheckingOptions, procs::proc_verify::encode_proc_verify, @@ -154,7 +154,7 @@ pub fn proc_to_model( let mut op_automaton = OpAutomaton::new(&expr_translator, spec_part); // translate the variables - let (constants, variables) = translate_var_decls(options, &expr_translator, proc)?; + let (constants, variables) = translate_var_decls(options, &expr_translator, proc, &mut block)?; op_automaton.variables.extend(variables); // translate the statements @@ -240,8 +240,9 @@ fn translate_var_decls( options: &ModelCheckingOptions, expr_translator: &ExprTranslator<'_>, proc: &ProcDecl, + body: &mut Block, ) -> Result<(Vec, Vec), JaniConversionError> { - let mut vars = translate_local_decls(expr_translator, proc)?; + let mut vars = translate_local_decls(expr_translator, body)?; // by default, proc inputs are translated as constants let mut constants = vec![]; @@ -286,7 +287,7 @@ fn translate_var_decls( /// Create variable declarations for the local variables of a procedure. fn translate_local_decls( expr_translator: &ExprTranslator<'_>, - proc: &ProcDecl, + body: &mut Block, ) -> Result, JaniConversionError> { struct VarDeclCollector<'a> { expr_translator: &'a ExprTranslator<'a>, @@ -295,10 +296,13 @@ fn translate_local_decls( impl<'a> VisitorMut for VarDeclCollector<'a> { type Err = JaniConversionError; - fn visit_var_decl(&mut self, var_ref: &mut DeclRef) -> Result<(), Self::Err> { - let decl = var_ref.borrow(); + fn visit_stmt(&mut self, stmt: &mut Stmt) -> Result<(), Self::Err> { + let StmtKind::Var(decl, init) = &stmt.node else { + return walk_stmt(self, stmt); + }; + let decl = decl.borrow(); let mut comment = None; - let initial_value = if let Some(initial_expr) = &decl.init { + let initial_value = if let Some(initial_expr) = init { if is_constant(initial_expr) { Some(self.expr_translator.translate(initial_expr)?) } else { @@ -322,12 +326,16 @@ fn translate_local_decls( }); Ok(()) } + + fn visit_expr(&mut self, _: &mut Expr) -> Result<(), Self::Err> { + Ok(()) + } } let mut collector = VarDeclCollector { expr_translator, decls: Vec::new(), }; - collector.visit_proc(&mut DeclRef::new(proc.clone()))?; + collector.visit_block(body)?; Ok(collector.decls) } diff --git a/src/mc/opsem.rs b/src/mc/opsem.rs index 996de663..f2d6b8d1 100644 --- a/src/mc/opsem.rs +++ b/src/mc/opsem.rs @@ -90,9 +90,9 @@ fn translate_stmt( ) -> Result { match &stmt.node { StmtKind::Seq(block) => translate_stmts(automaton, block, next), - StmtKind::Var(decl_ref) => { - let decl = decl_ref.borrow(); - match &decl.init { + StmtKind::Var(decl, init) => { + let decl = decl.borrow(); + match init { Some(init) if !is_constant(init) => { translate_assign(automaton, translate_ident(decl.name), init, next) } diff --git a/src/opt/fuzz_test.rs b/src/opt/fuzz_test.rs index ffc1865a..72ef91a0 100644 --- a/src/opt/fuzz_test.rs +++ b/src/opt/fuzz_test.rs @@ -68,7 +68,6 @@ impl ExprGen { name: *name, ty, kind: VarKind::Input, - init: None, span: Span::dummy_span(), created_from: None, }))) diff --git a/src/procs/spec_call.rs b/src/procs/spec_call.rs index e74bb7b9..3673888e 100644 --- a/src/procs/spec_call.rs +++ b/src/procs/spec_call.rs @@ -1,16 +1,14 @@ //! Replacement of calls to procedures by their specification. -use std::ops::DerefMut; - use ariadne::ReportKind; +use replace_with::replace_with_or_abort; use crate::{ ast::{ util::VariableCollector, visit::{walk_stmt, VisitorMut}, - Block, DeclKind, DeclRef, Diagnostic, Direction, Expr, ExprData, ExprKind, Ident, Label, - Param, ProcSpec, Shared, Span, SpanVariant, Spanned, Stmt, StmtKind, Symbol, VarDecl, - VarKind, + DeclKind, DeclRef, Diagnostic, Direction, Expr, ExprData, ExprKind, Ident, Label, Param, + ProcSpec, Shared, Span, SpanVariant, Spanned, Stmt, StmtKind, Symbol, VarDecl, VarKind, }, slicing::{wrap_with_error_message, wrap_with_success_message}, tyctx::TyCtx, @@ -71,7 +69,7 @@ impl<'tcx> VisitorMut for SpecCall<'tcx> { type Err = SpecCallError; fn visit_expr(&mut self, e: &mut Expr) -> Result<(), Self::Err> { - if let ExprKind::Call(ref ident, _) = e.deref_mut().kind { + if let ExprKind::Call(ident, _) = &e.kind { if let DeclKind::ProcDecl(proc_ref) = self.tcx.get(*ident).unwrap().as_ref() { let proc_ref = proc_ref.clone(); // lose the reference to &mut self let proc = proc_ref.borrow(); @@ -92,43 +90,56 @@ impl<'tcx> VisitorMut for SpecCall<'tcx> { Ok(()) } - fn visit_stmt(&mut self, s: &mut Stmt) -> Result<(), Self::Err> { + fn visit_stmts(&mut self, stmts: &mut Vec) -> Result<(), Self::Err> { + let mut index = 0; + while let Some(stmt) = stmts.get_mut(index) { + index += 1; + if let Some(call) = self.lower_stmt(stmt)? { + // Keep the declaration in scope for the rest of the block. + stmts.insert(index, call); + index += 1; + } + } + Ok(()) + } + + fn visit_stmt(&mut self, stmt: &mut Stmt) -> Result<(), Self::Err> { + // An annotation gives its statement a scope for both the declaration and the call. + if let Some(call) = self.lower_stmt(stmt)? { + replace_with_or_abort(stmt, |stmt| { + Spanned::new(stmt.span, StmtKind::Seq(vec![stmt, call])) + }); + } + Ok(()) + } +} + +impl<'tcx> SpecCall<'tcx> { + /// Lower calls and return a separate statement for a lowered initializer. + fn lower_stmt(&mut self, stmt: &mut Stmt) -> Result, SpecCallError> { // Check calls before lowering assignments or variable initializers. - walk_stmt(self, s)?; - match &mut s.node { - StmtKind::Var(decl_ref) => { - let decl = decl_ref.borrow(); - if let Some(rhs) = &decl.init { - if let Some(mut block) = self.encode_assign(s.span, &[decl.name], rhs) { - drop(decl); - { - let mut decl = decl_ref.borrow_mut(); - decl.init = None; - } - block - .node - .insert(0, Spanned::new(block.span, StmtKind::Var(decl_ref.clone()))); - s.span = block.span; - s.node = StmtKind::Seq(block.node); - return Ok(()); - } + walk_stmt(self, stmt)?; + match &mut stmt.node { + StmtKind::Var(decl, init) => { + let call = init + .as_ref() + .and_then(|rhs| self.encode_assign(stmt.span, &[decl.borrow().name], rhs)); + if call.is_some() { + *init = None; } + return Ok(call); } StmtKind::Assign(lhses, rhs) => { - if let Some(block) = self.encode_assign(s.span, lhses, rhs) { - s.span = block.span; - s.node = StmtKind::Seq(block.node); - return Ok(()); + if let Some(call) = self.encode_assign(stmt.span, lhses, rhs) { + *stmt = call; } } _ => {} - }; - Ok(()) + } + Ok(None) } -} -impl<'tcx> SpecCall<'tcx> { - fn encode_assign(&mut self, span: Span, lhses: &[Ident], rhs: &Expr) -> Option { + fn encode_assign(&mut self, span: Span, lhses: &[Ident], rhs: &Expr) -> Option { if let ExprKind::Call(ident, args) = &rhs.kind { if let DeclKind::ProcDecl(proc_ref) = self.tcx.get(*ident).unwrap().as_ref() { let proc_ref = proc_ref.clone(); // lose the reference to &mut self @@ -158,9 +169,7 @@ impl<'tcx> SpecCall<'tcx> { } } - // collect "old" values, these are the input variables - // that also occur in the requires specs. we don't want - // their values to be destroyed by the havoc. + // Save arguments used in postconditions before havocing the outputs. let stable_inputs: Vec<(&Param, Expr)> = { let mut visitor = VariableCollector::new(); for spec in &proc.spec { @@ -174,7 +183,7 @@ impl<'tcx> SpecCall<'tcx> { .zip(args) .map(|(input, arg)| { if visitor.used_variables.contains(&input.name) { - let (stmt, expr) = self.assign_to_temp(input, arg.clone()); + let (stmt, expr) = self.save_argument(input, arg.clone()); buf.push(stmt); (input, expr) } else { @@ -209,47 +218,30 @@ impl<'tcx> SpecCall<'tcx> { }; } } - return Some(Spanned::new(span, buf)); + return Some(Spanned::new(span, StmtKind::Seq(buf))); } } None } -} -impl<'tcx> SpecCall<'tcx> { - /// Assign to a temporary variable for this parameter. - fn assign_to_temp(&mut self, param: &Param, value: Expr) -> (Stmt, Expr) { + /// Declare a fresh local variable for the saved argument. + fn save_argument(&mut self, param: &Param, value: Expr) -> (Stmt, Expr) { let span = param.span.variant(SpanVariant::SpecCall); - let name = Ident { + let base = Ident { name: Symbol::intern(&format!("old_{}", param.name)), span, }; - // Reuse an existing declaration if possible. - if let Some(_decl) = self.tcx.get(name).as_deref() { - let stmt = Spanned::new(span, StmtKind::Assign(vec![name], value)); - (stmt, ident_to_expr(self.tcx, span, name)) - } else { - // TODO: creating a variable declaration only for the first - // assignment to a temp for this parameter may generate invalid - // code. the declaration will only be created in the first procedure - // it's required in, but a second procedure won't have this - // declaration. so technically there should be a variable - // declaration there as well. this is not a problem for us now, - // because we don't look for declarations locally anymore, but it's - // annoying if one looks at the intermediate representations. - let var_decl = VarDecl { - name, - ty: *param.ty.clone(), - kind: VarKind::Mut, // we might use the variable again in another proc call - init: Some(value), - span, - created_from: Some(param.name), - }; - let decl = DeclRef::new(var_decl); - self.tcx.declare(DeclKind::VarDecl(decl.clone())); - let stmt = Spanned::new(span, StmtKind::Var(decl)); - (stmt, ident_to_expr(self.tcx, span, name)) - } + let name = self.tcx.fresh_ident(base, span); + let decl = DeclRef::new(VarDecl { + name, + ty: *param.ty.clone(), + kind: VarKind::Mut, + span, + created_from: Some(param.name), + }); + self.tcx.declare(DeclKind::VarDecl(decl.clone())); + let stmt = Spanned::new(span, StmtKind::Var(decl, Some(value))); + (stmt, ident_to_expr(self.tcx, span, name)) } } @@ -320,4 +312,26 @@ mod test { "Error: The direction of 'proc ::test2' does not match with the direction of the 'coproc test1'." ); } + + #[test] + fn test_call_initializer_in_unroll() { + let source = r#" + proc dec(a: UInt) -> (r: UInt) + pre 1 + post [r == a - 1] + + @wp proc countdown() -> (x: UInt) + pre 1 + post [x == 0] + { + x = 2 + @unroll(3, 0) + while x > 0 { + var y: UInt = dec(x) + x = y + } + } + "#; + assert!(verify_test(source).0.unwrap()); + } } diff --git a/src/proof_rules/mciver_ast.rs b/src/proof_rules/mciver_ast.rs index 1750c6c8..453898da 100644 --- a/src/proof_rules/mciver_ast.rs +++ b/src/proof_rules/mciver_ast.rs @@ -99,7 +99,6 @@ impl Encoding for ASTAnnotation { name: *var_ref, ty: TyKind::UReal, kind: VarKind::Mut, - init: None, span: call_span, created_from: None, }; @@ -601,7 +600,7 @@ impl VisitorMut for AstBodyValidator<'_> { } None } - StmtKind::Var(var) if var.borrow().init.is_none() => Some(( + StmtKind::Var(_, None) => Some(( "Loop-local variables must be initialized.", Some("`@ast` requires explicit `havoc` for demonic nondeterminism."), )), diff --git a/src/proof_rules/omega.rs b/src/proof_rules/omega.rs index e47586d2..c28e8244 100644 --- a/src/proof_rules/omega.rs +++ b/src/proof_rules/omega.rs @@ -91,7 +91,6 @@ impl Encoding for OmegaInvAnnotation { name: *var_ref, ty: TyKind::UInt, kind: VarKind::Mut, - init: None, span: call_span, created_from: None, }; diff --git a/src/proof_rules/past.rs b/src/proof_rules/past.rs index d1c33bcf..dd2221ac 100644 --- a/src/proof_rules/past.rs +++ b/src/proof_rules/past.rs @@ -259,7 +259,7 @@ impl VisitorMut for PastBodyValidator<'_> { fn visit_stmt(&mut self, stmt: &mut Stmt) -> Result<(), Self::Err> { match &stmt.node { StmtKind::Seq(_) - | StmtKind::Var(_) + | StmtKind::Var(..) | StmtKind::Assign(_, _) | StmtKind::Tick(_) | StmtKind::If(_, _, _) diff --git a/src/proof_rules/util.rs b/src/proof_rules/util.rs index bea05673..3287fb4e 100644 --- a/src/proof_rules/util.rs +++ b/src/proof_rules/util.rs @@ -204,7 +204,6 @@ pub fn get_init_idents(tcx: &TyCtx, span: Span, idents: &[Ident]) -> Vec name: new_ident, ty: ty.clone(), kind: VarKind::Input, - init: None, span, created_from: Some(*ident), }; diff --git a/src/slicing/transform.rs b/src/slicing/transform.rs index 8e8fe7f1..0bf1b14c 100644 --- a/src/slicing/transform.rs +++ b/src/slicing/transform.rs @@ -135,7 +135,6 @@ impl<'tcx> StmtSliceVisitor<'tcx> { name: ident, ty: TyKind::Bool, kind: VarKind::Slice, - init: None, span, created_from: None, }))); diff --git a/src/slicing/transform_test.rs b/src/slicing/transform_test.rs index 01945510..e505cee9 100644 --- a/src/slicing/transform_test.rs +++ b/src/slicing/transform_test.rs @@ -88,7 +88,6 @@ impl TransformTestCtx { name: *name, ty: TyKind::EUReal, kind: VarKind::Input, - init: None, span: Span::dummy_span(), created_from: None, }))) diff --git a/src/vc/vcgen.rs b/src/vc/vcgen.rs index 74b8caf8..8638d8b4 100644 --- a/src/vc/vcgen.rs +++ b/src/vc/vcgen.rs @@ -73,10 +73,9 @@ impl<'tcx> Vcgen<'tcx> { let spec_ty = Some(self.tcx.spec_ty().clone()); let res = match &stmt.node { StmtKind::Seq(block) => self.vcgen_stmts(block, post)?, - StmtKind::Var(var_def) => { - let var_def = var_def.borrow(); - if let Some(init) = &var_def.init { - self.generate_assign(stmt.span, init, builder, &[var_def.name], post)? + StmtKind::Var(decl, init) => { + if let Some(init) = init { + self.generate_assign(stmt.span, init, builder, &[decl.borrow().name], post)? } else { post } From a6e67ba4741f6d0ea05cd0fe4f590106b8cfec16 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 14:28:37 +0100 Subject: [PATCH 22/32] mc: execute literal initializers on each visit The JANI exporter set literal initializers at model startup and skipped them during execution. A later loop iteration could then read the previous iteration's value and produce an incorrect model-checking result. Emit an assignment each time control reaches the declaration, including when the initializer is a literal. --- src/mc/opsem.rs | 10 +++------- 1 file changed, 3 insertions(+), 7 deletions(-) diff --git a/src/mc/opsem.rs b/src/mc/opsem.rs index f2d6b8d1..364f8fb5 100644 --- a/src/mc/opsem.rs +++ b/src/mc/opsem.rs @@ -16,9 +16,7 @@ use crate::{ mc::extract_embed, }; -use super::{ - is_constant, specs::SpecAutomaton, translate_ident, ExprTranslator, JaniConversionError, -}; +use super::{specs::SpecAutomaton, translate_ident, ExprTranslator, JaniConversionError}; /// Intermediate structure to build the JANI automaton for pGCL semantics with /// expected rewards. @@ -92,11 +90,9 @@ fn translate_stmt( StmtKind::Seq(block) => translate_stmts(automaton, block, next), StmtKind::Var(decl, init) => { let decl = decl.borrow(); + // The initial value in the JANI model only applies at startup. match init { - Some(init) if !is_constant(init) => { - translate_assign(automaton, translate_ident(decl.name), init, next) - } - Some(_) => Ok(next), + Some(init) => translate_assign(automaton, translate_ident(decl.name), init, next), None => Err(JaniConversionError::NondetSelection(decl.span)), } } From 10aff9a1911ceb86fbfa90f707c83def457d594d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 14:32:53 +0100 Subject: [PATCH 23/32] driver: return all newly added source units --- src/driver/front.rs | 6 +----- 1 file changed, 1 insertion(+), 5 deletions(-) diff --git a/src/driver/front.rs b/src/driver/front.rs index 50cb82f4..1f804e5f 100644 --- a/src/driver/front.rs +++ b/src/driver/front.rs @@ -109,11 +109,7 @@ impl Module { ) -> &mut [Item] { let old_items_len = self.items.len(); self.items.extend(iter); - if self.items.len() > old_items_len { - &mut self.items[old_items_len + 1..] - } else { - &mut [] - } + &mut self.items[old_items_len..] } /// Parse a file and add the contents to this module. From 45e2b3d651abc0ea19c428da77836b0f3377ee3e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 14:34:30 +0100 Subject: [PATCH 24/32] deps: update rust and vscode dependencies --- Cargo.lock | 517 +++++++++++++++++++++-------------------- Cargo.toml | 8 +- scooter/Cargo.toml | 2 +- vscode-ext/yarn.lock | 536 +++++++++++++++++++++++-------------------- z3rro/Cargo.toml | 4 +- 5 files changed, 557 insertions(+), 510 deletions(-) diff --git a/Cargo.lock b/Cargo.lock index 3a7eae5e..852f0b0e 100644 --- a/Cargo.lock +++ b/Cargo.lock @@ -78,9 +78,9 @@ dependencies = [ [[package]] name = "ar_archive_writer" -version = "0.5.3" +version = "0.5.5" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "73cd58deff2140a0a8eae87e417bd01db68a33e148aa93d1e8cd837e55e312b6" +checksum = "523e5e187fff36fcb8d1d19ccf0ca4ca43ec3d158316057f66dc6f72716bc5ec" dependencies = [ "object", ] @@ -142,34 +142,23 @@ dependencies = [ [[package]] name = "bit-set" -version = "0.8.0" +version = "0.11.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "08807e080ed7f9d5433fa9b275196cfc35414f66a0c79d864dc51a0d825231a3" +checksum = "56d87354e4229f54a44f7bf2435906a4656dba36026ab6eaca629a2c436a691c" dependencies = [ - "bit-vec 0.8.0", + "bit-vec", ] [[package]] -name = "bit-set" -version = "0.9.1" +name = "bit-vec" +version = "0.10.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "34ddef2995421ab6a5c779542c81ee77c115206f4ad9d5a8e05f4ff49716a3dd" +checksum = "72503af1e72be411d74ca45cd6b309878fcb35354e252fc2a3a8bda3a97082a0" dependencies = [ - "bit-vec 0.9.1", + "borsh", + "serde", ] -[[package]] -name = "bit-vec" -version = "0.8.0" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "5e764a1d40d510daf35e07be9eb06e75770908c27d411ee6c92109c9840eaaf7" - -[[package]] -name = "bit-vec" -version = "0.9.1" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "b71798fca2c1fe1086445a7258a4bc81e6e49dcd24c8d0dd9a1e57395b603f51" - [[package]] name = "bitflags" version = "1.3.2" @@ -192,21 +181,36 @@ dependencies = [ ] [[package]] -name = "block-buffer" -version = "0.10.4" +name = "block2" +version = "0.6.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "3078c7629b62d3f0439517fa394996acacc5cbc91c5a20d8c658e77abd503a71" +checksum = "cdeb9d870516001442e364c5220d3574d2da8dc765554b4a617230d33fa58ef5" dependencies = [ - "generic-array", + "objc2", ] [[package]] -name = "block2" -version = "0.6.2" +name = "borsh" +version = "1.8.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "cdeb9d870516001442e364c5220d3574d2da8dc765554b4a617230d33fa58ef5" +checksum = "553c5d846a6ba5150c65e3b1b8ec073bcf1abc20f9b7220de384a4443ea4e20a" dependencies = [ - "objc2", + "borsh-derive", + "bytes", + "cfg_aliases", +] + +[[package]] +name = "borsh-derive" +version = "1.8.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "12cdfe656708a01f89b451a7d36466e6fe6c414de0aa18fc54f864f6f9ca9f56" +dependencies = [ + "once_cell", + "proc-macro-crate", + "proc-macro2", + "quote", + "syn 3.0.10", ] [[package]] @@ -221,9 +225,9 @@ dependencies = [ [[package]] name = "bumpalo" -version = "3.20.3" +version = "3.20.4" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "72f5acc6cb2ba439de613abc23857ec3d78374d8ed5ac84e9d11336e87da8649" +checksum = "87a0cf66fd1eb2fb7b822cb78370d82303750809bc6ba855f3f58e517d3238db" [[package]] name = "byteorder" @@ -231,6 +235,12 @@ version = "1.5.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "1fd0f2584146f6f2ef48085050886acf353beff7305ebd1ae69500e27c67f64b" +[[package]] +name = "bytes" +version = "1.12.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "776dfebd015e2d8732c684a2c71003674ccb49457b539b9e82151ba38e96dd7c" + [[package]] name = "caesar" version = "4.2.0" @@ -247,7 +257,7 @@ dependencies = [ "hdrhistogram", "im-rc", "indexmap", - "itertools 0.14.0", + "itertools 0.15.0", "jani", "lalrpop", "lalrpop-util", @@ -267,7 +277,7 @@ dependencies = [ "replace_with", "serde", "serde_json", - "shlex 1.3.0", + "shlex 2.0.1", "stacker", "string-interner", "tempfile", @@ -281,9 +291,9 @@ dependencies = [ [[package]] name = "cc" -version = "1.5.1" +version = "1.11.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f360145194ee8e21db5ee7f3fcd4fe52210864c75c985dae33218202c8bbe040" +checksum = "33ef9e3e8154a45c7a95cff4c1299702106ad94062d7bb85fdc5d3a5afd91d45" dependencies = [ "find-msvc-tools", "jobserver", @@ -312,6 +322,17 @@ version = "0.2.2" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "f079e83a288787bcd14a6aea84cee5c87a67c5a3e660c30f557a3d24761b3527" +[[package]] +name = "chacha20" +version = "0.10.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "65c35e4b699c7e15ccbe7ee35c005e4fc0a278d22238a2857e6ce2dadeda1b06" +dependencies = [ + "cfg-if", + "cpufeatures", + "rand_core 0.10.1", +] + [[package]] name = "chrono" version = "0.4.45" @@ -336,9 +357,9 @@ dependencies = [ [[package]] name = "clap" -version = "4.6.7" +version = "4.6.8" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "aa8876b300ab35ba921adea3dfd70157a46249b33f95c9084ae5709785478946" +checksum = "ac230478587d0269d8d6998b82ae69ea51509d55df66d9e92edd1f986904cd4a" dependencies = [ "clap_builder", "clap_derive", @@ -358,30 +379,30 @@ dependencies = [ [[package]] name = "clap_complete" -version = "4.6.11" +version = "4.6.12" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "037e2a1a92236d0aff7e845093f64661d6df4c02c9fcc61a60e9e1d736fa392f" +checksum = "6a35200383f20018d41c14d1ab19c1727c697f544492143f7d93aa39f0187848" dependencies = [ "clap", ] [[package]] name = "clap_derive" -version = "4.6.7" +version = "4.6.8" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f9c751b79415d4e559e3d1fcf128e09e720eb673a06d26cf6f392d37d75b66e0" +checksum = "895c9d8d2ac2dd8b8a29f3724a14e72aaaa6debcf8c38c82f97305c6a172767a" dependencies = [ "heck", "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", ] [[package]] name = "clap_lex" -version = "1.1.1" +version = "1.1.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1c133bc6a41be0d194c306b5506d15e6feeea7b1d6604bd3f8310dfb2ca96486" +checksum = "e0921b3876b3a1df8a1c9f912e7f94342458022c2e84288015893d83c4d62a79" [[package]] name = "cli-table" @@ -439,20 +460,26 @@ version = "0.8.7" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "773648b94d0e5d620f64f280777445740e61fe701025087ec8b57f45c791888b" +[[package]] +name = "core_detect" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "7f8f80099a98041a3d1622845c271458a2d73e688351bf3cb999266764b81d48" + [[package]] name = "cpufeatures" -version = "0.2.17" +version = "0.3.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "59ed5838eebb26a2bb2e58f6d5b5316989ae9d08bab10e0e6d103e656d1b0280" +checksum = "5ca28b0ae3115b884660db4118d803791fd6756b6e88f39c0f3f7859060d7566" dependencies = [ "libc", ] [[package]] name = "crc32fast" -version = "1.5.2" +version = "1.5.5" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "01a7799fd6b852db0e61728dde9a204c423b44d689dbd432522543614b490e78" +checksum = "2b929dd2a135771f40afabd1073f85eed59c800b7c61901e5c254270497dad64" dependencies = [ "cfg-if", ] @@ -474,12 +501,11 @@ checksum = "a31eee39dddec8330830986fcd7625edb5a24ec90ea038215273bbc3adb08ac6" [[package]] name = "crypto-common" -version = "0.1.7" +version = "0.2.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "78c8292055d1c1df0cce5d180393dc8cce0abec0a7102adb6c7b1eef6016d60a" +checksum = "ce6e4c961d6cd6c9a86db418387425e8bdeaf05b3c8bc1411e6dca4c252f1453" dependencies = [ - "generic-array", - "typenum", + "hybrid-array", ] [[package]] @@ -525,11 +551,10 @@ checksum = "56254986775e3233ffa9c4d7d3faaf6d36a2c09d30b20687e9f88bc8bafc16c8" [[package]] name = "digest" -version = "0.10.7" +version = "0.11.3" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "9ed9a281f7bc9b7576e61468ba615a66a5c8cfdff42420a70aa82701a3b1e292" +checksum = "f1dd6dbb5841937940781866fa1281a1ff7bd3bf827091440879f9994983d5c2" dependencies = [ - "block-buffer", "crypto-common", ] @@ -545,9 +570,9 @@ dependencies = [ [[package]] name = "either" -version = "1.18.0" +version = "1.19.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "252afb9ae5eaa683babdc6a068b3f5726eb19e05070c731f9b2a23a7c3e8ed34" +checksum = "0e9c71c2167ca323c882b99918929403426e2373ea17242ff5653e0d5e1058be" [[package]] name = "ena" @@ -566,35 +591,35 @@ checksum = "34aa73646ffb006b8f5147f3dc182bd4bcb190227ce861fc4a4844bf8e3cb2c0" [[package]] name = "enum-map" -version = "2.7.3" +version = "3.1.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "6866f3bfdf8207509a033af1a75a7b08abda06bbaaeae6669323fd5a097df2e9" +checksum = "d4532960034c15ba2f55e9eee631040ecc473c32e6c4b200828c759840f13a06" dependencies = [ "enum-map-derive", ] [[package]] name = "enum-map-derive" -version = "0.17.0" +version = "1.0.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f282cfdfe92516eb26c2af8589c274c7c17681f5ecc03c18255fe741c6aa64eb" +checksum = "7127272f64b3e098f7d81f350d672081b879bff896d219c42370dc858b1af9ff" dependencies = [ "proc-macro2", "quote", - "syn 2.0.119", + "syn 3.0.10", ] [[package]] name = "equivalent" -version = "1.0.2" +version = "1.0.3" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "877a4ace8713b0bcf2a4e7eec82529c029f1d0619886d18145fea96c3ffe5c0f" +checksum = "00d174d5400e5e8fd687ad1049e2f578285fa914201b1af7e8b112a4546bd826" [[package]] name = "errno" -version = "0.3.14" +version = "0.3.15" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "39cab71617ae0d63f51a36d69f866391735b51691dbda63cf6f96d042b63efeb" +checksum = "e35d6e78f4cebb90e51d543db8fe41528851d6deeef6ef21ebd4bfdc1e784776" dependencies = [ "libc", "windows-sys 0.61.2", @@ -602,9 +627,9 @@ dependencies = [ [[package]] name = "escape8259" -version = "0.5.3" +version = "0.5.4" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "5692dd7b5a1978a5aeb0ce83b7655c58ca8efdcb79d21036ea249da95afec2c6" +checksum = "9f1f0d310082fd5de539d4f41601182241147498444a7695c520288a0cdbead6" [[package]] name = "fastrand" @@ -614,21 +639,21 @@ checksum = "da7c62ceae207dd37ea5b845da6a0696c799f85e97da1ab5b7910be3c1c80223" [[package]] name = "find-msvc-tools" -version = "0.1.14" +version = "0.1.15" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "aedcfb3409746eddb02b9e19ebda1c3394f759a152e48ee875a0844d1b955484" +checksum = "1c66915cc5391097de7a2b0b972e8505aa33c0df401fd3a6811dbdb32881ba48" [[package]] name = "fixedbitset" -version = "0.5.7" +version = "0.5.9" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1d674e81391d1e1ab681a28d99df07927c6d4aa5b027d7da16ba32d1d21ecd99" +checksum = "5905ec755cc8386d7928353e4d356d2be3e89e81e5ca01fe630a1ca4d08dc175" [[package]] name = "flate2" -version = "1.1.10" +version = "1.1.11" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "6e634e2e0ebac1ee034020da1ca582e17ffe4e0f5e985823721e168928136dcb" +checksum = "626d4928326b646e70f65ed36fc7cf9f206bdb68a0019ee7c6b4709da4e084c4" dependencies = [ "crc32fast", "miniz_oxide", @@ -656,6 +681,12 @@ version = "0.1.5" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "d9c4f5dac5e15c24eb999c26181a6ca40b39fe946cbe4c263c7209467bc83af2" +[[package]] +name = "foldhash" +version = "0.2.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "77ce24cb58228fbb8aa041425bb1050850ac19177686ea6e0f41a70416f56fdb" + [[package]] name = "futures-core" version = "0.3.34" @@ -680,28 +711,6 @@ dependencies = [ "slab", ] -[[package]] -name = "generic-array" -version = "0.14.7" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "85649ca51fd72272d7821adaf274ad91c288277713d9c18820d8499a7ff69e9a" -dependencies = [ - "typenum", - "version_check", -] - -[[package]] -name = "getrandom" -version = "0.3.4" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "899def5c37c4fd7b2664648c28120ecec138e4d395b459e5ca34f9cce2dd77fd" -dependencies = [ - "cfg-if", - "libc", - "r-efi 5.3.0", - "wasip2", -] - [[package]] name = "getrandom" version = "0.4.3" @@ -710,7 +719,8 @@ checksum = "300e883d756b2e4ec94e02791f39b04b522276138852cfc41d9fb7e904106099" dependencies = [ "cfg-if", "libc", - "r-efi 6.0.0", + "r-efi", + "rand_core 0.10.1", ] [[package]] @@ -743,7 +753,16 @@ version = "0.15.5" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "9229cfe53dfd69f0609a49f65461bd93001ea1ef889cd5529dd176593f5338a1" dependencies = [ - "foldhash", + "foldhash 0.1.5", +] + +[[package]] +name = "hashbrown" +version = "0.16.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "841d1cc9bed7f9236f321df977030373f4a4163ae1a7dbfe1a51a2c1a51d9100" +dependencies = [ + "foldhash 0.2.0", ] [[package]] @@ -772,6 +791,15 @@ version = "0.5.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea" +[[package]] +name = "hybrid-array" +version = "0.4.15" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "27f864f10dfb56725ce5ce5472bc52252c8f93a4ab86327122cebf62c5f59a17" +dependencies = [ + "typenum", +] + [[package]] name = "iana-time-zone" version = "0.1.65" @@ -850,18 +878,18 @@ dependencies = [ [[package]] name = "itertools" -version = "0.14.0" +version = "0.15.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "2b192c782037fadd9cfa75548310488aabdbf3d2da73885b31bd0abd03351285" +checksum = "8b4baf93f58d4425749ca49a51c50ebab072c5df6994d08fed93541c331481dc" dependencies = [ "either", ] [[package]] name = "itoa" -version = "1.0.18" +version = "1.0.19" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "8f42a60cbdf9a97f5d2305f08a87dc4e09308d1276d28c869c684d7777685682" +checksum = "3bd1574e617a9a6c1f8f8181bd7e841e1f20e4277607ef28945765188d6284d4" [[package]] name = "jani" @@ -877,15 +905,15 @@ version = "0.1.35" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "1c00acbd29eabad4a2392fa0e921c874934dbbf4194312ad20f04a0ed67a3cb3" dependencies = [ - "getrandom 0.4.3", + "getrandom", "libc", ] [[package]] name = "js-sys" -version = "0.3.106" +version = "0.3.107" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "7883d941dae510fb2d978fc3fe018c71c9e2892fd38854de3e8b92c2e5ad9cc5" +checksum = "8dc09d2154098bbf4ef54eab6b117a3c24cbbffe94046b16ee6d6d4510584d3a" dependencies = [ "cfg-if", "futures-util", @@ -894,23 +922,24 @@ dependencies = [ [[package]] name = "keccak" -version = "0.1.6" +version = "0.2.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "cb26cec98cce3a3d96cbb7bced3c4b16e3d13f27ec56dbd62cbc8f39cfb9d653" +checksum = "d8f198d1db720e4940b5a493201d199d9f24f568f8f746bd13706243a2f71598" dependencies = [ + "cfg-if", "cpufeatures", ] [[package]] name = "lalrpop" -version = "0.23.1" +version = "0.23.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "98a80a963123205c7157323c99611bc4abb65dcbd62ef46dc4bac74a3941bc75" +checksum = "6d315a5ee87f679f2e7caead474b08ec8de60de01a08c942248d4e3c2754565d" dependencies = [ "ascii-canvas", - "bit-set 0.9.1", + "bit-set", "ena", - "itertools 0.14.0", + "itertools 0.15.0", "lalrpop-util", "petgraph", "pico-args", @@ -925,24 +954,24 @@ dependencies = [ [[package]] name = "lalrpop-util" -version = "0.23.1" +version = "0.23.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "884f3e747ed2dcee867cda1b0c31a048f9e20de2d916a248949319921a2e666e" +checksum = "364b49d1c98c07972e16fe1346463becc08bcd663da04e6e37ab1bea068dce6a" dependencies = [ "regex-automata", ] [[package]] name = "lazy_static" -version = "1.5.0" +version = "1.5.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "bbd2bcb4c963f2ddae06a2efc7e9f3591312473c50c6685e1f298068316e66fe" +checksum = "20870f649af7073d53e38067b2a84312175d56ea15217e1b15bc83506ec50afb" [[package]] name = "libc" -version = "0.2.189" +version = "0.2.191" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "3eaf3ede3fee6db1a4c2ee091bf8a8b4dccdc6d17f656fb07896ee72867612f2" +checksum = "65cd87c9a6d60536580b316ad985726104730a5151c99845f2490428ef91240a" [[package]] name = "libgit2-sys" @@ -980,9 +1009,9 @@ dependencies = [ [[package]] name = "libz-sys" -version = "1.1.29" +version = "1.1.33" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "85bc9657773828b90eeb625adff10eeac83cc21bbfd8e23a03eaa8a33c9e28d9" +checksum = "fee3f59f4321dab0c78d828942e7aa09d0bd8ad6e78a501977e6bf3d02938045" dependencies = [ "cc", "libc", @@ -1007,15 +1036,15 @@ dependencies = [ [[package]] name = "log" -version = "0.4.34" +version = "0.4.35" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f9f8bd3e56ce4dfc153cf470fffbfa98c7620958b312ca5c3a4b8d5181fd13c6" +checksum = "5d15f86d12da44cd8d4ec3c73984537eb7f4cadcb9776a575a0a8a05ca11005c" [[package]] name = "lsp-server" -version = "0.7.9" +version = "0.10.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "7d6ada348dbc2703cbe7637b2dda05cff84d3da2819c24abcb305dd613e0ba2e" +checksum = "3ee25a31f2e571e426eef2896179450cafc7e2f5be00d8a93b1c2d21c0ff7656" dependencies = [ "crossbeam-channel", "log", @@ -1086,9 +1115,9 @@ checksum = "650eef8c711430f1a879fdd01d4745a7deea475becfb90269c06775983bbf086" [[package]] name = "nix" -version = "0.31.3" +version = "0.31.4" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "cf20d2fde8ff38632c426f1165ed7436270b44f199fc55284c38276f9db47c3d" +checksum = "2bc81ce8148d3b4f3274da811f11cdd824ae661ee4ef732cdb229825cf5be7f7" dependencies = [ "bitflags 2.13.2", "cfg-if", @@ -1198,9 +1227,9 @@ dependencies = [ [[package]] name = "objc2" -version = "0.6.4" +version = "0.6.5" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "3a12a8ed07aefc768292f076dc3ac8c48f3781c8f2d5851dd3d98950e8c5a89f" +checksum = "08849bbd4767dfae9457696856ae1c84fe4e0281bbe4a7abff2d0e06fb7981f8" dependencies = [ "objc2-encode", ] @@ -1435,9 +1464,9 @@ dependencies = [ [[package]] name = "phf_shared" -version = "0.13.1" +version = "0.14.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "e57fef6bc5981e38c2ce2d63bfa546861309f875b8a75f092d1d54ae2d64f266" +checksum = "c6fd9027e2d9319be6349febd1db4e8d02aa544921200c9b777720ac34a3aa89" dependencies = [ "siphasher", ] @@ -1466,15 +1495,6 @@ version = "1.15.0" source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "05c8b63e8d9609db387f0324918f81d68fe27748f084ef092fb35954d0539a85" -[[package]] -name = "ppv-lite86" -version = "0.2.21" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "85eae3c4ed2f50dcfe72643da4befc30deadb458a9b590d720cde2f2b1e97da9" -dependencies = [ - "zerocopy", -] - [[package]] name = "precomputed-hash" version = "0.1.1" @@ -1502,6 +1522,15 @@ dependencies = [ "yansi", ] +[[package]] +name = "proc-macro-crate" +version = "3.5.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e67ba7e9b2b56446f1d419b1d807906278ffa1a658a8a5d8a39dcb1f5a78614f" +dependencies = [ + "toml_edit", +] + [[package]] name = "proc-macro2" version = "1.0.107" @@ -1513,16 +1542,17 @@ dependencies = [ [[package]] name = "proptest" -version = "1.11.0" +version = "1.12.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "4b45fcc2344c680f5025fe57779faef368840d0bd1f42f216291f0dc4ace4744" +checksum = "b8530004ccb15eae51c7e40009fbe317f341f804db54dc033eec1c50be28cfa0" dependencies = [ - "bit-set 0.8.0", - "bit-vec 0.8.0", + "bit-set", + "bit-vec", "bitflags 2.13.2", + "chacha20", + "core_detect", "num-traits", "rand", - "rand_chacha", "rand_xorshift", "regex-syntax", "rusty-fork", @@ -1555,12 +1585,6 @@ dependencies = [ "proc-macro2", ] -[[package]] -name = "r-efi" -version = "5.3.0" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "69cdb34c158ceb288df11e18b4bd39de994f6657d83847bdffdbd7f346754b0f" - [[package]] name = "r-efi" version = "6.0.0" @@ -1569,22 +1593,12 @@ checksum = "f8dcc9c7d52a811697d2151c701e0d08956f92b0e24136cf4cf27b57a6a0d9bf" [[package]] name = "rand" -version = "0.9.5" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "b9ef1d0d795eb7d84685bca4f72f3649f064e6641543d3a8c415898726a57b41" -dependencies = [ - "rand_chacha", - "rand_core 0.9.5", -] - -[[package]] -name = "rand_chacha" -version = "0.9.0" +version = "0.10.4" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "d3022b5f1df60f26e1ffddd6c66e8aa15de382ae63b3a0c1bfc0e4d3e3f325cb" +checksum = "8f6fa277c67e6ea590466f04c3fe82cb509f0864fe470643e5570de9514a9b11" dependencies = [ - "ppv-lite86", - "rand_core 0.9.5", + "getrandom", + "rand_core 0.10.1", ] [[package]] @@ -1595,20 +1609,17 @@ checksum = "ec0be4795e2f6a28069bec0b5ff3e2ac9bafc99e6a9a7dc3547996c5c816922c" [[package]] name = "rand_core" -version = "0.9.5" +version = "0.10.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "76afc826de14238e6e8c374ddcc1fa19e374fd8dd986b0d2af0d02377261d83c" -dependencies = [ - "getrandom 0.3.4", -] +checksum = "63b8176103e19a2643978565ca18b50549f6101881c443590420e4dc998a3c69" [[package]] name = "rand_xorshift" -version = "0.4.0" +version = "0.5.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "513962919efc330f829edb2535844d1b912b0fbe2ca165d613e4e8788bb05a5a" +checksum = "60aa6af80be32871323012e02e6e65f8a7cc7890931ae421d217ad8fe0df2ccf" dependencies = [ - "rand_core 0.9.5", + "rand_core 0.10.1", ] [[package]] @@ -1646,14 +1657,14 @@ checksum = "92ecd8964f8453721699a1ed72037b0db49ce2f5a5138486ee89bed6f67cdf3a" dependencies = [ "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", ] [[package]] name = "regex" -version = "1.13.1" +version = "1.13.2" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f020237b6c8eed93db2e2cb53c00c60a8e1bc73da7d073199a1180401450218d" +checksum = "9807af0e638c12e753aa1b4e601791bf2a8f71274023c8bbeec12fc149950857" dependencies = [ "aho-corasick", "memchr", @@ -1663,9 +1674,9 @@ dependencies = [ [[package]] name = "regex-automata" -version = "0.4.18" +version = "0.4.19" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "ad8553b9b26413251cbf30e620595c7a41b3887f03da04579c0e6b0d6a06b4b2" +checksum = "41d60ef07df457506a0a1a2073112eb4aae5733dbd2813c3da77d1b0fd441158" dependencies = [ "aho-corasick", "memchr", @@ -1674,9 +1685,9 @@ dependencies = [ [[package]] name = "regex-syntax" -version = "0.8.11" +version = "0.8.12" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "d6f6ff9a378485b298a5286656da665ba74413d36db0979633275d2e708145d4" +checksum = "d902046e6a28a1e4c3cab97258a0ce11e994903f01c2d97a9447a0b3df85f4f6" [[package]] name = "replace_with" @@ -1692,9 +1703,9 @@ checksum = "6b1e7f9a428571be2dc5bc0505c13fb6bf936822b894ec87abf8a08a4e51742d" [[package]] name = "rustix" -version = "1.1.5" +version = "1.1.6" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "891efababe418670775f199f0d233d84843c227a0949a883ce15b37c78d6629d" +checksum = "e5e76742e5294153d4dde1207dbec5bdd81eef6fabdc0d2118babadabfd858aa" dependencies = [ "bitflags 2.13.2", "errno", @@ -1745,7 +1756,7 @@ dependencies = [ "indicatif", "serde", "serde_json", - "shlex 1.3.0", + "shlex 2.0.1", ] [[package]] @@ -1781,14 +1792,14 @@ checksum = "e7a5d71263a5a7d47b41f6b3f06ba276f10cc18b0931f1799f710578e2309348" dependencies = [ "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", ] [[package]] name = "serde_json" -version = "1.0.151" +version = "1.0.154" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "c841b55ecdae098c80dcae9cf767f6f8a0c2cdb3416bbef72181df4d0fe73f14" +checksum = "e7e9cc8b1b85264074fbcc02a88680c4096b1e47df8f739dceb03bf482f04bd6" dependencies = [ "itoa", "memchr", @@ -1805,17 +1816,18 @@ checksum = "8d3b1629de253c70a0508c3899572da79ca359fdab27c7920ff00406df418906" dependencies = [ "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", ] [[package]] name = "sha3" -version = "0.10.9" +version = "0.12.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "77fd7028345d415a4034cf8777cd4f8ab1851274233b45f84e3d955502d93874" +checksum = "bc9bad02c26382724b2d2692c6f179285e4b54eeecd7968f52a50059c3c11759" dependencies = [ "digest", "keccak", + "sponge-cursor", ] [[package]] @@ -1869,9 +1881,15 @@ checksum = "0c790de23124f9ab44544d7ac05d60440adc586479ce501c1d6d7da3cd8c9cf5" [[package]] name = "smallvec" -version = "1.16.2" +version = "1.16.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "3244542535d5de959d90ec55d1b5ff0fd2bb7b1310223907d5f11932847f7b59" + +[[package]] +name = "sponge-cursor" +version = "0.1.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f9395f0f0eee849a9b707b2f06bb92a6a422090e2123bb2ef8e87a0e61892a8e" +checksum = "3a0219bd7d979d58245a4f41f695e1ac9f8befdffadd7f61f1bae9e39abc6620" [[package]] name = "stacker" @@ -1888,19 +1906,19 @@ dependencies = [ [[package]] name = "string-interner" -version = "0.19.0" +version = "0.20.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "23de088478b31c349c9ba67816fa55d9355232d63c3afea8bf513e31f0f1d2c0" +checksum = "ad3df9b59e2eded8d825c7c4363ad339a20fb6bc0b9a4778560f518f59910b15" dependencies = [ - "hashbrown 0.15.5", + "hashbrown 0.16.1", "serde", ] [[package]] name = "string_cache" -version = "0.9.0" +version = "0.11.0" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "a18596f8c785a729f2819c0f6a7eae6ebeebdfffbfe4214ae6b087f690e31901" +checksum = "ffa8a5dbe8b3f0bbe29d4c3225daafaeead63afdc1b65fc4c01a1384166038e6" dependencies = [ "new_debug_unreachable", "parking_lot", @@ -1927,9 +1945,9 @@ dependencies = [ [[package]] name = "syn" -version = "3.0.6" +version = "3.0.10" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "8593e8e72159ed2257d083c7a454a85cbf854f37a0966d8d483aff8c8a3ebcee" +checksum = "4ae9ccbea3a7b0b09443036490c8f34a8b1b760fd345e5c0dae0aac718faea79" dependencies = [ "proc-macro2", "quote", @@ -1943,7 +1961,7 @@ source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "32497e9a4c7b38532efcdebeef879707aa9f794296a4f0244f6f69e9bc8574bd" dependencies = [ "fastrand", - "getrandom 0.4.3", + "getrandom", "once_cell", "rustix", "windows-sys 0.61.2", @@ -1984,7 +2002,7 @@ checksum = "fe5197923287db20a58125f0bc85c062f7f2c892de97b18c356f9efb14b28524" dependencies = [ "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", ] [[package]] @@ -1998,9 +2016,9 @@ dependencies = [ [[package]] name = "tokio" -version = "1.53.1" +version = "1.54.1" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "202caea871b69668250d242070849eb495be178ed697a3e98aebce5bc81a0bed" +checksum = "b52fd3255258d26fac7264ab5a76b53c13367136dc011d3d6ad4f8ed070396a3" dependencies = [ "pin-project-lite", "tokio-macros", @@ -2014,7 +2032,37 @@ checksum = "78773a2a397f451582ce068015985c33193cf6dea8b74d2a639fe457b2f07b0e" dependencies = [ "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", +] + +[[package]] +name = "toml_datetime" +version = "1.1.3+spec-1.1.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "173f25c883cd2176a2d8212155638c0a60d484a9d84546d270866f40f56b6e49" +dependencies = [ + "serde_core", +] + +[[package]] +name = "toml_edit" +version = "0.25.19+spec-1.1.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "dd43688c4858d7264ae1cf9a9f874a67c3feb74a883b1cd7bebd6a4ea8307218" +dependencies = [ + "indexmap", + "toml_datetime", + "toml_parser", + "winnow", +] + +[[package]] +name = "toml_parser" +version = "1.1.5+spec-1.1.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "baa693a8032d7e1cada7d0041e96126df243179ff061456783ac7f12bda4744c" +dependencies = [ + "winnow", ] [[package]] @@ -2111,15 +2159,15 @@ checksum = "eaea85b334db583fe3274d12b4cd1880032beab409c0d774be044d4480ab9a94" [[package]] name = "unicode-ident" -version = "1.0.26" +version = "1.0.27" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "d245f478577f809a851594d02313b640fb437e0bb33866753cff937863096954" +checksum = "a2c754d6c33795a1c324727428e5a7dedb5b06195f9890bdbcba760d3e246563" [[package]] name = "unicode-width" -version = "0.2.2" +version = "0.2.3" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "b4ac048d71ede7ee76d585517add45da530660ef4390e49b098733c6e897f254" +checksum = "ca718471876992059f251e33aafc334346ada08042b7661dd1fe313a9bced557" [[package]] name = "unicode-xid" @@ -2176,23 +2224,13 @@ dependencies = [ "winapi-util", ] -[[package]] -name = "wasip2" -version = "1.0.4+wasi-0.2.12" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "b67efb37e106e55ce722a510d6b5f9c17f083e5fc79afc2badeb12cc313d9487" -dependencies = [ - "wit-bindgen", -] - [[package]] name = "wasm-bindgen" -version = "0.2.129" +version = "0.2.130" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "9bb54f33acc68fd454578d9820b0bde1a1a3d17aa17bb7b6595806d02886d409" +checksum = "a0181c14ddd6c7b8b0b0132a5f1ea2f32be0d893cd3ea97b6e3b28886b8a3d1c" dependencies = [ "cfg-if", - "once_cell", "rustversion", "wasm-bindgen-macro", "wasm-bindgen-shared", @@ -2200,9 +2238,9 @@ dependencies = [ [[package]] name = "wasm-bindgen-macro" -version = "0.2.129" +version = "0.2.130" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "2e29d0c35b16e224a7eeb5cd2d25e3e1968fbd65604117b44d3b789d00ee8535" +checksum = "6e931a02a39abdbf66966fc35902b5ed58344750a70885bed4ebb3d8eaf28ed9" dependencies = [ "quote", "wasm-bindgen-macro-support", @@ -2210,22 +2248,22 @@ dependencies = [ [[package]] name = "wasm-bindgen-macro-support" -version = "0.2.129" +version = "0.2.130" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "6f501a8bc3719dba86ef8ae4728879c08001bea749eb1333ac5b91e040e2a6b7" +checksum = "2ca4b54280e455bd831e33a6b8e734baf432fe63fbc35c42ac14ce67a043a53a" dependencies = [ "bumpalo", "proc-macro2", "quote", - "syn 3.0.6", + "syn 3.0.10", "wasm-bindgen-shared", ] [[package]] name = "wasm-bindgen-shared" -version = "0.2.129" +version = "0.2.130" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "23f0c9c52aa7cd7d77769a4cfe2a9adb1b331f489a41d912ce14513d5ab995c6" +checksum = "3b1f9c3798725016c6ee5f2f57869ec0831e8bbc0ab0310a86e787e97f41389e" dependencies = [ "unicode-ident", ] @@ -2391,10 +2429,13 @@ source = "registry+https://github.com/rust-lang/crates.io-index" checksum = "589f6da84c646204747d1270a2a5661ea66ed1cced2631d546fdfb155959f9ec" [[package]] -name = "wit-bindgen" -version = "0.57.1" +name = "winnow" +version = "1.0.5" source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "1ebf944e87a7c253233ad6766e082e3cd714b5d03812acc24c318f549614536e" +checksum = "8c3b93199df0ab874cdf0c6a94f0a0dc3423fe41f1cafb62b8bd7b1deb277aef" +dependencies = [ + "memchr", +] [[package]] name = "yansi" @@ -2430,7 +2471,7 @@ dependencies = [ "enum-map", "im-rc", "indexmap", - "itertools 0.14.0", + "itertools 0.15.0", "num", "once_cell", "proptest", @@ -2441,26 +2482,6 @@ dependencies = [ "z3", ] -[[package]] -name = "zerocopy" -version = "0.8.59" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "6df92bf3d9227be3d53173901ddbffac2babc27ae50f397776ffd6dc33f800cb" -dependencies = [ - "zerocopy-derive", -] - -[[package]] -name = "zerocopy-derive" -version = "0.8.59" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "ac4f328cf2f05d084e496c3e9c3f33ed0a183656a16e1fcec4d464d8373aec82" -dependencies = [ - "proc-macro2", - "quote", - "syn 2.0.119", -] - [[package]] name = "zlib-rs" version = "0.6.8" diff --git a/Cargo.toml b/Cargo.toml index c342e74c..318403a4 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -27,7 +27,7 @@ static-link-z3 = ["z3/static-link-z3"] log-print-timeless = [] [dependencies] -string-interner = "0.19" +string-interner = "0.20" lalrpop-util = { version = "0.23", features = ["lexer"] } z3 = "^0.13.2" ref-cast = "1.0" @@ -48,14 +48,14 @@ im-rc = "15" cfg-if = "1.0.0" lsp-types = "0.97.0" serde_json = "1.0.114" -lsp-server = "0.7.6" +lsp-server = "0.10.0" serde = "1.0.197" jani = { path = "./jani" } -itertools = "0.14.0" +itertools = "0.15.0" stacker = "0.1.15" crossbeam-channel = "0.5.15" crossbeam-utils = "0.8.21" -shlex = "1.3.0" +shlex = "2.0.1" clap = { version = "4.5.23", features = ["derive", "string", "cargo"] } clap_complete = "4.5.42" regex = "1.11.1" diff --git a/scooter/Cargo.toml b/scooter/Cargo.toml index 5c7cac06..174287cf 100644 --- a/scooter/Cargo.toml +++ b/scooter/Cargo.toml @@ -10,5 +10,5 @@ indicatif = "0.18.4" serde = { version = "1.0", features = ["derive"] } serde_json = "1.0" cli-table = "0.5.0" -shlex = "1.3.0" +shlex = "2.0.1" csv = "1.3.1" diff --git a/vscode-ext/yarn.lock b/vscode-ext/yarn.lock index 410817cc..36295f5a 100644 --- a/vscode-ext/yarn.lock +++ b/vscode-ext/yarn.lock @@ -19,9 +19,9 @@ tslib "^2.6.2" "@azure/core-client@^1.9.2": - version "1.11.1" - resolved "https://registry.npmjs.org/@azure/core-client/-/core-client-1.11.1.tgz#d990878a88577507ab1131935b4734b29a637d58" - integrity sha512-2QygG2F76ZpMP2eMztiJvAiFMu71M9rDeU7vO/QKg5Css7MgM4frUOslFjhVjRhbGaCNPtz/S8M6y46/fFKVuQ== + version "1.11.2" + resolved "https://registry.npmjs.org/@azure/core-client/-/core-client-1.11.2.tgz#9c16ec6614dcb6bf83ee0ab9bfbb513ba2fa9d6f" + integrity sha512-ajuIU1aMoTs/ERYrKnIqQrV5Vz3RL8mwDC5RdedIXUvR7pi6cWzeYmt0LfNz6+W91CuCO4WJG0zA6+PhU1X+hw== dependencies: "@azure/abort-controller" "^2.1.2" "@azure/core-auth" "^1.10.0" @@ -37,16 +37,16 @@ integrity sha512-/shnJ+ooO8WPxDhPEeI/2oRQuubn16gZ6CvlbpWbEswZfzwI9tI/sMAHmF3x1LuQ9yZYXfLW3TjzGMLEC5blKg== "@azure/core-rest-pipeline@^1.17.0", "@azure/core-rest-pipeline@^1.22.0": - version "1.25.0" - resolved "https://registry.npmjs.org/@azure/core-rest-pipeline/-/core-rest-pipeline-1.25.0.tgz#92ea4912edbb1f7395f4829a300631174aa82f08" - integrity sha512-bMs8ekJLjX8wPV+9IPBges1SLPyuDtE9g5gLDWOpxzKcoOFQnpLGkbcT1tdw3FaAmDS1gnPmMmJ6y/T5B96kIA== + version "1.25.1" + resolved "https://registry.npmjs.org/@azure/core-rest-pipeline/-/core-rest-pipeline-1.25.1.tgz#344522466c9afe45b2b2b9737654b4aaaf48109f" + integrity sha512-fTIA3CAm/cdODqiXkO6jYOIkU2Ylld7vq65KGc70gTwl12sLQsC8v7I5t6tp2N2CfUONzZBXyeFw7KEu6Ks2zg== dependencies: "@azure/abort-controller" "^2.1.2" "@azure/core-auth" "^1.10.0" "@azure/core-tracing" "^1.3.0" "@azure/core-util" "^1.13.0" "@azure/logger" "^1.3.0" - "@typespec/ts-http-runtime" "^0.3.4" + "@typespec/ts-http-runtime" "^0.3.10" tslib "^2.6.2" "@azure/core-tracing@^1.0.0", "@azure/core-tracing@^1.3.0": @@ -66,9 +66,9 @@ tslib "^2.6.2" "@azure/identity@^4.13.2": - version "4.13.3" - resolved "https://registry.npmjs.org/@azure/identity/-/identity-4.13.3.tgz#f7781be089dc6231e17ae1454b9a1e91bc797b81" - integrity sha512-zGQPtqvXPgSA8yfV2CkIQ1qirqk0p9AIVpC5uEkdXQYcKl07QHvyaGYRnZOk0AsQUmxNb4wfkcwY5di8Z5xa9A== + version "4.14.1" + resolved "https://registry.npmjs.org/@azure/identity/-/identity-4.14.1.tgz#12cf11210b5341887ba27883501bda1e5c00c8b0" + integrity sha512-HHuuFrmN1uuF9D5A6aAo5eHzNFNX4Q+P4SksZqDKse5YaJFFy/zDLG3wXHEV2FVGgetZ3QM8jGURNBtnQYf1NQ== dependencies: "@azure/abort-controller" "^2.0.0" "@azure/core-auth" "^1.9.0" @@ -79,8 +79,8 @@ "@azure/core-util" "^1.11.0" "@azure/logger" "^1.0.0" "@azure/msal-browser" "^5.5.0" - "@azure/msal-node" "^6.0.0" - open "^10.1.0" + "@azure/msal-node" "^7.1.0" + open "^11.0.0" tslib "^2.2.0" "@azure/logger@^1.0.0", "@azure/logger@^1.3.0": @@ -92,23 +92,23 @@ tslib "^2.6.2" "@azure/msal-browser@^5.5.0": - version "5.23.0" - resolved "https://registry.npmjs.org/@azure/msal-browser/-/msal-browser-5.23.0.tgz#e1ca85dcd727241c97c1306a0a5427ce0bb71801" - integrity sha512-IRCwkRCK47hBXK+7bu67UZWY7HS0Jx1dZgi4C1HVbjlBum8Jy8fb2l87xFr6HxdQJWy951zRUHtwwDITHFAtaA== + version "5.29.1" + resolved "https://registry.npmjs.org/@azure/msal-browser/-/msal-browser-5.29.1.tgz#3cbd190d29e25f8473804d8a28aa479ed3dc69cc" + integrity sha512-+TMoU/4h3KYUvQKZH+p1/9/iDaepDlVJQ7UMUAB6q8prPsMfsOoqA9m2alpPqLUQ48Bp7sXqN2wdhA9rOg9q1A== dependencies: - "@azure/msal-common" "16.14.1" + "@azure/msal-common" "16.16.2" -"@azure/msal-common@16.14.1": - version "16.14.1" - resolved "https://registry.npmjs.org/@azure/msal-common/-/msal-common-16.14.1.tgz#2c987f31da858e544e72b6faa986fecdb3de20f8" - integrity sha512-Or6xhPNyi4zHW25158yxBoyxuCqNSPa5YBVqfF1J5Ks4MJWBo/USXdp05DQIPu1Zli00YZu6t0+h6KvHJealxQ== +"@azure/msal-common@16.16.2": + version "16.16.2" + resolved "https://registry.npmjs.org/@azure/msal-common/-/msal-common-16.16.2.tgz#e312f397d8f8de54acc993a7e1c29322d825fd2d" + integrity sha512-IVoPgAup0hnpzwC8esxPxrrnDDVe0n3mmK+UU3JRmKWySKxBQrl+a30tTP3okmJ9Wc7dh+IgoNaUXkCxb2DBSg== -"@azure/msal-node@^6.0.0": - version "6.0.1" - resolved "https://registry.npmjs.org/@azure/msal-node/-/msal-node-6.0.1.tgz#48b9d5a472f16b403bd3a32494227ecfc54cafd4" - integrity sha512-ixSO1Y/kCVRthRs+hSx/5qkwaunX1/RAePhlMN0wIpIQ4WEZ6AREGGnGd1AP0qspHVsAwzWQKGubpjh50JyJIQ== +"@azure/msal-node@^7.1.0": + version "7.2.2" + resolved "https://registry.npmjs.org/@azure/msal-node/-/msal-node-7.2.2.tgz#84e4e3d5411183a92819f927c7bd2606cea19ee0" + integrity sha512-MjsAHC+KUSXYYC8P57lVXy5IgSeO+PraXzLLHZI6hcX7nx/hCokY6gTPm2JcKLI3W88mu7ozjObBVGKExZUhww== dependencies: - "@azure/msal-common" "16.14.1" + "@azure/msal-common" "16.16.2" jsonwebtoken "^9.0.0" "@bcoe/v8-coverage@^1.0.1": @@ -272,18 +272,18 @@ eslint-visitor-keys "^3.4.3" "@eslint-community/regexpp@^4.12.2": - version "4.12.2" - resolved "https://registry.npmjs.org/@eslint-community/regexpp/-/regexpp-4.12.2.tgz#bccdf615bcf7b6e8db830ec0b8d21c9a25de597b" - integrity sha512-EriSTlt5OC9/7SXkRSCAhfSxxoSUgBm33OH+IkwbdpgoqsSsUg7y3uh+IICI/Qg4BBWr3U2i39RpmycbxMq4ew== + version "4.12.3" + resolved "https://registry.npmjs.org/@eslint-community/regexpp/-/regexpp-4.12.3.tgz#332c2660e7dd03ce7017ea3354123fb19b21cdd6" + integrity sha512-R76UKbvsqI68DJJVTVyqFKqU98CN4+B+acxNfEA2IFarSzP0SjtKf/3+fFiXzTyv5Fj3PxLkGHe2wnVWWMxobQ== -"@eslint/config-array@^0.23.5": - version "0.23.5" - resolved "https://registry.npmjs.org/@eslint/config-array/-/config-array-0.23.5.tgz#56e86d243049195d8acc0c06a1b3dfdc3fa3de95" - integrity sha512-Y3kKLvC1dvTOT+oGlqNQ1XLqK6D1HU2YXPc52NmAlJZbMMWDzGYXMiPRJ8TYD39muD/OTjlZmNJ4ib7dvSrMBA== +"@eslint/config-array@^0.23.6": + version "0.23.6" + resolved "https://registry.npmjs.org/@eslint/config-array/-/config-array-0.23.6.tgz#cf69071fd9dc0950e90c352e2716fa8a26e631a4" + integrity sha512-WrTH7nioI9QPY4NZGnsywmecswJdgeq4BCM76qok9VgjTO29ZgUzUvcuJLVPYVQM4uDbaPBU0M33R9DIxI8X3w== dependencies: "@eslint/object-schema" "^3.0.5" debug "^4.3.1" - minimatch "^10.2.4" + minimatch "^11.0.5" "@eslint/config-helpers@^0.7.0": version "0.7.0" @@ -324,7 +324,7 @@ dependencies: "@humanfs/types" "^0.15.0" -"@humanfs/node@^0.16.6": +"@humanfs/node@^0.16.8": version "0.16.8" resolved "https://registry.npmjs.org/@humanfs/node/-/node-0.16.8.tgz#8f800cccc13f4f8cd3116e2d9c0a94939da3e3ed" integrity sha512-gE1eQNZ3R++kTzFUpdGlpmy8kDZD/MLyHqDwqjkVQI0JMdI1D51sy1H958PNXYkM2rAac7e5/CnIKZrHtPh3BQ== @@ -367,15 +367,20 @@ dependencies: minipass "^7.0.4" +"@isaacs/nonrecursive-glob-match@^1.1.0": + version "1.1.0" + resolved "https://registry.npmjs.org/@isaacs/nonrecursive-glob-match/-/nonrecursive-glob-match-1.1.0.tgz#b1d69b8938aab4c292f7fde628c47dc1dbd737ef" + integrity sha512-GPm/Dbvk5RLmhRnxXIa7nTpK0xtl4E0wj0MslsuNiJ1FIROU+2+9lgUC/dgF7Ey4QCWhfEsgxilMRMCdHPfDfw== + "@istanbuljs/schema@^0.1.2", "@istanbuljs/schema@^0.1.3": version "0.1.6" resolved "https://registry.npmjs.org/@istanbuljs/schema/-/schema-0.1.6.tgz#8dc9afa2ac1506cb1a58f89940f1c124446c8df3" integrity sha512-+Sg6GCR/wy1oSmQDFq4LQDAhm3ETKnorxN+y5nbLULOR3P0c14f2Wurzj3/xqPXtasLFfHd5iRFQ7AJt4KH2cw== "@jridgewell/resolve-uri@^3.1.0": - version "3.1.2" - resolved "https://registry.npmjs.org/@jridgewell/resolve-uri/-/resolve-uri-3.1.2.tgz#7a0ee601f60f99a20c7c7c5ff0c80388c1189bd6" - integrity sha512-bRISgCIjP20/tbWSPWMEi54QVPRZExkuD9lJL+UIxUKtwVJA8wW1Trb1jMs1RFXo1CBTNZ/5hpC9QvmKWdopKw== + version "3.1.3" + resolved "https://registry.npmjs.org/@jridgewell/resolve-uri/-/resolve-uri-3.1.3.tgz#98ddb96e5674eb804aae9aa6793237ee2a08826c" + integrity sha512-lhTtjtoEArWBjismtfS761S9Hlyn+nIZqOZVYoZ1Xn82PMNMVnk+jj/NhC4fAXGTs7ydONcJiR5vyQBTMDu27g== "@jridgewell/sourcemap-codec@^1.4.14": version "1.6.0" @@ -650,9 +655,9 @@ integrity sha512-xJBAbDifo5hpffDBuHl0Y8ywswbiAp/Wi7Y/GtAgSlZyIABppyurxVueOPE8LUQOxdlgi6Zqce7uoEpqNTeiUw== "@types/estree@^1.0.6", "@types/estree@^1.0.8": - version "1.0.9" - resolved "https://registry.npmjs.org/@types/estree/-/estree-1.0.9.tgz#cf3f0e876d7bee15a93ab925b82bf570a3904a24" - integrity sha512-GhdPgy1el4/ImP05X05Uw4cw2/M93BCUmnEvWZNStlCzEKME4Fkk+YpoA5OiHNQmoS7Cafb8Xa3Pya8m1Qrzeg== + version "1.0.10" + resolved "https://registry.npmjs.org/@types/estree/-/estree-1.0.10.tgz#8a4a266065af8c2fcf5983153cd97c11b313d0c6" + integrity sha512-lTyOMnOcmRBzdCv6/4zUZCrEhV0xrqQiUZBZtVcbmLHBXKLnN8q89v/wKRF/Q0HbwVsqbIG3o5HDoFl9sduM+g== "@types/http-cache-semantics@^4.0.2": version "4.2.0" @@ -675,9 +680,9 @@ integrity sha512-xPyYSz1cMPnJQhl0CLMH68j3gprKZaTjG3s5Vi+fDgx+uhG9NOXwbVt52eFS8ECyXhyKcjDLCBEqBExKuiZb7Q== "@types/node@^22.20.4": - version "22.20.4" - resolved "https://registry.npmjs.org/@types/node/-/node-22.20.4.tgz#37aab5e1beb215f4c036ea0e17343e59abf430de" - integrity sha512-zJRE40jpHtKqE/C4fgHrAKQLJuSpzEnP9ff9Y7YtoR3Wd2pwqzlekDeEuUQXjRd+QCYnVnNwuJYmhdk9XV8gvA== + version "22.20.5" + resolved "https://registry.npmjs.org/@types/node/-/node-22.20.5.tgz#afa7bde6da81b8b83ea4e2f020487e9b148c11fd" + integrity sha512-U2+DNr+wSjpsTS/wZGYHq7GcwfuSmKiKvoPvK22zwTlRhU91yOniN4qRR5KhIjvif7ysw/dz/hKmfDH0Ris4aA== dependencies: undici-types "~6.21.0" @@ -691,106 +696,106 @@ resolved "https://registry.npmjs.org/@types/vscode/-/vscode-1.87.0.tgz#ee9b163f3d2115fb0b20619b34dd3abc5a923361" integrity sha512-y3yYJV2esWr8LNjp3VNbSMWG7Y43jC8pCldG8YwiHGAQbsymkkMMt0aDT1xZIOFM2eFcNiUc+dJMx1+Z0UT8fg== -"@typescript-eslint/eslint-plugin@8.71.0", "@typescript-eslint/eslint-plugin@^8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-8.71.0.tgz#99f474391c3e54bfcb73b1934ea2dba6d6a59bef" - integrity sha512-pqcS9c1HxZTHt7End4nXqd0s5lJrrFzrgCkKFJrsbUnaL6M3+6oBFZaslg6Gjsl3argl2DDRFROnXARaZ2e4Nw== +"@typescript-eslint/eslint-plugin@8.73.0", "@typescript-eslint/eslint-plugin@^8.71.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-8.73.0.tgz#a30066ac95875d9b0bdece795d6671550a175859" + integrity sha512-UkygMFer53Yzn29MCYFTHf34hGXf5KJhiDWfIm1tXtXRrym1CS6l5H9Y3yCtPWChpC0/f93H88gdj8tN0dd4kw== dependencies: "@eslint-community/regexpp" "^4.12.2" - "@typescript-eslint/scope-manager" "8.71.0" - "@typescript-eslint/type-utils" "8.71.0" - "@typescript-eslint/utils" "8.71.0" - "@typescript-eslint/visitor-keys" "8.71.0" + "@typescript-eslint/scope-manager" "8.73.0" + "@typescript-eslint/type-utils" "8.73.0" + "@typescript-eslint/utils" "8.73.0" + "@typescript-eslint/visitor-keys" "8.73.0" ignore "^7.0.5" natural-compare "^1.4.0" ts-api-utils "^2.5.0" -"@typescript-eslint/parser@8.71.0", "@typescript-eslint/parser@^8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-8.71.0.tgz#e1ecf4ff47f91c90fa11866b2190ee072d5a14af" - integrity sha512-CG4nPk1f2zc8yw4pALqHsFYH2hdo+h1T9daSp21+Hnxi9LOE3GT9hAfTKJCBXVNM2GmYs1eMEP615wPoeOgk3A== +"@typescript-eslint/parser@8.73.0", "@typescript-eslint/parser@^8.71.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-8.73.0.tgz#fbef99f6a3dd5546375ba03fbc0c75181971e46e" + integrity sha512-AuL45bVcmssHfZ3Di3cs9Q0l4gBm4ZFVrJOQEE7VpqW+PVgQaEwSwazz4TVIiFabXkk6U51EprYDwqw+HR8ePw== dependencies: - "@typescript-eslint/scope-manager" "8.71.0" - "@typescript-eslint/types" "8.71.0" - "@typescript-eslint/typescript-estree" "8.71.0" - "@typescript-eslint/visitor-keys" "8.71.0" + "@typescript-eslint/scope-manager" "8.73.0" + "@typescript-eslint/types" "8.73.0" + "@typescript-eslint/typescript-estree" "8.73.0" + "@typescript-eslint/visitor-keys" "8.73.0" debug "^4.4.3" -"@typescript-eslint/project-service@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/project-service/-/project-service-8.71.0.tgz#8408b60210e2f49ddf3cdb25c985df272a35461f" - integrity sha512-aABjw5rjBacYONVPaPiWOCjJu0vEF4a25iQuodlmQYL1trtLZ0X/y+2Vzl3BKI1odM4LnwLE1oUDXYp1wzx1TQ== +"@typescript-eslint/project-service@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/project-service/-/project-service-8.73.0.tgz#cea2f3cf6dd2b32add1dfe513f3433d210947eb1" + integrity sha512-/pEf8Rc4Mjk+qJnY0uO1+Gadeal8uv50xpuic+srG2vIVatA0XxvWMUeMtFvs6OCHqftiQ7/+qH4aehG5stzIA== dependencies: - "@typescript-eslint/tsconfig-utils" "^8.71.0" - "@typescript-eslint/types" "^8.71.0" + "@typescript-eslint/tsconfig-utils" "^8.73.0" + "@typescript-eslint/types" "^8.73.0" debug "^4.4.3" -"@typescript-eslint/scope-manager@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-8.71.0.tgz#4a5a637b272d13d8755d5b5024099826eb4fc688" - integrity sha512-gWF0BhUcnjZxSpLE8ngS/59n2SB0J3YqRxvX1+2aoRJk9hNtHSLOV+TcarFiOr5ipXm3yc1QrI4c9YZc8zyCxw== +"@typescript-eslint/scope-manager@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-8.73.0.tgz#447b2f20517b55750cc33828ed74b26baec03484" + integrity sha512-/TjD738Iq2rzj5z0ixVOi+TsvgjAzZPLPaH1yWdDBytR/HTR5gMpyYWZeCe5WTQZLwk3ho8AV7U3muoQCRtXBQ== dependencies: - "@typescript-eslint/types" "8.71.0" - "@typescript-eslint/visitor-keys" "8.71.0" + "@typescript-eslint/types" "8.73.0" + "@typescript-eslint/visitor-keys" "8.73.0" -"@typescript-eslint/tsconfig-utils@8.71.0", "@typescript-eslint/tsconfig-utils@^8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/tsconfig-utils/-/tsconfig-utils-8.71.0.tgz#83a69c9a514af8f5ff099cc6c0d609c273e8f039" - integrity sha512-Z1UlWHADEK2Mlb9NpWfDeSjqoZ5EyrOv4R3eQpbkzqn/EwaIdOpXXupEA1+0ZIOSJSZZDBHG0BrQyN8zUG6Pwg== +"@typescript-eslint/tsconfig-utils@8.73.0", "@typescript-eslint/tsconfig-utils@^8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/tsconfig-utils/-/tsconfig-utils-8.73.0.tgz#72e40e4c694064b5e9c660fb839fdb7e9e26a266" + integrity sha512-lmtCFOfYaJfpqZywGuXi4FpNtE+NQ+YLe3T0K9rtEDcW8ZuGWvfI++pj8r05sYMI8vWT2CYK4rWyedmD6Rp4og== -"@typescript-eslint/type-utils@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/type-utils/-/type-utils-8.71.0.tgz#eab342370b18ae8ad39c031e3878bddabc1d254b" - integrity sha512-i8uO1qbdxeKgRnS5sCRt6On3/nfo2d2DwQe3Yvjx543zLy7r8ySqRuPPiIIXAhS03U0v5NfAFx+rUgxFzKKwNw== +"@typescript-eslint/type-utils@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/type-utils/-/type-utils-8.73.0.tgz#4ebae458f229c7221ed0b07f46051e73cf8eb596" + integrity sha512-MOC9i4xy1F7KcDde7Ip8jf1SrRiALb2Km4UWxGNjUE2YlhjIEo1ayE27GHIwIQyfWuHTmEonQT14uyurlyC6aA== dependencies: - "@typescript-eslint/types" "8.71.0" - "@typescript-eslint/typescript-estree" "8.71.0" - "@typescript-eslint/utils" "8.71.0" + "@typescript-eslint/types" "8.73.0" + "@typescript-eslint/typescript-estree" "8.73.0" + "@typescript-eslint/utils" "8.73.0" debug "^4.4.3" ts-api-utils "^2.5.0" -"@typescript-eslint/types@8.71.0", "@typescript-eslint/types@^8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/types/-/types-8.71.0.tgz#a230a121e71665060afe27d1f1ad110371f9451e" - integrity sha512-cJ4OoxPGWvFnBTnSZyaU+qJzGTqPTGJY+gDchj6cRyLRdmIdt4rcsE4twj+zPfrNiWuVi38wijHzShL++Z9atQ== +"@typescript-eslint/types@8.73.0", "@typescript-eslint/types@^8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/types/-/types-8.73.0.tgz#785586de1325a973b24e4e762bcd0093b248a2a7" + integrity sha512-O/1ytYzflF16QDKXx4/qOXg1IuZp+n7hr9t+S0nv7N/2Tl8rJiNCshztV1gcSUvHbPtoX3+zmNbtSAyVbzxVfw== -"@typescript-eslint/typescript-estree@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-8.71.0.tgz#78127ef7d5dad7f036ad065235a0fb92a3e02340" - integrity sha512-PEEF4G5sLLWAS5BpPrUvms4ySZkiBQQZM4z+3ReI46axK5Vqr/vXBQatJQIZZOYdGyPUAKTtsrWzpqKuU+3DEw== +"@typescript-eslint/typescript-estree@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-8.73.0.tgz#3aba5f6fde4f902c5abb0dce73b4326dd237deb0" + integrity sha512-InjlBkSdWceIwIBWSwS3ENUp+i0O02PGX3Zv2wnihWJC1WDVGvG7mTHuf8b57uAaITj94d6tRPDH+sUEtXdRQQ== dependencies: - "@typescript-eslint/project-service" "8.71.0" - "@typescript-eslint/tsconfig-utils" "8.71.0" - "@typescript-eslint/types" "8.71.0" - "@typescript-eslint/visitor-keys" "8.71.0" + "@typescript-eslint/project-service" "8.73.0" + "@typescript-eslint/tsconfig-utils" "8.73.0" + "@typescript-eslint/types" "8.73.0" + "@typescript-eslint/visitor-keys" "8.73.0" debug "^4.4.3" - minimatch "^10.2.2" + minimatch "^11.0.1" semver "^7.7.3" tinyglobby "^0.2.15" ts-api-utils "^2.5.0" -"@typescript-eslint/utils@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/utils/-/utils-8.71.0.tgz#4e7923ae1083e941c6fefabf4b978ffecc48ecb0" - integrity sha512-pKR/tEMVrXZG23UFKUn5BQf3zfmfk7KQceI2cGzywZ5nxM5Eu3hEJU1utjWzydtzBbcJAQhHN8iPCxobHpPcZQ== +"@typescript-eslint/utils@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/utils/-/utils-8.73.0.tgz#566a437a6a9492fd81b58a169bb7114bdf205639" + integrity sha512-j2SVJJvVkXdUL0WcEzo4vEH1mO1vIi8KlVukcYA2MgMZvYN2LlZR4PmsW+GTSxSW24j6Q/EP7+MOifLtg5hmsA== dependencies: "@eslint-community/eslint-utils" "^4.9.1" - "@typescript-eslint/scope-manager" "8.71.0" - "@typescript-eslint/types" "8.71.0" - "@typescript-eslint/typescript-estree" "8.71.0" + "@typescript-eslint/scope-manager" "8.73.0" + "@typescript-eslint/types" "8.73.0" + "@typescript-eslint/typescript-estree" "8.73.0" -"@typescript-eslint/visitor-keys@8.71.0": - version "8.71.0" - resolved "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-8.71.0.tgz#8ca9a12bc5083b9a090c3ea4e5d9ef97f6558199" - integrity sha512-8eQ9R218XORK+KLosnf4bu/QsUXvUyVwTbArg7/0NMB1Pu87OJKvj4nhFblkYE8gQV73mW1dx1ptlPCkwRGa7A== +"@typescript-eslint/visitor-keys@8.73.0": + version "8.73.0" + resolved "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-8.73.0.tgz#b5e802c5f300cf7768ddb3c7e46bd7013744e57c" + integrity sha512-k4lsFVpRZICbltkIEEH4hZRkwXkqDF1GHBpClKQOHQY+RkoZAAuyc1ci3I6p+CB6v3U4jaHIUshc4RzzQXZWLg== dependencies: - "@typescript-eslint/types" "8.71.0" + "@typescript-eslint/types" "8.73.0" eslint-visitor-keys "^5.0.0" -"@typespec/ts-http-runtime@^0.3.0", "@typespec/ts-http-runtime@^0.3.4": - version "0.3.9" - resolved "https://registry.npmjs.org/@typespec/ts-http-runtime/-/ts-http-runtime-0.3.9.tgz#332855bbd729ab36e0779b2dfc24edc920d12461" - integrity sha512-edSdeAqkdxBVzA1yL1LrLCml1YjyCVvPMtMqJpbF+6K609tHe8V6sQUzFQSGcYNhcuhOceZtjvN32+mpIth30A== +"@typespec/ts-http-runtime@^0.3.0", "@typespec/ts-http-runtime@^0.3.10": + version "0.3.11" + resolved "https://registry.npmjs.org/@typespec/ts-http-runtime/-/ts-http-runtime-0.3.11.tgz#bb2d82789ca6a36517fafc57986b27f5d263ae90" + integrity sha512-KZlacW7zFdcIOAcpNiV5U9fy0Tfgw7xdEc4rVyuUtQS+UR1Sn32PXuAz+AJ70Y0yzTWh62/pEEpFmWUJl6YySw== dependencies: http-proxy-agent "^7.0.0" https-proxy-agent "^7.0.0" @@ -822,70 +827,70 @@ ora "^8.1.0" semver "^7.6.2" -"@vscode/vsce-sign-alpine-arm64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-alpine-arm64/-/vsce-sign-alpine-arm64-2.0.6.tgz#2cd244caf5e8ec543f42fb91d4df3b933641c8fa" - integrity sha512-wKkJBsvKF+f0GfsUuGT0tSW0kZL87QggEiqNqK6/8hvqsXvpx8OsTEc3mnE1kejkh5r+qUyQ7PtF8jZYN0mo8Q== - -"@vscode/vsce-sign-alpine-x64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-alpine-x64/-/vsce-sign-alpine-x64-2.0.6.tgz#b0e80a4792001c66e27feee2c11e821ad1fa1680" - integrity sha512-YoAGlmdK39vKi9jA18i4ufBbd95OqGJxRvF3n6ZbCyziwy3O+JgOpIUPxv5tjeO6gQfx29qBivQ8ZZTUF2Ba0w== - -"@vscode/vsce-sign-darwin-arm64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-darwin-arm64/-/vsce-sign-darwin-arm64-2.0.6.tgz#4b8fa1ab55f280a99985be3c06fb730e57810cce" - integrity sha512-5HMHaJRIQuozm/XQIiJiA0W9uhdblwwl2ZNDSSAeXGO9YhB9MH5C4KIHOmvyjUnKy4UCuiP43VKpIxW1VWP4tQ== - -"@vscode/vsce-sign-darwin-x64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-darwin-x64/-/vsce-sign-darwin-x64-2.0.6.tgz#d2c9186d9505498272cbddd8383bb038ebcf5820" - integrity sha512-25GsUbTAiNfHSuRItoQafXOIpxlYj+IXb4/qarrXu7kmbH94jlm5sdWSCKrrREs8+GsXF1b+l3OB7VJy5jsykw== - -"@vscode/vsce-sign-linux-arm64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-arm64/-/vsce-sign-linux-arm64-2.0.6.tgz#b3d8560144040b920d8c6edd4374314b58255481" - integrity sha512-cfb1qK7lygtMa4NUl2582nP7aliLYuDEVpAbXJMkDq1qE+olIw/es+C8j1LJwvcRq1I2yWGtSn3EkDp9Dq5FdA== - -"@vscode/vsce-sign-linux-arm@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-arm/-/vsce-sign-linux-arm-2.0.6.tgz#0a27c42a4adb37e96eec78cd7bfa388cd4e9fbef" - integrity sha512-UndEc2Xlq4HsuMPnwu7420uqceXjs4yb5W8E2/UkaHBB9OWCwMd3/bRe/1eLe3D8kPpxzcaeTyXiK3RdzS/1CA== - -"@vscode/vsce-sign-linux-x64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-x64/-/vsce-sign-linux-x64-2.0.6.tgz#ade11caeeed524fc16bd6c43ca49aea00295de8c" - integrity sha512-/olerl1A4sOqdP+hjvJ1sbQjKN07Y3DVnxO4gnbn/ahtQvFrdhUi0G1VsZXDNjfqmXw57DmPi5ASnj/8PGZhAA== - -"@vscode/vsce-sign-win32-arm64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-win32-arm64/-/vsce-sign-win32-arm64-2.0.6.tgz#0688968148e03eb392479c8491c72506721beffc" - integrity sha512-ivM/MiGIY0PJNZBoGtlRBM/xDpwbdlCWomUWuLmIxbi1Cxe/1nooYrEQoaHD8ojVRgzdQEUzMsRbyF5cJJgYOg== - -"@vscode/vsce-sign-win32-x64@2.0.6": - version "2.0.6" - resolved "https://registry.npmjs.org/@vscode/vsce-sign-win32-x64/-/vsce-sign-win32-x64-2.0.6.tgz#74430eff41d26818c23f9826b045d8c75732eaeb" - integrity sha512-mgth9Kvze+u8CruYMmhHw6Zgy3GRX2S+Ed5oSokDEK5vPEwGGKnmuXua9tmFhomeAnhgJnL4DCna3TiNuGrBTQ== - -"@vscode/vsce-sign@^2.1.0": - version "2.1.0" - resolved "https://registry.npmjs.org/@vscode/vsce-sign/-/vsce-sign-2.1.0.tgz#6f97f84853a6d5364836157e2e599e2810cdc121" - integrity sha512-9AQrqazrBgTgRSuwleLVXUrIUphY02/SFCh2TKYoLV/xifJAdblhdmEmw5gUrYSPQ3sRwNs9iyCMD14sATEE6g== +"@vscode/vsce-sign-alpine-arm64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-alpine-arm64/-/vsce-sign-alpine-arm64-2.0.8.tgz#64bfb9a13b42aa7618234b38fa8e918c270e9ddb" + integrity sha512-3HSEDf4R2zhI3/eckZPWBoeFUiLpnG9O0/NBW8xCM3j+Ri0uhmOPvCDuCYsUmIsFVUJETaMu+JMY2DF8v8hNPg== + +"@vscode/vsce-sign-alpine-x64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-alpine-x64/-/vsce-sign-alpine-x64-2.0.8.tgz#8942337cb2717f4716bb7c63e08ce0d8ab060731" + integrity sha512-rHbdV7+esCVn/t8KnbSN9CyMGImAmGnxFb1K9d2uSrt0WNPYfL12FGFekhz2yI8sFhIhyxD+vIKTSp9+kLx+5A== + +"@vscode/vsce-sign-darwin-arm64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-darwin-arm64/-/vsce-sign-darwin-arm64-2.0.8.tgz#b2619eaf64e8e32ef00a3ff2c489de85f7cef160" + integrity sha512-/JSzSLCbXSlc+X7PfmHWnXczFHRmKURCwN1MGmJXjUJlWHgTDpaqjaJNMnBNqruyrbb6LRE/DMXTfRY9iwr4jA== + +"@vscode/vsce-sign-darwin-x64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-darwin-x64/-/vsce-sign-darwin-x64-2.0.8.tgz#7004db234355bbe59a36cad8fa4dd6d4004ce1c2" + integrity sha512-iowH17iKIaAiC6TNGIksLmwtcKOHh/HT/pwKHwPZnuTLvdKWZ/8VOT+MphEt71EcWttohqUXx41SjdiCfUPBiA== + +"@vscode/vsce-sign-linux-arm64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-arm64/-/vsce-sign-linux-arm64-2.0.8.tgz#1290b2fe2416be2df80ec9f4b0851cf643b92656" + integrity sha512-94aBLOVdO6eAOylUsyJ40/BdHtRrHuKAa/29KNOci2QtwUBAH9jTWJLpn1Yv+xjlUOaSjQC8UlAUtjqz/g6FPA== + +"@vscode/vsce-sign-linux-arm@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-arm/-/vsce-sign-linux-arm-2.0.8.tgz#27575ec3ba0ee4075759521ba914873905f920d5" + integrity sha512-SVzcxe2fx+1meLyO745eUiywrRDQIXwK/oZcwTrzYEkoVh4Val4/8CtDHIc5Z3EhHnwVBnqGqsbNwkR44k7rXA== + +"@vscode/vsce-sign-linux-x64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-linux-x64/-/vsce-sign-linux-x64-2.0.8.tgz#d700a378a1e3b191c9858fba1e3f4c5cfe732b66" + integrity sha512-i55pKFRMF1nR94CMcFHbr3VQz7rQ8DFURvUd2Jymcbtv8qzhPX2otIHWzkcmAVr4dQApbYYCvRPjbP+i12ImQQ== + +"@vscode/vsce-sign-win32-arm64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-win32-arm64/-/vsce-sign-win32-arm64-2.0.8.tgz#f0e66e71fb3ff534d3641ac014750973b69089b9" + integrity sha512-2CoVlRNow2XkNboxlfx8hGdKLR2hvyBRg1O8gafx8I4F+scm1MLHdGcYV3+u3jXDsJaiSyDshTO5vPcLjQpVug== + +"@vscode/vsce-sign-win32-x64@2.0.8": + version "2.0.8" + resolved "https://registry.npmjs.org/@vscode/vsce-sign-win32-x64/-/vsce-sign-win32-x64-2.0.8.tgz#d09043ea631ea6394774b57d2cfac0fbfd14aa1b" + integrity sha512-93c+KXIvOsLlNLMEPtQBgJJgn2eaypv3G3+4O9RailUQTh9zL3ul/Fhnqf0O+NKOGKky9d/v+GYWhBwsAjZaww== + +"@vscode/vsce-sign@^2.1.1": + version "2.1.1" + resolved "https://registry.npmjs.org/@vscode/vsce-sign/-/vsce-sign-2.1.1.tgz#57edf12c9f1e34fd33c790da381a410c27c040eb" + integrity sha512-Fm9SrvxonXpmzN0eKHKS/AHb/3Gc19c7SkGfSnhYOGPiLy2o8hJlIzx314IVSH//uEiKaAbE40P47wwFtyDByg== optionalDependencies: - "@vscode/vsce-sign-alpine-arm64" "2.0.6" - "@vscode/vsce-sign-alpine-x64" "2.0.6" - "@vscode/vsce-sign-darwin-arm64" "2.0.6" - "@vscode/vsce-sign-darwin-x64" "2.0.6" - "@vscode/vsce-sign-linux-arm" "2.0.6" - "@vscode/vsce-sign-linux-arm64" "2.0.6" - "@vscode/vsce-sign-linux-x64" "2.0.6" - "@vscode/vsce-sign-win32-arm64" "2.0.6" - "@vscode/vsce-sign-win32-x64" "2.0.6" + "@vscode/vsce-sign-alpine-arm64" "2.0.8" + "@vscode/vsce-sign-alpine-x64" "2.0.8" + "@vscode/vsce-sign-darwin-arm64" "2.0.8" + "@vscode/vsce-sign-darwin-x64" "2.0.8" + "@vscode/vsce-sign-linux-arm" "2.0.8" + "@vscode/vsce-sign-linux-arm64" "2.0.8" + "@vscode/vsce-sign-linux-x64" "2.0.8" + "@vscode/vsce-sign-win32-arm64" "2.0.8" + "@vscode/vsce-sign-win32-x64" "2.0.8" "@vscode/vsce@^4.0.0": - version "4.0.0" - resolved "https://registry.npmjs.org/@vscode/vsce/-/vsce-4.0.0.tgz#122fc4654bb5c7141d2c5eede0bb6e6072402c7a" - integrity sha512-NImwuLaenMmb5D5Jer9/lzi/F9ZQUBOp8Azhj/BVYcTFgixv8KehFXqEUDjQlD2tAiw2E6dDGyjTuAB//di60A== + version "4.1.1" + resolved "https://registry.npmjs.org/@vscode/vsce/-/vsce-4.1.1.tgz#796a1f509ce5f3cf441a6019454f8b9c0889c40b" + integrity sha512-JYw4KtAmePIik4F+sGZo8GAfX6IApSQTBhXb28ivfmbzUoojfJHL9mupjV0E/cckzSdrxdu4jUCj8tKDddV5kQ== dependencies: "@azure/identity" "^4.13.2" "@napi-rs/keyring" "^1.3.0" @@ -894,7 +899,7 @@ "@secretlint/secretlint-rule-preset-recommend" "^10.2.2" "@secretlint/source-creator" "^10.2.2" "@secretlint/types" "^10.2.2" - "@vscode/vsce-sign" "^2.1.0" + "@vscode/vsce-sign" "^2.1.1" azure-devops-node-api "^12.5.0" cockatiel "^3.2.1" commander "^12.1.0" @@ -920,9 +925,9 @@ acorn-jsx@^5.3.2: integrity sha512-rq9s+JNhf0IChjtDXxllJ7g41oZk5SlXtp0LHwyA5cejwn7vKmKp4pPri6YEePv2PU65sAsegbXtIinmDFDXgQ== acorn@^8.16.0: - version "8.18.0" - resolved "https://registry.npmjs.org/acorn/-/acorn-8.18.0.tgz#4faf01b2d6d326bfeed97aea1f52220b5f4c1940" - integrity sha512-lGq+9yr1/GuAWaVYIHRjvvySG5/4VfKIvC8EWxStPdcDh/Ka7FG3twP6v4d5BkravUilhIAsG4Qj83t02LWUPQ== + version "8.19.0" + resolved "https://registry.npmjs.org/acorn/-/acorn-8.19.0.tgz#6b26fd97ce1cc9dc50bdf7ad305e9f1384d4f28a" + integrity sha512-oJlA3XiRm7Cyk6qFD2Jn8ak9B7jSy0qy00ADO3+8dpT0LSjFihQYv4C02LFCSYJV3Q37xYwwRy5m+IpIiUzqWw== adm-zip@^0.6.1: version "0.6.1" @@ -950,9 +955,9 @@ ansi-regex@^5.0.1: integrity sha512-quJQXlTSUGL2LH9SUXo8VwsY4soanhgo6LNSm84E1LBcE8s3O0wpdiRzyR9z/ZZJMlMWv37qOOb9pdJlMUEKFQ== ansi-regex@^6.2.2: - version "6.4.0" - resolved "https://registry.npmjs.org/ansi-regex/-/ansi-regex-6.4.0.tgz#69093d6436d30dbb9b04fe7bdcbcfe16c697d8a1" - integrity sha512-KzTVk2tCWAHtYrvvvaP8bJKJq2pVinhLcGEQdtLIYPbmNGNyYe8QwNaTUYQp2J7/vIsUKt5QCqAfUkYyG9DkOw== + version "6.6.0" + resolved "https://registry.npmjs.org/ansi-regex/-/ansi-regex-6.6.0.tgz#268bc9253164768541ca6bebee112c83be2c67f2" + integrity sha512-XZ5apbzreCbXSKwPjJstu8R0zOi247w3XYwWxtwBXgpZrCyc1Ka7p9/xY0A9/diMewmHbEKz+FIraWaEWjlN5g== ansi-styles@^4.0.0, ansi-styles@^4.1.0: version "4.3.0" @@ -1007,16 +1012,16 @@ boundary@^2.0.0: integrity sha512-rJKn5ooC9u8q13IMCrW0RSp31pxBCHE3y9V/tp3TdWSLf8Em3p6Di4NBpfzbJge9YjjFEsD0RtFEjtvHL5VyEA== brace-expansion@^2.0.1, brace-expansion@^2.0.2: - version "2.1.7" - resolved "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.1.7.tgz#14ea3836731823bb24740225ea43b941b436f9d1" - integrity sha512-uZbew1NqdmPDTMJ8ah1y+b+9QEJrfkXFk3RcTQw3X0jW/xRUvFKsg1CfQdSYGdTbXZWExtU3J3ccxtnfw1Fi0g== + version "2.1.8" + resolved "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.1.8.tgz#b4cf1e18069418e97732d5f30b39bb321c41bd9b" + integrity sha512-BnlDzDYQoplTsZSvPi86CNzmbcb07X8ufR8fk1zivaiEJlXJkiq1MQyDCVmlWcsWbj6aWXqHnrwwevbrm/Saig== dependencies: balanced-match "^1.0.0" -brace-expansion@^5.0.8: - version "5.0.12" - resolved "https://registry.npmjs.org/brace-expansion/-/brace-expansion-5.0.12.tgz#995fbb4750a77c4d16a7dc942ff2ca6ef8e675ec" - integrity sha512-YovQ3rzhaLMIrDjNDMkNS01tea93qhEhG5xy8f6+R0l+dw3Ki+5sCoIoI942iuLZTHWogWktgwVDhU09iNEimQ== +brace-expansion@^5.0.12, brace-expansion@^5.0.8: + version "5.0.13" + resolved "https://registry.npmjs.org/brace-expansion/-/brace-expansion-5.0.13.tgz#e2d4497370f7e385e6f96b57bd7ff11d77d85851" + integrity sha512-Vh3dmFbc4wZeox7M9I/0L9GfFd83Su4+yCck/OF9Gi/P/dAHn0RT7X4K9R7gMNMhDck3DvhR6QXsnQdjjgwNvQ== dependencies: balanced-match "^4.0.2" @@ -1241,7 +1246,7 @@ default-browser-id@^5.0.0: resolved "https://registry.npmjs.org/default-browser-id/-/default-browser-id-5.0.1.tgz#f7a7ccb8f5104bf8e0f71ba3b1ccfa5eafdb21e8" integrity sha512-x1VCxdX4t+8wVfd1so/9w+vQ4vx7lKd2Qp5tDRutErwmR85OgmfX7RlLRMWafRMY7hbEiXIbudNrjOAPa/hL8Q== -default-browser@^5.2.1: +default-browser@^5.5.1: version "5.5.1" resolved "https://registry.npmjs.org/default-browser/-/default-browser-5.5.1.tgz#1790affc52680fbb11e17cab2752d69aa2a37d2c" integrity sha512-m1pAzaJgZ/gssEqlOhJkPJp8Xly7QyW6xcrkUa2KKcDeDSEMP7X8xipU3snUcfisTQx0w1AGae+9UtJSfVnXGw== @@ -1308,17 +1313,17 @@ emoji-regex@^9.2.2: integrity sha512-L18DaJsXSUk2+42pv8mLs5jJT2hqFkFE4j21wOmgbUqsZ2hL72NsUU785g9RXgo3s0ZNgVl42TiHp3ZtOv/Vyg== enhanced-resolve@^5.24.0: - version "5.26.0" - resolved "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.26.0.tgz#9dfb47d050ed6c87f2c6d43b4d7e30f8c0a91ed7" - integrity sha512-9vhedylFonb2YGogzUKX6+Ja72gOJbN1QHAqdrvqLwhdl/QWbKopzoUC9EbQNVsAns/bx/4uyqalrQAoy1IByw== + version "5.27.0" + resolved "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.27.0.tgz#5a5b25b79e79500f3710995c7a50cabe08fdcdb1" + integrity sha512-Do6BB2xzlcc/odFg+XEYyneAx4T/WfywO71yw9ePS2tVfRsf7JVR4mUeELadIeHzixkzbG5DpluiEFPi2WGfYQ== dependencies: graceful-fs "^4.2.4" tapable "^2.3.3" -entities@^8.0.0: - version "8.1.0" - resolved "https://registry.npmjs.org/entities/-/entities-8.1.0.tgz#9632d69619ebdbe0cf0ef22f53088fe5a2163d86" - integrity sha512-kxL7msIffSuh9aaFAMD7rxAIuTRMAHMeBtgHW2yUdWw732ZNh4MehkF2gdjvtdmikkaIP9bFDDJOPlsvm7avrA== +entities@^9.0.0: + version "9.0.0" + resolved "https://registry.npmjs.org/entities/-/entities-9.0.0.tgz#c45df3cdbc5ce805474759f4ec4ea7907d9d5477" + integrity sha512-oJFNDJg3kTPwAD1cNn2+WmUq4wFoo09npc3Ydf1D7ED4smRiWrsKnaLxykrTWgyGEcusc87P5dxlAleol9kpkg== es-define-property@^1.0.1: version "1.0.1" @@ -1400,17 +1405,17 @@ eslint-visitor-keys@^5.0.0, eslint-visitor-keys@^5.0.1: integrity sha512-tD40eHxA35h0PEIZNeIjkHoDR4YjjJp34biM0mDvplBe//mB+IHCqHDGV7pxF+7MklTvighcCPPZC7ynWyjdTA== eslint@^10.11.0: - version "10.11.0" - resolved "https://registry.npmjs.org/eslint/-/eslint-10.11.0.tgz#304d1591b7c6a327e3f64b4f550f99fda160ae20" - integrity sha512-P7a6UEEqb9G95MYAtqkmsTbVXIYyzIfl6NGOIJk162PaahFxFyeGcrlXYFSiagECg4sEm8IseJdZBKR3rx6MsQ== + version "10.15.0" + resolved "https://registry.npmjs.org/eslint/-/eslint-10.15.0.tgz#dd29a7f78bc47cb7107a40acd3350f19c9089435" + integrity sha512-+5Wg4p+ze3sG1WErYgUO/3H1IQIfFBymVUA0Fo/XTeBOLS6UQIUekpSJ8sdRkn7O7wjh84b55w/roqavH2aScg== dependencies: "@eslint-community/eslint-utils" "^4.8.0" "@eslint-community/regexpp" "^4.12.2" - "@eslint/config-array" "^0.23.5" + "@eslint/config-array" "^0.23.6" "@eslint/config-helpers" "^0.7.0" "@eslint/core" "^1.2.1" "@eslint/plugin-kit" "^0.7.3" - "@humanfs/node" "^0.16.6" + "@humanfs/node" "^0.16.8" "@humanwhocodes/module-importer" "^1.0.1" "@humanwhocodes/retry" "^0.4.2" "@types/estree" "^1.0.6" @@ -1431,7 +1436,7 @@ eslint@^10.11.0: imurmurhash "^0.1.4" is-glob "^4.0.0" json-stable-stringify-without-jsonify "^1.0.1" - minimatch "^10.2.5" + minimatch "^11.0.5" natural-compare "^1.4.0" optionator "^0.9.3" @@ -1604,9 +1609,9 @@ glob@^10.4.5: path-scurry "^1.11.1" glob@^13.0.6: - version "13.0.6" - resolved "https://registry.npmjs.org/glob/-/glob-13.0.6.tgz#078666566a425147ccacfbd2e332deb66a2be71d" - integrity sha512-Wjlyrolmm8uDpm/ogGyXZXb1Z+Ca2B8NbJwqBVg0axK9GbBeoS7yGV6vjXnYdGm6X53iehEuxxbyiKp8QmN4Vw== + version "13.0.7" + resolved "https://registry.npmjs.org/glob/-/glob-13.0.7.tgz#6cc3139d83abc42119391aad16274b5e1f3b9e56" + integrity sha512-wfsFgXQ8A3SEI9XGf7Nl3Y9l7ffSrGh7SUCT7vU/2CzYPep9kjxAn1S40F9OPKxAMGCVl7HtNlJhrCJUeUq83g== dependencies: minimatch "^10.2.2" minipass "^7.1.3" @@ -1635,9 +1640,9 @@ got@^13.0.0: responselike "^3.0.0" graceful-fs@^4.2.4: - version "4.2.11" - resolved "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.11.tgz#4183e4e8bf08bb6e05bbb2f7d2e0c8f712ca40e3" - integrity sha512-RbJ5/jmFcNNCcDV5o9eTnBLJ/HszWV0P73bc+Ff4nS/rJj+YaS6IGyiOL0VoBYX+l1Wrl3k63h/KrH+nhJ0XvQ== + version "4.2.12" + resolved "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.12.tgz#7f6162dee07bc600281cea1b038e5f7cf215a6c2" + integrity sha512-iuyGF2E4oafQfPsRrG2wtY2ILupMhvtdrhzrxB+0VcjsPpSPttpfYdjnGFGsTi5MaJFjI1jOKHPQ6UTbTj9TAw== has-flag@^4.0.0: version "4.0.0" @@ -1691,9 +1696,9 @@ html-escaper@^2.0.0: integrity sha512-H2iMtd0I4Mt5eYiapRdIDjp+XzelXQ0tFE4JS7YFwFevXXMmOp9myNrUvCg0D6ws8iqkRPBfKHgbwig1SmlLfg== http-cache-semantics@^4.1.1: - version "4.2.0" - resolved "https://registry.npmjs.org/http-cache-semantics/-/http-cache-semantics-4.2.0.tgz#205f4db64f8562b76a4ff9235aa5279839a09dd5" - integrity sha512-dTxcvPXqPvXBQpq5dUr6mEMJX4oIEFv6bwom3FDwKRDsuIjjJGANqhBuoAn9c1RQJIdAKav33ED65E2ys+87QQ== + version "4.3.0" + resolved "https://registry.npmjs.org/http-cache-semantics/-/http-cache-semantics-4.3.0.tgz#09eead3b16c6d85552857cc3fbd888d8353a2aaf" + integrity sha512-M5t5LlJpS1UHMjvwRQVdFHvPISGeLAxNcrWuJkeGh0KxsqCHZ1O3NXZU/8x7cD0BDcGW8kapxMKTvwlqrNkHkA== http-proxy-agent@^7.0.0, http-proxy-agent@^7.0.2: version "7.0.2" @@ -1704,9 +1709,9 @@ http-proxy-agent@^7.0.0, http-proxy-agent@^7.0.2: debug "^4.3.4" http2-wrapper@^2.1.10: - version "2.2.1" - resolved "https://registry.npmjs.org/http2-wrapper/-/http2-wrapper-2.2.1.tgz#310968153dcdedb160d8b72114363ef5fce1f64a" - integrity sha512-V5nVw1PAOgfI3Lmeaj2Exmeg7fenjhRUgz1lPSezy1CuhPYbgQtbQj4jZfEAEMlaL+vupsvhjqCyjzob0yxsmQ== + version "2.2.4" + resolved "https://registry.npmjs.org/http2-wrapper/-/http2-wrapper-2.2.4.tgz#6aee653365fe19051e970cc466e179929d43cef0" + integrity sha512-y5jx4isTOKEC5Hu1lswc+IxytGlqDmwF1qJtk9qIS8l1KVxuHO5g522UfmErt1H2pMcH/xq+KiFQUB8aVWIABA== dependencies: quick-lru "^5.1.1" resolve-alpn "^1.2.0" @@ -1725,9 +1730,9 @@ ignore@^5.2.0: integrity sha512-hsBTNUqQTDwkWtcdYI2i06Y/nUBEsNEDJKjWdigLvegy8kDuJAS8uRlpkkcQpyEXL0Z/pjDy5HBmMjRCJ2gq+g== ignore@^7.0.5: - version "7.0.10" - resolved "https://registry.npmjs.org/ignore/-/ignore-7.0.10.tgz#c578b9e3624f77e2298876f6516c9ed976c84fdd" - integrity sha512-HpbUakT7xp5miBUywCHf36ZEuAJNklBJDDsGpUIjMzOSmM8ELSfA9Sa/QDPeNeqeoN31u+UTCkL4klCOVvRm4Q== + version "7.0.16" + resolved "https://registry.npmjs.org/ignore/-/ignore-7.0.16.tgz#8c593ab7a7193e663f810203690c9cba851b6d3a" + integrity sha512-52N+Y4HRMOJmbLmr+DqO4iSRyyB7N52gm7PWCT6h0p978+oKbqHCB7gIJIwZvBUsjlSdWbrBFqUSmIFNZMpn0A== immediate@~3.0.5: version "3.0.6" @@ -1766,6 +1771,11 @@ is-glob@^4.0.0, is-glob@^4.0.3: dependencies: is-extglob "^2.1.1" +is-in-ssh@^1.0.0: + version "1.0.0" + resolved "https://registry.npmjs.org/is-in-ssh/-/is-in-ssh-1.0.0.tgz#8eb73c1cabba77748d389588eeea132a63057622" + integrity sha512-jYa6Q9rH90kR1vKB6NM7qqd1mge3Fx4Dhw5TVlK1MUBqhEOuCagrEHMevNuCcbECmXZ0ThXkRm+Ymr51HwEPAw== + is-inside-container@^1.0.0: version "1.0.0" resolved "https://registry.npmjs.org/is-inside-container/-/is-inside-container-1.0.0.tgz#e81fba699662eb31dbdaf26766a61d4814717ea4" @@ -2047,9 +2057,9 @@ make-dir@^4.0.0: semver "^7.5.3" marked@^18.0.11: - version "18.0.14" - resolved "https://registry.npmjs.org/marked/-/marked-18.0.14.tgz#90c0ed46b3f9f1e99d8d96cc8b06937884adedc5" - integrity sha512-mBHK6FBHuBAlhgRe88w9F0O1AbwwXJUcQibUbC/QcdTbVGAD7aWza+xt3N6oT/jCZx3/OMeS+8rnuiHZcQ9s7A== + version "18.2.1" + resolved "https://registry.npmjs.org/marked/-/marked-18.2.1.tgz#636e42a4418333a26356285033dec8b344487f48" + integrity sha512-ii4bxCTCqqwpT86XZWgJNs+ZnAIZksmLGYMViWA7PDIXYIeNo1x6cDdX3JOip9NM/cI6p8z57FxliACboTruMA== math-intrinsics@^1.1.0: version "1.1.0" @@ -2076,13 +2086,21 @@ mimic-response@^4.0.0: resolved "https://registry.npmjs.org/mimic-response/-/mimic-response-4.0.0.tgz#35468b19e7c75d10f5165ea25e75a5ceea7cf70f" integrity sha512-e5ISH9xMYU0DzrT+jl8q2ze9D6eWBto+I8CNpe+VI+K2J/F/k3PdkdTdz4wvGVH4NTpo+NRYTVIuMQEMMcsLqg== -minimatch@^10.2.2, minimatch@^10.2.4, minimatch@^10.2.5, minimatch@^10.2.6: +minimatch@^10.2.2, minimatch@^10.2.5, minimatch@^10.2.6: version "10.2.6" resolved "https://registry.npmjs.org/minimatch/-/minimatch-10.2.6.tgz#fd956bbe0b77241e9f15ac5dccb1c638060968ef" integrity sha512-vpLQEs+VLCr1nU0BXS07maYoFwlDAH0gngQuuttxIwutDFEMHq2blX+8vpgxDdK3J1PwjCJiep77OitTZ4Ll1A== dependencies: brace-expansion "^5.0.8" +minimatch@^11.0.1, minimatch@^11.0.5: + version "11.0.9" + resolved "https://registry.npmjs.org/minimatch/-/minimatch-11.0.9.tgz#00d0088671fa0d872ba1e2578f5abf3be0fe878e" + integrity sha512-KCFkfyjqerNlSstjlhIGNXIKZGA/6O4V4RlhZ+Dsr621SPPw0mzlypE9D9ZOoPiVefHID+j7/XuMMlqfD/F60Q== + dependencies: + "@isaacs/nonrecursive-glob-match" "^1.1.0" + brace-expansion "^5.0.12" + minimatch@^5.1.0: version "5.1.9" resolved "https://registry.npmjs.org/minimatch/-/minimatch-5.1.9.tgz#1293ef15db0098b394540e8f9f744f9fda8dee4b" @@ -2168,15 +2186,17 @@ onetime@^7.0.0: dependencies: mimic-function "^5.0.0" -open@^10.1.0: - version "10.2.0" - resolved "https://registry.npmjs.org/open/-/open-10.2.0.tgz#b9d855be007620e80b6fb05fac98141fe62db73c" - integrity sha512-YgBpdJHPyQ2UE5x+hlSXcnejzAvD0b22U2OuAP+8OnlJT+PjWPxtgmGqKKc+RgTM63U9gN0YzrYc71R2WT/hTA== +open@^11.0.0: + version "11.0.4" + resolved "https://registry.npmjs.org/open/-/open-11.0.4.tgz#10d20dfdb558c71e5149b2d789ad6995caf697ca" + integrity sha512-++Zlftm0kVLPmzC06t6epuWmcRMDbI4z5P3NNX979WA/k23+NtSOynEGzsVfZwguKw2mi5umVgnBlJQMwRz4Pg== dependencies: - default-browser "^5.2.1" + default-browser "^5.5.1" define-lazy-prop "^3.0.0" + is-in-ssh "^1.0.0" is-inside-container "^1.0.0" - wsl-utils "^0.1.0" + powershell-utils "^0.2.1" + wsl-utils "^1.0.0" optionator@^0.9.3: version "0.9.4" @@ -2235,11 +2255,11 @@ pako@~1.0.2: integrity sha512-4hLB8Py4zZce5s4yd9XzopqwVv/yGNhV1Bl8NTmCq1763HeK2+EwVTv+leGeL13Dnh2wfbqowVPXCIO0z4taYw== parse5@^8.0.1: - version "8.0.1" - resolved "https://registry.npmjs.org/parse5/-/parse5-8.0.1.tgz#f43bcd2cd683efe084075333e9ce0da7d06da31e" - integrity sha512-z1e/HMG90obSGeidlli3hj7cbocou0/wa5HacvI3ASx34PecNjNQeaHNo5WIZpWofN9kgkqV1q5YvXe3F0FoPw== + version "8.1.1" + resolved "https://registry.npmjs.org/parse5/-/parse5-8.1.1.tgz#d73eb52282024c921e9c5a19b870f53492e631b2" + integrity sha512-EcR/6WDcU7b2N3vQSxKALCk9lXGtUMQxXio008OEMBE0kavu/7JLfBEeFPzi43nMqVDSbEn3QCK+BMCc9zO//w== dependencies: - entities "^8.0.0" + entities "^9.0.0" path-exists@^4.0.0: version "4.0.0" @@ -2282,6 +2302,11 @@ picomatch@^4.0.4: resolved "https://registry.npmjs.org/picomatch/-/picomatch-4.0.7.tgz#6313360034ccb36b3dc61ecbdff78121f90fe21f" integrity sha512-qcJu88Q2IWqJsDD529JKMdwGm/dvInW4HvQnRwiH9JtihJvzGOscDtHE3x1pBKeUOTysQ8kVmLnJ2kJu7yhcGA== +powershell-utils@^0.2.0, powershell-utils@^0.2.1: + version "0.2.1" + resolved "https://registry.npmjs.org/powershell-utils/-/powershell-utils-0.2.1.tgz#0853016f5b3c12d52b9571c8fe8059677d9ddbe2" + integrity sha512-C+y9x90UElAddDZmV4qOx9W53B61PO7cIqWz2dQsWlwswuq4mr8NEwytdGKboYbQlGZ3awrkTeNvcZiZNHnQ8A== + prelude-ls@^1.2.1: version "1.2.1" resolved "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz#debc6489d7a6e6b0e7611888cec880337d316396" @@ -2314,9 +2339,9 @@ qified@^0.10.1: hookified "^2.1.1" qs@^6.9.1: - version "6.16.0" - resolved "https://registry.npmjs.org/qs/-/qs-6.16.0.tgz#c22c723a28a920f3aacdce8289fabd43eccb79fd" - integrity sha512-h6fhOIaRrID2CbEY2fqs+7t+UXZo+MLAnU5gRIq85uFtdiUPCdsApMlHhXogKVM4HM2DVbIjGNTTYH2OcmP1vA== + version "6.17.1" + resolved "https://registry.npmjs.org/qs/-/qs-6.17.1.tgz#43ac71d29ca0e9d0eed16a218e35b6cde5628e81" + integrity sha512-jd3COkaKVgGUW+ZHyEHCG9bH7RoaaiWuMgzsIBjUMVjLAaWGWpoUAVwljVvBHxRu/2qEHnadLGZrkutYUBPQJA== dependencies: es-define-property "^1.0.1" side-channel "^1.1.1" @@ -2414,9 +2439,9 @@ sax@>=0.6.0: integrity sha512-42tBVwLWnaQvW5zc4HbZrTuWccECCZfBi92FDuwtqxasH+JbPB3/FOKb1m222K42R4WxuxzzMsTswfzgtSu64Q== semver@^7.3.7, semver@^7.5.3, semver@^7.5.4, semver@^7.6.2, semver@^7.7.3, semver@^7.8.5: - version "7.8.5" - resolved "https://registry.npmjs.org/semver/-/semver-7.8.5.tgz#39b646037dd50c14fb451e7e4cac58ed8b863f69" - integrity sha512-Y7/KDsb8LjooZpwaqGyulO6DQlksgCncchHGk+sZIY4SBvUocMBEFH5Ur1fI4dV+Jvl0w6cjvucaIi40puRioA== + version "7.8.6" + resolved "https://registry.npmjs.org/semver/-/semver-7.8.6.tgz#67c0cda133a3ceb6f70b803e67625bf969000424" + integrity sha512-9lpSSU4Mly3mrtruwLs1eLK6+gzbzqeBFwRNjIjE+9LuDpWdYctrQlQ3ej1Ilgi7gknpsTRnPoLP8DpCHqHIJw== serialize-javascript@^6.0.2: version "6.0.2" @@ -2601,14 +2626,14 @@ supports-color@^8.1.1: has-flag "^4.0.0" tapable@^2.3.3: - version "2.3.3" - resolved "https://registry.npmjs.org/tapable/-/tapable-2.3.3.tgz#5da7c9992c46038221267985ab28421a8879f160" - integrity sha512-uxc/zpqFg6x7C8vOE7lh6Lbda8eEL9zmVm/PLeTPBRhh1xCgdWaQ+J1CUieGpIfm2HdtsUpRv+HshiasBMcc6A== + version "2.3.4" + resolved "https://registry.npmjs.org/tapable/-/tapable-2.3.4.tgz#c05c277006ccba52e04e1bbddff2e189ee48fca8" + integrity sha512-NHFiWnAbMJxNNpBwiO7jJVGDuqMxT9/oV8v57RR+fgBQShkJil5inGD8/xWy0hjLyHQyX1tu27QANhlz3KBqCg== tar@^7.5.22: - version "7.5.22" - resolved "https://registry.npmjs.org/tar/-/tar-7.5.22.tgz#a696f998136e71487dc3f869a85bba2c67971ba9" - integrity sha512-MFO/QzvtAOmJbkhOaCTvbGcFN9L9b+JunIsDwaKljSOdcLMea3NJ1k9Usz/rjdfSXTq4dfzfeS7W4p4YOAAHeA== + version "7.5.23" + resolved "https://registry.npmjs.org/tar/-/tar-7.5.23.tgz#5ff22a2b3bb122b4c412b81cb54102a80d153e80" + integrity sha512-lkukzdoGngZHJZXxW4S/E4Fp9ghTDlyZXrQGRNoJ/LXvDKcXUTq2sg5yQe74po7Voea6n/IN09+wE/QvJMiifA== dependencies: "@isaacs/fs-minipass" "^4.0.0" chownr "^3.0.0" @@ -2646,9 +2671,9 @@ ts-api-utils@^2.5.0: integrity sha512-OJ/ibxhPlqrMM0UiNHJ/0CKQkoKF243/AEmplt3qpRgkW8VG7IfOS41h7V8TjITqdByHzrjcS/2si+y4lIh8NA== tslib@^2.2.0, tslib@^2.6.2: - version "2.8.1" - resolved "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz#612efe4ed235d567e8aba5f2a5fab70280ade83f" - integrity sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w== + version "2.9.1" + resolved "https://registry.npmjs.org/tslib/-/tslib-2.9.1.tgz#8986213ba2f17f38ba39a7c43d0e565a9134ff5f" + integrity sha512-a4Ux9VKuIMHsOS7ENbEq6hK2ZGYIT27Rtl0E4eD9KqwxhKiQeMZE/9xb3IdYwWaSOyIBQLExhQgXDTYoiCxnWA== tunnel@0.0.6: version "0.0.6" @@ -2672,14 +2697,14 @@ typed-rest-client@^1.8.11, typed-rest-client@^1.8.4: underscore "^1.12.1" typescript-eslint@^8.71.0: - version "8.71.0" - resolved "https://registry.npmjs.org/typescript-eslint/-/typescript-eslint-8.71.0.tgz#4d7d8e9939bc12f20690ebf99367b50a02f9ece9" - integrity sha512-fBdHYiqQ14RW6mOMXD14Svn82ZsCYAoQSzGRzyEjR59S5A2Krh/l7fGTOQ7iCr8gGy/mHVXtEF7s5fgjEdV0Pw== + version "8.73.0" + resolved "https://registry.npmjs.org/typescript-eslint/-/typescript-eslint-8.73.0.tgz#c67e54120e95b5246775e704b025ef4dbe04cdbb" + integrity sha512-+EnKy9rkYPun4l+kG2bDuYWQ6y1tGVgdR/tY1U9AC6h21CjEwOoc7gsjwe0FXB8uWFzk4QiCFbuRWgX758PiAg== dependencies: - "@typescript-eslint/eslint-plugin" "8.71.0" - "@typescript-eslint/parser" "8.71.0" - "@typescript-eslint/typescript-estree" "8.71.0" - "@typescript-eslint/utils" "8.71.0" + "@typescript-eslint/eslint-plugin" "8.73.0" + "@typescript-eslint/parser" "8.73.0" + "@typescript-eslint/typescript-estree" "8.73.0" + "@typescript-eslint/utils" "8.73.0" typescript@^6.0.3: version "6.0.3" @@ -2822,12 +2847,13 @@ wrap-ansi@^9.0.0: string-width "^7.0.0" strip-ansi "^7.1.0" -wsl-utils@^0.1.0: - version "0.1.0" - resolved "https://registry.npmjs.org/wsl-utils/-/wsl-utils-0.1.0.tgz#8783d4df671d4d50365be2ee4c71917a0557baab" - integrity sha512-h3Fbisa2nKGPxCpm89Hk33lBLsnaGBvctQopaBSOW/uIs6FTe1ATyAnKFJrzVs9vpGdsTe73WF3V4lIsk4Gacw== +wsl-utils@^1.0.0: + version "1.0.1" + resolved "https://registry.npmjs.org/wsl-utils/-/wsl-utils-1.0.1.tgz#7caaa5a713e5ed1b625e7ee95e505c53c2e41c80" + integrity sha512-c16PKLIRxBYpR3jSWsdS7SFp0COm5SOQdiFjY818dYFHJbMGuLBszpF07LBWmOS1uzrHa9VGdynsEgoeKy0oOQ== dependencies: is-wsl "^3.1.0" + powershell-utils "^0.2.0" xml2js@^0.5.0: version "0.5.0" diff --git a/z3rro/Cargo.toml b/z3rro/Cargo.toml index a70af675..ce57e526 100644 --- a/z3rro/Cargo.toml +++ b/z3rro/Cargo.toml @@ -13,8 +13,8 @@ tracing = "0.1" tempfile = "3.3" thiserror = "2.0" im-rc = "15" -enum-map = "2.7.3" -itertools = "0.14.0" +enum-map = "3.1.0" +itertools = "0.15.0" indexmap = "2.11.0" [features] From 9e3651692f9219c524c0cd0193e80b71d6b9d5d1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 15:03:59 +0100 Subject: [PATCH 25/32] opt: preserve division by zero --- src/opt/constfold.rs | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/src/opt/constfold.rs b/src/opt/constfold.rs index ae31a4ce..31410f89 100644 --- a/src/opt/constfold.rs +++ b/src/opt/constfold.rs @@ -56,9 +56,7 @@ impl VisitorMut for ConstFold { } } BinOpKind::Div => { - if is_zero_lit(lhs) { - *e = builder.zero_lit(e.ty.as_ref().unwrap()); - } else if is_one_lit(rhs) { + if is_one_lit(rhs) { *e = lhs.clone(); } } From cf59e78ba5218943a40a40f1a65439ddc3a7af55 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 15:03:59 +0100 Subject: [PATCH 26/32] ast: fix Real zero literals --- src/ast/expr.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/ast/expr.rs b/src/ast/expr.rs index 5c785b27..b0dc69fb 100644 --- a/src/ast/expr.rs +++ b/src/ast/expr.rs @@ -608,7 +608,7 @@ impl ExprBuilder { match ty { TyKind::Bool | TyKind::UInt | TyKind::UReal | TyKind::EUReal => self.bot_lit(ty), TyKind::Int => self.cast(TyKind::Int, self.uint(0)), - TyKind::Real => self.cast(TyKind::Real, self.frac_lit(Zero::zero())), + TyKind::Real => self.cast(TyKind::Real, self.uint(0)), _ => panic!("type {ty} has no zero element"), } } From 146917c7f936f37052a2418cd5c90d6c1b87237d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Philipp=20Schro=CC=88er?= Date: Wed, 18 Nov 2026 15:29:53 +0100 Subject: [PATCH 27/32] website: soften reading backgrounds --- website/docs/heyvl/statements.module.css | 4 ++-- website/src/css/custom.css | 9 +++++++++ website/src/css/docs.css | 4 ++++ website/src/pages/about.js | 4 ++-- website/src/pages/about.module.css | 4 ++++ 5 files changed, 21 insertions(+), 4 deletions(-) diff --git a/website/docs/heyvl/statements.module.css b/website/docs/heyvl/statements.module.css index 2e082716..52134fa4 100644 --- a/website/docs/heyvl/statements.module.css +++ b/website/docs/heyvl/statements.module.css @@ -47,7 +47,7 @@ } .syntax { - --syntax-background: #e6f5ec; + --syntax-background: #f5f7f5; --syntax-border: #a7d2ba; display: grid; grid-template-columns: minmax(0, 1fr) minmax(15rem, 0.9fr); @@ -61,7 +61,7 @@ } [data-theme='dark'] .syntax { - --syntax-background: #143c2e; + --syntax-background: #282c2a; --syntax-border: #327859; } diff --git a/website/src/css/custom.css b/website/src/css/custom.css index 520a5866..b1ec092b 100644 --- a/website/src/css/custom.css +++ b/website/src/css/custom.css @@ -22,6 +22,8 @@ --caesar-surface-tint: #e9f1ec; --caesar-surface-navigation: #f2f6f3; + --caesar-surface-reading: #fdfcfb; + --caesar-surface-doc-sidebar: #f7f8f6; --caesar-surface-active: #e9f1ec; --caesar-surface-hover: #f2f6f3; --caesar-surface-footer: #233c33; @@ -58,10 +60,17 @@ --caesar-surface-tint: #1b2722; --caesar-surface-navigation: #202a25; + --caesar-surface-reading: #222323; + --caesar-surface-doc-sidebar: #282a29; --caesar-surface-active: #2c4036; --caesar-surface-hover: #24362d; } +.plugin-docs .theme-layout-main, +.plugin-blog .theme-layout-main { + background-color: var(--caesar-surface-reading); +} + .footer--dark { --ifm-footer-background-color: var(--caesar-surface-footer); --ifm-footer-link-hover-color: var(--caesar-footer-link-hover); diff --git a/website/src/css/docs.css b/website/src/css/docs.css index 632f1318..131c8395 100644 --- a/website/src/css/docs.css +++ b/website/src/css/docs.css @@ -4,6 +4,10 @@ --caesar-docs-code-width: var(--caesar-docs-reading-width); } +.theme-doc-sidebar-container { + background-color: var(--caesar-surface-doc-sidebar); +} + article:has(> .theme-doc-markdown) { container-type: inline-size; } diff --git a/website/src/pages/about.js b/website/src/pages/about.js index 83c9fad5..d6ccb6ad 100644 --- a/website/src/pages/about.js +++ b/website/src/pages/about.js @@ -8,8 +8,8 @@ import styles from './about.module.css'; export default function About() { return ( - -