NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l15, true>
<l1, l2, true>
<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef13 = undef13) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{tmp_8^0 -> undef13}>
<l3, l5, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef21 = undef21), par{tmp_8^0 -> undef21}>
<l5, l6, (undef26 = __disjvr_0^0) /\ (__disjvr_0^0 = undef26), par{__disjvr_0^0 -> undef26}>
<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) /\ (undef65 = undef65), par{Result_4^0 -> undef65}>
<l8, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 0) /\ (0 <= (0 + undef77)), par{tmp_8^0 -> undef77}>
<l8, l10, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef85 = undef85), par{tmp_8^0 -> undef85}>
<l10, l11, (undef91 = __disjvr_1^0) /\ (__disjvr_1^0 = undef91), par{__disjvr_1^0 -> undef91}>
<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)) /\ (undef117 = undef117) /\ ((0 + undef117) <= 0) /\ (0 <= (0 + undef117)), par{tmp_8^0 -> undef117}>
<l12, l4, true>
<l4, l13, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef133 = undef133), par{tmp_8^0 -> undef133}>
<l13, l14, (undef140 = __disjvr_2^0) /\ (__disjvr_2^0 = undef140), par{__disjvr_2^0 -> undef140}>
<l14, l3, true, par{y_6^0 -> (1 + y_6^0)}>
<l15, l1, true>

Fresh variables:
undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 

Undef variables:
undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 

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)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 0) /\ (0 <= (0 + undef77))>
<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef85 = undef85) /\ (undef91 = __disjvr_1^0) /\ (__disjvr_1^0 = undef91), par{__disjvr_1^0 -> undef91, 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) /\ (undef65 = undef65)>
<l3, l4, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef13 = undef13) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13))>
<l3, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef21 = undef21) /\ (undef26 = __disjvr_0^0) /\ (__disjvr_0^0 = undef26), par{__disjvr_0^0 -> undef26, 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)) /\ (undef117 = undef117) /\ ((0 + undef117) <= 0) /\ (0 <= (0 + undef117))>
<l4, l3, (0 <= ((~(1) + (~(1) * y_6^0)) + z_7^0)) /\ (undef133 = undef133) /\ (undef140 = __disjvr_2^0) /\ (__disjvr_2^0 = undef140), par{__disjvr_2^0 -> undef140, y_6^0 -> (1 + y_6^0)}>

Fresh variables:
undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 

Undef variables:
undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 

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 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, 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 /\ undef13 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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 /\ undef117 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0, __disjvr_1^0, __disjvr_0^0, __disjvr_2^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.032547

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003258s
Ranking function: -5 - 2*x_5^0 - y_6^0 + 3*z_7^0
New Graphs: 
Transitions:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef77 = 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 /\ undef13 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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 /\ undef117 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
__disjvr_0^0, __disjvr_2^0, 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.001137s
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 /\ undef117 = 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.000453s
Ranking function: -1 - x_5^0 + y_6^0
New Graphs: 
Transitions:
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef117 = 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.000200s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000231s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef77 = 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 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, 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 /\ undef13 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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 /\ undef117 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 1 + y_6^0 <= z_7^0 /\ undef13 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 1 + y_6^0 <= z_7^0 /\ undef117 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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.024745s
Time used: 0.024589
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026832s
Time used: 0.026831

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

LOG: CALL solveLinear

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

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000526s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
2: z_7^0 <= 1 + x_5^0 , 
3: 1 <= 0 , 
4: 1 <= 0 , 
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef77 = 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 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, 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 /\ undef13 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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 /\ undef117 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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 /\ 2 + x_5^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 /\ 2 + x_5^0 <= z_7^0 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef13 = 0, {all remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef117 = 0, {all remain the same}>
<l4, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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.023678s
Time used: 0.023507
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.024343s
Time used: 0.024341

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

LOG: CALL solveLinear

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

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000565s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_6^0 <= x_5^0 , 
3: z_7^0 <= y_6^0 , 
4: 1 <= 0 , 
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^0 <= z_7^0 /\ undef77 = 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 /\ 2 + x_5^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>

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

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

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

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

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^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 /\ 2 + x_5^0 <= z_7^0 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef13 = 0, {all remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef117 = 0, {all remain the same}>
<l4, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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.026976s
Time used: 0.026805
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034019s
Time used: 0.034017

LOG: SAT solveNonLinear - Elapsed time: 0.060995s
Cost: 1; Total time: 0.060822
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: z_7^0 <= y_6^0
Quasi-invariant at l4: 1 <= 0
Optimizing invariants...

LOG: CALL solveLinear

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

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000611s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
2: y_6^0 <= x_5^0 , 
3: z_7^0 <= y_6^0 , 
4: 1 <= 0 , 
Narrowing transition: 
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^0 <= z_7^0 /\ undef77 = 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 /\ 2 + x_5^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>

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

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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 /\ 2 + x_5^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 /\ 2 + x_5^0 <= z_7^0 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ 2 + x_5^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l3, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef13 = 0, {all remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, y_6^0 -> 1 + y_6^0, rest remain the same}>
<l4, l4, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ undef117 = 0, {all remain the same}>
<l4, l3, 0 <= 0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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.057514s
Time used: 0.057459
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017715s
Time used: 1.00006

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

LOG: RETURN check - Elapsed time: 5.286278s

Proving non-termination of subgraph 1
Transitions:
<l2, l4, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ undef77 = 0, {all remain the same}>
<l2, l3, 1 + x_5^0 <= y_6^0 /\ 1 + y_6^0 <= z_7^0 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, 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 /\ undef13 = 0, {all remain the same}>
<l3, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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 /\ undef117 = 0, {all remain the same}>
<l4, l3, 1 + y_6^0 <= z_7^0 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, y_6^0 -> 1 + y_6^0, rest remain the same}>
Variables:
x_5^0, y_6^0, z_7^0, __disjvr_1^0, __disjvr_0^0, __disjvr_2^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001272s
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.254235s
Time used: 0.253603
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062235s
Time used: 0.062232

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

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.010903s
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 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 /\ undef77 = 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 /\ __disjvr_1^0 = undef91, {__disjvr_1^0 -> undef91, 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 /\ undef13 = 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 /\ __disjvr_0^0 = undef26, {__disjvr_0^0 -> undef26, 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, {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 /\ undef117 = 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 /\ __disjvr_2^0 = undef140, {__disjvr_2^0 -> undef140, 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.002322s
Time used: 5.00225
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004299s
Time used: 5.00039
> 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 /\ undef117 = 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.006818s
Time used: 0.006736

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

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.001904s
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 /\ undef117 = 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