5.38/5.42	NO
5.38/5.42	
5.38/5.42	Solver Timeout: 4
5.38/5.42	Global Timeout: 300
5.38/5.42	No parsing errors!
5.38/5.42	Init Location: 0
5.38/5.42	Transitions:
5.38/5.42	<l0, l10, true>
5.38/5.42	<l1, l2, true>
5.38/5.42	<l2, l3, ((1 + a_13^0) <= 1), par{result_11^0 -> (0 + temp0_14^0)}>
5.38/5.42	<l2, l4, (1 <= (0 + a_13^0)) /\ (undef25 = undef25) /\ (undef24 = (0 + undef25)) /\ (undef21 = undef21) /\ ((0 + a_13^0) <= (0 + (2 * undef24))) /\ ((0 + (2 * undef24)) <= (0 + a_13^0)) /\ (undef19 = (0 + undef24)) /\ ((0 + undef19) <= (0 + undef24)) /\ ((0 + undef24) <= (0 + undef19)) /\ (1 <= (0 + (2 * undef24))), par{a_13^0 -> undef19, nondet_12^0 -> undef21, x_15^0 -> undef24}>
5.38/5.42	<l4, l2, true>
5.38/5.42	<l2, l5, (undef37 = undef37) /\ (1 <= (0 + a_13^0)) /\ (undef42 = undef42) /\ (undef38 = undef38), par{a_21^0 -> undef37, nondet_12^0 -> undef38, x_15^0 -> (0 + undef42)}>
5.38/5.42	<l5, l6, (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43), par{__disjvr_0^0 -> undef43}>
5.38/5.42	<l6, l7, (undef53 = (1 + (3 * a_13^0))) /\ ((0 + undef53) <= (1 + (3 * a_21^0))) /\ ((1 + (3 * a_21^0)) <= (0 + undef53)), par{a_13^0 -> undef53}>
5.38/5.42	<l7, l8, (undef60 = __disjvr_1^0) /\ (__disjvr_1^0 = undef60), par{__disjvr_1^0 -> undef60}>
5.38/5.42	<l8, l9, (1 <= (0 + a_21^0))>
5.38/5.42	<l9, l2, true>
5.38/5.42	<l10, l1, true>
5.38/5.42	
5.38/5.42	Fresh variables:
5.38/5.42	undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 
5.38/5.42	
5.38/5.42	Undef variables:
5.38/5.42	undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 
5.38/5.42	
5.38/5.42	Abstraction variables:
5.38/5.42	
5.38/5.42	Exit nodes:
5.38/5.42	
5.38/5.42	Accepting locations:
5.38/5.42	
5.38/5.42	Asserts:
5.38/5.42	
5.38/5.42	Preprocessed LLVMGraph
5.38/5.42	Init Location: 0
5.38/5.42	Transitions:
5.38/5.42	<l0, l2, true>
5.38/5.42	<l2, l3, ((1 + a_13^0) <= 1)>
5.38/5.42	<l2, l2, (1 <= (0 + a_13^0)) /\ (undef25 = undef25) /\ (undef24 = (0 + undef25)) /\ (undef21 = undef21) /\ ((0 + a_13^0) <= (0 + (2 * undef24))) /\ ((0 + (2 * undef24)) <= (0 + a_13^0)) /\ (undef19 = (0 + undef24)) /\ ((0 + undef19) <= (0 + undef24)) /\ ((0 + undef24) <= (0 + undef19)) /\ (1 <= (0 + (2 * undef24))), par{a_13^0 -> undef19}>
5.38/5.42	<l2, l2, (undef37 = undef37) /\ (1 <= (0 + a_13^0)) /\ (undef42 = undef42) /\ (undef38 = undef38) /\ (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43) /\ (undef53 = (1 + (3 * a_13^0))) /\ ((0 + undef53) <= (1 + (3 * undef37))) /\ ((1 + (3 * undef37)) <= (0 + undef53)) /\ (undef60 = __disjvr_1^0) /\ (__disjvr_1^0 = undef60) /\ (1 <= (0 + undef37)), par{__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53}>
5.38/5.42	
5.38/5.42	Fresh variables:
5.38/5.42	undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 
5.38/5.42	
5.38/5.42	Undef variables:
5.38/5.42	undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 
5.38/5.42	
5.38/5.42	Abstraction variables:
5.38/5.42	
5.38/5.42	Exit nodes:
5.38/5.42	
5.38/5.42	Accepting locations:
5.38/5.42	
5.38/5.42	Asserts:
5.38/5.42	
5.38/5.42	*************************************************************
5.38/5.42	*******************************************************************************************
5.38/5.42	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.38/5.42	*******************************************************************************************
5.38/5.42	
5.38/5.42	Init Location: 0
5.38/5.42	Graph 0:
5.38/5.42	Transitions:
5.38/5.42	Variables:
5.38/5.42	
5.38/5.42	Graph 1:
5.38/5.42	Transitions:
5.38/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.38/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.38/5.42	Variables:
5.38/5.42	a_13^0, __disjvr_0^0, __disjvr_1^0
5.38/5.42	
5.38/5.42	Graph 2:
5.38/5.42	Transitions:
5.38/5.42	Variables:
5.38/5.42	
5.38/5.42	Precedence: 
5.38/5.42	Graph 0
5.38/5.42	
5.38/5.42	Graph 1
5.38/5.42	<l0, l2, true, {all remain the same}>
5.38/5.42	
5.38/5.42	Graph 2
5.38/5.42	<l2, l3, a_13^0 <= 0, {all remain the same}>
5.38/5.42	
5.38/5.42	Map Locations to Subgraph:
5.38/5.42	( 0 , 0 )
5.38/5.42	( 2 , 1 )
5.38/5.42	( 3 , 2 )
5.38/5.42	
5.38/5.42	*******************************************************************************************
5.38/5.42	********************************    CHECKING ASSERTIONS    ********************************
5.38/5.42	*******************************************************************************************
5.38/5.42	
5.38/5.42	Proving termination of subgraph 0
5.38/5.42	Proving termination of subgraph 1
5.38/5.42	Checking unfeasibility...
5.38/5.42	Time used: 0.004616
5.38/5.42	
5.38/5.42	Checking conditional termination of SCC {l2}...
5.38/5.42	
5.38/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.001613s
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.010567s
5.40/5.42	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012162s
5.40/5.42	Time used: 0.011627
5.40/5.42	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008339s
5.40/5.42	Time used: 0.007531
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020127s
5.40/5.42	Time used: 0.019563
5.40/5.42	Improving Solution with cost 1 ...
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetNextSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045197s
5.40/5.42	Time used: 0.045189
5.40/5.42	
5.40/5.42	LOG: SAT solveNonLinear - Elapsed time: 0.065324s
5.40/5.42	Cost: 1; Total time: 0.064752
5.40/5.42	Failed at location 2: 1 + a_13^0 <= 0
5.40/5.42	Before Improving: 
5.40/5.42	Quasi-invariant at l2: 1 + a_13^0 <= 0
5.40/5.42	Optimizing invariants...
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.007338s
5.40/5.42	Remaining time after improvement: 0.997047
5.40/5.42	Termination implied by a set of quasi-invariant(s):
5.40/5.42	Quasi-invariant at l2: 1 + a_13^0 <= 0
5.40/5.42	[ Invariant Graph ]
5.40/5.42	Strengthening and disabling transitions...
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	[ Termination Graph ]
5.40/5.42	Strengthening and disabling transitions...
5.40/5.42	> It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	New Graphs: 
5.40/5.42	Calling Safety with literal 1 + a_13^0 <= 0 and entry <l0, l2, true, {all remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL check - Post:1 + a_13^0 <= 0 - Process 1
5.40/5.42	* Exit transition: <l0, l2, true, {all remain the same}>
5.40/5.42	* Postcondition  : 1 + a_13^0 <= 0
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.000590s
5.40/5.42	> Postcondition is not implied!
5.40/5.42	
5.40/5.42	LOG: RETURN check - Elapsed time: 0.000656s
5.40/5.42	INVARIANTS: 
5.40/5.42	2: 
5.40/5.42	Quasi-INVARIANTS to narrow Graph: 
5.40/5.42	2: 1 + a_13^0 <= 0 , 
5.40/5.42	Narrowing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: Narrow transition size 1
5.40/5.42	Narrowing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: Narrow transition size 1
5.40/5.42	invGraph after Narrowing: 
5.40/5.42	Transitions:
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	Variables:
5.40/5.42	a_13^0, __disjvr_0^0, __disjvr_1^0
5.40/5.42	Checking conditional termination of SCC {l2}...
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.001523s
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.009626s
5.40/5.42	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010954s
5.40/5.42	Time used: 0.010334
5.40/5.42	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008362s
5.40/5.42	Time used: 0.007527
5.40/5.42	Solving with 1 template(s).
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026817s
5.40/5.42	Time used: 0.026096
5.40/5.42	Improving Solution with cost 1 ...
5.40/5.42	
5.40/5.42	LOG: CALL solveNonLinearGetNextSolution
5.40/5.42	
5.40/5.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029625s
5.40/5.42	Time used: 0.029617
5.40/5.42	
5.40/5.42	LOG: SAT solveNonLinear - Elapsed time: 0.056442s
5.40/5.42	Cost: 1; Total time: 0.055713
5.40/5.42	Failed at location 2: a_13^0 <= 0
5.40/5.42	Before Improving: 
5.40/5.42	Quasi-invariant at l2: a_13^0 <= 0
5.40/5.42	Optimizing invariants...
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.007498s
5.40/5.42	Remaining time after improvement: 0.996957
5.40/5.42	Termination implied by a set of quasi-invariant(s):
5.40/5.42	Quasi-invariant at l2: a_13^0 <= 0
5.40/5.42	[ Invariant Graph ]
5.40/5.42	Strengthening and disabling transitions...
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	[ Termination Graph ]
5.40/5.42	Strengthening and disabling transitions...
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL solverLinear in Graph for feasibility
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear in Graph for feasibility
5.40/5.42	It's unfeasible. Removing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.42	New Graphs: 
5.40/5.42	Calling Safety with literal a_13^0 <= 0 and entry <l0, l2, 0 <= a_13^0, {all remain the same}>
5.40/5.42	
5.40/5.42	LOG: CALL check - Post:a_13^0 <= 0 - Process 2
5.40/5.42	* Exit transition: <l0, l2, 0 <= a_13^0, {all remain the same}>
5.40/5.42	* Postcondition  : a_13^0 <= 0
5.40/5.42	
5.40/5.42	LOG: CALL solveLinear
5.40/5.42	
5.40/5.42	LOG: RETURN solveLinear - Elapsed time: 0.000637s
5.40/5.42	> Postcondition is not implied!
5.40/5.42	
5.40/5.42	LOG: RETURN check - Elapsed time: 0.000707s
5.40/5.42	INVARIANTS: 
5.40/5.42	2: 
5.40/5.42	Quasi-INVARIANTS to narrow Graph: 
5.40/5.42	2: a_13^0 <= 0 , 
5.40/5.42	Narrowing transition: 
5.40/5.42	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.43	
5.40/5.43	LOG: Narrow transition size 1
5.40/5.43	Narrowing transition: 
5.40/5.43	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.43	
5.40/5.43	LOG: Narrow transition size 1
5.40/5.43	invGraph after Narrowing: 
5.40/5.43	Transitions:
5.40/5.43	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.43	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.43	Variables:
5.40/5.43	a_13^0, __disjvr_0^0, __disjvr_1^0
5.40/5.43	Checking conditional termination of SCC {l2}...
5.40/5.43	
5.40/5.43	LOG: CALL solveLinear
5.40/5.43	
5.40/5.43	LOG: RETURN solveLinear - Elapsed time: 0.001561s
5.40/5.43	
5.40/5.43	LOG: CALL solveLinear
5.40/5.43	
5.40/5.43	LOG: RETURN solveLinear - Elapsed time: 0.009674s
5.40/5.43	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.43	Solving with 1 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011257s
5.40/5.43	Time used: 0.010606
5.40/5.43	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.43	Solving with 1 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008428s
5.40/5.43	Time used: 0.007539
5.40/5.43	Solving with 1 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031754s
5.40/5.43	Time used: 0.031229
5.40/5.43	Solving with 2 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002891s
5.40/5.43	Time used: 4.00069
5.40/5.43	Solving with 3 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010864s
5.40/5.43	Time used: 1.00002
5.40/5.43	Solving with 1 template(s).
5.40/5.43	
5.40/5.43	LOG: CALL solveNonLinearGetFirstSolution
5.40/5.43	
5.40/5.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039841s
5.40/5.43	Time used: 0.016583
5.40/5.43	
5.40/5.43	Proving non-termination of subgraph 1
5.40/5.43	Transitions:
5.40/5.43	<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
5.40/5.43	<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
5.40/5.43	Variables:
5.40/5.43	a_13^0, __disjvr_0^0, __disjvr_1^0
5.40/5.43	
5.40/5.43	Checking that every undef value has an assignment...
5.40/5.43	
5.40/5.43	LOG: CALL solveLinear
5.40/5.43	
5.40/5.43	LOG: RETURN solveLinear - Elapsed time: 0.002495s
5.40/5.43	Checking conditional non-termination of SCC {l2}...
5.40/5.43	> No assignment for some undef value.
5.40/5.43	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
5.40/5.43	Calling reachability with...
5.40/5.43	Transition: <l2, end, true, {all remain the same}>
5.40/5.43	Conditions: 1 <= a_13^0, 
5.40/5.43	OPEN EXITS: 
5.40/5.43	<l2, end, 1 <= a_13^0, {all remain the same}>
5.40/5.43	
5.40/5.43	--- Reachability graph ---
5.40/5.43	> Graph without transitions.
5.40/5.43	
5.40/5.43	Calling reachability with...
5.40/5.43	Transition: <l0, l2, true, {all remain the same}>
5.40/5.43	Conditions: 1 <= a_13^0, 
5.40/5.43	OPEN EXITS: 
5.40/5.43	<l0, l2, 1 <= a_13^0, {all remain the same}>
5.40/5.43	
5.40/5.43	> Conditions are reachable!
5.40/5.43	
5.40/5.43	Program does NOT terminate
5.40/5.43	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.40/5.43	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.40/5.43	EOF