37.91/17.10	NO
37.91/17.10	
37.91/17.11	Solver Timeout: 4
37.91/17.11	Global Timeout: 300
37.91/17.11	Maximum number of concurrent processes: 900
37.91/17.11	*******************************************************************************************
37.91/17.11	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
37.91/17.11	*******************************************************************************************
37.91/17.11	
37.91/17.11	
37.91/17.11	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
37.91/17.11	
37.91/17.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
37.91/17.11	+                                                                  +
37.91/17.11	Init Location: 0
37.91/17.11	Transitions:
37.91/17.11	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}>
37.91/17.11	<l1, l2, true>
37.91/17.11	<l2, l6, not((main_a >= 1))>
37.91/17.11	<l2, l3, (main_a >= 1)>
37.91/17.11	<l3, l6, not((main_b >= 1))>
37.91/17.11	<l3, l4, (main_b >= 1)>
37.91/17.11	<l4, l5, true, seq{main_a -> (2 * main_a), main_b -> (3 * main_b)}>
37.91/17.11	<l5, l2, true>
37.91/17.11	<l6, l7, true, seq{main__func_return_ -> 0}>
37.91/17.11	
37.91/17.11	Fresh variables:
37.91/17.11	
37.91/17.11	Undef variables:
37.91/17.11	
37.91/17.11	Abstraction variables:
37.91/17.11	
37.91/17.11	Exit nodes:
37.91/17.11	
37.91/17.11	Accepting locations:
37.91/17.11	
37.91/17.11	Asserts:
37.91/17.11	
37.91/17.11	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
37.91/17.11	       
37.91/17.11	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
37.91/17.11	       
37.91/17.11	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
37.91/17.11	
37.91/17.11	Init Location: 0
37.91/17.11	Transitions:
37.91/17.11	<l0, l8, true, seq{main__func_return_ -> 0}>
37.91/17.11	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
37.91/17.11	<l9, l10, true, seq{main_a -> varCall_1}>
37.91/17.11	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
37.91/17.11	<l11, l1, true, seq{main_b -> varCall_2}>
37.91/17.11	<l1, l2, true>
37.91/17.11	<l2, l3, (main_a >= 1)>
37.91/17.11	<l2, l6, not((main_a >= 1))>
37.91/17.11	<l3, l4, (main_b >= 1)>
37.91/17.11	<l3, l6, not((main_b >= 1))>
37.91/17.11	<l4, l5, true, seq{main_a -> (2 * main_a), main_b -> (3 * main_b)}>
37.91/17.11	<l5, l2, true>
37.91/17.11	<l6, l7, true, seq{main__func_return_ -> 0}>
37.91/17.11	
37.91/17.11	Fresh variables:
37.91/17.11	
37.91/17.11	Undef variables:
37.91/17.11	
37.91/17.11	Abstraction variables:
37.91/17.11	
37.91/17.11	Exit nodes:
37.91/17.11	7, 
37.91/17.11	Accepting locations:
37.91/17.11	
37.91/17.11	Asserts:
37.91/17.11	
37.91/17.11	+                                                                  +
37.91/17.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
37.91/17.11	
37.91/17.11	
37.91/17.11	Function Return and Parameters Information [2 functions]:
37.91/17.11	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
37.91/17.11	        __VERIFIER_nondet_int__func_return_      [function result] : int
37.91/17.11	    function name: main [1 return + 0 parameters]        demangled: main
37.91/17.11	        main__func_return_      [function result] : int
37.91/17.11	
37.91/17.11	
37.91/17.11	AST Ident Scanner Information [4 idents]:
37.91/17.11	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6>
37.91/17.11	main | function | [integer, ()] | <line: 13, col: 1>
37.91/17.11	a | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 17, col: 9> <line: 18, col: 3> <line: 18, col: 9>
37.91/17.11	b | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 17, col: 19> <line: 19, col: 3> <line: 19, col: 9>
37.91/17.11	
37.91/17.11	Main function: main
37.91/17.11	Preprocessed LLVMGraph
37.91/17.11	Init Location: 0
37.91/17.11	Transitions:
37.91/17.11	<l0, l2, (main_a = undef3) /\ (main_b = undef4)>
37.91/17.11	<l2, l2, (main_a >= 1) /\ (main_b >= 1), par{main_a -> (2 * main_a), main_b -> (3 * main_b)}>
37.91/17.11	<l2, l7, (main_a >= 1) /\ not((main_b >= 1))>
37.91/17.11	<l2, l7, not((main_a >= 1))>
37.91/17.11	
37.91/17.11	Fresh variables:
37.91/17.11	undef3, undef4, 
37.91/17.11	
37.91/17.11	Undef variables:
37.91/17.11	undef3, undef4, 
37.91/17.11	
37.91/17.11	Abstraction variables:
37.91/17.11	
37.91/17.11	Exit nodes:
37.91/17.11	7, 
37.91/17.11	Accepting locations:
37.91/17.11	
37.91/17.11	Asserts:
37.91/17.11	
37.91/17.11	*************************************************************
37.91/17.11	*******************************************************************************************
37.91/17.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
37.91/17.11	*******************************************************************************************
37.91/17.11	
37.91/17.11	Init Location: 0
37.91/17.11	Graph 0:
37.91/17.11	Transitions:
37.91/17.11	Variables:
37.91/17.11	
37.91/17.11	Graph 1:
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	
37.91/17.11	Graph 2:
37.91/17.11	Transitions:
37.91/17.11	Variables:
37.91/17.11	
37.91/17.11	Precedence: 
37.91/17.11	Graph 0
37.91/17.11	
37.91/17.11	Graph 1
37.91/17.11	<l0, l2, main_a = undef3 /\ main_b = undef4, {all remain the same}>
37.91/17.11	
37.91/17.11	Graph 2
37.91/17.11	<l2, l7, main_b <= 0 /\ 1 <= main_a, {all remain the same}>
37.91/17.11	<l2, l7, main_a <= 0, {all remain the same}>
37.91/17.11	
37.91/17.11	Map Locations to Subgraph:
37.91/17.11	( 0 , 0 )
37.91/17.11	( 2 , 1 )
37.91/17.11	( 7 , 2 )
37.91/17.11	
37.91/17.11	*******************************************************************************************
37.91/17.11	********************************    CHECKING ASSERTIONS    ********************************
37.91/17.11	*******************************************************************************************
37.91/17.11	
37.91/17.11	Proving termination of subgraph 0
37.91/17.11	Proving termination of subgraph 1
37.91/17.11	Checking unfeasibility...
37.91/17.11	Time used: 0.002132
37.91/17.11	
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000603s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.001777s
37.91/17.11	[24933 : 24935]
37.91/17.11	[24933 : 24936]
37.91/17.11	Successful child: 24935
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	> It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	New Graphs: 
37.91/17.11	
37.91/17.11	LOG: CALL check - Post:1 + main_a <= 0 - Process 1
37.91/17.11	* Exit transition: <l0, l2, main_a = undef3 /\ main_b = undef4, {all remain the same}>
37.91/17.11	* Postcondition  : 1 + main_a <= 0
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000470s
37.91/17.11	> Postcondition is not implied!
37.91/17.11	
37.91/17.11	LOG: RETURN check - Elapsed time: 0.000559s
37.91/17.11	INVARIANTS: 
37.91/17.11	2: 
37.91/17.11	Quasi-INVARIANTS to narrow Graph: 
37.91/17.11	2: 1 + main_a <= 0 , 
37.91/17.11	Narrowing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	
37.91/17.11	LOG: Narrow transition size 1
37.91/17.11	invGraph after Narrowing: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000571s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.001909s
37.91/17.11	[24933 : 24940]
37.91/17.11	[24933 : 24941]
37.91/17.11	Successful child: 24940
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	> It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	New Graphs: 
37.91/17.11	
37.91/17.11	LOG: CALL check - Post:main_a + main_b <= 1 - Process 2
37.91/17.11	* Exit transition: <l0, l2, 0 <= main_a /\ main_a = undef3 /\ main_b = undef4, {all remain the same}>
37.91/17.11	* Postcondition  : main_a + main_b <= 1
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000576s
37.91/17.11	> Postcondition is not implied!
37.91/17.11	
37.91/17.11	LOG: RETURN check - Elapsed time: 0.000678s
37.91/17.11	INVARIANTS: 
37.91/17.11	2: 
37.91/17.11	Quasi-INVARIANTS to narrow Graph: 
37.91/17.11	2: main_a + main_b <= 1 , 
37.91/17.11	Narrowing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	
37.91/17.11	LOG: Narrow transition size 1
37.91/17.11	invGraph after Narrowing: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000648s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.002757s
37.91/17.11	[24933 : 24945]
37.91/17.11	[24933 : 24946]
37.91/17.11	Successful child: 24945
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	New Graphs: 
37.91/17.11	
37.91/17.11	LOG: CALL check - Post:main_b <= 0 - Process 3
37.91/17.11	* Exit transition: <l0, l2, 0 <= main_a /\ 2 <= main_a + main_b /\ main_a = undef3 /\ main_b = undef4, {all remain the same}>
37.91/17.11	* Postcondition  : main_b <= 0
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000503s
37.91/17.11	> Postcondition is not implied!
37.91/17.11	
37.91/17.11	LOG: RETURN check - Elapsed time: 0.000608s
37.91/17.11	INVARIANTS: 
37.91/17.11	2: 
37.91/17.11	Quasi-INVARIANTS to narrow Graph: 
37.91/17.11	2: main_b <= 0 , 
37.91/17.11	Narrowing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	
37.91/17.11	LOG: Narrow transition size 1
37.91/17.11	invGraph after Narrowing: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000659s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.002759s
37.91/17.11	[24933 : 24950]
37.91/17.11	[24933 : 24951]
37.91/17.11	Successful child: 24950
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	It's unfeasible. Removing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	New Graphs: 
37.91/17.11	
37.91/17.11	LOG: CALL check - Post:main_a <= 0 - Process 4
37.91/17.11	* Exit transition: <l0, l2, 0 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b /\ main_a = undef3 /\ main_b = undef4, {all remain the same}>
37.91/17.11	* Postcondition  : main_a <= 0
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000557s
37.91/17.11	> Postcondition is not implied!
37.91/17.11	
37.91/17.11	LOG: RETURN check - Elapsed time: 0.000677s
37.91/17.11	INVARIANTS: 
37.91/17.11	2: 
37.91/17.11	Quasi-INVARIANTS to narrow Graph: 
37.91/17.11	2: main_a <= 0 , 
37.91/17.11	Narrowing transition: 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	
37.91/17.11	LOG: Narrow transition size 1
37.91/17.11	invGraph after Narrowing: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000651s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.002792s
37.91/17.11	[24933 : 24955]
37.91/17.11	[24933 : 24956]
37.91/17.11	Solving with 1 template(s).
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetFirstSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011160s
37.91/17.11	Time used: 0.010682
37.91/17.11	Improving Solution with cost 1 ...
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetNextSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034571s
37.91/17.11	Time used: 0.034567
37.91/17.11	
37.91/17.11	LOG: SAT solveNonLinear - Elapsed time: 0.045731s
37.91/17.11	Cost: 1; Total time: 0.045249
37.91/17.11	Termination implied by a set of invariant(s):
37.91/17.11	Invariant at l2: 1 <= main_a + main_b
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Quasi-ranking function: 50000 - main_b
37.91/17.11	New Graphs: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 1 <= main_a /\ 2 <= main_a + main_b /\ 50001 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000639s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.003339s
37.91/17.11	[24933 : 24964]
37.91/17.11	[24933 : 24965]
37.91/17.11	Solving with 1 template(s).
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetFirstSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010981s
37.91/17.11	Time used: 0.010449
37.91/17.11	Improving Solution with cost 1 ...
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetNextSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037510s
37.91/17.11	Time used: 0.037505
37.91/17.11	
37.91/17.11	LOG: SAT solveNonLinear - Elapsed time: 0.048491s
37.91/17.11	Cost: 1; Total time: 0.047954
37.91/17.11	Termination implied by a set of invariant(s):
37.91/17.11	Invariant at l2: 0 <= main_a
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 1 <= main_a /\ 2 <= main_a + main_b /\ 50001 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Quasi-ranking function: 50000 - main_a
37.91/17.11	New Graphs: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 2 <= main_a + main_b /\ 50001 <= main_a /\ 50001 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000669s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.005653s
37.91/17.11	[24933 : 24972]
37.91/17.11	[24933 : 24973]
37.91/17.11	Solving with 1 template(s).
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetFirstSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012557s
37.91/17.11	Time used: 0.011966
37.91/17.11	Improving Solution with cost 1 ...
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetNextSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037558s
37.91/17.11	Time used: 0.037554
37.91/17.11	
37.91/17.11	LOG: SAT solveNonLinear - Elapsed time: 0.050115s
37.91/17.11	Cost: 1; Total time: 0.04952
37.91/17.11	Termination implied by a set of invariant(s):
37.91/17.11	Invariant at l2: 1 <= main_a + main_b
37.91/17.11	[ Invariant Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 1 <= main_a /\ 1 <= main_b /\ 2 <= main_a + main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	[ Termination Graph ]
37.91/17.11	Strengthening and disabling transitions...
37.91/17.11	
37.91/17.11	LOG: CALL solverLinear in Graph for feasibility
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear in Graph for feasibility
37.91/17.11	Strengthening transition (result): 
37.91/17.11	<l2, l2, 2 <= main_a + main_b /\ 50001 <= main_a /\ 50001 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Quasi-ranking function: 50000 - 2*main_a - main_b
37.91/17.11	New Graphs: 
37.91/17.11	Transitions:
37.91/17.11	<l2, l2, 2 <= main_a + main_b /\ 50001 <= main_a /\ 50001 <= 2*main_a + main_b /\ 50001 <= main_b, {main_a -> 2*main_a, main_b -> 3*main_b, rest remain the same}>
37.91/17.11	Variables:
37.91/17.11	main_a, main_b
37.91/17.11	Checking conditional termination of SCC {l2}...
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.000777s
37.91/17.11	
37.91/17.11	LOG: CALL solveLinear
37.91/17.11	
37.91/17.11	LOG: RETURN solveLinear - Elapsed time: 0.007073s
37.91/17.11	[24933 : 24980]
37.91/17.11	[24933 : 24981]
37.91/17.11	Solving with 1 template(s).
37.91/17.11	
37.91/17.11	LOG: CALL solveNonLinearGetFirstSolution
37.91/17.11	
37.91/17.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016110s
37.91/17.11	Time used: 0.01566
37.91/17.11	
37.91/17.11	[24933 : 25173]
37.91/17.11	[24933 : 25177]
37.91/17.11	Successful child: 25173
37.91/17.11	
37.91/17.11	Program does NOT terminate
37.91/17.11	EOF