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