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, l5, true>
0.00/0.03	<l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
0.00/0.03	<l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}>
0.00/0.03	<l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}>
0.00/0.03	<l5, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef19, undef20, undef21, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef19, undef20, undef21, 
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, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0)>
0.00/0.03	<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
0.00/0.03	<l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}>
0.00/0.03	<l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
0.00/0.03	<l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef19, undef20, undef21, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef19, undef20, undef21, 
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	<l2, l2, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	arg1, arg2, arg3
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	<l3, l3, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	arg1, arg2, arg3
0.00/0.03	
0.00/0.03	Graph 3:
0.00/0.03	Transitions:
0.00/0.03	<l4, l4, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 3 + arg2, arg3 -> 3 + arg2, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	arg1, arg2, arg3
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l3, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 3
0.00/0.03	<l3, l4, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 2 , 1 )
0.00/0.03	( 3 , 2 )
0.00/0.03	( 4 , 3 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002553
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000902s
0.00/0.03	Ranking function: 1000 - arg2
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002376
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l3}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000971s
0.00/0.03	Ranking function: 500 + (~(1) / 2)*arg2
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 3
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002259
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l4}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000959s
0.00/0.03	Ranking function: (1000 / 3) + (~(1) / 3)*arg2
0.00/0.03	New Graphs: 
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF