18.63/8.37	NO
18.63/8.37	
18.63/8.37	Solver Timeout: 4
18.63/8.37	Global Timeout: 300
18.63/8.37	Maximum number of concurrent processes: 900
18.63/8.37	*******************************************************************************************
18.63/8.37	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.63/8.37	*******************************************************************************************
18.63/8.37	
18.63/8.37	
18.63/8.37	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.63/8.37	
18.63/8.37	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.63/8.37	+                                                                  +
18.63/8.37	Init Location: 0
18.63/8.37	Transitions:
18.63/8.37	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
18.63/8.37	<l1, l2, (main_x > ¿functionCall(__VERIFIER_nondet_int))>
18.63/8.37	<l1, l7, not((main_x > ¿functionCall(__VERIFIER_nondet_int)))>
18.63/8.37	<l2, l3, true>
18.63/8.37	<l3, l6, (main_x = 0)>
18.63/8.37	<l3, l4, not((main_x = 0))>
18.63/8.37	<l4, l5, true, seq{main_x -> (main_x - 1)}>
18.63/8.37	<l5, l3, true>
18.63/8.37	<l6, l7, true>
18.63/8.37	<l7, l8, true, seq{main__func_return_ -> 0}>
18.63/8.37	
18.63/8.37	Fresh variables:
18.63/8.37	
18.63/8.37	Undef variables:
18.63/8.37	
18.63/8.37	Abstraction variables:
18.63/8.37	
18.63/8.37	Exit nodes:
18.63/8.37	
18.63/8.37	Accepting locations:
18.63/8.37	
18.63/8.37	Asserts:
18.63/8.37	
18.63/8.37	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.63/8.37	       
18.63/8.37	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.63/8.37	       
18.63/8.37	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.63/8.37	
18.63/8.37	Init Location: 0
18.63/8.37	Transitions:
18.63/8.37	<l0, l9, true, seq{main__func_return_ -> 0}>
18.63/8.37	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.63/8.37	<l10, l1, true, seq{main_x -> varCall_1}>
18.63/8.37	<l1, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.63/8.37	<l11, l2, (main_x > varCall_2)>
18.63/8.37	<l11, l7, not((main_x > varCall_2))>
18.63/8.37	<l2, l3, true>
18.63/8.37	<l3, l6, (main_x = 0)>
18.63/8.37	<l3, l4, not((main_x = 0))>
18.63/8.37	<l4, l5, true, seq{main_x -> (main_x - 1)}>
18.63/8.37	<l5, l3, true>
18.63/8.37	<l6, l7, true>
18.63/8.37	<l7, l8, true, seq{main__func_return_ -> 0}>
18.63/8.37	
18.63/8.37	Fresh variables:
18.63/8.37	
18.63/8.37	Undef variables:
18.63/8.37	
18.63/8.37	Abstraction variables:
18.63/8.37	
18.63/8.37	Exit nodes:
18.63/8.37	8, 
18.63/8.37	Accepting locations:
18.63/8.37	
18.63/8.37	Asserts:
18.63/8.37	
18.63/8.37	+                                                                  +
18.63/8.37	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.63/8.37	
18.63/8.37	
18.63/8.37	Function Return and Parameters Information [2 functions]:
18.63/8.37	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.63/8.37	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.63/8.37	    function name: main [1 return + 0 parameters]        demangled: main
18.63/8.37	        main__func_return_      [function result] : int
18.63/8.37	
18.63/8.37	
18.63/8.37	AST Ident Scanner Information [3 idents]:
18.63/8.37	__VERIFIER_nondet_int | function | [integer, ()] | <line: 9, col: 1> | <line: 14, col: 9> <line: 15, col: 10>
18.63/8.37	main | function | [integer, ()] | <line: 11, col: 1>
18.63/8.37	x | local variable | integer | <line: 13, col: 5> | <line: 14, col: 5> <line: 15, col: 6> <line: 16, col: 13> <line: 17, col: 7> <line: 17, col: 11>
18.63/8.37	
18.63/8.37	Main function: main
18.63/8.37	Preprocessed LLVMGraph
18.63/8.37	Init Location: 0
18.63/8.37	Transitions:
18.63/8.37	<l0, l3, (main_x = undef3) /\ (undef3 > undef4)>
18.63/8.37	<l0, l8, (main_x = undef3) /\ not((undef3 > undef4))>
18.63/8.37	<l3, l8, (main_x = 0)>
18.63/8.37	<l3, l3, (main_x < 0), par{main_x -> (main_x - 1)}>
18.63/8.37	<l3, l3, (main_x > 0), par{main_x -> (main_x - 1)}>
18.63/8.37	
18.63/8.37	Fresh variables:
18.63/8.37	undef3, undef4, 
18.63/8.37	
18.63/8.37	Undef variables:
18.63/8.37	undef3, undef4, 
18.63/8.37	
18.63/8.37	Abstraction variables:
18.63/8.37	
18.63/8.37	Exit nodes:
18.63/8.37	8, 
18.63/8.37	Accepting locations:
18.63/8.37	
18.63/8.37	Asserts:
18.63/8.37	
18.63/8.37	*************************************************************
18.63/8.37	*******************************************************************************************
18.63/8.37	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.63/8.37	*******************************************************************************************
18.63/8.37	
18.63/8.37	Init Location: 0
18.63/8.37	Graph 0:
18.63/8.37	Transitions:
18.63/8.37	Variables:
18.63/8.37	
18.63/8.37	Graph 1:
18.63/8.37	Transitions:
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	<l3, l3, 1 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	Variables:
18.63/8.37	main_x
18.63/8.37	
18.63/8.37	Graph 2:
18.63/8.37	Transitions:
18.63/8.37	Variables:
18.63/8.37	
18.63/8.37	Precedence: 
18.63/8.37	Graph 0
18.63/8.37	
18.63/8.37	Graph 1
18.63/8.37	<l0, l3, 1 + undef4 <= undef3 /\ main_x = undef3, {all remain the same}>
18.63/8.37	
18.63/8.37	Graph 2
18.63/8.37	<l0, l8, undef3 <= undef4 /\ main_x = undef3, {all remain the same}>
18.63/8.37	<l3, l8, main_x = 0, {all remain the same}>
18.63/8.37	
18.63/8.37	Map Locations to Subgraph:
18.63/8.37	( 0 , 0 )
18.63/8.37	( 3 , 1 )
18.63/8.37	( 8 , 2 )
18.63/8.37	
18.63/8.37	*******************************************************************************************
18.63/8.37	********************************    CHECKING ASSERTIONS    ********************************
18.63/8.37	*******************************************************************************************
18.63/8.37	
18.63/8.37	Proving termination of subgraph 0
18.63/8.37	Proving termination of subgraph 1
18.63/8.37	Checking unfeasibility...
18.63/8.37	Time used: 0.002469
18.63/8.37	
18.63/8.37	Checking conditional termination of SCC {l3}...
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.000768s
18.63/8.37	Ranking function: -1 + main_x
18.63/8.37	New Graphs: 
18.63/8.37	Transitions:
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	Variables:
18.63/8.37	main_x
18.63/8.37	Checking conditional termination of SCC {l3}...
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.000374s
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.001099s
18.63/8.37	[49207 : 49209]
18.63/8.37	[49207 : 49210]
18.63/8.37	Successful child: 49209
18.63/8.37	[ Invariant Graph ]
18.63/8.37	Strengthening and disabling transitions...
18.63/8.37	
18.63/8.37	LOG: CALL solverLinear in Graph for feasibility
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.37	It's unfeasible. Removing transition: 
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	
18.63/8.37	LOG: CALL solverLinear in Graph for feasibility
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.37	Strengthening transition (result): 
18.63/8.37	<l3, l3, 1 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	[ Termination Graph ]
18.63/8.37	Strengthening and disabling transitions...
18.63/8.37	
18.63/8.37	LOG: CALL solverLinear in Graph for feasibility
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.37	It's unfeasible. Removing transition: 
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	New Graphs: 
18.63/8.37	
18.63/8.37	LOG: CALL check - Post:0 <= main_x - Process 1
18.63/8.37	* Exit transition: <l0, l3, 1 + undef4 <= undef3 /\ main_x = undef3, {all remain the same}>
18.63/8.37	* Postcondition  : 0 <= main_x
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.000427s
18.63/8.37	> Postcondition is not implied!
18.63/8.37	
18.63/8.37	LOG: RETURN check - Elapsed time: 0.000509s
18.63/8.37	INVARIANTS: 
18.63/8.37	3: 
18.63/8.37	Quasi-INVARIANTS to narrow Graph: 
18.63/8.37	3: 0 <= main_x , 
18.63/8.37	Narrowing transition: 
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	
18.63/8.37	LOG: Narrow transition size 1
18.63/8.37	It's unfeasible. Removing transition: 
18.63/8.37	<l3, l3, 1 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	invGraph after Narrowing: 
18.63/8.37	Transitions:
18.63/8.37	<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	Variables:
18.63/8.37	main_x
18.63/8.37	Checking conditional termination of SCC {l3}...
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.000397s
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.001163s
18.63/8.37	[49207 : 49214]
18.63/8.37	[49207 : 49215]
18.63/8.37	Solving with 1 template(s).
18.63/8.37	
18.63/8.37	LOG: CALL solveNonLinearGetFirstSolution
18.63/8.37	
18.63/8.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004604s
18.63/8.37	Time used: 0.00431
18.63/8.37	Improving Solution with cost 1 ...
18.63/8.37	
18.63/8.37	LOG: CALL solveNonLinearGetNextSolution
18.63/8.37	
18.63/8.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014040s
18.63/8.37	Time used: 0.014036
18.63/8.37	
18.63/8.37	LOG: SAT solveNonLinear - Elapsed time: 0.018643s
18.63/8.37	Cost: 1; Total time: 0.018346
18.63/8.37	Quasi-ranking function: 50000 + main_x
18.63/8.37	New Graphs: 
18.63/8.37	Transitions:
18.63/8.37	<l3, l3, 50001 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
18.63/8.37	Variables:
18.63/8.37	main_x
18.63/8.37	Checking conditional termination of SCC {l3}...
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.000387s
18.63/8.37	
18.63/8.37	LOG: CALL solveLinear
18.63/8.37	
18.63/8.37	LOG: RETURN solveLinear - Elapsed time: 0.001160s
18.63/8.37	[49207 : 49219]
18.63/8.37	[49207 : 49220]
18.63/8.37	Solving with 1 template(s).
18.63/8.37	
18.63/8.37	LOG: CALL solveNonLinearGetFirstSolution
18.63/8.37	
18.63/8.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004503s
18.63/8.37	Time used: 0.004233
18.63/8.37	
18.63/8.37	[49207 : 49224]
18.63/8.37	[49207 : 49228]
18.63/8.37	Successful child: 49224
18.63/8.37	
18.63/8.37	Program does NOT terminate
18.63/8.37	EOF