9.09/9.17	NO
9.09/9.17	
9.09/9.17	Solver Timeout: 4
9.09/9.17	Global Timeout: 300
9.09/9.17	No parsing errors!
9.09/9.17	Init Location: 0
9.09/9.17	Transitions:
9.09/9.17	<l0, l12, true>
9.09/9.17	<l1, l2, (undef11 = undef11), par{head_12^0 -> 0, i_11^0 -> 0, length_19^0 -> undef11}>
9.09/9.17	<l2, l3, (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef33 = undef33) /\ (undef31 = (0 + undef33)), par{head_12^0 -> (0 + undef31), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef31, tmp___0_14^0 -> undef33}>
9.09/9.17	<l2, l4, (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef36 = (0 + head_12^0)) /\ (undef52 = (0 + undef36)) /\ (undef53 = undef53) /\ (undef51 = (0 + a_16^0)) /\ ((0 + undef51) <= 0) /\ (0 <= (0 + undef51)) /\ (undef54 = undef54) /\ (undef35 = undef35), par{Result_4^0 -> undef35, __cil_tmp6_15^0 -> undef36, tmp_20^0 -> (0 + undef52), x_18^0 -> undef51}>
9.09/9.17	<l3, l5, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef70 = undef70) /\ (undef68 = (0 + undef70)), par{head_12^0 -> (0 + undef68), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef68, tmp___0_14^0 -> undef70}>
9.09/9.17	<l5, l3, true>
9.09/9.17	<l3, l6, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef90 = (0 + head_12^0)) /\ (undef106 = (0 + undef90)) /\ (0 <= (0 + len_47^0)) /\ (undef89 = undef89) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)), par{Result_4^0 -> undef89, __cil_tmp6_15^0 -> undef90, tmp_20^0 -> (0 + undef106), x_18^0 -> (0 + a_16^0)}>
9.09/9.17	<l6, l7, (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109), par{__disjvr_0^0 -> undef109}>
9.09/9.17	<l7, l8, (undef141 = undef141) /\ (undef135 = undef135), par{lt_21^0 -> undef135, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef141)}>
9.09/9.17	<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef159 = undef159) /\ (undef142 = undef142), par{Result_4^0 -> undef142}>
9.09/9.17	<l8, l9, (0 <= (0 + a_140^0))>
9.09/9.17	<l9, l10, (undef180 = __disjvr_1^0) /\ (__disjvr_1^0 = undef180), par{__disjvr_1^0 -> undef180}>
9.09/9.17	<l10, l11, (undef211 = undef211) /\ (undef205 = undef205), par{lt_21^0 -> undef205, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef211)}>
9.09/9.17	<l11, l8, true>
9.09/9.17	<l12, l1, true>
9.09/9.17	
9.09/9.17	Fresh variables:
9.09/9.17	undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 
9.09/9.17	
9.09/9.17	Undef variables:
9.09/9.17	undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 
9.09/9.17	
9.09/9.17	Abstraction variables:
9.09/9.17	
9.09/9.17	Exit nodes:
9.09/9.17	
9.09/9.17	Accepting locations:
9.09/9.17	
9.09/9.17	Asserts:
9.09/9.17	
9.09/9.17	Preprocessed LLVMGraph
9.09/9.17	Init Location: 0
9.09/9.17	Transitions:
9.09/9.17	<l0, l3, (undef11 = undef11) /\ (0 <= ((~(2) + (~(1) * 0)) + length_10^0)) /\ (undef33 = undef33) /\ (undef31 = (0 + undef33)), par{head_12^0 -> (0 + undef31), i_11^0 -> (1 + 0)}>
9.09/9.17	<l0, l4, (undef11 = undef11) /\ (((~(1) + (~(1) * 0)) + length_10^0) <= 0) /\ (undef36 = (0 + 0)) /\ (undef52 = (0 + undef36)) /\ (undef53 = undef53) /\ (undef51 = (0 + a_16^0)) /\ ((0 + undef51) <= 0) /\ (0 <= (0 + undef51)) /\ (undef54 = undef54) /\ (undef35 = undef35), par{head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef51}>
9.09/9.17	<l3, l3, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef70 = undef70) /\ (undef68 = (0 + undef70)), par{head_12^0 -> (0 + undef68), i_11^0 -> (1 + i_11^0)}>
9.09/9.17	<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef90 = (0 + head_12^0)) /\ (undef106 = (0 + undef90)) /\ (0 <= (0 + len_47^0)) /\ (undef89 = undef89) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (undef141 = undef141) /\ (undef135 = undef135), par{__disjvr_0^0 -> undef109, x_18^0 -> (0 + undef141)}>
9.09/9.17	<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef159 = undef159) /\ (undef142 = undef142)>
9.09/9.17	<l8, l8, (0 <= (0 + a_140^0)) /\ (undef180 = __disjvr_1^0) /\ (__disjvr_1^0 = undef180) /\ (undef211 = undef211) /\ (undef205 = undef205), par{__disjvr_1^0 -> undef180, x_18^0 -> (0 + undef211)}>
9.09/9.17	
9.09/9.17	Fresh variables:
9.09/9.17	undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 
9.09/9.17	
9.09/9.17	Undef variables:
9.09/9.17	undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 
9.09/9.17	
9.09/9.17	Abstraction variables:
9.09/9.17	
9.09/9.17	Exit nodes:
9.09/9.17	
9.09/9.17	Accepting locations:
9.09/9.17	
9.09/9.17	Asserts:
9.09/9.17	
9.09/9.17	*************************************************************
9.09/9.17	*******************************************************************************************
9.09/9.17	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.09/9.17	*******************************************************************************************
9.09/9.17	
9.09/9.17	Init Location: 0
9.09/9.17	Graph 0:
9.09/9.17	Transitions:
9.09/9.17	Variables:
9.09/9.17	
9.09/9.17	Graph 1:
9.09/9.17	Transitions:
9.09/9.17	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef68 = undef70, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>
9.09/9.17	Variables:
9.09/9.17	head_12^0, i_11^0, len_47^0, length_10^0
9.09/9.17	
9.09/9.17	Graph 2:
9.09/9.17	Transitions:
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	Variables:
9.09/9.17	__disjvr_1^0, a_140^0, x_18^0
9.09/9.17	
9.09/9.17	Graph 3:
9.09/9.17	Transitions:
9.09/9.17	Variables:
9.09/9.17	
9.09/9.17	Precedence: 
9.09/9.17	Graph 0
9.09/9.17	
9.09/9.17	Graph 1
9.09/9.17	<l0, l3, 2 <= length_10^0 /\ undef31 = undef33, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	
9.09/9.17	Graph 2
9.09/9.17	<l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
9.09/9.17	
9.09/9.17	Graph 3
9.09/9.17	<l0, l4, length_10^0 <= 1 /\ a_16^0 = undef51 /\ undef36 = 0 /\ undef36 = undef52 /\ undef51 = 0, {head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef51, rest remain the same}>
9.09/9.17	<l8, l4, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
9.09/9.17	
9.09/9.17	Map Locations to Subgraph:
9.09/9.17	( 0 , 0 )
9.09/9.17	( 3 , 1 )
9.09/9.17	( 4 , 3 )
9.09/9.17	( 8 , 2 )
9.09/9.17	
9.09/9.17	*******************************************************************************************
9.09/9.17	********************************    CHECKING ASSERTIONS    ********************************
9.09/9.17	*******************************************************************************************
9.09/9.17	
9.09/9.17	Proving termination of subgraph 0
9.09/9.17	Proving termination of subgraph 1
9.09/9.17	Checking unfeasibility...
9.09/9.17	Time used: 0.003104
9.09/9.17	
9.09/9.17	Checking conditional termination of SCC {l3}...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001029s
9.09/9.17	Ranking function: -2 - i_11^0 + length_10^0
9.09/9.17	New Graphs: 
9.09/9.17	Proving termination of subgraph 2
9.09/9.17	Checking unfeasibility...
9.09/9.17	Time used: 0.002074
9.09/9.17	
9.09/9.17	Checking conditional termination of SCC {l8}...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.000599s
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001747s
9.09/9.17	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006183s
9.09/9.17	Time used: 0.00602
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008263s
9.09/9.17	Time used: 0.007785
9.09/9.17	Improving Solution with cost 1 ...
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetNextSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014084s
9.09/9.17	Time used: 0.014077
9.09/9.17	
9.09/9.17	LOG: SAT solveNonLinear - Elapsed time: 0.022347s
9.09/9.17	Cost: 1; Total time: 0.021862
9.09/9.17	Failed at location 8: 1 + a_140^0 <= 0
9.09/9.17	Before Improving: 
9.09/9.17	Quasi-invariant at l8: 1 + a_140^0 <= 0
9.09/9.17	Optimizing invariants...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.002904s
9.09/9.17	Remaining time after improvement: 0.998478
9.09/9.17	Termination implied by a set of quasi-invariant(s):
9.09/9.17	Quasi-invariant at l8: 1 + a_140^0 <= 0
9.09/9.17	[ Invariant Graph ]
9.09/9.17	Strengthening and disabling transitions...
9.09/9.17	
9.09/9.17	LOG: CALL solverLinear in Graph for feasibility
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear in Graph for feasibility
9.09/9.17	It's unfeasible. Removing transition: 
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	[ Termination Graph ]
9.09/9.17	Strengthening and disabling transitions...
9.09/9.17	> It's unfeasible. Removing transition: 
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	New Graphs: 
9.09/9.17	Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
9.09/9.17	
9.09/9.17	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 1
9.09/9.17	* Exit transition: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
9.09/9.17	* Postcondition  : 1 + a_140^0 <= 0
9.09/9.17	Postcodition moved up: 1 + a_140^0 <= 0
9.09/9.17	
9.09/9.17	LOG: Try proving POST
9.09/9.17	Postcondition: 1 + a_140^0 <= 0
9.09/9.17	
9.09/9.17	LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 2
9.09/9.17	* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	* Postcondition  : 1 + a_140^0 <= 0
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.000748s
9.09/9.17	> Postcondition is not implied!
9.09/9.17	
9.09/9.17	LOG: RETURN check - Elapsed time: 0.000864s
9.09/9.17	
9.09/9.17	LOG: NarrowEntry size 1
9.09/9.17	Narrowing transition: 
9.09/9.17	<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef68 = undef70, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>
9.09/9.17	
9.09/9.17	LOG: Narrow transition size 1
9.09/9.17	ENTRIES:
9.09/9.17	<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	END ENTRIES:
9.09/9.17	GRAPH:
9.09/9.17	<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef68 = undef70 /\ undef90 = undef106, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>
9.09/9.17	END GRAPH:
9.09/9.17	EXIT: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
9.09/9.17	POST: 1 + a_140^0 <= 0
9.09/9.17	
9.09/9.17	
9.09/9.17	LOG: Try proving POST
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018146s
9.09/9.17	Time used: 0.017954
9.09/9.17	Improving Solution with cost 51 ...
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetNextSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000854s
9.09/9.17	Time used: 1.0007
9.09/9.17	
9.09/9.17	LOG: SAT solveNonLinear - Elapsed time: 1.019000s
9.09/9.17	Cost: 51; Total time: 1.01865
9.09/9.17	Failed at location 3: len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	Before Improving: 
9.09/9.17	Quasi-invariant at l3: len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	Optimizing invariants...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.003927s
9.09/9.17	Remaining time after improvement: 0.998459
9.09/9.17	Some transition disabled by a set of quasi-invariant(s):
9.09/9.17	Quasi-invariant at l3: len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	
9.09/9.17	LOG: NEXT CALL check - disable
9.09/9.17	
9.09/9.17	LOG: CALL check - Post:len_47^0 + length_10^0 <= 1 + i_11^0 - Process 3
9.09/9.17	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	* Postcondition  : len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001026s
9.09/9.17	> Postcondition is not implied!
9.09/9.17	
9.09/9.17	LOG: RETURN check - Elapsed time: 0.001166s
9.09/9.17	Solving with 2 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.886266s
9.09/9.17	Time used: 0.885969
9.09/9.17	Improving Solution with cost 51 ...
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetNextSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000773s
9.09/9.17	Time used: 1.0006
9.09/9.17	
9.09/9.17	LOG: SAT solveNonLinear - Elapsed time: 1.887039s
9.09/9.17	Cost: 51; Total time: 1.88657
9.09/9.17	Failed at location 3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	Before Improving: 
9.09/9.17	Quasi-invariant at l3: 0 <= a_140^0 + len_47^0
9.09/9.17	Quasi-invariant at l3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	Optimizing invariants...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.007603s
9.09/9.17	Remaining time after improvement: 0.997734
9.09/9.17	Some transition disabled by a set of quasi-invariant(s):
9.09/9.17	Quasi-invariant at l3: 0 <= a_140^0 + len_47^0
9.09/9.17	Quasi-invariant at l3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	
9.09/9.17	LOG: NEXT CALL check - disable
9.09/9.17	
9.09/9.17	LOG: CALL check - Post:a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0 - Process 4
9.09/9.17	* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	* Postcondition  : a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001401s
9.09/9.17	> Postcondition is not implied!
9.09/9.17	
9.09/9.17	LOG: RETURN check - Elapsed time: 0.001555s
9.09/9.17	Solving with 3 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000526s
9.09/9.17	Time used: 1.00013
9.09/9.17	
9.09/9.17	LOG: Postcondition is not implied - no solution
9.09/9.17	> Postcondition is not implied!
9.09/9.17	
9.09/9.17	LOG: RETURN check - Elapsed time: 3.934909s
9.09/9.17	INVARIANTS: 
9.09/9.17	8: 
9.09/9.17	Quasi-INVARIANTS to narrow Graph: 
9.09/9.17	8: 1 + a_140^0 <= 0 , 
9.09/9.17	Narrowing transition: 
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	
9.09/9.17	LOG: Narrow transition size 1
9.09/9.17	invGraph after Narrowing: 
9.09/9.17	Transitions:
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	Variables:
9.09/9.17	__disjvr_1^0, a_140^0, x_18^0
9.09/9.17	Checking conditional termination of SCC {l8}...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.000566s
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001934s
9.09/9.17	Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005593s
9.09/9.17	Time used: 0.005454
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009173s
9.09/9.17	Time used: 0.008748
9.09/9.17	Solving with 2 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002564s
9.09/9.17	Time used: 4.0006
9.09/9.17	Solving with 3 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004131s
9.09/9.17	Time used: 1.00003
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011129s
9.09/9.17	Time used: 0.006904
9.09/9.17	
9.09/9.17	Proving non-termination of subgraph 2
9.09/9.17	Transitions:
9.09/9.17	<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	Variables:
9.09/9.17	__disjvr_1^0, a_140^0, x_18^0
9.09/9.17	
9.09/9.17	Checking that every undef value has an assignment...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.001401s
9.09/9.17	Checking conditional non-termination of SCC {l8}...
9.09/9.17	EXIT TRANSITIONS:
9.09/9.17	<l8, end, 1 + a_140^0 <= 0, {all remain the same}>
9.09/9.17	
9.09/9.17	Solving with 1 template(s).
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetFirstSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021513s
9.09/9.17	Time used: 0.021227
9.09/9.17	Improving Solution with cost 1 ...
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinearGetNextSolution
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047388s
9.09/9.17	Time used: 0.047381
9.09/9.17	
9.09/9.17	LOG: SAT solveNonLinear - Elapsed time: 0.068900s
9.09/9.17	Cost: 1; Total time: 0.068608
9.09/9.17	Failed at location 8: 1 <= a_140^0
9.09/9.17	Before Improving: 
9.09/9.17	Quasi-invariant at l8: 1 <= a_140^0
9.09/9.17	Optimizing invariants...
9.09/9.17	
9.09/9.17	LOG: CALL solveLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear - Elapsed time: 0.009478s
9.09/9.17	Remaining time after improvement: 0.998363
9.09/9.17	Minimizing number of undef constraints...
9.09/9.17	
9.09/9.17	LOG: CALL solveNonLinear
9.09/9.17	
9.09/9.17	LOG: RETURN solveNonLinear - Elapsed time: 0.003084s
9.09/9.17	Number of undef constraints reduced!
9.09/9.17	
9.09/9.17	Non-termination implied by a set of quasi-invariant(s):
9.09/9.17	Quasi-invariant at l8: 1 <= a_140^0
9.09/9.17	
9.09/9.17	Strengthening and disabling EXIT transitions...
9.09/9.17	Closed exits from l8: 1
9.09/9.17	
9.09/9.17	Strengthening and disabling transitions...
9.09/9.17	
9.09/9.17	LOG: CALL solverLinear in Graph for feasibility
9.09/9.17	
9.09/9.17	LOG: RETURN solveLinear in Graph for feasibility
9.09/9.17	Strengthening transition (result): 
9.09/9.17	<l8, l8, 1 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
9.09/9.17	
9.09/9.17	Calling reachability with...
9.09/9.17	Transition: <l8, end, true, {all remain the same}>
9.09/9.17	Conditions: 1 <= a_140^0, 
9.09/9.17	OPEN EXITS: 
9.09/9.17	<l8, end, true, {all remain the same}> (condsUp: 1 <= a_140^0)
9.09/9.17	
9.09/9.17	--- Reachability graph ---
9.09/9.17	> Graph without transitions.
9.09/9.17	
9.09/9.17	Calling reachability with...
9.09/9.17	Transition: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
9.09/9.17	Conditions: 1 <= a_140^0, 
9.09/9.17	OPEN EXITS: 
9.09/9.17	<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef90, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}> (condsUp: 0 <= len_47^0, __disjvr_0^0 = undef109, undef90 = undef106, 1 <= a_140^0)
9.09/9.17	
9.09/9.17	--- Reachability graph ---
9.09/9.17	> Graph without transitions.
9.09/9.17	
9.09/9.17	Calling reachability with...
9.09/9.17	Transition: <l0, l3, 2 <= length_10^0 /\ undef31 = undef33, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef90, 0 <= len_47^0, __disjvr_0^0 = undef109, undef90 = undef106, 1 <= a_140^0, 
9.09/9.17	OPEN EXITS: 
9.09/9.17	<l0, l3, 0 <= len_47^0 /\ 1 <= a_140^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef31 = undef90 /\ undef90 = undef106 /\ length_10^0 = 2, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
9.09/9.17	
9.09/9.17	> Conditions are reachable!
9.09/9.17	
9.09/9.17	Program does NOT terminate
9.09/9.17	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
9.09/9.17	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
9.09/9.17	EOF