/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, 179 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 705 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 78 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 0 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: true 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 %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, %b br %4 4: %5 = load %b %6 = icmp ne %5 0 br %6, %8, %7 7: br %15 8: %9 = call i32 (...)* @__VERIFIER_nondet_int() store %9, %b %10 = load %x %11 = sub %10 1 store %11, %x %12 = load %x %13 = icmp sge %12 0 %14 = zext i1 %13 to i32 store %14, %b br %4 15: ret 0 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_151(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) -> f_152(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) :|: 0 = 0 f_152(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) -> f_153(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) :|: TRUE f_153(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) -> f_154(v60, v61, v62, v63, v64, 1, v74, v68, v69, v70, v71, v72, 0, 3, 4) :|: TRUE f_154(v60, v61, v62, v63, v64, 1, v74, v68, v69, v70, v71, v72, 0, 3, 4) -> f_155(v60, v61, v62, v63, v64, 1, v74, v68, v69, v70, v71, v72, 0, 3, 4) :|: TRUE f_155(v60, v61, v62, v63, v64, 1, v74, v68, v69, v70, v71, v72, 0, 3, 4) -> f_156(v60, v61, v62, v63, v64, 1, v74, v69, v70, v71, v72, 0, 3, 4) :|: 0 = 0 f_156(v60, v61, v62, v63, v64, 1, v74, v69, v70, v71, v72, 0, 3, 4) -> f_157(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) :|: 1 + v76 = v69 && 0 <= 1 + v76 f_157(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) -> f_158(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) :|: TRUE f_158(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) -> f_159(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) :|: 0 = 0 f_159(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) -> f_160(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) :|: 0 <= v76 && 1 <= v69 && 2 <= v63 f_160(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) -> f_162(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) :|: 0 = 0 f_162(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) -> f_164(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) :|: 0 = 0 f_164(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) -> f_166(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) :|: TRUE f_166(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) -> f_168(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) :|: TRUE f_168(v60, v61, v62, v63, v64, 1, v74, v69, v76, v70, v71, v72, 0, 3, 2, 4) -> f_150(v60, v61, v62, v63, v64, 1, 1, v74, v69, v76, v70, v71, v72, 0, 3, 4) :|: TRUE f_150(v60, v61, v62, v63, v64, v65, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) -> f_151(v60, v61, v62, v63, v64, 1, v67, v68, v69, v70, v71, v72, 0, 3, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_151(v60:0, v61:0, v62:0, v63:0, v64:0, 1, v67:0, v68:0, 1 + v76:0, v70:0, v71:0, v72:0, 0, 3, 4) -> f_151(v60:0, v61:0, v62:0, v63:0, v64:0, 1, v74:0, 1 + v76:0, v76:0, v70:0, v71:0, v72:0, 0, 3, 4) :|: v76:0 > -1 && v63:0 > 1 Filtered unneeded arguments: f_151(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_151(x4, x9) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_151(v63:0, sum~cons_1~v76:0) -> f_151(v63:0, v76:0) :|: v76:0 > -1 && v63:0 > 1 && sum~cons_1~v76:0 = 1 + v76:0 ---------------------------------------- (8) Obligation: Rules: f_151(v63:0, sum~cons_1~v76:0) -> f_151(v63:0, v76:0) :|: v76:0 > -1 && v63:0 > 1 && sum~cons_1~v76:0 = 1 + v76:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_151(v63:0:0, sum~cons_1~v76:0:0) -> f_151(v63:0:0, v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_151(x, x1)] = x1 The following rules are decreasing: f_151(v63:0:0, sum~cons_1~v76:0:0) -> f_151(v63:0:0, v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0 The following rules are bounded: f_151(v63:0:0, sum~cons_1~v76:0:0) -> f_151(v63:0:0, v76:0:0) :|: v76:0:0 > -1 && v63:0:0 > 1 && sum~cons_1~v76:0:0 = 1 + v76:0:0 ---------------------------------------- (12) YES