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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, true, par{j^0 -> (0 + i^0)}>
<l2, l3, true, par{i^0 -> (1 + i^0)}>
<l4, l1, ((1 + __const_5^0) <= (0 + i^0))>
<l4, l1, ((1 + i^0) <= (0 + __const_5^0))>
<l4, l2, ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> undef19}>
<l5, l6, ((0 + __const_10^0) <= (0 + i^0))>
<l5, l4, ((1 + i^0) <= (0 + __const_10^0))>
<l3, l5, true>
<l7, l3, true, par{i^0 -> 0}>
<l8, l7, true>

Fresh variables:
undef19, 

Undef variables:
undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 0)>
<l3, l6, ((0 + __const_10^0) <= (0 + i^0))>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + __const_5^0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + i^0) <= (0 + __const_5^0)), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> (1 + undef19)}>

Fresh variables:
undef19, 

Undef variables:
undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l3, l6, __const_10^0 <= i^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001459s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008695s
Piecewise ranking function: min(-5 + 6*__const_10^0 - 2*__const_5^0 - 4*i^0,-5 + 6*__const_10^0 - 6*__const_5^0)
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000930s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004383s
[34703 : 34704]
[34703 : 34705]
Successful child: 34704
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + __const_5^0 <= i^0 - Process 1
* Exit transition: <l0, l3, i^0 = 0, {all remain the same}>
* Postcondition  : 1 + __const_5^0 <= i^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000436s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000520s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + __const_5^0 <= i^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001011s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004566s
[34703 : 34709]
[34703 : 34710]
Successful child: 34709
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:__const_10^0 <= i^0 - Process 2
* Exit transition: <l0, l3, i^0 <= __const_5^0 /\ i^0 = 0, {all remain the same}>
* Postcondition  : __const_10^0 <= i^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000558s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000649s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: __const_10^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001012s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004567s
[34703 : 34714]
[34703 : 34715]
Successful child: 34714
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
New Graphs: 
Transitions:
<l3, l3, __const_10^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000947s
Ranking function: -1 + __const_10^0 - i^0
New Graphs: 

LOG: CALL check - Post:__const_10^0 <= __const_5^0 - Process 3
* Exit transition: <l0, l3, i^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ i^0 = 0, {all remain the same}>
* Postcondition  : __const_10^0 <= __const_5^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000537s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000630s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: __const_10^0 <= __const_5^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001166s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005212s
[34703 : 34719]
[34703 : 34720]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017149s
Time used: 0.016468

[34703 : 34724]
[34703 : 34728]
Successful child: 34728

Program does NOT terminate