0.05/0.25	MAYBE
0.05/0.25	
0.05/0.25	Preprocessing Cost Relations
0.05/0.25	=====================================
0.05/0.25	
0.05/0.25	#### Computed strongly connected components 
0.05/0.25	0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3]
0.05/0.25	1. non_recursive  : [eval_foo_stop/1]
0.05/0.25	2. non_recursive  : [eval_foo_bb3_in/1]
0.05/0.25	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.05/0.25	4. non_recursive  : [eval_foo_bb0_in/2]
0.05/0.25	5. non_recursive  : [eval_foo_start/3]
0.05/0.25	
0.05/0.25	#### Obtained direct recursion through partial evaluation 
0.05/0.25	0. SCC is partially evaluated into eval_foo_bb1_in/3
0.05/0.25	1. SCC is completely evaluated into other SCCs
0.05/0.25	2. SCC is completely evaluated into other SCCs
0.05/0.25	3. SCC is completely evaluated into other SCCs
0.05/0.25	4. SCC is partially evaluated into eval_foo_bb0_in/2
0.05/0.25	5. SCC is partially evaluated into eval_foo_start/3
0.05/0.25	
0.05/0.25	Control-Flow Refinement of Cost Relations
0.05/0.25	=====================================
0.05/0.25	
0.05/0.25	### Specialization of cost equations eval_foo_bb1_in/3 
0.05/0.25	* CE 11 is refined into CE [12] 
0.05/0.25	* CE 10 is discarded (unfeasible) 
0.05/0.25	* CE 8 is discarded (unfeasible) 
0.05/0.25	* CE 9 is refined into CE [13] 
0.05/0.25	* CE 7 is refined into CE [14] 
0.05/0.25	* CE 4 is refined into CE [15] 
0.05/0.25	* CE 3 is refined into CE [16] 
0.05/0.25	* CE 6 is discarded (unfeasible) 
0.05/0.25	* CE 5 is refined into CE [17] 
0.05/0.25	
0.05/0.25	
0.05/0.25	### Cost equations --> "Loop" of eval_foo_bb1_in/3 
0.05/0.25	* CEs [15] --> Loop 12 
0.05/0.25	* CEs [16] --> Loop 13 
0.05/0.25	* CEs [17] --> Loop 14 
0.05/0.25	* CEs [13] --> Loop 15 
0.05/0.25	* CEs [14] --> Loop 16 
0.05/0.25	* CEs [12] --> Loop 17 
0.05/0.25	
0.05/0.25	### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.25	* RF of phase [15]: [V__0-10]
0.05/0.25	
0.05/0.25	#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.25	* Partial RF of phase [12,13,14,16]:
0.05/0.25	  - RF of loop [12:1]:
0.05/0.25	    V__0-9 depends on loops [13:1,14:1] 
0.05/0.25	  - RF of loop [13:1]:
0.05/0.25	    -V__0+2 depends on loops [12:1,16:1] 
0.05/0.25	  - RF of loop [14:1]:
0.05/0.25	    -V__0+10 depends on loops [12:1,16:1] 
0.05/0.25	  - RF of loop [16:1]:
0.05/0.25	    V__0-1 depends on loops [13:1,14:1] 
0.05/0.25	* Partial RF of phase [15]:
0.05/0.25	  - RF of loop [15:1]:
0.05/0.25	    V__0-10
0.05/0.25	
0.05/0.25	
0.05/0.25	### Specialization of cost equations eval_foo_bb0_in/2 
0.05/0.25	* CE 2 is refined into CE [18,19,20] 
0.05/0.25	
0.05/0.25	
0.05/0.25	### Cost equations --> "Loop" of eval_foo_bb0_in/2 
0.05/0.25	* CEs [19] --> Loop 18 
0.05/0.25	* CEs [20] --> Loop 19 
0.05/0.25	* CEs [18] --> Loop 20 
0.05/0.25	
0.05/0.25	### Ranking functions of CR eval_foo_bb0_in(V_i,B) 
0.05/0.25	
0.05/0.25	#### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 
0.05/0.25	
0.05/0.25	
0.05/0.25	### Specialization of cost equations eval_foo_start/3 
0.05/0.25	* CE 1 is refined into CE [21,22,23] 
0.05/0.25	
0.05/0.25	
0.05/0.25	### Cost equations --> "Loop" of eval_foo_start/3 
0.05/0.25	* CEs [23] --> Loop 21 
0.05/0.25	* CEs [22] --> Loop 22 
0.05/0.25	* CEs [21] --> Loop 23 
0.05/0.25	
0.05/0.25	### Ranking functions of CR eval_foo_start(V_i,V_up,B) 
0.05/0.25	
0.05/0.25	#### Partial ranking functions of CR eval_foo_start(V_i,V_up,B) 
0.05/0.25	
0.05/0.25	
0.05/0.26	Computing Bounds
0.05/0.26	=====================================
0.05/0.26	
0.05/0.26	#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
0.05/0.26	* Chain [[15],[12,13,14,16]]...: 4*it(12)+1*it(15)+0
0.05/0.26	  Such that:it(15) =< V__0
0.05/0.26	
0.05/0.26	  with precondition: [V__01=0,B=2,V__0>=11] 
0.05/0.26	
0.05/0.26	* Chain [[12,13,14,16]]...: 4*it(12)+0
0.05/0.26	  with precondition: [10>=V__0,V__01>=0,V__0>=1,1>=V__01,B=2] 
0.05/0.26	
0.05/0.26	* Chain [17]: 0
0.05/0.26	  with precondition: [V__01=0,B=2,0>=V__0] 
0.05/0.26	
0.05/0.26	
0.05/0.26	#### Cost of chains of eval_foo_bb0_in(V_i,B):
0.05/0.26	* Chain [20]: 0
0.05/0.26	  with precondition: [0>=V_i] 
0.05/0.26	
0.05/0.26	* Chain [19]...: 4*s(1)+0
0.05/0.26	  with precondition: [10>=V_i,V_i>=1] 
0.05/0.26	
0.05/0.26	* Chain [18]...: 1*s(2)+4*s(3)+0
0.05/0.26	  Such that:s(2) =< V_i
0.05/0.26	
0.05/0.26	  with precondition: [V_i>=11] 
0.05/0.26	
0.05/0.26	
0.05/0.26	#### Cost of chains of eval_foo_start(V_i,V_up,B):
0.05/0.26	* Chain [23]: 0
0.05/0.26	  with precondition: [0>=V_i] 
0.05/0.26	
0.05/0.26	* Chain [22]...: 4*s(4)+0
0.05/0.26	  with precondition: [10>=V_i,V_i>=1] 
0.05/0.26	
0.05/0.26	* Chain [21]...: 1*s(5)+4*s(6)+0
0.05/0.26	  Such that:s(5) =< V_i
0.05/0.26	
0.05/0.26	  with precondition: [V_i>=11] 
0.05/0.26	
0.05/0.26	
0.05/0.26	Closed-form bounds of eval_foo_start(V_i,V_up,B): 
0.05/0.26	-------------------------------------
0.05/0.26	* Chain [23] with precondition: [0>=V_i] 
0.05/0.26	    - Upper bound: 0 
0.05/0.26	    - Complexity: constant 
0.05/0.26	* Chain [22]... with precondition: [10>=V_i,V_i>=1] 
0.05/0.26	    - Upper bound: inf 
0.05/0.26	    - Complexity: infinity 
0.05/0.26	* Chain [21]... with precondition: [V_i>=11] 
0.05/0.26	    - Upper bound: inf 
0.05/0.26	    - Complexity: infinity 
0.05/0.26	
0.05/0.26	### Maximum cost of eval_foo_start(V_i,V_up,B): inf 
0.05/0.26	Asymptotic class: infinity 
0.05/0.26	* Total analysis performed in 177 ms.
0.05/0.26	
0.05/0.36	EOF