Datasets:
File size: 1,196 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_contains(arr: &Vec<i32>, key: i32) -> (result: bool)
{
let mut i = 0;
while i < arr.len()
{
if (arr[i] == key) {
return true;
}
i += 1;
}
false
}
fn f1_intersection(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (result: Vec<i32>)
{
let mut output_arr = Vec::new();
let mut index = 0;
while index < arr1.len()
{
if (f1_contains(arr2, arr1[index]) && !f1_contains(&output_arr, arr1[index])) {
output_arr.push(arr1[index]);
}
index += 1;
}
output_arr
}
spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, outp: Seq<i32>) -> bool {
(forall|i: int|
0 <= i < outp.len() ==> (__hp0.contains(#[trigger] outp[i]) && __hp1.contains(
#[trigger] outp[i],
)))
&& (forall|i: int, j: int| 0 <= i < j < outp.len() ==> outp[i] != outp[j])
}
fn chain_driver(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (r_final: Vec<i32>)
ensures
step1(arr1@, arr2@, r_final@),
{
let x1 = f1_intersection(arr1, arr2);
proof {
assert(step1(arr1@, arr2@, x1@));
}
x1
}
} // verus!
|