10.19/3.51	YES
10.19/3.53	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
10.19/3.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.19/3.53	
10.19/3.53	
10.19/3.53	Termination of the given C Problem could be proven:
10.19/3.53	
10.19/3.53	(0) C Problem
10.19/3.53	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.19/3.53	(2) IntTRS
10.19/3.53	(3) IRS2T2 [EQUIVALENT, 0 ms]
10.19/3.53	(4) T2IntSys
10.19/3.53	(5) T2 [EQUIVALENT, 1707 ms]
10.19/3.53	(6) YES
10.19/3.53	
10.19/3.53	
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(0)
10.19/3.53	Obligation:
10.19/3.53	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(1) CToIRSProof (EQUIVALENT)
10.19/3.53	Parsed C Integer Program as IRS.
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(2)
10.19/3.53	Obligation:
10.19/3.53	Rules:
10.19/3.53	f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
10.19/3.53	f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
10.19/3.53	f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
10.19/3.53	f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10
10.19/3.53	f6(x27, x28, x29) -> f7(x27, x30, x29) :|: TRUE && x30 = x28 + x29
10.19/3.53	f7(x31, x32, x33) -> f8(x31, x32, x34) :|: TRUE && x34 = x33 - 1
10.19/3.53	f4(x18, x19, x20) -> f5(x18, x19, x20) :|: x18 > 0
10.19/3.53	f8(x21, x22, x23) -> f4(x21, x22, x23) :|: TRUE
10.19/3.53	f4(x24, x25, x26) -> f9(x24, x25, x26) :|: x24 <= 0
10.19/3.53	Start term: f1(x, y, z)
10.19/3.53	
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(3) IRS2T2 (EQUIVALENT)
10.19/3.53	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.19/3.53	
10.19/3.53	   (f1_3,1)
10.19/3.53	   (f2_3,2)
10.19/3.53	   (f3_3,3)
10.19/3.53	   (f4_3,4)
10.19/3.53	   (f5_3,5)
10.19/3.53	   (f6_3,6)
10.19/3.53	   (f7_3,7)
10.19/3.53	   (f8_3,8)
10.19/3.53	   (f9_3,9)
10.19/3.53	
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(4)
10.19/3.53	Obligation:
10.19/3.53	START: 1;
10.19/3.53	
10.19/3.53	FROM: 1;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := nondet();
10.19/3.53	assume(0 = 0);
10.19/3.53	x0 := oldX3;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 2;
10.19/3.53	
10.19/3.53	FROM: 2;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := nondet();
10.19/3.53	assume(0 = 0);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX3;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 3;
10.19/3.53	
10.19/3.53	FROM: 3;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := nondet();
10.19/3.53	assume(0 = 0);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX3;
10.19/3.53	TO: 4;
10.19/3.53	
10.19/3.53	FROM: 5;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := -(-(oldX0 + oldX1));
10.19/3.53	assume(0 = 0 && oldX3 = oldX0 + oldX1);
10.19/3.53	x0 := -(-(oldX0 + oldX1));
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 6;
10.19/3.53	
10.19/3.53	FROM: 6;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := -(-(oldX1 + oldX2));
10.19/3.53	assume(0 = 0 && oldX3 = oldX1 + oldX2);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := -(-(oldX1 + oldX2));
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 7;
10.19/3.53	
10.19/3.53	FROM: 7;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	oldX3 := -(1 - oldX2);
10.19/3.53	assume(0 = 0 && oldX3 = oldX2 - 1);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := -(1 - oldX2);
10.19/3.53	TO: 8;
10.19/3.53	
10.19/3.53	FROM: 4;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	assume(oldX0 > 0);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 5;
10.19/3.53	
10.19/3.53	FROM: 8;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	assume(0 = 0);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 4;
10.19/3.53	
10.19/3.53	FROM: 4;
10.19/3.53	oldX0 := x0;
10.19/3.53	oldX1 := x1;
10.19/3.53	oldX2 := x2;
10.19/3.53	assume(oldX0 <= 0);
10.19/3.53	x0 := oldX0;
10.19/3.53	x1 := oldX1;
10.19/3.53	x2 := oldX2;
10.19/3.53	TO: 9;
10.19/3.53	
10.19/3.53	
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(5) T2 (EQUIVALENT)
10.19/3.53	No proof given by T2
10.19/3.53	----------------------------------------
10.19/3.53	
10.19/3.53	(6)
10.19/3.53	YES
10.55/3.65	EOF