0.00/0.08	YES
0.00/0.08	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	No parsing errors!
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l10, true>
0.00/0.08	<l1, l2, (arg1 > 0) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
0.00/0.08	<l3, l2, (undef5 <= arg1) /\ (arg1 > ~(1)) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
0.00/0.08	<l2, l2, ((undef9 + 1) <= arg1) /\ (arg1 > 0) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
0.00/0.08	<l4, l5, (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
0.00/0.08	<l1, l5, (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
0.00/0.08	<l6, l7, (undef21 > 0), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}>
0.00/0.08	<l1, l7, (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
0.00/0.08	<l7, l8, (undef33 > 0) /\ (undef30 > ~(1)) /\ ((undef29 - 3) <= arg1) /\ (arg1 > 0) /\ (undef29 > 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> (undef33 + 1)}>
0.00/0.08	<l5, l8, (undef38 > 0) /\ (undef35 > ~(1)) /\ ((undef34 - 1) <= arg1) /\ (arg1 > 0) /\ (undef34 > 1), par{arg1 -> undef34, arg2 -> undef35, arg3 -> undef36, arg4 -> (undef38 + 1)}>
0.00/0.08	<l8, l8, ((undef39 + 2) <= arg1) /\ (arg2 > 0) /\ (arg1 > 1) /\ (undef39 > ~(1)), par{arg1 -> undef39, arg2 -> (arg2 - 1)}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef47 > 0) /\ ((undef43 - 2) <= arg1) /\ (arg1 > 2) /\ (undef43 > 3), par{arg1 -> undef43, arg2 -> (arg2 - 1), arg4 -> undef46}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef52 > 0) /\ ((undef48 - 2) <= arg1) /\ (arg1 > 2) /\ (undef48 > 3), par{arg1 -> undef48, arg2 -> (arg2 - 1), arg4 -> undef51}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef57 > 0) /\ ((undef53 - 3) <= arg1) /\ (arg1 > 2) /\ (undef53 > 5), par{arg1 -> undef53, arg2 -> (arg2 - 1), arg4 -> undef56}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef62 > 0) /\ ((undef58 - 3) <= arg1) /\ (arg1 > 2) /\ (undef58 > 5), par{arg1 -> undef58, arg2 -> (arg2 - 1), arg4 -> undef61}>
0.00/0.08	<l1, l9, (undef63 <= arg1) /\ (arg2 > ~(1)) /\ (undef64 <= arg1) /\ (arg1 > 0) /\ (undef63 > 0) /\ (undef64 > 0), par{arg1 -> undef63, arg2 -> undef64, arg3 -> 0, arg4 -> undef66}>
0.00/0.08	<l8, l9, (arg2 > 0) /\ (arg4 > 0) /\ (arg3 > ~(1)) /\ ((undef68 + 2) <= arg1) /\ (arg1 > 2) /\ (undef68 > 0), par{arg1 -> undef67, arg2 -> undef68, arg3 -> arg4, arg4 -> undef70}>
0.00/0.08	<l8, l9, (arg2 > 0) /\ (arg4 > 0) /\ (undef73 > 0) /\ (arg3 > ~(1)) /\ ((undef72 + 2) <= arg1) /\ (arg1 > 2) /\ (undef72 > 0), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
0.00/0.08	<l10, l1, true, par{arg1 -> undef75, arg2 -> undef76, arg3 -> undef77, arg4 -> undef78}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef43, undef46, undef47, undef48, undef51, undef52, undef53, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef66, undef67, undef68, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef43, undef46, undef47, undef48, undef51, undef52, undef53, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef66, undef67, undef68, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l2, (undef75 > 0) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
0.00/0.08	<l0, l8, (undef17 <= undef75) /\ (undef75 > 0) /\ (undef17 > 0) /\ (undef38 > 0) /\ (undef35 > ~(1)) /\ ((undef34 - 1) <= undef17) /\ (undef17 > 0) /\ (undef34 > 1), par{arg1 -> undef34, arg2 -> undef35, arg3 -> undef36, arg4 -> (undef38 + 1)}>
0.00/0.08	<l0, l8, (undef25 <= undef75) /\ (undef75 > 0) /\ (undef25 > 0) /\ (undef33 > 0) /\ (undef30 > ~(1)) /\ ((undef29 - 3) <= undef25) /\ (undef25 > 0) /\ (undef29 > 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> (undef33 + 1)}>
0.00/0.08	<l0, l9, (undef63 <= undef75) /\ (undef76 > ~(1)) /\ (undef64 <= undef75) /\ (undef75 > 0) /\ (undef63 > 0) /\ (undef64 > 0), par{arg1 -> undef63, arg2 -> undef64, arg3 -> 0, arg4 -> undef66}>
0.00/0.08	<l2, l2, ((undef9 + 1) <= arg1) /\ (arg1 > 0) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
0.00/0.08	<l8, l8, ((undef39 + 2) <= arg1) /\ (arg2 > 0) /\ (arg1 > 1) /\ (undef39 > ~(1)), par{arg1 -> undef39, arg2 -> (arg2 - 1)}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef47 > 0) /\ ((undef43 - 2) <= arg1) /\ (arg1 > 2) /\ (undef43 > 3), par{arg1 -> undef43, arg2 -> (arg2 - 1), arg4 -> undef46}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef52 > 0) /\ ((undef48 - 2) <= arg1) /\ (arg1 > 2) /\ (undef48 > 3), par{arg1 -> undef48, arg2 -> (arg2 - 1), arg4 -> undef51}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef57 > 0) /\ ((undef53 - 3) <= arg1) /\ (arg1 > 2) /\ (undef53 > 5), par{arg1 -> undef53, arg2 -> (arg2 - 1), arg4 -> undef56}>
0.00/0.08	<l8, l8, (arg2 > 0) /\ (arg4 > 0) /\ (undef62 > 0) /\ ((undef58 - 3) <= arg1) /\ (arg1 > 2) /\ (undef58 > 5), par{arg1 -> undef58, arg2 -> (arg2 - 1), arg4 -> undef61}>
0.00/0.08	<l8, l9, (arg2 > 0) /\ (arg4 > 0) /\ (arg3 > ~(1)) /\ ((undef68 + 2) <= arg1) /\ (arg1 > 2) /\ (undef68 > 0), par{arg1 -> undef67, arg2 -> undef68, arg3 -> arg4, arg4 -> undef70}>
0.00/0.08	<l8, l9, (arg2 > 0) /\ (arg4 > 0) /\ (undef73 > 0) /\ (arg3 > ~(1)) /\ ((undef72 + 2) <= arg1) /\ (arg1 > 2) /\ (undef72 > 0), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef43, undef46, undef47, undef48, undef51, undef52, undef53, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef66, undef67, undef68, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef43, undef46, undef47, undef48, undef51, undef52, undef53, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef66, undef67, undef68, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l8, l8, 0 <= undef39 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + undef39 <= arg1, {arg1 -> undef39, arg2 -> -1 + arg2, rest remain the same}>
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef47 /\ 3 <= arg1 /\ undef43 <= 2 + arg1 /\ 4 <= undef43, {arg1 -> undef43, arg2 -> -1 + arg2, arg4 -> undef46, rest remain the same}>
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef52 /\ 3 <= arg1 /\ undef48 <= 2 + arg1 /\ 4 <= undef48, {arg1 -> undef48, arg2 -> -1 + arg2, arg4 -> undef51, rest remain the same}>
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef57 /\ 3 <= arg1 /\ undef53 <= 3 + arg1 /\ 6 <= undef53, {arg1 -> undef53, arg2 -> -1 + arg2, arg4 -> undef56, rest remain the same}>
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef62 /\ 3 <= arg1 /\ undef58 <= 3 + arg1 /\ 6 <= undef58, {arg1 -> undef58, arg2 -> -1 + arg2, arg4 -> undef61, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg4
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 3:
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 0 <= undef9 /\ 1 <= arg1 /\ 1 + undef9 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg3, arg4
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l8, undef17 <= undef75 /\ 0 <= undef35 /\ 1 <= undef17 /\ 1 <= undef38 /\ 1 <= undef75 /\ undef34 <= 1 + undef17 /\ 2 <= undef34, {arg1 -> undef34, arg2 -> undef35, arg3 -> undef36, arg4 -> 1 + undef38, rest remain the same}>
0.00/0.08	<l0, l8, undef25 <= undef75 /\ 0 <= undef30 /\ 1 <= undef25 /\ 1 <= undef33 /\ 1 <= undef75 /\ undef29 <= 3 + undef25 /\ 4 <= undef29, {arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> 1 + undef33, rest remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l0, l9, undef63 <= undef75 /\ undef64 <= undef75 /\ 0 <= undef76 /\ 1 <= undef63 /\ 1 <= undef64 /\ 1 <= undef75, {arg1 -> undef63, arg2 -> undef64, arg3 -> 0, arg4 -> undef66, rest remain the same}>
0.00/0.08	<l8, l9, 0 <= arg3 /\ 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef68 /\ 3 <= arg1 /\ 2 + undef68 <= arg1, {arg1 -> undef67, arg2 -> undef68, arg3 -> arg4, arg4 -> undef70, rest remain the same}>
0.00/0.08	<l8, l9, 0 <= arg3 /\ 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef72 /\ 1 <= undef73 /\ 3 <= arg1 /\ 2 + undef72 <= arg1, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
0.00/0.08	
0.00/0.08	Graph 3
0.00/0.08	<l0, l2, 0 <= undef1 /\ 1 <= undef75, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, rest remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 2 , 3 )
0.00/0.08	( 8 , 1 )
0.00/0.08	( 9 , 2 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.022174
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l8}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.006014s
0.00/0.08	Ranking function: -1 + (1 / 5)*arg1 + (3 / 5)*arg2
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef57 /\ 3 <= arg1 /\ undef53 <= 3 + arg1 /\ 6 <= undef53, {arg1 -> undef53, arg2 -> -1 + arg2, arg4 -> undef56, rest remain the same}>
0.00/0.08	<l8, l8, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef62 /\ 3 <= arg1 /\ undef58 <= 3 + arg1 /\ 6 <= undef58, {arg1 -> undef58, arg2 -> -1 + arg2, arg4 -> undef61, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg4
0.00/0.08	Checking conditional termination of SCC {l8}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.002165s
0.00/0.08	Ranking function: -1 + arg2
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Analyzing SCC {l9}...
0.00/0.08	No cycles found.
0.00/0.08	
0.00/0.08	Proving termination of subgraph 3
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.002503
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001099s
0.00/0.08	Ranking function: -1 + arg1
0.00/0.08	New Graphs: 
0.00/0.08	Program Terminates
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.08	EOF