Datasets:
File size: 1,340 Bytes
c62beea | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_is_sub_list_at_index(main: &Vec<i32>, sub: &Vec<i32>, idx: usize) -> (result: bool)
requires
sub.len() <= main.len(),
0 <= idx <= (main.len() - sub.len()),
{
let mut i = 0;
while i < sub.len()
{
if (main[idx + i] != sub[i]) {
return false;
}
i += 1;
}
true
}
fn f1_is_sub_list(main: &Vec<i32>, sub: &Vec<i32>) -> (result: bool)
requires
sub.len() <= main.len(),
{
if sub.len() > main.len() {
return false;
}
let mut index = 0;
while index <= (main.len() - sub.len())
{
if (f1_is_sub_list_at_index(&main, &sub, index)) {
return true;
}
index += 1;
}
false
}
spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, outp: bool) -> bool {
(outp == (exists|k: int, l: int|
0 <= k <= (__hp0.len() - __hp1.len()) && l == k + __hp1.len() && (#[trigger] (__hp0.subrange(
k,
l,
))) =~= __hp1))
}
fn chain_driver(main: &Vec<i32>, sub: &Vec<i32>) -> (r_final: bool)
requires
sub.len() <= main.len(),
ensures
step1(main@, sub@, r_final),
{
let x1 = f1_is_sub_list(main, sub);
proof {
assert(step1(main@, sub@, x1));
}
x1
}
} // verus!
|