-
Notifications
You must be signed in to change notification settings - Fork 262
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #8361 from qinheping/issue/8329
Keep quantified symbols unique during smt2_conv
- Loading branch information
Showing
4 changed files
with
73 additions
and
13 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,34 @@ | ||
#include <assert.h> | ||
#include <stdbool.h> | ||
#include <stddef.h> | ||
|
||
#define N 16 | ||
|
||
void main() | ||
{ | ||
int a[N]; | ||
a[10] = 0; | ||
bool flag = true; | ||
for(size_t j = 0; j < N; ++j) | ||
// clang-format off | ||
__CPROVER_assigns(j, __CPROVER_object_whole(a)) | ||
__CPROVER_loop_invariant(j <= N) | ||
__CPROVER_loop_invariant((j != 0) ==> __CPROVER_forall { | ||
int k; | ||
(0 <= k && k < N) ==> (a[k] == 1) | ||
}) | ||
// clang-format on | ||
{ | ||
for(size_t i = 0; i < N; ++i) | ||
// clang-format off | ||
__CPROVER_assigns(i, __CPROVER_object_whole(a)) | ||
__CPROVER_loop_invariant(0 <= i && i <= N) | ||
__CPROVER_loop_invariant(__CPROVER_forall { int k; k < i ==> a[k] == 1 }) | ||
|
||
// clang-format on | ||
{ | ||
a[i] = 1; | ||
} | ||
} | ||
assert(a[10] == 1); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,11 @@ | ||
CORE dfcc-only | ||
main.c | ||
--dfcc main --apply-loop-contracts _ --smt2 | ||
^EXIT=0$ | ||
^SIGNAL=0$ | ||
^VERIFICATION SUCCESSFUL$ | ||
-- | ||
^warning: ignoring | ||
-- | ||
This test case checks the handling of quantifiers in a nested loop's | ||
loop contracts. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters