z3-src 501.0.0

Source distribution of the Z3 SMT solver, for use as a build dependency
Documentation 
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
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350

/*++
Copyright (c) 2025 Microsoft Corporation

Module Name:

    finite_set_rewriter.cpp

Abstract:

    Test finite set rewriter

Author:

    GitHub Copilot Agent 2025

--*/

#include "ast/ast.h"
#include "ast/finite_set_decl_plugin.h"
#include "ast/reg_decl_plugins.h"
#include "ast/arith_decl_plugin.h"
#include "ast/rewriter/finite_set_rewriter.h"

class finite_set_rewriter_test {
public:
    void test_union_idempotent() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);

        // Test set.union(s1, s1) -> s1
        app_ref union_app(fsets.mk_union(s1, s1), m);
        expr_ref result(m);
        br_status st = rw.mk_app_core(union_app->get_decl(), union_app->get_num_args(), union_app->get_args(), result);

        ENSURE(st == BR_DONE);
        ENSURE(result == s1);
    }

    void test_intersect_idempotent() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);

        // Test set.intersect(s1, s1) -> s1
        app_ref intersect_app(fsets.mk_intersect(s1, s1), m);
        expr_ref result(m);
        br_status st =
            rw.mk_app_core(intersect_app->get_decl(), intersect_app->get_num_args(), intersect_app->get_args(), result);

        ENSURE(st == BR_DONE);
        ENSURE(result == s1);
    }

    void test_difference_same() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);

        // Test set.difference(s1, s1) -> empty
        app_ref diff_app(fsets.mk_difference(s1, s1), m);
        expr_ref result(m);
        br_status st = rw.mk_app_core(diff_app->get_decl(), diff_app->get_num_args(), diff_app->get_args(), result);

        ENSURE(st == BR_DONE);
        ENSURE(fsets.is_empty(result));
    }

    void test_subset_rewrite() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create two sets
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        expr_ref twenty(arith.mk_int(20), m);
        app_ref s1(fsets.mk_range(zero, ten), m);
        app_ref s2(fsets.mk_range(zero, twenty), m);

        // Test set.subset(s1, s2) -> set.intersect(s1, s2) = s1
        app_ref subset_app(fsets.mk_subset(s1, s2), m);
        expr_ref result(m);
        br_status st =
            rw.mk_app_core(subset_app->get_decl(), subset_app->get_num_args(), subset_app->get_args(), result);

        ENSURE(st == BR_REWRITE3);
        ENSURE(m.is_eq(result));

        // Check that result is an equality
        app *eq = to_app(result);
        ENSURE(eq->get_num_args() == 2);

        // The left side should be set.intersect(s1, s2)
        expr *lhs = eq->get_arg(0);
        ENSURE(fsets.is_intersect(lhs));

        // The right side should be s1
        expr *rhs = eq->get_arg(1);
        ENSURE(rhs == s1);
    }

    void test_mk_app_core() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create sets
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);

        // Test union through mk_app_core
        app_ref union_app(fsets.mk_union(s1, s1), m);
        expr_ref result(m);
        br_status st = rw.mk_app_core(union_app->get_decl(), union_app->get_num_args(), union_app->get_args(), result);

        ENSURE(st == BR_DONE);
        ENSURE(result == s1);
    }

    void test_union_with_empty() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set and empty set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);
        app_ref empty_set(fsets.mk_empty(s1->get_sort()), m);

        // Test set.union(s1, empty) -> s1
        app_ref union_app1(fsets.mk_union(s1, empty_set), m);
        expr_ref result1(m);
        br_status st1 =
            rw.mk_app_core(union_app1->get_decl(), union_app1->get_num_args(), union_app1->get_args(), result1);
        ENSURE(st1 == BR_DONE);
        ENSURE(result1 == s1);

        // Test set.union(empty, s1) -> s1
        app_ref union_app2(fsets.mk_union(empty_set, s1), m);
        expr_ref result2(m);
        br_status st2 =
            rw.mk_app_core(union_app2->get_decl(), union_app2->get_num_args(), union_app2->get_args(), result2);
        ENSURE(st2 == BR_DONE);
        ENSURE(result2 == s1);
    }

    void test_intersect_with_empty() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set and empty set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);
        app_ref empty_set(fsets.mk_empty(s1->get_sort()), m);

        // Test set.intersect(s1, empty) -> empty
        app_ref intersect_app1(fsets.mk_intersect(s1, empty_set), m);
        expr_ref result1(m);
        br_status st1 = rw.mk_app_core(intersect_app1->get_decl(), intersect_app1->get_num_args(),
                                       intersect_app1->get_args(), result1);
        ENSURE(st1 == BR_DONE);
        ENSURE(result1 == empty_set);

        // Test set.intersect(empty, s1) -> empty
        app_ref intersect_app2(fsets.mk_intersect(empty_set, s1), m);
        expr_ref result2(m);
        br_status st2 = rw.mk_app_core(intersect_app2->get_decl(), intersect_app2->get_num_args(),
                                       intersect_app2->get_args(), result2);
        ENSURE(st2 == BR_DONE);
        ENSURE(result2 == empty_set);
    }

    void test_difference_with_empty() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set and empty set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);
        app_ref empty_set(fsets.mk_empty(s1->get_sort()), m);

        // Test set.difference(s1, empty) -> s1
        app_ref diff_app1(fsets.mk_difference(s1, empty_set), m);
        expr_ref result1(m);
        br_status st1 =
            rw.mk_app_core(diff_app1->get_decl(), diff_app1->get_num_args(), diff_app1->get_args(), result1);
        ENSURE(st1 == BR_DONE);
        ENSURE(result1 == s1);

        // Test set.difference(empty, s1) -> empty
        app_ref diff_app2(fsets.mk_difference(empty_set, s1), m);
        expr_ref result2(m);
        br_status st2 =
            rw.mk_app_core(diff_app2->get_decl(), diff_app2->get_num_args(), diff_app2->get_args(), result2);
        ENSURE(st2 == BR_DONE);
        ENSURE(result2 == empty_set);
    }

    void test_subset_with_empty() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create a set and empty set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref zero(arith.mk_int(0), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref s1(fsets.mk_range(zero, ten), m);
        app_ref empty_set(fsets.mk_empty(s1->get_sort()), m);

        // Test set.subset(empty, s1) -> true
        app_ref subset_app1(fsets.mk_subset(empty_set, s1), m);
        expr_ref result1(m);
        br_status st1 =
            rw.mk_app_core(subset_app1->get_decl(), subset_app1->get_num_args(), subset_app1->get_args(), result1);
        ENSURE(st1 == BR_DONE);
        ENSURE(m.is_true(result1));

        // Test set.subset(s1, s1) -> true
        app_ref subset_app2(fsets.mk_subset(s1, s1), m);
        expr_ref result2(m);
        br_status st2 =
            rw.mk_app_core(subset_app2->get_decl(), subset_app2->get_num_args(), subset_app2->get_args(), result2);
        ENSURE(st2 == BR_DONE);
        ENSURE(m.is_true(result2));
    }

    void test_in_singleton() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create elements and singleton
        expr_ref five(arith.mk_int(5), m);
        expr_ref ten(arith.mk_int(10), m);
        app_ref singleton_five(fsets.mk_singleton(five), m);

        // Test set.in(five, singleton(five)) -> true
        app_ref in_app1(fsets.mk_in(five, singleton_five), m);
        expr_ref result1(m);
        br_status st1 = rw.mk_app_core(in_app1->get_decl(), in_app1->get_num_args(), in_app1->get_args(), result1);
        ENSURE(st1 == BR_DONE);
        ENSURE(m.is_true(result1));

        // Test set.in(ten, singleton(five)) -> ten = five
        app_ref in_app2(fsets.mk_in(ten, singleton_five), m);
        expr_ref result2(m);
        br_status st2 = rw.mk_app_core(in_app2->get_decl(), in_app2->get_num_args(), in_app2->get_args(), result2);
        ENSURE(st2 == BR_REWRITE1);
        ENSURE(m.is_eq(result2));
    }

    void test_in_empty() {
        ast_manager m;
        reg_decl_plugins(m);

        finite_set_util fsets(m);
        finite_set_rewriter rw(m);
        arith_util arith(m);

        // Create element and empty set
        sort_ref int_sort(arith.mk_int(), m);
        expr_ref five(arith.mk_int(5), m);
        parameter param(int_sort.get());
        sort_ref set_sort(m.mk_sort(fsets.get_family_id(), FINITE_SET_SORT, 1, &param), m);
        app_ref empty_set(fsets.mk_empty(set_sort), m);

        // Test set.in(five, empty) -> false
        app_ref in_app(fsets.mk_in(five, empty_set), m);
        expr_ref result(m);
        br_status st = rw.mk_app_core(in_app->get_decl(), in_app->get_num_args(), in_app->get_args(), result);
        ENSURE(st == BR_DONE);
        ENSURE(m.is_false(result));
    }
};

void tst_finite_set_rewriter() {
    finite_set_rewriter_test test;
    test.test_union_idempotent();
    test.test_intersect_idempotent();
    test.test_difference_same();
    test.test_subset_rewrite();
    test.test_mk_app_core();
    test.test_union_with_empty();
    test.test_intersect_with_empty();
    test.test_difference_with_empty();
    test.test_subset_with_empty();
    test.test_in_singleton();
    test.test_in_empty();
}