/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, (undef1 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef1, arg3 -> 1}>
<l1, l3, (undef7 > ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}>
<l1, l3, (undef11 > ~(1)) /\ (arg2 > 0) /\ (arg1 >= undef8) /\ (arg1 >= (undef9 - 1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (undef9 > 1), par{arg1 -> undef8, arg2 -> undef9, arg3 -> undef10}>
<l2, l2, (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ ((arg1 - 1) < arg1) /\ (arg3 < arg2), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
<l3, l4, (undef18 > 0) /\ (arg3 > 1) /\ (undef15 <= arg2) /\ ((undef16 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16}>
<l4, l4, ((undef19 + 2) <= arg1) /\ (arg3 > 1) /\ (undef19 <= arg2) /\ ((undef20 + 3) <= arg1) /\ ((undef20 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)), par{arg1 -> undef19, arg2 -> undef20}>
<l5, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>

Fresh variables:
undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 

Undef variables:
undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef1 > ~(1)) /\ (undef23 > 0) /\ (undef22 > 0), par{arg1 -> undef1, arg2 -> undef23, arg3 -> 1}>
<l0, l4, (undef7 > ~(1)) /\ (undef23 > 0) /\ (undef4 <= undef22) /\ (undef22 > 0) /\ (undef4 > 0) /\ (undef5 > 2) /\ (undef18 > 0) /\ (undef6 > 1) /\ (undef15 <= undef5) /\ ((undef16 + 1) <= undef5) /\ (undef4 > 0) /\ (undef5 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef6}>
<l0, l4, (undef11 > ~(1)) /\ (undef23 > 0) /\ (undef22 >= undef8) /\ (undef22 >= (undef9 - 1)) /\ (undef22 > 0) /\ (undef8 > 0) /\ (undef9 > 1) /\ (undef18 > 0) /\ (undef10 > 1) /\ (undef15 <= undef9) /\ ((undef16 + 1) <= undef9) /\ (undef8 > 0) /\ (undef9 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef10}>
<l2, l2, (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ ((arg1 - 1) < arg1) /\ (arg3 < arg2), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
<l4, l4, ((undef19 + 2) <= arg1) /\ (arg3 > 1) /\ (undef19 <= arg2) /\ ((undef20 + 3) <= arg1) /\ ((undef20 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)), par{arg1 -> undef19, arg2 -> undef20}>

Fresh variables:
undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 

Undef variables:
undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 <= undef19 /\ undef19 <= arg2 /\ 0 <= undef20 /\ 2 + undef19 <= arg1 /\ 2 <= arg3 /\ 3 <= arg1 /\ 3 + undef20 <= arg1, {arg1 -> undef19, arg2 -> undef20, rest remain the same}>
Variables:
arg1, arg2, arg3

Graph 2:
Transitions:
<l2, l2, 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l4, 1 <= undef4 /\ 1 + undef16 <= undef5 /\ 1 <= undef15 /\ 1 <= undef18 /\ 1 <= undef22 /\ 1 <= undef23 /\ undef4 <= undef22 /\ undef15 <= undef5 /\ 0 <= undef7 /\ 0 <= undef16 /\ 2 <= undef6 /\ 3 <= undef5, {arg1 -> undef15, arg2 -> undef16, arg3 -> undef6, rest remain the same}>
<l0, l4, 1 <= undef8 /\ 1 + undef16 <= undef9 /\ 1 <= undef15 /\ 1 <= undef18 /\ 1 <= undef22 /\ 1 <= undef23 /\ undef9 <= 1 + undef22 /\ undef8 <= undef22 /\ undef15 <= undef9 /\ 0 <= undef11 /\ 0 <= undef16 /\ 2 <= undef9 /\ 2 <= undef10, {arg1 -> undef15, arg2 -> undef16, arg3 -> undef10, rest remain the same}>

Graph 2
<l0, l2, 1 <= undef22 /\ 1 <= undef23 /\ 0 <= undef1, {arg1 -> undef1, arg2 -> undef23, arg3 -> 1, 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.004828

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001508s
Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002833

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000967s
Ranking function: arg1
New Graphs: 
Program Terminates