0.03/0.12	MAYBE
0.03/0.12	
0.03/0.12	Preprocessing Cost Relations
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	#### Computed strongly connected components 
0.03/0.12	0. recursive  : [f2/4]
0.03/0.12	1. non_recursive  : [exit_location/1]
0.03/0.12	2. non_recursive  : [f2_loop_cont/2]
0.03/0.12	3. non_recursive  : [f300/5]
0.03/0.12	4. non_recursive  : [f1/5]
0.03/0.12	
0.03/0.12	#### Obtained direct recursion through partial evaluation 
0.03/0.12	0. SCC is partially evaluated into f2/4
0.03/0.12	1. SCC is completely evaluated into other SCCs
0.03/0.12	2. SCC is completely evaluated into other SCCs
0.03/0.12	3. SCC is completely evaluated into other SCCs
0.03/0.12	4. SCC is partially evaluated into f1/5
0.03/0.12	
0.03/0.12	Control-Flow Refinement of Cost Relations
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	### Specialization of cost equations f2/4 
0.03/0.12	* CE 6 is refined into CE [7] 
0.03/0.12	* CE 5 is refined into CE [8] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f2/4 
0.03/0.12	* CEs [8] --> Loop 7 
0.03/0.12	* CEs [7] --> Loop 8 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f2(A,B,C,F) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f2(A,B,C,F) 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations f1/5 
0.03/0.12	* CE 3 is refined into CE [9] 
0.03/0.12	* CE 2 is refined into CE [10] 
0.03/0.12	* CE 1 is refined into CE [11] 
0.03/0.12	* CE 4 is refined into CE [12,13,14] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f1/5 
0.03/0.12	* CEs [14] --> Loop 9 
0.03/0.12	* CEs [9] --> Loop 10 
0.03/0.12	* CEs [10] --> Loop 11 
0.03/0.12	* CEs [11] --> Loop 12 
0.03/0.12	* CEs [12,13] --> Loop 13 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f1(A,B,C,D,F) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f1(A,B,C,D,F) 
0.03/0.12	
0.03/0.12	
0.03/0.12	Computing Bounds
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	#### Cost of chains of f2(A,B,C,F):
0.03/0.12	* Chain [[7]]...: 1*it(7)+0
0.03/0.12	  with precondition: [A=B,A>=C,F=2] 
0.03/0.12	
0.03/0.12	* Chain [[7],8]: 1*it(7)+0
0.03/0.12	  with precondition: [F=2,A=B,A>=C] 
0.03/0.12	
0.03/0.12	* Chain [8]: 0
0.03/0.12	  with precondition: [F=2,B=A,B>=C] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of f1(A,B,C,D,F):
0.03/0.12	* Chain [13]: 1*aux(1)+0
0.03/0.12	  with precondition: [A=B,A=C] 
0.03/0.12	
0.03/0.12	* Chain [12]: 0
0.03/0.12	  with precondition: [B>=A,C>=A+1,C>=B] 
0.03/0.12	
0.03/0.12	* Chain [11]: 0
0.03/0.12	  with precondition: [B>=A,B>=C+1] 
0.03/0.12	
0.03/0.12	* Chain [10]: 0
0.03/0.12	  with precondition: [A>=B+1] 
0.03/0.12	
0.03/0.12	* Chain [9]...: 1*s(2)+0
0.03/0.12	  with precondition: [A=B,A=C] 
0.03/0.12	
0.03/0.12	
0.03/0.12	Closed-form bounds of f1(A,B,C,D,F): 
0.03/0.12	-------------------------------------
0.03/0.12	* Chain [13] with precondition: [A=B,A=C] 
0.03/0.12	    - Upper bound: inf 
0.03/0.12	    - Complexity: infinity 
0.03/0.12	* Chain [12] with precondition: [B>=A,C>=A+1,C>=B] 
0.03/0.12	    - Upper bound: 0 
0.03/0.12	    - Complexity: constant 
0.03/0.12	* Chain [11] with precondition: [B>=A,B>=C+1] 
0.03/0.12	    - Upper bound: 0 
0.03/0.12	    - Complexity: constant 
0.03/0.12	* Chain [10] with precondition: [A>=B+1] 
0.03/0.12	    - Upper bound: 0 
0.03/0.12	    - Complexity: constant 
0.03/0.12	* Chain [9]... with precondition: [A=B,A=C] 
0.03/0.12	    - Upper bound: inf 
0.03/0.12	    - Complexity: infinity 
0.03/0.12	
0.03/0.12	### Maximum cost of f1(A,B,C,D,F): inf 
0.03/0.12	Asymptotic class: infinity 
0.03/0.12	* Total analysis performed in 61 ms.
0.03/0.12	
0.03/0.22	EOF