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