0.00/0.03	YES
0.00/0.03	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	No parsing errors!
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l6, true>
0.00/0.03	<l1, l2, (undef1 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef3}>
0.00/0.03	<l1, l2, (undef5 > ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}>
0.00/0.03	<l2, l3, (arg1 >= undef7) /\ (undef10 > 1) /\ (arg1 > 0) /\ (undef7 > 0), par{arg1 -> undef7, arg3 -> 0}>
0.00/0.03	<l2, l3, (undef14 > 1) /\ (undef13 > ~(1)) /\ (undef11 <= arg1) /\ (arg1 > 0) /\ (undef11 > 0), par{arg1 -> undef11, arg3 -> undef13}>
0.00/0.03	<l1, l4, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l2, l4, (arg1 > 0), par{arg1 -> 0, arg3 -> 0}>
0.00/0.03	<l3, l4, (arg1 > 0) /\ (undef24 > 1), par{arg1 -> arg3}>
0.00/0.03	<l4, l5, (arg2 > 1) /\ (arg1 > 1) /\ (arg2 > undef28) /\ (arg1 <= arg2) /\ (arg1 = arg3), par{arg3 -> arg1}>
0.00/0.03	<l5, l4, (arg2 > 1) /\ (arg1 > 1) /\ (arg1 <= arg2) /\ (arg2 > undef30) /\ (arg1 > (arg2 - (arg1 * undef30))) /\ ((arg2 - (arg1 * undef30)) >= 0) /\ (arg1 = arg3), par{arg2 -> undef30, arg3 -> arg1}>
0.00/0.03	<l6, l1, true, par{arg1 -> undef32, arg2 -> undef33, arg3 -> undef34}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef3, undef4, undef5, undef6, undef7, undef10, undef11, undef13, undef14, undef24, undef28, undef30, undef32, undef33, undef34, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef3, undef4, undef5, undef6, undef7, undef10, undef11, undef13, undef14, undef24, undef28, undef30, undef32, undef33, undef34, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l4, (undef1 <= undef32) /\ (undef33 > 0) /\ (undef32 > 0) /\ (undef1 > 0) /\ (undef1 >= undef7) /\ (undef10 > 1) /\ (undef1 > 0) /\ (undef7 > 0) /\ (undef7 > 0) /\ (undef24 > 1), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l0, l4, (undef1 <= undef32) /\ (undef33 > 0) /\ (undef32 > 0) /\ (undef1 > 0) /\ (undef14 > 1) /\ (undef13 > ~(1)) /\ (undef11 <= undef1) /\ (undef1 > 0) /\ (undef11 > 0) /\ (undef11 > 0) /\ (undef24 > 1), par{arg1 -> undef13, arg2 -> 0, arg3 -> undef13}>
0.00/0.03	<l0, l4, (undef1 <= undef32) /\ (undef33 > 0) /\ (undef32 > 0) /\ (undef1 > 0) /\ (undef1 > 0), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l0, l4, (undef5 > ~(1)) /\ (undef33 > 0) /\ (undef4 <= undef32) /\ (undef32 > 0) /\ (undef4 > 0) /\ (undef4 >= undef7) /\ (undef10 > 1) /\ (undef4 > 0) /\ (undef7 > 0) /\ (undef7 > 0) /\ (undef24 > 1), par{arg1 -> 0, arg2 -> undef5, arg3 -> 0}>
0.00/0.03	<l0, l4, (undef5 > ~(1)) /\ (undef33 > 0) /\ (undef4 <= undef32) /\ (undef32 > 0) /\ (undef4 > 0) /\ (undef14 > 1) /\ (undef13 > ~(1)) /\ (undef11 <= undef4) /\ (undef4 > 0) /\ (undef11 > 0) /\ (undef11 > 0) /\ (undef24 > 1), par{arg1 -> undef13, arg2 -> undef5, arg3 -> undef13}>
0.00/0.03	<l0, l4, (undef5 > ~(1)) /\ (undef33 > 0) /\ (undef4 <= undef32) /\ (undef32 > 0) /\ (undef4 > 0) /\ (undef4 > 0), par{arg1 -> 0, arg2 -> undef5, arg3 -> 0}>
0.00/0.03	<l0, l4, (undef32 > 0) /\ (0 = undef33), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l4, l4, (arg2 > 1) /\ (arg1 > 1) /\ (arg2 > undef28) /\ (arg1 <= arg2) /\ (arg1 = arg3) /\ (arg2 > 1) /\ (arg1 > 1) /\ (arg1 <= arg2) /\ (arg2 > undef30) /\ (arg1 = arg1), par{arg2 -> undef30, arg3 -> arg1}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef3, undef4, undef5, undef6, undef7, undef10, undef11, undef13, undef14, undef24, undef28, undef30, undef32, undef33, undef34, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef3, undef4, undef5, undef6, undef7, undef10, undef11, undef13, undef14, undef24, undef28, undef30, undef32, undef33, undef34, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l4, l4, arg1 <= arg2 /\ 1 + undef28 <= arg2 /\ 1 + undef30 <= arg2 /\ 2 <= arg1 /\ 2 <= arg2 /\ arg1 = arg3, {arg2 -> undef30, arg3 -> arg1, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
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, undef1 <= undef32 /\ undef7 <= undef1 /\ 1 <= undef1 /\ 1 <= undef7 /\ 1 <= undef32 /\ 1 <= undef33 /\ 2 <= undef10 /\ 2 <= undef24, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.04	<l0, l4, undef1 <= undef32 /\ undef11 <= undef1 /\ 0 <= undef13 /\ 1 <= undef1 /\ 1 <= undef11 /\ 1 <= undef32 /\ 1 <= undef33 /\ 2 <= undef14 /\ 2 <= undef24, {arg1 -> undef13, arg2 -> 0, arg3 -> undef13, rest remain the same}>
0.00/0.04	<l0, l4, undef1 <= undef32 /\ 1 <= undef1 /\ 1 <= undef32 /\ 1 <= undef33, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.04	<l0, l4, undef4 <= undef32 /\ undef7 <= undef4 /\ 0 <= undef5 /\ 1 <= undef4 /\ 1 <= undef7 /\ 1 <= undef32 /\ 1 <= undef33 /\ 2 <= undef10 /\ 2 <= undef24, {arg1 -> 0, arg2 -> undef5, arg3 -> 0, rest remain the same}>
0.00/0.04	<l0, l4, undef4 <= undef32 /\ undef11 <= undef4 /\ 0 <= undef5 /\ 0 <= undef13 /\ 1 <= undef4 /\ 1 <= undef11 /\ 1 <= undef32 /\ 1 <= undef33 /\ 2 <= undef14 /\ 2 <= undef24, {arg1 -> undef13, arg2 -> undef5, arg3 -> undef13, rest remain the same}>
0.00/0.04	<l0, l4, undef4 <= undef32 /\ 0 <= undef5 /\ 1 <= undef4 /\ 1 <= undef32 /\ 1 <= undef33, {arg1 -> 0, arg2 -> undef5, arg3 -> 0, rest remain the same}>
0.00/0.04	<l0, l4, 1 <= undef32 /\ undef33 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, 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	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Detected abstraction incompatible with non-termination check.
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.006391
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.001277s
0.00/0.04	Ranking function: -arg1 + arg2
0.00/0.04	New Graphs: 
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