6.10/2.82	YES
6.10/2.86	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
6.10/2.86	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.10/2.86	
6.10/2.86	
6.10/2.86	Termination of the given C Problem could be proven:
6.10/2.86	
6.10/2.86	(0) C Problem
6.10/2.86	(1) CToLLVMProof [EQUIVALENT, 175 ms]
6.10/2.86	(2) LLVM problem
6.10/2.86	(3) LLVMToTerminationGraphProof [EQUIVALENT, 394 ms]
6.10/2.86	(4) LLVM Symbolic Execution Graph
6.10/2.86	(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
6.10/2.86	(6) LLVM Symbolic Execution SCC
6.10/2.86	(7) SCC2IRS [SOUND, 27 ms]
6.10/2.86	(8) IntTRS
6.10/2.86	(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.10/2.86	(10) IntTRS
6.10/2.86	(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
6.10/2.86	(12) YES
6.10/2.86	
6.10/2.86	
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(0)
6.10/2.86	Obligation:
6.10/2.86	c file /export/starexec/sandbox/benchmark/theBenchmark.c
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(1) CToLLVMProof (EQUIVALENT)
6.10/2.86	Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM.
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(2)
6.10/2.86	Obligation:
6.10/2.86	LLVM Problem
6.10/2.86	
6.10/2.86	Aliases:
6.10/2.86	
6.10/2.86	Data layout:
6.10/2.86	
6.10/2.86	"e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
6.10/2.86	
6.10/2.86	Machine:
6.10/2.86	
6.10/2.86	"x86_64-pc-linux-gnu"
6.10/2.86	
6.10/2.86	Type definitions:
6.10/2.86	
6.10/2.86	Global variables:
6.10/2.86	
6.10/2.86	Function declarations and definitions:
6.10/2.86	
6.10/2.86	*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
6.10/2.86	*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
6.10/2.86		0:
6.10/2.86			%1 = alloca i32, align 4
6.10/2.86			%x = alloca i32, align 4
6.10/2.86			store 0, %1
6.10/2.86			%2 = call i32 @__VERIFIER_nondet_int()
6.10/2.86			store %2, %x
6.10/2.86			%3 = load %x
6.10/2.86			%4 = icmp sle %3 0
6.10/2.86			br %4, %5, %6
6.10/2.86		5:
6.10/2.86			store 0, %1
6.10/2.86			br %14
6.10/2.86		6:
6.10/2.86			br %7
6.10/2.86		7:
6.10/2.86			%8 = load %x
6.10/2.86			%9 = icmp ne %8 0
6.10/2.86			br %9, %10, %13
6.10/2.86		10:
6.10/2.86			%11 = load %x
6.10/2.86			%12 = sub %11 1
6.10/2.86			store %12, %x
6.10/2.86			br %7
6.10/2.86		13:
6.10/2.86			store 0, %1
6.10/2.86			br %14
6.10/2.86		14:
6.10/2.86			%15 = load %1
6.10/2.86			ret %15
6.10/2.86	
6.10/2.86	
6.10/2.86	Analyze Termination of all function calls matching the pattern:
6.10/2.86	main()
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(3) LLVMToTerminationGraphProof (EQUIVALENT)
6.10/2.86	Constructed symbolic execution graph for LLVM program and proved memory safety.
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(4)
6.10/2.86	Obligation:
6.10/2.86	SE Graph
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(5) SymbolicExecutionGraphToSCCProof (SOUND)
6.10/2.86	Splitted symbolic execution graph to 1 SCC.
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(6)
6.10/2.86	Obligation:
6.10/2.86	SCC
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(7) SCC2IRS (SOUND)
6.10/2.86	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
6.10/2.86	Generated rules. Obtained 9 rulesP rules:
6.10/2.86	f_123(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 4) -> f_124(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: v28 != 0 && 2 <= v26 && 2 <= v24
6.10/2.86	f_124(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_126(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: 0 = 0
6.10/2.86	f_126(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_128(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: TRUE
6.10/2.86	f_128(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_130(v22, v23, v24, 0, v28, 1, v29, v30, 3, 2, 4) :|: 0 = 0
6.10/2.86	f_130(v22, v23, v24, 0, v28, 1, v29, v30, 3, 2, 4) -> f_132(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: 1 + v31 = v28 && 0 <= v31
6.10/2.86	f_132(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_134(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: TRUE
6.10/2.86	f_134(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_136(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: TRUE
6.10/2.86	f_136(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_122(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 4) :|: TRUE
6.10/2.86	f_122(v22, v23, v24, 0, v26, 1, v28, v29, v30, 3, 4) -> f_123(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 4) :|: 0 = 0
6.10/2.86	Combined rules. Obtained 1 rulesP rules:
6.10/2.86	f_123(v22:0, v23:0, v24:0, 0, 1 + v31:0, 1, v26:0, v29:0, v30:0, 3, 4) -> f_123(v22:0, v23:0, v24:0, 0, v31:0, 1, 1 + v31:0, v29:0, v30:0, 3, 4) :|: v26:0 > 1 && v31:0 > -1 && v24:0 > 1
6.10/2.86	Filtered unneeded arguments:
6.10/2.86	   f_123(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f_123(x3, x5, x7)
6.10/2.86	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
6.10/2.86	f_123(v24:0, sum~cons_1~v31:0, v26:0) -> f_123(v24:0, v31:0, 1 + v31:0) :|: v31:0 > -1 && v24:0 > 1 && v26:0 > 1 && sum~cons_1~v31:0 = 1 + v31:0
6.10/2.86	
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(8)
6.10/2.86	Obligation:
6.10/2.86	Rules:
6.10/2.86	f_123(v24:0, sum~cons_1~v31:0, v26:0) -> f_123(v24:0, v31:0, 1 + v31:0) :|: v31:0 > -1 && v24:0 > 1 && v26:0 > 1 && sum~cons_1~v31:0 = 1 + v31:0
6.10/2.86	
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(9) IntTRSCompressionProof (EQUIVALENT)
6.10/2.86	Compressed rules.
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(10)
6.10/2.86	Obligation:
6.10/2.86	Rules:
6.10/2.86	f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0
6.10/2.86	
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(11) PolynomialOrderProcessor (EQUIVALENT)
6.10/2.86	Found the following polynomial interpretation:
6.10/2.86	[f_123(x, x1, x2)] = x1
6.10/2.86	
6.10/2.86	The following rules are decreasing:
6.10/2.86	f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0
6.10/2.86	The following rules are bounded:
6.10/2.86	f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0
6.10/2.86	
6.10/2.86	----------------------------------------
6.10/2.86	
6.10/2.86	(12)
6.10/2.86	YES
7.11/2.96	EOF