0.02/0.15	WORST_CASE(?,O(n^1))  
0.02/0.15	
0.02/0.15	Preprocessing Cost Relations
0.02/0.15	=====================================
0.02/0.15	
0.02/0.15	#### Computed strongly connected components 
0.02/0.15	0. recursive  : [f1/4]
0.02/0.15	1. non_recursive  : [exit_location/1]
0.02/0.15	2. non_recursive  : [f1_loop_cont/2]
0.02/0.15	3. non_recursive  : [f0/4]
0.02/0.15	
0.02/0.15	#### Obtained direct recursion through partial evaluation 
0.02/0.15	0. SCC is partially evaluated into f1/4
0.02/0.15	1. SCC is completely evaluated into other SCCs
0.02/0.15	2. SCC is completely evaluated into other SCCs
0.02/0.15	3. SCC is partially evaluated into f0/4
0.02/0.15	
0.02/0.15	Control-Flow Refinement of Cost Relations
0.02/0.15	=====================================
0.02/0.15	
0.02/0.15	### Specialization of cost equations f1/4 
0.02/0.15	* CE 4 is refined into CE [5] 
0.02/0.15	* CE 3 is refined into CE [6] 
0.02/0.15	* CE 2 is refined into CE [7] 
0.02/0.15	
0.02/0.15	
0.02/0.15	### Cost equations --> "Loop" of f1/4 
0.02/0.15	* CEs [6] --> Loop 5 
0.02/0.15	* CEs [7] --> Loop 6 
0.02/0.15	* CEs [5] --> Loop 7 
0.02/0.15	
0.02/0.15	### Ranking functions of CR f1(A,B,C,D) 
0.02/0.15	* RF of phase [5]: [-A/2+B-3/2,B-1]
0.02/0.15	* RF of phase [6]: [A/2-B+1,-B+3]
0.02/0.15	
0.02/0.15	#### Partial ranking functions of CR f1(A,B,C,D) 
0.02/0.15	* Partial RF of phase [5]:
0.02/0.15	  - RF of loop [5:1]:
0.02/0.15	    -A/2+B-3/2
0.02/0.15	    B-1
0.02/0.15	* Partial RF of phase [6]:
0.02/0.15	  - RF of loop [6:1]:
0.02/0.15	    A/2-B+1
0.02/0.15	    -B+3
0.02/0.15	
0.02/0.15	
0.02/0.15	### Specialization of cost equations f0/4 
0.02/0.15	* CE 1 is refined into CE [8,9,10] 
0.02/0.15	
0.02/0.15	
0.02/0.15	### Cost equations --> "Loop" of f0/4 
0.02/0.15	* CEs [10] --> Loop 8 
0.02/0.15	* CEs [9] --> Loop 9 
0.02/0.15	* CEs [8] --> Loop 10 
0.02/0.15	
0.02/0.15	### Ranking functions of CR f0(A,B,C,D) 
0.02/0.15	
0.02/0.15	#### Partial ranking functions of CR f0(A,B,C,D) 
0.02/0.15	
0.02/0.15	
0.02/0.15	Computing Bounds
0.02/0.15	=====================================
0.02/0.15	
0.02/0.15	#### Cost of chains of f1(A,B,C,D):
0.02/0.15	* Chain [[6],7]: 1*it(6)+0
0.02/0.15	  Such that:it(6) =< A/2-B+1
0.02/0.15	
0.02/0.15	  with precondition: [C=2,D=2,3>=A,A>=0,B>=0,A+1>=2*B] 
0.02/0.15	
0.02/0.15	* Chain [[5],7]: 1*it(5)+0
0.02/0.15	  Such that:it(5) =< -A/2+B
0.02/0.15	
0.02/0.15	  with precondition: [C=2,D=2,3>=B,A>=0,2*B>=A+4] 
0.02/0.15	
0.02/0.15	* Chain [7]: 0
0.02/0.15	  with precondition: [C=2,D=2,3>=A,3>=B,A>=0,B>=0] 
0.02/0.15	
0.02/0.15	
0.02/0.15	#### Cost of chains of f0(A,B,C,D):
0.02/0.15	* Chain [10]: 0
0.02/0.15	  with precondition: [3>=A,3>=B,A>=0,B>=0] 
0.02/0.15	
0.02/0.15	* Chain [9]: 1*s(1)+0
0.02/0.15	  Such that:s(1) =< A/2-B+1
0.02/0.15	
0.02/0.15	  with precondition: [3>=A,A>=0,B>=0,A+1>=2*B] 
0.02/0.15	
0.02/0.15	* Chain [8]: 1*s(2)+0
0.02/0.15	  Such that:s(2) =< -A/2+B
0.02/0.15	
0.02/0.15	  with precondition: [3>=B,A>=0,2*B>=A+4] 
0.02/0.15	
0.02/0.15	
0.02/0.15	Closed-form bounds of f0(A,B,C,D): 
0.02/0.15	-------------------------------------
0.02/0.15	* Chain [10] with precondition: [3>=A,3>=B,A>=0,B>=0] 
0.02/0.15	    - Upper bound: 0 
0.02/0.15	    - Complexity: constant 
0.02/0.15	* Chain [9] with precondition: [3>=A,A>=0,B>=0,A+1>=2*B] 
0.02/0.15	    - Upper bound: A/2-B+1 
0.02/0.15	    - Complexity: n 
0.02/0.15	* Chain [8] with precondition: [3>=B,A>=0,2*B>=A+4] 
0.02/0.15	    - Upper bound: -A/2+B 
0.02/0.15	    - Complexity: n 
0.02/0.15	
0.02/0.15	### Maximum cost of f0(A,B,C,D): max([nat(A/2-B+1),nat(-A/2+B)]) 
0.02/0.15	Asymptotic class: n 
0.02/0.15	* Total analysis performed in 96 ms.
0.02/0.15	
0.02/0.26	EOF