33.47/33.51	NO
33.47/33.51	
33.47/33.51	Solver Timeout: 4
33.47/33.51	Global Timeout: 300
33.47/33.51	No parsing errors!
33.47/33.51	Init Location: 0
33.47/33.51	Transitions:
33.47/33.51	<l0, l10, true>
33.47/33.51	<l1, l2, (30 <= (0 + a4^0)) /\ (undef6 = 1), par{answer^0 -> (0 + undef6), ret_complex6^0 -> undef6}>
33.47/33.51	<l1, l3, ((1 + a4^0) <= 30)>
33.47/33.51	<l4, l1, true>
33.47/33.51	<l3, l5, true>
33.47/33.51	<l6, l3, (13 <= (0 + b5^0)), par{a4^0 -> (1 + a4^0)}>
33.47/33.51	<l6, l3, ((0 + b5^0) <= 12), par{a4^0 -> (10 + a4^0)}>
33.47/33.51	<l7, l3, ((1 + b5^0) <= 10), par{a4^0 -> (1 + a4^0)}>
33.47/33.51	<l7, l6, (10 <= (0 + b5^0))>
33.47/33.51	<l8, l7, ((0 + b5^0) <= 5), par{b5^0 -> (2 + b5^0)}>
33.47/33.51	<l8, l7, (6 <= (0 + b5^0)) /\ (undef58 = undef58), par{b5^0 -> undef58}>
33.47/33.51	<l5, l4, ((0 + a4^0) <= (0 + b5^0)), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
33.47/33.51	<l5, l8, ((1 + b5^0) <= (0 + a4^0))>
33.47/33.51	<l9, l4, (undef74 = 1) /\ (undef77 = 1), par{a4^0 -> (0 + undef74), a^0 -> undef74, answer^0 -> 0, b5^0 -> (0 + undef77), b^0 -> undef77}>
33.47/33.51	<l10, l9, true>
33.47/33.51	
33.47/33.51	Fresh variables:
33.47/33.51	undef6, undef58, undef74, undef77, 
33.47/33.51	
33.47/33.51	Undef variables:
33.47/33.51	undef6, undef58, undef74, undef77, 
33.47/33.51	
33.47/33.51	Abstraction variables:
33.47/33.51	
33.47/33.51	Exit nodes:
33.47/33.51	
33.47/33.51	Accepting locations:
33.47/33.51	
33.47/33.51	Asserts:
33.47/33.51	
33.47/33.51	Preprocessed LLVMGraph
33.47/33.51	Init Location: 0
33.47/33.51	Transitions:
33.47/33.51	<l0, l3, (a4^0 = (0 + undef74)) /\ (b5^0 = (0 + undef77)) /\ (undef74 = 1) /\ (undef77 = 1) /\ ((1 + (0 + undef74)) <= 30)>
33.47/33.51	<l3, l2, ((0 + a4^0) <= (0 + b5^0)) /\ (30 <= (0 + (2 + a4^0))) /\ (undef6 = 1), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
33.47/33.51	<l3, l3, ((0 + a4^0) <= (0 + b5^0)) /\ ((1 + (2 + a4^0)) <= 30), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
33.47/33.51	<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ ((0 + b5^0) <= 5) /\ ((1 + (2 + b5^0)) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> (2 + b5^0)}>
33.47/33.51	<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}>
33.47/33.51	<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ (13 <= (0 + undef58)), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}>
33.47/33.51	<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ ((0 + undef58) <= 12), par{a4^0 -> (10 + a4^0), b5^0 -> undef58}>
33.47/33.51	
33.47/33.51	Fresh variables:
33.47/33.51	undef6, undef58, undef74, undef77, 
33.47/33.51	
33.47/33.51	Undef variables:
33.47/33.51	undef6, undef58, undef74, undef77, 
33.47/33.51	
33.47/33.51	Abstraction variables:
33.47/33.51	
33.47/33.51	Exit nodes:
33.47/33.51	
33.47/33.51	Accepting locations:
33.47/33.51	
33.47/33.51	Asserts:
33.47/33.51	
33.47/33.51	*************************************************************
33.47/33.51	*******************************************************************************************
33.47/33.51	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
33.47/33.51	*******************************************************************************************
33.47/33.51	
33.47/33.51	Init Location: 0
33.47/33.51	Graph 0:
33.47/33.51	Transitions:
33.47/33.51	Variables:
33.47/33.51	
33.47/33.51	Graph 1:
33.47/33.51	Transitions:
33.47/33.51	<l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Variables:
33.47/33.51	a4^0, b5^0
33.47/33.51	
33.47/33.51	Graph 2:
33.47/33.51	Transitions:
33.47/33.51	Variables:
33.47/33.51	
33.47/33.51	Precedence: 
33.47/33.51	Graph 0
33.47/33.51	
33.47/33.51	Graph 1
33.47/33.51	<l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
33.47/33.51	
33.47/33.51	Graph 2
33.47/33.51	<l3, l2, a4^0 <= b5^0 /\ 28 <= a4^0 /\ undef6 = 1, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	Map Locations to Subgraph:
33.47/33.51	( 0 , 0 )
33.47/33.51	( 2 , 2 )
33.47/33.51	( 3 , 1 )
33.47/33.51	
33.47/33.51	*******************************************************************************************
33.47/33.51	********************************    CHECKING ASSERTIONS    ********************************
33.47/33.51	*******************************************************************************************
33.47/33.51	
33.47/33.51	Proving termination of subgraph 0
33.47/33.51	Proving termination of subgraph 1
33.47/33.51	Checking unfeasibility...
33.47/33.51	Time used: 4.0004
33.47/33.51	
33.47/33.51	Checking conditional termination of SCC {l3}...
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.008726s
33.47/33.51	Ranking function: 81 - 3*a4^0
33.47/33.51	New Graphs: 
33.47/33.51	Transitions:
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Variables:
33.47/33.51	a4^0, b5^0
33.47/33.51	Checking conditional termination of SCC {l3}...
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.002077s
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.083511s
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022341s
33.47/33.51	Time used: 0.021783
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019676s
33.47/33.51	Time used: 0.018095
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019932s
33.47/33.51	Time used: 0.018484
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.446926s
33.47/33.51	Time used: 2.44529
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.030792s
33.47/33.51	Time used: 4.00099
33.47/33.51	Solving with 2 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023527s
33.47/33.51	Time used: 4.00117
33.47/33.51	Solving with 3 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004648s
33.47/33.51	Time used: 1.00006
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.066310s
33.47/33.51	Time used: 0.062202
33.47/33.51	Improving Solution with cost 1 ...
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetNextSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000829s
33.47/33.51	Time used: 1.00078
33.47/33.51	
33.47/33.51	LOG: SAT solveNonLinear - Elapsed time: 1.067139s
33.47/33.51	Cost: 1; Total time: 1.06299
33.47/33.51	Termination implied by a set of invariant(s):
33.47/33.51	Invariant at l3: 0 <= a4^0
33.47/33.51	[ Invariant Graph ]
33.47/33.51	Strengthening and disabling transitions...
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, a4^0 <= b5^0 /\ 0 <= a4^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	[ Termination Graph ]
33.47/33.51	Strengthening and disabling transitions...
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Quasi-ranking function: 50000 - a4^0
33.47/33.51	New Graphs: 
33.47/33.51	Transitions:
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12 /\ 50001 <= a4^0, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Variables:
33.47/33.51	a4^0, b5^0
33.47/33.51	Checking conditional termination of SCC {l3}...
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.002603s
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.135978s
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12 /\ 50001 <= a4^0, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023520s
33.47/33.51	Time used: 0.02247
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029811s
33.47/33.51	Time used: 0.028087
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024142s
33.47/33.51	Time used: 0.022429
33.47/33.51	Trying to remove transition: <l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.039510s
33.47/33.51	Time used: 3.03768
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.100849s
33.47/33.51	Time used: 4.00178
33.47/33.51	Solving with 2 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.025085s
33.47/33.51	Time used: 4.00131
33.47/33.51	Solving with 3 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.028851s
33.47/33.51	Time used: 1.00028
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037430s
33.47/33.51	Time used: 4.03391
33.47/33.51	Termination failed. Trying to show unreachability...
33.47/33.51	Proving unreachability of entry: <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL check - Post:1 <= 0 - Process 1
33.47/33.51	* Exit transition: <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
33.47/33.51	* Postcondition  : 1 <= 0
33.47/33.51	
33.47/33.51	LOG: CALL solveLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear - Elapsed time: 0.025313s
33.47/33.51	> Postcondition is not implied!
33.47/33.51	
33.47/33.51	LOG: RETURN check - Elapsed time: 0.025450s
33.47/33.51	Cannot prove unreachability
33.47/33.51	
33.47/33.51	Proving non-termination of subgraph 1
33.47/33.51	Transitions:
33.47/33.51	<l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Variables:
33.47/33.51	a4^0, b5^0
33.47/33.51	
33.47/33.51	Checking conditional non-termination of SCC {l3}...
33.47/33.51	EXIT TRANSITIONS:
33.47/33.51	<l3, end, a4^0 <= b5^0 /\ 6 <= b5^0 /\ 28 <= a4^0, {all remain the same}>
33.47/33.51	
33.47/33.51	Solving with 1 template(s).
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089007s
33.47/33.51	Time used: 0.088898
33.47/33.51	
33.47/33.51	LOG: SAT solveNonLinear - Elapsed time: 0.089007s
33.47/33.51	Cost: 0; Total time: 0.088898
33.47/33.51	Minimizing number of undef constraints...
33.47/33.51	
33.47/33.51	LOG: CALL solveNonLinear
33.47/33.51	
33.47/33.51	LOG: RETURN solveNonLinear - Elapsed time: 0.014237s
33.47/33.51	Number of undef constraints reduced!
33.47/33.51	
33.47/33.51	Non-termination implied by a set of quasi-invariant(s):
33.47/33.51	Quasi-invariant at l3: b5^0 <= 7
33.47/33.51	Constraint over undef 'undef58 <= 0' in transition:
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Constraint over undef 'undef58 <= 0' in transition:
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	Constraint over undef 'undef58 <= 0' in transition:
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	Strengthening and disabling EXIT transitions...
33.47/33.51	Closed exits from l3: 1
33.47/33.51	
33.47/33.51	Strengthening and disabling transitions...
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27 /\ b5^0 <= 7, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	Strengthening transition (result): 
33.47/33.51	<l3, l3, undef58 <= 0 /\ 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ b5^0 <= 7, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	It's unfeasible. Removing transition: 
33.47/33.51	<l3, l3, 1 <= 0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	LOG: CALL solverLinear in Graph for feasibility
33.47/33.51	
33.47/33.51	LOG: RETURN solveLinear in Graph for feasibility
33.47/33.51	It's unfeasible. Removing transition: 
33.47/33.51	<l3, l3, 1 <= 0, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
33.47/33.51	
33.47/33.51	Calling reachability with...
33.47/33.51	Transition: <l3, end, true, {all remain the same}>
33.47/33.51	Conditions: b5^0 <= 7, 
33.47/33.51	OPEN EXITS: 
33.47/33.51	<l3, end, b5^0 <= 7, {all remain the same}>
33.47/33.51	
33.47/33.51	--- Reachability graph ---
33.47/33.51	> Graph without transitions.
33.47/33.51	
33.47/33.51	Calling reachability with...
33.47/33.51	Transition: <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
33.47/33.51	Conditions: b5^0 <= 7, 
33.47/33.51	OPEN EXITS: 
33.47/33.51	<l0, l3, b5^0 <= 7 /\ a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
33.47/33.51	
33.47/33.51	> Conditions are reachable!
33.47/33.51	
33.47/33.51	Program does NOT terminate
33.47/33.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
33.47/33.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
33.47/33.51	EOF