0.00/0.06	YES
0.00/0.06	
0.00/0.07	Solver Timeout: 4
0.00/0.07	Global Timeout: 300
0.00/0.07	Maximum number of concurrent processes: 900
0.00/0.07	*******************************************************************************************
0.00/0.07	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	
0.00/0.07	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.07	
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	+                                                                  +
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l1, l2, true>
0.00/0.07	<l2, l26, not((main_y > 0))>
0.00/0.07	<l2, l3, (main_y > 0)>
0.00/0.07	<l3, l26, not((main_x > 0))>
0.00/0.07	<l3, l4, (main_x > 0)>
0.00/0.07	<l4, l5, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
0.00/0.07	<l5, l6, (main_y = 0)>
0.00/0.07	<l5, l7, not((main_y = 0))>
0.00/0.07	<l6, l11, true>
0.00/0.07	<l7, l8, (main_y < 0)>
0.00/0.07	<l7, l10, not((main_y < 0))>
0.00/0.07	<l8, l9, true, seq{main_xtmp -> ~(main_xtmp)}>
0.00/0.07	<l9, l10, true>
0.00/0.07	<l10, l11, true>
0.00/0.07	<l11, l12, (main_xtmp > 0)>
0.00/0.07	<l11, l18, not((main_xtmp > 0))>
0.00/0.07	<l12, l13, true>
0.00/0.07	<l13, l14, (main_xtmp >= main_y)>
0.00/0.07	<l13, l16, not((main_xtmp >= main_y))>
0.00/0.07	<l14, l15, true, seq{main_xtmp -> (main_xtmp - main_y)}>
0.00/0.07	<l15, l13, true>
0.00/0.07	<l16, l17, true, seq{main_y -> main_xtmp}>
0.00/0.07	<l17, l24, true>
0.00/0.07	<l18, l19, true>
0.00/0.07	<l19, l22, not((main_xtmp < 0))>
0.00/0.07	<l19, l20, (main_xtmp < 0)>
0.00/0.07	<l20, l21, true, seq{main_xtmp -> (main_xtmp - main_y)}>
0.00/0.07	<l21, l19, true>
0.00/0.07	<l22, l23, true, seq{main_y -> main_xtmp}>
0.00/0.07	<l23, l24, true>
0.00/0.07	<l24, l25, true, seq{main_x -> main_tmp}>
0.00/0.07	<l25, l2, true>
0.00/0.07	<l26, l27, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l28, true, seq{main__func_return_ -> 0}>
0.00/0.07	<l28, l29, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l29, l30, true, seq{main_x -> varCall_1}>
0.00/0.07	<l30, l31, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l31, l1, true, seq{main_y -> varCall_2}>
0.00/0.07	<l1, l2, true>
0.00/0.07	<l2, l3, (main_y > 0)>
0.00/0.07	<l2, l26, not((main_y > 0))>
0.00/0.07	<l3, l4, (main_x > 0)>
0.00/0.07	<l3, l26, not((main_x > 0))>
0.00/0.07	<l4, l5, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
0.00/0.07	<l5, l6, (main_y = 0)>
0.00/0.07	<l5, l7, not((main_y = 0))>
0.00/0.07	<l6, l11, true>
0.00/0.07	<l7, l8, (main_y < 0)>
0.00/0.07	<l7, l10, not((main_y < 0))>
0.00/0.07	<l8, l9, true, seq{main_xtmp -> ~(main_xtmp)}>
0.00/0.07	<l9, l10, true>
0.00/0.07	<l10, l11, true>
0.00/0.07	<l11, l12, (main_xtmp > 0)>
0.00/0.07	<l11, l18, not((main_xtmp > 0))>
0.00/0.07	<l12, l13, true>
0.00/0.07	<l13, l14, (main_xtmp >= main_y)>
0.00/0.07	<l13, l16, not((main_xtmp >= main_y))>
0.00/0.07	<l14, l15, true, seq{main_xtmp -> (main_xtmp - main_y)}>
0.00/0.07	<l15, l13, true>
0.00/0.07	<l16, l17, true, seq{main_y -> main_xtmp}>
0.00/0.07	<l17, l24, true>
0.00/0.07	<l18, l19, true>
0.00/0.07	<l19, l20, (main_xtmp < 0)>
0.00/0.07	<l19, l22, not((main_xtmp < 0))>
0.00/0.07	<l20, l21, true, seq{main_xtmp -> (main_xtmp - main_y)}>
0.00/0.07	<l21, l19, true>
0.00/0.07	<l22, l23, true, seq{main_y -> main_xtmp}>
0.00/0.07	<l23, l24, true>
0.00/0.07	<l24, l25, true, seq{main_x -> main_tmp}>
0.00/0.07	<l25, l2, true>
0.00/0.07	<l26, l27, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	27, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+                                                                  +
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	
0.00/0.07	Function Return and Parameters Information [2 functions]:
0.00/0.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.07	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.07	        main__func_return_      [function result] : int
0.00/0.07	
0.00/0.07	
0.00/0.07	AST Ident Scanner Information [6 idents]:
0.00/0.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
0.00/0.07	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.07	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 13, col: 20> <line: 15, col: 16> <line: 37, col: 9>
0.00/0.07	y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 13, col: 11> <line: 14, col: 15> <line: 17, col: 12> <line: 18, col: 13> <line: 18, col: 17> <line: 21, col: 16> <line: 26, col: 25> <line: 27, col: 31> <line: 29, col: 13> <line: 32, col: 31> <line: 34, col: 13>
0.00/0.07	tmp | local variable | integer | <line: 8, col: 5> | <line: 14, col: 9> <line: 37, col: 13>
0.00/0.07	xtmp | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 22, col: 17> <line: 22, col: 25> <line: 25, col: 12> <line: 26, col: 19> <line: 27, col: 17> <line: 27, col: 24> <line: 29, col: 17> <line: 31, col: 19> <line: 32, col: 17> <line: 32, col: 24> <line: 34, col: 17>
0.00/0.07	
0.00/0.07	Main function: main
0.00/0.07	Preprocessed LLVMGraph
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l13, (main_y = undef4) /\ (undef4 > 0) /\ (undef3 > 0) /\ (undef4 > 0) /\ not((main_y < 0)) /\ (undef3 > 0), par{main_tmp -> undef4, main_xtmp -> undef3}>
0.00/0.07	<l0, l27, (main_y = undef4) /\ (undef4 > 0) /\ not((undef3 > 0))>
0.00/0.07	<l0, l27, (main_y = undef4) /\ not((undef4 > 0))>
0.00/0.07	<l13, l13, (main_xtmp >= main_y), par{main_xtmp -> (main_xtmp - main_y)}>
0.00/0.07	<l13, l13, not((main_xtmp >= main_y)) /\ (main_xtmp > 0) /\ (main_tmp > 0) /\ (main_xtmp > 0) /\ not((main_xtmp < 0)) /\ (main_tmp > 0), par{main_y -> main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp}>
0.00/0.07	<l13, l27, not((main_xtmp >= main_y)) /\ (main_xtmp > 0) /\ not((main_tmp > 0)), par{main_y -> main_xtmp}>
0.00/0.07	<l13, l27, not((main_xtmp >= main_y)) /\ not((main_xtmp > 0)), par{main_y -> main_xtmp}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef3, undef4, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef3, undef4, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	27, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	*************************************************************
0.00/0.07	*******************************************************************************************
0.00/0.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Graph 0:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Graph 1:
0.00/0.07	Transitions:
0.00/0.07	<l13, l13, main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
0.00/0.07	<l13, l13, 1 + main_xtmp <= main_y /\ 1 <= main_tmp /\ 1 <= main_xtmp, {main_y -> main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_y, main_xtmp, main_tmp
0.00/0.07	
0.00/0.07	Graph 2:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Precedence: 
0.00/0.07	Graph 0
0.00/0.07	
0.00/0.07	Graph 1
0.00/0.07	<l0, l13, 0 <= main_y /\ 1 <= undef3 /\ 1 <= undef4 /\ main_y = undef4, {main_tmp -> undef4, main_xtmp -> undef3, rest remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l0, l27, undef3 <= 0 /\ 1 <= undef4 /\ main_y = undef4, {all remain the same}>
0.00/0.07	<l0, l27, undef4 <= 0 /\ main_y = undef4, {all remain the same}>
0.00/0.07	<l13, l27, main_tmp <= 0 /\ 1 + main_xtmp <= main_y /\ 1 <= main_xtmp, {main_y -> main_xtmp, rest remain the same}>
0.00/0.07	<l13, l27, main_xtmp <= 0 /\ 1 + main_xtmp <= main_y, {main_y -> main_xtmp, rest remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 13 , 1 )
0.00/0.07	( 27 , 2 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.00623
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l13}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001355s
0.00/0.07	Ranking function: -1 + main_y
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l13, l13, main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_y, main_xtmp
0.00/0.07	Checking conditional termination of SCC {l13}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000448s
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001369s
0.00/0.07	[10710 : 10712]
0.00/0.07	[10710 : 10713]
0.00/0.07	Successful child: 10712
0.00/0.07	[ Invariant Graph ]
0.00/0.07	Strengthening and disabling transitions...
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l13, l13, main_y <= main_xtmp /\ 1 <= main_y, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l13, l13, 1 <= main_y /\ 1 + main_xtmp <= main_y /\ 1 <= main_tmp /\ 1 <= main_xtmp, {main_y -> main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp, rest remain the same}>
0.00/0.07	[ Termination Graph ]
0.00/0.07	Strengthening and disabling transitions...
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l13, l13, main_y <= main_xtmp /\ 1 <= main_y, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
0.00/0.07	Ranking function: -main_y + main_xtmp
0.00/0.07	New Graphs: 
0.00/0.07	INVARIANTS: 
0.00/0.07	13: 1 <= main_y , 
0.00/0.07	Quasi-INVARIANTS to narrow Graph: 
0.00/0.07	13: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Analyzing SCC {l27}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	EOF