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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, 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}>
<l3, l2, (undef7 <= arg1) /\ (undef13 > ~(1)) /\ ((undef8 + 1) <= arg1) /\ (arg1 > 0) /\ (undef7 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, arg4 -> undef10, arg5 -> undef11, arg6 -> undef12}>
<l2, l4, (undef14 <= arg1) /\ (undef16 >= undef20) /\ ((undef14 - 1) <= arg2) /\ (undef15 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef14 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef14, arg2 -> undef15, arg3 -> undef16, arg4 -> undef17, arg5 -> undef18, arg6 -> undef19}>
<l4, l5, (undef21 <= arg1) /\ (arg3 >= undef27) /\ (undef21 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > 1), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, arg6 -> undef26}>
<l2, l4, (undef34 < undef35) /\ (undef34 > ~(1)) /\ (undef28 <= arg1) /\ ((undef28 - 1) <= arg2) /\ (undef29 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)), par{arg1 -> undef28, arg2 -> undef29, arg3 -> (undef34 + 1), arg4 -> undef31, arg5 -> undef32, arg6 -> undef33}>
<l5, l6, (undef36 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef36 > 1) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef36, arg2 -> 0, arg3 -> undef38, arg4 -> undef39, arg5 -> undef40, arg6 -> undef41}>
<l2, l6, (undef48 < undef49) /\ (undef48 > ~(1)) /\ (undef49 > 0) /\ ((undef48 + 1) <= undef49) /\ (undef43 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef42 > 1), par{arg1 -> undef42, arg2 -> undef43, arg3 -> undef44, arg4 -> undef45, arg5 -> undef46, arg6 -> undef47}>
<l1, l7, ((undef50 + 1) <= arg1) /\ (arg1 > 0) /\ (undef50 > ~(1)) /\ (0 = arg2), par{arg1 -> undef50, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> undef55}>
<l1, l7, ((undef56 + 1) <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef56 > ~(1)), par{arg1 -> undef56, arg2 -> 0, arg3 -> 0, arg4 -> arg2, arg5 -> 1, arg6 -> undef61}>
<l1, l7, (undef64 > ~(1)) /\ (arg2 > 0) /\ ((undef62 + 1) <= arg1) /\ (arg1 > 0) /\ (undef62 > ~(1)), par{arg1 -> undef62, arg2 -> 0, arg3 -> undef64, arg4 -> arg2, arg5 -> 1, arg6 -> undef67}>
<l7, l7, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > arg2) /\ ((undef68 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef68 > 1), par{arg1 -> undef68, arg2 -> (arg2 + 1), arg6 -> undef73}>
<l7, l7, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg1 > 0) /\ (undef74 > 4), par{arg1 -> undef74, arg2 -> (arg2 + 1), arg6 -> undef79}>
<l7, l8, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef83 <= arg1) /\ (arg1 > ~(1)) /\ (undef81 > 1) /\ (undef83 > ~(1)), par{arg1 -> arg3, arg2 -> undef81, arg3 -> arg2, arg4 -> undef83, arg5 -> arg4, arg6 -> (arg5 + 1)}>
<l7, l8, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef92 > ~(1)) /\ (undef89 <= arg1) /\ (arg1 > ~(1)) /\ (undef87 > 1) /\ (undef89 > ~(1)), par{arg1 -> arg3, arg2 -> undef87, arg3 -> arg2, arg4 -> undef89, arg5 -> arg4, arg6 -> (arg5 + 1)}>
<l8, l7, (undef93 <= arg2) /\ ((undef93 - 2) <= arg4) /\ (arg2 > 1) /\ (arg4 > ~(1)) /\ (undef93 > 1), par{arg1 -> undef93, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef98}>
<l8, l7, (arg2 > 2) /\ (arg4 > 0) /\ (undef99 > 4), par{arg1 -> undef99, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef104}>
<l4, l9, (undef105 <= arg2) /\ (arg3 >= undef111) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef105 > 0) /\ (undef106 > ~(1)) /\ ((undef107 + 2) <= arg2), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, arg5 -> undef109, arg6 -> undef110}>
<l2, l9, (undef118 < undef119) /\ (undef118 > ~(1)) /\ (undef119 > 0) /\ (undef120 > ~(1)) /\ ((undef118 + 1) <= undef119) /\ (undef112 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef112 > 0) /\ (undef113 > ~(1)) /\ ((undef114 + 2) <= arg2), par{arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116, arg6 -> undef117}>
<l9, l9, (arg1 > 2) /\ (arg2 > 0) /\ (undef121 > 0) /\ (undef122 > ~(1)) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, arg6 -> undef126}>
<l6, l6, ((arg2 - 1) < arg2) /\ (arg2 > 0) /\ (arg1 > 2) /\ (undef127 > 0), par{arg1 -> undef127, arg2 -> (arg2 - 1), arg3 -> undef129, arg4 -> undef130, arg5 -> undef131, arg6 -> undef132}>
<l10, l1, true, par{arg1 -> undef133, arg2 -> undef134, arg3 -> undef135, arg4 -> undef136, arg5 -> undef137, arg6 -> undef138}>

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, undef26, undef27, undef28, undef29, undef31, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef55, undef56, undef61, undef62, undef64, undef67, undef68, undef73, undef74, undef79, undef81, undef83, undef87, undef89, undef92, undef93, undef98, undef99, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef129, undef130, undef131, undef132, undef133, undef134, undef135, undef136, undef137, undef138, 

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, undef26, undef27, undef28, undef29, undef31, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef55, undef56, undef61, undef62, undef64, undef67, undef68, undef73, undef74, undef79, undef81, undef83, undef87, undef89, undef92, undef93, undef98, undef99, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef129, undef130, undef131, undef132, undef133, undef134, undef135, undef136, undef137, undef138, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l6, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef14 <= undef1) /\ (undef16 >= undef20) /\ ((undef14 - 1) <= undef2) /\ (undef15 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef14 > 0) /\ (undef15 > ~(1)) /\ (undef21 <= undef14) /\ (undef16 >= undef27) /\ (undef21 <= undef15) /\ (undef14 > 0) /\ (undef15 > 0) /\ (undef21 > 0) /\ (undef22 > 1) /\ (undef36 <= undef22) /\ (undef21 > 0) /\ (undef22 > 1) /\ (undef36 > 1) /\ ((undef23 + 2) <= undef22), par{arg1 -> undef36, arg2 -> 0, arg3 -> undef38, arg4 -> undef39, arg5 -> undef40}>
<l0, l9, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef14 <= undef1) /\ (undef16 >= undef20) /\ ((undef14 - 1) <= undef2) /\ (undef15 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef14 > 0) /\ (undef15 > ~(1)) /\ (undef105 <= undef15) /\ (undef16 >= undef111) /\ (undef14 > 0) /\ (undef15 > 0) /\ (undef105 > 0) /\ (undef106 > ~(1)) /\ ((undef107 + 2) <= undef15), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, arg5 -> undef109}>
<l0, l6, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef34 < undef35) /\ (undef34 > ~(1)) /\ (undef28 <= undef1) /\ ((undef28 - 1) <= undef2) /\ (undef29 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)) /\ (undef21 <= undef28) /\ ((undef34 + 1) >= undef27) /\ (undef21 <= undef29) /\ (undef28 > 0) /\ (undef29 > 0) /\ (undef21 > 0) /\ (undef22 > 1) /\ (undef36 <= undef22) /\ (undef21 > 0) /\ (undef22 > 1) /\ (undef36 > 1) /\ ((undef23 + 2) <= undef22), par{arg1 -> undef36, arg2 -> 0, arg3 -> undef38, arg4 -> undef39, arg5 -> undef40}>
<l0, l9, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef34 < undef35) /\ (undef34 > ~(1)) /\ (undef28 <= undef1) /\ ((undef28 - 1) <= undef2) /\ (undef29 <= undef2) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)) /\ (undef105 <= undef29) /\ ((undef34 + 1) >= undef111) /\ (undef28 > 0) /\ (undef29 > 0) /\ (undef105 > 0) /\ (undef106 > ~(1)) /\ ((undef107 + 2) <= undef29), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, arg5 -> undef109}>
<l0, l6, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef48 < undef49) /\ (undef48 > ~(1)) /\ (undef49 > 0) /\ ((undef48 + 1) <= undef49) /\ (undef43 > ~(1)) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef42 > 1), par{arg1 -> undef42, arg2 -> undef43, arg3 -> undef44, arg4 -> undef45, arg5 -> undef46}>
<l0, l9, (undef1 <= undef133) /\ (undef134 > ~(1)) /\ (undef133 > 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef118 < undef119) /\ (undef118 > ~(1)) /\ (undef119 > 0) /\ (undef120 > ~(1)) /\ ((undef118 + 1) <= undef119) /\ (undef112 <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef112 > 0) /\ (undef113 > ~(1)) /\ ((undef114 + 2) <= undef2), par{arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116}>
<l0, l7, ((undef50 + 1) <= undef133) /\ (undef133 > 0) /\ (undef50 > ~(1)) /\ (0 = undef134), par{arg1 -> undef50, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}>
<l0, l7, ((undef56 + 1) <= undef133) /\ (undef134 > 0) /\ (undef133 > 0) /\ (undef56 > ~(1)), par{arg1 -> undef56, arg2 -> 0, arg3 -> 0, arg4 -> undef134, arg5 -> 1}>
<l0, l7, (undef64 > ~(1)) /\ (undef134 > 0) /\ ((undef62 + 1) <= undef133) /\ (undef133 > 0) /\ (undef62 > ~(1)), par{arg1 -> undef62, arg2 -> 0, arg3 -> undef64, arg4 -> undef134, arg5 -> 1}>
<l6, l6, ((arg2 - 1) < arg2) /\ (arg2 > 0) /\ (arg1 > 2) /\ (undef127 > 0), par{arg1 -> undef127, arg2 -> (arg2 - 1), arg3 -> undef129, arg4 -> undef130, arg5 -> undef131}>
<l7, l7, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > arg2) /\ ((undef68 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef68 > 1), par{arg1 -> undef68, arg2 -> (arg2 + 1)}>
<l7, l7, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > arg2) /\ (arg1 > 0) /\ (undef74 > 4), par{arg1 -> undef74, arg2 -> (arg2 + 1)}>
<l7, l7, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef83 <= arg1) /\ (arg1 > ~(1)) /\ (undef81 > 1) /\ (undef83 > ~(1)) /\ (undef93 <= undef81) /\ ((undef93 - 2) <= undef83) /\ (undef81 > 1) /\ (undef83 > ~(1)) /\ (undef93 > 1), par{arg1 -> undef93, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l7, l7, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef83 <= arg1) /\ (arg1 > ~(1)) /\ (undef81 > 1) /\ (undef83 > ~(1)) /\ (undef81 > 2) /\ (undef83 > 0) /\ (undef99 > 4), par{arg1 -> undef99, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l7, l7, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef92 > ~(1)) /\ (undef89 <= arg1) /\ (arg1 > ~(1)) /\ (undef87 > 1) /\ (undef89 > ~(1)) /\ (undef93 <= undef87) /\ ((undef93 - 2) <= undef89) /\ (undef87 > 1) /\ (undef89 > ~(1)) /\ (undef93 > 1), par{arg1 -> undef93, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l7, l7, (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef92 > ~(1)) /\ (undef89 <= arg1) /\ (arg1 > ~(1)) /\ (undef87 > 1) /\ (undef89 > ~(1)) /\ (undef87 > 2) /\ (undef89 > 0) /\ (undef99 > 4), par{arg1 -> undef99, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}>
<l9, l9, (arg1 > 2) /\ (arg2 > 0) /\ (undef121 > 0) /\ (undef122 > ~(1)) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125}>

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, undef26, undef27, undef28, undef29, undef31, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef55, undef56, undef61, undef62, undef64, undef67, undef68, undef73, undef74, undef79, undef81, undef83, undef87, undef89, undef92, undef93, undef98, undef99, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef129, undef130, undef131, undef132, undef133, undef134, undef135, undef136, undef137, undef138, 

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, undef26, undef27, undef28, undef29, undef31, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef55, undef56, undef61, undef62, undef64, undef67, undef68, undef73, undef74, undef79, undef81, undef83, undef87, undef89, undef92, undef93, undef98, undef99, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, undef125, undef126, undef127, undef129, undef130, undef131, undef132, undef133, undef134, undef135, undef136, undef137, undef138, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, 1 + arg2 <= arg3 /\ 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 2 <= undef68 /\ undef68 <= 2 + arg1, {arg1 -> undef68, arg2 -> 1 + arg2, rest remain the same}>
<l7, l7, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 5 <= undef74, {arg1 -> undef74, arg2 -> 1 + arg2, rest remain the same}>
<l7, l7, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= arg1 /\ undef83 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ undef93 <= undef81 /\ 0 <= undef83 /\ 2 <= undef81 /\ 2 <= undef93 /\ undef93 <= 2 + undef83, {arg1 -> undef93, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l7, l7, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef83 /\ 0 <= arg1 /\ undef83 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 3 <= undef81 /\ 5 <= undef99, {arg1 -> undef99, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l7, l7, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= arg1 /\ undef89 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ undef93 <= undef87 /\ 0 <= undef89 /\ 0 <= undef92 /\ 2 <= undef87 /\ 2 <= undef93 /\ undef93 <= 2 + undef89, {arg1 -> undef93, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
<l7, l7, 1 + arg2 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef89 /\ 0 <= arg1 /\ undef89 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef92 /\ 3 <= undef87 /\ 5 <= undef99, {arg1 -> undef99, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5

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

Graph 3:
Transitions:
<l6, l6, 1 <= arg2 /\ 1 <= undef127 /\ 3 <= arg1, {arg1 -> undef127, arg2 -> -1 + arg2, arg3 -> undef129, arg4 -> undef130, arg5 -> undef131, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5

Precedence: 
Graph 0

Graph 1
<l0, l7, 1 + undef50 <= undef133 /\ 1 <= undef133 /\ 0 <= undef50 /\ undef134 = 0, {arg1 -> undef50, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}>
<l0, l7, 1 + undef56 <= undef133 /\ 1 <= undef133 /\ 1 <= undef134 /\ 0 <= undef56, {arg1 -> undef56, arg2 -> 0, arg3 -> 0, arg4 -> undef134, arg5 -> 1, rest remain the same}>
<l0, l7, 1 + undef62 <= undef133 /\ 1 <= undef133 /\ 1 <= undef134 /\ 0 <= undef62 /\ 0 <= undef64, {arg1 -> undef62, arg2 -> 0, arg3 -> undef64, arg4 -> undef134, arg5 -> 1, rest remain the same}>

Graph 2
<l0, l9, 1 <= undef1 /\ 1 <= undef14 /\ 1 <= undef15 /\ 1 <= undef105 /\ 1 <= undef133 /\ undef14 <= 1 + undef2 /\ undef1 <= undef133 /\ undef14 <= undef1 /\ 0 <= undef2 /\ undef15 <= undef2 /\ undef105 <= undef15 /\ undef20 <= undef16 /\ undef111 <= undef16 /\ 0 <= undef106 /\ 0 <= undef134 /\ 2 + undef107 <= undef15, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, arg5 -> undef109, rest remain the same}>
<l0, l9, 1 <= undef1 /\ 1 <= undef28 /\ 1 <= undef29 /\ 1 + undef34 <= undef35 /\ 1 <= undef105 /\ 1 <= undef133 /\ undef28 <= 1 + undef2 /\ undef111 <= 1 + undef34 /\ undef1 <= undef133 /\ undef28 <= undef1 /\ 0 <= undef2 /\ undef29 <= undef2 /\ undef105 <= undef29 /\ 0 <= undef34 /\ 0 <= undef106 /\ 0 <= undef134 /\ 2 + undef107 <= undef29, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, arg5 -> undef109, rest remain the same}>
<l0, l9, 1 <= undef1 /\ 1 <= undef2 /\ 1 <= undef112 /\ 1 + undef118 <= undef119 /\ 1 <= undef119 /\ 1 <= undef133 /\ undef1 <= undef133 /\ undef112 <= undef2 /\ 0 <= undef113 /\ 0 <= undef118 /\ 0 <= undef120 /\ 0 <= undef134 /\ 2 + undef114 <= undef2, {arg1 -> undef112, arg2 -> undef113, arg3 -> undef114, arg4 -> undef115, arg5 -> undef116, rest remain the same}>

Graph 3
<l0, l6, 1 <= undef1 /\ 1 <= undef14 /\ 1 <= undef15 /\ 1 <= undef21 /\ 1 <= undef133 /\ undef14 <= 1 + undef2 /\ undef1 <= undef133 /\ undef14 <= undef1 /\ 0 <= undef2 /\ undef15 <= undef2 /\ undef21 <= undef14 /\ undef21 <= undef15 /\ undef20 <= undef16 /\ undef27 <= undef16 /\ undef36 <= undef22 /\ 0 <= undef134 /\ 2 <= undef22 /\ 2 + undef23 <= undef22 /\ 2 <= undef36, {arg1 -> undef36, arg2 -> 0, arg3 -> undef38, arg4 -> undef39, arg5 -> undef40, rest remain the same}>
<l0, l6, 1 <= undef1 /\ 1 <= undef21 /\ 1 <= undef28 /\ 1 <= undef29 /\ 1 + undef34 <= undef35 /\ 1 <= undef133 /\ undef28 <= 1 + undef2 /\ undef27 <= 1 + undef34 /\ undef1 <= undef133 /\ undef28 <= undef1 /\ 0 <= undef2 /\ undef29 <= undef2 /\ undef21 <= undef28 /\ undef21 <= undef29 /\ undef36 <= undef22 /\ 0 <= undef34 /\ 0 <= undef134 /\ 2 <= undef22 /\ 2 + undef23 <= undef22 /\ 2 <= undef36, {arg1 -> undef36, arg2 -> 0, arg3 -> undef38, arg4 -> undef39, arg5 -> undef40, rest remain the same}>
<l0, l6, 1 <= undef1 /\ 1 <= undef2 /\ 1 + undef48 <= undef49 /\ 1 <= undef49 /\ 1 <= undef133 /\ undef1 <= undef133 /\ 0 <= undef43 /\ 0 <= undef48 /\ 0 <= undef134 /\ 2 <= undef42, {arg1 -> undef42, arg2 -> undef43, arg3 -> undef44, arg4 -> undef45, arg5 -> undef46, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001276s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004244s
[47685 : 47694]
[47685 : 47695]
Successful child: 47694
[ 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
New Graphs: 
[47685 : 47699]
[47685 : 47700]
[47685 : 47701]
INVARIANTS: 
9: 
Quasi-INVARIANTS to narrow Graph: 
9: arg1 <= arg3 , 
Narrowing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001056s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004546s
[47685 : 47702]
[47685 : 47703]
Successful child: 47702
[ 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
New Graphs: 
[47685 : 47707]
[47685 : 47708]
[47685 : 47709]
INVARIANTS: 
9: 
Quasi-INVARIANTS to narrow Graph: 
9: arg2 <= 0 , 
Narrowing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001039s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004572s
[47685 : 47710]
[47685 : 47711]
Successful child: 47710
[ 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
New Graphs: 
[47685 : 47715]
[47685 : 47716]
[47685 : 47717]
INVARIANTS: 
9: 
Quasi-INVARIANTS to narrow Graph: 
9: arg1 <= 1 + arg3 , 
Narrowing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001049s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004542s
[47685 : 47718]
[47685 : 47719]
Successful child: 47718
[ 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
New Graphs: 
[47685 : 47723]
[47685 : 47724]
[47685 : 47725]
INVARIANTS: 
9: 
Quasi-INVARIANTS to narrow Graph: 
9: arg1 <= 1 , 
Narrowing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001045s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004541s
[47685 : 47726]
[47685 : 47727]
Successful child: 47726
[ 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: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>
New Graphs: 
[47685 : 47731]
[47685 : 47732]
[47685 : 47733]
INVARIANTS: 
9: 
Quasi-INVARIANTS to narrow Graph: 
9: arg1 <= 2 , 
Narrowing transition: 
<l9, l9, 1 <= arg2 /\ 1 <= undef121 /\ 0 <= undef122 /\ 2 + arg3 <= arg1 /\ 3 <= arg1, {arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124, arg5 -> undef125, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001052s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004567s
[47685 : 47734]
[47685 : 47735]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015230s
Time used: 0.014658

[47685 : 47799]
[47685 : 47803]
Successful child: 47803

Program does NOT terminate