0.00/0.02	YES
0.00/0.02	
0.00/0.02	Solver Timeout: 4
0.00/0.02	Global Timeout: 300
0.00/0.02	No parsing errors!
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l7, true>
0.00/0.02	<l1, l2, true>
0.00/0.02	<l3, l4, ((0 + __const_10^0) <= (0 + i911^0))>
0.00/0.02	<l3, l5, ((1 + i911^0) <= (0 + __const_10^0)), par{i911^0 -> (1 + i911^0)}>
0.00/0.02	<l5, l3, true>
0.00/0.02	<l2, l5, ((0 + __const_10^0) <= (0 + i57^0)) /\ (undef30 = undef30), par{i911^0 -> 0, x79^0 -> undef30}>
0.00/0.02	<l2, l1, ((1 + i57^0) <= (0 + __const_10^0)), par{i57^0 -> (1 + i57^0)}>
0.00/0.02	<l6, l1, (undef40 = undef40) /\ (undef41 = undef41), par{i57^0 -> 0, tmp^0 -> undef40, x35^0 -> undef41}>
0.00/0.02	<l7, l6, true>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef30, undef40, undef41, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef30, undef40, undef41, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	Preprocessed LLVMGraph
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l1, (i57^0 = 0) /\ (undef40 = undef40) /\ (undef41 = undef41)>
0.00/0.02	<l1, l5, ((0 + __const_10^0) <= (0 + i57^0)) /\ (undef30 = undef30), par{i911^0 -> 0}>
0.00/0.02	<l1, l1, ((1 + i57^0) <= (0 + __const_10^0)), par{i57^0 -> (1 + i57^0)}>
0.00/0.02	<l5, l4, ((0 + __const_10^0) <= (0 + i911^0))>
0.00/0.02	<l5, l5, ((1 + i911^0) <= (0 + __const_10^0)), par{i911^0 -> (1 + i911^0)}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef30, undef40, undef41, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef30, undef40, undef41, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	*************************************************************
0.00/0.02	*******************************************************************************************
0.00/0.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Init Location: 0
0.00/0.02	Graph 0:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Graph 1:
0.00/0.02	Transitions:
0.00/0.02	<l1, l1, 1 + i57^0 <= __const_10^0, {i57^0 -> 1 + i57^0, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	__const_10^0, i57^0
0.00/0.02	
0.00/0.02	Graph 2:
0.00/0.02	Transitions:
0.00/0.02	<l5, l5, 1 + i911^0 <= __const_10^0, {i911^0 -> 1 + i911^0, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	__const_10^0, i911^0
0.00/0.02	
0.00/0.02	Graph 3:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Precedence: 
0.00/0.02	Graph 0
0.00/0.02	
0.00/0.02	Graph 1
0.00/0.02	<l0, l1, i57^0 = 0, {all remain the same}>
0.00/0.02	
0.00/0.02	Graph 2
0.00/0.02	<l1, l5, __const_10^0 <= i57^0, {i911^0 -> 0, rest remain the same}>
0.00/0.02	
0.00/0.02	Graph 3
0.00/0.02	<l5, l4, __const_10^0 <= i911^0, {all remain the same}>
0.00/0.02	
0.00/0.02	Map Locations to Subgraph:
0.00/0.02	( 0 , 0 )
0.00/0.02	( 1 , 1 )
0.00/0.02	( 4 , 3 )
0.00/0.02	( 5 , 2 )
0.00/0.02	
0.00/0.02	*******************************************************************************************
0.00/0.02	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Proving termination of subgraph 0
0.00/0.02	Proving termination of subgraph 1
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.001908
0.00/0.02	
0.00/0.02	Checking conditional termination of SCC {l1}...
0.00/0.02	
0.00/0.02	LOG: CALL solveLinear
0.00/0.02	
0.00/0.02	LOG: RETURN solveLinear - Elapsed time: 0.000799s
0.00/0.02	Ranking function: -1 + __const_10^0 - i57^0
0.00/0.02	New Graphs: 
0.00/0.02	Proving termination of subgraph 2
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.001684
0.00/0.02	
0.00/0.02	Checking conditional termination of SCC {l5}...
0.00/0.02	
0.00/0.02	LOG: CALL solveLinear
0.00/0.02	
0.00/0.02	LOG: RETURN solveLinear - Elapsed time: 0.000810s
0.00/0.02	Ranking function: -1 + __const_10^0 - i911^0
0.00/0.02	New Graphs: 
0.00/0.02	Proving termination of subgraph 3
0.00/0.02	Analyzing SCC {l4}...
0.00/0.02	No cycles found.
0.00/0.02	
0.00/0.02	Program Terminates
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF