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