Skip to content

Feature/string solver performance #1465

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 12, 2017
Merged

Feature/string solver performance #1465

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
40ff71b
Avoid generating redundant constraints by iterating over n^2/2 rather…
Oct 6, 2017
987d384
Switch (!a | b) for (a => b) to clarrify the intent of the code.
Oct 6, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/solvers/flattening/arrays.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -316,7 +316,7 @@ void arrayst::add_array_Ackermann_constraints()
i1!=index_set.end();
i1++)
for(index_sett::const_iterator
i2=index_set.begin();
i2=i1;
i2!=index_set.end();
i2++)
if(i1!=i2)
Expand Down Expand Up @@ -348,7 +348,7 @@ void arrayst::add_array_Ackermann_constraints()

// add constraint
lazy_constraintt lazy(lazy_typet::ARRAY_ACKERMANN,
or_exprt(literal_exprt(!indices_equal_lit), values_equal));
implies_exprt(literal_exprt(indices_equal_lit), values_equal));
add_array_constraint(lazy, true); // added lazily

#if 0 // old code for adding, not significantly faster
Expand Down