/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, l11, true>
<l1, l2, ((0 + n^0) <= (0 + i^0))>
<l1, l3, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8), par{tmp^0 -> undef8}>
<l4, l5, ((0 + n^0) <= (0 + i^0))>
<l4, l6, ((1 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> 0}>
<l7, l4, true>
<l6, l1, true>
<l2, l8, true>
<l8, l7, ((0 + j^0) <= 0)>
<l8, l7, (1 <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}>
<l9, l6, true, par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}>
<l3, l2, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
<l3, l9, (1 <= (0 + tmp^0))>
<l3, l9, ((1 + tmp^0) <= 0)>
<l10, l7, true, par{i^0 -> 0}>
<l11, l10, true>

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, ((0 + n^0) <= (0 + 0)), par{i^0 -> 0}>
<l0, l6, ((1 + 0) <= (0 + n^0)), par{i^0 -> (1 + 0), j^0 -> 0}>
<l6, l5, ((0 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= 0) /\ ((0 + n^0) <= (0 + i^0))>
<l6, l5, ((0 + n^0) <= (0 + i^0)) /\ (1 <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}>
<l6, l6, ((0 + n^0) <= (0 + i^0)) /\ (1 <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= (0 + n^0)), par{i^0 -> (1 + (~(1) + i^0)), j^0 -> 0}>
<l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ ((0 + j^0) <= 0) /\ ((1 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> 0}>
<l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (1 <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= (0 + n^0)), par{i^0 -> (1 + (~(1) + i^0)), j^0 -> 0}>
<l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ (1 <= (0 + undef8)), par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}>
<l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((1 + undef8) <= 0), par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}>

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l6, 1 <= j^0 /\ i^0 = n^0, {j^0 -> 0, rest remain the same}>
<l6, l6, j^0 <= 0 /\ 1 + i^0 <= n^0 /\ undef8 = 0, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
<l6, l6, 1 + i^0 <= n^0 /\ 1 <= j^0 /\ undef8 = 0, {j^0 -> 0, rest remain the same}>
<l6, l6, 1 + i^0 <= n^0 /\ 1 <= undef8, {i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}>
<l6, l6, 1 + i^0 <= n^0 /\ 1 + undef8 <= 0, {i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}>
Variables:
i^0, j^0, n^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l6, 1 <= n^0, {i^0 -> 1, j^0 -> 0, rest remain the same}>

Graph 2
<l0, l5, n^0 <= 0, {i^0 -> 0, rest remain the same}>
<l6, l5, n^0 <= i^0 /\ j^0 <= 0, {all remain the same}>
<l6, l5, 1 + n^0 <= i^0 /\ 1 <= j^0, {i^0 -> -1 + i^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003298s
Ranking function: -i^0 + n^0
New Graphs: 
Transitions:
<l6, l6, 1 <= j^0 /\ i^0 = n^0, {j^0 -> 0, rest remain the same}>
<l6, l6, 1 + i^0 <= n^0 /\ 1 <= j^0 /\ undef8 = 0, {j^0 -> 0, rest remain the same}>
Variables:
i^0, j^0, n^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001414s
Ranking function: j^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l5}...
No cycles found.

Program Terminates