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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#[crate::check_module(crate)]
#[declare_types(usize)]
#[allow(dead_code)]
mod rvn {
enum Test<T> {
Yes(T),
No,
}
fn testy_test1<X: Clone + PartialEq>(x1: X, x2: X) -> X {
let maybe = Test::<X>::Yes(x1);
match maybe {
Test::<X>::Yes(x) => x,
Test::<X>::No => x2,
}
}
fn testy_test2<X: Clone + PartialEq>(x1: X, x2: X) -> X {
let maybe = Test::<X>::Yes(x1);
match maybe {
Test::Yes(x) => x,
Test::No => x2,
}
}
#[define]
enum OptUsize {
Some(usize),
None,
}
#[define]
enum Opt<T> {
Some(T),
None,
}
#[define]
#[recursive]
enum List<T> {
Cons(T, Box<List<T>>),
Nil,
}
#[falsify]
fn oops() -> bool { false }
// We must avoid the two following items for now, since we don't
// currently support tuples as arguments to enum constructors.
// #[verify]
// fn no_quantify_true() -> bool {
// let maybe_x = Opt::<(bool,bool)>::Some((true, false));
// match maybe_x {
// Opt::<(bool,bool)>::Some(x) => {
// let (t,f) = x;
// t && !f
// }
// Opt::<(bool,bool)>::None => false,
// }
// }
// #[falsify]
// fn no_quantify_false() -> bool {
// let maybe_x = Opt::<(bool,bool)>::Some((true, false));
// match maybe_x {
// Opt::<(bool,bool)>::Some(x) => {
// let (t,f) = x;
// !(t && !f)
// }
// Opt::<(bool,bool)>::None => true,
// }
// }
#[verify]
fn construct_deconstruct_v<X: Clone + PartialEq>() -> bool {
forall(|x: X| {
let maybe_x = Opt::<X>::Some(x.clone());
match maybe_x {
Opt::<X>::Some(y) => y == x,
Opt::<X>::None => false,
}
})
}
#[falsify]
fn construct_deconstruct_f1<X: PartialEq>() -> bool {
forall(|x: X| {
let maybe_x = Opt::<X>::Some(x);
match maybe_x {
Opt::<X>::Some(y) => y != x,
Opt::<X>::None => false,
}
})
}
#[falsify]
fn construct_deconstruct_f2<X: PartialEq>() -> bool {
forall(|x: X| {
let maybe_x = Opt::<X>::Some(x);
match maybe_x {
Opt::<X>::Some(y) => false,
Opt::<X>::None => true,
}
})
}
#[verify]
fn symbolic1() -> bool {
forall(|l1: List<usize>| {
match l1 {
List::<usize>::Cons(n, tail) => n == n,
List::<usize>::Nil => true,
}
})
}
#[falsify]
fn symbolic2() -> bool {
forall(|l1: List<usize>, l2: List<usize>| {
match l1 {
List::<usize>::Cons(n, tail) => n == n && tail == l2,
List::<usize>::Nil => true,
}
})
}
#[falsify]
fn symbolic3() -> bool {
forall(|l1: List<usize>| {
match l1 {
List::<usize>::Cons(n, tail) => {
match l1 {
List::<usize>::Cons(n, tail) => true,
List::<usize>::Nil => true,
}
}
List::<usize>::Nil => false,
}
})
}
#[verify]
fn unique1() -> bool {
let l1 = List::<usize>::Nil;
let l2 = List::<usize>::Nil;
l1 == l2
}
#[verify]
fn unique2() -> bool {
forall(|n: usize| {
List::<usize>::Cons(n, List::<usize>::Nil)
== List::<usize>::Cons(n, List::<usize>::Nil)
})
}
#[verify]
fn unique3() -> bool {
forall(|n: usize, l: List<usize>| {
List::<usize>::Cons(n, l)
== List::<usize>::Cons(n, l)
})
}
}