-
Notifications
You must be signed in to change notification settings - Fork 6
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.
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
Less underapproximating int conversions #125
Conversation
On benchmarks with
For |
1a3c655
to
2111591
Compare
…tion in LIA encoding of int conversions
I fixed a small bug (which didn't show up in the results), the current results are then:
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice! Approve. Did you measure impact on the other benchmarks? (I don't expect some improvements outside conversions, just to be sure we don't introduce some regression).
Yes I did, there was minimum impact. |
Added some
from_int
/to_int
axioms that should help reducing the need for underapproximation in LIA encoding of int conversions. Also added command line argumentunderapprox_length
by which we can make underapproximation more precise (if it is larger, it can be more precise). It denotes the maximum length of digit words that are handled (i.e. for 5 this means 99999 is the maximum number that conversions can handle - but only if they are not finite already).