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, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + (2 * undef7)), x1^0 -> (1 + undef8)}>
0.00/0.04	<l4, l1, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((0 + undef13) <= 2), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}>
0.00/0.04	<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= (0 + undef19)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.00/0.04	<l4, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	<l5, l4, (undef33 = undef33) /\ (undef34 = undef34), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
0.00/0.04	<l6, l5, (undef39 = undef39) /\ (undef40 = undef40), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, oldX3^0 -> undef40, x0^0 -> (0 + undef39), x1^0 -> (0 + undef40)}>
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	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 
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, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef13 = (0 + (0 + undef33))) /\ (undef14 = (0 + (0 + undef34))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l2, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef19 = (0 + (0 + undef33))) /\ (undef20 = (0 + (0 + undef34))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l3, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef25 = (0 + (0 + undef33))) /\ (undef26 = (0 + (0 + undef34))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	<l0, l2, true>
0.00/0.04	<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l3, true>
0.00/0.04	<l0, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	<l0, l2, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef13 = (0 + (0 + undef33))) /\ (undef14 = (0 + (0 + undef34))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l2, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef19 = (0 + (0 + undef33))) /\ (undef20 = (0 + (0 + undef34))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l0, l3, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef25 = (0 + (0 + undef33))) /\ (undef26 = (0 + (0 + undef34))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef13 = (0 + (0 + (2 * undef7)))) /\ (undef14 = (0 + (1 + undef8))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + (2 * undef7)))) /\ (undef20 = (0 + (1 + undef8))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.04	<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef25 = (0 + (0 + (2 * undef7)))) /\ (undef26 = (0 + (1 + undef8))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 
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 + undef25 <= undef26 /\ 3 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	x0^0, x1^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 + undef25 <= undef26 /\ 3 <= undef25 /\ undef25 = undef33 /\ undef26 = undef34, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.04	<l0, l3, true, {all remain the same}>
0.00/0.04	<l0, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.04	<l0, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ undef25 = undef33 /\ undef26 = undef34, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l2, undef13 <= 2 /\ undef13 = undef33 /\ undef14 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, undef20 <= undef19 /\ undef19 = undef33 /\ undef20 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, true, {all remain the same}>
0.00/0.04	<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, undef13 <= 2 /\ x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, undef20 <= undef19 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, undef13 <= 2 /\ undef13 = undef33 /\ undef14 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l0, l2, undef20 <= undef19 /\ undef19 = undef33 /\ undef20 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l3, l2, undef13 <= 2 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef13 /\ 1 + undef8 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.04	<l3, l2, undef20 <= undef19 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef19 /\ 1 + undef8 = undef20, {x0^0 -> undef3, x1^0 -> undef4, 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.002853
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.001202s
0.00/0.04	Ranking function: -x0^0 + (1 / 2)*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