YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l88, true>
<l1, l2, ((1 + n^0) <= (0 + i^0))>
<l1, l3, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l4, l5, ((0 + i^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l4, l6, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l7, l8, true>
<l9, l10, ((1 + n^0) <= (0 + i^0))>
<l9, l6, ((0 + i^0) <= (0 + n^0))>
<l11, l12, true, par{k^0 -> (1 + k^0)}>
<l13, l14, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l13, l15, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l16, l17, true>
<l18, l15, ((1 + n^0) <= (0 + i^0)) /\ (undef344 = undef344), par{sum^0 -> undef344}>
<l18, l19, ((0 + i^0) <= (0 + n^0)) /\ (undef374 = undef374), par{i^0 -> (1 + i^0), sum^0 -> undef374}>
<l20, l11, ((1 + n^0) <= (0 + j^0))>
<l20, l19, ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l21, l11, ((0 + tmp___2^0) <= 0) /\ (0 <= (0 + tmp___2^0))>
<l21, l14, (1 <= (0 + tmp___2^0))>
<l21, l14, ((1 + tmp___2^0) <= 0)>
<l22, l23, true>
<l24, l5, ((0 + n^0) <= (0 + k^0))>
<l24, l21, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623), par{tmp___2^0 -> undef623}>
<l25, l26, true>
<l27, l28, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l27, l29, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l30, l12, ((1 + n^0) <= (0 + i^0))>
<l30, l29, ((0 + i^0) <= (0 + n^0))>
<l31, l3, ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0))>
<l31, l28, (1 <= (0 + restrt^0))>
<l31, l28, ((1 + restrt^0) <= 0)>
<l32, l33, (201 <= (0 + its^0))>
<l32, l31, ((0 + its^0) <= 200)>
<l34, l35, (undef952 = undef952), par{tmp___1^0 -> undef952}>
<l36, l37, true>
<l35, l38, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}>
<l39, l34, (1 <= (0 + sqrarg^0))>
<l39, l34, ((1 + sqrarg^0) <= 0)>
<l39, l35, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}>
<l40, l41, ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
<l40, l39, ((0 + i^0) <= (0 + n^0)) /\ (undef1153 = undef1153), par{sqrarg^0 -> undef1153}>
<l42, l43, true>
<l44, l38, (1 <= (0 + test^0))>
<l44, l33, ((1 + test^0) <= 1)>
<l45, l46, true, par{i^0 -> (1 + i^0)}>
<l47, l45, ((0 + tmp___0^0) <= (0 + test^0))>
<l47, l45, ((1 + test^0) <= (0 + tmp___0^0)) /\ (undef1337 = undef1337), par{test^0 -> (0 + undef1337), tmp^0 -> undef1337}>
<l48, l44, ((1 + n^0) <= (0 + i^0))>
<l48, l47, ((0 + i^0) <= (0 + n^0)) /\ (undef1398 = undef1398), par{tmp___0^0 -> undef1398}>
<l38, l40, true>
<l41, l32, true>
<l49, l50, true>
<l28, l30, true>
<l29, l27, true>
<l12, l24, true>
<l14, l20, true>
<l19, l18, true>
<l15, l13, true>
<l51, l52, (0 <= (0 + test^0))>
<l51, l33, ((1 + test^0) <= 0)>
<l53, l54, true, par{i^0 -> (1 + i^0)}>
<l5, l9, true>
<l55, l53, ((0 + temp^0) <= (0 + test^0))>
<l55, l53, ((1 + test^0) <= (0 + temp^0)), par{test^0 -> (0 + temp^0)}>
<l56, l55, (undef1875 = undef1875), par{temp^0 -> undef1875}>
<l57, l56, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{tmp___11^0 -> (0 + maxarg2^0)}>
<l57, l56, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{tmp___11^0 -> (0 + maxarg1^0)}>
<l6, l4, true>
<l58, l51, ((1 + n^0) <= (0 + i^0))>
<l58, l57, ((0 + i^0) <= (0 + n^0)) /\ (undef2040 = undef2040) /\ (undef2029 = undef2029), par{maxarg1^0 -> (0 + undef2029), maxarg2^0 -> 1, tmp___10^0 -> undef2029, tmp___9^0 -> undef2040}>
<l52, l41, true, par{its^0 -> (1 + its^0)}>
<l50, l52, ((1 + n^0) <= (0 + i^0))>
<l50, l49, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l59, l54, ((0 + tmp___12^0) <= 0) /\ (0 <= (0 + tmp___12^0)), par{restrt^0 -> 0, test^0 -> 0}>
<l59, l49, (1 <= (0 + tmp___12^0))>
<l59, l49, ((1 + tmp___12^0) <= 0)>
<l3, l1, true>
<l60, l42, true, par{i^0 -> (1 + i^0)}>
<l61, l60, ((0 + tmp___8^0) <= (0 + test^0))>
<l61, l60, ((1 + test^0) <= (0 + tmp___8^0)) /\ (undef2338 = undef2338), par{test^0 -> (0 + undef2338), tmp___7^0 -> undef2338}>
<l43, l59, ((1 + n^0) <= (0 + i^0)) /\ (undef2361 = undef2361), par{tmp___12^0 -> undef2361}>
<l43, l61, ((0 + i^0) <= (0 + n^0)) /\ (undef2399 = undef2399), par{tmp___8^0 -> undef2399}>
<l2, l62, true>
<l54, l58, true>
<l37, l25, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l37, l36, ((0 + j^0) <= (0 + n^0)) /\ (undef2504 = undef2504), par{j^0 -> (1 + j^0), sum^0 -> undef2504}>
<l63, l64, true>
<l26, l42, ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
<l26, l36, ((0 + i^0) <= (0 + n^0))>
<l23, l25, ((1 + n^0) <= (0 + i^0)), par{fold^0 -> (0 + f_promoted_1^0)}>
<l23, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l65, l66, true>
<l17, l7, ((1 + i^0) <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}>
<l17, l16, ((0 + j^0) <= (0 + i^0)) /\ (undef2744 = undef2744), par{j^0 -> (1 + j^0), sum^0 -> undef2744}>
<l8, l22, ((1 + i^0) <= 1)>
<l8, l16, (1 <= (0 + i^0))>
<l67, l68, true>
<l69, l10, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l69, l70, ((0 + j^0) <= (0 + n^0)) /\ (undef2894 = undef2894), par{j^0 -> (1 + j^0), sum^0 -> undef2894}>
<l71, l7, ((1 + n^0) <= (0 + i^0))>
<l71, l70, ((0 + i^0) <= (0 + n^0))>
<l72, l73, true>
<l74, l10, ((1 + n^0) <= (0 + i^0))>
<l74, l75, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l76, l75, ((1 + n^0) <= (0 + i^0))>
<l76, l77, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l78, l79, true>
<l80, l81, (undef3177 = undef3177), par{tmp___6^0 -> undef3177}>
<l81, l82, true, par{den^0 -> ((0 + den^0) + tmp___6^0), i^0 -> (1 + i^0)}>
<l83, l80, (1 <= (0 + sqrarg^0))>
<l83, l80, ((1 + sqrarg^0) <= 0)>
<l83, l81, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___6^0 -> 0}>
<l84, l77, ((1 + n^0) <= (0 + i^0))>
<l84, l83, ((0 + i^0) <= (0 + n^0)) /\ (undef3343 = undef3343), par{sqrarg^0 -> undef3343}>
<l82, l84, true>
<l79, l72, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l79, l78, ((0 + j^0) <= (0 + n^0)) /\ (undef3434 = undef3434), par{j^0 -> (1 + j^0), sum^0 -> undef3434}>
<l73, l82, ((1 + n^0) <= (0 + i^0))>
<l73, l78, ((0 + i^0) <= (0 + n^0))>
<l85, l10, (1 <= (0 + skip^0))>
<l85, l10, ((1 + skip^0) <= 0)>
<l85, l72, ((0 + skip^0) <= 0) /\ (0 <= (0 + skip^0))>
<l77, l76, true>
<l86, l65, true, par{i^0 -> (1 + i^0)}>
<l87, l86, ((1 + tmp___3^0) <= 0)>
<l87, l86, (0 <= (0 + tmp___3^0)), par{skip^0 -> 0}>
<l75, l74, true>
<l68, l87, ((1 + n^0) <= (0 + j^0)) /\ (undef3774 = undef3774) /\ (undef3775 = undef3775) /\ (undef3776 = undef3776), par{tmp___3^0 -> undef3774, tmp___4^0 -> undef3775, tmp___5^0 -> undef3776}>
<l68, l67, ((0 + j^0) <= (0 + n^0)) /\ (undef3794 = undef3794), par{j^0 -> (1 + j^0), sum^0 -> undef3794}>
<l66, l85, ((1 + n^0) <= (0 + i^0))>
<l66, l67, ((0 + i^0) <= (0 + n^0))>
<l10, l71, true>
<l64, l2, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l64, l63, ((0 + j^0) <= (0 + n^0)) /\ (undef3944 = undef3944), par{j^0 -> (1 + j^0), sum^0 -> undef3944}>
<l62, l65, ((1 + n^0) <= (0 + i^0)), par{skip^0 -> 1}>
<l62, l63, ((0 + i^0) <= (0 + n^0))>
<l70, l69, true>
<l46, l48, true>
<l88, l46, true>

Fresh variables:
undef344, undef374, undef623, undef952, undef1153, undef1337, undef1398, undef1875, undef2029, undef2040, undef2338, undef2361, undef2399, undef2504, undef2744, undef2894, undef3177, undef3343, undef3434, undef3774, undef3775, undef3776, undef3794, undef3944, 

Undef variables:
undef344, undef374, undef623, undef952, undef1153, undef1337, undef1398, undef1875, undef2029, undef2040, undef2338, undef2361, undef2399, undef2504, undef2744, undef2894, undef3177, undef3343, undef3434, undef3774, undef3775, undef3776, undef3794, undef3944, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l46, true>
<l3, l22, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + i^0) <= 1), par{skip^0 -> 1}>
<l3, l16, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + i^0)), par{skip^0 -> 1}>
<l3, l3, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l6, l22, ((0 + i^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + (1 + i^0)) <= 1), par{i^0 -> (1 + i^0)}>
<l6, l16, ((0 + i^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ (1 <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
<l6, l6, ((0 + i^0) <= (0 + j^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l6, l6, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l12, l22, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + i^0) <= 1)>
<l12, l16, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + i^0))>
<l12, l6, ((0 + n^0) <= (0 + k^0)) /\ ((0 + i^0) <= (0 + n^0))>
<l12, l12, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623) /\ ((0 + undef623) <= 0) /\ (0 <= (0 + undef623)), par{k^0 -> (1 + k^0)}>
<l12, l12, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623) /\ (1 <= (0 + undef623)) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
<l12, l19, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623) /\ (1 <= (0 + undef623)) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l12, l12, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623) /\ ((1 + undef623) <= 0) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
<l12, l19, ((1 + k^0) <= (0 + n^0)) /\ (undef623 = undef623) /\ ((1 + undef623) <= 0) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l15, l12, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
<l15, l19, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), sum^0 -> 0}>
<l15, l15, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l16, l22, ((1 + i^0) <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= 1), par{i^0 -> (~(1) + i^0)}>
<l16, l16, ((1 + i^0) <= (0 + j^0)) /\ (1 <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}>
<l16, l16, ((0 + j^0) <= (0 + i^0)) /\ (undef2744 = undef2744), par{j^0 -> (1 + j^0), sum^0 -> undef2744}>
<l19, l15, ((1 + n^0) <= (0 + i^0)) /\ (undef344 = undef344), par{sum^0 -> undef344}>
<l19, l19, ((0 + i^0) <= (0 + n^0)) /\ (undef374 = undef374), par{i^0 -> (1 + i^0), sum^0 -> undef374}>
<l22, l42, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
<l22, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l38, l33, ((1 + n^0) <= (0 + i^0)) /\ (201 <= (0 + its^0)), par{restrt^0 -> 1}>
<l38, l12, ((1 + n^0) <= (0 + i^0)) /\ ((0 + its^0) <= 200) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
<l38, l38, ((0 + i^0) <= (0 + n^0)) /\ (undef1153 = undef1153) /\ (1 <= (0 + undef1153)) /\ (undef952 = undef952), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef952)}>
<l38, l38, ((0 + i^0) <= (0 + n^0)) /\ (undef1153 = undef1153) /\ ((1 + undef1153) <= 0) /\ (undef952 = undef952), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef952)}>
<l38, l38, ((0 + i^0) <= (0 + n^0)) /\ (undef1153 = undef1153) /\ ((0 + undef1153) <= 0) /\ (0 <= (0 + undef1153)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}>
<l42, l54, ((1 + n^0) <= (0 + i^0)) /\ (undef2361 = undef2361) /\ ((0 + undef2361) <= 0) /\ (0 <= (0 + undef2361)), par{restrt^0 -> 0, test^0 -> 0}>
<l42, l49, ((1 + n^0) <= (0 + i^0)) /\ (undef2361 = undef2361) /\ (1 <= (0 + undef2361))>
<l42, l49, ((1 + n^0) <= (0 + i^0)) /\ (undef2361 = undef2361) /\ ((1 + undef2361) <= 0)>
<l42, l42, ((0 + i^0) <= (0 + n^0)) /\ (undef2399 = undef2399) /\ ((0 + undef2399) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l42, l42, ((0 + i^0) <= (0 + n^0)) /\ (undef2399 = undef2399) /\ ((1 + test^0) <= (0 + undef2399)) /\ (undef2338 = undef2338), par{i^0 -> (1 + i^0), test^0 -> (0 + undef2338)}>
<l46, l38, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + test^0))>
<l46, l33, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 1)>
<l46, l46, ((0 + i^0) <= (0 + n^0)) /\ (undef1398 = undef1398) /\ ((0 + undef1398) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l46, l46, ((0 + i^0) <= (0 + n^0)) /\ (undef1398 = undef1398) /\ ((1 + test^0) <= (0 + undef1398)) /\ (undef1337 = undef1337), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1337)}>
<l49, l33, ((1 + n^0) <= (0 + i^0)) /\ (201 <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
<l49, l3, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
<l49, l12, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l49, l12, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l49, l49, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l54, l33, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ (201 <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
<l54, l3, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
<l54, l12, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l54, l12, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l54, l33, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 0)>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef2040 = undef2040) /\ (undef2029 = undef2029) /\ ((0 + (0 + undef2029)) <= (0 + 1)) /\ (undef1875 = undef1875) /\ ((0 + undef1875) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef2040 = undef2040) /\ (undef2029 = undef2029) /\ ((0 + (0 + undef2029)) <= (0 + 1)) /\ (undef1875 = undef1875) /\ ((1 + test^0) <= (0 + undef1875)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1875)}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef2040 = undef2040) /\ (undef2029 = undef2029) /\ ((1 + 1) <= (0 + (0 + undef2029))) /\ (undef1875 = undef1875) /\ ((0 + undef1875) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef2040 = undef2040) /\ (undef2029 = undef2029) /\ ((1 + 1) <= (0 + (0 + undef2029))) /\ (undef1875 = undef1875) /\ ((1 + test^0) <= (0 + undef1875)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1875)}>

Fresh variables:
undef344, undef374, undef623, undef952, undef1153, undef1337, undef1398, undef1875, undef2029, undef2040, undef2338, undef2361, undef2399, undef2504, undef2744, undef2894, undef3177, undef3343, undef3434, undef3774, undef3775, undef3776, undef3794, undef3944, 

Undef variables:
undef344, undef374, undef623, undef952, undef1153, undef1337, undef1398, undef1875, undef2029, undef2040, undef2338, undef2361, undef2399, undef2504, undef2744, undef2894, undef3177, undef3343, undef3434, undef3774, undef3775, undef3776, undef3794, undef3944, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l46, l46, i^0 <= n^0 /\ undef1398 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
<l46, l46, 1 + test^0 <= undef1398 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef1337, rest remain the same}>
Variables:
i^0, n^0, test^0

Graph 2:
Transitions:
<l38, l38, 1 <= undef1153 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef952, rest remain the same}>
<l38, l38, 1 + undef1153 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef952, rest remain the same}>
<l38, l38, i^0 <= n^0 /\ undef1153 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, sum^0

Graph 3:
Transitions:
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0, {skip^0 -> 1, rest remain the same}>
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0, {skip^0 -> 1, rest remain the same}>
<l3, l3, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l6, l22, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l6, l16, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l6, l6, 1 + i^0 <= n^0 /\ i^0 <= j^0, {i^0 -> 1 + i^0, rest remain the same}>
<l6, l6, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
<l12, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
<l12, l6, i^0 <= n^0 /\ n^0 <= k^0, {all remain the same}>
<l12, l12, 1 + k^0 <= n^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef623, {k^0 -> 1 + k^0, rest remain the same}>
<l12, l19, 1 + k^0 <= n^0 /\ 1 <= undef623 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef623 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
<l12, l19, 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
<l15, l12, 1 + n^0 <= i^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
<l15, l15, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l16, l22, 1 + i^0 <= j^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, 1 + i^0 <= j^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, j^0 <= i^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>
<l19, l15, 1 + n^0 <= i^0, {sum^0 -> undef344, rest remain the same}>
<l19, l19, i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef374, rest remain the same}>
<l22, l42, 1 + n^0 <= i^0, {test^0 -> 0, rest remain the same}>
<l22, l22, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l42, l54, 1 + n^0 <= i^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361, {all remain the same}>
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0, {all remain the same}>
<l42, l42, i^0 <= n^0 /\ undef2399 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
<l42, l42, 1 + test^0 <= undef2399 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef2338, rest remain the same}>
<l49, l3, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
<l49, l12, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
<l49, l49, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l54, l3, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l12, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l54, i^0 <= n^0 /\ undef1875 <= test^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>
<l54, l54, i^0 <= n^0 /\ undef1875 <= test^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, rest remain the same}>
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>
Variables:
i^0, n^0, j^0, k^0, sum^0, test^0, its^0, restrt^0

Graph 4:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l46, l38, 1 + n^0 <= i^0 /\ 1 <= test^0, {all remain the same}>

Graph 3
<l38, l12, 1 + n^0 <= i^0 /\ its^0 <= 200, {restrt^0 -> 1, rest remain the same}>

Graph 4
<l38, l33, 1 + n^0 <= i^0 /\ 201 <= its^0, {restrt^0 -> 1, rest remain the same}>
<l46, l33, 1 + n^0 <= i^0 /\ test^0 <= 0, {all remain the same}>
<l49, l33, 1 + n^0 <= i^0 /\ 200 <= its^0, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l33, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 200 <= its^0, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l33, 1 + n^0 <= i^0 /\ 1 + test^0 <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 3 )
( 6 , 3 )
( 12 , 3 )
( 15 , 3 )
( 16 , 3 )
( 19 , 3 )
( 22 , 3 )
( 33 , 4 )
( 38 , 2 )
( 42 , 3 )
( 46 , 1 )
( 49 , 3 )
( 54 , 3 )

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

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

Checking conditional termination of SCC {l46}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003870s
Ranking function: -i^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.009092
Some transition disabled by a set of invariant(s):
Invariant at l38: 1 + n^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l38, l38, i^0 <= n^0 /\ undef1153 = 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l38, l38, 1 <= undef1153 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef952, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l38, l38, 1 + undef1153 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef952, rest remain the same}>
Checking unfeasibility...
Time used: 0.000138

Analyzing SCC {l38}...
No cycles found.

Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.750931
Some transition disabled by a set of invariant(s):
Invariant at l3: 0 <= restrt^0
Invariant at l6: 0 <= restrt^0
Invariant at l12: 0 <= restrt^0
Invariant at l15: 0 <= restrt^0
Invariant at l16: 0 <= restrt^0
Invariant at l19: 0 <= restrt^0
Invariant at l22: 0 <= restrt^0
Invariant at l42: 0 <= restrt^0
Invariant at l49: 0 <= restrt^0
Invariant at l54: 0 <= restrt^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l49, l12, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l22, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l16, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l6, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + k^0 <= n^0 /\ 0 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef623 /\ 0 <= restrt^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + k^0 <= n^0 /\ 1 <= undef623 /\ j^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ 0 <= restrt^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l12, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 0 <= restrt^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, sum^0 -> undef374, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l42, 1 + n^0 <= i^0 /\ 0 <= restrt^0, {test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l54, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l42, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef2399 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l42, 1 + test^0 <= undef2399 /\ i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, test^0 -> undef2338, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l49, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l54, l12, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>
Checking unfeasibility...
Time used: 0.787464
Some transition disabled by a set of invariant(s):
Invariant at l3: 1 + n^0 <= i^0
Invariant at l6: i^0 <= n^0
Invariant at l16: 1 <= i^0
Invariant at l42: 1 + n^0 <= i^0
Invariant at l49: 0 <= 1 + restrt^0
Invariant at l54: 0 <= restrt^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l22, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l16, i^0 <= j^0 /\ 0 <= i^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + j^0 <= i^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^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): 
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = 1, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, 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
Strengthening transition (result): 
<l42, l54, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l42, l42, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef2399 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l42, l42, 1 + test^0 <= undef2399 /\ i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, test^0 -> undef2338, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l49, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>
Checking unfeasibility...
Time used: 0.635492
Some transition disabled by a set of invariant(s):
Invariant at l3: n^0 <= i^0
Invariant at l6: i^0 <= 1 + n^0
Invariant at l12: n^0 <= 1 + i^0
Invariant at l15: 1 + k^0 <= n^0
Invariant at l16: 0 <= 1 + i^0
Invariant at l19: 1 + k^0 <= n^0
Invariant at l42: 1 + n^0 <= i^0
Invariant at l54: 1 + n^0 + restrt^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>
> It's unfeasible. Removing transition: 
<l54, l54, 1 + test^0 <= undef1875 /\ i^0 <= n^0 /\ 0 <= restrt^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, test^0 -> undef1875, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l22, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l16, i^0 <= j^0 /\ 0 <= i^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + j^0 <= i^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l6, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + k^0 <= n^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef623 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + k^0 <= n^0 /\ 1 <= undef623 /\ j^0 <= n^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = 1, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, sum^0 -> undef374, 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
Strengthening transition (result): 
<l42, l54, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ 0 <= restrt^0, {all 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): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l12, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ undef2029 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l54, l54, i^0 <= n^0 /\ 0 <= restrt^0 /\ undef1875 <= test^0 /\ 2 <= undef2029, {i^0 -> 1 + i^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.716735
Some transition disabled by a set of invariant(s):
Invariant at l3: restrt^0 <= 1
Invariant at l6: 1 + n^0 <= i^0
Invariant at l12: 1 + n^0 <= i^0
Invariant at l19: 1 + n^0 <= i^0 + restrt^0
Invariant at l49: n^0 <= 1 + i^0 + restrt^0
Invariant at l54: 1 + n^0 <= i^0 + restrt^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l6, l6, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
> It's unfeasible. Removing transition: 
<l12, l6, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l22, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l16, i^0 <= j^0 /\ 0 <= i^0 /\ 0 <= restrt^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l6, 1 + j^0 <= i^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 0 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef623 /\ 0 <= restrt^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef623 /\ j^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ 0 <= restrt^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> 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): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 0 <= restrt^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, sum^0 -> undef374, 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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l49, i^0 <= n^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l12, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.539381
Some transition disabled by a set of invariant(s):
Invariant at l3: 0 <= restrt^0
Invariant at l12: 1 <= restrt^0
Invariant at l15: 1 <= restrt^0
Invariant at l19: 1 <= restrt^0
Invariant at l49: 1 + n^0 <= i^0
Invariant at l54: restrt^0 + test^0 <= 1

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l49, l49, i^0 <= n^0 /\ 0 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef374, 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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 0 <= test^0 /\ restrt^0 + test^0 <= 1 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l12, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ restrt^0 + test^0 <= 1 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.384486
Some transition disabled by a set of invariant(s):
Invariant at l3: 0 <= restrt^0
Invariant at l12: 0 <= 1 + restrt^0
Invariant at l15: k^0 <= 1 + i^0 + restrt^0
Invariant at l16: 0 <= restrt^0
Invariant at l19: j^0 <= 1 + i^0
Invariant at l42: 1 + n^0 <= i^0
Invariant at l49: n^0 <= i^0
Invariant at l54: restrt^0 + test^0 <= 0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l54, l12, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ restrt^0 + test^0 <= 1 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ n^0 <= j^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ i^0 <= n^0 /\ k^0 <= 1 + i^0 + restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = 1, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= 1 + i^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ i^0 <= n^0 /\ j^0 <= 1 + i^0, {i^0 -> 1 + i^0, sum^0 -> undef374, 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
Strengthening transition (result): 
<l42, l54, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ restrt^0 + test^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.635033
Some transition disabled by a set of invariant(s):
Invariant at l3: 1 + n^0 <= i^0
Invariant at l12: n^0 <= 1 + i^0
Invariant at l15: 1 + n^0 <= i^0
Invariant at l19: n^0 <= i^0
Invariant at l22: 0 <= restrt^0
Invariant at l49: n^0 <= i^0
Invariant at l54: n^0 + restrt^0 + test^0 <= 1 + i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l15, l15, 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ i^0 <= n^0 /\ k^0 <= 1 + i^0 + restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ n^0 <= j^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l19, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> 1 + j^0, sum^0 -> 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
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= 1 + i^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l19, 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= 1 + i^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, sum^0 -> undef374, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l42, 1 + n^0 <= i^0 /\ 0 <= restrt^0, {test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l3, 1 + n^0 <= i^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l49, l12, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ restrt^0 + test^0 <= 0 /\ 0 <= test^0 /\ n^0 + restrt^0 + test^0 <= 1 + i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.645416
Some transition disabled by a set of invariant(s):
Invariant at l3: 1 + n^0 <= i^0 + restrt^0
Invariant at l12: 1 + n^0 <= i^0
Invariant at l16: 0 <= 1 + restrt^0
Invariant at l19: 1 + n^0 <= i^0
Invariant at l22: 0 <= 1 + restrt^0
Invariant at l42: n^0 <= 1 + i^0
Invariant at l54: n^0 + restrt^0 + test^0 <= 1 + i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l19, l19, 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= 1 + i^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, sum^0 -> undef374, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l22, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef623 = 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef623 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l19, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef623 <= 0 /\ j^0 <= n^0, {sum^0 -> 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): 
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = 1, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l19, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= 1 + i^0, {sum^0 -> undef344, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l42, 1 + n^0 <= i^0 /\ 0 <= restrt^0, {test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l54, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2361 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l42, l49, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ 0 <= restrt^0, {all 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): 
<l54, l3, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ restrt^0 + test^0 <= 0 /\ 0 <= test^0 /\ n^0 + restrt^0 + test^0 <= 1 + i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
Checking unfeasibility...
Time used: 1.18985

Location 6 unreachable!
Checking conditional termination of SCC {l3, l12, l15, l16, l19, l22, l42, l49, l54}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.034523s
Ranking function: -6 - k^0 + n^0 + 7*restrt^0
New Graphs: 
Transitions:
<l3, l22, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ i^0 <= 0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>
<l3, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>
<l16, l22, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ i^0 = 1, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>
<l22, l3, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ its^0 <= 199 /\ undef2361 = 0, {its^0 -> 1 + its^0, restrt^0 -> 0, test^0 -> 0, rest remain the same}>
<l22, l3, 1 + n^0 <= i^0 /\ 1 <= undef2361 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 <= undef2361 /\ i^0 <= 0 /\ n^0 <= k^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 <= undef2361 /\ n^0 <= k^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l3, 1 + n^0 <= i^0 /\ 1 + undef2361 <= 0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l22, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 + undef2361 <= 0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l16, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 + undef2361 <= 0 /\ n^0 <= k^0 /\ n^0 <= 1 + i^0 + restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, its^0, j^0, k^0, n^0, restrt^0, sum^0, test^0
Transitions:
<l15, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= i^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> ((0 + 1) + 0) + j^0, sum^0 -> undef344, rest remain the same}>
Variables:
i^0, j^0, k^0, n^0, restrt^0, sum^0
Checking conditional termination of SCC {l3, l16, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016595s
Ranking function: 199 - its^0
New Graphs: 
Transitions:
<l15, l15, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 <= i^0 /\ k^0 <= 1 + i^0 + restrt^0, {j^0 -> ((0 + 1) + 0) + j^0, sum^0 -> undef344, rest remain the same}>
Variables:
i^0, j^0, k^0, n^0, restrt^0, sum^0
Transitions:
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>
Variables:
i^0, j^0, restrt^0, sum^0
Transitions:
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, restrt^0
Checking conditional termination of SCC {l15}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004561s
Ranking function: -1 - j^0 + n^0
New Graphs: 
Transitions:
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l16, l16, 1 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2744, rest remain the same}>
Variables:
i^0, j^0, restrt^0, sum^0
Transitions:
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, restrt^0
Checking conditional termination of SCC {l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004648s
Ranking function: 6*i^0 - 6*j^0
New Graphs: 
Transitions:
<l22, l22, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, restrt^0
Transitions:
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
Variables:
i^0, j^0, restrt^0
Checking conditional termination of SCC {l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003903s
Ranking function: -i^0 + n^0
New Graphs: 
Transitions:
<l16, l16, 1 + i^0 <= j^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
Variables:
i^0, j^0, restrt^0
Checking conditional termination of SCC {l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003741s
Ranking function: -2 + i^0
New Graphs: 
Proving termination of subgraph 4
Analyzing SCC {l33}...
No cycles found.

Program Terminates