/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, 177 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1195 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 75 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 131 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: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %c = alloca i32, align 4 store %x, %1 store 0, %c br %2 2: %3 = load %1 %4 = icmp sgt %3 1 br %4, %5, %8 5: %6 = load %1 %7 = icmp slt %6 100 br %8 8: %9 = phi [0, %2], [%7, %5] br %9, %10, %16 10: %11 = load %1 %12 = load %1 %13 = mul %11 %12 store %13, %1 %14 = load %c %15 = add %14 1 store %15, %c br %2 16: %17 = load %c ret %17 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() %3 = call i32 @test_fun(i32 %2) ret %3 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 18 rulesP rules: f_277(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_278(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 1 < v219 f_278(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_280(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_280(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_282(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_282(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_284(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_284(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_286(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v219 < 100 f_286(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_289(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_289(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_292(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_292(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_294(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_294(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_296(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_296(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_298(v214, v215, v216, v219, 1, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_298(v214, v215, v216, v219, 1, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_300(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v249 = v219 * v219 f_300(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_301(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_301(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_302(v214, v215, v216, v219, 1, v249, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 f_302(v214, v215, v216, v219, 1, v249, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_303(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v251 = 1 + v221 && 2 <= v251 f_303(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_304(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_304(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_305(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_305(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_276(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE f_276(v214, v215, v216, v217, 1, v219, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_277(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0 Combined rules. Obtained 1 rulesP rules: f_277(v214:0, v215:0, v216:0, v219:0, 1, v217:0, v220:0, v221:0, v222:0, v223:0, v224:0, v225:0, 0, 3, 2, 99, 4) -> f_277(v214:0, v215:0, v216:0, v219:0 * v219:0, 1, v219:0, v221:0, 1 + v221:0, v222:0, v223:0, v224:0, v225:0, 0, 3, 2, 99, 4) :|: v219:0 > 1 && v221:0 > 0 && v219:0 < 100 Filtered unneeded arguments: f_277(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_277(x4, x8) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_277(v219:0, v221:0) -> f_277(v219:0 * v219:0, 1 + v221:0) :|: v221:0 > 0 && v219:0 < 100 && v219:0 > 1 ---------------------------------------- (8) Obligation: Rules: f_277(v219:0, v221:0) -> f_277(v219:0 * v219:0, 1 + v221:0) :|: v221:0 > 0 && v219:0 < 100 && v219:0 > 1 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1 ---------------------------------------- (11) RankingReductionPairProof (EQUIVALENT) Interpretation: [ f_277 ] = -1/2*f_277_1 The following rules are decreasing: f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1 The following rules are bounded: f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1 ---------------------------------------- (12) YES