23.28/23.36	YES
23.28/23.36	
23.28/23.36	Solver Timeout: 4
23.28/23.36	Global Timeout: 300
23.28/23.36	No parsing errors!
23.28/23.36	Init Location: 0
23.28/23.36	Transitions:
23.28/23.36	<l0, l19, true>
23.28/23.36	<l1, l2, ((0 + __const_100^0) <= (0 + i^0)), par{j^0 -> (~(2) + i^0)}>
23.28/23.36	<l1, l3, ((1 + i^0) <= (0 + __const_100^0)), par{i^0 -> (1 + i^0)}>
23.28/23.36	<l4, l5, true>
23.28/23.36	<l3, l1, true>
23.28/23.36	<l6, l7, true>
23.28/23.36	<l8, l6, true, par{j10^0 -> (1 + j10^0)}>
23.28/23.36	<l9, l8, true>
23.28/23.36	<l9, l6, true>
23.28/23.36	<l9, l8, true>
23.28/23.36	<l10, l4, (undef78 = (0 + j10^0)), par{j^0 -> (0 + undef78), ret_check12^0 -> undef78}>
23.28/23.36	<l10, l9, true>
23.28/23.36	<l11, l12, true>
23.28/23.36	<l13, l7, true, par{j10^0 -> (0 + j^0)}>
23.28/23.36	<l14, l13, true>
23.28/23.36	<l14, l4, true>
23.28/23.36	<l14, l13, true>
23.28/23.36	<l15, l11, true>
23.28/23.36	<l16, l15, true, par{j6^0 -> (1 + j6^0)}>
23.28/23.36	<l7, l10, true>
23.28/23.36	<l17, l16, true>
23.28/23.36	<l17, l15, true>
23.28/23.36	<l17, l16, true>
23.28/23.36	<l12, l14, (undef183 = (0 + j6^0)) /\ (undef184 = undef184), par{j^0 -> (0 + undef183), ret_check8^0 -> undef183, tmp^0 -> undef184}>
23.28/23.36	<l12, l17, true>
23.28/23.36	<l2, l11, ((1 + i^0) <= 0), par{j6^0 -> (0 + j^0)}>
23.28/23.36	<l2, l5, (0 <= (0 + i^0))>
23.28/23.36	<l18, l3, true, par{i^0 -> 0}>
23.28/23.36	<l19, l18, true>
23.28/23.36	
23.28/23.36	Fresh variables:
23.28/23.36	undef78, undef183, undef184, 
23.28/23.36	
23.28/23.36	Undef variables:
23.28/23.36	undef78, undef183, undef184, 
23.28/23.36	
23.28/23.36	Abstraction variables:
23.28/23.36	
23.28/23.36	Exit nodes:
23.28/23.36	
23.28/23.36	Accepting locations:
23.28/23.36	
23.28/23.36	Asserts:
23.28/23.36	
23.28/23.36	Preprocessed LLVMGraph
23.28/23.36	Init Location: 0
23.28/23.36	Transitions:
23.28/23.36	<l0, l3, (i^0 = 0)>
23.28/23.36	<l3, l11, ((0 + __const_100^0) <= (0 + i^0)) /\ ((1 + i^0) <= 0), par{j6^0 -> (0 + (~(2) + i^0))}>
23.28/23.36	<l3, l5, ((0 + __const_100^0) <= (0 + i^0)) /\ (0 <= (0 + i^0))>
23.28/23.36	<l3, l3, ((1 + i^0) <= (0 + __const_100^0)), par{i^0 -> (1 + i^0)}>
23.28/23.36	<l7, l5, (undef78 = (0 + j10^0))>
23.28/23.36	<l7, l7, true, par{j10^0 -> (1 + j10^0)}>
23.28/23.36	<l7, l7, true>
23.28/23.36	<l7, l7, true, par{j10^0 -> (1 + j10^0)}>
23.28/23.36	<l11, l7, (undef183 = (0 + j6^0)) /\ (undef184 = undef184), par{j10^0 -> (0 + (0 + undef183))}>
23.28/23.36	<l11, l5, (undef183 = (0 + j6^0)) /\ (undef184 = undef184)>
23.28/23.36	<l11, l7, (undef183 = (0 + j6^0)) /\ (undef184 = undef184), par{j10^0 -> (0 + (0 + undef183))}>
23.28/23.36	<l11, l11, true, par{j6^0 -> (1 + j6^0)}>
23.28/23.36	<l11, l11, true>
23.28/23.36	<l11, l11, true, par{j6^0 -> (1 + j6^0)}>
23.28/23.36	
23.28/23.36	Fresh variables:
23.28/23.36	undef78, undef183, undef184, 
23.28/23.36	
23.28/23.36	Undef variables:
23.28/23.36	undef78, undef183, undef184, 
23.28/23.36	
23.28/23.36	Abstraction variables:
23.28/23.36	
23.28/23.36	Exit nodes:
23.28/23.36	
23.28/23.36	Accepting locations:
23.28/23.36	
23.28/23.36	Asserts:
23.28/23.36	
23.28/23.36	*************************************************************
23.28/23.36	*******************************************************************************************
23.28/23.36	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.28/23.36	*******************************************************************************************
23.28/23.36	
23.28/23.36	Init Location: 0
23.28/23.36	Graph 0:
23.28/23.36	Transitions:
23.28/23.36	Variables:
23.28/23.36	
23.28/23.36	Graph 1:
23.28/23.36	Transitions:
23.28/23.36	<l3, l3, 1 + i^0 <= __const_100^0, {i^0 -> 1 + i^0, rest remain the same}>
23.28/23.36	Variables:
23.28/23.36	__const_100^0, i^0
23.28/23.36	
23.28/23.36	Graph 2:
23.28/23.36	Transitions:
23.28/23.36	<l11, l11, true, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	<l11, l11, true, {all remain the same}>
23.28/23.36	<l11, l11, true, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Variables:
23.28/23.36	j6^0
23.28/23.36	
23.28/23.36	Graph 3:
23.28/23.36	Transitions:
23.28/23.36	<l7, l7, true, {j10^0 -> 1 + j10^0, rest remain the same}>
23.28/23.36	<l7, l7, true, {all remain the same}>
23.28/23.36	<l7, l7, true, {j10^0 -> 1 + j10^0, rest remain the same}>
23.28/23.36	Variables:
23.28/23.36	j10^0
23.28/23.36	
23.28/23.36	Graph 4:
23.28/23.36	Transitions:
23.28/23.36	Variables:
23.28/23.36	
23.28/23.36	Precedence: 
23.28/23.36	Graph 0
23.28/23.36	
23.28/23.36	Graph 1
23.28/23.36	<l0, l3, i^0 = 0, {all remain the same}>
23.28/23.36	
23.28/23.36	Graph 2
23.28/23.36	<l3, l11, __const_100^0 <= i^0 /\ 1 + i^0 <= 0, {j6^0 -> -2 + i^0, rest remain the same}>
23.28/23.36	
23.28/23.36	Graph 3
23.28/23.36	<l11, l7, j6^0 = undef183, {j10^0 -> undef183, rest remain the same}>
23.28/23.36	<l11, l7, j6^0 = undef183, {j10^0 -> undef183, rest remain the same}>
23.28/23.36	
23.28/23.36	Graph 4
23.28/23.36	<l3, l5, __const_100^0 <= i^0 /\ 0 <= i^0, {all remain the same}>
23.28/23.36	<l7, l5, j10^0 = undef78, {all remain the same}>
23.28/23.36	<l11, l5, j6^0 = undef183, {all remain the same}>
23.28/23.36	
23.28/23.36	Map Locations to Subgraph:
23.28/23.36	( 0 , 0 )
23.28/23.36	( 3 , 1 )
23.28/23.36	( 5 , 4 )
23.28/23.36	( 7 , 3 )
23.28/23.36	( 11 , 2 )
23.28/23.36	
23.28/23.36	*******************************************************************************************
23.28/23.36	********************************    CHECKING ASSERTIONS    ********************************
23.28/23.36	*******************************************************************************************
23.28/23.36	
23.28/23.36	Proving termination of subgraph 0
23.28/23.36	Proving termination of subgraph 1
23.28/23.36	Checking unfeasibility...
23.28/23.36	Time used: 0.001842
23.28/23.36	
23.28/23.36	Checking conditional termination of SCC {l3}...
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.000855s
23.28/23.36	Ranking function: -1 + __const_100^0 - i^0
23.28/23.36	New Graphs: 
23.28/23.36	Proving termination of subgraph 2
23.28/23.36	Checking unfeasibility...
23.28/23.36	Time used: 0.004016
23.28/23.36	
23.28/23.36	Checking conditional termination of SCC {l11}...
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.000639s
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.001153s
23.28/23.36	Trying to remove transition: <l11, l11, true, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005750s
23.28/23.36	Time used: 0.00564
23.28/23.36	Trying to remove transition: <l11, l11, true, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005278s
23.28/23.36	Time used: 0.004911
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.040114s
23.28/23.36	Time used: 4.0396
23.28/23.36	Solving with 2 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006575s
23.28/23.36	Time used: 4.00114
23.28/23.36	Solving with 3 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017616s
23.28/23.36	Time used: 1.00069
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021600s
23.28/23.36	Time used: 0.011668
23.28/23.36	Improving Solution with cost 1 ...
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetNextSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.021237s
23.28/23.36	Time used: 1.02128
23.28/23.36	
23.28/23.36	LOG: SAT solveNonLinear - Elapsed time: 1.042838s
23.28/23.36	Cost: 1; Total time: 1.03295
23.28/23.36	Quasi-ranking function: 50000 - j6^0
23.28/23.36	New Graphs: 
23.28/23.36	Transitions:
23.28/23.36	<l11, l11, 50001 <= j6^0, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	<l11, l11, true, {all remain the same}>
23.28/23.36	<l11, l11, 50001 <= j6^0, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Variables:
23.28/23.36	j6^0
23.28/23.36	Checking conditional termination of SCC {l11}...
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.000698s
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.003363s
23.28/23.36	Trying to remove transition: <l11, l11, 50001 <= j6^0, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007555s
23.28/23.36	Time used: 0.007406
23.28/23.36	Trying to remove transition: <l11, l11, 50001 <= j6^0, {j6^0 -> 1 + j6^0, rest remain the same}>
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007935s
23.28/23.36	Time used: 0.007409
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002275s
23.28/23.36	Time used: 4.00165
23.28/23.36	Solving with 2 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.043843s
23.28/23.36	Time used: 4.00152
23.28/23.36	Solving with 3 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017829s
23.28/23.36	Time used: 1.00074
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012705s
23.28/23.36	Time used: 4.00293
23.28/23.36	Termination failed. Trying to show unreachability...
23.28/23.36	Proving unreachability of entry: <l3, l11, __const_100^0 <= i^0 /\ 1 + i^0 <= 0, {j6^0 -> -2 + i^0, rest remain the same}>
23.28/23.36	
23.28/23.36	LOG: CALL check - Post:1 <= 0 - Process 1
23.28/23.36	* Exit transition: <l3, l11, __const_100^0 <= i^0 /\ 1 + i^0 <= 0, {j6^0 -> -2 + i^0, rest remain the same}>
23.28/23.36	* Postcondition  : 1 <= 0
23.28/23.36	Postcodition moved up: 1 <= 0
23.28/23.36	
23.28/23.36	LOG: Try proving POST
23.28/23.36	Postcondition: 1 <= 0
23.28/23.36	
23.28/23.36	LOG: CALL check - Post:1 <= 0 - Process 2
23.28/23.36	* Exit transition: <l0, l3, i^0 = 0, {all remain the same}>
23.28/23.36	* Postcondition  : 1 <= 0
23.28/23.36	
23.28/23.36	LOG: CALL solveLinear
23.28/23.36	
23.28/23.36	LOG: RETURN solveLinear - Elapsed time: 0.000542s
23.28/23.36	> Postcondition is not implied!
23.28/23.36	
23.28/23.36	LOG: RETURN check - Elapsed time: 0.000617s
23.28/23.36	
23.28/23.36	LOG: NarrowEntry size 1
23.28/23.36	Narrowing transition: 
23.28/23.36	<l3, l3, 1 + i^0 <= __const_100^0, {i^0 -> 1 + i^0, rest remain the same}>
23.28/23.36	
23.28/23.36	LOG: Narrow transition size 1
23.28/23.36	ENTRIES:
23.28/23.36	<l0, l3, 0 <= 0 /\ i^0 = 0, {all remain the same}>
23.28/23.36	END ENTRIES:
23.28/23.36	GRAPH:
23.28/23.36	<l3, l3, 0 <= 0 /\ 1 + i^0 <= __const_100^0, {i^0 -> 1 + i^0, rest remain the same}>
23.28/23.36	END GRAPH:
23.28/23.36	EXIT: <l3, l11, __const_100^0 <= i^0 /\ 1 + i^0 <= 0, {j6^0 -> -2 + i^0, rest remain the same}>
23.28/23.36	POST: 1 <= 0
23.28/23.36	
23.28/23.36	
23.28/23.36	LOG: Try proving POST
23.28/23.36	Solving with 1 template(s).
23.28/23.36	
23.28/23.36	LOG: CALL solveNonLinearGetFirstSolution
23.28/23.36	
23.28/23.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006089s
23.28/23.36	Time used: 0.005969
23.28/23.36	
23.28/23.36	LOG: SAT solveNonLinear - Elapsed time: 0.006089s
23.28/23.36	Cost: 0; Total time: 0.005969
23.28/23.36	Postcondition implied by a set of invariant(s):
23.28/23.36	Invariant at l3: 0 <= i^0
23.28/23.36	
23.28/23.36	LOG: Postcondition implied
23.28/23.36	> Postcondition implied!
23.28/23.36	
23.28/23.36	LOG: RETURN check - Elapsed time: 0.018148s
23.28/23.36	It is unreachable
23.28/23.36	Location 11 unreachable!
23.28/23.36	> It's unfeasible. Removing transition: 
23.28/23.36	<l11, l7, j6^0 = undef183, {j10^0 -> undef183, rest remain the same}>
23.28/23.36	> It's unfeasible. Removing transition: 
23.28/23.36	<l11, l7, j6^0 = undef183, {j10^0 -> undef183, rest remain the same}>
23.28/23.36	Location 7 unreachable!
23.28/23.36	> It's unfeasible. Removing transition: 
23.28/23.36	<l7, l5, j10^0 = undef78, {all remain the same}>
23.28/23.36	> It's unfeasible. Removing transition: 
23.28/23.36	<l11, l5, j6^0 = undef183, {all remain the same}>
23.28/23.36	Proving termination of subgraph 4
23.28/23.36	Analyzing SCC {l5}...
23.28/23.36	No cycles found.
23.28/23.36	
23.28/23.36	Program Terminates
23.28/23.36	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.28/23.36	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.28/23.36	EOF