z3-src 503.2.2

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

/*++
Copyright (c) 2016 Microsoft Corporation

Module Name:

    smt_logics.cpp

Abstract:

    Module for recognizing SMT logics.

Author:

    Nikolaj Bjorner (nbjorner) 2016-11-4

Revision History:

--*/
#include "util/symbol.h"
#include "solver/smt_logics.h"



bool smt_logics::supported_logic(symbol const & s) {
    return logic_has_ff(s) || logic_has_uf(s) || logic_is_all(s) || logic_has_fd(s) ||
        logic_has_arith(s) || logic_has_bv(s) ||
        logic_has_array(s) || logic_has_seq(s) || logic_has_str(s) || logic_has_horn(s) || logic_has_fpa(s) ||
           logic_has_datatype(s) || logic_has_finite_sets(s);
}

bool smt_logics::logic_has_reals_only(symbol const& s) {
    auto str = s.str();
    return
        str.find("LRA") != std::string::npos ||
        str.find("LRA") != std::string::npos ||
        str.find("NRA") != std::string::npos ||
        str.find("NTA") != std::string::npos ||
        str.find("RDL") != std::string::npos;
}

bool smt_logics::logic_has_arith(symbol const & s) {
    auto str = s.str();
    return
        str.find("LRA") != std::string::npos ||
        str.find("LIRA") != std::string::npos ||
        str.find("LIA") != std::string::npos ||
        str.find("LRA") != std::string::npos ||
        str.find("NRA") != std::string::npos ||
        str.find("NTA") != std::string::npos ||
        str.find("NIRA") != std::string::npos ||
        str.find("NIA") != std::string::npos ||
        str.find("IDL") != std::string::npos ||
        str.find("RDL") != std::string::npos ||
        str == "QF_BVRE" ||
        logic_has_fpa(s) ||
        str == "QF_S" ||
        logic_is_all(s) ||
        str == "QF_FD" ||
        str == "HORN";
}

bool smt_logics::logic_has_transcendental(symbol const & s) {
    auto str = s.str();
    return str.find("NTA") != std::string::npos || logic_is_all(s);
}

bool smt_logics::logic_has_bv(symbol const & s) {
    auto str = s.str();
    return
        str.find("BV") != std::string::npos ||
        str == "FP" ||
        logic_is_all(s) ||
        str == "QF_FD" ||
        str == "SMTFD" ||
        str == "HORN";
}

bool smt_logics::logic_has_finite_sets(symbol const &s) {
    auto str = s.str();
    return
        str.find("FS") != std::string::npos ||
        logic_is_all(s);
}

bool smt_logics::logic_has_array(symbol const & s) {
    auto str = s.str();
    return
        str.starts_with("QF_A") ||
        str.starts_with("A") ||
        logic_is_all(s) ||
        str == "SMTFD" ||
        str == "HORN";
}

bool smt_logics::logic_has_seq(symbol const & s) {
    return s == "QF_BVRE" || logic_has_str(s);
}

bool smt_logics::logic_has_str(symbol const & s) {
    auto str = s.str();
    return str == "QF_S" ||
           str == "QF_SLIA" ||
           str == "QF_SNIA" ||
           logic_is_all(s);
}

bool smt_logics::logic_has_fpa(symbol const & s) {
    auto str = s.str();
    return str.find("FP") != std::string::npos ||
           logic_is_all(s);
}

bool smt_logics::logic_has_uf(symbol const & s) {
    auto str = s.str();
    return 
        str.find("UF") != std::string::npos ||
        str == "SMTFD";
}

bool smt_logics::logic_has_horn(symbol const& s) {
    return s == "HORN";
}

bool smt_logics::logic_has_pb(symbol const& s) {
    return s == "QF_FD" || logic_is_all(s) || logic_has_horn(s);
}

bool smt_logics::logic_has_datatype(symbol const& s) {
    auto str = s.str();
    return 
        str.find("DT") != std::string::npos ||
        str == "QF_FD" ||
        logic_is_all(s) ||
        logic_has_horn(s);
}