55.88/25.09	NO
55.88/25.09	
55.88/25.09	Solver Timeout: 4
55.88/25.09	Global Timeout: 300
55.88/25.09	Maximum number of concurrent processes: 900
55.88/25.09	*******************************************************************************************
55.88/25.09	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
55.88/25.09	*******************************************************************************************
55.88/25.09	
55.88/25.09	
55.88/25.09	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
55.88/25.09	
55.88/25.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
55.88/25.09	+                                                                  +
55.88/25.09	Init Location: 0
55.88/25.09	Transitions:
55.88/25.09	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}>
55.88/25.09	<l1, l2, true>
55.88/25.09	<l2, l3, (main_i < main_j)>
55.88/25.09	<l2, l5, not((main_i < main_j))>
55.88/25.09	<l3, l4, true, seq{main_i -> (main_i + 4)}>
55.88/25.09	<l4, l7, true>
55.88/25.09	<l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}>
55.88/25.09	<l6, l7, true>
55.88/25.09	<l7, l2, true>
55.88/25.09	
55.88/25.09	Fresh variables:
55.88/25.09	
55.88/25.09	Undef variables:
55.88/25.09	
55.88/25.09	Abstraction variables:
55.88/25.09	
55.88/25.09	Exit nodes:
55.88/25.09	
55.88/25.09	Accepting locations:
55.88/25.09	
55.88/25.09	Asserts:
55.88/25.09	
55.88/25.09	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
55.88/25.09	       
55.88/25.09	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
55.88/25.09	       
55.88/25.09	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
55.88/25.09	
55.88/25.09	Init Location: 0
55.88/25.09	Transitions:
55.88/25.09	<l0, l8, true, seq{main__func_return_ -> 0}>
55.88/25.09	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
55.88/25.09	<l9, l10, true, seq{main_i -> varCall_1}>
55.88/25.09	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
55.88/25.09	<l11, l1, true, seq{main_j -> varCall_2}>
55.88/25.09	<l1, l2, true>
55.88/25.09	<l2, l3, (main_i < main_j)>
55.88/25.09	<l2, l5, not((main_i < main_j))>
55.88/25.09	<l3, l4, true, seq{main_i -> (main_i + 4)}>
55.88/25.09	<l4, l7, true>
55.88/25.09	<l5, l6, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 2)}>
55.88/25.09	<l6, l7, true>
55.88/25.09	<l7, l2, true>
55.88/25.09	
55.88/25.09	Fresh variables:
55.88/25.09	
55.88/25.09	Undef variables:
55.88/25.09	
55.88/25.09	Abstraction variables:
55.88/25.09	
55.88/25.09	Exit nodes:
55.88/25.09	
55.88/25.09	Accepting locations:
55.88/25.09	
55.88/25.09	Asserts:
55.88/25.09	
55.88/25.09	+                                                                  +
55.88/25.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
55.88/25.09	
55.88/25.09	
55.88/25.09	Function Return and Parameters Information [2 functions]:
55.88/25.09	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
55.88/25.09	        __VERIFIER_nondet_int__func_return_      [function result] : int
55.88/25.09	    function name: main [1 return + 0 parameters]        demangled: main
55.88/25.09	        main__func_return_      [function result] : int
55.88/25.09	
55.88/25.09	
55.88/25.09	AST Ident Scanner Information [4 idents]:
55.88/25.09	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9> <line: 9, col: 9>
55.88/25.09	main | function | [integer, ()] | <line: 5, col: 1>
55.88/25.09	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 12, col: 13> <line: 13, col: 13> <line: 13, col: 17> <line: 16, col: 13> <line: 16, col: 17>
55.88/25.09	j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 17> <line: 15, col: 13> <line: 15, col: 17>
55.88/25.09	
55.88/25.09	Main function: main
55.88/25.09	Preprocessed LLVMGraph
55.88/25.09	Init Location: 0
55.88/25.09	Transitions:
55.88/25.09	<l0, l2, (main_i = undef3) /\ (main_j = undef4)>
55.88/25.09	<l2, l2, (main_i < main_j), par{main_i -> (main_i + 4)}>
55.88/25.09	<l2, l2, not((main_i < main_j)), par{main_i -> (main_i + 2), main_j -> (main_j + 1)}>
55.88/25.09	
55.88/25.09	Fresh variables:
55.88/25.09	undef3, undef4, 
55.88/25.09	
55.88/25.09	Undef variables:
55.88/25.09	undef3, undef4, 
55.88/25.09	
55.88/25.09	Abstraction variables:
55.88/25.09	
55.88/25.09	Exit nodes:
55.88/25.09	
55.88/25.09	Accepting locations:
55.88/25.09	
55.88/25.09	Asserts:
55.88/25.09	
55.88/25.09	*************************************************************
55.88/25.09	*******************************************************************************************
55.88/25.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
55.88/25.09	*******************************************************************************************
55.88/25.09	
55.88/25.09	Init Location: 0
55.88/25.09	Graph 0:
55.88/25.09	Transitions:
55.88/25.09	Variables:
55.88/25.09	
55.88/25.09	Graph 1:
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 1 + main_i <= main_j, {main_i -> 4 + main_i, rest remain the same}>
55.88/25.09	<l2, l2, main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	
55.88/25.09	Precedence: 
55.88/25.09	Graph 0
55.88/25.09	
55.88/25.09	Graph 1
55.88/25.09	<l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
55.88/25.09	
55.88/25.09	Map Locations to Subgraph:
55.88/25.09	( 0 , 0 )
55.88/25.09	( 2 , 1 )
55.88/25.09	
55.88/25.09	*******************************************************************************************
55.88/25.09	********************************    CHECKING ASSERTIONS    ********************************
55.88/25.09	*******************************************************************************************
55.88/25.09	
55.88/25.09	Proving termination of subgraph 0
55.88/25.09	Proving termination of subgraph 1
55.88/25.09	Checking unfeasibility...
55.88/25.09	Time used: 0.003856
55.88/25.09	
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000969s
55.88/25.09	Ranking function: -1 - 2*main_i + 2*main_j
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000428s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.001568s
55.88/25.09	[50469 : 50471]
55.88/25.09	[50469 : 50472]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011684s
55.88/25.09	Time used: 0.011337
55.88/25.09	Improving Solution with cost 1 ...
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetNextSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022045s
55.88/25.09	Time used: 0.022038
55.88/25.09	
55.88/25.09	LOG: SAT solveNonLinear - Elapsed time: 0.033728s
55.88/25.09	Cost: 1; Total time: 0.033375
55.88/25.09	Quasi-ranking function: 50000 - main_i + main_j
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 50001 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000477s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.001811s
55.88/25.09	[50469 : 50476]
55.88/25.09	[50469 : 50477]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012196s
55.88/25.09	Time used: 0.011704
55.88/25.09	Improving Solution with cost 1 ...
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetNextSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023055s
55.88/25.09	Time used: 0.023048
55.88/25.09	
55.88/25.09	LOG: SAT solveNonLinear - Elapsed time: 0.035251s
55.88/25.09	Cost: 1; Total time: 0.034752
55.88/25.09	Quasi-ranking function: 50000 - main_j
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000578s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.002298s
55.88/25.09	[50469 : 50481]
55.88/25.09	[50469 : 50482]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010359s
55.88/25.09	Time used: 0.009839
55.88/25.09	Improving Solution with cost 1 ...
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetNextSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022477s
55.88/25.09	Time used: 0.022469
55.88/25.09	
55.88/25.09	LOG: SAT solveNonLinear - Elapsed time: 0.032836s
55.88/25.09	Cost: 1; Total time: 0.032308
55.88/25.09	Quasi-ranking function: 50000 - main_i
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000645s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.003174s
55.88/25.09	[50469 : 50486]
55.88/25.09	[50469 : 50487]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010696s
55.88/25.09	Time used: 0.010181
55.88/25.09	Improving Solution with cost 1 ...
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetNextSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028079s
55.88/25.09	Time used: 0.027894
55.88/25.09	
55.88/25.09	LOG: SAT solveNonLinear - Elapsed time: 0.038774s
55.88/25.09	Cost: 1; Total time: 0.038075
55.88/25.09	Quasi-ranking function: 50000 + main_i - 3*main_j
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 50001 + main_i <= 3*main_j /\ 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000741s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.003335s
55.88/25.09	[50469 : 50491]
55.88/25.09	[50469 : 50492]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011190s
55.88/25.09	Time used: 0.010553
55.88/25.09	Improving Solution with cost 1 ...
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetNextSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019381s
55.88/25.09	Time used: 0.019374
55.88/25.09	
55.88/25.09	LOG: SAT solveNonLinear - Elapsed time: 0.030571s
55.88/25.09	Cost: 1; Total time: 0.029927
55.88/25.09	Quasi-ranking function: 50000 - main_i - main_j
55.88/25.09	New Graphs: 
55.88/25.09	Transitions:
55.88/25.09	<l2, l2, 50001 + main_i <= 3*main_j /\ 50001 <= main_i /\ 50001 + main_j <= main_i /\ 50001 <= main_i + main_j /\ 50001 <= main_j, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
55.88/25.09	Variables:
55.88/25.09	main_i, main_j
55.88/25.09	Checking conditional termination of SCC {l2}...
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.000831s
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.003466s
55.88/25.09	[50469 : 50496]
55.88/25.09	[50469 : 50497]
55.88/25.09	Solving with 1 template(s).
55.88/25.09	
55.88/25.09	LOG: CALL solveNonLinearGetFirstSolution
55.88/25.09	
55.88/25.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011891s
55.88/25.09	Time used: 0.011319
55.88/25.09	Termination failed. Trying to show unreachability...
55.88/25.09	Proving unreachability of entry: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
55.88/25.09	
55.88/25.09	LOG: CALL check - Post:1 <= 0 - Process 1
55.88/25.09	* Exit transition: <l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
55.88/25.09	* Postcondition  : 1 <= 0
55.88/25.09	
55.88/25.09	LOG: CALL solveLinear
55.88/25.09	
55.88/25.09	LOG: RETURN solveLinear - Elapsed time: 0.001105s
55.88/25.09	> Postcondition is not implied!
55.88/25.09	
55.88/25.09	LOG: RETURN check - Elapsed time: 0.001193s
55.88/25.09	Cannot prove unreachability
55.88/25.09	
55.88/25.09	[50469 : 50653]
55.88/25.09	[50469 : 50654]
55.88/25.09	Successful child: 50653
55.88/25.09	
55.88/25.09	Program does NOT terminate
55.88/25.09	EOF