32.42/32.46	NO
32.42/32.46	
32.42/32.46	Solver Timeout: 4
32.42/32.46	Global Timeout: 300
32.42/32.46	No parsing errors!
32.42/32.46	Init Location: 0
32.42/32.46	Transitions:
32.42/32.46	<l0, l7, true>
32.42/32.46	<l1, l2, true>
32.42/32.46	<l3, l4, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)), par{Result_4^0 -> (0 + undef10), ___cil_tmp4_8^0 -> undef10, ___retres3_7^0 -> undef12}>
32.42/32.46	<l3, l5, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.42/32.46	<l5, l3, true>
32.42/32.46	<l2, l4, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)), par{Result_4^0 -> (0 + undef31), ___cil_tmp4_8^0 -> undef31, ___retres3_7^0 -> undef33}>
32.42/32.46	<l2, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.42/32.46	<l4, l6, (undef46 = 0) /\ (undef44 = (0 + undef46)), par{Result_4^0 -> (0 + undef44), ___cil_tmp2_10^0 -> undef44, ___retres1_9^0 -> undef46}>
32.42/32.46	<l7, l1, true>
32.42/32.46	
32.42/32.46	Fresh variables:
32.42/32.46	undef10, undef12, undef31, undef33, undef44, undef46, 
32.42/32.46	
32.42/32.46	Undef variables:
32.42/32.46	undef10, undef12, undef31, undef33, undef44, undef46, 
32.42/32.46	
32.42/32.46	Abstraction variables:
32.42/32.46	
32.42/32.46	Exit nodes:
32.42/32.46	
32.42/32.46	Accepting locations:
32.42/32.46	
32.42/32.46	Asserts:
32.42/32.46	
32.42/32.46	Preprocessed LLVMGraph
32.42/32.46	Init Location: 0
32.42/32.46	Transitions:
32.42/32.46	<l0, l6, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.42/32.46	<l0, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.42/32.46	<l3, l6, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.42/32.46	<l3, l3, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.42/32.46	
32.42/32.46	Fresh variables:
32.42/32.46	undef10, undef12, undef31, undef33, undef44, undef46, 
32.42/32.46	
32.42/32.46	Undef variables:
32.42/32.46	undef10, undef12, undef31, undef33, undef44, undef46, 
32.42/32.46	
32.42/32.46	Abstraction variables:
32.42/32.46	
32.42/32.46	Exit nodes:
32.42/32.46	
32.42/32.46	Accepting locations:
32.42/32.46	
32.42/32.46	Asserts:
32.42/32.46	
32.42/32.46	*************************************************************
32.42/32.46	*******************************************************************************************
32.42/32.46	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
32.42/32.46	*******************************************************************************************
32.42/32.46	
32.42/32.46	Init Location: 0
32.42/32.46	Graph 0:
32.42/32.46	Transitions:
32.42/32.46	Variables:
32.42/32.46	
32.42/32.46	Graph 1:
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	
32.42/32.46	Graph 2:
32.42/32.46	Transitions:
32.42/32.46	Variables:
32.42/32.46	
32.42/32.46	Precedence: 
32.42/32.46	Graph 0
32.42/32.46	
32.42/32.46	Graph 1
32.42/32.46	<l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.42/32.46	
32.42/32.46	Graph 2
32.42/32.46	<l0, l6, 0 <= d_6^0 /\ undef31 = undef33 /\ undef33 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.42/32.46	<l3, l6, 1 + i_5^0 <= 0 /\ undef10 = undef12 /\ undef12 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.42/32.46	
32.42/32.46	Map Locations to Subgraph:
32.42/32.46	( 0 , 0 )
32.42/32.46	( 3 , 1 )
32.42/32.46	( 6 , 2 )
32.42/32.46	
32.42/32.46	*******************************************************************************************
32.42/32.46	********************************    CHECKING ASSERTIONS    ********************************
32.42/32.46	*******************************************************************************************
32.42/32.46	
32.42/32.46	Proving termination of subgraph 0
32.42/32.46	Proving termination of subgraph 1
32.42/32.46	Checking unfeasibility...
32.42/32.46	Time used: 0.0023
32.42/32.46	
32.42/32.46	Checking conditional termination of SCC {l3}...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000844s
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.001389s
32.42/32.46	Trying to remove transition: <l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004207s
32.42/32.46	Time used: 0.004088
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006048s
32.42/32.46	Time used: 0.005736
32.42/32.46	Improving Solution with cost 1 ...
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetNextSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016301s
32.42/32.46	Time used: 0.016294
32.42/32.46	
32.42/32.46	LOG: SAT solveNonLinear - Elapsed time: 0.022349s
32.42/32.46	Cost: 1; Total time: 0.02203
32.42/32.46	Failed at location 3: 1 + i_5^0 <= 0
32.42/32.46	Before Improving: 
32.42/32.46	Quasi-invariant at l3: 1 + i_5^0 <= 0
32.42/32.46	Optimizing invariants...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.002512s
32.42/32.46	Remaining time after improvement: 0.998461
32.42/32.46	Termination implied by a set of quasi-invariant(s):
32.42/32.46	Quasi-invariant at l3: 1 + i_5^0 <= 0
32.42/32.46	[ Invariant Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	It's unfeasible. Removing transition: 
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	[ Termination Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	> It's unfeasible. Removing transition: 
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	New Graphs: 
32.42/32.46	Calling Safety with literal 1 + i_5^0 <= 0 and entry <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.42/32.46	
32.42/32.46	LOG: CALL check - Post:1 + i_5^0 <= 0 - Process 1
32.42/32.46	* Exit transition: <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.42/32.46	* Postcondition  : 1 + i_5^0 <= 0
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000361s
32.42/32.46	> Postcondition is not implied!
32.42/32.46	
32.42/32.46	LOG: RETURN check - Elapsed time: 0.000432s
32.42/32.46	INVARIANTS: 
32.42/32.46	3: 
32.42/32.46	Quasi-INVARIANTS to narrow Graph: 
32.42/32.46	3: 1 + i_5^0 <= 0 , 
32.42/32.46	Narrowing transition: 
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	
32.42/32.46	LOG: Narrow transition size 1
32.42/32.46	invGraph after Narrowing: 
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	Checking conditional termination of SCC {l3}...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000781s
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.001406s
32.42/32.46	Trying to remove transition: <l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003653s
32.42/32.46	Time used: 0.003531
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006496s
32.42/32.46	Time used: 0.006221
32.42/32.46	Solving with 2 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002047s
32.42/32.46	Time used: 4.00138
32.42/32.46	Solving with 3 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004534s
32.42/32.46	Time used: 1.00044
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010340s
32.42/32.46	Time used: 0.006825
32.42/32.46	Improving Solution with cost 1 ...
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetNextSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012756s
32.42/32.46	Time used: 0.01275
32.42/32.46	
32.42/32.46	LOG: SAT solveNonLinear - Elapsed time: 0.023095s
32.42/32.46	Cost: 1; Total time: 0.019575
32.42/32.46	Termination implied by a set of invariant(s):
32.42/32.46	Invariant at l3: 1 + d_6^0 <= 0
32.42/32.46	[ Invariant Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	Strengthening transition (result): 
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	[ Termination Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	Strengthening transition (result): 
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Quasi-ranking function: 50000 - i_5^0
32.42/32.46	New Graphs: 
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	Checking conditional termination of SCC {l3}...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000519s
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.001966s
32.42/32.46	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006442s
32.42/32.46	Time used: 0.0063
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004953s
32.42/32.46	Time used: 4.00416
32.42/32.46	Solving with 2 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007701s
32.42/32.46	Time used: 4.00107
32.42/32.46	Solving with 3 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027556s
32.42/32.46	Time used: 1.00064
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011904s
32.42/32.46	Time used: 0.008492
32.42/32.46	Improving Solution with cost 1 ...
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetNextSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011927s
32.42/32.46	Time used: 0.011921
32.42/32.46	
32.42/32.46	LOG: SAT solveNonLinear - Elapsed time: 0.023831s
32.42/32.46	Cost: 1; Total time: 0.020413
32.42/32.46	Termination implied by a set of invariant(s):
32.42/32.46	Invariant at l3: 0 <= 1 + i_5^0
32.42/32.46	[ Invariant Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	Strengthening transition (result): 
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	[ Termination Graph ]
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	Strengthening transition (result): 
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Quasi-ranking function: 50000 - d_6^0 - i_5^0
32.42/32.46	New Graphs: 
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	Checking conditional termination of SCC {l3}...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000634s
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.002536s
32.42/32.46	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007951s
32.42/32.46	Time used: 0.007796
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004397s
32.42/32.46	Time used: 4.00402
32.42/32.46	Solving with 2 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006876s
32.42/32.46	Time used: 4.00101
32.42/32.46	Solving with 3 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.028163s
32.42/32.46	Time used: 1.00088
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012590s
32.42/32.46	Time used: 0.00936
32.42/32.46	Improving Solution with cost 1 ...
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetNextSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010753s
32.42/32.46	Time used: 0.010747
32.42/32.46	
32.42/32.46	LOG: SAT solveNonLinear - Elapsed time: 0.023343s
32.42/32.46	Cost: 1; Total time: 0.020107
32.42/32.46	Quasi-ranking function: 50000 + d_6^0 - i_5^0
32.42/32.46	New Graphs: 
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 1 + d_6^0 <= 0 /\ 50001 + d_6^0 <= i_5^0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	Checking conditional termination of SCC {l3}...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.000759s
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.002926s
32.42/32.46	Trying to remove transition: <l3, l3, 1 + d_6^0 <= 0 /\ 50001 + d_6^0 <= i_5^0 /\ 50001 <= d_6^0 + i_5^0 /\ 50001 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006851s
32.42/32.46	Time used: 0.006688
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002499s
32.42/32.46	Time used: 4.00211
32.42/32.46	Solving with 2 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007954s
32.42/32.46	Time used: 4.00253
32.42/32.46	Solving with 3 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.030673s
32.42/32.46	Time used: 1.00131
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012353s
32.42/32.46	Time used: 0.008727
32.42/32.46	
32.42/32.46	Proving non-termination of subgraph 1
32.42/32.46	Transitions:
32.42/32.46	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	Variables:
32.42/32.46	d_6^0, i_5^0
32.42/32.46	
32.42/32.46	Checking conditional non-termination of SCC {l3}...
32.42/32.46	EXIT TRANSITIONS:
32.42/32.46	<l3, end, 1 + i_5^0 <= 0, {all remain the same}>
32.42/32.46	
32.42/32.46	Solving with 1 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005466s
32.42/32.46	Time used: 0.005359
32.42/32.46	Solving with 2 template(s).
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetFirstSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016800s
32.42/32.46	Time used: 0.01649
32.42/32.46	Improving Solution with cost 1 ...
32.42/32.46	
32.42/32.46	LOG: CALL solveNonLinearGetNextSolution
32.42/32.46	
32.42/32.46	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015808s
32.42/32.46	Time used: 0.0158
32.42/32.46	
32.42/32.46	LOG: SAT solveNonLinear - Elapsed time: 0.032608s
32.42/32.46	Cost: 1; Total time: 0.03229
32.42/32.46	Failed at location 3: 1 <= i_5^0
32.42/32.46	Before Improving: 
32.42/32.46	Quasi-invariant at l3: 1 <= i_5^0
32.42/32.46	Quasi-invariant at l3: d_6^0 <= 0
32.42/32.46	Optimizing invariants...
32.42/32.46	
32.42/32.46	LOG: CALL solveLinear
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear - Elapsed time: 0.004088s
32.42/32.46	Remaining time after improvement: 0.998278
32.42/32.46	Non-termination implied by a set of quasi-invariant(s):
32.42/32.46	Quasi-invariant at l3: 1 <= i_5^0
32.42/32.46	Quasi-invariant at l3: d_6^0 <= 0
32.42/32.46	
32.42/32.46	Strengthening and disabling EXIT transitions...
32.42/32.46	Closed exits from l3: 1
32.42/32.46	
32.42/32.46	Strengthening and disabling transitions...
32.42/32.46	
32.42/32.46	LOG: CALL solverLinear in Graph for feasibility
32.42/32.46	
32.42/32.46	LOG: RETURN solveLinear in Graph for feasibility
32.42/32.46	Strengthening transition (result): 
32.42/32.46	<l3, l3, 1 <= i_5^0 /\ d_6^0 <= 0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.42/32.46	
32.42/32.46	Calling reachability with...
32.42/32.46	Transition: <l3, end, true, {all remain the same}>
32.42/32.47	Conditions: 1 <= i_5^0, d_6^0 <= 0, 
32.42/32.47	OPEN EXITS: 
32.42/32.47	<l3, end, 1 <= i_5^0, {all remain the same}> (condsUp: d_6^0 <= 0)
32.42/32.47	
32.42/32.47	--- Reachability graph ---
32.42/32.47	> Graph without transitions.
32.42/32.47	
32.42/32.47	Calling reachability with...
32.42/32.47	Transition: <l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.42/32.47	Conditions: 1 <= i_5^0, d_6^0 <= 0, 
32.42/32.47	OPEN EXITS: 
32.42/32.47	<l0, l3, 1 + d_6^0 <= 0 /\ 1 <= i_5^0, {all remain the same}>
32.42/32.47	
32.42/32.47	> Conditions are reachable!
32.42/32.47	
32.42/32.47	Program does NOT terminate
32.42/32.47	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
32.42/32.47	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
32.42/32.47	EOF