0.05/0.12	MAYBE
0.05/0.12	
0.05/0.12	Preprocessing Cost Relations
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	#### Computed strongly connected components 
0.05/0.12	0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3]
0.05/0.12	1. non_recursive  : [eval_foo_stop/1]
0.05/0.12	2. non_recursive  : [eval_foo_bb3_in/1]
0.05/0.12	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.05/0.12	4. non_recursive  : [eval_foo_bb0_in/1]
0.05/0.12	5. non_recursive  : [eval_foo_start/3]
0.05/0.12	
0.05/0.12	#### Obtained direct recursion through partial evaluation 
0.05/0.12	0. SCC is partially evaluated into eval_foo_bb1_in/3
0.05/0.12	1. SCC is completely evaluated into other SCCs
0.05/0.12	2. SCC is completely evaluated into other SCCs
0.05/0.12	3. SCC is completely evaluated into other SCCs
0.05/0.12	4. SCC is partially evaluated into eval_foo_bb0_in/1
0.05/0.12	5. SCC is partially evaluated into eval_foo_start/3
0.05/0.12	
0.05/0.12	Control-Flow Refinement of Cost Relations
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_foo_bb1_in/3 
0.05/0.12	* CE 5 is discarded (unfeasible) 
0.05/0.12	* CE 3 is refined into CE [6] 
0.05/0.12	* CE 4 is refined into CE [7] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_foo_bb1_in/3 
0.05/0.12	* CEs [6] --> Loop 6 
0.05/0.12	* CEs [7] --> Loop 7 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.12	* Partial RF of phase [6,7]:
0.05/0.12	  - RF of loop [6:1]:
0.05/0.12	    V__01-V__0 depends on loops [7:1] 
0.05/0.12	  - RF of loop [7:1]:
0.05/0.12	    -V__01+V__0+1 depends on loops [6:1] 
0.05/0.12	
0.05/0.12	Warning: no base case found for predicate
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_foo_bb0_in/1 
0.05/0.12	* CE 2 is refined into CE [8] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_foo_bb0_in/1 
0.05/0.12	* CEs [8] --> Loop 8 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_foo_bb0_in(B) 
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_foo_bb0_in(B) 
0.05/0.12	
0.05/0.12	Warning: no base case found for predicate
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_foo_start/3 
0.05/0.12	* CE 1 is refined into CE [9] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_foo_start/3 
0.05/0.12	* CEs [9] --> Loop 9 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.05/0.12	
0.05/0.12	Warning: no base case found for predicate
0.05/0.12	
0.05/0.12	Computing Bounds
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
0.05/0.12	* Chain [[6,7]]...: 2*it(6)+0
0.05/0.12	  with precondition: [V__0+1>=V__01,2*V__0>=V__01,V__01>=V__0,B=2] 
0.05/0.12	
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_foo_bb0_in(B):
0.05/0.12	* Chain [8]...: 2*s(1)+0
0.05/0.12	  with precondition: [] 
0.05/0.12	
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_foo_start(V_i,V_j,B):
0.05/0.12	* Chain [9]...: 2*s(2)+0
0.05/0.12	  with precondition: [] 
0.05/0.12	
0.05/0.12	
0.05/0.12	Closed-form bounds of eval_foo_start(V_i,V_j,B): 
0.05/0.12	-------------------------------------
0.05/0.12	* Chain [9]... with precondition: [] 
0.05/0.12	    - Upper bound: inf 
0.05/0.12	    - Complexity: infinity 
0.05/0.12	
0.05/0.12	### Maximum cost of eval_foo_start(V_i,V_j,B): inf 
0.05/0.12	Asymptotic class: infinity 
0.05/0.12	* Total analysis performed in 50 ms.
0.05/0.12	
0.05/0.22	EOF