9.12/9.17	NO
9.12/9.17	
9.12/9.17	Solver Timeout: 4
9.12/9.17	Global Timeout: 300
9.12/9.17	No parsing errors!
9.12/9.17	Init Location: 0
9.12/9.17	Transitions:
9.12/9.17	<l0, l5, true>
9.12/9.17	<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
9.12/9.17	<l2, l3, (undef6 > ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}>
9.12/9.17	<l1, l2, (undef12 > ~(1)) /\ (arg2 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (arg1 > 0)>
9.12/9.17	<l2, l4, (undef17 > ~(1)) /\ (arg2 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}>
9.12/9.17	<l3, l3, (0 = arg1), par{arg1 -> 0, arg2 -> undef21}>
9.12/9.17	<l3, l3, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}>
9.12/9.17	<l4, l3, (0 = arg1), par{arg1 -> 0, arg2 -> undef25}>
9.12/9.17	<l4, l4, (arg1 < 0), par{arg1 -> (arg1 + 1), arg2 -> undef27}>
9.12/9.17	<l5, l1, true, par{arg1 -> undef28, arg2 -> undef29}>
9.12/9.17	
9.12/9.17	Fresh variables:
9.12/9.17	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 
9.12/9.17	
9.12/9.17	Undef variables:
9.12/9.17	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 
9.12/9.17	
9.12/9.17	Abstraction variables:
9.12/9.17	
9.12/9.17	Exit nodes:
9.12/9.17	
9.12/9.17	Accepting locations:
9.12/9.17	
9.12/9.17	Asserts:
9.12/9.17	
9.12/9.17	Preprocessed LLVMGraph
9.12/9.17	Init Location: 0
9.12/9.17	Transitions:
9.12/9.17	<l0, l3, (undef3 > ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
9.12/9.17	<l0, l4, (undef3 > ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}>
9.12/9.17	<l0, l3, (undef12 > ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
9.12/9.17	<l0, l4, (undef12 > ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}>
9.12/9.17	<l3, l3, (0 = arg1), par{arg1 -> 0}>
9.12/9.17	<l3, l3, (arg1 > 0), par{arg1 -> (arg1 - 1)}>
9.12/9.17	<l4, l3, (0 = arg1), par{arg1 -> 0}>
9.12/9.17	<l4, l4, (arg1 < 0), par{arg1 -> (arg1 + 1)}>
9.12/9.17	
9.12/9.17	Fresh variables:
9.12/9.17	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 
9.12/9.17	
9.12/9.17	Undef variables:
9.12/9.17	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 
9.12/9.17	
9.12/9.17	Abstraction variables:
9.12/9.17	
9.12/9.17	Exit nodes:
9.12/9.17	
9.12/9.17	Accepting locations:
9.12/9.17	
9.12/9.17	Asserts:
9.12/9.17	
9.12/9.17	*************************************************************
9.12/9.17	*******************************************************************************************
9.12/9.17	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.12/9.17	*******************************************************************************************
9.12/9.17	
9.12/9.17	Init Location: 0
9.12/9.17	Graph 0:
9.12/9.17	Transitions:
9.12/9.17	Variables:
9.12/9.17	
9.12/9.17	Graph 1:
9.12/9.17	Transitions:
9.12/9.17	<l4, l4, 1 + arg1 <= 0, {arg1 -> 1 + arg1, rest remain the same}>
9.12/9.17	Variables:
9.12/9.17	arg1
9.12/9.17	
9.12/9.17	Graph 2:
9.12/9.17	Transitions:
9.12/9.17	<l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.17	<l3, l3, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
9.12/9.17	Variables:
9.12/9.17	arg1
9.12/9.17	
9.12/9.17	Precedence: 
9.12/9.17	Graph 0
9.12/9.18	
9.12/9.18	Graph 1
9.12/9.18	<l0, l4, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef17 /\ 0 <= undef18 /\ undef4 = 1 + 2*undef5 /\ undef18 = 2*undef19, {arg1 -> -undef17, rest remain the same}>
9.12/9.18	<l0, l4, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef12 /\ 0 <= undef13 /\ 0 <= undef17 /\ 0 <= undef18 /\ undef13 = 2*undef14 /\ undef18 = 2*undef19, {arg1 -> -undef17, rest remain the same}>
9.12/9.18	
9.12/9.18	Graph 2
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l4, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.18	
9.12/9.18	Map Locations to Subgraph:
9.12/9.18	( 0 , 0 )
9.12/9.18	( 3 , 2 )
9.12/9.18	( 4 , 1 )
9.12/9.18	
9.12/9.18	*******************************************************************************************
9.12/9.18	********************************    CHECKING ASSERTIONS    ********************************
9.12/9.18	*******************************************************************************************
9.12/9.18	
9.12/9.18	Proving termination of subgraph 0
9.12/9.18	Proving termination of subgraph 1
9.12/9.18	Checking unfeasibility...
9.12/9.18	Time used: 0.002292
9.12/9.18	
9.12/9.18	Checking conditional termination of SCC {l4}...
9.12/9.18	
9.12/9.18	LOG: CALL solveLinear
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear - Elapsed time: 0.000683s
9.12/9.18	Ranking function: -1 - arg1
9.12/9.18	New Graphs: 
9.12/9.18	Proving termination of subgraph 2
9.12/9.18	Checking unfeasibility...
9.12/9.18	Time used: 0.003338
9.12/9.18	
9.12/9.18	Checking conditional termination of SCC {l3}...
9.12/9.18	
9.12/9.18	LOG: CALL solveLinear
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear - Elapsed time: 0.000848s
9.12/9.18	Ranking function: -1 + arg1
9.12/9.18	New Graphs: 
9.12/9.18	Transitions:
9.12/9.18	<l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.18	Variables:
9.12/9.18	arg1
9.12/9.18	Checking conditional termination of SCC {l3}...
9.12/9.18	
9.12/9.18	LOG: CALL solveLinear
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear - Elapsed time: 0.000340s
9.12/9.18	
9.12/9.18	LOG: CALL solveLinear
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear - Elapsed time: 0.000859s
9.12/9.18	Trying to remove transition: <l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.18	Solving with 1 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002561s
9.12/9.18	Time used: 0.002444
9.12/9.18	Solving with 1 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002440s
9.12/9.18	Time used: 4.00156
9.12/9.18	Solving with 2 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019860s
9.12/9.18	Time used: 4.01196
9.12/9.18	Solving with 3 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.041155s
9.12/9.18	Time used: 1.0131
9.12/9.18	Solving with 1 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010524s
9.12/9.18	Time used: 0.005632
9.12/9.18	Termination failed. Trying to show unreachability...
9.12/9.18	Proving unreachability of entry: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	
9.12/9.18	LOG: CALL check - Post:1 <= 0 - Process 1
9.12/9.18	* Exit transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	* Postcondition  : 1 <= 0
9.12/9.18	
9.12/9.18	LOG: CALL solveLinear
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear - Elapsed time: 0.001167s
9.12/9.18	> Postcondition is not implied!
9.12/9.18	
9.12/9.18	LOG: RETURN check - Elapsed time: 0.001307s
9.12/9.18	Cannot prove unreachability
9.12/9.18	
9.12/9.18	Proving non-termination of subgraph 2
9.12/9.18	Transitions:
9.12/9.18	<l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.18	<l3, l3, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
9.12/9.18	Variables:
9.12/9.18	arg1
9.12/9.18	
9.12/9.18	Checking conditional non-termination of SCC {l3}...
9.12/9.18	EXIT TRANSITIONS:
9.12/9.18	<l3, end, 1 + arg1 <= 0, {all remain the same}>
9.12/9.18	
9.12/9.18	Solving with 1 template(s).
9.12/9.18	
9.12/9.18	LOG: CALL solveNonLinearGetFirstSolution
9.12/9.18	
9.12/9.18	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005641s
9.12/9.18	Time used: 0.005539
9.12/9.18	
9.12/9.18	LOG: SAT solveNonLinear - Elapsed time: 0.005641s
9.12/9.18	Cost: 0; Total time: 0.005539
9.12/9.18	Non-termination implied by a set of quasi-invariant(s):
9.12/9.18	Quasi-invariant at l3: 0 <= arg1
9.12/9.18	
9.12/9.18	Strengthening and disabling EXIT transitions...
9.12/9.18	Closed exits from l3: 1
9.12/9.18	
9.12/9.18	Strengthening and disabling transitions...
9.12/9.18	
9.12/9.18	LOG: CALL solverLinear in Graph for feasibility
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear in Graph for feasibility
9.12/9.18	Strengthening transition (result): 
9.12/9.18	<l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
9.12/9.18	
9.12/9.18	LOG: CALL solverLinear in Graph for feasibility
9.12/9.18	
9.12/9.18	LOG: RETURN solveLinear in Graph for feasibility
9.12/9.18	Strengthening transition (result): 
9.12/9.18	<l3, l3, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
9.12/9.18	
9.12/9.18	Calling reachability with...
9.12/9.18	Transition: <l3, end, true, {all remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l3, end, true, {all remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l3, end, true, {all remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	OPEN EXITS: 
9.12/9.18	<l3, end, 0 <= arg1, {all remain the same}>
9.12/9.18	<l3, end, 0 <= arg1, {all remain the same}>
9.12/9.18	<l3, end, 0 <= arg1, {all remain the same}>
9.12/9.18	
9.12/9.18	--- Reachability graph ---
9.12/9.18	> Graph without transitions.
9.12/9.18	
9.12/9.18	Calling reachability with...
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	Transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	Conditions: 0 <= arg1, 
9.12/9.18	OPEN EXITS: 
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
9.12/9.18	<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
9.12/9.18	
9.12/9.18	> Conditions are reachable!
9.12/9.18	
9.12/9.18	Program does NOT terminate
9.12/9.18	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
9.12/9.18	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
9.12/9.18	EOF