/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, 1311 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 60 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 24 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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %x = alloca i32, align 4 %c = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() store %2, %x %3 = call i32 @__VERIFIER_nondet_int() store %3, %c %4 = load %c %5 = icmp slt %4 2 br %5, %6, %7 6: store 0, %1 br %20 7: br %8 8: %9 = load %x %10 = load %c %11 = add %9 %10 %12 = icmp sge %11 0 br %12, %13, %19 13: %14 = load %x %15 = load %c %16 = sub %14 %15 store %16, %x %17 = load %c %18 = add %17 1 store %18, %c br %8 19: store 0, %1 br %20 20: %21 = load %1 ret %21 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 15 rulesP rules: f_178(v47, v48, v49, v50, v51, 0, v57, v54, v55, 1, v53, v58, v59, v60, v61, 3, 2, 4) -> f_179(v47, v48, v49, v50, v51, 0, v57, v58, v55, 1, v53, v54, v59, v60, v61, 3, 2, 4) :|: 0 = 0 f_179(v47, v48, v49, v50, v51, 0, v57, v58, v55, 1, v53, v54, v59, v60, v61, 3, 2, 4) -> f_180(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) :|: v62 = v57 + v58 f_180(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) -> f_181(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) :|: 0 <= v62 f_181(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) -> f_183(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) :|: 0 = 0 f_183(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) -> f_185(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) :|: TRUE f_185(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v53, v54, v59, v60, v61, 3, 2, 4) -> f_187(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v54, v59, v60, v61, 3, 2, 4) :|: 0 = 0 f_187(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v54, v59, v60, v61, 3, 2, 4) -> f_189(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v54, v59, v60, v61, 3, 2, 4) :|: 0 = 0 f_189(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v54, v59, v60, v61, 3, 2, 4) -> f_191(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v54, v59, v60, v61, 3, 2, 4) :|: v66 + v58 = v57 f_191(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v54, v59, v60, v61, 3, 2, 4) -> f_193(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v54, v59, v60, v61, 3, 2, 4) :|: TRUE f_193(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v54, v59, v60, v61, 3, 2, 4) -> f_194(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v59, v60, v61, 3, 2, 4) :|: 0 = 0 f_194(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v59, v60, v61, 3, 2, 4) -> f_195(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) :|: v68 = 1 + v58 && 4 <= v68 f_195(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) -> f_196(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) :|: TRUE f_196(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) -> f_197(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) :|: TRUE f_197(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) -> f_177(v47, v48, v49, v50, v51, 0, v57, v58, v62, 1, v66, v68, v59, v60, v61, 3, 2, 4) :|: TRUE f_177(v47, v48, v49, v50, v51, 0, v53, v54, v55, 1, v57, v58, v59, v60, v61, 3, 2, 4) -> f_178(v47, v48, v49, v50, v51, 0, v57, v54, v55, 1, v53, v58, v59, v60, v61, 3, 2, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_178(v47:0, v48:0, v49:0, v50:0, v51:0, 0, v66:0 + v58:0, v54:0, v55:0, 1, v53:0, v58:0, v59:0, v60:0, v61:0, 3, 2, 4) -> f_178(v47:0, v48:0, v49:0, v50:0, v51:0, 0, v66:0, v58:0, v66:0 + v58:0 + v58:0, 1, v66:0 + v58:0, 1 + v58:0, v59:0, v60:0, v61:0, 3, 2, 4) :|: v58:0 > 2 && v66:0 + v58:0 + v58:0 > -1 Filtered unneeded arguments: f_178(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_178(x7, x12) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_178(sum~v66:0~v58:0, v58:0) -> f_178(v66:0, 1 + v58:0) :|: v58:0 > 2 && v66:0 + v58:0 + v58:0 > -1 && sum~v66:0~v58:0 = v66:0 + v58:0 ---------------------------------------- (8) Obligation: Rules: f_178(sum~v66:0~v58:0, v58:0) -> f_178(v66:0, 1 + v58:0) :|: v58:0 > 2 && v66:0 + v58:0 + v58:0 > -1 && sum~v66:0~v58:0 = v66:0 + v58:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_178(sum~v66:0:0~v58:0:0, v58:0:0) -> f_178(v66:0:0, 1 + v58:0:0) :|: v58:0:0 > 2 && v66:0:0 + v58:0:0 + v58:0:0 > -1 && sum~v66:0:0~v58:0:0 = v66:0:0 + v58:0:0 ---------------------------------------- (11) RankingReductionPairProof (EQUIVALENT) Interpretation: [ f_178 ] = 1/2*f_178_2 + 1/2*f_178_1 The following rules are decreasing: f_178(sum~v66:0:0~v58:0:0, v58:0:0) -> f_178(v66:0:0, 1 + v58:0:0) :|: v58:0:0 > 2 && v66:0:0 + v58:0:0 + v58:0:0 > -1 && sum~v66:0:0~v58:0:0 = v66:0:0 + v58:0:0 The following rules are bounded: f_178(sum~v66:0:0~v58:0:0, v58:0:0) -> f_178(v66:0:0, 1 + v58:0:0) :|: v58:0:0 > 2 && v66:0:0 + v58:0:0 + v58:0:0 > -1 && sum~v66:0:0~v58:0:0 = v66:0:0 + v58:0:0 ---------------------------------------- (12) YES