0.05/0.13	WORST_CASE(?,O(n^1))  
0.05/0.13	
0.05/0.13	Preprocessing Cost Relations
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	#### Computed strongly connected components 
0.05/0.13	0. recursive  : [eval_foo_bb2_in/3,eval_foo_bb3_in/3]
0.05/0.13	1. recursive  : [eval_foo_bb1_in/2,eval_foo_bb2_in_loop_cont/4,eval_foo_bb4_in/3]
0.05/0.13	2. non_recursive  : [eval_foo_stop/1]
0.05/0.13	3. non_recursive  : [eval_foo_bb5_in/1]
0.05/0.13	4. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.05/0.13	5. non_recursive  : [eval_foo_bb0_in/2]
0.05/0.13	6. non_recursive  : [eval_foo_start/5]
0.05/0.13	
0.05/0.13	#### Obtained direct recursion through partial evaluation 
0.05/0.13	0. SCC is partially evaluated into eval_foo_bb2_in/3
0.05/0.13	1. SCC is partially evaluated into eval_foo_bb1_in/2
0.05/0.13	2. SCC is completely evaluated into other SCCs
0.05/0.13	3. SCC is completely evaluated into other SCCs
0.05/0.13	4. SCC is completely evaluated into other SCCs
0.05/0.13	5. SCC is partially evaluated into eval_foo_bb0_in/2
0.05/0.13	6. SCC is partially evaluated into eval_foo_start/5
0.05/0.13	
0.05/0.13	Control-Flow Refinement of Cost Relations
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_bb2_in/3 
0.05/0.13	* CE 6 is refined into CE [7] 
0.05/0.13	* CE 5 is refined into CE [8] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_bb2_in/3 
0.05/0.13	* CEs [8] --> Loop 7 
0.05/0.13	* CEs [7] --> Loop 8 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
0.05/0.13	* RF of phase [7]: [V__01-1]
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
0.05/0.13	* Partial RF of phase [7]:
0.05/0.13	  - RF of loop [7:1]:
0.05/0.13	    V__01-1
0.05/0.13	
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_bb1_in/2 
0.05/0.13	* CE 4 is refined into CE [9] 
0.05/0.13	* CE 3 is refined into CE [10] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_bb1_in/2 
0.05/0.13	* CEs [10] --> Loop 9 
0.05/0.13	* CEs [9] --> Loop 10 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_bb0_in/2 
0.05/0.13	* CE 2 is refined into CE [11,12] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_bb0_in/2 
0.05/0.13	* CEs [12] --> Loop 11 
0.05/0.13	* CEs [11] --> Loop 12 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_bb0_in(V_x,B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_bb0_in(V_x,B) 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_start/5 
0.05/0.13	* CE 1 is refined into CE [13,14] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_start/5 
0.05/0.13	* CEs [14] --> Loop 13 
0.05/0.13	* CEs [13] --> Loop 14 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_start(V_x,V_xtmp,V_res,V_restmp,B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_start(V_x,V_xtmp,V_res,V_restmp,B) 
0.05/0.13	
0.05/0.13	
0.05/0.13	Computing Bounds
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_bb2_in(V__01,B,C):
0.05/0.13	* Chain [[7],8]: 1*it(7)+0
0.05/0.13	  Such that:it(7) =< V__01-C
0.05/0.13	
0.05/0.13	  with precondition: [B=2,1>=C,C>=0,V__01>=C+2] 
0.05/0.13	
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_bb1_in(V__0,B):
0.05/0.13	* Chain [10]: 0
0.05/0.13	  with precondition: [B=3,1>=V__0] 
0.05/0.13	
0.05/0.13	* Chain [9,10]: 1*s(1)+1
0.05/0.13	  Such that:s(1) =< V__0
0.05/0.13	
0.05/0.13	  with precondition: [B=3,V__0>=2] 
0.05/0.13	
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_bb0_in(V_x,B):
0.05/0.13	* Chain [12]: 0
0.05/0.13	  with precondition: [1>=V_x] 
0.05/0.13	
0.05/0.13	* Chain [11]: 1*s(2)+1
0.05/0.13	  Such that:s(2) =< V_x
0.05/0.13	
0.05/0.13	  with precondition: [V_x>=2] 
0.05/0.13	
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_start(V_x,V_xtmp,V_res,V_restmp,B):
0.05/0.13	* Chain [14]: 0
0.05/0.13	  with precondition: [1>=V_x] 
0.05/0.13	
0.05/0.13	* Chain [13]: 1*s(3)+1
0.05/0.13	  Such that:s(3) =< V_x
0.05/0.13	
0.05/0.13	  with precondition: [V_x>=2] 
0.05/0.13	
0.05/0.13	
0.05/0.13	Closed-form bounds of eval_foo_start(V_x,V_xtmp,V_res,V_restmp,B): 
0.05/0.13	-------------------------------------
0.05/0.13	* Chain [14] with precondition: [1>=V_x] 
0.05/0.13	    - Upper bound: 0 
0.05/0.13	    - Complexity: constant 
0.05/0.13	* Chain [13] with precondition: [V_x>=2] 
0.05/0.13	    - Upper bound: V_x+1 
0.05/0.13	    - Complexity: n 
0.05/0.13	
0.05/0.13	### Maximum cost of eval_foo_start(V_x,V_xtmp,V_res,V_restmp,B): nat(V_x)+1 
0.05/0.13	Asymptotic class: n 
0.05/0.13	* Total analysis performed in 58 ms.
0.05/0.13	
0.05/0.23	EOF