NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> (10 * arg2)}>
<l2, l3, (arg3 < 10) /\ (arg3 > 1), par{arg2 -> arg3, arg3 -> arg2}>
<l2, l3, (arg3 > 10), par{arg2 -> arg3, arg3 -> arg2}>
<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg2 - 1)}>
<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg2 + 1)}>
<l4, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>

Fresh variables:
undef22, undef23, undef24, 

Undef variables:
undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = (10 * undef23)) /\ (undef22 > 0) /\ (undef23 > ~(1))>
<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>

Fresh variables:
undef22, undef23, undef24, 

Undef variables:
undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007698s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.099839s
Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002556s
Time used: 4.00084
Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.031513s
Time used: 4.00047
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.025564s
Time used: 4.00014
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012289s
Time used: 4.00079
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.026088s
Time used: 4.0008
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000964s
Time used: 1.00091

LOG: SAT solveNonLinear - Elapsed time: 1.153433s
Cost: 1; Total time: 1.13671
Failed at location 2: arg3 <= 0
Before Improving: 
Quasi-invariant at l2: arg3 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011645s
Remaining time after improvement: 0.993272
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg3 <= 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: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, 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: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
New Graphs: 
Calling Safety with literal arg3 <= 0 and entry <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>

LOG: CALL check - Post:arg3 <= 0 - Process 1
* Exit transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
* Postcondition  : arg3 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001215s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg3 <= 0 , 
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002801s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.097914s
Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.639810s
Time used: 3.63815
Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021375s
Time used: 0.993879
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975151s
Time used: 0.968353
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.996917s
Time used: 0.990302
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.998307s
Time used: 0.989982
Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997165s
Time used: 0.990006

Proving non-termination of subgraph 1
Transitions:
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Variables:
arg1, arg2, arg3

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 1 <= arg2 /\ 10 <= arg3 /\ 2 <= arg1, {all remain the same}>
<l2, end, arg2 <= 0 /\ 10 <= arg3 /\ 2 <= arg1, {all remain the same}>
<l2, end, 1 <= arg2 /\ 2 <= arg1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, arg2 <= 0 /\ 2 <= arg1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, 1 <= arg2 /\ arg3 <= 1 /\ 2 <= arg1, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg3 <= 1 /\ 2 <= arg1, {all remain the same}>
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128161s
Time used: 0.127674
Improving Solution with cost 10 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002024s
Time used: 1.00197

LOG: SAT solveNonLinear - Elapsed time: 1.130185s
Cost: 10; Total time: 1.12964
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 <= 1

Strengthening and disabling EXIT transitions...
Closed exits from l2: 6
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {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, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.082972s
Time used: 0.082603
Improving Solution with cost 7 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006109s
Time used: 1.00074

LOG: SAT solveNonLinear - Elapsed time: 1.089080s
Cost: 7; Total time: 1.08334
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 0 <= arg2

Strengthening and disabling EXIT transitions...
Closed exits from l2: 2
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg3 <= 0 /\ arg1 <= 1 /\ arg2 = 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, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
<l2, end, arg3 <= 0 /\ arg1 <= 1 /\ arg2 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034328s
Time used: 0.033862
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001095s
Time used: 1.00103

LOG: SAT solveNonLinear - Elapsed time: 1.035423s
Cost: 4; Total time: 1.03489
Failed at location 2: 1 <= arg3
Before Improving: 
Quasi-invariant at l2: 1 <= arg3
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.042126s
Remaining time after improvement: 0.996967
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 <= arg3

Strengthening and disabling EXIT transitions...
Closed exits from l2: 2
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {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, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026227s
Time used: 0.026122

LOG: SAT solveNonLinear - Elapsed time: 0.026227s
Cost: 0; Total time: 0.026122
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg2 <= 1

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: arg1 <= 1, 0 <= arg2, 1 <= arg3, arg2 <= 1, 
OPEN EXITS: 
<l2, end, 0 <= arg2 /\ 1 <= arg3 /\ arg1 <= 1 /\ arg2 <= 1, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
Conditions: 0 <= arg2, 1 <= arg3, arg1 <= 1, arg2 <= 1, 
OPEN EXITS: 
<l0, l2, 0 <= undef23 /\ 1 <= arg3 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate