6.89/2.82 YES 7.15/2.91 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 7.15/2.91 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.15/2.91 7.15/2.91 7.15/2.91 Termination of the given C Problem could be proven: 7.15/2.91 7.15/2.91 (0) C Problem 7.15/2.91 (1) CToLLVMProof [EQUIVALENT, 171 ms] 7.15/2.91 (2) LLVM problem 7.15/2.91 (3) LLVMToTerminationGraphProof [EQUIVALENT, 587 ms] 7.15/2.91 (4) LLVM Symbolic Execution Graph 7.15/2.91 (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] 7.15/2.91 (6) LLVM Symbolic Execution SCC 7.15/2.91 (7) SCC2IRS [SOUND, 72 ms] 7.15/2.91 (8) IntTRS 7.15/2.91 (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] 7.15/2.91 (10) IntTRS 7.15/2.91 (11) PolynomialOrderProcessor [EQUIVALENT, 9 ms] 7.15/2.91 (12) YES 7.15/2.91 7.15/2.91 7.15/2.91 ---------------------------------------- 7.15/2.91 7.15/2.91 (0) 7.15/2.91 Obligation: 7.15/2.91 c file /export/starexec/sandbox/benchmark/theBenchmark.c 7.15/2.91 ---------------------------------------- 7.15/2.91 7.15/2.91 (1) CToLLVMProof (EQUIVALENT) 7.15/2.91 Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM. 7.15/2.91 ---------------------------------------- 7.15/2.91 7.15/2.91 (2) 7.15/2.91 Obligation: 7.15/2.91 LLVM Problem 7.15/2.91 7.15/2.91 Aliases: 7.15/2.91 7.15/2.91 Data layout: 7.15/2.91 7.15/2.91 "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" 7.15/2.91 7.15/2.91 Machine: 7.15/2.91 7.15/2.91 "x86_64-pc-linux-gnu" 7.15/2.91 7.15/2.91 Type definitions: 7.15/2.91 7.15/2.91 Global variables: 7.15/2.91 7.15/2.91 Function declarations and definitions: 7.15/2.91 7.15/2.91 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 7.15/2.91 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 7.15/2.91 0: 7.15/2.91 %1 = alloca i32, align 4 7.15/2.91 %x = alloca i32, align 4 7.15/2.91 %y = alloca i32, align 4 7.15/2.91 store 0, %1 7.15/2.91 %2 = call i32 (...)* @__VERIFIER_nondet_int() 7.15/2.91 store %2, %x 7.15/2.91 %3 = call i32 (...)* @__VERIFIER_nondet_int() 7.15/2.91 store %3, %y 7.15/2.91 br %4 7.15/2.91 4: 7.15/2.91 %5 = load %x 7.15/2.91 %6 = icmp sgt %5 0 7.15/2.91 br %6, %7, %11 7.15/2.91 7: 7.15/2.91 %8 = load %y 7.15/2.91 store %8, %x 7.15/2.91 %9 = load %y 7.15/2.91 %10 = add %9 -1 7.15/2.91 store %10, %y 7.15/2.91 br %4 7.15/2.91 11: 7.15/2.91 ret 0 7.15/2.91 7.15/2.91 7.15/2.91 Analyze Termination of all function calls matching the pattern: 7.15/2.91 main() 7.15/2.91 ---------------------------------------- 7.15/2.91 7.15/2.91 (3) LLVMToTerminationGraphProof (EQUIVALENT) 7.30/2.91 Constructed symbolic execution graph for LLVM program and proved memory safety. 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (4) 7.30/2.91 Obligation: 7.30/2.91 SE Graph 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (5) SymbolicExecutionGraphToSCCProof (SOUND) 7.30/2.91 Splitted symbolic execution graph to 1 SCC. 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (6) 7.30/2.91 Obligation: 7.30/2.91 SCC 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (7) SCC2IRS (SOUND) 7.30/2.91 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 7.30/2.91 Generated rules. Obtained 11 rulesP rules: 7.30/2.91 f_111(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_112(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 < v40 && 0 <= v41 && 1 <= v37 7.30/2.91 f_112(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_114(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 7.30/2.91 f_114(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_116(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: TRUE 7.30/2.91 f_116(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_118(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 7.30/2.91 f_118(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_119(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: TRUE 7.30/2.91 f_119(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_120(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 7.30/2.91 f_120(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) -> f_121(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: 1 + v47 = v41 && 0 <= 1 + v47 7.30/2.91 f_121(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_122(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE 7.30/2.91 f_122(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_123(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE 7.30/2.91 f_123(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) -> f_110(v33, v34, v35, v36, v37, v40, 1, v41, v47, v42, v43, v44, 0, 3, 4) :|: TRUE 7.30/2.91 f_110(v33, v34, v35, v36, v37, v38, 1, v40, v41, v42, v43, v44, 0, 3, 4) -> f_111(v33, v34, v35, v36, v37, v40, 1, v41, v42, v43, v44, 0, 3, 4) :|: 0 = 0 7.30/2.91 Combined rules. Obtained 1 rulesP rules: 7.30/2.91 f_111(v33:0, v34:0, v35:0, v36:0, v37:0, v40:0, 1, 1 + v47:0, v42:0, v43:0, v44:0, 0, 3, 4) -> f_111(v33:0, v34:0, v35:0, v36:0, v37:0, 1 + v47:0, 1, v47:0, v42:0, v43:0, v44:0, 0, 3, 4) :|: v47:0 > -2 && v40:0 > 0 && v37:0 > 0 7.30/2.91 Filtered unneeded arguments: 7.30/2.91 f_111(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_111(x5, x6, x8) 7.30/2.91 Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: 7.30/2.91 f_111(v37:0, v40:0, sum~cons_1~v47:0) -> f_111(v37:0, 1 + v47:0, v47:0) :|: v40:0 > 0 && v37:0 > 0 && v47:0 > -2 && sum~cons_1~v47:0 = 1 + v47:0 7.30/2.91 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (8) 7.30/2.91 Obligation: 7.30/2.91 Rules: 7.30/2.91 f_111(v37:0, v40:0, sum~cons_1~v47:0) -> f_111(v37:0, 1 + v47:0, v47:0) :|: v40:0 > 0 && v37:0 > 0 && v47:0 > -2 && sum~cons_1~v47:0 = 1 + v47:0 7.30/2.91 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (9) IntTRSCompressionProof (EQUIVALENT) 7.30/2.91 Compressed rules. 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (10) 7.30/2.91 Obligation: 7.30/2.91 Rules: 7.30/2.91 f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 7.30/2.91 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (11) PolynomialOrderProcessor (EQUIVALENT) 7.30/2.91 Found the following polynomial interpretation: 7.30/2.91 [f_111(x, x1, x2)] = x2 7.30/2.91 7.30/2.91 The following rules are decreasing: 7.30/2.91 f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 7.30/2.91 The following rules are bounded: 7.30/2.91 f_111(v37:0:0, v40:0:0, sum~cons_1~v47:0:0) -> f_111(v37:0:0, 1 + v47:0:0, v47:0:0) :|: v40:0:0 > 0 && v37:0:0 > 0 && v47:0:0 > -2 && sum~cons_1~v47:0:0 = 1 + v47:0:0 7.30/2.91 7.30/2.91 ---------------------------------------- 7.30/2.91 7.30/2.91 (12) 7.30/2.91 YES 7.30/2.94 EOF