/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 180 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1211 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 53 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 11 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox/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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %x = alloca i32, align 4 %a = alloca i32, align 4 %b = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() store %2, %x %3 = call i32 @__VERIFIER_nondet_int() store %3, %a %4 = call i32 @__VERIFIER_nondet_int() store %4, %b %5 = load %a %6 = load %b %7 = icmp ne %5 %6 br %7, %8, %9 8: store 0, %1 br %21 9: br %10 10: %11 = load %x %12 = icmp sge %11 0 br %12, %13, %20 13: %14 = load %x %15 = load %a %16 = add %14 %15 %17 = load %b %18 = sub %16 %17 %19 = sub %18 1 store %19, %x br %10 20: store 0, %1 br %21 21: %22 = load %1 ret %22 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_182(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) -> f_183(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) :|: 0 <= v58 && 1 <= v55 && 1 <= v52 f_183(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) -> f_185(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) :|: 0 = 0 f_185(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) -> f_187(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) :|: TRUE f_187(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) -> f_189(v48, v49, v50, v51, v52, v53, 0, v58, 1, v57, v55, v59, v60, v61, v62, 3, 4) :|: 0 = 0 f_189(v48, v49, v50, v51, v52, v53, 0, v58, 1, v57, v55, v59, v60, v61, v62, 3, 4) -> f_191(v48, v49, v50, v51, v52, v53, 0, v58, 1, v57, v55, v59, v60, v61, v62, 3, 4) :|: 0 = 0 f_191(v48, v49, v50, v51, v52, v53, 0, v58, 1, v57, v55, v59, v60, v61, v62, 3, 4) -> f_193(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v55, v59, v60, v61, v62, 3, 4) :|: v67 = v58 + v53 f_193(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v55, v59, v60, v61, v62, 3, 4) -> f_195(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v55, v59, v60, v61, v62, 3, 4) :|: 0 = 0 f_195(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v55, v59, v60, v61, v62, 3, 4) -> f_196(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v59, v60, v61, v62, 3, 4) :|: v58 + v53 = v67 f_196(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v59, v60, v61, v62, 3, 4) -> f_197(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) :|: 1 + v68 = v58 && 0 <= 1 + v68 f_197(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) -> f_198(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) :|: TRUE f_198(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) -> f_199(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) :|: TRUE f_199(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) -> f_181(v48, v49, v50, v51, v52, v53, 0, v58, 1, v67, v68, v59, v60, v61, v62, 3, 4) :|: TRUE f_181(v48, v49, v50, v51, v52, v53, 0, v55, 1, v57, v58, v59, v60, v61, v62, 3, 4) -> f_182(v48, v49, v50, v51, v52, v53, 0, v58, 1, v55, v57, v59, v60, v61, v62, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_182(v48:0, v49:0, v50:0, v51:0, v52:0, v53:0, 0, 1 + v68:0, 1, v55:0, v57:0, v59:0, v60:0, v61:0, v62:0, 3, 4) -> f_182(v48:0, v49:0, v50:0, v51:0, v52:0, v53:0, 0, v68:0, 1, 1 + v68:0, 1 + v68:0 + v53:0, v59:0, v60:0, v61:0, v62:0, 3, 4) :|: v55:0 > 0 && v68:0 > -2 && v52:0 > 0 Filtered unneeded arguments: f_182(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_182(x5, x8, x10) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_182(v52:0, sum~cons_1~v68:0, v55:0) -> f_182(v52:0, v68:0, 1 + v68:0) :|: v68:0 > -2 && v52:0 > 0 && v55:0 > 0 && sum~cons_1~v68:0 = 1 + v68:0 ---------------------------------------- (8) Obligation: Rules: f_182(v52:0, sum~cons_1~v68:0, v55:0) -> f_182(v52:0, v68:0, 1 + v68:0) :|: v68:0 > -2 && v52:0 > 0 && v55:0 > 0 && sum~cons_1~v68:0 = 1 + v68:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_182(v52:0:0, sum~cons_1~v68:0:0, v55:0:0) -> f_182(v52:0:0, v68:0:0, 1 + v68:0:0) :|: v68:0:0 > -2 && v52:0:0 > 0 && v55:0:0 > 0 && sum~cons_1~v68:0:0 = 1 + v68:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_182(x, x1, x2)] = x1 The following rules are decreasing: f_182(v52:0:0, sum~cons_1~v68:0:0, v55:0:0) -> f_182(v52:0:0, v68:0:0, 1 + v68:0:0) :|: v68:0:0 > -2 && v52:0:0 > 0 && v55:0:0 > 0 && sum~cons_1~v68:0:0 = 1 + v68:0:0 The following rules are bounded: f_182(v52:0:0, sum~cons_1~v68:0:0, v55:0:0) -> f_182(v52:0:0, v68:0:0, 1 + v68:0:0) :|: v68:0:0 > -2 && v52:0:0 > 0 && v55:0:0 > 0 && sum~cons_1~v68:0:0 = 1 + v68:0:0 ---------------------------------------- (12) YES