3.04/3.13	NO
3.04/3.13	
3.04/3.13	Solver Timeout: 4
3.04/3.13	Global Timeout: 300
3.04/3.13	No parsing errors!
3.04/3.13	Init Location: 0
3.04/3.13	Transitions:
3.04/3.13	<l0, l14, true>
3.04/3.13	<l1, l2, true>
3.04/3.13	<l3, l1, true>
3.04/3.13	<l3, l4, true>
3.04/3.13	<l3, l1, true>
3.04/3.13	<l5, l6, true>
3.04/3.13	<l7, l8, true>
3.04/3.13	<l9, l7, true>
3.04/3.13	<l9, l7, true>
3.04/3.13	<l9, l2, true>
3.04/3.13	<l10, l11, true>
3.04/3.13	<l8, l9, true>
3.04/3.13	<l12, l10, (undef70 = undef70), par{tmp15^0 -> undef70}>
3.04/3.13	<l11, l12, true>
3.04/3.13	<l11, l8, true>
3.04/3.13	<l11, l12, true>
3.04/3.13	<l2, l3, true>
3.04/3.13	<l6, l10, ((0 + length5^0) <= (0 + i6^0))>
3.04/3.13	<l6, l5, ((1 + i6^0) <= (0 + length5^0)) /\ (undef108 = undef108), par{i6^0 -> (1 + i6^0), tmp___09^0 -> undef108}>
3.04/3.13	<l13, l5, (undef113 = undef113) /\ (undef111 = (0 + undef113)), par{i6^0 -> 0, length5^0 -> (0 + undef111), s^0 -> undef111, tmp^0 -> undef113}>
3.04/3.13	<l14, l13, true>
3.04/3.13	
3.04/3.13	Fresh variables:
3.04/3.13	undef70, undef108, undef111, undef113, 
3.04/3.13	
3.04/3.13	Undef variables:
3.04/3.13	undef70, undef108, undef111, undef113, 
3.04/3.13	
3.04/3.13	Abstraction variables:
3.04/3.13	
3.04/3.13	Exit nodes:
3.04/3.13	
3.04/3.13	Accepting locations:
3.04/3.13	
3.04/3.13	Asserts:
3.04/3.13	
3.04/3.13	Preprocessed LLVMGraph
3.04/3.13	Init Location: 0
3.04/3.13	Transitions:
3.04/3.13	<l0, l5, (i6^0 = 0) /\ (length5^0 = (0 + undef111)) /\ (undef113 = undef113) /\ (undef111 = (0 + undef113))>
3.04/3.13	<l2, l2, true>
3.04/3.13	<l2, l4, true>
3.04/3.13	<l2, l2, true>
3.04/3.13	<l5, l10, ((0 + length5^0) <= (0 + i6^0))>
3.04/3.13	<l5, l5, ((1 + i6^0) <= (0 + length5^0)) /\ (undef108 = undef108), par{i6^0 -> (1 + i6^0)}>
3.04/3.13	<l8, l8, true>
3.04/3.13	<l8, l8, true>
3.04/3.13	<l8, l2, true>
3.04/3.13	<l10, l10, (undef70 = undef70)>
3.04/3.13	<l10, l8, true>
3.04/3.13	<l10, l10, (undef70 = undef70)>
3.04/3.13	
3.04/3.13	Fresh variables:
3.04/3.13	undef70, undef108, undef111, undef113, 
3.04/3.13	
3.04/3.13	Undef variables:
3.04/3.13	undef70, undef108, undef111, undef113, 
3.04/3.13	
3.04/3.13	Abstraction variables:
3.04/3.13	
3.04/3.13	Exit nodes:
3.04/3.13	
3.04/3.13	Accepting locations:
3.04/3.13	
3.04/3.13	Asserts:
3.04/3.13	
3.04/3.13	*************************************************************
3.04/3.13	*******************************************************************************************
3.04/3.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.04/3.13	*******************************************************************************************
3.04/3.13	
3.04/3.13	Init Location: 0
3.04/3.13	Graph 0:
3.04/3.13	Transitions:
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Graph 1:
3.04/3.13	Transitions:
3.04/3.13	<l5, l5, 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>
3.04/3.13	Variables:
3.04/3.13	i6^0, length5^0
3.04/3.13	
3.04/3.13	Graph 2:
3.04/3.13	Transitions:
3.04/3.13	<l10, l10, true, {all remain the same}>
3.04/3.13	<l10, l10, true, {all remain the same}>
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Graph 3:
3.04/3.13	Transitions:
3.04/3.13	<l8, l8, true, {all remain the same}>
3.04/3.13	<l8, l8, true, {all remain the same}>
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Graph 4:
3.04/3.13	Transitions:
3.04/3.13	<l2, l2, true, {all remain the same}>
3.04/3.13	<l2, l2, true, {all remain the same}>
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Graph 5:
3.04/3.13	Transitions:
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Precedence: 
3.04/3.13	Graph 0
3.04/3.13	
3.04/3.13	Graph 1
3.04/3.13	<l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	
3.04/3.13	Graph 2
3.04/3.13	<l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	
3.04/3.13	Graph 3
3.04/3.13	<l10, l8, true, {all remain the same}>
3.04/3.13	
3.04/3.13	Graph 4
3.04/3.13	<l8, l2, true, {all remain the same}>
3.04/3.13	
3.04/3.13	Graph 5
3.04/3.13	<l2, l4, true, {all remain the same}>
3.04/3.13	
3.04/3.13	Map Locations to Subgraph:
3.04/3.13	( 0 , 0 )
3.04/3.13	( 2 , 4 )
3.04/3.13	( 4 , 5 )
3.04/3.13	( 5 , 1 )
3.04/3.13	( 8 , 3 )
3.04/3.13	( 10 , 2 )
3.04/3.13	
3.04/3.13	*******************************************************************************************
3.04/3.13	********************************    CHECKING ASSERTIONS    ********************************
3.04/3.13	*******************************************************************************************
3.04/3.13	
3.04/3.13	Proving termination of subgraph 0
3.04/3.13	Proving termination of subgraph 1
3.04/3.13	Checking unfeasibility...
3.04/3.13	Time used: 0.002171
3.04/3.13	
3.04/3.13	Checking conditional termination of SCC {l5}...
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.000814s
3.04/3.13	Ranking function: -1 - i6^0 + length5^0
3.04/3.13	New Graphs: 
3.04/3.13	Proving termination of subgraph 2
3.04/3.13	Checking unfeasibility...
3.04/3.13	Time used: 0.001799
3.04/3.13	
3.04/3.13	> No variable changes in termination graph.
3.04/3.13	Checking conditional unfeasibility...
3.04/3.13	Termination failed. Trying to show unreachability...
3.04/3.13	Proving unreachability of entry: <l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	
3.04/3.13	LOG: CALL check - Post:1 <= 0 - Process 1
3.04/3.13	* Exit transition: <l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	* Postcondition  : 1 <= 0
3.04/3.13	Postcodition moved up: 1 <= 0
3.04/3.13	
3.04/3.13	LOG: Try proving POST
3.04/3.13	Postcondition: 1 <= 0
3.04/3.13	
3.04/3.13	LOG: CALL check - Post:1 <= 0 - Process 2
3.04/3.13	* Exit transition: <l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	* Postcondition  : 1 <= 0
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.000445s
3.04/3.13	> Postcondition is not implied!
3.04/3.13	
3.04/3.13	LOG: RETURN check - Elapsed time: 0.000539s
3.04/3.13	
3.04/3.13	LOG: NarrowEntry size 1
3.04/3.13	Narrowing transition: 
3.04/3.13	<l5, l5, 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>
3.04/3.13	
3.04/3.13	LOG: Narrow transition size 1
3.04/3.13	ENTRIES:
3.04/3.13	<l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	END ENTRIES:
3.04/3.13	GRAPH:
3.04/3.13	<l5, l5, 0 <= 0 /\ 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>
3.04/3.13	END GRAPH:
3.04/3.13	EXIT: <l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	POST: 1 <= 0
3.04/3.13	
3.04/3.13	
3.04/3.13	LOG: Try proving POST
3.04/3.13	Solving with 1 template(s).
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetFirstSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006985s
3.04/3.13	Time used: 0.006841
3.04/3.13	Improving Solution with cost 51 ...
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetNextSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.013512s
3.04/3.13	Time used: 1.01344
3.04/3.13	
3.04/3.13	LOG: SAT solveNonLinear - Elapsed time: 1.020496s
3.04/3.13	Cost: 51; Total time: 1.02028
3.04/3.13	Failed at location 5: 1 + length5^0 <= i6^0
3.04/3.13	Before Improving: 
3.04/3.13	Quasi-invariant at l5: 1 + length5^0 <= i6^0
3.04/3.13	Optimizing invariants...
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.004300s
3.04/3.13	Remaining time after improvement: 0.999132
3.04/3.13	Some transition disabled by a set of quasi-invariant(s):
3.04/3.13	Quasi-invariant at l5: 1 + length5^0 <= i6^0
3.04/3.13	
3.04/3.13	LOG: NEXT CALL check - disable
3.04/3.13	
3.04/3.13	LOG: CALL check - Post:1 + length5^0 <= i6^0 - Process 3
3.04/3.13	* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	* Postcondition  : 1 + length5^0 <= i6^0
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.000600s
3.04/3.13	> Postcondition is not implied!
3.04/3.13	
3.04/3.13	LOG: RETURN check - Elapsed time: 0.000704s
3.04/3.13	Solving with 2 template(s).
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetFirstSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029085s
3.04/3.13	Time used: 0.028901
3.04/3.13	Improving Solution with cost 51 ...
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetNextSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001012s
3.04/3.13	Time used: 1.00083
3.04/3.13	
3.04/3.13	LOG: SAT solveNonLinear - Elapsed time: 1.030097s
3.04/3.13	Cost: 51; Total time: 1.02973
3.04/3.13	Failed at location 5: length5^0 <= i6^0
3.04/3.13	Before Improving: 
3.04/3.13	Quasi-invariant at l5: length5^0 <= i6^0
3.04/3.13	Optimizing invariants...
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.006106s
3.04/3.13	Remaining time after improvement: 0.998897
3.04/3.13	Some transition disabled by a set of quasi-invariant(s):
3.04/3.13	Quasi-invariant at l5: length5^0 <= i6^0
3.04/3.13	
3.04/3.13	LOG: NEXT CALL check - disable
3.04/3.13	
3.04/3.13	LOG: CALL check - Post:length5^0 <= i6^0 - Process 4
3.04/3.13	* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	* Postcondition  : length5^0 <= i6^0
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.000735s
3.04/3.13	> Postcondition is not implied!
3.04/3.13	
3.04/3.13	LOG: RETURN check - Elapsed time: 0.000839s
3.04/3.13	Solving with 3 template(s).
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetFirstSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.113578s
3.04/3.13	Time used: 0.113356
3.04/3.13	Improving Solution with cost 51 ...
3.04/3.13	
3.04/3.13	LOG: CALL solveNonLinearGetNextSolution
3.04/3.13	
3.04/3.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.886939s
3.04/3.13	Time used: 0.886889
3.04/3.13	
3.04/3.13	LOG: SAT solveNonLinear - Elapsed time: 1.000517s
3.04/3.13	Cost: 51; Total time: 1.00025
3.04/3.13	Failed at location 5: length5^0 <= 0
3.04/3.13	Before Improving: 
3.04/3.13	Quasi-invariant at l5: 0 <= 1 + i6^0
3.04/3.13	Quasi-invariant at l5: 0 <= i6^0
3.04/3.13	Quasi-invariant at l5: length5^0 <= 0
3.04/3.13	Optimizing invariants...
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.008114s
3.04/3.13	Remaining time after improvement: 0.998521
3.04/3.13	Some transition disabled by a set of quasi-invariant(s):
3.04/3.13	Quasi-invariant at l5: 0 <= 1 + i6^0
3.04/3.13	Quasi-invariant at l5: 0 <= i6^0
3.04/3.13	Quasi-invariant at l5: length5^0 <= 0
3.04/3.13	
3.04/3.13	LOG: NEXT CALL check - disable
3.04/3.13	
3.04/3.13	LOG: CALL check - Post:length5^0 <= 0 - Process 5
3.04/3.13	* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	* Postcondition  : length5^0 <= 0
3.04/3.13	
3.04/3.13	LOG: CALL solveLinear
3.04/3.13	
3.04/3.13	LOG: RETURN solveLinear - Elapsed time: 0.000764s
3.04/3.13	> Postcondition is not implied!
3.04/3.13	
3.04/3.13	LOG: RETURN check - Elapsed time: 0.000885s
3.04/3.13	
3.04/3.13	LOG: Postcondition is not implied - no solution
3.04/3.13	> Postcondition is not implied!
3.04/3.13	
3.04/3.13	LOG: RETURN check - Elapsed time: 3.081084s
3.04/3.13	Cannot prove unreachability
3.04/3.13	
3.04/3.13	Proving non-termination of subgraph 2
3.04/3.13	Transitions:
3.04/3.13	<l10, l10, true, {all remain the same}>
3.04/3.13	<l10, l10, true, {all remain the same}>
3.04/3.13	Variables:
3.04/3.13	
3.04/3.13	Checking conditional non-termination of SCC {l10}...
3.04/3.13	> No exit transition to close.
3.04/3.13	Calling reachability with...
3.04/3.13	Transition: <l10, end, true, {all remain the same}>
3.04/3.13	Conditions: 
3.04/3.13	OPEN EXITS: 
3.04/3.13	<l10, end, true, {all remain the same}>
3.04/3.13	
3.04/3.13	--- Reachability graph ---
3.04/3.13	> Graph without transitions.
3.04/3.13	
3.04/3.13	Calling reachability with...
3.04/3.13	Transition: <l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	Conditions: 
3.04/3.13	OPEN EXITS: 
3.04/3.13	<l5, l10, length5^0 <= i6^0, {all remain the same}>
3.04/3.13	
3.04/3.13	--- Reachability graph ---
3.04/3.13	> Graph without transitions.
3.04/3.13	
3.04/3.13	Calling reachability with...
3.04/3.13	Transition: <l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	Conditions: length5^0 <= i6^0, 
3.04/3.13	OPEN EXITS: 
3.04/3.13	<l0, l5, length5^0 <= i6^0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
3.04/3.13	
3.04/3.13	> Conditions are reachable!
3.04/3.13	
3.04/3.13	Program does NOT terminate
3.04/3.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
3.04/3.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
3.04/3.13	EOF