3.02/3.08	NO
3.02/3.08	
3.02/3.09	Solver Timeout: 4
3.02/3.09	Global Timeout: 300
3.02/3.09	No parsing errors!
3.02/3.09	Init Location: 0
3.02/3.09	Transitions:
3.02/3.09	<l0, l6, true>
3.02/3.09	<l1, l2, true>
3.02/3.09	<l2, l1, true>
3.02/3.09	<l3, l4, true, par{p^0 -> 0}>
3.02/3.09	<l4, l5, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}>
3.02/3.09	<l5, l4, true>
3.02/3.09	<l4, l1, ((0 + y_1^0) <= 0), par{p^0 -> ~(1)}>
3.02/3.09	<l6, l3, true>
3.02/3.09	
3.02/3.09	Fresh variables:
3.02/3.09	
3.02/3.09	Undef variables:
3.02/3.09	
3.02/3.09	Abstraction variables:
3.02/3.09	
3.02/3.09	Exit nodes:
3.02/3.09	
3.02/3.09	Accepting locations:
3.02/3.09	
3.02/3.09	Asserts:
3.02/3.09	
3.02/3.09	Preprocessed LLVMGraph
3.02/3.09	Init Location: 0
3.02/3.09	Transitions:
3.02/3.09	<l0, l4, true>
3.02/3.09	<l1, l1, true>
3.02/3.09	<l4, l4, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}>
3.02/3.09	<l4, l1, ((0 + y_1^0) <= 0)>
3.02/3.09	
3.02/3.09	Fresh variables:
3.02/3.09	
3.02/3.09	Undef variables:
3.02/3.09	
3.02/3.09	Abstraction variables:
3.02/3.09	
3.02/3.09	Exit nodes:
3.02/3.09	
3.02/3.09	Accepting locations:
3.02/3.09	
3.02/3.09	Asserts:
3.02/3.09	
3.02/3.09	*************************************************************
3.02/3.09	*******************************************************************************************
3.02/3.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.02/3.09	*******************************************************************************************
3.02/3.09	
3.02/3.09	Init Location: 0
3.02/3.09	Graph 0:
3.02/3.09	Transitions:
3.02/3.09	Variables:
3.02/3.09	
3.02/3.09	Graph 1:
3.02/3.09	Transitions:
3.02/3.09	<l4, l4, 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>
3.02/3.09	Variables:
3.02/3.09	y_1^0
3.02/3.09	
3.02/3.09	Graph 2:
3.02/3.09	Transitions:
3.02/3.09	<l1, l1, true, {all remain the same}>
3.02/3.09	Variables:
3.02/3.09	
3.02/3.09	Precedence: 
3.02/3.09	Graph 0
3.02/3.09	
3.02/3.09	Graph 1
3.02/3.09	<l0, l4, true, {all remain the same}>
3.02/3.09	
3.02/3.09	Graph 2
3.02/3.09	<l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	
3.02/3.09	Map Locations to Subgraph:
3.02/3.09	( 0 , 0 )
3.02/3.09	( 1 , 2 )
3.02/3.09	( 4 , 1 )
3.02/3.09	
3.02/3.09	*******************************************************************************************
3.02/3.09	********************************    CHECKING ASSERTIONS    ********************************
3.02/3.09	*******************************************************************************************
3.02/3.09	
3.02/3.09	Proving termination of subgraph 0
3.02/3.09	Proving termination of subgraph 1
3.02/3.09	Checking unfeasibility...
3.02/3.09	Time used: 0.0014
3.02/3.09	
3.02/3.09	Checking conditional termination of SCC {l4}...
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.000493s
3.02/3.09	Ranking function: -1 + y_1^0
3.02/3.09	New Graphs: 
3.02/3.09	Proving termination of subgraph 2
3.02/3.09	Checking unfeasibility...
3.02/3.09	Time used: 0.000843
3.02/3.09	
3.02/3.09	> No variable changes in termination graph.
3.02/3.09	Checking conditional unfeasibility...
3.02/3.09	Termination failed. Trying to show unreachability...
3.02/3.09	Proving unreachability of entry: <l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	
3.02/3.09	LOG: CALL check - Post:1 <= 0 - Process 1
3.02/3.09	* Exit transition: <l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	* Postcondition  : 1 <= 0
3.02/3.09	Postcodition moved up: 1 <= 0
3.02/3.09	
3.02/3.09	LOG: Try proving POST
3.02/3.09	Postcondition: 1 <= 0
3.02/3.09	
3.02/3.09	LOG: CALL check - Post:1 <= 0 - Process 2
3.02/3.09	* Exit transition: <l0, l4, true, {all remain the same}>
3.02/3.09	* Postcondition  : 1 <= 0
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.000161s
3.02/3.09	> Postcondition is not implied!
3.02/3.09	
3.02/3.09	LOG: RETURN check - Elapsed time: 0.000214s
3.02/3.09	
3.02/3.09	LOG: NarrowEntry size 1
3.02/3.09	Narrowing transition: 
3.02/3.09	<l4, l4, 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>
3.02/3.09	
3.02/3.09	LOG: Narrow transition size 1
3.02/3.09	ENTRIES:
3.02/3.09	<l0, l4, 0 <= 0, {all remain the same}>
3.02/3.09	END ENTRIES:
3.02/3.09	GRAPH:
3.02/3.09	<l4, l4, 0 <= 0 /\ 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>
3.02/3.09	END GRAPH:
3.02/3.09	EXIT: <l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	POST: 1 <= 0
3.02/3.09	
3.02/3.09	
3.02/3.09	LOG: Try proving POST
3.02/3.09	Solving with 1 template(s).
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetFirstSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004356s
3.02/3.09	Time used: 0.004223
3.02/3.09	Improving Solution with cost 51 ...
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetNextSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000502s
3.02/3.09	Time used: 1.00033
3.02/3.09	
3.02/3.09	LOG: SAT solveNonLinear - Elapsed time: 1.004857s
3.02/3.09	Cost: 51; Total time: 1.00455
3.02/3.09	Failed at location 4: y_1^0 <= 0
3.02/3.09	Before Improving: 
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	Optimizing invariants...
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.008400s
3.02/3.09	Remaining time after improvement: 0.999207
3.02/3.09	Some transition disabled by a set of quasi-invariant(s):
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: NEXT CALL check - disable
3.02/3.09	
3.02/3.09	LOG: CALL check - Post:y_1^0 <= 0 - Process 3
3.02/3.09	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.02/3.09	* Postcondition  : y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.000291s
3.02/3.09	> Postcondition is not implied!
3.02/3.09	
3.02/3.09	LOG: RETURN check - Elapsed time: 0.000380s
3.02/3.09	Solving with 2 template(s).
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetFirstSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013751s
3.02/3.09	Time used: 0.013607
3.02/3.09	Improving Solution with cost 51 ...
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetNextSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000777s
3.02/3.09	Time used: 1.00059
3.02/3.09	
3.02/3.09	LOG: SAT solveNonLinear - Elapsed time: 1.014528s
3.02/3.09	Cost: 51; Total time: 1.0142
3.02/3.09	Failed at location 4: y_1^0 <= 0
3.02/3.09	Before Improving: 
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	Optimizing invariants...
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.004795s
3.02/3.09	Remaining time after improvement: 0.99909
3.02/3.09	Some transition disabled by a set of quasi-invariant(s):
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: NEXT CALL check - disable
3.02/3.09	
3.02/3.09	LOG: CALL check - Post:y_1^0 <= 0 - Process 4
3.02/3.09	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.02/3.09	* Postcondition  : y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.000408s
3.02/3.09	> Postcondition is not implied!
3.02/3.09	
3.02/3.09	LOG: RETURN check - Elapsed time: 0.000475s
3.02/3.09	Solving with 3 template(s).
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetFirstSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040840s
3.02/3.09	Time used: 0.04068
3.02/3.09	Improving Solution with cost 51 ...
3.02/3.09	
3.02/3.09	LOG: CALL solveNonLinearGetNextSolution
3.02/3.09	
3.02/3.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.959800s
3.02/3.09	Time used: 0.959765
3.02/3.09	
3.02/3.09	LOG: SAT solveNonLinear - Elapsed time: 1.000640s
3.02/3.09	Cost: 51; Total time: 1.00045
3.02/3.09	Failed at location 4: y_1^0 <= 0
3.02/3.09	Before Improving: 
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	Optimizing invariants...
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.006397s
3.02/3.09	Remaining time after improvement: 0.998964
3.02/3.09	Some transition disabled by a set of quasi-invariant(s):
3.02/3.09	Quasi-invariant at l4: y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: NEXT CALL check - disable
3.02/3.09	
3.02/3.09	LOG: CALL check - Post:y_1^0 <= 0 - Process 5
3.02/3.09	* Exit transition: <l0, l4, 0 <= 0, {all remain the same}>
3.02/3.09	* Postcondition  : y_1^0 <= 0
3.02/3.09	
3.02/3.09	LOG: CALL solveLinear
3.02/3.09	
3.02/3.09	LOG: RETURN solveLinear - Elapsed time: 0.000430s
3.02/3.09	> Postcondition is not implied!
3.02/3.09	
3.02/3.09	LOG: RETURN check - Elapsed time: 0.000502s
3.02/3.09	
3.02/3.09	LOG: Postcondition is not implied - no solution
3.02/3.09	> Postcondition is not implied!
3.02/3.09	
3.02/3.09	LOG: RETURN check - Elapsed time: 3.047950s
3.02/3.09	Cannot prove unreachability
3.02/3.09	
3.02/3.09	Proving non-termination of subgraph 2
3.02/3.09	Transitions:
3.02/3.09	<l1, l1, true, {all remain the same}>
3.02/3.09	Variables:
3.02/3.09	
3.02/3.09	Checking conditional non-termination of SCC {l1}...
3.02/3.09	> No exit transition to close.
3.02/3.09	Calling reachability with...
3.02/3.09	Transition: <l1, end, true, {all remain the same}>
3.02/3.09	Conditions: 
3.02/3.09	OPEN EXITS: 
3.02/3.09	<l1, end, true, {all remain the same}>
3.02/3.09	
3.02/3.09	--- Reachability graph ---
3.02/3.09	> Graph without transitions.
3.02/3.09	
3.02/3.09	Calling reachability with...
3.02/3.09	Transition: <l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	Conditions: 
3.02/3.09	OPEN EXITS: 
3.02/3.09	<l4, l1, y_1^0 <= 0, {all remain the same}>
3.02/3.09	
3.02/3.09	--- Reachability graph ---
3.02/3.09	> Graph without transitions.
3.02/3.09	
3.02/3.09	Calling reachability with...
3.02/3.09	Transition: <l0, l4, true, {all remain the same}>
3.02/3.09	Conditions: y_1^0 <= 0, 
3.02/3.09	OPEN EXITS: 
3.02/3.09	<l0, l4, y_1^0 <= 0, {all remain the same}>
3.02/3.09	
3.02/3.09	> Conditions are reachable!
3.02/3.09	
3.02/3.09	Program does NOT terminate
3.02/3.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
3.02/3.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
3.02/3.09	EOF