/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, 178 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 492 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 1 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 70 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 21 ms] (10) 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_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "f" linkageType: EXTERNALLY_VISIBLE returnParam: BasicVoidType parameters: (n i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store %n, %1 %2 = load %1 %3 = icmp slt %2 3 br %3, %4, %5 4: br %10 5: %6 = load %1 %7 = add %6 -1 store %7, %1 %8 = load %1 Unnamed Call-Instruction = call BasicVoidType @f2(i32 %8) br %9 9: Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() br %10 10: ret void *BasicFunctionTypename: "f2" linkageType: EXTERNALLY_VISIBLE returnParam: BasicVoidType parameters: (n i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store %n, %1 %2 = load %1 %3 = icmp slt %2 3 br %3, %4, %5 4: br %10 5: %6 = load %1 %7 = add %6 -1 store %7, %1 %8 = load %1 Unnamed Call-Instruction = call BasicVoidType @f(i32 %8) br %9 9: Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() br %10 10: ret void *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store 0, %1 Unnamed Call-Instruction = call BasicVoidType @f(i32 4) %2 = load %1 ret %2 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 25 rulesP rules: f_138(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) -> f_139(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) :|: TRUE f_139(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) -> f_140(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) :|: 0 = 0 f_140(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) -> f_142(v7, v11, v8, v9, v12, 0, 3, 4, 1) :|: 3 <= v7 f_142(v7, v11, v8, v9, v12, 0, 3, 4, 1) -> f_144(v7, v11, 0, v8, v9, v12, 3, 4, 1) :|: 0 = 0 f_144(v7, v11, 0, v8, v9, v12, 3, 4, 1) -> f_146(v7, v11, 0, v8, v9, v12, 3, 4, 1) :|: TRUE f_146(v7, v11, 0, v8, v9, v12, 3, 4, 1) -> f_148(v7, v11, 0, v8, v9, v12, 3, 4, 1) :|: 0 = 0 f_148(v7, v11, 0, v8, v9, v12, 3, 4, 1) -> f_150(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) :|: 1 + v18 = v7 && 2 <= v18 && v18 <= 3 f_150(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) -> f_152(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) :|: TRUE f_152(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) -> f_154(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) :|: 0 = 0 f_154(v7, v11, 0, v18, v8, v9, v12, 3, 1, 4, 2) -> f_155(v18, v8, v9, v11, v12, 0, v7, 3, 1, 4, 2) :|: 0 = 0 f_155(v18, v8, v9, v11, v12, 0, v7, 3, 1, 4, 2) -> f_156(v18, v8, v9, v11, v12, 0, 3, 1, 4, 2) :|: TRUE f_156(v18, v8, v9, v11, v12, 0, 3, 1, 4, 2) -> f_157(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) :|: 1 <= v20 && v21 = 3 + v20 && 4 <= v21 f_157(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) -> f_158(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) :|: TRUE f_158(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) -> f_159(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) :|: 0 = 0 f_159(v18, v20, v8, v9, v11, v12, v21, 0, 3, 1, 4, 2) -> f_161(3, v20, v8, v9, v11, v12, v21, 0, 1, 4) :|: 3 <= v18 f_161(3, v20, v8, v9, v11, v12, v21, 0, 1, 4) -> f_163(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) :|: 0 = 0 f_163(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) -> f_165(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) :|: TRUE f_165(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) -> f_167(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) :|: 0 = 0 f_167(3, v20, 0, v8, v9, v11, v12, v21, 1, 4) -> f_169(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) :|: 0 = 0 f_169(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) -> f_171(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) :|: TRUE f_171(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) -> f_173(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) :|: 0 = 0 f_173(3, v20, 0, 2, v8, v9, v11, v12, v21, 1, 4) -> f_175(2, v8, v9, v11, v12, v20, v21, 0, 3, 1, 4) :|: 0 = 0 f_175(2, v8, v9, v11, v12, v20, v21, 0, 3, 1, 4) -> f_176(2, v8, v9, v11, v12, v20, v21, 0, 3, 1, 4) :|: TRUE f_176(2, v8, v9, v11, v12, v20, v21, 0, 3, 1, 4) -> f_137(2, v8, v9, 0, 3, 2, 4, 1) :|: TRUE f_137(v7, v8, v9, 0, 3, 2, 4, 1) -> f_138(v7, v11, v8, v9, v12, 0, 3, 2, 4, 1) :|: 1 <= v11 && v12 = 3 + v11 && 4 <= v12 Combined rules. Obtained 1 rulesP rules: f_138(1 + v18:0, v11:0, v8:0, v9:0, v12:0, 0, 3, 2, 4, 1) -> f_138(2, v11:1, v8:0, v9:0, 3 + v11:1, 0, 3, 2, 4, 1) :|: v18:0 > 2 && v18:0 < 4 && v20:0 > 0 && v11:1 > 0 Filtered unneeded arguments: f_138(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> f_138(x1) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_138(sum~cons_1~v18:0) -> f_138(2) :|: v18:0 > 2 && v18:0 < 4 && sum~cons_1~v18:0 = 1 + v18:0 ---------------------------------------- (8) Obligation: Rules: f_138(sum~cons_1~v18:0) -> f_138(2) :|: v18:0 > 2 && v18:0 < 4 && sum~cons_1~v18:0 = 1 + v18:0 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained no non-trivial SCC(s). ---------------------------------------- (10) YES