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