0.00/0.37	YES
0.00/0.37	
0.00/0.37	Solver Timeout: 4
0.00/0.37	Global Timeout: 300
0.00/0.37	No parsing errors!
0.00/0.37	Init Location: 0
0.00/0.37	Transitions:
0.00/0.37	<l0, l13, true>
0.00/0.37	<l1, l2, true>
0.00/0.37	<l3, l4, true>
0.00/0.37	<l5, l6, true>
0.00/0.37	<l7, l8, true>
0.00/0.37	<l9, l7, (6 <= (0 + k6^0)), par{j5^0 -> (1 + j5^0)}>
0.00/0.37	<l9, l10, ((0 + k6^0) <= 5), par{k6^0 -> (1 + k6^0)}>
0.00/0.37	<l8, l5, (6 <= (0 + j5^0)), par{i4^0 -> (1 + i4^0)}>
0.00/0.37	<l8, l10, ((0 + j5^0) <= 5), par{k6^0 -> 1}>
0.00/0.37	<l6, l11, (6 <= (0 + i4^0))>
0.00/0.37	<l6, l7, ((0 + i4^0) <= 5), par{j5^0 -> 1}>
0.00/0.37	<l10, l9, true>
0.00/0.37	<l4, l1, (6 <= (0 + j5^0)), par{i4^0 -> (1 + i4^0)}>
0.00/0.37	<l4, l3, ((0 + j5^0) <= 5), par{j5^0 -> (1 + j5^0)}>
0.00/0.37	<l2, l5, (6 <= (0 + i4^0)), par{i4^0 -> 1}>
0.00/0.37	<l2, l3, ((0 + i4^0) <= 5), par{j5^0 -> 1}>
0.00/0.37	<l12, l1, true, par{i4^0 -> 1}>
0.00/0.37	<l13, l12, true>
0.00/0.37	
0.00/0.37	Fresh variables:
0.00/0.37	
0.00/0.37	Undef variables:
0.00/0.37	
0.00/0.37	Abstraction variables:
0.00/0.37	
0.00/0.37	Exit nodes:
0.00/0.37	
0.00/0.37	Accepting locations:
0.00/0.37	
0.00/0.37	Asserts:
0.00/0.37	
0.00/0.37	Preprocessed LLVMGraph
0.00/0.37	Init Location: 0
0.00/0.37	Transitions:
0.00/0.37	<l0, l3, (i4^0 = 1) /\ ((0 + 1) <= 5), par{j5^0 -> 1}>
0.00/0.37	<l3, l7, (6 <= (0 + j5^0)) /\ (6 <= (0 + (1 + i4^0))) /\ ((0 + 1) <= 5), par{i4^0 -> 1, j5^0 -> 1}>
0.00/0.37	<l3, l3, (6 <= (0 + j5^0)) /\ ((0 + (1 + i4^0)) <= 5), par{i4^0 -> (1 + i4^0), j5^0 -> 1}>
0.00/0.37	<l3, l3, ((0 + j5^0) <= 5), par{j5^0 -> (1 + j5^0)}>
0.00/0.37	<l7, l11, (6 <= (0 + j5^0)) /\ (6 <= (0 + (1 + i4^0))), par{i4^0 -> (1 + i4^0)}>
0.00/0.37	<l7, l7, (6 <= (0 + j5^0)) /\ ((0 + (1 + i4^0)) <= 5), par{i4^0 -> (1 + i4^0), j5^0 -> 1}>
0.00/0.37	<l7, l10, ((0 + j5^0) <= 5), par{k6^0 -> 1}>
0.00/0.37	<l10, l7, (6 <= (0 + k6^0)), par{j5^0 -> (1 + j5^0)}>
0.00/0.37	<l10, l10, ((0 + k6^0) <= 5), par{k6^0 -> (1 + k6^0)}>
0.00/0.37	
0.00/0.37	Fresh variables:
0.00/0.37	
0.00/0.37	Undef variables:
0.00/0.37	
0.00/0.37	Abstraction variables:
0.00/0.37	
0.00/0.37	Exit nodes:
0.00/0.37	
0.00/0.37	Accepting locations:
0.00/0.37	
0.00/0.37	Asserts:
0.00/0.37	
0.00/0.37	*************************************************************
0.00/0.37	*******************************************************************************************
0.00/0.37	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.37	*******************************************************************************************
0.00/0.37	
0.00/0.37	Init Location: 0
0.00/0.37	Graph 0:
0.00/0.37	Transitions:
0.00/0.37	Variables:
0.00/0.37	
0.00/0.37	Graph 1:
0.00/0.37	Transitions:
0.00/0.37	<l3, l3, 6 <= j5^0 /\ i4^0 <= 4, {i4^0 -> 1 + i4^0, j5^0 -> 1, rest remain the same}>
0.00/0.37	<l3, l3, j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.37	Variables:
0.00/0.37	i4^0, j5^0
0.00/0.37	
0.00/0.37	Graph 2:
0.00/0.37	Transitions:
0.00/0.37	<l7, l7, 6 <= j5^0 /\ i4^0 <= 4, {i4^0 -> 1 + i4^0, j5^0 -> 1, rest remain the same}>
0.00/0.37	<l7, l10, j5^0 <= 5, {k6^0 -> 1, rest remain the same}>
0.00/0.37	<l10, l7, 6 <= k6^0, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.37	<l10, l10, k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.37	Variables:
0.00/0.37	i4^0, j5^0, k6^0
0.00/0.37	
0.00/0.37	Graph 3:
0.00/0.37	Transitions:
0.00/0.37	Variables:
0.00/0.37	
0.00/0.37	Precedence: 
0.00/0.37	Graph 0
0.00/0.37	
0.00/0.37	Graph 1
0.00/0.37	<l0, l3, i4^0 = 1, {j5^0 -> 1, rest remain the same}>
0.00/0.37	
0.00/0.37	Graph 2
0.00/0.37	<l3, l7, 6 <= j5^0 /\ 5 <= i4^0, {i4^0 -> 1, j5^0 -> 1, rest remain the same}>
0.00/0.37	
0.00/0.37	Graph 3
0.00/0.37	<l7, l11, 6 <= j5^0 /\ 5 <= i4^0, {i4^0 -> 1 + i4^0, rest remain the same}>
0.00/0.37	
0.00/0.37	Map Locations to Subgraph:
0.00/0.37	( 0 , 0 )
0.00/0.37	( 3 , 1 )
0.00/0.37	( 7 , 2 )
0.00/0.37	( 10 , 2 )
0.00/0.37	( 11 , 3 )
0.00/0.37	
0.00/0.37	*******************************************************************************************
0.00/0.37	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.37	*******************************************************************************************
0.00/0.37	
0.00/0.37	Proving termination of subgraph 0
0.00/0.37	Proving termination of subgraph 1
0.00/0.37	Checking unfeasibility...
0.00/0.37	Time used: 0.010184
0.00/0.37	
0.00/0.37	Checking conditional termination of SCC {l3}...
0.00/0.37	
0.00/0.37	LOG: CALL solveLinear
0.00/0.37	
0.00/0.37	LOG: RETURN solveLinear - Elapsed time: 0.001150s
0.00/0.37	Ranking function: 4 - i4^0
0.00/0.37	New Graphs: 
0.00/0.37	Transitions:
0.00/0.37	<l3, l3, j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.37	Variables:
0.00/0.37	j5^0
0.00/0.37	Checking conditional termination of SCC {l3}...
0.00/0.37	
0.00/0.37	LOG: CALL solveLinear
0.00/0.37	
0.00/0.37	LOG: RETURN solveLinear - Elapsed time: 0.000487s
0.00/0.37	Ranking function: 5 - j5^0
0.00/0.37	New Graphs: 
0.00/0.37	Proving termination of subgraph 2
0.00/0.37	Checking unfeasibility...
0.00/0.37	Time used: 0.149597
0.00/0.37	
0.00/0.37	Checking conditional termination of SCC {l7, l10}...
0.00/0.37	
0.00/0.37	LOG: CALL solveLinear
0.00/0.37	
0.00/0.37	LOG: RETURN solveLinear - Elapsed time: 0.002392s
0.00/0.37	Ranking function: 4 - i4^0
0.00/0.37	New Graphs: 
0.00/0.37	Transitions:
0.00/0.37	<l7, l10, j5^0 <= 5, {k6^0 -> 1, rest remain the same}>
0.00/0.37	<l10, l7, 6 <= k6^0, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.37	<l10, l10, k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.38	Variables:
0.00/0.38	j5^0, k6^0
0.00/0.38	Checking conditional termination of SCC {l7, l10}...
0.00/0.38	
0.00/0.38	LOG: CALL solveLinear
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear - Elapsed time: 0.000811s
0.00/0.38	
0.00/0.38	LOG: CALL solveLinear
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear - Elapsed time: 0.004299s
0.00/0.38	Trying to remove transition: <l10, l10, k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.38	Solving with 1 template(s).
0.00/0.38	
0.00/0.38	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.38	
0.00/0.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024759s
0.00/0.38	Time used: 0.024581
0.00/0.38	Trying to remove transition: <l10, l7, 6 <= k6^0, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.38	Solving with 1 template(s).
0.00/0.38	
0.00/0.38	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.38	
0.00/0.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010329s
0.00/0.38	Time used: 0.009737
0.00/0.38	Trying to remove transition: <l7, l10, j5^0 <= 5, {k6^0 -> 1, rest remain the same}>
0.00/0.38	Solving with 1 template(s).
0.00/0.38	
0.00/0.38	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.38	
0.00/0.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008371s
0.00/0.38	Time used: 0.007725
0.00/0.38	Solving with 1 template(s).
0.00/0.38	
0.00/0.38	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.38	
0.00/0.38	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.116443s
0.00/0.38	Time used: 0.115806
0.00/0.38	
0.00/0.38	LOG: SAT solveNonLinear - Elapsed time: 0.116443s
0.00/0.38	Cost: 0; Total time: 0.115806
0.00/0.38	Termination implied by a set of invariant(s):
0.00/0.38	Invariant at l10: j5^0 <= 5
0.00/0.38	[ Invariant Graph ]
0.00/0.38	Strengthening and disabling transitions...
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	Strengthening transition (result): 
0.00/0.38	<l10, l7, 6 <= k6^0 /\ j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	Strengthening transition (result): 
0.00/0.38	<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.38	[ Termination Graph ]
0.00/0.38	Strengthening and disabling transitions...
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	Strengthening transition (result): 
0.00/0.38	<l10, l7, 6 <= k6^0 /\ j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
0.00/0.38	
0.00/0.38	LOG: CALL solverLinear in Graph for feasibility
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.38	Strengthening transition (result): 
0.00/0.38	<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.38	Ranking function: 5 - j5^0
0.00/0.38	New Graphs: 
0.00/0.38	Transitions:
0.00/0.38	<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
0.00/0.38	Variables:
0.00/0.38	j5^0, k6^0
0.00/0.38	Checking conditional termination of SCC {l10}...
0.00/0.38	
0.00/0.38	LOG: CALL solveLinear
0.00/0.38	
0.00/0.38	LOG: RETURN solveLinear - Elapsed time: 0.000808s
0.00/0.38	Ranking function: 5 - k6^0
0.00/0.38	New Graphs: 
0.00/0.38	INVARIANTS: 
0.00/0.38	10: j5^0 <= 5 , 
0.00/0.38	Quasi-INVARIANTS to narrow Graph: 
0.00/0.38	10: 
0.00/0.38	Proving termination of subgraph 3
0.00/0.38	Analyzing SCC {l11}...
0.00/0.38	No cycles found.
0.00/0.38	
0.00/0.38	Program Terminates
0.00/0.38	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.38	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.38	EOF