4.86/2.02	YES
4.86/2.03	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
4.86/2.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.86/2.03	
4.86/2.03	
4.86/2.03	Termination of the given C Problem could be proven:
4.86/2.03	
4.86/2.03	(0) C Problem
4.86/2.03	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.86/2.03	(2) IntTRS
4.86/2.03	(3) TerminationGraphProcessor [SOUND, 48 ms]
4.86/2.03	(4) IntTRS
4.86/2.03	(5) IntTRSCompressionProof [EQUIVALENT, 1 ms]
4.86/2.03	(6) IntTRS
4.86/2.03	(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 3 ms]
4.86/2.03	(8) IntTRS
4.86/2.03	(9) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
4.86/2.03	(10) IntTRS
4.86/2.03	(11) TerminationGraphProcessor [EQUIVALENT, 0 ms]
4.86/2.03	(12) YES
4.86/2.03	
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(0)
4.86/2.03	Obligation:
4.86/2.03	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(1) CToIRSProof (EQUIVALENT)
4.86/2.03	Parsed C Integer Program as IRS.
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(2)
4.86/2.03	Obligation:
4.86/2.03	Rules:
4.86/2.03	f1(x, xtmp, res, restmp) -> f2(x_1, xtmp, res, restmp) :|: TRUE
4.86/2.03	f2(x1, x2, x3, x4) -> f3(x1, x2, 0, x4) :|: TRUE
4.86/2.03	f4(x5, x6, x7, x8) -> f5(x5, arith, x7, x8) :|: TRUE && arith = x5 - 2
4.86/2.03	f5(x9, x10, x11, x12) -> f6(x9, x10, x11, 0) :|: TRUE
4.86/2.03	f7(x53, x54, x55, x56) -> f8(x53, x57, x55, x56) :|: TRUE && x57 = x54 - 2
4.86/2.03	f8(x58, x59, x60, x61) -> f9(x58, x59, x60, x62) :|: TRUE && x62 = x61 + 1
4.86/2.03	f6(x21, x22, x23, x24) -> f7(x21, x22, x23, x24) :|: x22 > 1
4.86/2.03	f9(x25, x26, x27, x28) -> f6(x25, x26, x27, x28) :|: TRUE
4.86/2.03	f6(x29, x30, x31, x32) -> f10(x29, x30, x31, x32) :|: x30 <= 1
4.86/2.03	f10(x63, x64, x65, x66) -> f11(x67, x64, x65, x66) :|: TRUE && x67 = x64 + 1
4.86/2.03	f11(x68, x69, x70, x71) -> f12(x68, x69, x72, x71) :|: TRUE && x72 = x70 + 1
4.86/2.03	f3(x41, x42, x43, x44) -> f4(x41, x42, x43, x44) :|: x41 > 1
4.86/2.03	f12(x45, x46, x47, x48) -> f3(x45, x46, x47, x48) :|: TRUE
4.86/2.03	f3(x49, x50, x51, x52) -> f13(x49, x50, x51, x52) :|: x49 <= 1
4.86/2.03	Start term: f1(x, xtmp, res, restmp)
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(3) TerminationGraphProcessor (SOUND)
4.86/2.03	Constructed the termination graph and obtained one non-trivial SCC.
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(4)
4.86/2.03	Obligation:
4.86/2.03	Rules:
4.86/2.03	f3(x41, x42, x43, x44) -> f4(x41, x42, x43, x44) :|: x41 > 1
4.86/2.03	f12(x45, x46, x47, x48) -> f3(x45, x46, x47, x48) :|: TRUE
4.86/2.03	f11(x68, x69, x70, x71) -> f12(x68, x69, x72, x71) :|: TRUE && x72 = x70 + 1
4.86/2.03	f10(x63, x64, x65, x66) -> f11(x67, x64, x65, x66) :|: TRUE && x67 = x64 + 1
4.86/2.03	f6(x29, x30, x31, x32) -> f10(x29, x30, x31, x32) :|: x30 <= 1
4.86/2.03	f5(x9, x10, x11, x12) -> f6(x9, x10, x11, 0) :|: TRUE
4.86/2.03	f4(x5, x6, x7, x8) -> f5(x5, arith, x7, x8) :|: TRUE && arith = x5 - 2
4.86/2.03	f9(x25, x26, x27, x28) -> f6(x25, x26, x27, x28) :|: TRUE
4.86/2.03	f8(x58, x59, x60, x61) -> f9(x58, x59, x60, x62) :|: TRUE && x62 = x61 + 1
4.86/2.03	f7(x53, x54, x55, x56) -> f8(x53, x57, x55, x56) :|: TRUE && x57 = x54 - 2
4.86/2.03	f6(x21, x22, x23, x24) -> f7(x21, x22, x23, x24) :|: x22 > 1
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(5) IntTRSCompressionProof (EQUIVALENT)
4.86/2.03	Compressed rules.
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(6)
4.86/2.03	Obligation:
4.86/2.03	Rules:
4.86/2.03	f6(x29:0, x30:0, x31:0, x32:0) -> f6(x30:0 + 1, x30:0 - 1, x31:0 + 1, 0) :|: x30:0 < 2 && x30:0 > 0
4.86/2.03	f6(x21:0, x22:0, x23:0, x24:0) -> f6(x21:0, x22:0 - 2, x23:0, x24:0 + 1) :|: x22:0 > 1
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
4.86/2.03	Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:
4.86/2.03	
4.86/2.03	   f6(x1, x2, x3, x4) -> f6(x2)
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(8)
4.86/2.03	Obligation:
4.86/2.03	Rules:
4.86/2.03	f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
4.86/2.03	f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(9) PolynomialOrderProcessor (EQUIVALENT)
4.86/2.03	Found the following polynomial interpretation:
4.86/2.03	[f6(x)] = -2 + x
4.86/2.03	
4.86/2.03	The following rules are decreasing:
4.86/2.03	f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
4.86/2.03	f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1
4.86/2.03	The following rules are bounded:
4.86/2.03	f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(10)
4.86/2.03	Obligation:
4.86/2.03	Rules:
4.86/2.03	f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(11) TerminationGraphProcessor (EQUIVALENT)
4.86/2.03	Constructed the termination graph and obtained no non-trivial SCC(s).
4.86/2.03	
4.86/2.03	----------------------------------------
4.86/2.03	
4.86/2.03	(12)
4.86/2.03	YES
4.99/2.07	EOF