46.81/21.02	NO
46.81/21.02	
46.81/21.02	Solver Timeout: 4
46.81/21.02	Global Timeout: 300
46.81/21.02	Maximum number of concurrent processes: 900
46.81/21.02	*******************************************************************************************
46.81/21.02	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
46.81/21.02	*******************************************************************************************
46.81/21.02	
46.81/21.02	
46.81/21.02	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
46.81/21.02	
46.81/21.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.81/21.02	+                                                                  +
46.81/21.02	Init Location: 0
46.81/21.02	Transitions:
46.81/21.02	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
46.81/21.02	<l1, l2, ((main_x + main_y) >= 0)>
46.81/21.02	<l1, l7, not(((main_x + main_y) >= 0))>
46.81/21.02	<l2, l3, true>
46.81/21.02	<l3, l6, not((main_x > 0))>
46.81/21.02	<l3, l4, (main_x > 0)>
46.81/21.02	<l4, l5, true, seq{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y + 1)}>
46.81/21.02	<l5, l3, true>
46.81/21.02	<l6, l7, true>
46.81/21.02	<l7, l8, true, seq{main__func_return_ -> 0}>
46.81/21.02	
46.81/21.02	Fresh variables:
46.81/21.02	
46.81/21.02	Undef variables:
46.81/21.02	
46.81/21.02	Abstraction variables:
46.81/21.02	
46.81/21.02	Exit nodes:
46.81/21.02	
46.81/21.02	Accepting locations:
46.81/21.02	
46.81/21.02	Asserts:
46.81/21.02	
46.81/21.02	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
46.81/21.02	       
46.81/21.02	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
46.81/21.02	       
46.81/21.02	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
46.81/21.02	
46.81/21.02	Init Location: 0
46.81/21.02	Transitions:
46.81/21.02	<l0, l9, true, seq{main__func_return_ -> 0}>
46.81/21.02	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.81/21.02	<l10, l11, true, seq{main_x -> varCall_1}>
46.81/21.02	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.81/21.02	<l12, l1, true, seq{main_y -> varCall_2}>
46.81/21.02	<l1, l2, ((main_x + main_y) >= 0)>
46.81/21.02	<l1, l7, not(((main_x + main_y) >= 0))>
46.81/21.02	<l2, l3, true>
46.81/21.02	<l3, l4, (main_x > 0)>
46.81/21.02	<l3, l6, not((main_x > 0))>
46.81/21.02	<l4, l5, true, seq{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y + 1)}>
46.81/21.02	<l5, l3, true>
46.81/21.02	<l6, l7, true>
46.81/21.02	<l7, l8, true, seq{main__func_return_ -> 0}>
46.81/21.02	
46.81/21.02	Fresh variables:
46.81/21.02	
46.81/21.02	Undef variables:
46.81/21.02	
46.81/21.02	Abstraction variables:
46.81/21.02	
46.81/21.02	Exit nodes:
46.81/21.02	8, 
46.81/21.02	Accepting locations:
46.81/21.02	
46.81/21.02	Asserts:
46.81/21.02	
46.81/21.02	+                                                                  +
46.81/21.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.81/21.02	
46.81/21.02	
46.81/21.02	Function Return and Parameters Information [2 functions]:
46.81/21.02	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
46.81/21.02	        __VERIFIER_nondet_int__func_return_      [function result] : int
46.81/21.02	    function name: main [1 return + 0 parameters]        demangled: main
46.81/21.02	        main__func_return_      [function result] : int
46.81/21.02	
46.81/21.02	
46.81/21.02	AST Ident Scanner Information [4 idents]:
46.81/21.02	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 14, col: 9> <line: 15, col: 9>
46.81/21.02	main | function | [integer, ()] | <line: 10, col: 1>
46.81/21.02	x | local variable | integer | <line: 12, col: 5> | <line: 14, col: 5> <line: 16, col: 9> <line: 17, col: 16> <line: 18, col: 13> <line: 18, col: 17> <line: 18, col: 21>
46.81/21.02	y | local variable | integer | <line: 13, col: 5> | <line: 15, col: 5> <line: 16, col: 13> <line: 18, col: 25> <line: 19, col: 13> <line: 19, col: 17>
46.81/21.02	
46.81/21.02	Main function: main
46.81/21.02	Preprocessed LLVMGraph
46.81/21.02	Init Location: 0
46.81/21.02	Transitions:
46.81/21.02	<l0, l3, (main_x = undef3) /\ (main_y = undef4) /\ ((undef3 + undef4) >= 0)>
46.81/21.02	<l0, l8, (main_x = undef3) /\ (main_y = undef4) /\ not(((undef3 + undef4) >= 0))>
46.81/21.02	<l3, l3, (main_x > 0), par{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y + 1)}>
46.81/21.02	<l3, l8, not((main_x > 0))>
46.81/21.02	
46.81/21.02	Fresh variables:
46.81/21.02	undef3, undef4, 
46.81/21.02	
46.81/21.02	Undef variables:
46.81/21.02	undef3, undef4, 
46.81/21.02	
46.81/21.02	Abstraction variables:
46.81/21.02	
46.81/21.02	Exit nodes:
46.81/21.02	8, 
46.81/21.02	Accepting locations:
46.81/21.02	
46.81/21.02	Asserts:
46.81/21.02	
46.81/21.02	*************************************************************
46.81/21.02	*******************************************************************************************
46.81/21.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
46.81/21.02	*******************************************************************************************
46.81/21.02	
46.81/21.02	Init Location: 0
46.81/21.02	Graph 0:
46.81/21.02	Transitions:
46.81/21.02	Variables:
46.81/21.02	
46.81/21.02	Graph 1:
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	
46.81/21.02	Graph 2:
46.81/21.02	Transitions:
46.81/21.02	Variables:
46.81/21.02	
46.81/21.02	Precedence: 
46.81/21.02	Graph 0
46.81/21.02	
46.81/21.02	Graph 1
46.81/21.02	<l0, l3, 0 <= undef3 + undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.81/21.02	
46.81/21.02	Graph 2
46.81/21.02	<l0, l8, 1 + undef3 + undef4 <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.81/21.02	<l3, l8, main_x <= 0, {all remain the same}>
46.81/21.02	
46.81/21.02	Map Locations to Subgraph:
46.81/21.02	( 0 , 0 )
46.81/21.02	( 3 , 1 )
46.81/21.02	( 8 , 2 )
46.81/21.02	
46.81/21.02	*******************************************************************************************
46.81/21.02	********************************    CHECKING ASSERTIONS    ********************************
46.81/21.02	*******************************************************************************************
46.81/21.02	
46.81/21.02	Proving termination of subgraph 0
46.81/21.02	Proving termination of subgraph 1
46.81/21.02	Checking unfeasibility...
46.81/21.02	Time used: 0.002331
46.81/21.02	
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000585s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.001606s
46.81/21.02	[49654 : 49656]
46.81/21.02	[49654 : 49657]
46.81/21.02	Successful child: 49656
46.81/21.02	[ Invariant Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	It's unfeasible. Removing transition: 
46.81/21.02	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	[ Termination Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	> It's unfeasible. Removing transition: 
46.81/21.02	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	New Graphs: 
46.81/21.02	
46.81/21.02	LOG: CALL check - Post:main_x <= 0 - Process 1
46.81/21.02	* Exit transition: <l0, l3, 0 <= undef3 + undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.81/21.02	* Postcondition  : main_x <= 0
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000412s
46.81/21.02	> Postcondition is not implied!
46.81/21.02	
46.81/21.02	LOG: RETURN check - Elapsed time: 0.000513s
46.81/21.02	INVARIANTS: 
46.81/21.02	3: 
46.81/21.02	Quasi-INVARIANTS to narrow Graph: 
46.81/21.02	3: main_x <= 0 , 
46.81/21.02	Narrowing transition: 
46.81/21.02	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	
46.81/21.02	LOG: Narrow transition size 1
46.81/21.02	invGraph after Narrowing: 
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000545s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.001739s
46.81/21.02	[49654 : 49661]
46.81/21.02	[49654 : 49662]
46.81/21.02	Solving with 1 template(s).
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetFirstSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009352s
46.81/21.02	Time used: 0.009008
46.81/21.02	Improving Solution with cost 1 ...
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetNextSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030668s
46.81/21.02	Time used: 0.030661
46.81/21.02	
46.81/21.02	LOG: SAT solveNonLinear - Elapsed time: 0.040019s
46.81/21.02	Cost: 1; Total time: 0.039669
46.81/21.02	Termination implied by a set of invariant(s):
46.81/21.02	Invariant at l3: 0 <= 1 + main_x + main_y
46.81/21.02	[ Invariant Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	[ Termination Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Quasi-ranking function: 50000 - main_x - 2*main_y
46.81/21.02	New Graphs: 
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y /\ 50001 <= main_x + 2*main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000664s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.005242s
46.81/21.02	[49654 : 49666]
46.81/21.02	[49654 : 49667]
46.81/21.02	Solving with 1 template(s).
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetFirstSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010628s
46.81/21.02	Time used: 0.010142
46.81/21.02	Improving Solution with cost 1 ...
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetNextSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017958s
46.81/21.02	Time used: 0.017952
46.81/21.02	
46.81/21.02	LOG: SAT solveNonLinear - Elapsed time: 0.028586s
46.81/21.02	Cost: 1; Total time: 0.028094
46.81/21.02	Termination implied by a set of invariant(s):
46.81/21.02	Invariant at l3: 0 <= 1 + main_x + main_y
46.81/21.02	[ Invariant Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	[ Termination Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y /\ 50001 <= main_x + 2*main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Quasi-ranking function: 50000 - main_x
46.81/21.02	New Graphs: 
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 0 <= 1 + main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_x + 2*main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000679s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.003852s
46.81/21.02	[49654 : 49671]
46.81/21.02	[49654 : 49672]
46.81/21.02	Solving with 1 template(s).
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetFirstSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010929s
46.81/21.02	Time used: 0.010382
46.81/21.02	Improving Solution with cost 1 ...
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetNextSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021342s
46.81/21.02	Time used: 0.021336
46.81/21.02	
46.81/21.02	LOG: SAT solveNonLinear - Elapsed time: 0.032271s
46.81/21.02	Cost: 1; Total time: 0.031718
46.81/21.02	Quasi-ranking function: 50000 - main_y
46.81/21.02	New Graphs: 
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 0 <= 1 + main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_x + 2*main_y /\ 50001 <= main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000756s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.008856s
46.81/21.02	[49654 : 49676]
46.81/21.02	[49654 : 49677]
46.81/21.02	Solving with 1 template(s).
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetFirstSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011407s
46.81/21.02	Time used: 0.010834
46.81/21.02	Improving Solution with cost 1 ...
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetNextSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021050s
46.81/21.02	Time used: 0.021045
46.81/21.02	
46.81/21.02	LOG: SAT solveNonLinear - Elapsed time: 0.032458s
46.81/21.02	Cost: 1; Total time: 0.031879
46.81/21.02	Termination implied by a set of invariant(s):
46.81/21.02	Invariant at l3: 0 <= 1 + main_x + main_y
46.81/21.02	[ Invariant Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 1 <= main_x /\ 0 <= 1 + main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	[ Termination Graph ]
46.81/21.02	Strengthening and disabling transitions...
46.81/21.02	
46.81/21.02	LOG: CALL solverLinear in Graph for feasibility
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear in Graph for feasibility
46.81/21.02	Strengthening transition (result): 
46.81/21.02	<l3, l3, 0 <= 1 + main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_x + 2*main_y /\ 50001 <= main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Quasi-ranking function: 50000 - main_x + main_y
46.81/21.02	New Graphs: 
46.81/21.02	Transitions:
46.81/21.02	<l3, l3, 0 <= 1 + main_x + main_y /\ 50001 <= main_x /\ 50001 + main_y <= main_x /\ 50001 <= main_x + 2*main_y /\ 50001 <= main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.81/21.02	Variables:
46.81/21.02	main_x, main_y
46.81/21.02	Checking conditional termination of SCC {l3}...
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.000846s
46.81/21.02	
46.81/21.02	LOG: CALL solveLinear
46.81/21.02	
46.81/21.02	LOG: RETURN solveLinear - Elapsed time: 0.004137s
46.81/21.02	[49654 : 49681]
46.81/21.02	[49654 : 49682]
46.81/21.02	Solving with 1 template(s).
46.81/21.02	
46.81/21.02	LOG: CALL solveNonLinearGetFirstSolution
46.81/21.02	
46.81/21.02	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013867s
46.81/21.02	Time used: 0.013393
46.81/21.02	
46.81/21.02	[49654 : 49686]
46.81/21.02	[49654 : 49690]
46.81/21.02	Successful child: 49686
46.81/21.02	
46.81/21.02	Program does NOT terminate
46.81/21.02	EOF