/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, 178 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1202 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 64 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 0 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) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %2 = alloca i32, align 4 %c = alloca i32, align 4 store %x, %1 store %y, %2 store 0, %c br %3 3: %4 = load %1 %5 = load %2 %6 = icmp sgt %4 %5 br %6, %7, %12 7: %8 = load %1 %9 = sub %8 1 store %9, %1 %10 = load %c %11 = add %10 1 store %11, %c br %3 12: %13 = load %c ret %13 *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 @test_fun(i32 %2, i32 %3) ret %4 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_202(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_203(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0 f_203(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_204(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: v98 < v104 f_204(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_206(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0 f_206(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_208(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE f_208(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_210(v97, v98, v99, v100, v101, v104, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0 f_210(v97, v98, v99, v100, v101, v104, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_212(v97, v98, v99, v100, v101, v104, 1, v113, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 1 + v113 = v104 f_212(v97, v98, v99, v100, v101, v104, 1, v113, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_214(v97, v98, v99, v100, v101, v104, 1, v113, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE f_214(v97, v98, v99, v100, v101, v104, 1, v113, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_215(v97, v98, v99, v100, v101, v104, 1, v113, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0 f_215(v97, v98, v99, v100, v101, v104, 1, v113, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_216(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: v115 = 1 + v106 && 2 <= v115 f_216(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_217(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: TRUE f_217(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_218(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: TRUE f_218(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_201(v97, v98, v99, v100, v101, v104, 1, v113, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE f_201(v97, v98, v99, v100, v101, v102, 1, v104, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_202(v97, v98, v99, v100, v101, v104, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_202(v97:0, v98:0, v99:0, v100:0, v101:0, 1 + v113:0, 1, v102:0, v105:0, v106:0, v107:0, v108:0, v109:0, v110:0, v111:0, 0, 3, 4) -> f_202(v97:0, v98:0, v99:0, v100:0, v101:0, v113:0, 1, 1 + v113:0, v106:0, 1 + v106:0, v107:0, v108:0, v109:0, v110:0, v111:0, 0, 3, 4) :|: v106:0 > 0 && v98:0 < 1 + v113:0 Filtered unneeded arguments: f_202(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_202(x2, x6, x10) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_202(v98:0, sum~cons_1~v113:0, v106:0) -> f_202(v98:0, v113:0, 1 + v106:0) :|: v106:0 > 0 && v98:0 < 1 + v113:0 && sum~cons_1~v113:0 = 1 + v113:0 ---------------------------------------- (8) Obligation: Rules: f_202(v98:0, sum~cons_1~v113:0, v106:0) -> f_202(v98:0, v113:0, 1 + v106:0) :|: v106:0 > 0 && v98:0 < 1 + v113:0 && sum~cons_1~v113:0 = 1 + v113:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_202(v98:0:0, sum~cons_1~v113:0:0, v106:0:0) -> f_202(v98:0:0, v113:0:0, 1 + v106:0:0) :|: v106:0:0 > 0 && v98:0:0 < 1 + v113:0:0 && sum~cons_1~v113:0:0 = 1 + v113:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_202(x, x1, x2)] = -x + x1 The following rules are decreasing: f_202(v98:0:0, sum~cons_1~v113:0:0, v106:0:0) -> f_202(v98:0:0, v113:0:0, 1 + v106:0:0) :|: v106:0:0 > 0 && v98:0:0 < 1 + v113:0:0 && sum~cons_1~v113:0:0 = 1 + v113:0:0 The following rules are bounded: f_202(v98:0:0, sum~cons_1~v113:0:0, v106:0:0) -> f_202(v98:0:0, v113:0:0, 1 + v106:0:0) :|: v106:0:0 > 0 && v98:0:0 < 1 + v113:0:0 && sum~cons_1~v113:0:0 = 1 + v113:0:0 ---------------------------------------- (12) YES