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
265
|
// ----------------- wellformed specifications ----------------------
class SoWellformed {
var xyz: int;
var next: SoWellformed;
function F(x: int): int
{ 5 / x } // error: possible division by zero
function G(x: int): int
requires 0 < x;
{ 5 / x }
function H(x: int): int
decreases 5/x; // error: possible division by zero
{ 12 }
function I(x: int): int
requires 0 < x;
decreases 5/x;
{ 12 }
method M(a: SoWellformed, b: int) returns (c: bool, d: SoWellformed)
requires a.xyz == 7; // error: not always defined
ensures c ==> d.xyz == -7; // error: not always defined
decreases 5 / b; // error: not always defined
{
c := false;
}
method N(a: SoWellformed, b: int) returns (c: bool, d: SoWellformed)
decreases 5 / b;
requires a.next != null; // error: not always defined
requires a.next.xyz == 7; // this is well-defined, given that the previous line is
requires b < -2;
ensures 0 <= b ==> d.xyz == -7 && !c;
{
c := true;
}
method O(a: SoWellformed, b: int) returns (c: bool, d: SoWellformed)
modifies a.next; // this may not be well-defined, but that's okay for modifies clauses
{
c := true;
}
method P(a: SoWellformed, b: int) returns (c: bool, d: SoWellformed)
requires next != null;
modifies this;
ensures next.xyz < 100; // error: may not be well-defined (if body sets next to null)
{
}
method Q(a: SoWellformed, s: set<SoWellformed>) returns (c: bool, d: SoWellformed)
requires next != null;
modifies s;
ensures next.xyz < 100; // error: may not be well-defined (if this in s and body sets next to null)
{
}
method R(a: SoWellformed, s: set<SoWellformed>) returns (c: bool, d: SoWellformed)
requires next != null && this !in s;
modifies s;
ensures next.xyz < 100; // fine
{
}
}
// ---------------------- welldefinedness checks for statements -------------------
class StatementTwoShoes {
var x: int;
var s: StatementTwoShoes;
function method F(b: int): StatementTwoShoes
requires 0 <= b;
reads this;
{
s
}
method M(p: StatementTwoShoes, a: int)
modifies this, p;
{
p.x := a; // error: receiver may be null
F(a).x := a; // error: LHS may not be well defined (fn precondition)
x := F(a-10).x; // error: RHS may not be well defined (fn precondition)
}
method N(a: int, b: int)
{
assert 5 / a == 5 / a; // error: expression may not be well defined (div by zero)
assume 20 / b == 5; // error: expression may not be well defined (div by zero)
}
method O(a: int) returns (b: int)
{
if (20 / a == 5) { // error: expression may not be well defined (div by zero)
b := a;
}
}
method P(a: int)
{
while (20 / a == 5) { // error: expression may not be well defined (div by zero)
break;
}
}
method Q(a: int, b: int)
{
var i := 1;
while (i < a)
decreases F(i), F(a), a - i; // error: component 1 may not be well defined (fn precond)
{
i := i + 1;
}
i := 1;
while (i < a)
decreases F(b), a - i; // error: component 0 may not be well defined (fn precond)
{
i := i + 1;
}
}
method R(a: int)
{
var i := 0;
while (i < 100) // The following produces 3 complaints instead of 1, because loop invariants are not subject to subsumption
invariant F(a) != null; // error: expression may not be well defined (fn precond), and error: loop invariant may not hold
decreases F(a), 100 - i; // error: component 0 not well defined
{
i := i + 1;
}
}
method S(a: int)
{
var j := 0;
while (20 / a == 5 && j < 100) // error: guard may not be well defined (div by zero)
invariant j <= 100;
decreases F(101 - j), 100 - j;
{
j := j + 1;
}
}
method T(a: int)
requires a != 0 && 20 / a == 5;
{
var k := a;
var j := 0;
while (20 / k == 5 && j < 100) // fine
decreases 100 - j;
{
j := j + 1;
}
j := 0;
while (20 / k == 5 && j < 100) // error: guard may not be well defined (div by zero)
decreases 100 - j;
{
k := *;
j := j + 1;
}
}
method U()
{
var i := 0;
while (i < 100)
invariant i <= 100;
invariant F(123 - i) == this;
{
i := i + 1;
}
i := 0;
while (i < 100)
invariant F(if i==77 then -3 else i) == this; // error: expression may not be well defined (fn precond)
{
i := i + 1;
if (i == 77) { i := i + 1; }
}
}
function G(w: int): int { 5 }
function method H(x: int): int { -x }
method V(s: set<StatementTwoShoes>, a: int, b: int)
modifies s;
{
foreach (m in s | m.x < 200) // s may contain null, but the foreach excludes null
{
assume 0 <= m.x;
assert m.x < 1000;
m.x := m.x + 1;
}
foreach (m in s + {F(a)}) // error: collection expression may not be well defined (fn precondition)
{
m.x := 5; // error: possible modifies clause violation
}
foreach (m in s | F(H(m.x)) == this) // error: range expression may not be well defined
{
m.x := H(m.x);
}
foreach (m in s)
{
m.x := 100 / m.x; // error: RhS may not be well defined
}
}
method W(x: int)
{
var i := 0;
while (i < 100)
// The following line produces two complaints, thanks to the w-encoding of the loop's invariant definedness checking
invariant 5 / x != 5 / x; // error: not well-defined (div by zero), and error: loop invariant does not hold initially
{
i := i + 1;
}
}
}
// ----------------- function postconditions ----------------------
class Mountain { var x: int; }
function Postie0(c: Mountain): Mountain
requires c != null;
ensures Postie0(c) != null && Postie0(c).x <= Postie0(c).x;
ensures Postie0(c).x == Postie0(c).x;
{
c
}
function Postie1(c: Mountain): Mountain
requires c != null;
ensures Postie1(c) != null && Postie1(c).x == 5; // error: postcondition violation (but no well-formedness problem)
{
c
}
function Postie2(c: Mountain): Mountain
requires c != null && c.x == 5;
ensures Postie2(c).x == 5; // error: well-formedness error (null dereference)
{
c
}
function Postie3(c: Mountain): Mountain // all is cool
requires c != null && c.x == 5;
ensures Postie3(c) != null && Postie3(c).x < 10;
ensures Postie3(c).x == 5;
{
c
}
function Postie4(c: Mountain): Mountain
requires c != null && c.x <= 5;
ensures Postie4(c) != null && Postie4(c).x < 10;
ensures Postie4(c).x == 5; // error: postcondition might not hold
{
c
}
|