5.38/4.32	NO
5.38/4.32	
5.38/4.32	Solver Timeout: 4
5.38/4.32	Global Timeout: 300
5.38/4.32	Maximum number of concurrent processes: 900
5.38/4.32	*******************************************************************************************
5.38/4.32	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
5.38/4.32	*******************************************************************************************
5.38/4.32	
5.38/4.32	
5.38/4.32	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
5.38/4.32	
5.38/4.32	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.38/4.32	+                                                                  +
5.38/4.32	Init Location: 0
5.38/4.32	Transitions:
5.38/4.32	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
5.38/4.32	<l1, l2, true>
5.38/4.32	<l2, l9, not((main_x >= 0))>
5.38/4.32	<l2, l3, (main_x >= 0)>
5.38/4.32	<l3, l4, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
5.38/4.32	<l3, l6, (¿functionCall(__VERIFIER_nondet_int) = 0)>
5.38/4.32	<l4, l5, true, seq{main_x -> (main_x - 1)}>
5.38/4.32	<l5, l8, true>
5.38/4.32	<l6, l7, true, seq{main_x -> (main_x + 1)}>
5.38/4.32	<l7, l8, true>
5.38/4.32	<l8, l2, true>
5.38/4.32	<l9, l10, true, seq{main__func_return_ -> 0}>
5.38/4.33	
5.38/4.33	Fresh variables:
5.38/4.33	
5.38/4.33	Undef variables:
5.38/4.33	
5.38/4.33	Abstraction variables:
5.38/4.33	
5.38/4.33	Exit nodes:
5.38/4.33	
5.38/4.33	Accepting locations:
5.38/4.33	
5.38/4.33	Asserts:
5.38/4.33	
5.38/4.33	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
5.38/4.33	       
5.38/4.33	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
5.38/4.33	       
5.38/4.33	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
5.38/4.33	
5.38/4.33	Init Location: 0
5.38/4.33	Transitions:
5.38/4.33	<l0, l11, true, seq{main__func_return_ -> 0}>
5.38/4.33	<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.38/4.33	<l12, l1, true, seq{main_x -> varCall_1}>
5.38/4.33	<l1, l2, true>
5.38/4.33	<l2, l3, (main_x >= 0)>
5.38/4.33	<l2, l9, not((main_x >= 0))>
5.38/4.33	<l3, l13, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.38/4.33	<l13, l6, (varCall_2 = 0)>
5.38/4.33	<l13, l4, (varCall_2 = 1)>
5.38/4.33	<l4, l5, true, seq{main_x -> (main_x - 1)}>
5.38/4.33	<l5, l8, true>
5.38/4.33	<l6, l7, true, seq{main_x -> (main_x + 1)}>
5.38/4.33	<l7, l8, true>
5.38/4.33	<l8, l2, true>
5.38/4.33	<l9, l10, true, seq{main__func_return_ -> 0}>
5.38/4.33	
5.38/4.33	Fresh variables:
5.38/4.33	
5.38/4.33	Undef variables:
5.38/4.33	
5.38/4.33	Abstraction variables:
5.38/4.33	
5.38/4.33	Exit nodes:
5.38/4.33	10, 
5.38/4.33	Accepting locations:
5.38/4.33	
5.38/4.33	Asserts:
5.38/4.33	
5.38/4.33	+                                                                  +
5.38/4.33	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.38/4.33	
5.38/4.33	
5.38/4.33	Function Return and Parameters Information [2 functions]:
5.38/4.33	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
5.38/4.33	        __VERIFIER_nondet_int__func_return_      [function result] : int
5.38/4.33	    function name: main [1 return + 0 parameters]        demangled: main
5.38/4.33	        main__func_return_      [function result] : int
5.38/4.33	
5.38/4.33	
5.38/4.33	AST Ident Scanner Information [3 idents]:
5.38/4.33	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 13, col: 9> <line: 15, col: 7>
5.38/4.33	main | function | [integer, ()] | <line: 10, col: 1>
5.38/4.33	x | local variable | integer | <line: 12, col: 2> | <line: 13, col: 5> <line: 14, col: 9> <line: 16, col: 4> <line: 16, col: 8> <line: 18, col: 4> <line: 18, col: 8>
5.38/4.33	
5.38/4.33	Main function: main
5.38/4.33	Preprocessed LLVMGraph
5.38/4.33	Init Location: 0
5.38/4.33	Transitions:
5.38/4.33	<l0, l2, (main_x = undef3)>
5.38/4.33	<l2, l2, (main_x >= 0) /\ (undef4 = 0), par{main_x -> (main_x + 1)}>
5.38/4.33	<l2, l2, (main_x >= 0) /\ (undef4 = 1), par{main_x -> (main_x - 1)}>
5.38/4.33	<l2, l10, not((main_x >= 0))>
5.38/4.33	
5.38/4.33	Fresh variables:
5.38/4.33	undef3, undef4, 
5.38/4.33	
5.38/4.33	Undef variables:
5.38/4.33	undef3, undef4, 
5.38/4.33	
5.38/4.33	Abstraction variables:
5.38/4.33	
5.38/4.33	Exit nodes:
5.38/4.33	10, 
5.38/4.33	Accepting locations:
5.38/4.33	
5.38/4.33	Asserts:
5.38/4.33	
5.38/4.33	*************************************************************
5.38/4.33	*******************************************************************************************
5.38/4.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.38/4.33	*******************************************************************************************
5.38/4.33	
5.38/4.33	Init Location: 0
5.38/4.33	Graph 0:
5.38/4.33	Transitions:
5.38/4.33	Variables:
5.38/4.33	
5.38/4.33	Graph 1:
5.38/4.33	Transitions:
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 0, {main_x -> 1 + main_x, rest remain the same}>
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 1, {main_x -> -1 + main_x, rest remain the same}>
5.38/4.33	Variables:
5.38/4.33	main_x
5.38/4.33	
5.38/4.33	Graph 2:
5.38/4.33	Transitions:
5.38/4.33	Variables:
5.38/4.33	
5.38/4.33	Precedence: 
5.38/4.33	Graph 0
5.38/4.33	
5.38/4.33	Graph 1
5.38/4.33	<l0, l2, main_x = undef3, {all remain the same}>
5.38/4.33	
5.38/4.33	Graph 2
5.38/4.33	<l2, l10, 1 + main_x <= 0, {all remain the same}>
5.38/4.33	
5.38/4.33	Map Locations to Subgraph:
5.38/4.33	( 0 , 0 )
5.38/4.33	( 2 , 1 )
5.38/4.33	( 10 , 2 )
5.38/4.33	
5.38/4.33	*******************************************************************************************
5.38/4.33	********************************    CHECKING ASSERTIONS    ********************************
5.38/4.33	*******************************************************************************************
5.38/4.33	
5.38/4.33	Proving termination of subgraph 0
5.38/4.33	Proving termination of subgraph 1
5.38/4.33	Checking unfeasibility...
5.38/4.33	Time used: 0.002385
5.38/4.33	
5.38/4.33	Checking conditional termination of SCC {l2}...
5.38/4.33	
5.38/4.33	LOG: CALL solveLinear
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear - Elapsed time: 0.001191s
5.38/4.33	
5.38/4.33	LOG: CALL solveLinear
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear - Elapsed time: 0.003504s
5.38/4.33	[55261 : 55263]
5.38/4.33	[55261 : 55264]
5.38/4.33	Successful child: 55263
5.38/4.33	[ Invariant Graph ]
5.38/4.33	Strengthening and disabling transitions...
5.38/4.33	
5.38/4.33	LOG: CALL solverLinear in Graph for feasibility
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear in Graph for feasibility
5.38/4.33	It's unfeasible. Removing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 0, {main_x -> 1 + main_x, rest remain the same}>
5.38/4.33	
5.38/4.33	LOG: CALL solverLinear in Graph for feasibility
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear in Graph for feasibility
5.38/4.33	It's unfeasible. Removing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 1, {main_x -> -1 + main_x, rest remain the same}>
5.38/4.33	[ Termination Graph ]
5.38/4.33	Strengthening and disabling transitions...
5.38/4.33	> It's unfeasible. Removing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 0, {main_x -> 1 + main_x, rest remain the same}>
5.38/4.33	
5.38/4.33	LOG: CALL solverLinear in Graph for feasibility
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear in Graph for feasibility
5.38/4.33	It's unfeasible. Removing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 1, {main_x -> -1 + main_x, rest remain the same}>
5.38/4.33	New Graphs: 
5.38/4.33	
5.38/4.33	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
5.38/4.33	* Exit transition: <l0, l2, main_x = undef3, {all remain the same}>
5.38/4.33	* Postcondition  : 1 + main_x <= 0
5.38/4.33	
5.38/4.33	LOG: CALL solveLinear
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear - Elapsed time: 0.000373s
5.38/4.33	> Postcondition is not implied!
5.38/4.33	
5.38/4.33	LOG: RETURN check - Elapsed time: 0.000459s
5.38/4.33	INVARIANTS: 
5.38/4.33	2: 
5.38/4.33	Quasi-INVARIANTS to narrow Graph: 
5.38/4.33	2: 1 + main_x <= 0 , 
5.38/4.33	Narrowing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 0, {main_x -> 1 + main_x, rest remain the same}>
5.38/4.33	
5.38/4.33	LOG: Narrow transition size 1
5.38/4.33	Narrowing transition: 
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 1, {main_x -> -1 + main_x, rest remain the same}>
5.38/4.33	
5.38/4.33	LOG: Narrow transition size 1
5.38/4.33	invGraph after Narrowing: 
5.38/4.33	Transitions:
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 0, {main_x -> 1 + main_x, rest remain the same}>
5.38/4.33	<l2, l2, 0 <= main_x /\ undef4 = 1, {main_x -> -1 + main_x, rest remain the same}>
5.38/4.33	Variables:
5.38/4.33	main_x
5.38/4.33	Checking conditional termination of SCC {l2}...
5.38/4.33	
5.38/4.33	LOG: CALL solveLinear
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear - Elapsed time: 0.001190s
5.38/4.33	
5.38/4.33	LOG: CALL solveLinear
5.38/4.33	
5.38/4.33	LOG: RETURN solveLinear - Elapsed time: 0.003674s
5.38/4.33	[55261 : 55268]
5.38/4.33	[55261 : 55269]
5.38/4.33	Solving with 1 template(s).
5.38/4.33	
5.38/4.33	LOG: CALL solveNonLinearGetFirstSolution
5.38/4.33	
5.38/4.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010907s
5.38/4.33	Time used: 0.010506
5.38/4.33	
5.38/4.33	[55261 : 55273]
5.38/4.33	[55261 : 55277]
5.38/4.33	Successful child: 55277
5.38/4.33	
5.38/4.33	Program does NOT terminate
5.38/4.33	EOF