5.13/4.17	NO
5.13/4.17	
5.13/4.17	Solver Timeout: 4
5.13/4.17	Global Timeout: 300
5.13/4.17	Maximum number of concurrent processes: 900
5.13/4.17	*******************************************************************************************
5.13/4.17	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
5.13/4.17	*******************************************************************************************
5.13/4.17	
5.13/4.17	
5.13/4.17	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
5.13/4.17	
5.13/4.17	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.13/4.17	+                                                                  +
5.13/4.17	Init Location: 0
5.13/4.17	Transitions:
5.13/4.17	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
5.13/4.17	<l1, l2, true>
5.13/4.17	<l2, l7, not((main_x <= 10))>
5.13/4.17	<l2, l3, (main_x <= 10)>
5.13/4.17	<l3, l4, (main_x > 6)>
5.13/4.17	<l3, l6, not((main_x > 6))>
5.13/4.17	<l4, l5, true, seq{main_x -> (main_x + 2)}>
5.13/4.17	<l5, l6, true>
5.13/4.17	<l6, l2, true>
5.13/4.17	<l7, l8, true, seq{main__func_return_ -> 0}>
5.13/4.17	
5.13/4.17	Fresh variables:
5.13/4.17	
5.13/4.17	Undef variables:
5.13/4.17	
5.13/4.17	Abstraction variables:
5.13/4.17	
5.13/4.17	Exit nodes:
5.13/4.17	
5.13/4.17	Accepting locations:
5.13/4.17	
5.13/4.17	Asserts:
5.13/4.17	
5.13/4.17	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
5.13/4.17	       
5.13/4.17	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
5.13/4.17	       
5.13/4.17	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
5.13/4.17	
5.13/4.17	Init Location: 0
5.13/4.17	Transitions:
5.13/4.17	<l0, l9, true, seq{main__func_return_ -> 0}>
5.13/4.17	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.13/4.17	<l10, l1, true, seq{main_x -> varCall_1}>
5.13/4.17	<l1, l2, true>
5.13/4.17	<l2, l3, (main_x <= 10)>
5.13/4.17	<l2, l7, not((main_x <= 10))>
5.13/4.17	<l3, l4, (main_x > 6)>
5.13/4.17	<l3, l6, not((main_x > 6))>
5.13/4.17	<l4, l5, true, seq{main_x -> (main_x + 2)}>
5.13/4.17	<l5, l6, true>
5.13/4.17	<l6, l2, true>
5.13/4.17	<l7, l8, true, seq{main__func_return_ -> 0}>
5.13/4.17	
5.13/4.17	Fresh variables:
5.13/4.17	
5.13/4.17	Undef variables:
5.13/4.17	
5.13/4.17	Abstraction variables:
5.13/4.17	
5.13/4.17	Exit nodes:
5.13/4.17	8, 
5.13/4.17	Accepting locations:
5.13/4.17	
5.13/4.17	Asserts:
5.13/4.17	
5.13/4.17	+                                                                  +
5.13/4.17	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.13/4.17	
5.13/4.17	
5.13/4.17	Function Return and Parameters Information [2 functions]:
5.13/4.17	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
5.13/4.17	        __VERIFIER_nondet_int__func_return_      [function result] : int
5.13/4.17	    function name: main [1 return + 0 parameters]        demangled: main
5.13/4.17	        main__func_return_      [function result] : int
5.13/4.17	
5.13/4.17	
5.13/4.17	AST Ident Scanner Information [3 idents]:
5.13/4.17	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 16, col: 9>
5.13/4.17	main | function | [integer, ()] | <line: 14, col: 1>
5.13/4.17	x | local variable | integer | <line: 15, col: 2> | <line: 16, col: 5> <line: 17, col: 12> <line: 18, col: 13> <line: 19, col: 13> <line: 19, col: 17>
5.13/4.17	
5.13/4.17	Main function: main
5.13/4.17	Preprocessed LLVMGraph
5.13/4.17	Init Location: 0
5.13/4.17	Transitions:
5.13/4.17	<l0, l2, (main_x = undef2)>
5.13/4.17	<l2, l2, (main_x <= 10) /\ (main_x > 6), par{main_x -> (main_x + 2)}>
5.13/4.17	<l2, l2, (main_x <= 10) /\ not((main_x > 6))>
5.13/4.17	<l2, l8, not((main_x <= 10))>
5.13/4.17	
5.13/4.17	Fresh variables:
5.13/4.17	undef2, 
5.13/4.17	
5.13/4.17	Undef variables:
5.13/4.17	undef2, 
5.13/4.17	
5.13/4.17	Abstraction variables:
5.13/4.17	
5.13/4.17	Exit nodes:
5.13/4.17	8, 
5.13/4.17	Accepting locations:
5.13/4.17	
5.13/4.17	Asserts:
5.13/4.17	
5.13/4.17	*************************************************************
5.13/4.17	*******************************************************************************************
5.13/4.17	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.13/4.17	*******************************************************************************************
5.13/4.17	
5.13/4.17	Init Location: 0
5.13/4.17	Graph 0:
5.13/4.17	Transitions:
5.13/4.17	Variables:
5.13/4.17	
5.13/4.17	Graph 1:
5.13/4.17	Transitions:
5.13/4.17	<l2, l2, main_x <= 10 /\ 7 <= main_x, {main_x -> 2 + main_x, rest remain the same}>
5.13/4.17	<l2, l2, main_x <= 6, {all remain the same}>
5.13/4.17	Variables:
5.13/4.17	main_x
5.13/4.17	
5.13/4.17	Graph 2:
5.13/4.17	Transitions:
5.13/4.17	Variables:
5.13/4.17	
5.13/4.17	Precedence: 
5.13/4.17	Graph 0
5.13/4.17	
5.13/4.17	Graph 1
5.13/4.17	<l0, l2, main_x = undef2, {all remain the same}>
5.13/4.17	
5.13/4.17	Graph 2
5.13/4.17	<l2, l8, 11 <= main_x, {all remain the same}>
5.13/4.17	
5.13/4.17	Map Locations to Subgraph:
5.13/4.17	( 0 , 0 )
5.13/4.17	( 2 , 1 )
5.13/4.17	( 8 , 2 )
5.13/4.17	
5.13/4.17	*******************************************************************************************
5.13/4.17	********************************    CHECKING ASSERTIONS    ********************************
5.13/4.17	*******************************************************************************************
5.13/4.17	
5.13/4.17	Proving termination of subgraph 0
5.13/4.17	Proving termination of subgraph 1
5.13/4.17	Checking unfeasibility...
5.13/4.17	Time used: 0.002794
5.13/4.17	
5.13/4.17	Checking conditional termination of SCC {l2}...
5.13/4.17	
5.13/4.17	LOG: CALL solveLinear
5.13/4.17	
5.13/4.17	LOG: RETURN solveLinear - Elapsed time: 0.000684s
5.13/4.17	Ranking function: 5 + (~(1) / 2)*main_x
5.13/4.17	New Graphs: 
5.13/4.17	Transitions:
5.13/4.17	<l2, l2, main_x <= 6, {all remain the same}>
5.13/4.17	Variables:
5.13/4.17	main_x
5.13/4.17	> No variable changes in termination graph.
5.13/4.17	Checking conditional unfeasibility...
5.13/4.17	Calling Safety with literal 7 <= main_x and entry <l2, l2, true, {all remain the same}>
5.13/4.17	
5.13/4.17	LOG: CALL check - Post:7 <= main_x - Process 1
5.13/4.17	* Exit transition: <l2, l2, true, {all remain the same}>
5.13/4.17	* Postcondition  : 7 <= main_x
5.13/4.17	Quasi-invariants: 
5.13/4.17	Location 2: 7 <= main_x ; 
5.13/4.17	
5.13/4.17	LOG: CALL check - Post:7 <= main_x - Process 2
5.13/4.17	* Exit transition: <l0, l2, main_x = undef2, {all remain the same}>
5.13/4.17	* Postcondition  : 7 <= main_x
5.13/4.17	
5.13/4.17	LOG: CALL solveLinear
5.13/4.17	
5.13/4.17	LOG: RETURN solveLinear - Elapsed time: 0.000317s
5.13/4.17	> Postcondition is not implied!
5.13/4.17	
5.13/4.17	LOG: RETURN check - Elapsed time: 0.000390s
5.13/4.17	
5.13/4.17	LOG: NarrowEntry size 1
5.13/4.17	It's unfeasible. Removing transition: 
5.13/4.17	<l2, l2, main_x <= 10 /\ 7 <= main_x, {main_x -> 2 + main_x, rest remain the same}>
5.13/4.17	Narrowing transition: 
5.13/4.17	<l2, l2, main_x <= 6, {all remain the same}>
5.13/4.17	
5.13/4.17	LOG: Narrow transition size 1
5.13/4.17	ENTRIES:
5.13/4.17	<l0, l2, main_x <= 6 /\ main_x = undef2, {all remain the same}>
5.13/4.17	END ENTRIES:
5.13/4.17	GRAPH:
5.13/4.17	<l2, l2, main_x <= 6, {all remain the same}>
5.13/4.17	END GRAPH:
5.13/4.17	EXIT: <l2, l2, true, {all remain the same}>
5.13/4.17	POST: 7 <= main_x
5.13/4.17	
5.13/4.17	
5.13/4.17	LOG: Try proving POST
5.13/4.17	[63294 : 63296]
5.13/4.17	[63294 : 63297]
5.13/4.17	[63294 : 63298]
5.13/4.17	
5.13/4.17	LOG: Postcondition is not implied - no solution
5.13/4.17	> Postcondition is not implied!
5.13/4.17	
5.13/4.17	LOG: RETURN check - Elapsed time: 4.108165s
5.13/4.17	
5.13/4.17	[63294 : 63299]
5.13/4.17	[63294 : 63303]
5.13/4.17	Successful child: 63303
5.13/4.17	
5.13/4.17	Program does NOT terminate
5.13/4.17	EOF