/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, l14, true>
<l1, l2, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg3 -> undef3, arg4 -> undef4}>
<l3, l2, (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
<l3, l4, (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (undef10 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
<l5, l4, (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ (undef14 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 1) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14}>
<l2, l6, (undef17 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef17 > 0) /\ (undef18 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
<l7, l6, (undef21 <= arg1) /\ ((undef21 + 1) <= arg2) /\ (undef22 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef21 > 0) /\ (undef22 > 1) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef21, arg2 -> undef22, arg4 -> undef24}>
<l3, l8, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
<l2, l8, (undef33 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
<l4, l8, (arg1 > 0) /\ (undef38 > ~(1)) /\ (arg2 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef34, arg2 -> undef35, arg3 -> undef36, arg4 -> undef37}>
<l8, l9, (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef44 <= arg1) /\ ((undef45 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef44 > 0) /\ (undef45 > 0), par{arg1 -> undef44, arg2 -> undef45, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef52 > 0) /\ (arg4 > ~(1)) /\ (undef48 <= arg1) /\ ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 0) /\ (undef49 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef57 > 0) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef53 > 0) /\ (undef54 > 0), par{arg1 -> undef53, arg2 -> undef54, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef58 > 0) /\ (undef59 > 0), par{arg1 -> undef58, arg2 -> undef59, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ ((undef62 - 2) <= arg1) /\ ((undef62 - 2) <= arg2) /\ ((undef63 - 2) <= arg1) /\ ((undef63 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef62 > 3) /\ (undef63 > 3), par{arg1 -> undef62, arg2 -> undef63, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef70 > 0) /\ (arg4 > ~(1)) /\ ((undef66 - 2) <= arg1) /\ ((undef66 - 2) <= arg2) /\ ((undef67 - 2) <= arg1) /\ ((undef67 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef66 > 3) /\ (undef67 > 3), par{arg1 -> undef66, arg2 -> undef67, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l2, l10, (undef75 > 0) /\ (arg2 > 0) /\ ((undef71 + 1) <= arg1) /\ ((undef72 + 1) <= arg1) /\ ((undef73 + 1) <= arg1) /\ (arg1 > 0) /\ (undef71 > ~(1)) /\ (undef72 > ~(1)) /\ (undef73 > ~(1)), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
<l6, l10, ((undef76 + 1) <= arg1) /\ ((undef76 + 1) <= arg2) /\ (undef77 <= arg2) /\ ((undef78 + 1) <= arg1) /\ ((undef78 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef76 > ~(1)) /\ (undef77 > 0) /\ (undef78 > ~(1)) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79}>
<l4, l10, (undef80 <= arg2) /\ (undef84 > 0) /\ ((undef81 + 1) <= arg1) /\ ((undef81 + 1) <= arg2) /\ (undef82 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef80 > 0) /\ (undef81 > ~(1)) /\ (undef82 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83}>
<l4, l10, (undef85 <= arg2) /\ (undef87 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef85 > 0) /\ (undef86 > 0) /\ (undef87 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88}>
<l10, l11, ((undef89 + 1) <= arg1) /\ ((undef89 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef89 > ~(1)), par{arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92}>
<l10, l12, ((undef94 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)), par{arg1 -> undef93, arg2 -> undef94, arg3 -> undef95, arg4 -> undef96}>
<l10, l12, ((undef98 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > ~(1)), par{arg1 -> undef97, arg2 -> undef98, arg3 -> undef99, arg4 -> undef100}>
<l12, l11, (undef101 <= arg2) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef101 > ~(1)), par{arg1 -> undef101, arg2 -> undef102, arg3 -> undef103, arg4 -> undef104}>
<l12, l10, (undef105 <= arg1) /\ (undef107 <= arg1) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef105 > ~(1)) /\ (undef106 > ~(1)) /\ (undef107 > ~(1)), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108}>
<l12, l10, (undef109 <= arg1) /\ (undef111 <= arg1) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef109 > ~(1)) /\ (undef110 > 0) /\ (undef111 > ~(1)), par{arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112}>
<l11, l13, (undef113 <= arg1) /\ ((undef114 + 1) <= arg1) /\ (arg1 > 0) /\ (undef113 > 0) /\ (undef114 > ~(1)) /\ ((undef115 + 2) <= arg1), par{arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116}>
<l13, l13, ((undef117 + 2) <= arg1) /\ (undef117 <= arg2) /\ ((undef118 + 3) <= arg1) /\ ((undef118 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef117 > 0) /\ (undef118 > ~(1)) /\ ((undef119 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef119 + 2) <= arg2), par{arg1 -> undef117, arg2 -> undef118, arg3 -> undef119, arg4 -> undef120}>
<l14, l3, true, par{arg1 -> undef121, arg2 -> undef122, arg3 -> undef123, arg4 -> undef124}>

Fresh variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Undef variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l10, (undef5 <= undef121) /\ (undef121 > 0) /\ (undef5 > 0) /\ (undef17 <= undef5) /\ (undef6 > 0) /\ (undef5 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ ((undef76 + 1) <= undef17) /\ ((undef76 + 1) <= undef18) /\ (undef77 <= undef18) /\ ((undef78 + 1) <= undef17) /\ ((undef78 + 1) <= undef18) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef76 > ~(1)) /\ (undef77 > 0) /\ (undef78 > ~(1)) /\ ((undef19 + 2) <= undef18), par{arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79}>
<l0, l9, (undef5 <= undef121) /\ (undef121 > 0) /\ (undef5 > 0) /\ (undef33 > ~(1)) /\ (undef6 > 0) /\ (undef5 > 0) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l0, l10, (undef5 <= undef121) /\ (undef121 > 0) /\ (undef5 > 0) /\ (undef75 > 0) /\ (undef6 > 0) /\ ((undef71 + 1) <= undef5) /\ ((undef72 + 1) <= undef5) /\ ((undef73 + 1) <= undef5) /\ (undef5 > 0) /\ (undef71 > ~(1)) /\ (undef72 > ~(1)) /\ (undef73 > ~(1)), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
<l0, l9, (undef121 >= undef9) /\ (undef121 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef9 > 0) /\ (undef38 > ~(1)) /\ (undef10 > 0) /\ ((undef12 + 2) <= undef10) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l0, l10, (undef121 >= undef9) /\ (undef121 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef80 <= undef10) /\ (undef84 > 0) /\ ((undef81 + 1) <= undef9) /\ ((undef81 + 1) <= undef10) /\ (undef82 <= undef10) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef80 > 0) /\ (undef81 > ~(1)) /\ (undef82 > 0) /\ ((undef12 + 2) <= undef10), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83}>
<l0, l10, (undef121 >= undef9) /\ (undef121 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef85 <= undef10) /\ (undef87 <= undef10) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef85 > 0) /\ (undef86 > 0) /\ (undef87 > 0) /\ ((undef12 + 2) <= undef10), par{arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88}>
<l0, l9, (undef121 > 0) /\ (undef122 > ~(1)) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef44 <= arg1) /\ ((undef45 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef44 > 0) /\ (undef45 > 0), par{arg1 -> undef44, arg2 -> undef45, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef52 > 0) /\ (arg4 > ~(1)) /\ (undef48 <= arg1) /\ ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 0) /\ (undef49 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef57 > 0) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef53 > 0) /\ (undef54 > 0), par{arg1 -> undef53, arg2 -> undef54, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef58 > 0) /\ (undef59 > 0), par{arg1 -> undef58, arg2 -> undef59, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ ((undef62 - 2) <= arg1) /\ ((undef62 - 2) <= arg2) /\ ((undef63 - 2) <= arg1) /\ ((undef63 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef62 > 3) /\ (undef63 > 3), par{arg1 -> undef62, arg2 -> undef63, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef70 > 0) /\ (arg4 > ~(1)) /\ ((undef66 - 2) <= arg1) /\ ((undef66 - 2) <= arg2) /\ ((undef67 - 2) <= arg1) /\ ((undef67 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef66 > 3) /\ (undef67 > 3), par{arg1 -> undef66, arg2 -> undef67, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l10, l13, ((undef89 + 1) <= arg1) /\ ((undef89 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef89 > ~(1)) /\ (undef113 <= undef89) /\ ((undef114 + 1) <= undef89) /\ (undef89 > 0) /\ (undef113 > 0) /\ (undef114 > ~(1)) /\ ((undef115 + 2) <= undef89), par{arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116}>
<l10, l13, ((undef94 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef101 <= undef94) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef101 > ~(1)) /\ (undef113 <= undef101) /\ ((undef114 + 1) <= undef101) /\ (undef101 > 0) /\ (undef113 > 0) /\ (undef114 > ~(1)) /\ ((undef115 + 2) <= undef101), par{arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116}>
<l10, l10, ((undef94 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef105 <= undef93) /\ (undef107 <= undef93) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef105 > ~(1)) /\ (undef106 > ~(1)) /\ (undef107 > ~(1)), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108}>
<l10, l10, ((undef94 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef109 <= undef93) /\ (undef111 <= undef93) /\ (undef93 > ~(1)) /\ (undef94 > ~(1)) /\ (undef109 > ~(1)) /\ (undef110 > 0) /\ (undef111 > ~(1)), par{arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112}>
<l10, l13, ((undef98 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > ~(1)) /\ (undef101 <= undef98) /\ (undef97 > ~(1)) /\ (undef98 > ~(1)) /\ (undef101 > ~(1)) /\ (undef113 <= undef101) /\ ((undef114 + 1) <= undef101) /\ (undef101 > 0) /\ (undef113 > 0) /\ (undef114 > ~(1)) /\ ((undef115 + 2) <= undef101), par{arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116}>
<l10, l10, ((undef98 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > ~(1)) /\ (undef105 <= undef97) /\ (undef107 <= undef97) /\ (undef97 > ~(1)) /\ (undef98 > ~(1)) /\ (undef105 > ~(1)) /\ (undef106 > ~(1)) /\ (undef107 > ~(1)), par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108}>
<l10, l10, ((undef98 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > ~(1)) /\ (undef109 <= undef97) /\ (undef111 <= undef97) /\ (undef97 > ~(1)) /\ (undef98 > ~(1)) /\ (undef109 > ~(1)) /\ (undef110 > 0) /\ (undef111 > ~(1)), par{arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112}>
<l13, l13, ((undef117 + 2) <= arg1) /\ (undef117 <= arg2) /\ ((undef118 + 3) <= arg1) /\ ((undef118 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef117 > 0) /\ (undef118 > ~(1)) /\ ((undef119 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef119 + 2) <= arg2), par{arg1 -> undef117, arg2 -> undef118, arg3 -> undef119, arg4 -> undef120}>

Fresh variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Undef variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l9, l9, undef44 <= arg1 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef44 /\ 1 <= undef45 /\ 2 + undef45 <= arg2 /\ 3 <= arg2, {arg1 -> undef44, arg2 -> undef45, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, undef48 <= arg1 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef52 /\ 2 + undef49 <= arg2 /\ 3 <= arg2, {arg1 -> undef48, arg2 -> undef49, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef53 /\ 1 <= undef54 /\ 1 <= undef57 /\ 2 <= arg2, {arg1 -> undef53, arg2 -> undef54, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef58 /\ 1 <= undef59 /\ 2 <= arg2, {arg1 -> undef58, arg2 -> undef59, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg3 /\ 2 <= arg1 /\ 2 <= arg2 /\ 4 <= undef62 /\ 4 <= undef63 /\ undef62 <= 2 + arg1 /\ undef63 <= 2 + arg1 /\ undef62 <= 2 + arg2 /\ undef63 <= 2 + arg2, {arg1 -> undef62, arg2 -> undef63, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg3 /\ 1 <= undef70 /\ 2 <= arg1 /\ 2 <= arg2 /\ 4 <= undef66 /\ 4 <= undef67 /\ undef66 <= 2 + arg1 /\ undef67 <= 2 + arg1 /\ undef66 <= 2 + arg2 /\ undef67 <= 2 + arg2, {arg1 -> undef66, arg2 -> undef67, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 2:
Transitions:
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 3:
Transitions:
<l13, l13, undef117 <= arg2 /\ 0 <= undef118 /\ 1 <= arg2 /\ 1 + undef118 <= arg2 /\ 1 <= undef117 /\ 2 + arg3 <= arg1 /\ 2 + undef117 <= arg1 /\ 2 + undef119 <= arg2 /\ 3 <= arg1 /\ 3 + undef118 <= arg1 /\ 4 + undef119 <= arg1, {arg1 -> undef117, arg2 -> undef118, arg3 -> undef119, arg4 -> undef120, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Precedence: 
Graph 0

Graph 1
<l0, l9, undef5 <= undef121 /\ 0 <= undef33 /\ 0 <= undef43 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef41 /\ 1 <= undef121 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>
<l0, l9, undef9 <= undef121 /\ 0 <= undef38 /\ 0 <= undef43 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef41 /\ 1 <= undef121 /\ 2 + undef12 <= undef10 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>
<l0, l9, 0 <= undef43 /\ 0 <= undef122 /\ 1 <= undef41 /\ 1 <= undef121 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>

Graph 2
<l0, l10, undef5 <= undef121 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef121 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef121 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef121, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef121 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef121 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef121 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef121 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

Graph 3
<l10, l13, undef113 <= undef89 /\ 0 <= undef114 /\ 1 <= arg1 /\ 1 + undef89 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 + undef89 <= arg3 /\ 1 <= undef89 /\ 1 + undef114 <= undef89 /\ 1 <= undef113 /\ 2 + undef115 <= undef89, {arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116, rest remain the same}>
<l10, l13, 0 <= undef93 /\ 0 <= undef94 /\ undef101 <= undef94 /\ undef113 <= undef101 /\ 0 <= undef114 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef101 /\ 1 + undef114 <= undef101 /\ 1 <= undef113 /\ 2 + undef115 <= undef101, {arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116, rest remain the same}>
<l10, l13, 0 <= undef98 /\ undef101 <= undef98 /\ undef113 <= undef101 /\ 0 <= undef114 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef101 /\ 1 + undef114 <= undef101 /\ 1 <= undef113 /\ 2 + undef115 <= undef101, {arg1 -> undef113, arg2 -> undef114, arg3 -> undef115, arg4 -> undef116, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 9 , 1 )
( 10 , 2 )
( 13 , 3 )

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

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

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006584s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.049180s
[13803 : 13858]
[13803 : 13859]
Successful child: 13858
[ 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
New Graphs: 
[13803 : 13890]
[13803 : 13891]
[13803 : 13892]
[13803 : 13893]
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg1 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005902s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.047066s
[13803 : 13894]
[13803 : 13895]
Successful child: 13894
[ 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
New Graphs: 
[13803 : 13899]
[13803 : 13900]
[13803 : 13901]
[13803 : 13902]
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg3 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005855s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.047173s
[13803 : 13903]
[13803 : 13904]
Successful child: 13903
[ 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
New Graphs: 
[13803 : 13911]
[13803 : 13912]
[13803 : 13913]
[13803 : 13914]
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg1 + arg2 <= 1 , 
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006753s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.046386s
[13803 : 13915]
[13803 : 13916]
Successful child: 13915
[ 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, 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: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
New Graphs: 
[13803 : 14060]
[13803 : 14061]
[13803 : 14062]
[13803 : 14063]
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg2 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef93 /\ undef105 <= undef93 /\ undef107 <= undef93 /\ 0 <= undef94 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, 0 <= undef93 /\ undef109 <= undef93 /\ undef111 <= undef93 /\ 0 <= undef94 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef94 <= arg2 /\ 1 <= arg3 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
<l10, l10, undef105 <= undef97 /\ undef107 <= undef97 /\ 0 <= undef98 /\ 0 <= undef105 /\ 0 <= undef106 /\ 0 <= undef107 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 2 <= arg1 + arg2, {arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108, rest remain the same}>
<l10, l10, undef109 <= undef97 /\ undef111 <= undef97 /\ 0 <= undef98 /\ 0 <= undef109 /\ 0 <= undef111 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef98 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef110 /\ 2 <= arg1 + arg2, {arg1 -> undef109, arg2 -> undef110, arg3 -> undef111, arg4 -> undef112, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007190s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.047055s
[13803 : 14071]
[13803 : 14072]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.095296s
Time used: 0.089424

[13803 : 14076]
[13803 : 14077]
Successful child: 14077

Program does NOT terminate