We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Hey all,
while working with 2LS I noticed a possible bug. It basically boils down to the following program being reported as safe:
extern void __VERIFIER_error(); int main() { for (int i = 0; i < 1; i++) { for (int j = 0; j < 2; j++) {} __VERIFIER_error(); } return 0; }
When using --k-induction or --incremental-bmc, 2LS claims
--k-induction
--incremental-bmc
[main.assertion.1] : OK ** 0 of 1 unknown ** 0 of 1 failed VERIFICATION SUCCESSFUL
In both cases, it reports to have generated a proof after 2 unwindings, although this program should be proven unsafe.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Hey all,
while working with 2LS I noticed a possible bug. It basically boils down to the following program being reported as safe:
When using
--k-induction
or--incremental-bmc
, 2LS claimsIn both cases, it reports to have generated a proof after 2 unwindings, although this program should be proven unsafe.
The text was updated successfully, but these errors were encountered: