/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToLLVMProof [EQUIVALENT, 177 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 897 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 50 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 17 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. ---------------------------------------- (2) Obligation: LLVM Problem Aliases: Data layout: "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" Machine: "x86_64-pc-linux-gnu" Type definitions: Global variables: Function declarations and definitions: *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32, r i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %2 = alloca i32, align 4 %3 = alloca i32, align 4 store %x, %1 store %y, %2 store %r, %3 store 1, %3 br %4 4: %5 = load %2 %6 = icmp sgt %5 0 br %6, %7, %13 7: %8 = load %3 %9 = load %1 %10 = mul %8 %9 store %10, %3 %11 = load %2 %12 = sub %11 1 store %12, %2 br %4 13: %14 = load %3 ret %14 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() %3 = call i32 @__VERIFIER_nondet_int() %4 = call i32 @__VERIFIER_nondet_int() %5 = call i32 @test_fun(i32 %2, i32 %3, i32 %4) ret %5 Analyze Termination of all function calls matching the pattern: main() ---------------------------------------- (3) LLVMToTerminationGraphProof (EQUIVALENT) Constructed symbolic execution graph for LLVM program and proved memory safety. ---------------------------------------- (4) Obligation: SE Graph ---------------------------------------- (5) SymbolicExecutionGraphToSCCProof (SOUND) Splitted symbolic execution graph to 1 SCC. ---------------------------------------- (6) Obligation: SCC ---------------------------------------- (7) SCC2IRS (SOUND) Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: Generated rules. Obtained 13 rulesP rules: f_156(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 4) -> f_157(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 0 < v53 && 2 <= v49 && 2 <= v44 f_157(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_159(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 0 = 0 f_159(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_161(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: TRUE f_161(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_163(v43, v44, v45, v46, v47, v48, v53, 1, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 0 = 0 f_163(v43, v44, v45, v46, v47, v48, v53, 1, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_165(v43, v44, v45, v46, v47, v48, v53, 1, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 0 = 0 f_165(v43, v44, v45, v46, v47, v48, v53, 1, v52, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_167(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: v60 = v52 * v43 f_167(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_168(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: TRUE f_168(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v49, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_169(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 0 = 0 f_169(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_170(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: 1 + v62 = v53 && 0 <= v62 f_170(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_171(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: TRUE f_171(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_172(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) :|: TRUE f_172(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 2, 4) -> f_155(v43, v44, v45, v46, v47, v48, v53, 1, v52, v60, v62, v54, v55, v56, v57, v58, 0, 3, 4) :|: TRUE f_155(v43, v44, v45, v46, v47, v48, v49, 1, v51, v52, v53, v54, v55, v56, v57, v58, 0, 3, 4) -> f_156(v43, v44, v45, v46, v47, v48, v53, 1, v51, v52, v49, v54, v55, v56, v57, v58, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_156(v43:0, v44:0, v45:0, v46:0, v47:0, v48:0, 1 + v62:0, 1, v51:0, v52:0, v49:0, v54:0, v55:0, v56:0, v57:0, v58:0, 0, 3, 4) -> f_156(v43:0, v44:0, v45:0, v46:0, v47:0, v48:0, v62:0, 1, v52:0, v52:0 * v43:0, 1 + v62:0, v54:0, v55:0, v56:0, v57:0, v58:0, 0, 3, 4) :|: v49:0 > 1 && v62:0 > -1 && v44:0 > 1 Filtered unneeded arguments: f_156(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_156(x2, x7, x11) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_156(v44:0, sum~cons_1~v62:0, v49:0) -> f_156(v44:0, v62:0, 1 + v62:0) :|: v62:0 > -1 && v44:0 > 1 && v49:0 > 1 && sum~cons_1~v62:0 = 1 + v62:0 ---------------------------------------- (8) Obligation: Rules: f_156(v44:0, sum~cons_1~v62:0, v49:0) -> f_156(v44:0, v62:0, 1 + v62:0) :|: v62:0 > -1 && v44:0 > 1 && v49:0 > 1 && sum~cons_1~v62:0 = 1 + v62:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_156(v44:0:0, sum~cons_1~v62:0:0, v49:0:0) -> f_156(v44:0:0, v62:0:0, 1 + v62:0:0) :|: v62:0:0 > -1 && v44:0:0 > 1 && v49:0:0 > 1 && sum~cons_1~v62:0:0 = 1 + v62:0:0 ---------------------------------------- (11) RankingReductionPairProof (EQUIVALENT) Interpretation: [ f_156 ] = f_156_2 The following rules are decreasing: f_156(v44:0:0, sum~cons_1~v62:0:0, v49:0:0) -> f_156(v44:0:0, v62:0:0, 1 + v62:0:0) :|: v62:0:0 > -1 && v44:0:0 > 1 && v49:0:0 > 1 && sum~cons_1~v62:0:0 = 1 + v62:0:0 The following rules are bounded: f_156(v44:0:0, sum~cons_1~v62:0:0, v49:0:0) -> f_156(v44:0:0, v62:0:0, 1 + v62:0:0) :|: v62:0:0 > -1 && v44:0:0 > 1 && v49:0:0 > 1 && sum~cons_1~v62:0:0 = 1 + v62:0:0 ---------------------------------------- (12) YES