16.08/5.31 YES 16.08/5.32 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 16.08/5.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.08/5.32 16.08/5.32 16.08/5.32 Termination of the given C Problem could be proven: 16.08/5.32 16.08/5.32 (0) C Problem 16.08/5.32 (1) CToLLVMProof [EQUIVALENT, 177 ms] 16.08/5.32 (2) LLVM problem 16.08/5.32 (3) LLVMToTerminationGraphProof [EQUIVALENT, 675 ms] 16.08/5.32 (4) LLVM Symbolic Execution Graph 16.08/5.32 (5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms] 16.08/5.32 (6) LLVM Symbolic Execution Lasso 16.08/5.32 (7) Lasso2IRS [EQUIVALENT, 88 ms] 16.08/5.32 (8) IntTRS 16.08/5.32 (9) IRS2T2 [EQUIVALENT, 0 ms] 16.08/5.32 (10) T2IntSys 16.08/5.32 (11) T2 [EQUIVALENT, 1463 ms] 16.08/5.32 (12) YES 16.08/5.32 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (0) 16.08/5.32 Obligation: 16.08/5.32 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (1) CToLLVMProof (EQUIVALENT) 16.08/5.32 Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (2) 16.08/5.32 Obligation: 16.08/5.32 LLVM Problem 16.08/5.32 16.08/5.32 Aliases: 16.08/5.32 16.08/5.32 Data layout: 16.08/5.32 16.08/5.32 "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" 16.08/5.32 16.08/5.32 Machine: 16.08/5.32 16.08/5.32 "x86_64-pc-linux-gnu" 16.08/5.32 16.08/5.32 Type definitions: 16.08/5.32 16.08/5.32 Global variables: 16.08/5.32 16.08/5.32 Function declarations and definitions: 16.08/5.32 16.08/5.32 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 16.08/5.32 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 16.08/5.32 0: 16.08/5.32 %1 = alloca i32, align 4 16.08/5.32 %x = alloca i32, align 4 16.08/5.32 %y = alloca i32, align 4 16.08/5.32 store 0, %1 16.08/5.32 %2 = call i32 @__VERIFIER_nondet_int() 16.08/5.32 store %2, %x 16.08/5.32 %3 = call i32 @__VERIFIER_nondet_int() 16.08/5.32 store %3, %y 16.08/5.32 %4 = load %y 16.08/5.32 %5 = mul 2 %4 16.08/5.32 %6 = icmp slt %5 1 16.08/5.32 br %6, %7, %8 16.08/5.32 7: 16.08/5.32 store 0, %1 16.08/5.32 br %19 16.08/5.32 8: 16.08/5.32 br %9 16.08/5.32 9: 16.08/5.32 %10 = load %x 16.08/5.32 %11 = icmp sge %10 0 16.08/5.32 br %11, %12, %18 16.08/5.32 12: 16.08/5.32 %13 = load %x 16.08/5.32 %14 = load %y 16.08/5.32 %15 = mul 2 %14 16.08/5.32 %16 = sub %13 %15 16.08/5.32 %17 = add %16 1 16.08/5.32 store %17, %x 16.08/5.32 br %9 16.08/5.32 18: 16.08/5.32 store 0, %1 16.08/5.32 br %19 16.08/5.32 19: 16.08/5.32 %20 = load %1 16.08/5.32 ret %20 16.08/5.32 16.08/5.32 16.08/5.32 Analyze Termination of all function calls matching the pattern: 16.08/5.32 main() 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (3) LLVMToTerminationGraphProof (EQUIVALENT) 16.08/5.32 Constructed symbolic execution graph for LLVM program and proved memory safety. 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (4) 16.08/5.32 Obligation: 16.08/5.32 SE Graph 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (5) SymbolicExecutionGraphToLassoProof (EQUIVALENT) 16.08/5.32 Converted SEGraph to 1 independent lasso. 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (6) 16.08/5.32 Obligation: 16.08/5.32 Lasso 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (7) Lasso2IRS (EQUIVALENT) 16.08/5.32 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 16.08/5.32 Generated rules. Obtained 38 rulesP rules: 16.08/5.32 f_146(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) -> f_147(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) :|: 0 <= v31 && 0 <= 1 + v30 && 1 <= v28 16.08/5.32 f_147(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) -> f_149(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_149(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) -> f_151(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) :|: TRUE 16.08/5.32 f_151(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) -> f_153(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_153(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) -> f_155(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_155(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) -> f_157(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) :|: v26 = 2 * v25 16.08/5.32 f_157(v21, v22, v23, v24, v25, v26, 0, v31, 1, v30, v32, v33, v34, 3, 2, 4) -> f_159(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v32, v33, v34, 3, 2, 4) :|: v38 + v26 = v31 16.08/5.32 f_159(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v32, v33, v34, 3, 2, 4) -> f_160(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) :|: v39 = 1 + v38 16.08/5.32 f_160(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) -> f_161(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) :|: TRUE 16.08/5.32 f_161(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) -> f_162(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) :|: TRUE 16.08/5.32 f_162(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) -> f_145(v21, v22, v23, v24, v25, v26, 0, v31, 1, v38, v39, v32, v33, v34, 3, 2, 4) :|: TRUE 16.08/5.32 f_145(v21, v22, v23, v24, v25, v26, 0, v28, 1, v30, v31, v32, v33, v34, 3, 2, 4) -> f_146(v21, v22, v23, v24, v25, v26, 0, v31, 1, v28, v30, v32, v33, v34, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_90 -> f_91(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2 16.08/5.32 f_91(v1, v2, 3, 1, 4) -> f_92(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4 16.08/5.32 f_92(v1, v3, v2, v4, 3, 1, 4) -> f_93(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6 16.08/5.32 f_93(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_94(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.08/5.32 f_94(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_95(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.08/5.32 f_95(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_96(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.08/5.32 f_96(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_97(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.08/5.32 f_97(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_98(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.08/5.32 f_98(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_99(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0 16.08/5.32 f_99(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_100(v1, v3, v5, v7, v9, v11, v2, v4, v6, 0, 3, 2, 1, 4) :|: v11 = 2 * v9 16.08/5.32 f_100(v1, v3, v5, v7, v9, v11, v2, v4, v6, 0, 3, 2, 1, 4) -> f_102(v1, v3, v5, v7, v9, v11, v2, v4, v6, 0, 3, 2, 1, 4) :|: 1 <= v11 && 2 <= v11 && 1 <= v9 16.08/5.32 f_102(v1, v3, v5, v7, v9, v11, v2, v4, v6, 0, 3, 2, 1, 4) -> f_104(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) :|: 0 = 0 16.08/5.32 f_104(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) -> f_106(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) :|: TRUE 16.08/5.32 f_106(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) -> f_108(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) :|: TRUE 16.08/5.32 f_108(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) -> f_110(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) :|: 0 = 0 16.08/5.32 f_110(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) -> f_112(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) :|: 0 <= v7 16.08/5.32 f_112(v1, v3, v5, v7, v9, v11, 0, v2, v4, v6, 3, 2, 1, 4) -> f_114(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_114(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) -> f_116(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) :|: TRUE 16.08/5.32 f_116(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) -> f_118(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_118(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) -> f_120(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) :|: 0 = 0 16.08/5.32 f_120(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) -> f_122(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) :|: v11 = 2 * v9 16.08/5.32 f_122(v1, v3, v5, v7, v9, v11, 0, 1, v2, v4, v6, 3, 2, 4) -> f_124(v1, v3, v5, v7, v9, v11, 0, 1, v12, v2, v4, v6, 3, 2, 4) :|: v12 + v11 = v7 16.08/5.32 f_124(v1, v3, v5, v7, v9, v11, 0, 1, v12, v2, v4, v6, 3, 2, 4) -> f_125(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) :|: v13 = 1 + v12 16.08/5.32 f_125(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) -> f_126(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) :|: TRUE 16.08/5.32 f_126(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) -> f_127(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) :|: TRUE 16.08/5.32 f_127(v1, v3, v5, v7, v9, v11, 0, 1, v12, v13, v2, v4, v6, 3, 2, 4) -> f_145(v1, v3, v5, v7, v9, v11, 0, v7, 1, v12, v13, v2, v4, v6, 3, 2, 4) :|: TRUE 16.08/5.32 Combined rules. Obtained 2 rulesP rules: 16.08/5.32 f_146(v21:0, v22:0, v23:0, v24:0, v25:0, 2 * v25:0, 0, v38:0 + 2 * v25:0, 1, v28:0, v30:0, v32:0, v33:0, v34:0, 3, 2, 4) -> f_146(v21:0, v22:0, v23:0, v24:0, v25:0, 2 * v25:0, 0, 1 + v38:0, 1, v38:0 + 2 * v25:0, v38:0, v32:0, v33:0, v34:0, 3, 2, 4) :|: v30:0 > -2 && v28:0 > 0 && v38:0 + 2 * v25:0 > -1 16.08/5.32 f_90 -> f_146(v1:0, v3:0, v5:0, v12:0 + 2 * v9:0, v9:0, 2 * v9:0, 0, 1 + v12:0, 1, v12:0 + 2 * v9:0, v12:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 3, 2, 4) :|: 2 * v9:0 > 1 && v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v12:0 + 2 * v9:0 > -1 && v9:0 > 0 16.08/5.32 Filtered unneeded arguments: 16.08/5.32 f_146(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_146(x5, x6, x8, x10, x11) 16.08/5.32 Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules: 16.08/5.32 f_146(v25:0, times~cons_2~v25:0, sum~v38:0~times~cons_2~v25:0, v28:0, v30:0) -> f_146(v25:0, 2 * v25:0, 1 + v38:0, v38:0 + 2 * v25:0, v38:0) :|: v28:0 > 0 && v38:0 + 2 * v25:0 > -1 && v30:0 > -2 && times~cons_2~v25:0 = 2 * v25:0 && sum~v38:0~times~cons_2~v25:0 = v38:0 + 2 * v25:0 16.08/5.32 f_90 -> f_146(v9:0, 2 * v9:0, 1 + v12:0, v12:0 + 2 * v9:0, v12:0) :|: v12:0 + 2 * v9:0 > -1 && v9:0 > 0 && 2 * v9:0 > 1 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (8) 16.08/5.32 Obligation: 16.08/5.32 Rules: 16.08/5.32 f_146(v25:0, times~cons_2~v25:0, sum~v38:0~times~cons_2~v25:0, v28:0, v30:0) -> f_146(v25:0, 2 * v25:0, 1 + v38:0, v38:0 + 2 * v25:0, v38:0) :|: v28:0 > 0 && v38:0 + 2 * v25:0 > -1 && v30:0 > -2 && times~cons_2~v25:0 = 2 * v25:0 && sum~v38:0~times~cons_2~v25:0 = v38:0 + 2 * v25:0 16.08/5.32 f_90 -> f_146(v9:0, 2 * v9:0, 1 + v12:0, v12:0 + 2 * v9:0, v12:0) :|: v12:0 + 2 * v9:0 > -1 && v9:0 > 0 && 2 * v9:0 > 1 16.08/5.32 Start term: f_90 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (9) IRS2T2 (EQUIVALENT) 16.08/5.32 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 16.08/5.32 16.08/5.32 (f_146_5,1) 16.08/5.32 (f_90_5,2) 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (10) 16.08/5.32 Obligation: 16.08/5.32 START: 2; 16.08/5.32 16.08/5.32 FROM: 1; 16.08/5.32 oldX0 := x0; 16.08/5.32 oldX1 := x1; 16.08/5.32 oldX2 := x2; 16.08/5.32 oldX3 := x3; 16.08/5.32 oldX4 := x4; 16.08/5.32 oldX5 := nondet(); 16.08/5.32 assume(oldX3 > 0 && oldX5 + 2 * oldX0 > -1 && oldX4 > -2 && oldX1 = 2 * oldX0 && oldX2 = oldX5 + 2 * oldX0); 16.08/5.32 x0 := oldX0; 16.08/5.32 x1 := 2 * oldX0; 16.08/5.32 x2 := 1 + oldX5; 16.08/5.32 x3 := oldX5 + 2 * oldX0; 16.08/5.32 x4 := oldX5; 16.08/5.32 TO: 1; 16.08/5.32 16.08/5.32 FROM: 2; 16.08/5.32 oldX0 := x0; 16.08/5.32 oldX1 := x1; 16.08/5.32 oldX2 := x2; 16.08/5.32 oldX3 := x3; 16.08/5.32 oldX4 := x4; 16.08/5.32 oldX5 := nondet(); 16.08/5.32 oldX6 := nondet(); 16.08/5.32 assume(oldX6 + 2 * oldX5 > -1 && oldX5 > 0 && 2 * oldX5 > 1); 16.08/5.32 x0 := oldX5; 16.08/5.32 x1 := 2 * oldX5; 16.08/5.32 x2 := 1 + oldX6; 16.08/5.32 x3 := oldX6 + 2 * oldX5; 16.08/5.32 x4 := oldX6; 16.08/5.32 TO: 1; 16.08/5.32 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (11) T2 (EQUIVALENT) 16.08/5.32 Used the following cutpoint-specific lexicographic rank functions: 16.08/5.32 * For cutpoint 5, used the following rank functions/bounds (in descending priority order): 16.08/5.32 - RF x2, bound 0 16.08/5.32 16.08/5.32 ---------------------------------------- 16.08/5.32 16.08/5.32 (12) 16.08/5.32 YES 16.52/5.43 EOF