z3-src 503.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

/*++
Copyright (c) 2023 Microsoft Corporation

--*/

#include "util/util.h"
#include "util/timer.h"
#include "ast/euf/euf_egraph.h"
#include "ast/euf/euf_arith_plugin.h"
#include "ast/reg_decl_plugins.h"
#include "ast/ast_pp.h"
#include <iostream>

unsigned s_var = 0;

static euf::enode* get_node(euf::egraph& g, arith_util& a, expr* e) {
    auto* n = g.find(e);
    if (n)
        return n;
    euf::enode_vector args;
    for (expr* arg : *to_app(e))
        args.push_back(get_node(g, a, arg));
    n = g.mk(e, 0, args.size(), args.data());
    g.add_th_var(n, ++s_var, a.get_family_id());
    return n;
}

// 
static void test1() {
    ast_manager m;
    reg_decl_plugins(m);
    euf::egraph g(m);
    g.add_plugin(alloc(euf::arith_plugin, g));
    arith_util a(m);
    sort_ref I(a.mk_int(), m);

    expr_ref x(m.mk_const("x", I), m);
    expr_ref y(m.mk_const("y", I), m);
    expr_ref lhs(a.mk_add(y, y), m);
    expr_ref rhs(a.mk_add(x, x), m);
    auto *nx = get_node(g, a, a.mk_add(lhs, rhs));
    auto* ny = get_node(g, a, a.mk_add(a.mk_add(y, x), x));
    TRACE(plugin, tout << "before merge\n" << g << "\n");
    g.merge(nx, ny, nullptr);

    TRACE(plugin, tout << "before propagate\n" << g << "\n");
    g.propagate();
    TRACE(plugin, tout << "after propagate\n" << g << "\n");
    {
        auto lhs = get_node(g, a, a.mk_add(x, a.mk_add(y, y)));
        auto rhs = get_node(g, a, a.mk_add(y, x));
        g.merge(lhs, rhs, nullptr);
    }
    g.propagate();
    std::cout << g << "\n";
}

static void test2() {
    ast_manager m;
    reg_decl_plugins(m);
    euf::egraph g(m);
    g.add_plugin(alloc(euf::arith_plugin, g));
    arith_util a(m);
    sort_ref I(a.mk_int(), m);

    expr_ref x(m.mk_const("x", I), m);
    expr_ref y(m.mk_const("y", I), m);
    auto* nxy = get_node(g, a, a.mk_add(x, y));
    auto* nyx = get_node(g, a, a.mk_add(y, x));
    auto* nx = get_node(g, a, x);
    auto* ny = get_node(g, a, y);
    
    TRACE(plugin, tout << "before merge\n" << g << "\n");
    g.merge(nxy, nx, nullptr);
    g.merge(nyx, ny, nullptr);
    TRACE(plugin, tout << "before propagate\n" << g << "\n");
    g.propagate();
    TRACE(plugin, tout << "after propagate\n" << g << "\n");
    ENSURE(nx->get_root() == ny->get_root());
    {
        auto lhs = get_node(g, a, a.mk_add(x, a.mk_add(y, y)));
        auto rhs = get_node(g, a, a.mk_add(y, x));
        g.merge(lhs, rhs, nullptr);
    }
    g.propagate();
    std::cout << g << "\n";
}

static void test3() {
    ast_manager m;
    reg_decl_plugins(m);
    euf::egraph g(m);
    g.add_plugin(alloc(euf::arith_plugin, g));
    arith_util a(m);
    sort_ref I(a.mk_int(), m);

    expr_ref x(m.mk_const("x", I), m);
    expr_ref y(m.mk_const("y", I), m);
    auto* nxyy = get_node(g, a, a.mk_add(a.mk_add(x, y), y));
    auto* nyxx = get_node(g, a, a.mk_add(a.mk_add(y, x), x));
    auto* nx = get_node(g, a, x);
    auto* ny = get_node(g, a, y);
    g.merge(nxyy, nx, nullptr);
    g.merge(nyxx, ny, nullptr);
    TRACE(plugin, tout << "before propagate\n" << g << "\n");
    g.propagate();
    TRACE(plugin, tout << "after propagate\n" << g << "\n");
    std::cout << g << "\n";
}

static void test4() {
    ast_manager m;
    reg_decl_plugins(m);
    euf::egraph g(m);
    g.add_plugin(alloc(euf::arith_plugin, g));
    arith_util a(m);
    sort_ref R(a.mk_real(), m);

    // Test that -(a*a) = a does not crash (issue #10240)
    // uminus of a nonlinear product should not trigger NOT_IMPLEMENTED_YET
    expr_ref x(m.mk_const("a", R), m);
    expr_ref aa(a.mk_mul(x, x), m);
    expr_ref neg_aa(a.mk_uminus(aa), m);
    auto* n_neg_aa = get_node(g, a, neg_aa);
    auto* n_x = get_node(g, a, x);
    g.merge(n_neg_aa, n_x, nullptr);
    g.propagate();
    std::cout << "test4 passed\n";
}

void tst_euf_arith_plugin() {
    // enable_trace("plugin");
    test1();
    test2();
    test3();
    test4();
}