0.00/0.02	YES
0.00/0.02	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	Maximum number of concurrent processes: 900
0.00/0.03	*******************************************************************************************
0.00/0.03	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	
0.00/0.03	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.03	
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	+                                                                  +
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_x -> 0, main_y -> 0}>
0.00/0.03	<l1, l2, (main_i > 10)>
0.00/0.03	<l1, l4, not((main_i > 10))>
0.00/0.03	<l2, l3, true, seq{main_x -> 1}>
0.00/0.03	<l3, l6, true>
0.00/0.03	<l4, l5, true, seq{main_y -> 1}>
0.00/0.03	<l5, l6, true>
0.00/0.03	<l6, l7, true>
0.00/0.03	<l7, l9, not((main_x = main_y))>
0.00/0.03	<l7, l8, (main_x = main_y)>
0.00/0.03	<l8, l7, true>
0.00/0.03	<l9, l10, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l11, true, seq{main__func_return_ -> 0}>
0.00/0.03	<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.03	<l12, l1, true, seq{main_i -> varCall_1, main_x -> 0, main_y -> 0}>
0.00/0.03	<l1, l2, (main_i > 10)>
0.00/0.03	<l1, l4, not((main_i > 10))>
0.00/0.03	<l2, l3, true, seq{main_x -> 1}>
0.00/0.03	<l3, l6, true>
0.00/0.03	<l4, l5, true, seq{main_y -> 1}>
0.00/0.03	<l5, l6, true>
0.00/0.03	<l6, l7, true>
0.00/0.03	<l7, l8, (main_x = main_y)>
0.00/0.03	<l7, l9, not((main_x = main_y))>
0.00/0.03	<l8, l7, true>
0.00/0.03	<l9, l10, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	10, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+                                                                  +
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	
0.00/0.03	Function Return and Parameters Information [2 functions]:
0.00/0.03	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.03	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.03	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.03	        main__func_return_      [function result] : int
0.00/0.03	
0.00/0.03	
0.00/0.03	AST Ident Scanner Information [5 idents]:
0.00/0.03	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 9, col: 9>
0.00/0.03	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.03	i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 13, col: 9>
0.00/0.03	x | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5> <line: 14, col: 9> <line: 18, col: 12>
0.00/0.03	y | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 16, col: 9> <line: 18, col: 17>
0.00/0.03	
0.00/0.03	Main function: main
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l7, (undef2 > 10), par{main_x -> 1, main_y -> 0}>
0.00/0.03	<l0, l7, not((undef2 > 10)), par{main_x -> 0, main_y -> 1}>
0.00/0.03	<l7, l7, (main_x = main_y)>
0.00/0.03	<l7, l10, (main_x < main_y)>
0.00/0.03	<l7, l10, (main_x > main_y)>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef2, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef2, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	10, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l7, l7, main_x = main_y, {all remain the same}>
0.00/0.03	Variables:
0.00/0.03	main_x, main_y
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l7, 11 <= undef2, {main_x -> 1, main_y -> 0, rest remain the same}>
0.00/0.03	<l0, l7, undef2 <= 10, {main_x -> 0, main_y -> 1, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l7, l10, 1 + main_x <= main_y, {all remain the same}>
0.00/0.03	<l7, l10, 1 + main_y <= main_x, {all remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 7 , 1 )
0.00/0.03	( 10 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.001833
0.00/0.03	
0.00/0.03	> No variable changes in termination graph.
0.00/0.03	Checking conditional unfeasibility...
0.00/0.03	Calling Safety with literal 1 + main_x <= main_y and entry <l7, l7, main_x <= main_y, {all remain the same}>
0.00/0.03	
0.00/0.03	LOG: CALL check - Post:1 + main_x <= main_y - Process 1
0.00/0.03	* Exit transition: <l7, l7, main_x <= main_y, {all remain the same}>
0.00/0.03	* Postcondition  : 1 + main_x <= main_y
0.00/0.03	Postcodition moved up: 1 + main_x <= main_y
0.00/0.03	
0.00/0.03	LOG: Try proving POST
0.00/0.03	
0.00/0.03	LOG: Postcondition implied
0.00/0.03	> Postcondition implied!
0.00/0.03	
0.00/0.03	LOG: RETURN check - Elapsed time: 0.000839s
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l10}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	EOF