37.28/37.30	NO
37.28/37.30	
37.28/37.30	Solver Timeout: 4
37.28/37.30	Global Timeout: 300
37.28/37.30	No parsing errors!
37.28/37.30	Init Location: 0
37.28/37.30	Transitions:
37.28/37.30	<l0, l3, true>
37.28/37.30	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
37.28/37.30	<l2, l2, (arg1 > 35), par{arg1 -> 0, arg2 -> undef4}>
37.28/37.30	<l2, l2, (arg1 < 31) /\ (arg1 < 36) /\ (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
37.28/37.30	<l2, l2, (arg1 > 30) /\ (arg1 < 36), par{arg1 -> 35, arg2 -> undef8}>
37.28/37.30	<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
37.28/37.30	
37.28/37.30	Fresh variables:
37.28/37.30	undef2, undef4, undef6, undef8, undef9, undef10, 
37.28/37.30	
37.28/37.30	Undef variables:
37.28/37.30	undef2, undef4, undef6, undef8, undef9, undef10, 
37.28/37.30	
37.28/37.30	Abstraction variables:
37.28/37.30	
37.28/37.30	Exit nodes:
37.28/37.30	
37.28/37.30	Accepting locations:
37.28/37.30	
37.28/37.30	Asserts:
37.28/37.30	
37.28/37.30	Preprocessed LLVMGraph
37.28/37.30	Init Location: 0
37.28/37.30	Transitions:
37.28/37.30	<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
37.28/37.30	<l2, l2, (arg1 > 35), par{arg1 -> 0}>
37.28/37.30	<l2, l2, (arg1 < 31) /\ (arg1 < 36) /\ (arg1 > 0), par{arg1 -> (arg1 - 1)}>
37.28/37.30	<l2, l2, (arg1 > 30) /\ (arg1 < 36), par{arg1 -> 35}>
37.28/37.30	
37.28/37.30	Fresh variables:
37.28/37.30	undef2, undef4, undef6, undef8, undef9, undef10, 
37.28/37.30	
37.28/37.30	Undef variables:
37.28/37.30	undef2, undef4, undef6, undef8, undef9, undef10, 
37.28/37.30	
37.28/37.30	Abstraction variables:
37.28/37.30	
37.28/37.30	Exit nodes:
37.28/37.30	
37.28/37.30	Accepting locations:
37.28/37.30	
37.28/37.30	Asserts:
37.28/37.30	
37.28/37.30	*************************************************************
37.28/37.30	*******************************************************************************************
37.28/37.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
37.28/37.30	*******************************************************************************************
37.28/37.30	
37.28/37.30	Init Location: 0
37.28/37.30	Graph 0:
37.28/37.30	Transitions:
37.28/37.30	Variables:
37.28/37.30	
37.28/37.30	Graph 1:
37.28/37.30	Transitions:
37.28/37.30	<l2, l2, 36 <= arg1, {arg1 -> 0, rest remain the same}>
37.28/37.30	<l2, l2, 1 <= arg1 /\ arg1 <= 30, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Variables:
37.28/37.30	arg1
37.28/37.30	
37.28/37.30	Precedence: 
37.28/37.30	Graph 0
37.28/37.30	
37.28/37.30	Graph 1
37.28/37.30	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
37.28/37.30	
37.28/37.30	Map Locations to Subgraph:
37.28/37.30	( 0 , 0 )
37.28/37.30	( 2 , 1 )
37.28/37.30	
37.28/37.30	*******************************************************************************************
37.28/37.30	********************************    CHECKING ASSERTIONS    ********************************
37.28/37.30	*******************************************************************************************
37.28/37.30	
37.28/37.30	Proving termination of subgraph 0
37.28/37.30	Proving termination of subgraph 1
37.28/37.30	Checking unfeasibility...
37.28/37.30	Time used: 0.005201
37.28/37.30	
37.28/37.30	Checking conditional termination of SCC {l2}...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001180s
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.014716s
37.28/37.30	Piecewise ranking function: min(60,-2 + 2*arg1)
37.28/37.30	New Graphs: 
37.28/37.30	Transitions:
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Variables:
37.28/37.30	arg1
37.28/37.30	Checking conditional termination of SCC {l2}...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000480s
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001516s
37.28/37.30	Trying to remove transition: <l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001672s
37.28/37.30	Time used: 4.00091
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012751s
37.28/37.30	Time used: 0.008509
37.28/37.30	Improving Solution with cost 1 ...
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetNextSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028111s
37.28/37.30	Time used: 0.027974
37.28/37.30	
37.28/37.30	LOG: SAT solveNonLinear - Elapsed time: 0.040861s
37.28/37.30	Cost: 1; Total time: 0.036483
37.28/37.30	Failed at location 2: arg1 <= 1
37.28/37.30	Before Improving: 
37.28/37.30	Quasi-invariant at l2: arg1 <= 1
37.28/37.30	Optimizing invariants...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.007420s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001826s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001758s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001727s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001720s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001701s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001700s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001266s
37.28/37.30	Remaining time after improvement: 0.987445
37.28/37.30	Termination implied by a set of quasi-invariant(s):
37.28/37.30	Quasi-invariant at l2: arg1 <= 8
37.28/37.30	[ Invariant Graph ]
37.28/37.30	Strengthening and disabling transitions...
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 36 <= arg1, {arg1 -> 0, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	Strengthening transition (result): 
37.28/37.30	<l2, l2, 1 <= arg1 /\ arg1 <= 8, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	[ Termination Graph ]
37.28/37.30	Strengthening and disabling transitions...
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	New Graphs: 
37.28/37.30	Calling Safety with literal arg1 <= 8 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
37.28/37.30	
37.28/37.30	LOG: CALL check - Post:arg1 <= 8 - Process 1
37.28/37.30	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
37.28/37.30	* Postcondition  : arg1 <= 8
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000529s
37.28/37.30	> Postcondition is not implied!
37.28/37.30	
37.28/37.30	LOG: RETURN check - Elapsed time: 0.000622s
37.28/37.30	INVARIANTS: 
37.28/37.30	2: 
37.28/37.30	Quasi-INVARIANTS to narrow Graph: 
37.28/37.30	2: arg1 <= 8 , 
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 36 <= arg1, {arg1 -> 0, rest remain the same}>
37.28/37.30	Narrowing transition: 
37.28/37.30	<l2, l2, 1 <= arg1 /\ arg1 <= 30, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: Narrow transition size 1
37.28/37.30	Narrowing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: Narrow transition size 1
37.28/37.30	invGraph after Narrowing: 
37.28/37.30	Transitions:
37.28/37.30	<l2, l2, arg1 <= 30 /\ 9 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Variables:
37.28/37.30	arg1
37.28/37.30	Checking conditional termination of SCC {l2}...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000793s
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.003490s
37.28/37.30	Piecewise ranking function: min(-9 + arg1,3343 - 109*arg1)
37.28/37.30	New Graphs: 
37.28/37.30	Transitions:
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Variables:
37.28/37.30	arg1
37.28/37.30	Checking conditional termination of SCC {l2}...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000491s
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001568s
37.28/37.30	Trying to remove transition: <l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002052s
37.28/37.30	Time used: 4.00129
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080557s
37.28/37.30	Time used: 0.076587
37.28/37.30	Improving Solution with cost 1 ...
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetNextSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000902s
37.28/37.30	Time used: 1.0008
37.28/37.30	
37.28/37.30	LOG: SAT solveNonLinear - Elapsed time: 1.081459s
37.28/37.30	Cost: 1; Total time: 1.07739
37.28/37.30	Failed at location 2: arg1 <= 9
37.28/37.30	Before Improving: 
37.28/37.30	Quasi-invariant at l2: arg1 <= 9
37.28/37.30	Optimizing invariants...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.013213s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001962s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001770s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001758s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001741s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001742s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001756s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001737s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001726s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001713s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001711s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001716s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001738s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001751s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001749s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001756s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001758s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001772s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001749s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001739s
37.28/37.30	Quasi-invariant improved
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001238s
37.28/37.30	Remaining time after improvement: 0.966284
37.28/37.30	Termination implied by a set of quasi-invariant(s):
37.28/37.30	Quasi-invariant at l2: arg1 <= 29
37.28/37.30	[ Invariant Graph ]
37.28/37.30	Strengthening and disabling transitions...
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	Strengthening transition (result): 
37.28/37.30	<l2, l2, 9 <= arg1 /\ arg1 <= 29, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	[ Termination Graph ]
37.28/37.30	Strengthening and disabling transitions...
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	New Graphs: 
37.28/37.30	Calling Safety with literal arg1 <= 29 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 9 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.30	
37.28/37.30	LOG: CALL check - Post:arg1 <= 29 - Process 2
37.28/37.30	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 9 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.30	* Postcondition  : arg1 <= 29
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000628s
37.28/37.30	> Postcondition is not implied!
37.28/37.30	
37.28/37.30	LOG: RETURN check - Elapsed time: 0.000725s
37.28/37.30	INVARIANTS: 
37.28/37.30	2: 
37.28/37.30	Quasi-INVARIANTS to narrow Graph: 
37.28/37.30	2: arg1 <= 29 , 
37.28/37.30	It's unfeasible. Removing transition: 
37.28/37.30	<l2, l2, arg1 <= 30 /\ 9 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
37.28/37.30	Narrowing transition: 
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	
37.28/37.30	LOG: Narrow transition size 1
37.28/37.30	invGraph after Narrowing: 
37.28/37.30	Transitions:
37.28/37.30	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Variables:
37.28/37.30	arg1
37.28/37.30	Checking conditional termination of SCC {l2}...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.000480s
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.001613s
37.28/37.30	Trying to remove transition: <l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002363s
37.28/37.30	Time used: 4.00159
37.28/37.30	Solving with 1 template(s).
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.126370s
37.28/37.30	Time used: 0.122411
37.28/37.30	Improving Solution with cost 1 ...
37.28/37.30	
37.28/37.30	LOG: CALL solveNonLinearGetNextSolution
37.28/37.30	
37.28/37.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000926s
37.28/37.30	Time used: 1.0007
37.28/37.30	
37.28/37.30	LOG: SAT solveNonLinear - Elapsed time: 1.127296s
37.28/37.30	Cost: 1; Total time: 1.12311
37.28/37.30	Failed at location 2: arg1 <= 30
37.28/37.30	Before Improving: 
37.28/37.30	Quasi-invariant at l2: arg1 <= 30
37.28/37.30	Optimizing invariants...
37.28/37.30	
37.28/37.30	LOG: CALL solveLinear
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear - Elapsed time: 0.014746s
37.28/37.30	Remaining time after improvement: 0.99803
37.28/37.30	Termination implied by a set of quasi-invariant(s):
37.28/37.30	Quasi-invariant at l2: arg1 <= 30
37.28/37.30	[ Invariant Graph ]
37.28/37.30	Strengthening and disabling transitions...
37.28/37.30	
37.28/37.30	LOG: CALL solverLinear in Graph for feasibility
37.28/37.30	
37.28/37.30	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.31	It's unfeasible. Removing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	[ Termination Graph ]
37.28/37.31	Strengthening and disabling transitions...
37.28/37.31	
37.28/37.31	LOG: CALL solverLinear in Graph for feasibility
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.31	It's unfeasible. Removing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	New Graphs: 
37.28/37.31	Calling Safety with literal arg1 <= 30 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 30 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	
37.28/37.31	LOG: CALL check - Post:arg1 <= 30 - Process 3
37.28/37.31	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 30 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	* Postcondition  : arg1 <= 30
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.001503s
37.28/37.31	> Postcondition is not implied!
37.28/37.31	
37.28/37.31	LOG: RETURN check - Elapsed time: 0.001602s
37.28/37.31	INVARIANTS: 
37.28/37.31	2: 
37.28/37.31	Quasi-INVARIANTS to narrow Graph: 
37.28/37.31	2: arg1 <= 30 , 
37.28/37.31	Narrowing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	
37.28/37.31	LOG: Narrow transition size 1
37.28/37.31	invGraph after Narrowing: 
37.28/37.31	Transitions:
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	Variables:
37.28/37.31	arg1
37.28/37.31	Checking conditional termination of SCC {l2}...
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.000507s
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.001704s
37.28/37.31	Trying to remove transition: <l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002592s
37.28/37.31	Time used: 4.00181
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.335272s
37.28/37.31	Time used: 0.330931
37.28/37.31	Improving Solution with cost 1 ...
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetNextSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.049668s
37.28/37.31	Time used: 1.04955
37.28/37.31	
37.28/37.31	LOG: SAT solveNonLinear - Elapsed time: 1.384940s
37.28/37.31	Cost: 1; Total time: 1.38048
37.28/37.31	Failed at location 2: 36 <= arg1
37.28/37.31	Before Improving: 
37.28/37.31	Quasi-invariant at l2: 36 <= arg1
37.28/37.31	Optimizing invariants...
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.023788s
37.28/37.31	Remaining time after improvement: 0.998329
37.28/37.31	Termination implied by a set of quasi-invariant(s):
37.28/37.31	Quasi-invariant at l2: 36 <= arg1
37.28/37.31	[ Invariant Graph ]
37.28/37.31	Strengthening and disabling transitions...
37.28/37.31	
37.28/37.31	LOG: CALL solverLinear in Graph for feasibility
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.31	It's unfeasible. Removing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	[ Termination Graph ]
37.28/37.31	Strengthening and disabling transitions...
37.28/37.31	> It's unfeasible. Removing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	New Graphs: 
37.28/37.31	Calling Safety with literal 36 <= arg1 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 31 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	
37.28/37.31	LOG: CALL check - Post:36 <= arg1 - Process 4
37.28/37.31	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 31 <= arg1 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	* Postcondition  : 36 <= arg1
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.001639s
37.28/37.31	> Postcondition is not implied!
37.28/37.31	
37.28/37.31	LOG: RETURN check - Elapsed time: 0.001745s
37.28/37.31	INVARIANTS: 
37.28/37.31	2: 
37.28/37.31	Quasi-INVARIANTS to narrow Graph: 
37.28/37.31	2: 36 <= arg1 , 
37.28/37.31	Narrowing transition: 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	
37.28/37.31	LOG: Narrow transition size 1
37.28/37.31	invGraph after Narrowing: 
37.28/37.31	Transitions:
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	Variables:
37.28/37.31	arg1
37.28/37.31	Checking conditional termination of SCC {l2}...
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.000512s
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.001712s
37.28/37.31	Trying to remove transition: <l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002684s
37.28/37.31	Time used: 4.00191
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007527s
37.28/37.31	Time used: 4.00279
37.28/37.31	Solving with 2 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.067724s
37.28/37.31	Time used: 4.00174
37.28/37.31	Solving with 3 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021171s
37.28/37.31	Time used: 1.00154
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008678s
37.28/37.31	Time used: 4.00244
37.28/37.31	
37.28/37.31	Proving non-termination of subgraph 1
37.28/37.31	Transitions:
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	Variables:
37.28/37.31	arg1
37.28/37.31	
37.28/37.31	Checking conditional non-termination of SCC {l2}...
37.28/37.31	EXIT TRANSITIONS:
37.28/37.31	<l2, end, 36 <= arg1, {all remain the same}>
37.28/37.31	<l2, end, arg1 <= 30, {all remain the same}>
37.28/37.31	
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031149s
37.28/37.31	Time used: 0.030979
37.28/37.31	Improving Solution with cost 2 ...
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetNextSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019506s
37.28/37.31	Time used: 0.019496
37.28/37.31	
37.28/37.31	LOG: SAT solveNonLinear - Elapsed time: 0.050655s
37.28/37.31	Cost: 2; Total time: 0.050475
37.28/37.31	Failed at location 2: arg1 <= 35
37.28/37.31	Before Improving: 
37.28/37.31	Quasi-invariant at l2: arg1 <= 35
37.28/37.31	Optimizing invariants...
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.005166s
37.28/37.31	Remaining time after improvement: 0.99882
37.28/37.31	Non-termination implied by a set of quasi-invariant(s):
37.28/37.31	Quasi-invariant at l2: arg1 <= 35
37.28/37.31	
37.28/37.31	Strengthening and disabling EXIT transitions...
37.28/37.31	Closed exits from l2: 1
37.28/37.31	Strengthening exit transition (result): 
37.28/37.31	<l2, end, arg1 <= 30, {all remain the same}>
37.28/37.31	
37.28/37.31	Strengthening and disabling transitions...
37.28/37.31	
37.28/37.31	LOG: CALL solverLinear in Graph for feasibility
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.31	Strengthening transition (result): 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	
37.28/37.31	Checking conditional non-termination of SCC {l2}...
37.28/37.31	EXIT TRANSITIONS:
37.28/37.31	<l2, end, arg1 <= 30, {all remain the same}>
37.28/37.31	
37.28/37.31	Solving with 1 template(s).
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetFirstSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182469s
37.28/37.31	Time used: 0.182267
37.28/37.31	Improving Solution with cost 1 ...
37.28/37.31	
37.28/37.31	LOG: CALL solveNonLinearGetNextSolution
37.28/37.31	
37.28/37.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012056s
37.28/37.31	Time used: 0.012045
37.28/37.31	
37.28/37.31	LOG: SAT solveNonLinear - Elapsed time: 0.194524s
37.28/37.31	Cost: 1; Total time: 0.194312
37.28/37.31	Failed at location 2: 31 <= arg1
37.28/37.31	Before Improving: 
37.28/37.31	Quasi-invariant at l2: 31 <= arg1
37.28/37.31	Optimizing invariants...
37.28/37.31	
37.28/37.31	LOG: CALL solveLinear
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear - Elapsed time: 0.003505s
37.28/37.31	Remaining time after improvement: 0.999076
37.28/37.31	Non-termination implied by a set of quasi-invariant(s):
37.28/37.31	Quasi-invariant at l2: 31 <= arg1
37.28/37.31	
37.28/37.31	Strengthening and disabling EXIT transitions...
37.28/37.31	Closed exits from l2: 1
37.28/37.31	
37.28/37.31	Strengthening and disabling transitions...
37.28/37.31	
37.28/37.31	LOG: CALL solverLinear in Graph for feasibility
37.28/37.31	
37.28/37.31	LOG: RETURN solveLinear in Graph for feasibility
37.28/37.31	Strengthening transition (result): 
37.28/37.31	<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
37.28/37.31	
37.28/37.31	Calling reachability with...
37.28/37.31	Transition: <l2, end, true, {all remain the same}>
37.28/37.31	Conditions: arg1 <= 35, 31 <= arg1, 
37.28/37.31	OPEN EXITS: 
37.28/37.31	<l2, end, 31 <= arg1 /\ arg1 <= 35, {all remain the same}>
37.28/37.31	
37.28/37.31	--- Reachability graph ---
37.28/37.31	> Graph without transitions.
37.28/37.31	
37.28/37.31	Calling reachability with...
37.28/37.31	Transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	Conditions: 31 <= arg1, arg1 <= 35, 
37.28/37.31	OPEN EXITS: 
37.28/37.31	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 31 <= arg1 /\ arg1 <= 35 /\ arg1 = undef10, {all remain the same}>
37.28/37.31	
37.28/37.31	> Conditions are reachable!
37.28/37.31	
37.28/37.31	Program does NOT terminate
37.28/37.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
37.28/37.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
37.28/37.31	EOF