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