mirror of
https://github.com/Z3Prover/z3
synced 2025-10-02 05:59:29 +00:00
parent
391880b6fc
commit
b7eb21efed
3 changed files with 6 additions and 0 deletions
|
@ -184,6 +184,7 @@ struct solver::imp {
|
||||||
lbool r = l_undef;
|
lbool r = l_undef;
|
||||||
statistics& st = m_nla_core.lp_settings().stats().m_st;
|
statistics& st = m_nla_core.lp_settings().stats().m_st;
|
||||||
try {
|
try {
|
||||||
|
//verbose_stream() << m_limit.
|
||||||
r = m_nlsat->check();
|
r = m_nlsat->check();
|
||||||
}
|
}
|
||||||
catch (z3_exception&) {
|
catch (z3_exception&) {
|
||||||
|
|
|
@ -3094,6 +3094,9 @@ namespace upolynomial {
|
||||||
A.swap(D);
|
A.swap(D);
|
||||||
// D is of the form P_{j+1} * P_{j+2} * ... * P_k
|
// D is of the form P_{j+1} * P_{j+2} * ... * P_k
|
||||||
j++;
|
j++;
|
||||||
|
if (j > 10000) {
|
||||||
|
display(verbose_stream(), A) << "\n";
|
||||||
|
}
|
||||||
}
|
}
|
||||||
TRACE(factor_bug, tout << "A: "; display(tout, A); tout << "\n";);
|
TRACE(factor_bug, tout << "A: "; display(tout, A); tout << "\n";);
|
||||||
SASSERT(A.size() == 1 && m().is_one(A[0]));
|
SASSERT(A.size() == 1 && m().is_one(A[0]));
|
||||||
|
|
|
@ -78,6 +78,8 @@ char const* reslimit::get_cancel_msg() const {
|
||||||
|
|
||||||
void reslimit::push_child(reslimit* r) {
|
void reslimit::push_child(reslimit* r) {
|
||||||
lock_guard lock(*g_rlimit_mux);
|
lock_guard lock(*g_rlimit_mux);
|
||||||
|
r->m_limit = std::min(r->m_limit, m_limit - std::min(m_limit, m_count));
|
||||||
|
r->m_count = 0;
|
||||||
m_children.push_back(r);
|
m_children.push_back(r);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue