summaryrefslogtreecommitdiff
path: root/Test/dafny0/SeqFromArray.dfy
diff options
context:
space:
mode:
authorGravatar wuestholz <unknown>2015-01-27 10:16:09 +0100
committerGravatar wuestholz <unknown>2015-01-27 10:16:09 +0100
commit33e21eabe79b3e9be30fef9313c7299ee961e56d (patch)
treed631d490950264a526c315150cd6062e58974228 /Test/dafny0/SeqFromArray.dfy
parent6ca3d5ea9091df9406e60423e2ca80bd6f55f05d (diff)
Minor change to a test case
Diffstat (limited to 'Test/dafny0/SeqFromArray.dfy')
-rw-r--r--Test/dafny0/SeqFromArray.dfy10
1 files changed, 5 insertions, 5 deletions
diff --git a/Test/dafny0/SeqFromArray.dfy b/Test/dafny0/SeqFromArray.dfy
index d4c98424..aa131f98 100644
--- a/Test/dafny0/SeqFromArray.dfy
+++ b/Test/dafny0/SeqFromArray.dfy
@@ -58,7 +58,7 @@ method L(a: array<int>, c: array<int>, n: nat)
method M(a: array<int>, c: array<int>, m: nat, n: nat, k: nat, l: nat)
requires a != null && c != null
- requires k + m <= a.Length;
+ requires k + m <= a.Length
requires l + n <= c.Length
{
if {
@@ -79,12 +79,12 @@ method M(a: array<int>, c: array<int>, m: nat, n: nat, k: nat, l: nat)
} else if * {
assert forall i :: 0 <= i < n ==> a[k+i] == c[l+i];
}
- }
- case l+k+m <= c.Length && forall i :: k <= i < k+m ==> a[i] == c[l+i] =>
- assert a[k..k+m] == c[l+k..l+k+m];
+ }
case l+m <= c.Length && forall i :: 0 <= i < m ==> a[i] == c[l+i] =>
assert a[..m] == c[l..l+m];
case l+a.Length <= c.Length && forall i :: k <= i < a.Length ==> a[i] == c[l+i] =>
- assert a[k..] == c[l+k..l+a.Length];
+ assert a[k..] == c[l+k..l+a.Length];
+ case l+k+m <= c.Length && forall i :: k <= i < k+m ==> a[i] == c[l+i] =>
+ assert a[k..k+m] == c[l+k..l+k+m];
}
}