5.29/5.35	NO
5.29/5.35	
5.29/5.35	Solver Timeout: 4
5.29/5.35	Global Timeout: 300
5.29/5.35	No parsing errors!
5.29/5.35	Init Location: 0
5.29/5.35	Transitions:
5.29/5.35	<l0, l10, true>
5.29/5.35	<l1, l2, true>
5.29/5.35	<l2, l3, (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + x_5^0) <= 0) /\ (undef4 = undef4), par{Result_4^0 -> undef4, tmp_6^0 -> undef5}>
5.29/5.35	<l2, l4, (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (0 <= (~(1) + x_5^0)), par{tmp_6^0 -> undef8}>
5.29/5.35	<l4, l2, true>
5.29/5.35	<l2, l5, (undef14 = undef14), par{tmp_6^0 -> undef14}>
5.29/5.35	<l5, l6, ((1 + tmp_6^0) <= 0)>
5.29/5.35	<l5, l6, (1 <= (0 + tmp_6^0))>
5.29/5.35	<l6, l3, (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{Result_4^0 -> undef22, x_5^0 -> undef24}>
5.29/5.35	<l2, l7, (undef26 = undef26), par{tmp_6^0 -> undef26}>
5.29/5.35	<l7, l8, ((1 + tmp_6^0) <= 0)>
5.29/5.35	<l7, l8, (1 <= (0 + tmp_6^0))>
5.29/5.35	<l8, l9, (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>
5.29/5.35	<l9, l2, true>
5.29/5.35	<l10, l1, true>
5.29/5.35	
5.29/5.35	Fresh variables:
5.29/5.35	undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 
5.29/5.35	
5.29/5.35	Undef variables:
5.29/5.35	undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 
5.29/5.35	
5.29/5.35	Abstraction variables:
5.29/5.35	
5.29/5.35	Exit nodes:
5.29/5.35	
5.29/5.35	Accepting locations:
5.29/5.35	
5.29/5.35	Asserts:
5.29/5.35	
5.29/5.35	Preprocessed LLVMGraph
5.29/5.35	Init Location: 0
5.29/5.35	Transitions:
5.29/5.35	<l0, l2, true>
5.29/5.35	<l2, l3, (undef5 = undef5) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + x_5^0) <= 0) /\ (undef4 = undef4)>
5.29/5.35	<l2, l2, (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (0 <= (~(1) + x_5^0))>
5.29/5.35	<l2, l3, (undef14 = undef14) /\ ((1 + undef14) <= 0) /\ (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{x_5^0 -> undef24}>
5.29/5.35	<l2, l3, (undef14 = undef14) /\ (1 <= (0 + undef14)) /\ (undef24 = (~(1) + x_5^0)) /\ ((0 + undef24) <= 0) /\ (undef22 = undef22), par{x_5^0 -> undef24}>
5.29/5.35	<l2, l2, (undef26 = undef26) /\ ((1 + undef26) <= 0) /\ (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>
5.29/5.35	<l2, l2, (undef26 = undef26) /\ (1 <= (0 + undef26)) /\ (undef36 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef36)), par{x_5^0 -> undef36}>
5.29/5.35	
5.29/5.35	Fresh variables:
5.29/5.35	undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 
5.29/5.35	
5.29/5.35	Undef variables:
5.29/5.35	undef4, undef5, undef8, undef14, undef22, undef24, undef26, undef36, 
5.29/5.35	
5.29/5.35	Abstraction variables:
5.29/5.35	
5.29/5.35	Exit nodes:
5.29/5.35	
5.29/5.35	Accepting locations:
5.29/5.35	
5.29/5.35	Asserts:
5.29/5.35	
5.29/5.35	*************************************************************
5.29/5.35	*******************************************************************************************
5.29/5.35	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.29/5.35	*******************************************************************************************
5.29/5.35	
5.29/5.35	Init Location: 0
5.29/5.35	Graph 0:
5.29/5.35	Transitions:
5.29/5.35	Variables:
5.29/5.35	
5.29/5.35	Graph 1:
5.29/5.35	Transitions:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	Variables:
5.29/5.35	x_5^0
5.29/5.35	
5.29/5.35	Graph 2:
5.29/5.35	Transitions:
5.29/5.35	Variables:
5.29/5.35	
5.29/5.35	Precedence: 
5.29/5.35	Graph 0
5.29/5.35	
5.29/5.35	Graph 1
5.29/5.35	<l0, l2, true, {all remain the same}>
5.29/5.35	
5.29/5.35	Graph 2
5.29/5.35	<l2, l3, x_5^0 <= 0 /\ undef5 = 0, {all remain the same}>
5.29/5.35	<l2, l3, undef24 <= 0 /\ 1 + undef14 <= 0 /\ x_5^0 = 1 + undef24, {x_5^0 -> undef24, rest remain the same}>
5.29/5.35	<l2, l3, undef24 <= 0 /\ 1 <= undef14 /\ x_5^0 = 1 + undef24, {x_5^0 -> undef24, rest remain the same}>
5.29/5.35	
5.29/5.35	Map Locations to Subgraph:
5.29/5.35	( 0 , 0 )
5.29/5.35	( 2 , 1 )
5.29/5.35	( 3 , 2 )
5.29/5.35	
5.29/5.35	*******************************************************************************************
5.29/5.35	********************************    CHECKING ASSERTIONS    ********************************
5.29/5.35	*******************************************************************************************
5.29/5.35	
5.29/5.35	Proving termination of subgraph 0
5.29/5.35	Proving termination of subgraph 1
5.29/5.35	Checking unfeasibility...
5.29/5.35	Time used: 0.004161
5.29/5.35	
5.29/5.35	Checking conditional termination of SCC {l2}...
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.001299s
5.29/5.35	Ranking function: -2 + x_5^0
5.29/5.35	New Graphs: 
5.29/5.35	Transitions:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	Variables:
5.29/5.35	x_5^0
5.29/5.35	> No variable changes in termination graph.
5.29/5.35	Checking conditional unfeasibility...
5.29/5.35	Calling Safety with literal x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>
5.29/5.35	
5.29/5.35	LOG: CALL check - Post:x_5^0 <= 0 - Process 1
5.29/5.35	* Exit transition: <l2, l2, true, {all remain the same}>
5.29/5.35	* Postcondition  : x_5^0 <= 0
5.29/5.35	Quasi-invariants: 
5.29/5.35	Location 2: x_5^0 <= 0 ; undef36 <= 0 ; 
5.29/5.35	Postcondition: x_5^0 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL check - Post:x_5^0 <= 0 - Process 2
5.29/5.35	* Exit transition: <l0, l2, true, {all remain the same}>
5.29/5.35	* Postcondition  : x_5^0 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000219s
5.29/5.35	> Postcondition is not implied!
5.29/5.35	
5.29/5.35	LOG: RETURN check - Elapsed time: 0.000278s
5.29/5.35	Postcondition: undef36 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL check - Post:undef36 <= 0 - Process 3
5.29/5.35	* Exit transition: <l0, l2, true, {all remain the same}>
5.29/5.35	* Postcondition  : undef36 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000224s
5.29/5.35	> Postcondition is not implied!
5.29/5.35	
5.29/5.35	LOG: RETURN check - Elapsed time: 0.000281s
5.29/5.35	
5.29/5.35	LOG: NarrowEntry size 2
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 2
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 2
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 2
5.29/5.35	ENTRIES:
5.29/5.35	<l0, l2, x_5^0 <= 0 /\ 1 <= undef36, {all remain the same}>
5.29/5.35	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.29/5.35	END ENTRIES:
5.29/5.35	GRAPH:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	END GRAPH:
5.29/5.35	EXIT: <l2, l2, true, {all remain the same}>
5.29/5.35	POST: x_5^0 <= 0
5.29/5.35	
5.29/5.35	
5.29/5.35	LOG: Try proving POST
5.29/5.35	Solving with 1 template(s).
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006778s
5.29/5.35	Time used: 0.006597
5.29/5.35	Improving Solution with cost 1 ...
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetNextSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013203s
5.29/5.35	Time used: 0.013197
5.29/5.35	
5.29/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.019981s
5.29/5.35	Cost: 1; Total time: 0.019794
5.29/5.35	Failed at location 2: x_5^0 <= 0
5.29/5.35	Before Improving: 
5.29/5.35	Quasi-invariant at l2: x_5^0 <= 0
5.29/5.35	Optimizing invariants...
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002661s
5.29/5.35	Remaining time after improvement: 0.998605
5.29/5.35	Postcondition implied by a set of quasi-invariant(s):
5.29/5.35	Quasi-invariant at l2: x_5^0 <= 0
5.29/5.35	Postcondition: x_5^0 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL check - Post:x_5^0 <= 0 - Process 4
5.29/5.35	* Exit transition: <l0, l2, 1 <= x_5^0, {all remain the same}>
5.29/5.35	* Postcondition  : x_5^0 <= 0
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000381s
5.29/5.35	> Postcondition is not implied!
5.29/5.35	
5.29/5.35	LOG: RETURN check - Elapsed time: 0.000449s
5.29/5.35	
5.29/5.35	LOG: NarrowEntry size 1
5.29/5.35	INVARIANTS: 
5.29/5.35	2: 
5.29/5.35	Quasi-INVARIANTS to narrow Graph: 
5.29/5.35	2: x_5^0 <= 0 , 
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 1
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 1
5.29/5.35	Narrowing transition: 
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	
5.29/5.35	LOG: Narrow transition size 1
5.29/5.35	ENTRIES:
5.29/5.35	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.29/5.35	END ENTRIES:
5.29/5.35	GRAPH:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	END GRAPH:
5.29/5.35	EXIT: <l2, l2, true, {all remain the same}>
5.29/5.35	POST: x_5^0 <= 0
5.29/5.35	
5.29/5.35	
5.29/5.35	LOG: Try proving POST
5.29/5.35	Solving with 1 template(s).
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007358s
5.29/5.35	Time used: 0.007257
5.29/5.35	Solving with 2 template(s).
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.156900s
5.29/5.35	Time used: 4.1562
5.29/5.35	Solving with 3 template(s).
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.028516s
5.29/5.35	Time used: 1.00062
5.29/5.35	
5.29/5.35	LOG: Postcondition is not implied - no solution
5.29/5.35	> Postcondition is not implied!
5.29/5.35	
5.29/5.35	LOG: RETURN check - Elapsed time: 5.248805s
5.29/5.35	
5.29/5.35	Proving non-termination of subgraph 1
5.29/5.35	Transitions:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	<l2, l2, 1 + undef26 <= 0 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	<l2, l2, 1 <= undef26 /\ 1 <= undef36 /\ x_5^0 = 1 + undef36, {x_5^0 -> undef36, rest remain the same}>
5.29/5.35	Variables:
5.29/5.35	x_5^0
5.29/5.35	
5.29/5.35	Checking conditional non-termination of SCC {l2}...
5.29/5.35	> No exit transition to close.
5.29/5.35	Checking that every undef value has an assignment...
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.000979s
5.29/5.35	> No assignment for some undef value.
5.29/5.35	
5.29/5.35	Proving non-termination of subgraph 1
5.29/5.35	Transitions:
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	Variables:
5.29/5.35	x_5^0
5.29/5.35	
5.29/5.35	Checking conditional non-termination of SCC {l2}...
5.29/5.35	EXIT TRANSITIONS:
5.29/5.35	<l2, end, x_5^0 <= 0, {all remain the same}>
5.29/5.35	
5.29/5.35	Solving with 1 template(s).
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetFirstSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006133s
5.29/5.35	Time used: 0.00597
5.29/5.35	Improving Solution with cost 1 ...
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinearGetNextSolution
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011324s
5.29/5.35	Time used: 0.011319
5.29/5.35	
5.29/5.35	LOG: SAT solveNonLinear - Elapsed time: 0.017457s
5.29/5.35	Cost: 1; Total time: 0.017289
5.29/5.35	Failed at location 2: 1 <= x_5^0
5.29/5.35	Before Improving: 
5.29/5.35	Quasi-invariant at l2: 1 <= x_5^0
5.29/5.35	Optimizing invariants...
5.29/5.35	
5.29/5.35	LOG: CALL solveLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear - Elapsed time: 0.002956s
5.29/5.35	Remaining time after improvement: 0.999163
5.29/5.35	Minimizing number of undef constraints...
5.29/5.35	
5.29/5.35	LOG: CALL solveNonLinear
5.29/5.35	
5.29/5.35	LOG: RETURN solveNonLinear - Elapsed time: 0.001806s
5.29/5.35	Number of undef constraints reduced!
5.29/5.35	
5.29/5.35	Non-termination implied by a set of quasi-invariant(s):
5.29/5.35	Quasi-invariant at l2: 1 <= x_5^0
5.29/5.35	
5.29/5.35	Strengthening and disabling EXIT transitions...
5.29/5.35	Closed exits from l2: 1
5.29/5.35	
5.29/5.35	Strengthening and disabling transitions...
5.29/5.35	
5.29/5.35	LOG: CALL solverLinear in Graph for feasibility
5.29/5.35	
5.29/5.35	LOG: RETURN solveLinear in Graph for feasibility
5.29/5.35	Strengthening transition (result): 
5.29/5.35	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
5.29/5.35	
5.29/5.35	Calling reachability with...
5.29/5.35	Transition: <l2, end, true, {all remain the same}>
5.29/5.35	Conditions: 1 <= x_5^0, 
5.29/5.35	OPEN EXITS: 
5.29/5.35	<l2, end, 1 <= x_5^0, {all remain the same}>
5.29/5.35	
5.29/5.35	--- Reachability graph ---
5.29/5.35	> Graph without transitions.
5.29/5.35	
5.29/5.35	Calling reachability with...
5.29/5.35	Transition: <l0, l2, true, {all remain the same}>
5.29/5.35	Conditions: 1 <= x_5^0, 
5.29/5.35	OPEN EXITS: 
5.29/5.35	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.29/5.35	
5.29/5.35	> Conditions are reachable!
5.29/5.35	
5.29/5.35	Program does NOT terminate
5.29/5.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.29/5.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.29/5.35	EOF