mirror of
https://github.com/Z3Prover/z3
synced 2025-04-06 17:44:08 +00:00
remove unused
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
45855fce06
commit
71a32f5bb2
|
@ -1048,6 +1048,7 @@ new_lemma& new_lemma::operator|=(ineq const& ineq) {
|
|||
new_lemma::~new_lemma() {
|
||||
static int i = 0;
|
||||
(void)i;
|
||||
(void)name;
|
||||
// code for checking lemma can be added here
|
||||
TRACE("nla_solver", tout << name << " " << (++i) << "\n" << *this; );
|
||||
}
|
||||
|
|
|
@ -82,7 +82,6 @@ expr * user_sort_factory::get_some_value(sort * s) {
|
|||
m_sort2value_set.find(s, set);
|
||||
SASSERT(set != 0);
|
||||
SASSERT(!set->m_values.empty());
|
||||
unsigned nv = set->m_values.size();
|
||||
random_gen rand(m_manager.get_num_asts());
|
||||
unsigned n = 1;
|
||||
expr* result = nullptr;
|
||||
|
|
|
@ -544,7 +544,6 @@ namespace smt {
|
|||
sort* elem_sort = nullptr, *seq_sort = nullptr;
|
||||
VERIFY(u().is_re(r, seq_sort));
|
||||
VERIFY(u().is_seq(seq_sort, elem_sort));
|
||||
sort* domain[2] = { m.get_sort(n), a().mk_int() };
|
||||
return sk().mk("re.first", n, a().mk_int(r->get_id()), elem_sort);
|
||||
}
|
||||
}
|
||||
|
|
|
@ -94,7 +94,9 @@ collect_induction_literals::collect_induction_literals(context& ctx, ast_manager
|
|||
m(m),
|
||||
vs(vs),
|
||||
m_literal_index(0)
|
||||
{}
|
||||
{
|
||||
(void)vs;
|
||||
}
|
||||
|
||||
literal_vector collect_induction_literals::operator()() {
|
||||
literal_vector candidates = pre_select();
|
||||
|
|
|
@ -8138,7 +8138,7 @@ namespace smt {
|
|||
// Returns true if this can be done in a valid way, placing the converted value in the argument.
|
||||
// Otherwise, returns false, if str is empty or contains non-digit characters.
|
||||
bool theory_str::string_integer_conversion_valid(zstring str, rational& converted) const {
|
||||
bool valid = true;
|
||||
// bool valid = true;
|
||||
converted = rational::zero();
|
||||
rational ten(10);
|
||||
if (str.length() == 0) {
|
||||
|
|
Loading…
Reference in a new issue