/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, 76 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 300 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 63 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 46 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
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %x
		br %3
	3:
		%4 = load %x
		%5 = icmp sgt %4 0
		br %5, %6, %9
	6:
		%7 = load %x
		%8 = sdiv %7 2
		store %8, %x
		br %3
	9:
		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 9 rulesP rules:
f_75(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) -> f_76(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) :|: 0 < v16
f_76(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) -> f_78(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) :|: 0 = 0
f_78(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) -> f_80(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) :|: TRUE
f_80(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) -> f_82(v11, v12, v13, v16, 1, v17, v18, 0, 3, 4) :|: 0 = 0
f_82(v11, v12, v13, v16, 1, v17, v18, 0, 3, 4) -> f_83(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) :|: v20 = v16 / 2
f_83(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) -> f_84(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) :|: TRUE
f_84(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) -> f_85(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) :|: TRUE
f_85(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) -> f_74(v11, v12, v13, v16, 1, v20, v17, v18, 0, 3, 2, 4) :|: TRUE
f_74(v11, v12, v13, v14, 1, v16, v17, v18, 0, 3, 2, 4) -> f_75(v11, v12, v13, v16, 1, v14, v17, v18, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_75(v11:0, v12:0, v13:0, v16:0, 1, v14:0, v17:0, v18:0, 0, 3, 2, 4) -> f_75(v11:0, v12:0, v13:0, v20:0, 1, v16:0, v17:0, v18:0, 0, 3, 2, 4) :|: v20:0 = v16:0 / 2 && v16:0 > 0
Filtered unneeded arguments:
   f_75(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12) -> f_75(x4)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_75(v16:0) -> f_75'(v16:0) :|: v16:0 > 0
f_75'(v16:0) -> f_75(div) :|: v16:0 > 0 && v16:0 - 2 * div < 2 && v16:0 - 2 * div >= 0

----------------------------------------

(8)
Obligation:
Rules:
f_75(v16:0) -> f_75'(v16:0) :|: v16:0 > 0
f_75'(x) -> f_75(x1) :|: x > 0 && x - 2 * x1 < 2 && x - 2 * x1 >= 0

----------------------------------------

(9) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(10)
Obligation:
Rules:
f_75(v16:0:0) -> f_75(x1:0) :|: v16:0:0 - 2 * x1:0 >= 0 && v16:0:0 - 2 * x1:0 < 2 && v16:0:0 > 0

----------------------------------------

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_75 ] = 2*f_75_1

The following rules are decreasing:
f_75(v16:0:0) -> f_75(x1:0) :|: v16:0:0 - 2 * x1:0 >= 0 && v16:0:0 - 2 * x1:0 < 2 && v16:0:0 > 0

The following rules are bounded:
f_75(v16:0:0) -> f_75(x1:0) :|: v16:0:0 - 2 * x1:0 >= 0 && v16:0:0 - 2 * x1:0 < 2 && v16:0:0 > 0


----------------------------------------

(12)
YES