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, l6, true>
0.00/0.02	<l1, l2, true>
0.00/0.02	<l3, l1, (undef11 = undef11), par{tmp___0^0 -> undef11}>
0.00/0.02	<l4, l1, ((0 + tmp___1^0) <= ~(1)) /\ (~(1) <= (0 + tmp___1^0)) /\ (undef13 = undef13) /\ (undef15 = undef15), par{__len9^0 -> undef13, __val8^0 -> 0, tmp10^0 -> undef15}>
0.00/0.02	<l4, l3, (0 <= (0 + tmp___1^0))>
0.00/0.02	<l4, l3, ((1 + tmp___1^0) <= ~(1))>
0.00/0.02	<l5, l4, (undef34 = undef34) /\ (undef36 = undef36), par{tmp^0 -> undef34, tmp___1^0 -> undef36}>
0.00/0.02	<l6, l5, true>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef11, undef13, undef15, undef34, undef36, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef11, undef13, undef15, undef34, undef36, 
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, l2, (undef34 = undef34) /\ (undef36 = undef36) /\ ((0 + undef36) <= ~(1)) /\ (~(1) <= (0 + undef36)) /\ (undef13 = undef13) /\ (undef15 = undef15)>
0.00/0.02	<l0, l2, (undef34 = undef34) /\ (undef36 = undef36) /\ (0 <= (0 + undef36)) /\ (undef11 = undef11)>
0.00/0.02	<l0, l2, (undef34 = undef34) /\ (undef36 = undef36) /\ ((1 + undef36) <= ~(1)) /\ (undef11 = undef11)>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef11, undef13, undef15, undef34, undef36, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef11, undef13, undef15, undef34, undef36, 
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	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, l2, 1 + undef36 = 0, {all remain the same}>
0.00/0.02	<l0, l2, 0 <= undef36, {all remain the same}>
0.00/0.02	<l0, l2, 2 + undef36 <= 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	( 2 , 1 )
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	Analyzing SCC {l2}...
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.02	EOF