mirror of
https://github.com/Z3Prover/z3
synced 2025-10-01 05:29:28 +00:00
parent
b7eb21efed
commit
bda98d8da4
2 changed files with 0 additions and 4 deletions
|
@ -184,7 +184,6 @@ 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,9 +3094,6 @@ 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]));
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue