NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, true>
<l2, l3, (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + x_5^0) <= 0) /\ (undef4 = undef4), par{Result_4^0 -> undef4, tmp_6^0 -> undef5}>
<l2, l4, (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (0 <= (~(1) + x_5^0)), par{tmp_6^0 -> undef8}>
<l4, l2, true>
<l2, l5, (undef14 = undef14), par{tmp_6^0 -> undef14}>
<l5, l6, ((1 + tmp_6^0) <= 0)>
<l5, l6, (1 <= (0 + tmp_6^0))>
<l6, l3, (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{Result_4^0 -> undef22, x_5^0 -> undef24}>
<l2, l7, (undef26 = undef26), par{tmp_6^0 -> undef26}>
<l7, l8, ((1 + tmp_6^0) <= 0)>
<l7, l8, (1 <= (0 + tmp_6^0))>
<l8, l9, (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>
<l9, l2, true>
<l10, l1, true>

Fresh variables:
undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 

Undef variables:
undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + x_5^0) <= 0) /\ (undef4 = undef4)>
<l2, l2, (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (0 <= (~(1) + x_5^0))>
<l2, l3, (undef14 = undef14) /\ ((1 + undef14) <= 0) /\ (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{x_5^0 -> undef24}>
<l2, l3, (undef14 = undef14) /\ (1 <= (0 + undef14)) /\ (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{x_5^0 -> undef24}>
<l2, l2, (undef26 = undef26) /\ ((1 + undef26) <= 0) /\ (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>
<l2, l2, (undef26 = undef26) /\ (1 <= (0 + undef26)) /\ (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>

Fresh variables:
undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 

Undef variables:
undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
Variables:
x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, x_5^0 <= 0 /\ undef5 = 0, {all remain the same}>
<l2, l3, undef24 <= 0 /\ 1 + undef14 <= 0 /\ x_5^0 = 1 + undef24, {x_5^0 -> undef24, rest remain the same}>
<l2, l3, undef24 <= 0 /\ 1 <= undef14 /\ x_5^0 = 1 + undef24, {x_5^0 -> undef24, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001295s
Ranking function: -2 + x_5^0
New Graphs: 
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
Variables:
x_5^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:x_5^0 <= 0 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : x_5^0 <= 0
Quasi-invariants: 
Location 2: x_5^0 <= 0 ; undef36 <= 0 ; 
Postcondition: x_5^0 <= 0

LOG: CALL check - Post:x_5^0 <= 0 - Process 2
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : x_5^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000278s
Postcondition: undef36 <= 0

LOG: CALL check - Post:undef36 <= 0 - Process 3
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : undef36 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000273s

LOG: NarrowEntry size 2
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>

LOG: Narrow transition size 2
ENTRIES:
<l0, l2, x_5^0 <= 0 /\ 1 <= undef36, {all remain the same}>
<l0, l2, 1 <= x_5^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: x_5^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006809s
Time used: 0.006625
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013262s
Time used: 0.013256

LOG: SAT solveNonLinear - Elapsed time: 0.020071s
Cost: 1; Total time: 0.019881
Failed at location 2: x_5^0 <= 0
Before Improving: 
Quasi-invariant at l2: x_5^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002714s
Remaining time after improvement: 0.998584
Postcondition implied by a set of quasi-invariant(s):
Quasi-invariant at l2: x_5^0 <= 0
Postcondition: x_5^0 <= 0

LOG: CALL check - Post:x_5^0 <= 0 - Process 4
* Exit transition: <l0, l2, 1 <= x_5^0, {all remain the same}>
* Postcondition  : x_5^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000459s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x_5^0 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 1 <= x_5^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: x_5^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027945s
Time used: 1.00061

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 5.219059s

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
Variables:
x_5^0

Checking conditional non-termination of SCC {l2}...
> No exit transition to close.
Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001014s
> No assignment for some undef value.

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
Variables:
x_5^0

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, x_5^0 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006127s
Time used: 0.005963
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011219s
Time used: 0.011212

LOG: SAT solveNonLinear - Elapsed time: 0.017345s
Cost: 1; Total time: 0.017175
Failed at location 2: 1 <= x_5^0
Before Improving: 
Quasi-invariant at l2: 1 <= x_5^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002960s
Remaining time after improvement: 0.99914
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.001812s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 <= x_5^0

Strengthening and disabling EXIT transitions...
Closed exits from l2: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 1 <= x_5^0, 
OPEN EXITS: 
<l2, end, 1 <= x_5^0, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l2, true, {all remain the same}>
Conditions: 1 <= x_5^0, 
OPEN EXITS: 
<l0, l2, 1 <= x_5^0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate