NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l15, true>
<l1, l2, true>
<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef7 = undef7) /\ ((0 + undef7) <= 0) /\ (0 <= (0 + undef7)), par{tmp_8^0 -> undef7}>
<l3, l5, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12), par{tmp_8^0 -> undef12}>
<l5, l6, ((1 + tmp_8^0) <= 0)>
<l5, l6, (1 <= (0 + tmp_8^0))>
<l6, l7, true, par{y_6^0 -> (1 + y_6^0)}>
<l7, l3, true>
<l3, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l2, l8, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0))>
<l2, l9, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef46 = undef46), par{Result_4^0 -> undef46}>
<l8, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef52 = undef52) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)), par{tmp_8^0 -> undef52}>
<l8, l10, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57), par{tmp_8^0 -> undef57}>
<l10, l11, ((1 + tmp_8^0) <= 0)>
<l10, l11, (1 <= (0 + tmp_8^0))>
<l11, l3, true, par{y_6^0 -> (1 + y_6^0)}>
<l8, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l4, l12, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef82 = undef82) /\ ((0 + undef82) <= 0) /\ (0 <= (0 + undef82)), par{tmp_8^0 -> undef82}>
<l12, l4, true>
<l4, l13, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92), par{tmp_8^0 -> undef92}>
<l13, l14, ((1 + tmp_8^0) <= 0)>
<l13, l14, (1 <= (0 + tmp_8^0))>
<l14, l3, true, par{y_6^0 -> (1 + y_6^0)}>
<l15, l1, true>

Fresh variables:
undef7, undef12, undef46, undef52, undef57, undef82, undef92, 

Undef variables:
undef7, undef12, undef46, undef52, undef57, undef82, undef92, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef52 = undef52) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52))>
<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57) /\ ((1 + undef57) <= 0), par{y_6^0 -> (1 + y_6^0)}>
<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef57 = undef57) /\ (1 <= (0 + undef57)), par{y_6^0 -> (1 + y_6^0)}>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l2, l9, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef46 = undef46)>
<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef7 = undef7) /\ ((0 + undef7) <= 0) /\ (0 <= (0 + undef7))>
<l3, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12) /\ ((1 + undef12) <= 0), par{y_6^0 -> (1 + y_6^0)}>
<l3, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef12 = undef12) /\ (1 <= (0 + undef12)), par{y_6^0 -> (1 + y_6^0)}>
<l3, l2, (((0 + (~(1) * y_6^0)) + z_7^0) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l4, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef82 = undef82) /\ ((0 + undef82) <= 0) /\ (0 <= (0 + undef82))>
<l4, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92) /\ ((1 + undef92) <= 0), par{y_6^0 -> (1 + y_6^0)}>
<l4, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef92 = undef92) /\ (1 <= (0 + undef92)), par{y_6^0 -> (1 + y_6^0)}>

Fresh variables:
undef7, undef12, undef46, undef52, undef57, undef82, undef92, 

Undef variables:
undef7, undef12, undef46, undef52, undef57, undef82, undef92, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l9, y_6^0 <= x_5^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2, l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006591s
Ranking function: -7 - 3*x_5^0 - y_6^0 + 4*z_7^0
New Graphs: 
Transitions:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0
Checking conditional termination of SCC {l2, l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002751s
Ranking function: -1 - y_6^0 + z_7^0
New Graphs: 
Transitions:
<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0
Transitions:
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
Variables:
y_6^0, z_7^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

LOG: CALL check - Post:z_7^0 <= y_6^0 - Process 1
* Exit transition: <l4, l4, true, {all remain the same}>
* Postcondition  : z_7^0 <= y_6^0
Quasi-invariants: 
Location 2: z_7^0 <= y_6^0 ; 
Location 3: z_7^0 <= y_6^0 ; 
Location 4: z_7^0 <= y_6^0 ; 
Postcondition: z_7^0 <= y_6^0

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000454s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>

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

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Narrowing transition: 
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Narrowing transition: 
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 1 + y_6^0 <= z_7^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l4, true, {all remain the same}>
POST: z_7^0 <= y_6^0


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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081339s
Time used: 0.081331

LOG: SAT solveNonLinear - Elapsed time: 0.126585s
Cost: 1; Total time: 0.126232
Failed at location 2: y_6^0 <= x_5^0
Before Improving: 
Quasi-invariant at l2: y_6^0 <= x_5^0
Quasi-invariant at l3: 1 <= 0
Quasi-invariant at l4: z_7^0 <= y_6^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011107s
Remaining time after improvement: 0.997446
Postcondition implied by a set of quasi-invariant(s):
Quasi-invariant at l2: y_6^0 <= x_5^0
Quasi-invariant at l3: 1 <= 0
Quasi-invariant at l4: z_7^0 <= y_6^0
Postcondition: y_6^0 <= x_5^0

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001001s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
2: y_6^0 <= x_5^0 , 
3: 1 <= 0 , 
4: z_7^0 <= y_6^0 , 
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l4, true, {all remain the same}>
POST: z_7^0 <= y_6^0


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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013414s
Time used: 1.00013

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

LOG: RETURN check - Elapsed time: 5.285253s

Proving non-termination of subgraph 1
Transitions:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef52 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l2, l2, z_7^0 <= y_6^0 /\ 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef12 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef12, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l2, z_7^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 + undef92 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ 1 <= undef92, {y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.123024s
Time used: 0.122978

LOG: SAT solveNonLinear - Elapsed time: 0.572120s
Cost: 1; Total time: 0.571306
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

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

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: y_6^0 <= 1 + z_7^0
Quasi-invariant at l4: 1 + y_6^0 <= z_7^0

Strengthening and disabling EXIT transitions...
Closed exits from l4: 1
Strengthening exit transition (result): 
<l2, end, y_6^0 <= x_5^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 + undef57 <= 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 1 <= undef57, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef7 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005220s
Time used: 5.00008
> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO

Proving non-termination of subgraph 1
Transitions:
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>
Variables:
y_6^0, z_7^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012943s
Time used: 0.012839

LOG: SAT solveNonLinear - Elapsed time: 0.012943s
Cost: 0; Total time: 0.012839
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

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

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l4: 1 + y_6^0 <= z_7^0

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef82 = 0, {all remain the same}>

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

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

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

> Conditions are reachable!

Program does NOT terminate