34.65/12.79	NO
34.65/12.79	
34.65/12.80	Solver Timeout: 4
34.65/12.80	Global Timeout: 300
34.65/12.80	Maximum number of concurrent processes: 900
34.65/12.80	*******************************************************************************************
34.65/12.80	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
34.65/12.80	*******************************************************************************************
34.65/12.80	
34.65/12.80	
34.65/12.80	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
34.65/12.80	
34.65/12.80	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
34.65/12.80	+                                                                  +
34.65/12.80	Init Location: 0
34.65/12.80	Transitions:
34.65/12.80	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_t -> 0}>
34.65/12.80	<l1, l2, true>
34.65/12.80	<l2, l6, (main_i = 0)>
34.65/12.80	<l2, l3, not((main_i = 0))>
34.65/12.80	<l3, l6, (main_j = 0)>
34.65/12.80	<l3, l4, not((main_j = 0))>
34.65/12.80	<l4, l5, true, seq{main_t -> main_i, main_i -> main_j, main_j -> main_t}>
34.65/12.80	<l5, l2, true>
34.65/12.80	<l6, l7, true, seq{main__func_return_ -> 0}>
34.65/12.80	
34.65/12.80	Fresh variables:
34.65/12.80	
34.65/12.80	Undef variables:
34.65/12.80	
34.65/12.80	Abstraction variables:
34.65/12.80	
34.65/12.80	Exit nodes:
34.65/12.80	
34.65/12.80	Accepting locations:
34.65/12.80	
34.65/12.80	Asserts:
34.65/12.80	
34.65/12.80	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
34.65/12.80	       
34.65/12.80	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
34.65/12.80	       
34.65/12.80	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
34.65/12.80	
34.65/12.80	Init Location: 0
34.65/12.80	Transitions:
34.65/12.80	<l0, l8, true, seq{main__func_return_ -> 0}>
34.65/12.80	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
34.65/12.80	<l9, l10, true, seq{main_i -> varCall_1}>
34.65/12.80	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
34.65/12.80	<l11, l1, true, seq{main_j -> varCall_2, main_t -> 0}>
34.65/12.80	<l1, l2, true>
34.65/12.80	<l2, l6, (main_i = 0)>
34.65/12.80	<l2, l3, not((main_i = 0))>
34.65/12.80	<l3, l6, (main_j = 0)>
34.65/12.80	<l3, l4, not((main_j = 0))>
34.65/12.80	<l4, l5, true, seq{main_t -> main_i, main_i -> main_j, main_j -> main_t}>
34.65/12.80	<l5, l2, true>
34.65/12.80	<l6, l7, true, seq{main__func_return_ -> 0}>
34.65/12.80	
34.65/12.80	Fresh variables:
34.65/12.80	
34.65/12.80	Undef variables:
34.65/12.80	
34.65/12.80	Abstraction variables:
34.65/12.80	
34.65/12.80	Exit nodes:
34.65/12.80	7, 
34.65/12.80	Accepting locations:
34.65/12.80	
34.65/12.80	Asserts:
34.65/12.80	
34.65/12.80	+                                                                  +
34.65/12.80	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
34.65/12.80	
34.65/12.80	
34.65/12.80	Function Return and Parameters Information [2 functions]:
34.65/12.80	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
34.65/12.80	        __VERIFIER_nondet_int__func_return_      [function result] : int
34.65/12.80	    function name: main [1 return + 0 parameters]        demangled: main
34.65/12.80	        main__func_return_      [function result] : int
34.65/12.80	
34.65/12.80	
34.65/12.80	AST Ident Scanner Information [5 idents]:
34.65/12.80	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 9, col: 9> <line: 10, col: 9>
34.65/12.80	main | function | [integer, ()] | <line: 5, col: 1>
34.65/12.80	i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 13, col: 12> <line: 14, col: 13> <line: 15, col: 9>
34.65/12.80	j | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5> <line: 13, col: 22> <line: 15, col: 13> <line: 16, col: 9>
34.65/12.80	t | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 14, col: 9> <line: 16, col: 13>
34.65/12.80	
34.65/12.80	Main function: main
34.65/12.80	Preprocessed LLVMGraph
34.65/12.80	Init Location: 0
34.65/12.80	Transitions:
34.65/12.80	<l0, l2, (main_i = undef3) /\ (main_j = undef4)>
34.65/12.80	<l2, l7, (main_i = 0)>
34.65/12.80	<l2, l7, (main_i < 0) /\ (main_j = 0)>
34.65/12.80	<l2, l2, (main_i < 0) /\ (main_j < 0), par{main_i -> main_j, main_j -> main_i}>
34.65/12.80	<l2, l2, (main_i < 0) /\ (main_j > 0), par{main_i -> main_j, main_j -> main_i}>
34.65/12.80	<l2, l7, (main_i > 0) /\ (main_j = 0)>
34.65/12.80	<l2, l2, (main_i > 0) /\ (main_j < 0), par{main_i -> main_j, main_j -> main_i}>
34.65/12.80	<l2, l2, (main_i > 0) /\ (main_j > 0), par{main_i -> main_j, main_j -> main_i}>
34.65/12.80	
34.65/12.80	Fresh variables:
34.65/12.80	undef3, undef4, 
34.65/12.80	
34.65/12.80	Undef variables:
34.65/12.80	undef3, undef4, 
34.65/12.80	
34.65/12.80	Abstraction variables:
34.65/12.80	
34.65/12.80	Exit nodes:
34.65/12.80	7, 
34.65/12.80	Accepting locations:
34.65/12.80	
34.65/12.80	Asserts:
34.65/12.80	
34.65/12.80	*************************************************************
34.65/12.80	*******************************************************************************************
34.65/12.80	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
34.65/12.80	*******************************************************************************************
34.65/12.80	
34.65/12.80	Init Location: 0
34.65/12.80	Graph 0:
34.65/12.80	Transitions:
34.65/12.80	Variables:
34.65/12.80	
34.65/12.80	Graph 1:
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	
34.65/12.80	Graph 2:
34.65/12.80	Transitions:
34.65/12.80	Variables:
34.65/12.80	
34.65/12.80	Precedence: 
34.65/12.80	Graph 0
34.65/12.80	
34.65/12.80	Graph 1
34.65/12.80	<l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
34.65/12.80	
34.65/12.80	Graph 2
34.65/12.80	<l2, l7, main_i = 0, {all remain the same}>
34.65/12.80	<l2, l7, 1 + main_i <= 0 /\ main_j = 0, {all remain the same}>
34.65/12.80	<l2, l7, 1 <= main_i /\ main_j = 0, {all remain the same}>
34.65/12.80	
34.65/12.80	Map Locations to Subgraph:
34.65/12.80	( 0 , 0 )
34.65/12.80	( 2 , 1 )
34.65/12.80	( 7 , 2 )
34.65/12.80	
34.65/12.80	*******************************************************************************************
34.65/12.80	********************************    CHECKING ASSERTIONS    ********************************
34.65/12.80	*******************************************************************************************
34.65/12.80	
34.65/12.80	Proving termination of subgraph 0
34.65/12.80	Proving termination of subgraph 1
34.65/12.80	Checking unfeasibility...
34.65/12.80	Time used: 0.007611
34.65/12.80	
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001757s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.032731s
34.65/12.80	[24895 : 24897]
34.65/12.80	[24895 : 24898]
34.65/12.80	Successful child: 24897
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001533s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.026510s
34.65/12.80	[24895 : 24902]
34.65/12.80	[24895 : 24903]
34.65/12.80	Successful child: 24902
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	> It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001357s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.014882s
34.65/12.80	[24895 : 24907]
34.65/12.80	[24895 : 24908]
34.65/12.80	Successful child: 24907
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1 /\ 0 <= 1 + main_i + main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	
34.65/12.80	LOG: CALL check - Post:0 <= 1 + main_i + main_j - Process 1
34.65/12.80	* Exit transition: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
34.65/12.80	* Postcondition  : 0 <= 1 + main_i + main_j
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.000933s
34.65/12.80	> Postcondition is not implied!
34.65/12.80	
34.65/12.80	LOG: RETURN check - Elapsed time: 0.001066s
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: 0 <= 1 + main_i + main_j , 
34.65/12.80	
34.65/12.80	LOG: CALL check - Post:main_i + main_j <= 1 - Process 2
34.65/12.80	* Exit transition: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
34.65/12.80	* Postcondition  : main_i + main_j <= 1
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.000638s
34.65/12.80	> Postcondition is not implied!
34.65/12.80	
34.65/12.80	LOG: RETURN check - Elapsed time: 0.000727s
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: main_i + main_j <= 1 , 
34.65/12.80	[24895 : 24913]
34.65/12.80	[24895 : 24914]
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: main_i <= 0 , 1 + main_j <= 0 , 
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	invGraph after Narrowing: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001818s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.031810s
34.65/12.80	[24895 : 24915]
34.65/12.80	[24895 : 24916]
34.65/12.80	Successful child: 24915
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_i + main_j <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	> It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_i + main_j <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_i + main_j <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001578s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.028673s
34.65/12.80	[24895 : 24920]
34.65/12.80	[24895 : 24921]
34.65/12.80	Successful child: 24920
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001160s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.009321s
34.65/12.80	[24895 : 24925]
34.65/12.80	[24895 : 24926]
34.65/12.80	Successful child: 24925
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	> It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	[24895 : 24930]
34.65/12.80	[24895 : 24931]
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: 1 + main_i + main_j <= 0 , 
34.65/12.80	[24895 : 24932]
34.65/12.80	[24895 : 24933]
34.65/12.80	[24895 : 24934]
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: 0 <= 1 + main_i + main_j , 
34.65/12.80	[24895 : 24935]
34.65/12.80	[24895 : 24936]
34.65/12.80	[24895 : 24937]
34.65/12.80	INVARIANTS: 
34.65/12.80	2: 
34.65/12.80	Quasi-INVARIANTS to narrow Graph: 
34.65/12.80	2: main_i <= 0 , 0 <= 1 + main_i , 
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 + main_i <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	Narrowing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: Narrow transition size 4
34.65/12.80	invGraph after Narrowing: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.002706s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.072578s
34.65/12.80	[24895 : 24938]
34.65/12.80	[24895 : 24939]
34.65/12.80	Successful child: 24938
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 <= main_j, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.002516s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.127616s
34.65/12.80	[24895 : 24943]
34.65/12.80	[24895 : 24944]
34.65/12.80	Successful child: 24943
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	> It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= 0 /\ 1 <= main_j /\ main_i + main_j <= 1, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_j /\ 2 + main_i <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 + main_i + main_j <= 0 /\ 1 <= main_i /\ 1 + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.002077s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.042372s
34.65/12.80	[24895 : 24948]
34.65/12.80	[24895 : 24949]
34.65/12.80	Successful child: 24948
34.65/12.80	[ Invariant Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_j /\ 2 + main_i <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	[ Termination Graph ]
34.65/12.80	Strengthening and disabling transitions...
34.65/12.80	> It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i + main_j <= 0 /\ 1 + main_i = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	It's unfeasible. Removing transition: 
34.65/12.80	<l2, l2, 1 + main_j <= 0 /\ 2 + main_i <= 0 /\ 2 + main_i + main_j <= 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_j /\ 2 + main_i <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	
34.65/12.80	LOG: CALL solverLinear in Graph for feasibility
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear in Graph for feasibility
34.65/12.80	Strengthening transition (result): 
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	New Graphs: 
34.65/12.80	Transitions:
34.65/12.80	<l2, l2, 1 <= main_j /\ 2 + main_i <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	<l2, l2, 1 <= main_i /\ 1 + main_j <= 0 /\ 1 + main_i + main_j = 0, {main_i -> main_j, main_j -> main_i, rest remain the same}>
34.65/12.80	Variables:
34.65/12.80	main_i, main_j
34.65/12.80	Checking conditional termination of SCC {l2}...
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.001291s
34.65/12.80	
34.65/12.80	LOG: CALL solveLinear
34.65/12.80	
34.65/12.80	LOG: RETURN solveLinear - Elapsed time: 0.009628s
34.65/12.80	[24895 : 24953]
34.65/12.80	[24895 : 24954]
34.65/12.80	Solving with 1 template(s).
34.65/12.80	
34.65/12.80	LOG: CALL solveNonLinearGetFirstSolution
34.65/12.80	
34.65/12.80	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013328s
34.65/12.80	Time used: 0.012596
34.65/12.80	
34.65/12.80	[24895 : 24958]
34.65/12.80	[24895 : 24962]
34.65/12.80	Successful child: 24962
34.65/12.80	
34.65/12.80	Program does NOT terminate
34.65/12.80	EOF