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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
|
/*******************************************************************************
*
* Tests for DiscreteDomain
*
* Author: Maxime Arthaud
*
* Contact: ikos@lists.nasa.gov
*
* Notices:
*
* Copyright (c) 2018-2019 United States Government as represented by the
* Administrator of the National Aeronautics and Space Administration.
* All Rights Reserved.
*
* Disclaimers:
*
* No Warranty: THE SUBJECT SOFTWARE IS PROVIDED "AS IS" WITHOUT ANY WARRANTY OF
* ANY KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED
* TO, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL CONFORM TO SPECIFICATIONS,
* ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE,
* OR FREEDOM FROM INFRINGEMENT, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL BE
* ERROR FREE, OR ANY WARRANTY THAT DOCUMENTATION, IF PROVIDED, WILL CONFORM TO
* THE SUBJECT SOFTWARE. THIS AGREEMENT DOES NOT, IN ANY MANNER, CONSTITUTE AN
* ENDORSEMENT BY GOVERNMENT AGENCY OR ANY PRIOR RECIPIENT OF ANY RESULTS,
* RESULTING DESIGNS, HARDWARE, SOFTWARE PRODUCTS OR ANY OTHER APPLICATIONS
* RESULTING FROM USE OF THE SUBJECT SOFTWARE. FURTHER, GOVERNMENT AGENCY
* DISCLAIMS ALL WARRANTIES AND LIABILITIES REGARDING THIRD-PARTY SOFTWARE,
* IF PRESENT IN THE ORIGINAL SOFTWARE, AND DISTRIBUTES IT "AS IS."
*
* Waiver and Indemnity: RECIPIENT AGREES TO WAIVE ANY AND ALL CLAIMS AGAINST
* THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS, AS WELL
* AS ANY PRIOR RECIPIENT. IF RECIPIENT'S USE OF THE SUBJECT SOFTWARE RESULTS
* IN ANY LIABILITIES, DEMANDS, DAMAGES, EXPENSES OR LOSSES ARISING FROM SUCH
* USE, INCLUDING ANY DAMAGES FROM PRODUCTS BASED ON, OR RESULTING FROM,
* RECIPIENT'S USE OF THE SUBJECT SOFTWARE, RECIPIENT SHALL INDEMNIFY AND HOLD
* HARMLESS THE UNITED STATES GOVERNMENT, ITS CONTRACTORS AND SUBCONTRACTORS,
* AS WELL AS ANY PRIOR RECIPIENT, TO THE EXTENT PERMITTED BY LAW.
* RECIPIENT'S SOLE REMEDY FOR ANY SUCH MATTER SHALL BE THE IMMEDIATE,
* UNILATERAL TERMINATION OF THIS AGREEMENT.
*
******************************************************************************/
#define BOOST_TEST_MODULE test_discrete_domain
#define BOOST_TEST_DYN_LINK
#include <boost/mpl/list.hpp>
#include <boost/test/unit_test.hpp>
#include <ikos/core/domain/discrete_domain.hpp>
#include <ikos/core/example/variable_factory.hpp>
using VariableFactory = ikos::core::example::VariableFactory;
using Variable = ikos::core::example::VariableFactory::VariableRef;
using DiscreteDomain = ikos::core::DiscreteDomain< Variable >;
BOOST_AUTO_TEST_CASE(is_top_and_bottom) {
VariableFactory vfac;
Variable x(vfac.get("x"));
BOOST_CHECK(DiscreteDomain::top().is_top());
BOOST_CHECK(!DiscreteDomain::top().is_bottom());
BOOST_CHECK(!DiscreteDomain::bottom().is_top());
BOOST_CHECK(DiscreteDomain::bottom().is_bottom());
auto inv = DiscreteDomain::top();
BOOST_CHECK(inv.is_top());
BOOST_CHECK(!inv.is_bottom());
inv.set_to_bottom();
BOOST_CHECK(!inv.is_top());
BOOST_CHECK(inv.is_bottom());
inv.add(x);
BOOST_CHECK(!inv.is_top());
BOOST_CHECK(!inv.is_bottom());
}
BOOST_AUTO_TEST_CASE(iterators) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
DiscreteDomain inv = DiscreteDomain::bottom();
BOOST_CHECK((inv.begin() == inv.end()));
inv.add(x);
std::array< Variable, 1 > tab = {{x}};
BOOST_CHECK(
std::equal(inv.begin(),
inv.end(),
std::begin(tab),
std::end(tab),
[](const Variable& a, const Variable& b) { return a == b; }));
inv.add(y);
std::array< Variable, 2 > tab2 = {{y, x}};
BOOST_CHECK(
std::equal(inv.begin(),
inv.end(),
std::begin(tab2),
std::end(tab2),
[](const Variable& a, const Variable& b) { return a == b; }));
}
BOOST_AUTO_TEST_CASE(set_to_top_and_bottom) {
VariableFactory vfac;
auto inv = DiscreteDomain::top();
BOOST_CHECK(inv.is_top());
BOOST_CHECK(!inv.is_bottom());
inv.set_to_bottom();
BOOST_CHECK(!inv.is_top());
BOOST_CHECK(inv.is_bottom());
inv.set_to_top();
BOOST_CHECK(inv.is_top());
BOOST_CHECK(!inv.is_bottom());
}
BOOST_AUTO_TEST_CASE(leq) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
BOOST_CHECK(DiscreteDomain::bottom().leq(DiscreteDomain::top()));
BOOST_CHECK(DiscreteDomain::bottom().leq(DiscreteDomain::bottom()));
BOOST_CHECK(!DiscreteDomain::top().leq(DiscreteDomain::bottom()));
BOOST_CHECK(DiscreteDomain::top().leq(DiscreteDomain::top()));
DiscreteDomain inv1{x};
BOOST_CHECK(inv1.leq(DiscreteDomain::top()));
BOOST_CHECK(!inv1.leq(DiscreteDomain::bottom()));
DiscreteDomain inv2{x, y};
BOOST_CHECK(inv2.leq(DiscreteDomain::top()));
BOOST_CHECK(!inv2.leq(DiscreteDomain::bottom()));
BOOST_CHECK(inv1.leq(inv2));
BOOST_CHECK(!inv2.leq(inv1));
DiscreteDomain inv3{y};
BOOST_CHECK(inv3.leq(DiscreteDomain::top()));
BOOST_CHECK(!inv3.leq(DiscreteDomain::bottom()));
BOOST_CHECK(!inv3.leq(inv1));
BOOST_CHECK(!inv1.leq(inv3));
BOOST_CHECK(inv3.leq(inv2));
BOOST_CHECK(!inv2.leq(inv3));
}
BOOST_AUTO_TEST_CASE(equals) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
BOOST_CHECK(!DiscreteDomain::bottom().equals(DiscreteDomain::top()));
BOOST_CHECK(DiscreteDomain::bottom().equals(DiscreteDomain::bottom()));
BOOST_CHECK(!DiscreteDomain::top().equals(DiscreteDomain::bottom()));
BOOST_CHECK(DiscreteDomain::top().equals(DiscreteDomain::top()));
DiscreteDomain inv1{x};
BOOST_CHECK(!inv1.equals(DiscreteDomain::top()));
BOOST_CHECK(!inv1.equals(DiscreteDomain::bottom()));
BOOST_CHECK(inv1.equals(inv1));
DiscreteDomain inv2{y};
BOOST_CHECK(!inv2.equals(DiscreteDomain::top()));
BOOST_CHECK(!inv2.equals(DiscreteDomain::bottom()));
BOOST_CHECK(!inv1.equals(inv2));
BOOST_CHECK(!inv2.equals(inv1));
DiscreteDomain inv3{x, y};
BOOST_CHECK(!inv3.equals(DiscreteDomain::top()));
BOOST_CHECK(!inv3.equals(DiscreteDomain::bottom()));
BOOST_CHECK(!inv3.equals(inv1));
BOOST_CHECK(!inv1.equals(inv3));
}
BOOST_AUTO_TEST_CASE(join) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
Variable z(vfac.get("z"));
BOOST_CHECK((DiscreteDomain::bottom().join(DiscreteDomain::top()) ==
DiscreteDomain::top()));
BOOST_CHECK((DiscreteDomain::bottom().join(DiscreteDomain::bottom()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::top().join(DiscreteDomain::top()) ==
DiscreteDomain::top()));
BOOST_CHECK((DiscreteDomain::top().join(DiscreteDomain::bottom()) ==
DiscreteDomain::top()));
DiscreteDomain inv1{x};
BOOST_CHECK((inv1.join(DiscreteDomain::top()) == DiscreteDomain::top()));
BOOST_CHECK((inv1.join(DiscreteDomain::bottom()) == inv1));
BOOST_CHECK((DiscreteDomain::top().join(inv1) == DiscreteDomain::top()));
BOOST_CHECK((DiscreteDomain::bottom().join(inv1) == inv1));
BOOST_CHECK((inv1.join(inv1) == inv1));
DiscreteDomain inv2{y};
DiscreteDomain inv3{x, y};
BOOST_CHECK((inv1.join(inv2) == inv3));
BOOST_CHECK((inv2.join(inv1) == inv3));
DiscreteDomain inv4{y, z};
BOOST_CHECK((inv4.join(inv3) == DiscreteDomain{x, y, z}));
BOOST_CHECK((inv3.join(inv4) == DiscreteDomain{x, y, z}));
}
BOOST_AUTO_TEST_CASE(meet) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
Variable z(vfac.get("z"));
BOOST_CHECK((DiscreteDomain::bottom().meet(DiscreteDomain::top()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::bottom().meet(DiscreteDomain::bottom()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::top().meet(DiscreteDomain::top()) ==
DiscreteDomain::top()));
BOOST_CHECK((DiscreteDomain::top().meet(DiscreteDomain::bottom()) ==
DiscreteDomain::bottom()));
DiscreteDomain inv1{x};
BOOST_CHECK((inv1.meet(DiscreteDomain::top()) == inv1));
BOOST_CHECK(
(inv1.meet(DiscreteDomain::bottom()) == DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::top().meet(inv1) == inv1));
BOOST_CHECK(
(DiscreteDomain::bottom().meet(inv1) == DiscreteDomain::bottom()));
BOOST_CHECK((inv1.meet(inv1) == inv1));
DiscreteDomain inv2{y};
BOOST_CHECK((inv1.meet(inv2) == DiscreteDomain::bottom()));
BOOST_CHECK((inv2.meet(inv1) == DiscreteDomain::bottom()));
DiscreteDomain inv3{x, y};
BOOST_CHECK((inv1.meet(inv3) == inv1));
BOOST_CHECK((inv3.meet(inv1) == inv1));
BOOST_CHECK((inv2.meet(inv3) == inv2));
BOOST_CHECK((inv3.meet(inv2) == inv2));
DiscreteDomain inv4{y, z};
BOOST_CHECK((inv3.meet(inv4) == inv2));
BOOST_CHECK((inv4.meet(inv3) == inv2));
}
BOOST_AUTO_TEST_CASE(difference) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
Variable z(vfac.get("z"));
BOOST_CHECK((DiscreteDomain::bottom().difference(DiscreteDomain::top()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::bottom().difference(DiscreteDomain::bottom()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::top().difference(DiscreteDomain::top()) ==
DiscreteDomain::bottom()));
BOOST_CHECK((DiscreteDomain::top().difference(DiscreteDomain::bottom()) ==
DiscreteDomain::top()));
DiscreteDomain inv1{x};
BOOST_CHECK(
(inv1.difference(DiscreteDomain::top()) == DiscreteDomain::bottom()));
BOOST_CHECK((inv1.difference(DiscreteDomain::bottom()) == inv1));
BOOST_CHECK(
(DiscreteDomain::top().difference(inv1) == DiscreteDomain::top()));
BOOST_CHECK(
(DiscreteDomain::bottom().difference(inv1) == DiscreteDomain::bottom()));
BOOST_CHECK((inv1.difference(inv1) == DiscreteDomain::bottom()));
DiscreteDomain inv2{y};
BOOST_CHECK((inv1.difference(inv2) == inv1));
BOOST_CHECK((inv2.difference(inv1) == inv2));
DiscreteDomain inv3{x, y};
BOOST_CHECK((inv1.difference(inv3) == DiscreteDomain::bottom()));
BOOST_CHECK((inv3.difference(inv1) == inv2));
BOOST_CHECK((inv2.difference(inv3) == DiscreteDomain::bottom()));
BOOST_CHECK((inv3.difference(inv2) == inv1));
DiscreteDomain inv4{y, z};
BOOST_CHECK((inv3.difference(inv4) == inv1));
BOOST_CHECK((inv4.difference(inv3) == DiscreteDomain{z}));
}
BOOST_AUTO_TEST_CASE(add) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
auto inv = DiscreteDomain::top();
BOOST_CHECK(inv.is_top());
inv.add(x);
BOOST_CHECK(inv.is_top());
inv = DiscreteDomain::bottom();
inv.add(x);
BOOST_CHECK((inv == DiscreteDomain{x}));
inv.add(y);
BOOST_CHECK((inv == DiscreteDomain{x, y}));
}
BOOST_AUTO_TEST_CASE(remove_) {
VariableFactory vfac;
Variable x(vfac.get("x"));
Variable y(vfac.get("y"));
auto inv = DiscreteDomain::top();
BOOST_CHECK(inv.is_top());
inv.remove(x);
BOOST_CHECK(inv.is_top());
inv = DiscreteDomain{x, y};
inv.remove(x);
BOOST_CHECK((inv == DiscreteDomain{y}));
inv.remove(y);
BOOST_CHECK((inv == DiscreteDomain::bottom()));
}
|
