0.03/0.28	WORST_CASE(?,O(1))  
0.03/0.28	
0.03/0.28	Preprocessing Cost Relations
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	#### Computed strongly connected components 
0.03/0.28	0. recursive  : [f7/7]
0.03/0.28	1. non_recursive  : [exit_location/1]
0.03/0.28	2. non_recursive  : [f21/6]
0.03/0.28	3. non_recursive  : [f7_loop_cont/7]
0.03/0.28	4. non_recursive  : [f0/6]
0.03/0.28	
0.03/0.28	#### Obtained direct recursion through partial evaluation 
0.03/0.28	0. SCC is partially evaluated into f7/7
0.03/0.28	1. SCC is completely evaluated into other SCCs
0.03/0.28	2. SCC is completely evaluated into other SCCs
0.03/0.28	3. SCC is partially evaluated into f7_loop_cont/7
0.03/0.28	4. SCC is partially evaluated into f0/6
0.03/0.28	
0.03/0.28	Control-Flow Refinement of Cost Relations
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	### Specialization of cost equations f7/7 
0.03/0.28	* CE 8 is refined into CE [11] 
0.03/0.28	* CE 6 is refined into CE [12] 
0.03/0.28	* CE 7 is refined into CE [13] 
0.03/0.28	* CE 5 is refined into CE [14] 
0.03/0.28	* CE 4 is refined into CE [15] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f7/7 
0.03/0.28	* CEs [15] --> Loop 9 
0.03/0.28	* CEs [11] --> Loop 10 
0.03/0.28	* CEs [12] --> Loop 11 
0.03/0.28	* CEs [13] --> Loop 12 
0.03/0.28	* CEs [14] --> Loop 13 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f7(B,C,D,E,G,H,I) 
0.03/0.28	* RF of phase [9]: [B-C+1,-C+1024]
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f7(B,C,D,E,G,H,I) 
0.03/0.28	* Partial RF of phase [9]:
0.03/0.28	  - RF of loop [9:1]:
0.03/0.28	    B-C+1
0.03/0.28	    -C+1024
0.03/0.28	
0.03/0.28	
0.03/0.28	### Specialization of cost equations f7_loop_cont/7 
0.03/0.28	* CE 10 is refined into CE [16] 
0.03/0.28	* CE 9 is refined into CE [17] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f7_loop_cont/7 
0.03/0.28	* CEs [16] --> Loop 14 
0.03/0.28	* CEs [17] --> Loop 15 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f7_loop_cont(A,B,C,D,E,F,G) 
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f7_loop_cont(A,B,C,D,E,F,G) 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Specialization of cost equations f0/6 
0.03/0.28	* CE 1 is refined into CE [18,19,20,21,22] 
0.03/0.28	* CE 2 is refined into CE [23,24,25,26,27] 
0.03/0.28	* CE 3 is refined into CE [28,29,30,31,32] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f0/6 
0.03/0.28	* CEs [20,25,30] --> Loop 16 
0.03/0.28	* CEs [19,24,29] --> Loop 17 
0.03/0.28	* CEs [18,23,28] --> Loop 18 
0.03/0.28	* CEs [21,22,26,27,31,32] --> Loop 19 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f0(A,B,C,D,E,G) 
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f0(A,B,C,D,E,G) 
0.03/0.28	
0.03/0.28	
0.03/0.28	Computing Bounds
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	#### Cost of chains of f7(B,C,D,E,G,H,I):
0.03/0.28	* Chain [[9],13]: 1*it(9)+0
0.03/0.28	  Such that:it(9) =< -D/2+I/2
0.03/0.28	
0.03/0.28	  with precondition: [G=2,B+1=H,D+2*B+2=2*C+I,1023>=B,1022>=E,C>=0,E>=0,B>=C] 
0.03/0.28	
0.03/0.28	* Chain [[9],12]: 1*it(9)+0
0.03/0.28	  Such that:it(9) =< -D/2+I/2
0.03/0.28	
0.03/0.28	  with precondition: [G=2,B+1=H,D+2*B+2=2*C+I,1023>=B,0>=E+1,C>=0,B>=C] 
0.03/0.28	
0.03/0.28	* Chain [[9],11]: 1*it(9)+0
0.03/0.28	  Such that:it(9) =< -D/2+I/2
0.03/0.28	
0.03/0.28	  with precondition: [G=2,B+1=H,D+2*B+2=2*C+I,1023>=B,C>=0,E>=1023,B>=C] 
0.03/0.28	
0.03/0.28	* Chain [[9],10]: 1*it(9)+0
0.03/0.28	  Such that:it(9) =< B-C+1
0.03/0.28	
0.03/0.28	  with precondition: [G=3,1023>=B,C>=0,B>=C] 
0.03/0.28	
0.03/0.28	* Chain [10]: 0
0.03/0.28	  with precondition: [G=3,1023>=B,B>=0,C>=0] 
0.03/0.28	
0.03/0.28	
0.03/0.28	#### Cost of chains of f7_loop_cont(A,B,C,D,E,F,G):
0.03/0.28	* Chain [15]: 0
0.03/0.28	  with precondition: [A=2,1023>=C,C>=0] 
0.03/0.28	
0.03/0.28	* Chain [14]: 0
0.03/0.28	  with precondition: [A=3,1023>=C,C>=0] 
0.03/0.28	
0.03/0.28	
0.03/0.28	#### Cost of chains of f0(A,B,C,D,E,G):
0.03/0.28	* Chain [19]: 1026
0.03/0.28	  with precondition: [] 
0.03/0.28	
0.03/0.28	* Chain [18]: 1026
0.03/0.28	  with precondition: [1022>=E,E>=0] 
0.03/0.28	
0.03/0.28	* Chain [17]: 1026
0.03/0.28	  with precondition: [0>=E+1] 
0.03/0.28	
0.03/0.28	* Chain [16]: 1026
0.03/0.28	  with precondition: [E>=1023] 
0.03/0.28	
0.03/0.28	
0.03/0.28	Closed-form bounds of f0(A,B,C,D,E,G): 
0.03/0.28	-------------------------------------
0.03/0.28	* Chain [19] with precondition: [] 
0.03/0.28	    - Upper bound: 1026 
0.03/0.28	    - Complexity: constant 
0.03/0.28	* Chain [18] with precondition: [1022>=E,E>=0] 
0.03/0.28	    - Upper bound: 1026 
0.03/0.28	    - Complexity: constant 
0.03/0.28	* Chain [17] with precondition: [0>=E+1] 
0.03/0.28	    - Upper bound: 1026 
0.03/0.28	    - Complexity: constant 
0.03/0.28	* Chain [16] with precondition: [E>=1023] 
0.03/0.28	    - Upper bound: 1026 
0.03/0.28	    - Complexity: constant 
0.03/0.28	
0.03/0.28	### Maximum cost of f0(A,B,C,D,E,G): 1026 
0.03/0.28	Asymptotic class: constant 
0.03/0.28	* Total analysis performed in 215 ms.
0.03/0.28	
0.03/0.38	EOF