/* https://dafny.org/latest/OnlineTutorial/guide */ function fib(n: nat): nat { if n == 0 then 0 else if n == 1 then 1 else fib(n - 1) + fib(n - 2) } method ComputeFib(n: nat) returns (b: nat) ensures b == fib(n) // Do not change this postcondition { // Change the method body to instead use c as described. // You will need to change both the initialization and the loop. if n == 0 { return 0; } var i: int := 1; var a := 0; b := 1; while i < n invariant 0 < i <= n invariant a == fib(i - 1) invariant b == fib(i) { a, b := b, a + b; i := i + 1; } }