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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6, arg7 -> undef7}>
<l3, l2, (undef8 <= arg1) /\ (undef15 > ~(1)) /\ ((undef9 + 1) <= arg1) /\ (arg1 > 0) /\ (undef8 > 0) /\ (undef9 > ~(1)), par{arg1 -> undef8, arg2 -> undef9, arg3 -> undef10, arg4 -> undef11, arg5 -> undef12, arg6 -> undef13, arg7 -> undef14}>
<l2, l4, (undef16 <= arg1) /\ (undef18 >= undef23) /\ ((undef16 - 1) <= arg2) /\ (undef17 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef16 > 0) /\ (undef17 > ~(1)), par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, arg6 -> undef21, arg7 -> undef22}>
<l2, l4, (undef31 < undef32) /\ (undef31 > ~(1)) /\ (undef24 <= arg1) /\ ((undef24 - 1) <= arg2) /\ (undef25 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef24 > 0) /\ (undef25 > ~(1)), par{arg1 -> undef24, arg2 -> undef25, arg3 -> (undef31 + 1), arg4 -> undef27, arg5 -> undef28, arg6 -> undef29, arg7 -> undef30}>
<l4, l5, (undef33 <= arg1) /\ (arg3 >= undef40) /\ (undef33 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef33 > 0) /\ (undef34 > 1), par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, arg6 -> undef38, arg7 -> undef39}>
<l1, l6, ((undef41 + 1) <= arg1) /\ (arg1 > 0) /\ (undef41 > ~(1)) /\ (0 = arg2), par{arg1 -> undef41, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> undef46, arg7 -> undef47}>
<l1, l6, ((undef48 + 1) <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef48 > ~(1)), par{arg1 -> undef48, arg2 -> 0, arg3 -> 0, arg4 -> arg2, arg5 -> 1, arg6 -> undef53, arg7 -> undef54}>
<l1, l6, (undef57 > ~(1)) /\ (arg2 > 0) /\ ((undef55 + 1) <= arg1) /\ (arg1 > 0) /\ (undef55 > ~(1)), par{arg1 -> undef55, arg2 -> 0, arg3 -> undef57, arg4 -> arg2, arg5 -> 1, arg6 -> undef60, arg7 -> undef61}>
<l6, l6, (arg5 >= arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ ((undef62 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef62 > 1), par{arg1 -> undef62, arg2 -> (arg2 + 1), arg6 -> undef67, arg7 -> undef68}>
<l6, l6, (arg5 >= arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef69 > 4), par{arg1 -> undef69, arg2 -> (arg2 + 1), arg6 -> undef74, arg7 -> undef75}>
<l6, l7, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef79 <= arg1) /\ (arg1 > ~(1)) /\ (undef77 > 1) /\ (undef79 > ~(1)), par{arg1 -> arg3, arg2 -> undef77, arg3 -> arg2, arg4 -> undef79, arg5 -> arg4, arg6 -> (arg5 + 1), arg7 -> 0}>
<l6, l7, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef89 > ~(1)) /\ (arg5 > ~(1)) /\ (undef86 <= arg1) /\ (arg1 > ~(1)) /\ (undef84 > 1) /\ (undef86 > ~(1)), par{arg1 -> arg3, arg2 -> undef84, arg3 -> arg2, arg4 -> undef86, arg5 -> arg4, arg6 -> (arg5 + 1), arg7 -> undef89}>
<l7, l6, (undef90 <= arg2) /\ (arg2 > 1) /\ (arg4 > ~(1)) /\ (undef90 > 1) /\ ((arg7 + 2) <= arg2), par{arg1 -> undef90, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef95, arg7 -> undef96}>
<l7, l6, (arg2 > 2) /\ (arg4 > 0) /\ (undef97 > 4) /\ ((arg7 + 2) <= arg2), par{arg1 -> undef97, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef102, arg7 -> undef103}>
<l4, l8, (undef104 <= arg2) /\ (arg3 >= undef111) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef104 > 0) /\ (undef105 > ~(1)) /\ ((undef107 + 2) <= arg2) /\ ((undef106 + 2) <= arg2), par{arg1 -> undef104, arg2 -> undef105, arg3 -> undef106, arg4 -> undef107, arg5 -> undef108, arg6 -> undef109, arg7 -> undef110}>
<l2, l8, (undef119 < undef120) /\ (undef119 > ~(1)) /\ (undef120 > 0) /\ (undef121 > ~(1)) /\ ((undef119 + 1) <= undef120) /\ (undef112 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef112 > 0) /\ (undef113 > ~(1)) /\ ((undef115 + 2) <= arg2) /\ ((undef114 + 2) <= arg2), par{arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116, arg6 -> undef117, arg7 -> undef118}>
<l8, l8, (arg1 > 2) /\ (arg2 > 0) /\ (undef122 > 0) /\ (undef123 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((arg4 + 2) <= arg1), par{arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, arg6 -> undef127, arg7 -> undef128}>
<l5, l9, (undef129 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef129 > 1) /\ ((arg4 + 2) <= arg2) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef129, arg2 -> 0, arg4 -> undef132, arg5 -> undef133, arg6 -> undef134, arg7 -> undef135}>
<l2, l9, (undef143 < undef144) /\ (undef143 > ~(1)) /\ (undef144 > 0) /\ ((undef143 + 1) <= undef144) /\ (undef137 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef136 > 1), par{arg1 -> undef136, arg2 -> undef137, arg3 -> undef138, arg4 -> undef139, arg5 -> undef140, arg6 -> undef141, arg7 -> undef142}>
<l9, l9, (arg1 > 2) /\ (arg2 > arg3) /\ (undef145 > 0) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef145, arg3 -> undef147, arg4 -> undef148, arg5 -> undef149, arg6 -> undef150, arg7 -> undef151}>
<l9, l9, (arg1 > 2) /\ (arg2 < arg3) /\ (undef152 > 0) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef152, arg3 -> undef154, arg4 -> undef155, arg5 -> undef156, arg6 -> undef157, arg7 -> undef158}>
<l10, l1, true, par{arg1 -> undef159, arg2 -> undef160, arg3 -> undef161, arg4 -> undef162, arg5 -> undef163, arg6 -> undef164, arg7 -> undef165}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef46, undef47, undef48, undef53, undef54, undef55, undef57, undef60, undef61, undef62, undef67, undef68, undef69, undef74, undef75, undef77, undef79, undef84, undef86, undef89, undef90, undef95, undef96, undef97, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef128, undef129, undef132, undef133, undef134, undef135, undef136, undef137, undef138, undef139, undef140, undef141, undef142, undef143, undef144, undef145, undef147, undef148, undef149, undef150, undef151, undef152, undef154, undef155, undef156, undef157, undef158, undef159, undef160, undef161, undef162, undef163, undef164, undef165, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef46, undef47, undef48, undef53, undef54, undef55, undef57, undef60, undef61, undef62, undef67, undef68, undef69, undef74, undef75, undef77, undef79, undef84, undef86, undef89, undef90, undef95, undef96, undef97, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef128, undef129, undef132, undef133, undef134, undef135, undef136, undef137, undef138, undef139, undef140, undef141, undef142, undef143, undef144, undef145, undef147, undef148, undef149, undef150, undef151, undef152, undef154, undef155, undef156, undef157, undef158, undef159, undef160, undef161, undef162, undef163, undef164, undef165, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l9, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef16 <= undef1) /\ (undef18 >= undef23) /\ ((undef16 - 1) <= undef2) /\ (undef17 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef16 > 0) /\ (undef17 > ~(1)) /\ (undef33 <= undef16) /\ (undef18 >= undef40) /\ (undef33 <= undef17) /\ (undef16 > 0) /\ (undef17 > 0) /\ (undef33 > 0) /\ (undef34 > 1) /\ (undef129 <= undef34) /\ (undef33 > 0) /\ (undef34 > 1) /\ (undef129 > 1) /\ ((undef36 + 2) <= undef34) /\ ((undef35 + 2) <= undef34), par{arg1 -> undef129, arg2 -> 0, arg3 -> undef35, arg4 -> undef132, arg5 -> undef133}>
<l0, l8, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef16 <= undef1) /\ (undef18 >= undef23) /\ ((undef16 - 1) <= undef2) /\ (undef17 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef16 > 0) /\ (undef17 > ~(1)) /\ (undef104 <= undef17) /\ (undef18 >= undef111) /\ (undef16 > 0) /\ (undef17 > 0) /\ (undef104 > 0) /\ (undef105 > ~(1)) /\ ((undef107 + 2) <= undef17) /\ ((undef106 + 2) <= undef17), par{arg1 -> undef104, arg2 -> undef105, arg3 -> undef106, arg4 -> undef107, arg5 -> undef108}>
<l0, l9, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef31 < undef32) /\ (undef31 > ~(1)) /\ (undef24 <= undef1) /\ ((undef24 - 1) <= undef2) /\ (undef25 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef24 > 0) /\ (undef25 > ~(1)) /\ (undef33 <= undef24) /\ ((undef31 + 1) >= undef40) /\ (undef33 <= undef25) /\ (undef24 > 0) /\ (undef25 > 0) /\ (undef33 > 0) /\ (undef34 > 1) /\ (undef129 <= undef34) /\ (undef33 > 0) /\ (undef34 > 1) /\ (undef129 > 1) /\ ((undef36 + 2) <= undef34) /\ ((undef35 + 2) <= undef34), par{arg1 -> undef129, arg2 -> 0, arg3 -> undef35, arg4 -> undef132, arg5 -> undef133}>
<l0, l8, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef31 < undef32) /\ (undef31 > ~(1)) /\ (undef24 <= undef1) /\ ((undef24 - 1) <= undef2) /\ (undef25 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef24 > 0) /\ (undef25 > ~(1)) /\ (undef104 <= undef25) /\ ((undef31 + 1) >= undef111) /\ (undef24 > 0) /\ (undef25 > 0) /\ (undef104 > 0) /\ (undef105 > ~(1)) /\ ((undef107 + 2) <= undef25) /\ ((undef106 + 2) <= undef25), par{arg1 -> undef104, arg2 -> undef105, arg3 -> undef106, arg4 -> undef107, arg5 -> undef108}>
<l0, l8, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef119 < undef120) /\ (undef119 > ~(1)) /\ (undef120 > 0) /\ (undef121 > ~(1)) /\ ((undef119 + 1) <= undef120) /\ (undef112 <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef112 > 0) /\ (undef113 > ~(1)) /\ ((undef115 + 2) <= undef2) /\ ((undef114 + 2) <= undef2), par{arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116}>
<l0, l9, (undef1 <= undef159) /\ (undef160 > ~(1)) /\ (undef159 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef143 < undef144) /\ (undef143 > ~(1)) /\ (undef144 > 0) /\ ((undef143 + 1) <= undef144) /\ (undef137 > ~(1)) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef136 > 1), par{arg1 -> undef136, arg2 -> undef137, arg3 -> undef138, arg4 -> undef139, arg5 -> undef140}>
<l0, l6, ((undef41 + 1) <= undef159) /\ (undef159 > 0) /\ (undef41 > ~(1)) /\ (0 = undef160), par{arg1 -> undef41, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}>
<l0, l6, ((undef48 + 1) <= undef159) /\ (undef160 > 0) /\ (undef159 > 0) /\ (undef48 > ~(1)), par{arg1 -> undef48, arg2 -> 0, arg3 -> 0, arg4 -> undef160, arg5 -> 1}>
<l0, l6, (undef57 > ~(1)) /\ (undef160 > 0) /\ ((undef55 + 1) <= undef159) /\ (undef159 > 0) /\ (undef55 > ~(1)), par{arg1 -> undef55, arg2 -> 0, arg3 -> undef57, arg4 -> undef160, arg5 -> 1}>
<l6, l6, (arg5 >= arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ ((undef62 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef62 > 1), par{arg1 -> undef62, arg2 -> (arg2 + 1)}>
<l6, l6, (arg5 >= arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef69 > 4), par{arg1 -> undef69, arg2 -> (arg2 + 1)}>
<l6, l6, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef79 <= arg1) /\ (arg1 > ~(1)) /\ (undef77 > 1) /\ (undef79 > ~(1)) /\ (undef90 <= undef77) /\ (undef77 > 1) /\ (undef79 > ~(1)) /\ (undef90 > 1) /\ ((0 + 2) <= undef77), par{arg1 -> undef90, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l6, l6, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef79 <= arg1) /\ (arg1 > ~(1)) /\ (undef77 > 1) /\ (undef79 > ~(1)) /\ (undef77 > 2) /\ (undef79 > 0) /\ (undef97 > 4) /\ ((0 + 2) <= undef77), par{arg1 -> undef97, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l6, l6, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef89 > ~(1)) /\ (arg5 > ~(1)) /\ (undef86 <= arg1) /\ (arg1 > ~(1)) /\ (undef84 > 1) /\ (undef86 > ~(1)) /\ (undef90 <= undef84) /\ (undef84 > 1) /\ (undef86 > ~(1)) /\ (undef90 > 1) /\ ((undef89 + 2) <= undef84), par{arg1 -> undef90, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l6, l6, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef89 > ~(1)) /\ (arg5 > ~(1)) /\ (undef86 <= arg1) /\ (arg1 > ~(1)) /\ (undef84 > 1) /\ (undef86 > ~(1)) /\ (undef84 > 2) /\ (undef86 > 0) /\ (undef97 > 4) /\ ((undef89 + 2) <= undef84), par{arg1 -> undef97, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l8, l8, (arg1 > 2) /\ (arg2 > 0) /\ (undef122 > 0) /\ (undef123 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((arg4 + 2) <= arg1), par{arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126}>
<l9, l9, (arg1 > 2) /\ (arg2 > arg3) /\ (undef145 > 0) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef145, arg3 -> undef147, arg4 -> undef148, arg5 -> undef149}>
<l9, l9, (arg1 > 2) /\ (arg2 < arg3) /\ (undef152 > 0) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef152, arg3 -> undef154, arg4 -> undef155, arg5 -> undef156}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef46, undef47, undef48, undef53, undef54, undef55, undef57, undef60, undef61, undef62, undef67, undef68, undef69, undef74, undef75, undef77, undef79, undef84, undef86, undef89, undef90, undef95, undef96, undef97, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef128, undef129, undef132, undef133, undef134, undef135, undef136, undef137, undef138, undef139, undef140, undef141, undef142, undef143, undef144, undef145, undef147, undef148, undef149, undef150, undef151, undef152, undef154, undef155, undef156, undef157, undef158, undef159, undef160, undef161, undef162, undef163, undef164, undef165, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef46, undef47, undef48, undef53, undef54, undef55, undef57, undef60, undef61, undef62, undef67, undef68, undef69, undef74, undef75, undef77, undef79, undef84, undef86, undef89, undef90, undef95, undef96, undef97, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef128, undef129, undef132, undef133, undef134, undef135, undef136, undef137, undef138, undef139, undef140, undef141, undef142, undef143, undef144, undef145, undef147, undef148, undef149, undef150, undef151, undef152, undef154, undef155, undef156, undef157, undef158, undef159, undef160, undef161, undef162, undef163, undef164, undef165, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l6, 1 + arg2 <= arg3 /\ 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 2 <= undef62 /\ undef62 <= 2 + arg1, {arg1 -> undef62, arg2 -> 1 + arg2, rest remain the same}>
<l6, l6, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 5 <= undef69, {arg1 -> undef69, arg2 -> 1 + arg2, rest remain the same}>
<l6, l6, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= arg1 /\ undef79 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ undef90 <= undef77 /\ 0 <= undef79 /\ 2 <= undef77 /\ 2 <= undef90, {arg1 -> undef90, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l6, l6, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef79 /\ 0 <= arg1 /\ undef79 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 5 <= undef97 /\ 3 <= undef77, {arg1 -> undef97, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l6, l6, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= arg1 /\ undef86 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ undef90 <= undef84 /\ 0 <= undef86 /\ 0 <= undef89 /\ 2 <= undef84 /\ 2 + undef89 <= undef84 /\ 2 <= undef90, {arg1 -> undef90, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l6, l6, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef86 /\ 0 <= arg1 /\ undef86 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef89 /\ 2 + undef89 <= undef84 /\ 5 <= undef97 /\ 3 <= undef84, {arg1 -> undef97, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5

Graph 2:
Transitions:
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5

Graph 3:
Transitions:
<l9, l9, 1 + arg3 <= arg2 /\ 1 <= undef145 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef145, arg3 -> undef147, arg4 -> undef148, arg5 -> undef149, rest remain the same}>
<l9, l9, 1 + arg2 <= arg3 /\ 1 <= undef152 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef152, arg3 -> undef154, arg4 -> undef155, arg5 -> undef156, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5

Precedence: 
Graph 0

Graph 1
<l0, l6, 1 + undef41 <= undef159 /\ 1 <= undef159 /\ 0 <= undef41 /\ undef160 = 0, {arg1 -> undef41, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}>
<l0, l6, 1 + undef48 <= undef159 /\ 1 <= undef159 /\ 1 <= undef160 /\ 0 <= undef48, {arg1 -> undef48, arg2 -> 0, arg3 -> 0, arg4 -> undef160, arg5 -> 1, rest remain the same}>
<l0, l6, 1 + undef55 <= undef159 /\ 1 <= undef159 /\ 1 <= undef160 /\ 0 <= undef55 /\ 0 <= undef57, {arg1 -> undef55, arg2 -> 0, arg3 -> undef57, arg4 -> undef160, arg5 -> 1, rest remain the same}>

Graph 2
<l0, l8, 1 <= undef1 /\ 1 <= undef16 /\ 1 <= undef17 /\ 1 <= undef104 /\ 1 <= undef159 /\ undef16 <= 1 + undef2 /\ undef1 <= undef159 /\ undef16 <= undef1 /\ 0 <= undef2 /\ undef17 <= undef2 /\ undef104 <= undef17 /\ undef23 <= undef18 /\ undef111 <= undef18 /\ 0 <= undef105 /\ 0 <= undef160 /\ 2 + undef106 <= undef17 /\ 2 + undef107 <= undef17, {arg1 -> undef104, arg2 -> undef105, arg3 -> undef106, arg4 -> undef107, arg5 -> undef108, rest remain the same}>
<l0, l8, 1 <= undef1 /\ 1 <= undef24 /\ 1 <= undef25 /\ 1 + undef31 <= undef32 /\ 1 <= undef104 /\ 1 <= undef159 /\ undef24 <= 1 + undef2 /\ undef111 <= 1 + undef31 /\ undef1 <= undef159 /\ undef24 <= undef1 /\ 0 <= undef2 /\ undef25 <= undef2 /\ undef104 <= undef25 /\ 0 <= undef31 /\ 0 <= undef105 /\ 0 <= undef160 /\ 2 + undef106 <= undef25 /\ 2 + undef107 <= undef25, {arg1 -> undef104, arg2 -> undef105, arg3 -> undef106, arg4 -> undef107, arg5 -> undef108, rest remain the same}>
<l0, l8, 1 <= undef1 /\ 1 <= undef2 /\ 1 <= undef112 /\ 1 + undef119 <= undef120 /\ 1 <= undef120 /\ 1 <= undef159 /\ undef1 <= undef159 /\ undef112 <= undef2 /\ 0 <= undef113 /\ 0 <= undef119 /\ 0 <= undef121 /\ 0 <= undef160 /\ 2 + undef114 <= undef2 /\ 2 + undef115 <= undef2, {arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116, rest remain the same}>

Graph 3
<l0, l9, 1 <= undef1 /\ 1 <= undef16 /\ 1 <= undef17 /\ 1 <= undef33 /\ 1 <= undef159 /\ undef16 <= 1 + undef2 /\ undef1 <= undef159 /\ undef16 <= undef1 /\ 0 <= undef2 /\ undef17 <= undef2 /\ undef33 <= undef16 /\ undef33 <= undef17 /\ undef23 <= undef18 /\ undef40 <= undef18 /\ undef129 <= undef34 /\ 0 <= undef160 /\ 2 <= undef34 /\ 2 + undef35 <= undef34 /\ 2 + undef36 <= undef34 /\ 2 <= undef129, {arg1 -> undef129, arg2 -> 0, arg3 -> undef35, arg4 -> undef132, arg5 -> undef133, rest remain the same}>
<l0, l9, 1 <= undef1 /\ 1 <= undef24 /\ 1 <= undef25 /\ 1 + undef31 <= undef32 /\ 1 <= undef33 /\ 1 <= undef159 /\ undef24 <= 1 + undef2 /\ undef40 <= 1 + undef31 /\ undef1 <= undef159 /\ undef24 <= undef1 /\ 0 <= undef2 /\ undef25 <= undef2 /\ undef33 <= undef24 /\ undef33 <= undef25 /\ 0 <= undef31 /\ undef129 <= undef34 /\ 0 <= undef160 /\ 2 <= undef34 /\ 2 + undef35 <= undef34 /\ 2 + undef36 <= undef34 /\ 2 <= undef129, {arg1 -> undef129, arg2 -> 0, arg3 -> undef35, arg4 -> undef132, arg5 -> undef133, rest remain the same}>
<l0, l9, 1 <= undef1 /\ 1 <= undef2 /\ 1 + undef143 <= undef144 /\ 1 <= undef144 /\ 1 <= undef159 /\ undef1 <= undef159 /\ 0 <= undef137 /\ 0 <= undef143 /\ 0 <= undef160 /\ 2 <= undef136, {arg1 -> undef136, arg2 -> undef137, arg3 -> undef138, arg4 -> undef139, arg5 -> undef140, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 6 , 1 )
( 8 , 2 )
( 9 , 3 )

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

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

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012977s
Ranking function: -1 - arg2 + arg3
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.00662

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001394s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004459s
[3028 : 3029]
[3028 : 3030]
Successful child: 3029
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3034]
[3028 : 3035]
[3028 : 3036]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: 1 + arg1 <= arg3 , 
Narrowing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001191s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004803s
[3028 : 3037]
[3028 : 3038]
Successful child: 3037
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3042]
[3028 : 3043]
[3028 : 3044]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg2 <= 0 , 
Narrowing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001167s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004854s
[3028 : 3045]
[3028 : 3046]
Successful child: 3045
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3050]
[3028 : 3051]
[3028 : 3052]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 + arg2 <= arg4 , 
Narrowing transition: 
<l8, l8, 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001264s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005849s
[3028 : 3053]
[3028 : 3054]
Successful child: 3053
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3058]
[3028 : 3059]
[3028 : 3060]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 <= 1 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001282s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005873s
[3028 : 3061]
[3028 : 3062]
Successful child: 3061
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3066]
[3028 : 3067]
[3028 : 3068]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 + arg2 <= 1 + arg3 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001364s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006994s
[3028 : 3069]
[3028 : 3070]
Successful child: 3069
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3074]
[3028 : 3075]
[3028 : 3076]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 <= arg4 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001389s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007038s
[3028 : 3077]
[3028 : 3078]
Successful child: 3077
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3082]
[3028 : 3083]
[3028 : 3084]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 <= 1 + arg3 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001388s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007040s
[3028 : 3085]
[3028 : 3086]
Successful child: 3085
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3090]
[3028 : 3091]
[3028 : 3092]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 <= 1 + arg4 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001371s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006983s
[3028 : 3093]
[3028 : 3094]
Successful child: 3093
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
New Graphs: 
[3028 : 3098]
[3028 : 3099]
[3028 : 3100]
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: arg1 <= 2 , 
Narrowing transition: 
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 1 + arg4 <= arg1 + arg2 /\ 1 <= arg2 /\ 1 <= undef122 /\ 0 <= undef123 /\ 2 + arg3 <= arg1 + arg2 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg1 /\ 3 <= arg1, {arg1 -> undef122, arg2 -> undef123, arg3 -> undef124, arg4 -> undef125, arg5 -> undef126, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001372s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007037s
[3028 : 3101]
[3028 : 3102]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021197s
Time used: 0.020426

[3028 : 3106]
[3028 : 3110]
Successful child: 3110

Program does NOT terminate