Datasets:
File size: 1,879 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_cube_element(nums: &Vec<i32>) -> (cubed: Vec<i32>)
requires
forall|k: int|
0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
<= i32::MAX),
forall|k: int|
0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
* #[trigger] nums[k] <= i32::MAX),
{
let mut cubed_array: Vec<i32> = Vec::new();
let mut i = 0;
while i < nums.len()
{
cubed_array.push(nums[i] * nums[i] * nums[i]);
i += 1;
}
cubed_array
}
fn f2_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>, outp: Seq<i32>) -> bool {
(forall|i: int|
0 <= i < __hp0.len() ==> outp[i] == #[trigger] __hp0[i] * #[trigger] __hp0[i]
* #[trigger] __hp0[i])
}
spec fn step2(inp: Seq<i32>, p2_number: i32, outp: bool) -> bool {
(outp == (forall|i: int| 0 <= i < inp.len() ==> p2_number > inp[i]))
}
fn chain_driver(nums: &Vec<i32>, p2_number: i32) -> (r_final: bool)
requires
forall|k: int|
0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
<= i32::MAX),
forall|k: int|
0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
* #[trigger] nums[k] <= i32::MAX),
ensures
exists|v1: Seq<i32>| #[trigger] step1(nums@, v1) && step2(v1, p2_number, r_final),
{
let x1 = f1_cube_element(nums);
let x2 = f2_is_greater(&x1, p2_number);
proof {
assert(step1(nums@, x1@));
assert(step2(x1@, p2_number, x2));
}
x2
}
} // verus!
|