5.19/5.22	NO
5.19/5.22	
5.21/5.22	Solver Timeout: 4
5.21/5.22	Global Timeout: 300
5.21/5.22	No parsing errors!
5.21/5.22	Init Location: 0
5.21/5.22	Transitions:
5.21/5.22	<l0, l7, true>
5.21/5.22	<l1, l2, (undef8 = undef8) /\ (undef7 = undef7), par{x_5^0 -> undef7, y_6^0 -> undef8}>
5.21/5.22	<l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9), par{Result_4^0 -> undef9, lt_8^0 -> undef13, lt_9^0 -> undef14}>
5.21/5.22	<l2, l4, true, par{lt_8^0 -> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}>
5.21/5.22	<l4, l5, ((1 + lt_8^0) <= (0 + lt_9^0))>
5.21/5.22	<l4, l5, ((1 + lt_9^0) <= (0 + lt_8^0))>
5.21/5.22	<l5, l6, (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46), par{lt_7^0 -> undef46, lt_8^0 -> undef47, lt_9^0 -> undef48}>
5.21/5.22	<l6, l2, true>
5.21/5.22	<l7, l1, true>
5.21/5.22	
5.21/5.22	Fresh variables:
5.21/5.22	undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 
5.21/5.22	
5.21/5.22	Undef variables:
5.21/5.22	undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 
5.21/5.22	
5.21/5.22	Abstraction variables:
5.21/5.22	
5.21/5.22	Exit nodes:
5.21/5.22	
5.21/5.22	Accepting locations:
5.21/5.22	
5.21/5.22	Asserts:
5.21/5.22	
5.21/5.22	Preprocessed LLVMGraph
5.21/5.22	Init Location: 0
5.21/5.22	Transitions:
5.21/5.22	<l0, l2, (undef8 = undef8) /\ (undef7 = undef7)>
5.21/5.22	<l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9)>
5.21/5.22	<l2, l2, ((1 + (0 + cnt_15^0)) <= (0 + (0 + cnt_20^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)>
5.21/5.22	<l2, l2, ((1 + (0 + cnt_20^0)) <= (0 + (0 + cnt_15^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)>
5.21/5.22	
5.21/5.22	Fresh variables:
5.21/5.22	undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 
5.21/5.22	
5.21/5.22	Undef variables:
5.21/5.22	undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 
5.21/5.22	
5.21/5.22	Abstraction variables:
5.21/5.22	
5.21/5.22	Exit nodes:
5.21/5.22	
5.21/5.22	Accepting locations:
5.21/5.22	
5.21/5.22	Asserts:
5.21/5.22	
5.21/5.22	*************************************************************
5.21/5.22	*******************************************************************************************
5.21/5.22	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.21/5.22	*******************************************************************************************
5.21/5.22	
5.21/5.22	Init Location: 0
5.21/5.22	Graph 0:
5.21/5.22	Transitions:
5.21/5.22	Variables:
5.21/5.22	
5.21/5.22	Graph 1:
5.21/5.22	Transitions:
5.21/5.22	<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	Variables:
5.21/5.22	cnt_15^0, cnt_20^0
5.21/5.22	
5.21/5.22	Graph 2:
5.21/5.22	Transitions:
5.21/5.22	Variables:
5.21/5.22	
5.21/5.22	Precedence: 
5.21/5.22	Graph 0
5.21/5.22	
5.21/5.22	Graph 1
5.21/5.22	<l0, l2, true, {all remain the same}>
5.21/5.22	
5.21/5.22	Graph 2
5.21/5.22	<l2, l3, cnt_15^0 = undef17 /\ cnt_20^0 = undef18 /\ undef17 = undef18, {all remain the same}>
5.21/5.22	
5.21/5.22	Map Locations to Subgraph:
5.21/5.22	( 0 , 0 )
5.21/5.22	( 2 , 1 )
5.21/5.22	( 3 , 2 )
5.21/5.22	
5.21/5.22	*******************************************************************************************
5.21/5.22	********************************    CHECKING ASSERTIONS    ********************************
5.21/5.22	*******************************************************************************************
5.21/5.22	
5.21/5.22	Proving termination of subgraph 0
5.21/5.22	Proving termination of subgraph 1
5.21/5.22	Checking unfeasibility...
5.21/5.22	Time used: 0.003305
5.21/5.22	
5.21/5.22	> No variable changes in termination graph.
5.21/5.22	Checking conditional unfeasibility...
5.21/5.22	Calling Safety with literal cnt_20^0 <= cnt_15^0 and entry <l2, l2, true, {all remain the same}>
5.21/5.22	
5.21/5.22	LOG: CALL check - Post:cnt_20^0 <= cnt_15^0 - Process 1
5.21/5.22	* Exit transition: <l2, l2, true, {all remain the same}>
5.21/5.22	* Postcondition  : cnt_20^0 <= cnt_15^0
5.21/5.22	Postcodition moved up: cnt_20^0 <= cnt_15^0
5.21/5.22	
5.21/5.22	LOG: Try proving POST
5.21/5.22	Postcondition: cnt_20^0 <= cnt_15^0
5.21/5.22	
5.21/5.22	LOG: CALL check - Post:cnt_20^0 <= cnt_15^0 - Process 2
5.21/5.22	* Exit transition: <l0, l2, true, {all remain the same}>
5.21/5.22	* Postcondition  : cnt_20^0 <= cnt_15^0
5.21/5.22	
5.21/5.22	LOG: CALL solveLinear
5.21/5.22	
5.21/5.22	LOG: RETURN solveLinear - Elapsed time: 0.000274s
5.21/5.22	> Postcondition is not implied!
5.21/5.22	
5.21/5.22	LOG: RETURN check - Elapsed time: 0.000350s
5.21/5.22	
5.21/5.22	LOG: NarrowEntry size 1
5.21/5.22	Narrowing transition: 
5.21/5.22	<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	
5.21/5.22	LOG: Narrow transition size 1
5.21/5.22	It's unfeasible. Removing transition: 
5.21/5.22	<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	ENTRIES:
5.21/5.22	<l0, l2, 1 + cnt_15^0 <= cnt_20^0, {all remain the same}>
5.21/5.22	END ENTRIES:
5.21/5.22	GRAPH:
5.21/5.22	<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	END GRAPH:
5.21/5.22	EXIT: <l2, l2, true, {all remain the same}>
5.21/5.22	POST: cnt_20^0 <= cnt_15^0
5.21/5.22	
5.21/5.22	
5.21/5.22	LOG: Try proving POST
5.21/5.22	Solving with 1 template(s).
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinearGetFirstSolution
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005655s
5.21/5.22	Time used: 0.005554
5.21/5.22	Solving with 2 template(s).
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinearGetFirstSolution
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000336s
5.21/5.22	Time used: 4.00025
5.21/5.22	Solving with 3 template(s).
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinearGetFirstSolution
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002187s
5.21/5.22	Time used: 1.00029
5.21/5.22	
5.21/5.22	LOG: Postcondition is not implied - no solution
5.21/5.22	> Postcondition is not implied!
5.21/5.22	
5.21/5.22	LOG: RETURN check - Elapsed time: 5.013650s
5.21/5.22	
5.21/5.22	Proving non-termination of subgraph 1
5.21/5.22	Transitions:
5.21/5.22	<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	Variables:
5.21/5.22	cnt_15^0, cnt_20^0
5.21/5.22	
5.21/5.22	Checking that every undef value has an assignment...
5.21/5.22	
5.21/5.22	LOG: CALL solveLinear
5.21/5.22	
5.21/5.22	LOG: RETURN solveLinear - Elapsed time: 0.001276s
5.21/5.22	Checking conditional non-termination of SCC {l2}...
5.21/5.22	EXIT TRANSITIONS:
5.21/5.22	<l2, end, cnt_15^0 = cnt_20^0, {all remain the same}>
5.21/5.22	
5.21/5.22	Solving with 1 template(s).
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinearGetFirstSolution
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026061s
5.21/5.22	Time used: 0.025741
5.21/5.22	Improving Solution with cost 1 ...
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinearGetNextSolution
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.107314s
5.21/5.22	Time used: 0.107312
5.21/5.22	
5.21/5.22	LOG: SAT solveNonLinear - Elapsed time: 0.133375s
5.21/5.22	Cost: 1; Total time: 0.133053
5.21/5.22	Failed at location 2: 1 + cnt_15^0 <= cnt_20^0
5.21/5.22	Before Improving: 
5.21/5.22	Quasi-invariant at l2: 1 + cnt_15^0 <= cnt_20^0
5.21/5.22	Optimizing invariants...
5.21/5.22	
5.21/5.22	LOG: CALL solveLinear
5.21/5.22	
5.21/5.22	LOG: RETURN solveLinear - Elapsed time: 0.015981s
5.21/5.22	Remaining time after improvement: 0.997996
5.21/5.22	Minimizing number of undef constraints...
5.21/5.22	
5.21/5.22	LOG: CALL solveNonLinear
5.21/5.22	
5.21/5.22	LOG: RETURN solveNonLinear - Elapsed time: 0.003681s
5.21/5.22	Number of undef constraints reduced!
5.21/5.22	
5.21/5.22	Non-termination implied by a set of quasi-invariant(s):
5.21/5.22	Quasi-invariant at l2: 1 + cnt_15^0 <= cnt_20^0
5.21/5.22	
5.21/5.22	Strengthening and disabling EXIT transitions...
5.21/5.22	Closed exits from l2: 1
5.21/5.22	
5.21/5.22	Strengthening and disabling transitions...
5.21/5.22	
5.21/5.22	LOG: CALL solverLinear in Graph for feasibility
5.21/5.22	
5.21/5.22	LOG: RETURN solveLinear in Graph for feasibility
5.21/5.22	Strengthening transition (result): 
5.21/5.22	<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	
5.21/5.22	LOG: CALL solverLinear in Graph for feasibility
5.21/5.22	
5.21/5.22	LOG: RETURN solveLinear in Graph for feasibility
5.21/5.22	It's unfeasible. Removing transition: 
5.21/5.22	<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
5.21/5.22	
5.21/5.22	Calling reachability with...
5.21/5.22	Transition: <l2, end, true, {all remain the same}>
5.21/5.22	Conditions: 1 + cnt_15^0 <= cnt_20^0, 
5.21/5.22	OPEN EXITS: 
5.21/5.22	<l2, end, true, {all remain the same}> (condsUp: 1 + cnt_15^0 <= cnt_20^0)
5.21/5.22	
5.21/5.22	--- Reachability graph ---
5.21/5.22	> Graph without transitions.
5.21/5.22	
5.21/5.22	Calling reachability with...
5.21/5.22	Transition: <l0, l2, true, {all remain the same}>
5.21/5.22	Conditions: 1 + cnt_15^0 <= cnt_20^0, 
5.21/5.22	OPEN EXITS: 
5.21/5.22	<l0, l2, 1 + cnt_15^0 <= cnt_20^0, {all remain the same}>
5.21/5.22	
5.21/5.22	> Conditions are reachable!
5.21/5.22	
5.21/5.22	Program does NOT terminate
5.21/5.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.21/5.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.21/5.22	EOF