YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l2, (undef9 = undef9) /\ (undef10 = undef10), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef9, oldX3^0 -> undef10, x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l3, l4, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l5, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 2), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l6, l2, (undef33 = undef33) /\ (undef34 = undef34), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l6, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)), par{oldX0^0 -> undef37, oldX1^0 -> undef38, x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l7, l5, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0), par{oldX0^0 -> undef43, oldX1^0 -> undef44, x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l7, l6, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)), par{oldX0^0 -> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}>
<l4, l7, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)), par{oldX0^0 -> undef55, oldX1^0 -> undef56, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56)}>
<l8, l1, true>
<l8, l3, true>
<l8, l2, true>
<l8, l5, true>
<l8, l6, true>
<l8, l7, true>
<l8, l4, true>
<l9, l8, true>

Fresh variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Undef variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, true>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l0, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + undef44))) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l0, l4, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l0, l4, true>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + undef44))) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l4, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef55))) /\ (undef50 = (0 + (0 + undef56))) /\ (1 <= (0 + undef49)) /\ (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l4, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef55))) /\ (undef50 = (0 + (0 + undef56))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>

Fresh variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Undef variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l4, l4, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, 3 <= undef26 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef13 = undef25 /\ undef14 = undef26, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
<l0, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
<l0, l4, true, {all remain the same}>

Graph 2
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, true, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, undef20 <= 2 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 3 <= undef26 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, true, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>
<l0, l2, undef43 <= 0 /\ undef20 <= 2 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef19 = undef43 /\ undef20 = undef44, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef25 = undef43 /\ undef26 = undef44, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>
<l4, l2, undef43 <= 0 /\ undef20 <= 2 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef19 = undef43 /\ undef20 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l4, l2, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l4, l2, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002156s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.023204s
Trying to remove transition: <l4, l4, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039240s
Time used: 0.038077
Trying to remove transition: <l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.063250s
Time used: 0.063247

LOG: SAT solveNonLinear - Elapsed time: 0.104703s
Cost: 4; Total time: 0.103223
Failed at location 4: 1 <= x1^0
Failed at location 4: 1 <= x1^0
Failed at location 4: 1 <= x1^0
Failed at location 4: 1 <= x1^0
Before Improving: 
Quasi-invariant at l4: 1 <= x1^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013280s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007930s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007720s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007727s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008053s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007966s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007964s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007998s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007965s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008013s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007981s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008008s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008027s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008010s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008013s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008027s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008027s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008033s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008055s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008084s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008062s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008080s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008062s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008098s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008093s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008067s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008063s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008070s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008082s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008038s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008047s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008044s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008061s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008083s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008052s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008050s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008055s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008324s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008340s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008164s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008124s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008129s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008161s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008137s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008123s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008139s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008102s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008116s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008123s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008117s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008100s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008105s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008112s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008141s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008171s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008130s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008146s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008145s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008174s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008173s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008165s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008157s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008165s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008166s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008160s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008127s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008162s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008135s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008188s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008163s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008173s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008148s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008180s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008187s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008201s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008190s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008190s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008199s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008191s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008177s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008178s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008185s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008189s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008174s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008180s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008204s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008200s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008185s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008185s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008206s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008228s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008190s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008195s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008220s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008202s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008203s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008201s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008233s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008230s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008243s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008209s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008247s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008191s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008192s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008196s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008228s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008236s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008207s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008235s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008624s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008518s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008380s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008311s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008278s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008282s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008270s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008270s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008251s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008252s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008257s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008241s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008254s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008249s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008242s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008261s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008257s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008286s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008258s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008263s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008283s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008265s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008247s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008261s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008295s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008285s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008264s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008278s
Quasi-invariant improved
Remaining time after improvement: -0.000101
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l4: 0 <= 136 + x1^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 136 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= undef49 /\ 0 <= 136 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 136 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= undef49 /\ 0 <= 136 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Ranking function: 268 + 4*x0^0 + 2*x1^0
New Graphs: 
Transitions:
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 136 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001807s
Ranking function: -x0^0
New Graphs: 
Calling Safety with literal 0 <= 136 + x1^0 and entry <l0, l4, x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>

LOG: CALL check - Post:0 <= 136 + x1^0 - Process 1
* Exit transition: <l0, l4, x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
* Postcondition  : 0 <= 136 + x1^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000947s
Calling Safety with literal 0 <= 136 + x1^0 and entry <l0, l4, x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>

LOG: CALL check - Post:0 <= 136 + x1^0 - Process 2
* Exit transition: <l0, l4, x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
* Postcondition  : 0 <= 136 + x1^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000887s
Calling Safety with literal 0 <= 136 + x1^0 and entry <l0, l4, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>

LOG: CALL check - Post:0 <= 136 + x1^0 - Process 3
* Exit transition: <l0, l4, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
* Postcondition  : 0 <= 136 + x1^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001091s
Calling Safety with literal 0 <= 136 + x1^0 and entry <l0, l4, true, {all remain the same}>

LOG: CALL check - Post:0 <= 136 + x1^0 - Process 4
* Exit transition: <l0, l4, true, {all remain the same}>
* Postcondition  : 0 <= 136 + x1^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000687s
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: 0 <= 136 + x1^0 , 
It's unfeasible. Removing transition: 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
Narrowing transition: 
<l4, l4, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l4, l4, 1 <= undef49 /\ 137 + x1^0 <= 0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001550s
Ranking function: -1 + x0^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates