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