Datasets:
File size: 1,359 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 | 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
}
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])
}
fn chain_driver(nums: &Vec<i32>) -> (r_final: 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),
ensures
step1(nums@, r_final@),
{
let x1 = f1_cube_element(nums);
proof {
assert(step1(nums@, x1@));
}
x1
}
} // verus!
|