5.24/5.31	NO
5.24/5.31	
5.24/5.31	Solver Timeout: 4
5.24/5.31	Global Timeout: 300
5.24/5.31	No parsing errors!
5.24/5.31	Init Location: 0
5.24/5.31	Transitions:
5.24/5.31	<l0, l6, true>
5.24/5.31	<l1, l2, (undef1 = undef1), par{hi^0 -> undef1}>
5.24/5.31	<l1, l2, (undef4 = undef4), par{lo^0 -> undef4}>
5.24/5.31	<l3, l4, ((0 + lo^0) <= (0 + hi^0))>
5.24/5.31	<l3, l1, ((1 + hi^0) <= (0 + lo^0))>
5.24/5.31	<l2, l3, true>
5.24/5.31	<l5, l2, true, par{hi^0 -> 0, lo^0 -> 99}>
5.24/5.31	<l6, l5, true>
5.24/5.31	
5.24/5.31	Fresh variables:
5.24/5.31	undef1, undef4, 
5.24/5.31	
5.24/5.31	Undef variables:
5.24/5.31	undef1, undef4, 
5.24/5.31	
5.24/5.31	Abstraction variables:
5.24/5.31	
5.24/5.31	Exit nodes:
5.24/5.31	
5.24/5.31	Accepting locations:
5.24/5.31	
5.24/5.31	Asserts:
5.24/5.31	
5.24/5.31	Preprocessed LLVMGraph
5.24/5.31	Init Location: 0
5.24/5.31	Transitions:
5.24/5.31	<l0, l2, (hi^0 = 0) /\ (lo^0 = 99)>
5.24/5.31	<l2, l4, ((0 + lo^0) <= (0 + hi^0))>
5.24/5.31	<l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef1 = undef1), par{hi^0 -> undef1}>
5.24/5.31	<l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef4 = undef4), par{lo^0 -> undef4}>
5.24/5.31	
5.24/5.31	Fresh variables:
5.24/5.31	undef1, undef4, 
5.24/5.31	
5.24/5.31	Undef variables:
5.24/5.31	undef1, undef4, 
5.24/5.31	
5.24/5.31	Abstraction variables:
5.24/5.31	
5.24/5.31	Exit nodes:
5.24/5.31	
5.24/5.31	Accepting locations:
5.24/5.31	
5.24/5.31	Asserts:
5.24/5.31	
5.24/5.31	*************************************************************
5.24/5.31	*******************************************************************************************
5.24/5.31	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.24/5.31	*******************************************************************************************
5.24/5.31	
5.24/5.31	Init Location: 0
5.24/5.31	Graph 0:
5.24/5.31	Transitions:
5.24/5.31	Variables:
5.24/5.31	
5.24/5.31	Graph 1:
5.24/5.31	Transitions:
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
5.24/5.31	Variables:
5.24/5.31	hi^0, lo^0
5.24/5.31	
5.24/5.31	Graph 2:
5.24/5.31	Transitions:
5.24/5.31	Variables:
5.24/5.31	
5.24/5.31	Precedence: 
5.24/5.31	Graph 0
5.24/5.31	
5.24/5.31	Graph 1
5.24/5.31	<l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
5.24/5.31	
5.24/5.31	Graph 2
5.24/5.31	<l2, l4, lo^0 <= hi^0, {all remain the same}>
5.24/5.31	
5.24/5.31	Map Locations to Subgraph:
5.24/5.31	( 0 , 0 )
5.24/5.31	( 2 , 1 )
5.24/5.31	( 4 , 2 )
5.24/5.31	
5.24/5.31	*******************************************************************************************
5.24/5.31	********************************    CHECKING ASSERTIONS    ********************************
5.24/5.31	*******************************************************************************************
5.24/5.31	
5.24/5.31	Proving termination of subgraph 0
5.24/5.31	Proving termination of subgraph 1
5.24/5.31	Checking unfeasibility...
5.24/5.31	Time used: 0.003632
5.24/5.31	
5.24/5.31	Checking conditional termination of SCC {l2}...
5.24/5.31	
5.24/5.31	LOG: CALL solveLinear
5.24/5.31	
5.24/5.31	LOG: RETURN solveLinear - Elapsed time: 0.000889s
5.24/5.31	
5.24/5.31	LOG: CALL solveLinear
5.24/5.31	
5.24/5.31	LOG: RETURN solveLinear - Elapsed time: 0.003156s
5.24/5.31	Trying to remove transition: <l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
5.24/5.31	Solving with 1 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007133s
5.24/5.31	Time used: 0.00692
5.24/5.31	Trying to remove transition: <l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
5.24/5.31	Solving with 1 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006110s
5.24/5.31	Time used: 0.005663
5.24/5.31	Solving with 1 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012376s
5.24/5.31	Time used: 0.011912
5.24/5.31	Solving with 2 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.118973s
5.24/5.31	Time used: 4.1179
5.24/5.31	Solving with 3 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038950s
5.24/5.31	Time used: 1.00112
5.24/5.31	Solving with 1 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015072s
5.24/5.31	Time used: 0.010914
5.24/5.31	Termination failed. Trying to show unreachability...
5.24/5.31	Proving unreachability of entry: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
5.24/5.31	
5.24/5.31	LOG: CALL check - Post:1 <= 0 - Process 1
5.24/5.31	* Exit transition: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
5.24/5.31	* Postcondition  : 1 <= 0
5.24/5.31	
5.24/5.31	LOG: CALL solveLinear
5.24/5.31	
5.24/5.31	LOG: RETURN solveLinear - Elapsed time: 0.001285s
5.24/5.31	> Postcondition is not implied!
5.24/5.31	
5.24/5.31	LOG: RETURN check - Elapsed time: 0.001376s
5.24/5.31	Cannot prove unreachability
5.24/5.31	
5.24/5.31	Proving non-termination of subgraph 1
5.24/5.31	Transitions:
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
5.24/5.31	Variables:
5.24/5.31	hi^0, lo^0
5.24/5.31	
5.24/5.31	Checking conditional non-termination of SCC {l2}...
5.24/5.31	EXIT TRANSITIONS:
5.24/5.31	<l2, end, lo^0 <= hi^0, {all remain the same}>
5.24/5.31	
5.24/5.31	Solving with 1 template(s).
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinearGetFirstSolution
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013861s
5.24/5.31	Time used: 0.013751
5.24/5.31	
5.24/5.31	LOG: SAT solveNonLinear - Elapsed time: 0.013861s
5.24/5.31	Cost: 0; Total time: 0.013751
5.24/5.31	Minimizing number of undef constraints...
5.24/5.31	
5.24/5.31	LOG: CALL solveNonLinear
5.24/5.31	
5.24/5.31	LOG: RETURN solveNonLinear - Elapsed time: 0.003147s
5.24/5.31	Non-termination implied by a set of quasi-invariant(s):
5.24/5.31	Quasi-invariant at l2: 1 + hi^0 <= lo^0
5.24/5.31	Constraint over undef '1 + undef1 <= lo^0' in transition:
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
5.24/5.31	Constraint over undef '1 + hi^0 <= undef4' in transition:
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
5.24/5.31	
5.24/5.31	Strengthening and disabling EXIT transitions...
5.24/5.31	Closed exits from l2: 1
5.24/5.31	
5.24/5.31	Strengthening and disabling transitions...
5.24/5.31	
5.24/5.31	LOG: CALL solverLinear in Graph for feasibility
5.24/5.31	
5.24/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.24/5.31	Strengthening transition (result): 
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0 /\ 1 + undef1 <= lo^0, {hi^0 -> undef1, rest remain the same}>
5.24/5.31	
5.24/5.31	LOG: CALL solverLinear in Graph for feasibility
5.24/5.31	
5.24/5.31	LOG: RETURN solveLinear in Graph for feasibility
5.24/5.31	Strengthening transition (result): 
5.24/5.31	<l2, l2, 1 + hi^0 <= lo^0 /\ 1 + hi^0 <= undef4, {lo^0 -> undef4, rest remain the same}>
5.24/5.31	
5.24/5.31	Calling reachability with...
5.24/5.31	Transition: <l2, end, true, {all remain the same}>
5.24/5.31	Conditions: 1 + hi^0 <= lo^0, 
5.24/5.31	OPEN EXITS: 
5.24/5.31	<l2, end, 1 + hi^0 <= lo^0, {all remain the same}>
5.24/5.31	
5.24/5.31	--- Reachability graph ---
5.24/5.31	> Graph without transitions.
5.24/5.31	
5.24/5.31	Calling reachability with...
5.24/5.31	Transition: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
5.24/5.31	Conditions: 1 + hi^0 <= lo^0, 
5.24/5.31	OPEN EXITS: 
5.24/5.31	<l0, l2, 1 + hi^0 <= lo^0 /\ hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
5.24/5.31	
5.24/5.31	> Conditions are reachable!
5.24/5.31	
5.24/5.31	Program does NOT terminate
5.24/5.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.24/5.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.24/5.31	EOF