summaryrefslogtreecommitdiff
path: root/Test/dafny3
diff options
context:
space:
mode:
Diffstat (limited to 'Test/dafny3')
-rw-r--r--Test/dafny3/GenericSort.dfy2
1 files changed, 1 insertions, 1 deletions
diff --git a/Test/dafny3/GenericSort.dfy b/Test/dafny3/GenericSort.dfy
index 6bd06965..ea75c196 100644
--- a/Test/dafny3/GenericSort.dfy
+++ b/Test/dafny3/GenericSort.dfy
@@ -36,7 +36,7 @@ abstract module Sort {
requires a != null && 0 <= low <= high <= a.Length
reads a
{
- forall i :: low < i < high ==> O.Leq(a[i-1], a[i])
+ forall i {:nowarn} :: low < i < high ==> O.Leq(a[i-1], a[i])
}
// ...but we show that property to imply all pairs to be sorted. The proof of this
// lemma uses the transitivity property.