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, l9, true>
0.00/0.04	<l1, l2, (undef1 = (0 + x0^0)) /\ (undef3 = undef3), par{oldX0^0 -> undef1, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, x0^0 -> (1 + undef1), x1^0 -> (0 + undef3)}>
0.00/0.04	<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>
0.00/0.04	<l5, l6, (undef15 = undef15) /\ (undef16 = undef16), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef15, oldX3^0 -> undef16, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
0.00/0.04	<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)), 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)) /\ ((0 + undef26) <= 11), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.04	<l2, l5, (undef31 = (0 + x0^0)) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, x0^0 -> (0 + undef31), x1^0 -> (0 + undef33)}>
0.00/0.04	<l2, l4, (undef37 = (0 + x0^0)) /\ ((0 + undef37) <= 9), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l7, l2, (undef45 = undef45), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, x0^0 -> 0, x1^0 -> (0 + undef45)}>
0.00/0.04	<l8, l7, (undef51 = undef51) /\ (undef52 = undef52), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef51, oldX3^0 -> undef52, x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
0.00/0.04	<l8, l6, true>
0.00/0.04	<l8, l1, true>
0.00/0.04	<l8, l3, true>
0.00/0.04	<l8, l5, true>
0.00/0.04	<l8, l4, true>
0.00/0.04	<l8, l2, true>
0.00/0.04	<l8, l7, true>
0.00/0.04	<l9, l8, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 
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, l4, (undef51 = undef51) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l0, l6, true>
0.00/0.04	<l0, l6, (undef1 = (0 + x0^0)) /\ (undef3 = undef3) /\ (undef31 = (0 + (1 + undef1))) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
0.00/0.04	<l0, l4, (undef1 = (0 + x0^0)) /\ (undef3 = undef3) /\ (undef37 = (0 + (1 + undef1))) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l0, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>
0.00/0.04	<l0, l6, (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
0.00/0.04	<l0, l4, true>
0.00/0.04	<l0, l6, (undef31 = (0 + x0^0)) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
0.00/0.04	<l0, l4, (undef37 = (0 + x0^0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l0, l4, (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l4, l6, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)) /\ (undef1 = (0 + (0 + undef19))) /\ (undef3 = undef3) /\ (undef31 = (0 + (1 + undef1))) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
0.00/0.04	<l4, l4, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)) /\ (undef1 = (0 + (0 + undef19))) /\ (undef3 = undef3) /\ (undef37 = (0 + (1 + undef1))) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
0.00/0.04	<l4, l4, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((0 + undef26) <= 11) /\ (undef7 = (0 + (0 + undef25))) /\ (undef8 = (0 + (0 + undef26))), par{x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 
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	<l4, l4, 12 <= undef20 /\ undef37 <= 9 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef1 = undef19 /\ 1 + undef1 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
0.00/0.04	<l4, l4, undef26 <= 11 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef7 = undef25 /\ undef8 = undef26, {x0^0 -> undef7, x1^0 -> 1 + undef8, 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, l4, undef37 = 0, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
0.00/0.04	<l0, l4, undef37 <= 9 /\ x0^0 = undef1 /\ 1 + undef1 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
0.00/0.04	<l0, l4, x0^0 = undef7 /\ x1^0 = undef8, {x0^0 -> undef7, x1^0 -> 1 + undef8, rest remain the same}>
0.00/0.04	<l0, l4, true, {all remain the same}>
0.00/0.04	<l0, l4, undef37 <= 9 /\ x0^0 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
0.00/0.04	<l0, l4, undef37 = 0, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l6, true, {all remain the same}>
0.00/0.04	<l0, l6, 10 <= undef31 /\ x0^0 = undef1 /\ 1 + undef1 = undef31, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
0.00/0.04	<l0, l6, true, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
0.00/0.04	<l0, l6, 10 <= undef31 /\ x0^0 = undef31, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
0.00/0.04	<l4, l6, 12 <= undef20 /\ 10 <= undef31 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef1 = undef19 /\ 1 + undef1 = undef31, {x0^0 -> undef15, x1^0 -> undef16, 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	( 4 , 1 )
0.00/0.04	( 6 , 2 )
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.005275
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l4}...
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.002027s
0.00/0.04	Ranking function: 8 - x0^0
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l4, l4, undef26 <= 11 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef7 = undef25 /\ undef8 = undef26, {x0^0 -> undef7, x1^0 -> 1 + undef8, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	x0^0, x1^0
0.00/0.04	Checking conditional termination of SCC {l4}...
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.000965s
0.00/0.04	Ranking function: 11 - x1^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l6}...
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