/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, l8, true>
<l1, l2, (undef2 = undef2), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef2, x0^0 -> (0 + undef2)}>
<l1, l3, (undef4 = (0 + x0^0)), par{oldX0^0 -> undef4, x0^0 -> (~(2) + undef4)}>
<l1, l3, (undef7 = (0 + x0^0)), par{oldX0^0 -> undef7, x0^0 -> (~(1) + undef7)}>
<l4, l1, (undef10 = (0 + x0^0)) /\ (2 <= (0 + undef10)), par{oldX0^0 -> undef10, x0^0 -> (0 + undef10)}>
<l4, l1, (undef13 = (0 + x0^0)) /\ ((1 + undef13) <= 1), par{oldX0^0 -> undef13, x0^0 -> (0 + undef13)}>
<l4, l5, (undef16 = (0 + x0^0)) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)), par{oldX0^0 -> undef16, x0^0 -> (0 + undef16)}>
<l5, l2, (undef20 = undef20), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef20, x0^0 -> (0 + undef20)}>
<l6, l4, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)), par{oldX0^0 -> undef22, x0^0 -> (0 + undef22)}>
<l6, l5, (undef25 = (0 + x0^0)) /\ ((0 + undef25) <= 0), par{oldX0^0 -> undef25, x0^0 -> (0 + undef25)}>
<l3, l6, (undef28 = (0 + x0^0)), par{oldX0^0 -> undef28, x0^0 -> (0 + undef28)}>
<l7, l2, true>
<l7, l1, true>
<l7, l4, true>
<l7, l5, true>
<l7, l6, true>
<l7, l3, true>
<l8, l7, true>

Fresh variables:
undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 

Undef variables:
undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l0, l1, true>
<l0, l1, (undef10 = (0 + x0^0)) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}>
<l0, l1, (undef13 = (0 + x0^0)) /\ ((1 + undef13) <= 1), par{x0^0 -> (0 + undef13)}>
<l0, l2, (undef16 = (0 + x0^0)) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l0, l2, (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l0, l1, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}>
<l0, l2, (undef22 = (0 + x0^0)) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l0, l2, (undef25 = (0 + x0^0)) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l0, l1, (undef28 = (0 + x0^0)) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}>
<l0, l2, (undef28 = (0 + x0^0)) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l0, l2, (undef28 = (0 + x0^0)) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l1, l2, (undef2 = undef2), par{x0^0 -> (0 + undef2)}>
<l1, l1, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}>
<l1, l2, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l1, l2, (undef4 = (0 + x0^0)) /\ (undef28 = (0 + (~(2) + undef4))) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l1, l1, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef10 = (0 + (0 + undef22))) /\ (2 <= (0 + undef10)), par{x0^0 -> (0 + undef10)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef22 = (0 + (0 + undef28))) /\ (1 <= (0 + undef22)) /\ (undef16 = (0 + (0 + undef22))) /\ ((0 + undef16) <= 1) /\ (1 <= (0 + undef16)) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef28 = (0 + (~(1) + undef7))) /\ (undef25 = (0 + (0 + undef28))) /\ ((0 + undef25) <= 0) /\ (undef20 = undef20), par{x0^0 -> (0 + undef20)}>

Fresh variables:
undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 

Undef variables:
undef2, undef4, undef7, undef10, undef13, undef16, undef20, undef22, undef25, undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef4 /\ undef10 = undef22 /\ undef22 = undef28 /\ undef4 = 2 + undef28, {x0^0 -> undef10, rest remain the same}>
<l1, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef7 /\ undef10 = undef22 /\ undef22 = undef28 /\ undef7 = 1 + undef28, {x0^0 -> undef10, rest remain the same}>
Variables:
x0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>
<l0, l1, 2 <= undef10 /\ x0^0 = undef10, {x0^0 -> undef10, rest remain the same}>
<l0, l1, undef13 <= 0 /\ x0^0 = undef13, {x0^0 -> undef13, rest remain the same}>
<l0, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef22 /\ undef10 = undef22, {x0^0 -> undef10, rest remain the same}>
<l0, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef28 /\ undef10 = undef22 /\ undef22 = undef28, {x0^0 -> undef10, rest remain the same}>

Graph 2
<l0, l2, true, {all remain the same}>
<l0, l2, x0^0 = undef16 /\ undef16 = 1, {x0^0 -> undef20, rest remain the same}>
<l0, l2, true, {x0^0 -> undef20, rest remain the same}>
<l0, l2, 1 <= undef22 /\ x0^0 = undef22 /\ undef16 = undef22 /\ undef16 = 1, {x0^0 -> undef20, rest remain the same}>
<l0, l2, undef25 <= 0 /\ x0^0 = undef25, {x0^0 -> undef20, rest remain the same}>
<l0, l2, 1 <= undef22 /\ x0^0 = undef28 /\ undef16 = undef22 /\ undef22 = undef28 /\ undef16 = 1, {x0^0 -> undef20, rest remain the same}>
<l0, l2, undef25 <= 0 /\ x0^0 = undef28 /\ undef25 = undef28, {x0^0 -> undef20, rest remain the same}>
<l1, l2, true, {x0^0 -> undef2, rest remain the same}>
<l1, l2, 1 <= undef22 /\ x0^0 = undef4 /\ undef16 = undef22 /\ undef22 = undef28 /\ undef4 = 2 + undef28 /\ undef16 = 1, {x0^0 -> undef20, rest remain the same}>
<l1, l2, undef25 <= 0 /\ x0^0 = undef4 /\ undef25 = undef28 /\ undef4 = 2 + undef28, {x0^0 -> undef20, rest remain the same}>
<l1, l2, 1 <= undef22 /\ x0^0 = undef7 /\ undef16 = undef22 /\ undef22 = undef28 /\ undef7 = 1 + undef28 /\ undef16 = 1, {x0^0 -> undef20, rest remain the same}>
<l1, l2, undef25 <= 0 /\ x0^0 = undef7 /\ undef25 = undef28 /\ undef7 = 1 + undef28, {x0^0 -> undef20, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001925s
Ranking function: -56 + 14*x0^0
New Graphs: 
Transitions:
<l1, l1, 2 <= undef10 /\ 1 <= undef22 /\ x0^0 = undef7 /\ undef10 = undef22 /\ undef22 = undef28 /\ undef7 = 1 + undef28, {x0^0 -> undef10, rest remain the same}>
Variables:
x0^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000956s
Ranking function: -2 + x0^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates