0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_an -> ¿functionCall(__VERIFIER_nondet_int), main_bn -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l4, not((main_an >= main_i))>
0.00/0.06	<l2, l3, (main_an >= main_i)>
0.00/0.06	<l3, l8, (main_bn >= main_j)>
0.00/0.06	<l3, l4, not((main_bn >= main_j))>
0.00/0.06	<l4, l6, not((main_an >= main_i))>
0.00/0.06	<l4, l5, (main_an >= main_i)>
0.00/0.06	<l5, l8, (main_bn <= main_j)>
0.00/0.06	<l5, l6, not((main_bn <= main_j))>
0.00/0.06	<l6, l27, not((main_an <= main_i))>
0.00/0.06	<l6, l7, (main_an <= main_i)>
0.00/0.06	<l7, l8, (main_bn >= main_j)>
0.00/0.06	<l7, l27, not((main_bn >= main_j))>
0.00/0.06	<l8, l16, not((main_an >= main_i))>
0.00/0.06	<l8, l9, (main_an >= main_i)>
0.00/0.06	<l9, l10, (main_bn >= main_j)>
0.00/0.06	<l9, l16, not((main_bn >= main_j))>
0.00/0.06	<l10, l11, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.06	<l10, l13, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.06	<l11, l12, true, seq{main_j -> (main_j + 1)}>
0.00/0.06	<l12, l15, true>
0.00/0.06	<l13, l14, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l14, l15, true>
0.00/0.06	<l15, l26, true>
0.00/0.06	<l16, l20, not((main_an >= main_i))>
0.00/0.06	<l16, l17, (main_an >= main_i)>
0.00/0.06	<l17, l18, (main_bn <= main_j)>
0.00/0.06	<l17, l20, not((main_bn <= main_j))>
0.00/0.06	<l18, l19, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l19, l25, true>
0.00/0.06	<l20, l24, not((main_an <= main_i))>
0.00/0.06	<l20, l21, (main_an <= main_i)>
0.00/0.06	<l21, l22, (main_bn >= main_j)>
0.00/0.06	<l21, l24, not((main_bn >= main_j))>
0.00/0.06	<l22, l23, true, seq{main_j -> (main_j + 1)}>
0.00/0.06	<l23, l24, true>
0.00/0.06	<l24, l25, true>
0.00/0.06	<l25, l26, true>
0.00/0.06	<l26, l2, true>
0.00/0.06	<l27, l28, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l29, true, seq{main__func_return_ -> 0}>
0.00/0.06	<l29, l30, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l30, l31, true, seq{main_i -> varCall_1}>
0.00/0.06	<l31, l32, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l32, l33, true, seq{main_j -> varCall_2}>
0.00/0.06	<l33, l34, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l34, l35, true, seq{main_an -> varCall_3}>
0.00/0.06	<l35, l36, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l36, l1, true, seq{main_bn -> varCall_4}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_an >= main_i)>
0.00/0.06	<l2, l4, not((main_an >= main_i))>
0.00/0.07	<l3, l8, (main_bn >= main_j)>
0.00/0.07	<l3, l4, not((main_bn >= main_j))>
0.00/0.07	<l4, l5, (main_an >= main_i)>
0.00/0.07	<l4, l6, not((main_an >= main_i))>
0.00/0.07	<l5, l8, (main_bn <= main_j)>
0.00/0.07	<l5, l6, not((main_bn <= main_j))>
0.00/0.07	<l6, l7, (main_an <= main_i)>
0.00/0.07	<l6, l27, not((main_an <= main_i))>
0.00/0.07	<l7, l8, (main_bn >= main_j)>
0.00/0.07	<l7, l27, not((main_bn >= main_j))>
0.00/0.07	<l8, l9, (main_an >= main_i)>
0.00/0.07	<l8, l16, not((main_an >= main_i))>
0.00/0.07	<l9, l10, (main_bn >= main_j)>
0.00/0.07	<l9, l16, not((main_bn >= main_j))>
0.00/0.07	<l10, l37, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l37, l13, (varCall_5 = 0)>
0.00/0.07	<l37, l11, (varCall_5 = 1)>
0.00/0.07	<l11, l12, true, seq{main_j -> (main_j + 1)}>
0.00/0.07	<l12, l15, true>
0.00/0.07	<l13, l14, true, seq{main_i -> (main_i + 1)}>
0.00/0.07	<l14, l15, true>
0.00/0.07	<l15, l26, true>
0.00/0.07	<l16, l17, (main_an >= main_i)>
0.00/0.07	<l16, l20, not((main_an >= main_i))>
0.00/0.07	<l17, l18, (main_bn <= main_j)>
0.00/0.07	<l17, l20, not((main_bn <= main_j))>
0.00/0.07	<l18, l19, true, seq{main_i -> (main_i + 1)}>
0.00/0.07	<l19, l25, true>
0.00/0.07	<l20, l21, (main_an <= main_i)>
0.00/0.07	<l20, l24, not((main_an <= main_i))>
0.00/0.07	<l21, l22, (main_bn >= main_j)>
0.00/0.07	<l21, l24, not((main_bn >= main_j))>
0.00/0.07	<l22, l23, true, seq{main_j -> (main_j + 1)}>
0.00/0.07	<l23, l24, true>
0.00/0.07	<l24, l25, true>
0.00/0.07	<l25, l26, true>
0.00/0.07	<l26, l2, true>
0.00/0.07	<l27, l28, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	28, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+                                                                  +
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	
0.00/0.07	Function Return and Parameters Information [2 functions]:
0.00/0.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.07	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.07	        main__func_return_      [function result] : int
0.00/0.07	
0.00/0.07	
0.00/0.07	AST Ident Scanner Information [6 idents]:
0.00/0.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6> <line: 17, col: 7> <line: 18, col: 7> <line: 21, col: 8>
0.00/0.07	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.07	i | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 19, col: 16> <line: 19, col: 40> <line: 19, col: 64> <line: 20, col: 13> <line: 24, col: 5> <line: 24, col: 9> <line: 26, col: 21> <line: 27, col: 4> <line: 27, col: 8> <line: 28, col: 21>
0.00/0.07	j | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 19, col: 27> <line: 19, col: 51> <line: 19, col: 75> <line: 20, col: 24> <line: 22, col: 5> <line: 22, col: 9> <line: 26, col: 32> <line: 28, col: 32> <line: 29, col: 4> <line: 29, col: 8>
0.00/0.07	an | local variable | integer | <line: 14, col: 5> | <line: 17, col: 2> <line: 19, col: 10> <line: 19, col: 34> <line: 19, col: 58> <line: 20, col: 7> <line: 26, col: 15> <line: 28, col: 15>
0.00/0.07	bn | local variable | integer | <line: 14, col: 5> | <line: 18, col: 2> <line: 19, col: 21> <line: 19, col: 45> <line: 19, col: 69> <line: 20, col: 18> <line: 26, col: 26> <line: 28, col: 26>
0.00/0.07	
0.00/0.07	Main function: main
0.00/0.07	Preprocessed LLVMGraph
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l2, (main_i = undef6) /\ (main_j = undef7) /\ (main_an = undef8) /\ (main_bn = undef9)>
0.00/0.07	<l2, l2, (main_an >= main_i) /\ (main_bn >= main_j) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef10 = 0), par{main_i -> (main_i + 1)}>
0.00/0.07	<l2, l2, (main_an >= main_i) /\ (main_bn >= main_j) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef10 = 1), par{main_j -> (main_j + 1)}>
0.00/0.07	<l2, l2, (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j), par{main_i -> (main_i + 1)}>
0.00/0.07	<l2, l2, not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j), par{main_j -> (main_j + 1)}>
0.00/0.07	<l2, l28, not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ not((main_bn >= main_j))>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef6, undef7, undef8, undef9, undef10, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef6, undef7, undef8, undef9, undef10, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	28, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	*************************************************************
0.00/0.07	*******************************************************************************************
0.00/0.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Graph 0:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Graph 1:
0.00/0.07	Transitions:
0.00/0.07	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ undef10 = 0, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.07	<l2, l2, main_i <= main_an /\ main_j <= main_bn /\ undef10 = 1, {main_j -> 1 + main_j, rest remain the same}>
0.00/0.07	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.07	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i, {main_j -> 1 + main_j, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_i, main_j, main_an, main_bn
0.00/0.07	
0.00/0.07	Graph 2:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Precedence: 
0.00/0.07	Graph 0
0.00/0.07	
0.00/0.07	Graph 1
0.00/0.07	<l0, l2, main_i = undef6 /\ main_j = undef7 /\ main_an = undef8 /\ main_bn = undef9, {all remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l2, l28, 1 + main_an <= main_i /\ 1 + main_bn <= main_j, {all remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 2 , 1 )
0.00/0.07	( 28 , 2 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.013376
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l2}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.003279s
0.00/0.07	Ranking function: -2*main_i - main_j + 2*main_an + main_bn
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l2, l2, main_i <= main_an /\ 1 + main_bn <= main_j, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.07	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i, {main_j -> 1 + main_j, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_i, main_j, main_an, main_bn
0.00/0.07	Checking conditional termination of SCC {l2}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001959s
0.00/0.07	Ranking function: -2*main_i + 2*main_an
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l2, l2, main_j <= main_bn /\ 1 + main_an <= main_i, {main_j -> 1 + main_j, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_i, main_j, main_an, main_bn
0.00/0.07	Checking conditional termination of SCC {l2}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001092s
0.00/0.07	Ranking function: -main_j + main_bn
0.00/0.07	New Graphs: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Analyzing SCC {l28}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	EOF