1.32/0.67	NO
1.32/0.67	
1.32/0.67	Solver Timeout: 4
1.32/0.67	Global Timeout: 300
1.32/0.67	Maximum number of concurrent processes: 900
1.32/0.67	*******************************************************************************************
1.32/0.67	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
1.32/0.67	*******************************************************************************************
1.32/0.67	
1.32/0.67	
1.32/0.67	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
1.32/0.67	
1.32/0.67	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.32/0.67	+                                                                  +
1.32/0.67	Init Location: 0
1.32/0.67	Transitions:
1.32/0.67	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_range -> 20}>
1.32/0.67	<l1, l2, true>
1.32/0.67	<l2, l13, not((0 <= main_i))>
1.32/0.67	<l2, l3, (0 <= main_i)>
1.32/0.67	<l3, l13, not((main_i <= main_range))>
1.32/0.67	<l3, l4, (main_i <= main_range)>
1.32/0.67	<l4, l6, not((0 = main_i))>
1.32/0.67	<l4, l5, (0 = main_i)>
1.32/0.67	<l5, l6, not((main_i = main_range))>
1.32/0.67	<l5, l12, (main_i = main_range)>
1.32/0.67	<l6, l7, (main_i = main_range)>
1.32/0.67	<l6, l9, not((main_i = main_range))>
1.32/0.67	<l7, l8, true, seq{main_i -> 0, main_range -> (main_range - 1)}>
1.32/0.67	<l8, l11, true>
1.32/0.67	<l9, l10, true, seq{main_i -> (main_i + 1)}>
1.32/0.67	<l10, l11, true>
1.32/0.67	<l11, l12, true>
1.32/0.67	<l12, l2, true>
1.32/0.67	<l13, l14, true, seq{main__func_return_ -> 0}>
1.32/0.67	
1.32/0.67	Fresh variables:
1.32/0.67	
1.32/0.67	Undef variables:
1.32/0.67	
1.32/0.67	Abstraction variables:
1.32/0.67	
1.32/0.67	Exit nodes:
1.32/0.67	
1.32/0.67	Accepting locations:
1.32/0.67	
1.32/0.67	Asserts:
1.32/0.67	
1.32/0.67	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
1.32/0.67	       
1.32/0.67	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
1.32/0.67	       
1.32/0.67	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
1.32/0.67	
1.32/0.67	Init Location: 0
1.32/0.67	Transitions:
1.32/0.67	<l0, l15, true, seq{main__func_return_ -> 0}>
1.32/0.67	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.32/0.67	<l16, l1, true, seq{main_i -> varCall_1, main_range -> 20}>
1.32/0.67	<l1, l2, true>
1.32/0.67	<l2, l3, (0 <= main_i)>
1.32/0.67	<l2, l13, not((0 <= main_i))>
1.32/0.67	<l3, l4, (main_i <= main_range)>
1.32/0.67	<l3, l13, not((main_i <= main_range))>
1.32/0.67	<l4, l5, (0 = main_i)>
1.32/0.67	<l4, l6, not((0 = main_i))>
1.32/0.67	<l5, l12, (main_i = main_range)>
1.32/0.67	<l5, l6, not((main_i = main_range))>
1.32/0.67	<l6, l7, (main_i = main_range)>
1.32/0.67	<l6, l9, not((main_i = main_range))>
1.32/0.67	<l7, l8, true, seq{main_i -> 0, main_range -> (main_range - 1)}>
1.32/0.67	<l8, l11, true>
1.32/0.67	<l9, l10, true, seq{main_i -> (main_i + 1)}>
1.32/0.67	<l10, l11, true>
1.32/0.67	<l11, l12, true>
1.32/0.67	<l12, l2, true>
1.32/0.67	<l13, l14, true, seq{main__func_return_ -> 0}>
1.32/0.67	
1.32/0.67	Fresh variables:
1.32/0.67	
1.32/0.67	Undef variables:
1.32/0.67	
1.32/0.67	Abstraction variables:
1.32/0.67	
1.32/0.67	Exit nodes:
1.32/0.67	14, 
1.32/0.67	Accepting locations:
1.32/0.67	
1.32/0.67	Asserts:
1.32/0.67	
1.32/0.67	+                                                                  +
1.32/0.67	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.32/0.67	
1.32/0.67	
1.32/0.67	Function Return and Parameters Information [2 functions]:
1.32/0.67	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
1.32/0.67	        __VERIFIER_nondet_int__func_return_      [function result] : int
1.32/0.67	    function name: main [1 return + 0 parameters]        demangled: main
1.32/0.67	        main__func_return_      [function result] : int
1.32/0.67	
1.32/0.67	
1.32/0.67	AST Ident Scanner Information [4 idents]:
1.32/0.67	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9>
1.32/0.67	main | function | [integer, ()] | <line: 5, col: 1>
1.32/0.67	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 17> <line: 11, col: 22> <line: 12, col: 20> <line: 12, col: 25> <line: 13, col: 17> <line: 14, col: 17> <line: 17, col: 17> <line: 17, col: 21>
1.32/0.67	range | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 11, col: 27> <line: 12, col: 30> <line: 13, col: 22> <line: 15, col: 17> <line: 15, col: 25>
1.32/0.67	
1.32/0.67	Main function: main
1.32/0.67	Preprocessed LLVMGraph
1.32/0.67	Init Location: 0
1.32/0.67	Transitions:
1.32/0.67	<l0, l2, (main_i = undef2) /\ (main_range = 20)>
1.32/0.67	<l2, l2, (0 <= main_i) /\ (main_i <= main_range) /\ (0 = main_i) /\ (main_i = main_range)>
1.32/0.67	<l2, l2, (0 <= main_i) /\ (main_i <= main_range) /\ (0 = main_i) /\ (main_i < main_range) /\ (main_i < main_range), par{main_i -> (main_i + 1)}>
1.32/0.67	<l2, l2, (0 <= main_i) /\ (main_i <= main_range) /\ (0 < main_i) /\ (main_i = main_range), par{main_i -> 0, main_range -> (main_range - 1)}>
1.32/0.67	<l2, l2, (0 <= main_i) /\ (main_i <= main_range) /\ (0 < main_i) /\ (main_i < main_range), par{main_i -> (main_i + 1)}>
1.32/0.67	<l2, l14, (0 <= main_i) /\ not((main_i <= main_range))>
1.32/0.67	<l2, l14, not((0 <= main_i))>
1.32/0.67	
1.32/0.67	Fresh variables:
1.32/0.67	undef2, 
1.32/0.67	
1.32/0.67	Undef variables:
1.32/0.67	undef2, 
1.32/0.67	
1.32/0.67	Abstraction variables:
1.32/0.67	
1.32/0.67	Exit nodes:
1.32/0.67	14, 
1.32/0.67	Accepting locations:
1.32/0.67	
1.32/0.67	Asserts:
1.32/0.67	
1.32/0.67	*************************************************************
1.32/0.67	*******************************************************************************************
1.32/0.67	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.32/0.67	*******************************************************************************************
1.32/0.67	
1.32/0.67	Init Location: 0
1.32/0.67	Graph 0:
1.32/0.67	Transitions:
1.32/0.67	Variables:
1.32/0.67	
1.32/0.67	Graph 1:
1.32/0.67	Transitions:
1.32/0.67	<l2, l2, main_i = 0 /\ main_i = main_range, {all remain the same}>
1.32/0.67	<l2, l2, 1 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, rest remain the same}>
1.32/0.67	<l2, l2, 1 <= main_i /\ main_i = main_range, {main_i -> 0, main_range -> -1 + main_range, rest remain the same}>
1.32/0.67	<l2, l2, 1 + main_i <= main_range /\ 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
1.32/0.68	Variables:
1.32/0.68	main_i, main_range
1.32/0.68	
1.32/0.68	Graph 2:
1.32/0.68	Transitions:
1.32/0.68	Variables:
1.32/0.68	
1.32/0.68	Precedence: 
1.32/0.68	Graph 0
1.32/0.68	
1.32/0.68	Graph 1
1.32/0.68	<l0, l2, main_i = undef2 /\ main_range = 20, {all remain the same}>
1.32/0.68	
1.32/0.68	Graph 2
1.32/0.68	<l2, l14, 0 <= main_i /\ 1 + main_range <= main_i, {all remain the same}>
1.32/0.68	<l2, l14, 1 + main_i <= 0, {all remain the same}>
1.32/0.68	
1.32/0.68	Map Locations to Subgraph:
1.32/0.68	( 0 , 0 )
1.32/0.68	( 2 , 1 )
1.32/0.68	( 14 , 2 )
1.32/0.68	
1.32/0.68	*******************************************************************************************
1.32/0.68	********************************    CHECKING ASSERTIONS    ********************************
1.32/0.68	*******************************************************************************************
1.32/0.68	
1.32/0.68	Proving termination of subgraph 0
1.32/0.68	Proving termination of subgraph 1
1.32/0.68	Checking unfeasibility...
1.32/0.68	Time used: 0.332397
1.32/0.68	
1.32/0.68	Checking conditional termination of SCC {l2}...
1.32/0.68	
1.32/0.68	LOG: CALL solveLinear
1.32/0.68	
1.32/0.68	LOG: RETURN solveLinear - Elapsed time: 0.002640s
1.32/0.68	Ranking function: -1 + main_range
1.32/0.68	New Graphs: 
1.32/0.68	Transitions:
1.32/0.68	<l2, l2, main_i = 0 /\ main_i = main_range, {all remain the same}>
1.32/0.68	<l2, l2, 1 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, rest remain the same}>
1.32/0.68	<l2, l2, 1 + main_i <= main_range /\ 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
1.32/0.68	Variables:
1.32/0.68	main_i, main_range
1.32/0.68	Checking conditional termination of SCC {l2}...
1.32/0.68	
1.32/0.68	LOG: CALL solveLinear
1.32/0.68	
1.32/0.68	LOG: RETURN solveLinear - Elapsed time: 0.001008s
1.32/0.68	Ranking function: -main_i + main_range
1.32/0.68	New Graphs: 
1.32/0.68	Transitions:
1.32/0.68	<l2, l2, main_i = 0 /\ main_i = main_range, {all remain the same}>
1.32/0.68	Variables:
1.32/0.68	main_i, main_range
1.32/0.68	> No variable changes in termination graph.
1.32/0.68	Checking conditional unfeasibility...
1.32/0.68	Termination failed. Trying to show unreachability...
1.32/0.68	Proving unreachability of entry: <l0, l2, main_i = undef2 /\ main_range = 20, {all remain the same}>
1.32/0.68	
1.32/0.68	LOG: CALL check - Post:1 <= 0 - Process 1
1.32/0.68	* Exit transition: <l0, l2, main_i = undef2 /\ main_range = 20, {all remain the same}>
1.32/0.68	* Postcondition  : 1 <= 0
1.32/0.68	
1.32/0.68	LOG: CALL solveLinear
1.32/0.68	
1.32/0.68	LOG: RETURN solveLinear - Elapsed time: 0.000397s
1.32/0.68	> Postcondition is not implied!
1.32/0.68	
1.32/0.68	LOG: RETURN check - Elapsed time: 0.000476s
1.32/0.68	Cannot prove unreachability
1.32/0.68	
1.32/0.68	[12890 : 12892]
1.32/0.68	[12890 : 12896]
1.32/0.68	Successful child: 12892
1.32/0.68	
1.32/0.68	Program does NOT terminate
1.32/0.68	EOF