diff options
author | Unknown <leino@LEINO6.redmond.corp.microsoft.com> | 2013-01-18 17:54:04 -0800 |
---|---|---|
committer | Unknown <leino@LEINO6.redmond.corp.microsoft.com> | 2013-01-18 17:54:04 -0800 |
commit | 472f3de939e7b5d652a0d7b478a3edc1fec17a99 (patch) | |
tree | 5571c083bac606b31ba5f628ba88bb7543c5057c /Test/dafny0/CoPrefix.dfy | |
parent | 252dfd009b02014037fb154ff744d7644f0e0ab8 (diff) |
Some additional resolution checks for co stuff.
Beefed up some test cases.
Diffstat (limited to 'Test/dafny0/CoPrefix.dfy')
-rw-r--r-- | Test/dafny0/CoPrefix.dfy | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/Test/dafny0/CoPrefix.dfy b/Test/dafny0/CoPrefix.dfy index d3d804e2..8cbe5394 100644 --- a/Test/dafny0/CoPrefix.dfy +++ b/Test/dafny0/CoPrefix.dfy @@ -44,7 +44,6 @@ ghost method Theorem0_Manual() parallel (k: nat) {
Theorem0_Lemma(k);
}
- assume (forall k: nat :: atmost#[k](zeros(), ones())) ==> atmost(zeros(), ones());
}
datatype Natural = Zero | Succ(Natural);
@@ -135,11 +134,11 @@ comethod Compare<T>(h: T) case true =>
assert FF(h).tail == GG(h).tail; // error: full equality is not known here
case true =>
-// assert FF(h).tail == GG(h).tail;
+ assert FF(h) ==#[_k] GG(h); // yes, this is the postcondition to be proved, and it is known to hold
case true =>
-// assert FF(h).tail ==#[_k] GG(h).tail;
+ assert FF(h).tail ==#[_k] GG(h).tail; // error: only _k-1 equality of the tails is known here
case true =>
-// assert FF(h).tail ==#[_k - 1] GG(h).tail;
+ assert FF(h).tail ==#[_k - 1] GG(h).tail; // yes, follows from call to Compare
case true =>
}
}
|