5.90/2.32	YES
5.90/2.34	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
5.90/2.34	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.90/2.34	
5.90/2.34	
5.90/2.34	Termination of the given C Problem could be proven:
5.90/2.34	
5.90/2.34	(0) C Problem
5.90/2.34	(1) CToIRSProof [EQUIVALENT, 0 ms]
5.90/2.34	(2) IntTRS
5.90/2.34	(3) TerminationGraphProcessor [SOUND, 63 ms]
5.90/2.34	(4) IntTRS
5.90/2.34	(5) IntTRSCompressionProof [EQUIVALENT, 12 ms]
5.90/2.34	(6) IntTRS
5.90/2.34	(7) PolynomialOrderProcessor [EQUIVALENT, 17 ms]
5.90/2.34	(8) YES
5.90/2.34	
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(0)
5.90/2.34	Obligation:
5.90/2.34	c file /export/starexec/sandbox/benchmark/theBenchmark.c
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(1) CToIRSProof (EQUIVALENT)
5.90/2.34	Parsed C Integer Program as IRS.
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(2)
5.90/2.34	Obligation:
5.90/2.34	Rules:
5.90/2.34	f1(x, y, tx) -> f2(x, y, x_1) :|: TRUE
5.90/2.34	f2(x1, x2, x3) -> f3(x4, x2, x3) :|: TRUE
5.90/2.34	f3(x5, x6, x7) -> f4(x5, x8, x7) :|: TRUE
5.90/2.34	f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1 - x11
5.90/2.34	f7(x38, x39, x40) -> f10(x38, x41, x40) :|: TRUE && x41 = x39 + 1 + x40
5.90/2.34	f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x18 < 0
5.90/2.34	f5(x42, x43, x44) -> f6(x42, x43, x44) :|: x45 > 0
5.90/2.34	f5(x19, x20, x21) -> f7(x19, x20, x21) :|: x22 = 0
5.90/2.34	f9(x23, x24, x25) -> f8(x23, x24, x25) :|: TRUE
5.90/2.34	f10(x26, x27, x28) -> f8(x26, x27, x28) :|: TRUE
5.90/2.34	f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x29 >= x30 && x31 >= 0
5.90/2.34	f8(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE
5.90/2.34	f4(x35, x36, x37) -> f11(x35, x36, x37) :|: x35 < x36
5.90/2.34	f4(x46, x47, x48) -> f11(x46, x47, x48) :|: x48 < 0
5.90/2.34	Start term: f1(x, y, tx)
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(3) TerminationGraphProcessor (SOUND)
5.90/2.34	Constructed the termination graph and obtained one non-trivial SCC.
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(4)
5.90/2.34	Obligation:
5.90/2.34	Rules:
5.90/2.34	f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x29 >= x30 && x31 >= 0
5.90/2.34	f8(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE
5.90/2.34	f9(x23, x24, x25) -> f8(x23, x24, x25) :|: TRUE
5.90/2.34	f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1 - x11
5.90/2.34	f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x18 < 0
5.90/2.34	f5(x42, x43, x44) -> f6(x42, x43, x44) :|: x45 > 0
5.90/2.34	f10(x26, x27, x28) -> f8(x26, x27, x28) :|: TRUE
5.90/2.34	f7(x38, x39, x40) -> f10(x38, x41, x40) :|: TRUE && x41 = x39 + 1 + x40
5.90/2.34	f5(x19, x20, x21) -> f7(x19, x20, x21) :|: x22 = 0
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(5) IntTRSCompressionProof (EQUIVALENT)
5.90/2.34	Compressed rules.
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(6)
5.90/2.34	Obligation:
5.90/2.34	Rules:
5.90/2.34	f8(x32:0, x33:0, x34:0) -> f8(x32:0 - 1 - x34:0, x33:0, x34:0) :|: x33:0 <= x32:0 && x34:0 > -1 && x45:0 > 0
5.90/2.34	f8(x, x1, x2) -> f8(x - 1 - x2, x1, x2) :|: x1 <= x && x2 > -1 && x3 < 0
5.90/2.34	f8(x4, x5, x6) -> f8(x4, x5 + 1 + x6, x6) :|: x5 <= x4 && x6 > -1
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(7) PolynomialOrderProcessor (EQUIVALENT)
5.90/2.34	Found the following polynomial interpretation:
5.90/2.34	[f8(x, x1, x2)] = x - x1
5.90/2.34	
5.90/2.34	The following rules are decreasing:
5.90/2.34	f8(x32:0, x33:0, x34:0) -> f8(x32:0 - 1 - x34:0, x33:0, x34:0) :|: x33:0 <= x32:0 && x34:0 > -1 && x45:0 > 0
5.90/2.34	f8(x, x1, x2) -> f8(x - 1 - x2, x1, x2) :|: x1 <= x && x2 > -1 && x3 < 0
5.90/2.34	f8(x4, x5, x6) -> f8(x4, x5 + 1 + x6, x6) :|: x5 <= x4 && x6 > -1
5.90/2.34	The following rules are bounded:
5.90/2.34	f8(x32:0, x33:0, x34:0) -> f8(x32:0 - 1 - x34:0, x33:0, x34:0) :|: x33:0 <= x32:0 && x34:0 > -1 && x45:0 > 0
5.90/2.34	f8(x, x1, x2) -> f8(x - 1 - x2, x1, x2) :|: x1 <= x && x2 > -1 && x3 < 0
5.90/2.34	f8(x4, x5, x6) -> f8(x4, x5 + 1 + x6, x6) :|: x5 <= x4 && x6 > -1
5.90/2.34	
5.90/2.34	----------------------------------------
5.90/2.34	
5.90/2.34	(8)
5.90/2.34	YES
6.45/2.38	EOF