NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)), par{x^0 -> undef5}>
<l2, l1, (undef10 = ((0 + __const_400^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
<l3, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
<l3, l2, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)), par{x^0 -> undef20}>
<l4, l3, true>

Fresh variables:
undef5, undef10, undef15, undef20, 

Undef variables:
undef5, undef10, undef15, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
<l0, l1, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)) /\ (undef10 = ((0 + __const_400^0) + undef20)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
<l1, l1, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)) /\ (undef10 = ((0 + __const_400^0) + undef5)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>

Fresh variables:
undef5, undef10, undef15, undef20, 

Undef variables:
undef5, undef10, undef15, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
<l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000462s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001735s
Trying to remove transition: <l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004287s
Time used: 0.004144
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006064s
Time used: 0.00569
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008199s
Time used: 0.008197

LOG: SAT solveNonLinear - Elapsed time: 0.014263s
Cost: 2; Total time: 0.013887
Failed at location 1: __const_300^0 + x^0 <= __const_100^0
Failed at location 1: __const_300^0 + x^0 <= __const_100^0
Before Improving: 
Quasi-invariant at l1: __const_300^0 + x^0 <= __const_100^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001667s
Remaining time after improvement: 0.999214
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l1: __const_300^0 + x^0 <= __const_100^0
[ 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: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
New Graphs: 
Calling Safety with literal __const_300^0 + x^0 <= __const_100^0 and entry <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>

LOG: CALL check - Post:__const_300^0 + x^0 <= __const_100^0 - Process 1
* Exit transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
* Postcondition  : __const_300^0 + x^0 <= __const_100^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000305s
Calling Safety with literal __const_300^0 + x^0 <= __const_100^0 and entry <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: CALL check - Post:__const_300^0 + x^0 <= __const_100^0 - Process 2
* Exit transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
* Postcondition  : __const_300^0 + x^0 <= __const_100^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000330s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: __const_300^0 + x^0 <= __const_100^0 , 
Narrowing transition: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000420s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001691s
Trying to remove transition: <l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003462s
Time used: 0.003313
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006962s
Time used: 0.006576
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006080s
Time used: 0.006079

LOG: SAT solveNonLinear - Elapsed time: 0.013042s
Cost: 2; Total time: 0.012655
Failed at location 1: 1 + __const_300^0 + __const_400^0 <= 0
Failed at location 1: 1 + __const_300^0 + __const_400^0 <= 0
Before Improving: 
Quasi-invariant at l1: 1 + __const_300^0 + __const_400^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001756s
Remaining time after improvement: 0.999099
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l1: 1 + __const_300^0 + __const_400^0 <= 0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, 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): 
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Ranking function: -__const_100^0 + __const_300^0 + x^0
New Graphs: 
Calling Safety with literal 1 + __const_300^0 + __const_400^0 <= 0 and entry <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>

LOG: CALL check - Post:1 + __const_300^0 + __const_400^0 <= 0 - Process 3
* Exit transition: <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
* Postcondition  : 1 + __const_300^0 + __const_400^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000287s
Calling Safety with literal 1 + __const_300^0 + __const_400^0 <= 0 and entry <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: CALL check - Post:1 + __const_300^0 + __const_400^0 <= 0 - Process 4
* Exit transition: <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
* Postcondition  : 1 + __const_300^0 + __const_400^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000316s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + __const_300^0 + __const_400^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000446s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001782s
Trying to remove transition: <l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003823s
Time used: 0.003662
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008635s
Time used: 0.008309
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000930s
Time used: 4.00023
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001660s
Time used: 1.00009
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010210s
Time used: 0.004692

Proving non-termination of subgraph 1
Transitions:
<l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000661s
Checking conditional non-termination of SCC {l1}...
> No assignment for some undef value.
> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
Calling reachability with...
Transition: <l1, end, true, {all remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
Transition: <l1, end, true, {all remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
OPEN EXITS: 
<l1, end, 1 + __const_100^0 <= __const_300^0 + x^0, {all remain the same}> (condsUp: 0 <= __const_300^0 + __const_400^0)
<l1, end, 1 + __const_100^0 <= __const_300^0 + x^0, {all remain the same}> (condsUp: 0 <= __const_300^0 + __const_400^0)

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
Transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
Transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
Transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
OPEN EXITS: 
<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate