5.22/5.26	NO
5.22/5.26	
5.22/5.26	Solver Timeout: 4
5.22/5.26	Global Timeout: 300
5.22/5.26	No parsing errors!
5.22/5.26	Init Location: 0
5.22/5.26	Transitions:
5.22/5.26	<l0, l5, true>
5.22/5.26	<l1, l2, true>
5.22/5.26	<l2, l3, (undef5 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef5)) <= 0), par{x_5^0 -> undef5}>
5.22/5.26	<l3, l2, true>
5.22/5.26	<l2, l4, (undef11 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef11))) /\ (undef10 = undef10), par{Result_4^0 -> undef10, x_5^0 -> undef11}>
5.22/5.26	<l5, l1, true>
5.22/5.26	
5.22/5.26	Fresh variables:
5.22/5.26	undef5, undef10, undef11, 
5.22/5.26	
5.22/5.26	Undef variables:
5.22/5.26	undef5, undef10, undef11, 
5.22/5.26	
5.22/5.26	Abstraction variables:
5.22/5.26	
5.22/5.26	Exit nodes:
5.22/5.26	
5.22/5.26	Accepting locations:
5.22/5.26	
5.22/5.26	Asserts:
5.22/5.26	
5.22/5.26	Preprocessed LLVMGraph
5.22/5.26	Init Location: 0
5.22/5.26	Transitions:
5.22/5.26	<l0, l2, true>
5.22/5.26	<l2, l2, (undef5 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef5)) <= 0), par{x_5^0 -> undef5}>
5.22/5.26	<l2, l4, (undef11 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef11))) /\ (undef10 = undef10), par{x_5^0 -> undef11}>
5.22/5.26	
5.22/5.26	Fresh variables:
5.22/5.26	undef5, undef10, undef11, 
5.22/5.26	
5.22/5.26	Undef variables:
5.22/5.26	undef5, undef10, undef11, 
5.22/5.26	
5.22/5.26	Abstraction variables:
5.22/5.26	
5.22/5.26	Exit nodes:
5.22/5.26	
5.22/5.26	Accepting locations:
5.22/5.26	
5.22/5.26	Asserts:
5.22/5.26	
5.22/5.26	*************************************************************
5.22/5.26	*******************************************************************************************
5.22/5.26	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.22/5.26	*******************************************************************************************
5.22/5.26	
5.22/5.26	Init Location: 0
5.22/5.26	Graph 0:
5.22/5.26	Transitions:
5.22/5.26	Variables:
5.22/5.26	
5.22/5.26	Graph 1:
5.22/5.26	Transitions:
5.22/5.26	<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Variables:
5.22/5.26	x_5^0, y_6^0
5.22/5.26	
5.22/5.26	Graph 2:
5.22/5.26	Transitions:
5.22/5.26	Variables:
5.22/5.26	
5.22/5.26	Precedence: 
5.22/5.26	Graph 0
5.22/5.26	
5.22/5.26	Graph 1
5.22/5.26	<l0, l2, true, {all remain the same}>
5.22/5.26	
5.22/5.26	Graph 2
5.22/5.26	<l2, l4, 1 + undef11 <= 0 /\ x_5^0 + y_6^0 = undef11, {x_5^0 -> undef11, rest remain the same}>
5.22/5.26	
5.22/5.26	Map Locations to Subgraph:
5.22/5.26	( 0 , 0 )
5.22/5.26	( 2 , 1 )
5.22/5.26	( 4 , 2 )
5.22/5.26	
5.22/5.26	*******************************************************************************************
5.22/5.26	********************************    CHECKING ASSERTIONS    ********************************
5.22/5.26	*******************************************************************************************
5.22/5.26	
5.22/5.26	Proving termination of subgraph 0
5.22/5.26	Proving termination of subgraph 1
5.22/5.26	Checking unfeasibility...
5.22/5.26	Time used: 0.001855
5.22/5.26	
5.22/5.26	Checking conditional termination of SCC {l2}...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.000534s
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.001792s
5.22/5.26	Trying to remove transition: <l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004238s
5.22/5.26	Time used: 0.004085
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006565s
5.22/5.26	Time used: 0.006235
5.22/5.26	Improving Solution with cost 1 ...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetNextSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011519s
5.22/5.26	Time used: 0.011514
5.22/5.26	
5.22/5.26	LOG: SAT solveNonLinear - Elapsed time: 0.018084s
5.22/5.26	Cost: 1; Total time: 0.017749
5.22/5.26	Failed at location 2: 1 + x_5^0 + y_6^0 <= 0
5.22/5.26	Before Improving: 
5.22/5.26	Quasi-invariant at l2: 1 + x_5^0 + y_6^0 <= 0
5.22/5.26	Optimizing invariants...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.001889s
5.22/5.26	Remaining time after improvement: 0.999075
5.22/5.26	Termination implied by a set of quasi-invariant(s):
5.22/5.26	Quasi-invariant at l2: 1 + x_5^0 + y_6^0 <= 0
5.22/5.26	[ Invariant Graph ]
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	
5.22/5.26	LOG: CALL solverLinear in Graph for feasibility
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear in Graph for feasibility
5.22/5.26	It's unfeasible. Removing transition: 
5.22/5.26	<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	[ Termination Graph ]
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	> It's unfeasible. Removing transition: 
5.22/5.26	<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	New Graphs: 
5.22/5.26	Calling Safety with literal 1 + x_5^0 + y_6^0 <= 0 and entry <l0, l2, true, {all remain the same}>
5.22/5.26	
5.22/5.26	LOG: CALL check - Post:1 + x_5^0 + y_6^0 <= 0 - Process 1
5.22/5.26	* Exit transition: <l0, l2, true, {all remain the same}>
5.22/5.26	* Postcondition  : 1 + x_5^0 + y_6^0 <= 0
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.000333s
5.22/5.26	> Postcondition is not implied!
5.22/5.26	
5.22/5.26	LOG: RETURN check - Elapsed time: 0.000404s
5.22/5.26	INVARIANTS: 
5.22/5.26	2: 
5.22/5.26	Quasi-INVARIANTS to narrow Graph: 
5.22/5.26	2: 1 + x_5^0 + y_6^0 <= 0 , 
5.22/5.26	Narrowing transition: 
5.22/5.26	<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	
5.22/5.26	LOG: Narrow transition size 1
5.22/5.26	invGraph after Narrowing: 
5.22/5.26	Transitions:
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Variables:
5.22/5.26	x_5^0, y_6^0
5.22/5.26	Checking conditional termination of SCC {l2}...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.000568s
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.001931s
5.22/5.26	Trying to remove transition: <l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003944s
5.22/5.26	Time used: 0.003793
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007611s
5.22/5.26	Time used: 0.007208
5.22/5.26	Improving Solution with cost 1 ...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetNextSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010550s
5.22/5.26	Time used: 0.010546
5.22/5.26	
5.22/5.26	LOG: SAT solveNonLinear - Elapsed time: 0.018162s
5.22/5.26	Cost: 1; Total time: 0.017754
5.22/5.26	Failed at location 2: 1 + y_6^0 <= 0
5.22/5.26	Before Improving: 
5.22/5.26	Quasi-invariant at l2: 1 + y_6^0 <= 0
5.22/5.26	Optimizing invariants...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.002105s
5.22/5.26	Remaining time after improvement: 0.998855
5.22/5.26	Termination implied by a set of quasi-invariant(s):
5.22/5.26	Quasi-invariant at l2: 1 + y_6^0 <= 0
5.22/5.26	[ Invariant Graph ]
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	
5.22/5.26	LOG: CALL solverLinear in Graph for feasibility
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear in Graph for feasibility
5.22/5.26	Strengthening transition (result): 
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ 1 + y_6^0 <= 0 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	[ Termination Graph ]
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	
5.22/5.26	LOG: CALL solverLinear in Graph for feasibility
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear in Graph for feasibility
5.22/5.26	Strengthening transition (result): 
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ 1 + y_6^0 <= 0 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Ranking function: 2*x_5^0 + y_6^0
5.22/5.26	New Graphs: 
5.22/5.26	Calling Safety with literal 1 + y_6^0 <= 0 and entry <l0, l2, 0 <= x_5^0 + y_6^0, {all remain the same}>
5.22/5.26	
5.22/5.26	LOG: CALL check - Post:1 + y_6^0 <= 0 - Process 2
5.22/5.26	* Exit transition: <l0, l2, 0 <= x_5^0 + y_6^0, {all remain the same}>
5.22/5.26	* Postcondition  : 1 + y_6^0 <= 0
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.000328s
5.22/5.26	> Postcondition is not implied!
5.22/5.26	
5.22/5.26	LOG: RETURN check - Elapsed time: 0.000397s
5.22/5.26	INVARIANTS: 
5.22/5.26	2: 
5.22/5.26	Quasi-INVARIANTS to narrow Graph: 
5.22/5.26	2: 1 + y_6^0 <= 0 , 
5.22/5.26	Narrowing transition: 
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	
5.22/5.26	LOG: Narrow transition size 1
5.22/5.26	invGraph after Narrowing: 
5.22/5.26	Transitions:
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Variables:
5.22/5.26	x_5^0, y_6^0
5.22/5.26	Checking conditional termination of SCC {l2}...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.000618s
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.002144s
5.22/5.26	Trying to remove transition: <l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004103s
5.22/5.26	Time used: 0.003946
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007360s
5.22/5.26	Time used: 0.007052
5.22/5.26	Solving with 2 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001085s
5.22/5.26	Time used: 4.00048
5.22/5.26	Solving with 3 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004068s
5.22/5.26	Time used: 1.00038
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009062s
5.22/5.26	Time used: 0.006024
5.22/5.26	
5.22/5.26	Proving non-termination of subgraph 1
5.22/5.26	Transitions:
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	Variables:
5.22/5.26	x_5^0, y_6^0
5.22/5.26	
5.22/5.26	Checking that every undef value has an assignment...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.001041s
5.22/5.26	Checking conditional non-termination of SCC {l2}...
5.22/5.26	EXIT TRANSITIONS:
5.22/5.26	<l2, end, 0 <= x_5^0 + y_6^0 /\ 1 + y_6^0 <= 0, {all remain the same}>
5.22/5.26	<l2, end, 1 + x_5^0 + y_6^0 <= 0, {all remain the same}>
5.22/5.26	
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016939s
5.22/5.26	Time used: 0.01669
5.22/5.26	Improving Solution with cost 2 ...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetNextSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043774s
5.22/5.26	Time used: 0.043768
5.22/5.26	
5.22/5.26	LOG: SAT solveNonLinear - Elapsed time: 0.060713s
5.22/5.26	Cost: 2; Total time: 0.060458
5.22/5.26	Failed at location 2: 0 <= x_5^0 + y_6^0
5.22/5.26	Before Improving: 
5.22/5.26	Quasi-invariant at l2: 0 <= x_5^0 + y_6^0
5.22/5.26	Optimizing invariants...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.007925s
5.22/5.26	Remaining time after improvement: 0.998368
5.22/5.26	Minimizing number of undef constraints...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinear - Elapsed time: 0.003098s
5.22/5.26	Number of undef constraints reduced!
5.22/5.26	
5.22/5.26	Non-termination implied by a set of quasi-invariant(s):
5.22/5.26	Quasi-invariant at l2: 0 <= x_5^0 + y_6^0
5.22/5.26	
5.22/5.26	Strengthening and disabling EXIT transitions...
5.22/5.26	Closed exits from l2: 1
5.22/5.26	Strengthening exit transition (result): 
5.22/5.26	<l2, end, 0 <= x_5^0 + y_6^0 /\ 1 + y_6^0 <= 0, {all remain the same}>
5.22/5.26	
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	
5.22/5.26	LOG: CALL solverLinear in Graph for feasibility
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear in Graph for feasibility
5.22/5.26	Strengthening transition (result): 
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	
5.22/5.26	Checking conditional non-termination of SCC {l2}...
5.22/5.26	EXIT TRANSITIONS:
5.22/5.26	<l2, end, 0 <= x_5^0 + y_6^0 /\ 1 + y_6^0 <= 0, {all remain the same}>
5.22/5.26	
5.22/5.26	Solving with 1 template(s).
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetFirstSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018451s
5.22/5.26	Time used: 0.018211
5.22/5.26	Improving Solution with cost 1 ...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinearGetNextSolution
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021489s
5.22/5.26	Time used: 0.021484
5.22/5.26	
5.22/5.26	LOG: SAT solveNonLinear - Elapsed time: 0.039941s
5.22/5.26	Cost: 1; Total time: 0.039695
5.22/5.26	Failed at location 2: 0 <= y_6^0
5.22/5.26	Before Improving: 
5.22/5.26	Quasi-invariant at l2: 0 <= y_6^0
5.22/5.26	Optimizing invariants...
5.22/5.26	
5.22/5.26	LOG: CALL solveLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear - Elapsed time: 0.007540s
5.22/5.26	Remaining time after improvement: 0.998189
5.22/5.26	Minimizing number of undef constraints...
5.22/5.26	
5.22/5.26	LOG: CALL solveNonLinear
5.22/5.26	
5.22/5.26	LOG: RETURN solveNonLinear - Elapsed time: 0.002819s
5.22/5.26	Number of undef constraints reduced!
5.22/5.26	
5.22/5.26	Non-termination implied by a set of quasi-invariant(s):
5.22/5.26	Quasi-invariant at l2: 0 <= y_6^0
5.22/5.26	
5.22/5.26	Strengthening and disabling EXIT transitions...
5.22/5.26	Closed exits from l2: 1
5.22/5.26	
5.22/5.26	Strengthening and disabling transitions...
5.22/5.26	
5.22/5.26	LOG: CALL solverLinear in Graph for feasibility
5.22/5.26	
5.22/5.26	LOG: RETURN solveLinear in Graph for feasibility
5.22/5.26	Strengthening transition (result): 
5.22/5.26	<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
5.22/5.26	
5.22/5.26	Calling reachability with...
5.22/5.26	Transition: <l2, end, true, {all remain the same}>
5.22/5.26	Conditions: 0 <= x_5^0 + y_6^0, 0 <= y_6^0, 
5.22/5.26	OPEN EXITS: 
5.22/5.26	<l2, end, 0 <= x_5^0 + y_6^0, {all remain the same}> (condsUp: 0 <= y_6^0)
5.22/5.26	
5.22/5.26	--- Reachability graph ---
5.22/5.26	> Graph without transitions.
5.22/5.26	
5.22/5.26	Calling reachability with...
5.22/5.26	Transition: <l0, l2, true, {all remain the same}>
5.22/5.26	Conditions: 0 <= x_5^0 + y_6^0, 0 <= y_6^0, 
5.22/5.26	OPEN EXITS: 
5.22/5.26	<l0, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0, {all remain the same}>
5.22/5.26	
5.22/5.26	> Conditions are reachable!
5.22/5.26	
5.22/5.26	Program does NOT terminate
5.22/5.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.22/5.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.22/5.26	EOF