0.00/0.04	YES
0.00/0.04	
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, l7, true>
0.00/0.04	<l1, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef4, oldX4^0 -> undef5, oldX5^0 -> undef6, x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l3, l4, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> undef12, x0^0 -> (0 + undef10), x1^0 -> (1 + undef11), x2^0 -> (1 + undef12)}>
0.00/0.04	<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef19) <= (0 + undef20)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef21)}>
0.00/0.04	<l4, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ ((1 + undef29) <= (0 + undef28)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
0.00/0.04	<l5, l4, (undef40 = undef40) /\ (undef41 = undef41), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> 0}>
0.00/0.04	<l6, l5, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef49, oldX4^0 -> undef50, oldX5^0 -> undef51, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
0.00/0.04	<l6, l2, true>
0.00/0.04	<l6, l1, true>
0.00/0.04	<l6, l3, true>
0.00/0.04	<l6, l4, true>
0.00/0.04	<l6, l5, true>
0.00/0.04	<l7, l6, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 
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, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + (0 + undef40))) /\ (undef20 = (0 + (0 + undef41))) /\ (undef21 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l0, l3, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + (0 + undef40))) /\ (undef29 = (0 + (0 + undef41))) /\ (undef30 = (0 + 0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
0.00/0.04	<l0, l2, true>
0.00/0.04	<l0, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l0, l3, true>
0.00/0.04	<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l0, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
0.00/0.04	<l0, l2, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + (0 + undef40))) /\ (undef20 = (0 + (0 + undef41))) /\ (undef21 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l0, l3, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + (0 + undef40))) /\ (undef29 = (0 + (0 + undef41))) /\ (undef30 = (0 + 0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
0.00/0.04	<l3, l2, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef19 = (0 + (0 + undef10))) /\ (undef20 = (0 + (1 + undef11))) /\ (undef21 = (0 + (1 + undef12))) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
0.00/0.04	<l3, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef28 = (0 + (0 + undef10))) /\ (undef29 = (0 + (1 + undef11))) /\ (undef30 = (0 + (1 + undef12))) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 
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	<l3, l3, 1 + undef29 <= undef28 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef28 /\ 1 + undef11 = undef29 /\ 1 + undef12 = undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	x0^0, x1^0, x2^0
0.00/0.04	
0.00/0.04	Graph 2:
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, l3, 1 + undef29 <= undef28 /\ undef28 = undef40 /\ undef29 = undef41 /\ undef30 = 0, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
0.00/0.04	<l0, l3, true, {all remain the same}>
0.00/0.04	<l0, l3, 1 + undef29 <= undef28 /\ x0^0 = undef28 /\ x1^0 = undef29 /\ x2^0 = undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
0.00/0.04	<l0, l3, 1 + undef29 <= undef28 /\ undef28 = undef40 /\ undef29 = undef41 /\ undef30 = 0, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l2, undef19 <= undef20 /\ undef19 = undef40 /\ undef20 = undef41 /\ undef21 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
0.00/0.04	<l0, l2, true, {all remain the same}>
0.00/0.04	<l0, l2, true, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
0.00/0.04	<l0, l2, undef19 <= undef20 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ x2^0 = undef21, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
0.00/0.04	<l0, l2, undef19 <= undef20 /\ undef19 = undef40 /\ undef20 = undef41 /\ undef21 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
0.00/0.04	<l3, l2, undef19 <= undef20 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef19 /\ 1 + undef11 = undef20 /\ 1 + undef12 = undef21, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest 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 , 2 )
0.00/0.04	( 3 , 1 )
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.003581
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l3}...
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.001365s
0.00/0.04	Ranking function: -2 + x0^0 - x1^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l2}...
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