1.38/0.55	YES
1.38/0.55	
1.38/0.55	Solver Timeout: 4
1.38/0.55	Global Timeout: 300
1.38/0.55	Maximum number of concurrent processes: 900
1.38/0.55	*******************************************************************************************
1.38/0.55	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
1.38/0.55	*******************************************************************************************
1.38/0.55	
1.38/0.55	
1.38/0.55	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
1.38/0.55	
1.38/0.55	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.38/0.55	+                                                                  +
1.38/0.55	Init Location: 0
1.38/0.55	Transitions:
1.38/0.55	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_k -> ¿functionCall(__VERIFIER_nondet_int), main_an -> ¿functionCall(__VERIFIER_nondet_int), main_bn -> ¿functionCall(__VERIFIER_nondet_int), main_tk -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l1, l2, true>
1.38/0.55	<l2, l4, not((main_an >= main_i))>
1.38/0.55	<l2, l3, (main_an >= main_i)>
1.38/0.55	<l3, l8, (main_bn >= main_j)>
1.38/0.55	<l3, l4, not((main_bn >= main_j))>
1.38/0.55	<l4, l6, not((main_an >= main_i))>
1.38/0.55	<l4, l5, (main_an >= main_i)>
1.38/0.55	<l5, l8, (main_bn <= main_j)>
1.38/0.55	<l5, l6, not((main_bn <= main_j))>
1.38/0.55	<l6, l7, (main_an <= main_i)>
1.38/0.55	<l6, l28, not((main_an <= main_i))>
1.38/0.55	<l7, l28, not((main_bn >= main_j))>
1.38/0.55	<l7, l8, (main_bn >= main_j)>
1.38/0.55	<l8, l28, not((main_k >= (main_tk + 1)))>
1.38/0.55	<l8, l9, (main_k >= (main_tk + 1))>
1.38/0.55	<l9, l17, not((main_an >= main_i))>
1.38/0.55	<l9, l10, (main_an >= main_i)>
1.38/0.55	<l10, l11, (main_bn >= main_j)>
1.38/0.55	<l10, l17, not((main_bn >= main_j))>
1.38/0.55	<l11, l12, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
1.38/0.55	<l11, l14, (¿functionCall(__VERIFIER_nondet_int) = 0)>
1.38/0.55	<l12, l13, true, seq{main_j -> (main_j + main_k), main_tk -> main_k, main_k -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l13, l16, true>
1.38/0.55	<l14, l15, true, seq{main_i -> (main_i + 1)}>
1.38/0.55	<l15, l16, true>
1.38/0.55	<l16, l27, true>
1.38/0.55	<l17, l21, not((main_an >= main_i))>
1.38/0.55	<l17, l18, (main_an >= main_i)>
1.38/0.55	<l18, l19, (main_bn <= main_j)>
1.38/0.55	<l18, l21, not((main_bn <= main_j))>
1.38/0.55	<l19, l20, true, seq{main_i -> (main_i + 1)}>
1.38/0.55	<l20, l26, true>
1.38/0.55	<l21, l25, not((main_an <= main_i))>
1.38/0.55	<l21, l22, (main_an <= main_i)>
1.38/0.55	<l22, l23, (main_bn >= main_j)>
1.38/0.55	<l22, l25, not((main_bn >= main_j))>
1.38/0.55	<l23, l24, true, seq{main_j -> (main_j + main_k), main_tk -> main_k, main_k -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l24, l25, true>
1.38/0.55	<l25, l26, true>
1.38/0.55	<l26, l27, true>
1.38/0.55	<l27, l2, true>
1.38/0.55	<l28, l29, true, seq{main__func_return_ -> 0}>
1.38/0.55	
1.38/0.55	Fresh variables:
1.38/0.55	
1.38/0.55	Undef variables:
1.38/0.55	
1.38/0.55	Abstraction variables:
1.38/0.55	
1.38/0.55	Exit nodes:
1.38/0.55	
1.38/0.55	Accepting locations:
1.38/0.55	
1.38/0.55	Asserts:
1.38/0.55	
1.38/0.55	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
1.38/0.55	       
1.38/0.55	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
1.38/0.55	       
1.38/0.55	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
1.38/0.55	
1.38/0.55	Init Location: 0
1.38/0.55	Transitions:
1.38/0.55	<l0, l30, true, seq{main__func_return_ -> 0}>
1.38/0.55	<l30, l31, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l31, l32, true, seq{main_i -> varCall_1}>
1.38/0.55	<l32, l33, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l33, l34, true, seq{main_j -> varCall_2}>
1.38/0.55	<l34, l35, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l35, l36, true, seq{main_k -> varCall_3}>
1.38/0.55	<l36, l37, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l37, l38, true, seq{main_an -> varCall_4}>
1.38/0.55	<l38, l39, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l39, l40, true, seq{main_bn -> varCall_5}>
1.38/0.55	<l40, l41, true, seq{varCall_6 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.55	<l41, l1, true, seq{main_tk -> varCall_6}>
1.38/0.55	<l1, l2, true>
1.38/0.55	<l2, l3, (main_an >= main_i)>
1.38/0.55	<l2, l4, not((main_an >= main_i))>
1.38/0.55	<l3, l8, (main_bn >= main_j)>
1.38/0.55	<l3, l4, not((main_bn >= main_j))>
1.38/0.55	<l4, l5, (main_an >= main_i)>
1.38/0.55	<l4, l6, not((main_an >= main_i))>
1.38/0.55	<l5, l8, (main_bn <= main_j)>
1.38/0.55	<l5, l6, not((main_bn <= main_j))>
1.38/0.55	<l6, l7, (main_an <= main_i)>
1.38/0.55	<l6, l28, not((main_an <= main_i))>
1.38/0.55	<l7, l8, (main_bn >= main_j)>
1.38/0.55	<l7, l28, not((main_bn >= main_j))>
1.38/0.55	<l8, l9, (main_k >= (main_tk + 1))>
1.38/0.55	<l8, l28, not((main_k >= (main_tk + 1)))>
1.38/0.55	<l9, l10, (main_an >= main_i)>
1.38/0.55	<l9, l17, not((main_an >= main_i))>
1.38/0.56	<l10, l11, (main_bn >= main_j)>
1.38/0.56	<l10, l17, not((main_bn >= main_j))>
1.38/0.56	<l11, l42, true, seq{varCall_7 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.56	<l42, l14, (varCall_7 = 0)>
1.38/0.56	<l42, l12, (varCall_7 = 1)>
1.38/0.56	<l12, l43, true, seq{main_j -> (main_j + main_k), main_tk -> main_k}>
1.38/0.56	<l43, l44, true, seq{varCall_8 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.56	<l44, l13, true, seq{main_k -> varCall_8}>
1.38/0.56	<l13, l16, true>
1.38/0.56	<l14, l15, true, seq{main_i -> (main_i + 1)}>
1.38/0.56	<l15, l16, true>
1.38/0.56	<l16, l27, true>
1.38/0.56	<l17, l18, (main_an >= main_i)>
1.38/0.56	<l17, l21, not((main_an >= main_i))>
1.38/0.56	<l18, l19, (main_bn <= main_j)>
1.38/0.56	<l18, l21, not((main_bn <= main_j))>
1.38/0.56	<l19, l20, true, seq{main_i -> (main_i + 1)}>
1.38/0.56	<l20, l26, true>
1.38/0.56	<l21, l22, (main_an <= main_i)>
1.38/0.56	<l21, l25, not((main_an <= main_i))>
1.38/0.56	<l22, l23, (main_bn >= main_j)>
1.38/0.56	<l22, l25, not((main_bn >= main_j))>
1.38/0.56	<l23, l45, true, seq{main_j -> (main_j + main_k), main_tk -> main_k}>
1.38/0.56	<l45, l46, true, seq{varCall_9 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.38/0.56	<l46, l24, true, seq{main_k -> varCall_9}>
1.38/0.56	<l24, l25, true>
1.38/0.56	<l25, l26, true>
1.38/0.56	<l26, l27, true>
1.38/0.56	<l27, l2, true>
1.38/0.56	<l28, l29, true, seq{main__func_return_ -> 0}>
1.38/0.56	
1.38/0.56	Fresh variables:
1.38/0.56	
1.38/0.56	Undef variables:
1.38/0.56	
1.38/0.56	Abstraction variables:
1.38/0.56	
1.38/0.56	Exit nodes:
1.38/0.56	29, 
1.38/0.56	Accepting locations:
1.38/0.56	
1.38/0.56	Asserts:
1.38/0.56	
1.38/0.56	+                                                                  +
1.38/0.56	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.38/0.56	
1.38/0.56	
1.38/0.56	Function Return and Parameters Information [2 functions]:
1.38/0.56	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
1.38/0.56	        __VERIFIER_nondet_int__func_return_      [function result] : int
1.38/0.56	    function name: main [1 return + 0 parameters]        demangled: main
1.38/0.56	        main__func_return_      [function result] : int
1.38/0.56	
1.38/0.56	
1.38/0.56	AST Ident Scanner Information [8 idents]:
1.38/0.56	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6> <line: 17, col: 6> <line: 18, col: 7> <line: 19, col: 7> <line: 20, col: 7> <line: 23, col: 8> <line: 26, col: 9> <line: 35, col: 8>
1.38/0.56	main | function | [integer, ()] | <line: 13, col: 1>
1.38/0.56	i | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 21, col: 17> <line: 21, col: 41> <line: 21, col: 65> <line: 22, col: 13> <line: 28, col: 5> <line: 28, col: 9> <line: 30, col: 21> <line: 31, col: 4> <line: 31, col: 8> <line: 32, col: 21>
1.38/0.56	j | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 21, col: 28> <line: 21, col: 52> <line: 21, col: 76> <line: 22, col: 24> <line: 24, col: 5> <line: 24, col: 9> <line: 30, col: 32> <line: 32, col: 32> <line: 33, col: 4> <line: 33, col: 8>
1.38/0.56	k | local variable | integer | <line: 14, col: 5> | <line: 17, col: 2> <line: 21, col: 83> <line: 24, col: 13> <line: 25, col: 10> <line: 26, col: 5> <line: 33, col: 12> <line: 34, col: 9> <line: 35, col: 4>
1.38/0.56	an | local variable | integer | <line: 14, col: 5> | <line: 18, col: 2> <line: 21, col: 11> <line: 21, col: 35> <line: 21, col: 59> <line: 22, col: 7> <line: 30, col: 15> <line: 32, col: 15>
1.38/0.56	bn | local variable | integer | <line: 14, col: 5> | <line: 19, col: 2> <line: 21, col: 22> <line: 21, col: 46> <line: 21, col: 70> <line: 22, col: 18> <line: 30, col: 26> <line: 32, col: 26>
1.38/0.56	tk | local variable | integer | <line: 14, col: 5> | <line: 20, col: 2> <line: 21, col: 88> <line: 25, col: 5> <line: 34, col: 4>
1.38/0.56	
1.38/0.56	Main function: main
1.38/0.56	Preprocessed LLVMGraph
1.38/0.56	Init Location: 0
1.38/0.56	Transitions:
1.38/0.56	<l0, l2, (main_i = undef10) /\ (main_j = undef11) /\ (main_k = undef12) /\ (main_an = undef13) /\ (main_bn = undef14) /\ (main_tk = undef15)>
1.38/0.56	<l2, l2, (main_an >= main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef16 = 0), par{main_i -> (main_i + 1)}>
1.38/0.56	<l2, l2, (main_an >= main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef16 = 1), par{main_j -> (main_j + main_k), main_k -> undef17, main_tk -> main_k}>
1.38/0.56	<l2, l29, (main_an >= main_i) /\ (main_bn >= main_j) /\ not((main_k >= (main_tk + 1)))>
1.38/0.56	<l2, l2, (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j), par{main_i -> (main_i + 1)}>
1.38/0.56	<l2, l29, (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ not((main_k >= (main_tk + 1)))>
1.38/0.56	<l2, l2, not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j), par{main_j -> (main_j + main_k), main_k -> undef18, main_tk -> main_k}>
1.38/0.56	<l2, l29, not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ not((main_k >= (main_tk + 1)))>
1.38/0.56	<l2, l29, not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ not((main_bn >= main_j))>
1.38/0.56	
1.38/0.56	Fresh variables:
1.38/0.56	undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
1.38/0.56	
1.38/0.56	Undef variables:
1.38/0.56	undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
1.38/0.56	
1.38/0.56	Abstraction variables:
1.38/0.56	
1.38/0.56	Exit nodes:
1.38/0.56	29, 
1.38/0.56	Accepting locations:
1.38/0.56	
1.38/0.56	Asserts:
1.38/0.56	
1.38/0.56	*************************************************************
1.38/0.56	*******************************************************************************************
1.38/0.56	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.38/0.56	*******************************************************************************************
1.38/0.56	
1.38/0.56	Init Location: 0
1.38/0.56	Graph 0:
1.38/0.56	Transitions:
1.38/0.56	Variables:
1.38/0.56	
1.38/0.56	Graph 1:
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	
1.38/0.56	Graph 2:
1.38/0.56	Transitions:
1.38/0.56	Variables:
1.38/0.56	
1.38/0.56	Precedence: 
1.38/0.56	Graph 0
1.38/0.56	
1.38/0.56	Graph 1
1.38/0.56	<l0, l2, main_i = undef10 /\ main_j = undef11 /\ main_k = undef12 /\ main_an = undef13 /\ main_bn = undef14 /\ main_tk = undef15, {all remain the same}>
1.38/0.56	
1.38/0.56	Graph 2
1.38/0.56	<l2, l29, main_i <= main_an /\ main_j <= main_bn /\ main_k <= main_tk, {all remain the same}>
1.38/0.56	<l2, l29, main_i <= main_an /\ main_k <= main_tk /\ 1 + main_bn <= main_j, {all remain the same}>
1.38/0.56	<l2, l29, main_j <= main_bn /\ main_k <= main_tk /\ 1 + main_an <= main_i, {all remain the same}>
1.38/0.56	<l2, l29, 1 + main_an <= main_i /\ 1 + main_bn <= main_j, {all remain the same}>
1.38/0.56	
1.38/0.56	Map Locations to Subgraph:
1.38/0.56	( 0 , 0 )
1.38/0.56	( 2 , 1 )
1.38/0.56	( 29 , 2 )
1.38/0.56	
1.38/0.56	*******************************************************************************************
1.38/0.56	********************************    CHECKING ASSERTIONS    ********************************
1.38/0.56	*******************************************************************************************
1.38/0.56	
1.38/0.56	Proving termination of subgraph 0
1.38/0.56	Proving termination of subgraph 1
1.38/0.56	Checking unfeasibility...
1.38/0.56	Time used: 0.018838
1.38/0.56	
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.005121s
1.38/0.56	Ranking function: -main_i + main_an
1.38/0.56	New Graphs: 
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.001682s
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.008507s
1.38/0.56	[12262 : 12264]
1.38/0.56	[12262 : 12265]
1.38/0.56	Successful child: 12264
1.38/0.56	[ Invariant Graph ]
1.38/0.56	Strengthening and disabling transitions...
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	[ Termination Graph ]
1.38/0.56	Strengthening and disabling transitions...
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	It's unfeasible. Removing transition: 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	New Graphs: 
1.38/0.56	
1.38/0.56	LOG: CALL check - Post:main_k <= main_tk - Process 1
1.38/0.56	* Exit transition: <l0, l2, main_i = undef10 /\ main_j = undef11 /\ main_k = undef12 /\ main_an = undef13 /\ main_bn = undef14 /\ main_tk = undef15, {all remain the same}>
1.38/0.56	* Postcondition  : main_k <= main_tk
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.001020s
1.38/0.56	> Postcondition is not implied!
1.38/0.56	
1.38/0.56	LOG: RETURN check - Elapsed time: 0.001159s
1.38/0.56	INVARIANTS: 
1.38/0.56	2: 
1.38/0.56	Quasi-INVARIANTS to narrow Graph: 
1.38/0.56	2: main_k <= main_tk , 
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	invGraph after Narrowing: 
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.004382s
1.38/0.56	Ranking function: -main_i + main_an
1.38/0.56	New Graphs: 
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.001714s
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.008875s
1.38/0.56	[12262 : 12269]
1.38/0.56	[12262 : 12270]
1.38/0.56	Successful child: 12269
1.38/0.56	[ Invariant Graph ]
1.38/0.56	Strengthening and disabling transitions...
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 0 <= main_tk /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 0 <= main_tk /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_i <= main_an /\ 0 <= main_tk /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 0 <= main_tk /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	[ Termination Graph ]
1.38/0.56	Strengthening and disabling transitions...
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 0 <= main_tk /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: CALL solverLinear in Graph for feasibility
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear in Graph for feasibility
1.38/0.56	Strengthening transition (result): 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 0 <= main_tk /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Ranking function: -main_j + main_bn
1.38/0.56	New Graphs: 
1.38/0.56	
1.38/0.56	LOG: CALL check - Post:0 <= main_tk - Process 2
1.38/0.56	* Exit transition: <l0, l2, 1 + main_tk <= main_k /\ main_i = undef10 /\ main_j = undef11 /\ main_k = undef12 /\ main_an = undef13 /\ main_bn = undef14 /\ main_tk = undef15, {all remain the same}>
1.38/0.56	* Postcondition  : 0 <= main_tk
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.000942s
1.38/0.56	> Postcondition is not implied!
1.38/0.56	
1.38/0.56	LOG: RETURN check - Elapsed time: 0.001076s
1.38/0.56	INVARIANTS: 
1.38/0.56	2: 
1.38/0.56	Quasi-INVARIANTS to narrow Graph: 
1.38/0.56	2: 0 <= main_tk , 
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	Narrowing transition: 
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	
1.38/0.56	LOG: Narrow transition size 1
1.38/0.56	invGraph after Narrowing: 
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0 /\ undef16 = 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0 /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0, {main_i -> 1 + main_i, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.003856s
1.38/0.56	Ranking function: -main_i + main_an
1.38/0.56	New Graphs: 
1.38/0.56	Transitions:
1.38/0.56	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0 /\ undef16 = 1, {main_j -> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}>
1.38/0.56	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i /\ 1 + main_tk <= main_k /\ 1 + main_tk <= 0, {main_j -> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}>
1.38/0.56	Variables:
1.38/0.56	main_i, main_j, main_k, main_an, main_bn, main_tk
1.38/0.56	Checking conditional termination of SCC {l2}...
1.38/0.56	
1.38/0.56	LOG: CALL solveLinear
1.38/0.56	
1.38/0.56	LOG: RETURN solveLinear - Elapsed time: 0.002155s
1.38/0.56	Ranking function: -main_tk
1.38/0.56	New Graphs: 
1.38/0.56	Proving termination of subgraph 2
1.38/0.56	Analyzing SCC {l29}...
1.38/0.56	No cycles found.
1.38/0.56	
1.38/0.56	Program Terminates
1.38/0.56	EOF