/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, l18, true>
<l1, l2, ((0 + nodecount^0) <= (0 + i^0))>
<l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l4, l5, true, par{i^0 -> (1 + i^0)}>
<l4, l2, true>
<l6, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l6, l4, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x^0 -> undef41, y^0 -> undef42}>
<l7, l8, true, par{j^0 -> (1 + j^0)}>
<l9, l10, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l9, l7, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{x^0 -> undef62, y^0 -> undef63}>
<l11, l5, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l11, l8, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}>
<l12, l13, true>
<l14, l15, true>
<l15, l12, true, par{i^0 -> (1 + i^0)}>
<l16, l14, ((1 + source^0) <= (0 + i^0))>
<l16, l14, ((1 + i^0) <= (0 + source^0))>
<l16, l15, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))>
<l13, l10, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l13, l16, ((1 + i^0) <= (0 + nodecount^0))>
<l10, l11, true>
<l8, l9, true>
<l5, l6, true>
<l3, l1, true>
<l17, l12, true, par{edgecount^0 -> 14, i^0 -> 0, nodecount^0 -> 5, source^0 -> 0}>
<l18, l17, true>

Fresh variables:
undef41, undef42, undef62, undef63, 

Undef variables:
undef41, undef42, undef62, undef63, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l12, (14 = 14) /\ (i^0 = 0) /\ (5 = 5) /\ (0 = 0)>
<l3, l2, ((0 + 5) <= (0 + i^0))>
<l3, l3, ((1 + i^0) <= (0 + 5)), par{i^0 -> (1 + i^0)}>
<l5, l3, ((0 + 14) <= (0 + i^0)), par{i^0 -> 0}>
<l5, l5, ((1 + i^0) <= (0 + 14)) /\ (undef41 = undef41) /\ (undef42 = undef42), par{i^0 -> (1 + i^0)}>
<l5, l2, ((1 + i^0) <= (0 + 14)) /\ (undef41 = undef41) /\ (undef42 = undef42)>
<l8, l5, ((0 + 14) <= (0 + j^0)) /\ ((0 + 5) <= (0 + (1 + i^0))), par{i^0 -> 0}>
<l8, l8, ((0 + 14) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + 5)), par{i^0 -> (1 + i^0), j^0 -> 0}>
<l8, l8, ((1 + j^0) <= (0 + 14)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{j^0 -> (1 + j^0)}>
<l12, l8, ((0 + 5) <= (0 + i^0)) /\ ((1 + 0) <= (0 + 5)), par{i^0 -> 0, j^0 -> 0}>
<l12, l12, ((1 + i^0) <= (0 + 5)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
<l12, l12, ((1 + i^0) <= (0 + 5)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}>
<l12, l12, ((1 + i^0) <= (0 + 5)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>

Fresh variables:
undef41, undef42, undef62, undef63, 

Undef variables:
undef41, undef42, undef62, undef63, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l12, l12, 1 <= i^0 /\ i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
<l12, l12, 1 + i^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
<l12, l12, i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 2:
Transitions:
<l8, l8, 14 <= j^0 /\ i^0 <= 3, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
<l8, l8, j^0 <= 13, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
i^0, j^0

Graph 3:
Transitions:
<l5, l5, i^0 <= 13, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 4:
Transitions:
<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l12, i^0 = 0, {all remain the same}>

Graph 2
<l12, l8, 5 <= i^0, {i^0 -> 0, j^0 -> 0, rest remain the same}>

Graph 3
<l8, l5, 14 <= j^0 /\ 4 <= i^0, {i^0 -> 0, rest remain the same}>

Graph 4
<l5, l3, 14 <= i^0, {i^0 -> 0, rest remain the same}>

Graph 5
<l3, l2, 5 <= i^0, {all remain the same}>
<l5, l2, i^0 <= 13, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 5 )
( 3 , 4 )
( 5 , 3 )
( 8 , 2 )
( 12 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.004289
Some transition disabled by a set of invariant(s):
Invariant at l12: 0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l12, l12, 1 + i^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 <= i^0 /\ i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.00233

Checking conditional termination of SCC {l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000908s
Ranking function: 4 - i^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.012823

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001300s
Ranking function: 3 - i^0
New Graphs: 
Transitions:
<l8, l8, j^0 <= 13, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
j^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000545s
Ranking function: 13 - j^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.001214

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000617s
Ranking function: 13 - i^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.001187

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000627s
Ranking function: 4 - i^0
New Graphs: 
Proving termination of subgraph 5
Analyzing SCC {l2}...
No cycles found.

Program Terminates