4.02/4.05	YES
4.02/4.05	
4.02/4.05	Solver Timeout: 4
4.02/4.05	Global Timeout: 300
4.02/4.05	No parsing errors!
4.02/4.05	Init Location: 0
4.02/4.05	Transitions:
4.02/4.05	<l0, l4, true>
4.02/4.05	<l1, l2, true, par{arg1 -> 1, arg2 -> undef2, arg3 -> undef3}>
4.02/4.05	<l2, l3, (arg1 > 0) /\ (arg1 < 100), par{arg2 -> 0, arg3 -> (100 - arg1)}>
4.02/4.05	<l3, l2, (arg3 <= arg2), par{arg1 -> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}>
4.02/4.05	<l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (undef13 <= undef14) /\ (arg1 > 0), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}>
4.02/4.05	<l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (arg1 > 0) /\ (undef18 > undef19), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}>
4.02/4.05	<l4, l1, true, par{arg1 -> undef20, arg2 -> undef21, arg3 -> undef22}>
4.02/4.05	
4.02/4.05	Fresh variables:
4.02/4.05	undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, 
4.02/4.05	
4.02/4.05	Undef variables:
4.02/4.05	undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, 
4.02/4.05	
4.02/4.05	Abstraction variables:
4.02/4.05	
4.02/4.05	Exit nodes:
4.02/4.05	
4.02/4.05	Accepting locations:
4.02/4.05	
4.02/4.05	Asserts:
4.02/4.05	
4.02/4.05	Preprocessed LLVMGraph
4.02/4.05	Init Location: 0
4.02/4.05	Transitions:
4.02/4.05	<l0, l3, (arg1 = 1) /\ (arg2 = 0) /\ (arg3 = (100 - 1)) /\ (1 > 0) /\ (1 < 100)>
4.02/4.05	<l3, l3, (arg3 <= arg2) /\ ((arg1 + 1) > 0) /\ ((arg1 + 1) < 100), par{arg1 -> (arg1 + 1), arg2 -> 0, arg3 -> (100 - (arg1 + 1))}>
4.02/4.05	<l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (undef13 <= undef14) /\ (arg1 > 0), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}>
4.02/4.05	<l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (arg1 > 0) /\ (undef18 > undef19), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}>
4.02/4.05	
4.02/4.05	Fresh variables:
4.02/4.05	undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, 
4.02/4.05	
4.02/4.05	Undef variables:
4.02/4.05	undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, 
4.02/4.05	
4.02/4.05	Abstraction variables:
4.02/4.05	
4.02/4.05	Exit nodes:
4.02/4.05	
4.02/4.05	Accepting locations:
4.02/4.05	
4.02/4.05	Asserts:
4.02/4.05	
4.02/4.05	*************************************************************
4.02/4.05	*******************************************************************************************
4.02/4.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.02/4.05	*******************************************************************************************
4.02/4.05	
4.02/4.05	Init Location: 0
4.02/4.05	Graph 0:
4.02/4.05	Transitions:
4.02/4.05	Variables:
4.02/4.05	
4.02/4.05	Graph 1:
4.02/4.05	Transitions:
4.02/4.05	<l3, l3, 0 <= arg1 /\ arg3 <= arg2 /\ arg1 <= 98, {arg1 -> 1 + arg1, arg2 -> 0, arg3 -> 99 - arg1, rest remain the same}>
4.02/4.05	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 0 <= arg2 /\ undef13 <= undef14 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}>
4.02/4.05	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + undef19 <= undef18 /\ 0 <= arg2 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}>
4.02/4.05	Variables:
4.02/4.05	arg1, arg2, arg3
4.02/4.05	
4.02/4.05	Precedence: 
4.02/4.05	Graph 0
4.02/4.05	
4.02/4.05	Graph 1
4.02/4.05	<l0, l3, arg2 = 0 /\ arg1 = 1 /\ arg3 = 99, {all remain the same}>
4.02/4.05	
4.02/4.05	Map Locations to Subgraph:
4.02/4.05	( 0 , 0 )
4.02/4.05	( 3 , 1 )
4.02/4.05	
4.02/4.05	*******************************************************************************************
4.02/4.05	********************************    CHECKING ASSERTIONS    ********************************
4.02/4.05	*******************************************************************************************
4.02/4.05	
4.02/4.05	Proving termination of subgraph 0
4.02/4.05	Proving termination of subgraph 1
4.02/4.05	Checking unfeasibility...
4.02/4.05	Time used: 4.00209
4.02/4.05	
4.02/4.05	Checking conditional termination of SCC {l3}...
4.02/4.05	
4.02/4.05	LOG: CALL solveLinear
4.02/4.05	
4.02/4.05	LOG: RETURN solveLinear - Elapsed time: 0.011480s
4.02/4.05	Ranking function: 196 - 2*arg1
4.02/4.05	New Graphs: 
4.02/4.05	Transitions:
4.02/4.05	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 0 <= arg2 /\ undef13 <= undef14 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}>
4.02/4.05	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + undef19 <= undef18 /\ 0 <= arg2 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}>
4.02/4.05	Variables:
4.02/4.05	arg1, arg2, arg3
4.02/4.05	Checking conditional termination of SCC {l3}...
4.02/4.05	
4.02/4.05	LOG: CALL solveLinear
4.02/4.05	
4.02/4.05	LOG: RETURN solveLinear - Elapsed time: 0.001851s
4.02/4.05	Ranking function: 98 - arg2
4.02/4.05	New Graphs: 
4.02/4.05	Program Terminates
4.02/4.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.02/4.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.02/4.05	EOF