72.70/31.21	YES
72.70/31.21	
72.70/31.21	Solver Timeout: 4
72.70/31.21	Global Timeout: 300
72.70/31.21	Maximum number of concurrent processes: 900
72.70/31.21	*******************************************************************************************
72.70/31.21	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
72.70/31.21	*******************************************************************************************
72.70/31.21	
72.70/31.21	
72.70/31.21	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
72.70/31.21	
72.70/31.21	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
72.70/31.21	+                                                                  +
72.70/31.21	Init Location: 0
72.70/31.21	Transitions:
72.70/31.21	<l0, l1, true, seq{main__func_return_ -> 0, main_q -> ¿functionCall(__VERIFIER_nondet_int), main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}>
72.70/31.21	<l1, l2, true>
72.70/31.21	<l2, l5, not((main_q > 0))>
72.70/31.21	<l2, l3, (main_q > 0)>
72.70/31.21	<l3, l4, true, seq{main_q -> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}>
72.70/31.21	<l4, l2, true>
72.70/31.21	<l5, l6, true, seq{main__func_return_ -> 0}>
72.70/31.21	
72.70/31.21	Fresh variables:
72.70/31.21	
72.70/31.21	Undef variables:
72.70/31.21	
72.70/31.21	Abstraction variables:
72.70/31.21	
72.70/31.21	Exit nodes:
72.70/31.21	
72.70/31.21	Accepting locations:
72.70/31.21	
72.70/31.21	Asserts:
72.70/31.21	
72.70/31.21	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
72.70/31.21	       
72.70/31.21	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
72.70/31.21	       
72.70/31.21	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
72.70/31.21	
72.70/31.21	Init Location: 0
72.70/31.21	Transitions:
72.70/31.21	<l0, l7, true, seq{main__func_return_ -> 0}>
72.70/31.21	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
72.70/31.21	<l8, l9, true, seq{main_q -> varCall_1}>
72.70/31.21	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
72.70/31.21	<l10, l11, true, seq{main_a -> varCall_2}>
72.70/31.21	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
72.70/31.21	<l12, l1, true, seq{main_b -> varCall_3}>
72.70/31.21	<l1, l2, true>
72.70/31.21	<l2, l3, (main_q > 0)>
72.70/31.21	<l2, l5, not((main_q > 0))>
72.70/31.21	<l3, l4, true, seq{main_q -> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}>
72.70/31.21	<l4, l2, true>
72.70/31.21	<l5, l6, true, seq{main__func_return_ -> 0}>
72.70/31.21	
72.70/31.21	Fresh variables:
72.70/31.21	
72.70/31.21	Undef variables:
72.70/31.21	
72.70/31.21	Abstraction variables:
72.70/31.21	
72.70/31.21	Exit nodes:
72.70/31.21	6, 
72.70/31.21	Accepting locations:
72.70/31.21	
72.70/31.21	Asserts:
72.70/31.21	
72.70/31.21	+                                                                  +
72.70/31.21	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
72.70/31.21	
72.70/31.21	
72.70/31.21	Function Return and Parameters Information [2 functions]:
72.70/31.21	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
72.70/31.21	        __VERIFIER_nondet_int__func_return_      [function result] : int
72.70/31.21	    function name: main [1 return + 0 parameters]        demangled: main
72.70/31.21	        main__func_return_      [function result] : int
72.70/31.21	
72.70/31.21	
72.70/31.21	AST Ident Scanner Information [6 idents]:
72.70/31.21	__VERIFIER_nondet_int | function | [integer, ()] | <line: 14, col: 1> | <line: 19, col: 6> <line: 20, col: 6> <line: 21, col: 6>
72.70/31.21	main | function | [integer, ()] | <line: 16, col: 1>
72.70/31.21	a | local variable | integer | <line: 18, col: 5> | <line: 20, col: 2> <line: 23, col: 11> <line: 24, col: 10> <line: 25, col: 3>
72.70/31.21	b | local variable | integer | <line: 18, col: 5> | <line: 21, col: 2> <line: 25, col: 18> <line: 26, col: 3> <line: 26, col: 18>
72.70/31.21	q | local variable | integer | <line: 18, col: 5> | <line: 19, col: 2> <line: 22, col: 9> <line: 23, col: 3> <line: 23, col: 7>
72.70/31.21	olda | local variable | integer | <line: 18, col: 5> | <line: 24, col: 3> <line: 25, col: 9> <line: 26, col: 9>
72.70/31.21	
72.70/31.21	Main function: main
72.70/31.21	Preprocessed LLVMGraph
72.70/31.21	Init Location: 0
72.70/31.21	Transitions:
72.70/31.21	<l0, l2, (main_a = undef5) /\ (main_b = undef6) /\ (main_q = undef4)>
72.70/31.21	<l2, l2, (main_q > 0), par{main_a -> ((3 * main_a) - (4 * main_b)), main_b -> ((4 * main_a) + (3 * main_b)), main_q -> ((main_q + main_a) - 1)}>
72.70/31.21	<l2, l6, not((main_q > 0))>
72.70/31.21	
72.70/31.21	Fresh variables:
72.70/31.21	undef4, undef5, undef6, 
72.70/31.21	
72.70/31.21	Undef variables:
72.70/31.21	undef4, undef5, undef6, 
72.70/31.21	
72.70/31.21	Abstraction variables:
72.70/31.21	
72.70/31.21	Exit nodes:
72.70/31.21	6, 
72.70/31.21	Accepting locations:
72.70/31.21	
72.70/31.21	Asserts:
72.70/31.21	
72.70/31.21	*************************************************************
72.70/31.21	*******************************************************************************************
72.70/31.21	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
72.70/31.21	*******************************************************************************************
72.70/31.21	
72.70/31.21	Init Location: 0
72.70/31.21	Graph 0:
72.70/31.21	Transitions:
72.70/31.21	Variables:
72.70/31.21	
72.70/31.21	Graph 1:
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	
72.70/31.21	Graph 2:
72.70/31.21	Transitions:
72.70/31.21	Variables:
72.70/31.21	
72.70/31.21	Precedence: 
72.70/31.21	Graph 0
72.70/31.21	
72.70/31.21	Graph 1
72.70/31.21	<l0, l2, main_a = undef5 /\ main_b = undef6 /\ main_q = undef4, {all remain the same}>
72.70/31.21	
72.70/31.21	Graph 2
72.70/31.21	<l2, l6, main_q <= 0, {all remain the same}>
72.70/31.21	
72.70/31.21	Map Locations to Subgraph:
72.70/31.21	( 0 , 0 )
72.70/31.21	( 2 , 1 )
72.70/31.21	( 6 , 2 )
72.70/31.21	
72.70/31.21	*******************************************************************************************
72.70/31.21	********************************    CHECKING ASSERTIONS    ********************************
72.70/31.21	*******************************************************************************************
72.70/31.21	
72.70/31.21	Proving termination of subgraph 0
72.70/31.21	Proving termination of subgraph 1
72.70/31.21	Checking unfeasibility...
72.70/31.21	Time used: 0.002691
72.70/31.21	
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.000603s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.001968s
72.70/31.21	[56088 : 56090]
72.70/31.21	[56088 : 56091]
72.70/31.21	Successful child: 56090
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	New Graphs: 
72.70/31.21	
72.70/31.21	LOG: CALL check - Post:main_q <= 0 - Process 1
72.70/31.21	* Exit transition: <l0, l2, main_a = undef5 /\ main_b = undef6 /\ main_q = undef4, {all remain the same}>
72.70/31.21	* Postcondition  : main_q <= 0
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.000584s
72.70/31.21	> Postcondition is not implied!
72.70/31.21	
72.70/31.21	LOG: RETURN check - Elapsed time: 0.000692s
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: main_q <= 0 , 
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.000572s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002088s
72.70/31.21	[56088 : 56095]
72.70/31.21	[56088 : 56096]
72.70/31.21	Successful child: 56095
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ main_a + main_b + main_q <= 1, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ main_a + main_b + main_q <= 1, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Ranking function: 13*main_q
72.70/31.21	New Graphs: 
72.70/31.21	[56088 : 56100]
72.70/31.21	[56088 : 56101]
72.70/31.21	[56088 : 56102]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: main_b <= main_a , 0 <= main_b , main_a + main_b + main_q <= 1 , 
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 3
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002096s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.101402s
72.70/31.21	[56088 : 56103]
72.70/31.21	[56088 : 56104]
72.70/31.21	Successful child: 56103
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002423s
72.70/31.21	Ranking function: 2 + 2*main_a - 2*main_b + 4*main_q
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.000753s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.003810s
72.70/31.21	[56088 : 56108]
72.70/31.21	[56088 : 56109]
72.70/31.21	Successful child: 56108
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ main_a + main_q <= 1, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ main_a + main_q <= 1, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Ranking function: main_q
72.70/31.21	New Graphs: 
72.70/31.21	[56088 : 56113]
72.70/31.21	[56088 : 56114]
72.70/31.21	[56088 : 56115]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: 4*main_q <= main_b , 
72.70/31.21	[56088 : 56116]
72.70/31.21	[56088 : 56117]
72.70/31.21	[56088 : 56118]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: main_a + main_q <= 1 , 
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.006391s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 1.620180s
72.70/31.21	[56088 : 56119]
72.70/31.21	[56088 : 56120]
72.70/31.21	Successful child: 56120
72.70/31.21	Ranking function: 2*main_a - main_b
72.70/31.21	Ranking function and negation of Quasi-Invariant applied
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.003338s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.343682s
72.70/31.21	[56088 : 56124]
72.70/31.21	[56088 : 56125]
72.70/31.21	Successful child: 56125
72.70/31.21	Ranking function: main_a + 2*main_q
72.70/31.21	Ranking function and negation of Quasi-Invariant applied
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002478s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.261090s
72.70/31.21	[56088 : 56129]
72.70/31.21	[56088 : 56130]
72.70/31.21	Successful child: 56129
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	New Graphs: 
72.70/31.21	[56088 : 56134]
72.70/31.21	[56088 : 56135]
72.70/31.21	[56088 : 56136]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: 4*main_q <= main_b , 
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 4*main_q <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, 4*main_q <= main_b /\ 1 + main_a <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002433s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.262551s
72.70/31.21	[56088 : 56137]
72.70/31.21	[56088 : 56138]
72.70/31.21	Successful child: 56137
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 4*main_q <= 4 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002912s
72.70/31.21	Ranking function: (~(1) / 4) + (~(1) / 4)*main_b + main_q
72.70/31.21	New Graphs: 
72.70/31.21	[56088 : 56144]
72.70/31.21	[56088 : 56145]
72.70/31.21	[56088 : 56146]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: 4*main_q <= 4 + main_b , 
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 + main_b <= 4*main_q /\ 1 <= main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 1
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002283s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.228240s
72.70/31.21	[56088 : 56147]
72.70/31.21	[56088 : 56148]
72.70/31.21	Successful child: 56147
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Ranking function: -main_b + 4*main_q
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.001790s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.029485s
72.70/31.21	Piecewise ranking function: min((~(19) / 2) + (~(3) / 2)*main_b + 8*main_q,(~(5) / 2) + (~(1) / 2)*main_b + 2*main_q)
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.000935s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.004549s
72.70/31.21	[56088 : 56152]
72.70/31.21	[56088 : 56153]
72.70/31.21	Successful child: 56152
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	[ Termination Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q /\ 4*main_q <= 6 + main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	New Graphs: 
72.70/31.21	[56088 : 56157]
72.70/31.21	[56088 : 56158]
72.70/31.21	[56088 : 56159]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: 4*main_q <= 6 + main_b , 
72.70/31.21	[56088 : 56160]
72.70/31.21	[56088 : 56161]
72.70/31.21	[56088 : 56162]
72.70/31.21	INVARIANTS: 
72.70/31.21	2: 
72.70/31.21	Quasi-INVARIANTS to narrow Graph: 
72.70/31.21	2: 2 + main_a + main_q <= 0 , 
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	Narrowing transition: 
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: Narrow transition size 2
72.70/31.21	invGraph after Narrowing: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.006604s
72.70/31.21	Ranking function: -36 - 3*main_a - 6*main_b + 30*main_q
72.70/31.21	New Graphs: 
72.70/31.21	Transitions:
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	Variables:
72.70/31.21	main_a, main_b, main_q
72.70/31.21	Checking conditional termination of SCC {l2}...
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.002942s
72.70/31.21	
72.70/31.21	LOG: CALL solveLinear
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear - Elapsed time: 0.334817s
72.70/31.21	[56088 : 56163]
72.70/31.21	[56088 : 56164]
72.70/31.21	Successful child: 56163
72.70/31.21	[ Invariant Graph ]
72.70/31.21	Strengthening and disabling transitions...
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	It's unfeasible. Removing transition: 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.21	
72.70/31.21	LOG: CALL solverLinear in Graph for feasibility
72.70/31.21	
72.70/31.21	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.21	Strengthening transition (result): 
72.70/31.21	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	[ Termination Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Ranking function: -main_b + 4*main_q
72.70/31.22	New Graphs: 
72.70/31.22	[56088 : 56168]
72.70/31.22	[56088 : 56169]
72.70/31.22	[56088 : 56170]
72.70/31.22	[56088 : 56171]
72.70/31.22	[56088 : 56172]
72.70/31.22	INVARIANTS: 
72.70/31.22	2: 
72.70/31.22	Quasi-INVARIANTS to narrow Graph: 
72.70/31.22	2: 4*main_q <= 5 + main_b , 
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 5 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	invGraph after Narrowing: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.009063s
72.70/31.22	Ranking function: -26 - 3*main_a - 6*main_b + 30*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.002737s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.263536s
72.70/31.22	[56088 : 56173]
72.70/31.22	[56088 : 56174]
72.70/31.22	Successful child: 56173
72.70/31.22	[ Invariant Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	[ Termination Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Ranking function: -main_b + 4*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.000953s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.004417s
72.70/31.22	[56088 : 56178]
72.70/31.22	[56088 : 56179]
72.70/31.22	Successful child: 56178
72.70/31.22	[ Invariant Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ main_a <= 191 + 4*main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ main_a <= 191 + 4*main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ main_a <= 191 + 4*main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	[ Termination Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ main_a <= 191 + 4*main_q /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Ranking function: -main_a - 34*main_b + 138*main_q
72.70/31.22	New Graphs: 
72.70/31.22	[56088 : 56243]
72.70/31.22	[56088 : 56244]
72.70/31.22	[56088 : 56245]
72.70/31.22	[56088 : 56246]
72.70/31.22	[56088 : 56249]
72.70/31.22	INVARIANTS: 
72.70/31.22	2: 
72.70/31.22	Quasi-INVARIANTS to narrow Graph: 
72.70/31.22	2: 4*main_q <= 6 + main_b , 
72.70/31.22	[56088 : 56255]
72.70/31.22	[56088 : 56256]
72.70/31.22	INVARIANTS: 
72.70/31.22	2: 
72.70/31.22	Quasi-INVARIANTS to narrow Graph: 
72.70/31.22	2: main_a <= 191 + 4*main_q , 
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 2
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 2
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 2
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 2
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 6 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 2
72.70/31.22	invGraph after Narrowing: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.014401s
72.70/31.22	Ranking function: 40 - 4*main_a - 8*main_b + 40*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.005170s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 2.021224s
72.70/31.22	[56088 : 56361]
72.70/31.22	[56088 : 56362]
72.70/31.22	Successful child: 56362
72.70/31.22	Ranking function: -main_b + 3*main_q
72.70/31.22	Ranking function and negation of Quasi-Invariant applied
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.004419s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 2.070406s
72.70/31.22	[56088 : 56366]
72.70/31.22	[56088 : 56367]
72.70/31.22	Successful child: 56367
72.70/31.22	Ranking function: main_a - main_b
72.70/31.22	Ranking function and negation of Quasi-Invariant applied
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.003625s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.322717s
72.70/31.22	[56088 : 56371]
72.70/31.22	[56088 : 56372]
72.70/31.22	Successful child: 56371
72.70/31.22	[ Invariant Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	Strengthening transition (result): 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	[ Termination Graph ]
72.70/31.22	Strengthening and disabling transitions...
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: CALL solverLinear in Graph for feasibility
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear in Graph for feasibility
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	New Graphs: 
72.70/31.22	[56088 : 56376]
72.70/31.22	[56088 : 56377]
72.70/31.22	[56088 : 56378]
72.70/31.22	INVARIANTS: 
72.70/31.22	2: 
72.70/31.22	Quasi-INVARIANTS to narrow Graph: 
72.70/31.22	2: 4*main_q <= 6 + main_b , 
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	It's unfeasible. Removing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 192 + 4*main_q <= main_a /\ 6 + main_b = 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	Narrowing transition: 
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	
72.70/31.22	LOG: Narrow transition size 1
72.70/31.22	invGraph after Narrowing: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 2 + main_a + main_q <= 0 /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.009222s
72.70/31.22	Ranking function: -25 - 3*main_a - 6*main_b + 30*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.003452s
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.321363s
72.70/31.22	[56088 : 56379]
72.70/31.22	[56088 : 56380]
72.70/31.22	Solving with 1 template(s).
72.70/31.22	
72.70/31.22	LOG: CALL solveNonLinearGetFirstSolution
72.70/31.22	
72.70/31.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086326s
72.70/31.22	Time used: 0.084229
72.70/31.22	Improving Solution with cost 1 ...
72.70/31.22	
72.70/31.22	LOG: CALL solveNonLinearGetNextSolution
72.70/31.22	
72.70/31.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.212970s
72.70/31.22	Time used: 0.212934
72.70/31.22	
72.70/31.22	LOG: SAT solveNonLinear - Elapsed time: 0.299296s
72.70/31.22	Cost: 1; Total time: 0.297163
72.70/31.22	Quasi-ranking function: 50000 - main_a - 2*main_b + 10*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, main_b <= main_a /\ 1 + main_b <= 0 /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.008868s
72.70/31.22	Ranking function: (5004050434 / 100039) + (~(500261) / 100039)*main_b + (300337 / 100039)*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, main_b <= main_a /\ 0 <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 2 <= main_a + main_b + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.006331s
72.70/31.22	Ranking function: (1 / 100037)*main_a + (~(1) / 100037)*main_b
72.70/31.22	New Graphs: 
72.70/31.22	Transitions:
72.70/31.22	<l2, l2, 1 + main_a <= main_b /\ 1 <= main_q /\ 0 <= 1 + main_a + main_q /\ 7 + main_b <= 4*main_q /\ 50001 + 10*main_q <= main_a + 2*main_b, {main_a -> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}>
72.70/31.22	Variables:
72.70/31.22	main_a, main_b, main_q
72.70/31.22	Checking conditional termination of SCC {l2}...
72.70/31.22	
72.70/31.22	LOG: CALL solveLinear
72.70/31.22	
72.70/31.22	LOG: RETURN solveLinear - Elapsed time: 0.002113s
72.70/31.22	Ranking function: (1 / 100043) + (1 / 100043)*main_a + (1 / 100043)*main_q
72.70/31.22	New Graphs: 
72.70/31.22	Proving termination of subgraph 2
72.70/31.22	Analyzing SCC {l6}...
72.70/31.22	No cycles found.
72.70/31.22	
72.70/31.22	Program Terminates
72.70/31.22	EOF