Datasets:
File size: 954 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_contains_consecutive_numbers(arr: &Vec<i32>) -> (is_consecutive: bool)
requires
arr.len() > 0,
forall|i: int| 0 <= i < arr.len() ==> (0 <= #[trigger] arr[i] + 1 < i32::MAX),
{
let mut index = 0;
while (index < arr.len() - 1)
{
if (arr[index] + 1 != arr[index + 1]) {
return false;
}
index += 1;
}
true
}
spec fn step1(__hp0: Seq<i32>, outp: bool) -> bool {
(outp == (forall|i: int, j: int|
0 <= i < j < __hp0.len() && j == i + 1 ==> (__hp0[i] + 1 == __hp0[j])))
}
fn chain_driver(arr: &Vec<i32>) -> (r_final: bool)
requires
arr.len() > 0,
forall|i: int| 0 <= i < arr.len() ==> (0 <= #[trigger] arr[i] + 1 < i32::MAX),
ensures
step1(arr@, r_final),
{
let x1 = f1_contains_consecutive_numbers(arr);
proof {
assert(step1(arr@, x1));
}
x1
}
} // verus!
|