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