0.00/0.05	YES
0.00/0.05	
0.00/0.05	Solver Timeout: 4
0.00/0.05	Global Timeout: 300
0.00/0.05	No parsing errors!
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l9, true>
0.00/0.05	<l1, l2, (undef6 = undef6) /\ (undef7 = undef7), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef6, oldX3^0 -> undef7, x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l3, l4, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (3 + undef14)}>
0.00/0.05	<l4, l1, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ ((1 + __const_20^0) <= (0 + undef23)), par{oldX0^0 -> undef22, oldX1^0 -> undef23, x0^0 -> (0 + undef22), x1^0 -> (0 + undef23)}>
0.00/0.05	<l4, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ ((0 + undef32) <= (0 + __const_20^0)), par{oldX0^0 -> undef31, oldX1^0 -> undef32, x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l5, l6, (undef40 = (0 + x0^0)) /\ (undef42 = undef42), par{oldX0^0 -> undef40, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef42, x0^0 -> (1 + undef40), x1^0 -> (0 + undef42)}>
0.00/0.05	<l6, l4, (undef49 = (0 + x0^0)) /\ ((1 + __const_99^0) <= (0 + undef49)), par{oldX0^0 -> undef49, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef49), x1^0 -> (0 + __const_5^0)}>
0.00/0.05	<l6, l5, (undef58 = (0 + x0^0)) /\ (undef60 = undef60) /\ ((0 + undef58) <= (0 + __const_99^0)), par{oldX0^0 -> undef58, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef60, x0^0 -> (0 + undef58), x1^0 -> (0 + undef60)}>
0.00/0.05	<l7, l6, (undef69 = undef69), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef69, x0^0 -> 0, x1^0 -> (0 + undef69)}>
0.00/0.05	<l8, l7, (undef78 = undef78) /\ (undef79 = undef79), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef78, oldX3^0 -> undef79, x0^0 -> (0 + undef78), x1^0 -> (0 + undef79)}>
0.00/0.05	<l8, l2, true>
0.00/0.05	<l8, l1, true>
0.00/0.05	<l8, l3, true>
0.00/0.05	<l8, l4, true>
0.00/0.05	<l8, l5, true>
0.00/0.05	<l8, l6, true>
0.00/0.05	<l8, l7, true>
0.00/0.05	<l9, l8, true>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef6, undef7, undef13, undef14, undef22, undef23, undef31, undef32, undef40, undef42, undef49, undef58, undef60, undef69, undef78, undef79, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef6, undef7, undef13, undef14, undef22, undef23, undef31, undef32, undef40, undef42, undef49, undef58, undef60, undef69, undef78, undef79, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	Preprocessed LLVMGraph
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l2, (undef78 = undef78) /\ (undef79 = undef79) /\ (undef69 = undef69) /\ (undef49 = (0 + 0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef22 = (0 + (0 + undef49))) /\ (undef23 = (0 + (0 + __const_5^0))) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l0, l3, (undef78 = undef78) /\ (undef79 = undef79) /\ (undef69 = undef69) /\ (undef49 = (0 + 0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + __const_5^0))) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l0, l5, (undef78 = undef78) /\ (undef79 = undef79) /\ (undef69 = undef69) /\ (undef58 = (0 + 0)) /\ (undef60 = undef60) /\ ((0 + undef58) <= (0 + __const_99^0)), par{x0^0 -> (0 + undef58), x1^0 -> (0 + undef60)}>
0.00/0.05	<l0, l2, true>
0.00/0.05	<l0, l2, (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l0, l3, true>
0.00/0.05	<l0, l2, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l0, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l0, l5, true>
0.00/0.05	<l0, l2, (undef49 = (0 + x0^0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef22 = (0 + (0 + undef49))) /\ (undef23 = (0 + (0 + __const_5^0))) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l0, l3, (undef49 = (0 + x0^0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + __const_5^0))) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l0, l5, (undef58 = (0 + x0^0)) /\ (undef60 = undef60) /\ ((0 + undef58) <= (0 + __const_99^0)), par{x0^0 -> (0 + undef58), x1^0 -> (0 + undef60)}>
0.00/0.05	<l0, l2, (undef69 = undef69) /\ (undef49 = (0 + 0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef22 = (0 + (0 + undef49))) /\ (undef23 = (0 + (0 + __const_5^0))) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l0, l3, (undef69 = undef69) /\ (undef49 = (0 + 0)) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + __const_5^0))) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l0, l5, (undef69 = undef69) /\ (undef58 = (0 + 0)) /\ (undef60 = undef60) /\ ((0 + undef58) <= (0 + __const_99^0)), par{x0^0 -> (0 + undef58), x1^0 -> (0 + undef60)}>
0.00/0.05	<l3, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (undef22 = (0 + (0 + undef13))) /\ (undef23 = (0 + (3 + undef14))) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l3, l3, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (undef31 = (0 + (0 + undef13))) /\ (undef32 = (0 + (3 + undef14))) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l5, l2, (undef40 = (0 + x0^0)) /\ (undef42 = undef42) /\ (undef49 = (0 + (1 + undef40))) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef22 = (0 + (0 + undef49))) /\ (undef23 = (0 + (0 + __const_5^0))) /\ ((1 + __const_20^0) <= (0 + undef23)) /\ (undef6 = undef6) /\ (undef7 = undef7), par{x0^0 -> (0 + undef6), x1^0 -> (0 + undef7)}>
0.00/0.05	<l5, l3, (undef40 = (0 + x0^0)) /\ (undef42 = undef42) /\ (undef49 = (0 + (1 + undef40))) /\ ((1 + __const_99^0) <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + __const_5^0))) /\ ((0 + undef32) <= (0 + __const_20^0)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.05	<l5, l5, (undef40 = (0 + x0^0)) /\ (undef42 = undef42) /\ (undef58 = (0 + (1 + undef40))) /\ (undef60 = undef60) /\ ((0 + undef58) <= (0 + __const_99^0)), par{x0^0 -> (0 + undef58), x1^0 -> (0 + undef60)}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef6, undef7, undef13, undef14, undef22, undef23, undef31, undef32, undef40, undef42, undef49, undef58, undef60, undef69, undef78, undef79, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef6, undef7, undef13, undef14, undef22, undef23, undef31, undef32, undef40, undef42, undef49, undef58, undef60, undef69, undef78, undef79, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	*************************************************************
0.00/0.05	*******************************************************************************************
0.00/0.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Init Location: 0
0.00/0.05	Graph 0:
0.00/0.05	Transitions:
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Graph 1:
0.00/0.05	Transitions:
0.00/0.05	<l5, l5, undef58 <= __const_99^0 /\ x0^0 = undef40 /\ 1 + undef40 = undef58, {x0^0 -> undef58, x1^0 -> undef60, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_99^0, x0^0, x1^0
0.00/0.05	
0.00/0.05	Graph 2:
0.00/0.05	Transitions:
0.00/0.05	<l3, l3, undef32 <= __const_20^0 /\ x0^0 = undef13 /\ x1^0 = undef14 /\ undef13 = undef31 /\ 3 + undef14 = undef32, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_20^0, x0^0, x1^0
0.00/0.05	
0.00/0.05	Graph 3:
0.00/0.05	Transitions:
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Precedence: 
0.00/0.05	Graph 0
0.00/0.05	
0.00/0.05	Graph 1
0.00/0.05	<l0, l5, undef58 <= __const_99^0 /\ undef58 = 0, {x0^0 -> undef58, x1^0 -> undef60, rest remain the same}>
0.00/0.05	<l0, l5, true, {all remain the same}>
0.00/0.05	<l0, l5, undef58 <= __const_99^0 /\ x0^0 = undef58, {x0^0 -> undef58, x1^0 -> undef60, rest remain the same}>
0.00/0.05	<l0, l5, undef58 <= __const_99^0 /\ undef58 = 0, {x0^0 -> undef58, x1^0 -> undef60, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 2
0.00/0.05	<l0, l3, undef32 <= __const_20^0 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef32 /\ undef31 = undef49 /\ undef49 = 0, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	<l0, l3, true, {all remain the same}>
0.00/0.05	<l0, l3, undef32 <= __const_20^0 /\ x0^0 = undef31 /\ x1^0 = undef32, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	<l0, l3, undef32 <= __const_20^0 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef32 /\ x0^0 = undef49 /\ undef31 = undef49, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	<l0, l3, undef32 <= __const_20^0 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef32 /\ undef31 = undef49 /\ undef49 = 0, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	<l5, l3, undef32 <= __const_20^0 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef32 /\ x0^0 = undef40 /\ undef31 = undef49 /\ 1 + undef40 = undef49, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 3
0.00/0.05	<l0, l2, 1 + __const_20^0 <= undef23 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef23 /\ undef22 = undef49 /\ undef49 = 0, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l0, l2, true, {all remain the same}>
0.00/0.05	<l0, l2, true, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l0, l2, 1 + __const_20^0 <= undef23 /\ x0^0 = undef22 /\ x1^0 = undef23, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l0, l2, 1 + __const_20^0 <= undef23 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef23 /\ x0^0 = undef49 /\ undef22 = undef49, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l0, l2, 1 + __const_20^0 <= undef23 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef23 /\ undef22 = undef49 /\ undef49 = 0, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l3, l2, 1 + __const_20^0 <= undef23 /\ x0^0 = undef13 /\ x1^0 = undef14 /\ undef13 = undef22 /\ 3 + undef14 = undef23, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	<l5, l2, 1 + __const_20^0 <= undef23 /\ 1 + __const_99^0 <= undef49 /\ __const_5^0 = undef23 /\ x0^0 = undef40 /\ undef22 = undef49 /\ 1 + undef40 = undef49, {x0^0 -> undef6, x1^0 -> undef7, rest remain the same}>
0.00/0.05	
0.00/0.05	Map Locations to Subgraph:
0.00/0.05	( 0 , 0 )
0.00/0.05	( 2 , 3 )
0.00/0.05	( 3 , 2 )
0.00/0.05	( 5 , 1 )
0.00/0.05	
0.00/0.05	*******************************************************************************************
0.00/0.05	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Proving termination of subgraph 0
0.00/0.05	Proving termination of subgraph 1
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.002652
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l5}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001019s
0.00/0.05	Ranking function: -1 + __const_99^0 - x0^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 2
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.003782
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l3}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001344s
0.00/0.05	Ranking function: -1 + (1 / 3)*__const_20^0 + (~(1) / 3)*x1^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 3
0.00/0.05	Analyzing SCC {l2}...
0.00/0.05	No cycles found.
0.00/0.05	
0.00/0.05	Program Terminates
0.00/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.05	EOF