23.17/23.26	NO
23.17/23.26	
23.17/23.26	Solver Timeout: 4
23.17/23.26	Global Timeout: 300
23.17/23.26	No parsing errors!
23.17/23.26	Init Location: 0
23.17/23.26	Transitions:
23.17/23.26	<l0, l7, true>
23.17/23.26	<l1, l2, (1 <= (0 + rhop^0)), par{xp^0 -> (1 + xp^0)}>
23.17/23.26	<l1, l2, ((0 + rhop^0) <= 0), par{xp^0 -> (~(1) + xp^0)}>
23.17/23.26	<l3, l4, ((0 + retpp^0) <= 0), par{retp^0 -> 0}>
23.17/23.26	<l3, l4, true, par{retp^0 -> 1}>
23.17/23.26	<l3, l1, (undef28 = undef28) /\ (1 <= (0 + undef28)), par{rhop^0 -> undef28}>
23.17/23.26	<l2, l3, ((0 + xp^0) <= 1), par{retpp^0 -> 0}>
23.17/23.26	<l2, l3, (2 <= (0 + xp^0)), par{retpp^0 -> 1}>
23.17/23.26	<l5, l2, (undef47 = 2), par{rhop^0 -> (0 + rho^0), x^0 -> undef47, xp^0 -> (0 + undef47)}>
23.17/23.26	<l4, l6, ((0 + retp^0) <= 0)>
23.17/23.26	<l7, l5, true>
23.17/23.26	
23.17/23.26	Fresh variables:
23.17/23.26	undef28, undef47, 
23.17/23.26	
23.17/23.26	Undef variables:
23.17/23.26	undef28, undef47, 
23.17/23.26	
23.17/23.26	Abstraction variables:
23.17/23.26	
23.17/23.26	Exit nodes:
23.17/23.26	
23.17/23.26	Accepting locations:
23.17/23.26	
23.17/23.26	Asserts:
23.17/23.26	
23.17/23.26	Preprocessed LLVMGraph
23.17/23.26	Init Location: 0
23.17/23.26	Transitions:
23.17/23.26	<l0, l2, (xp^0 = (0 + undef47)) /\ (undef47 = 2)>
23.17/23.26	<l2, l6, ((0 + xp^0) <= 1) /\ ((0 + 0) <= 0) /\ ((0 + 0) <= 0)>
23.17/23.26	<l2, l2, ((0 + xp^0) <= 1) /\ (undef28 = undef28) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef28)), par{xp^0 -> (1 + xp^0)}>
23.17/23.26	<l2, l2, (2 <= (0 + xp^0)) /\ (undef28 = undef28) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef28)), par{xp^0 -> (1 + xp^0)}>
23.17/23.26	
23.17/23.26	Fresh variables:
23.17/23.26	undef28, undef47, 
23.17/23.26	
23.17/23.26	Undef variables:
23.17/23.26	undef28, undef47, 
23.17/23.26	
23.17/23.26	Abstraction variables:
23.17/23.26	
23.17/23.26	Exit nodes:
23.17/23.26	
23.17/23.26	Accepting locations:
23.17/23.26	
23.17/23.26	Asserts:
23.17/23.26	
23.17/23.26	*************************************************************
23.17/23.26	*******************************************************************************************
23.17/23.26	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.17/23.26	*******************************************************************************************
23.17/23.26	
23.17/23.26	Init Location: 0
23.17/23.26	Graph 0:
23.17/23.26	Transitions:
23.17/23.26	Variables:
23.17/23.26	
23.17/23.26	Graph 1:
23.17/23.26	Transitions:
23.17/23.26	<l2, l2, 1 <= undef28 /\ xp^0 <= 1, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	<l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Variables:
23.17/23.26	xp^0
23.17/23.26	
23.17/23.26	Graph 2:
23.17/23.26	Transitions:
23.17/23.26	Variables:
23.17/23.26	
23.17/23.26	Precedence: 
23.17/23.26	Graph 0
23.17/23.26	
23.17/23.26	Graph 1
23.17/23.26	<l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
23.17/23.26	
23.17/23.26	Graph 2
23.17/23.26	<l2, l6, xp^0 <= 1, {all remain the same}>
23.17/23.26	
23.17/23.26	Map Locations to Subgraph:
23.17/23.26	( 0 , 0 )
23.17/23.26	( 2 , 1 )
23.17/23.26	( 6 , 2 )
23.17/23.26	
23.17/23.26	*******************************************************************************************
23.17/23.26	********************************    CHECKING ASSERTIONS    ********************************
23.17/23.26	*******************************************************************************************
23.17/23.26	
23.17/23.26	Proving termination of subgraph 0
23.17/23.26	Proving termination of subgraph 1
23.17/23.26	Checking unfeasibility...
23.17/23.26	Time used: 0.005963
23.17/23.26	Some transition disabled by a set of invariant(s):
23.17/23.26	Invariant at l2: 2 <= xp^0
23.17/23.26	
23.17/23.26	Strengthening and disabling transitions...
23.17/23.26	> It's unfeasible. Removing transition: 
23.17/23.26	<l2, l2, 1 <= undef28 /\ xp^0 <= 1, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	
23.17/23.26	LOG: CALL solverLinear in Graph for feasibility
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear in Graph for feasibility
23.17/23.26	Strengthening transition (result): 
23.17/23.26	<l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Checking unfeasibility...
23.17/23.26	Time used: 0.001382
23.17/23.26	
23.17/23.26	Checking conditional termination of SCC {l2}...
23.17/23.26	
23.17/23.26	LOG: CALL solveLinear
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear - Elapsed time: 0.000527s
23.17/23.26	
23.17/23.26	LOG: CALL solveLinear
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear - Elapsed time: 0.001550s
23.17/23.26	Trying to remove transition: <l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003836s
23.17/23.26	Time used: 0.003686
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002142s
23.17/23.26	Time used: 4.00156
23.17/23.26	Solving with 2 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007022s
23.17/23.26	Time used: 4.00104
23.17/23.26	Solving with 3 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038048s
23.17/23.26	Time used: 1.00069
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009149s
23.17/23.26	Time used: 0.005159
23.17/23.26	Improving Solution with cost 1 ...
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetNextSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000652s
23.17/23.26	Time used: 1.00063
23.17/23.26	
23.17/23.26	LOG: SAT solveNonLinear - Elapsed time: 1.009801s
23.17/23.26	Cost: 1; Total time: 1.00579
23.17/23.26	Quasi-ranking function: 50000 - xp^0
23.17/23.26	New Graphs: 
23.17/23.26	Transitions:
23.17/23.26	<l2, l2, 1 <= undef28 /\ 50001 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Variables:
23.17/23.26	xp^0
23.17/23.26	Checking conditional termination of SCC {l2}...
23.17/23.26	
23.17/23.26	LOG: CALL solveLinear
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear - Elapsed time: 0.000521s
23.17/23.26	
23.17/23.26	LOG: CALL solveLinear
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear - Elapsed time: 0.001754s
23.17/23.26	Trying to remove transition: <l2, l2, 1 <= undef28 /\ 50001 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004194s
23.17/23.26	Time used: 0.00406
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002226s
23.17/23.26	Time used: 4.00171
23.17/23.26	Solving with 2 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007110s
23.17/23.26	Time used: 4.00157
23.17/23.26	Solving with 3 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038621s
23.17/23.26	Time used: 1.00096
23.17/23.26	Solving with 1 template(s).
23.17/23.26	
23.17/23.26	LOG: CALL solveNonLinearGetFirstSolution
23.17/23.26	
23.17/23.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010795s
23.17/23.26	Time used: 4.00652
23.17/23.26	Termination failed. Trying to show unreachability...
23.17/23.26	Proving unreachability of entry: <l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
23.17/23.26	
23.17/23.26	LOG: CALL check - Post:1 <= 0 - Process 1
23.17/23.26	* Exit transition: <l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
23.17/23.26	* Postcondition  : 1 <= 0
23.17/23.26	
23.17/23.26	LOG: CALL solveLinear
23.17/23.26	
23.17/23.26	LOG: RETURN solveLinear - Elapsed time: 0.007255s
23.17/23.26	> Postcondition is not implied!
23.17/23.26	
23.17/23.26	LOG: RETURN check - Elapsed time: 0.007365s
23.17/23.26	Cannot prove unreachability
23.17/23.26	
23.17/23.26	Proving non-termination of subgraph 1
23.17/23.26	Transitions:
23.17/23.26	<l2, l2, 1 <= undef28 /\ 2 <= xp^0, {xp^0 -> 1 + xp^0, rest remain the same}>
23.17/23.26	Variables:
23.17/23.26	xp^0
23.17/23.26	
23.17/23.26	Checking conditional non-termination of SCC {l2}...
23.17/23.26	> No exit transition to close.
23.17/23.26	Calling reachability with...
23.17/23.26	Transition: <l2, end, true, {all remain the same}>
23.17/23.26	Conditions: 
23.17/23.26	OPEN EXITS: 
23.17/23.26	<l2, end, true, {all remain the same}>
23.17/23.26	
23.17/23.26	--- Reachability graph ---
23.17/23.26	> Graph without transitions.
23.17/23.26	
23.17/23.26	Calling reachability with...
23.17/23.26	Transition: <l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
23.17/23.26	Conditions: 
23.17/23.26	OPEN EXITS: 
23.17/23.26	<l0, l2, xp^0 = undef47 /\ undef47 = 2, {all remain the same}>
23.17/23.26	
23.17/23.26	> Conditions are reachable!
23.17/23.26	
23.17/23.26	Program does NOT terminate
23.17/23.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.17/23.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.17/23.26	EOF