0.00/0.57	YES
0.00/0.57	
0.00/0.57	Solver Timeout: 4
0.00/0.57	Global Timeout: 300
0.00/0.57	No parsing errors!
0.00/0.57	Init Location: 0
0.00/0.57	Transitions:
0.00/0.57	<l0, l4, true>
0.00/0.57	<l1, l2, (arg2 > ~(1)) /\ (undef6 <= (200 * arg2)) /\ (undef7 <= arg1) /\ (arg1 > 0) /\ (undef7 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}>
0.00/0.57	<l2, l3, (arg2 > ~(1)) /\ (undef10 <= (200 * arg2)) /\ (undef8 <= arg1) /\ (arg1 > 0) /\ (undef8 > 0) /\ (((200 * arg2) - (13 * undef10)) < 13) /\ (((200 * arg2) - (13 * undef10)) >= 0), par{arg1 -> undef8, arg2 -> (100 * arg2), arg3 -> undef10, arg4 -> ((100 * arg2) + undef10), arg5 -> 0}>
0.00/0.57	<l3, l3, (arg4 > 0) /\ (undef18 > ~(1)) /\ (arg5 >= undef18) /\ (arg1 >= undef13) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1))}>
0.00/0.57	<l3, l3, (arg4 > 0) /\ (undef24 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < undef24) /\ (undef25 > ~(1)) /\ ((arg5 + 1) >= undef24) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0), par{arg1 -> undef19, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1)), arg5 -> (arg5 + 1)}>
0.00/0.57	<l3, l3, (undef31 > ~(1)) /\ ((arg5 + 1) < undef31) /\ (arg4 > 0) /\ (arg5 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 * undef33) <= 9) /\ (undef33 > ~(1)) /\ (undef26 <= arg1) /\ (arg1 > 0) /\ (undef26 > 0), par{arg1 -> undef26, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1)), arg5 -> (arg5 + 2)}>
0.00/0.57	<l3, l3, (undef39 > ~(1)) /\ ((arg5 + 1) < undef39) /\ (arg4 > 0) /\ (arg5 > ~(1)) /\ (undef40 > ~(1)) /\ ((undef40 * undef41) > 9) /\ (undef41 > ~(1)) /\ (undef34 <= arg1) /\ (arg1 > 0) /\ (undef34 > 0), par{arg1 -> undef34, arg2 -> (arg2 - 1), arg4 -> ((arg2 - 1) + arg3), arg5 -> (arg5 + 2)}>
0.00/0.57	<l4, l1, true, par{arg1 -> undef42, arg2 -> undef43, arg3 -> undef44, arg4 -> undef45, arg5 -> undef46}>
0.00/0.57	
0.00/0.57	Fresh variables:
0.00/0.57	undef3, undef4, undef5, undef6, undef7, undef8, undef10, undef13, undef18, undef19, undef24, undef25, undef26, undef31, undef32, undef33, undef34, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, 
0.00/0.57	
0.00/0.57	Undef variables:
0.00/0.57	undef3, undef4, undef5, undef6, undef7, undef8, undef10, undef13, undef18, undef19, undef24, undef25, undef26, undef31, undef32, undef33, undef34, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, 
0.00/0.57	
0.00/0.57	Abstraction variables:
0.00/0.57	
0.00/0.57	Exit nodes:
0.00/0.57	
0.00/0.57	Accepting locations:
0.00/0.57	
0.00/0.57	Asserts:
0.00/0.57	
0.00/0.57	Preprocessed LLVMGraph
0.00/0.57	Init Location: 0
0.00/0.57	Transitions:
0.00/0.57	<l0, l3, (arg1 = undef8) /\ (arg2 = (100 * undef43)) /\ (arg3 = undef10) /\ (arg4 = ((100 * undef43) + undef10)) /\ (arg5 = 0) /\ (undef43 > ~(1)) /\ (undef6 <= (200 * undef43)) /\ (undef7 <= undef42) /\ (undef42 > 0) /\ (undef7 > 0) /\ (undef43 > ~(1)) /\ (undef10 <= (200 * undef43)) /\ (undef8 <= undef42) /\ (undef42 > 0) /\ (undef8 > 0) /\ (((200 * undef43) - (13 * undef10)) < 13) /\ (((200 * undef43) - (13 * undef10)) >= 0)>
0.00/0.57	<l3, l3, (arg4 > 0) /\ (undef18 > ~(1)) /\ (arg5 >= undef18) /\ (arg1 >= undef13) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1))}>
0.00/0.57	<l3, l3, (arg4 > 0) /\ (undef24 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < undef24) /\ (undef25 > ~(1)) /\ ((arg5 + 1) >= undef24) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0), par{arg1 -> undef19, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1)), arg5 -> (arg5 + 1)}>
0.00/0.57	<l3, l3, (undef31 > ~(1)) /\ ((arg5 + 1) < undef31) /\ (arg4 > 0) /\ (arg5 > ~(1)) /\ (undef32 > ~(1)) /\ (undef33 > ~(1)) /\ (undef26 <= arg1) /\ (arg1 > 0) /\ (undef26 > 0), par{arg1 -> undef26, arg3 -> (arg3 - 1), arg4 -> (arg2 + (arg3 - 1)), arg5 -> (arg5 + 2)}>
0.00/0.57	<l3, l3, (undef39 > ~(1)) /\ ((arg5 + 1) < undef39) /\ (arg4 > 0) /\ (arg5 > ~(1)) /\ (undef40 > ~(1)) /\ (undef41 > ~(1)) /\ (undef34 <= arg1) /\ (arg1 > 0) /\ (undef34 > 0), par{arg1 -> undef34, arg2 -> (arg2 - 1), arg4 -> ((arg2 - 1) + arg3), arg5 -> (arg5 + 2)}>
0.00/0.57	
0.00/0.57	Fresh variables:
0.00/0.57	undef3, undef4, undef5, undef6, undef7, undef8, undef10, undef13, undef18, undef19, undef24, undef25, undef26, undef31, undef32, undef33, undef34, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, 
0.00/0.57	
0.00/0.57	Undef variables:
0.00/0.57	undef3, undef4, undef5, undef6, undef7, undef8, undef10, undef13, undef18, undef19, undef24, undef25, undef26, undef31, undef32, undef33, undef34, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, 
0.00/0.57	
0.00/0.57	Abstraction variables:
0.00/0.57	
0.00/0.57	Exit nodes:
0.00/0.57	
0.00/0.57	Accepting locations:
0.00/0.57	
0.00/0.57	Asserts:
0.00/0.57	
0.00/0.57	*************************************************************
0.00/0.57	*******************************************************************************************
0.00/0.57	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.57	*******************************************************************************************
0.00/0.57	
0.00/0.57	Init Location: 0
0.00/0.57	Graph 0:
0.00/0.57	Transitions:
0.00/0.57	Variables:
0.00/0.57	
0.00/0.57	Graph 1:
0.00/0.57	Transitions:
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef13 /\ undef13 <= arg1 /\ undef18 <= arg5 /\ 0 <= undef18, {arg1 -> undef13, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, rest remain the same}>
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef19 /\ undef19 <= arg1 /\ 0 <= arg5 /\ 0 <= undef24 /\ 0 <= undef25 /\ 1 + arg5 = undef24, {arg1 -> undef19, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 1 + arg5, rest remain the same}>
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef26 /\ undef26 <= arg1 /\ 0 <= arg5 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef33 /\ 2 + arg5 <= undef31, {arg1 -> undef26, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef34 /\ undef34 <= arg1 /\ 0 <= arg5 /\ 0 <= undef39 /\ 0 <= undef40 /\ 0 <= undef41 /\ 2 + arg5 <= undef39, {arg1 -> undef34, arg2 -> -1 + arg2, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	Variables:
0.00/0.57	arg1, arg2, arg3, arg4, arg5
0.00/0.57	
0.00/0.57	Precedence: 
0.00/0.57	Graph 0
0.00/0.57	
0.00/0.57	Graph 1
0.00/0.57	<l0, l3, 1 <= undef7 /\ 1 <= undef8 /\ 1 <= undef42 /\ undef6 <= 200*undef43 /\ undef7 <= undef42 /\ undef8 <= undef42 /\ undef10 <= 200*undef43 /\ 13*undef10 <= 200*undef43 /\ 0 <= undef43 /\ 200*undef43 <= 12 + 13*undef10 /\ arg1 = undef8 /\ arg2 = 100*undef43 /\ arg3 = undef10 /\ arg4 = undef10 + 100*undef43 /\ arg5 = 0, {all remain the same}>
0.00/0.57	
0.00/0.57	Map Locations to Subgraph:
0.00/0.57	( 0 , 0 )
0.00/0.57	( 3 , 1 )
0.00/0.57	
0.00/0.57	*******************************************************************************************
0.00/0.57	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.57	*******************************************************************************************
0.00/0.57	
0.00/0.57	Detected abstraction incompatible with non-termination check.
0.00/0.57	Proving termination of subgraph 0
0.00/0.57	Proving termination of subgraph 1
0.00/0.57	Checking unfeasibility...
0.00/0.57	Time used: 0.048209
0.00/0.57	
0.00/0.57	Checking conditional termination of SCC {l3}...
0.00/0.57	
0.00/0.57	LOG: CALL solveLinear
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear - Elapsed time: 0.005760s
0.00/0.57	
0.00/0.57	LOG: CALL solveLinear
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear - Elapsed time: 0.032163s
0.00/0.57	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef34 /\ undef34 <= arg1 /\ 0 <= arg5 /\ 0 <= undef39 /\ 0 <= undef40 /\ 0 <= undef41 /\ 2 + arg5 <= undef39, {arg1 -> undef34, arg2 -> -1 + arg2, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	Solving with 1 template(s).
0.00/0.57	
0.00/0.57	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.57	
0.00/0.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062648s
0.00/0.57	Time used: 0.060325
0.00/0.57	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef26 /\ undef26 <= arg1 /\ 0 <= arg5 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef33 /\ 2 + arg5 <= undef31, {arg1 -> undef26, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	Solving with 1 template(s).
0.00/0.57	
0.00/0.57	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.57	
0.00/0.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052820s
0.00/0.57	Time used: 0.047421
0.00/0.57	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef19 /\ undef19 <= arg1 /\ 0 <= arg5 /\ 0 <= undef24 /\ 0 <= undef25 /\ 1 + arg5 = undef24, {arg1 -> undef19, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 1 + arg5, rest remain the same}>
0.00/0.57	Solving with 1 template(s).
0.00/0.57	
0.00/0.57	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.57	
0.00/0.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045836s
0.00/0.57	Time used: 0.040395
0.00/0.57	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef13 /\ undef13 <= arg1 /\ undef18 <= arg5 /\ 0 <= undef18, {arg1 -> undef13, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, rest remain the same}>
0.00/0.57	Solving with 1 template(s).
0.00/0.57	
0.00/0.57	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.57	
0.00/0.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050372s
0.00/0.57	Time used: 0.044887
0.00/0.57	Solving with 1 template(s).
0.00/0.57	
0.00/0.57	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.57	
0.00/0.57	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.187623s
0.00/0.57	Time used: 0.182139
0.00/0.57	
0.00/0.57	LOG: SAT solveNonLinear - Elapsed time: 0.187623s
0.00/0.57	Cost: 0; Total time: 0.182139
0.00/0.57	Termination implied by a set of invariant(s):
0.00/0.57	Invariant at l3: 1 + arg4 <= arg1 + arg2 + arg3
0.00/0.57	[ Invariant Graph ]
0.00/0.57	Strengthening and disabling transitions...
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef13 /\ undef13 <= arg1 /\ undef18 <= arg5 /\ 0 <= undef18, {arg1 -> undef13, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef19 /\ undef19 <= arg1 /\ 0 <= arg5 /\ 0 <= undef24 /\ 0 <= undef25 /\ 1 + arg5 = undef24, {arg1 -> undef19, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 1 + arg5, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef26 /\ undef26 <= arg1 /\ 0 <= arg5 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef33 /\ 2 + arg5 <= undef31, {arg1 -> undef26, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef34 /\ undef34 <= arg1 /\ 0 <= arg5 /\ 0 <= undef39 /\ 0 <= undef40 /\ 0 <= undef41 /\ 2 + arg5 <= undef39, {arg1 -> undef34, arg2 -> -1 + arg2, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	[ Termination Graph ]
0.00/0.57	Strengthening and disabling transitions...
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef13 /\ undef13 <= arg1 /\ undef18 <= arg5 /\ 0 <= undef18, {arg1 -> undef13, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef19 /\ undef19 <= arg1 /\ 0 <= arg5 /\ 0 <= undef24 /\ 0 <= undef25 /\ 1 + arg5 = undef24, {arg1 -> undef19, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 1 + arg5, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef26 /\ undef26 <= arg1 /\ 0 <= arg5 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef33 /\ 2 + arg5 <= undef31, {arg1 -> undef26, arg3 -> -1 + arg3, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	
0.00/0.57	LOG: CALL solverLinear in Graph for feasibility
0.00/0.57	
0.00/0.57	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.57	Strengthening transition (result): 
0.00/0.57	<l3, l3, 1 <= arg1 /\ 1 + arg4 <= arg1 + arg2 + arg3 /\ 1 <= arg4 /\ 1 <= undef34 /\ undef34 <= arg1 /\ 0 <= arg5 /\ 0 <= undef39 /\ 0 <= undef40 /\ 0 <= undef41 /\ 2 + arg5 <= undef39, {arg1 -> undef34, arg2 -> -1 + arg2, arg4 -> -1 + arg2 + arg3, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.57	Ranking function: arg1 + arg2 + arg3
0.00/0.57	New Graphs: 
0.00/0.57	INVARIANTS: 
0.00/0.57	3: 1 + arg4 <= arg1 + arg2 + arg3 , 
0.00/0.57	Quasi-INVARIANTS to narrow Graph: 
0.00/0.57	3: 
0.00/0.57	Program Terminates
0.00/0.57	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.57	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.57	EOF