diff options
author | rustanleino <unknown> | 2010-06-11 02:02:36 +0000 |
---|---|---|
committer | rustanleino <unknown> | 2010-06-11 02:02:36 +0000 |
commit | fadc6a922eb99b83b898b55286e48f63ed0df751 (patch) | |
tree | 8aa3e8fa417e79fdfc96502ddcb5a5fdc13c7927 /Test/VSI-Benchmarks/b3.dfy | |
parent | 9521767199e98aafb780421b859da3fb8773af42 (diff) |
Dafny: Added two additional heuristics for guessing missing loop decreases clauses (for loop guard A!=B and for loop guards with multiple conjuncts)
Diffstat (limited to 'Test/VSI-Benchmarks/b3.dfy')
-rw-r--r-- | Test/VSI-Benchmarks/b3.dfy | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/Test/VSI-Benchmarks/b3.dfy b/Test/VSI-Benchmarks/b3.dfy index 6d9c3ddd..d9acfe04 100644 --- a/Test/VSI-Benchmarks/b3.dfy +++ b/Test/VSI-Benchmarks/b3.dfy @@ -88,8 +88,6 @@ class Benchmark3 { // the current array is that permutation of the input array
invariant (forall i: int :: 0 <= i && i < |perm| ==> r.contents[i] == old(q.contents)[perm[i]]);
invariant (forall i: int :: 0 <= i && i < |p| ==> q.contents[i] == old(q.contents)[p[i]]);
-
- decreases |q.contents|;
{
call m,k := RemoveMin(q);
perm := perm + [p[k]]; //adds index of min to perm
|