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