Datasets:
File size: 1,000 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_reverse_to_k(list: &Vec<i32>, n: usize) -> (reversed_list: Vec<i32>)
requires
list@.len() > 0,
0 < n < list@.len(),
{
let mut reversed_list = Vec::new();
let mut index = 0;
while index < n
{
reversed_list.push(list[n - 1 - index]);
index += 1;
}
index = n;
while index < list.len()
{
reversed_list.push(list[index]);
index += 1;
}
reversed_list
}
spec fn step1(__hp0: Seq<i32>, __hp1: usize, outp: Seq<i32>) -> bool {
(outp == __hp0.subrange(0, __hp1 as int).reverse().add(
__hp0.subrange(__hp1 as int, __hp0.len() as int),
))
}
fn chain_driver(list: &Vec<i32>, n: usize) -> (r_final: Vec<i32>)
requires
list@.len() > 0,
0 < n < list@.len(),
ensures
step1(list@, n, r_final@),
{
let x1 = f1_reverse_to_k(list, n);
proof {
assert(step1(list@, n, x1@));
}
x1
}
} // verus!
|