0.00/0.10	YES
0.00/0.10	
0.00/0.10	Solver Timeout: 4
0.00/0.10	Global Timeout: 300
0.00/0.10	No parsing errors!
0.00/0.10	Init Location: 0
0.00/0.10	Transitions:
0.00/0.10	<l0, l16, true>
0.00/0.10	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}>
0.00/0.10	<l2, l3, true, par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l3, l2, (arg1 > 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> undef8, arg3 -> undef9}>
0.00/0.10	<l3, l3, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
0.00/0.10	<l3, l4, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg3 -> arg2}>
0.00/0.10	<l4, l4, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l4, l5, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l5, l5, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l5, l6, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l6, l6, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l6, l7, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l7, l7, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l7, l8, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l8, l8, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l8, l9, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l9, l9, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l9, l10, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l10, l10, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l10, l11, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l11, l11, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l11, l12, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l12, l12, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l12, l13, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l13, l13, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l13, l14, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l14, l14, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l14, l15, (0 = arg2) /\ (0 = arg3), par{arg2 -> undef80, arg3 -> undef81}>
0.00/0.10	<l15, l15, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef83, arg3 -> undef84}>
0.00/0.10	<l16, l1, true, par{arg1 -> undef85, arg2 -> undef86, arg3 -> undef87}>
0.00/0.10	
0.00/0.10	Fresh variables:
0.00/0.10	undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, 
0.00/0.10	
0.00/0.10	Undef variables:
0.00/0.10	undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, 
0.00/0.10	
0.00/0.10	Abstraction variables:
0.00/0.10	
0.00/0.10	Exit nodes:
0.00/0.10	
0.00/0.10	Accepting locations:
0.00/0.10	
0.00/0.10	Asserts:
0.00/0.10	
0.00/0.10	Preprocessed LLVMGraph
0.00/0.10	Init Location: 0
0.00/0.10	Transitions:
0.00/0.10	<l0, l3, (arg1 = undef86) /\ (arg2 = undef86) /\ (arg3 = undef86) /\ (undef85 > 0) /\ (undef86 > ~(1))>
0.00/0.10	<l3, l3, (arg1 > 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1), arg3 -> (arg1 - 1)}>
0.00/0.10	<l3, l3, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
0.00/0.10	<l3, l4, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg3 -> arg2}>
0.00/0.10	<l4, l4, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l4, l5, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l5, l5, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l5, l6, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l6, l6, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l6, l7, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l7, l7, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l7, l8, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l8, l8, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l8, l9, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l9, l9, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l9, l10, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l10, l10, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l10, l11, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l11, l11, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l11, l12, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l12, l12, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l12, l13, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l13, l13, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l13, l14, (0 = arg2) /\ (0 = arg3), par{arg2 -> arg1, arg3 -> arg1}>
0.00/0.10	<l14, l14, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}>
0.00/0.10	<l14, l15, (0 = arg2) /\ (0 = arg3), par{arg2 -> undef80, arg3 -> undef81}>
0.00/0.10	<l15, l15, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef83, arg3 -> undef84}>
0.00/0.10	
0.00/0.10	Fresh variables:
0.00/0.10	undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, 
0.00/0.10	
0.00/0.10	Undef variables:
0.00/0.10	undef2, undef3, undef8, undef9, undef80, undef81, undef83, undef84, undef85, undef86, undef87, 
0.00/0.10	
0.00/0.10	Abstraction variables:
0.00/0.10	
0.00/0.10	Exit nodes:
0.00/0.10	
0.00/0.10	Accepting locations:
0.00/0.10	
0.00/0.10	Asserts:
0.00/0.10	
0.00/0.10	*************************************************************
0.00/0.10	*******************************************************************************************
0.00/0.10	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.10	*******************************************************************************************
0.00/0.10	
0.00/0.10	Init Location: 0
0.00/0.10	Graph 0:
0.00/0.10	Transitions:
0.00/0.10	Variables:
0.00/0.10	
0.00/0.10	Graph 1:
0.00/0.10	Transitions:
0.00/0.10	<l3, l3, 1 <= arg1 /\ 100 <= arg2 /\ arg2 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, arg3 -> -1 + arg1, rest remain the same}>
0.00/0.10	<l3, l3, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg1, arg2, arg3
0.00/0.10	
0.00/0.10	Graph 2:
0.00/0.10	Transitions:
0.00/0.10	<l4, l4, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 3:
0.00/0.10	Transitions:
0.00/0.10	<l5, l5, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 4:
0.00/0.10	Transitions:
0.00/0.10	<l6, l6, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 5:
0.00/0.10	Transitions:
0.00/0.10	<l7, l7, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 6:
0.00/0.10	Transitions:
0.00/0.10	<l8, l8, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 7:
0.00/0.10	Transitions:
0.00/0.10	<l9, l9, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 8:
0.00/0.10	Transitions:
0.00/0.10	<l10, l10, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 9:
0.00/0.10	Transitions:
0.00/0.10	<l11, l11, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 10:
0.00/0.10	Transitions:
0.00/0.10	<l12, l12, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 11:
0.00/0.10	Transitions:
0.00/0.10	<l13, l13, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 12:
0.00/0.10	Transitions:
0.00/0.10	<l14, l14, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	
0.00/0.10	Graph 13:
0.00/0.10	Transitions:
0.00/0.10	<l15, l15, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef83, arg3 -> undef84, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg1, arg2, arg3
0.00/0.10	
0.00/0.10	Precedence: 
0.00/0.10	Graph 0
0.00/0.10	
0.00/0.10	Graph 1
0.00/0.10	<l0, l3, 0 <= undef86 /\ 1 <= undef85 /\ arg1 = undef86 /\ arg2 = undef86 /\ arg3 = undef86, {all remain the same}>
0.00/0.10	
0.00/0.10	Graph 2
0.00/0.10	<l3, l4, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg1 -> arg2, arg3 -> arg2, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 3
0.00/0.10	<l4, l5, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 4
0.00/0.10	<l5, l6, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 5
0.00/0.10	<l6, l7, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 6
0.00/0.10	<l7, l8, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 7
0.00/0.10	<l8, l9, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 8
0.00/0.10	<l9, l10, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 9
0.00/0.10	<l10, l11, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 10
0.00/0.10	<l11, l12, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 11
0.00/0.10	<l12, l13, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 12
0.00/0.10	<l13, l14, arg2 = 0 /\ arg3 = 0, {arg2 -> arg1, arg3 -> arg1, rest remain the same}>
0.00/0.10	
0.00/0.10	Graph 13
0.00/0.10	<l14, l15, arg2 = 0 /\ arg3 = 0, {arg2 -> undef80, arg3 -> undef81, rest remain the same}>
0.00/0.10	
0.00/0.10	Map Locations to Subgraph:
0.00/0.10	( 0 , 0 )
0.00/0.10	( 3 , 1 )
0.00/0.10	( 4 , 2 )
0.00/0.10	( 5 , 3 )
0.00/0.10	( 6 , 4 )
0.00/0.10	( 7 , 5 )
0.00/0.10	( 8 , 6 )
0.00/0.10	( 9 , 7 )
0.00/0.10	( 10 , 8 )
0.00/0.10	( 11 , 9 )
0.00/0.10	( 12 , 10 )
0.00/0.10	( 13 , 11 )
0.00/0.10	( 14 , 12 )
0.00/0.10	( 15 , 13 )
0.00/0.10	
0.00/0.10	*******************************************************************************************
0.00/0.10	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.10	*******************************************************************************************
0.00/0.10	
0.00/0.10	Proving termination of subgraph 0
0.00/0.10	Proving termination of subgraph 1
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.007711
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l3}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.001578s
0.00/0.10	Ranking function: -297 + 297*arg1 + arg2 - arg3
0.00/0.10	New Graphs: 
0.00/0.10	Transitions:
0.00/0.10	<l3, l3, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}>
0.00/0.10	Variables:
0.00/0.10	arg2, arg3
0.00/0.10	Checking conditional termination of SCC {l3}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000738s
0.00/0.10	Ranking function: 99 - arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 2
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002549
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l4}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000747s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 3
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001959
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l5}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000777s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 4
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001977
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l6}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000784s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 5
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001979
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l7}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000795s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 6
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001974
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l8}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000805s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 7
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001991
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l9}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000816s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 8
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.001983
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l10}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000850s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 9
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l11}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000836s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 10
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002009
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l12}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000841s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 11
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002003
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l13}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000878s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 12
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002009
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l14}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000889s
0.00/0.10	Ranking function: -1 + arg2
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 13
0.00/0.10	Checking unfeasibility...
0.00/0.10	Time used: 0.002071
0.00/0.10	
0.00/0.10	Checking conditional termination of SCC {l15}...
0.00/0.10	
0.00/0.10	LOG: CALL solveLinear
0.00/0.10	
0.00/0.10	LOG: RETURN solveLinear - Elapsed time: 0.000919s
0.00/0.10	Ranking function: -1 + arg1
0.00/0.10	New Graphs: 
0.00/0.10	Program Terminates
0.00/0.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.10	EOF