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