Index: tests/coroutine/fibonacci_1.cfa
===================================================================
--- tests/coroutine/fibonacci_1.cfa	(revision 107b01a853d2fa7848b6015136777f62881c1779)
+++ tests/coroutine/fibonacci_1.cfa	(revision 0aedb015e118b2cda7cda2e8fd705450f6fc34cb)
@@ -5,11 +5,11 @@
 // file "LICENCE" distributed with Cforall.
 //
-// fibonacci_1.c -- 1-state finite-state machine: precomputed first two states returning f(n - 2)
+// fibonacci_1.cfa -- 1-state finite-state machine: precomputed first two states returning f(n - 1)
 //
 // Author           : Peter A. Buhr
 // Created On       : Thu Apr 26 23:20:08 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Dec 11 21:57:54 2018
-// Update Count     : 14
+// Last Modified On : Thu Mar 21 08:10:45 2019
+// Update Count     : 25
 // 
 
@@ -17,12 +17,12 @@
 #include <coroutine.hfa>
 
-coroutine Fibonacci { int ret; };						// used for communication
+coroutine Fibonacci { int fn1; };						// used for communication
 
 void main( Fibonacci & fib ) with( fib ) {				// called on first resume
-	int fn, fn1 = 1, fn2 = 0;							// precompute first two states
+	int fn;
+	[fn1, fn] = [0, 1];									// precompute first two states
 	for () {
-		ret = fn2;
-		fn = fn1 + fn2;  fn2 = fn1;  fn1 = fn;			// general case
 		suspend();										// restart last resume
+		[fn1, fn] = [fn, fn1 + fn];						// general case
 	} // for
 }
@@ -30,5 +30,5 @@
 int next( Fibonacci & fib ) with( fib ) {
 	resume( fib );										// restart last suspend
-	return ret;
+	return fn1;
 }
 
@@ -42,4 +42,4 @@
 // Local Variables: //
 // tab-width: 4 //
-// compile-command: "cfa fibonacci_1.c" //
+// compile-command: "cfa fibonacci_1.cfa" //
 // End: //