0.00/0.03	YES
0.00/0.03	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l11, true>
0.00/0.04	<l1, l2, ((0 + k^0) <= (0 + __const_100^0)) /\ (undef6 = undef6), par{i^0 -> 0, tmp___0^0 -> undef6}>
0.00/0.04	<l1, l3, ((1 + __const_100^0) <= (0 + k^0))>
0.00/0.04	<l4, l1, (1 <= (0 + k^0))>
0.00/0.04	<l4, l3, ((0 + k^0) <= 0)>
0.00/0.04	<l2, l5, true>
0.00/0.04	<l6, l3, ((0 + i^0) <= (0 + j^0))>
0.00/0.04	<l6, l7, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
0.00/0.04	<l8, l7, true, par{i^0 -> (~(1) + i^0), j^0 -> 0}>
0.00/0.04	<l7, l6, true>
0.00/0.04	<l9, l2, true, par{i^0 -> (1 + i^0)}>
0.00/0.04	<l9, l8, true>
0.00/0.04	<l5, l8, ((0 + i^0) <= (0 + k^0)) /\ ((0 + k^0) <= (0 + i^0))>
0.00/0.04	<l5, l9, ((1 + k^0) <= (0 + i^0))>
0.00/0.04	<l5, l9, ((1 + i^0) <= (0 + k^0))>
0.00/0.04	<l10, l4, (undef89 = undef89), par{k^0 -> (0 + undef89), tmp^0 -> undef89}>
0.00/0.04	<l11, l10, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef6, undef89, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef6, undef89, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l2, (k^0 = (0 + undef89)) /\ (undef89 = undef89) /\ (1 <= (0 + (0 + undef89))) /\ ((0 + (0 + undef89)) <= (0 + __const_100^0)) /\ (undef6 = undef6), par{i^0 -> 0}>
0.00/0.04	<l0, l3, (k^0 = (0 + undef89)) /\ (undef89 = undef89) /\ (1 <= (0 + (0 + undef89))) /\ ((1 + __const_100^0) <= (0 + (0 + undef89)))>
0.00/0.04	<l0, l3, (k^0 = (0 + undef89)) /\ (undef89 = undef89) /\ ((0 + (0 + undef89)) <= 0)>
0.00/0.04	<l2, l7, ((0 + i^0) <= (0 + k^0)) /\ ((0 + k^0) <= (0 + i^0)), par{i^0 -> (~(1) + i^0), j^0 -> 0}>
0.00/0.04	<l2, l2, ((1 + k^0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l2, l7, ((1 + k^0) <= (0 + i^0)), par{i^0 -> (~(1) + i^0), j^0 -> 0}>
0.00/0.04	<l2, l2, ((1 + i^0) <= (0 + k^0)), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l2, l7, ((1 + i^0) <= (0 + k^0)), par{i^0 -> (~(1) + i^0), j^0 -> 0}>
0.00/0.04	<l7, l3, ((0 + i^0) <= (0 + j^0))>
0.00/0.04	<l7, l7, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef6, undef89, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef6, undef89, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 + k^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	<l2, l2, 1 + i^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i^0, k^0
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l7, l7, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i^0, j^0
0.00/0.04	
0.00/0.04	Graph 3:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l2, undef89 <= __const_100^0 /\ 1 <= undef89 /\ k^0 = undef89, {i^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l2, l7, i^0 = k^0, {i^0 -> -1 + i^0, j^0 -> 0, rest remain the same}>
0.00/0.04	<l2, l7, 1 + k^0 <= i^0, {i^0 -> -1 + i^0, j^0 -> 0, rest remain the same}>
0.00/0.04	<l2, l7, 1 + i^0 <= k^0, {i^0 -> -1 + i^0, j^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 3
0.00/0.04	<l0, l3, 1 + __const_100^0 <= undef89 /\ 1 <= undef89 /\ k^0 = undef89, {all remain the same}>
0.00/0.04	<l0, l3, undef89 <= 0 /\ k^0 = undef89, {all remain the same}>
0.00/0.04	<l7, l3, i^0 <= j^0, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 2 , 1 )
0.00/0.04	( 3 , 3 )
0.00/0.04	( 7 , 2 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.004036
0.00/0.04	Some transition disabled by a set of invariant(s):
0.00/0.04	Invariant at l2: i^0 <= k^0
0.00/0.04	
0.00/0.04	Strengthening and disabling transitions...
0.00/0.04	> It's unfeasible. Removing transition: 
0.00/0.04	<l2, l2, 1 + k^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	
0.00/0.04	LOG: CALL solverLinear in Graph for feasibility
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.04	Strengthening transition (result): 
0.00/0.04	<l2, l2, 1 + i^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001853
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000806s
0.00/0.04	Ranking function: -1 - i^0 + k^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.002137
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l7}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000824s
0.00/0.04	Ranking function: -1 + i^0 - j^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 3
0.00/0.04	Analyzing SCC {l3}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF