1.58/1.64	YES
1.58/1.64	
1.58/1.64	Solver Timeout: 4
1.58/1.64	Global Timeout: 300
1.58/1.64	Maximum number of concurrent processes: 900
1.58/1.64	*******************************************************************************************
1.58/1.64	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
1.58/1.64	*******************************************************************************************
1.58/1.64	
1.58/1.64	
1.58/1.64	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
1.58/1.64	
1.58/1.64	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.58/1.64	+                                                                  +
1.58/1.64	Init Location: 0
1.58/1.64	Transitions:
1.58/1.64	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}>
1.58/1.64	<l1, l2, true>
1.58/1.64	<l2, l19, not((main_a < 30))>
1.58/1.64	<l2, l3, (main_a < 30)>
1.58/1.64	<l3, l4, true>
1.58/1.64	<l4, l17, not((main_b < main_a))>
1.58/1.64	<l4, l5, (main_b < main_a)>
1.58/1.64	<l5, l6, (main_b > 5)>
1.58/1.64	<l5, l8, not((main_b > 5))>
1.58/1.64	<l6, l7, true, seq{main_b -> (main_b + 7)}>
1.58/1.64	<l7, l10, true>
1.58/1.64	<l8, l9, true, seq{main_b -> (main_b + 2)}>
1.58/1.64	<l9, l10, true>
1.58/1.64	<l10, l14, not((main_b >= 10))>
1.58/1.64	<l10, l11, (main_b >= 10)>
1.58/1.64	<l11, l12, (main_b <= 12)>
1.58/1.64	<l11, l14, not((main_b <= 12))>
1.58/1.64	<l12, l13, true, seq{main_a -> (main_a + 10)}>
1.58/1.64	<l13, l16, true>
1.58/1.64	<l14, l15, true, seq{main_a -> (main_a + 1)}>
1.58/1.64	<l15, l16, true>
1.58/1.64	<l16, l4, true>
1.58/1.64	<l17, l18, true, seq{main_a -> (main_a + 2), main_b -> (main_b - 10)}>
1.58/1.64	<l18, l2, true>
1.58/1.64	<l19, l20, true, seq{main__func_return_ -> 0}>
1.58/1.64	
1.58/1.64	Fresh variables:
1.58/1.64	
1.58/1.64	Undef variables:
1.58/1.64	
1.58/1.64	Abstraction variables:
1.58/1.64	
1.58/1.64	Exit nodes:
1.58/1.64	
1.58/1.64	Accepting locations:
1.58/1.64	
1.58/1.64	Asserts:
1.58/1.64	
1.58/1.64	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
1.58/1.64	       
1.58/1.64	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
1.58/1.64	       
1.58/1.64	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
1.58/1.64	
1.58/1.64	Init Location: 0
1.58/1.64	Transitions:
1.58/1.64	<l0, l21, true, seq{main__func_return_ -> 0}>
1.58/1.64	<l21, l22, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.58/1.64	<l22, l23, true, seq{main_a -> varCall_1}>
1.58/1.64	<l23, l24, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
1.58/1.64	<l24, l1, true, seq{main_b -> varCall_2}>
1.58/1.64	<l1, l2, true>
1.58/1.64	<l2, l3, (main_a < 30)>
1.58/1.64	<l2, l19, not((main_a < 30))>
1.58/1.64	<l3, l4, true>
1.58/1.64	<l4, l5, (main_b < main_a)>
1.58/1.64	<l4, l17, not((main_b < main_a))>
1.58/1.64	<l5, l6, (main_b > 5)>
1.58/1.64	<l5, l8, not((main_b > 5))>
1.58/1.64	<l6, l7, true, seq{main_b -> (main_b + 7)}>
1.58/1.64	<l7, l10, true>
1.58/1.64	<l8, l9, true, seq{main_b -> (main_b + 2)}>
1.58/1.64	<l9, l10, true>
1.58/1.64	<l10, l11, (main_b >= 10)>
1.58/1.64	<l10, l14, not((main_b >= 10))>
1.58/1.64	<l11, l12, (main_b <= 12)>
1.58/1.64	<l11, l14, not((main_b <= 12))>
1.58/1.64	<l12, l13, true, seq{main_a -> (main_a + 10)}>
1.58/1.64	<l13, l16, true>
1.58/1.64	<l14, l15, true, seq{main_a -> (main_a + 1)}>
1.58/1.64	<l15, l16, true>
1.58/1.64	<l16, l4, true>
1.58/1.64	<l17, l18, true, seq{main_a -> (main_a + 2), main_b -> (main_b - 10)}>
1.58/1.64	<l18, l2, true>
1.58/1.64	<l19, l20, true, seq{main__func_return_ -> 0}>
1.58/1.64	
1.58/1.64	Fresh variables:
1.58/1.64	
1.58/1.64	Undef variables:
1.58/1.64	
1.58/1.64	Abstraction variables:
1.58/1.64	
1.58/1.64	Exit nodes:
1.58/1.64	20, 
1.58/1.64	Accepting locations:
1.58/1.64	
1.58/1.64	Asserts:
1.58/1.64	
1.58/1.64	+                                                                  +
1.58/1.64	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
1.58/1.64	
1.58/1.64	
1.58/1.64	Function Return and Parameters Information [2 functions]:
1.58/1.64	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
1.58/1.64	        __VERIFIER_nondet_int__func_return_      [function result] : int
1.58/1.64	    function name: main [1 return + 0 parameters]        demangled: main
1.58/1.64	        main__func_return_      [function result] : int
1.58/1.64	
1.58/1.64	
1.58/1.64	AST Ident Scanner Information [4 idents]:
1.58/1.64	__VERIFIER_nondet_int | function | [integer, ()] | <line: 10, col: 1> | <line: 14, col: 6> <line: 15, col: 6>
1.58/1.64	main | function | [integer, ()] | <line: 12, col: 1>
1.58/1.64	a | local variable | integer | <line: 13, col: 5> | <line: 14, col: 2> <line: 16, col: 9> <line: 17, col: 14> <line: 24, col: 5> <line: 24, col: 9> <line: 26, col: 5> <line: 26, col: 9> <line: 29, col: 3> <line: 29, col: 7>
1.58/1.64	b | local variable | integer | <line: 13, col: 5> | <line: 15, col: 2> <line: 17, col: 10> <line: 18, col: 8> <line: 19, col: 5> <line: 19, col: 9> <line: 21, col: 5> <line: 21, col: 9> <line: 23, col: 8> <line: 23, col: 19> <line: 30, col: 3> <line: 30, col: 7>
1.58/1.64	
1.58/1.64	Main function: main
1.58/1.64	Preprocessed LLVMGraph
1.58/1.64	Init Location: 0
1.58/1.64	Transitions:
1.58/1.64	<l0, l4, (main_a = undef3) /\ (main_b = undef4) /\ (undef3 < 30)>
1.58/1.64	<l0, l20, (main_a = undef3) /\ (main_b = undef4) /\ not((undef3 < 30))>
1.58/1.64	<l4, l4, (main_b < main_a) /\ (main_b > 5) /\ ((main_b + 7) >= 10) /\ not(((main_b + 7) <= 12)), par{main_a -> (main_a + 1), main_b -> (main_b + 7)}>
1.58/1.64	<l4, l4, (main_b < main_a) /\ not((main_b > 5)) /\ not(((main_b + 2) >= 10)), par{main_a -> (main_a + 1), main_b -> (main_b + 2)}>
1.58/1.64	<l4, l4, not((main_b < main_a)) /\ ((main_a + 2) < 30), par{main_a -> (main_a + 2), main_b -> (main_b - 10)}>
1.58/1.64	<l4, l20, not((main_b < main_a)) /\ not(((main_a + 2) < 30)), par{main_a -> (main_a + 2), main_b -> (main_b - 10)}>
1.58/1.64	
1.58/1.64	Fresh variables:
1.58/1.64	undef3, undef4, 
1.58/1.64	
1.58/1.64	Undef variables:
1.58/1.64	undef3, undef4, 
1.58/1.64	
1.58/1.64	Abstraction variables:
1.58/1.64	
1.58/1.64	Exit nodes:
1.58/1.64	20, 
1.58/1.64	Accepting locations:
1.58/1.64	
1.58/1.64	Asserts:
1.58/1.64	
1.58/1.64	*************************************************************
1.58/1.64	*******************************************************************************************
1.58/1.64	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.58/1.64	*******************************************************************************************
1.58/1.64	
1.58/1.64	Init Location: 0
1.58/1.64	Graph 0:
1.58/1.64	Transitions:
1.58/1.64	Variables:
1.58/1.64	
1.58/1.64	Graph 1:
1.58/1.64	Transitions:
1.58/1.64	<l4, l4, 1 + main_b <= main_a /\ 6 <= main_b, {main_a -> 1 + main_a, main_b -> 7 + main_b, rest remain the same}>
1.58/1.64	<l4, l4, 1 + main_b <= main_a /\ main_b <= 5, {main_a -> 1 + main_a, main_b -> 2 + main_b, rest remain the same}>
1.58/1.64	<l4, l4, main_a <= main_b /\ main_a <= 27, {main_a -> 2 + main_a, main_b -> -10 + main_b, rest remain the same}>
1.58/1.64	Variables:
1.58/1.64	main_a, main_b
1.58/1.64	
1.58/1.64	Graph 2:
1.58/1.64	Transitions:
1.58/1.64	Variables:
1.58/1.64	
1.58/1.64	Precedence: 
1.58/1.64	Graph 0
1.58/1.64	
1.58/1.64	Graph 1
1.58/1.64	<l0, l4, undef3 <= 29 /\ main_a = undef3 /\ main_b = undef4, {all remain the same}>
1.58/1.64	
1.58/1.64	Graph 2
1.58/1.64	<l0, l20, 30 <= undef3 /\ main_a = undef3 /\ main_b = undef4, {all remain the same}>
1.58/1.64	<l4, l20, main_a <= main_b /\ 28 <= main_a, {main_a -> 2 + main_a, main_b -> -10 + main_b, rest remain the same}>
1.58/1.64	
1.58/1.64	Map Locations to Subgraph:
1.58/1.64	( 0 , 0 )
1.58/1.64	( 4 , 1 )
1.58/1.64	( 20 , 2 )
1.58/1.64	
1.58/1.64	*******************************************************************************************
1.58/1.64	********************************    CHECKING ASSERTIONS    ********************************
1.58/1.64	*******************************************************************************************
1.58/1.64	
1.58/1.64	Proving termination of subgraph 0
1.58/1.64	Proving termination of subgraph 1
1.58/1.64	Checking unfeasibility...
1.58/1.64	Time used: 1.54263
1.58/1.64	
1.58/1.64	Checking conditional termination of SCC {l4}...
1.58/1.64	
1.58/1.64	LOG: CALL solveLinear
1.58/1.64	
1.58/1.64	LOG: RETURN solveLinear - Elapsed time: 0.037561s
1.58/1.64	Ranking function: 27 - main_a
1.58/1.64	New Graphs: 
1.58/1.64	Transitions:
1.58/1.64	<l4, l4, 1 + main_b <= main_a /\ 6 <= main_b, {main_a -> 1 + main_a, main_b -> 7 + main_b, rest remain the same}>
1.58/1.64	<l4, l4, 1 + main_b <= main_a /\ main_b <= 5, {main_a -> 1 + main_a, main_b -> 2 + main_b, rest remain the same}>
1.58/1.64	Variables:
1.58/1.64	main_a, main_b
1.58/1.64	Checking conditional termination of SCC {l4}...
1.58/1.64	
1.58/1.64	LOG: CALL solveLinear
1.58/1.64	
1.58/1.64	LOG: RETURN solveLinear - Elapsed time: 0.001118s
1.58/1.64	Ranking function: -96 + 24*main_a - 12*main_b
1.58/1.64	New Graphs: 
1.58/1.64	Transitions:
1.58/1.64	<l4, l4, 1 + main_b <= main_a /\ main_b <= 5, {main_a -> 1 + main_a, main_b -> 2 + main_b, rest remain the same}>
1.58/1.64	Variables:
1.58/1.64	main_a, main_b
1.58/1.64	Checking conditional termination of SCC {l4}...
1.58/1.64	
1.58/1.64	LOG: CALL solveLinear
1.58/1.64	
1.58/1.64	LOG: RETURN solveLinear - Elapsed time: 0.000682s
1.58/1.64	Ranking function: -1 + main_a - main_b
1.58/1.64	New Graphs: 
1.58/1.64	Proving termination of subgraph 2
1.58/1.64	Analyzing SCC {l20}...
1.58/1.64	No cycles found.
1.58/1.64	
1.58/1.64	Program Terminates
1.58/1.65	EOF