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