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