COSTA: COSt and Termination Analyzer for Java Bytecode
    
    package conditional;

public class Experiments {
	int fi;
	Experiments fx [];
	int [] fa;
	int [] fb;
	int [] fc;

	void m2 (Experiments o) {
		while(o.fi > 0) {
			fi--;
		}
	}

	void m3 (int i, int j, int k) {
		while(fa[i] > fb[j]) {
			fc[k]++;
		}	
	}

	
	void m4 (int i, int j) {
		while(fa[i] > 0) {
			fb[i]--;
			fa[j]++;
		}
	}
	
	void m5 (int [] a, int i, int j, int k) {
		while(a[i] > 0) {
			a[j] --;
			a[k] --;
		}
	}

	void m6 (int [] a, int i, int j, int k, int l) {
		while(a[l] > 0) {
			while(a[i] < 0) {
				a[j] ++;
				a[k] ++;
			}
			while(a[i] < 0) {
				a[j] ++;
			}
			a[l] --;
		}
	}

	void m7 (Experiments x, Experiments y, Experiments z) {
		while(x.fi < y.fi) {
			z.fi++;
		}
	}

	void m8 (Experiments x, Experiments y, Experiments z, Experiments w) {
		while( x.fi < y.fi) {
			z.fi++;
			w.fi--;
		}
	}

	void m9 (Experiments x, Experiments y, Experiments z) {
		m8 (x,y,x,z);
	}
	
	
	void m10 (Experiments x, Experiments y, int i) {
		while(x.fa[fi] > 0) {
			y.fb[i]--;
		}
	}
	
}