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
|
// This method can be used to test compilation.
method Main()
{
var m := map[2:=3];
// test "in"
if(2 in m)
{
print "m0\n";
}
else
{ assert false; }
// test "!in"
if(3 !in m)
{
print "m1\n";
}
else
{ assert false; }
// dereference
if(m[2] == 3)
{
print "m2\n";
}
else
{ assert false; }
// test disjoint operator
if(m !! map[3 := 3])
{
print "m3\n";
}
else
{ assert false; }
// updates should replace values that already exist
if(m[2 := 4] == map[2 := 4])
{
print "m4\n";
}
else
{ assert false; }
// add something to the map
if(m[7 := 1] == map[2 := 3,7 := 1])
{
print "m5\n";
}
else
{ assert false; }
// test applicative nature of Map<U, V> in C#
if(m == map[2 := 3])
{
print "m6\n";
}
else
{ assert false; }
// this should print all m1, m2, ... m6.
}
method m()
{
var a := map[2:=3]; var b := map[3:=2];
assert a[b[3]] == 3;
}
method m2(a: map<int, bool>, b: map<int, bool>)
requires forall i | 0 <= i < 100 :: i in a && i in b && a[i] != b[i];
{
assert forall i | 0 <= i < 100 :: a[i] || b[i];
}
method m3(a: map<int, int>)
requires forall i | 0 <= i < 100 :: i in a && a[i] == i*i;
{
assert a[20] == 400;
}
method m4()
{
var a := map[3 := 9];
if(a[4] == 4) // UNSAFE, 4 not in the domain
{
m();
}
}
method m5(a: map<int, int>)
requires 20 in a;
{
assert a[20] <= 0 || 0 < a[20];
}
method m6()
{
var a := map[3 := 9];
assert a[3:=5] == map[3:=5];
assert a[2:=5] == map[2:=5, 3:=9];
assert a[2:=5] == map[2:=6, 3:=9, 2:=5]; // test the ordering of assignments in the map literal
}
method m7()
{
var a := map[1:=1, 2:=4, 3:=9];
assert forall i | i in a :: a[i] == i * i;
assert 0 !in a;
assert 1 in a;
assert 2 in a;
assert 3 in a;
assert forall i | i < 1 || i > 3 :: i !in a;
}
method m8()
{
var a := map[];
assert forall i :: i !in a; // check emptiness
var i,n := 0, 100;
while(i < n)
invariant 0 <= i <= n;
invariant forall i | i in a :: a[i] == i * i;
invariant forall k :: 0 <= k < i <==> k in a;
{
a := a[i := i * i];
i := i + 1;
}
assert a !! map[-1:=2];
m3(a);
}
method m9()
{
var a, b := map[], map[];
assert a !! b;
b := map[2:=3,4:=2,5:=-6,6:=7];
assert a !! b;
assert b !! map[6:=3]; // ERROR, both share 6 in the domain.
}
method m10()
{
var a, b := map[], map[];
assert a !! b;
b := map[2:=3,4:=2,5:=-6,6:=7];
assert a !! b;
a := map[3:=3,1:=2,9:=-6,8:=7];
assert a !! b;
}
method m11<U, V>(a: map<U, V>, b: map<U, V>)
requires forall i :: !(i in a && i in b);
{
assert a !! b;
}
method m12()
{
var x := map i | 0 <= i < 10 :: i * 2;
assert 0 in x;
assert 1 in x;
assert 10 !in x;
assert x[0] == 0 && x[2] == 4;
}
function domain<U, V>(m: map<U,V>): set<U>
ensures forall i :: i in domain(m) <==> i in m;
{
set s | s in m
}
method m13()
{
var s := {0, 1, 3, 4};
var x := map i | i in s :: i;
assert forall i | i in x :: x[i] == i;
assert domain(x) == s;
}
function union<U, V>(m: map<U,V>, m': map<U,V>): map<U,V>
requires m !! m';
ensures forall i :: i in union(m, m') <==> i in m || i in m';
ensures forall i :: i in m ==> union(m, m')[i] == m[i];
ensures forall i :: i in m' ==> union(m, m')[i] == m'[i];
{
map i | i in (domain(m) + domain(m')) :: if i in m then m[i] else m'[i]
}
method m14()
{
var s, t := {0, 1}, {3, 4};
var x,y := map i | i in s :: i, map i | i in t :: 1+i;
ghost var u := union(x,y);
assert u[1] == 1 && u[3] == 4;
assert domain(u) == {0, 1, 3, 4};
}
class A { var x: int; }
method m15(b: set<A>)
requires forall a | a in b :: a != null;
{
var m := map a | a in b :: a.x;
var aa := new A;
assert aa !in m;
}
|
