11.86/5.98	NO
11.86/5.98	
11.86/5.98	Solver Timeout: 4
11.86/5.98	Global Timeout: 300
11.86/5.98	Maximum number of concurrent processes: 900
11.86/5.98	*******************************************************************************************
11.86/5.98	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
11.86/5.98	*******************************************************************************************
11.86/5.98	
11.86/5.98	
11.86/5.98	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
11.86/5.98	
11.86/5.98	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
11.86/5.98	+                                                                  +
11.86/5.98	Init Location: 0
11.86/5.98	Transitions:
11.86/5.98	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_up -> 0}>
11.86/5.98	<l1, l2, true>
11.86/5.98	<l2, l16, not((0 <= main_i))>
11.86/5.98	<l2, l3, (0 <= main_i)>
11.86/5.98	<l3, l16, not((main_i <= 10))>
11.86/5.98	<l3, l4, (main_i <= 10)>
11.86/5.98	<l4, l5, (main_i >= 10)>
11.86/5.98	<l4, l7, not((main_i >= 10))>
11.86/5.98	<l5, l6, true, seq{main_up -> 0}>
11.86/5.98	<l6, l7, true>
11.86/5.98	<l7, l8, (main_i <= 0)>
11.86/5.98	<l7, l10, not((main_i <= 0))>
11.86/5.98	<l8, l9, true, seq{main_up -> 1}>
11.86/5.98	<l9, l10, true>
11.86/5.98	<l10, l11, (main_up >= 1)>
11.86/5.98	<l10, l13, not((main_up >= 1))>
11.86/5.98	<l11, l12, true, seq{main_i -> (main_i + 1)}>
11.86/5.98	<l12, l15, true>
11.86/5.98	<l13, l14, true, seq{main_i -> (main_i - 1)}>
11.86/5.98	<l14, l15, true>
11.86/5.98	<l15, l2, true>
11.86/5.98	<l16, l17, true, seq{main__func_return_ -> 0}>
11.86/5.98	
11.86/5.98	Fresh variables:
11.86/5.98	
11.86/5.98	Undef variables:
11.86/5.98	
11.86/5.98	Abstraction variables:
11.86/5.98	
11.86/5.98	Exit nodes:
11.86/5.98	
11.86/5.98	Accepting locations:
11.86/5.98	
11.86/5.98	Asserts:
11.86/5.98	
11.86/5.98	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
11.86/5.98	       
11.86/5.98	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
11.86/5.98	       
11.86/5.98	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
11.86/5.98	
11.86/5.98	Init Location: 0
11.86/5.98	Transitions:
11.86/5.98	<l0, l18, true, seq{main__func_return_ -> 0}>
11.86/5.98	<l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
11.86/5.98	<l19, l1, true, seq{main_i -> varCall_1, main_up -> 0}>
11.86/5.98	<l1, l2, true>
11.86/5.98	<l2, l3, (0 <= main_i)>
11.86/5.98	<l2, l16, not((0 <= main_i))>
11.86/5.98	<l3, l4, (main_i <= 10)>
11.86/5.98	<l3, l16, not((main_i <= 10))>
11.86/5.98	<l4, l5, (main_i >= 10)>
11.86/5.98	<l4, l7, not((main_i >= 10))>
11.86/5.98	<l5, l6, true, seq{main_up -> 0}>
11.86/5.98	<l6, l7, true>
11.86/5.98	<l7, l8, (main_i <= 0)>
11.86/5.98	<l7, l10, not((main_i <= 0))>
11.86/5.98	<l8, l9, true, seq{main_up -> 1}>
11.86/5.98	<l9, l10, true>
11.86/5.98	<l10, l11, (main_up >= 1)>
11.86/5.98	<l10, l13, not((main_up >= 1))>
11.86/5.98	<l11, l12, true, seq{main_i -> (main_i + 1)}>
11.86/5.98	<l12, l15, true>
11.86/5.98	<l13, l14, true, seq{main_i -> (main_i - 1)}>
11.86/5.98	<l14, l15, true>
11.86/5.98	<l15, l2, true>
11.86/5.98	<l16, l17, true, seq{main__func_return_ -> 0}>
11.86/5.98	
11.86/5.98	Fresh variables:
11.86/5.98	
11.86/5.98	Undef variables:
11.86/5.98	
11.86/5.98	Abstraction variables:
11.86/5.98	
11.86/5.98	Exit nodes:
11.86/5.98	17, 
11.86/5.98	Accepting locations:
11.86/5.98	
11.86/5.98	Asserts:
11.86/5.98	
11.86/5.98	+                                                                  +
11.86/5.98	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
11.86/5.98	
11.86/5.98	
11.86/5.98	Function Return and Parameters Information [2 functions]:
11.86/5.98	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
11.86/5.98	        __VERIFIER_nondet_int__func_return_      [function result] : int
11.86/5.98	    function name: main [1 return + 0 parameters]        demangled: main
11.86/5.98	        main__func_return_      [function result] : int
11.86/5.98	
11.86/5.98	
11.86/5.98	AST Ident Scanner Information [4 idents]:
11.86/5.98	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9>
11.86/5.98	main | function | [integer, ()] | <line: 5, col: 1>
11.86/5.98	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 17> <line: 11, col: 22> <line: 12, col: 13> <line: 15, col: 13> <line: 19, col: 13> <line: 19, col: 17> <line: 21, col: 13> <line: 21, col: 17>
11.86/5.98	up | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 13, col: 13> <line: 16, col: 13> <line: 18, col: 13>
11.86/5.98	
11.86/5.98	Main function: main
11.86/5.98	Preprocessed LLVMGraph
11.86/5.98	Init Location: 0
11.86/5.98	Transitions:
11.86/5.98	<l0, l2, (main_i = undef2) /\ (main_up = 0)>
11.86/5.98	<l2, l2, (0 <= main_i) /\ (main_i <= 10) /\ (main_i >= 10) /\ not((main_i <= 0)) /\ not((0 >= 1)), par{main_i -> (main_i - 1), main_up -> 0}>
11.86/5.98	<l2, l2, (0 <= main_i) /\ (main_i <= 10) /\ not((main_i >= 10)) /\ (main_i <= 0) /\ (1 >= 1), par{main_i -> (main_i + 1), main_up -> 1}>
11.86/5.98	<l2, l2, (0 <= main_i) /\ (main_i <= 10) /\ not((main_i >= 10)) /\ not((main_i <= 0)) /\ (main_up >= 1), par{main_i -> (main_i + 1)}>
11.86/5.98	<l2, l2, (0 <= main_i) /\ (main_i <= 10) /\ not((main_i >= 10)) /\ not((main_i <= 0)) /\ not((main_up >= 1)), par{main_i -> (main_i - 1)}>
11.86/5.98	<l2, l17, (0 <= main_i) /\ not((main_i <= 10))>
11.86/5.98	<l2, l17, not((0 <= main_i))>
11.86/5.98	
11.86/5.98	Fresh variables:
11.86/5.98	undef2, 
11.86/5.98	
11.86/5.98	Undef variables:
11.86/5.98	undef2, 
11.86/5.98	
11.86/5.98	Abstraction variables:
11.86/5.98	
11.86/5.98	Exit nodes:
11.86/5.98	17, 
11.86/5.98	Accepting locations:
11.86/5.98	
11.86/5.98	Asserts:
11.86/5.98	
11.86/5.98	*************************************************************
11.86/5.98	*******************************************************************************************
11.86/5.98	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
11.86/5.98	*******************************************************************************************
11.86/5.98	
11.86/5.98	Init Location: 0
11.86/5.98	Graph 0:
11.86/5.98	Transitions:
11.86/5.98	Variables:
11.86/5.98	
11.86/5.98	Graph 1:
11.86/5.98	Transitions:
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	Variables:
11.86/5.98	main_i, main_up
11.86/5.98	
11.86/5.98	Graph 2:
11.86/5.98	Transitions:
11.86/5.98	Variables:
11.86/5.98	
11.86/5.98	Precedence: 
11.86/5.98	Graph 0
11.86/5.98	
11.86/5.98	Graph 1
11.86/5.98	<l0, l2, main_i = undef2 /\ main_up = 0, {all remain the same}>
11.86/5.98	
11.86/5.98	Graph 2
11.86/5.98	<l2, l17, 11 <= main_i, {all remain the same}>
11.86/5.98	<l2, l17, 1 + main_i <= 0, {all remain the same}>
11.86/5.98	
11.86/5.98	Map Locations to Subgraph:
11.86/5.98	( 0 , 0 )
11.86/5.98	( 2 , 1 )
11.86/5.98	( 17 , 2 )
11.86/5.98	
11.86/5.98	*******************************************************************************************
11.86/5.98	********************************    CHECKING ASSERTIONS    ********************************
11.86/5.98	*******************************************************************************************
11.86/5.98	
11.86/5.98	Proving termination of subgraph 0
11.86/5.98	Proving termination of subgraph 1
11.86/5.98	Checking unfeasibility...
11.86/5.98	Time used: 0.007803
11.86/5.98	
11.86/5.98	Checking conditional termination of SCC {l2}...
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.001497s
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.018030s
11.86/5.98	[12892 : 12894]
11.86/5.98	[12892 : 12895]
11.86/5.98	Successful child: 12894
11.86/5.98	[ Invariant Graph ]
11.86/5.98	Strengthening and disabling transitions...
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	[ Termination Graph ]
11.86/5.98	Strengthening and disabling transitions...
11.86/5.98	> It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	New Graphs: 
11.86/5.98	
11.86/5.98	LOG: CALL check - Post:1 + main_i <= 0 - Process 1
11.86/5.98	* Exit transition: <l0, l2, main_i = undef2 /\ main_up = 0, {all remain the same}>
11.86/5.98	* Postcondition  : 1 + main_i <= 0
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.000527s
11.86/5.98	> Postcondition is not implied!
11.86/5.98	
11.86/5.98	LOG: RETURN check - Elapsed time: 0.000637s
11.86/5.98	INVARIANTS: 
11.86/5.98	2: 
11.86/5.98	Quasi-INVARIANTS to narrow Graph: 
11.86/5.98	2: 1 + main_i <= 0 , 
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	invGraph after Narrowing: 
11.86/5.98	Transitions:
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	Variables:
11.86/5.98	main_i, main_up
11.86/5.98	Checking conditional termination of SCC {l2}...
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.001345s
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.018355s
11.86/5.98	[12892 : 12899]
11.86/5.98	[12892 : 12900]
11.86/5.98	Successful child: 12899
11.86/5.98	[ Invariant Graph ]
11.86/5.98	Strengthening and disabling transitions...
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	[ Termination Graph ]
11.86/5.98	Strengthening and disabling transitions...
11.86/5.98	> It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: CALL solverLinear in Graph for feasibility
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear in Graph for feasibility
11.86/5.98	It's unfeasible. Removing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	New Graphs: 
11.86/5.98	
11.86/5.98	LOG: CALL check - Post:11 <= main_i - Process 2
11.86/5.98	* Exit transition: <l0, l2, 0 <= main_i /\ main_i = undef2 /\ main_up = 0, {all remain the same}>
11.86/5.98	* Postcondition  : 11 <= main_i
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.000731s
11.86/5.98	> Postcondition is not implied!
11.86/5.98	
11.86/5.98	LOG: RETURN check - Elapsed time: 0.000829s
11.86/5.98	INVARIANTS: 
11.86/5.98	2: 
11.86/5.98	Quasi-INVARIANTS to narrow Graph: 
11.86/5.98	2: 11 <= main_i , 
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	Narrowing transition: 
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	
11.86/5.98	LOG: Narrow transition size 1
11.86/5.98	invGraph after Narrowing: 
11.86/5.98	Transitions:
11.86/5.98	<l2, l2, main_i = 10, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
11.86/5.98	<l2, l2, main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
11.86/5.98	<l2, l2, 1 <= main_i /\ 1 <= main_up /\ main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
11.86/5.98	<l2, l2, main_up <= 0 /\ 1 <= main_i /\ main_i <= 9, {main_i -> -1 + main_i, rest remain the same}>
11.86/5.98	Variables:
11.86/5.98	main_i, main_up
11.86/5.98	Checking conditional termination of SCC {l2}...
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.001330s
11.86/5.98	
11.86/5.98	LOG: CALL solveLinear
11.86/5.98	
11.86/5.98	LOG: RETURN solveLinear - Elapsed time: 0.018342s
11.86/5.98	[12892 : 12904]
11.86/5.98	[12892 : 12905]
11.86/5.98	Solving with 1 template(s).
11.86/5.98	
11.86/5.98	LOG: CALL solveNonLinearGetFirstSolution
11.86/5.98	
11.86/5.98	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.142363s
11.86/5.98	Time used: 0.141364
11.86/5.98	
11.86/5.98	[12892 : 12909]
11.86/5.98	[12892 : 12913]
11.86/5.98	Successful child: 12909
11.86/5.98	
11.86/5.98	Program does NOT terminate
11.86/5.98	EOF