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  : [f3/7,f4/7]
0.03/0.18	1. non_recursive  : [exit_location/1]
0.03/0.18	2. non_recursive  : [f7/4]
0.03/0.18	3. non_recursive  : [f4_loop_cont/5]
0.03/0.18	4. non_recursive  : [f6/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 f4/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 f4_loop_cont/5
0.03/0.18	4. SCC is partially evaluated into f6/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 f4/7 
0.03/0.18	* CE 6 is refined into CE [9] 
0.03/0.18	* CE 4 is refined into CE [10] 
0.03/0.18	* CE 5 is refined into CE [11] 
0.03/0.18	* CE 3 is refined into CE [12] 
0.03/0.18	* CE 2 is discarded (unfeasible) 
0.03/0.18	
0.03/0.18	
0.03/0.18	### Cost equations --> "Loop" of f4/7 
0.03/0.18	* CEs [12] --> Loop 9 
0.03/0.18	* CEs [9] --> Loop 10 
0.03/0.18	* CEs [10] --> Loop 11 
0.03/0.18	* CEs [11] --> Loop 12 
0.03/0.18	
0.03/0.18	### Ranking functions of CR f4(A,B,C,E,F,G,H) 
0.03/0.18	* RF of phase [9]: [A/2-1/2]
0.03/0.18	
0.03/0.18	#### Partial ranking functions of CR f4(A,B,C,E,F,G,H) 
0.03/0.18	* Partial RF of phase [9]:
0.03/0.18	  - RF of loop [9:1]:
0.03/0.18	    A/2-1/2
0.03/0.18	
0.03/0.18	
0.03/0.18	### Specialization of cost equations f4_loop_cont/5 
0.03/0.18	* CE 8 is refined into CE [13] 
0.03/0.18	* CE 7 is refined into CE [14] 
0.03/0.18	
0.03/0.18	
0.03/0.18	### Cost equations --> "Loop" of f4_loop_cont/5 
0.03/0.18	* CEs [13] --> Loop 13 
0.03/0.18	* CEs [14] --> Loop 14 
0.03/0.18	
0.03/0.18	### Ranking functions of CR f4_loop_cont(A,B,C,D,E) 
0.03/0.18	
0.03/0.18	#### Partial ranking functions of CR f4_loop_cont(A,B,C,D,E) 
0.03/0.18	
0.03/0.18	
0.03/0.18	### Specialization of cost equations f6/4 
0.03/0.18	* CE 1 is refined into CE [15,16,17,18,19] 
0.03/0.18	
0.03/0.18	
0.03/0.18	### Cost equations --> "Loop" of f6/4 
0.03/0.18	* CEs [16] --> Loop 15 
0.03/0.18	* CEs [17,19] --> Loop 16 
0.03/0.18	* CEs [18] --> Loop 17 
0.03/0.18	* CEs [15] --> Loop 18 
0.03/0.18	
0.03/0.18	### Ranking functions of CR f6(A,B,C,E) 
0.03/0.18	
0.03/0.18	#### Partial ranking functions of CR f6(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 f4(A,B,C,E,F,G,H):
0.03/0.18	* Chain [[9],12]: 1*it(9)+0
0.03/0.18	  Such that:it(9) =< A/2
0.03/0.18	
0.03/0.18	  with precondition: [C=1,E=2,F=0,H=1,A>=2] 
0.03/0.18	
0.03/0.18	* Chain [[9],11]: 1*it(9)+0
0.03/0.18	  Such that:it(9) =< A/2
0.03/0.18	
0.03/0.18	  with precondition: [C=1,E=2,F=0,H=0,A>=3] 
0.03/0.18	
0.03/0.18	* Chain [[9],10]: 1*it(9)+0
0.03/0.18	  Such that:it(9) =< A/2
0.03/0.18	
0.03/0.18	  with precondition: [C=1,E=3,A>=2] 
0.03/0.18	
0.03/0.18	* Chain [11]: 0
0.03/0.18	  with precondition: [A=1,C=1,E=2,F=0,H=0] 
0.03/0.18	
0.03/0.18	* Chain [10]: 0
0.03/0.18	  with precondition: [C=1,E=3,A>=0] 
0.03/0.18	
0.03/0.18	
0.03/0.18	#### Cost of chains of f4_loop_cont(A,B,C,D,E):
0.03/0.18	* Chain [14]: 0
0.03/0.18	  with precondition: [A=2] 
0.03/0.18	
0.03/0.18	* Chain [13]: 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 f6(A,B,C,E):
0.03/0.18	* Chain [18]: 0
0.03/0.18	  with precondition: [A=1] 
0.03/0.18	
0.03/0.18	* Chain [17]: 0
0.03/0.18	  with precondition: [A>=1] 
0.03/0.18	
0.03/0.18	* Chain [16]: 2*s(1)+0
0.03/0.18	  Such that:aux(1) =< A/2
0.03/0.18	s(1) =< aux(1)
0.03/0.18	
0.03/0.18	  with precondition: [A>=2] 
0.03/0.18	
0.03/0.18	* Chain [15]: 1*s(3)+0
0.03/0.18	  Such that:s(3) =< A/2
0.03/0.18	
0.03/0.18	  with precondition: [A>=3] 
0.03/0.18	
0.03/0.18	
0.03/0.18	Closed-form bounds of f6(A,B,C,E): 
0.03/0.18	-------------------------------------
0.03/0.18	* Chain [18] with precondition: [A=1] 
0.03/0.18	    - Upper bound: 0 
0.03/0.18	    - Complexity: constant 
0.03/0.18	* Chain [17] with precondition: [A>=1] 
0.03/0.18	    - Upper bound: 0 
0.03/0.18	    - Complexity: constant 
0.03/0.18	* Chain [16] with precondition: [A>=2] 
0.03/0.18	    - Upper bound: A 
0.03/0.18	    - Complexity: n 
0.03/0.18	* Chain [15] with precondition: [A>=3] 
0.03/0.18	    - Upper bound: A/2 
0.03/0.18	    - Complexity: n 
0.03/0.18	
0.03/0.18	### Maximum cost of f6(A,B,C,E): A 
0.03/0.18	Asymptotic class: n 
0.03/0.18	* Total analysis performed in 117 ms.
0.03/0.18	
0.03/0.28	EOF