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