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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l88, true>
<l1, l2, true>
<l3, l4, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l3, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef77 = undef77), par{j^0 -> (1 + j^0), sum^0 -> undef77}>
<l6, l7, true, par{i^0 -> (1 + i^0)}>
<l5, l3, true>
<l8, l1, ((1 + n^0) <= (0 + i^0)), par{skip^0 -> 1}>
<l8, l5, ((0 + i^0) <= (0 + n^0))>
<l4, l8, true>
<l9, l4, ((1 + n^0) <= (0 + i^0))>
<l9, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l10, l9, true>
<l11, l12, true>
<l13, l14, ((0 + i^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l13, l15, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l15, l13, true>
<l16, l11, ((1 + n^0) <= (0 + i^0))>
<l16, l15, ((0 + i^0) <= (0 + n^0))>
<l14, l16, true>
<l17, l18, true, par{k^0 -> (1 + k^0)}>
<l19, l6, ((0 + tmp___0^0) <= (0 + test^0))>
<l19, l6, ((1 + test^0) <= (0 + tmp___0^0)) /\ (undef638 = undef638), par{test^0 -> (0 + undef638), tmp^0 -> undef638}>
<l20, l21, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l20, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l22, l20, true>
<l23, l22, ((1 + n^0) <= (0 + i^0)) /\ (undef759 = undef759), par{sum^0 -> undef759}>
<l23, l24, ((0 + i^0) <= (0 + n^0)) /\ (undef790 = undef790), par{i^0 -> (1 + i^0), sum^0 -> undef790}>
<l24, l23, true>
<l25, l17, ((1 + n^0) <= (0 + j^0))>
<l25, l24, ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l21, l25, true>
<l26, l17, ((0 + tmp___2^0) <= 0) /\ (0 <= (0 + tmp___2^0))>
<l26, l21, (1 <= (0 + tmp___2^0))>
<l26, l21, ((1 + tmp___2^0) <= 0)>
<l27, l14, ((0 + n^0) <= (0 + k^0))>
<l27, l26, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078), par{tmp___2^0 -> undef1078}>
<l18, l27, true>
<l28, l29, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l28, l30, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l30, l28, true>
<l31, l18, ((1 + n^0) <= (0 + i^0))>
<l31, l30, ((0 + i^0) <= (0 + n^0))>
<l32, l33, ((1 + n^0) <= (0 + i^0))>
<l32, l19, ((0 + i^0) <= (0 + n^0)) /\ (undef1321 = undef1321), par{tmp___0^0 -> undef1321}>
<l29, l31, true>
<l34, l10, ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0))>
<l34, l29, (1 <= (0 + restrt^0))>
<l34, l29, ((1 + restrt^0) <= 0)>
<l35, l36, ((1 + __const_200^0) <= (0 + its^0))>
<l35, l34, ((0 + its^0) <= (0 + __const_200^0))>
<l37, l35, true>
<l38, l39, (0 <= (0 + test^0))>
<l38, l36, ((1 + test^0) <= 0)>
<l40, l41, true, par{i^0 -> (1 + i^0)}>
<l42, l40, ((0 + temp^0) <= (0 + test^0))>
<l42, l40, ((1 + test^0) <= (0 + temp^0)), par{test^0 -> (0 + temp^0)}>
<l43, l42, (undef1721 = undef1721), par{temp^0 -> undef1721}>
<l44, l43, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{tmp___11^0 -> (0 + maxarg2^0)}>
<l44, l43, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{tmp___11^0 -> (0 + maxarg1^0)}>
<l45, l38, ((1 + n^0) <= (0 + i^0))>
<l45, l44, ((0 + i^0) <= (0 + n^0)) /\ (undef1860 = undef1860) /\ (undef1849 = undef1849), par{maxarg1^0 -> (0 + undef1849), maxarg2^0 -> 1, tmp___10^0 -> undef1849, tmp___9^0 -> undef1860}>
<l41, l45, true>
<l39, l37, true, par{its^0 -> (1 + its^0)}>
<l46, l39, ((1 + n^0) <= (0 + i^0))>
<l46, l47, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l48, l49, (undef2007 = undef2007), par{tmp___1^0 -> undef2007}>
<l47, l46, true>
<l50, l41, ((0 + tmp___12^0) <= 0) /\ (0 <= (0 + tmp___12^0)), par{restrt^0 -> 0, test^0 -> 0}>
<l50, l47, (1 <= (0 + tmp___12^0))>
<l50, l47, ((1 + tmp___12^0) <= 0)>
<l51, l52, true, par{i^0 -> (1 + i^0)}>
<l53, l51, ((0 + tmp___8^0) <= (0 + test^0))>
<l53, l51, ((1 + test^0) <= (0 + tmp___8^0)) /\ (undef2230 = undef2230), par{test^0 -> (0 + undef2230), tmp___7^0 -> undef2230}>
<l49, l54, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}>
<l7, l32, true>
<l55, l50, ((1 + n^0) <= (0 + i^0)) /\ (undef2316 = undef2316), par{tmp___12^0 -> undef2316}>
<l55, l53, ((0 + i^0) <= (0 + n^0)) /\ (undef2355 = undef2355), par{tmp___8^0 -> undef2355}>
<l52, l55, true>
<l56, l57, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l56, l58, ((0 + j^0) <= (0 + n^0)) /\ (undef2433 = undef2433), par{j^0 -> (1 + j^0), sum^0 -> undef2433}>
<l58, l56, true>
<l59, l52, ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
<l59, l58, ((0 + i^0) <= (0 + n^0))>
<l57, l59, true>
<l60, l48, (1 <= (0 + sqrarg^0))>
<l60, l48, ((1 + sqrarg^0) <= 0)>
<l60, l49, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}>
<l61, l57, ((1 + n^0) <= (0 + i^0)), par{fold^0 -> (0 + f^0)}>
<l61, l62, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l62, l61, true>
<l63, l64, ((1 + i^0) <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}>
<l63, l65, ((0 + j^0) <= (0 + i^0)) /\ (undef2805 = undef2805), par{j^0 -> (1 + j^0), sum^0 -> undef2805}>
<l65, l63, true>
<l66, l62, ((1 + i^0) <= 1)>
<l66, l65, (1 <= (0 + i^0))>
<l64, l66, true>
<l67, l11, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l67, l68, ((0 + j^0) <= (0 + n^0)) /\ (undef2991 = undef2991), par{j^0 -> (1 + j^0), sum^0 -> undef2991}>
<l68, l67, true>
<l12, l64, ((1 + n^0) <= (0 + i^0))>
<l12, l68, ((0 + i^0) <= (0 + n^0))>
<l69, l37, ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
<l69, l60, ((0 + i^0) <= (0 + n^0)) /\ (undef3145 = undef3145), par{sqrarg^0 -> undef3145}>
<l70, l11, ((1 + n^0) <= (0 + i^0))>
<l70, l71, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l71, l70, true>
<l72, l71, ((1 + n^0) <= (0 + i^0))>
<l72, l73, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l73, l72, true>
<l54, l69, true>
<l74, l75, (undef3407 = undef3407), par{tmp___6^0 -> undef3407}>
<l75, l76, true, par{den^0 -> ((0 + den^0) + tmp___6^0), i^0 -> (1 + i^0)}>
<l77, l74, (1 <= (0 + sqrarg^0))>
<l77, l74, ((1 + sqrarg^0) <= 0)>
<l77, l75, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___6^0 -> 0}>
<l78, l73, ((1 + n^0) <= (0 + i^0))>
<l78, l77, ((0 + i^0) <= (0 + n^0)) /\ (undef3579 = undef3579), par{sqrarg^0 -> undef3579}>
<l76, l78, true>
<l79, l80, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l79, l81, ((0 + j^0) <= (0 + n^0)) /\ (undef3673 = undef3673), par{j^0 -> (1 + j^0), sum^0 -> undef3673}>
<l81, l79, true>
<l82, l76, ((1 + n^0) <= (0 + i^0))>
<l82, l81, ((0 + i^0) <= (0 + n^0))>
<l80, l82, true>
<l83, l11, (1 <= (0 + skip^0))>
<l83, l11, ((1 + skip^0) <= 0)>
<l83, l80, ((0 + skip^0) <= 0) /\ (0 <= (0 + skip^0))>
<l84, l1, true, par{i^0 -> (1 + i^0)}>
<l85, l84, ((1 + tmp___3^0) <= 0)>
<l85, l84, (0 <= (0 + tmp___3^0)), par{skip^0 -> 0}>
<l33, l54, (1 <= (0 + test^0))>
<l33, l36, ((1 + test^0) <= 1)>
<l86, l85, ((1 + n^0) <= (0 + j^0)) /\ (undef4086 = undef4086) /\ (undef4087 = undef4087) /\ (undef4088 = undef4088), par{tmp___3^0 -> undef4086, tmp___4^0 -> undef4087, tmp___5^0 -> undef4088}>
<l86, l87, ((0 + j^0) <= (0 + n^0)) /\ (undef4107 = undef4107), par{j^0 -> (1 + j^0), sum^0 -> undef4107}>
<l87, l86, true>
<l2, l83, ((1 + n^0) <= (0 + i^0))>
<l2, l87, ((0 + i^0) <= (0 + n^0))>
<l88, l7, true>

Fresh variables:
undef77, undef638, undef759, undef790, undef1078, undef1321, undef1721, undef1849, undef1860, undef2007, undef2230, undef2316, undef2355, undef2433, undef2805, undef2991, undef3145, undef3407, undef3579, undef3673, undef4086, undef4087, undef4088, undef4107, 

Undef variables:
undef77, undef638, undef759, undef790, undef1078, undef1321, undef1721, undef1849, undef1860, undef2007, undef2230, undef2316, undef2355, undef2433, undef2805, undef2991, undef3145, undef3407, undef3579, undef3673, undef4086, undef4087, undef4088, undef4107, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, true>
<l7, l54, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + test^0))>
<l7, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 1)>
<l7, l7, ((0 + i^0) <= (0 + n^0)) /\ (undef1321 = undef1321) /\ ((0 + undef1321) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l7, l7, ((0 + i^0) <= (0 + n^0)) /\ (undef1321 = undef1321) /\ ((1 + test^0) <= (0 + undef1321)) /\ (undef638 = undef638), par{i^0 -> (1 + i^0), test^0 -> (0 + undef638)}>
<l10, l62, ((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}>
<l10, l65, ((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}>
<l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l15, l62, ((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)}>
<l15, l65, ((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)}>
<l15, l15, ((0 + i^0) <= (0 + j^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l15, l15, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l18, l62, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + i^0) <= 1)>
<l18, l65, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + i^0))>
<l18, l15, ((0 + n^0) <= (0 + k^0)) /\ ((0 + i^0) <= (0 + n^0))>
<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078) /\ ((0 + undef1078) <= 0) /\ (0 <= (0 + undef1078)), par{k^0 -> (1 + k^0)}>
<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078) /\ (1 <= (0 + undef1078)) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
<l18, l24, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078) /\ (1 <= (0 + undef1078)) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078) /\ ((1 + undef1078) <= 0) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
<l18, l24, ((1 + k^0) <= (0 + n^0)) /\ (undef1078 = undef1078) /\ ((1 + undef1078) <= 0) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
<l22, l18, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
<l22, l24, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), sum^0 -> 0}>
<l22, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l24, l22, ((1 + n^0) <= (0 + i^0)) /\ (undef759 = undef759), par{sum^0 -> undef759}>
<l24, l24, ((0 + i^0) <= (0 + n^0)) /\ (undef790 = undef790), par{i^0 -> (1 + i^0), sum^0 -> undef790}>
<l41, l36, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((1 + __const_200^0) <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
<l41, l10, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
<l41, l18, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l41, l18, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l41, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 0)>
<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1860 = undef1860) /\ (undef1849 = undef1849) /\ ((0 + (0 + undef1849)) <= (0 + 1)) /\ (undef1721 = undef1721) /\ ((0 + undef1721) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1860 = undef1860) /\ (undef1849 = undef1849) /\ ((0 + (0 + undef1849)) <= (0 + 1)) /\ (undef1721 = undef1721) /\ ((1 + test^0) <= (0 + undef1721)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1721)}>
<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1860 = undef1860) /\ (undef1849 = undef1849) /\ ((1 + 1) <= (0 + (0 + undef1849))) /\ (undef1721 = undef1721) /\ ((0 + undef1721) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1860 = undef1860) /\ (undef1849 = undef1849) /\ ((1 + 1) <= (0 + (0 + undef1849))) /\ (undef1721 = undef1721) /\ ((1 + test^0) <= (0 + undef1721)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1721)}>
<l47, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + __const_200^0) <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
<l47, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
<l47, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l47, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= (0 + __const_200^0)) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
<l47, l47, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l52, l41, ((1 + n^0) <= (0 + i^0)) /\ (undef2316 = undef2316) /\ ((0 + undef2316) <= 0) /\ (0 <= (0 + undef2316)), par{restrt^0 -> 0, test^0 -> 0}>
<l52, l47, ((1 + n^0) <= (0 + i^0)) /\ (undef2316 = undef2316) /\ (1 <= (0 + undef2316))>
<l52, l47, ((1 + n^0) <= (0 + i^0)) /\ (undef2316 = undef2316) /\ ((1 + undef2316) <= 0)>
<l52, l52, ((0 + i^0) <= (0 + n^0)) /\ (undef2355 = undef2355) /\ ((0 + undef2355) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
<l52, l52, ((0 + i^0) <= (0 + n^0)) /\ (undef2355 = undef2355) /\ ((1 + test^0) <= (0 + undef2355)) /\ (undef2230 = undef2230), par{i^0 -> (1 + i^0), test^0 -> (0 + undef2230)}>
<l54, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + __const_200^0) <= (0 + its^0)), par{restrt^0 -> 1}>
<l54, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + its^0) <= (0 + __const_200^0)) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3145 = undef3145) /\ (1 <= (0 + undef3145)) /\ (undef2007 = undef2007), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef2007)}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3145 = undef3145) /\ ((1 + undef3145) <= 0) /\ (undef2007 = undef2007), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef2007)}>
<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3145 = undef3145) /\ ((0 + undef3145) <= 0) /\ (0 <= (0 + undef3145)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}>
<l62, l52, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
<l62, l62, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l65, l62, ((1 + i^0) <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= 1), par{i^0 -> (~(1) + i^0)}>
<l65, l65, ((1 + i^0) <= (0 + j^0)) /\ (1 <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}>
<l65, l65, ((0 + j^0) <= (0 + i^0)) /\ (undef2805 = undef2805), par{j^0 -> (1 + j^0), sum^0 -> undef2805}>

Fresh variables:
undef77, undef638, undef759, undef790, undef1078, undef1321, undef1721, undef1849, undef1860, undef2007, undef2230, undef2316, undef2355, undef2433, undef2805, undef2991, undef3145, undef3407, undef3579, undef3673, undef4086, undef4087, undef4088, undef4107, 

Undef variables:
undef77, undef638, undef759, undef790, undef1078, undef1321, undef1721, undef1849, undef1860, undef2007, undef2230, undef2316, undef2355, undef2433, undef2805, undef2991, undef3145, undef3407, undef3579, undef3673, undef4086, undef4087, undef4088, undef4107, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

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

Graph 3:
Transitions:
<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0, {skip^0 -> 1, rest remain the same}>
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0, {skip^0 -> 1, rest remain the same}>
<l10, l10, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0, {i^0 -> 1 + i^0, rest remain the same}>
<l15, l15, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
<l18, l15, i^0 <= n^0 /\ n^0 <= k^0, {all remain the same}>
<l18, l18, 1 + k^0 <= n^0 /\ undef1078 = 0, {k^0 -> 1 + k^0, rest remain the same}>
<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1078, {k^0 -> 1 + k^0, rest remain the same}>
<l18, l24, 1 + k^0 <= n^0 /\ 1 <= undef1078 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1078 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
<l18, l24, 1 + k^0 <= n^0 /\ 1 + undef1078 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
<l22, l18, 1 + n^0 <= i^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
<l22, l22, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l24, l22, 1 + n^0 <= i^0, {sum^0 -> undef759, rest remain the same}>
<l24, l24, i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef790, rest remain the same}>
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0, {its^0 -> 1 + its^0, rest remain the same}>
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0, {its^0 -> 1 + its^0, rest remain the same}>
<l41, l41, i^0 <= n^0 /\ undef1721 <= test^0 /\ undef1849 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ undef1849 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>
<l41, l41, i^0 <= n^0 /\ undef1721 <= test^0 /\ 2 <= undef1849, {i^0 -> 1 + i^0, rest remain the same}>
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ 2 <= undef1849, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0, {its^0 -> 1 + its^0, rest remain the same}>
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0, {its^0 -> 1 + its^0, rest remain the same}>
<l47, l47, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l52, l41, 1 + n^0 <= i^0 /\ undef2316 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2316, {all remain the same}>
<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2316 <= 0, {all remain the same}>
<l52, l52, i^0 <= n^0 /\ undef2355 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
<l52, l52, 1 + test^0 <= undef2355 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef2230, rest remain the same}>
<l62, l52, 1 + n^0 <= i^0, {test^0 -> 0, rest remain the same}>
<l62, l62, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l65, l62, 1 + i^0 <= j^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, 1 + i^0 <= j^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, j^0 <= i^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Variables:
i^0, n^0, j^0, k^0, sum^0, __const_200^0, its^0, restrt^0, test^0

Graph 4:
Transitions:
Variables:

Precedence: 
Graph 0

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

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

Graph 3
<l54, l18, 1 + n^0 <= i^0 /\ its^0 <= __const_200^0, {restrt^0 -> 1, rest remain the same}>

Graph 4
<l7, l36, 1 + n^0 <= i^0 /\ test^0 <= 0, {all remain the same}>
<l41, l36, 1 + n^0 <= i^0 /\ __const_200^0 <= its^0 /\ 0 <= test^0, {its^0 -> 1 + its^0, rest remain the same}>
<l41, l36, 1 + n^0 <= i^0 /\ 1 + test^0 <= 0, {all remain the same}>
<l47, l36, 1 + n^0 <= i^0 /\ __const_200^0 <= its^0, {its^0 -> 1 + its^0, rest remain the same}>
<l54, l36, 1 + __const_200^0 <= its^0 /\ 1 + n^0 <= i^0, {restrt^0 -> 1, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 7 , 1 )
( 10 , 3 )
( 15 , 3 )
( 18 , 3 )
( 22 , 3 )
( 24 , 3 )
( 36 , 4 )
( 41 , 3 )
( 47 , 3 )
( 52 , 3 )
( 54 , 2 )
( 62 , 3 )
( 65 , 3 )

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

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

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l54, l54, i^0 <= n^0 /\ undef3145 = 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: 
<l54, l54, 1 <= undef3145 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef2007, 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, 1 + undef3145 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef2007, rest remain the same}>
Checking unfeasibility...
Time used: 0.000132

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

Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.567241
Some transition disabled by a set of invariant(s):
Invariant at l10: n^0 <= i^0 + restrt^0
Invariant at l18: n^0 <= i^0
Invariant at l41: restrt^0 <= 0
Invariant at l47: 1 + n^0 <= i^0
Invariant at l52: 1 + n^0 <= i^0
Invariant at l65: 0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0, {its^0 -> 1 + its^0, rest remain the same}>
> It's unfeasible. Removing transition: 
<l52, l52, i^0 <= n^0 /\ undef2355 <= 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): 
<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= i^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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= i^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): 
<l10, l10, i^0 <= n^0 /\ n^0 <= 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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l62, 1 + n^0 <= i^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): 
<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^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): 
<l18, l15, n^0 <= k^0 /\ i^0 = n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k^0 <= n^0 /\ n^0 <= i^0 /\ undef1078 = 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): 
<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1078 /\ n^0 <= 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): 
<l18, l24, 1 + k^0 <= n^0 /\ 1 <= undef1078 /\ n^0 <= i^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): 
<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1078 <= 0 /\ n^0 <= 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): 
<l18, l24, 1 + k^0 <= n^0 /\ 1 + undef1078 <= 0 /\ n^0 <= i^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
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^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): 
<l41, l41, i^0 <= n^0 /\ restrt^0 <= 0 /\ undef1721 <= test^0 /\ undef1849 <= 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ restrt^0 <= 0 /\ undef1849 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + 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
It's unfeasible. Removing transition: 
<l47, l47, 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): 
<l52, l41, 1 + n^0 <= i^0 /\ undef2316 = 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): 
<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2316, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l52, l52, 1 + test^0 <= undef2355 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef2230, 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): 
<l65, l62, 1 + i^0 <= j^0 /\ 0 <= i^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): 
<l65, l65, 1 + i^0 <= j^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): 
<l65, l65, 0 <= i^0 /\ j^0 <= i^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Checking unfeasibility...
Time used: 0.929376
Some transition disabled by a set of invariant(s):
Invariant at l15: 1 <= 0
Invariant at l18: 1 + n^0 <= i^0
Invariant at l41: restrt^0 <= 1

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= 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
It's unfeasible. Removing transition: 
<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= 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
It's unfeasible. Removing transition: 
<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^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: 
<l15, l15, 1 + j^0 <= i^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): 
<l18, l62, 1 + n^0 <= i^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): 
<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l18, l15, n^0 <= k^0 /\ i^0 = n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ undef1078 = 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1078, {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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1078 /\ 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1078 <= 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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1078 <= 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
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^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): 
<l41, l41, i^0 <= n^0 /\ restrt^0 <= 0 /\ undef1721 <= test^0 /\ undef1849 <= 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ restrt^0 <= 0 /\ undef1849 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l41, i^0 <= n^0 /\ restrt^0 <= 0 /\ undef1721 <= test^0 /\ 2 <= undef1849, {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): 
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ restrt^0 <= 0 /\ 2 <= undef1849, {i^0 -> 1 + i^0, test^0 -> undef1721, 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
Checking unfeasibility...
Time used: 0.607294
Some transition disabled by a set of invariant(s):
Invariant at l22: 1 + k^0 <= n^0
Invariant at l24: 1 + k^0 <= n^0
Invariant at l41: 0 <= restrt^0
Invariant at l47: 1 + n^0 <= i^0
Invariant at l52: 1 + n^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l41, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0, {its^0 -> 1 + its^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): 
<l22, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^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): 
<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^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): 
<l22, l22, 1 + k^0 <= n^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): 
<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef759, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l41, i^0 <= n^0 /\ undef1721 <= test^0 /\ undef1849 <= 1 /\ restrt^0 = 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ i^0 <= n^0 /\ undef1849 <= 1 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + 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): 
<l52, l41, 1 + n^0 <= i^0 /\ undef2316 = 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): 
<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2316, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 0.422153
Some transition disabled by a set of invariant(s):
Invariant at l10: its^0 + n^0 + restrt^0 <= __const_200^0 + i^0
Invariant at l22: 1 + n^0 <= i^0
Invariant at l24: n^0 <= 1 + i^0
Invariant at l41: n^0 <= i^0
Invariant at l52: 1 + n^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l22, l22, 1 + k^0 <= n^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): 
<l10, l62, 1 + n^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ n^0 <= i^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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ n^0 <= i^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): 
<l10, l10, its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= n^0 /\ n^0 <= 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

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): 
<l22, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^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): 
<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^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): 
<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef759, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l41, undef1721 <= test^0 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l41, undef1721 <= test^0 /\ 2 <= undef1849 /\ i^0 = n^0 /\ restrt^0 = 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ 2 <= undef1849 /\ i^0 = n^0 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, 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): 
<l52, l41, 1 + n^0 <= i^0 /\ undef2316 = 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): 
<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2316, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 0.445061
Some transition disabled by a set of invariant(s):
Invariant at l10: 0 <= restrt^0
Invariant at l18: 1 <= restrt^0
Invariant at l22: 1 <= restrt^0
Invariant at l24: 1 <= restrt^0
Invariant at l41: restrt^0 <= 0
Invariant at l47: 0 <= restrt^0
Invariant at l52: 0 <= restrt^0
Invariant at l62: 0 <= restrt^0
Invariant at l65: 0 <= restrt^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + 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): 
<l10, l62, 1 + n^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ n^0 <= i^0 + restrt^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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ n^0 <= i^0 + restrt^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): 
<l10, l10, its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= n^0 /\ n^0 <= i^0 + restrt^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): 
<l18, l62, 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): 
<l18, l65, 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef1078 = 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1078, {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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1078 /\ 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1078 <= 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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1078 <= 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): 
<l22, l18, 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): 
<l22, l24, 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): 
<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0, {sum^0 -> undef759, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l41, undef1721 <= test^0 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^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): 
<l52, l41, 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2316 = 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): 
<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2316 /\ 0 <= restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2316 <= 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): 
<l62, l52, 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): 
<l62, l62, 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): 
<l65, l62, 1 + i^0 <= j^0 /\ 0 <= i^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): 
<l65, l65, 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): 
<l65, l65, 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Checking unfeasibility...
Time used: 0.665231
Some transition disabled by a set of invariant(s):
Invariant at l10: 1 + n^0 + restrt^0 <= i^0
Invariant at l24: n^0 <= i^0
Invariant at l41: n^0 + restrt^0 <= i^0
Invariant at l47: 0 <= 1 + restrt^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= n^0 /\ n^0 <= i^0 + restrt^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): 
<l10, l62, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ n^0 <= i^0 + restrt^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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ n^0 <= i^0 + restrt^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

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): 
<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0, {sum^0 -> undef759, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l41, l41, n^0 + restrt^0 <= i^0 /\ undef1721 <= test^0 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 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): 
<l41, l41, 1 + test^0 <= undef1721 /\ n^0 + restrt^0 <= i^0 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0, {its^0 -> 1 + its^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
Checking unfeasibility...
Time used: 0.448265
Some transition disabled by a set of invariant(s):
Invariant at l10: restrt^0 <= 1
Invariant at l18: n^0 <= 1 + i^0 + restrt^0
Invariant at l22: j^0 + k^0 <= i^0 + n^0 + restrt^0
Invariant at l24: j^0 + k^0 <= i^0 + n^0 + restrt^0
Invariant at l41: 1 + n^0 <= i^0
Invariant at l47: 1 + n^0 <= i^0
Invariant at l65: 1 <= i^0 + restrt^0

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l62, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ 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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ 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): 
<l18, l62, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ n^0 <= 1 + i^0 + restrt^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ 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
It's unfeasible. Removing transition: 
<l41, l41, n^0 + restrt^0 <= i^0 /\ undef1721 <= test^0 /\ undef1849 <= 1 /\ i^0 = n^0 /\ restrt^0 = 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: 
<l41, l41, n^0 + restrt^0 <= i^0 /\ undef1721 <= test^0 /\ 2 <= undef1849 /\ i^0 = n^0 /\ restrt^0 = 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: 
<l41, l41, 1 + test^0 <= undef1721 /\ n^0 + restrt^0 <= i^0 /\ 2 <= undef1849 /\ i^0 = n^0 /\ restrt^0 = 0, {i^0 -> 1 + i^0, test^0 -> undef1721, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0, {its^0 -> 1 + its^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): 
<l65, l62, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= i^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): 
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^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): 
<l65, l65, 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Checking unfeasibility...
Time used: 0.746434
Some transition disabled by a set of invariant(s):
Invariant at l10: 1 + n^0 + restrt^0 <= i^0
Invariant at l18: 1 + n^0 <= i^0 + restrt^0
Invariant at l22: 1 + n^0 <= i^0 + restrt^0
Invariant at l24: 1 + n^0 <= i^0
Invariant at l41: restrt^0 <= 0
Invariant at l47: n^0 <= i^0
Invariant at l65: 1 <= i^0 + restrt^0

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l62, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ 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): 
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ 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): 
<l18, l62, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^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): 
<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef1078 = 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1078, {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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1078 /\ 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): 
<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1078 <= 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): 
<l18, l24, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1078 <= 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): 
<l22, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 + k^0 <= i^0 + n^0 + 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): 
<l22, l24, 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 + k^0 <= i^0 + n^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): 
<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 + k^0 <= i^0 + n^0 + restrt^0, {sum^0 -> undef759, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l41, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ 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): 
<l47, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 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): 
<l47, l18, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0, {its^0 -> 1 + its^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): 
<l65, l62, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= i^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): 
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^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): 
<l65, l65, 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Checking unfeasibility...
Time used: 1.42323

Location 15 unreachable!
Checking conditional termination of SCC {l10, l18, l22, l24, l41, l47, l52, l62, l65}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.034514s
Ranking function: -5 - 5*k^0 + 5*n^0
New Graphs: 
Transitions:
<l10, l62, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ i^0 <= 0 /\ n^0 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>
<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ its^0 + n^0 + restrt^0 <= __const_200^0 + i^0 /\ n^0 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ restrt^0 <= 1, {skip^0 -> 1, rest remain the same}>
<l62, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 0 <= restrt^0 /\ undef2316 = 0, {its^0 -> 1 + its^0, restrt^0 -> 0, test^0 -> 0, rest remain the same}>
<l62, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 <= undef2316 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l62, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 1 <= undef2316 /\ i^0 <= 0 /\ n^0 <= k^0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l65, 1 + its^0 <= __const_200^0 /\ 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 1 <= undef2316 /\ n^0 <= k^0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l10, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + undef2316 <= 0 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l62, 1 + its^0 <= __const_200^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 1 + undef2316 <= 0 /\ i^0 <= 0 /\ n^0 <= k^0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l65, 1 + its^0 <= __const_200^0 /\ 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + restrt^0 /\ 1 <= restrt^0 /\ 1 + undef2316 <= 0 /\ n^0 <= k^0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
<l62, l62, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
<l65, l62, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ 0 <= restrt^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Variables:
__const_200^0, i^0, its^0, j^0, k^0, n^0, restrt^0, sum^0, test^0
Transitions:
<l22, l22, 1 + j^0 + k^0 <= i^0 + n^0 + restrt^0 /\ 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 -> ((0 + 1) + 0) + j^0, sum^0 -> undef759, rest remain the same}>
Variables:
i^0, j^0, k^0, n^0, restrt^0, sum^0
Checking conditional termination of SCC {l10, l62, l65}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.018444s
Ranking function: -5 + 5*__const_200^0 - 5*its^0
New Graphs: 
Transitions:
<l22, l22, 1 + j^0 + k^0 <= i^0 + n^0 + restrt^0 /\ 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 -> ((0 + 1) + 0) + j^0, sum^0 -> undef759, rest remain the same}>
Variables:
i^0, j^0, k^0, n^0, restrt^0, sum^0
Transitions:
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Variables:
i^0, j^0, restrt^0, sum^0
Transitions:
<l62, l62, 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 {l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004806s
Ranking function: -1 + i^0 - j^0 - k^0 + n^0 + restrt^0
New Graphs: 
Transitions:
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
<l65, l65, 1 <= i^0 + restrt^0 /\ 0 <= i^0 /\ j^0 <= i^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2805, rest remain the same}>
Variables:
i^0, j^0, restrt^0, sum^0
Transitions:
<l62, l62, 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 {l65}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005299s
Ranking function: 3*i^0 - 3*j^0
New Graphs: 
Transitions:
<l62, l62, i^0 <= n^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, restrt^0
Transitions:
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^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 {l62}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004244s
Ranking function: -i^0 + n^0
New Graphs: 
Transitions:
<l65, l65, 1 + i^0 <= j^0 /\ 1 <= i^0 + restrt^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 {l65}...

LOG: CALL solveLinear

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

Program Terminates