/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, (undef2 <= arg1) /\ (arg1 > 0) /\ (undef2 > 0) /\ ((arg2 + 2) <= arg1), par{arg1 -> 0, arg2 -> undef2}>
<l3, l2, (undef5 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> 0, arg2 -> undef4}>
<l2, l2, ((undef7 + 7) <= arg2) /\ (arg2 > 6) /\ (undef7 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef7}>
<l2, l2, (arg2 >= (undef9 - 2)) /\ (arg2 > 0) /\ (undef9 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef9}>
<l2, l2, ((undef11 - 4) <= arg2) /\ (arg2 > 0) /\ (undef11 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef11}>
<l3, l4, (undef12 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef12, arg2 -> undef13}>
<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef15}>
<l5, l3, true, par{arg1 -> undef16, arg2 -> undef17}>

Fresh variables:
undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 

Undef variables:
undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef5 > ~(1)) /\ (undef17 > 0) /\ (undef16 > 0) /\ (undef4 > 0), par{arg1 -> 0, arg2 -> undef4}>
<l0, l4, (undef12 > ~(1)) /\ (undef17 > 0) /\ (undef16 > 0), par{arg1 -> undef12, arg2 -> undef13}>
<l2, l2, ((undef7 + 7) <= arg2) /\ (arg2 > 6) /\ (undef7 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef7}>
<l2, l2, (arg2 >= (undef9 - 2)) /\ (arg2 > 0) /\ (undef9 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef9}>
<l2, l2, ((undef11 - 4) <= arg2) /\ (arg2 > 0) /\ (undef11 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef11}>
<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef15}>

Fresh variables:
undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 

Undef variables:
undef2, undef4, undef5, undef7, undef9, undef11, undef12, undef13, undef15, undef16, undef17, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef15, rest remain the same}>
Variables:
arg1, arg2

Graph 2:
Transitions:
<l2, l2, 0 <= undef7 /\ 7 <= arg2 /\ 7 + undef7 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef7, rest remain the same}>
<l2, l2, 1 <= arg2 /\ undef9 <= 2 + arg2 /\ 3 <= undef9 /\ arg1 = 1, {arg1 -> 2, arg2 -> undef9, rest remain the same}>
<l2, l2, 1 <= arg2 /\ undef11 <= 4 + arg2 /\ 5 <= undef11 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef11, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l4, 0 <= undef12 /\ 1 <= undef16 /\ 1 <= undef17, {arg1 -> undef12, arg2 -> undef13, rest remain the same}>

Graph 2
<l0, l2, 0 <= undef5 /\ 1 <= undef4 /\ 1 <= undef16 /\ 1 <= undef17, {arg1 -> 0, arg2 -> undef4, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 4 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.002044

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000631s
Ranking function: -1 + arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.024495

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002043s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016025s
Piecewise ranking function: min(-122 + 132*arg1 + 19*arg2,66 - 47*arg1 + 19*arg2)
New Graphs: 
Transitions:
<l2, l2, 1 <= arg2 /\ undef9 <= 2 + arg2 /\ 3 <= undef9 /\ arg1 = 1, {arg1 -> 2, arg2 -> undef9, rest remain the same}>
<l2, l2, 1 <= arg2 /\ undef11 <= 4 + arg2 /\ 5 <= undef11 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef11, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001227s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006846s
Piecewise ranking function: min(8 - 9*arg1 + arg2,-14 + 19*arg1 + arg2)
New Graphs: 
Transitions:
<l2, l2, 1 <= arg2 /\ undef11 <= 4 + arg2 /\ 5 <= undef11 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef11, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001047s
Ranking function: -1 + (1 / 2)*arg1
New Graphs: 
Program Terminates