64.09/64.16	NO
64.09/64.16	
64.09/64.16	Solver Timeout: 4
64.09/64.16	Global Timeout: 300
64.09/64.16	No parsing errors!
64.09/64.16	Init Location: 0
64.09/64.16	Transitions:
64.09/64.16	<l0, l4, true>
64.09/64.16	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}>
64.09/64.16	<l2, l3, (arg1 < 10), par{arg2 -> arg1, arg3 -> arg1}>
64.09/64.16	<l3, l2, (0 = arg2) /\ (0 = arg3), par{arg1 -> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}>
64.09/64.16	<l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
64.09/64.16	<l4, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}>
64.09/64.16	
64.09/64.16	Fresh variables:
64.09/64.16	undef2, undef3, undef8, undef9, undef13, undef14, undef15, 
64.09/64.16	
64.09/64.16	Undef variables:
64.09/64.16	undef2, undef3, undef8, undef9, undef13, undef14, undef15, 
64.09/64.16	
64.09/64.16	Abstraction variables:
64.09/64.16	
64.09/64.16	Exit nodes:
64.09/64.16	
64.09/64.16	Accepting locations:
64.09/64.16	
64.09/64.16	Asserts:
64.09/64.16	
64.09/64.16	Preprocessed LLVMGraph
64.09/64.16	Init Location: 0
64.09/64.16	Transitions:
64.09/64.16	<l0, l3, (arg1 = undef14) /\ (arg2 = undef14) /\ (arg3 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)>
64.09/64.16	<l3, l3, (0 = arg2) /\ (0 = arg3) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}>
64.09/64.16	<l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
64.09/64.16	
64.09/64.16	Fresh variables:
64.09/64.16	undef2, undef3, undef8, undef9, undef13, undef14, undef15, 
64.09/64.16	
64.09/64.16	Undef variables:
64.09/64.16	undef2, undef3, undef8, undef9, undef13, undef14, undef15, 
64.09/64.16	
64.09/64.16	Abstraction variables:
64.09/64.16	
64.09/64.16	Exit nodes:
64.09/64.16	
64.09/64.16	Accepting locations:
64.09/64.16	
64.09/64.16	Asserts:
64.09/64.16	
64.09/64.16	*************************************************************
64.09/64.16	*******************************************************************************************
64.09/64.16	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
64.09/64.16	*******************************************************************************************
64.09/64.16	
64.09/64.16	Init Location: 0
64.09/64.16	Graph 0:
64.09/64.16	Transitions:
64.09/64.16	Variables:
64.09/64.16	
64.09/64.16	Graph 1:
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg1, arg2, arg3
64.09/64.16	
64.09/64.16	Precedence: 
64.09/64.16	Graph 0
64.09/64.16	
64.09/64.16	Graph 1
64.09/64.16	<l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}>
64.09/64.16	
64.09/64.16	Map Locations to Subgraph:
64.09/64.16	( 0 , 0 )
64.09/64.16	( 3 , 1 )
64.09/64.16	
64.09/64.16	*******************************************************************************************
64.09/64.16	********************************    CHECKING ASSERTIONS    ********************************
64.09/64.16	*******************************************************************************************
64.09/64.16	
64.09/64.16	Proving termination of subgraph 0
64.09/64.16	Proving termination of subgraph 1
64.09/64.16	Checking unfeasibility...
64.09/64.16	Time used: 0.005417
64.09/64.16	
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.001380s
64.09/64.16	Ranking function: 8 - arg1
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.000506s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.001727s
64.09/64.16	Trying to remove transition: <l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006751s
64.09/64.16	Time used: 0.00659
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000783s
64.09/64.16	Time used: 4.00012
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013668s
64.09/64.16	Time used: 4.00021
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017356s
64.09/64.16	Time used: 1.0001
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019446s
64.09/64.16	Time used: 0.013246
64.09/64.16	Improving Solution with cost 1 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000441s
64.09/64.16	Time used: 1.00034
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 1.019887s
64.09/64.16	Cost: 1; Total time: 1.01358
64.09/64.16	Termination implied by a set of invariant(s):
64.09/64.16	Invariant at l3: 0 <= arg1 + arg2
64.09/64.16	[ Invariant Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	[ Termination Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Quasi-ranking function: 50000 - arg2
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.000619s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.002345s
64.09/64.16	Trying to remove transition: <l3, l3, 0 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007954s
64.09/64.16	Time used: 0.007803
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001374s
64.09/64.16	Time used: 4.00072
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008044s
64.09/64.16	Time used: 4.00058
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007437s
64.09/64.16	Time used: 1.0003
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021549s
64.09/64.16	Time used: 0.014023
64.09/64.16	Improving Solution with cost 1 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001405s
64.09/64.16	Time used: 1.00071
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 1.022954s
64.09/64.16	Cost: 1; Total time: 1.01473
64.09/64.16	Termination implied by a set of invariant(s):
64.09/64.16	Invariant at l3: arg2 <= arg3
64.09/64.16	[ Invariant Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ arg2 <= arg3 /\ arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	[ Termination Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Quasi-ranking function: 50000 - arg3
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.000706s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.002697s
64.09/64.16	Trying to remove transition: <l3, l3, 0 <= arg1 + arg2 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008245s
64.09/64.16	Time used: 0.008083
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001684s
64.09/64.16	Time used: 4.00104
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008102s
64.09/64.16	Time used: 4.0009
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007848s
64.09/64.16	Time used: 1.00008
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024319s
64.09/64.16	Time used: 0.016705
64.09/64.16	Improving Solution with cost 1 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000690s
64.09/64.16	Time used: 1.00059
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 1.025009s
64.09/64.16	Cost: 1; Total time: 1.01729
64.09/64.16	Termination implied by a set of invariant(s):
64.09/64.16	Invariant at l3: 0 <= 1 + arg1 + arg3
64.09/64.16	[ Invariant Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= 1 + arg1 + arg3 /\ arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ 0 <= 1 + arg1 + arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	[ Termination Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Quasi-ranking function: 50000 + arg2 - 2*arg3
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.000903s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.003863s
64.09/64.16	Trying to remove transition: <l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009202s
64.09/64.16	Time used: 0.009006
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002085s
64.09/64.16	Time used: 4.00115
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009022s
64.09/64.16	Time used: 4.00076
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007329s
64.09/64.16	Time used: 1.00005
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025679s
64.09/64.16	Time used: 0.017668
64.09/64.16	Improving Solution with cost 1 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000989s
64.09/64.16	Time used: 1.00085
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 1.026668s
64.09/64.16	Cost: 1; Total time: 1.01852
64.09/64.16	Termination implied by a set of invariant(s):
64.09/64.16	Invariant at l3: arg2 <= arg3
64.09/64.16	[ Invariant Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= 1 + arg1 + arg3 /\ arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ 0 <= 1 + arg1 + arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	[ Termination Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Quasi-ranking function: 50000 - 2*arg2 + arg3
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 + arg3 <= 2*arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.000987s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.004229s
64.09/64.16	Trying to remove transition: <l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 + arg3 <= 2*arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009712s
64.09/64.16	Time used: 0.009513
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002473s
64.09/64.16	Time used: 4.00154
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007994s
64.09/64.16	Time used: 4.00073
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007160s
64.09/64.16	Time used: 1.00041
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027767s
64.09/64.16	Time used: 0.019941
64.09/64.16	Improving Solution with cost 1 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000991s
64.09/64.16	Time used: 1.0009
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 1.028759s
64.09/64.16	Cost: 1; Total time: 1.02084
64.09/64.16	Termination implied by a set of invariant(s):
64.09/64.16	Invariant at l3: 0 <= arg1 + arg2
64.09/64.16	[ Invariant Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ arg2 <= arg3 /\ 0 <= 1 + arg1 + arg3 /\ arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 1 <= arg2 /\ 0 <= 1 + arg1 + arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	[ Termination Graph ]
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 + arg3 <= 2*arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Quasi-ranking function: 50000 - arg2 - arg3
64.09/64.16	New Graphs: 
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 <= arg2 + arg3 /\ 50001 + arg3 <= 2*arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg2, arg3
64.09/64.16	Checking conditional termination of SCC {l3}...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.001115s
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.004542s
64.09/64.16	Trying to remove transition: <l3, l3, 0 <= arg1 + arg2 /\ 0 <= 1 + arg1 + arg3 /\ 50001 + arg2 <= 2*arg3 /\ 50001 <= arg2 /\ 50001 <= arg2 + arg3 /\ 50001 + arg3 <= 2*arg2 /\ 50001 <= arg3 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010200s
64.09/64.16	Time used: 0.009999
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003638s
64.09/64.16	Time used: 4.00269
64.09/64.16	Solving with 2 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007829s
64.09/64.16	Time used: 4.00085
64.09/64.16	Solving with 3 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007729s
64.09/64.16	Time used: 1.00015
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009976s
64.09/64.16	Time used: 4.0019
64.09/64.16	Termination failed. Trying to show unreachability...
64.09/64.16	Proving unreachability of entry: <l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL check - Post:1 <= 0 - Process 1
64.09/64.16	* Exit transition: <l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}>
64.09/64.16	* Postcondition  : 1 <= 0
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.009193s
64.09/64.16	> Postcondition is not implied!
64.09/64.16	
64.09/64.16	LOG: RETURN check - Elapsed time: 0.009342s
64.09/64.16	Cannot prove unreachability
64.09/64.16	
64.09/64.16	Proving non-termination of subgraph 1
64.09/64.16	Transitions:
64.09/64.16	<l3, l3, arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	Variables:
64.09/64.16	arg1, arg2, arg3
64.09/64.16	
64.09/64.16	Checking conditional non-termination of SCC {l3}...
64.09/64.16	EXIT TRANSITIONS:
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 9 <= arg1 /\ arg2 = 0, {all remain the same}>
64.09/64.16	<l3, end, 9 <= arg1 /\ arg2 = 0 /\ arg2 = arg3 /\ arg3 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg3 <= arg2 /\ 1 + arg3 <= 0 /\ 9 <= arg1 /\ arg2 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg2 <= arg3 /\ 9 <= arg1 /\ arg3 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg3 <= arg2 /\ 1 + arg3 <= 0 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 1 + arg3 <= 0 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg3 /\ arg1 <= 8 /\ arg2 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg3 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 8 /\ arg2 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg2 <= arg3 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg2 <= arg3 /\ arg1 <= 8 /\ arg3 = 0, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= 0 /\ 1 + arg3 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.191696s
64.09/64.16	Time used: 0.191121
64.09/64.16	Improving Solution with cost 7 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.265795s
64.09/64.16	Time used: 0.265765
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 0.457491s
64.09/64.16	Cost: 7; Total time: 0.456886
64.09/64.16	Failed at location 3: 1 <= arg2
64.09/64.16	Before Improving: 
64.09/64.16	Quasi-invariant at l3: 1 <= arg2
64.09/64.16	Optimizing invariants...
64.09/64.16	
64.09/64.16	LOG: CALL solveLinear
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear - Elapsed time: 0.017221s
64.09/64.16	Remaining time after improvement: 0.995694
64.09/64.16	Non-termination implied by a set of quasi-invariant(s):
64.09/64.16	Quasi-invariant at l3: 1 <= arg2
64.09/64.16	
64.09/64.16	Strengthening and disabling EXIT transitions...
64.09/64.16	Closed exits from l3: 13
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	It's unfeasible. Removing transition: 
64.09/64.16	<l3, l3, arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}>
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	
64.09/64.16	Checking conditional non-termination of SCC {l3}...
64.09/64.16	EXIT TRANSITIONS:
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 <= arg2 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	<l3, end, arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= arg2 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034757s
64.09/64.16	Time used: 0.034451
64.09/64.16	Improving Solution with cost 2 ...
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetNextSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029223s
64.09/64.16	Time used: 0.029214
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 0.063980s
64.09/64.16	Cost: 2; Total time: 0.063665
64.09/64.16	Non-termination implied by a set of quasi-invariant(s):
64.09/64.16	Quasi-invariant at l3: arg2 <= arg3
64.09/64.16	
64.09/64.16	Strengthening and disabling EXIT transitions...
64.09/64.16	Closed exits from l3: 4
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	Strengthening exit transition (result): 
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	
64.09/64.16	Checking conditional non-termination of SCC {l3}...
64.09/64.16	EXIT TRANSITIONS:
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ 9 <= arg1, {all remain the same}>
64.09/64.16	<l3, end, 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 1 <= arg3 /\ arg1 <= 8, {all remain the same}>
64.09/64.16	
64.09/64.16	Solving with 1 template(s).
64.09/64.16	
64.09/64.16	LOG: CALL solveNonLinearGetFirstSolution
64.09/64.16	
64.09/64.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014530s
64.09/64.16	Time used: 0.014425
64.09/64.16	
64.09/64.16	LOG: SAT solveNonLinear - Elapsed time: 0.014530s
64.09/64.16	Cost: 0; Total time: 0.014425
64.09/64.16	Non-termination implied by a set of quasi-invariant(s):
64.09/64.16	Quasi-invariant at l3: arg3 <= arg2
64.09/64.16	
64.09/64.16	Strengthening and disabling EXIT transitions...
64.09/64.16	Closed exits from l3: 2
64.09/64.16	
64.09/64.16	Strengthening and disabling transitions...
64.09/64.16	
64.09/64.16	LOG: CALL solverLinear in Graph for feasibility
64.09/64.16	
64.09/64.16	LOG: RETURN solveLinear in Graph for feasibility
64.09/64.16	Strengthening transition (result): 
64.09/64.16	<l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
64.09/64.16	
64.09/64.16	Calling reachability with...
64.09/64.16	Transition: <l3, end, true, {all remain the same}>
64.09/64.16	Conditions: 1 <= arg2, arg2 <= arg3, arg3 <= arg2, 
64.09/64.16	OPEN EXITS: 
64.09/64.16	<l3, end, 1 <= arg2 /\ arg2 = arg3, {all remain the same}>
64.09/64.16	
64.09/64.16	--- Reachability graph ---
64.09/64.16	> Graph without transitions.
64.09/64.16	
64.09/64.16	Calling reachability with...
64.09/64.16	Transition: <l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}>
64.09/64.16	Conditions: 1 <= arg2, arg2 = arg3, 
64.09/64.16	OPEN EXITS: 
64.09/64.16	<l0, l3, 0 <= undef14 /\ 1 <= arg2 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = arg3 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}>
64.09/64.16	
64.09/64.16	> Conditions are reachable!
64.09/64.16	
64.09/64.16	Program does NOT terminate
64.09/64.16	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
64.09/64.16	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
64.09/64.16	EOF