NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}>
<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>
<l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}>

Fresh variables:
undef11, undef12, 

Undef variables:
undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))>
<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>

Fresh variables:
undef11, undef12, 

Undef variables:
undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {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.155024

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002495s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.763134s
Time used: 0.762643
Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.480301s
Time used: 0.480221

LOG: SAT solveNonLinear - Elapsed time: 1.795146s
Cost: 1; Total time: 1.76008
Failed at location 2: 11 <= arg2
Before Improving: 
Quasi-invariant at l2: 11 <= arg2
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.041233s
Remaining time after improvement: 0.996827
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 11 <= arg2
[ 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, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, 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, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, 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, arg2 = 10, {arg1 -> 0, arg2 -> 9, 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, arg2 = 0, {arg1 -> 1, arg2 -> 1, 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, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, 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, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, 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, arg2 = 10, {arg1 -> 0, arg2 -> 9, 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, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
New Graphs: 
Calling Safety with literal 11 <= arg2 and entry <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>

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

LOG: CALL solveLinear

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

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

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

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001459s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.758385s
Time used: 0.75788
Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009987s
Time used: 0.976211

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079054s
Time used: 0.078752
Improving Solution with cost 8 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001648s
Time used: 1.00154

LOG: SAT solveNonLinear - Elapsed time: 1.080702s
Cost: 8; Total time: 1.08029
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: 3
Strengthening exit transition (result): 
<l2, end, 11 <= arg2 /\ 2 <= arg1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 11 <= arg2 /\ arg1 = 1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 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, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048438s
Time used: 0.048151
Improving Solution with cost 5 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.206766s
Time used: 0.20675
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.230038s
Time used: 0.230023

LOG: SAT solveNonLinear - Elapsed time: 0.485242s
Cost: 3; Total time: 0.484924
Failed at location 2: arg2 <= 10
Before Improving: 
Quasi-invariant at l2: arg2 <= 10
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020539s
Remaining time after improvement: 0.997854
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg2 <= 10

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047435s
Time used: 0.047427

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

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013506s
Time used: 0.013404

LOG: SAT solveNonLinear - Elapsed time: 0.013506s
Cost: 0; Total time: 0.013404
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: 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 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

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

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

> Conditions are reachable!

Program does NOT terminate