/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l26, true>
<l1, l2, true>
<l3, l4, ((1 + ip3^0) <= (0 + i2^0)), par{i1^0 -> (2 + i1^0)}>
<l3, l5, ((0 + i2^0) <= (0 + ip3^0)) /\ (undef67 = (0 + i2^0)) /\ (undef75 = undef75) /\ (undef74 = undef74), par{i2^0 -> ((0 + i2^0) + ifp2^0), k1^0 -> undef67, k2^0 -> ((0 + ifp1^0) + undef67), tempi^0 -> undef74, tempr^0 -> undef75}>
<l5, l3, true>
<l6, l7, (((~(1) + i3^0) + ip1^0) <= (0 + i1^0)) /\ (undef134 = undef134) /\ (undef131 = undef131), par{i3^0 -> ((0 + i3^0) + ip1^0), wi^0 -> undef131, wr^0 -> undef134, wtemp^0 -> (0 + wr^0)}>
<l6, l5, ((0 + i1^0) <= ((~(2) + i3^0) + ip1^0))>
<l4, l6, true>
<l8, l9, ((1 + ifp1^0) <= (0 + i3^0)), par{ifp1^0 -> (0 + ifp2^0)}>
<l8, l4, ((0 + i3^0) <= (0 + ifp1^0))>
<l7, l8, true>
<l10, l1, ((0 + ip2^0) <= (0 + ifp1^0)) /\ (undef287 = undef287), par{idim^0 -> (~(1) + idim^0), nprev^0 -> undef287}>
<l10, l7, ((1 + ifp1^0) <= (0 + ip2^0)) /\ (undef306 = undef306) /\ (undef319 = undef319) /\ (undef324 = undef324) /\ (undef322 = undef322) /\ (undef321 = undef321), par{ifp2^0 -> undef306, theta^0 -> undef319, wi^0 -> 0, wpi^0 -> undef321, wpr^0 -> undef322, wr^0 -> 1, wtemp^0 -> undef324}>
<l9, l10, true>
<l11, l12, true, par{i2^0 -> ((0 + i2^0) + ip1^0), i2rev^0 -> ((0 + i2rev^0) + ibit^0)}>
<l13, l11, ((0 + i2rev^0) <= (0 + ibit^0))>
<l13, l14, ((1 + ibit^0) <= (0 + i2rev^0)) /\ (undef411 = undef411), par{i2rev^0 -> ((0 + i2rev^0) + (~(1) * ibit^0)), ibit^0 -> undef411}>
<l15, l11, ((1 + ibit^0) <= (0 + ip1^0))>
<l15, l13, ((0 + ip1^0) <= (0 + ibit^0))>
<l14, l15, true>
<l16, l14, (undef519 = undef519), par{ibit^0 -> undef519}>
<l17, l1, ((1 + ndim^0) <= (0 + idim^0)), par{nprev^0 -> 1}>
<l17, l18, ((0 + idim^0) <= (0 + ndim^0)) /\ (undef586 = undef586), par{idim^0 -> (1 + idim^0), ntot^0 -> undef586}>
<l19, l20, ((1 + ip3^0) <= (0 + i3^0)), par{i1^0 -> (2 + i1^0)}>
<l19, l21, ((0 + i3^0) <= (0 + ip3^0)) /\ (undef649 = undef649) /\ (undef642 = undef642), par{i3^0 -> ((0 + i3^0) + ip2^0), i3rev^0 -> (((0 + (~(1) * i2^0)) + i2rev^0) + i3^0), tempr^0 -> undef642}>
<l21, l19, true>
<l22, l16, (((~(1) + i2^0) + ip1^0) <= (0 + i1^0))>
<l22, l21, ((0 + i1^0) <= ((~(2) + i2^0) + ip1^0))>
<l20, l22, true>
<l23, l16, ((0 + i2rev^0) <= (0 + i2^0))>
<l23, l20, ((1 + i2^0) <= (0 + i2rev^0))>
<l18, l17, true>
<l24, l9, ((1 + ip2^0) <= (0 + i2^0)), par{ifp1^0 -> (0 + ip1^0)}>
<l24, l23, ((0 + i2^0) <= (0 + ip2^0))>
<l12, l24, true>
<l2, l25, ((1 + idim^0) <= 1)>
<l2, l12, (1 <= (0 + idim^0)) /\ (undef961 = undef961) /\ (undef964 = undef964) /\ (undef956 = undef956) /\ (undef957 = undef957) /\ (undef958 = undef958), par{i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, n^0 -> undef961, nrem^0 -> undef964}>
<l26, l18, true>

Fresh variables:
undef67, undef74, undef75, undef131, undef134, undef287, undef306, undef319, undef321, undef322, undef324, undef411, undef519, undef586, undef642, undef649, undef956, undef957, undef958, undef961, undef964, 

Undef variables:
undef67, undef74, undef75, undef131, undef134, undef287, undef306, undef319, undef321, undef322, undef324, undef411, undef519, undef586, undef642, undef649, undef956, undef957, undef958, undef961, undef964, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l18, true>
<l5, l7, ((1 + ip3^0) <= (0 + i2^0)) /\ (((~(1) + i3^0) + ip1^0) <= (0 + (2 + i1^0))) /\ (undef134 = undef134) /\ (undef131 = undef131), par{i1^0 -> (2 + i1^0), i3^0 -> ((0 + i3^0) + ip1^0), wr^0 -> undef134}>
<l5, l5, ((1 + ip3^0) <= (0 + i2^0)) /\ ((0 + (2 + i1^0)) <= ((~(2) + i3^0) + ip1^0)), par{i1^0 -> (2 + i1^0)}>
<l5, l5, ((0 + i2^0) <= (0 + ip3^0)) /\ (undef67 = (0 + i2^0)) /\ (undef75 = undef75) /\ (undef74 = undef74), par{i2^0 -> ((0 + i2^0) + ifp2^0)}>
<l7, l25, ((1 + ifp1^0) <= (0 + i3^0)) /\ ((0 + ip2^0) <= (0 + (0 + ifp2^0))) /\ (undef287 = undef287) /\ ((1 + (~(1) + idim^0)) <= 1), par{idim^0 -> (~(1) + idim^0), ifp1^0 -> (0 + ifp2^0)}>
<l7, l12, ((1 + ifp1^0) <= (0 + i3^0)) /\ ((0 + ip2^0) <= (0 + (0 + ifp2^0))) /\ (undef287 = undef287) /\ (1 <= (0 + (~(1) + idim^0))) /\ (undef961 = undef961) /\ (undef964 = undef964) /\ (undef956 = undef956) /\ (undef957 = undef957) /\ (undef958 = undef958), par{i2rev^0 -> 1, idim^0 -> (~(1) + idim^0), ifp1^0 -> (0 + ifp2^0), ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958}>
<l7, l7, ((1 + ifp1^0) <= (0 + i3^0)) /\ ((1 + (0 + ifp2^0)) <= (0 + ip2^0)) /\ (undef306 = undef306) /\ (undef319 = undef319) /\ (undef324 = undef324) /\ (undef322 = undef322) /\ (undef321 = undef321), par{ifp1^0 -> (0 + ifp2^0), ifp2^0 -> undef306, wr^0 -> 1}>
<l7, l7, ((0 + i3^0) <= (0 + ifp1^0)) /\ (((~(1) + i3^0) + ip1^0) <= (0 + i1^0)) /\ (undef134 = undef134) /\ (undef131 = undef131), par{i3^0 -> ((0 + i3^0) + ip1^0), wr^0 -> undef134}>
<l7, l5, ((0 + i3^0) <= (0 + ifp1^0)) /\ ((0 + i1^0) <= ((~(2) + i3^0) + ip1^0))>
<l12, l25, ((1 + ip2^0) <= (0 + i2^0)) /\ ((0 + ip2^0) <= (0 + (0 + ip1^0))) /\ (undef287 = undef287) /\ ((1 + (~(1) + idim^0)) <= 1), par{idim^0 -> (~(1) + idim^0), ifp1^0 -> (0 + ip1^0)}>
<l12, l12, ((1 + ip2^0) <= (0 + i2^0)) /\ ((0 + ip2^0) <= (0 + (0 + ip1^0))) /\ (undef287 = undef287) /\ (1 <= (0 + (~(1) + idim^0))) /\ (undef961 = undef961) /\ (undef964 = undef964) /\ (undef956 = undef956) /\ (undef957 = undef957) /\ (undef958 = undef958), par{i2rev^0 -> 1, idim^0 -> (~(1) + idim^0), ifp1^0 -> (0 + ip1^0), ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958}>
<l12, l7, ((1 + ip2^0) <= (0 + i2^0)) /\ ((1 + (0 + ip1^0)) <= (0 + ip2^0)) /\ (undef306 = undef306) /\ (undef319 = undef319) /\ (undef324 = undef324) /\ (undef322 = undef322) /\ (undef321 = undef321), par{ifp1^0 -> (0 + ip1^0), ifp2^0 -> undef306, wr^0 -> 1}>
<l12, l14, ((0 + i2^0) <= (0 + ip2^0)) /\ ((0 + i2rev^0) <= (0 + i2^0)) /\ (undef519 = undef519), par{ibit^0 -> undef519}>
<l12, l14, ((0 + i2^0) <= (0 + ip2^0)) /\ ((1 + i2^0) <= (0 + i2rev^0)) /\ (((~(1) + i2^0) + ip1^0) <= (0 + i1^0)) /\ (undef519 = undef519), par{ibit^0 -> undef519}>
<l12, l21, ((0 + i2^0) <= (0 + ip2^0)) /\ ((1 + i2^0) <= (0 + i2rev^0)) /\ ((0 + i1^0) <= ((~(2) + i2^0) + ip1^0))>
<l14, l12, ((1 + ibit^0) <= (0 + ip1^0)), par{i2^0 -> ((0 + i2^0) + ip1^0), i2rev^0 -> ((0 + i2rev^0) + ibit^0)}>
<l14, l12, ((0 + ip1^0) <= (0 + ibit^0)) /\ ((0 + i2rev^0) <= (0 + ibit^0)), par{i2^0 -> ((0 + i2^0) + ip1^0), i2rev^0 -> ((0 + i2rev^0) + ibit^0)}>
<l14, l14, ((0 + ip1^0) <= (0 + ibit^0)) /\ ((1 + ibit^0) <= (0 + i2rev^0)) /\ (undef411 = undef411), par{i2rev^0 -> ((0 + i2rev^0) + (~(1) * ibit^0)), ibit^0 -> undef411}>
<l18, l25, ((1 + ndim^0) <= (0 + idim^0)) /\ ((1 + idim^0) <= 1)>
<l18, l12, ((1 + ndim^0) <= (0 + idim^0)) /\ (1 <= (0 + idim^0)) /\ (undef961 = undef961) /\ (undef964 = undef964) /\ (undef956 = undef956) /\ (undef957 = undef957) /\ (undef958 = undef958), par{i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958}>
<l18, l18, ((0 + idim^0) <= (0 + ndim^0)) /\ (undef586 = undef586), par{idim^0 -> (1 + idim^0)}>
<l21, l14, ((1 + ip3^0) <= (0 + i3^0)) /\ (((~(1) + i2^0) + ip1^0) <= (0 + (2 + i1^0))) /\ (undef519 = undef519), par{i1^0 -> (2 + i1^0), ibit^0 -> undef519}>
<l21, l21, ((1 + ip3^0) <= (0 + i3^0)) /\ ((0 + (2 + i1^0)) <= ((~(2) + i2^0) + ip1^0)), par{i1^0 -> (2 + i1^0)}>
<l21, l21, ((0 + i3^0) <= (0 + ip3^0)) /\ (undef649 = undef649) /\ (undef642 = undef642), par{i3^0 -> ((0 + i3^0) + ip2^0)}>

Fresh variables:
undef67, undef74, undef75, undef131, undef134, undef287, undef306, undef319, undef321, undef322, undef324, undef411, undef519, undef586, undef642, undef649, undef956, undef957, undef958, undef961, undef964, 

Undef variables:
undef67, undef74, undef75, undef131, undef134, undef287, undef306, undef319, undef321, undef322, undef324, undef411, undef519, undef586, undef642, undef649, undef956, undef957, undef958, undef961, undef964, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l18, l18, idim^0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>
Variables:
idim^0, ndim^0

Graph 2:
Transitions:
<l5, l7, 1 + ip3^0 <= i2^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l5, l5, 1 + ip3^0 <= i2^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l5, l5, i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
<l7, l12, 1 + ifp1^0 <= i3^0 /\ ip2^0 <= ifp2^0 /\ 2 <= idim^0, {i2rev^0 -> 1, idim^0 -> -1 + idim^0, ifp1^0 -> ifp2^0, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l7, l5, i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
<l12, l12, 1 + ip2^0 <= i2^0 /\ ip2^0 <= ip1^0 /\ 2 <= idim^0, {i2rev^0 -> 1, idim^0 -> -1 + idim^0, ifp1^0 -> ip1^0, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
<l12, l7, 1 + ip2^0 <= i2^0 /\ 1 + ip1^0 <= ip2^0, {ifp1^0 -> ip1^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l12, l14, i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l21, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>
<l21, l21, 1 + ip3^0 <= i3^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l21, l21, i3^0 <= ip3^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i3^0, ip1^0, ip3^0, wr^0, ifp2^0, idim^0, ifp1^0, ip2^0, i2rev^0, ibit^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>

Graph 3
<l7, l25, 1 + ifp1^0 <= i3^0 /\ ip2^0 <= ifp2^0 /\ idim^0 <= 1, {idim^0 -> -1 + idim^0, ifp1^0 -> ifp2^0, rest remain the same}>
<l12, l25, 1 + ip2^0 <= i2^0 /\ ip2^0 <= ip1^0 /\ idim^0 <= 1, {idim^0 -> -1 + idim^0, ifp1^0 -> ip1^0, rest remain the same}>
<l18, l25, 1 + ndim^0 <= idim^0 /\ idim^0 <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 2 )
( 7 , 2 )
( 12 , 2 )
( 14 , 2 )
( 18 , 1 )
( 21 , 2 )
( 25 , 3 )

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

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

Checking conditional termination of SCC {l18}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001353s
Ranking function: -idim^0 + ndim^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 4.10225

Checking conditional termination of SCC {l5, l7, l12, l14, l21}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020137s
Ranking function: 2 + idim^0
New Graphs: 
Transitions:
<l12, l14, i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l21, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>
<l21, l21, 1 + ip3^0 <= i3^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l21, l21, i3^0 <= ip3^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i2rev^0, i3^0, ibit^0, ip1^0, ip2^0, ip3^0
Transitions:
<l5, l7, 1 + ip3^0 <= i2^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l5, l5, 1 + ip3^0 <= i2^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l5, l5, i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l7, l5, i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
Variables:
i1^0, i2^0, i3^0, ifp1^0, ifp2^0, ip1^0, ip2^0, ip3^0, wr^0
Checking conditional termination of SCC {l12, l14, l21}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004348s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.036961s
[25579 : 25580]
[25579 : 25581]
Successful child: 25580
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ i3^0 <= 1 + ifp1^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ i3^0 <= 1 + ifp1^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, i2^0 <= ip3^0 /\ i3^0 <= 1 + ifp1^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, i3^0 <= ip3^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, i3^0 <= ip3^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Ranking function: 1 - i1^0 + ip1^0 + ip2^0
New Graphs: 
Transitions:
<l5, l7, 1 + ip3^0 <= i2^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l5, l5, 1 + ip3^0 <= i2^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l5, l5, i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l7, l5, i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
Variables:
i1^0, i2^0, i3^0, ifp1^0, ifp2^0, ip1^0, ip2^0, ip3^0, wr^0
Transitions:
<l12, l14, i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l21, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>
<l21, l21, i3^0 <= ip3^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i2rev^0, i3^0, ibit^0, ip1^0, ip2^0, ip3^0
Checking conditional termination of SCC {l5, l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003227s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029084s
[25579 : 25585]
[25579 : 25586]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002990s
Time used: 1.00294

LOG: SAT solveNonLinear - Elapsed time: 2.230376s
Cost: 1; Total time: 2.22663
Termination implied by a set of invariant(s):
Invariant at l5: i1^0 <= ifp1^0 + ip1^0
Invariant at l12: 1 <= idim^0
Invariant at l14: 1 <= idim^0
Invariant at l21: 1 <= idim^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i3^0 <= 1 + ifp1^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + ip2^0 <= i2^0 /\ ip2^0 <= ip1^0 /\ 2 <= idim^0, {i2rev^0 -> 1, idim^0 -> -1 + idim^0, ifp1^0 -> ip1^0, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l7, 1 + ip2^0 <= i2^0 /\ 1 <= idim^0 /\ 1 + ip1^0 <= ip2^0, {ifp1^0 -> ip1^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l14, 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l14, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l21, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 + ibit^0 <= ip1^0 /\ 1 <= idim^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 <= idim^0 /\ i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ 1 <= idim^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l14, 1 + ip3^0 <= i3^0 /\ 1 <= idim^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 + ip3^0 <= i3^0 /\ 1 <= idim^0 /\ i2^0 <= 1 + ip2^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 <= idim^0 /\ i3^0 <= ip3^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, 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): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Quasi-ranking function: 50000 - i1^0 + ip1^0
New Graphs: 
Transitions:
<l12, l14, i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l21, 1 + i2^0 <= i2rev^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
<l21, l14, 1 + ip3^0 <= i3^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>
<l21, l21, i3^0 <= ip3^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i2rev^0, i3^0, ibit^0, ip1^0, ip2^0, ip3^0
Transitions:
<l5, l7, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 + ip1^0 <= 3 + i1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l5, l5, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ 4 + i1^0 <= i3^0 + ip1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l5, l5, i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l7, l5, i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
Variables:
i1^0, i2^0, i3^0, ifp1^0, ifp2^0, ip1^0, ip2^0, ip3^0, wr^0
Checking conditional termination of SCC {l12, l14, l21}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004571s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029735s
[25579 : 25590]
[25579 : 25591]
Successful child: 25590
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i3^0 <= 1 + ifp1^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + ip2^0 <= i2^0 /\ ip2^0 <= ip1^0 /\ 2 <= idim^0, {i2rev^0 -> 1, idim^0 -> -1 + idim^0, ifp1^0 -> ip1^0, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l7, 1 + ip2^0 <= i2^0 /\ 1 <= idim^0 /\ 1 + ip1^0 <= ip2^0, {ifp1^0 -> ip1^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l14, 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l14, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l21, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 + ibit^0 <= ip1^0 /\ 1 <= idim^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 <= idim^0 /\ i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ 1 <= idim^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l14, 1 + ip3^0 <= i3^0 /\ 1 <= idim^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 + ip3^0 <= i3^0 /\ 1 <= idim^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0 /\ 4 + i1^0 <= i2^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, 1 <= idim^0 /\ i3^0 <= ip3^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, 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): 
<l12, l14, 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l14, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l21, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ 2 + i1^0 <= i2^0 + ip1^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 + ibit^0 <= ip1^0 /\ 1 <= idim^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l12, 1 <= idim^0 /\ i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ 1 <= idim^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l14, 1 + ip3^0 <= i3^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0 /\ i2^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, ibit^0 -> undef519, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l21, l21, i3^0 <= ip3^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Ranking function: 1 - i1^0 + ip1^0 + ip2^0
New Graphs: 
Transitions:
<l5, l7, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 + ip1^0 <= 3 + i1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l5, l5, 1 + ip3^0 <= i2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ 4 + i1^0 <= i3^0 + ip1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, rest remain the same}>
<l5, l5, i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
<l7, l5, i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
Variables:
i1^0, i2^0, i3^0, ifp1^0, ifp2^0, ip1^0, ip2^0, ip3^0, wr^0
Transitions:
<l12, l14, 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0 /\ 1 <= idim^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, 1 <= idim^0 /\ i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ 1 <= idim^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
Variables:
i1^0, i2^0, i2rev^0, ibit^0, ip1^0, ip2^0
Transitions:
<l21, l21, i3^0 <= ip3^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i3^0, ip1^0, ip2^0, ip3^0
Checking conditional termination of SCC {l5, l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004069s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.091187s
[25579 : 25595]
[25579 : 25596]
Successful child: 25595
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ i3^0 + ip1^0 <= 3 + i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 <= 1 + ifp1^0 /\ 4 + i1^0 <= i3^0 + ip1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i3^0 <= 1 + ifp1^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l12, 1 + ifp1^0 <= i3^0 /\ 1 + ifp1^0 <= ip2^0 /\ ip2^0 <= ifp2^0 /\ 2 <= idim^0, {i2rev^0 -> 1, idim^0 -> -1 + idim^0, ifp1^0 -> ifp2^0, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp1^0 <= ip2^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 + ifp1^0 <= ip2^0 /\ i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l5, 1 + ifp1^0 <= ip2^0 /\ i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l7, 1 + ip3^0 <= i2^0 /\ 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i3^0 + ip1^0 <= 3 + i1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ip3^0 <= i2^0 /\ 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ 4 + i1^0 <= i3^0 + ip1^0 /\ 50001 + ip1^0 <= i1^0, {i1^0 -> 2 + i1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp1^0 <= ip2^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 + ifp1^0 <= ip2^0 /\ i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l5, 1 + ifp1^0 <= ip2^0 /\ i3^0 <= ifp1^0 /\ 2 + i1^0 <= i3^0 + ip1^0, {all remain the same}>
Ranking function: -i1^0 + ip1^0 + ip2^0
New Graphs: 
Transitions:
<l12, l14, 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2rev^0 <= i2^0, {ibit^0 -> undef519, rest remain the same}>
<l12, l14, 1 + i2^0 <= i2rev^0 /\ 1 <= idim^0 /\ i2^0 <= ip2^0 /\ i2^0 + ip1^0 <= 1 + i1^0, {ibit^0 -> undef519, rest remain the same}>
<l14, l12, 1 + ibit^0 <= ip1^0 /\ 1 <= idim^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l12, 1 <= idim^0 /\ i2rev^0 <= ibit^0 /\ ip1^0 <= ibit^0, {i2^0 -> i2^0 + ip1^0, i2rev^0 -> i2rev^0 + ibit^0, rest remain the same}>
<l14, l14, 1 + ibit^0 <= i2rev^0 /\ 1 <= idim^0 /\ ip1^0 <= ibit^0, {i2rev^0 -> i2rev^0 - ibit^0, ibit^0 -> undef411, rest remain the same}>
Variables:
i1^0, i2^0, i2rev^0, ibit^0, ip1^0, ip2^0
Transitions:
<l21, l21, i3^0 <= ip3^0 /\ i1^0 <= 1 + ip1^0 + ip2^0 /\ i2^0 <= 1 + ip2^0, {i3^0 -> i3^0 + ip2^0, rest remain the same}>
Variables:
i1^0, i2^0, i3^0, ip1^0, ip2^0, ip3^0
Transitions:
<l7, l7, 1 + ifp1^0 <= i3^0 /\ 1 + ifp1^0 <= ip2^0 /\ 1 + ifp2^0 <= ip2^0, {ifp1^0 -> ifp2^0, ifp2^0 -> undef306, wr^0 -> 1, rest remain the same}>
<l7, l7, 1 + ifp1^0 <= ip2^0 /\ i3^0 <= ifp1^0 /\ i3^0 + ip1^0 <= 1 + i1^0, {i3^0 -> i3^0 + ip1^0, wr^0 -> undef134, rest remain the same}>
Variables:
i1^0, i3^0, ifp1^0, ifp2^0, ip1^0, ip2^0, wr^0
Transitions:
<l5, l5, 1 + ifp1^0 <= ip2^0 /\ i1^0 <= ifp1^0 + ip1^0 /\ i2^0 <= ip3^0 /\ i2^0 = undef67, {i2^0 -> i2^0 + ifp2^0, rest remain the same}>
Variables:
i1^0, i2^0, ifp1^0, ifp2^0, ip1^0, ip2^0, ip3^0
Checking conditional termination of SCC {l12, l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004148s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.023047s
[25579 : 25600]
[25579 : 25601]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.978752s
Time used: 0.976217
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.002007s

LOG: NarrowEntry size 1
Narrowing transition: 
<l18, l18, idim^0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l18, 0 <= 0, {all remain the same}>
END ENTRIES:
GRAPH:
<l18, l18, 0 <= 0 /\ idim^0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>
END GRAPH:
EXIT: <l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[25579 : 25605]
[25579 : 25606]
[25579 : 25607]
Successful child: 25607
[25579 : 25608]
[25579 : 25609]

LOG: NarrowEntry size 2
INVARIANTS: 
18: 
Quasi-INVARIANTS to narrow Graph: 
18: 1 + ndim^0 <= 0 , idim^0 <= 1 + ndim^0 , 
Narrowing transition: 
<l18, l18, 0 <= 0 /\ idim^0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>

LOG: Narrow transition size 2
ENTRIES:
<l0, l18, 1 + ndim^0 <= 0 /\ 0 <= 0 /\ 2 + ndim^0 <= idim^0, {all remain the same}>
<l0, l18, 0 <= 0 /\ 0 <= ndim^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l18, l18, 0 <= 0 /\ idim^0 <= ndim^0 /\ 0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>
END GRAPH:
EXIT: <l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[25579 : 25610]
[25579 : 25611]
[25579 : 25612]
Successful child: 25612
[25579 : 25613]
[25579 : 25614]
[25579 : 25615]

LOG: NarrowEntry size 1

LOG: NarrowEntry size 2
INVARIANTS: 
18: 
Quasi-INVARIANTS to narrow Graph: 
18: 1 + ndim^0 <= 0 , idim^0 <= 0 , 
Narrowing transition: 
<l18, l18, 0 <= 0 /\ idim^0 <= ndim^0 /\ 0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>

LOG: Narrow transition size 2
ENTRIES:
<l0, l18, 1 <= idim^0 /\ 1 + ndim^0 <= 0 /\ 0 <= 0 /\ 2 + ndim^0 <= idim^0, {all remain the same}>
<l0, l18, 0 <= 0 /\ idim^0 <= 0 /\ 0 <= ndim^0, {all remain the same}>
<l0, l18, 1 <= idim^0 /\ 0 <= 0 /\ 0 <= ndim^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l18, l18, 0 <= 0 /\ idim^0 <= ndim^0 /\ 0 <= ndim^0, {idim^0 -> 1 + idim^0, rest remain the same}>
END GRAPH:
EXIT: <l18, l12, 1 <= idim^0 /\ 1 + ndim^0 <= idim^0, {i2rev^0 -> 1, ip1^0 -> undef956, ip2^0 -> undef957, ip3^0 -> undef958, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[25579 : 25616]
[25579 : 25617]
[25579 : 25618]

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

LOG: RETURN check - Elapsed time: 6.288490s
Cannot prove unreachability

[25579 : 25619]
[25579 : 25620]
Successful child: 25619

Program does NOT terminate