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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l35, true>
<l1, l2, ((0 + k3^0) <= 0) /\ (undef69 = 1) /\ (undef12 = undef12), par{___rho_11_^0 -> undef12, i___02020^0 -> (0 + Irql^0), k4^0 -> (0 + undef12), keR^0 -> 0}>
<l1, l3, (1 <= (0 + k3^0)) /\ (undef138 = undef138) /\ (undef110 = undef110) /\ (undef76 = undef76) /\ (undef139 = 1), par{IsochDetachData^0 -> undef76, a1818^0 -> (0 + undef76), i^0 -> undef110, i___01717^0 -> (0 + Irql^0), k3^0 -> (~(1) + k3^0), keR^0 -> 0}>
<l4, l5, ((0 + AsyncAddressData^0) <= 0)>
<l4, l5, (1 <= (0 + AsyncAddressData^0))>
<l6, l4, ((0 + ___rho_9_^0) <= 0)>
<l6, l4, (1 <= (0 + ___rho_9_^0))>
<l7, l6, (undef433 = undef433), par{___rho_9_^0 -> undef433}>
<l8, l7, ((0 + ___rho_8_^0) <= 0)>
<l8, l7, (1 <= (0 + ___rho_8_^0))>
<l9, l8, (undef636 = undef636), par{___rho_8_^0 -> undef636}>
<l10, l9, ((0 + ___rho_7_^0) <= 0)>
<l10, l9, (1 <= (0 + ___rho_7_^0))>
<l11, l12, true>
<l13, l10, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907), par{AsyncAddressData^0 -> undef888, ___rho_7_^0 -> undef907, k2^0 -> (~(1) + k2^0)}>
<l13, l3, ((0 + k2^0) <= 0) /\ (undef1025 = 1) /\ (undef967 = undef967), par{___rho_10_^0 -> undef967, i___01313^0 -> (0 + Irql^0), k3^0 -> (0 + undef967), keR^0 -> 0}>
<l5, l13, true>
<l3, l1, (undef1162 = 1), par{keA^0 -> 0}>
<l14, l11, true, par{a77^0 -> (0 + CromData^0)}>
<l15, l14, ((0 + ___rho_3_^0) <= 0)>
<l15, l14, (1 <= (0 + ___rho_3_^0))>
<l16, l15, (undef1382 = undef1382), par{___rho_3_^0 -> undef1382}>
<l17, l16, ((0 + ___rho_2_^0) <= 0)>
<l17, l16, (1 <= (0 + ___rho_2_^0))>
<l2, l18, (undef1639 = 1), par{keA^0 -> 0}>
<l19, l11, ((0 + CromData^0) <= 0)>
<l19, l17, (1 <= (0 + CromData^0)) /\ (undef1722 = undef1722), par{___rho_2_^0 -> undef1722}>
<l12, l19, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778), par{CromData^0 -> undef1778, k1^0 -> (~(1) + k1^0)}>
<l12, l5, ((0 + k1^0) <= 0) /\ (undef1913 = 1) /\ (undef1912 = 1) /\ (undef1860 = undef1860), par{___rho_4_^0 -> undef1860, i___099^0 -> (0 + Irql^0), k2^0 -> (0 + undef1860), keA^0 -> 0, keR^0 -> 0}>
<l20, l21, true>
<l22, l11, (undef2047 = 0) /\ (undef2050 = 1) /\ (undef1999 = undef1999), par{___rho_5_^0 -> undef1999, k1^0 -> (0 + undef1999), keA^0 -> 0, ntStatus^0 -> (0 + undef2047), ret_IoSetDeviceInterfaceState44^0 -> undef2047}>
<l23, l24, true>
<l25, l26, true, par{phi_nSUC_ret^0 -> 1}>
<l27, l26, ((0 + ntStatus^0) <= 2) /\ (2 <= (0 + ntStatus^0))>
<l27, l25, (3 <= (0 + ntStatus^0))>
<l27, l25, ((1 + ntStatus^0) <= 2)>
<l26, l28, true>
<l28, l26, true>
<l21, l20, (1 <= (0 + k5^0)) /\ (undef2595 = 0) /\ (undef2528 = undef2528) /\ (undef2591 = 0), par{BusResetIrp^0 -> undef2528, a4343^0 -> 0, a4545^0 -> 2, a4646^0 -> (0 + undef2528), k5^0 -> (~(1) + k5^0), phi_io_compl^0 -> 1, prevCancel^0 -> (0 + undef2591), ret_IoSetCancelRoutine4444^0 -> undef2591}>
<l21, l27, ((0 + k5^0) <= 0) /\ (undef2664 = 1), par{i___04848^0 -> (0 + Irql^0), keR^0 -> 0}>
<l29, l22, ((0 + ___rho_1_^0) <= 0)>
<l29, l22, (1 <= (0 + ___rho_1_^0)) /\ (undef2799 = 0), par{a11^0 -> (0 + DeviceObject^0), b22^0 -> (0 + Irp^0), ntStatus^0 -> (0 + undef2799), ret_t1394Diag_PnpStopDevice33^0 -> undef2799}>
<l30, l2, (1 <= (0 + pIrb^0)) /\ (undef2868 = 0), par{a3232^0 -> (0 + pIrb^0), a3434^0 -> (0 + ResourceIrp^0), a3737^0 -> (0 + pIrb^0), a3838^0 -> (0 + ResourceIrp^0), b3333^0 -> 0, b3535^0 -> (0 + pIrb^0), ntStatus^0 -> (0 + undef2868), ret_t1394_SubmitIrpSynch3636^0 -> undef2868}>
<l30, l2, ((0 + pIrb^0) <= 0), par{a3131^0 -> (0 + ResourceIrp^0)}>
<l31, l30, (undef2999 = 0), par{a2828^0 -> 1, b2929^0 -> 0, pIrb^0 -> (0 + undef2999), ret_ExAllocatePool3030^0 -> undef2999}>
<l32, l31, (1 <= (0 + ResourceIrp^0))>
<l32, l31, ((1 + ResourceIrp^0) <= 0)>
<l32, l2, ((0 + ResourceIrp^0) <= 0) /\ (0 <= (0 + ResourceIrp^0))>
<l33, l2, ((0 + IsochResourceData^0) <= 0)>
<l33, l32, (1 <= (0 + IsochResourceData^0)) /\ (undef3335 = undef3335) /\ (undef3345 = undef3345) /\ (undef3286 = undef3286) /\ (undef3340 = 0), par{ResourceIrp^0 -> (0 + undef3340), StackSize^0 -> undef3286, a2525^0 -> (0 + undef3286), b2626^0 -> 0, pIrb^0 -> undef3335, ret_IoAllocateIrp2727^0 -> undef3340}>
<l18, l20, ((0 + k4^0) <= 0) /\ (undef3415 = 1) /\ (undef3414 = 1) /\ (undef3358 = undef3358), par{___rho_12_^0 -> undef3358, i___04040^0 -> (0 + Irql^0), k5^0 -> (0 + undef3358), keA^0 -> 0, keR^0 -> 0}>
<l18, l33, (1 <= (0 + k4^0)) /\ (undef3423 = undef3423) /\ (undef3484 = 1), par{IsochResourceData^0 -> undef3423, i___02424^0 -> (0 + Irql^0), k4^0 -> (~(1) + k4^0), keR^0 -> 0}>
<l34, l29, (undef3534 = 0) /\ (undef3533 = (0 + undef3534)) /\ (undef3541 = (0 + undef3533)) /\ (undef3503 = undef3503) /\ (undef3498 = undef3498), par{___rho_1_^0 -> undef3498, ___rho_666_^0 -> undef3503, ioA^0 -> undef3533, ioR^0 -> undef3534, keA^0 -> (0 + undef3541), keR^0 -> undef3541, phi_io_compl^0 -> 0, phi_nSUC_ret^0 -> 0}>
<l35, l34, true>

Fresh variables:
undef12, undef69, undef76, undef110, undef138, undef139, undef433, undef636, undef888, undef907, undef956, undef967, undef1025, undef1162, undef1382, undef1639, undef1722, undef1778, undef1860, undef1912, undef1913, undef1999, undef2047, undef2050, undef2528, undef2591, undef2595, undef2664, undef2799, undef2868, undef2999, undef3286, undef3335, undef3340, undef3345, undef3358, undef3414, undef3415, undef3423, undef3484, undef3498, undef3503, undef3533, undef3534, undef3541, 

Undef variables:
undef12, undef69, undef76, undef110, undef138, undef139, undef433, undef636, undef888, undef907, undef956, undef967, undef1025, undef1162, undef1382, undef1639, undef1722, undef1778, undef1860, undef1912, undef1913, undef1999, undef2047, undef2050, undef2528, undef2591, undef2595, undef2664, undef2799, undef2868, undef2999, undef3286, undef3335, undef3340, undef3345, undef3358, undef3414, undef3415, undef3423, undef3484, undef3498, undef3503, undef3533, undef3534, undef3541, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l11, (k1^0 = (0 + undef1999)) /\ (ntStatus^0 = (0 + undef2047)) /\ (undef3534 = 0) /\ (undef3533 = (0 + undef3534)) /\ (undef3541 = (0 + undef3533)) /\ (undef3503 = undef3503) /\ (undef3498 = undef3498) /\ ((0 + undef3498) <= 0) /\ (undef2047 = 0) /\ (undef2050 = 1) /\ (undef1999 = undef1999)>
<l0, l11, (k1^0 = (0 + undef1999)) /\ (ntStatus^0 = (0 + undef2047)) /\ (undef3534 = 0) /\ (undef3533 = (0 + undef3534)) /\ (undef3541 = (0 + undef3533)) /\ (undef3503 = undef3503) /\ (undef3498 = undef3498) /\ (1 <= (0 + undef3498)) /\ (undef2799 = 0) /\ (undef2047 = 0) /\ (undef2050 = 1) /\ (undef1999 = undef1999)>
<l2, l20, (undef1639 = 1) /\ ((0 + k4^0) <= 0) /\ (undef3415 = 1) /\ (undef3414 = 1) /\ (undef3358 = undef3358), par{k5^0 -> (0 + undef3358)}>
<l2, l2, (undef1639 = 1) /\ (1 <= (0 + k4^0)) /\ (undef3423 = undef3423) /\ (undef3484 = 1) /\ ((0 + undef3423) <= 0), par{k4^0 -> (~(1) + k4^0)}>
<l2, l2, (undef1639 = 1) /\ (1 <= (0 + k4^0)) /\ (undef3423 = undef3423) /\ (undef3484 = 1) /\ (1 <= (0 + undef3423)) /\ (undef3335 = undef3335) /\ (undef3345 = undef3345) /\ (undef3286 = undef3286) /\ (undef3340 = 0) /\ ((0 + (0 + undef3340)) <= 0) /\ (0 <= (0 + (0 + undef3340))), par{k4^0 -> (~(1) + k4^0)}>
<l3, l2, (undef1162 = 1) /\ ((0 + k3^0) <= 0) /\ (undef69 = 1) /\ (undef12 = undef12), par{k4^0 -> (0 + undef12)}>
<l3, l3, (undef1162 = 1) /\ (1 <= (0 + k3^0)) /\ (undef138 = undef138) /\ (undef110 = undef110) /\ (undef76 = undef76) /\ (undef139 = 1), par{k3^0 -> (~(1) + k3^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ ((0 + undef907) <= 0) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ ((0 + undef636) <= 0) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ ((0 + undef433) <= 0) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ ((0 + undef888) <= 0), par{k2^0 -> (~(1) + k2^0)}>
<l5, l5, (1 <= (0 + k2^0)) /\ (undef956 = undef956) /\ (undef888 = undef888) /\ (undef907 = undef907) /\ (1 <= (0 + undef907)) /\ (undef636 = undef636) /\ (1 <= (0 + undef636)) /\ (undef433 = undef433) /\ (1 <= (0 + undef433)) /\ (1 <= (0 + undef888)), par{k2^0 -> (~(1) + k2^0)}>
<l5, l3, ((0 + k2^0) <= 0) /\ (undef1025 = 1) /\ (undef967 = undef967), par{k3^0 -> (0 + undef967)}>
<l11, l11, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778) /\ ((0 + undef1778) <= 0), par{k1^0 -> (~(1) + k1^0)}>
<l11, l11, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778) /\ (1 <= (0 + undef1778)) /\ (undef1722 = undef1722) /\ ((0 + undef1722) <= 0) /\ (undef1382 = undef1382) /\ ((0 + undef1382) <= 0), par{k1^0 -> (~(1) + k1^0)}>
<l11, l11, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778) /\ (1 <= (0 + undef1778)) /\ (undef1722 = undef1722) /\ ((0 + undef1722) <= 0) /\ (undef1382 = undef1382) /\ (1 <= (0 + undef1382)), par{k1^0 -> (~(1) + k1^0)}>
<l11, l11, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778) /\ (1 <= (0 + undef1778)) /\ (undef1722 = undef1722) /\ (1 <= (0 + undef1722)) /\ (undef1382 = undef1382) /\ ((0 + undef1382) <= 0), par{k1^0 -> (~(1) + k1^0)}>
<l11, l11, (1 <= (0 + k1^0)) /\ (undef1778 = undef1778) /\ (1 <= (0 + undef1778)) /\ (undef1722 = undef1722) /\ (1 <= (0 + undef1722)) /\ (undef1382 = undef1382) /\ (1 <= (0 + undef1382)), par{k1^0 -> (~(1) + k1^0)}>
<l11, l5, ((0 + k1^0) <= 0) /\ (undef1913 = 1) /\ (undef1912 = 1) /\ (undef1860 = undef1860), par{k2^0 -> (0 + undef1860)}>
<l20, l20, (1 <= (0 + k5^0)) /\ (undef2595 = 0) /\ (undef2528 = undef2528) /\ (undef2591 = 0), par{k5^0 -> (~(1) + k5^0)}>
<l20, l26, ((0 + k5^0) <= 0) /\ (undef2664 = 1) /\ ((0 + ntStatus^0) <= 2) /\ (2 <= (0 + ntStatus^0))>
<l20, l26, ((0 + k5^0) <= 0) /\ (undef2664 = 1) /\ (3 <= (0 + ntStatus^0))>
<l20, l26, ((0 + k5^0) <= 0) /\ (undef2664 = 1) /\ ((1 + ntStatus^0) <= 2)>
<l26, l26, true>

Fresh variables:
undef12, undef69, undef76, undef110, undef138, undef139, undef433, undef636, undef888, undef907, undef956, undef967, undef1025, undef1162, undef1382, undef1639, undef1722, undef1778, undef1860, undef1912, undef1913, undef1999, undef2047, undef2050, undef2528, undef2591, undef2595, undef2664, undef2799, undef2868, undef2999, undef3286, undef3335, undef3340, undef3345, undef3358, undef3414, undef3415, undef3423, undef3484, undef3498, undef3503, undef3533, undef3534, undef3541, 

Undef variables:
undef12, undef69, undef76, undef110, undef138, undef139, undef433, undef636, undef888, undef907, undef956, undef967, undef1025, undef1162, undef1382, undef1639, undef1722, undef1778, undef1860, undef1912, undef1913, undef1999, undef2047, undef2050, undef2528, undef2591, undef2595, undef2664, undef2799, undef2868, undef2999, undef3286, undef3335, undef3340, undef3345, undef3358, undef3414, undef3415, undef3423, undef3484, undef3498, undef3503, undef3533, undef3534, undef3541, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l11, l11, undef1778 <= 0 /\ 1 <= k1^0, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1382 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1382 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>
Variables:
k1^0

Graph 2:
Transitions:
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>
Variables:
k2^0

Graph 3:
Transitions:
<l3, l3, 1 <= k3^0 /\ undef139 = 1 /\ undef1162 = 1, {k3^0 -> -1 + k3^0, rest remain the same}>
Variables:
k3^0

Graph 4:
Transitions:
<l2, l2, undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l2, l2, 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
Variables:
k4^0

Graph 5:
Transitions:
<l20, l20, 1 <= k5^0 /\ undef2591 = 0 /\ undef2595 = 0, {k5^0 -> -1 + k5^0, rest remain the same}>
Variables:
k5^0

Graph 6:
Transitions:
<l26, l26, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l11, undef3498 <= 0 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef2050 = 1, {all remain the same}>
<l0, l11, 1 <= undef3498 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef2799 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef2050 = 1, {all remain the same}>

Graph 2
<l11, l5, k1^0 <= 0 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>

Graph 3
<l5, l3, k2^0 <= 0 /\ undef1025 = 1, {k3^0 -> undef967, rest remain the same}>

Graph 4
<l3, l2, k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1, {k4^0 -> undef12, rest remain the same}>

Graph 5
<l2, l20, k4^0 <= 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>

Graph 6
<l20, l26, k5^0 <= 0 /\ undef2664 = 1 /\ ntStatus^0 = 2, {all remain the same}>
<l20, l26, k5^0 <= 0 /\ 3 <= ntStatus^0 /\ undef2664 = 1, {all remain the same}>
<l20, l26, k5^0 <= 0 /\ ntStatus^0 <= 1 /\ undef2664 = 1, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 4 )
( 3 , 3 )
( 5 , 2 )
( 11 , 1 )
( 20 , 5 )
( 26 , 6 )

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

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

Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004692s
Ranking function: -1 + k1^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.035651

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014760s
Ranking function: -1 + k2^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.001804

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002304s
Ranking function: -1 + k3^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.002998

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003089s
Ranking function: -1 + k4^0
New Graphs: 
Proving termination of subgraph 5
Checking unfeasibility...
Time used: 0.001797

Checking conditional termination of SCC {l20}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002290s
Ranking function: -1 + k5^0
New Graphs: 
Proving termination of subgraph 6
Checking unfeasibility...
Time used: 0.001631

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l20, l26, k5^0 <= 0 /\ undef2664 = 1 /\ ntStatus^0 = 2, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l20, l26, k5^0 <= 0 /\ undef2664 = 1 /\ ntStatus^0 = 2, {all 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: <l2, l20, k4^0 <= 0 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ ntStatus^0 = 2, {k5^0 -> undef3358, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 3
* Exit transition: <l3, l2, k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 4
* Exit transition: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 5
* Exit transition: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
[29246 : 29247]
[29246 : 29248]

LOG: NarrowEntry size 1

LOG: NarrowEntry size 1
Narrowing transition: 
<l11, l11, undef1778 <= 0 /\ 1 <= k1^0, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1382 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1382 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l11, 0 <= 0 /\ undef3498 <= 0 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef1912 = 1 /\ undef1913 = 1 /\ undef2050 = 1, {all remain the same}>
<l0, l11, 0 <= 0 /\ 1 <= undef3498 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef2799 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef1912 = 1 /\ undef1913 = 1 /\ undef2050 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l11, l11, 0 <= 0 /\ undef1778 <= 0 /\ 1 <= k1^0 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 0 <= 0 /\ undef1382 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1778 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 0 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1778 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 0 <= 0 /\ undef1382 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1722 /\ 1 <= undef1778 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 0 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1722 /\ 1 <= undef1778 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
END GRAPH:
EXIT: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29249]
[29246 : 29250]

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

LOG: RETURN check - Elapsed time: 1.171882s

LOG: NarrowEntry size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l11, l5, 0 <= 0 /\ k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
END ENTRIES:
GRAPH:
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef433 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 0 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
END GRAPH:
EXIT: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29251]
[29246 : 29252]

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

LOG: RETURN check - Elapsed time: 3.941914s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 1 <= k3^0 /\ undef139 = 1 /\ undef1162 = 1, {k3^0 -> -1 + k3^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l5, l3, 0 <= 0 /\ k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= 0 /\ 1 <= k3^0 /\ undef69 = 1 /\ undef139 = 1 /\ undef1162 = 1, {k3^0 -> -1 + k3^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l2, k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29261]
[29246 : 29262]

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

LOG: RETURN check - Elapsed time: 9.964317s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l2, l2, 0 <= 0 /\ 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
END GRAPH:
EXIT: <l2, l20, k4^0 <= 0 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ ntStatus^0 = 2, {k5^0 -> undef3358, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29291]
[29246 : 29292]
[29246 : 29293]
Successful child: 29291

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 6
* Exit transition: <l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 7
* Exit transition: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 8
* Exit transition: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.010105s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.016695s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.024636s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 10.059213s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 10.065919s
Proving unreachability of entry: <l20, l26, k5^0 <= 0 /\ 3 <= ntStatus^0 /\ undef2664 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 9
* Exit transition: <l20, l26, k5^0 <= 0 /\ 3 <= ntStatus^0 /\ undef2664 = 1, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 10
* Exit transition: <l2, l20, k4^0 <= 0 /\ 3 <= ntStatus^0 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: Postcondition is not implied - Post: 1 <= 0 - Already checked
Already checked with failure

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l2, l2, 0 <= 0 /\ 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
END GRAPH:
EXIT: <l2, l20, k4^0 <= 0 /\ 3 <= ntStatus^0 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29294]
[29246 : 29295]
[29246 : 29296]
Successful child: 29294

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 11
* Exit transition: <l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 12
* Exit transition: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: CALL check - Post:ntStatus^0 <= 0 - Process 13
* Exit transition: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
* Postcondition  : ntStatus^0 <= 0
Postcodition moved up: ntStatus^0 <= 0

LOG: Try proving POST

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.010124s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.016734s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.024691s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.093548s

LOG: Postcondition implied
> Postcondition implied!

LOG: RETURN check - Elapsed time: 0.100310s
Proving unreachability of entry: <l20, l26, k5^0 <= 0 /\ ntStatus^0 <= 1 /\ undef2664 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 14
* Exit transition: <l20, l26, k5^0 <= 0 /\ ntStatus^0 <= 1 /\ undef2664 = 1, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 15
* Exit transition: <l2, l20, k4^0 <= 0 /\ ntStatus^0 <= 1 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: Postcondition is not implied - Post: 1 <= 0 - Already checked
Already checked with failure

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l2, l2, 0 <= 0 /\ 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
END GRAPH:
EXIT: <l2, l20, k4^0 <= 0 /\ ntStatus^0 <= 1 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29297]
[29246 : 29298]
[29246 : 29299]
Successful child: 29297

LOG: CALL check - Post:2 <= ntStatus^0 - Process 16
* Exit transition: <l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
* Postcondition  : 2 <= ntStatus^0
Postcodition moved up: 2 <= ntStatus^0

LOG: Try proving POST

LOG: CALL check - Post:2 <= ntStatus^0 - Process 17
* Exit transition: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
* Postcondition  : 2 <= ntStatus^0
Postcodition moved up: 2 <= ntStatus^0

LOG: Try proving POST

LOG: CALL check - Post:2 <= ntStatus^0 - Process 18
* Exit transition: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
* Postcondition  : 2 <= ntStatus^0
Postcodition moved up: 2 <= ntStatus^0

LOG: Try proving POST
[29246 : 29300]
[29246 : 29301]

LOG: NarrowEntry size 1

LOG: NarrowEntry size 1
Narrowing transition: 
<l11, l11, undef1778 <= 0 /\ 1 <= k1^0, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1382 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, undef1382 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l11, l11, 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1722 /\ 1 <= undef1778, {k1^0 -> -1 + k1^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l11, undef3498 <= 0 /\ ntStatus^0 <= 1 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef1912 = 1 /\ undef1913 = 1 /\ undef2050 = 1, {all remain the same}>
<l0, l11, 1 <= undef3498 /\ ntStatus^0 <= 1 /\ k1^0 = undef1999 /\ ntStatus^0 = undef2047 /\ undef2047 = 0 /\ undef2799 = 0 /\ undef3533 = undef3534 /\ undef3533 = undef3541 /\ undef3534 = 0 /\ undef1912 = 1 /\ undef1913 = 1 /\ undef2050 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l11, l11, undef1778 <= 0 /\ 1 <= k1^0 /\ ntStatus^0 <= 1 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1382 <= 0 /\ undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1778 /\ ntStatus^0 <= 1 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1722 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1778 /\ ntStatus^0 <= 1 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, undef1382 <= 0 /\ 1 <= k1^0 /\ 1 <= undef1722 /\ 1 <= undef1778 /\ ntStatus^0 <= 1 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
<l11, l11, 1 <= k1^0 /\ 1 <= undef1382 /\ 1 <= undef1722 /\ 1 <= undef1778 /\ ntStatus^0 <= 1 /\ undef1912 = 1 /\ undef1913 = 1, {k1^0 -> -1 + k1^0, rest remain the same}>
END GRAPH:
EXIT: <l11, l5, k1^0 <= 0 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
POST: 2 <= ntStatus^0


LOG: Try proving POST
[29246 : 29302]
[29246 : 29303]

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

LOG: RETURN check - Elapsed time: 1.238557s

LOG: NarrowEntry size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef433 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907, {k2^0 -> -1 + k2^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l11, l5, k1^0 <= 0 /\ ntStatus^0 <= 1 /\ undef1025 = 1 /\ undef1912 = 1 /\ undef1913 = 1, {k2^0 -> undef1860, rest remain the same}>
END ENTRIES:
GRAPH:
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef888 <= 0 /\ undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef907 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef888 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef636 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef888 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef433 <= 0 /\ 1 <= k2^0 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, undef888 <= 0 /\ 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
<l5, l5, 1 <= k2^0 /\ 1 <= undef433 /\ 1 <= undef636 /\ 1 <= undef888 /\ 1 <= undef907 /\ ntStatus^0 <= 1 /\ undef1025 = 1, {k2^0 -> -1 + k2^0, rest remain the same}>
END GRAPH:
EXIT: <l5, l3, k2^0 <= 0 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
POST: 2 <= ntStatus^0


LOG: Try proving POST
[29246 : 29304]
[29246 : 29305]

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

LOG: RETURN check - Elapsed time: 3.929832s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 1 <= k3^0 /\ undef139 = 1 /\ undef1162 = 1, {k3^0 -> -1 + k3^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l5, l3, k2^0 <= 0 /\ ntStatus^0 <= 1 /\ undef69 = 1 /\ undef1025 = 1 /\ undef1162 = 1, {k3^0 -> undef967, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= 0 /\ 1 <= k3^0 /\ ntStatus^0 <= 1 /\ undef69 = 1 /\ undef139 = 1 /\ undef1162 = 1, {k3^0 -> -1 + k3^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
POST: 2 <= ntStatus^0


LOG: Try proving POST
[29246 : 29314]
[29246 : 29315]

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

LOG: RETURN check - Elapsed time: 10.122837s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2 <= ntStatus^0 , 
Narrowing transition: 
<l2, l2, 0 <= 0 /\ undef3423 <= 0 /\ 1 <= k4^0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 0 <= 0 /\ 1 <= k4^0 /\ 1 <= undef3423 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l3, l2, 0 <= 0 /\ k3^0 <= 0 /\ ntStatus^0 <= 1 /\ undef69 = 1 /\ undef1162 = 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k4^0 -> undef12, rest remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ undef3423 <= 0 /\ 1 <= k4^0 /\ ntStatus^0 <= 1 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l2, l2, 0 <= 0 /\ 1 <= k4^0 /\ 1 <= undef3423 /\ ntStatus^0 <= 1 /\ undef3340 = 0 /\ undef1639 = 1 /\ undef3414 = 1 /\ undef3415 = 1 /\ undef3484 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
END GRAPH:
EXIT: <l2, l20, k4^0 <= 0 /\ ntStatus^0 <= 1 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29344]
[29246 : 29345]
[29246 : 29346]

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

LOG: RETURN check - Elapsed time: 14.377977s

LOG: NarrowEntry size 1
Narrowing transition: 
<l20, l20, 1 <= k5^0 /\ undef2591 = 0 /\ undef2595 = 0, {k5^0 -> -1 + k5^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l2, l20, 0 <= 0 /\ k4^0 <= 0 /\ ntStatus^0 <= 1 /\ undef1639 = 1 /\ undef2664 = 1 /\ undef3414 = 1 /\ undef3415 = 1, {k5^0 -> undef3358, rest remain the same}>
END ENTRIES:
GRAPH:
<l20, l20, 0 <= 0 /\ 1 <= k5^0 /\ ntStatus^0 <= 1 /\ undef2591 = 0 /\ undef2595 = 0 /\ undef2664 = 1, {k5^0 -> -1 + k5^0, rest remain the same}>
END GRAPH:
EXIT: <l20, l26, k5^0 <= 0 /\ ntStatus^0 <= 1 /\ undef2664 = 1, {all remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[29246 : 29347]
[29246 : 29348]
[29246 : 29349]

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

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

[29246 : 29860]
[29246 : 29861]
Successful child: 29860

Program does NOT terminate