0.00/0.04	YES
0.00/0.04	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l3, true>
0.00/0.04	<l1, l2, (undef1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> (undef1 + undef2)}>
0.00/0.04	<l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}>
0.00/0.04	<l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.04	<l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.04	<l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef13, undef14, undef15, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef13, undef14, undef15, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = (undef1 + undef2)) /\ (undef1 > ~(1)) /\ (undef14 > ~(1)) /\ (undef2 > ~(1)) /\ (undef13 > 0)>
0.00/0.04	<l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}>
0.00/0.04	<l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.04	<l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef13, undef14, undef15, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef13, undef14, undef15, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.04	<l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.04	<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, arg3 -> -1 + arg2, 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, l2, 1 <= undef13 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef14 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef1 + undef2, {all 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	( 2 , 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	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.010785
0.00/0.04	Some transition disabled by a set of invariant(s):
0.00/0.04	Invariant at l2: arg3 <= arg1 + arg2
0.00/0.04	
0.00/0.04	Strengthening and disabling transitions...
0.00/0.04	> It's unfeasible. Removing transition: 
0.00/0.04	<l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	LOG: CALL solverLinear in Graph for feasibility
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.04	Strengthening transition (result): 
0.00/0.04	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.04	
0.00/0.04	LOG: CALL solverLinear in Graph for feasibility
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.04	Strengthening transition (result): 
0.00/0.04	<l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.005506
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l2}...
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.001698s
0.00/0.04	Ranking function: -3 + 3*arg2
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ arg3 <= arg1 + arg2 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
0.00/0.04	Checking conditional termination of SCC {l2}...
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.000897s
0.00/0.04	Ranking function: -1 + arg1
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