0.00/0.12	YES
0.00/0.12	
0.00/0.12	Solver Timeout: 4
0.00/0.12	Global Timeout: 300
0.00/0.12	Maximum number of concurrent processes: 900
0.00/0.12	*******************************************************************************************
0.00/0.12	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.12	*******************************************************************************************
0.00/0.12	
0.00/0.12	
0.00/0.12	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.12	
0.00/0.12	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.12	+                                                                  +
0.00/0.12	Init Location: 0
0.00/0.12	Transitions:
0.00/0.12	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.12	<l1, l2, (main_a = main_b)>
0.00/0.12	<l1, l8, not((main_a = main_b))>
0.00/0.12	<l2, l3, true>
0.00/0.12	<l3, l4, not((main_x >= 0))>
0.00/0.12	<l3, l5, (main_x >= 0)>
0.00/0.12	<l4, l7, not((main_y >= 0))>
0.00/0.12	<l4, l5, (main_y >= 0)>
0.00/0.12	<l5, l6, true, seq{main_x -> (((main_x + main_a) - main_b) - 1), main_y -> (((main_y + main_b) - main_a) - 1)}>
0.00/0.12	<l6, l3, true>
0.00/0.12	<l7, l8, true>
0.00/0.12	<l8, l9, true, seq{main__func_return_ -> 0}>
0.00/0.12	
0.00/0.12	Fresh variables:
0.00/0.12	
0.00/0.12	Undef variables:
0.00/0.12	
0.00/0.12	Abstraction variables:
0.00/0.12	
0.00/0.12	Exit nodes:
0.00/0.12	
0.00/0.12	Accepting locations:
0.00/0.12	
0.00/0.12	Asserts:
0.00/0.12	
0.00/0.12	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.12	       
0.00/0.12	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.12	       
0.00/0.12	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.12	
0.00/0.12	Init Location: 0
0.00/0.12	Transitions:
0.00/0.12	<l0, l10, true, seq{main__func_return_ -> 0}>
0.00/0.12	<l10, l11, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.12	<l11, l12, true, seq{main_a -> varCall_1}>
0.00/0.12	<l12, l13, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.12	<l13, l14, true, seq{main_b -> varCall_2}>
0.00/0.12	<l14, l15, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.12	<l15, l16, true, seq{main_x -> varCall_3}>
0.00/0.12	<l16, l17, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.12	<l17, l1, true, seq{main_y -> varCall_4}>
0.00/0.12	<l1, l2, (main_a = main_b)>
0.00/0.12	<l1, l8, not((main_a = main_b))>
0.00/0.12	<l2, l3, true>
0.00/0.12	<l3, l5, (main_x >= 0)>
0.00/0.12	<l3, l4, not((main_x >= 0))>
0.00/0.12	<l4, l5, (main_y >= 0)>
0.00/0.12	<l4, l7, not((main_y >= 0))>
0.00/0.12	<l5, l6, true, seq{main_x -> (((main_x + main_a) - main_b) - 1), main_y -> (((main_y + main_b) - main_a) - 1)}>
0.00/0.12	<l6, l3, true>
0.00/0.12	<l7, l8, true>
0.00/0.12	<l8, l9, true, seq{main__func_return_ -> 0}>
0.00/0.12	
0.00/0.12	Fresh variables:
0.00/0.12	
0.00/0.12	Undef variables:
0.00/0.12	
0.00/0.12	Abstraction variables:
0.00/0.12	
0.00/0.12	Exit nodes:
0.00/0.12	9, 
0.00/0.12	Accepting locations:
0.00/0.12	
0.00/0.12	Asserts:
0.00/0.12	
0.00/0.12	+                                                                  +
0.00/0.12	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.12	
0.00/0.12	
0.00/0.12	Function Return and Parameters Information [2 functions]:
0.00/0.12	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.12	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.12	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.12	        main__func_return_      [function result] : int
0.00/0.12	
0.00/0.12	
0.00/0.12	AST Ident Scanner Information [6 idents]:
0.00/0.12	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 17, col: 6> <line: 18, col: 6> <line: 19, col: 6> <line: 20, col: 6>
0.00/0.12	main | function | [integer, ()] | <line: 14, col: 1>
0.00/0.12	a | local variable | integer | <line: 16, col: 5> | <line: 17, col: 2> <line: 21, col: 6> <line: 23, col: 15> <line: 24, col: 19>
0.00/0.12	b | local variable | integer | <line: 16, col: 5> | <line: 18, col: 2> <line: 21, col: 11> <line: 23, col: 19> <line: 24, col: 15>
0.00/0.12	x | local variable | integer | <line: 16, col: 5> | <line: 19, col: 2> <line: 22, col: 13> <line: 23, col: 7> <line: 23, col: 11>
0.00/0.12	y | local variable | integer | <line: 16, col: 5> | <line: 20, col: 2> <line: 22, col: 23> <line: 24, col: 7> <line: 24, col: 11>
0.00/0.12	
0.00/0.12	Main function: main
0.00/0.12	Preprocessed LLVMGraph
0.00/0.12	Init Location: 0
0.00/0.12	Transitions:
0.00/0.12	<l0, l3, (main_a = undef5) /\ (main_b = undef6) /\ (main_x = undef7) /\ (main_y = undef8) /\ (undef5 = undef6)>
0.00/0.12	<l0, l9, (main_a = undef5) /\ (main_b = undef6) /\ (main_x = undef7) /\ (main_y = undef8) /\ (undef5 < undef6)>
0.00/0.12	<l0, l9, (main_a = undef5) /\ (main_b = undef6) /\ (main_x = undef7) /\ (main_y = undef8) /\ (undef5 > undef6)>
0.00/0.12	<l3, l3, (main_x >= 0), par{main_x -> (((main_x + main_a) - main_b) - 1), main_y -> (((main_y + main_b) - main_a) - 1)}>
0.00/0.12	<l3, l3, not((main_x >= 0)) /\ (main_y >= 0), par{main_x -> (((main_x + main_a) - main_b) - 1), main_y -> (((main_y + main_b) - main_a) - 1)}>
0.00/0.12	<l3, l9, not((main_x >= 0)) /\ not((main_y >= 0))>
0.00/0.12	
0.00/0.12	Fresh variables:
0.00/0.12	undef5, undef6, undef7, undef8, 
0.00/0.12	
0.00/0.12	Undef variables:
0.00/0.12	undef5, undef6, undef7, undef8, 
0.00/0.12	
0.00/0.12	Abstraction variables:
0.00/0.12	
0.00/0.12	Exit nodes:
0.00/0.12	9, 
0.00/0.12	Accepting locations:
0.00/0.12	
0.00/0.12	Asserts:
0.00/0.12	
0.00/0.12	*************************************************************
0.00/0.12	*******************************************************************************************
0.00/0.12	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.12	*******************************************************************************************
0.00/0.12	
0.00/0.12	Init Location: 0
0.00/0.12	Graph 0:
0.00/0.12	Transitions:
0.00/0.12	Variables:
0.00/0.12	
0.00/0.12	Graph 1:
0.00/0.12	Transitions:
0.00/0.12	<l3, l3, 0 <= main_x, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	<l3, l3, 0 <= main_y /\ 1 + main_x <= 0, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	Variables:
0.00/0.12	main_a, main_b, main_x, main_y
0.00/0.12	
0.00/0.12	Graph 2:
0.00/0.12	Transitions:
0.00/0.12	Variables:
0.00/0.12	
0.00/0.12	Precedence: 
0.00/0.12	Graph 0
0.00/0.12	
0.00/0.12	Graph 1
0.00/0.12	<l0, l3, main_a = undef5 /\ main_b = undef6 /\ main_x = undef7 /\ main_y = undef8 /\ undef5 = undef6, {all remain the same}>
0.00/0.12	
0.00/0.12	Graph 2
0.00/0.12	<l0, l9, 1 + undef5 <= undef6 /\ main_a = undef5 /\ main_b = undef6 /\ main_x = undef7 /\ main_y = undef8, {all remain the same}>
0.00/0.12	<l0, l9, 1 + undef6 <= undef5 /\ main_a = undef5 /\ main_b = undef6 /\ main_x = undef7 /\ main_y = undef8, {all remain the same}>
0.00/0.12	<l3, l9, 1 + main_x <= 0 /\ 1 + main_y <= 0, {all remain the same}>
0.00/0.12	
0.00/0.12	Map Locations to Subgraph:
0.00/0.12	( 0 , 0 )
0.00/0.12	( 3 , 1 )
0.00/0.12	( 9 , 2 )
0.00/0.12	
0.00/0.12	*******************************************************************************************
0.00/0.12	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.12	*******************************************************************************************
0.00/0.12	
0.00/0.12	Proving termination of subgraph 0
0.00/0.12	Proving termination of subgraph 1
0.00/0.12	Checking unfeasibility...
0.00/0.12	Time used: 0.005836
0.00/0.12	
0.00/0.12	Checking conditional termination of SCC {l3}...
0.00/0.12	
0.00/0.12	LOG: CALL solveLinear
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear - Elapsed time: 0.001019s
0.00/0.12	
0.00/0.12	LOG: CALL solveLinear
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear - Elapsed time: 0.004019s
0.00/0.12	[13542 : 13544]
0.00/0.12	[13542 : 13545]
0.00/0.12	Successful child: 13544
0.00/0.12	[ Invariant Graph ]
0.00/0.12	Strengthening and disabling transitions...
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, main_a <= main_b /\ 0 <= main_x, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, main_a <= main_b /\ 0 <= main_y /\ 1 + main_x <= 0, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	[ Termination Graph ]
0.00/0.12	Strengthening and disabling transitions...
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, main_a <= main_b /\ 0 <= main_x, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, main_a <= main_b /\ 0 <= main_y /\ 1 + main_x <= 0, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	Ranking function: 1 + main_x
0.00/0.12	New Graphs: 
0.00/0.12	Transitions:
0.00/0.12	<l3, l3, main_a <= main_b /\ 0 <= main_y /\ 1 + main_x <= 0, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	Variables:
0.00/0.12	main_a, main_b, main_x, main_y
0.00/0.12	Checking conditional termination of SCC {l3}...
0.00/0.12	
0.00/0.12	LOG: CALL solveLinear
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear - Elapsed time: 0.000725s
0.00/0.12	
0.00/0.12	LOG: CALL solveLinear
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear - Elapsed time: 0.002823s
0.00/0.12	[13542 : 13549]
0.00/0.12	[13542 : 13550]
0.00/0.12	Successful child: 13549
0.00/0.12	[ Invariant Graph ]
0.00/0.12	Strengthening and disabling transitions...
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, 0 <= main_x /\ main_a = main_b, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, 0 <= main_y /\ 1 + main_x <= 0 /\ main_a = main_b, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	[ Termination Graph ]
0.00/0.12	Strengthening and disabling transitions...
0.00/0.12	
0.00/0.12	LOG: CALL solverLinear in Graph for feasibility
0.00/0.12	
0.00/0.12	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.12	Strengthening transition (result): 
0.00/0.12	<l3, l3, 0 <= main_y /\ 1 + main_x <= 0 /\ main_a = main_b, {main_x -> -1 + main_a - main_b + main_x, main_y -> -1 - main_a + main_b + main_y, rest remain the same}>
0.00/0.12	Ranking function: main_y
0.00/0.12	New Graphs: 
0.00/0.12	INVARIANTS: 
0.00/0.12	3: main_a <= main_b , 
0.00/0.12	Quasi-INVARIANTS to narrow Graph: 
0.00/0.12	3: 
0.00/0.12	INVARIANTS: 
0.00/0.12	3: main_b <= main_a , 
0.00/0.12	Quasi-INVARIANTS to narrow Graph: 
0.00/0.12	3: 
0.00/0.12	Proving termination of subgraph 2
0.00/0.12	Analyzing SCC {l9}...
0.00/0.12	No cycles found.
0.00/0.12	
0.00/0.12	Program Terminates
0.00/0.12	EOF