use vstd::prelude::*;
fn main() {}
verus!{



fn f1_bit_wise_xor(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (result: Vec<i32>)
    requires
        arr1.len() == arr2.len(),
{
    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
}





fn f2_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 f2_shared_elements(list1: &Vec<i32>, list2: &Vec<i32>) -> (shared: Vec<i32>)
{
    let mut shared = Vec::new();

    let mut index = 0;
    while index < list1.len()
    {
        if (f2_contains(list2, list1[index]) && !f2_contains(&shared, list1[index])) {
            shared.push(list1[index]);
            
        }
        index += 1
    }
    shared
}



spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, outp: Seq<i32>) -> bool {
    (outp.len() == __hp0.len())
    && (forall|i: int|
            0 <= i < outp.len() ==> outp[i] == #[trigger] __hp0[i] ^ #[trigger] __hp1[i])
}

spec fn step2(inp: Seq<i32>, p2_key: i32, outp: bool) -> bool {
    (outp == (exists|i: int| 0 <= i < inp.len() && (inp[i] == p2_key)))
}

fn chain_driver(arr1: &Vec<i32>, arr2: &Vec<i32>, p2_key: i32) -> (r_final: bool)
    requires
        arr1.len() == arr2.len(),
    ensures
        exists|v1: Seq<i32>| #[trigger] step1(arr1@, arr2@, v1) && step2(v1, p2_key, r_final),
{
    let x1 = f1_bit_wise_xor(arr1, arr2);
    let x2 = f2_contains(&x1, p2_key);
    proof {
        assert(step1(arr1@, arr2@, x1@));
        assert(step2(x1@, p2_key, x2));
    }
    x2
}

} // verus!