0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l4, true>
0.00/0.06	<l1, l2, (undef2 > ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
0.00/0.06	<l2, l3, (arg2 <= arg1) /\ (arg2 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> arg2, arg4 -> arg2}>
0.00/0.06	<l3, l2, (0 = arg3) /\ (0 = arg4), par{arg1 -> arg2, arg2 -> arg1, arg3 -> undef11, arg4 -> undef12}>
0.00/0.06	<l3, l3, (arg3 < 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}>
0.00/0.06	<l3, l3, (arg3 > 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}>
0.00/0.06	<l3, l3, (arg3 > 0) /\ (arg3 = arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg3 - 1), arg4 -> (arg3 - 1)}>
0.00/0.06	<l4, l1, true, par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l3, (arg1 = undef2) /\ (arg2 = undef1) /\ (arg3 = undef2) /\ (arg4 = undef2) /\ (undef2 > ~(1)) /\ (undef26 > 1) /\ (undef1 > ~(1)) /\ (undef25 > 0) /\ (undef2 <= undef1) /\ (undef2 > 0)>
0.00/0.06	<l3, l3, (0 = arg3) /\ (0 = arg4) /\ (arg1 <= arg2) /\ (arg1 > 0), par{arg1 -> arg1, arg2 -> arg2, arg3 -> arg1, arg4 -> arg1}>
0.00/0.06	<l3, l3, (arg3 < 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}>
0.00/0.06	<l3, l3, (arg3 > 0) /\ (arg3 = arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg3 - 1), arg4 -> (arg3 - 1)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l3, l3, 1 <= arg1 /\ arg1 <= arg2 /\ arg3 = 0 /\ arg4 = 0, {arg3 -> arg1, arg4 -> arg1, rest remain the same}>
0.00/0.06	<l3, l3, 1 + arg3 <= 0 /\ arg3 = arg4, {arg2 -> 1 + arg2, arg3 -> 1 + arg3, arg4 -> 1 + arg3, rest remain the same}>
0.00/0.06	<l3, l3, 1 <= arg3 /\ arg3 = arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg3, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg1, arg2, arg3, arg4
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l3, 1 <= undef2 /\ 1 <= undef25 /\ 0 <= undef1 /\ undef2 <= undef1 /\ 2 <= undef26 /\ arg1 = undef2 /\ arg2 = undef1 /\ arg3 = undef2 /\ arg4 = undef2, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 3 , 1 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.011954
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l3: 0 <= arg3 + arg4
0.00/0.06	
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	> It's unfeasible. Removing transition: 
0.00/0.06	<l3, l3, 1 + arg3 <= 0 /\ arg3 = arg4, {arg2 -> 1 + arg2, arg3 -> 1 + arg3, arg4 -> 1 + arg3, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l3, l3, 1 <= arg1 /\ arg1 <= arg2 /\ 0 <= arg3 + arg4 /\ arg3 = 0 /\ arg4 = 0, {arg3 -> arg1, arg4 -> arg1, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l3, l3, 1 <= arg3 /\ 0 <= arg3 + arg4 /\ arg3 = arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg3, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.018005
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l3}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001825s
0.00/0.06	Ranking function: 1 + 2*arg2 - arg3
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l3, l3, 1 <= arg3 /\ 0 <= arg3 + arg4 /\ arg3 = arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg3, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg2, arg3, arg4
0.00/0.06	Checking conditional termination of SCC {l3}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000797s
0.00/0.06	Ranking function: -1 + arg3
0.00/0.06	New Graphs: 
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.06	EOF