5.10/5.11	NO
5.10/5.11	
5.10/5.11	Solver Timeout: 4
5.10/5.11	Global Timeout: 300
5.10/5.11	No parsing errors!
5.10/5.11	Init Location: 0
5.10/5.11	Transitions:
5.10/5.11	<l0, l5, true>
5.10/5.11	<l1, l2, ((1 + v^0) <= (0 + v_next^0))>
5.10/5.11	<l1, l3, true>
5.10/5.11	<l3, l1, (undef9 = undef9) /\ (undef10 = (0 + undef9)), par{pre_v^0 -> (0 + v^0), v^0 -> (1 + undef10), v_next^0 -> undef9}>
5.10/5.11	<l4, l3, true>
5.10/5.11	<l5, l4, true>
5.10/5.11	
5.10/5.11	Fresh variables:
5.10/5.11	undef9, undef10, 
5.10/5.11	
5.10/5.11	Undef variables:
5.10/5.11	undef9, undef10, 
5.10/5.11	
5.10/5.11	Abstraction variables:
5.10/5.11	
5.10/5.11	Exit nodes:
5.10/5.11	
5.10/5.11	Accepting locations:
5.10/5.11	
5.10/5.11	Asserts:
5.10/5.11	
5.10/5.11	Preprocessed LLVMGraph
5.10/5.11	Init Location: 0
5.10/5.11	Transitions:
5.10/5.11	<l0, l3, true>
5.10/5.11	<l3, l3, (undef9 = undef9) /\ (undef10 = (0 + undef9)), par{v^0 -> (1 + undef10)}>
5.10/5.11	
5.10/5.11	Fresh variables:
5.10/5.11	undef9, undef10, 
5.10/5.11	
5.10/5.11	Undef variables:
5.10/5.11	undef9, undef10, 
5.10/5.11	
5.10/5.11	Abstraction variables:
5.10/5.11	
5.10/5.11	Exit nodes:
5.10/5.11	
5.10/5.11	Accepting locations:
5.10/5.11	
5.10/5.11	Asserts:
5.10/5.11	
5.10/5.11	*************************************************************
5.10/5.11	*******************************************************************************************
5.10/5.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.10/5.11	*******************************************************************************************
5.10/5.11	
5.10/5.11	Init Location: 0
5.10/5.11	Graph 0:
5.10/5.11	Transitions:
5.10/5.11	Variables:
5.10/5.11	
5.10/5.11	Graph 1:
5.10/5.11	Transitions:
5.10/5.11	<l3, l3, undef9 = undef10, {v^0 -> 1 + undef10, rest remain the same}>
5.10/5.11	Variables:
5.10/5.11	v^0
5.10/5.11	
5.10/5.11	Precedence: 
5.10/5.11	Graph 0
5.10/5.11	
5.10/5.11	Graph 1
5.10/5.11	<l0, l3, true, {all remain the same}>
5.10/5.11	
5.10/5.11	Map Locations to Subgraph:
5.10/5.11	( 0 , 0 )
5.10/5.11	( 3 , 1 )
5.10/5.11	
5.10/5.11	*******************************************************************************************
5.10/5.11	********************************    CHECKING ASSERTIONS    ********************************
5.10/5.11	*******************************************************************************************
5.10/5.11	
5.10/5.11	Proving termination of subgraph 0
5.10/5.11	Proving termination of subgraph 1
5.10/5.11	Checking unfeasibility...
5.10/5.11	Time used: 0.001499
5.10/5.11	
5.10/5.11	Checking conditional termination of SCC {l3}...
5.10/5.11	
5.10/5.11	LOG: CALL solveLinear
5.10/5.11	
5.10/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000510s
5.10/5.11	
5.10/5.11	LOG: CALL solveLinear
5.10/5.11	
5.10/5.11	LOG: RETURN solveLinear - Elapsed time: 0.001316s
5.10/5.11	Trying to remove transition: <l3, l3, undef9 = undef10, {v^0 -> 1 + undef10, rest remain the same}>
5.10/5.11	Solving with 1 template(s).
5.10/5.11	
5.10/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.10/5.11	
5.10/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003215s
5.10/5.11	Time used: 0.003094
5.10/5.11	Solving with 1 template(s).
5.10/5.11	
5.10/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.10/5.11	
5.10/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004083s
5.10/5.11	Time used: 0.003861
5.10/5.11	Solving with 2 template(s).
5.10/5.11	
5.10/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.10/5.11	
5.10/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001325s
5.10/5.11	Time used: 4.00072
5.10/5.11	Solving with 3 template(s).
5.10/5.11	
5.10/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.10/5.11	
5.10/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038195s
5.10/5.11	Time used: 1.00044
5.10/5.11	Solving with 1 template(s).
5.10/5.11	
5.10/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.10/5.11	
5.10/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006613s
5.10/5.11	Time used: 0.003749
5.10/5.11	Termination failed. Trying to show unreachability...
5.10/5.11	Proving unreachability of entry: <l0, l3, true, {all remain the same}>
5.10/5.11	
5.10/5.11	LOG: CALL check - Post:1 <= 0 - Process 1
5.10/5.11	* Exit transition: <l0, l3, true, {all remain the same}>
5.10/5.11	* Postcondition  : 1 <= 0
5.10/5.11	
5.10/5.11	LOG: CALL solveLinear
5.10/5.11	
5.10/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000409s
5.10/5.11	> Postcondition is not implied!
5.10/5.11	
5.10/5.11	LOG: RETURN check - Elapsed time: 0.000479s
5.10/5.11	Cannot prove unreachability
5.10/5.11	
5.10/5.11	Proving non-termination of subgraph 1
5.10/5.11	Transitions:
5.10/5.11	<l3, l3, undef9 = undef10, {v^0 -> 1 + undef10, rest remain the same}>
5.10/5.11	Variables:
5.10/5.11	v^0
5.10/5.11	
5.10/5.11	Checking conditional non-termination of SCC {l3}...
5.10/5.11	> No exit transition to close.
5.10/5.11	Checking that every undef value has an assignment...
5.10/5.11	
5.10/5.11	LOG: CALL solveLinear
5.10/5.11	
5.10/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000998s
5.10/5.11	Calling reachability with...
5.10/5.11	Transition: <l3, end, true, {all remain the same}>
5.10/5.11	Conditions: 
5.10/5.11	OPEN EXITS: 
5.10/5.11	<l3, end, true, {all remain the same}>
5.10/5.11	
5.10/5.11	--- Reachability graph ---
5.10/5.11	> Graph without transitions.
5.10/5.11	
5.10/5.11	Calling reachability with...
5.10/5.11	Transition: <l0, l3, true, {all remain the same}>
5.10/5.11	Conditions: 
5.10/5.11	OPEN EXITS: 
5.10/5.11	<l0, l3, true, {all remain the same}>
5.10/5.11	
5.10/5.11	> Conditions are reachable!
5.10/5.11	
5.10/5.11	Program does NOT terminate
5.10/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.10/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.10/5.11	EOF