0.04/0.19	MAYBE
0.04/0.19	
0.04/0.19	Preprocessing Cost Relations
0.04/0.19	=====================================
0.04/0.19	
0.04/0.19	#### Computed strongly connected components 
0.04/0.19	0. recursive  : [f41/1]
0.04/0.19	1. non_recursive  : [exit_location/1]
0.04/0.19	2. non_recursive  : [f41_loop_cont/2]
0.04/0.19	3. non_recursive  : [f29/18]
0.04/0.19	4. non_recursive  : [f21/18]
0.04/0.19	5. non_recursive  : [f0/18]
0.04/0.19	
0.04/0.19	#### Obtained direct recursion through partial evaluation 
0.04/0.19	0. SCC is partially evaluated into f41/1
0.04/0.19	1. SCC is completely evaluated into other SCCs
0.04/0.19	2. SCC is completely evaluated into other SCCs
0.04/0.19	3. SCC is partially evaluated into f29/18
0.04/0.19	4. SCC is partially evaluated into f21/18
0.04/0.19	5. SCC is partially evaluated into f0/18
0.04/0.19	
0.04/0.19	Control-Flow Refinement of Cost Relations
0.04/0.19	=====================================
0.04/0.19	
0.04/0.19	### Specialization of cost equations f41/1 
0.04/0.19	* CE 7 is refined into CE [10] 
0.04/0.19	* CE 6 is refined into CE [11] 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Cost equations --> "Loop" of f41/1 
0.04/0.19	* CEs [11] --> Loop 9 
0.04/0.19	* CEs [10] --> Loop 10 
0.04/0.19	
0.04/0.19	### Ranking functions of CR f41(T) 
0.04/0.19	
0.04/0.19	#### Partial ranking functions of CR f41(T) 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Specialization of cost equations f29/18 
0.04/0.19	* CE 8 is discarded (unfeasible) 
0.04/0.19	* CE 9 is refined into CE [12,13] 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Cost equations --> "Loop" of f29/18 
0.04/0.19	* CEs [13] --> Loop 11 
0.04/0.19	* CEs [12] --> Loop 12 
0.04/0.19	
0.04/0.19	### Ranking functions of CR f29(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	#### Partial ranking functions of CR f29(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Specialization of cost equations f21/18 
0.04/0.19	* CE 5 is refined into CE [14,15] 
0.04/0.19	* CE 4 is discarded (unfeasible) 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Cost equations --> "Loop" of f21/18 
0.04/0.19	* CEs [15] --> Loop 13 
0.04/0.19	* CEs [14] --> Loop 14 
0.04/0.19	
0.04/0.19	### Ranking functions of CR f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	#### Partial ranking functions of CR f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Specialization of cost equations f0/18 
0.04/0.19	* CE 2 is refined into CE [16,17] 
0.04/0.19	* CE 3 is refined into CE [18,19] 
0.04/0.19	* CE 1 is refined into CE [20,21] 
0.04/0.19	
0.04/0.19	
0.04/0.19	### Cost equations --> "Loop" of f0/18 
0.04/0.19	* CEs [17,19] --> Loop 15 
0.04/0.19	* CEs [21] --> Loop 16 
0.04/0.19	* CEs [16,18] --> Loop 17 
0.04/0.19	* CEs [20] --> Loop 18 
0.04/0.19	
0.04/0.19	### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T) 
0.04/0.19	
0.04/0.19	
0.04/0.19	Computing Bounds
0.04/0.19	=====================================
0.04/0.19	
0.04/0.19	#### Cost of chains of f41(T):
0.04/0.19	* Chain [[9]]...: 1*it(9)+0
0.04/0.19	  with precondition: [T=2] 
0.04/0.19	
0.04/0.19	* Chain [[9],10]: 1*it(9)+0
0.04/0.19	  with precondition: [T=2] 
0.04/0.19	
0.04/0.19	* Chain [10]: 0
0.04/0.19	  with precondition: [T=2] 
0.04/0.19	
0.04/0.19	
0.04/0.19	#### Cost of chains of f29(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T):
0.04/0.19	* Chain [12]: 1*s(2)+0
0.04/0.19	  with precondition: [A=0,H=0,I=C,I=J,0>=M,K>=M] 
0.04/0.19	
0.04/0.19	* Chain [11]...: 1*s(3)+0
0.04/0.19	  with precondition: [A=0,H=0,I=C,I=J,0>=M,K>=M] 
0.04/0.19	
0.04/0.19	
0.04/0.19	#### Cost of chains of f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T):
0.04/0.19	* Chain [14]: 1*s(4)+0
0.04/0.19	  with precondition: [A=1,0>=M,K>=M] 
0.04/0.19	
0.04/0.19	* Chain [13]...: 1*s(5)+0
0.04/0.19	  with precondition: [A=1,0>=M,K>=M] 
0.04/0.19	
0.04/0.19	
0.04/0.19	#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T):
0.04/0.19	* Chain [18]: 1*s(6)+0
0.04/0.19	  with precondition: [0>=K] 
0.04/0.19	
0.04/0.19	* Chain [17]: 1*aux(2)+0
0.04/0.19	  with precondition: [K>=1] 
0.04/0.19	
0.04/0.19	* Chain [16]...: 1*s(9)+0
0.04/0.19	  with precondition: [0>=K] 
0.04/0.19	
0.04/0.19	* Chain [15]...: 1*aux(3)+0
0.04/0.19	  with precondition: [K>=1] 
0.04/0.19	
0.04/0.19	
0.04/0.19	Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T): 
0.04/0.19	-------------------------------------
0.04/0.19	* Chain [18] with precondition: [0>=K] 
0.04/0.19	    - Upper bound: inf 
0.04/0.19	    - Complexity: infinity 
0.04/0.19	* Chain [17] with precondition: [K>=1] 
0.04/0.19	    - Upper bound: inf 
0.04/0.19	    - Complexity: infinity 
0.04/0.19	* Chain [16]... with precondition: [0>=K] 
0.04/0.19	    - Upper bound: inf 
0.04/0.19	    - Complexity: infinity 
0.04/0.19	* Chain [15]... with precondition: [K>=1] 
0.04/0.19	    - Upper bound: inf 
0.04/0.19	    - Complexity: infinity 
0.04/0.19	
0.04/0.19	### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T): inf 
0.04/0.19	Asymptotic class: infinity 
0.04/0.19	* Total analysis performed in 122 ms.
0.04/0.19	
0.04/0.29	EOF