0.03/0.09	MAYBE
0.03/0.09	
0.03/0.09	Preprocessing Cost Relations
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	#### Computed strongly connected components 
0.03/0.09	0. recursive  : [eval/3]
0.03/0.09	1. non_recursive  : [exit_location/1]
0.03/0.09	2. non_recursive  : [eval_loop_cont/2]
0.03/0.09	3. non_recursive  : [start/3]
0.03/0.09	
0.03/0.09	#### Obtained direct recursion through partial evaluation 
0.03/0.09	0. SCC is partially evaluated into eval/3
0.03/0.09	1. SCC is completely evaluated into other SCCs
0.03/0.09	2. SCC is completely evaluated into other SCCs
0.03/0.09	3. SCC is partially evaluated into start/3
0.03/0.09	
0.03/0.09	Control-Flow Refinement of Cost Relations
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	### Specialization of cost equations eval/3 
0.03/0.09	* CE 4 is refined into CE [5] 
0.03/0.09	* CE 2 is refined into CE [6] 
0.03/0.09	* CE 3 is refined into CE [7] 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Cost equations --> "Loop" of eval/3 
0.03/0.09	* CEs [6] --> Loop 5 
0.03/0.09	* CEs [7] --> Loop 6 
0.03/0.09	* CEs [5] --> Loop 7 
0.03/0.09	
0.03/0.09	### Ranking functions of CR eval(A,B,D) 
0.03/0.09	
0.03/0.09	#### Partial ranking functions of CR eval(A,B,D) 
0.03/0.09	* Partial RF of phase [5,6]:
0.03/0.09	  - RF of loop [5:1]:
0.03/0.09	    A+1
0.03/0.09	  - RF of loop [6:1]:
0.03/0.09	    B+1 depends on loops [5:1] 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Specialization of cost equations start/3 
0.03/0.09	* CE 1 is refined into CE [8] 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Cost equations --> "Loop" of start/3 
0.03/0.09	* CEs [8] --> Loop 8 
0.03/0.09	
0.03/0.09	### Ranking functions of CR start(A,B,D) 
0.03/0.09	
0.03/0.09	#### Partial ranking functions of CR start(A,B,D) 
0.03/0.09	
0.03/0.09	
0.03/0.09	Computing Bounds
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	#### Cost of chains of eval(A,B,D):
0.03/0.09	* Chain [[5,6],7]: 1*it(5)+1*it(6)+0
0.03/0.09	  Such that:it(5) =< A+1
0.03/0.09	
0.03/0.09	  with precondition: [D=2] 
0.03/0.09	
0.03/0.09	* Chain [7]: 0
0.03/0.09	  with precondition: [D=2] 
0.03/0.09	
0.03/0.09	
0.03/0.09	#### Cost of chains of start(A,B,D):
0.03/0.09	* Chain [8]: 1*s(3)+1*s(4)+0
0.03/0.09	  Such that:s(3) =< A+1
0.03/0.09	
0.03/0.09	  with precondition: [] 
0.03/0.09	
0.03/0.09	
0.03/0.09	Closed-form bounds of start(A,B,D): 
0.03/0.09	-------------------------------------
0.03/0.09	* Chain [8] with precondition: [] 
0.03/0.09	    - Upper bound: inf 
0.03/0.09	    - Complexity: infinity 
0.03/0.09	
0.03/0.09	### Maximum cost of start(A,B,D): inf 
0.03/0.09	Asymptotic class: infinity 
0.03/0.09	* Total analysis performed in 36 ms.
0.03/0.09	
0.03/0.19	EOF