1.08/1.11	YES
1.08/1.11	
1.08/1.11	Solver Timeout: 4
1.08/1.11	Global Timeout: 300
1.08/1.11	No parsing errors!
1.08/1.11	Init Location: 0
1.08/1.11	Transitions:
1.08/1.11	<l0, l14, true>
1.08/1.11	<l1, l2, ((0 + __const_5^0) <= (0 + i2^0))>
1.08/1.11	<l1, l3, ((1 + i2^0) <= (0 + __const_5^0)), par{j3^0 -> 0}>
1.08/1.11	<l4, l1, true>
1.08/1.11	<l3, l5, true>
1.08/1.11	<l2, l6, true>
1.08/1.11	<l7, l8, true>
1.08/1.11	<l9, l10, true, par{l5^0 -> (1 + l5^0)}>
1.08/1.11	<l10, l11, true>
1.08/1.11	<l12, l9, true>
1.08/1.11	<l12, l2, true>
1.08/1.11	<l12, l9, true>
1.08/1.11	<l11, l7, ((0 + __const_5^0) <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
1.08/1.11	<l11, l12, ((1 + l5^0) <= (0 + __const_5^0))>
1.08/1.11	<l8, l3, ((0 + __const_5^0) <= (0 + k4^0)), par{j3^0 -> (1 + j3^0)}>
1.08/1.11	<l8, l10, ((1 + k4^0) <= (0 + __const_5^0)), par{l5^0 -> 0}>
1.08/1.11	<l5, l4, ((0 + __const_5^0) <= (0 + j3^0)), par{i2^0 -> (1 + i2^0)}>
1.08/1.11	<l5, l7, ((1 + j3^0) <= (0 + __const_5^0)), par{k4^0 -> 0}>
1.08/1.11	<l13, l4, true, par{i2^0 -> 0, x1^0 -> (0 + __const_400^0)}>
1.08/1.11	<l14, l13, true>
1.08/1.11	
1.08/1.11	Fresh variables:
1.08/1.11	
1.08/1.11	Undef variables:
1.08/1.11	
1.08/1.11	Abstraction variables:
1.08/1.11	
1.08/1.11	Exit nodes:
1.08/1.11	
1.08/1.11	Accepting locations:
1.08/1.11	
1.08/1.11	Asserts:
1.08/1.11	
1.08/1.11	Preprocessed LLVMGraph
1.08/1.11	Init Location: 0
1.08/1.11	Transitions:
1.08/1.11	<l0, l4, (i2^0 = 0)>
1.08/1.11	<l4, l6, ((0 + __const_5^0) <= (0 + i2^0))>
1.08/1.11	<l4, l4, ((1 + i2^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + 0)), par{i2^0 -> (1 + i2^0), j3^0 -> 0}>
1.08/1.11	<l4, l7, ((1 + i2^0) <= (0 + __const_5^0)) /\ ((1 + 0) <= (0 + __const_5^0)), par{j3^0 -> 0, k4^0 -> 0}>
1.08/1.11	<l7, l4, ((0 + __const_5^0) <= (0 + k4^0)) /\ ((0 + __const_5^0) <= (0 + (1 + j3^0))), par{i2^0 -> (1 + i2^0), j3^0 -> (1 + j3^0)}>
1.08/1.11	<l7, l7, ((0 + __const_5^0) <= (0 + k4^0)) /\ ((1 + (1 + j3^0)) <= (0 + __const_5^0)), par{j3^0 -> (1 + j3^0), k4^0 -> 0}>
1.08/1.11	<l7, l10, ((1 + k4^0) <= (0 + __const_5^0)), par{l5^0 -> 0}>
1.08/1.11	<l10, l7, ((0 + __const_5^0) <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
1.08/1.11	<l10, l10, ((1 + l5^0) <= (0 + __const_5^0)), par{l5^0 -> (1 + l5^0)}>
1.08/1.11	<l10, l6, ((1 + l5^0) <= (0 + __const_5^0))>
1.08/1.11	<l10, l10, ((1 + l5^0) <= (0 + __const_5^0)), par{l5^0 -> (1 + l5^0)}>
1.08/1.11	
1.08/1.11	Fresh variables:
1.08/1.11	
1.08/1.11	Undef variables:
1.08/1.11	
1.08/1.11	Abstraction variables:
1.08/1.11	
1.08/1.11	Exit nodes:
1.08/1.11	
1.08/1.11	Accepting locations:
1.08/1.11	
1.08/1.11	Asserts:
1.08/1.11	
1.08/1.11	*************************************************************
1.08/1.11	*******************************************************************************************
1.08/1.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.08/1.11	*******************************************************************************************
1.08/1.11	
1.08/1.11	Init Location: 0
1.08/1.11	Graph 0:
1.08/1.11	Transitions:
1.08/1.11	Variables:
1.08/1.11	
1.08/1.11	Graph 1:
1.08/1.11	Transitions:
1.08/1.11	<l4, l4, __const_5^0 <= 0 /\ 1 + i2^0 <= __const_5^0, {i2^0 -> 1 + i2^0, j3^0 -> 0, rest remain the same}>
1.08/1.11	<l4, l7, 1 <= __const_5^0 /\ 1 + i2^0 <= __const_5^0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>
1.08/1.11	<l7, l4, __const_5^0 <= k4^0 /\ __const_5^0 <= 1 + j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.11	<l7, l7, __const_5^0 <= k4^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.11	<l7, l10, 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.11	<l10, l7, __const_5^0 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.11	<l10, l10, 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.11	<l10, l10, 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.11	Variables:
1.08/1.11	__const_5^0, i2^0, j3^0, k4^0, l5^0
1.08/1.11	
1.08/1.11	Graph 2:
1.08/1.11	Transitions:
1.08/1.11	Variables:
1.08/1.11	
1.08/1.11	Precedence: 
1.08/1.11	Graph 0
1.08/1.11	
1.08/1.11	Graph 1
1.08/1.11	<l0, l4, i2^0 = 0, {all remain the same}>
1.08/1.11	
1.08/1.11	Graph 2
1.08/1.11	<l4, l6, __const_5^0 <= i2^0, {all remain the same}>
1.08/1.11	<l10, l6, 1 + l5^0 <= __const_5^0, {all remain the same}>
1.08/1.11	
1.08/1.11	Map Locations to Subgraph:
1.08/1.11	( 0 , 0 )
1.08/1.11	( 4 , 1 )
1.08/1.11	( 6 , 2 )
1.08/1.11	( 7 , 1 )
1.08/1.11	( 10 , 1 )
1.08/1.11	
1.08/1.11	*******************************************************************************************
1.08/1.11	********************************    CHECKING ASSERTIONS    ********************************
1.08/1.11	*******************************************************************************************
1.08/1.11	
1.08/1.11	Proving termination of subgraph 0
1.08/1.11	Proving termination of subgraph 1
1.08/1.11	Checking unfeasibility...
1.08/1.11	Time used: 0.070705
1.08/1.11	Some transition disabled by a set of invariant(s):
1.08/1.11	Invariant at l4: 0 <= i2^0
1.08/1.11	Invariant at l7: 0 <= i2^0
1.08/1.11	Invariant at l10: 0 <= i2^0
1.08/1.11	
1.08/1.11	Strengthening and disabling transitions...
1.08/1.11	> It's unfeasible. Removing transition: 
1.08/1.12	<l4, l4, __const_5^0 <= 0 /\ 1 + i2^0 <= __const_5^0, {i2^0 -> 1 + i2^0, j3^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l4, l7, 0 <= i2^0 /\ 1 <= __const_5^0 /\ 1 + i2^0 <= __const_5^0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l4, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ __const_5^0 <= 1 + j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Checking unfeasibility...
1.08/1.12	Time used: 0.036313
1.08/1.12	
1.08/1.12	Checking conditional termination of SCC {l4, l7, l10}...
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.005633s
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.025711s
1.08/1.12	Trying to remove transition: <l10, l10, 0 <= i2^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033134s
1.08/1.12	Time used: 0.031645
1.08/1.12	Trying to remove transition: <l10, l10, 0 <= i2^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034491s
1.08/1.12	Time used: 0.030903
1.08/1.12	Trying to remove transition: <l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032629s
1.08/1.12	Time used: 0.028992
1.08/1.12	Trying to remove transition: <l7, l10, 0 <= i2^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033148s
1.08/1.12	Time used: 0.028342
1.08/1.12	Trying to remove transition: <l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134519s
1.08/1.12	Time used: 0.129615
1.08/1.12	Trying to remove transition: <l7, l4, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ __const_5^0 <= 1 + j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033055s
1.08/1.12	Time used: 0.027542
1.08/1.12	Trying to remove transition: <l4, l7, 0 <= i2^0 /\ 1 <= __const_5^0 /\ 1 + i2^0 <= __const_5^0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030635s
1.08/1.12	Time used: 0.025523
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.244078s
1.08/1.12	Time used: 0.239004
1.08/1.12	
1.08/1.12	LOG: SAT solveNonLinear - Elapsed time: 0.244078s
1.08/1.12	Cost: 0; Total time: 0.239004
1.08/1.12	Termination implied by a set of invariant(s):
1.08/1.12	Invariant at l7: 1 + i2^0 <= __const_5^0
1.08/1.12	Invariant at l10: 1 + i2^0 <= __const_5^0
1.08/1.12	[ Invariant Graph ]
1.08/1.12	Strengthening and disabling transitions...
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l4, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ __const_5^0 <= 1 + j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	[ Termination Graph ]
1.08/1.12	Strengthening and disabling transitions...
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l4, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ __const_5^0 <= 1 + j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Ranking function: __const_5^0 - i2^0
1.08/1.12	New Graphs: 
1.08/1.12	Transitions:
1.08/1.12	<l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Variables:
1.08/1.12	__const_5^0, i2^0, j3^0, k4^0, l5^0
1.08/1.12	Checking conditional termination of SCC {l7, l10}...
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.003845s
1.08/1.12	Ranking function: -6 + 3*__const_5^0 - 3*j3^0
1.08/1.12	New Graphs: 
1.08/1.12	Transitions:
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	<l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Variables:
1.08/1.12	__const_5^0, i2^0, k4^0, l5^0
1.08/1.12	Checking conditional termination of SCC {l7, l10}...
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.002053s
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.011765s
1.08/1.12	Trying to remove transition: <l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028339s
1.08/1.12	Time used: 0.027444
1.08/1.12	Trying to remove transition: <l10, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028626s
1.08/1.12	Time used: 0.02672
1.08/1.12	Trying to remove transition: <l10, l7, __const_5^0 <= l5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023558s
1.08/1.12	Time used: 0.021729
1.08/1.12	Trying to remove transition: <l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019980s
1.08/1.12	Time used: 0.017402
1.08/1.12	Solving with 1 template(s).
1.08/1.12	
1.08/1.12	LOG: CALL solveNonLinearGetFirstSolution
1.08/1.12	
1.08/1.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092900s
1.08/1.12	Time used: 0.090363
1.08/1.12	
1.08/1.12	LOG: SAT solveNonLinear - Elapsed time: 0.092900s
1.08/1.12	Cost: 0; Total time: 0.090363
1.08/1.12	Termination implied by a set of invariant(s):
1.08/1.12	Invariant at l4: 0 <= i2^0
1.08/1.12	Invariant at l7: 0 <= 1 + __const_5^0
1.08/1.12	Invariant at l10: k4^0 <= __const_5^0
1.08/1.12	[ Invariant Graph ]
1.08/1.12	Strengthening and disabling transitions...
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l4, l7, 0 <= i2^0 /\ 1 <= __const_5^0 /\ 1 + i2^0 <= __const_5^0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l4, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ __const_5^0 <= 1 + j3^0 /\ 0 <= 1 + __const_5^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l7, __const_5^0 <= k4^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 0 <= 1 + __const_5^0 /\ 2 + j3^0 <= __const_5^0, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0 /\ 0 <= 1 + __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	[ Termination Graph ]
1.08/1.12	Strengthening and disabling transitions...
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l7, l10, 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + k4^0 <= __const_5^0 /\ 0 <= 1 + __const_5^0, {l5^0 -> 0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l7, __const_5^0 <= l5^0 /\ k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	
1.08/1.12	LOG: CALL solverLinear in Graph for feasibility
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear in Graph for feasibility
1.08/1.12	Strengthening transition (result): 
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Ranking function: __const_5^0 - k4^0
1.08/1.12	New Graphs: 
1.08/1.12	Transitions:
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	<l10, l10, k4^0 <= __const_5^0 /\ 0 <= i2^0 /\ 1 + i2^0 <= __const_5^0 /\ 1 + l5^0 <= __const_5^0, {l5^0 -> 1 + l5^0, rest remain the same}>
1.08/1.12	Variables:
1.08/1.12	__const_5^0, i2^0, k4^0, l5^0
1.08/1.12	Checking conditional termination of SCC {l10}...
1.08/1.12	
1.08/1.12	LOG: CALL solveLinear
1.08/1.12	
1.08/1.12	LOG: RETURN solveLinear - Elapsed time: 0.002539s
1.08/1.12	Ranking function: -1 + __const_5^0 - l5^0
1.08/1.12	New Graphs: 
1.08/1.12	INVARIANTS: 
1.08/1.12	7: 1 + i2^0 <= __const_5^0 , 
1.08/1.12	10: 1 + i2^0 <= __const_5^0 , 
1.08/1.12	Quasi-INVARIANTS to narrow Graph: 
1.08/1.12	7: 
1.08/1.12	10: 
1.08/1.12	INVARIANTS: 
1.08/1.12	4: 0 <= i2^0 , 
1.08/1.12	7: 0 <= 1 + __const_5^0 , 
1.08/1.12	10: k4^0 <= __const_5^0 , 
1.08/1.12	Quasi-INVARIANTS to narrow Graph: 
1.08/1.12	4: 
1.08/1.12	7: 
1.08/1.12	10: 
1.08/1.12	Proving termination of subgraph 2
1.08/1.12	Analyzing SCC {l6}...
1.08/1.12	No cycles found.
1.08/1.12	
1.08/1.12	Program Terminates
1.08/1.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.08/1.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.08/1.12	EOF