Datasets:
File size: 1,332 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_element_wise_division(arr1: &Vec<u32>, arr2: &Vec<u32>) -> (result: Vec<u32>)
requires
arr1.len() == arr2.len(),
forall|i: int| 0 <= i < arr2.len() ==> arr2[i] != 0,
forall|m: int|
0 <= m < arr1.len() ==> (u32::MIN <= #[trigger] arr1[m] / #[trigger] arr2[m]
<= u32::MAX),
{
let mut output_arr = Vec::with_capacity(arr1.len());
let mut index = 0;
while index < arr1.len()
{
output_arr.push((arr1[index] / arr2[index]));
index += 1;
}
output_arr
}
spec fn step1(__hp0: Seq<u32>, __hp1: Seq<u32>, outp: Seq<u32>) -> bool {
(outp.len() == __hp0.len())
&& (forall|i: int|
0 <= i < outp.len() ==> #[trigger] outp[i] == #[trigger] (__hp0[i] / __hp1[i]))
}
fn chain_driver(arr1: &Vec<u32>, arr2: &Vec<u32>) -> (r_final: Vec<u32>)
requires
arr1.len() == arr2.len(),
forall|i: int| 0 <= i < arr2.len() ==> arr2[i] != 0,
forall|m: int|
0 <= m < arr1.len() ==> (u32::MIN <= #[trigger] arr1[m] / #[trigger] arr2[m]
<= u32::MAX),
ensures
step1(arr1@, arr2@, r_final@),
{
let x1 = f1_element_wise_division(arr1, arr2);
proof {
assert(step1(arr1@, arr2@, x1@));
}
x1
}
} // verus!
|