46.66/21.01	NO
46.66/21.01	
46.66/21.01	Solver Timeout: 4
46.66/21.01	Global Timeout: 300
46.66/21.01	Maximum number of concurrent processes: 900
46.66/21.01	*******************************************************************************************
46.66/21.01	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
46.66/21.01	*******************************************************************************************
46.66/21.01	
46.66/21.01	
46.66/21.01	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
46.66/21.01	
46.66/21.01	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.66/21.01	+                                                                  +
46.66/21.01	Init Location: 0
46.66/21.01	Transitions:
46.66/21.01	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_c -> ¿functionCall(__VERIFIER_nondet_int)}>
46.66/21.01	<l1, l2, (main_c < 0)>
46.66/21.01	<l1, l7, not((main_c < 0))>
46.66/21.01	<l2, l3, true>
46.66/21.01	<l3, l6, not(((main_x + main_c) >= 0))>
46.66/21.01	<l3, l4, ((main_x + main_c) >= 0)>
46.66/21.01	<l4, l5, true, seq{main_x -> (main_x - main_c), main_c -> (main_c - 1)}>
46.66/21.01	<l5, l3, true>
46.66/21.01	<l6, l7, true>
46.66/21.01	<l7, l8, true, seq{main__func_return_ -> 0}>
46.66/21.01	
46.66/21.01	Fresh variables:
46.66/21.01	
46.66/21.01	Undef variables:
46.66/21.01	
46.66/21.01	Abstraction variables:
46.66/21.01	
46.66/21.01	Exit nodes:
46.66/21.01	
46.66/21.01	Accepting locations:
46.66/21.01	
46.66/21.01	Asserts:
46.66/21.01	
46.66/21.01	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
46.66/21.01	       
46.66/21.01	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
46.66/21.01	       
46.66/21.01	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
46.66/21.01	
46.66/21.01	Init Location: 0
46.66/21.01	Transitions:
46.66/21.01	<l0, l9, true, seq{main__func_return_ -> 0}>
46.66/21.01	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.66/21.01	<l10, l11, true, seq{main_x -> varCall_1}>
46.66/21.01	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.66/21.01	<l12, l1, true, seq{main_c -> varCall_2}>
46.66/21.01	<l1, l2, (main_c < 0)>
46.66/21.01	<l1, l7, not((main_c < 0))>
46.66/21.01	<l2, l3, true>
46.66/21.01	<l3, l4, ((main_x + main_c) >= 0)>
46.66/21.01	<l3, l6, not(((main_x + main_c) >= 0))>
46.66/21.01	<l4, l5, true, seq{main_x -> (main_x - main_c), main_c -> (main_c - 1)}>
46.66/21.01	<l5, l3, true>
46.66/21.01	<l6, l7, true>
46.66/21.01	<l7, l8, true, seq{main__func_return_ -> 0}>
46.66/21.01	
46.66/21.01	Fresh variables:
46.66/21.01	
46.66/21.01	Undef variables:
46.66/21.01	
46.66/21.01	Abstraction variables:
46.66/21.01	
46.66/21.01	Exit nodes:
46.66/21.01	8, 
46.66/21.01	Accepting locations:
46.66/21.01	
46.66/21.01	Asserts:
46.66/21.01	
46.66/21.01	+                                                                  +
46.66/21.01	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.66/21.01	
46.66/21.01	
46.66/21.01	Function Return and Parameters Information [2 functions]:
46.66/21.01	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
46.66/21.01	        __VERIFIER_nondet_int__func_return_      [function result] : int
46.66/21.01	    function name: main [1 return + 0 parameters]        demangled: main
46.66/21.01	        main__func_return_      [function result] : int
46.66/21.01	
46.66/21.01	
46.66/21.01	AST Ident Scanner Information [4 idents]:
46.66/21.01	__VERIFIER_nondet_int | function | [integer, ()] | <line: 9, col: 1> | <line: 15, col: 9> <line: 16, col: 9>
46.66/21.01	main | function | [integer, ()] | <line: 11, col: 1>
46.66/21.01	x | local variable | integer | <line: 13, col: 2> | <line: 15, col: 5> <line: 18, col: 13> <line: 19, col: 7> <line: 19, col: 11>
46.66/21.01	c | local variable | integer | <line: 14, col: 2> | <line: 16, col: 5> <line: 17, col: 6> <line: 18, col: 17> <line: 19, col: 15> <line: 20, col: 7> <line: 20, col: 11>
46.66/21.01	
46.66/21.01	Main function: main
46.66/21.01	Preprocessed LLVMGraph
46.66/21.01	Init Location: 0
46.66/21.01	Transitions:
46.66/21.01	<l0, l3, (main_x = undef3) /\ (main_c = undef4) /\ (undef4 < 0)>
46.66/21.01	<l0, l8, (main_x = undef3) /\ (main_c = undef4) /\ not((undef4 < 0))>
46.66/21.01	<l3, l3, ((main_x + main_c) >= 0), par{main_x -> (main_x - main_c), main_c -> (main_c - 1)}>
46.66/21.01	<l3, l8, not(((main_x + main_c) >= 0))>
46.66/21.01	
46.66/21.01	Fresh variables:
46.66/21.01	undef3, undef4, 
46.66/21.01	
46.66/21.01	Undef variables:
46.66/21.01	undef3, undef4, 
46.66/21.01	
46.66/21.01	Abstraction variables:
46.66/21.01	
46.66/21.01	Exit nodes:
46.66/21.01	8, 
46.66/21.01	Accepting locations:
46.66/21.01	
46.66/21.01	Asserts:
46.66/21.01	
46.66/21.01	*************************************************************
46.66/21.01	*******************************************************************************************
46.66/21.01	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
46.66/21.01	*******************************************************************************************
46.66/21.01	
46.66/21.01	Init Location: 0
46.66/21.01	Graph 0:
46.66/21.01	Transitions:
46.66/21.01	Variables:
46.66/21.01	
46.66/21.01	Graph 1:
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 0 <= main_x + main_c, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	
46.66/21.01	Graph 2:
46.66/21.01	Transitions:
46.66/21.01	Variables:
46.66/21.01	
46.66/21.01	Precedence: 
46.66/21.01	Graph 0
46.66/21.01	
46.66/21.01	Graph 1
46.66/21.01	<l0, l3, 1 + undef4 <= 0 /\ main_x = undef3 /\ main_c = undef4, {all remain the same}>
46.66/21.01	
46.66/21.01	Graph 2
46.66/21.01	<l0, l8, 0 <= undef4 /\ main_x = undef3 /\ main_c = undef4, {all remain the same}>
46.66/21.01	<l3, l8, 1 + main_x + main_c <= 0, {all remain the same}>
46.66/21.01	
46.66/21.01	Map Locations to Subgraph:
46.66/21.01	( 0 , 0 )
46.66/21.01	( 3 , 1 )
46.66/21.01	( 8 , 2 )
46.66/21.01	
46.66/21.01	*******************************************************************************************
46.66/21.01	********************************    CHECKING ASSERTIONS    ********************************
46.66/21.01	*******************************************************************************************
46.66/21.01	
46.66/21.01	Proving termination of subgraph 0
46.66/21.01	Proving termination of subgraph 1
46.66/21.01	Checking unfeasibility...
46.66/21.01	Time used: 0.002356
46.66/21.01	
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.001117s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.001858s
46.66/21.01	[18552 : 18554]
46.66/21.01	[18552 : 18555]
46.66/21.01	Successful child: 18554
46.66/21.01	[ Invariant Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	It's unfeasible. Removing transition: 
46.66/21.01	<l3, l3, 0 <= main_x + main_c, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	[ Termination Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	> It's unfeasible. Removing transition: 
46.66/21.01	<l3, l3, 0 <= main_x + main_c, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	New Graphs: 
46.66/21.01	
46.66/21.01	LOG: CALL check - Post:1 + main_x + main_c <= 0 - Process 1
46.66/21.01	* Exit transition: <l0, l3, 1 + undef4 <= 0 /\ main_x = undef3 /\ main_c = undef4, {all remain the same}>
46.66/21.01	* Postcondition  : 1 + main_x + main_c <= 0
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.000525s
46.66/21.01	> Postcondition is not implied!
46.66/21.01	
46.66/21.01	LOG: RETURN check - Elapsed time: 0.000633s
46.66/21.01	INVARIANTS: 
46.66/21.01	3: 
46.66/21.01	Quasi-INVARIANTS to narrow Graph: 
46.66/21.01	3: 1 + main_x + main_c <= 0 , 
46.66/21.01	Narrowing transition: 
46.66/21.01	<l3, l3, 0 <= main_x + main_c, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	
46.66/21.01	LOG: Narrow transition size 1
46.66/21.01	invGraph after Narrowing: 
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 0 <= main_x + main_c, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.001117s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.001954s
46.66/21.01	[18552 : 18559]
46.66/21.01	[18552 : 18560]
46.66/21.01	Solving with 1 template(s).
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetFirstSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008550s
46.66/21.01	Time used: 0.008191
46.66/21.01	Improving Solution with cost 1 ...
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetNextSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020047s
46.66/21.01	Time used: 0.02004
46.66/21.01	
46.66/21.01	LOG: SAT solveNonLinear - Elapsed time: 0.028596s
46.66/21.01	Cost: 1; Total time: 0.028231
46.66/21.01	Termination implied by a set of invariant(s):
46.66/21.01	Invariant at l3: main_c <= 0
46.66/21.01	[ Invariant Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	[ Termination Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Quasi-ranking function: 50000 - main_x + main_c
46.66/21.01	New Graphs: 
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ main_c <= 0 /\ 50001 + main_c <= main_x, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.000604s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.003164s
46.66/21.01	[18552 : 18564]
46.66/21.01	[18552 : 18565]
46.66/21.01	Solving with 1 template(s).
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetFirstSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008857s
46.66/21.01	Time used: 0.008404
46.66/21.01	Improving Solution with cost 1 ...
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetNextSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017638s
46.66/21.01	Time used: 0.017632
46.66/21.01	
46.66/21.01	LOG: SAT solveNonLinear - Elapsed time: 0.026495s
46.66/21.01	Cost: 1; Total time: 0.026036
46.66/21.01	Termination implied by a set of invariant(s):
46.66/21.01	Invariant at l3: main_c <= 1
46.66/21.01	[ Invariant Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	[ Termination Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ main_c <= 0 /\ 50001 + main_c <= main_x, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Quasi-ranking function: 50000 + main_c
46.66/21.01	New Graphs: 
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 0 <= main_x + main_c /\ 50001 + main_c <= main_x /\ 50001 + main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.000642s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.003106s
46.66/21.01	[18552 : 18569]
46.66/21.01	[18552 : 18570]
46.66/21.01	Solving with 1 template(s).
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetFirstSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009937s
46.66/21.01	Time used: 0.009416
46.66/21.01	Improving Solution with cost 1 ...
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetNextSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019055s
46.66/21.01	Time used: 0.019049
46.66/21.01	
46.66/21.01	LOG: SAT solveNonLinear - Elapsed time: 0.028992s
46.66/21.01	Cost: 1; Total time: 0.028465
46.66/21.01	Quasi-ranking function: 50000 - main_x - main_c
46.66/21.01	New Graphs: 
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 50001 + main_c <= main_x /\ 50001 <= main_x + main_c /\ 50001 + main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.000655s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.005858s
46.66/21.01	[18552 : 18575]
46.66/21.01	[18552 : 18576]
46.66/21.01	Solving with 1 template(s).
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetFirstSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011027s
46.66/21.01	Time used: 0.010483
46.66/21.01	Improving Solution with cost 1 ...
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetNextSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021279s
46.66/21.01	Time used: 0.021273
46.66/21.01	
46.66/21.01	LOG: SAT solveNonLinear - Elapsed time: 0.032307s
46.66/21.01	Cost: 1; Total time: 0.031756
46.66/21.01	Termination implied by a set of invariant(s):
46.66/21.01	Invariant at l3: main_c <= main_x
46.66/21.01	[ Invariant Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, main_c <= main_x /\ 0 <= main_x + main_c /\ main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	[ Termination Graph ]
46.66/21.01	Strengthening and disabling transitions...
46.66/21.01	
46.66/21.01	LOG: CALL solverLinear in Graph for feasibility
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear in Graph for feasibility
46.66/21.01	Strengthening transition (result): 
46.66/21.01	<l3, l3, 50001 + main_c <= main_x /\ 50001 <= main_x + main_c /\ 50001 + main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Quasi-ranking function: 50000 - main_x
46.66/21.01	New Graphs: 
46.66/21.01	Transitions:
46.66/21.01	<l3, l3, 50001 <= main_x /\ 50001 + main_c <= main_x /\ 50001 <= main_x + main_c /\ 50001 + main_c <= 0, {main_x -> main_x - main_c, main_c -> -1 + main_c, rest remain the same}>
46.66/21.01	Variables:
46.66/21.01	main_x, main_c
46.66/21.01	Checking conditional termination of SCC {l3}...
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.000726s
46.66/21.01	
46.66/21.01	LOG: CALL solveLinear
46.66/21.01	
46.66/21.01	LOG: RETURN solveLinear - Elapsed time: 0.003253s
46.66/21.01	[18552 : 18580]
46.66/21.01	[18552 : 18581]
46.66/21.01	Solving with 1 template(s).
46.66/21.01	
46.66/21.01	LOG: CALL solveNonLinearGetFirstSolution
46.66/21.01	
46.66/21.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011246s
46.66/21.01	Time used: 0.010896
46.66/21.01	
46.66/21.01	[18552 : 18585]
46.66/21.01	[18552 : 18589]
46.66/21.01	Successful child: 18585
46.66/21.01	
46.66/21.01	Program does NOT terminate
46.66/21.01	EOF