/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToLLVMProof [EQUIVALENT, 176 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 592 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 39 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 4 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 %y = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() store %2, %x store 2, %y br %3 3: %4 = load %x %5 = icmp sge %4 0 br %5, %6, %13 6: %7 = load %x %8 = load %y %9 = sub %7 %8 store %9, %x %10 = load %y %11 = add %10 1 %12 = sdiv %11 2 store %12, %y br %3 13: 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 14 rulesP rules: f_125(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_126(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 <= v35 && 1 <= v32 && 1 <= v31 f_126(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_128(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 = 0 f_128(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_130(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: TRUE f_130(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_132(v28, v29, v30, v31, v35, 1, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 = 0 f_132(v28, v29, v30, v31, v35, 1, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_133(v28, v29, v30, v31, v35, 1, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 = 0 f_133(v28, v29, v30, v31, v35, 1, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_134(v28, v29, v30, v31, v35, 1, v41, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 1 + v41 = v35 && 0 <= 1 + v41 f_134(v28, v29, v30, v31, v35, 1, v41, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_135(v28, v29, v30, v31, v35, 1, v41, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: TRUE f_135(v28, v29, v30, v31, v35, 1, v41, v34, v36, v37, v38, v39, 0, 3, 2, 4) -> f_136(v28, v29, v30, v31, v35, 1, v41, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 = 0 f_136(v28, v29, v30, v31, v35, 1, v41, v36, v37, v38, v39, 0, 3, 2, 4) -> f_137(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) :|: 0 = 0 f_137(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) -> f_138(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) :|: 0 = 0 f_138(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) -> f_139(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) :|: TRUE f_139(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) -> f_140(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) :|: TRUE f_140(v28, v29, v30, v31, v35, 1, v41, 2, v37, v38, v39, 0, 3, 4) -> f_124(v28, v29, v30, v31, v35, 1, 1, v41, 2, v37, v38, v39, 0, 3, 2, 4) :|: TRUE f_124(v28, v29, v30, v31, v32, 1, v34, v35, v36, v37, v38, v39, 0, 3, 2, 4) -> f_125(v28, v29, v30, v31, v35, 1, v32, v34, v36, v37, v38, v39, 0, 3, 2, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_125(v28:0, v29:0, v30:0, v31:0, 1 + v41:0, 1, v32:0, v34:0, v36:0, v37:0, v38:0, v39:0, 0, 3, 2, 4) -> f_125(v28:0, v29:0, v30:0, v31:0, v41:0, 1, 1 + v41:0, 1, 2, v37:0, v38:0, v39:0, 0, 3, 2, 4) :|: v32:0 > 0 && v41:0 > -2 && v31:0 > 0 Filtered unneeded arguments: f_125(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_125(x4, x5, x7) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_125(v31:0, sum~cons_1~v41:0, v32:0) -> f_125(v31:0, v41:0, 1 + v41:0) :|: v41:0 > -2 && v31:0 > 0 && v32:0 > 0 && sum~cons_1~v41:0 = 1 + v41:0 ---------------------------------------- (8) Obligation: Rules: f_125(v31:0, sum~cons_1~v41:0, v32:0) -> f_125(v31:0, v41:0, 1 + v41:0) :|: v41:0 > -2 && v31:0 > 0 && v32:0 > 0 && sum~cons_1~v41:0 = 1 + v41:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_125(v31:0:0, sum~cons_1~v41:0:0, v32:0:0) -> f_125(v31:0:0, v41:0:0, 1 + v41:0:0) :|: v41:0:0 > -2 && v31:0:0 > 0 && v32:0:0 > 0 && sum~cons_1~v41:0:0 = 1 + v41:0:0 ---------------------------------------- (11) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f_125(x, x1, x2)] = x1 The following rules are decreasing: f_125(v31:0:0, sum~cons_1~v41:0:0, v32:0:0) -> f_125(v31:0:0, v41:0:0, 1 + v41:0:0) :|: v41:0:0 > -2 && v31:0:0 > 0 && v32:0:0 > 0 && sum~cons_1~v41:0:0 = 1 + v41:0:0 The following rules are bounded: f_125(v31:0:0, sum~cons_1~v41:0:0, v32:0:0) -> f_125(v31:0:0, v41:0:0, 1 + v41:0:0) :|: v41:0:0 > -2 && v31:0:0 > 0 && v32:0:0 > 0 && sum~cons_1~v41:0:0 = 1 + v41:0:0 ---------------------------------------- (12) YES