3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-29 20:05:51 +00:00

Block lower bound of difference logic objectives

This commit is contained in:
Anh-Dung Phan 2013-11-01 08:05:29 +01:00
parent 87141f4cb3
commit 736d43c084
3 changed files with 37 additions and 9 deletions

View file

@ -308,7 +308,7 @@ namespace smt {
m_thread[z] = y;
n = q;
last = m_final[q];
while (n != last) {
while (n != last && n != -1) {
m_depth[n] += 1 + m_depth[p];
n = m_pred[n];
}
@ -495,7 +495,7 @@ namespace smt {
// m_pred is predecessor link
// m_depth depth counting from a root note.
// m_graph
#if 0
node root = m_pred.size()-1;
for (unsigned i = 0; i < m_upwards.size(); ++i) {
if (m_upwards[i]) {
@ -509,8 +509,7 @@ namespace smt {
// m_thread forms a spanning tree over [0..root]
// union-find structure:
svector<int> roots(root+1, -1);
#if 0
for (unsigned i = 0; i < m_thread.size(); ++i) {
if (m_states[i] == BASIS) {
node x = m_thread[i];