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