0.00/0.04	YES
0.00/0.04	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	Maximum number of concurrent processes: 900
0.00/0.04	*******************************************************************************************
0.00/0.04	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	
0.00/0.04	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.04	
0.00/0.04	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.04	+                                                                  +
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> 0, main_y -> 100, main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l9, not((main_x < 40))>
0.00/0.04	<l2, l3, (main_x < 40)>
0.00/0.04	<l3, l4, (main_z = 0)>
0.00/0.04	<l3, l6, not((main_z = 0))>
0.00/0.04	<l4, l5, true, seq{main_x -> (main_x + 1)}>
0.00/0.04	<l5, l8, true>
0.00/0.04	<l6, l7, true, seq{main_x -> (main_x + 2)}>
0.00/0.04	<l7, l8, true>
0.00/0.04	<l8, l2, true>
0.00/0.04	<l9, l10, true, seq{main__func_return_ -> 0}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.04	       
0.00/0.04	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.04	       
0.00/0.04	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l11, true, seq{main__func_return_ -> 0, main_x -> 0, main_y -> 100}>
0.00/0.04	<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l12, l1, true, seq{main_z -> varCall_1}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l3, (main_x < 40)>
0.00/0.04	<l2, l9, not((main_x < 40))>
0.00/0.04	<l3, l4, (main_z = 0)>
0.00/0.04	<l3, l6, not((main_z = 0))>
0.00/0.04	<l4, l5, true, seq{main_x -> (main_x + 1)}>
0.00/0.04	<l5, l8, true>
0.00/0.04	<l6, l7, true, seq{main_x -> (main_x + 2)}>
0.00/0.04	<l7, l8, true>
0.00/0.04	<l8, l2, true>
0.00/0.04	<l9, l10, true, seq{main__func_return_ -> 0}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	10, 
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	+                                                                  +
0.00/0.04	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.04	
0.00/0.04	
0.00/0.04	Function Return and Parameters Information [2 functions]:
0.00/0.04	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.04	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.04	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.04	        main__func_return_      [function result] : int
0.00/0.04	
0.00/0.04	
0.00/0.04	AST Ident Scanner Information [5 idents]:
0.00/0.04	__VERIFIER_nondet_int | function | [integer, ()] | <line: 13, col: 1> | <line: 19, col: 9>
0.00/0.04	main | function | [integer, ()] | <line: 15, col: 1>
0.00/0.04	x | local variable | integer | <line: 16, col: 5> | <line: 17, col: 2> <line: 20, col: 9> <line: 22, col: 4> <line: 22, col: 8> <line: 24, col: 4> <line: 24, col: 8>
0.00/0.04	y | local variable | integer | <line: 16, col: 5> | <line: 18, col: 5>
0.00/0.04	z | local variable | integer | <line: 16, col: 5> | <line: 19, col: 5> <line: 21, col: 7>
0.00/0.04	
0.00/0.04	Main function: main
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l2, (main_x = 0) /\ (main_z = undef2)>
0.00/0.04	<l2, l2, (main_x < 40) /\ (main_z = 0), par{main_x -> (main_x + 1)}>
0.00/0.04	<l2, l2, (main_x < 40) /\ (main_z < 0), par{main_x -> (main_x + 2)}>
0.00/0.04	<l2, l2, (main_x < 40) /\ (main_z > 0), par{main_x -> (main_x + 2)}>
0.00/0.04	<l2, l10, not((main_x < 40))>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef2, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef2, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	10, 
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, main_x <= 39 /\ main_z = 0, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.04	<l2, l2, 1 + main_z <= 0 /\ main_x <= 39, {main_x -> 2 + main_x, rest remain the same}>
0.00/0.04	<l2, l2, 1 <= main_z /\ main_x <= 39, {main_x -> 2 + main_x, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_z
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l2, main_x = 0 /\ main_z = undef2, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l2, l10, 40 <= main_x, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 2 , 1 )
0.00/0.04	( 10 , 2 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.007246
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.001533s
0.00/0.04	Ranking function: -40 + (~(1) / 2)*main_x + (~(119) / 2)*main_z
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, main_x <= 39 /\ main_z = 0, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.04	<l2, l2, 1 <= main_z /\ main_x <= 39, {main_x -> 2 + main_x, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_z
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000940s
0.00/0.04	Ranking function: 39 - main_x - 80*main_z
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 <= main_z /\ main_x <= 39, {main_x -> 2 + main_x, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_z
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000636s
0.00/0.04	Ranking function: (39 / 2) + (~(1) / 2)*main_x
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l10}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	EOF