0.00/0.07	YES
0.00/0.07	
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, l7, true>
0.00/0.08	<l1, l2, (undef6 > ~(1)) /\ (arg2 > 0) /\ (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}>
0.00/0.08	<l3, l2, (undef7 <= arg1) /\ ((undef7 + 3) <= arg2) /\ (undef8 <= arg2) /\ (arg1 > 0) /\ (arg2 > 3) /\ (undef7 > 0) /\ (undef8 > 3) /\ ((arg5 + 5) <= arg2) /\ ((arg4 + 5) <= arg2), par{arg1 -> undef7, arg2 -> undef8}>
0.00/0.08	<l1, l4, (undef12 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef12, arg3 -> 1, arg4 -> undef15, arg5 -> undef16}>
0.00/0.08	<l4, l5, (arg2 > ~(1)) /\ (arg1 > 1) /\ (arg3 > 0) /\ (arg3 < arg2) /\ (undef19 > ~(1)), par{arg2 -> 0, arg3 -> undef19, arg4 -> arg2, arg5 -> (arg3 + 1)}>
0.00/0.08	<l5, l4, (arg3 > arg2) /\ (arg1 > 1) /\ (arg3 > 0) /\ (arg5 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> arg4, arg3 -> arg5, arg4 -> undef25, arg5 -> undef26}>
0.00/0.08	<l5, l5, (arg3 > arg2) /\ (arg1 > 1) /\ (arg3 > 0) /\ (arg5 > 1) /\ ((arg1 - 1) < arg1), par{arg2 -> (arg2 + 1), arg5 -> undef31}>
0.00/0.08	<l2, l6, (undef37 > 0) /\ (arg3 > 1) /\ ((undef32 - 1) <= arg1) /\ ((undef32 + 2) <= arg2) /\ ((undef33 + 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 3) /\ (undef32 > 1) /\ (undef33 > 0) /\ ((arg5 + 5) <= arg2) /\ ((arg4 + 5) <= arg2), par{arg1 -> undef32, arg2 -> undef33, arg4 -> undef35, arg5 -> undef36}>
0.00/0.08	<l6, l6, (undef38 <= arg1) /\ (arg3 > 1) /\ ((undef39 + 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef38 > 0) /\ (undef39 > ~(1)), par{arg1 -> undef38, arg2 -> undef39, arg4 -> undef41, arg5 -> undef42}>
0.00/0.08	<l6, l6, ((undef44 + 2) <= arg2) /\ (arg3 > 1) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef43 > 0) /\ (undef44 > ~(1)), par{arg1 -> undef43, arg2 -> undef44, arg4 -> undef46, arg5 -> undef47}>
0.00/0.08	<l6, l6, ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 2) /\ (undef49 > ~(1)), par{arg1 -> undef48, arg2 -> undef49, arg4 -> undef51, arg5 -> undef52}>
0.00/0.08	<l7, l1, true, par{arg1 -> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56, arg5 -> undef57}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef15, undef16, undef19, undef25, undef26, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef39, undef41, undef42, undef43, undef44, undef46, undef47, undef48, undef49, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef15, undef16, undef19, undef25, undef26, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef39, undef41, undef42, undef43, undef44, undef46, undef47, undef48, undef49, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 
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, l6, (undef6 > ~(1)) /\ (undef54 > 0) /\ (undef1 <= undef53) /\ (undef53 > 0) /\ (undef1 > 0) /\ (undef2 > 3) /\ (undef37 > 0) /\ (undef3 > 1) /\ ((undef32 - 1) <= undef1) /\ ((undef32 + 2) <= undef2) /\ ((undef33 + 3) <= undef2) /\ (undef1 > 0) /\ (undef2 > 3) /\ (undef32 > 1) /\ (undef33 > 0) /\ ((undef5 + 5) <= undef2) /\ ((undef4 + 5) <= undef2), par{arg1 -> undef32, arg2 -> undef33, arg3 -> undef3, arg4 -> undef35, arg5 -> undef36}>
0.00/0.08	<l0, l5, (undef12 > ~(1)) /\ (undef54 > 0) /\ (undef53 > 0) /\ (undef54 > ~(1)) /\ (undef12 > 1) /\ (1 > 0) /\ (1 < undef54) /\ (undef19 > ~(1)), par{arg1 -> undef12, arg2 -> 0, arg3 -> undef19, arg4 -> undef54, arg5 -> (1 + 1)}>
0.00/0.08	<l5, l5, (arg3 > arg2) /\ (arg1 > 1) /\ (arg3 > 0) /\ (arg5 > 1) /\ ((arg1 - 1) < arg1) /\ (arg4 > ~(1)) /\ ((arg1 - 1) > 1) /\ (arg5 > 0) /\ (arg5 < arg4) /\ (undef19 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> undef19, arg4 -> arg4, arg5 -> (arg5 + 1)}>
0.00/0.08	<l5, l5, (arg3 > arg2) /\ (arg1 > 1) /\ (arg3 > 0) /\ (arg5 > 1) /\ ((arg1 - 1) < arg1), par{arg2 -> (arg2 + 1), arg5 -> undef31}>
0.00/0.08	<l6, l6, (undef38 <= arg1) /\ (arg3 > 1) /\ ((undef39 + 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef38 > 0) /\ (undef39 > ~(1)), par{arg1 -> undef38, arg2 -> undef39, arg4 -> undef41, arg5 -> undef42}>
0.00/0.08	<l6, l6, ((undef44 + 2) <= arg2) /\ (arg3 > 1) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef43 > 0) /\ (undef44 > ~(1)), par{arg1 -> undef43, arg2 -> undef44, arg4 -> undef46, arg5 -> undef47}>
0.00/0.08	<l6, l6, ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 2) /\ (undef49 > ~(1)), par{arg1 -> undef48, arg2 -> undef49, arg4 -> undef51, arg5 -> undef52}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef15, undef16, undef19, undef25, undef26, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef39, undef41, undef42, undef43, undef44, undef46, undef47, undef48, undef49, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef15, undef16, undef19, undef25, undef26, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef39, undef41, undef42, undef43, undef44, undef46, undef47, undef48, undef49, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 
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	<l5, l5, 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 0 <= arg4 /\ 0 <= undef19 /\ 3 <= arg1 /\ 2 <= arg5, {arg1 -> -1 + arg1, arg2 -> 0, arg3 -> undef19, arg5 -> 1 + arg5, rest remain the same}>
0.00/0.08	<l5, l5, 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 2 <= arg1 /\ 2 <= arg5, {arg2 -> 1 + arg2, arg5 -> undef31, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg3, arg4, arg5
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	<l6, l6, 1 <= arg1 /\ 1 <= undef38 /\ undef38 <= arg1 /\ 0 <= undef39 /\ 3 <= arg2 /\ 3 + undef39 <= arg2 /\ 2 <= arg3, {arg1 -> undef38, arg2 -> undef39, arg4 -> undef41, arg5 -> undef42, rest remain the same}>
0.00/0.08	<l6, l6, 1 <= arg1 /\ 1 <= undef43 /\ 0 <= undef44 /\ 3 <= arg2 /\ 2 + undef44 <= arg2 /\ 2 <= arg3, {arg1 -> undef43, arg2 -> undef44, arg4 -> undef46, arg5 -> undef47, rest remain the same}>
0.00/0.08	<l6, l6, 1 <= arg1 /\ 0 <= undef49 /\ 3 <= arg2 /\ 3 <= undef48 /\ 2 + undef49 <= arg2, {arg1 -> undef48, arg2 -> undef49, arg4 -> undef51, arg5 -> undef52, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg3, arg4, arg5
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, l5, 1 <= undef53 /\ 0 <= undef19 /\ 2 <= undef12 /\ 2 <= undef54, {arg1 -> undef12, arg2 -> 0, arg3 -> undef19, arg4 -> undef54, arg5 -> 2, rest remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l0, l6, 1 <= undef1 /\ 1 <= undef33 /\ 1 <= undef37 /\ 1 <= undef53 /\ 1 <= undef54 /\ undef32 <= 1 + undef1 /\ undef1 <= undef53 /\ 0 <= undef6 /\ 3 + undef33 <= undef2 /\ 5 + undef4 <= undef2 /\ 5 + undef5 <= undef2 /\ 2 + undef32 <= undef2 /\ 2 <= undef3 /\ 2 <= undef32 /\ 4 <= undef2, {arg1 -> undef32, arg2 -> undef33, arg3 -> undef3, arg4 -> undef35, arg5 -> undef36, 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	( 5 , 1 )
0.00/0.08	( 6 , 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.011024
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l5}...
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.002417s
0.00/0.08	Ranking function: -12 + 3*arg1 + arg4
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l5, l5, 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 2 <= arg1 /\ 2 <= arg5, {arg2 -> 1 + arg2, arg5 -> undef31, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg3, arg5
0.00/0.08	Checking conditional termination of SCC {l5}...
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.000999s
0.00/0.08	Ranking function: -1 - arg2 + arg3
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.016983
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l6}...
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.003777s
0.00/0.08	Ranking function: (~(23) / 2) + (1 / 2)*arg2 + 5*arg3
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l6, l6, 1 <= arg1 /\ 0 <= undef49 /\ 3 <= arg2 /\ 3 <= undef48 /\ 2 + undef49 <= arg2, {arg1 -> undef48, arg2 -> undef49, arg4 -> undef51, arg5 -> undef52, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	arg1, arg2, arg4, arg5
0.00/0.08	Checking conditional termination of SCC {l6}...
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.001235s
0.00/0.08	Ranking function: (~(3) / 2) + (1 / 2)*arg2
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