29.77/29.82	NO
29.77/29.82	
29.77/29.82	Solver Timeout: 4
29.77/29.82	Global Timeout: 300
29.77/29.82	No parsing errors!
29.77/29.82	Init Location: 0
29.77/29.82	Transitions:
29.77/29.82	<l0, l4, true>
29.77/29.82	<l1, l2, (undef1 = (1000 + x^0)) /\ (1 <= (0 + undef1)), par{x^0 -> undef1}>
29.77/29.82	<l2, l1, true>
29.77/29.82	<l3, l1, true>
29.77/29.82	<l4, l3, true>
29.77/29.82	
29.77/29.82	Fresh variables:
29.77/29.82	undef1, 
29.77/29.82	
29.77/29.82	Undef variables:
29.77/29.82	undef1, 
29.77/29.82	
29.77/29.82	Abstraction variables:
29.77/29.82	
29.77/29.82	Exit nodes:
29.77/29.82	
29.77/29.82	Accepting locations:
29.77/29.82	
29.77/29.82	Asserts:
29.77/29.82	
29.77/29.82	Preprocessed LLVMGraph
29.77/29.82	Init Location: 0
29.77/29.82	Transitions:
29.77/29.82	<l0, l1, true>
29.77/29.82	<l1, l1, (undef1 = (1000 + x^0)) /\ (1 <= (0 + undef1)), par{x^0 -> undef1}>
29.77/29.82	
29.77/29.82	Fresh variables:
29.77/29.82	undef1, 
29.77/29.82	
29.77/29.82	Undef variables:
29.77/29.82	undef1, 
29.77/29.82	
29.77/29.82	Abstraction variables:
29.77/29.82	
29.77/29.82	Exit nodes:
29.77/29.82	
29.77/29.82	Accepting locations:
29.77/29.82	
29.77/29.82	Asserts:
29.77/29.82	
29.77/29.82	*************************************************************
29.77/29.82	*******************************************************************************************
29.77/29.82	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
29.77/29.82	*******************************************************************************************
29.77/29.82	
29.77/29.82	Init Location: 0
29.77/29.82	Graph 0:
29.77/29.82	Transitions:
29.77/29.82	Variables:
29.77/29.82	
29.77/29.82	Graph 1:
29.77/29.82	Transitions:
29.77/29.82	<l1, l1, 1 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Variables:
29.77/29.82	x^0
29.77/29.82	
29.77/29.82	Precedence: 
29.77/29.82	Graph 0
29.77/29.82	
29.77/29.82	Graph 1
29.77/29.82	<l0, l1, true, {all remain the same}>
29.77/29.82	
29.77/29.82	Map Locations to Subgraph:
29.77/29.82	( 0 , 0 )
29.77/29.82	( 1 , 1 )
29.77/29.82	
29.77/29.82	*******************************************************************************************
29.77/29.82	********************************    CHECKING ASSERTIONS    ********************************
29.77/29.82	*******************************************************************************************
29.77/29.82	
29.77/29.82	Proving termination of subgraph 0
29.77/29.82	Proving termination of subgraph 1
29.77/29.82	Checking unfeasibility...
29.77/29.82	Time used: 0.00145
29.77/29.82	
29.77/29.82	Checking conditional termination of SCC {l1}...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.000538s
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.001834s
29.77/29.82	Trying to remove transition: <l1, l1, 1 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003596s
29.77/29.82	Time used: 0.003433
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001858s
29.77/29.82	Time used: 4.00106
29.77/29.82	Solving with 2 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005885s
29.77/29.82	Time used: 4.00073
29.77/29.82	Solving with 3 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005075s
29.77/29.82	Time used: 1.00051
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006795s
29.77/29.82	Time used: 0.004375
29.77/29.82	Improving Solution with cost 1 ...
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetNextSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007926s
29.77/29.82	Time used: 0.007921
29.77/29.82	
29.77/29.82	LOG: SAT solveNonLinear - Elapsed time: 0.014721s
29.77/29.82	Cost: 1; Total time: 0.012296
29.77/29.82	Quasi-ranking function: 50000 - x^0
29.77/29.82	New Graphs: 
29.77/29.82	Transitions:
29.77/29.82	<l1, l1, 1 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Variables:
29.77/29.82	x^0
29.77/29.82	Checking conditional termination of SCC {l1}...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.000578s
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.002199s
29.77/29.82	Trying to remove transition: <l1, l1, 1 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003971s
29.77/29.82	Time used: 0.003814
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.225028s
29.77/29.82	Time used: 2.22457
29.77/29.82	Improving Solution with cost 1 ...
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetNextSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.216562s
29.77/29.82	Time used: 0.216555
29.77/29.82	
29.77/29.82	LOG: SAT solveNonLinear - Elapsed time: 2.441591s
29.77/29.82	Cost: 1; Total time: 2.44112
29.77/29.82	Failed at location 1: 1000 + x^0 <= 0
29.77/29.82	Before Improving: 
29.77/29.82	Quasi-invariant at l1: 1000 + x^0 <= 0
29.77/29.82	Optimizing invariants...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.012443s
29.77/29.82	Remaining time after improvement: 0.997531
29.77/29.82	Termination implied by a set of quasi-invariant(s):
29.77/29.82	Quasi-invariant at l1: 1000 + x^0 <= 0
29.77/29.82	[ Invariant Graph ]
29.77/29.82	Strengthening and disabling transitions...
29.77/29.82	
29.77/29.82	LOG: CALL solverLinear in Graph for feasibility
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear in Graph for feasibility
29.77/29.82	It's unfeasible. Removing transition: 
29.77/29.82	<l1, l1, 1 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	[ Termination Graph ]
29.77/29.82	Strengthening and disabling transitions...
29.77/29.82	> It's unfeasible. Removing transition: 
29.77/29.82	<l1, l1, 1 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	New Graphs: 
29.77/29.82	Calling Safety with literal 1000 + x^0 <= 0 and entry <l0, l1, true, {all remain the same}>
29.77/29.82	
29.77/29.82	LOG: CALL check - Post:1000 + x^0 <= 0 - Process 1
29.77/29.82	* Exit transition: <l0, l1, true, {all remain the same}>
29.77/29.82	* Postcondition  : 1000 + x^0 <= 0
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.002178s
29.77/29.82	> Postcondition is not implied!
29.77/29.82	
29.77/29.82	LOG: RETURN check - Elapsed time: 0.002249s
29.77/29.82	INVARIANTS: 
29.77/29.82	1: 
29.77/29.82	Quasi-INVARIANTS to narrow Graph: 
29.77/29.82	1: 1000 + x^0 <= 0 , 
29.77/29.82	Narrowing transition: 
29.77/29.82	<l1, l1, 1 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	
29.77/29.82	LOG: Narrow transition size 1
29.77/29.82	invGraph after Narrowing: 
29.77/29.82	Transitions:
29.77/29.82	<l1, l1, 1 <= undef1 /\ 0 <= 999 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Variables:
29.77/29.82	x^0
29.77/29.82	Checking conditional termination of SCC {l1}...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.000633s
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.002211s
29.77/29.82	Trying to remove transition: <l1, l1, 1 <= undef1 /\ 0 <= 999 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003973s
29.77/29.82	Time used: 0.003813
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001656s
29.77/29.82	Time used: 4.00111
29.77/29.82	Solving with 2 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.039651s
29.77/29.82	Time used: 4.00124
29.77/29.82	Solving with 3 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012756s
29.77/29.82	Time used: 1.0014
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020422s
29.77/29.82	Time used: 0.005959
29.77/29.82	Improving Solution with cost 1 ...
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetNextSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010130s
29.77/29.82	Time used: 0.010125
29.77/29.82	
29.77/29.82	LOG: SAT solveNonLinear - Elapsed time: 0.030552s
29.77/29.82	Cost: 1; Total time: 0.016084
29.77/29.82	Quasi-ranking function: 50000 - x^0
29.77/29.82	New Graphs: 
29.77/29.82	Transitions:
29.77/29.82	<l1, l1, 1 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Variables:
29.77/29.82	x^0
29.77/29.82	Checking conditional termination of SCC {l1}...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.000605s
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.002334s
29.77/29.82	Trying to remove transition: <l1, l1, 1 <= undef1 /\ 50001 <= x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004439s
29.77/29.82	Time used: 0.004278
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003224s
29.77/29.82	Time used: 4.00271
29.77/29.82	Solving with 2 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007433s
29.77/29.82	Time used: 4.00092
29.77/29.82	Solving with 3 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014204s
29.77/29.82	Time used: 1.00223
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019302s
29.77/29.82	Time used: 0.004638
29.77/29.82	
29.77/29.82	Proving non-termination of subgraph 1
29.77/29.82	Transitions:
29.77/29.82	<l1, l1, 1 <= undef1 /\ 0 <= 999 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	Variables:
29.77/29.82	x^0
29.77/29.82	
29.77/29.82	Checking that every undef value has an assignment...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.001039s
29.77/29.82	Checking conditional non-termination of SCC {l1}...
29.77/29.82	EXIT TRANSITIONS:
29.77/29.82	<l1, end, 1000 + x^0 <= 0, {all remain the same}>
29.77/29.82	
29.77/29.82	Solving with 1 template(s).
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetFirstSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012677s
29.77/29.82	Time used: 0.012445
29.77/29.82	Improving Solution with cost 1 ...
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinearGetNextSolution
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017053s
29.77/29.82	Time used: 0.017046
29.77/29.82	
29.77/29.82	LOG: SAT solveNonLinear - Elapsed time: 0.029730s
29.77/29.82	Cost: 1; Total time: 0.029491
29.77/29.82	Failed at location 1: 1 <= x^0
29.77/29.82	Before Improving: 
29.77/29.82	Quasi-invariant at l1: 1 <= x^0
29.77/29.82	Optimizing invariants...
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.007132s
29.77/29.82	Quasi-invariant improved
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.002076s
29.77/29.82	Quasi-invariant improved
29.77/29.82	
29.77/29.82	LOG: CALL solveLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear - Elapsed time: 0.001342s
29.77/29.82	Remaining time after improvement: 0.994427
29.77/29.82	Minimizing number of undef constraints...
29.77/29.82	
29.77/29.82	LOG: CALL solveNonLinear
29.77/29.82	
29.77/29.82	LOG: RETURN solveNonLinear - Elapsed time: 0.002532s
29.77/29.82	Number of undef constraints reduced!
29.77/29.82	
29.77/29.82	Non-termination implied by a set of quasi-invariant(s):
29.77/29.82	Quasi-invariant at l1: 0 <= 499 + x^0
29.77/29.82	
29.77/29.82	Strengthening and disabling EXIT transitions...
29.77/29.82	Closed exits from l1: 1
29.77/29.82	
29.77/29.82	Strengthening and disabling transitions...
29.77/29.82	
29.77/29.82	LOG: CALL solverLinear in Graph for feasibility
29.77/29.82	
29.77/29.82	LOG: RETURN solveLinear in Graph for feasibility
29.77/29.82	Strengthening transition (result): 
29.77/29.82	<l1, l1, 1 <= undef1 /\ 0 <= 499 + x^0 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
29.77/29.82	
29.77/29.82	Calling reachability with...
29.77/29.82	Transition: <l1, end, true, {all remain the same}>
29.77/29.82	Conditions: 0 <= 499 + x^0, 
29.77/29.82	OPEN EXITS: 
29.77/29.82	<l1, end, 0 <= 499 + x^0, {all remain the same}>
29.77/29.82	
29.77/29.82	--- Reachability graph ---
29.77/29.82	> Graph without transitions.
29.77/29.82	
29.77/29.82	Calling reachability with...
29.77/29.82	Transition: <l0, l1, true, {all remain the same}>
29.77/29.82	Conditions: 0 <= 499 + x^0, 
29.77/29.82	OPEN EXITS: 
29.77/29.82	<l0, l1, 0 <= 499 + x^0, {all remain the same}>
29.77/29.82	
29.77/29.82	> Conditions are reachable!
29.77/29.82	
29.77/29.82	Program does NOT terminate
29.77/29.82	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
29.77/29.82	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
29.77/29.82	EOF