ExplosionJPF_Core.java

package explosion;
import gov.nasa.jpf.vm.Verify;

public class ExplosionJPF_Core {

	public static void main(String[] args) {
		Verify.resetInstructionCounter();
		new ExplosionJPF_Core(Integer.parseInt(args[0]));
	}

	static boolean a1 = true;
	static boolean a2 = true;
	static boolean a3 = true;
	static boolean a4 = true;
	static boolean a5  = true;
	static boolean a6  = true;
	static boolean a7  = true;
	static boolean a8  = true;
	static boolean a9  = true;
	static boolean a10 = true;
	static boolean a11 = true;
	static boolean a12 = true;
	static boolean a13 = true;
	static boolean a14 = true;
	static boolean a15  = true;
	static boolean a16  = true;
	static boolean a17  = true;
	static boolean a18  = true;
	static boolean a19  = true;
	static boolean a20 = true;
	static boolean a21 = true;
	static boolean a22 = true;
	static boolean a23 = true;
	static boolean a24 = true;
	static boolean a25  = true;
	static boolean a26  = true;
	static boolean a27  = true;
	static boolean a28  = true;
	static boolean a29  = true;
	static boolean a30 = true;
	

	public ExplosionJPF_Core(int max) {
		int i = 0;
		
		int current = 0;
		if (current == max) return;
		if (a1 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a2 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a3 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a4 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a5 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a6 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a7 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a8 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a9 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a10 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		
		if (a11 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a12 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a13 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a14 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a15 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a16 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a17 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a18 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a19 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a20 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		
		if (a21 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a22 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a23 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a24 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a25 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a26 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a27 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a28 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a29 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
		if (a30 = gb()) {i += Math.pow(2, current);}if (++current == max) return;
	}

	private boolean gb() {
		return Verify.getBoolean();
	}
	
}