0.00/0.09	YES
0.00/0.09	
0.00/0.09	Solver Timeout: 4
0.00/0.09	Global Timeout: 300
0.00/0.09	Maximum number of concurrent processes: 900
0.00/0.09	*******************************************************************************************
0.00/0.09	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	
0.00/0.09	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.09	
0.00/0.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.09	+                                                                  +
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l1, true, seq{main__func_return_ -> 0, main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l1, l2, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.09	<l1, l4, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.09	<l2, l3, true, seq{main_x -> 1}>
0.00/0.09	<l3, l6, true>
0.00/0.09	<l4, l5, true, seq{main_x -> ~(1)}>
0.00/0.09	<l5, l6, true>
0.00/0.09	<l6, l7, true>
0.00/0.09	<l7, l11, not((main_y < 100))>
0.00/0.09	<l7, l8, (main_y < 100)>
0.00/0.09	<l8, l11, not((main_z < 100))>
0.00/0.09	<l8, l9, (main_z < 100)>
0.00/0.09	<l9, l10, true, seq{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
0.00/0.09	<l10, l7, true>
0.00/0.09	<l11, l12, true, seq{main__func_return_ -> 0}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.09	       
0.00/0.09	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.09	       
0.00/0.09	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l13, true, seq{main__func_return_ -> 0}>
0.00/0.09	<l13, l14, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l14, l15, true, seq{main_y -> varCall_1}>
0.00/0.09	<l15, l16, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l16, l1, true, seq{main_z -> varCall_2}>
0.00/0.09	<l1, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l17, l4, (varCall_3 = 0)>
0.00/0.09	<l17, l2, (varCall_3 = 1)>
0.00/0.09	<l2, l3, true, seq{main_x -> 1}>
0.00/0.09	<l3, l6, true>
0.00/0.09	<l4, l5, true, seq{main_x -> ~(1)}>
0.00/0.09	<l5, l6, true>
0.00/0.09	<l6, l7, true>
0.00/0.09	<l7, l8, (main_y < 100)>
0.00/0.09	<l7, l11, not((main_y < 100))>
0.00/0.09	<l8, l9, (main_z < 100)>
0.00/0.09	<l8, l11, not((main_z < 100))>
0.00/0.09	<l9, l10, true, seq{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
0.00/0.09	<l10, l7, true>
0.00/0.09	<l11, l12, true, seq{main__func_return_ -> 0}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	12, 
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	+                                                                  +
0.00/0.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.09	
0.00/0.09	
0.00/0.09	Function Return and Parameters Information [2 functions]:
0.00/0.09	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.09	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.09	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.09	        main__func_return_      [function result] : int
0.00/0.09	
0.00/0.09	
0.00/0.09	AST Ident Scanner Information [5 idents]:
0.00/0.09	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 17, col: 6> <line: 18, col: 6> <line: 19, col: 9>
0.00/0.09	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.09	x | local variable | integer | <line: 14, col: 5> | <line: 20, col: 9> <line: 22, col: 9> <line: 25, col: 15> <line: 26, col: 15>
0.00/0.09	y | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 24, col: 12> <line: 25, col: 9> <line: 25, col: 13>
0.00/0.09	z | local variable | integer | <line: 16, col: 2> | <line: 18, col: 2> <line: 24, col: 21> <line: 26, col: 9> <line: 26, col: 13>
0.00/0.09	
0.00/0.09	Main function: main
0.00/0.09	Preprocessed LLVMGraph
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l7, (main_y = undef4) /\ (main_z = undef5) /\ (undef6 = 0), par{main_x -> ~(1)}>
0.00/0.09	<l0, l7, (main_y = undef4) /\ (main_z = undef5) /\ (undef6 = 1), par{main_x -> 1}>
0.00/0.09	<l7, l7, (main_y < 100) /\ (main_z < 100), par{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
0.00/0.09	<l7, l12, (main_y < 100) /\ not((main_z < 100))>
0.00/0.09	<l7, l12, not((main_y < 100))>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef4, undef5, undef6, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef4, undef5, undef6, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	12, 
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	*************************************************************
0.00/0.09	*******************************************************************************************
0.00/0.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Graph 0:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Graph 1:
0.00/0.09	Transitions:
0.00/0.09	<l7, l7, main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y, main_z
0.00/0.09	
0.00/0.09	Graph 2:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Precedence: 
0.00/0.09	Graph 0
0.00/0.09	
0.00/0.09	Graph 1
0.00/0.09	<l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 0, {main_x -> -1, rest remain the same}>
0.00/0.09	<l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 1, {main_x -> 1, rest remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l7, l12, 100 <= main_z /\ main_y <= 99, {all remain the same}>
0.00/0.09	<l7, l12, 100 <= main_y, {all remain the same}>
0.00/0.09	
0.00/0.09	Map Locations to Subgraph:
0.00/0.09	( 0 , 0 )
0.00/0.09	( 7 , 1 )
0.00/0.09	( 12 , 2 )
0.00/0.09	
0.00/0.09	*******************************************************************************************
0.00/0.09	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Proving termination of subgraph 0
0.00/0.09	Proving termination of subgraph 1
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.00252
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l7}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000616s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.001945s
0.00/0.09	[13186 : 13188]
0.00/0.09	[13186 : 13189]
0.00/0.09	Successful child: 13188
0.00/0.09	[ Invariant Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l7, l7, 1 <= main_x /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	[ Termination Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l7, l7, 1 <= main_x /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	Ranking function: 99 - main_y
0.00/0.09	New Graphs: 
0.00/0.09	
0.00/0.09	LOG: CALL check - Post:1 <= main_x - Process 1
0.00/0.09	* Exit transition: <l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 0, {main_x -> -1, rest remain the same}>
0.00/0.09	* Postcondition  : 1 <= main_x
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000528s
0.00/0.09	> Postcondition is not implied!
0.00/0.09	
0.00/0.09	LOG: RETURN check - Elapsed time: 0.000626s
0.00/0.09	INVARIANTS: 
0.00/0.09	7: 
0.00/0.09	Quasi-INVARIANTS to narrow Graph: 
0.00/0.09	7: 1 <= main_x , 
0.00/0.09	Narrowing transition: 
0.00/0.09	<l7, l7, main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	
0.00/0.09	LOG: Narrow transition size 1
0.00/0.09	invGraph after Narrowing: 
0.00/0.09	Transitions:
0.00/0.09	<l7, l7, main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y, main_z
0.00/0.09	Checking conditional termination of SCC {l7}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000676s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.002418s
0.00/0.09	[13186 : 13193]
0.00/0.09	[13186 : 13194]
0.00/0.09	Successful child: 13193
0.00/0.09	[ Invariant Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l7, l7, 1 + main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	[ Termination Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l7, l7, 1 + main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
0.00/0.09	Ranking function: 197 - main_z
0.00/0.09	New Graphs: 
0.00/0.09	INVARIANTS: 
0.00/0.09	7: 1 + main_x <= 0 , 
0.00/0.09	Quasi-INVARIANTS to narrow Graph: 
0.00/0.09	7: 
0.00/0.09	Proving termination of subgraph 2
0.00/0.09	Analyzing SCC {l12}...
0.00/0.09	No cycles found.
0.00/0.09	
0.00/0.09	Program Terminates
0.00/0.09	EOF