6.85/4.94	NO
6.85/4.94	
6.85/4.94	Solver Timeout: 4
6.85/4.94	Global Timeout: 300
6.85/4.94	Maximum number of concurrent processes: 900
6.85/4.94	*******************************************************************************************
6.85/4.94	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
6.85/4.94	*******************************************************************************************
6.85/4.94	
6.85/4.94	
6.85/4.94	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
6.85/4.94	
6.85/4.94	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
6.85/4.94	+                                                                  +
6.85/4.94	Init Location: 0
6.85/4.94	Transitions:
6.85/4.94	<l0, l1, true, seq{main__func_return_ -> 0, main_choose -> 2, main_life -> 13, main_death -> 17}>
6.85/4.94	<l1, l2, true>
6.85/4.94	<l2, l9, not((main_life < main_death))>
6.85/4.94	<l2, l3, (main_life < main_death)>
6.85/4.94	<l3, l4, true, seq{main_temp -> main_death, main_death -> (main_life + 1), main_life -> main_temp}>
6.85/4.94	<l4, l6, (main_choose < main_life)>
6.85/4.94	<l4, l5, not((main_choose < main_life))>
6.85/4.94	<l5, l6, (main_choose < main_death)>
6.85/4.94	<l5, l8, not((main_choose < main_death))>
6.85/4.94	<l6, l7, true, seq{main_life -> main_choose}>
6.85/4.94	<l7, l8, true>
6.85/4.94	<l8, l2, true>
6.85/4.94	<l9, l10, true, seq{main__func_return_ -> 0}>
6.85/4.94	
6.85/4.94	Fresh variables:
6.85/4.94	
6.85/4.94	Undef variables:
6.85/4.94	
6.85/4.94	Abstraction variables:
6.85/4.94	
6.85/4.94	Exit nodes:
6.85/4.94	
6.85/4.94	Accepting locations:
6.85/4.94	
6.85/4.94	Asserts:
6.85/4.94	
6.85/4.94	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
6.85/4.94	       
6.85/4.94	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
6.85/4.94	       
6.85/4.94	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
6.85/4.94	
6.85/4.94	Init Location: 0
6.85/4.94	Transitions:
6.85/4.94	<l0, l1, true, seq{main__func_return_ -> 0, main_choose -> 2, main_life -> 13, main_death -> 17}>
6.85/4.94	<l1, l2, true>
6.85/4.94	<l2, l3, (main_life < main_death)>
6.85/4.94	<l2, l9, not((main_life < main_death))>
6.85/4.94	<l3, l4, true, seq{main_temp -> main_death, main_death -> (main_life + 1), main_life -> main_temp}>
6.85/4.94	<l4, l6, (main_choose < main_life)>
6.85/4.94	<l4, l5, not((main_choose < main_life))>
6.85/4.94	<l5, l6, (main_choose < main_death)>
6.85/4.94	<l5, l8, not((main_choose < main_death))>
6.85/4.94	<l6, l7, true, seq{main_life -> main_choose}>
6.85/4.94	<l7, l8, true>
6.85/4.94	<l8, l2, true>
6.85/4.94	<l9, l10, true, seq{main__func_return_ -> 0}>
6.85/4.94	
6.85/4.94	Fresh variables:
6.85/4.94	
6.85/4.94	Undef variables:
6.85/4.94	
6.85/4.94	Abstraction variables:
6.85/4.94	
6.85/4.94	Exit nodes:
6.85/4.94	10, 
6.85/4.94	Accepting locations:
6.85/4.94	
6.85/4.94	Asserts:
6.85/4.94	
6.85/4.94	+                                                                  +
6.85/4.94	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
6.85/4.94	
6.85/4.94	
6.85/4.94	Function Return and Parameters Information [1 functions]:
6.85/4.94	    function name: main [1 return + 0 parameters]        demangled: main
6.85/4.94	        main__func_return_      [function result] : int
6.85/4.94	
6.85/4.94	
6.85/4.94	AST Ident Scanner Information [6 idents]:
6.85/4.94	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
6.85/4.94	main | function | [integer, ()] | <line: 5, col: 1>
6.85/4.94	choose | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 19, col: 13> <line: 19, col: 30> <line: 20, col: 20>
6.85/4.94	life | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 14, col: 12> <line: 16, col: 17> <line: 17, col: 9> <line: 19, col: 22> <line: 20, col: 13>
6.85/4.94	death | local variable | integer | <line: 8, col: 5> | <line: 12, col: 5> <line: 14, col: 19> <line: 15, col: 16> <line: 16, col: 9> <line: 19, col: 39>
6.85/4.94	temp | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 17, col: 16>
6.85/4.94	
6.85/4.94	Main function: main
6.85/4.94	Preprocessed LLVMGraph
6.85/4.94	Init Location: 0
6.85/4.94	Transitions:
6.85/4.94	<l0, l2, (2 = 2) /\ (main_life = 13) /\ (main_death = 17)>
6.85/4.94	<l2, l2, (main_life < main_death) /\ (2 < main_death), par{main_life -> 2, main_death -> (main_life + 1)}>
6.85/4.94	<l2, l2, (main_life < main_death) /\ not((2 < main_death)) /\ not((2 < (main_life + 1))), par{main_life -> main_death, main_death -> (main_life + 1)}>
6.85/4.94	<l2, l10, not((main_life < main_death))>
6.85/4.94	
6.85/4.94	Fresh variables:
6.85/4.94	
6.85/4.94	Undef variables:
6.85/4.94	
6.85/4.94	Abstraction variables:
6.85/4.94	
6.85/4.94	Exit nodes:
6.85/4.94	10, 
6.85/4.94	Accepting locations:
6.85/4.94	
6.85/4.94	Asserts:
6.85/4.94	
6.85/4.94	*************************************************************
6.85/4.94	*******************************************************************************************
6.85/4.94	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
6.85/4.94	*******************************************************************************************
6.85/4.94	
6.85/4.94	Init Location: 0
6.85/4.94	Graph 0:
6.85/4.94	Transitions:
6.85/4.94	Variables:
6.85/4.94	
6.85/4.94	Graph 1:
6.85/4.94	Transitions:
6.85/4.94	<l2, l2, 1 + main_life <= main_death /\ 3 <= main_death, {main_life -> 2, main_death -> 1 + main_life, rest remain the same}>
6.85/4.94	<l2, l2, 1 + main_life <= main_death /\ main_death <= 2 /\ main_life <= 1, {main_life -> main_death, main_death -> 1 + main_life, rest remain the same}>
6.85/4.94	Variables:
6.85/4.94	main_life, main_death
6.85/4.94	
6.85/4.94	Graph 2:
6.85/4.94	Transitions:
6.85/4.94	Variables:
6.85/4.94	
6.85/4.94	Precedence: 
6.85/4.94	Graph 0
6.85/4.94	
6.85/4.94	Graph 1
6.85/4.94	<l0, l2, main_life = 13 /\ main_death = 17, {all remain the same}>
6.85/4.94	
6.85/4.94	Graph 2
6.85/4.94	<l2, l10, main_death <= main_life, {all remain the same}>
6.85/4.94	
6.85/4.94	Map Locations to Subgraph:
6.85/4.94	( 0 , 0 )
6.85/4.94	( 2 , 1 )
6.85/4.94	( 10 , 2 )
6.85/4.94	
6.85/4.94	*******************************************************************************************
6.85/4.94	********************************    CHECKING ASSERTIONS    ********************************
6.85/4.94	*******************************************************************************************
6.85/4.94	
6.85/4.94	Proving termination of subgraph 0
6.85/4.94	Proving termination of subgraph 1
6.85/4.94	Checking unfeasibility...
6.85/4.94	Time used: 0.026813
6.85/4.94	Some transition disabled by a set of invariant(s):
6.85/4.94	Invariant at l2: 2 <= main_life
6.85/4.94	
6.85/4.94	Strengthening and disabling transitions...
6.85/4.94	> It's unfeasible. Removing transition: 
6.85/4.94	<l2, l2, 1 + main_life <= main_death /\ main_death <= 2 /\ main_life <= 1, {main_life -> main_death, main_death -> 1 + main_life, rest remain the same}>
6.85/4.94	
6.85/4.94	LOG: CALL solverLinear in Graph for feasibility
6.85/4.94	
6.85/4.94	LOG: RETURN solveLinear in Graph for feasibility
6.85/4.94	Strengthening transition (result): 
6.85/4.94	<l2, l2, 2 <= main_life /\ 1 + main_life <= main_death /\ 3 <= main_death, {main_life -> 2, main_death -> 1 + main_life, rest remain the same}>
6.85/4.94	Checking unfeasibility...
6.85/4.94	Time used: 0.032495
6.85/4.94	
6.85/4.94	Checking conditional termination of SCC {l2}...
6.85/4.94	
6.85/4.94	LOG: CALL solveLinear
6.85/4.94	
6.85/4.94	LOG: RETURN solveLinear - Elapsed time: 0.000984s
6.85/4.94	
6.85/4.94	LOG: CALL solveLinear
6.85/4.94	
6.85/4.94	LOG: RETURN solveLinear - Elapsed time: 0.002172s
6.85/4.94	[43551 : 43554]
6.85/4.94	[43551 : 43555]
6.85/4.94	Solving with 1 template(s).
6.85/4.94	
6.85/4.94	LOG: CALL solveNonLinearGetFirstSolution
6.85/4.94	
6.85/4.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.701680s
6.85/4.94	Time used: 0.701292
6.85/4.94	Termination failed. Trying to show unreachability...
6.85/4.94	Proving unreachability of entry: <l0, l2, main_life = 13 /\ main_death = 17, {all remain the same}>
6.85/4.94	
6.85/4.94	LOG: CALL check - Post:1 <= 0 - Process 1
6.85/4.94	* Exit transition: <l0, l2, main_life = 13 /\ main_death = 17, {all remain the same}>
6.85/4.94	* Postcondition  : 1 <= 0
6.85/4.94	
6.85/4.94	LOG: CALL solveLinear
6.85/4.94	
6.85/4.94	LOG: RETURN solveLinear - Elapsed time: 0.003713s
6.85/4.94	> Postcondition is not implied!
6.85/4.94	
6.85/4.94	LOG: RETURN check - Elapsed time: 0.003832s
6.85/4.94	Cannot prove unreachability
6.85/4.94	
6.85/4.94	[43551 : 43607]
6.85/4.94	[43551 : 43611]
6.85/4.94	Successful child: 43607
6.85/4.94	
6.85/4.94	Program does NOT terminate
6.85/4.94	EOF