File size: 758 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
use vstd::prelude::*;
fn main() {}
verus!{



fn f1_smallest_num(nums: &Vec<i32>) -> (min: i32)
    requires
        nums.len() > 0,
{
    let mut min = nums[0];
    let mut index = 1;

    while index < nums.len()
    {
        if nums[index] < min {
            min = nums[index];
        }
        index += 1;
    }
    min
}



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

fn chain_driver(nums: &Vec<i32>) -> (r_final: i32)
    requires
        nums.len() > 0,
    ensures
        step1(nums@, r_final),
{
    let x1 = f1_smallest_num(nums);
    proof {
        assert(step1(nums@, x1));
    }
    x1
}

} // verus!