12.82/4.41 YES 12.82/4.42 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 12.82/4.42 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.82/4.42 12.82/4.42 12.82/4.42 Termination of the given C Problem could be proven: 12.82/4.42 12.82/4.42 (0) C Problem 12.82/4.42 (1) CToLLVMProof [EQUIVALENT, 169 ms] 12.82/4.42 (2) LLVM problem 12.82/4.42 (3) LLVMToTerminationGraphProof [EQUIVALENT, 1838 ms] 12.82/4.42 (4) LLVM Symbolic Execution Graph 12.82/4.42 (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] 12.82/4.42 (6) LLVM Symbolic Execution SCC 12.82/4.42 (7) SCC2IRS [SOUND, 82 ms] 12.82/4.42 (8) IntTRS 12.82/4.42 (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] 12.82/4.42 (10) IntTRS 12.82/4.42 (11) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 12.82/4.42 (12) YES 12.82/4.42 12.82/4.42 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (0) 12.82/4.42 Obligation: 12.82/4.42 c file /export/starexec/sandbox/benchmark/theBenchmark.c 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (1) CToLLVMProof (EQUIVALENT) 12.82/4.42 Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM. 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (2) 12.82/4.42 Obligation: 12.82/4.42 LLVM Problem 12.82/4.42 12.82/4.42 Aliases: 12.82/4.42 12.82/4.42 Data layout: 12.82/4.42 12.82/4.42 "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" 12.82/4.42 12.82/4.42 Machine: 12.82/4.42 12.82/4.42 "x86_64-pc-linux-gnu" 12.82/4.42 12.82/4.42 Type definitions: 12.82/4.42 12.82/4.42 Global variables: 12.82/4.42 12.82/4.42 Function declarations and definitions: 12.82/4.42 12.82/4.42 *BasicFunctionTypename: "__VERIFIER_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 12.82/4.42 *BasicFunctionTypename: "id" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 12.82/4.42 0: 12.82/4.42 %1 = alloca i32, align 4 12.82/4.42 %2 = alloca i32, align 4 12.82/4.42 store %x, %2 12.82/4.42 %3 = load %2 12.82/4.42 %4 = icmp eq %3 0 12.82/4.42 br %4, %5, %6 12.82/4.42 5: 12.82/4.42 store 0, %1 12.82/4.42 br %11 12.82/4.42 6: 12.82/4.42 %7 = load %2 12.82/4.42 %8 = sub %7 1 12.82/4.42 %9 = call i32 @id(i32 %8) 12.82/4.42 %10 = add %9 1 12.82/4.42 store %10, %1 12.82/4.42 br %11 12.82/4.42 11: 12.82/4.42 %12 = load %1 12.82/4.42 ret %12 12.82/4.42 12.82/4.42 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 12.82/4.42 0: 12.82/4.42 %1 = alloca i32, align 4 12.82/4.42 %input = alloca i32, align 4 12.82/4.42 %result = alloca i32, align 4 12.82/4.42 store 0, %1 12.82/4.42 store 10, %input 12.82/4.42 %2 = load %input 12.82/4.42 %3 = call i32 @id(i32 %2) 12.82/4.42 store %3, %result 12.82/4.42 %4 = load %result 12.82/4.42 %5 = icmp eq %4 10 12.82/4.42 br %5, %6, %8 12.82/4.42 6: 12.82/4.42 br %7 12.82/4.42 7: 12.82/4.42 Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() 12.82/4.42 br %8 12.82/4.42 8: 12.82/4.42 %9 = load %1 12.82/4.42 ret %9 12.82/4.42 12.82/4.42 12.82/4.42 Analyze Termination of all function calls matching the pattern: 12.82/4.42 main() 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (3) LLVMToTerminationGraphProof (EQUIVALENT) 12.82/4.42 Constructed symbolic execution graph for LLVM program and proved memory safety. 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (4) 12.82/4.42 Obligation: 12.82/4.42 SE Graph 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (5) SymbolicExecutionGraphToSCCProof (SOUND) 12.82/4.42 Splitted symbolic execution graph to 1 SCC. 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (6) 12.82/4.42 Obligation: 12.82/4.42 SCC 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (7) SCC2IRS (SOUND) 12.82/4.42 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 12.82/4.42 Generated rules. Obtained 12 rulesP rules: 12.82/4.42 f_153(v56, v65, v57, v58, v59, v60, v61, v62, v66, 0, 10, 3, 1, 4) -> f_154(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: 1 <= v67 && v68 = 3 + v67 && 4 <= v68 12.82/4.42 f_154(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_155(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: TRUE 12.82/4.42 f_155(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_156(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: 0 = 0 12.82/4.42 f_156(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_158(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) :|: v56 != 0 12.82/4.42 f_158(v56, v65, v67, v57, v58, v59, v60, v61, v62, v66, v68, 0, 10, 3, 1, 4) -> f_160(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: 0 = 0 12.82/4.42 f_160(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_162(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: TRUE 12.82/4.42 f_162(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_164(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) :|: 0 = 0 12.82/4.42 f_164(v56, v65, v67, 0, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4) -> f_166(v56, v65, v67, 0, v70, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4, 9) :|: 1 + v70 = v56 && 0 <= v70 && v70 <= 9 12.82/4.42 f_166(v56, v65, v67, 0, v70, v57, v58, v59, v60, v61, v62, v66, v68, 10, 3, 1, 4, 9) -> f_168(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) :|: 0 = 0 12.82/4.42 f_168(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) -> f_170(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) :|: TRUE 12.82/4.42 f_170(v70, v57, v58, v59, v60, v61, v62, v65, v66, v67, v68, 0, 10, v56, 3, 1, 4, 9) -> f_152(v70, v57, v58, v59, v60, v61, v62, 0, 10, 3, 1, 4) :|: TRUE 12.82/4.42 f_152(v56, v57, v58, v59, v60, v61, v62, 0, 10, 3, 1, 4) -> f_153(v56, v65, v57, v58, v59, v60, v61, v62, v66, 0, 10, 3, 1, 4) :|: 1 <= v65 && v66 = 3 + v65 && 4 <= v66 12.82/4.42 Combined rules. Obtained 1 rulesP rules: 12.82/4.42 f_153(1 + v70:0, v65:0, v57:0, v58:0, v59:0, v60:0, v61:0, v62:0, v66:0, 0, 10, 3, 1, 4) -> f_153(v70:0, v65:1, v57:0, v58:0, v59:0, v60:0, v61:0, v62:0, 3 + v65:1, 0, 10, 3, 1, 4) :|: v67:0 > 0 && v70:0 > -1 && v70:0 < 10 && v65:1 > 0 12.82/4.42 Filtered unneeded arguments: 12.82/4.42 f_153(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_153(x1) 12.82/4.42 Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: 12.82/4.42 f_153(sum~cons_1~v70:0) -> f_153(v70:0) :|: v70:0 > -1 && v70:0 < 10 && sum~cons_1~v70:0 = 1 + v70:0 12.82/4.42 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (8) 12.82/4.42 Obligation: 12.82/4.42 Rules: 12.82/4.42 f_153(sum~cons_1~v70:0) -> f_153(v70:0) :|: v70:0 > -1 && v70:0 < 10 && sum~cons_1~v70:0 = 1 + v70:0 12.82/4.42 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (9) IntTRSCompressionProof (EQUIVALENT) 12.82/4.42 Compressed rules. 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (10) 12.82/4.42 Obligation: 12.82/4.42 Rules: 12.82/4.42 f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0 12.82/4.42 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (11) PolynomialOrderProcessor (EQUIVALENT) 12.82/4.42 Found the following polynomial interpretation: 12.82/4.42 [f_153(x)] = x 12.82/4.42 12.82/4.42 The following rules are decreasing: 12.82/4.42 f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0 12.82/4.42 The following rules are bounded: 12.82/4.42 f_153(sum~cons_1~v70:0:0) -> f_153(v70:0:0) :|: v70:0:0 > -1 && v70:0:0 < 10 && sum~cons_1~v70:0:0 = 1 + v70:0:0 12.82/4.42 12.82/4.42 ---------------------------------------- 12.82/4.42 12.82/4.42 (12) 12.82/4.42 YES 13.13/4.46 EOF