0.00/0.04	YES
0.00/0.04	
0.04/0.04	Solver Timeout: 4
0.04/0.04	Global Timeout: 300
0.04/0.04	No parsing errors!
0.04/0.04	Init Location: 0
0.04/0.04	Transitions:
0.04/0.04	<l0, l9, true>
0.04/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.04/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 -> (3 + undef8)}>
0.04/0.04	<l4, l1, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (21 <= (0 + undef14)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}>
0.04/0.04	<l4, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 20), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.04/0.04	<l5, l6, (undef25 = (0 + x0^0)) /\ (undef27 = undef27), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef27, x0^0 -> (1 + undef25), x1^0 -> (0 + undef27)}>
0.04/0.04	<l6, l4, (undef31 = (0 + x0^0)) /\ (100 <= (0 + undef31)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> 5}>
0.04/0.04	<l6, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.04/0.04	<l7, l6, (undef45 = undef45), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, x0^0 -> 0, x1^0 -> (0 + undef45)}>
0.04/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.04/0.04	<l8, l2, true>
0.04/0.04	<l8, l1, true>
0.04/0.04	<l8, l3, true>
0.04/0.04	<l8, l4, true>
0.04/0.04	<l8, l5, true>
0.04/0.04	<l8, l6, true>
0.04/0.04	<l8, l7, true>
0.04/0.04	<l9, l8, true>
0.04/0.04	
0.04/0.04	Fresh variables:
0.04/0.04	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 
0.04/0.04	
0.04/0.04	Undef variables:
0.04/0.04	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 
0.04/0.04	
0.04/0.04	Abstraction variables:
0.04/0.04	
0.04/0.04	Exit nodes:
0.04/0.04	
0.04/0.04	Accepting locations:
0.04/0.04	
0.04/0.04	Asserts:
0.04/0.04	
0.04/0.04	Preprocessed LLVMGraph
0.04/0.04	Init Location: 0
0.04/0.04	Transitions:
0.04/0.04	<l0, l5, (undef51 = undef51) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.04/0.04	<l0, l2, true>
0.04/0.04	<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.04/0.04	<l0, l3, true>
0.04/0.04	<l0, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (21 <= (0 + undef14)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.04/0.04	<l0, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.04/0.04	<l0, l5, true>
0.04/0.04	<l0, l3, (undef31 = (0 + x0^0)) /\ (100 <= (0 + undef31)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 5)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.04/0.04	<l0, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.04/0.05	<l0, l5, (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.04/0.05	<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef13 = (0 + (0 + undef7))) /\ (undef14 = (0 + (3 + undef8))) /\ (21 <= (0 + undef14)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.04/0.05	<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (3 + undef8))) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.04/0.05	<l5, l3, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef31 = (0 + (1 + undef25))) /\ (100 <= (0 + undef31)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 5)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.04/0.05	<l5, l5, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef37 = (0 + (1 + undef25))) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.04/0.05	
0.04/0.05	Fresh variables:
0.04/0.05	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 
0.04/0.05	
0.04/0.05	Undef variables:
0.04/0.05	undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 
0.04/0.05	
0.04/0.05	Abstraction variables:
0.04/0.05	
0.04/0.05	Exit nodes:
0.04/0.05	
0.04/0.05	Accepting locations:
0.04/0.05	
0.04/0.05	Asserts:
0.04/0.05	
0.04/0.05	*************************************************************
0.04/0.05	*******************************************************************************************
0.04/0.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.04/0.05	*******************************************************************************************
0.04/0.05	
0.04/0.05	Init Location: 0
0.04/0.05	Graph 0:
0.04/0.05	Transitions:
0.04/0.05	Variables:
0.04/0.05	
0.04/0.05	Graph 1:
0.04/0.05	Transitions:
0.04/0.05	<l5, l5, undef37 <= 99 /\ x0^0 = undef25 /\ 1 + undef25 = undef37, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
0.04/0.05	Variables:
0.04/0.05	x0^0, x1^0
0.04/0.05	
0.04/0.05	Graph 2:
0.04/0.05	Transitions:
0.04/0.05	<l3, l3, undef20 <= 20 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef19 /\ 3 + undef8 = undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
0.04/0.05	Variables:
0.04/0.05	x0^0, x1^0
0.04/0.05	
0.04/0.05	Graph 3:
0.04/0.05	Transitions:
0.04/0.05	Variables:
0.04/0.05	
0.04/0.05	Precedence: 
0.04/0.05	Graph 0
0.04/0.05	
0.04/0.05	Graph 1
0.04/0.05	<l0, l5, undef37 = 0, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
0.04/0.05	<l0, l5, true, {all remain the same}>
0.04/0.05	<l0, l5, undef37 <= 99 /\ x0^0 = undef37, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
0.04/0.05	<l0, l5, undef37 = 0, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
0.04/0.05	
0.04/0.05	Graph 2
0.04/0.05	<l0, l3, true, {all remain the same}>
0.04/0.05	<l0, l3, undef20 <= 20 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
0.04/0.05	<l0, l3, 100 <= undef31 /\ x0^0 = undef31 /\ undef19 = undef31 /\ undef20 = 5, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
0.04/0.05	<l5, l3, 100 <= undef31 /\ x0^0 = undef25 /\ undef19 = undef31 /\ 1 + undef25 = undef31 /\ undef20 = 5, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
0.04/0.05	
0.04/0.05	Graph 3
0.04/0.05	<l0, l2, true, {all remain the same}>
0.04/0.05	<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.04/0.05	<l0, l2, 21 <= undef14 /\ x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.04/0.05	<l3, l2, 21 <= undef14 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef13 /\ 3 + undef8 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.04/0.05	
0.04/0.05	Map Locations to Subgraph:
0.04/0.05	( 0 , 0 )
0.04/0.05	( 2 , 3 )
0.04/0.05	( 3 , 2 )
0.04/0.05	( 5 , 1 )
0.04/0.05	
0.04/0.05	*******************************************************************************************
0.04/0.05	********************************    CHECKING ASSERTIONS    ********************************
0.04/0.05	*******************************************************************************************
0.04/0.05	
0.04/0.05	Proving termination of subgraph 0
0.04/0.05	Proving termination of subgraph 1
0.04/0.05	Checking unfeasibility...
0.04/0.05	Time used: 0.002449
0.04/0.05	
0.04/0.05	Checking conditional termination of SCC {l5}...
0.04/0.05	
0.04/0.05	LOG: CALL solveLinear
0.04/0.05	
0.04/0.05	LOG: RETURN solveLinear - Elapsed time: 0.000898s
0.04/0.05	Ranking function: 98 - x0^0
0.04/0.05	New Graphs: 
0.04/0.05	Proving termination of subgraph 2
0.04/0.05	Checking unfeasibility...
0.04/0.05	Time used: 0.002745
0.04/0.05	
0.04/0.05	Checking conditional termination of SCC {l3}...
0.04/0.05	
0.04/0.05	LOG: CALL solveLinear
0.04/0.05	
0.04/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001138s
0.04/0.05	Ranking function: (17 / 3) + (~(1) / 3)*x1^0
0.04/0.05	New Graphs: 
0.04/0.05	Proving termination of subgraph 3
0.04/0.05	Analyzing SCC {l2}...
0.04/0.05	No cycles found.
0.04/0.05	
0.04/0.05	Program Terminates
0.04/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.04/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.04/0.05	EOF