2.07/2.08	NO
2.07/2.08	
2.07/2.08	Solver Timeout: 4
2.07/2.08	Global Timeout: 300
2.07/2.08	No parsing errors!
2.07/2.08	Init Location: 0
2.07/2.08	Transitions:
2.07/2.08	<l0, l6, true>
2.07/2.08	<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
2.07/2.08	<l2, l3, (undef8 > ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}>
2.07/2.08	<l1, l2, (undef13 > ~(1)) /\ (arg2 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (arg1 > 0)>
2.07/2.08	<l2, l4, (undef16 > ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> undef16, arg2 -> undef17}>
2.07/2.08	<l4, l5, (0 = arg1), par{arg1 -> 0, arg2 -> undef21}>
2.07/2.08	<l4, l5, (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1), arg2 -> undef23}>
2.07/2.08	<l3, l5, (arg1 < 1) /\ (arg1 < 6) /\ (arg1 > ~(6)), par{arg2 -> undef25}>
2.07/2.08	<l5, l4, (arg1 > ~(1)), par{arg2 -> undef27}>
2.07/2.08	<l5, l3, (arg1 < 0), par{arg1 -> (arg1 + 1), arg2 -> undef29}>
2.07/2.08	<l6, l1, true, par{arg1 -> undef30, arg2 -> undef31}>
2.07/2.08	
2.07/2.08	Fresh variables:
2.07/2.08	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 
2.07/2.08	
2.07/2.08	Undef variables:
2.07/2.08	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 
2.07/2.08	
2.07/2.08	Abstraction variables:
2.07/2.08	
2.07/2.08	Exit nodes:
2.07/2.08	
2.07/2.08	Accepting locations:
2.07/2.08	
2.07/2.08	Asserts:
2.07/2.08	
2.07/2.08	Preprocessed LLVMGraph
2.07/2.08	Init Location: 0
2.07/2.08	Transitions:
2.07/2.08	<l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}>
2.07/2.08	<l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}>
2.07/2.08	<l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}>
2.07/2.08	<l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}>
2.07/2.08	<l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}>
2.07/2.08	<l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}>
2.07/2.08	<l5, l5, (arg1 > ~(1)) /\ (0 = arg1), par{arg1 -> 0}>
2.07/2.08	<l5, l5, (arg1 > ~(1)) /\ (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1)}>
2.07/2.08	<l5, l5, (arg1 < 0) /\ ((arg1 + 1) < 1) /\ ((arg1 + 1) < 6) /\ ((arg1 + 1) > ~(6)), par{arg1 -> (arg1 + 1)}>
2.07/2.08	
2.07/2.08	Fresh variables:
2.07/2.08	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 
2.07/2.08	
2.07/2.08	Undef variables:
2.07/2.08	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 
2.07/2.08	
2.07/2.08	Abstraction variables:
2.07/2.08	
2.07/2.08	Exit nodes:
2.07/2.08	
2.07/2.08	Accepting locations:
2.07/2.08	
2.07/2.08	Asserts:
2.07/2.08	
2.07/2.08	*************************************************************
2.07/2.08	*******************************************************************************************
2.07/2.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
2.07/2.08	*******************************************************************************************
2.07/2.08	
2.07/2.08	Init Location: 0
2.07/2.08	Graph 0:
2.07/2.08	Transitions:
2.07/2.08	Variables:
2.07/2.08	
2.07/2.08	Graph 1:
2.07/2.08	Transitions:
2.07/2.08	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	<l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}>
2.07/2.08	<l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
2.07/2.08	Variables:
2.07/2.08	arg1
2.07/2.08	
2.07/2.08	Precedence: 
2.07/2.08	Graph 0
2.07/2.08	
2.07/2.08	Graph 1
2.07/2.08	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.08	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.08	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.08	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.08	
2.07/2.08	Map Locations to Subgraph:
2.07/2.08	( 0 , 0 )
2.07/2.08	( 5 , 1 )
2.07/2.08	
2.07/2.08	*******************************************************************************************
2.07/2.08	********************************    CHECKING ASSERTIONS    ********************************
2.07/2.08	*******************************************************************************************
2.07/2.08	
2.07/2.08	Proving termination of subgraph 0
2.07/2.08	Proving termination of subgraph 1
2.07/2.08	Checking unfeasibility...
2.07/2.08	Time used: 0.007539
2.07/2.08	
2.07/2.08	Checking conditional termination of SCC {l5}...
2.07/2.08	
2.07/2.08	LOG: CALL solveLinear
2.07/2.08	
2.07/2.08	LOG: RETURN solveLinear - Elapsed time: 0.001100s
2.07/2.08	
2.07/2.08	LOG: CALL solveLinear
2.07/2.08	
2.07/2.08	LOG: RETURN solveLinear - Elapsed time: 0.014332s
2.07/2.08	Trying to remove transition: <l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
2.07/2.08	Solving with 1 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007840s
2.07/2.08	Time used: 0.007606
2.07/2.08	
2.07/2.08	LOG: SAT solveNonLinear - Elapsed time: 0.007840s
2.07/2.08	Cost: 0; Total time: 0.007606
2.07/2.08	Termination implied by a set of quasi-invariant(s):
2.07/2.08	Quasi-invariant at l5: arg1 <= 0
2.07/2.08	Ranking function: -arg1
2.07/2.08	Ranking function and negation of Quasi-Invariant applied
2.07/2.08	New Graphs: 
2.07/2.08	Transitions:
2.07/2.08	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	<l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}>
2.07/2.08	Variables:
2.07/2.08	arg1
2.07/2.08	Checking conditional termination of SCC {l5}...
2.07/2.08	
2.07/2.08	LOG: CALL solveLinear
2.07/2.08	
2.07/2.08	LOG: RETURN solveLinear - Elapsed time: 0.000883s
2.07/2.08	Ranking function: -1 + arg1
2.07/2.08	New Graphs: 
2.07/2.08	Transitions:
2.07/2.08	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	Variables:
2.07/2.08	arg1
2.07/2.08	Checking conditional termination of SCC {l5}...
2.07/2.08	
2.07/2.08	LOG: CALL solveLinear
2.07/2.08	
2.07/2.08	LOG: RETURN solveLinear - Elapsed time: 0.000343s
2.07/2.08	
2.07/2.08	LOG: CALL solveLinear
2.07/2.08	
2.07/2.08	LOG: RETURN solveLinear - Elapsed time: 0.000880s
2.07/2.08	Trying to remove transition: <l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.08	Solving with 1 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002437s
2.07/2.08	Time used: 0.002322
2.07/2.08	Solving with 1 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064403s
2.07/2.08	Time used: 0.064182
2.07/2.08	Solving with 2 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.742492s
2.07/2.08	Time used: 0.741836
2.07/2.08	Solving with 3 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005043s
2.07/2.08	Time used: 1.00063
2.07/2.08	Solving with 1 template(s).
2.07/2.08	
2.07/2.08	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.08	
2.07/2.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015404s
2.07/2.08	Time used: 0.008471
2.07/2.08	Termination failed. Trying to show unreachability...
2.07/2.08	Proving unreachability of entry: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	
2.07/2.09	LOG: CALL check - Post:1 <= 0 - Process 1
2.07/2.09	* Exit transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	* Postcondition  : 1 <= 0
2.07/2.09	
2.07/2.09	LOG: CALL solveLinear
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear - Elapsed time: 0.001237s
2.07/2.09	> Postcondition is not implied!
2.07/2.09	
2.07/2.09	LOG: RETURN check - Elapsed time: 0.001392s
2.07/2.09	Cannot prove unreachability
2.07/2.09	
2.07/2.09	Proving non-termination of subgraph 1
2.07/2.09	Transitions:
2.07/2.09	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}>
2.07/2.09	<l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
2.07/2.09	Variables:
2.07/2.09	arg1
2.07/2.09	
2.07/2.09	Checking conditional non-termination of SCC {l5}...
2.07/2.09	EXIT TRANSITIONS:
2.07/2.09	<l5, end, 6 <= arg1, {all remain the same}>
2.07/2.09	<l5, end, 7 + arg1 <= 0, {all remain the same}>
2.07/2.09	
2.07/2.09	Solving with 1 template(s).
2.07/2.09	
2.07/2.09	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.09	
2.07/2.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011528s
2.07/2.09	Time used: 0.011231
2.07/2.09	Improving Solution with cost 3 ...
2.07/2.09	
2.07/2.09	LOG: CALL solveNonLinearGetNextSolution
2.07/2.09	
2.07/2.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021215s
2.07/2.09	Time used: 0.021208
2.07/2.09	Improving Solution with cost 1 ...
2.07/2.09	
2.07/2.09	LOG: CALL solveNonLinearGetNextSolution
2.07/2.09	
2.07/2.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018491s
2.07/2.09	Time used: 0.018484
2.07/2.09	
2.07/2.09	LOG: SAT solveNonLinear - Elapsed time: 0.051234s
2.07/2.09	Cost: 1; Total time: 0.050923
2.07/2.09	Non-termination implied by a set of quasi-invariant(s):
2.07/2.09	Quasi-invariant at l5: arg1 <= 5
2.07/2.09	
2.07/2.09	Strengthening and disabling EXIT transitions...
2.07/2.09	Closed exits from l5: 1
2.07/2.09	Strengthening exit transition (result): 
2.07/2.09	<l5, end, 7 + arg1 <= 0, {all remain the same}>
2.07/2.09	
2.07/2.09	Strengthening and disabling transitions...
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}>
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
2.07/2.09	
2.07/2.09	Checking conditional non-termination of SCC {l5}...
2.07/2.09	EXIT TRANSITIONS:
2.07/2.09	<l5, end, 7 + arg1 <= 0, {all remain the same}>
2.07/2.09	
2.07/2.09	Solving with 1 template(s).
2.07/2.09	
2.07/2.09	LOG: CALL solveNonLinearGetFirstSolution
2.07/2.09	
2.07/2.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009631s
2.07/2.09	Time used: 0.00934
2.07/2.09	Improving Solution with cost 2 ...
2.07/2.09	
2.07/2.09	LOG: CALL solveNonLinearGetNextSolution
2.07/2.09	
2.07/2.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014649s
2.07/2.09	Time used: 0.014642
2.07/2.09	
2.07/2.09	LOG: SAT solveNonLinear - Elapsed time: 0.024280s
2.07/2.09	Cost: 0; Total time: 0.023982
2.07/2.09	Non-termination implied by a set of quasi-invariant(s):
2.07/2.09	Quasi-invariant at l5: 0 <= 5 + arg1
2.07/2.09	
2.07/2.09	Strengthening and disabling EXIT transitions...
2.07/2.09	Closed exits from l5: 1
2.07/2.09	
2.07/2.09	Strengthening and disabling transitions...
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}>
2.07/2.09	
2.07/2.09	LOG: CALL solverLinear in Graph for feasibility
2.07/2.09	
2.07/2.09	LOG: RETURN solveLinear in Graph for feasibility
2.07/2.09	Strengthening transition (result): 
2.07/2.09	<l5, l5, 1 + arg1 <= 0 /\ 0 <= 5 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
2.07/2.09	
2.07/2.09	Calling reachability with...
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l5, end, true, {all remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	OPEN EXITS: 
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	<l5, end, arg1 <= 5 /\ 0 <= 5 + arg1, {all remain the same}>
2.07/2.09	
2.07/2.09	--- Reachability graph ---
2.07/2.09	> Graph without transitions.
2.07/2.09	
2.07/2.09	Calling reachability with...
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	Transition: <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	Conditions: arg1 <= 5, 0 <= 5 + arg1, 
2.07/2.09	OPEN EXITS: 
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}>
2.07/2.09	<l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}>
2.07/2.09	
2.07/2.09	> Conditions are reachable!
2.07/2.09	
2.07/2.09	Program does NOT terminate
2.07/2.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
2.07/2.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
2.07/2.09	EOF