0.00/0.15	NO
0.00/0.15	
0.00/0.15	Solver Timeout: 4
0.00/0.15	Global Timeout: 300
0.00/0.15	Maximum number of concurrent processes: 900
0.00/0.15	*******************************************************************************************
0.00/0.15	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.15	*******************************************************************************************
0.00/0.15	
0.00/0.15	
0.00/0.15	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.15	
0.00/0.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.15	+                                                                  +
0.00/0.15	Init Location: 0
0.00/0.15	Transitions:
0.00/0.15	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.15	<l1, l2, true>
0.00/0.15	<l2, l7, not((main_i > 5))>
0.00/0.15	<l2, l3, (main_i > 5)>
0.00/0.15	<l3, l4, not((main_i = 10))>
0.00/0.15	<l3, l6, (main_i = 10)>
0.00/0.15	<l4, l5, true, seq{main_i -> (main_i - 1)}>
0.00/0.15	<l5, l6, true>
0.00/0.15	<l6, l2, true>
0.00/0.15	<l7, l8, true, seq{main__func_return_ -> 0}>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.15	       
0.00/0.15	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.15	       
0.00/0.15	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.15	
0.00/0.15	Init Location: 0
0.00/0.15	Transitions:
0.00/0.15	<l0, l9, true, seq{main__func_return_ -> 0}>
0.00/0.15	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.15	<l10, l1, true, seq{main_i -> varCall_1}>
0.00/0.15	<l1, l2, true>
0.00/0.15	<l2, l3, (main_i > 5)>
0.00/0.15	<l2, l7, not((main_i > 5))>
0.00/0.15	<l3, l6, (main_i = 10)>
0.00/0.15	<l3, l4, not((main_i = 10))>
0.00/0.15	<l4, l5, true, seq{main_i -> (main_i - 1)}>
0.00/0.15	<l5, l6, true>
0.00/0.15	<l6, l2, true>
0.00/0.15	<l7, l8, true, seq{main__func_return_ -> 0}>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	8, 
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	+                                                                  +
0.00/0.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.15	
0.00/0.15	
0.00/0.15	Function Return and Parameters Information [2 functions]:
0.00/0.15	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.15	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.15	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.15	        main__func_return_      [function result] : int
0.00/0.15	
0.00/0.15	
0.00/0.15	AST Ident Scanner Information [3 idents]:
0.00/0.15	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
0.00/0.15	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.15	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>
0.00/0.15	
0.00/0.15	Main function: main
0.00/0.15	Preprocessed LLVMGraph
0.00/0.15	Init Location: 0
0.00/0.15	Transitions:
0.00/0.15	<l0, l2, (main_i = undef2)>
0.00/0.15	<l2, l2, (main_i > 5) /\ (main_i = 10)>
0.00/0.15	<l2, l2, (main_i > 5) /\ (main_i < 10), par{main_i -> (main_i - 1)}>
0.00/0.15	<l2, l2, (main_i > 5) /\ (main_i > 10), par{main_i -> (main_i - 1)}>
0.00/0.15	<l2, l8, not((main_i > 5))>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	undef2, 
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	undef2, 
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	8, 
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	*************************************************************
0.00/0.15	*******************************************************************************************
0.00/0.15	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.15	*******************************************************************************************
0.00/0.15	
0.00/0.15	Init Location: 0
0.00/0.15	Graph 0:
0.00/0.15	Transitions:
0.00/0.15	Variables:
0.00/0.15	
0.00/0.15	Graph 1:
0.00/0.15	Transitions:
0.00/0.15	<l2, l2, main_i = 10, {all remain the same}>
0.00/0.15	<l2, l2, 6 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
0.00/0.15	<l2, l2, 11 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
0.00/0.15	Variables:
0.00/0.15	main_i
0.00/0.15	
0.00/0.15	Graph 2:
0.00/0.15	Transitions:
0.00/0.15	Variables:
0.00/0.15	
0.00/0.15	Precedence: 
0.00/0.15	Graph 0
0.00/0.15	
0.00/0.15	Graph 1
0.00/0.15	<l0, l2, main_i = undef2, {all remain the same}>
0.00/0.15	
0.00/0.15	Graph 2
0.00/0.15	<l2, l8, main_i <= 5, {all remain the same}>
0.00/0.15	
0.00/0.15	Map Locations to Subgraph:
0.00/0.15	( 0 , 0 )
0.00/0.15	( 2 , 1 )
0.00/0.15	( 8 , 2 )
0.00/0.15	
0.00/0.15	*******************************************************************************************
0.00/0.15	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.15	*******************************************************************************************
0.00/0.15	
0.00/0.15	Proving termination of subgraph 0
0.00/0.15	Proving termination of subgraph 1
0.00/0.15	Checking unfeasibility...
0.00/0.15	Time used: 0.003445
0.00/0.15	
0.00/0.15	Checking conditional termination of SCC {l2}...
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000947s
0.00/0.15	Ranking function: -6 + main_i
0.00/0.15	New Graphs: 
0.00/0.15	Transitions:
0.00/0.15	<l2, l2, main_i = 10, {all remain the same}>
0.00/0.15	Variables:
0.00/0.15	main_i
0.00/0.15	> No variable changes in termination graph.
0.00/0.15	Checking conditional unfeasibility...
0.00/0.15	Termination failed. Trying to show unreachability...
0.00/0.15	Proving unreachability of entry: <l0, l2, main_i = undef2, {all remain the same}>
0.00/0.15	
0.00/0.15	LOG: CALL check - Post:1 <= 0 - Process 1
0.00/0.15	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
0.00/0.15	* Postcondition  : 1 <= 0
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000300s
0.00/0.15	> Postcondition is not implied!
0.00/0.15	
0.00/0.15	LOG: RETURN check - Elapsed time: 0.000370s
0.00/0.15	Cannot prove unreachability
0.00/0.15	
0.00/0.15	[1243 : 1245]
0.00/0.15	[1243 : 1249]
0.00/0.15	Successful child: 1245
0.00/0.15	
0.00/0.15	Program does NOT terminate
0.00/0.15	EOF