19.71/8.81	NO
19.71/8.81	
19.71/8.82	Solver Timeout: 4
19.71/8.82	Global Timeout: 300
19.71/8.82	Maximum number of concurrent processes: 900
19.71/8.82	*******************************************************************************************
19.71/8.82	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
19.71/8.82	*******************************************************************************************
19.71/8.82	
19.71/8.82	
19.71/8.82	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
19.71/8.82	
19.71/8.82	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
19.71/8.82	+                                                                  +
19.71/8.82	Init Location: 0
19.71/8.82	Transitions:
19.71/8.82	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
19.71/8.82	<l1, l2, true>
19.71/8.82	<l2, l13, (main_i = 0)>
19.71/8.82	<l2, l3, not((main_i = 0))>
19.71/8.82	<l3, l4, (main_i > 5)>
19.71/8.82	<l3, l6, not((main_i > 5))>
19.71/8.82	<l4, l5, true, seq{main_i -> (main_i + 1)}>
19.71/8.82	<l5, l12, true>
19.71/8.82	<l6, l7, (main_i < ~(5))>
19.71/8.82	<l6, l9, not((main_i < ~(5)))>
19.71/8.82	<l7, l8, true, seq{main_i -> (main_i - 1)}>
19.71/8.82	<l8, l11, true>
19.71/8.82	<l9, l10, true, seq{main_i -> 0}>
19.71/8.82	<l10, l11, true>
19.71/8.82	<l11, l12, true>
19.71/8.82	<l12, l2, true>
19.71/8.82	<l13, l14, true, seq{main__func_return_ -> 0}>
19.71/8.82	
19.71/8.82	Fresh variables:
19.71/8.82	
19.71/8.82	Undef variables:
19.71/8.82	
19.71/8.82	Abstraction variables:
19.71/8.82	
19.71/8.82	Exit nodes:
19.71/8.82	
19.71/8.82	Accepting locations:
19.71/8.82	
19.71/8.82	Asserts:
19.71/8.82	
19.71/8.82	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
19.71/8.82	       
19.71/8.82	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
19.71/8.82	       
19.71/8.82	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
19.71/8.82	
19.71/8.82	Init Location: 0
19.71/8.82	Transitions:
19.71/8.82	<l0, l15, true, seq{main__func_return_ -> 0}>
19.71/8.82	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
19.71/8.82	<l16, l1, true, seq{main_i -> varCall_1}>
19.71/8.82	<l1, l2, true>
19.71/8.82	<l2, l13, (main_i = 0)>
19.71/8.82	<l2, l3, not((main_i = 0))>
19.71/8.82	<l3, l4, (main_i > 5)>
19.71/8.82	<l3, l6, not((main_i > 5))>
19.71/8.82	<l4, l5, true, seq{main_i -> (main_i + 1)}>
19.71/8.82	<l5, l12, true>
19.71/8.82	<l6, l7, (main_i < ~(5))>
19.71/8.82	<l6, l9, not((main_i < ~(5)))>
19.71/8.82	<l7, l8, true, seq{main_i -> (main_i - 1)}>
19.71/8.82	<l8, l11, true>
19.71/8.82	<l9, l10, true, seq{main_i -> 0}>
19.71/8.82	<l10, l11, true>
19.71/8.82	<l11, l12, true>
19.71/8.82	<l12, l2, true>
19.71/8.82	<l13, l14, true, seq{main__func_return_ -> 0}>
19.71/8.82	
19.71/8.82	Fresh variables:
19.71/8.82	
19.71/8.82	Undef variables:
19.71/8.82	
19.71/8.82	Abstraction variables:
19.71/8.82	
19.71/8.82	Exit nodes:
19.71/8.82	14, 
19.71/8.82	Accepting locations:
19.71/8.82	
19.71/8.82	Asserts:
19.71/8.82	
19.71/8.82	+                                                                  +
19.71/8.82	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
19.71/8.82	
19.71/8.82	
19.71/8.82	Function Return and Parameters Information [2 functions]:
19.71/8.82	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
19.71/8.82	        __VERIFIER_nondet_int__func_return_      [function result] : int
19.71/8.82	    function name: main [1 return + 0 parameters]        demangled: main
19.71/8.82	        main__func_return_      [function result] : int
19.71/8.82	
19.71/8.82	
19.71/8.82	AST Ident Scanner Information [3 idents]:
19.71/8.82	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
19.71/8.82	main | function | [integer, ()] | <line: 5, col: 1>
19.71/8.82	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> <line: 13, col: 17> <line: 14, col: 17> <line: 14, col: 21> <line: 16, col: 17>
19.71/8.82	
19.71/8.82	Main function: main
19.71/8.82	Preprocessed LLVMGraph
19.71/8.82	Init Location: 0
19.71/8.82	Transitions:
19.71/8.82	<l0, l2, (main_i = undef2)>
19.71/8.82	<l2, l14, (main_i = 0)>
19.71/8.82	<l2, l2, (main_i < 0) /\ not((main_i > 5)) /\ (main_i < ~(5)), par{main_i -> (main_i - 1)}>
19.71/8.82	<l2, l2, (main_i < 0) /\ not((main_i > 5)) /\ not((main_i < ~(5))), par{main_i -> 0}>
19.71/8.82	<l2, l2, (main_i > 0) /\ (main_i > 5), par{main_i -> (main_i + 1)}>
19.71/8.82	<l2, l2, (main_i > 0) /\ not((main_i > 5)) /\ not((main_i < ~(5))), par{main_i -> 0}>
19.71/8.82	
19.71/8.82	Fresh variables:
19.71/8.82	undef2, 
19.71/8.82	
19.71/8.82	Undef variables:
19.71/8.82	undef2, 
19.71/8.82	
19.71/8.82	Abstraction variables:
19.71/8.82	
19.71/8.82	Exit nodes:
19.71/8.82	14, 
19.71/8.82	Accepting locations:
19.71/8.82	
19.71/8.82	Asserts:
19.71/8.82	
19.71/8.82	*************************************************************
19.71/8.82	*******************************************************************************************
19.71/8.82	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
19.71/8.82	*******************************************************************************************
19.71/8.82	
19.71/8.82	Init Location: 0
19.71/8.82	Graph 0:
19.71/8.82	Transitions:
19.71/8.82	Variables:
19.71/8.82	
19.71/8.82	Graph 1:
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	
19.71/8.82	Graph 2:
19.71/8.82	Transitions:
19.71/8.82	Variables:
19.71/8.82	
19.71/8.82	Precedence: 
19.71/8.82	Graph 0
19.71/8.82	
19.71/8.82	Graph 1
19.71/8.82	<l0, l2, main_i = undef2, {all remain the same}>
19.71/8.82	
19.71/8.82	Graph 2
19.71/8.82	<l2, l14, main_i = 0, {all remain the same}>
19.71/8.82	
19.71/8.82	Map Locations to Subgraph:
19.71/8.82	( 0 , 0 )
19.71/8.82	( 2 , 1 )
19.71/8.82	( 14 , 2 )
19.71/8.82	
19.71/8.82	*******************************************************************************************
19.71/8.82	********************************    CHECKING ASSERTIONS    ********************************
19.71/8.82	*******************************************************************************************
19.71/8.82	
19.71/8.82	Proving termination of subgraph 0
19.71/8.82	Proving termination of subgraph 1
19.71/8.82	Checking unfeasibility...
19.71/8.82	Time used: 0.004707
19.71/8.82	
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.001264s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.035656s
19.71/8.82	[57190 : 57192]
19.71/8.82	[57190 : 57193]
19.71/8.82	Successful child: 57192
19.71/8.82	[ Invariant Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	[ Termination Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	New Graphs: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000745s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.003468s
19.71/8.82	Piecewise ranking function: min(-7 + 7*main_i,71 - 6*main_i)
19.71/8.82	New Graphs: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000400s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.001170s
19.71/8.82	[57190 : 57197]
19.71/8.82	[57190 : 57198]
19.71/8.82	Successful child: 57197
19.71/8.82	[ Invariant Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	[ Termination Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	New Graphs: 
19.71/8.82	
19.71/8.82	LOG: CALL check - Post:0 <= main_i - Process 1
19.71/8.82	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
19.71/8.82	* Postcondition  : 0 <= main_i
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000447s
19.71/8.82	> Postcondition is not implied!
19.71/8.82	
19.71/8.82	LOG: RETURN check - Elapsed time: 0.000528s
19.71/8.82	INVARIANTS: 
19.71/8.82	2: 
19.71/8.82	Quasi-INVARIANTS to narrow Graph: 
19.71/8.82	2: 0 <= main_i , 
19.71/8.82	
19.71/8.82	LOG: CALL check - Post:main_i <= 5 - Process 2
19.71/8.82	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
19.71/8.82	* Postcondition  : main_i <= 5
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000443s
19.71/8.82	> Postcondition is not implied!
19.71/8.82	
19.71/8.82	LOG: RETURN check - Elapsed time: 0.000516s
19.71/8.82	INVARIANTS: 
19.71/8.82	2: 
19.71/8.82	Quasi-INVARIANTS to narrow Graph: 
19.71/8.82	2: main_i <= 5 , 
19.71/8.82	Narrowing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: Narrow transition size 2
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 1 + main_i <= 0 /\ 0 <= 5 + main_i, {main_i -> 0, rest remain the same}>
19.71/8.82	Narrowing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: Narrow transition size 2
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 1 <= main_i /\ main_i <= 5, {main_i -> 0, rest remain the same}>
19.71/8.82	invGraph after Narrowing: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000669s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.003075s
19.71/8.82	[57190 : 57202]
19.71/8.82	[57190 : 57203]
19.71/8.82	Successful child: 57202
19.71/8.82	[ Invariant Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	[ Termination Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	> It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	New Graphs: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000466s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.001272s
19.71/8.82	[57190 : 57207]
19.71/8.82	[57190 : 57208]
19.71/8.82	Successful child: 57207
19.71/8.82	[ Invariant Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	[ Termination Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	New Graphs: 
19.71/8.82	
19.71/8.82	LOG: CALL check - Post:main_i <= 0 - Process 3
19.71/8.82	* Exit transition: <l0, l2, 6 <= main_i /\ main_i = undef2, {all remain the same}>
19.71/8.82	* Postcondition  : main_i <= 0
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000595s
19.71/8.82	> Postcondition is not implied!
19.71/8.82	
19.71/8.82	LOG: RETURN check - Elapsed time: 0.000697s
19.71/8.82	INVARIANTS: 
19.71/8.82	2: 
19.71/8.82	Quasi-INVARIANTS to narrow Graph: 
19.71/8.82	2: main_i <= 0 , 
19.71/8.82	
19.71/8.82	LOG: CALL check - Post:0 <= 5 + main_i - Process 4
19.71/8.82	* Exit transition: <l0, l2, 1 + main_i <= 0 /\ main_i = undef2, {all remain the same}>
19.71/8.82	* Postcondition  : 0 <= 5 + main_i
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000503s
19.71/8.82	> Postcondition is not implied!
19.71/8.82	
19.71/8.82	LOG: RETURN check - Elapsed time: 0.000588s
19.71/8.82	INVARIANTS: 
19.71/8.82	2: 
19.71/8.82	Quasi-INVARIANTS to narrow Graph: 
19.71/8.82	2: 0 <= 5 + main_i , 
19.71/8.82	Narrowing transition: 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: Narrow transition size 2
19.71/8.82	Narrowing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: Narrow transition size 2
19.71/8.82	invGraph after Narrowing: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000686s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.003069s
19.71/8.82	[57190 : 57212]
19.71/8.82	[57190 : 57213]
19.71/8.82	Successful child: 57212
19.71/8.82	[ Invariant Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	[ Termination Graph ]
19.71/8.82	Strengthening and disabling transitions...
19.71/8.82	> It's unfeasible. Removing transition: 
19.71/8.82	<l2, l2, 6 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
19.71/8.82	
19.71/8.82	LOG: CALL solverLinear in Graph for feasibility
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear in Graph for feasibility
19.71/8.82	Strengthening transition (result): 
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	New Graphs: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 6 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000448s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.001289s
19.71/8.82	[57190 : 57217]
19.71/8.82	[57190 : 57218]
19.71/8.82	Solving with 1 template(s).
19.71/8.82	
19.71/8.82	LOG: CALL solveNonLinearGetFirstSolution
19.71/8.82	
19.71/8.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005793s
19.71/8.82	Time used: 0.005477
19.71/8.82	Improving Solution with cost 1 ...
19.71/8.82	
19.71/8.82	LOG: CALL solveNonLinearGetNextSolution
19.71/8.82	
19.71/8.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012251s
19.71/8.82	Time used: 0.012245
19.71/8.82	
19.71/8.82	LOG: SAT solveNonLinear - Elapsed time: 0.018044s
19.71/8.82	Cost: 1; Total time: 0.017722
19.71/8.82	Quasi-ranking function: 50000 + main_i
19.71/8.82	New Graphs: 
19.71/8.82	Transitions:
19.71/8.82	<l2, l2, 50001 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
19.71/8.82	Variables:
19.71/8.82	main_i
19.71/8.82	Checking conditional termination of SCC {l2}...
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.000410s
19.71/8.82	
19.71/8.82	LOG: CALL solveLinear
19.71/8.82	
19.71/8.82	LOG: RETURN solveLinear - Elapsed time: 0.001208s
19.71/8.82	[57190 : 57222]
19.71/8.82	[57190 : 57223]
19.71/8.82	Solving with 1 template(s).
19.71/8.82	
19.71/8.82	LOG: CALL solveNonLinearGetFirstSolution
19.71/8.82	
19.71/8.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004527s
19.71/8.82	Time used: 0.004177
19.71/8.82	
19.71/8.82	[57190 : 57227]
19.71/8.82	[57190 : 57231]
19.71/8.82	Successful child: 57231
19.71/8.82	
19.71/8.82	Program does NOT terminate
19.71/8.82	EOF