33.31/33.42	NO
33.31/33.42	
33.31/33.42	Solver Timeout: 4
33.31/33.42	Global Timeout: 300
33.31/33.42	No parsing errors!
33.31/33.42	Init Location: 0
33.31/33.42	Transitions:
33.31/33.42	<l0, l4, true>
33.31/33.42	<l1, l2, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)), par{x^0 -> undef1}>
33.31/33.42	<l2, l1, (undef2 = (400 + x^0)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>
33.31/33.42	<l3, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}>
33.31/33.42	<l3, l2, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)), par{x^0 -> undef4}>
33.31/33.42	<l4, l3, true>
33.31/33.42	
33.31/33.42	Fresh variables:
33.31/33.42	undef1, undef2, undef3, undef4, 
33.31/33.42	
33.31/33.42	Undef variables:
33.31/33.42	undef1, undef2, undef3, undef4, 
33.31/33.42	
33.31/33.42	Abstraction variables:
33.31/33.42	
33.31/33.42	Exit nodes:
33.31/33.42	
33.31/33.42	Accepting locations:
33.31/33.42	
33.31/33.42	Asserts:
33.31/33.42	
33.31/33.42	Preprocessed LLVMGraph
33.31/33.42	Init Location: 0
33.31/33.42	Transitions:
33.31/33.42	<l0, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}>
33.31/33.42	<l0, l1, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)) /\ (undef2 = (400 + undef4)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>
33.31/33.42	<l1, l1, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)) /\ (undef2 = (400 + undef1)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}>
33.31/33.42	
33.31/33.42	Fresh variables:
33.31/33.42	undef1, undef2, undef3, undef4, 
33.31/33.42	
33.31/33.42	Undef variables:
33.31/33.42	undef1, undef2, undef3, undef4, 
33.31/33.42	
33.31/33.42	Abstraction variables:
33.31/33.42	
33.31/33.42	Exit nodes:
33.31/33.42	
33.31/33.42	Accepting locations:
33.31/33.42	
33.31/33.42	Asserts:
33.31/33.42	
33.31/33.42	*************************************************************
33.31/33.42	*******************************************************************************************
33.31/33.42	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
33.31/33.42	*******************************************************************************************
33.31/33.42	
33.31/33.42	Init Location: 0
33.31/33.42	Graph 0:
33.31/33.42	Transitions:
33.31/33.42	Variables:
33.31/33.42	
33.31/33.42	Graph 1:
33.31/33.42	Transitions:
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Variables:
33.31/33.42	x^0
33.31/33.42	
33.31/33.42	Precedence: 
33.31/33.42	Graph 0
33.31/33.42	
33.31/33.42	Graph 1
33.31/33.42	<l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	<l0, l1, 101 <= undef2 /\ 101 <= undef4 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest remain the same}>
33.31/33.42	
33.31/33.42	Map Locations to Subgraph:
33.31/33.42	( 0 , 0 )
33.31/33.42	( 1 , 1 )
33.31/33.42	
33.31/33.42	*******************************************************************************************
33.31/33.42	********************************    CHECKING ASSERTIONS    ********************************
33.31/33.42	*******************************************************************************************
33.31/33.42	
33.31/33.42	Proving termination of subgraph 0
33.31/33.42	Proving termination of subgraph 1
33.31/33.42	Checking unfeasibility...
33.31/33.42	Time used: 0.002036
33.31/33.42	
33.31/33.42	Checking conditional termination of SCC {l1}...
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.000689s
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.002551s
33.31/33.42	Trying to remove transition: <l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004057s
33.31/33.42	Time used: 0.00386
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003451s
33.31/33.42	Time used: 4.00261
33.31/33.42	Solving with 2 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007719s
33.31/33.42	Time used: 4.00102
33.31/33.42	Solving with 3 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.028401s
33.31/33.42	Time used: 1.00088
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045401s
33.31/33.42	Time used: 0.00691
33.31/33.42	Improving Solution with cost 1 ...
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetNextSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018044s
33.31/33.42	Time used: 0.018038
33.31/33.42	
33.31/33.42	LOG: SAT solveNonLinear - Elapsed time: 0.063445s
33.31/33.42	Cost: 1; Total time: 0.024948
33.31/33.42	Termination implied by a set of invariant(s):
33.31/33.42	Invariant at l1: 1 <= x^0
33.31/33.42	[ Invariant Graph ]
33.31/33.42	Strengthening and disabling transitions...
33.31/33.42	
33.31/33.42	LOG: CALL solverLinear in Graph for feasibility
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear in Graph for feasibility
33.31/33.42	Strengthening transition (result): 
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 1 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	[ Termination Graph ]
33.31/33.42	Strengthening and disabling transitions...
33.31/33.42	
33.31/33.42	LOG: CALL solverLinear in Graph for feasibility
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear in Graph for feasibility
33.31/33.42	Strengthening transition (result): 
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 1 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Quasi-ranking function: 50000 - x^0
33.31/33.42	New Graphs: 
33.31/33.42	Transitions:
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 50001 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Variables:
33.31/33.42	x^0
33.31/33.42	Checking conditional termination of SCC {l1}...
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.000743s
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.002959s
33.31/33.42	Trying to remove transition: <l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 50001 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004843s
33.31/33.42	Time used: 0.004664
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003709s
33.31/33.42	Time used: 4.003
33.31/33.42	Solving with 2 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008267s
33.31/33.42	Time used: 4.00133
33.31/33.42	Solving with 3 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005573s
33.31/33.42	Time used: 1.00129
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043804s
33.31/33.42	Time used: 0.006708
33.31/33.42	Termination failed. Trying to show unreachability...
33.31/33.42	Proving unreachability of entry: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	
33.31/33.42	LOG: CALL check - Post:1 <= 0 - Process 1
33.31/33.42	* Exit transition: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	* Postcondition  : 1 <= 0
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.001054s
33.31/33.42	> Postcondition is not implied!
33.31/33.42	
33.31/33.42	LOG: RETURN check - Elapsed time: 0.001140s
33.31/33.42	Cannot prove unreachability
33.31/33.42	
33.31/33.42	Proving non-termination of subgraph 1
33.31/33.42	Transitions:
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Variables:
33.31/33.42	x^0
33.31/33.42	
33.31/33.42	Checking conditional non-termination of SCC {l1}...
33.31/33.42	> No exit transition to close.
33.31/33.42	Checking that every undef value has an assignment...
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.001139s
33.31/33.42	> No assignment for some undef value.
33.31/33.42	
33.31/33.42	Proving non-termination of subgraph 1
33.31/33.42	Transitions:
33.31/33.42	<l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 50001 <= x^0 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Variables:
33.31/33.42	x^0
33.31/33.42	
33.31/33.42	Checking that every undef value has an assignment...
33.31/33.42	
33.31/33.42	LOG: CALL solveLinear
33.31/33.42	
33.31/33.42	LOG: RETURN solveLinear - Elapsed time: 0.001339s
33.31/33.42	Checking conditional non-termination of SCC {l1}...
33.31/33.42	EXIT TRANSITIONS:
33.31/33.42	<l1, end, x^0 <= 50000, {all remain the same}>
33.31/33.42	
33.31/33.42	Solving with 1 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.018571s
33.31/33.42	Time used: 5.01783
33.31/33.42	Solving with 2 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.012254s
33.31/33.42	Time used: 5.00472
33.31/33.42	Solving with 3 template(s).
33.31/33.42	
33.31/33.42	LOG: CALL solveNonLinearGetFirstSolution
33.31/33.42	
33.31/33.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.016733s
33.31/33.42	Time used: 5.00365
33.31/33.42	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
33.31/33.42	Calling reachability with...
33.31/33.42	Transition: <l1, end, true, {all remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	Transition: <l1, end, true, {all remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	OPEN EXITS: 
33.31/33.42	<l1, end, 50001 <= x^0, {all remain the same}>
33.31/33.42	<l1, end, 50001 <= x^0, {all remain the same}>
33.31/33.42	
33.31/33.42	--- Reachability graph ---
33.31/33.42	> Graph without transitions.
33.31/33.42	
33.31/33.42	Calling reachability with...
33.31/33.42	Transition: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	Transition: <l0, l1, 101 <= undef2 /\ 101 <= undef4 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	Transition: <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	Transition: <l0, l1, 101 <= undef2 /\ 101 <= undef4 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest remain the same}>
33.31/33.42	Conditions: 50001 <= x^0, 
33.31/33.42	OPEN EXITS: 
33.31/33.42	<l0, l1, 50001 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	<l0, l1, 101 <= undef4 /\ 50001 <= undef2 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest remain the same}>
33.31/33.42	<l0, l1, 50001 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}>
33.31/33.42	<l0, l1, 101 <= undef4 /\ 50001 <= undef2 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest remain the same}>
33.31/33.42	
33.31/33.42	> Conditions are reachable!
33.31/33.42	
33.31/33.42	Program does NOT terminate
33.31/33.42	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
33.31/33.42	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
33.31/33.42	EOF