0.00/0.05	YES
0.00/0.05	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l18, true>
0.00/0.06	<l1, l2, ((0 + nodecount^0) <= (0 + i^0))>
0.00/0.06	<l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l5, true>
0.00/0.06	<l6, l7, true, par{i^0 -> (1 + i^0)}>
0.00/0.06	<l6, l2, true>
0.00/0.06	<l8, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l8, l6, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef48 = undef48) /\ (undef49 = undef49), par{x^0 -> undef48, y^0 -> undef49}>
0.00/0.06	<l9, l10, true>
0.00/0.06	<l11, l12, true, par{j^0 -> (1 + j^0)}>
0.00/0.06	<l12, l13, true>
0.00/0.06	<l13, l9, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l13, l11, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef83 = undef83) /\ (undef84 = undef84), par{x^0 -> undef83, y^0 -> undef84}>
0.00/0.06	<l10, l7, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l10, l12, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}>
0.00/0.06	<l14, l15, true>
0.00/0.06	<l15, l4, true, par{i^0 -> (1 + i^0)}>
0.00/0.06	<l7, l8, true>
0.00/0.06	<l16, l14, ((1 + source^0) <= (0 + i^0))>
0.00/0.06	<l16, l14, ((1 + i^0) <= (0 + source^0))>
0.00/0.06	<l16, l15, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))>
0.00/0.06	<l5, l9, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l5, l16, ((1 + i^0) <= (0 + nodecount^0))>
0.00/0.06	<l3, l1, true>
0.00/0.06	<l17, l4, true, par{edgecount^0 -> 6, i^0 -> 0, nodecount^0 -> 5, source^0 -> 0}>
0.00/0.06	<l18, l17, true>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef48, undef49, undef83, undef84, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef48, undef49, undef83, undef84, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l4, (6 = 6) /\ (i^0 = 0) /\ (5 = 5) /\ (0 = 0)>
0.00/0.06	<l3, l2, ((0 + 5) <= (0 + i^0))>
0.00/0.06	<l3, l3, ((1 + i^0) <= (0 + 5)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l12, ((0 + 5) <= (0 + i^0)) /\ ((1 + 0) <= (0 + 5)), par{i^0 -> 0, j^0 -> 0}>
0.00/0.06	<l4, l4, ((1 + i^0) <= (0 + 5)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l4, ((1 + i^0) <= (0 + 5)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l4, ((1 + i^0) <= (0 + 5)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l7, l3, ((0 + 6) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l7, l7, ((1 + i^0) <= (0 + 6)) /\ (undef48 = undef48) /\ (undef49 = undef49), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l7, l2, ((1 + i^0) <= (0 + 6)) /\ (undef48 = undef48) /\ (undef49 = undef49)>
0.00/0.06	<l12, l7, ((0 + 6) <= (0 + j^0)) /\ ((0 + 5) <= (0 + (1 + i^0))), par{i^0 -> 0}>
0.00/0.06	<l12, l12, ((0 + 6) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + 5)), par{i^0 -> (1 + i^0), j^0 -> 0}>
0.00/0.06	<l12, l12, ((1 + j^0) <= (0 + 6)) /\ (undef83 = undef83) /\ (undef84 = undef84), par{j^0 -> (1 + j^0)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef48, undef49, undef83, undef84, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef48, undef49, undef83, undef84, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l4, l4, 1 <= i^0 /\ i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	<l4, l4, 1 + i^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	<l4, l4, i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	<l12, l12, 6 <= j^0 /\ i^0 <= 3, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
0.00/0.06	<l12, l12, j^0 <= 5, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0, j^0
0.00/0.06	
0.00/0.06	Graph 3:
0.00/0.06	Transitions:
0.00/0.06	<l7, l7, i^0 <= 5, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0
0.00/0.06	
0.00/0.06	Graph 4:
0.00/0.06	Transitions:
0.00/0.06	<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0
0.00/0.06	
0.00/0.06	Graph 5:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l4, i^0 = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l4, l12, 5 <= i^0, {i^0 -> 0, j^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 3
0.00/0.06	<l12, l7, 6 <= j^0 /\ 4 <= i^0, {i^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 4
0.00/0.06	<l7, l3, 6 <= i^0, {i^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 5
0.00/0.06	<l3, l2, 5 <= i^0, {all remain the same}>
0.00/0.06	<l7, l2, i^0 <= 5, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 2 , 5 )
0.00/0.06	( 3 , 4 )
0.00/0.06	( 4 , 1 )
0.00/0.06	( 7 , 3 )
0.00/0.06	( 12 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.004624
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l4: 0 <= i^0
0.00/0.06	
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	> It's unfeasible. Removing transition: 
0.00/0.06	<l4, l4, 1 + i^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l4, l4, 1 <= i^0 /\ i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l4, l4, i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.002391
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l4}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000923s
0.00/0.06	Ranking function: 4 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.008008
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l12}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001186s
0.00/0.06	Ranking function: 3 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l12, l12, j^0 <= 5, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	j^0
0.00/0.06	Checking conditional termination of SCC {l12}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000555s
0.00/0.06	Ranking function: 5 - j^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 3
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001234
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l7}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000611s
0.00/0.06	Ranking function: 5 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 4
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001205
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l3}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000620s
0.00/0.06	Ranking function: 4 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 5
0.00/0.06	Analyzing SCC {l2}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.06	EOF