Datasets:
File size: 2,037 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 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_split_and_append(list: &Vec<i32>, n: usize) -> (new_list: Vec<i32>)
requires
list@.len() > 0,
0 < n < list@.len(),
{
let mut new_list = Vec::new();
let mut index = n;
while index < list.len()
{
new_list.push(list[index]);
index += 1;
}
let mut index = 0;
while index < n
{
new_list.push(list[index]);
index += 1;
}
new_list
}
fn f2_find_negative_numbers(arr: &Vec<i32>) -> (negative_list: Vec<i32>)
{
let mut negative_list: Vec<i32> = Vec::new();
let input_len = arr.len();
let mut index = 0;
while index < arr.len()
{
if (arr[index] < 0) {
negative_list.push(arr[index]);
}
index += 1;
}
negative_list
}
fn f3_is_greater(arr: &Vec<i32>, number: i32) -> (result: bool)
{
let mut i = 0;
while i < arr.len()
{
if number <= arr[i] {
return false;
}
i += 1;
}
true
}
spec fn step1(__hp0: Seq<i32>, __hp1: usize, outp: Seq<i32>) -> bool {
(outp == __hp0.subrange(__hp1 as int, __hp0.len() as int).add(__hp0.subrange(0, __hp1 as int)))
}
spec fn step2(inp: Seq<i32>, outp: Seq<i32>) -> bool {
(outp == inp.filter(|x: i32| x < 0))
}
spec fn step3(inp: Seq<i32>, p3_number: i32, outp: bool) -> bool {
(outp == (forall|i: int| 0 <= i < inp.len() ==> p3_number > inp[i]))
}
fn chain_driver(list: &Vec<i32>, n: usize, p3_number: i32) -> (r_final: bool)
requires
list@.len() > 0,
0 < n < list@.len(),
ensures
exists|v1: Seq<i32>, v2: Seq<i32>| #[trigger] step1(list@, n, v1) && #[trigger] step2(v1, v2) && step3(v2, p3_number, r_final),
{
let x1 = f1_split_and_append(list, n);
let x2 = f2_find_negative_numbers(&x1);
let x3 = f3_is_greater(&x2, p3_number);
proof {
assert(step1(list@, n, x1@));
assert(step2(x1@, x2@));
assert(step3(x2@, p3_number, x3));
}
x3
}
} // verus!
|