0.03/0.30	MAYBE
0.03/0.30	
0.03/0.30	Preprocessing Cost Relations
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	#### Computed strongly connected components 
0.03/0.30	0. recursive  : [f0/11]
0.03/0.30	1. non_recursive  : [exit_location/1]
0.03/0.30	2. non_recursive  : [f2/6]
0.03/0.30	3. non_recursive  : [f0_loop_cont/7]
0.03/0.30	4. non_recursive  : [f1/6]
0.03/0.30	
0.03/0.30	#### Obtained direct recursion through partial evaluation 
0.03/0.30	0. SCC is partially evaluated into f0/11
0.03/0.30	1. SCC is completely evaluated into other SCCs
0.03/0.30	2. SCC is completely evaluated into other SCCs
0.03/0.30	3. SCC is partially evaluated into f0_loop_cont/7
0.03/0.30	4. SCC is partially evaluated into f1/6
0.03/0.30	
0.03/0.30	Control-Flow Refinement of Cost Relations
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	### Specialization of cost equations f0/11 
0.03/0.30	* CE 6 is refined into CE [9] 
0.03/0.30	* CE 2 is refined into CE [10] 
0.03/0.30	* CE 4 is refined into CE [11] 
0.03/0.30	* CE 3 is refined into CE [12] 
0.03/0.30	* CE 5 is refined into CE [13] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f0/11 
0.03/0.30	* CEs [11] --> Loop 9 
0.03/0.30	* CEs [12] --> Loop 10 
0.03/0.30	* CEs [13] --> Loop 11 
0.03/0.30	* CEs [9] --> Loop 12 
0.03/0.30	* CEs [10] --> Loop 13 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f0(A,B,C,D,E,I,J,K,L,M,N) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f0(A,B,C,D,E,I,J,K,L,M,N) 
0.03/0.30	* Partial RF of phase [9,10,11]:
0.03/0.30	  - RF of loop [11:1]:
0.03/0.30	    2*A-1 depends on loops [9:1,10:1] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f0_loop_cont/7 
0.03/0.30	* CE 8 is refined into CE [14] 
0.03/0.30	* CE 7 is refined into CE [15] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f0_loop_cont/7 
0.03/0.30	* CEs [14] --> Loop 14 
0.03/0.30	* CEs [15] --> Loop 15 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f0_loop_cont(A,B,C,D,E,F,G) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f0_loop_cont(A,B,C,D,E,F,G) 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f1/6 
0.03/0.30	* CE 1 is refined into CE [16,17,18,19,20] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f1/6 
0.03/0.30	* CEs [19,20] --> Loop 16 
0.03/0.30	* CEs [18] --> Loop 17 
0.03/0.30	* CEs [16] --> Loop 18 
0.03/0.30	* CEs [17] --> Loop 19 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f1(A,B,C,D,E,I) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f1(A,B,C,D,E,I) 
0.03/0.30	
0.03/0.30	
0.03/0.30	Computing Bounds
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	#### Cost of chains of f0(A,B,C,D,E,I,J,K,L,M,N):
0.03/0.30	* Chain [[9,10,11]]...: 3*it(9)+0
0.03/0.30	  with precondition: [A>=1] 
0.03/0.30	
0.03/0.30	* Chain [[9,10,11],12]: 3*it(9)+0
0.03/0.30	  with precondition: [I=3,A>=1] 
0.03/0.30	
0.03/0.30	* Chain [13]: 0
0.03/0.30	  with precondition: [I=2,L=C,M=D,N=E,A=J,0>=A] 
0.03/0.30	
0.03/0.30	* Chain [12]: 0
0.03/0.30	  with precondition: [I=3] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f0_loop_cont(A,B,C,D,E,F,G):
0.03/0.30	* Chain [15]: 0
0.03/0.30	  with precondition: [A=2] 
0.03/0.30	
0.03/0.30	* Chain [14]: 0
0.03/0.30	  with precondition: [A=3] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f1(A,B,C,D,E,I):
0.03/0.30	* Chain [19]: 0
0.03/0.30	  with precondition: [] 
0.03/0.30	
0.03/0.30	* Chain [18]: 0
0.03/0.30	  with precondition: [0>=A] 
0.03/0.30	
0.03/0.30	* Chain [17]: 3*s(1)+0
0.03/0.30	  with precondition: [A>=1] 
0.03/0.30	
0.03/0.30	* Chain [16]...: 1*aux(20)+0
0.03/0.30	  with precondition: [A>=1] 
0.03/0.30	
0.03/0.30	
0.03/0.30	Closed-form bounds of f1(A,B,C,D,E,I): 
0.03/0.30	-------------------------------------
0.03/0.30	* Chain [19] with precondition: [] 
0.03/0.30	    - Upper bound: 0 
0.03/0.30	    - Complexity: constant 
0.03/0.30	* Chain [18] with precondition: [0>=A] 
0.03/0.30	    - Upper bound: 0 
0.03/0.30	    - Complexity: constant 
0.03/0.30	* Chain [17] with precondition: [A>=1] 
0.03/0.30	    - Upper bound: inf 
0.03/0.30	    - Complexity: infinity 
0.03/0.30	* Chain [16]... with precondition: [A>=1] 
0.03/0.30	    - Upper bound: inf 
0.03/0.30	    - Complexity: infinity 
0.03/0.30	
0.03/0.30	### Maximum cost of f1(A,B,C,D,E,I): inf 
0.03/0.30	Asymptotic class: infinity 
0.03/0.30	* Total analysis performed in 225 ms.
0.03/0.30	
0.03/0.40	EOF