5.08/5.13	NO
5.08/5.13	
5.08/5.13	Solver Timeout: 4
5.08/5.13	Global Timeout: 300
5.08/5.13	No parsing errors!
5.08/5.13	Init Location: 0
5.08/5.13	Transitions:
5.08/5.13	<l0, l10, true>
5.08/5.13	<l1, l2, true>
5.08/5.13	<l2, l3, (undef9 = undef9) /\ ((0 + undef9) <= 0) /\ (0 <= (0 + undef9)) /\ ((0 + x_5^0) <= 0) /\ (undef6 = undef6), par{Result_4^0 -> undef6, tmp_6^0 -> undef9}>
5.08/5.13	<l2, l4, (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (0 <= (~(1) + x_5^0)), par{tmp_6^0 -> undef14}>
5.08/5.13	<l4, l2, true>
5.08/5.13	<l2, l5, (undef24 = undef24), par{tmp_6^0 -> undef24}>
5.08/5.13	<l5, l6, (undef27 = __disjvr_0^0) /\ (__disjvr_0^0 = undef27), par{__disjvr_0^0 -> undef27}>
5.08/5.13	<l6, l3, (undef35 = (~(1) + x_5^0)) /\ ((0 + undef35) <= 0) /\ (undef31 = undef31), par{Result_4^0 -> undef31, x_5^0 -> undef35}>
5.08/5.13	<l2, l7, (undef39 = undef39), par{tmp_6^0 -> undef39}>
5.08/5.13	<l7, l8, (undef43 = __disjvr_1^0) /\ (__disjvr_1^0 = undef43), par{__disjvr_1^0 -> undef43}>
5.08/5.13	<l8, l9, (undef50 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef50)), par{x_5^0 -> undef50}>
5.08/5.13	<l9, l2, true>
5.08/5.13	<l10, l1, true>
5.08/5.13	
5.08/5.13	Fresh variables:
5.08/5.13	undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 
5.08/5.13	
5.08/5.13	Undef variables:
5.08/5.13	undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 
5.08/5.13	
5.08/5.13	Abstraction variables:
5.08/5.13	
5.08/5.13	Exit nodes:
5.08/5.13	
5.08/5.13	Accepting locations:
5.08/5.13	
5.08/5.13	Asserts:
5.08/5.13	
5.08/5.13	Preprocessed LLVMGraph
5.08/5.13	Init Location: 0
5.08/5.13	Transitions:
5.08/5.13	<l0, l2, true>
5.08/5.13	<l2, l3, (undef9 = undef9) /\ ((0 + undef9) <= 0) /\ (0 <= (0 + undef9)) /\ ((0 + x_5^0) <= 0) /\ (undef6 = undef6)>
5.08/5.13	<l2, l2, (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (0 <= (~(1) + x_5^0))>
5.08/5.13	<l2, l3, (undef24 = undef24) /\ (undef27 = __disjvr_0^0) /\ (__disjvr_0^0 = undef27) /\ (undef35 = (~(1) + x_5^0)) /\ ((0 + undef35) <= 0) /\ (undef31 = undef31), par{__disjvr_0^0 -> undef27, x_5^0 -> undef35}>
5.08/5.13	<l2, l2, (undef39 = undef39) /\ (undef43 = __disjvr_1^0) /\ (__disjvr_1^0 = undef43) /\ (undef50 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef50)), par{__disjvr_1^0 -> undef43, x_5^0 -> undef50}>
5.08/5.13	
5.08/5.13	Fresh variables:
5.08/5.13	undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 
5.08/5.13	
5.08/5.13	Undef variables:
5.08/5.13	undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 
5.08/5.13	
5.08/5.13	Abstraction variables:
5.08/5.13	
5.08/5.13	Exit nodes:
5.08/5.13	
5.08/5.13	Accepting locations:
5.08/5.13	
5.08/5.13	Asserts:
5.08/5.13	
5.08/5.13	*************************************************************
5.08/5.13	*******************************************************************************************
5.08/5.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.08/5.13	*******************************************************************************************
5.08/5.13	
5.08/5.13	Init Location: 0
5.08/5.13	Graph 0:
5.08/5.13	Transitions:
5.08/5.13	Variables:
5.08/5.13	
5.08/5.13	Graph 1:
5.08/5.13	Transitions:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	<l2, l2, 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	Variables:
5.08/5.13	x_5^0, __disjvr_1^0
5.08/5.13	
5.08/5.13	Graph 2:
5.08/5.13	Transitions:
5.08/5.13	Variables:
5.08/5.13	
5.08/5.13	Precedence: 
5.08/5.13	Graph 0
5.08/5.13	
5.08/5.13	Graph 1
5.08/5.13	<l0, l2, true, {all remain the same}>
5.08/5.13	
5.08/5.13	Graph 2
5.08/5.13	<l2, l3, x_5^0 <= 0 /\ undef9 = 0, {all remain the same}>
5.08/5.13	<l2, l3, undef35 <= 0 /\ __disjvr_0^0 = undef27 /\ x_5^0 = 1 + undef35, {__disjvr_0^0 -> undef27, x_5^0 -> undef35, rest remain the same}>
5.08/5.13	
5.08/5.13	Map Locations to Subgraph:
5.08/5.13	( 0 , 0 )
5.08/5.13	( 2 , 1 )
5.08/5.13	( 3 , 2 )
5.08/5.13	
5.08/5.13	*******************************************************************************************
5.08/5.13	********************************    CHECKING ASSERTIONS    ********************************
5.08/5.13	*******************************************************************************************
5.08/5.13	
5.08/5.13	Proving termination of subgraph 0
5.08/5.13	Proving termination of subgraph 1
5.08/5.13	Checking unfeasibility...
5.08/5.13	Time used: 0.003507
5.08/5.13	
5.08/5.13	Checking conditional termination of SCC {l2}...
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000899s
5.08/5.13	Ranking function: -2 + x_5^0
5.08/5.13	New Graphs: 
5.08/5.13	Transitions:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	Variables:
5.08/5.13	x_5^0
5.08/5.13	> No variable changes in termination graph.
5.08/5.13	Checking conditional unfeasibility...
5.08/5.13	Calling Safety with literal x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>
5.08/5.13	
5.08/5.13	LOG: CALL check - Post:x_5^0 <= 0 - Process 1
5.08/5.13	* Exit transition: <l2, l2, true, {all remain the same}>
5.08/5.13	* Postcondition  : x_5^0 <= 0
5.08/5.13	Quasi-invariants: 
5.08/5.13	Location 2: x_5^0 <= 0 ; undef50 <= 0 ; 
5.08/5.13	Postcondition: x_5^0 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL check - Post:x_5^0 <= 0 - Process 2
5.08/5.13	* Exit transition: <l0, l2, true, {all remain the same}>
5.08/5.13	* Postcondition  : x_5^0 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000230s
5.08/5.13	> Postcondition is not implied!
5.08/5.13	
5.08/5.13	LOG: RETURN check - Elapsed time: 0.000289s
5.08/5.13	Postcondition: undef50 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL check - Post:undef50 <= 0 - Process 3
5.08/5.13	* Exit transition: <l0, l2, true, {all remain the same}>
5.08/5.13	* Postcondition  : undef50 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000222s
5.08/5.13	> Postcondition is not implied!
5.08/5.13	
5.08/5.13	LOG: RETURN check - Elapsed time: 0.000277s
5.08/5.13	
5.08/5.13	LOG: NarrowEntry size 2
5.08/5.13	Narrowing transition: 
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	
5.08/5.13	LOG: Narrow transition size 2
5.08/5.13	Narrowing transition: 
5.08/5.13	<l2, l2, 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	
5.08/5.13	LOG: Narrow transition size 2
5.08/5.13	ENTRIES:
5.08/5.13	<l0, l2, x_5^0 <= 0 /\ 1 <= undef50, {all remain the same}>
5.08/5.13	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.08/5.13	END ENTRIES:
5.08/5.13	GRAPH:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	END GRAPH:
5.08/5.13	EXIT: <l2, l2, true, {all remain the same}>
5.08/5.13	POST: x_5^0 <= 0
5.08/5.13	
5.08/5.13	
5.08/5.13	LOG: Try proving POST
5.08/5.13	Solving with 1 template(s).
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006943s
5.08/5.13	Time used: 0.006766
5.08/5.13	Improving Solution with cost 1 ...
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetNextSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010817s
5.08/5.13	Time used: 0.010813
5.08/5.13	
5.08/5.13	LOG: SAT solveNonLinear - Elapsed time: 0.017760s
5.08/5.13	Cost: 1; Total time: 0.017579
5.08/5.13	Failed at location 2: x_5^0 <= 0
5.08/5.13	Before Improving: 
5.08/5.13	Quasi-invariant at l2: x_5^0 <= 0
5.08/5.13	Optimizing invariants...
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.002157s
5.08/5.13	Remaining time after improvement: 0.998788
5.08/5.13	Postcondition implied by a set of quasi-invariant(s):
5.08/5.13	Quasi-invariant at l2: x_5^0 <= 0
5.08/5.13	Postcondition: x_5^0 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL check - Post:x_5^0 <= 0 - Process 4
5.08/5.13	* Exit transition: <l0, l2, 1 <= x_5^0, {all remain the same}>
5.08/5.13	* Postcondition  : x_5^0 <= 0
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000367s
5.08/5.13	> Postcondition is not implied!
5.08/5.13	
5.08/5.13	LOG: RETURN check - Elapsed time: 0.000433s
5.08/5.13	
5.08/5.13	LOG: NarrowEntry size 1
5.08/5.13	INVARIANTS: 
5.08/5.13	2: 
5.08/5.13	Quasi-INVARIANTS to narrow Graph: 
5.08/5.13	2: x_5^0 <= 0 , 
5.08/5.13	Narrowing transition: 
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	
5.08/5.13	LOG: Narrow transition size 1
5.08/5.13	Narrowing transition: 
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	
5.08/5.13	LOG: Narrow transition size 1
5.08/5.13	ENTRIES:
5.08/5.13	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.08/5.13	END ENTRIES:
5.08/5.13	GRAPH:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	END GRAPH:
5.08/5.13	EXIT: <l2, l2, true, {all remain the same}>
5.08/5.13	POST: x_5^0 <= 0
5.08/5.13	
5.08/5.13	
5.08/5.13	LOG: Try proving POST
5.08/5.13	Solving with 1 template(s).
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006888s
5.08/5.13	Time used: 0.006786
5.08/5.13	Solving with 2 template(s).
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001028s
5.08/5.13	Time used: 4.00046
5.08/5.13	Solving with 3 template(s).
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010744s
5.08/5.13	Time used: 1.00626
5.08/5.13	
5.08/5.13	LOG: Postcondition is not implied - no solution
5.08/5.13	> Postcondition is not implied!
5.08/5.13	
5.08/5.13	LOG: RETURN check - Elapsed time: 5.051422s
5.08/5.13	
5.08/5.13	Proving non-termination of subgraph 1
5.08/5.13	Transitions:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	<l2, l2, 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
5.08/5.13	Variables:
5.08/5.13	x_5^0, __disjvr_1^0
5.08/5.13	
5.08/5.13	Checking conditional non-termination of SCC {l2}...
5.08/5.13	> No exit transition to close.
5.08/5.13	Checking that every undef value has an assignment...
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.001216s
5.08/5.13	> No assignment for some undef value.
5.08/5.13	
5.08/5.13	Proving non-termination of subgraph 1
5.08/5.13	Transitions:
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	Variables:
5.08/5.13	x_5^0
5.08/5.13	
5.08/5.13	Checking conditional non-termination of SCC {l2}...
5.08/5.13	EXIT TRANSITIONS:
5.08/5.13	<l2, end, x_5^0 <= 0, {all remain the same}>
5.08/5.13	
5.08/5.13	Solving with 1 template(s).
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005881s
5.08/5.13	Time used: 0.005716
5.08/5.13	Improving Solution with cost 1 ...
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinearGetNextSolution
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010878s
5.08/5.13	Time used: 0.010873
5.08/5.13	
5.08/5.13	LOG: SAT solveNonLinear - Elapsed time: 0.016759s
5.08/5.13	Cost: 1; Total time: 0.016589
5.08/5.13	Failed at location 2: 1 <= x_5^0
5.08/5.13	Before Improving: 
5.08/5.13	Quasi-invariant at l2: 1 <= x_5^0
5.08/5.13	Optimizing invariants...
5.08/5.13	
5.08/5.13	LOG: CALL solveLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear - Elapsed time: 0.002803s
5.08/5.13	Remaining time after improvement: 0.999172
5.08/5.13	Minimizing number of undef constraints...
5.08/5.13	
5.08/5.13	LOG: CALL solveNonLinear
5.08/5.13	
5.08/5.13	LOG: RETURN solveNonLinear - Elapsed time: 0.001667s
5.08/5.13	Number of undef constraints reduced!
5.08/5.13	
5.08/5.13	Non-termination implied by a set of quasi-invariant(s):
5.08/5.13	Quasi-invariant at l2: 1 <= x_5^0
5.08/5.13	
5.08/5.13	Strengthening and disabling EXIT transitions...
5.08/5.13	Closed exits from l2: 1
5.08/5.13	
5.08/5.13	Strengthening and disabling transitions...
5.08/5.13	
5.08/5.13	LOG: CALL solverLinear in Graph for feasibility
5.08/5.13	
5.08/5.13	LOG: RETURN solveLinear in Graph for feasibility
5.08/5.13	Strengthening transition (result): 
5.08/5.13	<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
5.08/5.13	
5.08/5.13	Calling reachability with...
5.08/5.13	Transition: <l2, end, true, {all remain the same}>
5.08/5.13	Conditions: 1 <= x_5^0, 
5.08/5.13	OPEN EXITS: 
5.08/5.13	<l2, end, 1 <= x_5^0, {all remain the same}>
5.08/5.13	
5.08/5.13	--- Reachability graph ---
5.08/5.13	> Graph without transitions.
5.08/5.13	
5.08/5.13	Calling reachability with...
5.08/5.13	Transition: <l0, l2, true, {all remain the same}>
5.08/5.13	Conditions: 1 <= x_5^0, 
5.08/5.13	OPEN EXITS: 
5.08/5.13	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.08/5.13	
5.08/5.13	> Conditions are reachable!
5.08/5.13	
5.08/5.13	Program does NOT terminate
5.08/5.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.08/5.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.08/5.13	EOF