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