16.61/7.06	NO
16.61/7.06	
16.61/7.07	Solver Timeout: 4
16.61/7.07	Global Timeout: 300
16.61/7.07	Maximum number of concurrent processes: 900
16.61/7.07	*******************************************************************************************
16.61/7.07	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
16.61/7.07	*******************************************************************************************
16.61/7.07	
16.61/7.07	
16.61/7.07	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
16.61/7.07	
16.61/7.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
16.61/7.07	+                                                                  +
16.61/7.07	Init Location: 0
16.61/7.07	Transitions:
16.61/7.07	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
16.61/7.07	<l1, l2, true>
16.61/7.07	<l2, l18, (main_i = 0)>
16.61/7.07	<l2, l3, not((main_i = 0))>
16.61/7.07	<l3, l15, not((~(5) <= main_i))>
16.61/7.07	<l3, l4, (~(5) <= main_i)>
16.61/7.07	<l4, l5, (main_i <= 35)>
16.61/7.07	<l4, l15, not((main_i <= 35))>
16.61/7.07	<l5, l6, (main_i < 0)>
16.61/7.07	<l5, l8, not((main_i < 0))>
16.61/7.07	<l6, l7, true, seq{main_i -> ~(5)}>
16.61/7.07	<l7, l14, true>
16.61/7.07	<l8, l9, (main_i > 30)>
16.61/7.07	<l8, l11, not((main_i > 30))>
16.61/7.07	<l9, l10, true, seq{main_i -> 35}>
16.61/7.07	<l10, l13, true>
16.61/7.07	<l11, l12, true, seq{main_i -> (main_i - 1)}>
16.61/7.07	<l12, l13, true>
16.61/7.07	<l13, l14, true>
16.61/7.07	<l14, l17, true>
16.61/7.07	<l15, l16, true, seq{main_i -> 0}>
16.61/7.07	<l16, l17, true>
16.61/7.07	<l17, l2, true>
16.61/7.07	<l18, l19, true, seq{main__func_return_ -> 0}>
16.61/7.07	
16.61/7.07	Fresh variables:
16.61/7.07	
16.61/7.07	Undef variables:
16.61/7.07	
16.61/7.07	Abstraction variables:
16.61/7.07	
16.61/7.07	Exit nodes:
16.61/7.07	
16.61/7.07	Accepting locations:
16.61/7.07	
16.61/7.07	Asserts:
16.61/7.07	
16.61/7.07	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
16.61/7.07	       
16.61/7.07	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
16.61/7.07	       
16.61/7.07	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
16.61/7.07	
16.61/7.07	Init Location: 0
16.61/7.07	Transitions:
16.61/7.07	<l0, l20, true, seq{main__func_return_ -> 0}>
16.61/7.07	<l20, l21, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
16.61/7.07	<l21, l1, true, seq{main_i -> varCall_1}>
16.61/7.07	<l1, l2, true>
16.61/7.07	<l2, l18, (main_i = 0)>
16.61/7.07	<l2, l3, not((main_i = 0))>
16.61/7.07	<l3, l4, (~(5) <= main_i)>
16.61/7.07	<l3, l15, not((~(5) <= main_i))>
16.61/7.07	<l4, l5, (main_i <= 35)>
16.61/7.07	<l4, l15, not((main_i <= 35))>
16.61/7.07	<l5, l6, (main_i < 0)>
16.61/7.07	<l5, l8, not((main_i < 0))>
16.61/7.07	<l6, l7, true, seq{main_i -> ~(5)}>
16.61/7.07	<l7, l14, true>
16.61/7.07	<l8, l9, (main_i > 30)>
16.61/7.07	<l8, l11, not((main_i > 30))>
16.61/7.07	<l9, l10, true, seq{main_i -> 35}>
16.61/7.07	<l10, l13, true>
16.61/7.07	<l11, l12, true, seq{main_i -> (main_i - 1)}>
16.61/7.07	<l12, l13, true>
16.61/7.07	<l13, l14, true>
16.61/7.07	<l14, l17, true>
16.61/7.07	<l15, l16, true, seq{main_i -> 0}>
16.61/7.07	<l16, l17, true>
16.61/7.07	<l17, l2, true>
16.61/7.07	<l18, l19, true, seq{main__func_return_ -> 0}>
16.61/7.07	
16.61/7.07	Fresh variables:
16.61/7.07	
16.61/7.07	Undef variables:
16.61/7.07	
16.61/7.07	Abstraction variables:
16.61/7.07	
16.61/7.07	Exit nodes:
16.61/7.07	19, 
16.61/7.07	Accepting locations:
16.61/7.07	
16.61/7.07	Asserts:
16.61/7.07	
16.61/7.07	+                                                                  +
16.61/7.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
16.61/7.07	
16.61/7.07	
16.61/7.07	Function Return and Parameters Information [2 functions]:
16.61/7.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
16.61/7.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
16.61/7.07	    function name: main [1 return + 0 parameters]        demangled: main
16.61/7.07	        main__func_return_      [function result] : int
16.61/7.07	
16.61/7.07	
16.61/7.07	AST Ident Scanner Information [3 idents]:
16.61/7.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
16.61/7.07	main | function | [integer, ()] | <line: 5, col: 1>
16.61/7.07	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 19> <line: 10, col: 24> <line: 11, col: 17> <line: 12, col: 17> <line: 14, col: 21> <line: 15, col: 21> <line: 17, col: 21> <line: 17, col: 25> <line: 21, col: 13>
16.61/7.07	
16.61/7.07	Main function: main
16.61/7.07	Preprocessed LLVMGraph
16.61/7.07	Init Location: 0
16.61/7.07	Transitions:
16.61/7.07	<l0, l2, (main_i = undef2)>
16.61/7.07	<l2, l19, (main_i = 0)>
16.61/7.07	<l2, l2, (main_i < 0) /\ (~(5) <= main_i) /\ (main_i <= 35) /\ (main_i < 0), par{main_i -> ~(5)}>
16.61/7.07	<l2, l2, (main_i < 0) /\ not((~(5) <= main_i)), par{main_i -> 0}>
16.61/7.07	<l2, l2, (main_i > 0) /\ (~(5) <= main_i) /\ (main_i <= 35) /\ not((main_i < 0)) /\ (main_i > 30), par{main_i -> 35}>
16.61/7.07	<l2, l2, (main_i > 0) /\ (~(5) <= main_i) /\ (main_i <= 35) /\ not((main_i < 0)) /\ not((main_i > 30)), par{main_i -> (main_i - 1)}>
16.61/7.07	<l2, l2, (main_i > 0) /\ (~(5) <= main_i) /\ not((main_i <= 35)), par{main_i -> 0}>
16.61/7.07	
16.61/7.07	Fresh variables:
16.61/7.07	undef2, 
16.61/7.07	
16.61/7.07	Undef variables:
16.61/7.07	undef2, 
16.61/7.07	
16.61/7.07	Abstraction variables:
16.61/7.07	
16.61/7.07	Exit nodes:
16.61/7.07	19, 
16.61/7.07	Accepting locations:
16.61/7.07	
16.61/7.07	Asserts:
16.61/7.07	
16.61/7.07	*************************************************************
16.61/7.07	*******************************************************************************************
16.61/7.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
16.61/7.07	*******************************************************************************************
16.61/7.07	
16.61/7.07	Init Location: 0
16.61/7.07	Graph 0:
16.61/7.07	Transitions:
16.61/7.07	Variables:
16.61/7.07	
16.61/7.07	Graph 1:
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	<l2, l2, 6 + main_i <= 0, {main_i -> 0, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 30, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	
16.61/7.07	Graph 2:
16.61/7.07	Transitions:
16.61/7.07	Variables:
16.61/7.07	
16.61/7.07	Precedence: 
16.61/7.07	Graph 0
16.61/7.07	
16.61/7.07	Graph 1
16.61/7.07	<l0, l2, main_i = undef2, {all remain the same}>
16.61/7.07	
16.61/7.07	Graph 2
16.61/7.07	<l2, l19, main_i = 0, {all remain the same}>
16.61/7.07	
16.61/7.07	Map Locations to Subgraph:
16.61/7.07	( 0 , 0 )
16.61/7.07	( 2 , 1 )
16.61/7.07	( 19 , 2 )
16.61/7.07	
16.61/7.07	*******************************************************************************************
16.61/7.07	********************************    CHECKING ASSERTIONS    ********************************
16.61/7.07	*******************************************************************************************
16.61/7.07	
16.61/7.07	Proving termination of subgraph 0
16.61/7.07	Proving termination of subgraph 1
16.61/7.07	Checking unfeasibility...
16.61/7.07	Time used: 0.007901
16.61/7.07	
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001798s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.069232s
16.61/7.07	[41397 : 41400]
16.61/7.07	[41397 : 41401]
16.61/7.07	Successful child: 41400
16.61/7.07	[ Invariant Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 6 + main_i <= 0, {main_i -> 0, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 30, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	[ Termination Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 6 + main_i <= 0, {main_i -> 0, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 30, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 30, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001077s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.006034s
16.61/7.07	Piecewise ranking function: min(-61 + 61*main_i,1829)
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000488s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001616s
16.61/7.07	[41397 : 41405]
16.61/7.07	[41397 : 41406]
16.61/7.07	Successful child: 41405
16.61/7.07	[ Invariant Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 15, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	[ Termination Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	New Graphs: 
16.61/7.07	
16.61/7.07	LOG: CALL check - Post:0 <= main_i - Process 1
16.61/7.07	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
16.61/7.07	* Postcondition  : 0 <= main_i
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000510s
16.61/7.07	> Postcondition is not implied!
16.61/7.07	
16.61/7.07	LOG: RETURN check - Elapsed time: 0.000593s
16.61/7.07	INVARIANTS: 
16.61/7.07	2: 
16.61/7.07	Quasi-INVARIANTS to narrow Graph: 
16.61/7.07	2: 0 <= main_i , 
16.61/7.07	
16.61/7.07	LOG: CALL check - Post:main_i <= 15 - Process 2
16.61/7.07	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
16.61/7.07	* Postcondition  : main_i <= 15
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000494s
16.61/7.07	> Postcondition is not implied!
16.61/7.07	
16.61/7.07	LOG: RETURN check - Elapsed time: 0.000565s
16.61/7.07	INVARIANTS: 
16.61/7.07	2: 
16.61/7.07	Quasi-INVARIANTS to narrow Graph: 
16.61/7.07	2: main_i <= 15 , 
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 6 + main_i <= 0, {main_i -> 0, rest remain the same}>
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, 1 <= main_i /\ main_i <= 30, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 36 <= main_i, {main_i -> 0, rest remain the same}>
16.61/7.07	invGraph after Narrowing: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 30 /\ 16 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001184s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.011645s
16.61/7.07	Piecewise ranking function: min(140,20 + 4*main_i)
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000861s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.003563s
16.61/7.07	[41397 : 41410]
16.61/7.07	[41397 : 41411]
16.61/7.07	Successful child: 41410
16.61/7.07	[ Invariant Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 30 /\ 16 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	[ Termination Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000512s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001688s
16.61/7.07	[41397 : 41415]
16.61/7.07	[41397 : 41416]
16.61/7.07	Successful child: 41415
16.61/7.07	[ Invariant Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	[ Termination Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	> It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	New Graphs: 
16.61/7.07	
16.61/7.07	LOG: CALL check - Post:main_i <= 8 - Process 3
16.61/7.07	* Exit transition: <l0, l2, 16 <= main_i /\ main_i = undef2, {all remain the same}>
16.61/7.07	* Postcondition  : main_i <= 8
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000689s
16.61/7.07	> Postcondition is not implied!
16.61/7.07	
16.61/7.07	LOG: RETURN check - Elapsed time: 0.000775s
16.61/7.07	INVARIANTS: 
16.61/7.07	2: 
16.61/7.07	Quasi-INVARIANTS to narrow Graph: 
16.61/7.07	2: main_i <= 8 , 
16.61/7.07	
16.61/7.07	LOG: CALL check - Post:6 + main_i <= 0 - Process 4
16.61/7.07	* Exit transition: <l0, l2, 1 + main_i <= 0 /\ main_i = undef2, {all remain the same}>
16.61/7.07	* Postcondition  : 6 + main_i <= 0
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000573s
16.61/7.07	> Postcondition is not implied!
16.61/7.07	
16.61/7.07	LOG: RETURN check - Elapsed time: 0.000653s
16.61/7.07	INVARIANTS: 
16.61/7.07	2: 
16.61/7.07	Quasi-INVARIANTS to narrow Graph: 
16.61/7.07	2: 6 + main_i <= 0 , 
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	Narrowing transition: 
16.61/7.07	<l2, l2, main_i <= 30 /\ 16 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: Narrow transition size 2
16.61/7.07	invGraph after Narrowing: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 30 /\ 16 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001194s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.011685s
16.61/7.07	Piecewise ranking function: min(140,20 + 4*main_i)
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000862s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.003529s
16.61/7.07	[41397 : 41421]
16.61/7.07	[41397 : 41422]
16.61/7.07	Successful child: 41421
16.61/7.07	[ Invariant Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 30 /\ 16 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
16.61/7.07	[ Termination Graph ]
16.61/7.07	Strengthening and disabling transitions...
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	Strengthening transition (result): 
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	
16.61/7.07	LOG: CALL solverLinear in Graph for feasibility
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear in Graph for feasibility
16.61/7.07	It's unfeasible. Removing transition: 
16.61/7.07	<l2, l2, main_i <= 35 /\ 31 <= main_i, {main_i -> 35, rest remain the same}>
16.61/7.07	New Graphs: 
16.61/7.07	Transitions:
16.61/7.07	<l2, l2, 0 <= 5 + main_i /\ 1 + main_i <= 0, {main_i -> -5, rest remain the same}>
16.61/7.07	Variables:
16.61/7.07	main_i
16.61/7.07	Checking conditional termination of SCC {l2}...
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.000520s
16.61/7.07	
16.61/7.07	LOG: CALL solveLinear
16.61/7.07	
16.61/7.07	LOG: RETURN solveLinear - Elapsed time: 0.001687s
16.61/7.07	[41397 : 41427]
16.61/7.07	[41397 : 41428]
16.61/7.07	Solving with 1 template(s).
16.61/7.07	
16.61/7.07	LOG: CALL solveNonLinearGetFirstSolution
16.61/7.07	
16.61/7.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084010s
16.61/7.07	Time used: 0.083719
16.61/7.07	
16.61/7.07	[41397 : 41435]
16.61/7.07	[41397 : 41439]
16.61/7.07	Successful child: 41435
16.61/7.07	
16.61/7.07	Program does NOT terminate
16.61/7.07	EOF