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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
//! See <https://medium.com/@carlmkadie/check-ai-generated-code-perfectly-and-automatically-d5b61acff741>
// use core::collections::HashSet;
// // File: test.rs
// #[kani::proof]
// fn main() {
// assert!(2 == 2);
// }
// fn estimate_size(x: u32) -> u32 {
// if x < 256 {
// if x < 128 {
// return 1;
// } else {
// return 3;
// }
// } else if x < 1024 {
// if x > 1022 {
// panic!("Oh no, a failing corner case!");
// } else {
// return 5;
// }
// } else {
// if x < 2048 {
// return 7;
// } else {
// return 9;
// }
// }
// }
// #[cfg(kani)]
// #[kani::proof]
// fn check_estimate_size() {
// let x: u32 = kani::any();
// estimate_size(x);
// }
// fn estimate_size(x: u32) -> u32 {
// assert!(x < 4096);
// if x < 256 {
// if x < 128 {
// return 1;
// } else {
// return 3;
// }
// } else if x < 1024 {
// if x > 1022 {
// return 4;
// } else {
// return 5;
// }
// } else {
// if x < 2048 {
// return 7;
// } else {
// return 9;
// }
// }
// }
// #[cfg(kani)]
// #[kani::proof]
// fn verify_success() {
// let x: u32 = kani::any();
// kani::assume(x < 2048);
// let y = estimate_size(x);
// assert!(y < 10);
// }
// We want to create a hashset of i8 (and then u8) values. Then we want to find the length of
// the set and store it in a u8. This should fail.
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_i8() {
// let start: i8 = kani::any();
// let end: i8 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end - start + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// Failed Checks: attempt to subtract with overflow
// Failed Checks: attempt to add with overflow
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_u8() {
// let start: u8 = kani::any();
// let end: u8 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end - start + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // Failed Checks: attempt to add with overflow
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_i8_other_sub() {
// let start: i8 = kani::any();
// let end: i8 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end.overflowing_sub(start).0 as u8 as usize + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // // Success!
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_u8_other_sub() {
// let start: u8 = kani::any();
// let end: u8 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// Signed sub may overflow, but casting preserves correct unsigned distance
// let len = end.overflowing_sub(start).0 as u8 as usize + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // Success!
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_i32_other_sub() {
// let start: i32 = kani::any();
// let end: i32 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end.overflowing_sub(start).0 as u32 as usize + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // // Success!
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_u64_other_sub() {
// let start: u64 = kani::any();
// let end: u64 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end.overflowing_sub(start).0 as u64 as u128 + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // Success!
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_i64_copilot() {
// let start: i64 = kani::any();
// let end: i64 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end - start + 1;
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// // Failed Checks: attempt to subtract with overflow
// // Failed Checks: attempt to add with overflow
// #[cfg(kani)]
// #[kani::proof]
// fn verify_len_i32_github() {
// let start: i32 = kani::any();
// let end: i32 = kani::any(); // end is inclusive
// kani::assume(start <= end);
// let len = end.saturating_sub(start).saturating_add(1);
// assert!((len as i128) == ((end as i128) - (start as i128) + 1));
// }
// Failed Checks: assertion failed: (len as i128) == ((end as i128) - (start as i128) + 1)
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_i32_naive() {
// let a: i32 = kani::any();
// let b: i32 = kani::any();
// let condition = a + 1 < b;
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// // Failed Checks: attempt to add with overflow
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_i32_chatgpt_a() {
// let a: i32 = kani::any();
// let b: i32 = kani::any();
// let condition = match a.checked_add(1) {
// Some(sum) => sum < b,
// None => false,
// };
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// VERIFICATION:- SUCCESSFUL
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_i32_chatgpt_b() {
// let a: i32 = kani::any();
// let b: i32 = kani::any();
// let condition = a.checked_add(1).map_or(false, |result| result < b);
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// VERIFICATION:- SUCCESSFUL
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_i32_human2() {
// let a: i32 = kani::any();
// let b: i32 = kani::any();
// let condition = a.saturating_add(1) < b;
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// VERIFICATION:- SUCCESSFUL
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_i32_human() {
// let a: i32 = kani::any();
// let b: i32 = kani::any();
// let condition = a < b && a + 1 < b;
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// // VERIFICATION:- SUCCESSFUL
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_branchless_chatGPT() {
// let a: i64 = kani::any();
// let b: i64 = kani::any();
// let condition = (a < b) & (a.wrapping_add(1).wrapping_sub(b) >> 31 == 0);
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// // Description: "assertion failed: condition == (a as i128 + 1 < b as i128)"
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_branchless_hybrid() {
// let a: i64 = kani::any();
// let b: i64 = kani::any();
// let (plus_1_maybe_bad, overflow) = a.overflowing_add(1);
// let condition = (a < b) & !overflow & (plus_1_maybe_bad < b);
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// // VERIFICATION:- SUCCESSFUL
// #[cfg(kani)]
// #[kani::proof]
// fn verify_less_than_branchless_hybrid() {
// let a: i64 = kani::any();
// let b: i64 = kani::any();
// let condition = a != i64::MAX && a + 1 < b;
// assert!(condition == (a as i128 + 1 < b as i128));
// }
// // VERIFICATION:- SUCCESSFUL